added
string | created
timestamp[s] | id
string | metadata
dict | source
string | text
string |
|---|---|---|---|---|---|
2024-11-18T17:59:32.302108+00:00 | 2022-02-17T02:51:14 | 4058a41e892e702a091856e0213a93c5dcbed14e | {
"blob_id": "4058a41e892e702a091856e0213a93c5dcbed14e",
"branch_name": "refs/heads/master",
"committer_date": "2022-02-17T02:51:14",
"content_id": "369b25fd97af846b1049ae910a57f936e65bbaea",
"detected_licenses": [
"MIT"
],
"directory_id": "38f1f88683f707c076c56408edf0d66a8829fb36",
"extension": "html",
"filename": "howtouse.html",
"fork_events_count": 0,
"gha_created_at": "2018-03-29T21:11:02",
"gha_event_created_at": "2020-11-03T23:03:32",
"gha_language": "HTML",
"gha_license_id": "MIT",
"github_id": 127347788,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 15689,
"license": "MIT",
"license_type": "permissive",
"path": "/frontend/docs/html/howtouse.html",
"provenance": "stackv2_html-0000.json.gz:1",
"repo_name": "mikewong-sfsu/GeneDive",
"revision_date": "2022-02-17T02:51:14",
"revision_id": "d2f11eb9f1bf63c9e494f5039b098536f9d5aa96",
"snapshot_id": "3163cbf1753e9a8d59fc4b83bc31eae138c8da14",
"src_encoding": "UTF-8",
"star_events_count": 1,
"url": "https://raw.githubusercontent.com/mikewong-sfsu/GeneDive/d2f11eb9f1bf63c9e494f5039b098536f9d5aa96/frontend/docs/html/howtouse.html",
"visit_date": "2022-03-01T03:36:15.275163"
} | stackv2 | |
GeneDive
|
This documentation is geared towards scientists who intend to use GeneDive for their research purposes.
GeneDive is a web application designed to allow easy lookup, visualization, and exporting of gene, chemical, and disease relationships. The relationships are probabilities based on how closely they are connected grammatically in articles from PLOS One, PLOS Biology, and PLOS Genetics.
GeneDive is a collaborative project between the San Francisco State University Department of Computer Science and Stanford Bioengineering.
To register for the site, click Register on the front page and fill out the appropriate forms. You will then be able to login with your information, and be redirected to the search page.
When you successfully login, you will be presented with a large area in the center-right of the screen for results, along with a search and filter panel on the right side. We will first go over the features of the panel from top to bottom.
GeneDive title
A link that takes you back to the login page.
Undo and Redo
These buttons allow you to undo and redo your actions on the site. If there is no action to undo or redo, the buttons will be disabled. This is a valuable tool since you can do expiromentation with the system, then click undo or redo at any time.
1-Hop, 2-Hop, 3-Hop, Clique
The four choices, 1-Hop, 2-Hop, 3-Hop, and Clique will determine how a search is conducted for the DGRs that a user enters.
1-Hop: This will search for results that are directly interacting with one another. If 1 item is selected, then all direct interactions with that one item will be presented. If more than one item is selected, then only direct interactions with those items will be shown. 2-Hop: This search will present results whom mutually interact with the same items. The intermediates will be highlighted in orange. This requires more than 1 item to be specified. 3-Hop: This search will present results whom's direct interactions mutually interact with each other. The intermediates will be highlighted in orange. This requires more than 1 item to be specified. Clique: Similar to 1-Hop, except only the results that are 1 jump away from the search that are related to one another will be presented. You are limited to one item at a time when in this search mode.
Search Bar
This will accept any string input. Upon typing in your query, GeneDive will lookup the query amongst Genes, Chemicals, Diseases, and Genesets, and present the findings below the search field, which you can either click on or use the arrow keys and hit enter to select.
More than one item can be selected from the list, but only if you are choosing 1, 2, or 3-Hops. Clique does not support mulitple item selection.
Minimum Confidence
This option allows you to choose the threshold for the confidence of gene interactions. By default, new searches start at 0.7 to present the user with a decent selection of results. Lowering this value will present more results, but will increase increase waiting time as more data has to be retrieved from the server and processed locally. Increasing this value will give better results.
The Confidence Cutoffs can be clicked to set the Minimum Confidence with the following values: Low 0.7 | Medium 0.85 | High: 0.95
Tip: If it's taking a long time to load the results, you may change the confidence level, DGRs, or Hop/Clique selection to stop the current search and start a new one.
Filtering
You can further filter results down by Article, Exerpt, Gene, Journal, and Section. Upon adding an "is" filter, all results not containing the filter will be hidden. If you add a "not" filter, any results matching the filter's value will be hidden.
Highlight Rows
When you enter strings in here, any results that contain that contain that value in their data will be highlighted in the table view. Edges will also be highlighted in the graph view.
Group Table Results By
The Interactions are grouped by unique DGR interactions by default. Clicking on group by Article will group the interactions by Article instead.
Download Results
This allows you to save the following: State history (undo, redo), a picture of the graph as it currently is, the results table in csv format, the terms and conditions, and a custom README file containing a note that you specify when you click Download Results. All this data will be stored in a zip file with its name containing the current timestamp.
Upload Results
If you upload the zip file you downloaded from Download Results, the website will be restored to the exact state that it was when that file was downloaded. The website will also have the state history, allowing you to click undo and redo if applicable.
The majority of screen space is taken up in the middle by the results. On the top is a table of the results, and the bottom a graph.
Grouped Results Table The results here are grouped by DGR interactions by default. You can group them by article interactions by clicking on Articles at the bottom of the Search area, under Group Table Results By. You can sort the table by clicking the small, black arrows next to each field header. If there is only one visible arrow, then the table is sorted by that column. Down arrow means descending, up arrow means ascending.
TIP: You can sort by multiple rows by holding shift when click on the headers.
Detailed Results Table
Clicking on a table row will present you with all the interactions of that group. The columns have the same meaning as in the Grouped Results Table, except for the following.
To go back to the grouped results, click the Back button at the top right.
The graph below the table presents a visual representation of the DGR interactions. The thickness of an edge represents how many interactions between the DGR there are in the articles. The color of the node corresponds to the colors of the search items, located under the search bar.
The graph can also be visually modified in a number of ways, along with being used to alter your search parameters. |
2024-11-18T17:59:32.303550+00:00 | 2021-10-24T16:39:04 | 9daa4599acb80093c785dd4d5bf303c86a2d7dbf | {
"blob_id": "9daa4599acb80093c785dd4d5bf303c86a2d7dbf",
"branch_name": "refs/heads/main",
"committer_date": "2021-10-24T16:39:04",
"content_id": "5c9b5c9baf8175e79e1ee6c8bcb4da415946e280",
"detected_licenses": [
"MIT"
],
"directory_id": "3d648619e31cf4217a6cb5ef91eb9e6f7e1fe4aa",
"extension": "html",
"filename": "pricing.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 367088838,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 11406,
"license": "MIT",
"license_type": "permissive",
"path": "/pricing.html",
"provenance": "stackv2_html-0000.json.gz:2",
"repo_name": "valazeinali/vanir.github.io",
"revision_date": "2021-10-24T16:39:04",
"revision_id": "39205805e3d9119fb6d5df08cf977da8cbf129a4",
"snapshot_id": "bb1fa5df1b07f2c9f74a72b2c25905d20eaa94d2",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/valazeinali/vanir.github.io/39205805e3d9119fb6d5df08cf977da8cbf129a4/pricing.html",
"visit_date": "2023-08-28T11:04:52.911181"
} | stackv2 | Pricing Plan
Vanir Pricing Outcomes
- Investing
- Rebalancing
- Custom Portfolios
- Education (Free for all)
- Everything in Vanir Starter
- Net Worth Projection
- Roth IRA or Traditional
- Punch-Card Lottery
- Everything in Vanir Normal
- 2x Punch-Card Lottery
- Access to portfolio margin
- Personalized Retirement Advice |
2024-11-18T17:59:32.305747+00:00 | 2022-04-22T20:05:10 | cce122f63df94180a380707a8a8da2120caebecd | {
"blob_id": "cce122f63df94180a380707a8a8da2120caebecd",
"branch_name": "refs/heads/master",
"committer_date": "2022-04-22T20:05:10",
"content_id": "75b437ce8192ffd976ee102caa81dd7bb588bd22",
"detected_licenses": [
"MIT"
],
"directory_id": "862bee845b055a3cfb7c0ab5ac1c277ed35f438f",
"extension": "html",
"filename": "TeamsHalf.html",
"fork_events_count": 2,
"gha_created_at": "2019-09-01T21:31:43",
"gha_event_created_at": "2020-11-02T21:31:19",
"gha_language": "HTML",
"gha_license_id": null,
"github_id": 205734717,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 2104,
"license": "MIT",
"license_type": "permissive",
"path": "/library/Lahman/html/TeamsHalf.html",
"provenance": "stackv2_html-0000.json.gz:3",
"repo_name": "mayousif/Turbidity-Cleaner",
"revision_date": "2022-04-22T20:05:10",
"revision_id": "e756d9359f1215a4c9e6ad993eaccbc3fb6fe924",
"snapshot_id": "a4862f54ca47305cfa47d6fcfa048e1573d6a2b7",
"src_encoding": "UTF-8",
"star_events_count": 2,
"url": "https://raw.githubusercontent.com/mayousif/Turbidity-Cleaner/e756d9359f1215a4c9e6ad993eaccbc3fb6fe924/library/Lahman/html/TeamsHalf.html",
"visit_date": "2022-05-09T07:32:55.856365"
} | stackv2 | | TeamsHalf {Lahman} | R Documentation |
Split season data for teams
data(TeamsHalf)
A data frame with 52 observations on the following 10 variables.
yearID
Year
lgID
League; a factor with levels AL
NL
teamID
Team; a factor
Half
First or second half of season
divID
Division
DivWin
Won Division (Y or N)
Rank
Team's position in standings for the half
G
Games played
W
Wins
L
Losses
Lahman, S. (2021) Lahman's Baseball Database, 1871-2020, 2020 version, http://www.seanlahman.com/baseball-archive/statistics/
# 1981 season team data split into half seasons data(TeamsHalf) library("dplyr") # List standings with winning percentages by # season half, league and division TeamsHalf %>% group_by(Half, lgID, divID) %>% mutate(WinPct = round(W/G, 3)) %>% arrange(Half, lgID, divID, Rank) %>% select(Half, lgID, divID, Rank, teamID, WinPct) |
2024-11-18T17:59:32.309554+00:00 | 2017-09-07T17:53:40 | 55135af4605fd3496fe8e190e4817338add789fc | {
"blob_id": "55135af4605fd3496fe8e190e4817338add789fc",
"branch_name": "refs/heads/master",
"committer_date": "2017-09-07T17:53:40",
"content_id": "b122321df29b025c6eeed005ff12bca1b1e9a3f1",
"detected_licenses": [
"MIT"
],
"directory_id": "4f53a8b719f0b3cbc21e5599999baed9dec6544e",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 102767605,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 685,
"license": "MIT",
"license_type": "permissive",
"path": "/index.html",
"provenance": "stackv2_html-0000.json.gz:4",
"repo_name": "macengr/FCC_ProdPage",
"revision_date": "2017-09-07T17:53:40",
"revision_id": "b8d1b48bd285c4838e1929a4100206db65c9053a",
"snapshot_id": "25e66727878fa0dfb705d048bb79eefbe02d9d2c",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/macengr/FCC_ProdPage/b8d1b48bd285c4838e1929a4100206db65c9053a/index.html",
"visit_date": "2021-01-23T17:35:18.094728"
} | stackv2 | Hello How Are you
This is soon to become a sample product landing page built only with CSS and HTML, and using Bootstrap as a framework. |
2024-11-18T17:59:32.312960+00:00 | 2019-12-02T23:58:02 | 3d034010773e2eb71b22f892a40afd6c33ce3cd1 | {
"blob_id": "3d034010773e2eb71b22f892a40afd6c33ce3cd1",
"branch_name": "refs/heads/master",
"committer_date": "2019-12-02T23:58:02",
"content_id": "cd8c85a2c29179488eed72e325eb5403d64f6ea3",
"detected_licenses": [
"MIT"
],
"directory_id": "2e83864a44aac24cff8c37ea35ebced1eebe7fe6",
"extension": "html",
"filename": "default.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 208929213,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 7016,
"license": "MIT",
"license_type": "permissive",
"path": "/_layouts/default.html",
"provenance": "stackv2_html-0000.json.gz:5",
"repo_name": "Haoran-Lin/Haoran-Lin.github.io",
"revision_date": "2019-12-02T23:58:02",
"revision_id": "81e1826b91f642d98f62405394094a7658e6d0c0",
"snapshot_id": "156cf6057bc12bf6a82c41613d9f0a6de1ba1c25",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/Haoran-Lin/Haoran-Lin.github.io/81e1826b91f642d98f62405394094a7658e6d0c0/_layouts/default.html",
"visit_date": "2020-09-08T09:32:18.790565"
} | stackv2 | About me
Hi, I'm Haoran, a User Experience Designer, you can also call me Eddie. I'm currently studying at Wilfrid Laurier University, and I have been studying UX for 2 years. What really makes me want to become a UXer is the world around us, especially back home in China. There are a lot of things and design product in our lives that just doesn't make sense and feel strange to use. I want to improve some elements around us and make things feel more pleasant for users. UX is a very interesting field overall, I would encourage more students who wants to improve things around us to join our UX program.
My Portfolio
{% endif %}
{{ current.title }}
{{ post.title }}
My Angle
Pen Tool And Me: There is always some interesting process in learning different skills, testing my skills with various things, even myself, be creative and try things out, alwasy step outside of own's confort-zone, explore more things to understand self in a better way.
Burger Chef Animated Ad: It is my first time using multiple design software to create a animated GIF ad, group skill and communication skill are very important in this project, as a designer, communication skills and abilities are necessary, but also to be able to endure loneliness and boredom.
Icon Set: Creative inspiration and thinking are essential skills of a UX designer. Good work must have a complete and unique thinking behind it. In the process of making ICONS, I have been trying to figure out how to change one icon into four different styles, which tested my independent thinking ability, and apply the concept into life, always looking for a better change.
Photoshop Assignment: Colour is very important in the design work, it can bring the viewer the most intuitive impact in the first time. Colours are nou just important to designers, but also to everyone else. Colors stand for one's attitude, emotion and passion, live your life in different styles. |
2024-11-18T17:59:32.323041+00:00 | 2012-09-10T20:06:30 | c3801aa63b49b89711357a846729b28c6539f353 | {
"blob_id": "c3801aa63b49b89711357a846729b28c6539f353",
"branch_name": "refs/heads/master",
"committer_date": "2012-09-10T20:06:30",
"content_id": "8b27b016d3700dc237349b2900d8def472758a29",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "9f20dcfff04522bc4cd7edaa3687169276ebdcb2",
"extension": "html",
"filename": "quizRaw.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": null,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 73334,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/problem-sets/quizzes/Text-Processing-And-Edit-Distance/quizRaw.html",
"provenance": "stackv2_html-0000.json.gz:6",
"repo_name": "gootyfer/class2go",
"revision_date": "2012-09-10T20:06:30",
"revision_id": "6a4da70aaf4e61de2a258f9a5a3cef67d782d736",
"snapshot_id": "df37b3d19e91055c8691f49193403c60dd90966d",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/gootyfer/class2go/6a4da70aaf4e61de2a258f9a5a3cef67d782d736/problem-sets/quizzes/Text-Processing-And-Edit-Distance/quizRaw.html",
"visit_date": "2021-01-15T19:05:04.944129"
} | stackv2 | Skip Navigation
Coursera
Beta
Jason Bau
Preferences
All Courses
Admin
Support
I18N Editor
About
Contact Us
Logout
Dan Jurafsky,
Professor of Linguistics
Chris Manning,
Associate Professor of Computer Science
Administration
General
Course Settings
Deployment & Staging
Grading Policy
Navigation Bar Settings
Announcement Management
Content Management
Quiz Management
Assignment Management
Lecture Management
Section Management
Upcoming Items Display
Platform Services
Asset Administration
Forum Administration
Email Users
Advanced Tools
Queue Administration
Chronos
Log Viewer
User Administration
Import Tools
Assignment Submissions
Export Tools
Quiz Summary
Detailed Quiz Responses
Assignment Submissions
Class Gradebook
Status Monitoring
Activity Tracking
Export Statistics
Video Status
<quiz> <metadata> <title>Text Processing and Edit Distance</title> <open_time>2012-03-04 0101</open_time> <soft_close_time>2012-03-27 2359</soft_close_time> <hard_close_time>2012-05-22 2359</hard_close_time> <duration>0</duration> <retry_delay>10</retry_delay> <maximum_submissions>5</maximum_submissions> <modified_time>1335394035880</modified_time> <parameters> <show_explanations> <question>after_hard_close_time</question> <option>before_soft_close_time</option> <score>before_soft_close_time</score> </show_explanations> </parameters> <maximum_score>5</maximum_score> </metadata> <preamble><![CDATA[]]></preamble> <data> <question_groups> <question_group select="1"> <preamble><![CDATA[]]></preamble> <question id="a35e67bd49080cc9f5aeb5aec91b0dcd" type="GS_Choice_Answer_Question"> <metadata> <parameters> <rescale_score>1</rescale_score> <choice_type>radio</choice_type> </parameters> </metadata> <data> <text><![CDATA[Which of the following strings doesn't match the regex: <br><br><code>/[a-z]+'[a-z]+/</code>]]></text> <explanation><![CDATA[Question explanation]]></explanation> <option_groups randomize="true"> <option_group select="3"> <option id="7fe1ff03d7de4c86809490734c1f7502" selected_score="0" unselected_score="0"> <text><![CDATA[he'd]]></text> <explanation><![CDATA[This answer is matched because it is all lower-case, and contains alphabetical characters on each side of a single apostrophe.]]></explanation> </option> <option id="d9ec153ffdda8b0ad8a4203db9064517" selected_score="0" unselected_score="0"> <text><![CDATA[it's]]></text> <explanation><![CDATA[This answer is matched because it is all lower-case, and contains alphabetical characters on each side of a single apostrophe.]]></explanation> </option> <option id="b41ad88bb85117cdca66b1849caa6c98" selected_score="0" unselected_score="0"> <text><![CDATA[cat's]]></text> <explanation><![CDATA[This answer is matched because it is all lower-case, and contains alphabetical characters on each side of a single apostrophe.]]></explanation> </option> <option id="87b1a9b98703945d39ca82211f0e4ba0" selected_score="0" unselected_score="0"> <text><![CDATA[isn't]]></text> <explanation><![CDATA[This answer is matched because it is all lower-case, and contains alphabetical characters on each side of a single apostrophe.]]></explanation> </option> <option id="a3809f6b32483cec73d7b6236afa28fa" selected_score="0" unselected_score="0"> <text><![CDATA[won't]]></text> <explanation><![CDATA[This answer is matched because it is all lower-case, and contains alphabetical characters on each side of a single apostrophe.]]></explanation> </option> <option id="064fc376316d4892746cbdaa842cc009" selected_score="0" unselected_score="0"> <text><![CDATA[oughtn't]]></text> <explanation><![CDATA[This answer is matched because it is all lower-case, and contains alphabetical characters on each side of a single apostrophe.]]></explanation> </option> <option id="f1601373696b906a5059f0ed59b3fa68" selected_score="0" unselected_score="0"> <text><![CDATA[shan't]]></text> <explanation><![CDATA[This answer is matched because it is all lower-case, and contains alphabetical characters on each side of a single apostrophe.]]></explanation> </option> <option id="a53510a7d9cbd83d58c672a158f6e0fb" selected_score="0" unselected_score="0"> <text><![CDATA[mightn't]]></text> <explanation><![CDATA[This answer is matched because it is all lower-case, and contains alphabetical characters on each side of a single apostrophe.]]></explanation> </option> <option id="816dfe114d12f55aa2dd01849aa466cc" selected_score="0" unselected_score="0"> <text><![CDATA[we're]]></text> <explanation><![CDATA[This answer is matched because it is all lower-case, and contains alphabetical characters on each side of a single apostrophe.]]></explanation> </option> </option_group> <option_group select="1"> <option id="cd2d24c2d049e0f8bc7f68b96cfe3b8e" selected_score="1" unselected_score="0"> <text><![CDATA[you'd've]]></text> <explanation><![CDATA[Correct]]></explanation> </option> <option id="6476a32349d46d7023e77fe3084cc850" selected_score="1" unselected_score="0"> <text><![CDATA[We'd]]></text> <explanation><![CDATA[Correct]]></explanation> </option> <option id="f6a61c89dce2b1a4665b9c3b18e604db" selected_score="1" unselected_score="0"> <text><![CDATA[rock 'n' roll]]></text> <explanation><![CDATA[Correct]]></explanation> </option> <option id="30e44f3b747c69bea1d5f57ac8e8bc1c" selected_score="1" unselected_score="0"> <text><![CDATA['tis]]></text> <explanation><![CDATA[Correct]]></explanation> </option> <option id="a7ea8106a1785d5dc304ef89096f6a49" selected_score="1" unselected_score="0"> <text><![CDATA[I'm]]></text> <explanation><![CDATA[Correct]]></explanation> </option> </option_group> </option_groups> </data> </question> </question_group> <question_group select="1"> <preamble><![CDATA[]]></preamble> <question id="02cf8f5f55165a2b0b66c84530a34bd3" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>regexp</type> </parameters> </metadata> <data> <text><![CDATA[Download either the Java or Python implementations of the porter stemmer from:<br> <br> <a href="http://tartarus.org/martin/PorterStemmer/">http://tartarus.org/martin/PorterStemmer/</a><br> <br> Any implementation should work, but only Python and Java have been tested. Stem the following excerpt from Wikipedia:<br> <br> <pre> In linguistic morphology and information retrieval, stemming is the process for reducing inflected words to their stem, base or root form-generally a written word form. The stem need not be identical to the morphological root of the word; it is usually sufficient that related words map to the same stem, even if this stem is not in itself a valid root. Algorithms for stemming have been studied in computer science since 1968. Many search engines treat words with the same stem as synonyms as a kind of query broadening, a process called conflation. </pre> Feel free to download a raw text file of the excerpt <a href="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/stem.txt">here</a>.]]></text> <explanation><![CDATA[To use the java file:<br> <br> <pre> $ wget http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/stem.txt $ wget http://tartarus.org/martin/PorterStemmer/java.txt $ mv java.txt Porter.java $ javac Porter.java $ java Porter stem.txt > stem.stemmed.txt $ cat stem.stemmed.txt </pre> to use the python version:<br> <br> <pre> $ wget http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/stem.txt $ wget http://tartarus.org/martin/PorterStemmer/python.txt $ mv python.txt porter.py $ python porter.py stem.txt > stem.stemmed.txt $ cat stem.stemmed.txt </pre>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="f65157f32c3f09db10b3c94c7d01681e" selected_score="1" unselected_score="0"> <text><![CDATA[/in linguist morpholog and inform retriev, stem is the process for reduc inflect word to their stem, base or root form-gener a written word form. the stem need not be ident to the morpholog root of the word; it is usual suffici that relat word map to the same stem, even if thi stem is not in itself a valid root. algorithm for stem have been studi in comput scienc sinc 1968. mani search engin treat word with the same stem as synonym as a kind of queri broaden, a process call conflat./]]></text> <explanation><![CDATA[Correct!]]></explanation> </option> </option_group> </option_groups> </data> </question> </question_group> <question_group select="1"> <preamble><![CDATA[]]></preamble> <question id="7e2c59f72c36fa5a12ca95dd59d6e08c" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[A simple way to tokenize a document is to split on any non-alphabetical character. However, this sometimes has the undesirable consequence of removing any numerical information. Use the unix command line utilities to find the number of tokens in the following excerpt from a Wikipedia article on Astronomical Units (AUs), splitting on all non-alpha-<b>numerical</b> characters:<br> <br> <pre> The AU was originally defined as the length of the semi-major axis of the Earth's elliptical orbit around the Sun. In 1976 the International Astronomical Union revised the definition of the AU for greater precision, defining it as that length for which the Gaussian gravitational constant (k) takes the value 0.017 202 098 95 when the units of measurement are the astronomical units of length, mass and time.[5][6][7] An equivalent definition is the radius of an unperturbed circular Newtonian orbit about the Sun of a particle having infinitesimal mass, moving with an angular frequency of 0.017 202 098 95 radians per day,[2] or that length for which the heliocentric gravitational constant (the product GM) is equal to (0.017 202 098 95)2 AU3/d2. It is approximately equal to the mean Earth-Sun distance. </pre> Feel free to download a raw text file of the excerpt <a href="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/au.txt">here</a>. <br> <br> Take special care to avoid treating two consecutive non-alpha-numerical characters as delimiting an empty token (see the <code>-s</code> flag for <code>tr</code>)]]></text> <explanation><![CDATA[First, download or copy the file: <br><br> <code>$ wget http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/au.txt</code> <br><br> Then, for the BSD version of <code>tr</code> the following code should work:<br> <br> <code>$ tr -sc '[:alnum:]' '\n' < au.txt | wc -l</code> <br> <br> In general the manual page is your best friend for problems like these. At a unix-like command line type:<br><br> <code>$ man NAME-OF-PROGRAM</code>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="da7dbf0c3c2998551742b9b508e1630d" selected_score="1" unselected_score="0"> <text><![CDATA[143]]></text> <explanation><![CDATA[Correct!]]></explanation> </option> <option id="5a29de036b2fa9fb7230a7f3da4cd381" selected_score="0" unselected_score="0"> <text><![CDATA[[0,142]]]></text> <explanation><![CDATA[You should be using the utilities <code>tr</code> and <code>wc</code>. In general the manual page is your best friend for problems like these. At a unix-like command line type:<br><br> <code>$ man NAME-OF-PROGRAM</code>]]></explanation> </option> <option id="4d0f8f85a13c26d91010fc3e2828acf4" selected_score="0" unselected_score="0"> <text><![CDATA[[144,1000]]]></text> <explanation><![CDATA[You should be using the utilities <code>tr</code> and <code>wc</code>. In general the manual page is your best friend for problems like these. At a unix-like command line type:<br><br> <code>$ man NAME-OF-PROGRAM</code>]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="6db81c9a1c6788ef62c7d7b3410bfdae" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[Using simple white-space tokenizing, how many additional word types will we create in the following excerpt, when compared to tokenizing on all non-alphabetical characters?<br> <br> <pre> The AU was originally defined as the length of the semi-major axis of the Earth's elliptical orbit around the Sun. In 1976 the International Astronomical Union revised the definition of the AU for greater precision, defining it as that length for which the Gaussian gravitational constant (k) takes the value 0.017 202 098 95 when the units of measurement are the astronomical units of length, mass and time.[5][6][7] An equivalent definition is the radius of an unperturbed circular Newtonian orbit about the Sun of a particle having infinitesimal mass, moving with an angular frequency of 0.017 202 098 95 radians per day,[2] or that length for which the heliocentric gravitational constant (the product GM) is equal to (0.017 202 098 95)2 AU3/d2. It is approximately equal to the mean Earth-Sun distance. </pre> Feel free to download a raw text file of the excerpt <a href="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/au.txt">here</a>. <br> <br> Take special care to avoid treating two consecutive non-alphabetical characters as delimiting an empty token (see the <code>-s</code> flag for <code>tr</code>)]]></text> <explanation><![CDATA[First, download or copy the file: <br><br> <code>$ wget http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/au.txt</code> <br><br> Then, for the BSD version of <code>tr</code> the following code should work:<br> <br> <code>$ tr -s '[:space:]' '\n' < au.txt | sort | uniq -c | wc -l</code><br> <br> -<br> <br> <code>$ tr -sc '[:alpha:]' '\n' < au.txt | sort | uniq -c | wc -l</code> <br> <br> In general the manual page is your best friend for problems like these. At a unix-like command line type:<br><br> <code>$ man NAME-OF-PROGRAM</code>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="5dd759f0f6d1026ad4bf5fa4f7f2c510" selected_score="1" unselected_score="0"> <text><![CDATA[10]]></text> <explanation><![CDATA[Correct!]]></explanation> </option> <option id="14b70845ffee5389bde26ae256e6abcf" selected_score="0" unselected_score="0"> <text><![CDATA[[11,80]]]></text> <explanation><![CDATA[You should be using the utilities <code>tr</code>, <code>sort</code>, <code>uniq</code> and <code>wc</code>. In general the manual page is your best friend for problems like these. At a unix-like command line type:<br><br> <code>$ man NAME-OF-PROGRAM</code>]]></explanation> </option> <option id="680a26bd7a9bc684a00102635e7dc7d9" selected_score="0" unselected_score="0"> <text><![CDATA[[80,1000]]]></text> <explanation><![CDATA[Remember, you should be entering the difference between the number of unique word types created by two different tokenizing methods. <br><br> You should be using the utilities <code>tr</code>, <code>sort</code>, <code>uniq</code> and <code>wc</code>. In general the manual page is your best friend for problems like these. At a unix-like command line type:<br><br> <code>$ man NAME-OF-PROGRAM</code>]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="8e4da6a97596fde2901405dff150083b" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[First tokenize the following text on all non-alphabetical characters and count the number of unique word types. How many word types disappear if we do case normalization?<br> <br> <pre> The AU was originally defined as the length of the semi-major axis of the Earth's elliptical orbit around the Sun. In 1976 the International Astronomical Union revised the definition of the AU for greater precision, defining it as that length for which the Gaussian gravitational constant (k) takes the value 0.017 202 098 95 when the units of measurement are the astronomical units of length, mass and time.[5][6][7] An equivalent definition is the radius of an unperturbed circular Newtonian orbit about the Sun of a particle having infinitesimal mass, moving with an angular frequency of 0.017 202 098 95 radians per day,[2] or that length for which the heliocentric gravitational constant (the product GM) is equal to (0.017 202 098 95)2 AU3/d2. It is approximately equal to the mean Earth-Sun distance. </pre> Feel free to download a raw text file of the excerpt <a href="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/au.txt">here</a>. <br> <br> Take special care to avoid treating two consecutive non-alphabetical characters as delimiting an empty token (see the <code>-s</code> flag for <code>tr</code>)]]></text> <explanation><![CDATA[First, download or copy the file: <br><br> <code>$ wget http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/au.txt</code> <br><br> Then, for the BSD version of <code>tr</code> the following code should work:<br> <br> <code>$ tr -sc '[:alpha:]' '\n' < au.txt | sort | uniq -c | wc -l</code><br> <br> -<br> <br> <code>$ tr -sc '[:alpha:]' '\n' < au.txt | tr '[:upper:]' '[:lower:]' | sort | uniq -c | wc -l</code> <br> <br> In general the manual page is your best friend for problems like these. At a unix-like command-line type:<br><br> <code>$ man NAME-OF-PROGRAM</code>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="63f29e99f0221c63c81dce9e38308c68" selected_score="1" unselected_score="0"> <text><![CDATA[4]]></text> <explanation><![CDATA[Correct!]]></explanation> </option> <option id="93744aa03ad843238c58ce4aaa430466" selected_score="0" unselected_score="0"> <text><![CDATA[[-1000,0]]]></text> <explanation><![CDATA[Remember, your answer should be the number of word types that disappear, which should be a positive integer. <br><br> You should be using the utilities <code>tr</code>, <code>sort</code>, <code>uniq</code> and <code>wc</code>. In general the manual page is your best friend for problems like these. At a unix-like command line type:<br><br> <code>$ man NAME-OF-PROGRAM</code>]]></explanation> </option> <option id="41f905bec7d2f935fc509b2c1074865f" selected_score="0" unselected_score="0"> <text><![CDATA[[1,3]]]></text> <explanation><![CDATA[You should be using the utilities <code>tr</code>, <code>sort</code>, <code>uniq</code> and <code>wc</code>. In general the manual page is your best friend for problems like these. At a unix-like command line type:<br><br> <code>$ man NAME-OF-PROGRAM</code>]]></explanation> </option> <option id="e667dbd69152fc94c186cb77199e4d8f" selected_score="0" unselected_score="0"> <text><![CDATA[[5,15]]]></text> <explanation><![CDATA[You should be using the utilities <code>tr</code>, <code>sort</code>, <code>uniq</code> and <code>wc</code>. In general the manual page is your best friend for problems like these. At a unix-like command line type:<br><br> <code>$ man NAME-OF-PROGRAM</code>]]></explanation> </option> <option id="8ce10a51f24dc10ce32ce708bdc483fd" selected_score="0" unselected_score="0"> <text><![CDATA[[16,1000]]]></text> <explanation><![CDATA[Remember, you should be entering the difference between the number of unique word types generated by using one method of counting word types and another, not the absolute number of word types <br> <br> You should be using the utilities <code>tr</code>, <code>sort</code>, <code>uniq</code> and <code>wc</code>. In general the manual page is your best friend for problems like these. At a unix-like command line type:<br><br> <code>$ man NAME-OF-PROGRAM</code>]]></explanation> </option> </option_group> </option_groups> </data> </question> </question_group> <question_group select="1"> <preamble><![CDATA[<br> What is the value in the marked cell of the following Levenshtein distance (substitutions cost 2) table below:<br> <br>]]></preamble> <question id="032689b9d45f492afba24f9e0ec35a3f" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[<iframe height="165" width="165" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/barn_question.html"></iframe>]]></text> <explanation><![CDATA[<iframe height="180" width="180" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/barn_answer.html"></iframe>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="8dcb6e617ab455148b8354e848ebeb40" selected_score="1" unselected_score="0"> <text><![CDATA[2]]></text> <explanation><![CDATA[]]></explanation> </option> <option id="074ff4af3d45979b573c8c2068b1fda0" selected_score="0" unselected_score="0"> <text><![CDATA[1]]></text> <explanation><![CDATA[Remember, substitutions cost 0 if the corresponding characters are identical.]]></explanation> </option> <option id="b244f68458897f103daf46e6ce6e032b" selected_score="0" unselected_score="0"> <text><![CDATA[3]]></text> <explanation><![CDATA[Remember, substitutions cost 0 if the corresponding characters are identical.]]></explanation> </option> <option id="af6b87b1190c29f3582ba7420ca3b9b1" selected_score="0" unselected_score="0"> <text><![CDATA[4]]></text> <explanation><![CDATA[Remember, substitutions cost 0 if the corresponding characters are identical.]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="f92ff1beb04096673dac04f298937587" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[<iframe height="190" width="180" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/cone_question.html"></iframe>]]></text> <explanation><![CDATA[<iframe height="200" width="180" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/cone_answer.html"></iframe>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="36aaf96967cfe839b41c7dc15dd68533" selected_score="1" unselected_score="0"> <text><![CDATA[2]]></text> <explanation><![CDATA[]]></explanation> </option> <option id="6f3ad808ea066b3231582ca96cbb401a" selected_score="0" unselected_score="0"> <text><![CDATA[1]]></text> <explanation><![CDATA[Remember, substitutions cost 0 if the corresponding characters are identical.]]></explanation> </option> <option id="58f0ce4226e052621a6134457a02b3b0" selected_score="0" unselected_score="0"> <text><![CDATA[3]]></text> <explanation><![CDATA[Remember, substitutions cost 0 if the corresponding characters are identical.]]></explanation> </option> <option id="30ace6d61683143fa0273349d50e24b3" selected_score="0" unselected_score="0"> <text><![CDATA[4]]></text> <explanation><![CDATA[Remember, substitutions cost 0 if the corresponding characters are identical.]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="d4d8519a2ab5607b5e8588ed4b4e126c" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[<iframe height="170" width="200" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/demure_question.html"></iframe>]]></text> <explanation><![CDATA[<iframe height="180" width="200" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/demure_answer.html"></iframe>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="8d04d542975de404c947742bd7167842" selected_score="1" unselected_score="0"> <text><![CDATA[1]]></text> <explanation><![CDATA[Correct]]></explanation> </option> <option id="ae4ca6138c1d9c864d10a67b72e5167b" selected_score="0" unselected_score="0"> <text><![CDATA[0]]></text> <explanation><![CDATA[Remember, in order to align two substrings of different lengths, there must be deletions or insertions]]></explanation> </option> <option id="3493f877a754faf38f61288d8fcd13bf" selected_score="0" unselected_score="0"> <text><![CDATA[2]]></text> <explanation><![CDATA[Remember, in order to align two substrings of different lengths, there must be deletions or insertions]]></explanation> </option> <option id="5d62d90c9c36b4fb3f86b385178aee20" selected_score="0" unselected_score="0"> <text><![CDATA[3]]></text> <explanation><![CDATA[Remember, in order to align two substrings of different lengths, there must be deletions or insertions]]></explanation> </option> <option id="636c58d2a03deb33686bdd7d065aceac" selected_score="0" unselected_score="0"> <text><![CDATA[4]]></text> <explanation><![CDATA[Remember, in order to align two substrings of different lengths, there must be deletions or insertions]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="398b60fb473cce489d0a7af8247e7f9f" type="GS_Short_Answer_Question_Simple"> <metadata> <parameters> <rescale_score>1</rescale_score> <type>numeric</type> </parameters> </metadata> <data> <text><![CDATA[<iframe height="170" width="180" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/peon_question.html"></iframe>]]></text> <explanation><![CDATA[<iframe height="180" width="180" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/peon_answer.html"></iframe>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="49c2eac9fe38b42d9ccc80704c2d4a3a" selected_score="1" unselected_score="0"> <text><![CDATA[1]]></text> <explanation><![CDATA[Correct]]></explanation> </option> <option id="a16bc0003eec7ea9ceb4f1195d549820" selected_score="0" unselected_score="0"> <text><![CDATA[2]]></text> <explanation><![CDATA[Remember, substitutions cost 0 if the corresponding characters are identical.]]></explanation> </option> <option id="887e9ac6939a727cd1887ca770542917" selected_score="0" unselected_score="0"> <text><![CDATA[3]]></text> <explanation><![CDATA[Remember, substitutions cost 0 if the corresponding characters are identical.]]></explanation> </option> <option id="54ebd66cadec7a32576ec6e9778ffee8" selected_score="0" unselected_score="0"> <text><![CDATA[4]]></text> <explanation><![CDATA[Remember, substitutions cost 0 if the corresponding characters are identical.]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="94a0dc9c48386799262ff428052896fd" type="GS_Choice_Answer_Question"> <metadata> <parameters> <rescale_score>1</rescale_score> <choice_type>radio</choice_type> </parameters> </metadata> <data> <text><![CDATA[<iframe height="170" width="160" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/torn_question.html"></iframe>]]></text> <explanation><![CDATA[<iframe height="180" width="170" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/torn_answer.html"></iframe>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="f981d2b93f83f92b1011de012d5a29d5" selected_score="1" unselected_score="0"> <text><![CDATA[1]]></text> <explanation><![CDATA[Correct]]></explanation> </option> <option id="b06e2d5d7419735bc8207746a0d5e7db" selected_score="0" unselected_score="0"> <text><![CDATA[2]]></text> <explanation><![CDATA[Remember, substitutions cost 0 if the corresponding characters are identical.]]></explanation> </option> <option id="5252c7239a2ba49f554aad3f542af231" selected_score="0" unselected_score="0"> <text><![CDATA[3]]></text> <explanation><![CDATA[Remember, substitutions cost 0 if the corresponding characters are identical.]]></explanation> </option> <option id="f561f9ec6dd7376bb918488e35dab163" selected_score="0" unselected_score="0"> <text><![CDATA[4]]></text> <explanation><![CDATA[Remember, substitutions cost 0 if the corresponding characters are identical.]]></explanation> </option> </option_group> </option_groups> </data> </question> </question_group> <question_group select="1"> <preamble><![CDATA[<br> Consider the Levenshtein distance (substitutions cost 2) table below. What are the backpointers for the highlighted cell?<br> <br>]]></preamble> <question id="8e196cc2b93b14723056b40a8966160b" type="GS_Choice_Answer_Question"> <metadata> <parameters> <rescale_score>1</rescale_score> <choice_type>radio</choice_type> </parameters> </metadata> <data> <text><![CDATA[<iframe width="175" height="175" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/cave1.html"></iframe> <br><br>[the highlighted cell corresponds to the letter 'c' in 'cave' and the 'a' in 'vase']]]></text> <explanation><![CDATA[<iframe width="250" height="190" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/cave.arrows.html"></iframe>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="96610a94ea728a71b5c8d3383a820158" selected_score="1" unselected_score="0"> <text><![CDATA[diagonal, left, down (↙,←,↓)]]></text> <explanation><![CDATA[Correct]]></explanation> </option> <option id="2ae97f09e714ba7829ccef548bd8869a" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, left (↙,←)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="7b50fb38f2799e4b96987f0bea1fcd88" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, down (↙,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="9ce9dcdb43de0f9de9538647bf6871cf" selected_score="0" unselected_score="0"> <text><![CDATA[left, down (←,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="398cb1f4039273d2190a42984367ad17" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal (↙)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="0f4324f31f0ee6c95d1cf3287eb330fa" selected_score="0" unselected_score="0"> <text><![CDATA[left (←)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="fd60028c3209ccaa811c8925ceb99cb1" selected_score="0" unselected_score="0"> <text><![CDATA[down (↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="54ab4954454e03feac975378c162e1f4" type="GS_Choice_Answer_Question"> <metadata> <parameters> <rescale_score>1</rescale_score> <choice_type>radio</choice_type> </parameters> </metadata> <data> <text><![CDATA[<iframe width="175" height="175" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/cave2.html"></iframe> <br><br>[the highlighted cell corresponds to the 'v' in 'cave' and the 'v' in 'vase']]]></text> <explanation><![CDATA[<iframe width="250" height="190" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/cave.arrows.html"></iframe>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="899b01b5d54457f76af26cd2673f2c7c" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, left, down (↙,←,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="02e5805afec7db5837fc90921148a9d0" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, left (↙,←)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="0941b586e0e4b2788bbea27079025acd" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, down (↙,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="9ee4d52416642fd19ee7d68ea8f15083" selected_score="0" unselected_score="0"> <text><![CDATA[left, down (←,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="ed1e5aa33741b0c8c42a99c4e44da43e" selected_score="1" unselected_score="0"> <text><![CDATA[diagonal (↙)]]></text> <explanation><![CDATA[Correct]]></explanation> </option> <option id="0993315442a8f4731a2b892095f5699d" selected_score="0" unselected_score="0"> <text><![CDATA[left (←)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="699b7f8fa52f62b1c474ef1aab36212a" selected_score="0" unselected_score="0"> <text><![CDATA[down (↓)]]></text> <explanation><![CDATA[Option explanation]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="5ef5a6915b0468cd6c2de63aeba9ca6a" type="GS_Choice_Answer_Question"> <metadata> <parameters> <rescale_score>1</rescale_score> <choice_type>radio</choice_type> </parameters> </metadata> <data> <text><![CDATA[<iframe width="175" height="175" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/cave3.html"></iframe> <br><br>[the highlighted cell corresponds to the letter 'a' in 'cave' and the 's' in 'vase']]]></text> <explanation><![CDATA[<iframe width="250" height="190" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/cave.arrows.html"></iframe>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="7720fa189f7b570f12f8333088d1ad6b" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, left, down (↙,←,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="201a6573e2ca5bb0273aa9b8c5824d1f" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, left (↙,←)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="5a57f76ceed56e451f2c2fa13400f1f5" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, down (↙,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="069cda44a06d289e5e51c8c66623bf2a" selected_score="0" unselected_score="0"> <text><![CDATA[left, down (←,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="6985b0ecf7d6c8226223b84e7497cc25" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal (↙)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="46e2993b6233b8f3374d11e377622dfb" selected_score="0" unselected_score="0"> <text><![CDATA[left (←)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="a7001053fa859368e48b43243c416162" selected_score="1" unselected_score="0"> <text><![CDATA[down (↓)]]></text> <explanation><![CDATA[Correct]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="4fdc8292cfa01f0d4a09cea98f3a5f15" type="GS_Choice_Answer_Question"> <metadata> <parameters> <rescale_score>1</rescale_score> <choice_type>radio</choice_type> </parameters> </metadata> <data> <text><![CDATA[<iframe width="175" height="175" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/cave4.html"></iframe> <br><br>[the highlighted cell corresponds to the letter 'e' in 'cave' and the 'a' in 'vase']]]></text> <explanation><![CDATA[<iframe width="250" height="190" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/cave.arrows.html"></iframe>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="25f4a6214ab5e11be020405dac07db35" selected_score="1" unselected_score="0"> <text><![CDATA[diagonal, left, down (↙,←,↓)]]></text> <explanation><![CDATA[Correct]]></explanation> </option> <option id="4ce2aaef2d9484e0d818a4addb552cdd" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, left (↙,←)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="b2597986062d36cb3792901f525fa87a" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, down (↙,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="0b4e799385799b650bbe5122a1f39668" selected_score="0" unselected_score="0"> <text><![CDATA[left, down (←,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="2c725410f00d4747a1dc72d216d636fe" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal (↙)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="70b60a55afbb503e3d37e18662cd2899" selected_score="0" unselected_score="0"> <text><![CDATA[left (←)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="888ac7b9cfd82bc36009432223000853" selected_score="0" unselected_score="0"> <text><![CDATA[down (↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> </option_group> </option_groups> </data> </question> <question id="201d516574cc26afcc1269258be5429f" type="GS_Choice_Answer_Question"> <metadata> <parameters> <rescale_score>1</rescale_score> <choice_type>radio</choice_type> </parameters> </metadata> <data> <text><![CDATA[<iframe width="175" height="175" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/cave5.html"></iframe> <br><br>[the highlighted cell corresponds to the letter 'a' in 'cave' and the 'a' in 'vase']]]></text> <explanation><![CDATA[<iframe width="250" height="190" src="http://spark-university.s3.amazonaws.com/stanford-lang2info/quiz/w1_redo/cave.arrows.html"></iframe>]]></explanation> <option_groups randomize="true"> <option_group select="all"> <option id="f08b64819299de110f93608008208fa9" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, left, down (↙,←,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="fb7b99bc4acca96b961a16f331e3dbc1" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, left (↙,←)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="096abc6d14a58fc270ddafdddbfc6973" selected_score="0" unselected_score="0"> <text><![CDATA[diagonal, down (↙,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="af7eb7c8d727334ee88459fbb0fd3655" selected_score="0" unselected_score="0"> <text><![CDATA[left, down (←,↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="b059f6cf30740ba0e4c2c347b68c52ce" selected_score="1" unselected_score="0"> <text><![CDATA[diagonal (↙)]]></text> <explanation><![CDATA[Correct]]></explanation> </option> <option id="734bb96e81179e4097bc6dbad04f15c5" selected_score="0" unselected_score="0"> <text><![CDATA[left (←)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> <option id="d1b01f66c5a068de9dd6ed9b1ca451b7" selected_score="0" unselected_score="0"> <text><![CDATA[down (↓)]]></text> <explanation><![CDATA[Remember, a backpointer can only point to a cell from which the current cell's distance can be computed by using a valid operation (substitution, deletion, or insertion)]]></explanation> </option> </option_group> </option_groups> </data> </question> </question_group> </question_groups> </data> </quiz>
Exit Without Saving
{"0":"Coursera","1":"Preferences","2":"All Courses","3":"Admin","4":"Support","5":"I18N Editor","6":"About","7":"Contact Us","8":"Logout","9":"Natural Language Processing"}
This page features MathJax technology to render mathematical formulae. If you are using a screen reader, please visit
MathPlayer
to download the plugin for your browser. Please note that this is an Internet Explorer-only plugin at this time. |
2024-11-18T17:59:32.346758+00:00 | 2021-03-22T06:53:36 | 552c33dcdc2f3f764a612634ea69366643e32c58 | {
"blob_id": "552c33dcdc2f3f764a612634ea69366643e32c58",
"branch_name": "refs/heads/main",
"committer_date": "2021-03-22T06:53:36",
"content_id": "7a3a1776199fcf276d8a426d439e76e4a54b2b45",
"detected_licenses": [
"MIT"
],
"directory_id": "4be1774695f366933f406e70a20505864e088631",
"extension": "html",
"filename": "create.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": null,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 3628,
"license": "MIT",
"license_type": "permissive",
"path": "/public/create.html",
"provenance": "stackv2_html-0000.json.gz:7",
"repo_name": "ffakih5/SourcE-commerce",
"revision_date": "2021-03-22T06:53:36",
"revision_id": "a7490f6fad1dd81f192e22234ec8a6df2ad6551c",
"snapshot_id": "babe0d8e388afed0a5fbf7cd433fb5b56051996e",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/ffakih5/SourcE-commerce/a7490f6fad1dd81f192e22234ec8a6df2ad6551c/public/create.html",
"visit_date": "2023-03-22T01:50:38.078858"
} | stackv2 | Create Account Page
First Name
Last Name
Business Name
Phone Number
Email address
We'll never share your email with anyone else.
Password
Re-Enter Password
Submit |
2024-11-18T17:59:32.354109+00:00 | 2022-06-09T08:24:38 | 7e702526a293942f82baee76afd7e4be76d7232f | {
"blob_id": "7e702526a293942f82baee76afd7e4be76d7232f",
"branch_name": "refs/heads/main",
"committer_date": "2022-06-09T08:24:38",
"content_id": "5e4c9ecec703be601287feee7a105549ada75caf",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "6c3325ff8d6691f380b329b9d032f75be39ae1df",
"extension": "html",
"filename": "sampleChange.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 402224739,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 1146,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/src_supermine/3/5108/sampleChange.html",
"provenance": "stackv2_html-0000.json.gz:8",
"repo_name": "mlcodepatterns/mlcodepatterns.github.io",
"revision_date": "2022-06-09T08:24:38",
"revision_id": "0ee8a195eefed1d63db6f2e29b581606dff2bd1a",
"snapshot_id": "322951b2282fbb38f1116f94e8c5f26b365d47f6",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/mlcodepatterns/mlcodepatterns.github.io/0ee8a195eefed1d63db6f2e29b581606dff2bd1a/src_supermine/3/5108/sampleChange.html",
"visit_date": "2022-07-28T06:51:31.501809"
} | stackv2 | Before Change
split_list = tf.split(x, split_indices, axis=1)
for i, distribution in enumerate(self.child_distributions):
// Remove extra categorical dimension
if isinstance(distribution, Categorical):
split_list[i] = tf.cast(
tf.squeeze(split_list[i], axis=-1), tf.int32)
log_list = [
distribution.logp(split_x) for distribution, split_x in zip(
self.child_distributions, split_list)
]
After Change
split_x = tf.split(x, split_indices, axis=1)
// Structured or flattened (by single action component) input.
else:
split_x = tree.flatten(x)
def map_(val, dist):
// Remove extra categorical dimension.
if isinstance(dist, Categorical): |
2024-11-18T17:59:32.609272+00:00 | 2019-03-03T21:23:49 | b01e8d884aa17c2ab3efcb2148e6ca7dcc8ce59a | {
"blob_id": "b01e8d884aa17c2ab3efcb2148e6ca7dcc8ce59a",
"branch_name": "refs/heads/master",
"committer_date": "2019-03-03T21:23:49",
"content_id": "d963bff60544c18b32a9cde247b46c2430f1042a",
"detected_licenses": [
"MIT",
"BSD-3-Clause"
],
"directory_id": "46b7bbb005adb398b77321fc37b393b96d09b785",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 48960112,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 10867,
"license": "MIT,BSD-3-Clause",
"license_type": "permissive",
"path": "/app/index.html",
"provenance": "stackv2_html-0000.json.gz:9",
"repo_name": "ifraixedes/landing",
"revision_date": "2019-03-03T21:23:49",
"revision_id": "95fbfa60d74961cbe453feab2093fb8b9fc61be6",
"snapshot_id": "0774cb40a3253065d92ab14c743561052d89ccb4",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/ifraixedes/landing/95fbfa60d74961cbe453feab2093fb8b9fc61be6/app/index.html",
"visit_date": "2021-01-19T00:02:00.852762"
} | stackv2 | About...
I love to build maintainable & reliable software with simplicity & performance in mind.
Software engineering is NOT about writing high level machine language with no sense.
Engineering is about using the science in a practical way to innovate, design, build, improve and maintain software systems with the main goal to solving real problems.
To achieve it, we have to build software with simplicity in mind; simple things are easy to understand for other people and that's very important in software engineering, because it makes our software more maintainable.
Making simple things are not easy and only is possible to do achieve for a group of people who collaborate together with no barriers, they are open to provide and receive feedback and they also look for it outside of the group itself.
Experience
I have piled 12 year of working experience in technology.
In chronological order, I worked as help desk and system maintainer, developer in a university research team, programmer analyst for an insurance company and system administrator and IT manager for two non technological companies.
After those and not being satisfied in what I achieved, I moved abroad to work for the new enterprise era (a.k.a startups) as a software engineer.
After I had an experience of designing and building from scratch the whole system for a new business idea for a year, with all the headaches, constraints and lack of resources, I joined as a first paid employee to a high tech visual exploration startup which apply deep learning techniques.
Today I am achieving my goals working as a software engineer for new the new enterprise and spending almost my whole spare time involved with technology for fun and profit.
I keep updating my knowledge with the new appearing technology, I am involved and collaborating with a some tech and open source communities, working in a few side projects and helping to design and build maintainable software for organizations, consolidated companies, startups and individuals.
My Current Stack
It would be to large to write a list of all the systems, data bases, libraries, frameworks, programming languages, etc that I use furthermore I think that it would confusing and it would not say anything about Software Engineering which is in what I am interested than being classified by technology trends.
I used, I am using and I will probably use many of them which existed, are existing and will exist, so I think it is better to apply simplicity here and only mention the ones that nowadays I use in daily basis.
- Golang
- JS for Node & Browsers
- Docker
- Git
If you have arrived here, I would like to hear from you
Your enquiry has been submitted.
I will get back to you soon!
Thanks for your patience.
Unfortunately something went wrong! plesae,
if it fails contact me through social networks (links are at the bottom of the page). |
2024-11-18T17:59:32.609434+00:00 | 2017-02-22T23:44:14 | 9dd627c46286b604c2cd012990ba0644c123ccc7 | {
"blob_id": "9dd627c46286b604c2cd012990ba0644c123ccc7",
"branch_name": "refs/heads/master",
"committer_date": "2017-02-22T23:44:14",
"content_id": "cbd3ace4ebf0bf04be1b8fd4e15f763732c7df26",
"detected_licenses": [
"Apache-2.0",
"BSD-2-Clause"
],
"directory_id": "7db8f7c7771b756f954ca82a771306c213f905eb",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": "2017-02-23T08:37:54",
"gha_event_created_at": "2021-07-28T07:52:23",
"gha_language": "JavaScript",
"gha_license_id": "NOASSERTION",
"github_id": 82904750,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 3797,
"license": "Apache-2.0,BSD-2-Clause",
"license_type": "permissive",
"path": "/utils/switcher/index.html",
"provenance": "stackv2_html-0000.json.gz:10",
"repo_name": "tjenkinson/videojs-contrib-hls",
"revision_date": "2017-02-22T23:44:14",
"revision_id": "fa729cf5ef0d92c8e86e50b1ad17641e712ec7e5",
"snapshot_id": "be822c558c4d8dc3493cb7b647598cfefa030818",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/tjenkinson/videojs-contrib-hls/fa729cf5ef0d92c8e86e50b1ad17641e712ec7e5/utils/switcher/index.html",
"visit_date": "2023-06-19T13:43:54.466368"
} | stackv2 | You can use this page to visualize the behavior of the playlist switcher under different network conditions. It can helpful to understand how tweaks to the switching logic will affect playback.
Timeline
Simulation results will show up here
You can use this page to visualize the behavior of the playlist switcher under different network conditions. It can helpful to understand how tweaks to the switching logic will affect playback.
Simulation results will show up here |
2024-11-18T17:59:32.618940+00:00 | 2020-04-18T15:27:26 | c4b7949b3c9c9c5bd69779f5c8b8e7bf8e7cf4ef | {
"blob_id": "c4b7949b3c9c9c5bd69779f5c8b8e7bf8e7cf4ef",
"branch_name": "refs/heads/master",
"committer_date": "2020-04-18T15:27:26",
"content_id": "13bf045e4a0caf053d9ce29570879057195b70c3",
"detected_licenses": [
"MIT"
],
"directory_id": "6c845be45fb9b50ba0e17bbf101191708d9872a5",
"extension": "html",
"filename": "carer.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 256557597,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 3156,
"license": "MIT",
"license_type": "permissive",
"path": "/project/carer.html",
"provenance": "stackv2_html-0000.json.gz:11",
"repo_name": "usmanbabarDev/School-Website",
"revision_date": "2020-04-18T15:27:26",
"revision_id": "cb668916a359bbfabefcc94ae3aa495710fe13bd",
"snapshot_id": "26e29aef31fa5695b4431e89bb363bbb4c1ea344",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/usmanbabarDev/School-Website/cb668916a359bbfabefcc94ae3aa495710fe13bd/project/carer.html",
"visit_date": "2022-04-17T21:52:37.967188"
} | stackv2 | Career
Complete Careers Guidance Management Solutions
Our Schools provides careers guidance management solutions to help you meet statutory guidance, satisfy Ofsted and achieve the Gatsby Benchmarks.
- Intuitive management suites to help you monitor and track your students
- Personalised careers profiles and individual action plans providing evidence of students’ progress
- Group reports to help you evaluate your careers programme
- Everything in one place, providing the perfect audit trail for Ofsted inspections
- Opportunity to improve your destinations data
- Affordable and cost-effective delivery saving you both time and money
- Comprehensive digital careers libraries to provide your students with impartial guidance across the full range of student options
- Ready-made programmes of lesson plans to support delivery and empower your teachers
- Careers reference libraries to engage your parents
- Opportunity to improve your destinations data
Chungi Amer sidhu, Lahore pakistan
Tel: + 92<PHONE_NUMBER>
Fax: + 92<PHONE_NUMBER>0
Email: naveed.sahs786@gmail.com |
2024-11-18T17:59:32.619015+00:00 | 2021-06-17T19:27:57 | 7cd6759969fd36de43030f44d7a99e0bb41c4bab | {
"blob_id": "7cd6759969fd36de43030f44d7a99e0bb41c4bab",
"branch_name": "refs/heads/main",
"committer_date": "2021-06-17T19:27:57",
"content_id": "994d4785ac0245c5837ce96ef620058f7e0483a2",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "2279ba472cf968aa48b02f9a0937b969705e5953",
"extension": "html",
"filename": "package-summary.html",
"fork_events_count": 5,
"gha_created_at": "2021-05-31T18:39:57",
"gha_event_created_at": "2021-06-02T14:52:54",
"gha_language": "HTML",
"gha_license_id": null,
"github_id": 372599054,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 11242,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/content/release-doc/2.2.2/api/com/sun/jini/thread/package-summary.html",
"provenance": "stackv2_html-0000.json.gz:12",
"repo_name": "apache/river-site",
"revision_date": "2021-06-17T19:27:57",
"revision_id": "03bc3d5ee71f4e28170fa4b35507eef9bf0de066",
"snapshot_id": "6be49b4a33518bfd7116c844d4a12fdd57305bcc",
"src_encoding": "UTF-8",
"star_events_count": 1,
"url": "https://raw.githubusercontent.com/apache/river-site/03bc3d5ee71f4e28170fa4b35507eef9bf0de066/content/release-doc/2.2.2/api/com/sun/jini/thread/package-summary.html",
"visit_date": "2023-06-03T11:44:37.202903"
} | stackv2 | See: Description
| Interface | Description |
|---|---|
| Executor |
Executor is an abstraction for a thread factory or thread pool for
executing actions asynchronously.
|
| TaskManager.Task |
The interface that tasks must implement
|
| Class | Description |
|---|---|
| GetThreadPoolAction |
Provides security-checked access to internal thread pools as a
java.security.PrivilegedAction, to be used conveniently with an
AccessController.doPrivileged or Security.doPrivileged.
|
| InProgress |
This class provides a blocking mechanism that will not proceed while
some operation bounded by this object is in progress.
|
| InterruptedStatusThread |
Common Thread subclass to handle potential loss of
interrupted status.
|
| NewThreadAction |
A PrivilegedAction for creating a new thread conveniently with an
AccessController.doPrivileged or Security.doPrivileged.
|
| ReadersWriter |
An Object to control the concurrent state.
|
| ReadyState |
Utility class used to prevent access to a service before it has completed
its initialization or after it starts to shutdown.
|
| RetryTask | |
| StreamPlugThread |
StreamPlugThread is a utility class that "plugs" two streams,
one input stream and one output stream, together by creating a thread that
repeatedly reads any data available from the input stream and writes it to
the output stream. |
| TaskManager |
A task manager manages a single queue of tasks, and some number of
worker threads.
|
| ThreadPoolPermission |
Permission to use internal thread pools (see GetThreadPoolAction).
|
| WakeupManager |
A Queue of timed tasks.
|
| WakeupManager.ThreadDesc |
Description of a future thread.
|
| WakeupManager.Ticket |
A ticket that can be used for cancelling a future task.
|
| Exception | Description |
|---|---|
| ReadersWriter.ConcurrentLockException |
InterruptedException transformed to a runtime exception.
|
InProgress
) provide synchronization
mechanisms. Others, such as TaskManager
, provide utilities
for managing the creation of multiple threads to do independent tasks.Copyright 2007-2013, multiple authors.
Licensed under the Apache License, Version 2.0, see the NOTICE file for attributions. |
2024-11-18T17:59:32.620359+00:00 | 2023-08-24T12:41:16 | 8e2f2f386be44909b1aab5974eb95c3692e86ee3 | {
"blob_id": "8e2f2f386be44909b1aab5974eb95c3692e86ee3",
"branch_name": "refs/heads/main",
"committer_date": "2023-08-24T12:41:16",
"content_id": "0dee14ea58e7234a3ab9ad24adb5bea9de7ad0e3",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "febe8ff169ad595221b8d794ec3bdc4fedd67687",
"extension": "html",
"filename": "SelectLoginMfaView.scala.html",
"fork_events_count": 6,
"gha_created_at": "2018-08-10T12:40:25",
"gha_event_created_at": "2023-08-31T08:36:37",
"gha_language": "Scala",
"gha_license_id": "Apache-2.0",
"github_id": 144284496,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 3374,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/app/views/SelectLoginMfaView.scala.html",
"provenance": "stackv2_html-0000.json.gz:13",
"repo_name": "hmrc/third-party-developer-frontend",
"revision_date": "2023-08-24T12:41:16",
"revision_id": "527e8c0cefa6fe501bfd9c48af0d30292ca6b1a8",
"snapshot_id": "bb95177905313da2a2433350626dcf1149cc7573",
"src_encoding": "UTF-8",
"star_events_count": 6,
"url": "https://raw.githubusercontent.com/hmrc/third-party-developer-frontend/527e8c0cefa6fe501bfd9c48af0d30292ca6b1a8/app/views/SelectLoginMfaView.scala.html",
"visit_date": "2023-08-28T18:48:02.718259"
} | stackv2 | @* * Copyright 2023 HM Revenue & Customs * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. *@ @import uk.gov.hmrc.thirdpartydeveloperfrontend.domain.models.views.BackButtonWithJavaScript @import views.html.include.DevMain @import uk.gov.hmrc.thirdpartydeveloperfrontend.controllers.routes @import views.html.include.fieldError @import uk.gov.hmrc.apiplatform.modules.mfa.models.MfaId @import uk.gov.hmrc.apiplatform.modules.mfa.forms.SelectLoginMfaForm @this(devMain: DevMain) @(form: Form[SelectLoginMfaForm], authAppMfaId: MfaId, smsMfaId: MfaId)(implicit messages: Messages, request: play.api.mvc.Request[Any], appConfig: ApplicationConfig) @devMain( title = "How do you want to get access codes?", back = BackButtonWithJavaScript, isRegistering = false, developerSession = None ) { @helper.form(action = routes.UserLoginAccount.selectLoginMfaAction()){ @helper.CSRF.formField @fieldError(form.errors, "mfaId") |
2024-11-18T17:59:32.620432+00:00 | 2021-09-02T20:52:26 | b8bca230c9a359066af393caf62ef81d801188c8 | {
"blob_id": "b8bca230c9a359066af393caf62ef81d801188c8",
"branch_name": "refs/heads/development",
"committer_date": "2021-09-02T20:52:26",
"content_id": "e38281a3876a39dfa4d62aea6cb749834b32ebc7",
"detected_licenses": [
"MIT"
],
"directory_id": "05a70c12df808455100598d8a6fdb5635c641ab8",
"extension": "html",
"filename": "Locacion-21.html",
"fork_events_count": 0,
"gha_created_at": "2020-08-23T20:54:55",
"gha_event_created_at": "2021-09-02T20:52:27",
"gha_language": "Python",
"gha_license_id": "MIT",
"github_id": 289764892,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 423,
"license": "MIT",
"license_type": "permissive",
"path": "/Ago-Dic-2019/Ricardo_Romero_Medina/Ordinario/Locaciones/Locacion-21.html",
"provenance": "stackv2_html-0000.json.gz:14",
"repo_name": "Jonathan-aguilar/DAS_Sistemas",
"revision_date": "2021-09-02T20:52:26",
"revision_id": "4d02efc64161871084df1bff258112351e5d1241",
"snapshot_id": "991edcc929c33ba9bb8bc84e741b55c10a8420a3",
"src_encoding": "UTF-8",
"star_events_count": 1,
"url": "https://raw.githubusercontent.com/Jonathan-aguilar/DAS_Sistemas/4d02efc64161871084df1bff258112351e5d1241/Ago-Dic-2019/Ricardo_Romero_Medina/Ordinario/Locaciones/Locacion-21.html",
"visit_date": "2023-07-24T12:26:54.698452"
} | stackv2 | Id = 21
Nombre Capitulo = Testicle Monster Dimension
Tipo = Dimension
Dimension = Testicle Monster Dimension
Personaje = ['https://rickandmortyapi.com/api/character/7', 'https://rickandmortyapi.com/api/character/436']
Numero Personaje = ['7', '436']
URL Locacion = https://rickandmortyapi.com/api/location/21 |
2024-11-18T17:59:32.621969+00:00 | 2017-08-27T18:59:04 | 05d61e80cb636ec8ee2467ee2297e75f895de211 | {
"blob_id": "05d61e80cb636ec8ee2467ee2297e75f895de211",
"branch_name": "refs/heads/master",
"committer_date": "2017-08-27T18:59:04",
"content_id": "74c0821c7835c86f807683b2bd06e31e416f541c",
"detected_licenses": [
"BSD-2-Clause"
],
"directory_id": "927519e00769bd518ba20a147665837dfaf6c240",
"extension": "html",
"filename": "templates_manual.html",
"fork_events_count": 0,
"gha_created_at": "2017-08-18T17:01:52",
"gha_event_created_at": "2017-08-27T18:59:05",
"gha_language": "Perl",
"gha_license_id": null,
"github_id": 100733480,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 46873,
"license": "BSD-2-Clause",
"license_type": "permissive",
"path": "/docs/templates_doc/templates_manual.html",
"provenance": "stackv2_html-0000.json.gz:15",
"repo_name": "E69-Heracles/dangerzone",
"revision_date": "2017-08-27T18:59:04",
"revision_id": "03740d4d10cb4ff7747804719416b55450ad291e",
"snapshot_id": "23c1fe265638c8e38826de85d57ca9ab162b7b44",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/E69-Heracles/dangerzone/03740d4d10cb4ff7747804719416b55450ad291e/docs/templates_doc/templates_manual.html",
"visit_date": "2021-01-22T17:48:35.401586"
} | stackv2 | geo_obj.data : Holds most important data. It has 4 main group data:
1) The airfields localization, their damage, the park places, army owner, code name, etc
2) Sector coordinates, type (atackable or not), TTL, army owner, etc
3) City name, coordinates, damage, suply radius, spot Zones, army owner, etc...
4) A list of relation on city and sectors, to know wich sectors has a city and will be not
attacable till city has 50% damage
city.mis : this is a mission file created using FMB (Full Mission Builder). It is the more time consuming file. Here you determine wich cityes are part of the campaign, and make the spot Zones. Each of this spot zone is an atacable place. This file indicates what types of objects will be place, and where they will be placed. It NOT has the objects. The indicators are a combination of aircrafts way points of differen altitudes to represent different objects. (I will explain later). Later generator will put objects "under" those WP lines.
tanks_wp.mis : This is the tank placement template. Each serctor of 10x10 km needs to have 2 or more "points". Later the genator will use 2 of those "points" to place champs and initial 9-tank-group. As you see 2 points at least are needed. More is better, so generator will have more combination of 2 points to pick from, making more umpredictable where champs /moving tanks are placed. Those "points" are static tanks, really do not matter what type the object is, the generator will look objects coordinates (the points). On sectors where is impossible to place 2 tank places, the sector will be un-attacable.
red_obj.mis : A mission that holds one LI-2 per airfield. Nothing more.
blue_obj.mis : Same, but with JU-52, and objects numbers starts with 10000.
frontline.mis: This file holds the frontline status. It has one flag per square, exept for the unattacable sectors.
aircraft.data: This file has the information of plane aviables, type, tasks, airclass, etc etc.
imap.data : This file is a HTML image image to aid target selection at mission creation time. It holds the setors names (and aditionally fields and city names) to be displayed as a popup when placing mouse over front image.
To create templates for a map, all files described above has to be written, each file has
particular conditions to meet. The templates files at firt impresion looks very complex,
but they are not.
I provide in this guide a explanation file by file and some tools to semi-automate template creation. But before start looking onto each file I better explain the difference between "static objects templates" and "places template".
Static objects templates are files created with FMB, they have all the objects of
the map. Usually it holds thouthands of cars, planes, AAA, trains, etc. all spread on a
particular map. Later, when you attack a place, mission generator looks for a set of
objects close to that place you attack, "copy" them and "paste" into the mission it is
created.
This system has advantages and disdvantages. They are easy to build, can take several hours to build them, but later are easy to use for generator program with "copy and paste". The disadvantage is that you cant change object types, you need a red template and a blue template, the objects are all at the same place and after several attacks to same place people can know where is the AAA and where are the jackpots (best place to bomb).
Badc uses 2 static objects templates files: red_obj.mis and blue_obj.mis. They only hold static planes to place on airbases, 1 per base, and used only to make bases display correct color on maps. (no white bases).
Places templates: This templates do not have objects that later will be on mission. They have the "places" where we like to have objects placed. Later the generator will insert the objects in correct place into the mission we are generating. Thats all.
The paces templates are not hard to make, it only needs some convetion (rules) on how those places are marked, to later the generator understand where and how the objects has to be inserted. Badc uses "place" templates for airbases, tank waypoints and city targets. Lets see a general example, later we will see each template details rules.
Lets say we are creating a static template for an airfield, we place several
planes, and can look like this:
After those planes are selected (type) and placed, we have to rotate them one by one and
later align them. Now, lets use the same airfiled, and use the "place template" idea. We
want to have some planes aligned in 2 lines, like is showed in next image:
So later the generator will insert planes like whow next image (they are correct lined up and
rotated, maybe not visible because image size):
So, how do we make those lines to later the generator place the objects? We use
an aircraft (any flyable) and we set waypoints, this way we "draw" lines. Maybe You can
not undestand this the first time you read, but is very easy. When you place a flight, FMB
writes the coordinates of the way points. Placing the waypoints and "drawing" a line with
a plane will make 2 things: tell us where the coordinates are and show us where the
objects will be placed.
Lets see a working example, next image shows several waypoints where I like to place some
planes. I use B-17 aircraft to "draw" those waypoints:
Next image shows how aircrafts are placed:
Compare last 2 images, look the direction of waypoints and how planes are
placed. You will notice that planes always are placed with nose pointing to the right of
the lines. When I say "right" I mean: imagine you stand up on WP0 and look on direction to
WP1, the planes will be looking to the "right" of that direction.
For easy understand I combine those 2 images into a single one and drawed a big red arrow
of the "right" direction. When you make templates you will not see the planes, and you
have to create this image in your mind:
This way place templates works. You just use a mission to place flights, you never place the objects. Trust that later the generator will use that file with flight waypoints to read the coordinates and place the objects as you wish. You can use any plane to "draw" places, it does not matters the army or the type of the plane. Generator will place red static planes if later that base is soviet, or place blue static planes if the base is on german side. Be sure to understand all to this point before read next tips.
To avoid using many flyiable planes and to speed up template creation, we use same
flight to make several places. How? well, generator will look into pairs of
waypoints because we know a line is defined by 2 points. So, when you create you places
you can keep adding points using same flight like show next image:
Those waypoints indicates 3 places: place planes from WP0 to WP1, place planes from WP2 to WP3,
place planes from WP4 to WP5. When you "draw" those waypoints you have to keep pairs of
waypoints. I say to myself when I make those templates:
placing WP0 I think: planes from here
placing WP1 I think: to here
placing WP2 I think: planes from here
placing WP3 I think: to here
placing WP4 I think: planes from here
placing WP5 I think: to here
As you can see, you are free to select srating point between places. In this example, the
lines between WP1 and WP2 will not define a place, its just a relocating line and you have
to ignore it. Same goes for line btween WP3 and WP4.
Really is is very simple after you try several times. Next image shows how planes are
located using the places showed in previous image:
And next image is the combination of both of them, showing what you have to "imagine"
at the moment you "darw" your templates. Remember, it is VERY important you use
pairs or waypoints, because they define the lines. Just remember to use "from here" - "to
here" nemotechnic.
We create templates in several stages (or steps), because some stages needs data from previous stages. For example, the Geo_obj.data contains four (4) main gruopg of data. One of those gropus are the sector definitions, and to write the sectors definition you need to have the tank waypoints. And tank waypoints will be made using a template created after finishing "stage 1", where we define airfields and park places. Dont worry now about this, the only important thing now is to know that there are several "stages".
This semi-automatic template creation uses perl scripts. So you need to have perl installed. If you dont have perl, it will not be possible to make templates as I describe in this manual.
The process of template creation need you to work with FMB, and time to time run some scripts, so to make things easy, create a folder under FB/missions. I usually name the forlder with the name of the map templates im building, do for example to make normandie1 templates I have a folder: "D:\Ubi Soft\IL-2 Sturmovik Forgotten Battles\Missions\normandie1" where I place all the perl scrips and where I will hold template files. Once thy are finished I rename them, adding a 2 or 3 letter code before each file to easy recgnition.
copy all the scrips provided with this manual into a folder you like.
Lets start building templates for Normandie1 map. As described before I place all
scripts into a new folder called normandie. Then I start IL2FB, and load map
"normandie1". The first thing to do is to place a object "airfield champfire" on the
most right-top corner, better just a bit outside last sector number/letter (if you
can, if not place as far you can on top-right of map). This will be used
by scripts to determine the limits of map. Save this file as "initial.mis". This
file now will provide important data: the limits of the map and the map name.
Abobe image shows the "airfield champfire" localization for normandie1 map. This map has at top-right coordinates named O-10, so the "airfield champfire" is located at P-11 sector. Of course, P-11 cordinates are not displayed on FMB. This top right square will have different coordinates on different maps.
This new file initial.mis will hold the data of airfields, besides other information I told. For each airfield on map we like to use for campaign, we need to colect several information: The coordinates of the location, the 2 headings for take off and landing, the orientation of runway, the "places" where we will like to put parked planes and the place for a static plane to be used a airfield army identification.
All this data is colected by adding 3 objects to each airfiels:
When you have all this 3 object placed, you select other airfield and repeat process
adding a new JU-52, a B17 with 2 waypoints (one take-off other landing), and other B17 to
"draw" the parking places. Next image shows a screen shot with those 3 objects for an
airfield.
Time to time you will like to check how planes are placed, if the orientation is correct, if you have correct pairs of WP for the park places, and so on. To see a preview of your work, run the script "view_bases.pl". This script will read your "initial.mis" file and create a new file called "preview_bases.mis". Load this file into FMB and check how planes are placed. This script will print an error if you have even (not pairs) amount of waypoints. The preview will only display german planes, like if the base is under german control, later the generator will place greman or soviet planes.
Remember to keep working on "initial.mis". It is a common mistake to load the preview, and then keep adding Ju-52, park places and toff/land WP to the preview mission. The preview mission is just that, a mission to look how yor waypoints will be read by generator. The important file is "initial.mis". After you inspect the preview mission remmenber to load back "initial.mis" to keep working on.
Next picture is how you see a base in preview_base.mis. Notice that the static JU-52
will not be showed. The preview mission only display the "aircrafts park places".
This is how looks an error message when you try to make a preview and the waypoints
amount are not pairs. When this happens you have to load "initial.mis" on FMB and search
where is located the problem. A recomendation is to do a preview every time you finish a
base. So if there is a problem with pairs WP, the problem will be always in the last base
you was working. Aditionally, error will display what line number is the one making even
waypoints, so if you like you can manual delete that line, by editing "initial.mis" in a
text editor. (not recomended, better look the WP in FMB).
This is all we need to finish first stage, a "initial.mis" with a champfire, and each base with 3 objects. Once you are used to make this bases, each base will not take more than a couple of minutes. The way I work in doing first adding the filedchamp, the I add all JU-52 to all bases I like to use, so they are a visual aid to find bases. Later I add all take-off and landing waypoints using a B-17 for each base. This way, when I look all the map, I have to see "something blue" (the ju-52) and "something red" (the b17 waypoints). Finally I add the parking places to each base, doing some previews time to time.
If you look into the initial.mis I provide as example you will see frontline markers. You do not need them yet. Is something we will add in next stages, explained later.
Now we are ready to run 1_stage.pl script. (run in a cmd window: perl -w 1_stage.pl). This will create 5 files:
If you are curious, you can look into geo_obj.data just created, there you can see
several lines with the onformation of each airfield. For example this are the lines
representing the airfiled is showded on above example images . That information is: airfield
general information (first line), Heading coordinates (AF06:Hx), followed by several lines with
parking places coordinates and angle for plane placements (AF06:Px)
AF06,aerodromo--D03,38788.61,29109.76,2,-D,03,2,0:2 AF06:H1,38048.61,28764.76, AF06:H2,39530.43,29455.75, AF06:P1,38451.23,29622.01,38526.13,29846.98,378, AF06:P2,38509.59,29613.09,38578.11,29816.26,378, AF06:P3,39102.59,29655.61,39159.29,29544.57,152, AF06:P4,39185.28,29124.04,38982.10,29024.82,243, AF06:P5,38386.74,29213.82,38443.44,29383.92,378, AF06:P6,38625.36,29535.12,38665.52,29639.07,381, #--- End AF06 (aerodromo--D03)
Don worry if you dont understand this information, you dont need to understand it to
keep woring on templates.
The tank template holds "points" where generator will later place a defense champ (some static objects, AAA, and static tanks) or a group of moving tanks (the attacking group). Each sector needs at least 2 "points" so it will be possible to place both goups, one in each point. More points places are welcome, so generator later can pick diferent combinations of them, making missions less repetitive. The amount of "points" recomended for each sector is up to 5, and no less than 3 to make some variations on selection.
There are some sectors where tanks can not move. For example sea, lagoons, sectors covered by forest, etc. On this sectors we will place 0 points, that is, there will be no starting points, and sectors become un-attacable.
Go to FMB and load the mission "tank_wp.mis" created on first stage. You will see
something like this (showed only a small part):
You can see on all sectors 5 tanks, one on each corner and one more in sector center. This file is created in this way for speed edit. Is more easy to delete and move objects alrready lpaced on mission. Each of those static tanks you see are the "points". Like on paking places we use flight for later place objects, here we use a static tank to indicate the coordinates of where a camp, or a group of moving tanks will be placed. In that image I named sectors with numbers 1 to 4, just for easy reference on this manual.
Previous image shows 4 sectors. The very first thing to do is delete all 5 points from
unattacable sectors(sea, lagoons and only forest sectors). Later, you have to relocate
points based on simple rules. The points (actually tanks on this template) needs to be not
very close. All of them has to be inside the sector, no river, lagoon, city or forest has to
intercept their path. If you cant place all 5 of them, try deleting some of them for easy
find correct places. Next image shows how edited those points. Sector named 1 is
un-attacable (sea) and deleted all 5 points. Sector named 2 has 4 points, sector named 3
has 5 points and sector named 4 has only 3 points:
As you can see, all points meet requeriments. Now I will show a mage with incorrect
point placement. I will add some lines to conect them, and place a red dot over green
lines to show a problem. Those lines have to be done in your mind when you are moving
points.
Sector named as 1 has one point in other side of river. Sector named 2 has poins incorrect
placed because the run into a city. Sector named 3 are correct, but two points are too
close, so is recomended to move one of them a bit away, like the red line show. Sector
named 4 has two paths runing into forest. On next image I show how this points are
corrected:
You have to check sector by sector point placement. Make sure that sectors has at least 2 waypoints, but a minimum of 3 is recomended. Also be sure to not place points outside sector. For work more confortable, zoom in and out so the grid lines only display 10x10 squares. It is also recomndable for areas with hils and mountains to look exacltly the place you are placing a point, so you avoid to place them on hill precipices.
This template takes some time, when you are used to work with it, you can make several
sectors in a minute. The more important thing is to make unatacable the sectors that cant
hold tanks points. The other sectors can be edited or corrected later (problem with hills,
or a point on other side of river, etc..)
Now we start with city template. This template will hold the cityes that will like to
include as targets. Only one city per sector. City cant be closer to 10km each
other. Load city.mis into FMB. The first thing to do is to place a "observation ballon
90m" object over each city we like to include. This way we easy check that we dont place 2
city too close. Next image shows how the template looks after adding several cityes. The
lines are drawed only to show the distance you have check
After you finish, you have to zoom close to each city and add several "champfires"
objects. Each champfire will be an "attacable zone", add at least one and up to 9
zones for each city. All places marked with a fire (zones) has to be close to the city,
never place them in a distance bigger than 5 km. Also, each target place zone needs to be
1 km or more seperated from any other zone. So, you leave room to place objects and not
overlap them. Next image shows a city with 3 zones (3 fires), all of them inside 5km
limit, and all of them seperated at least 1km from other fires.
Place more zones on more important cityes (5 or 6 is ok) and less zones on small towns
(2 or 3 is ok). Once you finish placing fire zone markers, you have to place objects on
each of them. Next images shows one zone with objects and remaining others still empty.
The way to place objects is very simmilar to the method described as "place templates". In fact, is the same with a few more options. You have to draw pair of waypoints. Those pair of waypoints indicates the line where objects will be placed. But now we have a extra fearture. Using the altitude of the wp we can indicate different objects types. Think like the waypoints is a pencil, and the altitude is the pencil type. So, with different altitudes we can "draw" diferent objects.
Again, no matter what plane you use to draw places. But now is very important to use
the correct altitude to represent the objects you want to place. Usually I use a
german plane (blue wp) to "draw" the AAA places, and I use a red flight to "draw" vehicles
places. And usually for each zone I use diferent flights for diferent targtes. For
example, with one B17 I draw all vehicles parallel to lines (WP altitude 500). I place
about 10 up to 20 waypoints, so I "draw" 5 to 10 places. Then I insert a new B17 flight,
set Wp alt to 1000 and place several vehicles rotated to "right". If there is a railroad,
i inser a new B17 flight, set wp to 1500 and add all trains. Finally I add a german flight
(any, usually I use JU-87) and insert several AAA places. Next image shows how a target
looks.
As before, you have a script to preview how targets will be read by generator. This
script is called "view_city.pl" and will read city.mis (the file you are working on) and
create a new file called "preview_city.mis". After adding one or more zones, run the
script and then load into FMB the preview mission. Check how targets are placed, if all
what you planned to add is in correct place, etc... Like before, dont make the mistake to keep adding zones into the preview
mission. This script also will tell if there was a porblem with even (not pair)
waypoints. Next image shows the previe of the zone showed before as example.
And this next image shows the combination of previous 2 images, there you can see the
objects placed on the lines you are drawin. This is what you have to try imagine when
adding points. Note that all targets on preview are red objects, but later, generator will
place correct army places based on who is the ownler of the city.
Ok, now we are ready to run 2nd stage script. This script will read both templates
(tanks_wp and city templates) and add information to geo_obj.data file. The
information added is:
Sector information, lines like:
SEC-E08,sector--E08,45000,75000,30,1:0 SEC-E09,sector--E09,45000,85000,30,1:3 etc...
# Name F08 SUC02,SUM-city-F08,53945.30,73549.92,-,-,-,-,-:0 CT02,city-F08,53945.30,73549.92,25,tipo,TOTAL_ZONES_HERE,0,25:0 CT02Z0:54427.62,74109.38,1 CT02Z1:55014.97,73130.47,1 CT02Z2:54036.05,72934.69,1
poblado,city-H07,sector--H07 poblado,city-F08,sector--F08 poblado,city-I04,sector--I04
For example, city on normadie1 map, at sector-F08 is Bayeux so we make this
changes on geo_obj.data:
Initial lines afected:
# Name F08 SUC02,SUM-city-F08,53945.30,73549.92,-,-,-,-,-:0 CT02,city-F08,53945.30,73549.92,25,tipo,TOTAL_ZONES_HERE,0,25:0 CT02Z0:54427.62,74109.38,1 CT02Z1:55014.97,73130.47,1 CT02Z2:54036.05,72934.69,1 . .(other lines) . poblado,city-F08,sector--F08 . .
# Bayeux F08 SUC02,SUM-Bayeux,53945.30,73549.92,-,-,-,-,-:0 CT02,Bayeux,53945.30,73549.92,40,tipo,3,0,40:0 CT02Z0:54427.62,74109.38,1 CT02Z1:55014.97,73130.47,1 CT02Z2:54036.05,72934.69,1 . . . poblado,Bayeux,sector--F08 . .
Notice I changed the text "TOTAL_ZONES_HERE" by the amount of zones, this case is
3. Aditionally I like to set Bayeux with a max suply radius of 40 kilometer instead of 25
km default. So I changed both "25 values" to 40. Those values are the max suply radius
and the current suplay radius (because damage is 0 both values are equal).
Once you finish adding all names and seting correct amount of zones and initial suply radius, you have to define what will be the initial frontline of campaign and make all objects on goe_obj.data file be "sincronized" to the initial frontline.
To acomplish this, load the "initial.mis" and place some blue/red front markers. Save the file and finally run the 3_stage.pl script. This script will read the frontline you just set on initial.mis and will create a frontline.mis template. It also will sincronize the geo_obj.data file. Now, we are almost done.
The aircraft.data file has the definition for each aircraft you are interested to place into campaign. Also this file holds information on squadron names and static planes and static vehicles. Lines starting with a numeral (#)are ignored.
There is no automatic way to create this file, so open a new file in text editor and write them following next indications and later save it as aircrafts.data.
Next lines indicates that russian fighters squadron can be 176IAP or 3IAK. Selection will be random. Jabo task will have 11IAP squadron and Transports(suply) and bombers (suply) will be 34BAP squadron. For german fighters will be from I_JG3,II_JG3,I_JG27 squadrons,bombers will use Stab_KG27a,I_KG27a,II_KG27a,III_KG53a squadrons, and so on. Other lines like this describe diferent squadrons for other country/task combinations. When there is more than one definition, a random one is picked. At least one squadron must be present for a existent country+task definition.
##--red sqds rusfig=176IAP,3IAK; rusjab=11IAP; rusbom=34BAP; rustrp=34BAP; gerfig=I_JG3,II_JG3,I_JG27; gerjab=I_LG2; gerbom=Stab_KG27a,I_KG27a,II_KG27a,III_KG53a; gertrp=KGrzbV102a; romfig=Eskadrila54; romjab=Eskadrila54; rombom=Eskadrila54;The squadron names cant be any you like. They have to be exactly the same used by FB game. If you plan to add sqadron names, be sure they are aviable on FB. Later, this file contains plane description and are comma seperated values a colon the task and plane amount. The fields are in order:
army, country+task, name of plane, class air, loadout, fuel, crusier alt, crusier speed : task, number,
The tasks are:
BA : Bomber Attack. Group of bombers attacking city or airfields.
SUM: SUply Mission. Group of transport planes, doing suply mission task
BD: Bomber Defend. Group og defending bombers, attacking the incoming enemy tanks
EBA: Escort BA bombers
ESU: Escort SUply transports
EBD: Escort BD bombers
ET: Escort Tanks. When you attack a sector, planes doing air cover and intercept enemy BD
INT: INTercept. In general, intercept enemy Suply transports and enemy BA.
The number is the amount of planes of that type and and is equal for each entry. (not manadatory)
Here is how looks a entry for a P-40 bomber/fighter:
(NOTE INTERCEPT TAK IS A SINGLE "I" not "INT" as described above)
# P40-E 1,rusjab,P-40E,1,air.P_40E,500lb,100,3000,400:BD,6, 1,rusfig,P-40E,1,air.P_40E,500lb,100,3000,400:ET,6, 1,rusfig,P-40E,1,air.P_40E,default,100,3000,400:EBA,6, 1,rusfig,P-40E,1,air.P_40E,default,100,3000,400:EBD,6, 1,rusfig,P-40E,1,air.P_40E,default,100,3000,400:ER,6, 1,rusfig,P-40E,1,air.P_40E,default,100,3000,400:I,6,
To get classair names, open FMB, load any small map, for example online1. Then insert a
plane you like to get the air class name. Let say FW190-A8, so insert a flight of that
plane with weapons default. Then insert another one FW190-A8 and set this one with a bomb
load you like to use, for example SC500. Save the mission whith any name, for example
call it airnames.mis (you can insert more flights of other airclass you will need).
Open this mission with a text editor, you will see something like this:
[MAIN] MAP Net1Summer/load.ini TIME 12.0 CloudType 0 CloudHeight 1000.0 army 1 playerNum 0 [Wing] g0101 g0100 [g0101] Planes 1 Skill 1 Class air.FW_190A8 Fuel 100 weapons default [g0101_Way] NORMFLY 15421.69 25085.94 500.00 300.00 [g0100] Planes 1 Skill 1 Class air.FW_190A8 Fuel 100 weapons 1sc500 [g0100_Way] NORMFLY 15421.69 23440.96 500.00 300.00 [NStationary] [Buildings] [Bridge] [House]
There you can see that the class air is: air.FW_190A8
The default loadout is default
The bombload loadout is: 1sc500
Ok, lets build this FW190-A8 entry using default loadouts, and 1SC500 bomb for bomber
defense (BD) , and set 45/300 planes. First write a single line, for intercept
task:
2,gerfig,FW-190A8,1,air.FW_190A8,default,100,3000,400:I,45,
Those values are:
2 = axis side
gerfig = 3 leters country + 3 leters code
FW-190A8 = is the name of the plane to be displayed on briefings, reports and stats
1 = because is human flyable
air.FW_190A8 = is the class air you just find as explainded above
default = is the loadout
100 = is the fuel load
3000 = is the crousier altitude
400 = is the criusier speed
: is a separator
I = intercpet task (NOTE that is a single letter, not 3 letter "INT")
45 is the plane amount number
, final comma
When you have that line, copy and paste several lines (4 more) to get this:
2,gerfig,FW-190A8,1,air.FW_190A8,default,100,3000,400:I,45, 2,gerfig,FW-190A8,1,air.FW_190A8,default,100,3000,400:I,45, 2,gerfig,FW-190A8,1,air.FW_190A8,default,100,3000,400:I,45, 2,gerfig,FW-190A8,1,air.FW_190A8,default,100,3000,400:I,45, 2,gerfig,FW-190A8,1,air.FW_190A8,default,100,3000,400:I,45,
Finaly change so you have EBA EBD ET BD tasks, set 1sc500 loadout for ET and BD tasks.
reduce crusier altitude to 1000 meters and set gerjab code for defensive bombing (BD): I
usually add a comented (#) line with the name and other info at begining:
# FW-190A8 45/300 planes as Pirx table for map bla-bla at year xxxx ... 2,gerfig,FW-190A8,1,air.FW_190A8,default,100,3000,400:I,45, 2,gerfig,FW-190A8,1,air.FW_190A8,default,100,3000,400:EBA,45, 2,gerfig,FW-190A8,1,air.FW_190A8,default,100,3000,400:EBD,45, 2,gerfig,FW-190A8,1,air.FW_190A8,1sc500,100,3000,400:ET,45, 2,gerjab,FW-190A8,1,air.FW_190A8,1sc500,100,1000,400:BD,45,
If you investigate other load outs, you will know that mk108 guns on FW-190A8 is named
"r22mk108" so you maybe like to add those for intercept task. Just change default by
r22mk108 on Intercpet task line, so it looks this way:
2,gerfig,FW-190A8,1,air.FW_190A8,r22mk108,100,3000,400:I,45,
Repeat this method for other planes. I usually make a mission (airnames.mis) where I insert all planes I will need with several loadouts. So later I open the mission to read all air.class data and all loadouts I need. In your case, maybe you need P51, P38, P47, 109-G6, B25 etc etc... place all of them on you airnames.mis using FMB.
Later on this file we have static planes distribution and static vehicles distributions.
The static planes line are like this:
ST100,1,I153,vehicles.planes.Plane$I_153_M62,15:150 ST101,1,I16,vehicles.planes.Plane$I_16TYPE24,15:350 ST102,1,IL2,vehicles.planes.Plane$IL_2_1940Late,20:400 ST103,1,LaGG3,vehicles.planes.Plane$LAGG_3SERIES4,15:500And the fields are:
The number are acumulative values, and last static plane has to have the number 1000.
they have to be in order, for the example avobe: we have 150 I-153 per 1000 planes, the we
have 200 (350-150) I-16type24, the we have 50 (400-350) Il2 1940, then we have 100
(500-400) LaGG3 and so on. Notice that mixed with staic planes we have some fuel trucks,
they will be placed like planes, simulating fuel loading.
Finally the static vehicles definition. This is almost the same like static planes, useing
acumulative values frecuency up to 1000. Here some examples for blue side vehicles
SV201,2,VW82,vehicles.stationary.Stationary$VW82,15:80 SV202,2,VW82t,vehicles.stationary.Stationary$VW82t,15:160 SV203,2,OpelKadett,vehicles.stationary.Stationary$OpelKadett,15:260 SV204,2,OpelBlitz36S,vehicles.stationary.Stationary$OpelBlitz36S,15:340 SV205,2,OpelBlitz6700A,vehicles.stationary.Stationary$OpelBlitz6700A,15:440 SV206,2,Kettenkrad,vehicles.stationary.Stationary$Kettenkrad,15:500And the fields are:
The image to be used is BMP 24bits/pix image you have to make with a program of preference. Take several screenshots to the map in the FMB. Later edit and resize to get 900 pixels with. You can use other sizes, but is not recomended more than 900 width because performance and server load. Smaller can be to hard to see information. Always use a divisible by 4 width, because scripts do not handle padding. Add to the image the names of the cityes. Lets call this image NM1.BMP. Later use a tool to create the image map file (lets call it imap.data). GIMP has a nice imagemap editor.
When you build the image, count how many pixels per sector you have. Later you need that information to be written into config.pl (explained later). For example, if your image has 900 pixels width and the map has 15 sectors, the count for pixels per sectors is 60. Maybe one less because maps have partial sectors at end, where are cordinates.
The image map is just a html file, pointing to the image (not this one, point to a
default "front.jpg" ) and later the map definition, like this:
<br> <p> Use the map to find the name of the area of attack </p> <IMG SRC="/images/front.jpg" WIDTH=xxx HEIGHT=xxx BORDER=0 alt="" USEMAP="#map"> <MAP NAME="map"> <AREA SHAPE="RECT" COORDS="0,31,46,77" HREF="./no_click.html" alt="sector--A16"> . . (other imap lines) . </MAP>Note that you have to set width and height. usually the imagemap tool does that.
initial.mis -> NM1_initial.mis (this is not longer used, but saveit just in case) geo_obj.data -> NM1_geo_obj.data red_obj.mis -> NM1_red_obj.mis blue_obj.mis -> NM1_blue_obj.mis tank_wp.mis -> NM1_tank_wp.mis city.mis -> NM1_city.mis frontline.mis -> NM1_frontline.mis aircrafts.data -> NM1_aircrafts.data NM1.BMP -> NM1_000.BMP (000 is just to say it is original map image). imap.data -> NM1_imap.data
Now you have to add this map information to the config.pl file. First define a map name ($MAP_NAME_LONG), a
short text with some clear info of map. After that several lines has to be included inside
a if condition:
1) The map image information
2) The tank types to be used as defense and attack for both armyes, and AAA precense
3) The file names for this map.
4) The plane list to be used on this map. (for takeslot.pl form printing)
The MAP_NAME_LOAD (in our example is Normandy/load2.ini) can be extracted by looking into
any template just created. Open with a text editor and dind the line that starts with
"MAP" then copy the information it follows.
$MAP_NAME_LONG="Normandie. June 1944"; if ( $MAP_NAME_LONG eq "Normandie. June 1944") { # 1 . map image information $ANCHO=900; # NM1_000.bmp image width in pixels $ALTO=600; # NM1_000.bmp image height in pixels $H_BLOCK_PIX=60; # horizontal sector size in pixels $V_BLOCK_PIX=60; # vertical sector size in pixeles $LETRAS=16; # map sector letters, 1 in excess (Normandie1 last is O, that is 15) $NUMEROS=11; # map sector numbers, 1 in excess (Normandie1 last number is 10) # 2. tank types and aaa placement $ALLIED_TANKS_ATTK="Armor.3-BT7"; $AXIS_TANKS_ATTK="Armor.3-PzIIIG"; $ALLIED_TANKS_DEF="vehicles.artillery.Artillery\$BT7"; # notice "escaped $" $AXIS_TANKS_DEF="vehicles.artillery.Artillery\$PzIIIG"; # notice "escaped $" $AAA_IN_CHAMPS=0; # place or not place AAA on field champs $LATE_AAA_IN_CHAMPS=0; # place or not place advanced AAA, like nimrod and M16 # 3. file names $GEOGRAFIC_COORDINATES="NM1_geo_obj.data"; $FRONT_LINE="NM1_frontline.mis"; $RED_OBJ_FILE="NM1_red_obj.mis"; $BLUE_OBJ_FILE="NM1_blue_obj.mis"; $CITY_PLACES="NM1_city.mis"; $TANKS_WP="NM1_tank_wp.mis"; $FRONT_IMAGE="NM1_000.bmp"; $IMAP_DATA="NM1_imap.data"; $MAP_NAME_LOAD="Normandy/load2.ini"; $FLIGHTS_DEF="MM1_aircrafts.data"; # 4 . data for takeslot.pl planes names shuld be the exact same used in aircrafts.data) @VVS_SUM_PLANES=("Li-2","TB3-4M-34R"); @VVS_BA_PLANES=("IL2 series1","IL2 series2","SB-2M100A","SB2-M103","SU-2","TB3-4M-34R"); @VVS_AI_PLANES=("Li-2","IL-4-DB3B","PE-2 1940","R-10","SB-2M100A","SB2-M103","SU-2"); @LW_SUM_PLANES=("HE-111H2","JU-52"); @LW_BA_PLANES=("BF-110C4B","HE-111H2","JU-87B2","JU-88A4"); @LW_AI_PLANES=("JU-52","BF-110C4B","JU-88A4"); }
The values on VVS_SUM_PLANES, VVS_BA_PLANES, VVS_AI_PLANES are the suply allowed planes, the bomber attack planes and the AI planes list.Same goes for LW_* fields with axis planes. All this values are used on take_slot.pl to make the plane selection form at creation of missison. The names of the planes needs to be exactly the same as is writed on aircrafts.data file. The ones I printe in example are not for normandie, they are just an example.
When you set the ATTACK tanks types, be sure to include in a variable name called
(TANK_REGEX) a string to identify them. For example if you add KV1 tanks, you have to make
this line:
$TANK_REGEX="Pz|T34|ValentineII|BT7|M4A2|T70"; # tank string identification use | as separatorlook now like:
$TANK_REGEX="Pz|T34|ValentineII|BT7|M4A2|T70|KV1"; # tank string identification use | as separator
Notice that defence tanks names, the static ones, has an escaped $, by adding a backslash before $.For example, the FB object name for a static BT7 is: vehicles.artillery.Artillery$BT7 and you have to add the backslash before the $ simbol, like this: vehicles.artillery.Artillery\$BT7.
For sure the templates take longs to be done, and several files has to be edited, created and changed. After all files are done, you have to test if they are correct, for example, all planes are used, all city and suply city targets are present, the front image and suply image are correclty created, and so on.
I will release more templates, the ones we will use in bellum: Kursk, Smolenk and Balaton. I will not make more templates that the mentioned before. All questions are welcome and for sure I will help to any with template building. At least to the ones they prove have spent some time to understand this manual (besides my bad english) :).
Use the Bellum forum for questions (http://il2fb-bellum.com.ar/foro) and help with problems with templates you are making (If possible provide files you are working on).
Note: I know that small FB maps can work with badc, but I really dont know if generator/parser can handle big maps, those that has 2 letters per sector. (finland, crimea, etc..)
Thats all. :) |
2024-11-18T17:59:32.624851+00:00 | 2021-02-26T01:47:22 | fc6f739c09c15f97643468ade45b1c544e9ca3fb | {
"blob_id": "fc6f739c09c15f97643468ade45b1c544e9ca3fb",
"branch_name": "refs/heads/main",
"committer_date": "2021-02-26T01:47:22",
"content_id": "28eda6e0a940bdb3295c06aa9a7ba413a44efad5",
"detected_licenses": [
"MIT"
],
"directory_id": "6b48cca5873cff360feff1306b0635ec572ea82d",
"extension": "html",
"filename": "RentACar.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 342418304,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 6886,
"license": "MIT",
"license_type": "permissive",
"path": "/views/RentACar.html",
"provenance": "stackv2_html-0000.json.gz:16",
"repo_name": "Smit24-git/CarRental",
"revision_date": "2021-02-26T01:47:22",
"revision_id": "afabbdfdbcdb010ffe18ea607ae37d133a87d04e",
"snapshot_id": "a7cadd5a8aa3e3e1b25e85604a3f28bd7f035a18",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/Smit24-git/CarRental/afabbdfdbcdb010ffe18ea607ae37d133a87d04e/views/RentACar.html",
"visit_date": "2023-03-09T22:02:35.320092"
} | stackv2 | CarsWorld.com
Login
Login
Sign Up
Log Out
Car Name
Are you sure you want to rent this car?
Yes
No
Home
View Car Collection
Compare Cars
Rent a Car
Driving Test [Required]
Rent Car
Sort By:
Name A-Z
Name Z-A
Rent ↑
Rent ↓ |
2024-11-18T17:59:32.640945+00:00 | 2020-06-21T01:46:22 | e232461e5534b8cfbd268b768533b25fe8865a9f | {
"blob_id": "e232461e5534b8cfbd268b768533b25fe8865a9f",
"branch_name": "refs/heads/master",
"committer_date": "2020-06-21T01:46:22",
"content_id": "1a05507f5045372bd08ec12eab744788abd85afc",
"detected_licenses": [
"MIT"
],
"directory_id": "1325b86a5a81283bd268d03d8143cb1d0e03a531",
"extension": "html",
"filename": "recognition.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": null,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 9886,
"license": "MIT",
"license_type": "permissive",
"path": "/recognition.html",
"provenance": "stackv2_html-0000.json.gz:17",
"repo_name": "MattTengtrakool/QuaranGreenWebsite",
"revision_date": "2020-06-21T01:46:22",
"revision_id": "d30aa03d34eb87ae4bb66e53aea473a3c7c480d0",
"snapshot_id": "456b559c8a82316af07ef5181440eeabc677d36a",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/MattTengtrakool/QuaranGreenWebsite/d30aa03d34eb87ae4bb66e53aea473a3c7c480d0/recognition.html",
"visit_date": "2023-03-17T10:48:12.787846"
} | stackv2 | The Power of Youth Challenge, which is made possible through support from the Charles Stewart Mott Foundation, encourages and inspires youth-led remote service projects related to COVID-19 that young people can lead safely from home. QuaranGreen was awarded a mini-grant and guidance from the America's Promise Campaign.
The K4C Program is the bridge between ideas and action. This program provides teens inspiration and financial support to take their ideas and burgeoning projects to the next, increasingly impactful level. These young people are citizen leaders, endeavoring to make and already making a difference in our world. By helping build and better the communities in which they live, they help repair our world. QuaranGreen was honored with a rapid-response COVID-19 grant to expand the organiation.
TThe Young Leaders grant program is geared towards groups led by young adults. Working with the Grass Roots Fund, QuaranGreen has made environmental sustainability and produce security at the cornerstone of its mission, a student-led practice that defines the endurance of young community aid.
In tandem with trainings, mentorship, and peer-to-peer grantee hubs and support groups, The Pollination Project fosters collaboration among grantees and community partners through our global network, providing a wellspring of support to grassroots innovators through financial and non-financial means. QuaranGreen is a proud member of this community and is honored to be awarded the Polination Projects Grant.
Peace First launched a rapid response grant process to help young people around the world lead projects that address community impacts of COVID-19. QuaranGreen started with the kickstarting mini-grant recieved from the PeaceFirst foundation and it grateful for all of the support provided as a part of the PeaceFirst family. |
2024-11-18T17:59:32.641034+00:00 | 2018-05-10T14:36:53 | 4d65c416d60f961a385fc7caecefc21c0cfeb4fa | {
"blob_id": "4d65c416d60f961a385fc7caecefc21c0cfeb4fa",
"branch_name": "refs/heads/master",
"committer_date": "2018-05-10T14:36:53",
"content_id": "250047e32b9532a556fe07342cf4b6b54f1a7dea",
"detected_licenses": [
"MIT"
],
"directory_id": "ff52725cd19fddb7cb3bde5186f512da4a637a84",
"extension": "html",
"filename": "fav-music.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 120779183,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 1229,
"license": "MIT",
"license_type": "permissive",
"path": "/2-20-18/fav-music.html",
"provenance": "stackv2_html-0000.json.gz:18",
"repo_name": "jhunyee/misy350-s18-exercises",
"revision_date": "2018-05-10T14:36:53",
"revision_id": "02811ce6d2ea19fec11180c32d30dc03b138fd51",
"snapshot_id": "6415e86e46c830825c68961b3d54349c492b1ba1",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/jhunyee/misy350-s18-exercises/02811ce6d2ea19fec11180c32d30dc03b138fd51/2-20-18/fav-music.html",
"visit_date": "2021-05-02T11:28:57.853977"
} | stackv2 | I listen to a lot of different kinds of music, ranging from Rap and Hip-Hop to Indie Rock. I am also a big fan of kpop (korean pop). |
2024-11-18T17:59:32.642825+00:00 | 2017-10-29T12:18:36 | b406114c5f5a7a1b1b9aa2f63f978c3b2ff29a80 | {
"blob_id": "b406114c5f5a7a1b1b9aa2f63f978c3b2ff29a80",
"branch_name": "refs/heads/master",
"committer_date": "2017-10-29T12:18:36",
"content_id": "07aefe10cc28d9c3d273e1471b988e8ce1092615",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "2a41b60eb4b7b3556c02add0a74597d6510a8ccf",
"extension": "html",
"filename": "2967.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 86565828,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 6046,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/com/radityalabs/Python/origin/movie/2967.html",
"provenance": "stackv2_html-0000.json.gz:19",
"repo_name": "radityagumay/BenchmarkSentimentAnalysis_2",
"revision_date": "2017-10-29T12:18:36",
"revision_id": "e509a4e749271da701ce9da1d9f16cdd78dcdf40",
"snapshot_id": "fe66d9e7baf561a932bfd0205c47d1d44cb6e6fa",
"src_encoding": "UTF-8",
"star_events_count": 3,
"url": "https://raw.githubusercontent.com/radityagumay/BenchmarkSentimentAnalysis_2/e509a4e749271da701ce9da1d9f16cdd78dcdf40/com/radityalabs/Python/origin/movie/2967.html",
"visit_date": "2020-12-31T07:09:31.676010"
} | stackv2 | PULP FICTION [Spoilers] A film review by Jules N. Binoculas Copyright 1994 Jules N. Binoculas
No doubt many will say that PULP FICTION is one of the year's greatest films--how many will say it's one of cinematic history's most offensive? How many have the guts?
Nor is offensive because the film's director himself appears in an extended cameo to remind his two lead actors that his house is "not a dead nigger storage" facility.
Don't get the wrong idea; these are the film's strengths!
When 19th Century British iconoclast and literary prankster, Oscar Wilde was testifying in his own defense for writing offensive literature--he was asked, "Mr. Wilde, do you feel that work was immoral?," he answered, "It was worse than that. It was badly written."
PULP FICTION is not offensive because it tries to be cute. Call it what you will, but call it "baaad!"
It's probably good manners for your humble reviwer to summarize the plot of this warped and anaemic ego-trip:
A black hitman and a white hitman murder three Causcasian burger-eating adolescents living in a cheesy la-apartment (one of whom bears a frightening resemblance to an uncredited Jerry Seinfeld (believe it or not).
They take a black hostage because the black assassin feels that, although they were shot at close range by the Seinfeld-look-alike, the bullets miraculously only put holes in the wall behind them because God intervened to save their candy a*ses.
Next, they visit Quentin Tarantino, playing a Caucasian suburban Southern California husband married to an African-American nurse who's due home any minute, and would be deeply offended to see a "dead nigger stored in the garage."
To make a 2-hour-and-44-minute story shorter:
Harvey Keitel shows up in black tie and tuxedo to order the hitmen to put the corpse in the trunk, and clean the car to remove blood and "small pieces of brain and skull" with household disinfectants.
During all the unfolding excitement, the white hitman finds time to take his (black) boss's white wife out dancing in a 50's retro drive-in juke joint before she overdoses but survives after heroic medical instructions from Travolta's neurotic (white) drug dealer.
There's probably another subplot, but you get the idea.
Here's the big secret: QT is way over his head! The film is an (amazingly) sometimes humorous non-stop rip-off of every 20th Century media cliche imaginable--complete with no context, no soul, no pacing, no proportion, and no ideas!
Be sure to see it--if you want to encourage independent filmmakers to continue their anal-ysis of modern culture!
Rating: **** (4 assholes)
(Making this film was obviously a ploy to drive up the price of silver used in all the release prints/)
Final recommendation: Hand over your $ and enjoy making others rich!
.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews |
2024-11-18T17:59:32.652031+00:00 | 2023-08-30T02:00:35 | 6cc420bb7cc179ba1b030c1816df3f98212df9f9 | {
"blob_id": "6cc420bb7cc179ba1b030c1816df3f98212df9f9",
"branch_name": "refs/heads/master",
"committer_date": "2023-08-30T02:00:35",
"content_id": "b76cd274c760200ec7cb7db43adf3dbaf7ab1ce7",
"detected_licenses": [
"BSD-2-Clause"
],
"directory_id": "afda17d7310a47142511c9f5d9d9a0a05cfe1ceb",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": "2019-09-27T13:26:58",
"gha_event_created_at": "2022-12-08T06:38:43",
"gha_language": "Python",
"gha_license_id": "BSD-2-Clause",
"github_id": 211325233,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 71226,
"license": "BSD-2-Clause",
"license_type": "permissive",
"path": "/docs/reports/2023/03/22/index.html",
"provenance": "stackv2_html-0000.json.gz:20",
"repo_name": "jpstroop/issue-reporter",
"revision_date": "2023-08-30T02:00:35",
"revision_id": "449728cbf92cc73c8134d10da4aca29868cd6aa8",
"snapshot_id": "7d325f46c3dcddd4bf0aad9eedf2f07d959fdad3",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/jpstroop/issue-reporter/449728cbf92cc73c8134d10da4aca29868cd6aa8/docs/reports/2023/03/22/index.html",
"visit_date": "2023-08-30T21:17:12.164006"
} | stackv2 | @sandbergja I think you might be onto something with your ssh question. Just tried doing this manually and got this error:
pulsys@appdeploy1:~$ sudo su - deploy
deploy@appdeploy1:~$ ssh<EMAIL_ADDRESS>The authenticity of host 'dss-staging1.princeton.edu (<IP_ADDRESS>)' can't be established.
ECDSA key fingerprint is SHA256:y+WbY2eLsmAUj3LsEwECIfQGTj82gg/JHG/bMsAiIbA.
Are you sure you want to continue connecting (yes/no)? yes
Warning: Permanently added 'dss-staging1.princeton.edu' (ECDSA) to the list of known hosts.
Load key "/home/deploy/.ssh/id_rsa": invalid format
<EMAIL_ADDRESS>password:
@sandbergja I noticed that I CAN ssh from appdeploy1 to dss-staging1 if I use the right key, though: ``` deploy@appdeploy1:~/.ssh$ ssh -i CodeDeployKey<EMAIL_ADDRESS>Welcome to Ubuntu 22.04.2 LTS (GNU/Linux 5.15.0-60-generic x86_64)
Support: https://ubuntu.com/advantage
Introducing Expanded Security Maintenance for Applications. Receive updates to over 25,000 software packages with your Ubuntu Pro subscription. Free for personal use.
https://ubuntu.com/pro Last login: Wed Mar 22 14:42:49 2023 from <IP_ADDRESS> ```
mentioned
by Jane Sandberg at 2023-03-22 17:47:38.subscribed
by Jane Sandberg at 2023-03-22 17:47:38.mentioned
by Jane Sandberg at 2023-03-22 17:54:25.subscribed
by Jane Sandberg at 2023-03-22 17:54:25.assigned
by None at 2023-03-22 16:16:00.labeled
by Kevin Reiss at 2023-03-22 16:44:18.unlabeled
by Kevin Reiss at 2023-03-22 16:45:11.referenced
by Kevin Reiss at 2023-03-22 18:19:44.merged
by Kevin Reiss at 2023-03-22 18:19:44.closed
by Kevin Reiss at 2023-03-22 18:19:45.head_ref_deleted
by Kevin Reiss at 2023-03-22 18:19:46.assigned
by Cliff Wulfman at 2023-03-22 12:57:52.review_requested
by Cliff Wulfman at 2023-03-22 14:02:58.https://thesis-central.princeton.edu was released in the production network this morning.
closed
by James R. Griffin III at 2023-03-22 13:53:54.This was confirmed as completed by the reporting user.
closed
by James R. Griffin III at 2023-03-22 13:55:02.I have not been receiving this e-mail on a weekly basis (as I was). I will look to reopen this on SN@P.
This is being actively advanced using a new SN@P ticket, https://princeton.service-now.com/now/workspace/agent/record/incident/8b148fe4873de954731f322d0ebb3583
unassigned
by James R. Griffin III at 2023-03-22 13:55:56.assigned
by James R. Griffin III at 2023-03-22 14:59:59.referenced
by Max Kadel at 2023-03-22 15:04:18.merged
by Max Kadel at 2023-03-22 15:04:19.closed
by Max Kadel at 2023-03-22 15:04:19.head_ref_deleted
by Max Kadel at 2023-03-22 15:04:20.deployed to prod
closed
by Kevin Reiss at 2023-03-22 16:10:51.deployed
by None at 2023-03-22 16:29:01.deployed
by None at 2023-03-22 16:30:31.deployed
by None at 2023-03-22 16:42:19.referenced
by Bess Sadler at 2023-03-22 18:01:01.merged
by Bess Sadler at 2023-03-22 18:01:01.closed
by Bess Sadler at 2023-03-22 18:01:01.head_ref_deleted
by Bess Sadler at 2023-03-22 18:01:02.closed
by Robert-Anthony Lee-Faison at 2023-03-22 18:09:37.referenced
by Bess Sadler at 2023-03-22 18:10:15.merged
by Bess Sadler at 2023-03-22 18:10:15.closed
by Bess Sadler at 2023-03-22 18:10:15.head_ref_deleted
by Bess Sadler at 2023-03-22 18:10:16.referenced
by Bess Sadler at 2023-03-22 18:22:17.merged
by Bess Sadler at 2023-03-22 18:22:17.closed
by Bess Sadler at 2023-03-22 18:22:17.head_ref_deleted
by Bess Sadler at 2023-03-22 18:22:18.closed
by Bess Sadler at 2023-03-22 18:22:19.referenced
by Bess Sadler at 2023-03-22 18:35:25.merged
by Bess Sadler at 2023-03-22 18:35:25.closed
by Bess Sadler at 2023-03-22 18:35:25.head_ref_deleted
by Bess Sadler at 2023-03-22 18:35:26.referenced
by Bess Sadler at 2023-03-22 20:40:36.merged
by Bess Sadler at 2023-03-22 20:40:36.closed
by Bess Sadler at 2023-03-22 20:40:36.head_ref_deleted
by Bess Sadler at 2023-03-22 20:40:37.referenced
by Robert-Anthony Lee-Faison at 2023-03-22 21:02:21.merged
by Robert-Anthony Lee-Faison at 2023-03-22 21:02:21.closed
by Robert-Anthony Lee-Faison at 2023-03-22 21:02:21.head_ref_deleted
by Robert-Anthony Lee-Faison at 2023-03-22 21:02:22.head_ref_force_pushed
by Francis Kayiwa at 2023-03-22 20:11:27.labeled
by Kevin Reiss at 2023-03-22 18:30:08.labeled
by Kevin Reiss at 2023-03-22 18:30:08.labeled
by Kevin Reiss at 2023-03-22 21:50:17.labeled
by Kevin Reiss at 2023-03-22 21:50:17.labeled
by Kevin Reiss at 2023-03-22 21:50:17.unassigned
by James R. Griffin III at 2023-03-22 13:53:01.assigned
by James R. Griffin III at 2023-03-22 14:58:49.referenced
by Bess Sadler at 2023-03-22 16:36:48.merged
by Bess Sadler at 2023-03-22 16:36:48.closed
by Bess Sadler at 2023-03-22 16:36:48.head_ref_deleted
by Bess Sadler at 2023-03-22 16:36:49.This seems to have reoccurred on 03/22/23 (please see the discussion thread beginning with https://pulibrary.slack.com/archives/C02PHG9MGU8/p1679501056444349)
Please see https://github.com/pulibrary/pdc_discovery/issues/400 for reference.
The following ConfigSets are available:
deploy@pdc-discovery-prod2:~$ curl "http://lib-solr-prod6.princeton.edu:8983/solr/admin/configs?action=LIST&omitHeader=true"
{
"configSets":["_default",
"cdh_shxco",
"geniza",
"figgy-production",
"oawaiver-production",
"reserves",
"pdc-discovery-production",
"dpul",
"catalog-production-v2",
"lae",
"cicognara",
"libwww",
"pulmap",
"cdh_ppa",
"pulfalight-production",
"dss-production"]}
Attempting to add a replica node for the existing shard1
failed, as the recovery for the newly-added node is also failing:
The first attempt to invoke REINDEXCOLLECTION
failed due to a server timeout, however, the second (invoked asynchronously) seems to be successful thus far:
pulsys@pdc-discovery-prod2:~$ curl "http://lib-solr-prod6.princeton.edu:8983/solr/admin/collections?action=REINDEXCOLLECTION&name=pdc-discovery-production-2&target=pdc-discovery-production-4&async=pdc-disc-reindex2"
pulsys@pdc-discovery-prod2:~$ curl "http://lib-solr-prod6.princeton.edu:8983/solr/admin/collections?action=REQUESTSTATUS&requestid=pdc-disc-reindex2"
{
"responseHeader":{
"status":0,
"QTime":0},
"status":{
"state":"running",
"msg":"found [pdc-disc-reindex2] in running tasks"}}
Once this has been finished, I believe that I should be able to update the Solr Cloud alias for pdc-discovery-production
While the new Solr Collection was created, the Solr Documents were not migrated:
mentioned
by Hector Correa at 2023-03-22 16:16:23.subscribed
by Hector Correa at 2023-03-22 16:16:23.assigned
by James R. Griffin III at 2023-03-22 16:16:32.assigned
by Hector Correa at 2023-03-22 16:16:41.Manually running the reindex in production took care of these issue, the 4 records are now available in PDC Discovery: * dsp01gt54kr255 * dsp01fq977z011 * dsp01c247dw32c * dsp01j098zf33b
We did notice that the problem is only in production, the four records were already in staging. The culprit seems to be that we have an extra condition in production that is stopping the process.
The reindex task calls the delete index task and that is not allowed in production.
labeled
by James R. Griffin III at 2023-03-22 15:56:08.assigned
by Hector Correa at 2023-03-22 18:52:05.So, I am able to deploy to pas staging locally without making any changes. I suspect the Princeton and Slavery issue may be different from the DSS issue.
referenced
by Max Kadel at 2023-03-22 18:34:24.merged
by Max Kadel at 2023-03-22 18:34:24.closed
by Max Kadel at 2023-03-22 18:34:24.head_ref_deleted
by Max Kadel at 2023-03-22 18:34:25.referenced
by Francis Kayiwa at 2023-03-22 17:33:25.closed
by Max Kadel at 2023-03-22 18:34:25.referenced
by Christina Chortaria at 2023-03-22 21:50:00.merged
by Christina Chortaria at 2023-03-22 21:50:00.closed
by Christina Chortaria at 2023-03-22 21:50:01.head_ref_deleted
by Christina Chortaria at 2023-03-22 21:50:02.referenced
by Trey Pendragon at 2023-03-22 15:40:36.merged
by Trey Pendragon at 2023-03-22 15:40:36.closed
by Trey Pendragon at 2023-03-22 15:40:37.head_ref_deleted
by Trey Pendragon at 2023-03-22 15:40:38.same issue happend with special_collections
labeled
by Kevin Reiss at 2023-03-22 18:22:13.labeled
by Kevin Reiss at 2023-03-22 18:23:46.labeled
by Kevin Reiss at 2023-03-22 18:24:55.Closes #1971
deployed
by None at 2023-03-22 22:15:14.referenced
by Max Kadel at 2023-03-22 15:37:37.merged
by Max Kadel at 2023-03-22 15:37:37.closed
by Max Kadel at 2023-03-22 15:37:37.head_ref_deleted
by Max Kadel at 2023-03-22 15:37:39.referenced
by Bess Sadler at 2023-03-22 16:17:49.merged
by Bess Sadler at 2023-03-22 16:17:50.closed
by Bess Sadler at 2023-03-22 16:17:50.head_ref_deleted
by Bess Sadler at 2023-03-22 16:17:51.This machine connects successfully from the rails console.
also related: https://app.honeybadger.io/projects/65922/faults/82765616#notice-summary
okay it's not connecting from rails console now.
From Lyrasis support:
Sorry about that Anna, we put a new firewall rule in place to rate limit logins to help defend against brute-force attacks, and apparently that's picking up Arclight.
For some reason Arclight does the login thing once a second.
I'll make a change to the rules on the server.
You might just want to double check with Arclight about that login rate, once a second seems surprising.
In this case the source of all the traffic was the PACSCL discovery harvester.
labeled
by None at 2023-03-22 13:25:58.labeled
by None at 2023-03-22 13:25:58.closed
by None at 2023-03-22 15:35:28.labeled
by None at 2023-03-22 15:35:38.deployed
by None at 2023-03-21 23:01:01.referenced
by Christina Chortaria at 2023-03-22 12:39:30.merged
by Christina Chortaria at 2023-03-22 12:39:30.closed
by Christina Chortaria at 2023-03-22 12:39:30.head_ref_deleted
by Christina Chortaria at 2023-03-22 12:39:31.Looks like vm2 is up-to-date now, so this is no longer needed.
closed
by None at 2023-03-22 12:40:11.head_ref_deleted
by None at 2023-03-22 12:40:13.head_ref_force_pushed
by None at 2023-03-22 12:40:27.deployed to prod
assigned
by Kevin Reiss at 2023-03-21 23:21:44.closed
by Kevin Reiss at 2023-03-22 16:11:45.referenced
by Christina Chortaria at 2023-03-22 12:39:10.merged
by Christina Chortaria at 2023-03-22 12:39:10.closed
by Christina Chortaria at 2023-03-22 12:39:10.head_ref_deleted
by Christina Chortaria at 2023-03-22 12:39:11.deployed to prod
assigned
by Kevin Reiss at 2023-03-21 22:31:23.closed
by Kevin Reiss at 2023-03-22 16:13:40.referenced
by Christina Chortaria at 2023-03-22 12:39:54.merged
by Christina Chortaria at 2023-03-22 12:39:54.closed
by Christina Chortaria at 2023-03-22 12:39:54.head_ref_deleted
by Christina Chortaria at 2023-03-22 12:39:55.closing this branch failed to deploy because of https://github.com/pulibrary/pul_library_drupal/issues/1978
closed
by Kevin Reiss at 2023-03-22 16:14:38.deployed to prod
closed
by Kevin Reiss at 2023-03-22 16:15:45.head_ref_force_pushed
by James R. Griffin III at 2023-03-22 14:35:09.convert_to_draft
by James R. Griffin III at 2023-03-22 14:37:32.head_ref_force_pushed
by James R. Griffin III at 2023-03-22 14:52:12.ready_for_review
by James R. Griffin III at 2023-03-22 14:56:37.review_requested
by James R. Griffin III at 2023-03-22 14:57:00.review_requested
by James R. Griffin III at 2023-03-22 14:57:01.referenced
by Hector Correa at 2023-03-22 15:46:33.merged
by Hector Correa at 2023-03-22 15:46:33.closed
by Hector Correa at 2023-03-22 15:46:33.head_ref_deleted
by Hector Correa at 2023-03-22 15:46:34. |
2024-11-18T17:59:32.654567+00:00 | 2021-02-13T05:31:05 | 37b38f26e85c7849b239fcad8e74e7520ed04298 | {
"blob_id": "37b38f26e85c7849b239fcad8e74e7520ed04298",
"branch_name": "refs/heads/master",
"committer_date": "2021-02-13T05:31:05",
"content_id": "5ec82a08e4d019640f15276f51dd318be9782542",
"detected_licenses": [
"MIT"
],
"directory_id": "0feeca5ccb525310e8794501b731714ccfa20eca",
"extension": "html",
"filename": "me.conorthedev.peep.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 263300014,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 4248,
"license": "MIT",
"license_type": "permissive",
"path": "/depictions/web/me.conorthedev.peep.html",
"provenance": "stackv2_html-0000.json.gz:21",
"repo_name": "elprofesor1160/killem",
"revision_date": "2021-02-13T05:31:05",
"revision_id": "6a70e2c97011e2e3e3d755333c2abdc77431c30c",
"snapshot_id": "5da0923059f49934c5ede3c011a5e9e373bddf37",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/elprofesor1160/killem/6a70e2c97011e2e3e3d755333c2abdc77431c30c/depictions/web/me.conorthedev.peep.html",
"visit_date": "2023-03-03T04:42:13.345741"
} | stackv2 | Developer
ConorTheDev
Compatibility: This package is compatible with iOS iOS 12.0 to 13.4.1.
peep is a tweak that allows you to temporarily hide your status bar by tapping on it. It only works on the homescreen and lockscreen at the moment.
The settings instantly apply without the need to respring your device!
Current preference options:
Notes:
🎉 Initial Release! |
2024-11-18T17:59:32.656893+00:00 | 2015-03-19T09:41:01 | 9f6396465e9e0056c947ce29a17f2e6bd966d2f8 | {
"blob_id": "9f6396465e9e0056c947ce29a17f2e6bd966d2f8",
"branch_name": "refs/heads/master",
"committer_date": "2015-03-19T09:41:01",
"content_id": "ae3f2f1296e0037d1e8e0c7f4a6c9eb4a9f50ac5",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "f2c94f27ab6c97689183f62de1d2bffd1d4a5de2",
"extension": "html",
"filename": "template.html",
"fork_events_count": 1,
"gha_created_at": "2015-03-18T17:09:28",
"gha_event_created_at": "2015-04-20T13:23:26",
"gha_language": "HTML",
"gha_license_id": null,
"github_id": 32472678,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 4749,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/template.html",
"provenance": "stackv2_html-0000.json.gz:22",
"repo_name": "PulseCheck/PulseCheck-Email-Template",
"revision_date": "2015-03-19T09:41:01",
"revision_id": "03c14b5c1961f5f503a7b74f83c21f4946328b52",
"snapshot_id": "c2d0bef54a4531bc6a9754fbc89050e2fb7f9495",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/PulseCheck/PulseCheck-Email-Template/03c14b5c1961f5f503a7b74f83c21f4946328b52/template.html",
"visit_date": "2016-09-09T18:27:46.017674"
} | stackv2 |
Jesus look at all of the new we have created. Much News .Very Wow. Can't even handle it, louis guns are out. Bullets and such things: |
2024-11-18T17:59:32.680411+00:00 | 2017-12-10T07:09:19 | 2e7d3398ccea973c8040b7912f216a8df7656ec5 | {
"blob_id": "2e7d3398ccea973c8040b7912f216a8df7656ec5",
"branch_name": "refs/heads/master",
"committer_date": "2017-12-10T07:09:19",
"content_id": "0da6233ec49b26682c196a05d7cf1e18b193ac9c",
"detected_licenses": [
"MIT"
],
"directory_id": "7cabe328b5377a6654f8b4cc1a5c532ef4e4aa10",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 42533633,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 9267,
"license": "MIT",
"license_type": "permissive",
"path": "/_site/languages/index.html",
"provenance": "stackv2_html-0000.json.gz:23",
"repo_name": "ChristopherSalam/blog",
"revision_date": "2017-12-10T07:09:19",
"revision_id": "f3217487b5ee03ea2de454cea77da2471bc7b7bb",
"snapshot_id": "b3f92f4f3850472517e3c3139dd627cca42c26b5",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/ChristopherSalam/blog/f3217487b5ee03ea2de454cea77da2471bc7b7bb/_site/languages/index.html",
"visit_date": "2020-12-25T17:24:13.859766"
} | stackv2 | languages
Even if we all speak a different language we find a way to communicate
The cool icons you see on this page can be found here.
I am preparing for software engineering interviews outside of JavaScript ( ).
Links for job seekers | Languages
While attending a bootcamp you do run into a bit of the dogma surrounding as the Language of the Future .
That's all fine and dandy and perhaps true to some extent, but low and behold we live in the present. And in the present, I've got these annoying interviews asking me about the other languages.
So I've started work on them. Some questions deal with whether language is interpreted and compiled.
Compiled vs. Interpreted Languages.
This is a pretty common question so let's be somewhat exhaustive.
Compiled languages require a compiler (a translator) that convert source code into machine code pre-runtime.
Examples of compiled languages include all family languages, such as , (which compiles to Intermediary Language (IL) then is just-in-time (JIT) compiled to Assembly language), Objective-C , D, Erlang , Go, Haskell , Java , Lisp (can be both), Scala , and Swift in addition to the ones on this list.
Advantages of Compiled Languages
- (1) They run very quickly, as opposed to translated/interpretation.
- (2) Opportunity to apply powerful optimizations during the compile stage.
Disadvantages of Compiled Languages
- (1) Writing a compiler is difficult.
- (2) Code can't be run without compilation
Interpreted or scripted languages have instead of a compiler the ability to process the language on the machine and the code is read step by step.
Advantages of Interpreted/Scripted Languages
- (1) Platform independent, i.e. being standalone.
- (2) Reflection, which means you can use the language to inspect and fix itself.
- (3) Dynamic typing which means that types can be set at runtime.
- (4) Dynamic scoping which I'm going to leave to wikipedia
- (5) Generally a smaller executable program size.
Disadvantages of Interpreted/Scripted Languages
- (1) Bugs from a lack of static type-checking
- (2) Susceptibility to code injection attacks
- (3) Slower execution except where JIT takes place
- (4) Can be read and copied in the case of commercial advantages (bleh)
Examples of Intrepreted Languages are and other languages in the EMCAscript tree (like ActionScript, JScript). This is understanding that doesn't have to be interpreted. Chrome uses compiled just-in-time(JIT), Perl , PHP , Python , Lisp (can be both), Ruby , and R and the other languages here.
HTML is the markup language most web pages and applications have some small bit of. Angular began a process of creating special unique elements, but d3 and other frameworks were making and other elements on the page prior to that. New frameworks such as React don't even use or the DOM until reading a object containing all information of what should be in the DOM (the Shadow DOM) and that allows diff evaluations to take place such that only the changes to the Shadow DOM will be rendered to the DOM.
This is a stub, there's more coming |
2024-11-18T17:59:32.681820+00:00 | 2022-07-14T23:07:33 | 07de69c836487e2314c8b1249a0f07aa2cc641d8 | {
"blob_id": "07de69c836487e2314c8b1249a0f07aa2cc641d8",
"branch_name": "refs/heads/main",
"committer_date": "2022-07-14T23:07:33",
"content_id": "45c3c2ff7e6bdc8055be880c250712caac69ccf5",
"detected_licenses": [
"MIT"
],
"directory_id": "02db1304b280677ccdf6bf4902e40590c094f0bc",
"extension": "html",
"filename": "admin.html",
"fork_events_count": 53,
"gha_created_at": "2017-11-14T14:31:56",
"gha_event_created_at": "2023-02-04T02:14:32",
"gha_language": "HTML",
"gha_license_id": "MIT",
"github_id": 110701087,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 2897,
"license": "MIT",
"license_type": "permissive",
"path": "/src/docroot/main/toplevel/admin.html",
"provenance": "stackv2_html-0000.json.gz:24",
"repo_name": "arnehilmann/markdeck",
"revision_date": "2022-07-14T23:07:33",
"revision_id": "f8ea0b937afce76d0d61e8518325a61f46e90265",
"snapshot_id": "c9a65d94e0a8087cbf0e194fadb9d1d4c501eb65",
"src_encoding": "UTF-8",
"star_events_count": 1185,
"url": "https://raw.githubusercontent.com/arnehilmann/markdeck/f8ea0b937afce76d0d61e8518325a61f46e90265/src/docroot/main/toplevel/admin.html",
"visit_date": "2023-09-02T02:31:31.649960"
} | stackv2 | markdeck v0.60.1
Convert Slides into PDF
Disclaimer: Tested with Google Chrome on MacOS only right now.
- Click render pdf.
- Wait for a fresh browser window to open.
- Wait for the "Choose what to share" dialog.
- Select "Chrome Tab".
- Select "* * * MARKDECK PDF RENDERING * * *".
- Click "Share".
- Wait for the rendering to finish.
- The pdf can be found in the Download location of your browser.
Note: Keep the area of the new window clear! (Screenshots will be taken! Hide your mouse, too!)
More Links
Some helpful resources
(icons, emojis, ...)
The markdeck repo at github
Versions
pandoc 2.18
• revealjs 4.3.1
• impressjs 1.1.0
• asciinemaplayer v2.6.1
• mermaid 9.0.0 |
2024-11-18T17:59:32.683525+00:00 | 2023-06-02T09:44:34 | 503ffe0dca76b848e875cf313ed83ea0fd84b3e6 | {
"blob_id": "503ffe0dca76b848e875cf313ed83ea0fd84b3e6",
"branch_name": "refs/heads/master",
"committer_date": "2023-06-02T09:44:34",
"content_id": "d737c942ebd254753e29b95843a8c2011eed7658",
"detected_licenses": [
"MIT"
],
"directory_id": "3c77e28d2e578f1d960ff49d2bcab2cbc737014c",
"extension": "html",
"filename": "defence-2-1.html",
"fork_events_count": 3,
"gha_created_at": "2017-03-15T12:08:19",
"gha_event_created_at": "2023-06-02T09:44:35",
"gha_language": "HTML",
"gha_license_id": "MIT",
"github_id": 85067901,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 9450,
"license": "MIT",
"license_type": "permissive",
"path": "/app/views/prototypes/features-to-be-built/defendant/task-list/your-defence/defence-2-1.html",
"provenance": "stackv2_html-0000.json.gz:25",
"repo_name": "hmcts/cmc-prototype",
"revision_date": "2023-06-02T09:44:34",
"revision_id": "feb394529a132c77dd87d30f2ad3bd83ce36a148",
"snapshot_id": "b526f8aea778ab11485d225262ea4424d81d2ea1",
"src_encoding": "UTF-8",
"star_events_count": 6,
"url": "https://raw.githubusercontent.com/hmcts/cmc-prototype/feb394529a132c77dd87d30f2ad3bd83ce36a148/app/views/prototypes/features-to-be-built/defendant/task-list/your-defence/defence-2-1.html",
"visit_date": "2023-06-08T08:14:43.852644"
} | stackv2 | {% extends "layout_task-list.html" %} {% block page_title %} Money Claims Prototype {% endblock %} {% block home_link %} ../../task-list {% endblock %} {% block proposition_header %} {% set my_account="1" %} {% include "includes/propositional_navigation.html" %} {% endblock %} {% block content %} {% include "includes/phase_banner_beta.html" %} {% if data.return_page and data.return_page.includes('check-and-send') or data.return_page and data.return_page.includes('check-your-answers')%} {% else %} {% endif %} {{formData | safe}} Add your timeline of events Their timeline Date What happened 03/11/2017 I contacted {% if data.counterclaim=="true" %}Jan Clark{%else%}Mary Richards{% endif %} to discuss building works on our roof. 06/11/2017 We agreed what work should be done and signed a contract. 30/11/2017 The work started on the roof. 21/12/2017 The work on the roof was completed but I noticed that there was a problem with one section. 27/12/2017 I sent an email to Mary Richards and asked them to get the problem fixed. 15/01/2018 I hadn't had a reply so I told them I would be making a money claim. 27/12/2017 I sent an email to Mary Richards and asked them to get the problem fixed. 15/01/2018 I hadn't had a reply so I told them I would be making a money claim. Show more Show less Add your timeline of events (optional) Include dates if you know them. To change the order of your timeline, drag the entry up or down. Explain what happened Date For example, March 2021 What happened For example, you might have signed a contract Action {{data['cd-timeline-1']}} Remove Add new Add new Add any comments about their timeline (optional) {{data['defence-disagree-timeline']}} {% if data.return_page and data.return_page.includes('check-and-send') or data.return_page and data.return_page.includes('check-your-answers')%} Cancel {% else %} {% endif %} {% block page_scripts %} {% endblock %} {% include 'prototypes/prototype-oct-2019/includes/contact.html' %} {% endblock %}
Include dates if you know them.
To change the order of your timeline, drag the entry up or down. |
2024-11-18T17:59:32.683748+00:00 | 2020-09-04T16:46:41 | 3acffdd3cb028f226176d66cbfb9355d847d7ba8 | {
"blob_id": "3acffdd3cb028f226176d66cbfb9355d847d7ba8",
"branch_name": "refs/heads/master",
"committer_date": "2020-09-04T16:46:41",
"content_id": "571791d9907d0ddd50ad5d0ada65e4c287d2cbae",
"detected_licenses": [
"MIT"
],
"directory_id": "fa8b1bb8b278f56599fb5a3c03092564d34069b5",
"extension": "html",
"filename": "48.html",
"fork_events_count": 0,
"gha_created_at": "2020-09-04T16:21:25",
"gha_event_created_at": "2020-09-04T16:21:25",
"gha_language": null,
"gha_license_id": "MIT",
"github_id": 292894326,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 22920,
"license": "MIT",
"license_type": "permissive",
"path": "/SC-Sample-Dataset/SC-Dataset-Sample/docsource/42/48.html",
"provenance": "stackv2_html-0000.json.gz:26",
"repo_name": "MarkFuller1/SurfClipse-Replication-Package-WCRE2014",
"revision_date": "2020-09-04T16:46:41",
"revision_id": "2d00508c72fd7248750a4e3d43ca594c5caa1873",
"snapshot_id": "8050e0f12f2ec20b47dab968be9c717cc8855be6",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/MarkFuller1/SurfClipse-Replication-Package-WCRE2014/2d00508c72fd7248750a4e3d43ca594c5caa1873/SC-Sample-Dataset/SC-Dataset-Sample/docsource/42/48.html",
"visit_date": "2022-12-09T23:59:55.712566"
} | stackv2 | |
|
|
| javaprepare.com
your tool for Java Certification |
home | tutorial | questions | test 1 | test 2
Mock Exam 2 for SCJP 6
The mock exam is modeled on the Sun Certification for Java Programmer SCJP 6 exam. The exam has 29 questions. The real exam may be a little tougher than this. You need to score 58.33% correct answers to clear the real exam. Please let us know at ngabrani AT hotmail dot com if you find any issues with this exam. Some differences between this and the real exam are given below.
- The real exam will be tougher than this.
- The real exam will have 60 questions. This one has only 29
- The real exam would have more programmatic questions. Questions of the type - "what will happen when this code is compiled".
- Which of the following are Java keywords? Select the three correct answers.
- external
- implement
- throw
- void
- integer
- private
- synchronize
- unsigned
- Which of the following are legal definitions of the main method that can be used to execute a class. Select the one correct answer.
- public void main(String args)
- public static int main(String args[])
- public static void main(String args[])
- static public void MAIN(String args[])
- public static void main(string args[])
- public static void main(String *args)
- Which of these are legal array declarations or definitions? Select the two correct answers.
- int[] []x[];
- int *x;
- int x[5];
- int[] x = {1,2,3};
- Name the collection interface used to represent a sequence of numbers in a fixed order.
- The class Hashtable is used to implement which collection interface. Select the one correct answer.
- Table
- List
- Set
- SortedSet
- Map
- What gets printed when the following program is compiled and run? Select the one correct answer.
class test {
public static void main(String args[]) {
int i;
do {
i++;
}
while(i < 0);
System.out.println(i);
}
}
- The program does not compile as i is not initialized.
- The program compiles but does not run.
- The program compiles and runs but does not print anything.
- The program prints 0.
- The program prints 1.
- What gets printed when the following program is compiled and run? Select the one correct answer.
class xyz {
static int i;
public static void main(String args[]) {
while (i < 0) {
i--;
}
System.out.println(i);
}
}
- The program does not compile as i is not initialized.
- The program compiles but does not run.
- The program compiles and runs but does not print anything.
- The program prints 0.
- The program prints 1.
- What gets printed when the following program is compiled and run? Select the one correct answer.
class xyz {
public static void main(String args[]) {
int i,j,k;
for (i = 0; i < 3; i++) {
for(j=1; j < 4; j++) {
for(k=2; k<5; k++) {
if((i == j) && (j==k))
System.out.println(i);
}
}
}
}
}
- 0
- 1
- 2
- 3
- 4
- Using up to four characters what is the Java representation of the number 23 in hex?
- What gets printed when the following program is compiled and run? Select the one correct answer.
class test {
static boolean check;
public static void main(String args[]) {
int i;
if(check == true)
i=1;
else
i=2;
if(i=2) i=i+2;
else i = i + 4;
System.out.println(i);
}
}
- 3
- 4
- 5
- 6
- The program does not compile because of the statement if(i=2)
- Select the one correct answer. The smallest number that can be represented using short primitive type in Java is -
- 0
- -127
- -128
- -16384
- -32768
- The smallest number is compiler dependent.
- Given the following declarations, which of the assignments given in the options below would compile. Select the two correct answers.
int i = 5;
boolean t = true;
float f = 2.3F;
double d = 2.3;
- t = (boolean) i;
- f = d;
- d = i;
- i = 5;
- f = 2.8;
- What gets printed when the following program is compiled and run. Select the one correct answer.
public class incr {
public static void main(String args[]) {
int i , j;
i = j = 3;
int n = 2 * ++i;
int m = 2 * j++;
System.out.println(i + " " + j + " " + n + " " + m);
}
}
- 4 4 8 6
- 4 4 8 8
- 4 4 6 6
- 4 3 8 6
- 4 3 8 8
- 4 4 6 8
- Given two non-negative integers a and b and a String str, what is the number of characters in the expression str.substring(a,b) . Select the one correct answer.
- a + b
- a - b
- b - a - 1
- b - a + 1
- b - a
- b
-
What is the result of compiling and running the following program. Select the one correct answer.
class test {
public static void main(String args[]) {
char ch;
String test2 = "abcd";
String test = new String("abcd");
if(test.equals(test2)) {
if(test == test2)
ch = test.charAt(0);
else
ch = test.charAt(1);
}
else {
if(test == test2)
ch = test.charAt(2);
else
ch = test.charAt(3);
}
System.out.println(ch);
}
}
- 'a'
- 'b'
- 'c'
- 'd'
-
What is the result of compiling and running the following program. Select the one correct answer.
class test {
public static void main(String args[]) {
int i,j=0;
for(i=10;i<0;i--) { j++; }
switch(j) {
case (0) :
j=j+1;
case(1):
j=j+2;
break;
case (2) :
j=j+3;
break;
case (10) :
j=j+10;
break;
default :
break;
}
System.out.println(j);
}
}
- 0
- 1
- 2
- 3
- 10
- 20
- What is the number displayed when the following program is compiled and run.
class test {
public static void main(String args[]) {
test test1 = new test();
System.out.println(test1.xyz(100));
}
public int xyz(int num) {
if(num == 1) return 1;
else return(xyz(num-1) + num);
}
}
- Which of the following statements are true. Select the one correct answer.
- Arrays in Java are essentially objects.
- It is not possible to assign one array to another. Individual elements of array can however be assigned.
- Array elements are indexed from 1 to size of array.
- If a method tries to access an array element beyond its range, a compile warning is generated.
- Which expression can be used to access the last element of an array. Select the one correct answer.
- array[array.length()]
- array[array.length() - 1]
- array[array.length]
- array[array.length - 1]
- What is the result of compiling and running the following program. Select the one correct answer.
class test {
public static void main(String args[]) {
int[] arr = {1,2,3,4};
call_array(arr[0], arr);
System.out.println(arr[0] + "," + arr[1]);
}
static void call_array(int i, int arr[]) {
arr[i] = 6;
i = 5;
}
}
- 1,2
- 5,2
- 1,6
- 5,6
- Which of the following statements are correct. Select the one correct answer.
- Each Java file must have exactly one package statement to specify where the class is stored.
- If a Java file has both import and package statement, the import statement must come before package statement.
- A Java file has at least one class defined.
- If a Java file has a package statement, it must be the first statement (except comments).
-
What happens when the following program is compiled and then the command "java check it out" is executed. Select the one correct answer.
class check {
public static void main(String args[]) {
System.out.println(args[args.length-2]);
}
}
- The program does not compile.
- The program compiles but generates ArrayIndexOutOfBoundsException exception.
- The program prints java
- The program prints check
- The program prints it
- The program prints out
- What all gets printed when the following code is compiled and run. Select the three correct answers.
class test {
public static void main(String args[]) {
int i[] = {0,1};
try {
i[2] = i[0] + i[1];
}
catch(ArrayIndexOutOfBoundsException e1) {
System.out.println("1");
}
catch(Exception e2) {
System.out.println("2");
}
finally {
System.out.println(3);
}
System.out.println("4");
}
}
- 1
- 2
- 3
- 4
- A program needs to store the name, salary, and age of employees in years. Which of the following data types should be used to create the Employee class. Select the three correct answers.
- char
- boolean
- Boolean
- String
- int
- double
- To make a variable defined in a class accessible only to methods defined in the classes in same package, which of the following keyword should be used. Select the one correct answer.
- By using the keyword package before the variable.
- By using the keyword private before the variable.
- By using the keyword protected before the variable.
- By using the keyword public before the variable.
- The variable should not be preceded by any of the above mentioned keywords.
- In implementing two classes Employee and Manager, such that each Manager is an Employee, what should be the relationship between these classes. Select the one correct answer.
- Employee should be the base class of Manager class.
- Manager should be the base class of Employee class.
- Manager class should include the Employee class as a data member.
- Employee class should include Manager class as a data member.
- The Manager and Employee should not have any relationship.
- Select the one most appropriate answer. What is the purpose of method parseInt defined in Integer class.
- The method converts an integer to a String.
- The method is used to convert String to an integer, assuming that the String represents an integer.
- The method is used to convert String to Integer class, assuming that the String represents an integer.
- The method converts the Integer object to a String.
- What should be done to invoke the run() method on a thread for an object derived from the Thread class. Select the one correct answer.
- The run() method should be directly invoked on the Object.
- The start() method should be directly invoked on the Object.
- The init() method should be directly invoked on the Object.
- The creation of the object using the new operator would create a new thread and invoke its run() method.
- What is the default priority of a newly created thread.
- MIN_PRIORITY (which is defined as 1 in the Thread class.)
- NORM_PRIORITY (which is defined as 5 in the Thread class.)
- MAX_PRIORITY (which is defined as 10 in the Thread class.)
- A thread inherits the priority of its parent thread.
Answers to Sample Test 2
- c, d, f
- c. The main method must be static and return void. Hence a and b are incorrect. It must take an array of String as argument. Hence e and f are incorrect. As Java is case sensitive, d is incorrect.
- a, d
- List
- e. The collection interface Map has two implementation HashMap and Hashtable.
- a. Local variables are not initialized by default. They must be initialized before they are used.
- d. The variable i gets initialized to zero. The while loop does not get executed.
- c. During various iterations of three loops, the only time i, j and k have same values are when all of them are set to 2.
- 0x17 or 0X17.
- e. The statement "i=2" evaluates to 2. The expression within the if block must evaluate to a boolean.
- e. The range of short primitive type is -32768 to 32767.
- c,d. Java does not allow casts between boolean values and any numeric types. Hence a is incorrect. Assigning double to a float requires an explicit cast. Hence b and e are incorrect.
- a
- e
- b. Both Strings test and test2 contain "abcd" . They are however located at different memory addresses. Hence test == test2 returns false, and test.equals(test2) returns true.
- d. The for loop does not get executed even once as the condition (i < 0) fails in the first iteration. In the switch statement, the statement j = j +1; gets executed, setting j to 1. As there is no break after this case, the next statement also gets executed setting j to 3.
- 5050. The recursive function xyz essentially sums up numbers 1 to num. This evaluates to (num * (num + 1))/2.
- a. Java supports assignment of one array to another. Hence b is incorrect. Array elements are indexed from 0. Hence c is incorrect. A method that accesses array elements out of its range does not generate a compilation error. Hence d is incorrect.
- d. array.length gives the number of elements in the array. As indexes in Java start from 0, d is the correct answer.
- c. In the invocation of call_array, the first element is invoked using call-by-value, and the second using call-by-reference.
- d. import statement, package statement and class definitions are all optional in a file. Hence a and c are incorrect. If both import and package statements are present in a file, then package statement must appear before the import statement. Hence b is incorrect.
- e. The args array consists of two elements "it" and "out". args.length is set to two.
- a,c,d. The exception ArrayIndexOutOfBoundsException is generated as the main method tries to access i[2]. Hence 1 gets printed. After this finally block gets excuted, before the program exits.
- d,e,f
- e. A data member that does not have public/protected/private is accessible to all methods in the same package.
- a. The Manager and Employee share as "is a" relationship - A Manager is an Employee. This is captured by making Employee the base class of Manager.
- b. The method int parseInt(Sting s) returns the integer value corresponding to input String, assuming that the input string represents an integer in base 10.
- b. The start() method invokes the run() method when the thread is ready to execute.
- d
home | tutorial | questions | test 1
| |
2024-11-18T17:59:32.690863+00:00 | 2020-01-07T21:23:35 | 4686d5cf2d4e73fdba32de923dcb2a23816f8d71 | {
"blob_id": "4686d5cf2d4e73fdba32de923dcb2a23816f8d71",
"branch_name": "refs/heads/master",
"committer_date": "2020-01-07T21:23:35",
"content_id": "d4469642d1c21c2b8060fd097fb24f98b5aebc48",
"detected_licenses": [
"BSD-2-Clause"
],
"directory_id": "8ccfaf3f7dbf31a78ee860d6c1bce41bbb355751",
"extension": "html",
"filename": "5562547235330466615.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": null,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 2094,
"license": "BSD-2-Clause",
"license_type": "permissive",
"path": "/dataset/20191121/00/5562547235330466615.html",
"provenance": "stackv2_html-0000.json.gz:27",
"repo_name": "5l1v3r1/telegram-data-clustering-contest",
"revision_date": "2020-01-07T21:23:35",
"revision_id": "f5fa880068b00b166fcf46b5790f4e9a77ba555e",
"snapshot_id": "95673424bdfcbbbdea02658879312ce1a0f51a43",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/5l1v3r1/telegram-data-clustering-contest/f5fa880068b00b166fcf46b5790f4e9a77ba555e/dataset/20191121/00/5562547235330466615.html",
"visit_date": "2022-04-06T15:09:53.483062"
} | stackv2 | Mikey Williams DROPS 40 POINTS in First HS Game! 🤯
by SLAM StaffMikey Williams is on a mission. Williams, one of the top players in the Class of 2023, put up a 40-piece as San Ysidro (CA) HS opened up its season earlier this week.
Prior to the start of the season, Williams had a 37-point performance. |
2024-11-18T17:59:32.694109+00:00 | 2019-10-04T11:14:39 | bd7236cddf4a58d1d1ee7f046b894b2fe574652f | {
"blob_id": "bd7236cddf4a58d1d1ee7f046b894b2fe574652f",
"branch_name": "refs/heads/master",
"committer_date": "2019-10-04T11:14:39",
"content_id": "55c026a3aa642a7555d983abecba75a9e14a48c6",
"detected_licenses": [
"MIT"
],
"directory_id": "c947d69de36fcbd3ae95f107c8ee24c2943a57c1",
"extension": "html",
"filename": "assignment.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": null,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 7862,
"license": "MIT",
"license_type": "permissive",
"path": "/assignment.html",
"provenance": "stackv2_html-0000.json.gz:28",
"repo_name": "EngineersBox/Quantum-Mechanics-and-Computing",
"revision_date": "2019-10-04T11:14:39",
"revision_id": "a224dddbffe4e9a4899a2bfdfb6c70b5c4202c80",
"snapshot_id": "a83a9879d82d7d6560bc7be2d05d44ea91f50f96",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/EngineersBox/Quantum-Mechanics-and-Computing/a224dddbffe4e9a4899a2bfdfb6c70b5c4202c80/assignment.html",
"visit_date": "2020-08-06T01:36:32.145723"
} | stackv2 | This page is the marking guide to your website that your tutor will use to find your elements. Do not name this page anything other than assignment.html (all lower case) or else we may not be able to find and mark your assignment elements. How to use this page:
Introduction to Quantum Physics
Notes: This gives an idea of the concepts in the topic. However it does not discuss specifics, the specific topics covered can be seen in the site map.
Notes: There is alot of webkit styles, although I am aware some of them are not needed, they are used as a "just in case" precaution.
Notes: The site map is also availble in index.html by clicking the hamburger menu icon in the top right.
Notes: Provide any notes you may have about this element here.
Notes: Provide any notes you may have about this element here.
Notes: Provide any notes you may have about this element here.
Notes: The image map is located at the top of the page regardless of scroll position as it is a fixed element
Notes: Provide any notes you may have about this element here.
I am doing JavaScript
Notes: For the overall site, the JavaScript that i implemented was purely for aesthetic purposes such as animating movements and mouse events. The JavaScript for the quantum mechanics section is for graphical simulation of particles that cannot be achieved with CSS3. The JavaScript for quantum computing simulates qubits and quantum gates, although it is under the restriction of non quantum speeds, it is purely a simulation, this uses (and will use) the actual mathematical representation of qubits and quantum gates to retain as close a similarity as possible.
Notes: To view the side bar, scroll down a bit and a hamburger icon will appear in the top right. Click on it to open the side bar.
JavaScript for quantum mechanics
JavaScript for quantum computation (WIP)
Notes: Provide any notes you may have about this element here.
Notes: Provide any notes you may have about this element here.
Responsive design for smaller screens (all pages)
Notes: To access the alternate themes for the IDE, click the cog icon in the top right of the results panel, then you can choose from a dropdown list. All pages are responsive, utilising media queries to change the single-row design of content sections to double row designs. Also alterting image sizes and content placement.
Notes: Provide any notes you may have about this element here.
Twitter feed of arXiv.org quantum physics paper releases
Notes: Provide any notes you may have about this element here.
Notes: Provide any notes you may have about this element here.
In-browser JavaScript IDE and custom quantum computing JS library (QComp.js)
Notes: The QComp.js library is self built from scatch, you can check the GitLab repository for push updates to see the development process here: https://gitlab.com/EngineersBox/qcompjs.
Replace this line with the date you attended the continuous improvement session. |
2024-11-18T17:59:32.694324+00:00 | 2021-06-14T15:18:58 | 4b88b85f588d06b5ae950e7010c046ce4e806379 | {
"blob_id": "4b88b85f588d06b5ae950e7010c046ce4e806379",
"branch_name": "refs/heads/master",
"committer_date": "2021-06-14T15:18:58",
"content_id": "a17107d518084bd0650c1e87c6354343e21ba1ea",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "3ce2c74c18add751d91363ece6ae0d6be9ac3a17",
"extension": "html",
"filename": "iron-chlorosis.html",
"fork_events_count": 2,
"gha_created_at": "2015-05-29T02:10:37",
"gha_event_created_at": "2022-10-05T20:36:37",
"gha_language": "HTML",
"gha_license_id": "Apache-2.0",
"github_id": 36477529,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 1887,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/gardening/iron-chlorosis.html",
"provenance": "stackv2_html-0000.json.gz:29",
"repo_name": "redbuttegarden/redbuttegarden.github.io",
"revision_date": "2021-06-14T15:18:58",
"revision_id": "db0f0cdaacb07dd268142eb3f1a3300272e39a95",
"snapshot_id": "d735c600fe5b9c90041ac0184ccbfc7d53114824",
"src_encoding": "UTF-8",
"star_events_count": 1,
"url": "https://raw.githubusercontent.com/redbuttegarden/redbuttegarden.github.io/db0f0cdaacb07dd268142eb3f1a3300272e39a95/gardening/iron-chlorosis.html",
"visit_date": "2022-11-01T07:46:33.760440"
} | stackv2 | --- title: Iron Chlorosis layout: default ---
If you've noticed your garden plants producing healthy green leaves in spring that turn yellow as the season progresses, your plants may be suffering from iron chlorosis. Iron chlorosis is a common problem in alkaline soils and is easily recognizable by interveinal chlorosis, which is characterized by yellow leaves with dark green veins.
Iron is a nutrient needed in small amounts by plants and is plentiful in most Utah soils. Unfortunately, the high pH of our soils affects the availability of iron. In high pH soils (pH above 7), the iron rapidly forms solids and, therefore, is not available to plants.
The best solution to iron chlorosis is to choose plants more tolerant of high pH soils and low iron. For existing landscape plants, there are several options, though these are only temporary solutions:
All of these products can be purchased at a local garden store.
To learn more about your garden soil, have your soil tested. Soil testing kits are available from the Utah State Extension office at 2001 South State St., Ste S-1200, Salt Lake City. For a minimal fee they will test soil for pH, major nutrients, organic matter, and texture, as well as make fertilizer recommendations. |
2024-11-18T17:59:32.695518+00:00 | 2020-05-03T22:00:26 | a796b5a495639b362f45f1a7e0ee8b1e2513935e | {
"blob_id": "a796b5a495639b362f45f1a7e0ee8b1e2513935e",
"branch_name": "refs/heads/master",
"committer_date": "2020-05-03T22:26:23",
"content_id": "04f6dc64211e4b2e082941e0c56a1f2d86e8f7cc",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "7773ea6f465ffecfd4f9821aad56ee1eab90d97a",
"extension": "html",
"filename": "StringEqualsEmptyString.html",
"fork_events_count": 0,
"gha_created_at": "2020-05-04T03:48:35",
"gha_event_created_at": "2020-05-04T03:48:36",
"gha_language": null,
"gha_license_id": "Apache-2.0",
"github_id": 261074802,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 486,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/plugins/InspectionGadgets/src/inspectionDescriptions/StringEqualsEmptyString.html",
"provenance": "stackv2_html-0000.json.gz:30",
"repo_name": "aghasyedbilal/intellij-community",
"revision_date": "2020-05-03T22:00:26",
"revision_id": "fa602b2874ea4eb59442f9937b952dcb55910b6e",
"snapshot_id": "5fa14a8bb62a037c0d2764fb172e8109a3db471f",
"src_encoding": "UTF-8",
"star_events_count": 2,
"url": "https://raw.githubusercontent.com/aghasyedbilal/intellij-community/fa602b2874ea4eb59442f9937b952dcb55910b6e/plugins/InspectionGadgets/src/inspectionDescriptions/StringEqualsEmptyString.html",
"visit_date": "2023-04-10T20:55:27.988445"
} | stackv2 | Reports cases when .equals() is called to compare a String with an empty string. In this case, using .isEmpty() is better as
it shows you exactly what you're checking.
"".equals(str) returns false when str is null. For safety, this inspection's quick fix inserts an explicit null-check when
the equals() argument is nullable. Use the checkbox below to suppress the warning in this case. |
2024-11-18T17:59:32.695787+00:00 | 2023-06-13T11:09:58 | 2fb2ea683b01a8eb9f1d28991cbebbdab41b4f1d | {
"blob_id": "2fb2ea683b01a8eb9f1d28991cbebbdab41b4f1d",
"branch_name": "refs/heads/master",
"committer_date": "2023-06-13T11:09:58",
"content_id": "e323bb05c3754763e5142b57809ec6a58343e16b",
"detected_licenses": [],
"directory_id": "d42b86a9186d1fb7bb0f3ba4c1c83b2d74940d6f",
"extension": "html",
"filename": "classcaf_1_1net_1_1web__socket_1_1framing.html",
"fork_events_count": 1,
"gha_created_at": "2014-09-30T19:50:03",
"gha_event_created_at": "2020-09-14T06:54:38",
"gha_language": "Less",
"gha_license_id": "MIT",
"github_id": 24653084,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 63000,
"license": "",
"license_type": "permissive",
"path": "/static/doxygen/0.19.1/classcaf_1_1net_1_1web__socket_1_1framing.html",
"provenance": "stackv2_html-0000.json.gz:31",
"repo_name": "actor-framework/actor-framework.github.io",
"revision_date": "2023-06-13T11:09:58",
"revision_id": "4515111334a2801798da1bb1cdf158694812137c",
"snapshot_id": "6b1e99caea6b391a5251dd0efbcff490e87576b1",
"src_encoding": "UTF-8",
"star_events_count": 2,
"url": "https://raw.githubusercontent.com/actor-framework/actor-framework.github.io/4515111334a2801798da1bb1cdf158694812137c/static/doxygen/0.19.1/classcaf_1_1net_1_1web__socket_1_1framing.html",
"visit_date": "2023-06-23T07:05:21.800859"
} | stackv2 | |
C++ Actor Framework 0.19
|
Implements the WebSocket framing protocol as defined in RFC-6455. More...
#include <framing.hpp>
Public Types | |
| using | binary_buffer = std::vector< std::byte > |
| using | upper_layer_ptr = std::unique_ptr< web_socket::upper_layer > |
Public Member Functions | |
| auto & | up () noexcept |
| const auto & | up () const noexcept |
| auto & | down () noexcept |
| const auto & | down () const noexcept |
| error | start (octet_stream::lower_layer *down) override |
| Initializes the upper layer. | |
| void | abort (const error &reason) override |
| Called by the lower layer for cleaning up any state in case of an error or when disposed. | |
| ptrdiff_t | consume (byte_span input, byte_span) override |
| Consumes bytes from the lower layer. | |
| void | prepare_send () override |
| Gives the upper layer an opportunity to add additional data to the output buffer. | |
| bool | done_sending () override |
| Queries whether all pending data has been sent. | |
| multiplexer & | mpx () noexcept override |
| Returns the multiplexer instance that executes this protocol stack. | |
| bool | can_send_more () const noexcept override |
| Queries whether the output device can accept more data straight away. | |
| void | suspend_reading () override |
Stops reading messages until calling request_messages . | |
| bool | is_reading () const noexcept override |
| Queries whether the lower layer is currently reading from its input device. | |
| void | write_later () override |
| Triggers a write callback after the write device signals downstream capacity. | |
| void | shutdown (status code, std::string_view desc) override |
Sends a shutdown message with custom status code and msg text. | |
| void | request_messages () override |
Pulls messages from the transport until calling suspend_reading . | |
| void | begin_binary_message () override |
| Begins transmission of a binary message. | |
| byte_buffer & | binary_message_buffer () override |
| Returns the buffer for the current binary message. | |
| bool | end_binary_message () override |
| Seals the current binary message buffer and ships a new WebSocket frame. | |
| void | begin_text_message () override |
| Begins transmission of a text message. | |
| text_buffer & | text_message_buffer () override |
| Returns the buffer for the current text message. | |
| bool | end_text_message () override |
| Seals the current text message buffer and ships a new WebSocket frame. | |
| virtual error | start (lower_layer *down)=0 |
| Initializes the upper layer. | |
| virtual ptrdiff_t | consume (byte_span buffer, byte_span delta)=0 |
| Consumes bytes from the lower layer. | |
| virtual void | prepare_send ()=0 |
| Gives the upper layer an opportunity to add additional data to the output buffer. | |
| virtual bool | done_sending ()=0 |
| Queries whether all pending data has been sent. | |
| virtual void | abort (const error &reason)=0 |
| Called by the lower layer for cleaning up any state in case of an error or when disposed. | |
| Public Member Functions inherited from caf::net::web_socket::lower_layer | |
| virtual void | request_messages ()=0 |
Pulls messages from the transport until calling suspend_reading . | |
| virtual void | suspend_reading ()=0 |
Stops reading messages until calling request_messages . | |
| virtual void | begin_binary_message ()=0 |
| Begins transmission of a binary message. | |
| virtual byte_buffer & | binary_message_buffer ()=0 |
| Returns the buffer for the current binary message. | |
| virtual bool | end_binary_message ()=0 |
| Seals the current binary message buffer and ships a new WebSocket frame. | |
| virtual void | begin_text_message ()=0 |
| Begins transmission of a text message. | |
| virtual text_buffer & | text_message_buffer ()=0 |
| Returns the buffer for the current text message. | |
| virtual bool | end_text_message ()=0 |
| Seals the current text message buffer and ships a new WebSocket frame. | |
| void | shutdown () override |
| Shuts down any connection or session gracefully. | |
| void | shutdown (const error &reason) override |
| Shuts down any connection or session du to an error. | |
| virtual void | shutdown (status code, std::string_view msg)=0 |
Sends a shutdown message with custom status code and msg text. | |
| virtual multiplexer & | mpx () noexcept=0 |
| Returns the multiplexer instance that executes this protocol stack. | |
| virtual bool | can_send_more () const noexcept=0 |
| Queries whether the output device can accept more data straight away. | |
| virtual bool | is_reading () const noexcept=0 |
| Queries whether the lower layer is currently reading from its input device. | |
| virtual void | write_later ()=0 |
| Triggers a write callback after the write device signals downstream capacity. | |
| virtual void | shutdown ()=0 |
| Shuts down any connection or session gracefully. | |
| virtual void | shutdown (const error &reason) |
| Shuts down any connection or session du to an error. | |
Static Public Member Functions | |
| static std::unique_ptr< framing > | make_client (upper_layer_ptr up) |
| Creates a new framing protocol for client mode. | |
| static std::unique_ptr< framing > | make_server (upper_layer_ptr up) |
| Creates a new framing protocol for server mode. | |
Public Attributes | |
| bool | mask_outgoing_frames = true |
| When set to true, causes the layer to mask all outgoing frames with a randomly chosen masking key (cf. | |
Implements the WebSocket framing protocol as defined in RFC-6455.
|
overridevirtual |
Called by the lower layer for cleaning up any state in case of an error or when disposed.
Implements caf::net::generic_upper_layer.
|
overridevirtual |
Begins transmission of a binary message.
Implements caf::net::web_socket::lower_layer.
|
overridevirtual |
Begins transmission of a text message.
Implements caf::net::web_socket::lower_layer.
|
overridevirtual |
Returns the buffer for the current binary message.
Must be called between calling begin_binary_message
and end_binary_message
.
Implements caf::net::web_socket::lower_layer.
|
overridevirtualnoexcept |
Queries whether the output device can accept more data straight away.
Implements caf::net::generic_lower_layer.
|
overridevirtual |
Consumes bytes from the lower layer.
| buffer | Available bytes to read. |
| delta | Bytes that arrived since last calling this function. |
Implements caf::net::octet_stream::upper_layer.
|
overridevirtual |
Queries whether all pending data has been sent.
The lower calls this function to decide whether it has to wait for write events on the socket.
Implements caf::net::generic_upper_layer.
|
overridevirtual |
Seals the current binary message buffer and ships a new WebSocket frame.
Implements caf::net::web_socket::lower_layer.
|
overridevirtual |
Seals the current text message buffer and ships a new WebSocket frame.
Implements caf::net::web_socket::lower_layer.
|
overridevirtualnoexcept |
Queries whether the lower layer is currently reading from its input device.
Implements caf::net::generic_lower_layer.
|
overridevirtualnoexcept |
Returns the multiplexer instance that executes this protocol stack.
Implements caf::net::generic_lower_layer.
|
overridevirtual |
Gives the upper layer an opportunity to add additional data to the output buffer.
Implements caf::net::generic_upper_layer.
|
overridevirtual |
Pulls messages from the transport until calling suspend_reading
.
Implements caf::net::web_socket::lower_layer.
|
overridevirtual |
Sends a shutdown message with custom status code
and msg
text.
Implements caf::net::web_socket::lower_layer.
|
overridevirtual |
Initializes the upper layer.
| down | A pointer to the lower layer that remains valid for the lifetime of the upper layer. |
Implements caf::net::octet_stream::upper_layer.
|
overridevirtual |
Stops reading messages until calling request_messages
.
Implements caf::net::web_socket::lower_layer.
|
overridevirtual |
Returns the buffer for the current text message.
Must be called between calling begin_text_message
and end_text_message
.
Implements caf::net::web_socket::lower_layer.
|
overridevirtual |
Triggers a write callback after the write device signals downstream capacity.
Does nothing if this layer is already writing.
Implements caf::net::generic_lower_layer.
| bool caf::net::web_socket::framing::mask_outgoing_frames = true |
When set to true, causes the layer to mask all outgoing frames with a randomly chosen masking key (cf.
RFC 6455, Section 5.3). Servers may set this to false, whereas clients are required to always mask according to the standard. |
2024-11-18T17:59:32.706896+00:00 | 2018-11-13T14:20:22 | e52f7b785280d3a4220a3a70cd41b25fff447baa | {
"blob_id": "e52f7b785280d3a4220a3a70cd41b25fff447baa",
"branch_name": "refs/heads/master",
"committer_date": "2018-11-13T14:20:22",
"content_id": "546594dd581e6c7bf7daa4373b7445679103124f",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "5a1972793c80802ced82c0b5e09a1506791ac55a",
"extension": "html",
"filename": "Microx_concretizer.main-c.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": null,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 6377,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/bap/api/v1.4.0/Microx_concretizer.main-c.html",
"provenance": "stackv2_html-0000.json.gz:32",
"repo_name": "yqyunjie/binaryanalysisplatform.github.io",
"revision_date": "2018-11-13T14:20:22",
"revision_id": "7eec206a1201a736e1363aaa01518ed82dd76f88",
"snapshot_id": "9c4e9ae31032223206a9440e13ad0afeb52f3abf",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/yqyunjie/binaryanalysisplatform.github.io/7eec206a1201a736e1363aaa01518ed82dd76f88/bap/api/v1.4.0/Microx_concretizer.main-c.html",
"visit_date": "2020-04-10T05:29:57.065316"
} | stackv2 | class[#Expi.context]
main :?memory:addr -> word option -> ?lookup:var -> word option -> ?random_seed:int -> ?reg_policy:policy -> ?mem_policy:policy -> unit ->
[#Expi.context as 'a]
expi
It can be used as mixin class for other interpreters.
memory
: returns a byte value at the given address, if knownlookup
: returns a value of a given variable, if knownrandom_seed
: if non None
the the value is used to
initialize the pseudo random generator.reg_policy
: a policy for concretizing register values;mem_policy
: a policy for concretizing heap values. |
2024-11-18T17:59:32.717541+00:00 | 2019-11-14T11:30:25 | 70d025558940d96894495b9ffec66d6f9b8c6a29 | {
"blob_id": "70d025558940d96894495b9ffec66d6f9b8c6a29",
"branch_name": "refs/heads/master",
"committer_date": "2019-11-14T11:30:25",
"content_id": "f10538e61c5e2891451c513ad36d25a41fc206d2",
"detected_licenses": [
"MIT"
],
"directory_id": "836080f79b4ef1615637f7cb6af376be6eeef1db",
"extension": "html",
"filename": "ui-manager.html",
"fork_events_count": 0,
"gha_created_at": "2018-12-03T09:41:29",
"gha_event_created_at": "2022-12-10T08:55:44",
"gha_language": "CSS",
"gha_license_id": "MIT",
"github_id": 160167358,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 3521,
"license": "MIT",
"license_type": "permissive",
"path": "/public/tests/ui-manager.html",
"provenance": "stackv2_html-0000.json.gz:33",
"repo_name": "OllieFordandCo/ui-manager",
"revision_date": "2019-11-14T11:30:25",
"revision_id": "b5eabaa1a875bbf826d6675eed0911379126e08d",
"snapshot_id": "6d649e1183e910e35ce9732859de04f1a34ed660",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/OllieFordandCo/ui-manager/b5eabaa1a875bbf826d6675eed0911379126e08d/public/tests/ui-manager.html",
"visit_date": "2022-12-23T16:31:14.360903"
} | stackv2 | amaranth
Social Network Engine for Laravel
Login
Access your account
Username:
Password:
Remember this device
Login
Register for the beta
Forgot Password? |
2024-11-18T17:59:32.721447+00:00 | 2018-06-14T04:57:06 | ba5dcfffc6bbddcd024e08a821c7dd5fac63a33a | {
"blob_id": "ba5dcfffc6bbddcd024e08a821c7dd5fac63a33a",
"branch_name": "refs/heads/master",
"committer_date": "2018-06-14T04:57:06",
"content_id": "61f1285ce6a9b452795334205295e320f621ef96",
"detected_licenses": [
"Unlicense"
],
"directory_id": "5223b4efa719f200ced8bca36b61ab0585505418",
"extension": "htm",
"filename": "default.htm",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 137006700,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 3945,
"license": "Unlicense",
"license_type": "permissive",
"path": "/StackBot/wwwroot/default.htm",
"provenance": "stackv2_html-0000.json.gz:34",
"repo_name": "Armando-GarzaTech/StackBot",
"revision_date": "2018-06-14T04:57:06",
"revision_id": "94a0a32848064fddae81054e65df5bedf5c5790f",
"snapshot_id": "4260671fa9d0a1c8e10bba532f206223ceec3308",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/Armando-GarzaTech/StackBot/94a0a32848064fddae81054e65df5bedf5c5790f/StackBot/wwwroot/default.htm",
"visit_date": "2020-03-20T01:43:49.256240"
} | stackv2 | Visit Bot Framework to register your bot. When you register, remember to set the endpoint to:
To debug you bot using the Bot Framework Emulator, paste this URL into the Emulator window: |
2024-11-18T17:59:32.721585+00:00 | 2020-01-07T21:23:35 | 799c07d577ed54d9e23744b66edac1d0be71157d | {
"blob_id": "799c07d577ed54d9e23744b66edac1d0be71157d",
"branch_name": "refs/heads/master",
"committer_date": "2020-01-07T21:23:35",
"content_id": "fdabb44e940b3aaae71ee0ee4816dce3a91703ff",
"detected_licenses": [
"BSD-2-Clause"
],
"directory_id": "8ccfaf3f7dbf31a78ee860d6c1bce41bbb355751",
"extension": "html",
"filename": "3142837110702890898.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": null,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 2477,
"license": "BSD-2-Clause",
"license_type": "permissive",
"path": "/dataset-test/en/20191209/13/3142837110702890898.html",
"provenance": "stackv2_html-0000.json.gz:35",
"repo_name": "5l1v3r1/telegram-data-clustering-contest",
"revision_date": "2020-01-07T21:23:35",
"revision_id": "f5fa880068b00b166fcf46b5790f4e9a77ba555e",
"snapshot_id": "95673424bdfcbbbdea02658879312ce1a0f51a43",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/5l1v3r1/telegram-data-clustering-contest/f5fa880068b00b166fcf46b5790f4e9a77ba555e/dataset-test/en/20191209/13/3142837110702890898.html",
"visit_date": "2022-04-06T15:09:53.483062"
} | stackv2 | Azimut Exploration (CVE:AZM) Hits New 52-Week High at $0.50
by Teresa GrahamAzimut Exploration Inc. (CVE:AZM) reached a new 52-week high during mid-day trading on Monday . The stock traded as high as C$0.50 and last traded at C$0.50, with a volume of 40200 shares. The stock had previously closed at C$0.46.
The company has a market capitalization of $26.11 million and a P/E ratio of -98.00. The company has a 50 day moving average of C$0.41 and a 200-day moving average of C$0.37.
Azimut Exploration Company Profile (CVE:AZM)
Azimut Exploration Inc engages in the acquisition, exploration, and evaluation of mineral properties in Canada. It explores for copper, gold, zinc, silver, cobalt, tungsten, rare earth elements, uranium, chromium, nickel, and platinum group elements, as well as base metals. The company holds interests in the Kaanaayaa Property comprises 390 claims covering 200.5 square kilometers located in the James Bay region of Quebec.
See Also: Different Types of Derivatives |
2024-11-18T17:59:32.723688+00:00 | 2016-05-06T18:23:20 | 951e756f38cea81b11b49dcdb1d05186212ae843 | {
"blob_id": "951e756f38cea81b11b49dcdb1d05186212ae843",
"branch_name": "refs/heads/master",
"committer_date": "2016-05-06T18:23:20",
"content_id": "539410d517d45ed06fb724b316b6d4163fa0cdd3",
"detected_licenses": [
"MIT"
],
"directory_id": "c20d615c4acbb285ba8f8efba23323928061dacb",
"extension": "html",
"filename": "t8-tech.html",
"fork_events_count": 0,
"gha_created_at": "2015-05-22T17:49:30",
"gha_event_created_at": "2015-05-25T19:41:45",
"gha_language": "HTML",
"gha_license_id": null,
"github_id": 36086905,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 3352,
"license": "MIT",
"license_type": "permissive",
"path": "/blog/t8-tech.html",
"provenance": "stackv2_html-0000.json.gz:36",
"repo_name": "jbomotti/jbomotti.github.io",
"revision_date": "2016-05-06T18:23:20",
"revision_id": "569ad60a70e48e28d822f2e60c16dabafccabd06",
"snapshot_id": "e632362f1f8535d86b7428b4599b08aac21551bc",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/jbomotti/jbomotti.github.io/569ad60a70e48e28d822f2e60c16dabafccabd06/blog/t8-tech.html",
"visit_date": "2021-01-21T13:57:06.902701"
} | stackv2 | SQL Injection
Because Some People Enjoy Being Terrible
Tuesday, July 14, 2015
"I just learned all this cool stuff about relational databases and SQL and can't wait to integrate it into my site!" Said...well, I'm sure at least one person in history. Rightfully so, I suppose, as from what we have touched on so far, these appear to be very powerful tools for handling and accessing vast quantities of data. With all this power though (oh yeah, I'm going there), comes great responsibility. SQL might be a superhero when it comes to accessing data in relational databases, but it comes with it's own potential kryptonite, SQL Injection.
SQL Injection is most often an intentional attack on a website or database by a malicious user. It can come in a number of different forms, but the idea behind them all is the same. An application asks for some user input, and that input is inserted into an SQL statement. Pretty standard procedure, until Ms./Mr. Code Injector comes along. Assume you ask a user for their username and then stick their input into an SQL statement like this:
statement = "SELECT * FROM users WHERE name = '" + userName +"';"
Any expected input such as jbomotti
would pull up information for the specified user, so no big deal, right? Wrong. If the aforementioned code injector decided to input something like ' OR '1'='1
they would get much more than just information on one user. This would change the statement into:
SELECT * FROM users WHERE name = '' OR '1'='1';
Since '1'='1'
will always evaluate to true
, this statement now turns into a massive data dump of all the data in the users
table. Not exactly what you'd call great, but certainly not unheard of even among some big name companies. What's the main cause for this vulnerability? Lazy programmers (and not in the good DRY way of lazy).
There are actually some pretty simple ways to remove all SQL Injection vulnerabilities from your web application. The easiest, and arguably (or just outright) most effective way using PHP is hexadecimal conversion. There are two functions, DECHEX()
which converts any integer value, and BIN2HEX()
which converts any other type of variable. Used together with a call to UNHEX()
in the statement, the value isn't applied until after the statement is interpreted. Voila, SQL injection denied.
Conclusion/TL;DR So we learned a bit about SQL this week. Super useful and awesome, but also highly vulnerable to malicious malcontents. Luckily, this vulnerability is also easily avoided by the conscientious coder. So now, go forth, make wonderful web apps and protect your SQL statements!! |
2024-11-18T17:59:32.723757+00:00 | 2019-07-12T03:56:11 | 202f5b43526e5a65f24c45983f4c681ffa2124ab | {
"blob_id": "202f5b43526e5a65f24c45983f4c681ffa2124ab",
"branch_name": "refs/heads/master",
"committer_date": "2019-07-12T03:56:11",
"content_id": "1914f2296c87b792b8d57b773977ef696e283e6d",
"detected_licenses": [
"MIT"
],
"directory_id": "cc2b9ceb5dd8725346c356c6c8b8e6775bcb8558",
"extension": "html",
"filename": "Reference.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 162957593,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 45475,
"license": "MIT",
"license_type": "permissive",
"path": "/bin/Plugin/Lua-cURLv3/doc/Reference.html",
"provenance": "stackv2_html-0000.json.gz:37",
"repo_name": "amenoyoya/SeleneTalk",
"revision_date": "2019-07-12T03:56:11",
"revision_id": "0794fdb937c4c9efa898d0958e4ab008c948ecc0",
"snapshot_id": "16c51d02346f18ce2ebc919e6e79fd77a1474f24",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/amenoyoya/SeleneTalk/0794fdb937c4c9efa898d0958e4ab008c948ecc0/bin/Plugin/Lua-cURLv3/doc/Reference.html",
"visit_date": "2020-04-13T04:18:53.419317"
} | stackv2 | Module lcurl
Functions
| form () | Create HTTP multipart/formdata object. |
| easy ([options]) | Create Easy object |
| multi ([options]) | Create Multi object |
| share ([options]) | Create Share object |
| version () | Returns libcurl version as human readable string |
| version_info ([param]) | Returns libcurl version as table |
Class httpform
| httpform:add_content (name, content[, type[, headers]]) | Add new part to form. |
| httpform:add_buffer (name, filename, content[, type[, headers]]) | Add new part to form. |
| httpform:add_file (name, path[, type[, filename[, headers]]]) | Add new part to form. |
| httpform:add_stream (name[, filename][, type][, headers], size, reader[, context]) | Add new part to form. |
| httpform:get () | Serialize multipart/formdata HTTP POST chain. |
| httpform:get (writer[, context]) | Serialize multipart/formdata HTTP POST chain. |
| httpform:get (writer) | Serialize multipart/formdata HTTP POST chain. |
| httpform:free () | Free multipart/formdata. |
Class easy
Class multi
| multi:add_handle (handle) | Add Easy object. |
| multi:remove_handle (handle) | Remove Easy object. |
| multi:perfom () | reads/writes available data from each easy handle. |
| multi:info_read ([remove]) | Read multi stack informationals. |
| multi:setopt (opt, ...) | Set options. |
| multi:socket_action ([socket=curl.SOCKET_TIMEOUT[, mask=0]]) | Perform socket action. |
| multi:setopt_timerfunction (timer[, context]) | Set timer callback. |
| multi:setopt_timerfunction (timer) | Set timer callback. |
| multi:wait ([timeout]) | Polls on all easy objects in a multi object. |
| multi:timeout () | How long to wait for action before proceeding. |
| multi:close () | End multi session. |
Class error
| error:category () | Get the error category. |
| error:no () | Get the number value of error. |
| error:name () | Get the error name. |
| error:msg () | Get the error description. |
| error:__tostring () | Get the full error description. |
Class share
| share:setopt (opt, ...) | Set options. |
| share:close () | End share session. |
Functions
- form ()
-
Create HTTP multipart/formdata object.
Returns:
-
httpform
new curl HTTP Post object context
- easy ([options])
-
Create Easy object
Parameters:
- options table
Returns:
-
easy
new curl easy object
Usage:
c = curl.easy{ url = 'http://example.com', [curl.OPT_VERBOSE] = true, }
- multi ([options])
-
Create Multi object
Parameters:
- options table
Returns:
-
multi
new curl multi object
Usage:
m = curl.multi{ socketfunction = handle_socket; timerfunction = start_timeout; }
- share ([options])
-
Create Share object
Parameters:
- options table
Returns:
-
share
new curl share object
- version ()
- Returns libcurl version as human readable string
- version_info ([param])
-
Returns libcurl version as table
Parameters:
- param string specific version info
Returns:
-
table
full version into if `param` was not specify
Or
-
specific info parameter
Usage:
proto = curl.version_info('protocols') if proto.HTTP then ... -- libcurl support http protocol
Class httpform
- httpform:add_content (name, content[, type[, headers]])
-
Add new part to form.
Parameters:
- name string provide the name of this part
- content string actual data to send
- type string provides the content-type for this part
- headers table specifies extra headers for the form POST section
Returns:
-
self
- httpform:add_buffer (name, filename, content[, type[, headers]])
-
Add new part to form.
Parameters:
- name string provide the name of this part
- filename string provides the filename field in the content header
- content string actual data to send
- type string provides the content-type for this part
- headers table specifies extra headers for the form POST section
Returns:
-
self
- httpform:add_file (name, path[, type[, filename[, headers]]])
-
Add new part to form.
Parameters:
- name string provide the name of this part
- path string path to file that contain actual data to send
- type string provides the content-type for this part
- filename string provides the filename field in the content header. By default it is basename of path.
- headers table specifies extra headers for the form POST section
Returns:
-
self
- httpform:add_stream (name[, filename][, type][, headers], size, reader[, context])
-
Add new part to form.
Parameters:
- name string provide the name of this part
- filename string provides the filename field in the content header.
- type string provides the content-type for this part
- headers table specifies extra headers for the form POST section
- size number stream size in bytes
- reader function/object
- context reader context
Returns:
-
self
See also:
- httpform:get ()
-
Serialize multipart/formdata HTTP POST chain.
Returns:
-
string serialized data
Usage:
print(post:get())
- httpform:get (writer[, context])
-
Serialize multipart/formdata HTTP POST chain.
Writer function can return true or number of written bytes. Also if function does not return anything is considered as success.
Parameters:
- writer function
- context writer context
Returns:
-
self
Usage:
t = {} post:get(table.insert, t) print(table.concat(t))
- httpform:get (writer)
-
Serialize multipart/formdata HTTP POST chain.
This call same as httpform:get(writer.write, writer)
Parameters:
- writer object
Returns:
-
self
Usage:
f = io.open(...) post:get(f)
- httpform:free ()
- Free multipart/formdata.
Class easy
- easy:perfom ()
-
Perform a file transfer
Returns:
-
self
- easy:escape (url)
-
URL encodes the given string
Parameters:
- url string
Returns:
-
encoded url
- easy:unescape (url)
-
URL decodes the given string
Parameters:
- url string
Returns:
-
decoded url
- easy:reset ()
-
Re-initializes all options previously set.
Returns:
-
easy
self
- easy:pause (mask)
-
Pause and unpause a connection.
Parameters:
- mask number set of bits that sets the new state of the connection (one of PAUSE_XXX constant)
Returns:
-
easy
self
- easy:close ()
- End easy session
- easy:setopt (opt, ...)
-
Set options.
Parameters:
- opt number or table one of `curl.OPT_XXX` constant or options table
- ... value
Returns:
-
easy
self
Usage:
c:setopt(curl.OPT_URL, "http://example.com") c:setopt(curl.OPT_READFUNCTION, function(t, n) return table.remove(t) end, {"1111", "2222"} ) c:setopt{ url = 'http://example.com', [curl.OPT_VERBOSE] = true, }
- easy:unsetopt (opt)
-
Reset option to default value.
Parameters:
- opt number one of `curl.OPT_XXX` constant or options table
Returns:
-
easy
self
Usage:
c:unsetopt(curl.OPT_URL) c:unsetopt(curl.OPT_READFUNCTION)
- easy:getinfo (info)
-
Get information.
Parameters:
- info number one of `curl.INFO_XXX` constant
Returns:
-
value
Usage:
print(c:getinfo(curl.INFO_EFFECTIVE_URL)) print(c:getinfo(curl.INFO_TOTAL_TIME)) print(c:getinfo(curl.INFO_RESPONSE_CODE))
- easy:setopt_writefunction (writer[, context])
-
Set writer function.
A callback accepting one or two parameters. The first is the writer context if any, and the second is a string with the data to be written. Function must return `true` (any non number true value) or full data length or nothing to continue operation. Otherwise the transfer will be aborted with an error.
Parameters:
- writer function
- context writer context
Returns:
-
self
- easy:setopt_writefunction (writer)
-
Set writer function.
This call same as easy:setopt_writefunction(writer.write, writer)
Parameters:
- writer object
Returns:
-
self
- easy:setopt_headerfunction (writer[, context])
-
Set header function.
A callback accepting one or two parameters. The first is the writer context if any, and the second is a string with the data to be written. Function must return `true` (any non number true value) or full data length or nothing to continue operation. Otherwise the transfer will be aborted with an error.
Parameters:
- writer function
- context writer context
Returns:
-
self
- easy:setopt_headerfunction (writer)
-
Set header function.
This call same as easy:setopt_headerfunction(writer.header, writer)
Parameters:
- writer object
Returns:
-
self
- easy:setopt_readfunction (reader[, context])
-
Set reader function.
A callback accepting one or two parameters. The first is the reader context if any, and the second is the maximum amount of data to be read. You can ignore second argument and pass as mach data as you need. lcurl can split data. Function must return data to continue operation. To stop operation it must return empty string or nil or nothing. Otherwise the transfer will be aborted with an error.
Parameters:
- reader function
- context reader context
Returns:
-
self
Usage:
local counter = 10 c:setopt_readfunction(function() if counter > 0 then counter = counter - 1 return 'a' end end)
- easy:setopt_readfunction (reader)
-
Set reader function.
This call same as easy:setopt_readfunction(reader.read, reader)
Parameters:
- reader object
Returns:
-
self
- easy:setopt_progressfunction (progress[, context])
-
Set progress function.
A callback accepting four or five parameters. The first is the reader context if any, the second is the total number of bytes expected to be downloaded in this transfer, the third is the number of bytes downloaded so far, the fourth is the total number of bytes expected to be uploaded in this transfer, and the fifth is the number of bytes uploaded so far. Function must return `true` or `1` or nothing to continue operation. Otherwise the transfer will be aborted with an error `ABORTED_BY_CALLBACK`.
!!! NOTE !!! This is differents form libcurl API. In libcurl returning a non-zero value from this callback will cause libcurl to abort the transfer and return. This done to be consisted with writefunction that should return `true` to continue.
Parameters:
- progress function
- context progress context
Returns:
-
self
- easy:setopt_progressfunction (progress)
-
Set progress function.
This call same as easy:setopt_progressfunction(progress.progress, progress)
Parameters:
- progress object
Returns:
-
self
- easy:setopt_httppost (data)
-
Set HTTP multipart/formdata.
Caller does not have to save data.
Parameters:
- data httpform
Returns:
-
self
- easy:setopt_postfields (data[, length=#data])
-
Set HTTP multipart/formdata.
Parameters:
- data string
- length number (default #data)
Returns:
-
self
- easy:setopt_share (data)
-
Set curl share object.
Caller does not have to save data.
Parameters:
- data share
Returns:
-
self
Class multi
- multi:add_handle (handle)
-
Add Easy object.
Caller must ensure that easy object is alive until end of operation.
Parameters:
- handle easy
Returns:
-
multi
self
- multi:remove_handle (handle)
-
Remove Easy object.
Parameters:
- handle easy
Returns:
-
multi
self
- multi:perfom ()
-
reads/writes available data from each easy handle.
Returns:
-
number
handles number of active easy handles
- multi:info_read ([remove])
-
Read multi stack informationals.
Note. If curl_multi_remove_handle fail then there no error occure but handle jast stay in multi handle.
Parameters:
- remove remove easy handle if it done.
Returns:
-
number
0 there no informationals
Or
- easy handle
- boolean true
Or
- multi:setopt (opt, ...)
-
Set options.
Parameters:
- opt number or table one of `curl.OPT_MULTI_XXX` constant
- ... value
Returns:
-
multi
self
Usage:
c:setopt(curl.OPT_MULTI_MAXCONNECTS, 10) c:setopt{maxconnects = 10}
- multi:socket_action ([socket=curl.SOCKET_TIMEOUT[, mask=0]])
-
Perform socket action.
Parameters:
- socket number (default curl.SOCKET_TIMEOUT)
- mask number (default 0)
Returns:
-
multi
self
Usage:
c:socket_action() c:socket_action(sock_fd, curl.CSELECT_IN) c:socket_action(sock_fd, curl.CSELECT_OUT)
- multi:setopt_timerfunction (timer[, context])
-
Set timer callback.
Parameters:
- timer function timer callback
- context timer context
Returns:
-
multi
self
- multi:setopt_timerfunction (timer)
-
Set timer callback.
This call same as easy:setopt_writefunction(timer.timer, timer)
Parameters:
- timer userdata or table timer object
Returns:
-
multi
self
- multi:wait ([timeout])
-
Polls on all easy objects in a multi object.
Parameters:
- timeout number milliseconds timeout. By default it is `multi:timeout()`.
Returns:
-
number
number of affected objects
- multi:timeout ()
-
How long to wait for action before proceeding.
Returns:
-
number
timeout milliseconds timeout
- multi:close ()
- End multi session.
Class error
- error:category ()
-
Get the error category.
Returns:
-
number
number of error category (curl.ERROR_XXX constants)
Usage:
if err:category() == curl.ERROR_EASY then -- proceed easy error end
- error:no ()
-
Get the number value of error.
Returns:
-
number
number of error (curl.E_XXX constants)
- error:name ()
-
Get the error name.
Returns:
-
string
error name (e.g. "UNSUPPORTED_PROTOCOL", "BAD_OPTION")
- error:msg ()
-
Get the error description.
Returns:
-
string
error description (e.g. "Login denied")
- error:__tostring ()
-
Get the full error description.
Returns:
-
string
string that contain name, message and number of error |
2024-11-18T17:59:32.731955+00:00 | 2023-08-05T16:03:38 | 6565ec70d6d1402fc5141e2f0a856ae1c7267b4f | {
"blob_id": "6565ec70d6d1402fc5141e2f0a856ae1c7267b4f",
"branch_name": "refs/heads/gh-pages",
"committer_date": "2023-08-05T16:03:38",
"content_id": "5470abd74aab38c07dae9605ea4ada301899f0f5",
"detected_licenses": [
"MIT"
],
"directory_id": "4dd66666e197afd328ae5c08373d161f869609d7",
"extension": "html",
"filename": "footer.html",
"fork_events_count": 0,
"gha_created_at": "2019-05-27T14:03:38",
"gha_event_created_at": "2019-05-27T23:04:10",
"gha_language": "HTML",
"gha_license_id": "MIT",
"github_id": 188854357,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 3507,
"license": "MIT",
"license_type": "permissive",
"path": "/_includes/footer.html",
"provenance": "stackv2_html-0000.json.gz:38",
"repo_name": "ITShirre/www.shirre.com",
"revision_date": "2023-08-05T16:03:38",
"revision_id": "30f681ddced5744bcac19706962361f65ace6a5e",
"snapshot_id": "0bb489f44c8726409768b2bbaa4e73d730861321",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/ITShirre/www.shirre.com/30f681ddced5744bcac19706962361f65ace6a5e/_includes/footer.html",
"visit_date": "2023-08-17T08:12:02.328589"
} | stackv2 | Shirre Lab Corp. is a materials technology company specializing in FPC solutions for high-speed and high-frequency communications. Shirre is one of the only a handful of teams worldwide to possess the combination of skills required to succeed in bringing these products to market. |
2024-11-18T17:59:32.734022+00:00 | 2018-06-24T09:00:24 | bc63a55799cf4f20ccdf269f4b92bf74e0d5fb37 | {
"blob_id": "bc63a55799cf4f20ccdf269f4b92bf74e0d5fb37",
"branch_name": "refs/heads/master",
"committer_date": "2018-06-24T09:00:24",
"content_id": "98516a31e93cdf75a80feb76c67aefa550d0da70",
"detected_licenses": [
"MIT"
],
"directory_id": "b7772a566c811450c46d6c1c95751b628bd6d790",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 138457992,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 1314,
"license": "MIT",
"license_type": "permissive",
"path": "/index.html",
"provenance": "stackv2_html-0000.json.gz:39",
"repo_name": "jbar894/basicVue",
"revision_date": "2018-06-24T09:00:24",
"revision_id": "50e2f4eea30dc5c5bfe32454ef130592b2e89b73",
"snapshot_id": "29e76287967246f5fca1d33aa3b0dc347253ab4e",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/jbar894/basicVue/50e2f4eea30dc5c5bfe32454ef130592b2e89b73/index.html",
"visit_date": "2020-03-21T10:33:37.977307"
} | stackv2 | Searching for: {{ isPowerSyntaxEnabled }}
Beers
Breweries
Selected: {{ searchIndexes }}
Searching for: {{ result }} |
2024-11-18T17:59:32.734228+00:00 | 2023-08-11T06:01:29 | ca035597d1df734ae3ab1c0612a4f2ece8d83b6e | {
"blob_id": "ca035597d1df734ae3ab1c0612a4f2ece8d83b6e",
"branch_name": "refs/heads/master",
"committer_date": "2023-08-11T06:01:29",
"content_id": "4ab96a4b293df2c333e920b3aa5ebecb78cbfa30",
"detected_licenses": [
"BSD-3-Clause"
],
"directory_id": "f61c1625c5fed3c45ed0680e2810cff5b4b22bd5",
"extension": "html",
"filename": "vulkan__helper_8h.html",
"fork_events_count": 8,
"gha_created_at": "2014-10-18T07:31:48",
"gha_event_created_at": "2018-03-29T09:29:21",
"gha_language": "C++",
"gha_license_id": "BSD-3-Clause",
"github_id": 25390728,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 72053,
"license": "BSD-3-Clause",
"license_type": "permissive",
"path": "/docs/vulkan__helper_8h.html",
"provenance": "stackv2_html-0000.json.gz:40",
"repo_name": "dimi309/small3d",
"revision_date": "2023-08-11T06:01:29",
"revision_id": "fe3d259869145b165dcc1b9cecb8936ec00735b1",
"snapshot_id": "e5b0726d86af38e36f3ad65a9e10340479657f66",
"src_encoding": "UTF-8",
"star_events_count": 54,
"url": "https://raw.githubusercontent.com/dimi309/small3d/fe3d259869145b165dcc1b9cecb8936ec00735b1/docs/vulkan__helper_8h.html",
"visit_date": "2023-08-16T18:11:14.269324"
} | stackv2 | |
The small3d library
|
Vulkan helper functions. More...
#include <vulkan/vulkan.h>
Go to the source code of this file.
Functions | |
| int | vh_copy_depth_to_shadow_image () |
| Copy the depth image to the shadow image. | |
| void | vh_wait_gpu_cpu_fence (uint32_t idx) |
| Wait on a GPU-CPU fence. More... | |
| int | vh_create_instance (const char *application_name, const char **enabled_extension_names, size_t enabled_extension_count) |
| Create a vulkan instance. More... | |
| int | vh_clear_depth_image (VkCommandBuffer *command_buffer) |
| Clear the depth image. More... | |
| int | vh_init (uint32_t max_frames) |
| Initialise. Internally this means create physical device, select queue families and create logical device. More... | |
| int | vh_set_width_height (const uint32_t width, const uint32_t height) |
| Set width and height for all rendering calculations. More... | |
| int | vh_create_swapchain () |
| Create the swapchain that will be used. This will also create the associated image views. More... | |
| int | vh_destroy_swapchain (void) |
| Destroy the swapchain. More... | |
| int | vh_create_pipeline (const char *vertex_shader_path, const char *fragment_shader_path, int(*set_input_state)(VkPipelineVertexInputStateCreateInfo *), int(*set_pipeline_layout)(VkPipelineLayoutCreateInfo *), uint32_t *index) |
| Create a pipeline. This will also create associated Vulkan objects. More... | |
| int | vh_destroy_pipeline (uint32_t index) |
| Destroy a pipeline. More... | |
| int | vh_begin_draw_command_buffer (VkCommandBuffer *command_buffer) |
| Begin creating a drawing command buffer. More... | |
| int | vh_bind_pipeline_to_command_buffer (uint32_t pipeline_index, const VkCommandBuffer *command_buffer) |
| Bind a pipeline to a command buffer. More... | |
| int | vh_end_draw_command_buffer (VkCommandBuffer *command_buffer) |
| Finish recording a command buffer. More... | |
| int | vh_destroy_draw_command_buffer (VkCommandBuffer *command_buffer) |
| Destroy a command buffer. More... | |
| int | vh_create_sync_objects (void) |
| Create sync objects. More... | |
| int | vh_destroy_sync_objects (void) |
| Destroy sync objects. More... | |
| int | vh_recreate_pipelines_and_swapchain (void) |
| Recreate the swapchain and the pipelines. More... | |
| int | vh_acquire_next_image (uint32_t pipeline_index, uint32_t *image_index, uint32_t *frame_index_out) |
| Acquire next swapchain image. More... | |
| int | vh_present_next_image (void) |
| Present next swapchain image (the one acquired by vh_acquire_next_image()) More... | |
| int | vh_draw (VkCommandBuffer *command_buffer, int only_shadows) |
| Send draw commands (will take effect on the current pipeline image acquired by vh_acquire_next_image()) More... | |
| int | vh_create_buffer (VkBuffer *buffer, VkBufferUsageFlags buffer_usage_flags, uint32_t buffer_size, VkDeviceMemory *memory, VkMemoryPropertyFlags memory_property_flags) |
| Create a buffer. More... | |
| int | vh_destroy_buffer (VkBuffer buffer, VkDeviceMemory memory) |
| Destroy a buffer. More... | |
| int | vh_copy_buffer (VkBuffer source, VkBuffer destination, VkDeviceSize size) |
| Copy a buffer to another. More... | |
| int | vh_create_image (VkImage *image, uint32_t image_width, uint32_t image_height, VkFormat image_format, VkImageTiling image_tiling, VkImageUsageFlags image_usage_flags, VkDeviceMemory *memory, VkMemoryPropertyFlags memory_property_flags) |
| Create a Vulkan image. More... | |
| int | vh_destroy_image (VkImage image, VkDeviceMemory image_memory) |
| Destroy a Vulkan image. More... | |
| int | vh_transition_image_layout (VkImage image, VkFormat format, VkImageLayout old_layout, VkImageLayout new_layout, int only_depth) |
| Transition the layout of a Vulkan image. More... | |
| int | vh_copy_buffer_to_image (VkBuffer buffer, VkImage image, uint32_t width, uint32_t height) |
| Copy a buffer to an image. More... | |
| int | vh_create_image_view (VkImageView *image_view, VkImage image, VkFormat format, VkImageAspectFlags aspect_flags) |
| Create a Vulkan image view. More... | |
| int | vh_create_sampler (VkSampler *sampler, VkSamplerAddressMode addressMode) |
| Create a Vulkan sampler. More... | |
| int | vh_create_depth_to_shadow_copy_cmd () |
| Create command buffer that copies depth to shadow image. | |
| int | vh_destroy_depth_to_shadow_copy_cmd () |
| Destroy command buffer that copies depth to shadow image. | |
| int | vh_shutdown (void) |
| Cleanup the memory, destroy any debug callbacks, as well as the logical device and the Vulkan instance. More... | |
Variables | |
| uint32_t | vh_new_pipeline_state |
| Has a pipeline just been created or recreated? | |
| VkInstance | vh_instance |
| The Vulkan instance. | |
| VkSurfaceKHR | vh_surface |
| The surface on which graphics will be presented. | |
| VkPhysicalDevice | vh_physical_device |
| The physical device that is selected vh_init(). | |
| VkDevice | vh_logical_device |
| The logical device that is created by vh_init(). | |
| VkPipelineLayout * | vh_pipeline_layout |
| The pipeline layouts, one for each pipeline created. | |
| uint32_t | vh_swapchain_image_count |
| Number of images in the swapchain, set by vh_create_swapchain(). | |
| VkClearColorValue | vh_clear_colour |
| The colour used to clear the screen. | |
| VkImage | vh_shadow_image |
| The image used for shadow mapping. | |
| VkDeviceMemory | vh_shadow_image_memory |
| The image memory used for shadow mapping. | |
| VkImageView | vh_shadow_image_view |
| The image view used for shadow mapping. | |
| VkCommandBuffer | cmd_buffer_copy_depth_to_shadow |
Vulkan helper functions.
Created on: 2018/05/01 License: MIT Copyright 2017 - 2022 Dimitri Kourkoulis
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
| int vh_acquire_next_image | ( | uint32_t | pipeline_index, |
| uint32_t * | image_index, | ||
| uint32_t * | frame_index_out | ||
| ) |
Acquire next swapchain image.
| pipeline_index | The index of the pipeline |
| image_index | The index of the acquired swapchain image |
| frame_index_out | [out] The frame index (used for async rendering - different from image_index) |
| int vh_begin_draw_command_buffer | ( | VkCommandBuffer * | command_buffer | ) |
Begin creating a drawing command buffer.
| command_buffer | Pointer to the command buffer. |
| int vh_bind_pipeline_to_command_buffer | ( | uint32_t | pipeline_index, |
| const VkCommandBuffer * | command_buffer | ||
| ) |
Bind a pipeline to a command buffer.
| pipeline_index | The index of the pipeline |
| command_buffer | Pointer to the command buffer. |
| int vh_clear_depth_image | ( | VkCommandBuffer * | command_buffer | ) |
Clear the depth image.
| command_buffer | The command buffer to record the clearing command to |
| int vh_copy_buffer | ( | VkBuffer | source, |
| VkBuffer | destination, | ||
| VkDeviceSize | size | ||
| ) |
Copy a buffer to another.
| source | The source buffer |
| destination | The destination buffer |
| size | The size of the buffer to be copied, in bytes |
| int vh_copy_buffer_to_image | ( | VkBuffer | buffer, |
| VkImage | image, | ||
| uint32_t | width, | ||
| uint32_t | height | ||
| ) |
Copy a buffer to an image.
| buffer | The buffer |
| image | The image |
| width | The width of the image |
| height | The height of the image |
| int vh_create_buffer | ( | VkBuffer * | buffer, |
| VkBufferUsageFlags | buffer_usage_flags, | ||
| uint32_t | buffer_size, | ||
| VkDeviceMemory * | memory, | ||
| VkMemoryPropertyFlags | memory_property_flags | ||
| ) |
Create a buffer.
| buffer | Variable in which to store the buffer |
| buffer_usage_flags | Vulkan usage flags for the buffer |
| buffer_size | The size of the buffer, in bytes |
| memory | The GPU memory reserved for the buffer |
| memory_property_flags | Vulkan properties of the reserved memory |
| int vh_create_image | ( | VkImage * | image, |
| uint32_t | image_width, | ||
| uint32_t | image_height, | ||
| VkFormat | image_format, | ||
| VkImageTiling | image_tiling, | ||
| VkImageUsageFlags | image_usage_flags, | ||
| VkDeviceMemory * | memory, | ||
| VkMemoryPropertyFlags | memory_property_flags | ||
| ) |
Create a Vulkan image.
| image | Variable in which to store the image |
| image_width | The width of the image |
| image_height | The height of the image |
| image_format | The format of the image |
| image_tiling | The tiling of the image |
| image_usage_flags | The usage flags of the image |
| memory | The GPU memory reserved for the image |
| memory_property_flags | Vulkan properties of the reserved memory |
| int vh_create_image_view | ( | VkImageView * | image_view, |
| VkImage | image, | ||
| VkFormat | format, | ||
| VkImageAspectFlags | aspect_flags | ||
| ) |
Create a Vulkan image view.
| image_view | The image view to be created |
| image | The image for which the image view will be created |
| format | The image view format |
| aspect_flags | The aspect flags (mask) e.g. VK_IMAGE_ASPECT_COLOR_BIT |
| int vh_create_instance | ( | const char * | application_name, |
| const char ** | enabled_extension_names, | ||
| size_t | enabled_extension_count | ||
| ) |
Create a vulkan instance.
| application_name | The name of the application that will be using Vulkan |
| enabled_extension_names | Names of extensions used |
| enabled_extension_count | Number of extensions used |
| int vh_create_pipeline | ( | const char * | vertex_shader_path, |
| const char * | fragment_shader_path, | ||
| int(*)(VkPipelineVertexInputStateCreateInfo *) | set_input_state, | ||
| int(*)(VkPipelineLayoutCreateInfo *) | set_pipeline_layout, | ||
| uint32_t * | index | ||
| ) |
Create a pipeline. This will also create associated Vulkan objects.
| vertex_shader_path | The path to the SPV file for the vertex shader that will be used in the pipeline. |
| fragment_shader_path | The path to the SPV file for the fragment shader that will be used in the pipeline. |
| set_input_state | Callback function, allowing e.g. the addition of information on buffers that will be used by the pipeline (vertex, uniform) before the pipeline is created. If there is no such information to be added, NULL should be passed here. |
| set_pipeline_layout | Callback function, allowing e.g. the addition of information on descriptors that will be used by the pipeline before the pipeline is created. If there is no such information to be added, NULL should be passed here. |
| index | If 100 is passed here, a new "slot" will be used for the pipeline and returned via the same variable. If not, the pipeline will be created over a previously deleted pipeline at the index position of the internal array containing pipelines. In that case, the shader path parameters will be ignored, because the previously used shaders will be reused. Also in that case the callback functions parameters will be ignored. |
| int vh_create_sampler | ( | VkSampler * | sampler, |
| VkSamplerAddressMode | addressMode | ||
| ) |
Create a Vulkan sampler.
| sampler | The sampler to be created |
| int vh_create_swapchain | ( | ) |
Create the swapchain that will be used. This will also create the associated image views.
| int vh_create_sync_objects | ( | void | ) |
Create sync objects.
| int vh_destroy_buffer | ( | VkBuffer | buffer, |
| VkDeviceMemory | memory | ||
| ) |
Destroy a buffer.
| buffer | The buffer to be destroyed |
| memory | The GPU memory previously reserved for the buffer, to be released |
| int vh_destroy_draw_command_buffer | ( | VkCommandBuffer * | command_buffer | ) |
Destroy a command buffer.
| command_buffer | Pointer to the command buffer. |
| int vh_destroy_image | ( | VkImage | image, |
| VkDeviceMemory | image_memory | ||
| ) |
Destroy a Vulkan image.
| image | The image to be destroyed |
| image_memory | The GPU memory previously reserved for the image, to be released |
| int vh_destroy_pipeline | ( | uint32_t | index | ) |
Destroy a pipeline.
| index | The index of the pipeline to destroy |
| int vh_destroy_swapchain | ( | void | ) |
Destroy the swapchain.
| int vh_destroy_sync_objects | ( | void | ) |
Destroy sync objects.
| int vh_draw | ( | VkCommandBuffer * | command_buffer, |
| int | only_shadows | ||
| ) |
Send draw commands (will take effect on the current pipeline image acquired by vh_acquire_next_image())
| command_buffer | Pointer to the command buffer containing the commands. |
| only_shadows | Only drawing shadows? |
| int vh_end_draw_command_buffer | ( | VkCommandBuffer * | command_buffer | ) |
Finish recording a command buffer.
| command_buffer | Pointer to the command buffer. |
| int vh_init | ( | uint32_t | max_frames | ) |
Initialise. Internally this means create physical device, select queue families and create logical device.
| max_frames | Maximum number of frames to be rendering to asynchronously |
| int vh_present_next_image | ( | void | ) |
Present next swapchain image (the one acquired by vh_acquire_next_image())
| int vh_recreate_pipelines_and_swapchain | ( | void | ) |
Recreate the swapchain and the pipelines.
| int vh_set_width_height | ( | const uint32_t | width, |
| const uint32_t | height | ||
| ) |
Set width and height for all rendering calculations.
| width | The new width |
| height | The new height |
| int vh_shutdown | ( | void | ) |
Cleanup the memory, destroy any debug callbacks, as well as the logical device and the Vulkan instance.
| int vh_transition_image_layout | ( | VkImage | image, |
| VkFormat | format, | ||
| VkImageLayout | old_layout, | ||
| VkImageLayout | new_layout, | ||
| int | only_depth | ||
| ) |
Transition the layout of a Vulkan image.
| image | The Vulkan image |
| format | The image format |
| old_layout | The old layout |
| new_layout | The new layout |
| only_depth | Only a depth image? |
| void vh_wait_gpu_cpu_fence | ( | uint32_t | idx | ) |
Wait on a GPU-CPU fence.
| idx | The GPU-CPU fence index | |
2024-11-18T17:59:32.736968+00:00 | 2018-03-07T14:27:12 | 304a16391e5fe7887b19848561c02fe9f5f6be49 | {
"blob_id": "304a16391e5fe7887b19848561c02fe9f5f6be49",
"branch_name": "refs/heads/master",
"committer_date": "2018-03-07T14:27:12",
"content_id": "88a8e3109f5a2c1d29d317121921510d0389a2bf",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "72f5c69dcc6926957e1898176336764e621edca4",
"extension": "html",
"filename": "LazyList.java.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 123951817,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 56262,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/pitReports/201803070005/org.apache.commons.collections4.list/LazyList.java.html",
"provenance": "stackv2_html-0000.json.gz:41",
"repo_name": "ffiacco/pitest",
"revision_date": "2018-03-07T14:27:12",
"revision_id": "9a3183f87d2be6410ee98cdf4cad7da1154d47d0",
"snapshot_id": "48b93c84e9d2ebaf1854e733215fde61328cce5c",
"src_encoding": "UTF-8",
"star_events_count": 1,
"url": "https://raw.githubusercontent.com/ffiacco/pitest/9a3183f87d2be6410ee98cdf4cad7da1154d47d0/pitReports/201803070005/org.apache.commons.collections4.list/LazyList.java.html",
"visit_date": "2021-04-26T23:13:47.751610"
} | stackv2 | | 1 | /* | |
| 2 | * Licensed to the Apache Software Foundation (ASF) under one or more | |
| 3 | * contributor license agreements. See the NOTICE file distributed with | |
| 4 | * this work for additional information regarding copyright ownership. | |
| 5 | * The ASF licenses this file to You under the Apache License, Version 2.0 | |
| 6 | * (the "License"); you may not use this file except in compliance with | |
| 7 | * the License. You may obtain a copy of the License at | |
| 8 | * | |
| 9 | * http://www.apache.org/licenses/LICENSE-2.0 | |
| 10 | * | |
| 11 | * Unless required by applicable law or agreed to in writing, software | |
| 12 | * distributed under the License is distributed on an "AS IS" BASIS, | |
| 13 | * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | |
| 14 | * See the License for the specific language governing permissions and | |
| 15 | * limitations under the License. | |
| 16 | */ | |
| 17 | package org.apache.commons.collections4.list; | |
| 18 | ||
| 19 | import java.util.List; | |
| 20 | ||
| 21 | import org.apache.commons.collections4.Factory; | |
| 22 | ||
| 23 | /** | |
| 24 | * Decorates another <code>List</code> to create objects in the list on demand. | |
| 25 | * <p> | |
| 26 | * When the {@link #get(int)} method is called with an index greater than | |
| 27 | * the size of the list, the list will automatically grow in size and return | |
| 28 | * a new object from the specified factory. The gaps will be filled by null. | |
| 29 | * If a get method call encounters a null, it will be replaced with a new | |
| 30 | * object from the factory. Thus this list is unsuitable for storing null | |
| 31 | * objects. | |
| 32 | * <p> | |
| 33 | * For instance: | |
| 34 | * | |
| 35 | * <pre> | |
| 36 | * Factory<Date> factory = new Factory<Date>() { | |
| 37 | * public Date create() { | |
| 38 | * return new Date(); | |
| 39 | * } | |
| 40 | * } | |
| 41 | * List<Date> lazy = LazyList.decorate(new ArrayList<Date>(), factory); | |
| 42 | * Date date = lazy.get(3); | |
| 43 | * </pre> | |
| 44 | * | |
| 45 | * After the above code is executed, <code>date</code> will contain | |
| 46 | * a new <code>Date</code> instance. Furthermore, that <code>Date</code> | |
| 47 | * instance is the fourth element in the list. The first, second, | |
| 48 | * and third element are all set to <code>null</code>. | |
| 49 | * <p> | |
| 50 | * This class differs from {@link GrowthList} because here growth occurs on | |
| 51 | * get, where <code>GrowthList</code> grows on set and add. However, they | |
| 52 | * could easily be used together by decorating twice. | |
| 53 | * <p> | |
| 54 | * This class is Serializable from Commons Collections 3.1. | |
| 55 | * | |
| 56 | * @see GrowthList | |
| 57 | * @since 3.0 | |
| 58 | * @version $Id: LazyList.java 1686855 2015-06-22 13:00:27Z tn $ | |
| 59 | */ | |
| 60 | public class LazyList<E> extends AbstractSerializableListDecorator<E> { | |
| 61 | ||
| 62 | /** Serialization version */ | |
| 63 | private static final long serialVersionUID = -1708388017160694542L; | |
| 64 | ||
| 65 | /** The factory to use to lazily instantiate the objects */ | |
| 66 | private final Factory<? extends E> factory; | |
| 67 | ||
| 68 | /** | |
| 69 | * Factory method to create a lazily instantiating list. | |
| 70 | * | |
| 71 | * @param <E> the type of the elements in the list | |
| 72 | * @param list the list to decorate, must not be null | |
| 73 | * @param factory the factory to use for creation, must not be null | |
| 74 | * @return a new lazy list | |
| 75 | * @throws NullPointerException if list or factory is null | |
| 76 | * @since 4.0 | |
| 77 | */ | |
| 78 | public static <E> LazyList<E> lazyList(final List<E> list, final Factory<? extends E> factory) { | |
| 79 |
1
1. lazyList : mutated return of Object value for org/apache/commons/collections4/list/LazyList::lazyList to ( if (x != null) null else throw new RuntimeException ) → KILLED |
return new LazyList<E>(list, factory); |
| 80 | } | |
| 81 | ||
| 82 | //----------------------------------------------------------------------- | |
| 83 | /** | |
| 84 | * Constructor that wraps (not copies). | |
| 85 | * | |
| 86 | * @param list the list to decorate, must not be null | |
| 87 | * @param factory the factory to use for creation, must not be null | |
| 88 | * @throws NullPointerException if list or factory is null | |
| 89 | */ | |
| 90 | protected LazyList(final List<E> list, final Factory<? extends E> factory) { | |
| 91 | super(list); | |
| 92 |
1
1. |
if (factory == null) { |
| 93 | throw new IllegalArgumentException("Factory must not be null"); | |
| 94 | } | |
| 95 | this.factory = factory; | |
| 96 | } | |
| 97 | ||
| 98 | //----------------------------------------------------------------------- | |
| 99 | /** | |
| 100 | * Decorate the get method to perform the lazy behaviour. | |
| 101 | * <p> | |
| 102 | * If the requested index is greater than the current size, the list will | |
| 103 | * grow to the new size and a new object will be returned from the factory. | |
| 104 | * Indexes in-between the old size and the requested size are left with a | |
| 105 | * placeholder that is replaced with a factory object when requested. | |
| 106 | * | |
| 107 | * @param index the index to retrieve | |
| 108 | * @return the element at the given index | |
| 109 | */ | |
| 110 | @Override | |
| 111 | public E get(final int index) { | |
| 112 | final int size = decorated().size(); | |
| 113 |
2
1. get : changed conditional boundary → SURVIVED 2. get : negated conditional → KILLED |
if (index < size) { |
| 114 | // within bounds, get the object | |
| 115 | E object = decorated().get(index); | |
| 116 |
1
1. get : negated conditional → SURVIVED |
if (object == null) { |
| 117 | // item is a place holder, create new one, set and return | |
| 118 | object = factory.create(); | |
| 119 | decorated().set(index, object); | |
| 120 |
1
1. get : mutated return of Object value for org/apache/commons/collections4/list/LazyList::get to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE |
return object; |
| 121 | } | |
| 122 | // good and ready to go | |
| 123 |
1
1. get : mutated return of Object value for org/apache/commons/collections4/list/LazyList::get to ( if (x != null) null else throw new RuntimeException ) → KILLED |
return object; |
| 124 | } | |
| 125 | // we have to grow the list | |
| 126 |
3
1. get : Changed increment from 1 to -1 → TIMED_OUT 2. get : changed conditional boundary → KILLED 3. get : negated conditional → KILLED |
for (int i = size; i < index; i++) { |
| 127 | decorated().add(null); | |
| 128 | } | |
| 129 | // create our last object, set and return | |
| 130 | final E object = factory.create(); | |
| 131 | decorated().add(object); | |
| 132 |
1
1. get : mutated return of Object value for org/apache/commons/collections4/list/LazyList::get to ( if (x != null) null else throw new RuntimeException ) → KILLED |
return object; |
| 133 | } | |
| 134 | ||
| 135 | @Override | |
| 136 | public List<E> subList(final int fromIndex, final int toIndex) { | |
| 137 | final List<E> sub = decorated().subList(fromIndex, toIndex); | |
| 138 |
1
1. subList : mutated return of Object value for org/apache/commons/collections4/list/LazyList::subList to ( if (x != null) null else throw new RuntimeException ) → NO_COVERAGE |
return new LazyList<E>(sub, factory); |
| 139 | } | |
| 140 | ||
| 141 | } | |
Mutations | ||
| 79 |
1.1 |
|
| 92 |
1.1 |
|
| 113 |
1.1 2.2 |
|
| 116 |
1.1 |
|
| 120 |
1.1 |
|
| 123 |
1.1 |
|
| 126 |
1.1 2.2 3.3 |
|
| 132 |
1.1 |
|
| 138 |
1.1 | |
2024-11-18T17:59:32.739069+00:00 | 2020-01-11T17:53:14 | 5475b4a3ac7aab7e6512e7f71682859f5d149cc7 | {
"blob_id": "5475b4a3ac7aab7e6512e7f71682859f5d149cc7",
"branch_name": "refs/heads/master",
"committer_date": "2020-01-11T17:53:14",
"content_id": "f006856de08e753b629025bc228b6a23c7d05e8f",
"detected_licenses": [
"MIT"
],
"directory_id": "0afa23db7c7f1287364885bbb4f80000b3da96c0",
"extension": "html",
"filename": "class_dot_net_browser_1_1_certificate.html",
"fork_events_count": 0,
"gha_created_at": "2018-08-17T06:55:13",
"gha_event_created_at": "2022-02-26T01:22:03",
"gha_language": "HTML",
"gha_license_id": "MIT",
"github_id": 145083785,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 35813,
"license": "MIT",
"license_type": "permissive",
"path": "/Betas/New folder/CPU_Test/WindowsFormsApp1/Extended References/Library/Documentation/API/class_dot_net_browser_1_1_certificate.html",
"provenance": "stackv2_html-0000.json.gz:42",
"repo_name": "ReckoningHero/.NET--Private-Browser",
"revision_date": "2020-01-11T17:53:14",
"revision_id": "569ebe4c60b3a64d2c550fbcf6556e7ae70510d0",
"snapshot_id": "6a31715e0076d63c6f08bad8ec194a3b61fe86be",
"src_encoding": "UTF-8",
"star_events_count": 3,
"url": "https://raw.githubusercontent.com/ReckoningHero/.NET--Private-Browser/569ebe4c60b3a64d2c550fbcf6556e7ae70510d0/Betas/New folder/CPU_Test/WindowsFormsApp1/Extended References/Library/Documentation/API/class_dot_net_browser_1_1_certificate.html",
"visit_date": "2022-03-08T02:07:18.064125"
} | stackv2 | Provides information about X509 certificate. X509 certificate represents a X.509 certificate, which is comprised a particular identity or end-entity certificate, such as an SSL server identity or an SSL client certificate, and zero or more intermediate certificates.
More...
|
| | Certificate (string issuerName, string subjectName, bool hasExpired, long startTime, long expiryTime) |
| | Constructs a new Certificate instance. More...
|
| |
| | Certificate (string issuerName, string subjectName, bool hasExpired, long startTime, long expiryTime, string caFingerPrint, string certData) |
| | Constructs a new Certificate instance. More...
|
| |
| | Certificate (X509Certificate certificate) |
| | Constructs a new Certificate instance from an X509Certificate. More...
|
| |
| override string | ToString () |
| | Represent object as string More...
|
| |
|
| X509Certificate | X509Certificate [get] |
| | Gets the X509Certificate that provides access to all certificate information or null if it's failed to extract information because of corrupted certificate data. More...
|
| |
| X509Certificate2 | X509Certificate2 [get] |
| | Gets the X509Certificate2 that provides access to all certificate information or null if it's failed to extract information because of corrupted certificate data. More...
|
| |
| string | Issuer [get] |
| | Returns the Issuer entity of certificate or null if it's failed to extract the issuer from certificate data because of corrupted certificate data. More...
|
| |
| string | Subject [get] |
| | Returns the Subject entity of certificate or null if it's failed to extract the subject from certificate data because of corrupted certificate data. More...
|
| |
| string | IssuerName [get] |
| | Gets the name of the issuer of the certificate. More...
|
| |
| string | SubjectName [get] |
| | Gets the name of the subject of the certificate. For HTTPS server certificates, this represents the web server. The common name of the subject should match the host name of the web server. More...
|
| |
| bool | HasExpired [get] |
| | Gets true if certificate has already expired, otherwise - false. More...
|
| |
| long | ValidStartTime [get] |
| | Gets a period of time in milliseconds starting from the certificate is valid. More...
|
| |
| long | ValidExpiryTime [get] |
| | Gets a period of time in milliseconds that describes until what time the certificate is valid. More...
|
| |
| string | CAFingerPrint [get] |
| | Gets the CA Fingerprint of certificate. More...
|
| |
| string | FingerPrint [get] |
| | Gets Fingerprint of certificate or empty string if it's failed to extract fingerprint from certificate because of corrupted data. More...
|
| |
| string | SerialNumber [get] |
| | Gets the serial number of certificate or empty string if it's failed to extract serial number from certificate because of corrupted data. More...
|
| |
| X509KeyUsageFlags | KeyUsages [get] |
| | Gets a flags of key usages or null if it's failed to extract key usages info from certificate because of corrupted data. More...
|
| |
| LinkedList< ExtendedKeyUsage > | ExtendedKeyUsages [get] |
| | Gets a list of extended key usages or empty collection if it's failed to extract extended key usages info from certificate because of corrupted data. More...
|
| |
Provides information about X509 certificate. X509 certificate represents a X.509 certificate, which is comprised a particular identity or end-entity certificate, such as an SSL server identity or an SSL client certificate, and zero or more intermediate certificates.
| DotNetBrowser.Certificate.Certificate |
( |
string |
issuerName, |
|
|
string |
subjectName, |
|
|
bool |
hasExpired, |
|
|
long |
startTime, |
|
|
long |
expiryTime |
|
) |
| |
Constructs a new Certificate instance.
- Parameters
-
| issuerName | the name of the issuer of the certificate. |
| subjectName | the name of the subject of the certificate. For HTTPS server certificates, this represents the web server. The common name of the subject should match the host name of the web server. |
| hasExpired | indicates whether certificate has already expired. |
| startTime | a period of time in milliseconds starting from the certificate is valid. |
| expiryTime | a period of time in milliseconds that describes until what time the certificate is valid. |
| DotNetBrowser.Certificate.Certificate |
( |
string |
issuerName, |
|
|
string |
subjectName, |
|
|
bool |
hasExpired, |
|
|
long |
startTime, |
|
|
long |
expiryTime, |
|
|
string |
caFingerPrint, |
|
|
string |
certData |
|
) |
| |
Constructs a new Certificate instance.
- Parameters
-
| issuerName | the name of the issuer of the certificate. |
| subjectName | the name of the subject of the certificate. For HTTPS server certificates, this represents the web server. The common name of the subject should match the host name of the web server. |
| hasExpired | indicates whether certificate has already expired. |
| startTime | a period of time in milliseconds starting from the certificate is valid. |
| expiryTime | a period of time in milliseconds that describes until what time the certificate is valid. |
| caFingerPrint | the CA Fingerprint of certificate. Returns an empty string when constructed from a X509Certificate. |
| certData | a string data from certificate. |
Constructs a new Certificate instance from an X509Certificate.
- Parameters
-
| certificate | the certificate. |
| override string DotNetBrowser.Certificate.ToString |
( |
| ) |
|
Represent object as string
- Returns
- a string that represents the object
| string DotNetBrowser.Certificate.CAFingerPrint |
|
get |
Gets the CA Fingerprint of certificate.
Gets a list of extended key usages or empty collection if it's failed to extract extended key usages info from certificate because of corrupted data.
| string DotNetBrowser.Certificate.FingerPrint |
|
get |
Gets Fingerprint of certificate or empty string if it's failed to extract fingerprint from certificate because of corrupted data.
Returns
| bool DotNetBrowser.Certificate.HasExpired |
|
get |
Gets true if certificate has already expired, otherwise - false.
| string DotNetBrowser.Certificate.Issuer |
|
get |
Returns the Issuer entity of certificate or null if it's failed to extract the issuer from certificate data because of corrupted certificate data.
| string DotNetBrowser.Certificate.IssuerName |
|
get |
Gets the name of the issuer of the certificate.
| X509KeyUsageFlags DotNetBrowser.Certificate.KeyUsages |
|
get |
Gets a flags of key usages or null if it's failed to extract key usages info from certificate because of corrupted data.
| string DotNetBrowser.Certificate.SerialNumber |
|
get |
Gets the serial number of certificate or empty string if it's failed to extract serial number from certificate because of corrupted data.
| string DotNetBrowser.Certificate.Subject |
|
get |
Returns the Subject entity of certificate or null if it's failed to extract the subject from certificate data because of corrupted certificate data.
| string DotNetBrowser.Certificate.SubjectName |
|
get |
Gets the name of the subject of the certificate. For HTTPS server certificates, this represents the web server. The common name of the subject should match the host name of the web server.
| long DotNetBrowser.Certificate.ValidExpiryTime |
|
get |
Gets a period of time in milliseconds that describes until what time the certificate is valid.
| long DotNetBrowser.Certificate.ValidStartTime |
|
get |
Gets a period of time in milliseconds starting from the certificate is valid.
| X509Certificate DotNetBrowser.Certificate.X509Certificate |
|
get |
Gets the X509Certificate that provides access to all certificate information or null if it's failed to extract information because of corrupted certificate data.
| X509Certificate2 DotNetBrowser.Certificate.X509Certificate2 |
|
get |
Gets the X509Certificate2 that provides access to all certificate information or null if it's failed to extract information because of corrupted certificate data. |
2024-11-18T17:59:32.740228+00:00 | 2021-02-23T03:02:19 | 8739f6186744d76de53382c7b8647a8d32e6e97c | {
"blob_id": "8739f6186744d76de53382c7b8647a8d32e6e97c",
"branch_name": "refs/heads/master",
"committer_date": "2021-02-23T03:02:19",
"content_id": "12365504dc1e4c01d8678003a08e723a3b42371d",
"detected_licenses": [
"MIT"
],
"directory_id": "c556135f78ce1ba50c9af44d789334851914a936",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 183671294,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 16983,
"license": "MIT",
"license_type": "permissive",
"path": "/public/post/setting-up-ecommerce/index.html",
"provenance": "stackv2_html-0000.json.gz:43",
"repo_name": "whood1/Portfolio",
"revision_date": "2021-02-23T03:02:19",
"revision_id": "92b611c9874d6e02db01a1300771f0a7e640b675",
"snapshot_id": "9f41383ad7baf82ff6d053d15e2faff7e67d3d77",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/whood1/Portfolio/92b611c9874d6e02db01a1300771f0a7e640b675/public/post/setting-up-ecommerce/index.html",
"visit_date": "2021-06-20T01:26:40.443155"
} | stackv2 | Setting up E-Commerce
After everything I learned yesterday trying to set this stuff up on ritutoring.com I really have been reinvorgorated to pursue what I’ve been doing. I can compare it to when I started working out and first noticed some more size/definition somehwere; I finally feel like I’m making progress and figuring things out, compartimentalizing and filing them away, gaining experience with the tools and systems used in industry, etc etc etc.
Back to what this post is actually about.
Started looking into other options, and went through a ton of them before finding things that would actually work. My current solution is to just let them pay and schedule time/date/location over email on an individual basis. If that gets out of hand I think I’ll have to migrate it to something that includes bookings, but I think that will be far enough in the future that waiting will be fine. I don’t anticipate enough volume for it to be an issue.
To the specifics, I ended up doing alot of research on different payment providers and eccomerce offerings. I ended up with Stripe; they seem like the most dedicated to technology and actually making things work properly and smoothly. I ended up sticking with stripe as the payment processor and link to my bank account, while using Snipcart on the front end for the actual shopping cart on the website.
I’m hoping that I’ll be able to intregare some kind of booking system with Snipcart itself, making make different products for each session and then only have 1 in stock per week? I’ll cross the bridge when it becomes an issue.
Business Structure
I also spent alot of time doing research as to how I should setup this business legally. The easiest and cheapest way seems to be just registering a DBA name with the town and hiring Lacey as a 1099 contractor and paying her hourly for whatever tutoring she does.
It may also be cool to try and get an LLC or something official sounding going that I can put on my resume and look ambitious, but I’ll save that for next summer (or I guess semester if things really take off? Not likely). |
2024-11-18T17:59:32.852895+00:00 | 2021-06-13T16:55:03 | 6fd13add38b1127d47972b7975969c2453419023 | {
"blob_id": "6fd13add38b1127d47972b7975969c2453419023",
"branch_name": "refs/heads/main",
"committer_date": "2021-06-13T16:55:03",
"content_id": "4734c5b1db1404fa5c8a4486b9280b55b943b2ad",
"detected_licenses": [
"MIT"
],
"directory_id": "98891a3e269dae37faf10403a856b797f92e4739",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 376594690,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 52416,
"license": "MIT",
"license_type": "permissive",
"path": "/src/index.html",
"provenance": "stackv2_html-0000.json.gz:44",
"repo_name": "codegirl007/web_dnai",
"revision_date": "2021-06-13T16:55:03",
"revision_id": "1afc75733ffe7ccb3bf5144e8229f75c525c7488",
"snapshot_id": "7dc577105e0a8a82cdf7c2ec808fc94383b1919e",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/codegirl007/web_dnai/1afc75733ffe7ccb3bf5144e8229f75c525c7488/src/index.html",
"visit_date": "2023-05-29T04:15:35.187268"
} | stackv2 | Digital Twin Principles
Digital Twin is a software component that mimics behavior of an arbitrary physical system.
Unlike physical systems that are closed, have hidden states, give partial, noisy and delayed information, the twin:
- is open and 100% transparent
- provides all actual and historical data through API in unified model
- suppresses measurement noise, model errors
- estimates hidden state information from historical states and actual observations of the original physical system
- data is available even during infrastructure outages and before the real data has arrived (prediction)
- acts actively - autonomously issues alerts and events when something interesting happens
Digital Twin Implementation
360º - we put the physical system into its full context – that includes its historical, present, and future states, as well as of information about all interacting systems.
It is not realistic to have 100% information available at the beginning. We integrate information in iterations, where the digital twin becomes more precise and accurate after each iteration.
Digital Twin for Manufacturing
Digital twin in manufacturing provides these outcomes:
- predicts future development - probability distribution of machine defect (e.g. predictive maintenance)
- detects anomalies - detection of exceptional behavior
- fires alerts and watch for important events - hitting tolerance limits
- root cause analysis - what impacts quality or caused machine defect
- online dashboards and reports for managers, operators and QA
Common implementation obstacles in manufacturing:
- machine heterogeneity - different vendor, age and level of wear
- hidden states - some states are not physically possible to measure
- unstructured, disconnected data in different format - data has different data models, is not correlated, is stored in data silos
Digital Twin for Health Care
The latest research says that 80% of the diseases can be prevented. Imagine that you are going to a doctor who will make you a unique "digital twin" - your unique digital image that will based on your health history, special tests and ongoing measurements and will give an objective assessment of your health.
More over, the digital twin will be able to track, detect anomalies, predict trends in your health and let you or the doctor to act in advance. Imagine that the system is constantly learning from the latest research and experience that has helped people with a similar diagnosis anywhere in the world.
Digital Twin for Living
Every building - house, office or whole city part - is a physical system with complex internal dynamics and many evolving variables. Typically, only a small subset of this information is visible and the building is de facto a black box. If enough variables with sufficient sampling frequency gets available, you can create digital model that behaves similarly to your building. If you then connect the model with the building you get the physical system and its digital twin synchronized.
Now imagine that you connect data from all other interacting systems such as people, outside whether, forest nearby... You can go further and start wisely influencing the complete ecosystem through actuators and strategic planning to achieve environment that is green, healthy, energetically and financially sustainable .
Machine Vision
Visual inspection in manufacturing process
- Identification of product defects: scratches, cracks, sink marks, welding lines (bad melt flow), bad coloring, bad gloss, bad filing, flush, non intrusive 3D welding inspection
- Object distance, angle, object counting
- Product layout and component placement and assembly check
- Process decision support for robotic arms and handlers
Real time object detection
- Real time detection of persons, objects, animals
- Safety hazards and security risks early warning
Aerial images analysis:
- Analysis of satellite, plane, and drone images
- Change analysis, tracking and future development forecasts
- Utility networks issues tracking
- Vegetation composition, health and density analysis
- Digital Elevation Model from radar topography
AI Guided Product Design and Optimization
Industrial design and optimisation process starts in CAD tooling where CAD model is used to build a physical prototype or simulate behavior using CFD. Both is costly and time consuming. CAD => physical prototype/CFD loop is repeated until desired performance is achieved.
Our AI driven approach predicts product behavior from geometry and material to:
- Avoid costly and time consuming physical prototyping and CFD computations
- Uncover new dependencies and rules that can be applied by engineers
- Make recommendations on how to modify product/machine parameters to achieve better results |
2024-11-18T17:59:32.856175+00:00 | 2021-05-15T06:40:08 | aa79dc6377c5a15653b5f5379be44820edd3eb4c | {
"blob_id": "aa79dc6377c5a15653b5f5379be44820edd3eb4c",
"branch_name": "refs/heads/master",
"committer_date": "2021-05-15T06:40:08",
"content_id": "f107de6a45bad6f017aec094aa310ddf287e0c13",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "e20178edbd0d92240576fa356b828f2720201be9",
"extension": "html",
"filename": "error.html",
"fork_events_count": 1,
"gha_created_at": "2018-12-01T09:21:02",
"gha_event_created_at": "2023-01-14T00:18:22",
"gha_language": "Java",
"gha_license_id": "Apache-2.0",
"github_id": 159928365,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 385,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/authorization-server/src/main/resources/templates/error.html",
"provenance": "stackv2_html-0000.json.gz:45",
"repo_name": "caijh/supermarket-cloud",
"revision_date": "2021-05-15T06:40:08",
"revision_id": "a5ad097d3c0e998ad8f4eeec9792bc53aad62103",
"snapshot_id": "33c33e025ee271d99e0c771f55e9731cc61c1b71",
"src_encoding": "UTF-8",
"star_events_count": 3,
"url": "https://raw.githubusercontent.com/caijh/supermarket-cloud/a5ad097d3c0e998ad8f4eeec9792bc53aad62103/authorization-server/src/main/resources/templates/error.html",
"visit_date": "2023-01-22T06:03:48.669925"
} | stackv2 | Error Page
Application has encountered an error. Please contact support on ...
Failed URL: ${url} Exception: ${exception.message}
${ste} |
2024-11-18T17:59:32.856309+00:00 | 2021-06-13T10:24:35 | bc4f9f7c5ba7223f6da3817628a80184272ee975 | {
"blob_id": "bc4f9f7c5ba7223f6da3817628a80184272ee975",
"branch_name": "refs/heads/master",
"committer_date": "2021-06-13T10:24:35",
"content_id": "b1d61c4bbfb9c4ffc92205ceac0b238028336b5f",
"detected_licenses": [
"MIT"
],
"directory_id": "a9847cd6315f2c9debbea8bccb9405d180916fd8",
"extension": "html",
"filename": "home.html",
"fork_events_count": 0,
"gha_created_at": "2021-05-18T15:33:06",
"gha_event_created_at": "2021-05-20T18:28:05",
"gha_language": "JavaScript",
"gha_license_id": "MIT",
"github_id": 368581820,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 5975,
"license": "MIT",
"license_type": "permissive",
"path": "/public/home/home.html",
"provenance": "stackv2_html-0000.json.gz:46",
"repo_name": "geor1812/map-cph",
"revision_date": "2021-06-13T10:24:35",
"revision_id": "38e239c814b978644a55c52a0cbbdd350d0c27ad",
"snapshot_id": "632a554181b6b0feab1dfe7d5e5f0b33687bdfd0",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/geor1812/map-cph/38e239c814b978644a55c52a0cbbdd350d0c27ad/public/home/home.html",
"visit_date": "2023-05-17T11:40:16.321115"
} | stackv2 | Filter
Drinks
Venues
Parks
Cultural
Hotspots
Click on a location on the map to see more information. |
2024-11-18T17:59:32.860210+00:00 | 2021-08-25T18:29:15 | 4b1e988555c99d352633d55a408291eaa9b57871 | {
"blob_id": "4b1e988555c99d352633d55a408291eaa9b57871",
"branch_name": "refs/heads/main",
"committer_date": "2021-08-25T18:29:15",
"content_id": "4f10b35b577cfea246f8bd12ac5eaeaf5c8bcdfb",
"detected_licenses": [
"MIT"
],
"directory_id": "2be3fac1ff6f34a65181e0d3fbd67bdbaed7712f",
"extension": "html",
"filename": "pokfinal.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 398029400,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 24663,
"license": "MIT",
"license_type": "permissive",
"path": "/pokfinal.html",
"provenance": "stackv2_html-0000.json.gz:47",
"repo_name": "edyst/pokemon-wiki-edyst-VanshikaGarg511",
"revision_date": "2021-08-25T18:29:15",
"revision_id": "248ab714bf75ce42bc1a0ae845f8d7ef0df896cd",
"snapshot_id": "7ebb236d9c9637073bc041a775cfc9aad5b10d51",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/edyst/pokemon-wiki-edyst-VanshikaGarg511/248ab714bf75ce42bc1a0ae845f8d7ef0df896cd/pokfinal.html",
"visit_date": "2023-07-17T05:19:15.433268"
} | stackv2 | Pokémon is a series of video games developed by Game Freak and published by Nintendo and The Pokémon Company as part of the Pokémon media franchise. Created by Satoshi Tajiri with assistance from Ken Sugimori,the first games released in 1996 in Japan for the Game Boy, and the main series of role-playing video games (RPGs), also referred as the "core series" by their developers
Let us know some pokemon types.
Water is one of the three basic elemental types along with Fire and Grass, which constitute the three starter Pokémon. This creates a simple triangle to explain the type concept easily to new players. Water is the most common type with over 100 Pokémon, which are based on a wide variety of fish and other sea-dwelling creatures.
Fire is one of the three basic elemental types along with Water and Grass, which constitute the three starter Pokémon. This creates a simple triangle to explain the type concept easily to new players. Fire types are notoriously rare in the early stages of the games so choosing the Fire variation starter is often a plus.
Grass is one of the three basic elemental types along with Fire and Water, which constitute the three starter Pokémon. This creates a simple triangle to explain the type concept easily to new players.Grass is one of the weakest types statistically, with 5 defensive weaknesses and 7 types that are resistant to Grass moves.
The AR game's potential for weight loss was a big part of that discussion. In the process of getting out their doors and visiting parks, players found they were losing weight almost in spite of themselves. A Reddit Pokémon Go fan won acclaim for reporting that he'd lost 65 pounds between July and December.
Pokémon GO is one of the most successful mobile games of all time, breaking records like fastest to earn $100 million and most-downloaded in its first month of release. To date, it has grossed almost $2 billion in revenue and been downloaded 800 million times. Although no longer the global phenomenon it was in 2016, the game remains incredibly popular.
Water/Dark
"Greninja is the final evolution of Pokémon X and Y water-type starter Froakie. It has the ability to take on an appearance resembling its trainer. Pokedex says: Greninja creates throwing stars out of compressed water. When it spins them and throws them at high speed, these stars can split metal in two."
Fighting, Steelr
"Lucario is a bipedal, wolf-like Pokémon with blue, cream, and black fur. It is considered to be prideful and loyal to its trainer. Pokedex says: By catching the aura emanating from others, Lucario can read their thoughts and movements."
Ghost Fairy
"Mimikyu caused quite a stir for its peculiar looks and sad backstory when it was originally announced for Pokémon Sun and Moon in 2016. Mimikyu is described as a Pokémon who felt so lonely that it decided to wear a rag in order to look like Pikachu, everyone’s favorite Pokémon. Pokedex says: Its actual appearance is unknown. A scholar who saw what was under its rag was overwhelmed by terror and died from the shock."
Flying, Fire
"Charizard is an orange draconic Pokémon who has a fiery temper. It is the final evolution of Charmander, one of the starter Pokémon for the original game. Pokedex says: Charizard flies around the sky in search of powerful opponents. It breathes fire of such great heat that it melts anything. However, it never turns its fiery breath on any opponent weaker than itself. "
Questions Every Pokemon Trainer Should Be Able To Answer
Pokémon battles appear in most forms of Pokémon media, being the central gameplay aspect of the core series games, as well as being a constant focus of the anime.
Pokémon Go's Types are exactly the same as those in the main Pokémon games, but the effect of those type matchups is slightly different: in brief, things like effective or resisted attacks have slightly different multipliers to the main Pokémon games - although a December 2018 update brought them slightly closer in line.
| Type | Strong Against | Weak Against | Resistant To |
|---|---|---|---|
| Normal | None | Rock, Ghost, Steel | Ghost |
| Fighting | Normal, Rock, Steel, Ice, Dark | Flying, Poison, Psychic, Bug, Ghost, Fairy | Rock, Bug, Dark |
| Flying | Fighting, Bug, Grass | Rock, Steel, Electric | Fighting, Ground, Bug, Grass |
| Poison | Grass, Fairy | Poison, Ground, Rock, Ghost, Steel | Fighting, Poison, Grass, Fairy |
| Ground | Poison, Rock, Steel, Fire, Electric | Flying, Bug, Grass | Poison, Rock, Electric |
Pokémon Go in 2020 continues to add new features, such the arrival of the Go Battle League, Remote Raids and the trade evolution feature. There are also planned changes to PokéCoins on the way. Meanwhile, coming soon is the Johto Throwback quest.
Book your tickets now.
Greninja
Ability: Torrent
It is the final evolution of Froakie, the Water-type starter from Kalos.
"Ash Ketchum, known as Satoshi in Japan, is a fictional character in the Pokémon franchise owned by Nintendo. He is the protagonist of the Pokémon anime and certain manga series as well as on various merchandise related to the franchise. In Japanese, the character is voiced by Rika Matsumoto, and Hana Takeda."
"Lance is a recurring character in Pokémon. He is a user of Dragon-types being the final Elite Four member in Red, Blue and their remakes. In Pokémon Gold, Silver, Crystal and their remakes, he is the Champion.Lance has appeared in the Pokémon series games from Generation I-III. He first appeared in the original Red and Blue games, being the final member of the Elite Four, and again in Generation III's Red and Blue remakes, FireRed and LeafGreen. Lance in the Generation II games differed from the previous though, as he was Pokémon Champion by this time. "
"Cynthia is a powerful Pokémon trainer and the Champion of the Sinnoh region where Professor Carolina, Cynthia's grandmother, runs the Pokémon Research Lab in Celestic Town. She enjoys visiting the Solaceon Town Ruins. Later, in Pokémon: DP Galactic Battles, she helps fight Team Galactic as well. In the anime, she has a villa in east Unova but in the Pokémon Black and White games, she borrows Caitlin's villa (from the Elite Four). "
"Ookido Yukinari Hakaseamuel Oak is most notable for his vast research facility, where he cares for and studies hundreds of Pokémon, including those owned by, but not currently traveling with, Trainers from Pallet Town. He has confidence in his grandson, Gary Oak, but more often joins Ash's mother and friends in cheering on Ash in his competitions. "
(1996–1999)
The original Pokémon games are Japanese role-playing video games (RPGs) with an element of strategy, and were created by Satoshi Tajiri for the Game Boy. The Pokémon series began with the release of Pocket Monsters Red and Green for the Game Boy in Japan. When these games proved popular, an enhanced Blue version was released sometime after, and the Blue version was reprogrammed as Pokémon Red and Blue for international release. The original Green version was not released outside Japan
(1999–2002)
The second generation of Pokémon video games began in 1999 with the Japanese release of Pokémon Gold and Silver for the Game Boy Color, with Australia and North America getting the game in October 2000 and European release date of April 2001. Like the previous generation, an enhanced version, titled Pokémon Crystal, was later released.
(2002–2006)
Pokémon entered its third generation with the 2002 release of Pokémon Ruby and Sapphire for Game Boy Advance and continued with the Game Boy Advance remakes of Pokémon Red and Green, Pokémon FireRed and LeafGreen (Red and Green representing the original Japanese first generation games; territories outside Japan instead saw releases of Red and Blue). An enhanced remake of Pokémon Ruby and Sapphire titled Pokémon Emerald followed after.
(2006–2010)
In 2006, Japan began the fourth generation of the franchise with the release of Pokémon Diamond and Pearl for Nintendo DS. The games were released in North America on April 22, 2007 and in Australia on June 21, 2007. The game was released in the UK and Europe on July 27, 2007. Other main series games in the fourth generation include Pokémon Platinum, a director's cut version of Diamond and Pearl in the same vein as Pokémon Yellow, Crystal, and Emerald.It was released for the Nintendo DS in Japan on September 13, 2008, in North America on March 22, 2009, and in Australia and Europe on May 14, 2009 and May 22, 2009
Pokémon Sleep
Pokémon Sleep is an upcoming mobile game for Android and iOS, as part of the Pokémon series.
Publisher: The Pokémon Company
Pokémon: Let's Go, Pikachu!
Take a Pokémon™ journey to the Kanto region with your energetic partner, Pikachu!
Developer: Niantic
Japanese video game designer
"Junichi Masuda is a Japanese video game composer, director, designer, producer, singer, and programmer best known for his work in the Pokémon franchise. He is a member of the Game Freak board of directors, and has been employed at the company since 1989 when he founded it along Satoshi Tajiri and Ken Sugimori "
Game designer
"Shigeki Morimoto is a game designer and programmer currently working at Game Freak. He has been involved in nearly every main series Pokémon game, since Pokémon Red and Blue Versions where he was a programmer, and the creator of the battle system and the Pokémon "Mew". "
Japanese video game designer
"Ken Sugimori is a Japanese video game designer, illustrator, manga artist, and director. He is most famous as the character designer and art director for the Pokémon franchise. Sugimori is also credited with the art direction for other titles, including Pulseman "
Pokémon is short for the original Japanese title of Pocket Monsters. Created by. Satoshi Tajiri. |
2024-11-18T17:59:32.863905+00:00 | 2021-10-12T11:01:04 | 52240bc350e8216432891cc40c4a745af90af33f | {
"blob_id": "52240bc350e8216432891cc40c4a745af90af33f",
"branch_name": "refs/heads/main",
"committer_date": "2021-10-12T11:01:04",
"content_id": "665ff239a987290fc37f9097c94e4ea84da3a32c",
"detected_licenses": [
"MIT"
],
"directory_id": "0e9b1bc75387ac584a7ee2e20c2332adf86792d4",
"extension": "html",
"filename": "pyedbglib.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": null,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 18104,
"license": "MIT",
"license_type": "permissive",
"path": "/docs/pyedbglib.html",
"provenance": "stackv2_html-0000.json.gz:48",
"repo_name": "mariusgreuel/pyedbglib",
"revision_date": "2021-10-12T11:01:04",
"revision_id": "5e0e9317baa751d4ead9aa9eb2403781f017151c",
"snapshot_id": "6f391ed0c70cfaae58c7cfb8412dcb1566f89e6a",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/mariusgreuel/pyedbglib/5e0e9317baa751d4ead9aa9eb2403781f017151c/docs/pyedbglib.html",
"visit_date": "2023-08-15T11:06:06.460994"
} | stackv2 | pyedbglib¶
- pyedbglib.hidtransport
- pyedbglib.mplabtransport
- pyedbglib.primitive
- pyedbglib.protocols
- pyedbglib.protocols.ati
- pyedbglib.protocols.avr32protocol
- pyedbglib.protocols.avr32protocolerrors
- pyedbglib.protocols.avr8protocol
- pyedbglib.protocols.avr8protocolerrors
- pyedbglib.protocols.avrcmsisdap
- pyedbglib.protocols.avrispprotocol
- pyedbglib.protocols.cmsisdap
- pyedbglib.protocols.configprotocol
- pyedbglib.protocols.dapcommand
- pyedbglib.protocols.dapwrapper
- pyedbglib.protocols.edbgprotocol
- pyedbglib.protocols.housekeepingprotocol
- pyedbglib.protocols.jtagice3protocol
- pyedbglib.protocols.selftestprotocol
- pyedbglib.serialport
- pyedbglib.util
pyedbglib.pyedbglib_errors¶
pyedbglib specific exceptions
- exception pyedbglib.pyedbglib_errors.PyedbglibError(msg=None, code=0)¶
Bases:
Exception
Base class for all pyedbglib specific exceptions
- exception pyedbglib.pyedbglib_errors.PyedbglibNotSupportedError(msg=None, code=0)¶
Bases:
pyedbglib.pyedbglib_errors.PyedbglibError
Signals that an attempted operation is not supported
Python EDBG protocol communication library¶
pyedbglib is a low-level protocol library for communicating with Microchip CMSIS-DAP based debuggers.
Overview¶
- pyedbglib is available:
install using pip from pypi: https://pypi.org/project/pyedbglib
browse source code on github: https://github.com/microchip-pic-avr-tools/pyedbglib
read API documentation on github: https://microchip-pic-avr-tools.github.io/pyedbglib
pyedbglib uses hidapi package with a USB-level driver such as libusb.
Library usage¶
The protocol library has no application usage on its own, but provides USB-protocol-level tool drivers to applications such as pymcuprog. In general a two-stage stack implementation is required for using pyedbglib:
Create transport HID layer
Create protocol implementation using this transport layer
All protocols implemented in the library generally take the transport layer as a parameter to their constructors.
To use pyedbglib as a library for applications, the following usage patterns can be used:
Import and instantiate transport object:
>>> from pyedbglib.hidtransport.hidtransportfactory import hid_transport
>>> transport = hid_transport()
Connect to any PKOB nano (nEDBG) tool. Serial number and product are optional, but must be provided if more than one matching unit is connected:
>>> status = transport.connect(serial_number="", product="nedbg")
Example of application using housekeeping protocol to read out the target voltage:
>>> from pyedbglib.protocols.housekeepingprotocol import Jtagice3HousekeepingProtocol
>>> housekeeper = Jtagice3HousekeepingProtocol(transport)
>>> housekeeper.start_session()
>>> voltage = housekeeper.get_le16(Jtagice3HousekeepingProtocol.HOUSEKEEPING_CONTEXT_ANALOG,
Jtagice3HousekeepingProtocol.HOUSEKEEPING_ANALOG_VTREF)
>>> voltage = voltage / 1000.0
>>> housekeeper.end_session()
>>> print ("Target is running at {0:.02f}V".format(voltage)) |
2024-11-18T17:59:32.864731+00:00 | 2015-07-08T02:13:40 | 931a2ed8de4b015cb6b5a4c1ab8a2e4d96ec6776 | {
"blob_id": "931a2ed8de4b015cb6b5a4c1ab8a2e4d96ec6776",
"branch_name": "refs/heads/master",
"committer_date": "2015-07-08T02:13:40",
"content_id": "5e4e1a9f47436e4b23a1642567979d3846830d5e",
"detected_licenses": [
"MIT"
],
"directory_id": "5c950492170ed1bc6233574e17d29514e4c1385f",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 38657815,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 14730,
"license": "MIT",
"license_type": "permissive",
"path": "/index.html",
"provenance": "stackv2_html-0000.json.gz:49",
"repo_name": "sigmametals/sigmametals.github.io",
"revision_date": "2015-07-08T02:13:40",
"revision_id": "92cc41772864900e831e88cf4f32c321c69a4064",
"snapshot_id": "7d554cfa8d86c4d7e3846c3f66b053e82c246d4b",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/sigmametals/sigmametals.github.io/92cc41772864900e831e88cf4f32c321c69a4064/index.html",
"visit_date": "2020-05-30T17:12:05.839409"
} | stackv2 | Founded in 2010, Sigma Metals is a Brampton, Ontario based sheet metal fabricator. We always look forward to providing you outstanding quality of service and quality manufacturing.
We're here to provide turnkey solutions, and we can be your one stop shop between your blueprints and your end product.
As a result, for us our customers are also our partners. With this state of mind, we're committed to provide each of our clients the same high quality service.
Ultimately, we are dedicated in providing you quality products using state of the art technologies and production methedologies. Our engineering expertise and our CNC machinery provide for a competitive edge in the world of precision metalwork.
Founded in 2010, Sigma Metals a Brampton, Ontario based sheet metal fabricator. We always look forward to providing you outstanding quality of service and quality manufacturing.
We're here to provide turnkey solutions, and we can be your one stop shop between your blueprints and your end product.
As a result, for us our customers are also our partners. With this state of mind, we're committed to provide each of our clients the same high quality service.
Ultimately, we are dedicated in providing you quality products using state of the art technologies and production methedologies. Our engineering expertise and our CNC machinery provide for a competitive edge in the world of precision metalwork. |
2024-11-18T17:59:32.865601+00:00 | 2021-09-24T08:45:29 | 2ad4eaf82b18a99efe6f4cf0b1e05b82d069b556 | {
"blob_id": "2ad4eaf82b18a99efe6f4cf0b1e05b82d069b556",
"branch_name": "refs/heads/master",
"committer_date": "2021-09-24T08:45:29",
"content_id": "4124668cffd183dfea0c27a55c35be53e36ade22",
"detected_licenses": [
"MIT"
],
"directory_id": "7fe2da2e67b5fb5dec61986f172b8307a9aed8a0",
"extension": "html",
"filename": "index.html",
"fork_events_count": 1,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 272064602,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 12944,
"license": "MIT",
"license_type": "permissive",
"path": "/public/blog/willpower/index.html",
"provenance": "stackv2_html-0000.json.gz:50",
"repo_name": "ciurca/personal-website",
"revision_date": "2021-09-24T08:45:29",
"revision_id": "59e07a0c1d5d3d551cf2cc61484a900f3632a1bd",
"snapshot_id": "9d44c81620543d43e613edb220b6f001cf13cc34",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/ciurca/personal-website/59e07a0c1d5d3d551cf2cc61484a900f3632a1bd/public/blog/willpower/index.html",
"visit_date": "2023-08-13T22:15:38.663306"
} | stackv2 | Image source
John set himself a goal of working out daily on a Sunday. He started going to the gym on Monday. This was 3 years ago. He has been going to the gym ever since. He hasn’t had a problem with motivation whatsoever. He hasn’t missed a day. You know why? Because he’s got willpower.
You know what else John is? An imaginary character. He doesn’t exist. Nobody has it easy like that.
Nobody sets a goal and then just accomplishes it. Not without a good system. Relying on willpower isn’t a good system.
What do you do if you’re driving an electric car in a country that has no charging stations? You’ll run out of electricity pretty quickly. You need a hybrid.
A good system, just like gas, is more reliable.
Now I’m not saying willpower isn’t valuable. But being dependent on it makes you fragile.
The barbell strategy
The barbell strategy is a concept taken from finance. On one end of the barbell you’ve got robust, very low risk investements and on the other end you have high risk assets.
The same can be thought about the system-willpower approach.
On the conservative end you’ve got you’re designed system that yields results that aren’t spectular, but they are still results. Over time these results build upon each other and they bring in the rewards, but you won’t see them overnight.
The first rule of compounding: Never interrupt it unnecessarily.
- Charlie Munger
On the aggressive end you’ve got willpower, motivation, inspiration that yield outstanding results. They are risky to rely upon since you don’t always have them.
Inspiration is perishable. When you have inspiration, act on it right then and there.
If I’m inspired to write a blog post or publish a tweetstorm, I should do it right away. Otherwise, it’s not going to get out there. I won’t come back to it. Inspiration is a beautiful and powerful thing. When you have it, seize it.
- Naval Ravikant
Now I’m not going to tell you how to develop your system, at least not in this article. If you want to find out more about system development/sticking to good habits, you should check out Atomic Habits. |
2024-11-18T17:59:32.869053+00:00 | 2016-11-12T01:37:39 | fe9eab2ca9d4a981954affc6c05c8bd112e27f5f | {
"blob_id": "fe9eab2ca9d4a981954affc6c05c8bd112e27f5f",
"branch_name": "refs/heads/master",
"committer_date": "2016-11-12T01:37:39",
"content_id": "b2c51029d57510fba7c6ccf3cf6babf8a8a75b18",
"detected_licenses": [
"MIT"
],
"directory_id": "587097e320a8fa56ea3940da12a54ca115ce854a",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 70041312,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 1358,
"license": "MIT",
"license_type": "permissive",
"path": "/app/templates/index.html",
"provenance": "stackv2_html-0000.json.gz:51",
"repo_name": "yellow-sem/yellow",
"revision_date": "2016-11-12T01:37:39",
"revision_id": "96c3f7f4db1d9cb0be38a8a3933aa38cab3bd887",
"snapshot_id": "1729349aa4e0ddc23dc29da1f5879f39af4c2b2c",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/yellow-sem/yellow/96c3f7f4db1d9cb0be38a8a3933aa38cab3bd887/app/templates/index.html",
"visit_date": "2021-01-13T09:00:03.779148"
} | stackv2 | {% load staticfiles %}
You know GUL but have you heard of Yellow?
The express alternative for integration with GU services.
Get tickets directions_bus |
2024-11-18T17:59:32.869118+00:00 | 2019-02-16T13:36:00 | 5f9e9ca2f9ad5b2063b6a5e8d0888c90aec7496f | {
"blob_id": "5f9e9ca2f9ad5b2063b6a5e8d0888c90aec7496f",
"branch_name": "refs/heads/master",
"committer_date": "2019-02-16T13:36:00",
"content_id": "66b4b8f67d247af2db84e580d0816fb375e8e8d0",
"detected_licenses": [
"MIT"
],
"directory_id": "8c414fe580a6dbef80e577952a9cde54113518a4",
"extension": "html",
"filename": "main-page.component.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 153171066,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 5467,
"license": "MIT",
"license_type": "permissive",
"path": "/Project/Museum Client/src/app/main-page/main-page.component.html",
"provenance": "stackv2_html-0000.json.gz:52",
"repo_name": "ahmedantaar/SE2018G26",
"revision_date": "2019-02-16T13:36:00",
"revision_id": "d442c3c65162f1d019be250d29165b559af8454a",
"snapshot_id": "dafec3b8ca73f9fdf5b59c97923dac035f9644e9",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/ahmedantaar/SE2018G26/d442c3c65162f1d019be250d29165b559af8454a/Project/Museum Client/src/app/main-page/main-page.component.html",
"visit_date": "2020-04-01T11:38:29.596480"
} | stackv2 | Museums can display monuments and art they have and let people rate it and it serve as a way of advertisement and sharing the knowledge.
Artists can have thier own space. they can use it to show thier works. and have a chance to sell them
Artists can reach for the site to auction their arts for a certain fee.
You can show any related art items which you possess or just seen in your city or country for the people to admire and you can optionally provide some description about the art and where people can be able to see it in real life. |
2024-11-18T17:59:32.883832+00:00 | 2021-02-18T17:20:42 | edde9561b1d2728016a46ba3fe1da814a5eeef6b | {
"blob_id": "edde9561b1d2728016a46ba3fe1da814a5eeef6b",
"branch_name": "refs/heads/master",
"committer_date": "2021-02-18T17:20:42",
"content_id": "1a435b5e8b2c3b0b9a017ee9958fedd62edd9115",
"detected_licenses": [
"MIT"
],
"directory_id": "9852727ac7a214c4f95a34f5f595a47c1d4e7670",
"extension": "html",
"filename": "28.3.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 340123128,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 19522,
"license": "MIT",
"license_type": "permissive",
"path": "/chapters/28.3.html",
"provenance": "stackv2_html-0000.json.gz:53",
"repo_name": "samkitk/clrs-solutions",
"revision_date": "2021-02-18T17:20:42",
"revision_id": "7daa98d00ddfd6056cfb5afa4ef8a4fd0f5c427a",
"snapshot_id": "79cb8a04156de8e332b86e7796dba4406ca794ae",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/samkitk/clrs-solutions/7daa98d00ddfd6056cfb5afa4ef8a4fd0f5c427a/chapters/28.3.html",
"visit_date": "2023-03-07T23:54:54.403131"
} | stackv2 | Consider a set of unit vectors.
Where, and so on.
That is for every all vectors value are zeros, expect for row which is 1.
Symmetric Positive Definite Matrix: If a symmetric matrix satisfy the condition for all non-zero column vectors of real numbers, then the matrix is said to be a symmetric positive definite matrix.
Consider the symmetric positive definite matrix A as follows:
The condition holds for all .
Now suppose for any value in diagonal of matrix A is not positive, that is .
Choose from the set X and calculate.
That is . So, will be negative.
This is a contradiction to the initial consideration; A is a symmetric positive definite matrix.
Therefore, if A is a symmetric positiv e definite matrix then the value of , . That is all the diagonal elements of the symmetric positive definite matrix are positive.
The matrix is which is symmetric positive definite matrix. Its determinant is positive by “completing the square”. It can be proved as follows:
Let x = -by/a and A is positive definite so,
=
The determinant of the above equation is given as:
Here, b = 2by, a = a, c =
So, substituting the values of a, b and c in D it can be deduced that:
Ignoring the constant value that is 4, the expression becomes:
=
=
Thus, so, it means that >0 because a>0
A symmetric positive-definite matrix:
Let A is the matrix which is real in nature and can be positive-definite for a non-zero vector, if:
A symmetric positive-definite matrix has following properties:
• All the Eigenvalues of A will be positive.
• The largest element of the matrix is always there on the diagonal.
• All the diagonal elements of A will be positive.
• Matrix A will be a nonsingular matrix.
Consider the symmetric positive-definite matrix A as:
To prove that the maximum element lies on the diagonal, apply the same permutation to the both rows and columns of matrix A, the resultant matrix will continue to be symmetric and positive-definite.
The SYLVESTER’S CRITERION states that: A symmetric matrix A is positive-definite if and only if:
…… (1)
Where, A is the matrix formed by the intersection of the first k rows and columns of A and in a symmetric matrix .
If there is any element at position, it will also there at the position of. Thus, every element which is not at a diagonal, it will also appear at another position of the matrix. Further, for, applying the suitable permutation, SYLVESTER’S CRITERION gives:
…… (2)
Now, consider the positive-definite matrix given below:
In symmetric, real, positive-definite matrix, there is always large multiplier with a positive-definite matrix.
• In the above matrix, large multiplier is 10001. Due to this multiplier, the determinant of the matrix becomes positive.
• Knowing this, large multipliers will not try to create unstable conditions unless they lead to growth of the transformed element, because the length of matrix continuously increases.
• And to make the determinant positive, the diagonal elements products have to be made larger than the non-diagonal terms, which are used in the corresponding calculation.
• Further, as all the reduced matricesare positive-definite, their maximum element will lie on the diagonal (consider the above determinant equation), which is one of their properties stated above.
• Also from equation (2) either one of the element that is or should be greater than to hold the inequality of equation (1). Hence the max element should lie in the diagonal.
A symmetric positive-definite matrix:
A matrix A, which is real in nature, can be positive-definite for a non-zero vector, if:
… … (1)
A symmetric positive-definite matrix has following properties:
a. All the Eigen values of A will be positive.
b. The largest element of the matrix is always there on the diagonal.
c. All the diagonal elements of A will be positive.
d. A will be a nonsingular matrix.
Consider a symmetric positive-definite matrix A as:
To prove that determinant of each leading sub-matrix of a symmetric positive matrix is positive, suppose that be any leading sub-matrix of a symmetric positive-definite matrix.
After removing corresponding rows and columns of the symmetric matrix, the sub-matrix is also going to be symmetric in nature.
So, is a symmetric matrix. … … (a)
Now, consider that be a particular column inside this sub-matrix, having p entries, which are non-zero in nature.
Increase to make it into an n-vector by inserting zeros into the places corresponding to the particular rows ofwhich were previously removed in the form. Then is not the zero vector and a relation is derive.
So, is a non-zero vector. … … (b)
Now combining the statement (a) and (b) and also putting it in equation (1),
This is a sufficient and necessary condition for leading sub-matrixes in a symmetric definite matrix to be positive.
Hence, the determinant of each leading sub-matrix of a symmetric positive-definite matrix is positive.
Consider the following function:
Calculate the function of the form such that, it is the best least-square fit to the data points.
Consider,
Construct the matrix of values of the basis functions at the points
as follows:
Substitute the point values from (1) in the above matrix A.
Calculate the pseudoinverse of the matrix A using the formula,
.
Calculate .
Calculate .
The normal equation is given by the equation, . Solve it for C.
Hence, the constants of the function (1) are as follows:
Substitute the values of C in (1) to get the required function.
Therefore, the function that is best least-square fit to the data points and is .
The following four equations are satisfied by the pseudoinverse of the matrix .
Pseudoinverse of the matrix is given by the following equation:
Show that pseudoinverse satisfies the equation (1).
Therefore, pseudoinverse satisfies the equation .
Show that pseudoinverse satisfies the equation (2).
Show that pseudoinverse satisfies the equation (3).
Consider left hand side of equation (3).
Consider right hand side of equation (3).
From equations (6) and (7)
Consider left hand side of equation (4).
Consider right hand side of equation (4).
From equations (8) and (9) |
2024-11-18T17:59:32.885298+00:00 | 2019-11-15T10:03:21 | dbe63600303443ed6a0ca921ab3667ef4bd07f00 | {
"blob_id": "dbe63600303443ed6a0ca921ab3667ef4bd07f00",
"branch_name": "refs/heads/master",
"committer_date": "2019-11-15T10:03:21",
"content_id": "97388df58d1f675bfd40d0ed0b253974adf879ba",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "18bdc9583b67b766b3cb539721667d4b4ceef07f",
"extension": "html",
"filename": "restore.page.html",
"fork_events_count": 0,
"gha_created_at": "2019-11-15T09:57:56",
"gha_event_created_at": "2022-12-04T20:34:43",
"gha_language": "HTML",
"gha_license_id": "Apache-2.0",
"github_id": 221895515,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 822,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/client/app/login.pages/restore.page/restore.page.html",
"provenance": "stackv2_html-0000.json.gz:54",
"repo_name": "sonnenhaft/pandax_angular-1.5",
"revision_date": "2019-11-15T10:03:21",
"revision_id": "88269cc4ce78821011334dcc3f5a7b78e2dbb38d",
"snapshot_id": "c1146d96a11c21281b1d9f832436991296e0e25f",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/sonnenhaft/pandax_angular-1.5/88269cc4ce78821011334dcc3f5a7b78e2dbb38d/client/app/login.pages/restore.page/restore.page.html",
"visit_date": "2022-12-06T07:41:40.981357"
} | stackv2 |
We've sent you an email with a link to reset your password. |
2024-11-18T17:59:32.885363+00:00 | 2020-07-19T01:11:52 | 0a5e0007034fc9fea990906101ae864fb18373ce | {
"blob_id": "0a5e0007034fc9fea990906101ae864fb18373ce",
"branch_name": "refs/heads/master",
"committer_date": "2020-07-19T01:11:52",
"content_id": "a90546df3374647fa07974fabd39c21d66762cab",
"detected_licenses": [
"MIT"
],
"directory_id": "46cb0f2fc443e544b95239f46d7526d2e98e6eae",
"extension": "html",
"filename": "73.html",
"fork_events_count": 2,
"gha_created_at": "2019-12-04T16:45:23",
"gha_event_created_at": "2022-12-11T16:13:04",
"gha_language": "Python",
"gha_license_id": null,
"github_id": 225913427,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 90986,
"license": "MIT",
"license_type": "permissive",
"path": "/docs/.vuepress/public/before-2019-Dec-05/htmllight/community-lounge/talk-trading/73.html",
"provenance": "stackv2_html-0000.json.gz:55",
"repo_name": "gcharang/discord-archive-komodo",
"revision_date": "2020-07-19T01:11:52",
"revision_id": "7378b4fb9966dfa46dfcdddf2e833cf7bd473761",
"snapshot_id": "8dbb33d8c506cea4d17edddbc165a82a5a0a8517",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/gcharang/discord-archive-komodo/7378b4fb9966dfa46dfcdddf2e833cf7bd473761/docs/.vuepress/public/before-2019-Dec-05/htmllight/community-lounge/talk-trading/73.html",
"visit_date": "2022-12-25T22:46:32.668160"
} | stackv2 | Error 1015 Ray ID: 44305bf60f774475 • 2018-07-31 13:19:53 UTC
You are being rate limited
What happened?
The owner of this website (www.bitfinex.com) has banned you temporarily from accessing this website.
Just for loading the site wtf
24h low on BTCUSD on finex is 7,777.0
lol
jl making moves
blackjok3r31-Jul-18 01:21 PM
the support is 7777
the resistance was that on the way up, if it can hold that... everything is fine. I'm serious its an actual fib line or whatever.
[TPUX] Djith Wattignies31-Jul-18 01:22 PM
Might put order for 0.1$/kmd.. who knows
Cryptoon31-Jul-18 01:22 PM
Yeah if it can build sick support at these levels we're good
ccould argue the top in DEC was Delsuion.... but it didnt fall far enough
we never got capitulation
or despair
snowdamn31-Jul-18 01:44 PM
more like "Media attention"
1
blackjok3r31-Jul-18 01:44 PM
ther was certainly a lot of that here is AUS....
but so many ppl got scammed
Hollowman900031-Jul-18 01:44 PM
Things are certainly desperate now
blackjok3r31-Jul-18 01:44 PM
it hard to think the next lot of new money will come from the public
Hollowman900031-Jul-18 01:45 PM
Go by the hollow gut index
ComputerGenie31-Jul-18 01:45 PM
at some point, in order to set space value, the space must "break apart" and create value
Do one check their Apple stock and think, "OMFG, RJ Reynolds stock is down, so my Apple stocks has lost value"?
blackjok3r31-Jul-18 01:45 PM
No....
(edited)
ComputerGenie31-Jul-18 01:49 PM
OMFG I'm only made 5x a year on a base value of nothing (edited)
1
1
LocoMB31-Jul-18 01:50 PM
... _where is the Dracula icon?
Because hash rate keeps rising
was that wall pulled or dit it get dumped into?
misse dit
hashrate != price atm
ComputerGenie31-Jul-18 01:55 PM
summer 2016 - BTC = $760
summer 2018 - BTC = $7600
and the tech advance is akin to if apple did nothing for 2 years other than create a new wall charger for the iPhone 2
2
1
snowdamn31-Jul-18 01:55 PM
cheap btc only means they'll refuel their rockets for pennies
blackjok3r31-Jul-18 01:56 PM
Clearly the market has no care for your rocket phones.... only free money.
ComputerGenie31-Jul-18 01:58 PM
hashrate != price atm
actually it does, invested hash is the only thing keeping BTC in this insane godlike state
blackjok3r31-Jul-18 01:59 PM
So they are using Tethers to pump it back to profitable every time it falls under $X ?
thats totally possible IMO.... Chinese ppl are masters of scams
ComputerGenie31-Jul-18 02:01 PM
and ffs, at any point will sheeple ever see this anti-China veil as what it really is: 'Muricans upset because they aren't in control?(edited)
Motorcycles, road trip adventures, D.I.Y and more. Join Expats SerpentZA and C-Milk at Churchill Custom Motorcycles in China. If you are a motorcycle enthusi...
China is cool.
ComputerGenie31-Jul-18 02:04 PM
If you don't like that China controls all of the chips, then pretend it's 1974 and turn Silicon Valley back into a chip making hub
blackjok3r31-Jul-18 02:05 PM
Well I am far more concerned about Israel designing all the hardware backdoors in every single Intel CPU built in the last 10 years.
AMD seems to have followed that lead, but not sure where the backdoor was designed there.
ComputerGenie31-Jul-18 02:07 PM
Well, when Utah becomes an independent, recognized Mormon nation, then we can discuss my opinions on the Middle East
snowdamn31-Jul-18 02:07 PM
@blackjok3r is there anything one can do about that?
ComputerGenie31-Jul-18 02:08 PM
@snowdamn yes, you can build a chip company in Switzerland
1
blackjok3r31-Jul-18 02:08 PM
Use older hardware
Kind of impractical... Phenom core based chips in desktop CPU
Bulldozer an up has it, and on intel side its core2 and up, but core2 can have it disabled.
google libreboot
snowdamn31-Jul-18 02:10 PM
disable it bitchezzzzz
blackjok3r31-Jul-18 02:11 PM
there are ppl working on it... but they figured out how to do it too early on.... so intel improved the design so It litterally cannot function when the ME is turned off now.(edited) |
2024-11-18T17:59:32.899471+00:00 | 2014-06-05T03:53:09 | 62ee76d24c4d181bb4d0607d981bbbca90b0461a | {
"blob_id": "62ee76d24c4d181bb4d0607d981bbbca90b0461a",
"branch_name": "refs/heads/master",
"committer_date": "2014-06-05T03:53:09",
"content_id": "924b1e6e846201b70266852a94fa8dba90b97725",
"detected_licenses": [
"MIT"
],
"directory_id": "17320499758f311102c96b684d47d04d10cbb1c1",
"extension": "html",
"filename": "bsdhks-PREFACE-2.html",
"fork_events_count": 1,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 18394182,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 4080,
"license": "MIT",
"license_type": "permissive",
"path": "/books/BSD.Hacks/0596006799/bsdhks-PREFACE-2.html",
"provenance": "stackv2_html-0000.json.gz:56",
"repo_name": "bookatgithub/bookatgithub.github.io",
"revision_date": "2014-06-05T03:53:09",
"revision_id": "3faf3044f61b5f5c3128c6fb6ef69661c8db06ad",
"snapshot_id": "69a6c20961a93aaa212381aa59ee7a3191ac3480",
"src_encoding": "WINDOWS-1258",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/bookatgithub/bookatgithub.github.io/3faf3044f61b5f5c3128c6fb6ef69661c8db06ad/books/BSD.Hacks/0596006799/bsdhks-PREFACE-2.html",
"visit_date": "2020-04-06T04:32:08.737192"
} | stackv2 | | < Day Day Up > |
Preface
When the above-mentioned article was first published, I was still very much a BSD newbie. My spare hours were spent struggling with kernel recompiles, PPP connectivity (or lack thereof), rm and chmod disasters, and reading and rereading every bit of the then available documentation. Yet, that article gave voice to my experience, for, like the quoted author, I had stumbled upon operating system love. In other words, I was discovering how to hack on BSD. Since then, I've learned that there is an unspoken commonality between the novice Unix user and the seasoned guru. It doesn't matter whether you've just survived your first successful installation or you've just executed a complex script that will save your company time and money, the feeling is the same. It's the excitement of venturing into unknown territory and discovering something new and wonderful. It's that sense of accomplishment that comes with figuring something out for yourself, with finding your own solution to the problem at hand. This book contains 100 hacks written by users who love hacking with BSD. You'll find hacks suited to both the novice user and the seasoned veteran, as well as everyone in between. Read them in any order that suits your purpose, but keep the "onion principle" in mind. While each hack does present at least one practical solution to a problem, that's just the outer layer. Use your imagination to peel away deeper layers, exposing new solutions as you do so. |
| < Day Day Up > | |
2024-11-18T17:59:32.904033+00:00 | 2016-09-15T19:43:01 | 16dc09809c4d99bc716e093b5c8b01432032eab3 | {
"blob_id": "16dc09809c4d99bc716e093b5c8b01432032eab3",
"branch_name": "refs/heads/master",
"committer_date": "2016-09-15T19:43:01",
"content_id": "917219a1af9ede1f54c48987d117f4f26bf7dd7f",
"detected_licenses": [
"MIT"
],
"directory_id": "4f125eca8e1009f34f2b798120a5f9861c79bfce",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 68229564,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 2611,
"license": "MIT",
"license_type": "permissive",
"path": "/index.html",
"provenance": "stackv2_html-0000.json.gz:57",
"repo_name": "frazierr2/1.3-vertical-timeline",
"revision_date": "2016-09-15T19:43:01",
"revision_id": "ac37c2250ed7012d5e8c19a535bbf77c73507a99",
"snapshot_id": "67757025cf91141207b597d4ffe909854b44e16b",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/frazierr2/1.3-vertical-timeline/ac37c2250ed7012d5e8c19a535bbf77c73507a99/index.html",
"visit_date": "2020-04-10T22:06:42.721393"
} | stackv2 | Konrad Zuse begins work on Plankalkül (Plan Calculus), the first algorithmic programming language, with the goal of creating the theoretical preconditions for the solution of general problems. Seven years earlier, Zuse had developed and built the world´s first binary digital computer, the Z1. He completed the first fully functional program-controlled electromechanical digital computer, the Z3, in 1941. Only the Z4 — the most sophisticated of his creations — survived World War II.
Konrad Zuse begins work on Plankalkül (Plan Calculus), the first algorithmic programming language, with the goal of creating the theoretical preconditions for the solution of general problems. Seven years earlier, Zuse had developed and built the world´s first binary digital computer, the Z1. He completed the first fully functional program-controlled electromechanical digital computer, the Z3, in 1941. Only the Z4 — the most sophisticated of his creations — survived World War II. |
2024-11-18T17:59:32.904232+00:00 | 2023-06-02T09:44:34 | ab333a75e2beb4542f2ed2e32cf7cda95493745b | {
"blob_id": "ab333a75e2beb4542f2ed2e32cf7cda95493745b",
"branch_name": "refs/heads/master",
"committer_date": "2023-06-02T09:44:34",
"content_id": "398f81f495bc9c7860294e89c800fd4ddd5da06b",
"detected_licenses": [
"MIT"
],
"directory_id": "3c77e28d2e578f1d960ff49d2bcab2cbc737014c",
"extension": "html",
"filename": "index.html",
"fork_events_count": 3,
"gha_created_at": "2017-03-15T12:08:19",
"gha_event_created_at": "2023-06-02T09:44:35",
"gha_language": "HTML",
"gha_license_id": "MIT",
"github_id": 85067901,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 5440,
"license": "MIT",
"license_type": "permissive",
"path": "/app/views/prototypes/prototype-feb-2019/dashboard/order-response/index.html",
"provenance": "stackv2_html-0000.json.gz:58",
"repo_name": "hmcts/cmc-prototype",
"revision_date": "2023-06-02T09:44:34",
"revision_id": "feb394529a132c77dd87d30f2ad3bd83ce36a148",
"snapshot_id": "b526f8aea778ab11485d225262ea4424d81d2ea1",
"src_encoding": "UTF-8",
"star_events_count": 6,
"url": "https://raw.githubusercontent.com/hmcts/cmc-prototype/feb394529a132c77dd87d30f2ad3bd83ce36a148/app/views/prototypes/prototype-feb-2019/dashboard/order-response/index.html",
"visit_date": "2023-06-08T08:14:43.852644"
} | stackv2 | Provide witness statements, evidence and details of experts
You need to complete each section on this page or {% if data['party'] == "defendant" %}the court may cancel your defence and give you a County Court Judgment (CCJ){% else %}claim will not proceed to a hearing{% endif %}.
Complete and upload witness statements
{% if data['witness'] == 'complete' %}You uploaded these documents on {{ now | date }}:
{% else %}
Due by {{ now | date('add', 12, 'days') | date }}
You must complete a witness statement for any witnesses whose evidence you want to use at the hearing, including yourself.
To make sure your witness statements have all the information the court needs you should either:
{% endif %}Upload your evidence
{% if data['evidence'] == 'complete' %}You uploaded these documents on {{ now | date }}:
{% else %}
Due by {{ now | date('add', 14, 'days') | date }}
You must upload copies of any evidence you intend to use at the hearing.
{% endif %}{% if data['party'] != 'defendant' %}
Propose 3 experts
{% if data['experts'] == 'complete' %}You proposed the following three experts on {{ now | date }}:
- John Austin - £450
- Ronald Davidson - £500
- Julie Tuffnel - £700
Due by {{ now | date('add', 14, 'days') | date }}
The court has approved your request to hire an expert. You must propose 3 independent experts for the {% if data['party'] == 'defendant' %}claimant{% else %}defendant{% endif %} to choose from.
{% endif %} {% else %}Choose an expert
{% if data['experts'] == 'complete' %}You selected John Austin on {{ now | date }}.
{% else %}Due by {{ now | date('add', 3, 'days') | date }}
The claimant has made a shortlist of 3 independant experts, you must pick one to appoint and supply the questions you wish to ask them.
{% endif %} {% endif %}Responding by post
If you can't upload the required documents, you can respond to the order by post instead. |
2024-11-18T17:59:32.904308+00:00 | 2017-04-20T15:08:23 | 70424f83c54cfdda410282a6ef147fe2990c6453 | {
"blob_id": "70424f83c54cfdda410282a6ef147fe2990c6453",
"branch_name": "refs/heads/master",
"committer_date": "2017-04-20T15:08:23",
"content_id": "a0202751bf88c205b27f6d9fde5ae42135d5ba9a",
"detected_licenses": [
"MIT"
],
"directory_id": "568dd961b5f3f7ee52252c9e890383d41a34fa74",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 6115620,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 16833,
"license": "MIT",
"license_type": "permissive",
"path": "/blog/mongodb-and-mongoid/index.html",
"provenance": "stackv2_html-0000.json.gz:59",
"repo_name": "adamjonas/blog",
"revision_date": "2017-04-20T15:08:23",
"revision_id": "ef42768d290678e33bba6578b3a1a162559c7d3a",
"snapshot_id": "c266522be93d6facf83087dcf26139041b0d6406",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/adamjonas/blog/ef42768d290678e33bba6578b3a1a162559c7d3a/blog/mongodb-and-mongoid/index.html",
"visit_date": "2020-04-12T03:13:25.814845"
} | stackv2 | NoSQL
Non-relational, next-generation operational datastores and databases -databases designed for the web and attacking the traditional problems that traditional DBs have such as scaling out.
-Horizontally scalable architectures => no joins + no complex transactions
Datamodels:
- Key / Value Stores - (memcached, Dynamo)
- Tabular (BigTable) - a hybrid
- Document Oriented (MongoDB, CouchDB)
Memcached and key/value are high on the scalability and performance side, but low on depth of functionality
RDBMS (relational database management systems) - strong depth of functionality with join models etc., low on the scalability and performance scale.
MongoDB- try to get the scalability and performance of a key/value store and try to make as functional as possible
What’s Missing? - Joins - Complex multi-row transactions - SQL
Terminology: In RDBMS // MongoDB - database => database like in MySQL - table => collection - row => document
MongoDB uses JSON style documents called BSON (binary JSON)
-There are not predefined schemas, can use nested structures to embed complex values based on the keys
1 2 3 4 5 6 |
|
MongoDB expects to have every document to have a ‘_id’ key– it’s a *unique primary key**
Dynamic Queries
1 2 3 4 5 6 |
|
MongoDB has its own document based query language.
Indexing
B-Tree indexes
1 2 3 4 |
|
Focus on Performance: Don’t use REST to talk to the database. Use a binary TCP wire protocol because it is faster.
Replica Sets
similar to master-slave replication, but there is a primary and secondary node
Auto-sharding
- split up the data so certain shards (which are groups of nodes- replica set or master //slave) are responsible for some subset of the data
Mongoid
Cheatsheet Intro by the creator RailsCast Docs
-Mongoid by default stores documents in a collection that is the pluralized form of the class name. For the following Person class, the collection the document would get stored in would be named people.
When a document is stored in the database the ruby object will get serialized into BSON and have a structure like so:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 |
|
Querying
1 2 3 4 5 6 |
|
Attributes
All relations contain a target, which is the proxied document or documents, a base which is the document the relation hangs off, and metadata which provides information about the relation.
attr_accessible and validation are the same in Mongo as in ActiveRecord
embeds_many similar to has_many => but the information is embedded in the document rather than in a separate record like in ActiveRecord. Will I need to fetch this record outside of the parent? If so, I need than has_many makes more sense. The advantage of course is that the information is right inside that record.
Embedded 1-1 relationships : The parent document of the relation should use the embeds_one macro to indicate is has 1 embedded child, where the document that is embedded uses embedded_in.
*Embedded 1-Many** : The parent document of the relation should use the embeds_many macro to indicate it has n number of embedded children, where the document that is embedded uses embedded_in.
Referenced 1-1 : The parent document of the relation should use the has_one macro to indicate is has 1 referenced child, where the document that is referenced in it uses belongs_to.
Referenced Many-to-Many : Many to many relationships where the inverse documents are stored in a separate collection from the base document are defined using Mongoid’s has_and_belongs_to_many macro. This exhibits similar behavior to Active Record with the exception that no join collection is needed, the foreign key ids are stored as arrays on either side of the relation. |
2024-11-18T17:59:32.919890+00:00 | 2020-04-19T14:08:07 | f75cf921a9d8ec577b605165670d03fcaba8b3b0 | {
"blob_id": "f75cf921a9d8ec577b605165670d03fcaba8b3b0",
"branch_name": "refs/heads/master",
"committer_date": "2020-04-19T14:08:07",
"content_id": "c36fe2fec7e39a4d53224024326332ab3bbcf391",
"detected_licenses": [],
"directory_id": "ea77a2bc8684532df4fa58432a6b8700d81823ef",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": "2020-02-08T04:43:37",
"gha_event_created_at": "2020-02-08T04:43:38",
"gha_language": null,
"gha_license_id": "MIT",
"github_id": 239070492,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 22845,
"license": "",
"license_type": "permissive",
"path": "/index.html",
"provenance": "stackv2_html-0000.json.gz:60",
"repo_name": "meetsavani/mozguj",
"revision_date": "2020-04-19T14:08:07",
"revision_id": "11a7adc1466a03bfead123b2f90fec0094d19fd4",
"snapshot_id": "6e84b76f6a44b703559f4fb2c8b9cbaa95797e14",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/meetsavani/mozguj/11a7adc1466a03bfead123b2f90fec0094d19fd4/index.html",
"visit_date": "2020-12-31T23:15:12.625997"
} | stackv2 | Anyone who thinks he/she can work in and with community, feels happy to be a part of a community is always welcome in the community!
Mozilla Gujarat holds 1 or 2 monthly meetups!
You can contribute to the community by volunteering in the events held by Mozilla Gujarat or you can contribute to various Mozilla projects like Common Voice, Pontoon, Bug Hunting, contributing to Mozilla Codebase, Support Mozilla etc...For that, you can click on the “Get Started” button in the Navbar.
You can sign-up for the newsletter or you can join us on our Slack Channel for constant community updates. You can do that by clicking on that “Join Us” button in the Home Section of our page.
You can checkout the Community Guidelines.
We hope we have solved your queries, if we have missed something then you can surely reach out to us, we will love to hear it from your side! You can contact us at info@mozguj.com |
2024-11-18T17:59:32.922637+00:00 | 2022-08-15T09:14:47 | 0a389604319af28626020badfbb8b40057fab170 | {
"blob_id": "0a389604319af28626020badfbb8b40057fab170",
"branch_name": "refs/heads/master",
"committer_date": "2022-08-15T09:14:47",
"content_id": "997f24266acfaff9bad751dde4a2d92e12fe4f92",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "a68ac34d9242ddf3067f50f012d0c582ac2bcd8d",
"extension": "html",
"filename": "results.html",
"fork_events_count": 5,
"gha_created_at": "2019-08-29T13:56:29",
"gha_event_created_at": "2019-11-07T13:22:21",
"gha_language": null,
"gha_license_id": "Apache-2.0",
"github_id": 205175851,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 12120,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/searches/climatechange/PMC6586318/results/word/frequencies/results.html",
"provenance": "stackv2_html-0000.json.gz:61",
"repo_name": "petermr/climate",
"revision_date": "2022-08-15T09:14:47",
"revision_id": "55e642a4a8a606d0e2e6f32d895e098f7bf19620",
"snapshot_id": "13eb88399490408f211b8dc972d32def83498b30",
"src_encoding": "UTF-8",
"star_events_count": 22,
"url": "https://raw.githubusercontent.com/petermr/climate/55e642a4a8a606d0e2e6f32d895e098f7bf19620/searches/climatechange/PMC6586318/results/word/frequencies/results.html",
"visit_date": "2022-09-24T14:17:05.449713"
} | stackv2 | origin species climate seedling plant elevation survival models growth range soil temperature Table model seed effect height seedlings moisture {border-style data elevation, included restoration Hawai‘i Plot low-elevation montane plot plots px;} #ffffff;} native viscosa oahuense chrysophylla mixed planted using Initial Origin indicates initial Plant high-elevation interaction linear random variation Model Sciences conditions plants seeds species, Seedlings approximately change determine forest low mountain species’ terms used Hawaiian Survival average effects fixed high increased invasive local microclimate model. study variable Data Ecology Seed Temp additional available growth. moisture, predicting probability provenance px; reverse selection upward {font-family (Elev), (Initial (Origin), (PDF) (Temp), (Water), (high Biology Click Elev, Fig Indicates LINK Life Science Species Water adaptation changes correlation experiment file. font-size future greater height), high- highest-ranked influence influenced sources stepwise temperature, <. ./journal.pone..t Bird Chenopodium Degrees Elevation High Kanakaleonui Low Mauna Sophora Water. caused climatic distance double; downslope elevation), explained factors freedom. height, important interactions inversion overall parkland precipitation regression shift shifts similar strategies tested tree variable: varied viscosa, weight zones (ICC .). Dodonaea Effect Fixed Forest Giambelluca Growth However, Island. National Organisms Pacific Restoration Table). Temperature U.S. base border-color border-width change. changing common did ecosystems efforts eliminated grasses locations logistic mean negative patterns predictors relatively responses revegetation review solid; species. studies survival. trade tropical variables {font-style {font-weight Biol Change Climate Cooperative Corridor, Elev Environmental KBC Random Reserve Studies Unit, Writing account apart approach appropriate assistance bold chrysophylla. conspecifics courier; degraded despite differences disperse dramatic em; environments evidence gradient gradient. humidity influencing land limited lower measurements modeling. monthly movement moving oahuense, origin, origin. plants. predicted provenancing provide pt;} ranges relative respectively, retained seedlings. sourcing subalpine trials values warming water wind |
2024-11-18T17:59:32.924241+00:00 | 2018-05-15T17:12:01 | 825443ab09584641a7153ab92c5f1de23f419b3b | {
"blob_id": "825443ab09584641a7153ab92c5f1de23f419b3b",
"branch_name": "refs/heads/master",
"committer_date": "2018-05-15T17:12:01",
"content_id": "d05471c37260f4e2a2e2bfe50f25a8746d6b2f2d",
"detected_licenses": [
"MIT"
],
"directory_id": "b7888fb921abeb2ad44ce6409bf62ecef77a458e",
"extension": "html",
"filename": "view.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": null,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 6215,
"license": "MIT",
"license_type": "permissive",
"path": "/src/djanban/apps/agility_rating/templates/agility_rating/view.html",
"provenance": "stackv2_html-0000.json.gz:63",
"repo_name": "my-favorite-repositories/djanban",
"revision_date": "2018-05-15T17:12:01",
"revision_id": "6451688d49cf235d03c604b19a6a8480b33eed87",
"snapshot_id": "303ce59f821d01f727536068b83f8e8485b7d649",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/my-favorite-repositories/djanban/6451688d49cf235d03c604b19a6a8480b33eed87/src/djanban/apps/agility_rating/templates/agility_rating/view.html",
"visit_date": "2021-03-01T14:23:19.745085"
} | stackv2 | {% extends "boards/view.html" %} {% block page_title %}Agility rating for project {{board.name}}{% endblock %} {% block content %}
Please, create first an agility rating |
2024-11-18T17:59:32.930120+00:00 | 2023-03-16T19:42:01 | 0eb70f480ecd83a743d49b21f09552f6d3fc8bd1 | {
"blob_id": "0eb70f480ecd83a743d49b21f09552f6d3fc8bd1",
"branch_name": "refs/heads/master",
"committer_date": "2023-03-16T19:42:01",
"content_id": "33f046228612572fef8010635f30e39caef6b99c",
"detected_licenses": [
"BSD-3-Clause"
],
"directory_id": "01f23328c5108e6e9fee3308ba3713b726f691c1",
"extension": "html",
"filename": "DEV_NOTES.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 73075222,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 41268,
"license": "BSD-3-Clause",
"license_type": "permissive",
"path": "/project/mystic/log/DEV_NOTES.html",
"provenance": "stackv2_html-0000.json.gz:64",
"repo_name": "mmckerns/mmckerns.github.io",
"revision_date": "2023-03-16T19:42:01",
"revision_id": "f85ff10ab94fa1dc7045683ae9390fb5826b6211",
"snapshot_id": "5a0927d77a682d26f33459c8cfadca3cc47ed69a",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/mmckerns/mmckerns.github.io/f85ff10ab94fa1dc7045683ae9390fb5826b6211/project/mystic/log/DEV_NOTES.html",
"visit_date": "2023-04-10T06:58:52.177728"
} | stackv2 | Search:
Login
Help/Guide
About Trac
Preferences
Wiki
Timeline
Roadmap
Browse Source
View Tickets
Search
Context Navigation
View Latest Revision
source:
DEV_NOTES
@
862
Revision Log Mode:
Stop on copy
Follow copies
Show only adds and deletes
View log starting at
and back to
Show at most
revisions per page.
Show full log messages
Legend:
Added
Modified
Copied or renamed
Diff
Rev
Age
Author
Log Message
(edit)
@240
6 years
mmckerns
tag for the mystic-0.2a1 release
(edit)
@142
7 years
mmckerns
added documentation within mystic.forward_model and mystic.models …
(edit)
@132
7 years
mmckerns
now
StepMonitor?
logs best not simplex (ticket
#29
); built new patch
(edit)
@123
7 years
mmckerns
most of remaining module and method documentation for mystic-0.1a1; …
(edit)
@120
7 years
mmckerns
added docs for minimal solvers fmin & fmin_powell
(edit)
@119
7 years
mmckerns
added more extensive documentation to all solvers; docs still required for …
(edit)
@117
7 years
mmckerns
DEsolvers now comply with abstract_solver.Solve interface (ticket
#4
); …
(edit)
@116
7 years
mmckerns
fixed bug from ticket
#17
(DEsolver throws error when given numpy.inf as …
(edit)
@112
7 years
mmckerns
enabled sigint_handler in all 'one-liner' interfaces
(edit)
@110
7 years
mmckerns
added maxfun & scipy's callback to DE; maxiter, maxfun are now kwds, with …
(edit)
@109
7 years
mmckerns
added 'minimal' (one-line) interface for DE Solvers; added
ExtraArgs?
to …
(edit)
@108
7 years
mmckerns
fixed typo in several model docs; built the circle model, a basic standard …
(edit)
@107
7 years
mmckerns
added
CustomSow?
-- a user-configurable n-variable monitor
(edit)
@106
7 years
mmckerns
removed scipy dependency where solver available in mystic
(edit)
@105
7 years
mmckerns
added
AbstractSolver?
class; added documentation for most methods; changed …
(edit)
@104
7 years
mmckerns
moved fmin_powell to scipy_optimize; removed scipy dependency; cleanup of …
(edit)
@103
7 years
mmckerns
added solver for scipy's fmin_powell (added scipy dependency too = BAD); …
(edit)
@99
7 years
mmckerns
minor shortcut for speedup
(edit)
@97
7 years
mmckerns
moved scipy_optimize_fmin to scipy_optimize
(copy)
@90
7 years
mmckerns
small final cleanup from movig the "merge" branch into the trunk
copied from
pyina/NOTES
:
(copy)
@89
7 years
mmckerns
restructured top-level to have trunk for mystic & pyina (also branches)
Note:
See
TracRevisionLog
for help on using the revision log.
Download in other formats:
RSS Feed
ChangeLog |
2024-11-18T17:59:32.934134+00:00 | 2019-08-14T21:43:48 | d14beb93f8f77a90a226a4b75f70b72e7ab4b7c2 | {
"blob_id": "d14beb93f8f77a90a226a4b75f70b72e7ab4b7c2",
"branch_name": "refs/heads/master",
"committer_date": "2019-08-14T21:43:48",
"content_id": "6d3ef8077f7cd6cfc5c8e0972119459e5d4d19a9",
"detected_licenses": [
"MIT"
],
"directory_id": "2a50bee4398387b1d474d9499f8ed00c5f1b6586",
"extension": "html",
"filename": "class_state_machine.html",
"fork_events_count": 1,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 152586975,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 59177,
"license": "MIT",
"license_type": "permissive",
"path": "/docs/class_state_machine.html",
"provenance": "stackv2_html-0000.json.gz:65",
"repo_name": "hollowspecter/trackracerAR",
"revision_date": "2019-08-14T21:43:48",
"revision_id": "c97f654331d1a7ca1771542432120a03c7c88982",
"snapshot_id": "2fcd936d54f83c52ed8c275d52d14c6d70521a81",
"src_encoding": "UTF-8",
"star_events_count": 1,
"url": "https://raw.githubusercontent.com/hollowspecter/trackracerAR/c97f654331d1a7ca1771542432120a03c7c88982/docs/class_state_machine.html",
"visit_date": "2020-03-31T21:36:19.679048"
} | stackv2 | |
TrackracerAR
0.9.2
|
StateMachine that can be derived from. Is extending the State class to enable hierarchical StateMachines. More...
Public Member Functions | |
| StateMachine () | |
| void | TransitionToState (StateName _newState) |
| Transitions to the new State. This will call the ExitState method if More... | |
| void | AddState (StateName _stateName, State _state) |
| Adds a new state to the statemachine. The first added state will be the default state and will be entered first. More... | |
| override void | UpdateActive (double _deltaTime) |
| Override this as your Update Function in the State. Is only called when the current state is active More... | |
| override void | EnterState () |
| Gets called when entering this state. For more info see GameManager class More... | |
| override void | ExitState () |
| Gets called when exiting this state. For more info see GameManager class More... | |
| override void | SetActive (bool _active) |
| string | GetCurrentStateName () |
| Returns the current statename, prefixing the path through the hierarchial statemachine structure. More... | |
| Public Member Functions inherited from State | |
| delegate void | InputActionHandler () |
| delegate void | TouchHandler (float x, float y) |
| void | SetParentStateMachine (StateMachine _sm) |
Static Protected Member Functions | |
| static bool | IsState (StateName _stateName) |
return true if state is valid, false is statename is NONE. More... | |
Protected Attributes | |
| StateName | m_currentState = StateName.NONE |
| StateName | m_defaultState = StateName.NONE |
| StateName | m_previousState = StateName.NONE |
| Protected Attributes inherited from State | |
| StateMachine | m_stateMachine |
Properties | |
| StateName | PreviousState [get] |
| Properties inherited from State | |
| bool | Active [get, protected set] |
Private Attributes | |
| Dictionary< StateName, State > | m_states |
Additional Inherited Members | |
| Protected Member Functions inherited from State | |
| virtual void | Initialise () |
| Override this as your Awake/Start/Init Function. Is called when this State is added to a StateMachine More... | |
| Events inherited from State | |
| InputActionHandler | m_enteredState |
| InputActionHandler | m_exitedState |
StateMachine that can be derived from. Is extending the State class to enable hierarchical StateMachines.
|
inline |
Adds a new state to the statemachine. The first added state will be the default state and will be entered first.
|
inlinevirtual |
Gets called when entering this state. For more info see GameManager class
Reimplemented from State.
Reimplemented in BuildStateMachine, RootStateMachine, RaceStateMachine, and ARStateMachine.
|
inlinevirtual |
Gets called when exiting this state. For more info see GameManager class
Reimplemented from State.
Reimplemented in BuildStateMachine.
|
inline |
Returns the current statename, prefixing the path through the hierarchial statemachine structure.
|
inlinestaticprotected |
return true if state is valid, false
is statename is NONE.
|
inlinevirtual |
|
inline |
Transitions to the new State. This will call the ExitState method if
| _newState | New state. |
|
inlinevirtual |
Override this as your Update Function in the State. Is only called when the current state is active
Reimplemented from State.
Reimplemented in BuildStateMachine, and RaceStateMachine.
|
protected |
|
protected |
|
protected |
|
get | |
2024-11-18T17:59:32.936311+00:00 | 2017-05-10T03:48:22 | 856fa8ee0249cbd17226a9d148060432b2715516 | {
"blob_id": "856fa8ee0249cbd17226a9d148060432b2715516",
"branch_name": "refs/heads/master",
"committer_date": "2017-05-10T03:48:22",
"content_id": "aa6af58673cd6e5496ec2137927a59362c19b664",
"detected_licenses": [
"MIT"
],
"directory_id": "ce3f9f289615ee961a84c38b1b233c815790fc70",
"extension": "html",
"filename": "234567142699.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": null,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 116105,
"license": "MIT",
"license_type": "permissive",
"path": "/html/234567142699.html",
"provenance": "stackv2_html-0000.json.gz:66",
"repo_name": "Auguronomics/data-corporations",
"revision_date": "2017-05-10T03:48:22",
"revision_id": "e4044e8a06e5970ed5de33f7c0b98165642dcc34",
"snapshot_id": "5f07ce5f6a6cebdce2f2f6ce96ca4d8c3b4db533",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/Auguronomics/data-corporations/e4044e8a06e5970ed5de33f7c0b98165642dcc34/html/234567142699.html",
"visit_date": "2021-06-16T12:14:43.610071"
} | stackv2 | Company profile - Canadian Company Capabilities
Third-Party Information Liability Disclaimer
Some of the information on this Web page has been provided by external sources. The Government of Canada is not responsible for the accuracy, reliability or currency of the information supplied by external sources. Users wishing to rely upon this information should consult directly with the source of the information. Content provided by external sources is not subject to official languages, privacy and accessibility requirements.
Cimetrix Solutions
Legal Name:
Cimetrix Solutions
Operating Name:
Cimetrix Solutions Inc.
Mailing Address:
100-1143 Wentworth St WOSHAWA, Ontario
L1J 8P7
Location Address:
100-1143 Wentworth St WOSHAWA, Ontario
L1J 8P7
Tel.:<PHONE_NUMBER>
Tel.:<PHONE_NUMBER>
Fax:<PHONE_NUMBER>
Logo
Company Profile
Cimetrix Solutions is a leading provider of Additive Manufacturing Solutions (3D Printing), serving the design, manufacturing and education communities across Canada. Headquartered in Oshawa, ON, Cimetrix supports its clients with offices in Vancouver, Winnipeg and Montreal. Founded in 1993, Cimetrix supports both commercial and educational verticals with comprehensive solutions consisting of technology, software, design, implementation and advanced application training services. These solutions are focused on supporting product development, manufacturing, education and research initiatives enabling our clients to compete in local and global markets. Cimetrix is the most experienced Canadian Stratasys channel partner, accredited with the Stratasys Gold Partner status.
Full profile
Full profile
Contact information
Company description
541340 - Drafting Services
541420 - Industrial Design Services
541430 - Graphic Design Services
541690 - Other Scientific and Technical Consulting Services
541710 - Research and Development in the Physical, Engineering and Life Sciences
Product / Service / Licensing
Stratasys Performance Printers
Dimension 1200es:
Model material:
ABSplus in nine colors
Support material:
Soluble (SST 1200es); breakaway (BST 1200es)
Build size:
254 x 254 x 305 mm (10 x 10 x 12 in.)
Layer thickness:
0.33 mm (0.013 in.) or .254 mm (.010 in.)
Workstation compatibility:
Windows XP/Windows 7
Dimension Elite:
Model material:
ABSplus in nine colors
Support material:
Soluble or breakaway
Build size:
203 x 203 x 305 mm (8 x 8 x 12 in.)
Layer thickness:
0.254 mm (0.010 in.) or 0.178 mm (0.007 in.)
Workstation compatibility:
Windows XP/Windows 7
Fortus 250:
Material:
ABSplus-P430
Build envelope (XYZ):
254 x 254 x 305 mm (10 x 10 x 12 in.)
Material delivery:
One build material cartridge and one support material cartridge, each 923 cc (56.3 in3)
Layer thicknesses:
0.013 inch (0.330 mm)
0.010 inch (0.254 mm)
0.007 inch (0.178 mm)
Support structure: Soluble
Software: Insight
Stratasys Performance Printers
Objet 24:
Model material: Rigid Opaque white (VeroWhitePlus)
Support material: FullCure® 705 non-toxic gel-like photopolymer support
Material cartridges: Sealed four 1 Kg (2.2 lbs) cartridges
Tray size: 240 × 200 × 150 mm (9.45 × 7.87 × 5.9 in)
Net Build size: 234 x 192 x 148.6 mm (9.21 x 7.55 x 5.85 in)
Workstation compatibility:
Windows XP, Windows 7, Windows 8
Objet 30:
Model materials:
Rigid Opaque white (VeroWhitePlus)
Rigid Opaque blue (VeroBlue)
Rigid Opaque black (VeroBlack)
Rigid Opaque gray (VeroGray)
Polypropylene-like (DurusWhite)
Support material:
FullCure 705 non-toxic gel-like photopolymer support
Material cartridges:
Sealed four 1 Kg (2.2 lbs) cartridges
Net build size:
294 x 192 x 148.6 mm (11.57 x 7.55 x 5.85 in.)
Layer thickness:
28 microns (0.0011 in.)
Objet 30 Pro:
Model materials:
Transparent rigid (VeroClear)
Rigid Opaque white (VeroWhitePlus)
Rigid Opaque blue (VeroBlue)
Rigid Opaque black (VeroBlack)
Rigid Opaque gray (VeroGray)
Polypropylene-like (DurusWhite)
High Temperature (RGD525)
Support material:
FullCure 705 non-toxic gel-like photopolymer support
Material cartridges:
Sealed four 1 Kg (2.2 lbs) cartridges
Net build size:
294 x 192 x 148.6 mm (11.57 x 7.55 x 5.85 in.)
Layer thickness:
28 microns (0.0011 in.); 16 microns for VeroClear material (0.0006 in.)
Objet 30 Prime
Model materials:
Bio-compatible (MED610)
High Temperature (RGD525)
Rigid Opaque white (VeroWhitePlus)
Rigid Opaque blue (VeroBlue)
Rigid Opaque black (VeroBlack)
Rigid Opaque gray (VeroGray)
Rubber-like (TangoGray and TangoBlack)
Simulated Polypropylene (Durus and Endur)
Transparent rigid (VeroClear and RGD720)
Support material:
FullCure 705 non-toxic gel-like photopolymer support
Material cartridges:
Four sealed 1 Kg (2.2 lbs) cartridges
Net build size:
294 x 192 x 148.6 mm (11.57 x 7.55 x 5.85 in.)
Objet Eden 3D Printers:
Model materials:
Transparent rigid (VeroClear)
Rubber-like (Tango family)
Transparent general-purpose (FullCure RGD720)
Rigid Opaque (Vero family)
Polypropylene-like (DurusWhite)
High Temperature (RGD525)
Support material:
All Eden 3D printers work with SUP705 non-toxic gel-like photopolymer support. Additionally, the Eden260VS works with SUP707 soluble support when using VeroGray, VeroBlue and VeroClear in high-quality mode, or VeroWhitePlus in high-speed or high-quality mode.
Material cartridges:
Sealed four 3.6 kg (7.9 lbs) cartridges
Net Build size:
Eden260V: 255 × 252 × 200 mm (10.0 x 9.9 x 7.9 in.)
Eden260VS: 255 × 252 × 200 mm (10.0 x 9.9 x 7.9 in.)
Eden350V: 340 × 340 × 200 mm (13.4 × 13.4 × 7.9 in.)
Eden500V: 490 × 390 × 200 mm (19.3 x 15.35 x 7.9 in.)
Objet Connex 3D Printers:
Model materials:
Transparent rigid (VeroClear)
Rubber-like (Tango family)
Transparent general-purpose (RGD720)
Rigid Opaque (Vero family)
Polypropylene-like (Endur and Durus)
Digital model materials:
More than 100 digital materials can be manufactured on the fly including:
Engineering plastics such as Digital ABS Green material (RGD5160-DM) fabricated from RGD515 and RGD535
Transparent shades and patterns
Rigid opaque shades
Rubber-like materials with varying Shore A values
Polypropylene with improved thermal resistance
Support material:
SUP705 non-toxic gel-like photopolymer support
Material cartridges:
Materials are sold in cases of four sealed 3.6 kg (7.9 lb) cartridges.
VeroClear, Tango family, Durus and components of Digital ABS Green material also available as 1.44kg (3.17 lb) net weight in a 3.6kg case.
Two different model materials can be loaded simultaneously, and printers are front-loading for quick replacement.
See and hold your idea, even at its earliest stages. Test it, talk it and perfect it like never before. What are you waiting for? Get behind the wheel of 3D printing and take your idea for a spin.
Mojo:
Model material:
ABSplus in ivory, white, blue, fluorescent yellow, black, red, nectarine, olive green or gray
Support material:
SR-30 soluble
Maximum part size:
12.7 x 12.7 x 12.7 cm (5 x 5 x 5 in.)
Layer thickness:
0.178 mm (0.007 in.)
Workstation compatibility:
Windows XP/Windows 7
uPrintSE:
Model material:
ABSplus in ivory, white, blue, fluorescent yellow, black, red, nectarine, olive green or gray
Support material:
SR-30 soluble
Maximum part size:
12.7 x 12.7 x 12.7 cm (5 x 5 x 5 in.)
Layer thickness:
0.178 mm (0.007 in.)
Workstation compatibility:
Windows XP/Windows 7
uPrintSE Plus:
odel material:
ABSplus in ivory, white, blue, fluorescent yellow, black, red, nectarine, olive green or gray
Support material:
SR-30 soluble
Build size:
203 x 203 x 152 mm (8 x 8 x 6 in.)
Layer thickness:
.254 mm (.010 in.) or .330 mm (.013 in.)
Workstation compatibility:
Windows XP/Windows 7
Fortus Performance 3D Production Systems
Fortus 360mc specifications:
Material Options:
ABS-ESD7
ABSi
ABS-M30i
PC-ISO
PPSF
ULTEM 9085
Build envelope options:
355 x 254 x 254 mm (14 x 10 x 10 in.)
406 x 355 x 406 mm (16 x 14 x 16 in.)
Material delivery options:
One bay each for material and support canisters
Two bays each for material and support canisters (with larger build envelope)
Layer thicknesses:
0.330 mm (0.013 in.)
0.254 mm (0.010 in.)
0.178 mm (0.007 in.)
0.127 mm (0.005 in.)
Software: Insight
Fortus 380mc specifications:
Material Options:
ABS-M30
ABS-M30i
ABS-ESD7
ASA in black and ivory, with full range of colors coming in 2015
PC-ISO
PC
FDM Nylon 12
Build envelope options:
Fortus 380mc: 355 x 305 x 305 mm (14 x 12 x 12 in.)
Fortus 450mc: 406 x 355 x 406 mm (16 x 14 x 16 in.)
Material delivery options:
Fortus 380mc: One bay each for material and support canisters
Fortus 450mc: Two bays each for material and support canisters
Layer thicknesses:
0.330 mm (0.013 in.)
0.254 mm (0.010 in.)
0.178 mm (0.007 in.)
0.127 mm (0.005 in.)
Software: Insight
Fortus 400mc Specifications:
Material Options:
ABS-M30
ASA
FDM Nylon 12
PC
PC-ABS
ABS-ESD7
ABSi
ABS-M30i
PC-ISO
PPSF
ULTEM 9085
Build envelope options:
355 x 254 x 254 mm (14 x 10 x 10 in.)
406 x 355 x 406 mm (16 x 14 x 16 in.)
Material delivery options:
One bay each for material and support canisters
Two bays each for material and support canisters (with larger build envelope)
Layer thicknesses:
0.330 mm (0.013 in.)
0.254 mm (0.010 in.)
0.178 mm (0.007 in.)
0.127 mm (0.005 in.)
Software: Insight
Fortus 450mc Specifications:
Material Options:
ABS-M30
ABS-M30i
ABS-ESD7
ASA in black and ivory, with full range of colors coming in 2015
PC-ISO
PC
FDM Nylon 12
ULTEM 9085
ULTEM 1010
Build envelope options:
355 x 254 x 254 mm (14 x 10 x 10 in.)
406 x 355 x 406 mm (16 x 14 x 16 in.)
Material delivery options:
One bay each for material and support canisters
Two bays each for material and support canisters (with larger build envelope)
Layer thicknesses:
0.330 mm (0.013 in.)
0.254 mm (0.010 in.)
0.178 mm (0.007 in.)
0.127 mm (0.005 in.)
Software: Insight
Fortus 900 mc
Material Options:
ABS-ESD7
ABSi
ABS-M30
ABS-M30i
ASA
FDM Nylon 12
PC
PC-ABS
PC-ISO
PPSF
ULTEM 9085
Build envelope:
914 x 610 x 914 mm (36 x 24 x 36 in.)
Material delivery:
Two bays each for material and support canisters
Layer thicknesses:
0.330 mm (0.013 in.)
0.254 mm (0.010 in.)
0.178 mm (0.007 in.)
Software: Insight
Stratasys 3D Precision Production Systems
Connex 1
Model materials:
Rigid Opaque (VeroWhitePlus, VeroBlackPlus, VeroGray and VeroBlue)
Rubber-like (Tango family)
Transparent (RGD720 & VeroClear)
Simulated Polypropylene(Endur and Durus)
Biocompatible (MED610)
High Temperature (RGD525)
Support material:
FullCure 705 non-toxic gel-like photopolymer support
Build Size:
Objet350 Connex1: 342 x 342 x 200 mm (13.4 x 13.4 x 7.9 in.)
Objet500 Connex1: 490 x 390 x 200 mm (19.3 x 15.4 x 7.9 in.)
Layer Thickness:
Horizontal layers as fine as 16-microns (0.0006 in.)
Workstation Compatibility:
Windows 7
Connex 2
Model materials:
Rigid Opaque (VeroWhitePlus, VeroBlackPlus, VeroGray and VeroBlue)
Rubber-like (Tango family)
Transparent (RGD720 & VeroClear)
Simulated Polypropylene(Endur and Durus)
Biocompatible (MED610)
High Temperature (RGD525)
Digital Materials:
Digital ABS and Digital ABS2
Wide range of translucencies
Rubber-like blends in a range of Shore A values
Simulated Polypropylene materials with improved heat resistance
Support material:
FullCure 705 non-toxic gel-like photopolymer support
Build Size:
Objet350 Connex2 342 × 342 × 200 mm (13.4 × 13.4 × 7.9 in.)
Objet500 Connex2 490 x 390 x 200 mm (19.3 x 15.4 x 7.9 in.)
Layer Thickness:
Horizontal layers as fine as 16-microns (0.0006 in.)
Workstation Compatibility:
Windows 7
Connex 3:
Model materials:
Vero family of opaque materials, including various neutral shades and vibrant colors
Tango family rubber-like flexible materials
Medical: MED610
Digital ABS and Digital ABS2 in ivory and green
DurusWhite RGD430
High Temperature RGD525 white
Transparent: VeroClear and RGD720
Digital model materials:
Hundreds of composite materials can be manufactured on the fly including:
Digital ABS
Rubber-like materials in a variety of Shore A values
Vibrant blended colors in rigid opaque
Translucent colored tints
Polypropylene-like materials with improved thermal resistance
Support material:
SUP705 non-toxic gel-like photopolymer support
Net build size:
Objet350 Connex3: 342 × 342 × 200 mm (13.4 × 13.4 × 7.9 in.)
Objet500 Connex3: 490 × 390 × 200 mm (19.3 × 15.4 × 7.9 in.)
Layer thickness:
Horizontal build layers down to 16 microns (0.0006 in.)
Clean station models include: CleanStationDT jr., CleanStation DT 3, CleanStation SRS II, CleanStation XL Plus.
CleanStationDT jr. specifications: Ideal for Dimension 3D Printers - uPrintSE, uPrintSE Plus.
CleanStationDT 3 specifications: Ideal for Dimension 3D Printers - uPrintSE, uPrintSE Plus, SST 1200es, Elite, 250mc.
CleanStation SRS II specifications: Ideal for Fortus 3D Printers - 360mc, 400mc.
CleanStation XL Plus specifications: Ideal for Fortus 3D Printers - 360mc, 400mc, 900mc.
Finishing Touch Smooting Station specifications:
Chamber size: 13 x 16 x 20 inches (330 x 406 x 508 mm)
Compatible materials: ABS-M3, ABS-M30i, ABSi, ABSplus, ABS-p400
The 3D printers receive digital input from three-dimensional data files (STL, SLC) and create solid, three-dimensional parts through an additive, layer-by-layer process with a layer thickness [mm] from .00625 to .0762 and a resolution of [dpi] 5,000 x 5,000 x 8,000 XYZ. The patterns produced are extremely high resolution with vibrant details and outstanding surface finish.
The printers combine patent-protected, drop-on-demand ("DoD") thermoplastic ink-jetting technology and high-precision milling of each layer with the Company's proprietary graphical front-end software, ModelWorks®.
Solidscape's 3D wax printers utilize the Company's proprietary printing technology, SCP® (Smooth Curvature Printing®), which enables its systems to deliver the highest precision and surface finish in the industry. Developed to enhance throughput performance up to 25% (depending upon model geometry) and deliver master patterns that stand alone in the industry... the true benchmark of quality.
Solidscape systems include: 3Z Pro, 3Z Studio, 3Z Lab, and 3Z Edu
3z Pro specifications:
Model material/support material
o Model material formulated for clean burnout to produce 100% castings (Wax)/ Sacrificial material generated automatically for each job, and later dissolved away for a labor-saving, hands-free operation.
Build envelope: 6 X 6 X 4 (152.4 X 152.4 X 101.6 mm)
3Z Works
3z Studio specifications:
Model material/support material
o Model material formulated for clean burnout to produce 100% castings (Wa)x/ Sacrificial material generated automatically for each job, and later dissolved away for a labor-saving, hands-free operation.
Build envelope: 6 X 6 X 2 (152.4 X 152.4 X 50.8 mm)
3Z Works
3z LAB specifications:
Model material/support material
o Model material formulated for clean burnout to produce 100% castings (Wa)x/ Sacrificial material generated automatically for each job, and later dissolved away for a labor-saving, hands-free operation.
Build envelope: 6 X 6 X 2 (152.4 X 152.4 X 50.8 mm)
3Z Works
3z EDU
Model material/support material
o Model material formulated for clean burnout to produce 100% castings (Wa)x/ Sacrificial material generated automatically for each job, and later dissolved away for a labor-saving, hands-free operation.
Build envelope: 6 X 6 X 4 (152.4 X 152.4 X 50.8 mm)
3Z Works
Experienced professional engineers and product designers can be accessed when you need them. Sophisticated technology tools can be brought to bear without the cost of acquiring this hardware and software for a short-term requirement. The Cimetrix design team is composed of senior-level industrial and mechanical designers whose full-time work is in creating innovative solutions to demanding challenges.
Services offered:
Industrial Design
Prototypes for R&D
Concept Development
Engineering
R&D and Technology Development
Photo Realistic Rendering
Design for Manufacturing
Reverse Engineering - Laser Scanning
FEA Analysis
CFD Analysis
Rapid Prototyping technology processes: FDM, Poly jet, SLA, SLS.
Applications:
Direct Digital Manufacturing (DDM)
Aerospace Hardware
UAV, UUV, UGV Hardware
Medical and Healthcare
Homeland Security
Electronics; Packaging, Connectors
Rapid Prototypes
Appearance Models
Proof of Concept Prototypes
Design Evaluation Models (Form, Fit & Function)
Engineering Proving Models (Design Verification)
Product Performance & Testing
Wind-Tunnel Test Models
Tooling and Patterns
Pulp Moulding Tooling(concept development & bridge tools & Low Volume Production)
Thermofoming
Tooling and Manufacturing Estimating Visual Aid
Investment Casting Patterns
Jigs,Fixtures, Assembly Aids
Foundry Patterns - Sand Casting
Secondary Operations and Customized Finishes:
Surface Coatings
Lacquer
Water based Urethane
Two-part Urethane
Epoxy
Dip Coatings
EMI/RF Shielding
Fire Rated Spray Coating
UV Rated Spray Coating
Plating
Nickel plating
Vapor Deposition
Vacuum Metalizing
Decorations
Hand painting
Screen printing
Laser Etching
Dry Transfer
Water Transfer
Pressure Sensitive Labels
Reduce material waste
Save time
Cut Costs
Accelerate assembly and testing
Lightweight materials
More ergonomic for staff
Proven applications:
Check
Trim
Drill
Mask-shot peening and grit blast
Ready Part is available when you choose ABS or ABS-M30 production-grade thermoplastics. Both materials are used across many industries and are ideal for conceptual prototyping to direct digital manufacturing.
Ready Part parts are not intended for heated applications. Maximum temperatures of around 100 degrees F (40 degrees C) may be attainable but is geometry dependant.
Ready Part is ideal fro applications where a smooth surface finish is dersired:
Immediate use
Painting
Electroplating
Vacuum metallization
Master for RTV moulding
Water-tight applications under atmospheric pressure
Choose from a variety of colours and finishes:
ABS: White, Yellow, Gray: Matte & Gloss
ABS: Black, Blue, Red, Green, Steel Gray: Gloss only
ABS-M30: White, Ivory: Matte & Gloss
ABS-M30: Black, Dark Gray, Blue: Gloss only
Third-Party Information Liability Disclaimer
Some of the information on this Web page has been provided by external sources. The Government of Canada is not responsible for the accuracy, reliability or currency of the information supplied by external sources. Users wishing to rely upon this information should consult directly with the source of the information. Content provided by external sources is not subject to official languages, privacy and accessibility requirements.
Contacts
Contact information
Description
Company description
541340 - Drafting Services
541420 - Industrial Design Services
541430 - Graphic Design Services
541690 - Other Scientific and Technical Consulting Services
541710 - Research and Development in the Physical, Engineering and Life Sciences
Products, services and licensing
Product / Service / Licensing
Stratasys Performance Printers
Dimension 1200es:
Model material:
ABSplus in nine colors
Support material:
Soluble (SST 1200es); breakaway (BST 1200es)
Build size:
254 x 254 x 305 mm (10 x 10 x 12 in.)
Layer thickness:
0.33 mm (0.013 in.) or .254 mm (.010 in.)
Workstation compatibility:
Windows XP/Windows 7
Dimension Elite:
Model material:
ABSplus in nine colors
Support material:
Soluble or breakaway
Build size:
203 x 203 x 305 mm (8 x 8 x 12 in.)
Layer thickness:
0.254 mm (0.010 in.) or 0.178 mm (0.007 in.)
Workstation compatibility:
Windows XP/Windows 7
Fortus 250:
Material:
ABSplus-P430
Build envelope (XYZ):
254 x 254 x 305 mm (10 x 10 x 12 in.)
Material delivery:
One build material cartridge and one support material cartridge, each 923 cc (56.3 in3)
Layer thicknesses:
0.013 inch (0.330 mm)
0.010 inch (0.254 mm)
0.007 inch (0.178 mm)
Support structure: Soluble
Software: Insight
Stratasys Performance Printers
Objet 24:
Model material: Rigid Opaque white (VeroWhitePlus)
Support material: FullCure® 705 non-toxic gel-like photopolymer support
Material cartridges: Sealed four 1 Kg (2.2 lbs) cartridges
Tray size: 240 × 200 × 150 mm (9.45 × 7.87 × 5.9 in)
Net Build size: 234 x 192 x 148.6 mm (9.21 x 7.55 x 5.85 in)
Workstation compatibility:
Windows XP, Windows 7, Windows 8
Objet 30:
Model materials:
Rigid Opaque white (VeroWhitePlus)
Rigid Opaque blue (VeroBlue)
Rigid Opaque black (VeroBlack)
Rigid Opaque gray (VeroGray)
Polypropylene-like (DurusWhite)
Support material:
FullCure 705 non-toxic gel-like photopolymer support
Material cartridges:
Sealed four 1 Kg (2.2 lbs) cartridges
Net build size:
294 x 192 x 148.6 mm (11.57 x 7.55 x 5.85 in.)
Layer thickness:
28 microns (0.0011 in.)
Objet 30 Pro:
Model materials:
Transparent rigid (VeroClear)
Rigid Opaque white (VeroWhitePlus)
Rigid Opaque blue (VeroBlue)
Rigid Opaque black (VeroBlack)
Rigid Opaque gray (VeroGray)
Polypropylene-like (DurusWhite)
High Temperature (RGD525)
Support material:
FullCure 705 non-toxic gel-like photopolymer support
Material cartridges:
Sealed four 1 Kg (2.2 lbs) cartridges
Net build size:
294 x 192 x 148.6 mm (11.57 x 7.55 x 5.85 in.)
Layer thickness:
28 microns (0.0011 in.); 16 microns for VeroClear material (0.0006 in.)
Objet 30 Prime
Model materials:
Bio-compatible (MED610)
High Temperature (RGD525)
Rigid Opaque white (VeroWhitePlus)
Rigid Opaque blue (VeroBlue)
Rigid Opaque black (VeroBlack)
Rigid Opaque gray (VeroGray)
Rubber-like (TangoGray and TangoBlack)
Simulated Polypropylene (Durus and Endur)
Transparent rigid (VeroClear and RGD720)
Support material:
FullCure 705 non-toxic gel-like photopolymer support
Material cartridges:
Four sealed 1 Kg (2.2 lbs) cartridges
Net build size:
294 x 192 x 148.6 mm (11.57 x 7.55 x 5.85 in.)
Objet Eden 3D Printers:
Model materials:
Transparent rigid (VeroClear)
Rubber-like (Tango family)
Transparent general-purpose (FullCure RGD720)
Rigid Opaque (Vero family)
Polypropylene-like (DurusWhite)
High Temperature (RGD525)
Support material:
All Eden 3D printers work with SUP705 non-toxic gel-like photopolymer support. Additionally, the Eden260VS works with SUP707 soluble support when using VeroGray, VeroBlue and VeroClear in high-quality mode, or VeroWhitePlus in high-speed or high-quality mode.
Material cartridges:
Sealed four 3.6 kg (7.9 lbs) cartridges
Net Build size:
Eden260V: 255 × 252 × 200 mm (10.0 x 9.9 x 7.9 in.)
Eden260VS: 255 × 252 × 200 mm (10.0 x 9.9 x 7.9 in.)
Eden350V: 340 × 340 × 200 mm (13.4 × 13.4 × 7.9 in.)
Eden500V: 490 × 390 × 200 mm (19.3 x 15.35 x 7.9 in.)
Objet Connex 3D Printers:
Model materials:
Transparent rigid (VeroClear)
Rubber-like (Tango family)
Transparent general-purpose (RGD720)
Rigid Opaque (Vero family)
Polypropylene-like (Endur and Durus)
Digital model materials:
More than 100 digital materials can be manufactured on the fly including:
Engineering plastics such as Digital ABS Green material (RGD5160-DM) fabricated from RGD515 and RGD535
Transparent shades and patterns
Rigid opaque shades
Rubber-like materials with varying Shore A values
Polypropylene with improved thermal resistance
Support material:
SUP705 non-toxic gel-like photopolymer support
Material cartridges:
Materials are sold in cases of four sealed 3.6 kg (7.9 lb) cartridges.
VeroClear, Tango family, Durus and components of Digital ABS Green material also available as 1.44kg (3.17 lb) net weight in a 3.6kg case.
Two different model materials can be loaded simultaneously, and printers are front-loading for quick replacement.
See and hold your idea, even at its earliest stages. Test it, talk it and perfect it like never before. What are you waiting for? Get behind the wheel of 3D printing and take your idea for a spin.
Mojo:
Model material:
ABSplus in ivory, white, blue, fluorescent yellow, black, red, nectarine, olive green or gray
Support material:
SR-30 soluble
Maximum part size:
12.7 x 12.7 x 12.7 cm (5 x 5 x 5 in.)
Layer thickness:
0.178 mm (0.007 in.)
Workstation compatibility:
Windows XP/Windows 7
uPrintSE:
Model material:
ABSplus in ivory, white, blue, fluorescent yellow, black, red, nectarine, olive green or gray
Support material:
SR-30 soluble
Maximum part size:
12.7 x 12.7 x 12.7 cm (5 x 5 x 5 in.)
Layer thickness:
0.178 mm (0.007 in.)
Workstation compatibility:
Windows XP/Windows 7
uPrintSE Plus:
odel material:
ABSplus in ivory, white, blue, fluorescent yellow, black, red, nectarine, olive green or gray
Support material:
SR-30 soluble
Build size:
203 x 203 x 152 mm (8 x 8 x 6 in.)
Layer thickness:
.254 mm (.010 in.) or .330 mm (.013 in.)
Workstation compatibility:
Windows XP/Windows 7
Fortus Performance 3D Production Systems
Fortus 360mc specifications:
Material Options:
ABS-ESD7
ABSi
ABS-M30i
PC-ISO
PPSF
ULTEM 9085
Build envelope options:
355 x 254 x 254 mm (14 x 10 x 10 in.)
406 x 355 x 406 mm (16 x 14 x 16 in.)
Material delivery options:
One bay each for material and support canisters
Two bays each for material and support canisters (with larger build envelope)
Layer thicknesses:
0.330 mm (0.013 in.)
0.254 mm (0.010 in.)
0.178 mm (0.007 in.)
0.127 mm (0.005 in.)
Software: Insight
Fortus 380mc specifications:
Material Options:
ABS-M30
ABS-M30i
ABS-ESD7
ASA in black and ivory, with full range of colors coming in 2015
PC-ISO
PC
FDM Nylon 12
Build envelope options:
Fortus 380mc: 355 x 305 x 305 mm (14 x 12 x 12 in.)
Fortus 450mc: 406 x 355 x 406 mm (16 x 14 x 16 in.)
Material delivery options:
Fortus 380mc: One bay each for material and support canisters
Fortus 450mc: Two bays each for material and support canisters
Layer thicknesses:
0.330 mm (0.013 in.)
0.254 mm (0.010 in.)
0.178 mm (0.007 in.)
0.127 mm (0.005 in.)
Software: Insight
Fortus 400mc Specifications:
Material Options:
ABS-M30
ASA
FDM Nylon 12
PC
PC-ABS
ABS-ESD7
ABSi
ABS-M30i
PC-ISO
PPSF
ULTEM 9085
Build envelope options:
355 x 254 x 254 mm (14 x 10 x 10 in.)
406 x 355 x 406 mm (16 x 14 x 16 in.)
Material delivery options:
One bay each for material and support canisters
Two bays each for material and support canisters (with larger build envelope)
Layer thicknesses:
0.330 mm (0.013 in.)
0.254 mm (0.010 in.)
0.178 mm (0.007 in.)
0.127 mm (0.005 in.)
Software: Insight
Fortus 450mc Specifications:
Material Options:
ABS-M30
ABS-M30i
ABS-ESD7
ASA in black and ivory, with full range of colors coming in 2015
PC-ISO
PC
FDM Nylon 12
ULTEM 9085
ULTEM 1010
Build envelope options:
355 x 254 x 254 mm (14 x 10 x 10 in.)
406 x 355 x 406 mm (16 x 14 x 16 in.)
Material delivery options:
One bay each for material and support canisters
Two bays each for material and support canisters (with larger build envelope)
Layer thicknesses:
0.330 mm (0.013 in.)
0.254 mm (0.010 in.)
0.178 mm (0.007 in.)
0.127 mm (0.005 in.)
Software: Insight
Fortus 900 mc
Material Options:
ABS-ESD7
ABSi
ABS-M30
ABS-M30i
ASA
FDM Nylon 12
PC
PC-ABS
PC-ISO
PPSF
ULTEM 9085
Build envelope:
914 x 610 x 914 mm (36 x 24 x 36 in.)
Material delivery:
Two bays each for material and support canisters
Layer thicknesses:
0.330 mm (0.013 in.)
0.254 mm (0.010 in.)
0.178 mm (0.007 in.)
Software: Insight
Stratasys 3D Precision Production Systems
Connex 1
Model materials:
Rigid Opaque (VeroWhitePlus, VeroBlackPlus, VeroGray and VeroBlue)
Rubber-like (Tango family)
Transparent (RGD720 & VeroClear)
Simulated Polypropylene(Endur and Durus)
Biocompatible (MED610)
High Temperature (RGD525)
Support material:
FullCure 705 non-toxic gel-like photopolymer support
Build Size:
Objet350 Connex1: 342 x 342 x 200 mm (13.4 x 13.4 x 7.9 in.)
Objet500 Connex1: 490 x 390 x 200 mm (19.3 x 15.4 x 7.9 in.)
Layer Thickness:
Horizontal layers as fine as 16-microns (0.0006 in.)
Workstation Compatibility:
Windows 7
Connex 2
Model materials:
Rigid Opaque (VeroWhitePlus, VeroBlackPlus, VeroGray and VeroBlue)
Rubber-like (Tango family)
Transparent (RGD720 & VeroClear)
Simulated Polypropylene(Endur and Durus)
Biocompatible (MED610)
High Temperature (RGD525)
Digital Materials:
Digital ABS and Digital ABS2
Wide range of translucencies
Rubber-like blends in a range of Shore A values
Simulated Polypropylene materials with improved heat resistance
Support material:
FullCure 705 non-toxic gel-like photopolymer support
Build Size:
Objet350 Connex2 342 × 342 × 200 mm (13.4 × 13.4 × 7.9 in.)
Objet500 Connex2 490 x 390 x 200 mm (19.3 x 15.4 x 7.9 in.)
Layer Thickness:
Horizontal layers as fine as 16-microns (0.0006 in.)
Workstation Compatibility:
Windows 7
Connex 3:
Model materials:
Vero family of opaque materials, including various neutral shades and vibrant colors
Tango family rubber-like flexible materials
Medical: MED610
Digital ABS and Digital ABS2 in ivory and green
DurusWhite RGD430
High Temperature RGD525 white
Transparent: VeroClear and RGD720
Digital model materials:
Hundreds of composite materials can be manufactured on the fly including:
Digital ABS
Rubber-like materials in a variety of Shore A values
Vibrant blended colors in rigid opaque
Translucent colored tints
Polypropylene-like materials with improved thermal resistance
Support material:
SUP705 non-toxic gel-like photopolymer support
Net build size:
Objet350 Connex3: 342 × 342 × 200 mm (13.4 × 13.4 × 7.9 in.)
Objet500 Connex3: 490 × 390 × 200 mm (19.3 × 15.4 × 7.9 in.)
Layer thickness:
Horizontal build layers down to 16 microns (0.0006 in.)
Clean station models include: CleanStationDT jr., CleanStation DT 3, CleanStation SRS II, CleanStation XL Plus.
CleanStationDT jr. specifications: Ideal for Dimension 3D Printers - uPrintSE, uPrintSE Plus.
CleanStationDT 3 specifications: Ideal for Dimension 3D Printers - uPrintSE, uPrintSE Plus, SST 1200es, Elite, 250mc.
CleanStation SRS II specifications: Ideal for Fortus 3D Printers - 360mc, 400mc.
CleanStation XL Plus specifications: Ideal for Fortus 3D Printers - 360mc, 400mc, 900mc.
Finishing Touch Smooting Station specifications:
Chamber size: 13 x 16 x 20 inches (330 x 406 x 508 mm)
Compatible materials: ABS-M3, ABS-M30i, ABSi, ABSplus, ABS-p400
The 3D printers receive digital input from three-dimensional data files (STL, SLC) and create solid, three-dimensional parts through an additive, layer-by-layer process with a layer thickness [mm] from .00625 to .0762 and a resolution of [dpi] 5,000 x 5,000 x 8,000 XYZ. The patterns produced are extremely high resolution with vibrant details and outstanding surface finish.
The printers combine patent-protected, drop-on-demand ("DoD") thermoplastic ink-jetting technology and high-precision milling of each layer with the Company's proprietary graphical front-end software, ModelWorks®.
Solidscape's 3D wax printers utilize the Company's proprietary printing technology, SCP® (Smooth Curvature Printing®), which enables its systems to deliver the highest precision and surface finish in the industry. Developed to enhance throughput performance up to 25% (depending upon model geometry) and deliver master patterns that stand alone in the industry... the true benchmark of quality.
Solidscape systems include: 3Z Pro, 3Z Studio, 3Z Lab, and 3Z Edu
3z Pro specifications:
Model material/support material
o Model material formulated for clean burnout to produce 100% castings (Wax)/ Sacrificial material generated automatically for each job, and later dissolved away for a labor-saving, hands-free operation.
Build envelope: 6 X 6 X 4 (152.4 X 152.4 X 101.6 mm)
3Z Works
3z Studio specifications:
Model material/support material
o Model material formulated for clean burnout to produce 100% castings (Wa)x/ Sacrificial material generated automatically for each job, and later dissolved away for a labor-saving, hands-free operation.
Build envelope: 6 X 6 X 2 (152.4 X 152.4 X 50.8 mm)
3Z Works
3z LAB specifications:
Model material/support material
o Model material formulated for clean burnout to produce 100% castings (Wa)x/ Sacrificial material generated automatically for each job, and later dissolved away for a labor-saving, hands-free operation.
Build envelope: 6 X 6 X 2 (152.4 X 152.4 X 50.8 mm)
3Z Works
3z EDU
Model material/support material
o Model material formulated for clean burnout to produce 100% castings (Wa)x/ Sacrificial material generated automatically for each job, and later dissolved away for a labor-saving, hands-free operation.
Build envelope: 6 X 6 X 4 (152.4 X 152.4 X 50.8 mm)
3Z Works
Experienced professional engineers and product designers can be accessed when you need them. Sophisticated technology tools can be brought to bear without the cost of acquiring this hardware and software for a short-term requirement. The Cimetrix design team is composed of senior-level industrial and mechanical designers whose full-time work is in creating innovative solutions to demanding challenges.
Services offered:
Industrial Design
Prototypes for R&D
Concept Development
Engineering
R&D and Technology Development
Photo Realistic Rendering
Design for Manufacturing
Reverse Engineering - Laser Scanning
FEA Analysis
CFD Analysis
Rapid Prototyping technology processes: FDM, Poly jet, SLA, SLS.
Applications:
Direct Digital Manufacturing (DDM)
Aerospace Hardware
UAV, UUV, UGV Hardware
Medical and Healthcare
Homeland Security
Electronics; Packaging, Connectors
Rapid Prototypes
Appearance Models
Proof of Concept Prototypes
Design Evaluation Models (Form, Fit & Function)
Engineering Proving Models (Design Verification)
Product Performance & Testing
Wind-Tunnel Test Models
Tooling and Patterns
Pulp Moulding Tooling(concept development & bridge tools & Low Volume Production)
Thermofoming
Tooling and Manufacturing Estimating Visual Aid
Investment Casting Patterns
Jigs,Fixtures, Assembly Aids
Foundry Patterns - Sand Casting
Secondary Operations and Customized Finishes:
Surface Coatings
Lacquer
Water based Urethane
Two-part Urethane
Epoxy
Dip Coatings
EMI/RF Shielding
Fire Rated Spray Coating
UV Rated Spray Coating
Plating
Nickel plating
Vapor Deposition
Vacuum Metalizing
Decorations
Hand painting
Screen printing
Laser Etching
Dry Transfer
Water Transfer
Pressure Sensitive Labels
Reduce material waste
Save time
Cut Costs
Accelerate assembly and testing
Lightweight materials
More ergonomic for staff
Proven applications:
Check
Trim
Drill
Mask-shot peening and grit blast
Ready Part is available when you choose ABS or ABS-M30 production-grade thermoplastics. Both materials are used across many industries and are ideal for conceptual prototyping to direct digital manufacturing.
Ready Part parts are not intended for heated applications. Maximum temperatures of around 100 degrees F (40 degrees C) may be attainable but is geometry dependant.
Ready Part is ideal fro applications where a smooth surface finish is dersired:
Immediate use
Painting
Electroplating
Vacuum metallization
Master for RTV moulding
Water-tight applications under atmospheric pressure
Choose from a variety of colours and finishes:
ABS: White, Yellow, Gray: Matte & Gloss
ABS: Black, Blue, Red, Green, Steel Gray: Gloss only
ABS-M30: White, Ivory: Matte & Gloss
ABS-M30: Black, Dark Gray, Blue: Gloss only |
2024-11-18T17:59:32.944792+00:00 | 2020-10-14T22:00:52 | 8d7584fa070a1cf1d83bb9261ee73fb043ec6da8 | {
"blob_id": "8d7584fa070a1cf1d83bb9261ee73fb043ec6da8",
"branch_name": "refs/heads/main",
"committer_date": "2020-10-14T22:00:52",
"content_id": "db7dd6e63e25e749f295af9c0165629fa22d03bc",
"detected_licenses": [
"CC0-1.0"
],
"directory_id": "66839669e350453eec1fe50d8b429c39091e3199",
"extension": "html",
"filename": "collections.RBPair.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 304145536,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 8828,
"license": "CC0-1.0",
"license_type": "permissive",
"path": "/samples/Java Power CD/Applets/Collections/collections.RBPair.html",
"provenance": "stackv2_html-0000.json.gz:67",
"repo_name": "raychorn/svn_java_projects",
"revision_date": "2020-10-14T22:00:52",
"revision_id": "28d386d47e43e05101272b843ee6ec68fdb951b8",
"snapshot_id": "2c78bd8e742cc5fb50c0bbf3cd7acd5c836ccba9",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/raychorn/svn_java_projects/28d386d47e43e05101272b843ee6ec68fdb951b8/samples/Java Power CD/Applets/Collections/collections.RBPair.html",
"visit_date": "2022-12-30T08:56:52.334398"
} | stackv2 | Class collections.RBPair
All Packages Class Hierarchy This Package Previous Next Index
Class collections.RBPair
java.lang.Object
|
+----collections.Cell
|
+----collections.RBCell
|
+----collections.RBPair
- public class RBPair
- extends RBCell
- implements Pair
RBPairs are RBCells with keys.
-
RBPair(Object, Object)
- Make a cell with given key and element values, and null links
-
clone()
- Make a new node with same key and element values, but null links
-
count(Object, Comparator)
- Implements RBCell.count.
-
count(Object, Object, Comparator)
- return number of nodes of subtree holding (key, element)
-
countKey(Object, Comparator)
- return number of nodes of subtree holding key
-
find(Object, Comparator)
- Implements RBCell.find.
-
find(Object, Object, Comparator)
- find and return a cell holding (key, element), or null if no such
-
findKey(Object, Comparator)
- find and return a cell holding key, or null if no such
-
key()
- return the key
-
key(Object)
- set the key
RBPair
public RBPair(Object k,
Object v)
- Make a cell with given key and element values, and null links
clone
protected Object clone() throws CloneNotSupportedException
- Make a new node with same key and element values, but null links
- Overrides:
- clone in class RBCell
key
public final Object key()
- return the key
key
public final void key(Object k)
- set the key
find
public RBCell find(Object element,
Comparator cmp)
- Implements RBCell.find.
Override RBCell version since we are ordered on keys, not elements, so
element find has to search whole tree.
comparator argument not actually used.
- Overrides:
- find in class RBCell
- See Also:
- find
count
public int count(Object element,
Comparator cmp)
- Implements RBCell.count.
- Overrides:
- count in class RBCell
- See Also:
- count
findKey
public RBPair findKey(Object key,
Comparator cmp)
- find and return a cell holding key, or null if no such
find
public RBPair find(Object key,
Object element,
Comparator cmp)
- find and return a cell holding (key, element), or null if no such
countKey
public int countKey(Object key,
Comparator cmp)
- return number of nodes of subtree holding key
count
public int count(Object key,
Object element,
Comparator cmp)
- return number of nodes of subtree holding (key, element)
All Packages Class Hierarchy This Package Previous Next Index |
2024-11-18T17:59:32.944882+00:00 | 2018-12-18T14:50:45 | 2c6188042ac0f135b661d465bc99fadcc4559646 | {
"blob_id": "2c6188042ac0f135b661d465bc99fadcc4559646",
"branch_name": "refs/heads/master",
"committer_date": "2018-12-18T14:50:45",
"content_id": "79f1da4188cf90a85be3d43bda34a430bb15e7a9",
"detected_licenses": [
"Zlib"
],
"directory_id": "72752ec95d8dbf3074a3b566c98914c3e92ca4e6",
"extension": "html",
"filename": "rprojroot.html",
"fork_events_count": 3,
"gha_created_at": "2018-12-18T14:51:08",
"gha_event_created_at": "2020-02-08T16:37:02",
"gha_language": "HTML",
"gha_license_id": "Zlib",
"github_id": 162303514,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 5988,
"license": "Zlib",
"license_type": "permissive",
"path": "/data/CRAN/rprojroot.html",
"provenance": "stackv2_html-0000.json.gz:68",
"repo_name": "Nosferican/OSS.jl",
"revision_date": "2018-12-18T14:50:45",
"revision_id": "62f2b91ebb2d22c52ccf4061ae0457522b9e3863",
"snapshot_id": "b2400db928e1b7c7b34c8d7576d162fdb76d154f",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/Nosferican/OSS.jl/62f2b91ebb2d22c52ccf4061ae0457522b9e3863/data/CRAN/rprojroot.html",
"visit_date": "2020-04-12T04:42:43.793719"
} | stackv2 | Robust, reliable and flexible paths to files below a project root. The 'root' of a project is defined as a directory that matches a certain criterion, e.g., it contains a certain regular file.
| Version: | 1.3-2 |
| Depends: | R (≥ 3.0.0) |
| Imports: | backports |
| Suggests: | testthat, mockr, knitr, withr, rmarkdown |
| Published: | 2018-01-03 |
| Author: | Kirill Müller [aut, cre] |
| Maintainer: | Kirill Müller <krlmlr+r at mailbox.org> |
| BugReports: | https://github.com/krlmlr/rprojroot/issues |
| License: | GPL-3 |
| URL: | https://github.com/krlmlr/rprojroot, https://krlmlr.github.io/rprojroot |
| NeedsCompilation: | no |
| Materials: | NEWS |
| CRAN checks: | rprojroot results |
| Reference manual: | rprojroot.pdf |
| Vignettes: |
Finding files in project subdirectories |
| Package source: | rprojroot_1.3-2.tar.gz |
| Windows binaries: | r-devel: rprojroot_1.3-2.zip, r-release: rprojroot_1.3-2.zip, r-oldrel: rprojroot_1.3-2.zip |
| OS X binaries: | r-release: rprojroot_1.3-2.tgz, r-oldrel: rprojroot_1.3-2.tgz |
| Old sources: | rprojroot archive |
| Reverse imports: | cloudml, DataPackageR, debugr, desc, exampletestr, excerptr, here, learnr, pkgbuild, pkgload, prodigenr, radix, rcmdcheck, secret, sparklyr, styler, teachingApps, usethis, workflowr |
| Reverse suggests: | clusteredinterference, DBI, deckgl, document, docxtools, fakemake, googledrive, googlesheets, Rdpack, readxl, reprex, repurrrsive, RMariaDB, surveydata, tatoo, testthis, webdriver |
Please use the canonical form https://CRAN.R-project.org/package=rprojroot to link to this page. |
2024-11-18T17:59:32.956360+00:00 | 2020-02-10T16:44:57 | f2d1eb4a06c80b873bdb0f215fb8c3224c92427c | {
"blob_id": "f2d1eb4a06c80b873bdb0f215fb8c3224c92427c",
"branch_name": "refs/heads/master",
"committer_date": "2020-02-10T16:44:57",
"content_id": "74ae1a67313a30c17e753f78adc38bbe77ba97ee",
"detected_licenses": [
"MIT"
],
"directory_id": "22d42c29625cc8333811cdd4cacf80bad835f384",
"extension": "html",
"filename": "index.html",
"fork_events_count": 2,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 238470426,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 2686,
"license": "MIT",
"license_type": "permissive",
"path": "/examples/index.html",
"provenance": "stackv2_html-0000.json.gz:69",
"repo_name": "photonstorm/box2d-lite",
"revision_date": "2020-02-10T16:44:57",
"revision_id": "814bd3964b40e554abcc153717d3858d1e788b36",
"snapshot_id": "5f3c0e3f44b27a9d752ffbcacee843db8c1631aa",
"src_encoding": "UTF-8",
"star_events_count": 23,
"url": "https://raw.githubusercontent.com/photonstorm/box2d-lite/814bd3964b40e554abcc153717d3858d1e788b36/examples/index.html",
"visit_date": "2020-12-29T05:27:27.457448"
} | stackv2 | Demo 1: A Single Box
Demo 2: Simple Pendulum
Demo 3: Varying Friction Coefficients
Demo 4: Randomized Stacking
Demo 5: Pyramid Stacking
Demo 6: A Teeter
Demo 7: A Suspension Bridge
Demo 8: Dominos
Demo 9: Multi-pendulum
pause
frame:
bodies:
joints:
Render:
Bounds
Contacts
Joints
Bodies
Zoom
Pan H
Pan V
NEW |
2024-11-18T17:59:32.956429+00:00 | 2017-05-16T16:06:12 | 96a79a9e27a5de456a9cac59dd4c5d8c11c463ab | {
"blob_id": "96a79a9e27a5de456a9cac59dd4c5d8c11c463ab",
"branch_name": "refs/heads/master",
"committer_date": "2017-05-16T16:06:12",
"content_id": "42e2195ee0ec7a51184f4b7aef02ac9206517a9c",
"detected_licenses": [
"MIT"
],
"directory_id": "8c5cc6d145357bf7eb29a535d08534f44687860f",
"extension": "html",
"filename": "Submitted.html",
"fork_events_count": 6,
"gha_created_at": "2016-12-11T04:00:51",
"gha_event_created_at": "2022-08-30T20:56:03",
"gha_language": "JavaScript",
"gha_license_id": "MIT",
"github_id": 76153124,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 1474,
"license": "MIT",
"license_type": "permissive",
"path": "/configs/templates/Submitted.html",
"provenance": "stackv2_html-0000.json.gz:70",
"repo_name": "yichenfeng/AAFApplicationAngular",
"revision_date": "2017-05-16T16:06:12",
"revision_id": "15f091cd0b3b220bc1d40d916cd7414afd71207d",
"snapshot_id": "0acda875edea7199ea62086958a9b074f9fa7282",
"src_encoding": "UTF-8",
"star_events_count": 7,
"url": "https://raw.githubusercontent.com/yichenfeng/AAFApplicationAngular/15f091cd0b3b220bc1d40d916cd7414afd71207d/configs/templates/Submitted.html",
"visit_date": "2022-09-17T13:07:21.672009"
} | stackv2 | {% extends "layout.html" %} {% block content %}
|
Thank you for submitting an assistance request. You may view your request by clicking the button below.
Your application will be reviewed and you will recieve an email once the request is approved or if any additional documentaion is required. Thank you!. | |
2024-11-18T17:59:32.958445+00:00 | 2021-02-02T12:22:48 | baa3783b3bf07560522b5b44adaae9f874eec12c | {
"blob_id": "baa3783b3bf07560522b5b44adaae9f874eec12c",
"branch_name": "refs/heads/main",
"committer_date": "2021-02-02T12:22:48",
"content_id": "0cefb5a71b8251710d4f3b142531cff29a1f221b",
"detected_licenses": [
"MIT"
],
"directory_id": "8a0ae81d722737c871e0c452476b9faf89aea0db",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": "2021-01-04T10:00:46",
"gha_event_created_at": "2021-02-02T12:22:49",
"gha_language": "SCSS",
"gha_license_id": "MIT",
"github_id": 326640415,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 15685,
"license": "MIT",
"license_type": "permissive",
"path": "/index.html",
"provenance": "stackv2_html-0000.json.gz:71",
"repo_name": "ttytango/tjsportfolio",
"revision_date": "2021-02-02T12:22:48",
"revision_id": "43fb4ae81a353d7f712cc736f670982f88162027",
"snapshot_id": "0e4e005e4f4025bbf08ce667537a6bd20c08eeca",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/ttytango/tjsportfolio/43fb4ae81a353d7f712cc736f670982f88162027/index.html",
"visit_date": "2023-02-25T23:25:59.434063"
} | stackv2 | I write readable, semantic HTML code that follows best practice.
I am proficient in advanced CSS3 styling.
I use Javascript and JQuery to allow for an interactive user experience, as well as for frontend frameworks and API consumption.
I am an advanced Python programmer. I utilise it for many tasks from full-stack web development using the Django framework, to building GUI's both TKinter and PyQt5.
I use SCSS as my principle means to build projects of all sizes.
I am familiar with NodeJS and the ExpressJS framework including API creation, and use Node Package Manager for most of my web development projects.
I competently and frequently use git and the git bash command line as an effective Version Control System and for collaboration.
I am familiar with employing the use of several external UI libraries including Bootstrap, Semantic-UI and TailwindCSS among other CDN's to increase website loading speed in the client's browser.
As one of the most popular Javascript web frameworks available currently, I have in-depth knowledge of the React framework, including hooks, and helped developed a client app using the framework.
Svelte is a unique, reactive Javascript web framework that is incredibly lightweight and incredibly powerful. I often use Svelte and the related Sapper framework, which is built on Svelte, but is still very much in development, for rapid interactive prototyping.
Although I normally use Windows, I also love using Linux and am familiar with multiple distros and enjoy using my Raspberry Pi.
About Me
Having come from a background in academia, where I specialised in Southeast Asian politics, I moved into the realm of programming around the beginning of 2020. Although I did delve for some months into R for quantitative data analysis a few years beforehand, I now find myself as a trainee web developer.
My immediate goals are to boost my knowledge of modern Frontend Web Development to enter into the tech industry, and build upon knowledge of what I already know.
Prior to starting the bootcamp at _Nology in order to attain these goals in early October 2020, I had already taught myself a great deal of Python, eventually teaching myself the Django framework and Django REST Framework for building API's.
I have quite a few other interests outside of the web, including music production and playing with synthesizers.
I love to keep on learning and challenging myself. As a result, I am also fluent in French and at an intermediate-level Mandarin Chinese and Myanmar/Burmese language (both written and spoken)
My Skills
HTML 5
CSS
Javascript
Python
SASS/SCSS
NPM/Node
Git
Bootstrap
React
Svelte
Ubuntu/Linux
How I can help
I have good practical knowledge of building backend and frontend web applications as well as in the creation of RESTful API's.
I can also do a fair bit of computer programming and can build small programmes using Python as well as interact with databases.
I am always prepared for any challenge, big or small. Feel free to browse my portfolio or contact me here.
My LinkedIn and Github profile links are in the footer! |
2024-11-18T17:59:32.958557+00:00 | 2020-01-07T21:23:35 | 096350314279b21600391ee84789e3765adb752a | {
"blob_id": "096350314279b21600391ee84789e3765adb752a",
"branch_name": "refs/heads/master",
"committer_date": "2020-01-07T21:23:35",
"content_id": "5e5ec4b61520cdc98d7a7de4a1a538c5a5429e93",
"detected_licenses": [
"BSD-2-Clause"
],
"directory_id": "8ccfaf3f7dbf31a78ee860d6c1bce41bbb355751",
"extension": "html",
"filename": "5871911277192424889.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": null,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 2728,
"license": "BSD-2-Clause",
"license_type": "permissive",
"path": "/dataset/20191113/20/5871911277192424889.html",
"provenance": "stackv2_html-0000.json.gz:72",
"repo_name": "5l1v3r1/telegram-data-clustering-contest",
"revision_date": "2020-01-07T21:23:35",
"revision_id": "f5fa880068b00b166fcf46b5790f4e9a77ba555e",
"snapshot_id": "95673424bdfcbbbdea02658879312ce1a0f51a43",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/5l1v3r1/telegram-data-clustering-contest/f5fa880068b00b166fcf46b5790f4e9a77ba555e/dataset/20191113/20/5871911277192424889.html",
"visit_date": "2022-04-06T15:09:53.483062"
} | stackv2 | Lamar Jackson shoots down comparison to Deshaun Watson
by Marcelo VillaSunday’s matchup between the Ravens and Texans will feature two of the most dynamic quarterbacks in the game right now in Lamar Jackson and Deshaun Watson. But while both exhibit similar qualities on the field, they aren’t the same player, and Jackson wants to make that very clear.
Speaking to reporters on Thursday, Jackson was asked if he sees some of himself in the Texans quarterback, and he was quick to shoot down the comparison to Watson.
Yes, Jackson and Watson are extremely athletic and capable of making highlight-worthy plays on every snap, but they do so differently. More often than not, Watson has been using his legs to extend plays in the passing game. Jackson, on the other hand, is running all over defenses this season. His 702 rushing yards currently rank 11th in the league, and he’s averaging a whopping 6.6 yards per carry.
Some might say that Watson is the better passer of the two, but Jackson hasn’t been far behind in that department. Both enter Sunday’s matchup with impressive stats throwing the ball.
Regardless of who comes out on top, it will be highly entertaining to see these two MVP candidates go head to head. |
2024-11-18T17:59:32.960341+00:00 | 2022-05-30T18:56:52 | f359ca960da95c25d3623e3d0c3c4569c3aba936 | {
"blob_id": "f359ca960da95c25d3623e3d0c3c4569c3aba936",
"branch_name": "refs/heads/master",
"committer_date": "2022-05-30T18:56:52",
"content_id": "f9e3d0463a4cd071652768ec9235fdcd65350aa0",
"detected_licenses": [
"Unlicense"
],
"directory_id": "08da190ea6cfd51e2fe232083982e533a0a15caa",
"extension": "html",
"filename": "msg00055.html",
"fork_events_count": 5,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 277697349,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 3711,
"license": "Unlicense",
"license_type": "permissive",
"path": "/files/Organized Files Archive/aryan-nation-2009/msg00055.html",
"provenance": "stackv2_html-0000.json.gz:73",
"repo_name": "YetAnotherMorty/wikileaks-database",
"revision_date": "2022-05-30T18:56:52",
"revision_id": "e6f59e1dab568e9fac1c1286d2f3900cd1d17641",
"snapshot_id": "74cbeaa2942520e73fc5b8d392ab16e6bece1ad0",
"src_encoding": "UTF-8",
"star_events_count": 23,
"url": "https://raw.githubusercontent.com/YetAnotherMorty/wikileaks-database/e6f59e1dab568e9fac1c1286d2f3900cd1d17641/files/Organized Files Archive/aryan-nation-2009/msg00055.html",
"visit_date": "2023-05-03T01:28:13.619915"
} | stackv2 | |
TO: Colonel Rich Greetings! Pastor Lance has been working with Nate & we had a meeting on Sunday. He's going to have some A/N T-shirts made & is workin on Pamphlets to pass out Since Colonel Rick is not active at this moment, I'll step up to the plate & concentrate on Counter-infiltration west of the Mississippi... No doubt the enemy has another Gletty in preperation! SEE: http://www.prisonplanet.com/articles/february2007/150207_b_Neo-Nazi.htm Respectfully, Bob Share life as it happens with the new Windows Live. Share now! | |
2024-11-18T17:59:32.961186+00:00 | 2017-10-29T12:18:36 | e0fb083595213ff0767a9b2f81694bc419027352 | {
"blob_id": "e0fb083595213ff0767a9b2f81694bc419027352",
"branch_name": "refs/heads/master",
"committer_date": "2017-10-29T12:18:36",
"content_id": "48f85ae0649e59b1bfed392c56ea5b10f2753b02",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "2a41b60eb4b7b3556c02add0a74597d6510a8ccf",
"extension": "html",
"filename": "23424.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 86565828,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 5182,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/com/radityalabs/Python/origin/movie/23424.html",
"provenance": "stackv2_html-0000.json.gz:74",
"repo_name": "radityagumay/BenchmarkSentimentAnalysis_2",
"revision_date": "2017-10-29T12:18:36",
"revision_id": "e509a4e749271da701ce9da1d9f16cdd78dcdf40",
"snapshot_id": "fe66d9e7baf561a932bfd0205c47d1d44cb6e6fa",
"src_encoding": "UTF-8",
"star_events_count": 3,
"url": "https://raw.githubusercontent.com/radityagumay/BenchmarkSentimentAnalysis_2/e509a4e749271da701ce9da1d9f16cdd78dcdf40/com/radityalabs/Python/origin/movie/23424.html",
"visit_date": "2020-12-31T07:09:31.676010"
} | stackv2 | THE PORNOGRAPHER A film review by Steve Rhodes Copyright 2000 Steve Rhodes RATING (0 TO ****): *** 1/2
"See, my parents never talked to me about sex," explains the boyishly handsome Paul Ryan (Michael DeGood), a 25-year-old man with the maturity level of a young teen. "If I ever talked about a girl in class, my parents would tease me."
Not having a clue as to how to ask a woman out, Paul turns instead to a fantasy world of pornography and prostitutes, not that he finds it particularly fulfilling. "Lately I've been wanting something different, something more," he tells us of his desire for a genuine relationship. This is not surprising since he is secure but unhappy with his world of paid sex. He needs a real relationship with a woman.
Writer/director Doug Atchison's THE PORNOGRAPHER is a wonderful film quite comparable to the highly acclaimed and popular BOOGIE NIGHTS. Even if it isn't quite as funny as BOOGIE NIGHTS, THE PORNOGRAPHER is much more genuine and touching. As the director correctly explained at our screening, "the story is more about love, loneliness and corruption than pornography."
Paul's first feeble attempts to secure dates end disastrously. After all, he reasons, porn flicks are so poorly made and plotless that he is confident that he could do better.
Seeing himself as a successful adult film director, he goes to one of the big porn studios to secure a position. Producer Spano (Craig Wasson), a Jerry Springer look-alike, explains the business to him. (Spano proudly shows off his equivalent of an Oscar for the best girl-to-girl sex movie of 1994.)
"This is where dreams come true," Spano says of the adult film industry. "Twenty percent of video rentals are for adult videos," he reminds Paul, who looks upon Spano as a mentor and hero.
The reality of the business turns out to be much more gruesome than Paul ever imagined. Spano sends Paul to meet Charise (Monique Parent), a hard nosed, veteran porn actress who uses Paul, much as the producers use young actresses, as she follows her scheme to setup her own studio.
Spano demands the equivalent of the ruby slippers before he will let Paul make pictures for him. All Paul need do is bring back -- read corrupt -- some innocent young woman who has never done anything in the sex industry before. Paul knows just the woman, Kate (Katheryn Cain), a sweet young Tennessean who is a broke, young actress living in LA. The problem is that Kate is a charmingly naive, girl-next-door type whom he feels guilty about leading astray. You can almost see Paul's angel and devil speaking to him on opposite shoulders.
Paul pulls out all stops to lure Kate in. "The risk takers, they're the ones that get ahead. They're the ones that pass you by in the limousines," he tells her, repeating lines that he heard earlier. "This is about dreams," he tells her in an attempt to clinch his deal with her to do just a little test video in a bikini.
Parts of the film are hilarious with most of the best lines being unprintable. Its excellent acting and handsome look belie its very low budget. A deeply moving film with the porn industry as its backdrop, THE PORNOGRAPHER shows indie films at their best and without a single witch.
THE PORNOGRAPHER runs 1:29. It is not rated but might be an R for strong sexuality, nudity, drug usage, language and brief violence. The film would be acceptable for high school seniors.
Email<EMAIL_ADDRESS>Web: http://www.InternetReviews.com
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews |
2024-11-18T17:59:32.965446+00:00 | 2021-04-08T16:35:51 | fd13150a53b39d6037bcda2bd20bf9e4ef426b6c | {
"blob_id": "fd13150a53b39d6037bcda2bd20bf9e4ef426b6c",
"branch_name": "refs/heads/master",
"committer_date": "2021-04-08T16:35:51",
"content_id": "aa7638f97a0134adae0dbb9572bdc6b4ef31fe61",
"detected_licenses": [
"MIT"
],
"directory_id": "19999ecfab4ba63d32c7c1483b496d97399bb889",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 100381808,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 6037,
"license": "MIT",
"license_type": "permissive",
"path": "/_site/archives/index.html",
"provenance": "stackv2_html-0000.json.gz:75",
"repo_name": "dennisladefoged/routetonull",
"revision_date": "2021-04-08T16:35:51",
"revision_id": "5365d8265ad712273819d379a020900e0caf98a2",
"snapshot_id": "55ec2c74b3b5c9681b8ba0fa31057ecd7056b29c",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/dennisladefoged/routetonull/5365d8265ad712273819d379a020900e0caf98a2/_site/archives/index.html",
"visit_date": "2021-07-10T23:08:51.157975"
} | stackv2 | Technical posts on networking, automation and career
Home
About
Site Archives
Post Categories
Content Tags
routetonull.
the jabberings of a networking guy
Site Archives
2017
November
30 November 2017
·
ArubaOS 8 centralized upgrade
2016
December
12 December 2016
·
Change of scenery
2014
July
22 July 2014
·
HP´s response to Meraki is here
May
20 May 2014
·
Cisco Prime Infrastructure 2.1
13 May 2014
·
IMC UAM Radius and IPv6
9 May 2014
·
IMC operator LDAP / SSL authentication
6 May 2014
·
IMC 7.0 E0202
March
5 March 2014
·
The starting point of my new blog |
2024-11-18T17:59:32.965655+00:00 | 2017-03-17T21:38:54 | 0e5146e99a53ac42b66f16c9cb90064639ad0b1a | {
"blob_id": "0e5146e99a53ac42b66f16c9cb90064639ad0b1a",
"branch_name": "refs/heads/master",
"committer_date": "2017-03-17T21:38:54",
"content_id": "ace355cde02c30a8e3be9c6c9a9cc7d46bb3edd7",
"detected_licenses": [
"MIT"
],
"directory_id": "d6a41976b482c94cd09d506a9eda59c1f6f68c88",
"extension": "htm",
"filename": "pbgame.htm",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 49816958,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 13824,
"license": "MIT",
"license_type": "permissive",
"path": "/pbgame.htm",
"provenance": "stackv2_html-0000.json.gz:76",
"repo_name": "Steffkn/Quake-configs",
"revision_date": "2017-03-17T21:38:54",
"revision_id": "aef5b1b6a6abbf3087f6b3109d8b7711a835759c",
"snapshot_id": "5432462a2a17618f4cb18a44bc1a173d2730e19c",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/Steffkn/Quake-configs/aef5b1b6a6abbf3087f6b3109d8b7711a835759c/pbgame.htm",
"visit_date": "2020-12-25T14:13:06.838557"
} | stackv2 | If a pbcl.dll is found in a directory, that is # considered a valid install location. Otherwise, we proceed to the next hint. If all hints are exhausted # and no pbcl.dll is found, then we display the first absolute path hint. This means that the most likely # absolute file path for a game should be placed first among all the absolute file path hints.
game_hint w aao "HKEY_LOCAL_MACHINE[SOFTWARE\US Army\America's Army\Operations\]@InstallDir\System"
game_hint w aao "C:\Program Files\America's Army\System"
game_hint w aao "D:\Program Files\America's Army\System"
game_hint l aao "$HOME/.armyops260/System"
game_hint l aao "$HOME/.armyops250/System"
game_hint l aao "$HOME/.armyops240/System"
game_hint l aao "$HOME/.armyops230/System"
game_hint l aao "$HOME/.armyops231/System"
game_hint l aao "$HOME/.armyops221/System"
game_hint l aao "$HOME/.aao/System"
game_hint l aao "$HOME/.aao230/System"
game_hint l aao "/usr/local/games/armyops/System"
game_hint m aao "$HOME/aao/System"
game_hint m aao "/Applications/Army Operations 2.5.0.app/System/"
game_hint w aav3 "HKEY_LOCAL_MACHINE[SOFTWARE\US Army\America's Army\AA3Client\]@InstallDir\Binaries"
game_hint w aav3 "HKEY_LOCAL_MACHINE[SOFTWARE\Wow6432Node\US Army\America's Army\AA3Client\]@InstallDir\Binaries"
game_hint w acb "HKEY_LOCAL_MACHINE[SOFTWARE\Wow6432Node\Ubisoft\Assassin's Creed Brotherhood\]@InstallDir"
game_hint w acb "HKEY_LOCAL_MACHINE[SOFTWARE\Ubisoft\Assassin's Creed Brotherhood\]@InstallDir"
game_hint w acb "C:\Program Files (x86)\Ubisoft\Assassin's Creed Brotherhood\"
game_hint w acb "C:\Program Files\Ubisoft\Assassin's Creed Brotherhood\"
game_hint w apb "HKEY_LOCAL_MACHINE[SOFTWARE\GamersFirst\APB\APB Reloaded\]@Installation Path\Binaries"
game_hint w apb "HKEY_LOCAL_MACHINE[SOFTWARE\Wow6432Node\GamersFirst\APB\APB Reloaded\]@Installation Path\Binaries"
game_hint w apb "C:\Program Files (x86)\GamersFirst\APB Reloaded\Binaries"
game_hint w apb "C:\Program Files\GamersFirst\APB Reloaded\Binaries"
game_hint w bf2 "HKEY_LOCAL_MACHINE[SOFTWARE\Electronic Arts\EA Games\Battlefield 2\]@InstallDir"
game_hint w bf2 "C:\Program Files\EA Games\Battlefield 2"
game_hint w bf2 "C:\Program Files\EA Games\Battlefield 2 Server"
game_hint w bf2 "HKEY_LOCAL_MACHINE[SOFTWARE\Electronic Arts\EA Games\Battlefield 2 Demo\]@InstallDir"
game_hint w bf2 "C:\Program Files\EA Games\Battlefield 2 Demo"
game_hint w bf2142 "HKEY_LOCAL_MACHINE[SOFTWARE\Electronic Arts\EA Games\Battlefield 2142\]@InstallDir"
game_hint w bf2142 "C:\Program Files\EA Games\Battlefield 2142"
game_hint w bf2142 "C:\Program Files\EA Games\Battlefield 2142 Server"
game_hint w bf2142 "HKEY_LOCAL_MACHINE[SOFTWARE\Electronic Arts\EA Games\Battlefield 2142 Demo\]@InstallDir"
game_hint w bf2142 "C:\Program Files\EA Games\Battlefield 2142 Demo"
game_hint w bf2142 "C:\Program Files\Electronic Arts\Battlefield 2142 Demo"
game_hint w bf2142 "HKEY_LOCAL_MACHINE[SOFTWARE\EA GAMES\Battlefield 2142 Demo Server\]@GAMEDIR"
game_hint w bf2142 "C:\Program Files\Electronic Arts\Battlefield 2142 Demo Server"
game_hint w bfp4f "HKEY_LOCAL_MACHINE[SOFTWARE\Electronic Arts\EA Games\Battlefield Play4Free\]@InstallDir"
game_hint w bfp4f "HKEY_LOCAL_MACHINE[SOFTWARE\Wow6432Node\Electronic Arts\EA Games\Battlefield Play4Free\]@InstallDir"
game_hint w bfp4f "C:\Program Files (x86)\EA Games\Battlefield Play4Free\"
game_hint w bfp4f "C:\Program Files\EA Games\Battlefield Play4Free\"
game_hint w bc2 "HKEY_LOCAL_MACHINE[SOFTWARE\Electronic Arts\Battlefield Bad Company 2\]@Install Dir"
game_hint w bc2 "HKEY_LOCAL_MACHINE[SOFTWARE\Wow6432Node\Electronic Arts\Battlefield Bad Company 2\]@Install Dir"
game_hint w bc2 "C:\Program Files (x86)\Electronic Arts\Battlefield Bad Company 2\"
game_hint w bc2 "C:\Program Files (x86)\Steam\SteamApps\common\battlefield bad company 2\"
game_hint w bc2 "C:\Program Files\Steam\SteamApps\common\battlefield bad company 2\"
game_hint w bc2 "C:\Program Files\Electronic Arts\Battlefield Bad Company 2\"
game_hint w heroes "HKEY_LOCAL_MACHINE[SOFTWARE\Electronic Arts\EA GAMES\Battlefield Heroes\]@Installation Dir"
game_hint w heroes "HKEY_LOCAL_MACHINE[SOFTWARE\Wow6432Node\Electronic Arts\EA GAMES\Battlefield Heroes\]@Installation Dir"
game_hint w heroes "C:\Program Files\EA Games\Battlefield Heroes"
game_hint w heroes "C:\Program Files (x86)\EA Games\Battlefield Heroes"
game_hint w doom3 "HKEY_LOCAL_MACHINE[SOFTWARE\Id\Doom 3\]@InstallPath"
game_hint w doom3 "C:\Program Files\Doom 3"
game_hint l doom3 "$HOME/.doom3"
game_hint w bfv "HKEY_LOCAL_MACHINE[SOFTWARE\EA GAMES\Battlefield Vietnam\]@GAMEDIR"
game_hint w moh "HKEY_LOCAL_MACHINE[SOFTWARE\Electronic Arts\Medal of Honor\]@Install Dir\MP"
game_hint w moh "HKEY_LOCAL_MACHINE[SOFTWARE\Valve\Steam\]@InstallPath\steamapps\common\medal of honor\MP"
game_hint w moh "C:\Program Files\Electronic Arts\Medal of Honor\MP"
game_hint w unco "HKEY_LOCAL_MACHINE[SOFTWARE\EA GAMES\Need for Speed Undercover\]@Install Dir"
game_hint w unco "HKEY_LOCAL_MACHINE[SOFTWARE\Wow6432Node\EA GAMES\Need for Speed Undercover\]@Install Dir"
game_hint w unco "C:\Program Files (x86)\EA Games\Need for Speed Undercover\"
game_hint w unco "C:\Program Files\EA Games\Need for Speed Undercover\"
game_hint w prey "C:\Program Files\Human Head Studios\Prey"
game_hint w prey "C:\Program Files\Prey"
game_hint w q3a "HKEY_LOCAL_MACHINE[SOFTWARE\Id\Quake III Arena\]@INSTALLPATH"
game_hint w q3a "C:\Program Files\Quake III Arena"
game_hint l q3a "$HOME/.q3a"
game_hint l q3a "/usr/local/games/quake3"
game_hint m q3a "/Applications/Quake3"
game_hint w q4 "HKEY_LOCAL_MACHINE[SOFTWARE\Id\Quake 4\]@InstallPath"
game_hint w q4 "C:\Program Files\id Software\Quake 4"
game_hint l q4 "$HOME/.quake4"
game_hint l q4 "/usr/local/games/quake4"
game_hint m q4 "/Applications/Quake4"
game_hint w cod "HKEY_LOCAL_MACHINE[SOFTWARE\Activision\Call of Duty\]@InstallPath"
game_hint w cod "HKEY_LOCAL_MACHINE[SOFTWARE\Valve\Steam\]@InstallPath\steamapps\common\call of duty"
game_hint w cod "C:\PROGRA~1\CALLOF~1"
game_hint m cod "$HOME/Library/Application Support/Call of Duty"
game_hint w cod2 "HKEY_LOCAL_MACHINE[SOFTWARE\Activision\Call of Duty 2\]@InstallPath"
game_hint w cod2 "HKEY_LOCAL_MACHINE[SOFTWARE\Valve\Steam\]@InstallPath\steamapps\common\call of duty 2"
game_hint w cod2 "C:\Program Files\Activision\Call of Duty 2"
game_hint m cod2 "/Applications/Call of Duty 2"
game_hint m cod2 "$HOME/Library/Application Support/Call of Duty 2"
game_hint w crysis "HKEY_LOCAL_MACHINE[SOFTWARE\Crytek\Crysis\]@InstallDir"
game_hint w crysis "HKEY_LOCAL_MACHINE[SOFTWARE\Wow6432Node\Crytek\Crysis\]@InstallDir"
game_hint w crysis "C:\Program Files\Electronic Arts\Crytek\Crysis"
game_hint w wh "$USERPROFILE\Documents\My Games\Crysis Wars"
game_hint w wh "$USERPROFILE\My Documents\My Games\Crysis Wars"
game_hint w wh "$USERPROFILE\My Documents\My Games\Crysis Wars\PunkBuster"
game_hint w wh "HKEY_LOCAL_MACHINE[SOFTWARE\Crytek\Crysis Wars\]@InstallDir"
game_hint w wh "HKEY_LOCAL_MACHINE[SOFTWARE\Wow6432Node\Crytek\Crysis Wars]@InstallDir"
game_hint w wh "C:\Program files\Electronic Arts\Crytek\Crysis Wars"
game_hint w cod4 "HKEY_LOCAL_MACHINE[SOFTWARE\Activision\Call of Duty 4\]@InstallPath"
game_hint w cod4 "HKEY_LOCAL_MACHINE[SOFTWARE\Wow6432Node\Activision\Call of Duty 4\]@InstallPath"
game_hint w cod4 "HKEY_LOCAL_MACHINE[SOFTWARE\Valve\Steam\]@InstallPath\steamapps\common\call of duty 4"
game_hint w cod4 "C:\Program Files\Activision\Call of Duty 4"
game_hint w cod4 "C:\Program Files\Steam\steamapps\common\call of duty 4"
game_hint m cod4 "$HOME/Library/Application Support/Call of Duty 4"
game_hint m cod4 "/Applications/Call of Duty 4.app/Contents/Call of Duty 4 Data"
game_hint m cod4 "/Applications/Call of Duty 4.app/Call of Duty 4 Data"
game_hint m cod4 "/Applications/Call of Duty 4.app/Contents/Call of Duty 4 Multiplayer.app/Contents"
game_hint m cod4 "/Applications/Call of Duty 4.app/Contents"
game_hint m cod4 "/Applications/Call of Duty 4"
game_hint m cod4 "/Applications/Call of Duty 4"
game_hint w waw "HKEY_LOCAL_MACHINE[SOFTWARE\Wow6432Node\Activision\CODWAW\]@InstallPath"
game_hint w waw "HKEY_LOCAL_MACHINE[SOFTWARE\Wow6432Node\Activision\Call of Duty WAW\]@InstallPath"
game_hint w waw "HKEY_LOCAL_MACHINE[SOFTWARE\Activision\CODWAW\]@InstallPath"
game_hint w waw "HKEY_LOCAL_MACHINE[SOFTWARE\Activision\Call of Duty WAW\]@InstallPath"
game_hint w waw "C:\Program Files\Activision\Call of Duty - World at War"
game_hint w et "HKEY_LOCAL_MACHINE[SOFTWARE\Activision\Wolfenstein - Enemy Territory\]@InstallPath"
game_hint w et "C:\PROGRA~1\WOLFEN~1"
game_hint l et "$HOME/.etwolf"
game_hint l et "/usr/local/games/enemy-territory"
game_hint m et "$HOME/Library/Application Support/Wolfenstein ET"
game_hint w etqw "HKEY_LOCAL_MACHINE[SOFTWARE\Id\ETQW Beta]@InstallPath"
game_hint w etqw "HKEY_LOCAL_MACHINE[SOFTWARE\Id\ET - QUAKE Wars]@InstallPath"
game_hint w etqw "HKEY_LOCAL_MACHINE[SOFTWARE\Wow6432Node\Id\ET - QUAKE Wars]@InstallPath"
game_hint w fearpm "HKEY_LOCAL_MACHINE[SOFTWARE\TimeGate Studios\FEARXP2\1.00.0000]@InstallDir"
game_hint w fearpm "HKEY_LOCAL_MACHINE[SOFTWARE\TimeGate Studios\FEAR Perseus Mandate\1.00.0000]@InstallDir"
game_hint w fearpm "C:\Program Files\Sierra Entertainment\FEAR Perseus Mandate"
game_hint w fearpm "C:\Documents and Settings\All Users\Documents\TimeGate Studios\FEAR"
game_hint w ffow "HKEY_LOCAL_MACHINE[SOFTWARE\THQ\Frontlines: Fuel of War\]@InstallDir\Binaries"
game_hint w ffow "C:\Program Files\steam\steamapps\common\frontlines fuel of war\Binaries\"
game_hint w sof2 "HKEY_LOCAL_MACHINE[SOFTWARE\Activision\Soldier of Fortune II - Double Helix\]@InstallPath"
game_hint w sof2 "C:\Program Files\Soldier of Fortune II - Double Helix GOLD"
game_hint m sof2 "$HOME/Library/Application Support/Soldier of Fortune 2 MP"
game_hint w vegas "HKEY_LOCAL_MACHINE[SOFTWARE\Ubisoft\Rainbow Six Vegas]@InstallDir\KellerGame"
game_hint w wolf "HKEY_LOCAL_MACHINE[SOFTWARE\Activision\Wolfenstein]@InstallPath\MP"
game_hint w wolf "HKEY_LOCAL_MACHINE[SOFTWARE\Wow6432Node\Activision\Wolfenstein]@InstallPath\MP"
game_hint w hos "C:\Program Files\steam\steamapps\common\redorchestra2beta\Binares\Win32\"
game_hint w hos "C:\Program Files (x86)\steam\steamapps\common\redorchestra2beta\Binares\Win32\"
game_hint w hos "HKEY_LOCAL_MACHINE[SOFTWARE\Valve\Steam]@InstallPath\steamapps\common\redorchestra2beta\Binaries\Win32"
game_hint w hos "HKEY_LOCAL_MACHINE[SOFTWARE\Wow6432Node\Valve\Steam]@InstallPath\steamapps\common\redorchestra2beta\Binaries\Win32"
game_hint w rtcw "HKEY_LOCAL_MACHINE[SOFTWARE\Activision\Return to Castle Wolfenstein - Game of The Year Edition\]@InstallPath"
game_hint w rtcw "HKEY_LOCAL_MACHINE[SOFTWARE\Activision\Return to Castle Wolfenstein\]@InstallPath"
game_hint w rtcw "C:\Program Files\Return to Castle Wolfenstein"
game_hint w rtcw "C:\Program Files\Return to Castle Wolfenstein - Game of The Year Edition" |
2024-11-18T17:59:32.967636+00:00 | 2020-09-16T18:22:30 | 34d503e76d954c278562efb82f993b231fa4279e | {
"blob_id": "34d503e76d954c278562efb82f993b231fa4279e",
"branch_name": "refs/heads/master",
"committer_date": "2020-09-16T18:22:30",
"content_id": "50fa620a9cb16edafdf9919fc6ee6f148fb8d955",
"detected_licenses": [
"MIT"
],
"directory_id": "255bac328301cf7b793a05437a3f75218565cd24",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": "2020-09-16T17:36:43",
"gha_event_created_at": "2020-09-16T18:22:31",
"gha_language": "HTML",
"gha_license_id": "MIT",
"github_id": 296103988,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 453,
"license": "MIT",
"license_type": "permissive",
"path": "/index.html",
"provenance": "stackv2_html-0000.json.gz:77",
"repo_name": "HipGunslinger/JohnnyRep",
"revision_date": "2020-09-16T18:22:30",
"revision_id": "52065e6520117965066c204150e5b71b6579e28e",
"snapshot_id": "9318347065e55d41ee3e92e472d6546ccaa3d333",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/HipGunslinger/JohnnyRep/52065e6520117965066c204150e5b71b6579e28e/index.html",
"visit_date": "2022-12-23T09:43:24.330260"
} | stackv2 | This is a greeting. I come in peace.
Hello there, person! Are you a carbon based life form as well?
This is a photograph. It was taken by Gregory Crewdson. |
2024-11-18T17:59:32.991157+00:00 | 2015-12-12T04:54:08 | 2a114fa1ccdbbb9667d7f2ec479eb4a1089517dd | {
"blob_id": "2a114fa1ccdbbb9667d7f2ec479eb4a1089517dd",
"branch_name": "refs/heads/master",
"committer_date": "2015-12-12T04:54:08",
"content_id": "6d5ce49c168fa2d4093a81b67a92c93b18335eb0",
"detected_licenses": [
"MIT"
],
"directory_id": "f6d08a4c138f4acb713fe38097e142c9877644d2",
"extension": "html",
"filename": "aalsamin_prog01.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": null,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 6843,
"license": "MIT",
"license_type": "permissive",
"path": "/aalsamin/aalsamin_prog01.html",
"provenance": "stackv2_html-0000.json.gz:78",
"repo_name": "cis255/cis255_2015_fall",
"revision_date": "2015-12-12T04:54:08",
"revision_id": "53303896a7a88dfedd48c059996fc3270c108b53",
"snapshot_id": "752310382000db08fbd2cc211282c1021ac85ce0",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/cis255/cis255_2015_fall/53303896a7a88dfedd48c059996fc3270c108b53/aalsamin/aalsamin_prog01.html",
"visit_date": "2021-01-14T08:51:05.723312"
} | stackv2 | Web Search Engine
Google, Baidu, and Yahoo are the most used web search engine today.
Google, Baidu, and Yahoo are the most used web search engine today.
This is the content of this section that describes program objectives
This is the content of this section that describes exercise objectives
Here is a happy dog.
Display a gauge:
Note: The meter tag is not supported in Internet Explorer or Safari 5 (and earlier versions).
Note: The progress tag is not supported in Internet Explorer 9 and earlier versions.
The dog is happy
Do not forget to buy milk today. |
2024-11-18T17:59:32.991251+00:00 | 2019-12-05T11:11:34 | 31d719d2bb970eb0589115110dc012c0ec7b0d59 | {
"blob_id": "31d719d2bb970eb0589115110dc012c0ec7b0d59",
"branch_name": "refs/heads/master",
"committer_date": "2019-12-05T11:11:34",
"content_id": "aebd950a7316aa50838548e21553f5d7284f9f74",
"detected_licenses": [
"MIT"
],
"directory_id": "3d420b467c153f6d6d0d07b89ee14972ca8fcb94",
"extension": "html",
"filename": "PR-Talmai.html",
"fork_events_count": 0,
"gha_created_at": "2018-04-10T13:27:52",
"gha_event_created_at": "2020-04-30T01:25:39",
"gha_language": "HTML",
"gha_license_id": "MIT",
"github_id": 128937092,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 1317,
"license": "MIT",
"license_type": "permissive",
"path": "/app/content/texts/comm_eng_EBD_dict/PR-Talmai.html",
"provenance": "stackv2_html-0000.json.gz:79",
"repo_name": "binu-alexander/thevachanonlineproject",
"revision_date": "2019-12-05T11:11:34",
"revision_id": "33c318bfc8b37de035d9c8e6b2a9bf8dea153b98",
"snapshot_id": "f5c6cf813e26830b808857a97c12f027b027577b",
"src_encoding": "UTF-8",
"star_events_count": 5,
"url": "https://raw.githubusercontent.com/binu-alexander/thevachanonlineproject/33c318bfc8b37de035d9c8e6b2a9bf8dea153b98/app/content/texts/comm_eng_EBD_dict/PR-Talmai.html",
"visit_date": "2022-05-29T02:59:52.390286"
} | stackv2 | "TALMAI "abounding in furrows. (1.) One of the Anakim of Hebron, who were slain by the men of Judah under Caleb (Numbers 13:22; Joshua 15:14; Judges 1:10). (2.) His daughter, Maachah, was one of David’s wives, and the mother of Absalom (1 Chronicles 3:2).
"TALMAI "abounding in furrows. (1.) One of the Anakim of Hebron, who were slain by the men of Judah under Caleb (Numbers 13:22; Joshua 15:14; Judges 1:10).
(2.) His daughter, Maachah, was one of David’s wives, and the mother of Absalom (1 Chronicles 3:2). |
2024-11-18T17:59:32.994335+00:00 | 2022-10-29T13:28:43 | 6b63e241261e7c061a31fdec74edee721a1fa050 | {
"blob_id": "6b63e241261e7c061a31fdec74edee721a1fa050",
"branch_name": "refs/heads/asf-site",
"committer_date": "2022-10-29T13:28:43",
"content_id": "a47fae796c3db92a35fb74e2ce3cc10318ab412d",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "0ba206afc82077ad57767621fe33ff002c058755",
"extension": "html",
"filename": "index.html",
"fork_events_count": 73,
"gha_created_at": "2017-12-05T08:00:11",
"gha_event_created_at": "2022-10-29T13:28:44",
"gha_language": "HTML",
"gha_license_id": null,
"github_id": 113151343,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 31642,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/content/docs/users/use-tls/index.html",
"provenance": "stackv2_html-0000.json.gz:80",
"repo_name": "apache/servicecomb-website",
"revision_date": "2022-10-29T13:28:43",
"revision_id": "1222c4d5bba2e0b095aea09e6659fcc0da20d5e3",
"snapshot_id": "da0607924dfae661d104bc45cea5c0811cc60418",
"src_encoding": "UTF-8",
"star_events_count": 578,
"url": "https://raw.githubusercontent.com/apache/servicecomb-website/1222c4d5bba2e0b095aea09e6659fcc0da20d5e3/content/docs/users/use-tls/index.html",
"visit_date": "2023-08-29T01:58:49.320617"
} | stackv2 | Using TLS for Communication
Scenario
Users can use simple configurations to enable TLS communication to ensure data transmission security.
External Service Communication Configuration
The configuration related to external service communication is set in the microservice.yaml file.
-
TLS communication configuration of the service center and configuration center The connection between the microservice and the service and configuration centers can be changed from HTTP to HTTPS, enabling TLS communication. The configuration example is as below:
servicecomb: service: registry: address: https://<IP_ADDRESS>:30100
-
TLS communication enabled by the service provider When configuring the service listening address, the service provider can add
?sslEnabled=true
to the end of the address to enable TLS communication. For example:servicecomb: rest: address: <IP_ADDRESS>:8080?sslEnabled=true highway: address: <IP_ADDRESS>:7070?sslEnabled=true
Configure a Certificate
The certificate configuration items are set in the microservice.yaml file. You can customize certificates in a unified manner or add tags for configuration in a small granularity. The tag configuration overwrites the global configuration, and the configuration format is as follows:
ssl.[tag].[property]
For details about the certificate configuration items, see Table 1.
Table 1 Certificate configuration items
| Configuration Item | Default Value | Value Range | Mandatory | Description | Remarks |
|---|---|---|---|---|---|
| ssl.protocols | TLSv1.2 | - | No | Specifies the protocol list. | Use commas (,) to separate protocols. |
| ssl.ciphers | TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, TLS_RSA_WITH_AES_256_GCM_SHA384, TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, TLS_RSA_WITH_AES_128_GCM_SHA256 |
- | No | Specifies the algorithm list | Use commas (,) to separate protocols. |
| ssl.authPeer | true | - | No | Specifies whether auhentication is required for the peer end. | - |
| ssl.checkCN.host | true | - | No | Whether the CN of the certificate is checked | This configuration item is available and valid only for consumers using the HTTP protocol (the rest channel). This parameter is invalid for providers and highway channels. The purpose of checking CN is to protect the server from phishing attacks. For details, see the following standard:https://tools.ietf.org/html/rfc2818。 |
| ssl.trustStore | trust.jks | - | No | Specifies the trust certificate file. | - |
| ssl.trustStoreType | JKS | - | No | Specifies the type of trust certificate | - |
| ssl.trustStoreValue | - | - | No | Specifies the password of the trust certificate file. | - |
| ssl.keyStore | server.p12 | - | No | Specifies the identity certificate file. | - |
| ssl.keyStoreType | PKCS12 | - | No | Specifies the type of identity certificate. | - |
| ssl.keyStoreValue | - | - | No | Specifies the password of identity certificate. | - |
| ssl.crl | revoke.crl | - | No | Specifies the certificate revocation list(CRL) file. | - |
| ssl.sslCustomClass | - | org.apache.servicecomb.foundation.ssl.SSLCustom implementation | No | Specifies implementation of the SSLCustom class, which is used by developers to convert passwords and file paths. | - |
NOTE:
- The default protocol algorithm is high-strength algorithm. The JDK needs to be installed together withe the corresponding policy file. For details, visit http://www.oracle.com/technetwork/java/javase/downloads/jce8-download-2133166.html. You can configure a non-high-strength algorithm in the configuration file.
- The microservice consumers can specify certificates for different providers. (The current certificate is issued by HOST. Different providers use a certificate storage medium, which is used by the service center and configuration center).
Certificate Configuration in the Service Center
Currently, the TLS authentication mode of the service center can be configured using environment variables. By default, TLS communication and bidirectional authentication are enables. During peer end authentication, whether the peer end matches the CommonName field of the certificate is checked. For details about the certificate configuration items in the service center, see table 2.
Table 2 Configuration file of the service center
| Configuration Item | Default Value | Value Range | Mandatory | Description | Remarks |
|---|---|---|---|---|---|
| CSE_SSL_MODE | 1 | 1/0 0:HTTPS 1:HTTP |
No | Set the protocol mode. | - |
| CSE_SSL_VERIFY_CLIENT | 1 | 1/0 0:HTTPS 1:HTTP |
No | Set whether the peer end is authenticated in HTTPS mode | - |
| CSE_SSL_PASSPHASE | - | - | No | Set the password for the certificate key in HTTPS mode | - |
The configuration file of the service center is$APP_ROOT/conf/app.conf. For details about the configuration item, see table 3. This configuration does not support the settings of environment variables.
Table 3 Configuration file of the service center
| Configuration Items | Default Value | Value Range | Mandatory | Description | Remarks |
|---|---|---|---|---|---|
| ssl_protocols | TLSv1.2 | - | No | Specifies the SSL version used for communication. | - |
| ssl_ciphers | TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384, TLS_RSA_WITH_AES_256_GCM_SHA384, TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256, TLS_RSA_WITH_AES_128_GCM_SHA256, TLS_RSA_WITH_AES_128_CBC_SHA |
- | No | Specifies the algorithms list used to configuration | ssl_cipher must be configured with the TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256 algorithm, because th eservice center supports the HTTP/2 protocal. TLS_RSA_WITH_AES_128_GCM_SHA256、TLS_RSA_WITH_AES_128_CBC_SHA are listd in the insecure algorithm blacklist of the HTTP/2 protocol, but they need to be configured to the last bit of ssl_ciphers to ensure compatibility of the client algorithm. |
Path for Storing Key Materials and Certificates
Table 4 Path for storing key materials and certificate
| Configuration Items | Description | Environment Variable | Remarks |
|---|---|---|---|
| / | - | - | - |
| /opt | - | - | - |
| /opt/CSE | - | INSTALL_ROOT | - |
| /opt/CSE/etc | - | - | - |
| /opt/CSE/etc/cipher | Specifies the directory for storing key materials | CIPHER_ROOT | - |
| /opt/CSE/etc/ssl | Specifies the directory for storing certificates. | SSL_ROOT | - |
| /opt/CSE/etc/ssl/trust.cer | Specifies the trusted CA. | - | - |
| /opt/CSE/etc/ssl/server_key.pem | Specifies the private key file on the encrypted server. | - | - |
| /opt/CSE/etc/ssl/server.cer | Specifies the server certificate. | - | - |
| /opt/CSE/etc/ssl/cert_pwd | Specifies the symmetric ciphertext file used to store the decrypted private key. | - | - |
| /opt/CSE/apps | - | - | - |
| /opt/CSE/apps/ServiceCenter | - | APP_ROOT | - |
| /opt/CSE/apps/ServiceCenter/conf | Specifies the configuration file directory of the service center. | - | - |
| /opt/CSE/apps/ServiceCenter/conf/app.conf | Specifies the application configuration file. | - | - |
Sample Code
The configuration example of enabling the TLS communication in the microservicce.yaml file is as follows:
servicecomb:
service:
registry:
address: https://<IP_ADDRESS>:30100
rest:
address: <IP_ADDRESS>:8080?sslEnabled=true
highway:
address: <IP_ADDRESS>:7070?sslEnabled=true
#########SSL options
ssl.protocols: TLSv1.2
ssl.authPeer: true
ssl.checkCN.host: true
#########certificates config
ssl.trustStore: trust.jks
ssl.trustStoreType: JKS
ssl.trustStoreValue: Changeme_123
ssl.keyStore: server.p12
ssl.keyStoreType: PKCS12
ssl.keyStoreValue: Changeme_123
ssl.crl: revoke.crl
ssl.sslCustomClass: org.apache.servicecomb.demo.DemoSSLCustom |
2024-11-18T17:59:33.001108+00:00 | 2021-03-28T20:41:11 | 03ecb90c3f014380a0276891728bcc9798709006 | {
"blob_id": "03ecb90c3f014380a0276891728bcc9798709006",
"branch_name": "refs/heads/main",
"committer_date": "2021-03-28T20:41:11",
"content_id": "d2afea5b70d55fadb5851b72e001571e0b6884ba",
"detected_licenses": [
"MIT"
],
"directory_id": "d0a87c114dfcd8df4a7ff670b1ca18744f381340",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 352405458,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 15926,
"license": "MIT",
"license_type": "permissive",
"path": "/resources/index.html",
"provenance": "stackv2_html-0000.json.gz:81",
"repo_name": "stncrn/u8g2-unifont-helper",
"revision_date": "2021-03-28T20:41:11",
"revision_id": "cf8dba6de6a297d4f794a572c3bd42aa3bebcb79",
"snapshot_id": "93d42d6ad1b4760c13c66dc586a80ad38527dc13",
"src_encoding": "UTF-8",
"star_events_count": 3,
"url": "https://raw.githubusercontent.com/stncrn/u8g2-unifont-helper/cf8dba6de6a297d4f794a572c3bd42aa3bebcb79/resources/index.html",
"visit_date": "2023-03-30T05:05:34.212237"
} | stackv2 | HOWTO and instructions are available on Github.
Download the following files on your computer to generate custom font files: |
2024-11-18T17:59:33.002009+00:00 | 2021-02-16T05:55:10 | 40b842b27bb705d4a1a7c241d64f64179458d94b | {
"blob_id": "40b842b27bb705d4a1a7c241d64f64179458d94b",
"branch_name": "refs/heads/main",
"committer_date": "2021-02-16T05:55:10",
"content_id": "f9df7bfc7b03a0d6214144c2b222e3afe51683b6",
"detected_licenses": [
"MIT"
],
"directory_id": "0f3e01d3ae326b27e056d0a102822d9935ee26cf",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 338940993,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 3458,
"license": "MIT",
"license_type": "permissive",
"path": "/hw3/public/index.html",
"provenance": "stackv2_html-0000.json.gz:82",
"repo_name": "Pichu123/CS341-HW-3-Software-Tools",
"revision_date": "2021-02-16T05:55:10",
"revision_id": "8c7e9412b0bfc31bfa5032789560e66d0109c2f1",
"snapshot_id": "fdccfa985788346e225b58d5a265c7876bb2421f",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/Pichu123/CS341-HW-3-Software-Tools/8c7e9412b0bfc31bfa5032789560e66d0109c2f1/hw3/public/index.html",
"visit_date": "2023-03-06T02:40:18.019460"
} | stackv2 | Cheesecake Order Form
Quantity Topping
0
1
2
3
4
Plain
Cherry
Chocolate
Notes:
Order
Orders for
Month
Jan
Feb
Mar
Apr
May
Jun
Jul
Aug
Sep
Nov
Dec
11 cherry
17 chocolate
31 plain |
2024-11-18T17:59:33.003580+00:00 | 2018-05-16T01:19:32 | e5dd172fedb1b22c7dc07ec262d43c6dd8a0f5d7 | {
"blob_id": "e5dd172fedb1b22c7dc07ec262d43c6dd8a0f5d7",
"branch_name": "refs/heads/master",
"committer_date": "2018-05-16T01:19:32",
"content_id": "b1140413f4cdff8cebbf763249db2b71d78e9af7",
"detected_licenses": [
"MIT"
],
"directory_id": "b4ba5ceaecb18cae5bcac57125955480628f4655",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 133574463,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 1964,
"license": "MIT",
"license_type": "permissive",
"path": "/index.html",
"provenance": "stackv2_html-0000.json.gz:83",
"repo_name": "JoseCabrera1070/Resume",
"revision_date": "2018-05-16T01:19:32",
"revision_id": "c6a7ef57bf543a2fa0e765c80bd506f031b9bb22",
"snapshot_id": "ca56ec51a4a9fe042814f3e267b4f64073168a02",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/JoseCabrera1070/Resume/c6a7ef57bf543a2fa0e765c80bd506f031b9bb22/index.html",
"visit_date": "2020-03-17T12:06:06.283780"
} | stackv2 | About Me: I am from Santa Ana, CA. I am the first from my family to go to college. Currently Attending Santa Ana College. I am currently taking various classes in business and computer science to one day run an I.T business or make a corporation manufacturing PCs and PC components.
Experience: Entry-Level positions. Not a big skill set. Willing to learn and gain more skills.
Education: Santa Ana College August 2015 - Present
Technical Skills:
Projects: Made first website using Microsoft Visual Studio. Made this online resume. Built my own custom PC. |
2024-11-18T17:59:33.011396+00:00 | 2014-12-22T18:44:20 | bab4b25bd12895708a81aa8271232f7e77c29576 | {
"blob_id": "bab4b25bd12895708a81aa8271232f7e77c29576",
"branch_name": "refs/heads/master",
"committer_date": "2014-12-22T18:44:20",
"content_id": "38628ca6ea6610886e549a25d6ac0080de97d67c",
"detected_licenses": [
"MIT"
],
"directory_id": "48194f3e16b9633de009689c1df40d7d18249cd9",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": null,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 11453,
"license": "MIT",
"license_type": "permissive",
"path": "/fcp/2014/10/09/Final Cut Pro X organization/index.html",
"provenance": "stackv2_html-0000.json.gz:84",
"repo_name": "blackoctopus/blackoctopus.github.io",
"revision_date": "2014-12-22T18:44:20",
"revision_id": "f07373caf1f9ed524c10d509cec9757d6b092095",
"snapshot_id": "7e85816bed179c013e766b9d7e31dca4e4fd35cf",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/blackoctopus/blackoctopus.github.io/f07373caf1f9ed524c10d509cec9757d6b092095/fcp/2014/10/09/Final Cut Pro X organization/index.html",
"visit_date": "2016-08-03T21:19:29.247713"
} | stackv2 | The Final Cut Pro X Editor • FCP X Quick Tip: Organize at High Speed
FCP X Quick Tip: Organize at High Speed
By Braden Storrs
As an editor I’d rather be editing then doing all the preparation work that leads to it. I’d say most of us don’t have an assistant editor to do all the tedious work so if there’s any way to speed up the process then bring it on! This tip will especial help those working on any kind of larger project such as a documentary or film.
This technique is similar to one I used in earlier versions of FCP X with Keyword collections but it much smarter to use with Smart Collections (go figure). MacBreak Studio did a video on this last year called Smarter Smart Collections, but it was before the FCP X Library model so I thought I’d put this together with the current workflow.
Smart Collections let you organize your media, based on sets of rules, into any number of collections you would like to create. If you are creating these collections new for every project you do then you are wasting a lot of time you could be saving.
Here’s what to do:
Create a new Library and save it somewhere on your Mac’s hard drive so it is always accessible, or wherever you deem appropriate. I call mine Library Template:
Then I rename the default Event to Event Template:
I then create two folders for use in the project. A Smart Collections Folder and a Keyword Collections Folder. This isn’t required, it just keeps things tidy:
At this point start creating your Smart Collections and place them in the Smart Collections folder. You can right click on the Event and select “New Smart Collection” or use the keyboard shortcut Option+Command+N:
Rename the Smart Collection to what it will represent (i.e. multicam clips, dialogue, music, compound clips, notes, unused video, etc.). Here’s the collections I’ve created that include most of the collections I might want while editing. Your list will probably be different. Just suit it to your needs:
At this point double click on each of the Smart Collections and give them the appropriate set of rules to match the category. Don’t forget to do this. The collections won’t figure this out on their own. For Example, here is the rule set for the Dialogue collection:
In regards to Keyword Collections, they are harder to predetermine. They are extremely useful but are more project specific. So generally they are added after the media is imported. They are useful for separating out takes from certain actors, scenes, script pages, etc, for example. If there are certain Keyword Collections you know you’ll need on every project, outside of the Smart Collections, create them now. Then when the media is imported, apply the Keywords to the appropriate media. Here are two videos that show how useful Keywords can be. Lightiron: Live Play 3 and FCP X at the Studio Level
You can even use Keywords to create a specific Smart Collection based on certain Keywords:
So in any case, just customize it to your needs. There’s enough tools in there to fine tune your collections to an almost ridiculous level. It may take a little bit of time to set this up, but once you do you never have to do it again.
When you have a new project go ahead and load the Template Library. Then create and save the new Library for your project. It will have a blank Event in it that you can delete later if you don’t want it. Then just grab your Event Template and drag it to the new library and drop it on it. Follow the prompt and there you go, all of your organization is now applied to the new Library and as you import media the files will all be automatically sorted to the proper collections. Pretty awesome. At this point rename the Event Template in the new Library to whatever is appropriate.
You can also drag the Keyword or Smart Collections between events:
At this point you can close your Library Template and get to work.
It just took you 30 seconds to organize hundreds or even thousands of files when it could have taken you hours to do it manually. Got to love that.
Enjoy!
- This article was written with FCP X being at version 10.1.3.
** The article’s title piece was created with mObject from Motion VFX in Motion 5.1. |
2024-11-18T17:59:33.022337+00:00 | 2022-11-10T19:48:19 | 174f00188c19a2acecb4cf105ebdddc554e822a3 | {
"blob_id": "174f00188c19a2acecb4cf105ebdddc554e822a3",
"branch_name": "refs/heads/master",
"committer_date": "2022-11-10T19:48:19",
"content_id": "989d74ecbc0cbcc8422b14409ea729c05c5371fd",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "3530bca5f8cfbdddd6ef821b0a4122660843385e",
"extension": "html",
"filename": "classgrppi_1_1parallel__execution__native.html",
"fork_events_count": 23,
"gha_created_at": "2017-02-16T11:13:19",
"gha_event_created_at": "2022-11-16T10:33:25",
"gha_language": "C++",
"gha_license_id": "Apache-2.0",
"github_id": 82172511,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 58538,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/docs/0.3.1/classgrppi_1_1parallel__execution__native.html",
"provenance": "stackv2_html-0000.json.gz:85",
"repo_name": "arcosuc3m/grppi",
"revision_date": "2022-11-10T19:48:19",
"revision_id": "2bb6c1668c86a5e5af49fc9ec575bd29554a8907",
"snapshot_id": "850b412f5bd1edbd4c3afbf13f74da6c04bb0981",
"src_encoding": "UTF-8",
"star_events_count": 88,
"url": "https://raw.githubusercontent.com/arcosuc3m/grppi/2bb6c1668c86a5e5af49fc9ec575bd29554a8907/docs/0.3.1/classgrppi_1_1parallel__execution__native.html",
"visit_date": "2022-11-23T23:36:41.459324"
} | stackv2 | |
GrPPI
0.3.1
Generic and Reusable Parallel Pattern Interface
|
Native parallel execution policy. This policy uses ISO C++ threads as implementation building block allowing usage in any ISO C++ compliant platform. More...
#include <parallel_execution_native.h>
Public Member Functions | |
| parallel_execution_native () noexcept | |
| Default construct a native parallel execution policy. More... | |
| parallel_execution_native (int concurrency_degree, bool ordering=true) noexcept | |
| Constructs a native parallel execution policy. More... | |
| parallel_execution_native (const parallel_execution_native &ex) | |
| void | set_concurrency_degree (int degree) noexcept |
| Set number of grppi threads. More... | |
| int | concurrency_degree () const noexcept |
| Get number of grppi trheads. More... | |
| void | enable_ordering () noexcept |
| Enable ordering. More... | |
| void | disable_ordering () noexcept |
| Disable ordering. More... | |
| bool | is_ordered () const noexcept |
| Is execution ordered. More... | |
| native_thread_manager | thread_manager () const |
| Get a manager object for registration/deregistration in the thread index table for current thread. More... | |
| int | get_thread_id () const noexcept |
| Get index of current thread in the thread table. More... | |
| void | set_queue_attributes (int size, queue_mode mode) noexcept |
| Sets the attributes for the queues built through make_queue<T>() More... | |
| template<typename T > | |
| mpmc_queue< T > | make_queue () const |
| Makes a communication queue for elements of type T. Constructs a queue using the attributes that can be set via set_queue_attributes(). The value is returned via move semantics. More... | |
| template<typename T , typename... Transformers> | |
| mpmc_queue< T > & | get_output_queue (mpmc_queue< T > &queue, Transformers &&...) const |
| Returns the reference of a communication queue for elements of type T if the queue has been created in an outer pattern. Returns the reference of the queue received as argument. More... | |
| template<typename T , typename... Transformers> | |
| mpmc_queue< T > | get_output_queue (Transformers &&...) const |
| Makes a communication queue for elements of type T if the queue has not been created in an outer pattern. Call to the make_queue function and the value is returned via move semantics. More... | |
| template<typename... InputIterators, typename OutputIterator , typename Transformer > | |
| void | map (std::tuple< InputIterators... > firsts, OutputIterator first_out, std::size_t sequence_size, Transformer transform_op) const |
| Applies a trasnformation to multiple sequences leaving the result in another sequence by chunks according to concurrency degree. More... | |
| template<typename InputIterator , typename Identity , typename Combiner > | |
| auto | reduce (InputIterator first, std::size_t sequence_size, Identity &&identity, Combiner &&combine_op) const |
| Applies a reduction to a sequence of data items. More... | |
| template<typename... InputIterators, typename Identity , typename Transformer , typename Combiner > | |
| auto | map_reduce (std::tuple< InputIterators... > firsts, std::size_t sequence_size, Identity &&identity, Transformer &&transform_op, Combiner &&combine_op) const |
| Applies a map/reduce operation to a sequence of data items. More... | |
| template<typename... InputIterators, typename OutputIterator , typename StencilTransformer , typename Neighbourhood > | |
| void | stencil (std::tuple< InputIterators... > firsts, OutputIterator first_out, std::size_t sequence_size, StencilTransformer &&transform_op, Neighbourhood &&neighbour_op) const |
| Applies a stencil to multiple sequences leaving the result in another sequence. More... | |
| template<typename Input , typename Divider , typename Solver , typename Combiner > | |
| auto | divide_conquer (Input &&input, Divider &÷_op, Solver &&solve_op, Combiner &&combine_op) const |
| Invoke Divide/conquer pattern. More... | |
| template<typename Input , typename Divider , typename Predicate , typename Solver , typename Combiner > | |
| auto | divide_conquer (Input &&input, Divider &÷_op, Predicate &&predicate_op, Solver &&solve_op, Combiner &&combine_op) const |
| Invoke Divide/conquer pattern. More... | |
| template<typename Generator , typename... Transformers> | |
| void | pipeline (Generator &&generate_op, Transformers &&...transform_ops) const |
| Invoke Pipeline pattern. More... | |
| template<typename InputType , typename Transformer , typename OutputType > | |
| void | pipeline (mpmc_queue< InputType > &input_queue, Transformer &&transform_op, mpmc_queue< OutputType > &output_queue) const |
| Invoke Pipeline pattern comming from another context that uses mpmc_queues as communication channels. More... | |
Native parallel execution policy. This policy uses ISO C++ threads as implementation building block allowing usage in any ISO C++ compliant platform.
|
inlinenoexcept |
Default construct a native parallel execution policy.
Creates a parallel execution native object.
The concurrency degree is determined by the platform.
|
inlinenoexcept |
Constructs a native parallel execution policy.
Creates a parallel execution native object selecting the concurrency degree and ordering mode.
| concurrency_degree | Number of threads used for parallel algorithms. |
| order | Whether ordered executions is enabled or disabled. |
|
inline |
|
inlinenoexcept |
Get number of grppi trheads.
|
inlinenoexcept |
Disable ordering.
| auto grppi::parallel_execution_native::divide_conquer | ( | Input && | input, |
| Divider && | divide_op, | ||
| Solver && | solve_op, | ||
| Combiner && | combine_op | ||
| ) | const |
Invoke Divide/conquer pattern.
| Input | Type used for the input problem. |
| Divider | Callable type for the divider operation. |
| Solver | Callable type for the solver operation. |
| Combiner | Callable type for the combiner operation. |
| ex | Sequential execution policy object. |
| input | Input problem to be solved. |
| divider_op | Divider operation. |
| solver_op | Solver operation. |
| combine_op | Combiner operation. |
| auto grppi::parallel_execution_native::divide_conquer | ( | Input && | input, |
| Divider && | divide_op, | ||
| Predicate && | predicate_op, | ||
| Solver && | solve_op, | ||
| Combiner && | combine_op | ||
| ) | const |
Invoke Divide/conquer pattern.
| Input | Type used for the input problem. |
| Divider | Callable type for the divider operation. |
| Predicate | Callable type for the stop condition predicate. |
| Solver | Callable type for the solver operation. |
| Combiner | Callable type for the combiner operation. |
| ex | Sequential execution policy object. |
| input | Input problem to be solved. |
| divider_op | Divider operation. |
| predicate_op | Predicate operation. |
| solver_op | Solver operation. |
| combine_op | Combiner operation. |
|
inlinenoexcept |
Enable ordering.
|
inline |
Returns the reference of a communication queue for elements of type T if the queue has been created in an outer pattern. Returns the reference of the queue received as argument.
| T | Element type for the queue. |
| Transformers | List of the next transformers. |
| queue | Reference of a queue of type T |
|
inline |
Makes a communication queue for elements of type T if the queue has not been created in an outer pattern. Call to the make_queue function and the value is returned via move semantics.
| T | Element type for the queue. |
| Transformers | List of the next transformers. |
|
inlinenoexcept |
Get index of current thread in the thread table.
|
inlinenoexcept |
Is execution ordered.
|
inline |
Makes a communication queue for elements of type T. Constructs a queue using the attributes that can be set via set_queue_attributes(). The value is returned via move semantics.
| T | Element type for the queue. |
| void grppi::parallel_execution_native::map | ( | std::tuple< InputIterators... > | firsts, |
| OutputIterator | first_out, | ||
| std::size_t | sequence_size, | ||
| Transformer | transform_op | ||
| ) | const |
Applies a trasnformation to multiple sequences leaving the result in another sequence by chunks according to concurrency degree.
| InputIterators | Iterator types for input sequences. |
| OutputIterator | Iterator type for the output sequence. |
| Transformer | Callable object type for the transformation. |
| firsts | Tuple of iterators to input sequences. |
| first_out | Iterator to the output sequence. |
| sequence_size | Size of the input sequences. |
| transform_op | Transformation callable object. |
[get<I>(firsts), next(get<I>(firsts),sequence_size))
are valid. [first_out, next(first_out,sequence_size)]
are valid. | auto grppi::parallel_execution_native::map_reduce | ( | std::tuple< InputIterators... > | firsts, |
| std::size_t | sequence_size, | ||
| Identity && | identity, | ||
| Transformer && | transform_op, | ||
| Combiner && | combine_op | ||
| ) | const |
Applies a map/reduce operation to a sequence of data items.
| InputIterator | Iterator type for the input sequence. |
| Identity | Type for the identity value. |
| Transformer | Callable object type for the transformation. |
| Combiner | Callable object type for the combination. |
| first | Iterator to the first element of the sequence. |
| sequence_size | Size of the input sequence. |
| identity | Identity value for the reduction. |
| transform_op | Transformation callable object. |
| combine_op | Combination callable object. |
[first,last)
are valid. | void grppi::parallel_execution_native::pipeline | ( | Generator && | generate_op, |
| Transformers &&... | transform_ops | ||
| ) | const |
Invoke Pipeline pattern.
| Generator | Callable type for the generator operation. |
| Transformers | Callable types for the transformers in the pipeline. |
| generate_op | Generator operation. |
| transform_ops | Transformer operations. |
|
inline |
Invoke Pipeline pattern comming from another context that uses mpmc_queues as communication channels.
| InputType | Type of the input stream. |
| Transformers | Callable types for the transformers in the pipeline. |
| InputType | Type of the output stream. |
| input_queue | Input stream communicator. |
| transform_ops | Transformer operations. |
| output_queue | Input stream communicator. |
| auto grppi::parallel_execution_native::reduce | ( | InputIterator | first, |
| std::size_t | sequence_size, | ||
| Identity && | identity, | ||
| Combiner && | combine_op | ||
| ) | const |
Applies a reduction to a sequence of data items.
| InputIterator | Iterator type for the input sequence. |
| Identity | Type for the identity value. |
| Combiner | Callable object type for the combination. |
| first | Iterator to the first element of the sequence. |
| sequence_size | Size of the input sequence. |
| identity | Identity value for the reduction. |
| combine_op | Combination callable object. |
[first,last)
are valid.
|
inlinenoexcept |
Set number of grppi threads.
|
inlinenoexcept |
Sets the attributes for the queues built through make_queue<T>()
| void grppi::parallel_execution_native::stencil | ( | std::tuple< InputIterators... > | firsts, |
| OutputIterator | first_out, | ||
| std::size_t | sequence_size, | ||
| StencilTransformer && | transform_op, | ||
| Neighbourhood && | neighbour_op | ||
| ) | const |
Applies a stencil to multiple sequences leaving the result in another sequence.
| InputIterators | Iterator types for input sequences. |
| OutputIterator | Iterator type for the output sequence. |
| StencilTransformer | Callable object type for the stencil transformation. |
| Neighbourhood | Callable object for generating neighbourhoods. |
| firsts | Tuple of iterators to input sequences. |
| first_out | Iterator to the output sequence. |
| sequence_size | Size of the input sequences. |
| transform_op | Stencil transformation callable object. |
| neighbour_op | Neighbourhood callable object. |
[get<I>(firsts), next(get<I>(firsts),sequence_size))
are valid. [first_out, next(first_out,sequence_size)]
are valid.
|
inline |
Get a manager object for registration/deregistration in the thread index table for current thread. |
2024-11-18T17:59:33.024761+00:00 | 2018-09-08T10:06:36 | 88cc3d14872acffd4a0f37a03544c21119bed6cf | {
"blob_id": "88cc3d14872acffd4a0f37a03544c21119bed6cf",
"branch_name": "refs/heads/master",
"committer_date": "2018-09-08T10:06:36",
"content_id": "16d6ca2a726fa9d1c0b4d186def4af7e5b45ea17",
"detected_licenses": [
"MIT"
],
"directory_id": "01a8ff7bee7290da30432e7c7e6f8077b77fc5c0",
"extension": "html",
"filename": "port-folio.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 147804449,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 1944,
"license": "MIT",
"license_type": "permissive",
"path": "/port-folio.html",
"provenance": "stackv2_html-0000.json.gz:86",
"repo_name": "silver230/port-folio",
"revision_date": "2018-09-08T10:06:36",
"revision_id": "51d736bd5af217bb90fe3b4103b6e4ef7a3faa8b",
"snapshot_id": "064710212c0eff4bfcb88ca1f682e546e2e3835e",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/silver230/port-folio/51d736bd5af217bb90fe3b4103b6e4ef7a3faa8b/port-folio.html",
"visit_date": "2020-03-28T05:56:15.124539"
} | stackv2 | Currently in moringa studying coding cause its one of my passion in solving problems in my community and beyond
Here are some of my assignments:
I am an energetic, ambitious person who has developed a mature and responsible approach to any task I undertake, or situation that I am presented with. As a graduate with worth of experience and leadership skills,I am excellent in working with others to achieve a certain objective on time and with excellence.
Competencies highlights:-
My Hobbies/Skills/Intrest |
2024-11-18T17:59:33.026057+00:00 | 2020-09-12T05:52:17 | 3175e458a58f7d79cfbea1bb34deb8b9bde7eecc | {
"blob_id": "3175e458a58f7d79cfbea1bb34deb8b9bde7eecc",
"branch_name": "refs/heads/master",
"committer_date": "2020-09-12T05:52:17",
"content_id": "aef2fdb33b6f0ad35da63bc287e8adcc22a66ec3",
"detected_licenses": [
"MIT"
],
"directory_id": "18593621e07685b57894465d076257288b485cf8",
"extension": "html",
"filename": "signin.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 294875943,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 2846,
"license": "MIT",
"license_type": "permissive",
"path": "/public/signin.html",
"provenance": "stackv2_html-0000.json.gz:87",
"repo_name": "yamgarcia/ajax-jest-app",
"revision_date": "2020-09-12T05:52:17",
"revision_id": "d38880492257949e7577a3ecfff191112f320edb",
"snapshot_id": "20b941e8d8e420ac422dfc24148b3376e41ac8bf",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/yamgarcia/ajax-jest-app/d38880492257949e7577a3ecfff191112f320edb/public/signin.html",
"visit_date": "2022-12-14T16:32:15.533786"
} | stackv2 | Let's create an account for you
Start your order
Order listing
Login name
Password
Login
Create an Account |
2024-11-18T17:59:33.026125+00:00 | 2020-08-10T15:05:47 | d61a38a27aeb30bae1050ab71dee2b648813e5da | {
"blob_id": "d61a38a27aeb30bae1050ab71dee2b648813e5da",
"branch_name": "refs/heads/master",
"committer_date": "2020-08-10T15:05:47",
"content_id": "709ee612604c21cc6465745efccffd1e8ae1a0ec",
"detected_licenses": [
"MIT"
],
"directory_id": "d77405d062ece6736af0ea840d1a00e46d5fed2a",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": null,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 47167,
"license": "MIT",
"license_type": "permissive",
"path": "/2019/04/30/index.html",
"provenance": "stackv2_html-0000.json.gz:88",
"repo_name": "xuan2261/linksfordevs",
"revision_date": "2020-08-10T15:05:47",
"revision_id": "86f31551f4e0d427f6d20f6607ccc677a07ef8ab",
"snapshot_id": "db017b1116ab1b80f14da562af1ce978b24ca6f2",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/xuan2261/linksfordevs/86f31551f4e0d427f6d20f6607ccc677a07ef8ab/2019/04/30/index.html",
"visit_date": "2022-11-28T05:31:55.472543"
} | stackv2 | Calling Windows 10 APIs From a Desktop Application just got easier - Windows Developer Blog Today, we are pleased to announce we posted on nuget.org a preview of the Windows 10 WinRT API Pack. By using these NuGet packages, you can quickly and easily add new Windows functionality to your …
Cats Effect: STM & TRef #791 by VladKopanev · Pull Request #796 · zio/zio Cats Effect: STM & TRef #791
Go modules services The Go team is providing the following services run by Google: a module mirror for accelerating Go module downloads, an index for discovering new modules, and a global go.sum database for authenticating module content.
Native hosting proposal by vitek-karas · Pull Request #5336 · dotnet/core-setup Design describing current level of support for hosting managed code from native applications and proposal for improvements in this area.
Using Entity Framework Core to process Azure Service Messages in ASP.NET Core This article shows how to use Entity Framework Core together with an Azure Service Bus receiver in ASP.NET Core. This message handler is a singleton and so requires that an Entity Framework Core co…
The Hundred-Tonne Robots That Help Keep New Zealand Running The Ports of Auckland are automating their straddle carriers, which might not seem like much: until you phrase it as
Babylon.js 4.0 Is Here! We cannot be more excited to share that Babylon.js 4.0 has officially been released. This version of Babylon.js is a major step forward in…
Home | magniX magniX is bringing to market an advanced all-electric propulsion system for commercial aviation & defense. magniX is revolutionizing the way the world flies by transforming the way aircraft are powered.
.NET Design Review: GitHub Quick Reviews 00:00:00 - Approved: Implement global proxy configuration for HttpClient https://github.com/dotnet/corefx/issues/36553 00:34:19 - Approved: HttpClient.DefaultRequestVersion https://github.com/dotnet/corefx/issues/37224 00:47:46 - Approved: add Netlink, ...
Write a custom .NET Core runtime host - .NET Core Learn to host the .NET Core runtime from native code to support advanced scenarios that require controlling how the .NET Core runtime works.
EdCharbeneau/TaxiFareBlazorServer ML.NET TaxiFare Prediction Model with Blazor Server-Side front end. - EdCharbeneau/TaxiFareBlazorServer
Validating phone numbers with Twilio using ASP.NET Core Identity and Razor Pages In this post I show how to add phone number validation with Twilio's Lookup API to a Razor Pages app that uses ASP.NET Core Identity for user management
jamesmontemagno/AllExtensions-DI-IoC Contribute to jamesmontemagno/AllExtensions-DI-IoC development by creating an account on GitHub.
Computer Based Test (CBT) development and delivery :: Pearson VUE Pearson VUE offers innovative computer based testing solutions through secure, electronic test delivery. Pearson VUE provides licensure and certification exams for Microsoft, Cisco, CompTIA, Oracle, HP, GMAC, NCLEX, FINRA, ASCP, DANB and many more.
BlazorHelp Website > Blog - Migrating Blazing Pizza (server side Blazor and client side Blazor) Microsoft Visual Studio Blazor
Reverse Engineering InternalCall Methods in .NET Often times, when attempting to reverse engineer a particular .NET method, I will hit a wall because I’ll dig in far enough into the method...
CppCon 2017: Teresa Johnson “ThinLTO: Scalable and Incremental Link-Time Optimization” http://CppCon.org — Presentation Slides, PDFs, Source Code and other presenter materials are available at: https://github.com/CppCon/CppCon2017 — Whole program optimization enables higher performance in C++ applications, because of the expanded scope for ...
Axis-Aligned Bounding Dual Simplex There is now a github for this paper and code that explores the ideas proposed. box min/max reported 39229 intersections in 4.391962 seconds box x/y/z reported 39229 intersections in 3.944595 seconds tetrahedron reported 84364 intersections in 0.373410 se...
https://forums.xilinx.com/t5/Xcell-Daily-Blog-Archived/Cycle-exact-6502-processor-clone-fits-in-0-77-of-a-Spartan-7-and/ba-p/798317 In the 1970s, nearly every low-end microcomputer and video game from the Apple II to the Atari 2600 ran the opcodes of one immensely successful 8-bit microprocessor: MOS Technology’s 6502. Ted Fried at MicroCore Labs has created a cycle-accurate clone of ...
A doorbell company owned by Amazon wants to start producing “crime news” and it’ll definitely end well Because what good is a panopticon if you can't generate some clicks?
microsoft/SymCrypt Cryptographic library. Contribute to microsoft/SymCrypt development by creating an account on GitHub.
dotnet/core-sdk .NET Core SDK Setup. Contribute to dotnet/core-sdk development by creating an account on GitHub.
Implement server-side of NegotiateStream on Unix by Tratcher · Pull Request #36827 · dotnet/corefx #8221 @davidsh I'm starting this draft PR to show you the scope of the changes needed for this feature. I'll follow up with you offline. The current code works end-to-end using a Windows cl...
Add 'split' support for ReadOnlySpan<char> similar to string · Issue #934 · dotnet/runtime Latest Update: New proposal to re-review: Enumerator returns Range instead of ReadOnlySpan<T> partial class MemoryExtensions { public static SpanSplitEnumerator<T> Split<T>(this R...
mpm guide - niall t.l. niall tl's personal site, with an overview of some projects and a few wee articles. |
2024-11-18T17:59:33.028497+00:00 | 2020-02-06T03:11:41 | 31998a0233f2a5d3020efd988122470bb92c8dee | {
"blob_id": "31998a0233f2a5d3020efd988122470bb92c8dee",
"branch_name": "refs/heads/master",
"committer_date": "2020-02-06T03:11:41",
"content_id": "3c68d38f91bce8cbfccdfac14bfc154e5094532f",
"detected_licenses": [
"MIT"
],
"directory_id": "39ea883c195b4985f5b0f12d4edee25b07ad5ab9",
"extension": "html",
"filename": "hidden.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": null,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 413,
"license": "MIT",
"license_type": "permissive",
"path": "/practice/hidden.html",
"provenance": "stackv2_html-0000.json.gz:89",
"repo_name": "LamhotJM/CS-472",
"revision_date": "2020-02-06T03:11:41",
"revision_id": "cad88121f3a2812191457fd9619260084d272a46",
"snapshot_id": "67104ea628c76733b487bf27c00010df09b5b67d",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/LamhotJM/CS-472/cad88121f3a2812191457fd9619260084d272a46/practice/hidden.html",
"visit_date": "2022-04-03T20:50:18.498750"
} | stackv2 | Notice that the hidden input field is not shown to the user, but the data is sent when the form is submitted. |
2024-11-18T17:59:33.031541+00:00 | 2018-01-26T05:09:45 | 2d7b81f7a63ee65be2b255af4e54d32e869ef819 | {
"blob_id": "2d7b81f7a63ee65be2b255af4e54d32e869ef819",
"branch_name": "refs/heads/master",
"committer_date": "2018-01-26T05:09:45",
"content_id": "ed63cc5b77dcc037e4dea1be6ff351dc0f402966",
"detected_licenses": [
"MIT"
],
"directory_id": "c0418bd2154e0c534b49df060d2a6d6baa4032b0",
"extension": "html",
"filename": "freemind.mm.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 82801337,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 62881,
"license": "MIT",
"license_type": "permissive",
"path": "/src/main/webapp/libs/mmtree/freemind.mm.html",
"provenance": "stackv2_html-0000.json.gz:90",
"repo_name": "v4if/rocks",
"revision_date": "2018-01-26T05:09:45",
"revision_id": "d1d8d9c0511b187bb64e56cbc3c1c6dfb8c89425",
"snapshot_id": "a438ad6315b084e3a696181d3629ef6163a7fe21",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/v4if/rocks/d1d8d9c0511b187bb64e56cbc3c1c6dfb8c89425/src/main/webapp/libs/mmtree/freemind.mm.html",
"visit_date": "2021-01-20T15:10:44.366745"
} | stackv2 | FreeMind
1) Install Java. 2) Unpack FreeMind. 3) On Windows, run FreeMind.exe; you'll probably want to create a folder called freemind in "c:\Program Files\" and copy the contents of unpacked directory there. If you want, create shortcut of FreeMind.exe on your desktop.
On Unix, run freemind.sh. On both Windows and Mac OS X, you can also simply double click the file freemind.jar located at the folder lib.
You create mind maps in so called mind map mode. This is the default mode FreeMind is started with. If the word mode troubles you, just forget about it.
Operations on node or edge
Quickly change to different already opened mind map
Selecting multiple nodes
+ - Editing by drag and drop
You can move nodes around using Drag And Drop
Drag and Drop enables you to drop node
as a child
as a sibling.
The distintion between child and sibling is similar to distinction between following links and toggle folded
If you hold control while dragging, nodes are copied instead of moved. You can achieve the same by dragging with middle mouse
Before Version 0.7:
if you hold control and shift while dragging, the color and font of the target node is copied to source node.
If you have selected multiple nodes, all are being moved / copied
You can drop sources from external applications
You can edit a new map by dragging and dropping its file into the background of FreeMind
+ - Copying and pasting
Splitting nodes
Scrolling
Fast switching between maps
+ - Searching
Popup > Node > Find
Popup > Node > Find Next
The search is breadth-first search. That corresponds to the idea, that the deeper the node, the greater the detail described.
+ - Using the keyboard
You can do most of the navigation using keyboard. You can see the keyboard shortcuts in the popup menu of the node. Some of the shortcuts which you do not see that way follow.
PgUp and PgDown
control PgUp and control PgDown
Nice for having a quick glance above and then continue below again
Escape
Arrows
You can select a range of nodes by holding shift and moving around with arrows or page up and down.
You can replace the text in current node and start editing by typing letters. You can also edit node by pressing home or end key, as well as F2.
Technical users can change the keyboard settings in user.properties.
+ - Keyboard while editing a long node
By default, *enter* finishes editing of a long node, and *control enter* enters a new line. By unchecking the check box "Enter confirms" you can reverse the function of the mentioned key combinations, i.e. *enter* enters new line and *control enter* finishes editing. You can set the default value of that check box in user.properties. Moreover the value of the box is saved during a session of FreeMind.
+ - Exporting into HTML
+ - Importing folder structure
To import folder structure into FreeMind, use Popup > Branch > Import folder structure. You will be asked for the folder whose structure you want to import. By structure we mean the tree of all, and not necessary direct, subfolders with the links to the files in these subfolders. An example of inserted structure follows.
Example
+ - Importing MS Internet Explorer favorites
To import MS Explorer favorites into FreeMind, use Popup > Branch > Import Explorer Favorites. You'll be asked to enter the path to the folder where the favorites are stored. The folder's name is "Favorites" and you can find on your disk. On Windows 2000, the path is C:\Documents and Settings\<user>\Favorites.
+ - Integration with Microsoft tools like Word or Outlook
You can paste maps or branches into MS Work, MS Wordpad or MS Outlook messages. In general, you can paste it into any application that understands RTF - rich text format. The text formatting and links are pasted too.
~ Clicking a mail link<EMAIL_ADDRESS>will open Outlook for creating a new message
+ - Preferences
Only a small subset of preferences is editable using graphical using interface; these you can change in menu: Edit > Preferences. At the time, the following preferences can be changed:
You can set full antialiasing or antialiasing of edges only. Antialiasing of edges is the default option.
You can set a kind of HTML export in preferences.
Other preferences can be changed by more technical users in user.properties, which you have to copy into the folder freemind in your home folder.
+ - Printing
You can print either by fitting the whole map into one page, or by printing the map to several sheets of paper. This choice you can set in menu: File > Page Setup > ... .
Choose page setup landscape. That way it looks better and you have a better utilization of space.
If you want to preview your map before you print it and have a postscript printer or generic postsript driver, you can print the map into file and view the postscript file view ghostview or similar software. Beware that if you try to print the map with printer that does not understand postscript, the resulting file will not be postscript but probably PCL, which is unusable for you.
You can also print from your browser after exporting map to HTML, or from Word or Wordpad after copying and pasting the map into it. You can also export the map into HTML with headings, copy and paste it into MS Word and print it from there. That way you can change styles as you want.
+ - Tips
To be able to enter newlines in long nodes, uncheck the check box "Enter confirms" when editing the long node.
You see?
There are newlines here, make no mistake about it.
+ - Pictures and HTML in nodes
An easy way to insert pictures into FreeMind is with Popup > Node > Set Image. You lose all the text you had in the node. Be aware that those images are not correctly pasted outside FreeMind and they need not to be correctly exported to HTML. Pictures in FreeMind are preliminary feature.
This way, you can turn images contained into the links on nodes into the images themselves. As a result, you can drag and drop several image files into FreeMind, select them as multiple nodes, and them turn them into images in one step, i.e. by choosing Set Image.
A more technical and not so user friendly way to do it follows. It is possible to include HTML in nodes. You have to start the node content with the tag <html>. This way, you can have pictures in the nodes.
E.g:
Formats: On Java1.4.1 on Windows, png, jpg and gif work fine.
There is no support for HTML nodes and pictures in exporting to text, HTML or RTF (Word, Wordpad). At least, it is convenient for publication on the Web using Freemind's Applet.
+ - Example of pictures, working on some Windows distributions
+ - Example of HTML
There are several items:
| a | b |
| ----------- | ............. |
+ - Physical style - patterns
There is a set of physical styles also called patterns. They are stored in the file "patterns.xml" located at the folder "freemind" in your home directory.
Application
You can create or change patterns by editing "patterns.xml". Pattern applies to node, if there is a <node> tag, it applies to edge, if there is an <edge> tag. <node> tag can have <font> tag as a child. Study the file "patterns.xml" supplied with FreeMind.
+ - Zoom
+ - File locking
Current version of FreeMind has experimental file locking, which is disabled by default. Current implementation does not really prevent race conditions, but it should be fine for the most of practical purposes. What does file locking mean? It makes sure that more users do not edit the same map at the same time, preventing them from incidentally overwriting the information from each other.
You can enable experimental file locking, if you are a technical user and are willing to edit user.properties, as described above.
+ - Changes in user interface of recent version
Some of the key settings have been redefined so that they align themselves with what we consider shared standard or intuitive use. Some of the new key settings are modelled on Microsoft tools. New key settings include enter for creating of new siblings below the node, insert for creating new children, F2 for editing nodes - here the Microsoft influence is apparent while there is no intuitive reason to have F2 for node editing. But once you get used to it in all the applications you use, you want to have that one in FreeMind too of course.
The changes we have made in the user interface are customizable in user.properties to an extent.
To copy your selection to clipboard when you are editing a node, press right mouse button and choose copy
+ - Icons
+ - Graphical links
| Mark a node and drag this node to another node holding both shift and control keys and release the mouse button first creates a graphical link between them. |
You can edit some properties of this link using right click onto the line between them.
You may choose the color and the arrow positions.
Moreover you can go directly to the other node (even if its folded) using the right click on the small part of the graphical link.
Example
+ - Clouds
You can browse the mind maps in browse mode. Why is there a separate mode for browsing? That's because browsing is the only thing you can do in FreeMind applet, which can be put to your website. Normally, you would not use browse mode in FreeMind.
You can browse the files on your computer using file mode. To enter file mode, in menu: Modes > File.
You can then browse the file tree as if it was a mind map. You can make any folder the root of the map by chosing "Center" from the node menu. To view or execute a file, follow the link of the node.
The file mode is currently not very useful; it is a demonstration that it's not too difficult to feed data into the tree from other source than mind map. There is no evidence that people would really use this mode.
Although Freemind is primarily a tool for editing Mind Maps, it is designed to be able to view data coming from different data sources. To make a specific data source available for viewing in FreeMind, a programmer has to write a so called mode for that data source. In the standard, there is an example of such a mode, namely file mode. We do not know of any other modes implemented. It is not clear if anyone would really want to make use of this architecture, but it's here to be exploited if someone wants to.
Furthermore, there is code almost ready for Scheme Mode which enables you to edit scheme programs. Again, the usefulness is far from clear. While the mind map mode is clearly a real thing, other modes seem to be more a demonstration of what is possible than something really used by people.
Of the value traps, the most widespread and pernicious is value rigidity. This is an inability to revalue what one sees because of commitment to previous values. In motorcycle maintenance, you must rediscover what you do as you go. Rigid values make this impossible.
The typical situation is that the motorcycle doesn't work. The facts are there but you don't see them. You're looking right at them, but they don't yet have enough value. This is what Phædrus was talking about. Quality, value, creates the subjects and objects of the world. The facts do not exist until value has created them. If your values are rigid you can't really learn new facts.
This often shows up in premature diagnosis, when you're sure you know what the trouble is, and then when it isn't, you're stuck. Then you've got to find some new clues, but before you can find them you've got to clear your head of old opinions.
The birth of a new fact is always a wonderful thing to experience. It's dualistically called a ``discovery'' because of the presumption that it has an existence independent of anyone's awareness of it. When it comes along, it always has, at first, a low value. Then, depending on the value-looseness of the observer and the potential quality of the fact, its value increases, either slowly or rapidly, or the value wanes and the fact disappears.
Ideally, you don't need any customizing at all. But if you really want to customize FreeMind, copy the file "user.properties" to the folder "freemind" in your home directory and edit the properties in the text file using your favorite text editor, e.g. notepad, Vim or Emacs.
You sure know your home directory if you're working on Linux. On Windows 2000, it's typically "C:\Documents and Settings\<UserName>\", on Windows 95, it's "C:\WINDOWS\". Edit "user.properties" in the folder "freemind" of your home directory. On Windows, you can additionally configure file type of extension mm to open with FreeMind.
To be able to edit node with newlines, it must be multiline (or long if you wish) first. That is, first write text that is long enough, then finish editing, then press enter again and you find yourself in the larger editing window. It is only that window which contains the check box "Enter confirms".
In the pop up menu of a node, edit the link by the menu item "Node > Set Link (Textfield)" and set the links as an empty string.
You can install the applet at your website so that other users can browse your mind maps.
~ Download the applet, that is freemind-browser.
The downloaded archive contains freemindbrowser.jar and freemindbrowser.html. Create a link from your page to freemindbrowser.html. Edit freemindbrowser.html, especially change the path inside so that it points to your mind map. Beware that the applet's jar file must be located at the same server as the map itself, this is for java security reasons. Of course, you have to upload the files to your web site.
In applet, you can only use the browse mode, that is, you cannot edit the remote maps. Click the nodes to toggle the folding or follow the links. Drag the background to move the map. You can also search the map, using node popup menu. |
2024-11-18T17:59:33.064549+00:00 | 2012-12-14T20:24:53 | b323eb2a6a115b73669acccd1d1eb0f69f9065d7 | {
"blob_id": "b323eb2a6a115b73669acccd1d1eb0f69f9065d7",
"branch_name": "refs/heads/master",
"committer_date": "2012-12-14T20:24:53",
"content_id": "983db64b1b5ef4d877a93e0a5e202ea5a2fbf1e5",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "7dba518580c5e0856ecd19c6ebb97893fa5daf09",
"extension": "html",
"filename": "things-to-doin-tennesse.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": null,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 21911,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/things-to-doin-tennesse.html",
"provenance": "stackv2_html-0000.json.gz:91",
"repo_name": "jizowydyn/jizowydyn.github.com",
"revision_date": "2012-12-14T20:24:53",
"revision_id": "d85a2ee18641f66a64e4c44934b73d9cf866fa12",
"snapshot_id": "1654a79a012bfe0ec1161894481daec4246c8f10",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/jizowydyn/jizowydyn.github.com/d85a2ee18641f66a64e4c44934b73d9cf866fa12/things-to-doin-tennesse.html",
"visit_date": "2016-08-07T13:25:45.939724"
} | stackv2 | Things to do in Pigeon Forge: Check out 62 Pigeon Forge ...
Things to do in Pigeon Forge, Tennessee: See TripAdvisor's 15357 reviews and photos . Pigeon Forge Attractions: What to do & Places to Visit in Pigeon Forge .
http://www.tripadvisor.com/Attractions-g55270-Activities-Pigeon_Forge_Tennessee.html
Treatment for Herniated or Bulging Discs
Find Things to Do in Pigeon Forge, Tennessee - Pigeon Forge ...
Find things to do in Pigeon Forge, Tennessee during your vacation. Pack your vacation with as many of the Pigeon Forge activities as possible!
http://www.mypigeonforge.com/what_to_do.aspx
Things to do in Nashville, TN: Travel Guide from 10Best
Nashville travel guide on the best things to do in Nashville Tennessee. Expert and traveler recommendations for Nashville restaurants, attractions, nightlife, .
http://www.10best.com/destinations/tennessee/nashville/
things to doin tennesse Herniated or Bulging Discs
Things To Do in Tennessee
Things to do in Tennessee, including national parks, state parks, special events, museums, zoos, theaters, aquariums, and much more.
http://www.thingstodo.com/states/TN/index.htm
Best Things to do in Nashville TN, Stuff todo + to see near Nashville ...
Best things todo + see in Nashville TN. Find fun attractions, maps, and cool stuff to do near Nashville Tennessee for visitors.
http://www.hotelplanner.com/Attractions/2220-Things-to-do-in-Nashville-TN
Top 10 Attractions & Things to Do in Tennessee
Enjoy scores of exciting tourist attractions and festivals in Tennessee, including the Grand Ole Opry in Nashville, Graceland in Memphis, Tennessee Aquarium .
http://www.ramadabluegrass.com/attractions/tennessee_things_to_do.aspx
Official Impairment Listing for Spinal Disorders
Things to do in Memphis: Check out 78 Memphis Attractions ...
Things to do in Memphis, Tennessee: See TripAdvisor's 7991 reviews and photos of 78 Memphis attractions.
http://www.tripadvisor.com/Attractions-g55197-Activities-Memphis_Tennessee.html
- uber defition urban dictonary (narrowing of the spine)
Fall
Looking for things to do in Gatlinburg? The Gatlinburg fall calendar of events is jam-packed with seasonal Gatlinburg TN attractions that you won't want to miss .
http://www.gatlinburg.com/events/fall.aspxVisit Nashville, TN - Music City | Attractions - Nashville Convention ...
Visit Nashville, TN - Music City | Attractions. Filter: Arts & Culture, Brewery/ Distillery, Dinner Theater, Family, FESTIVALS & SPECIAL EVENTS, Free Attractions .
http://www.visitmusiccity.com/Visitors/thingstodo/attractions
123 Things To Do in Gatlinburg, Tennessee
Gatlinburg Things To Do: 317 reviews and photos of things to see in Gatlinburg, Tennessee from real travelers and locals.
http://www.virtualtourist.com/travel/North_America/United_States_of_America/Tennessee/Gatlinburg-871396/Things_To_Do-Gatlinburg-TG-C-1.html
Things to Do in Nashville, TN - Sightseeing & Attractions - AOL Travel
Results 1 - 20 of 317 . Looking for things to do in Nashville Tennessee? Explore AOL Travel's list of what to do in Nashville from must-see Nashville tourist .
http://travel.aol.com/travel-guide/united-states/tennessee/nashville-things-to-do/
Medical-Vocational Allowance for Herniated Disc
Things to do in Chattanooga: Check out 62 Chattanooga Attractions ...
Things to do in Chattanooga, Tennessee: See TripAdvisor's 4979 reviews and photos of . Chattanooga Attractions: What to do & Places to Visit in Chattanooga .
http://www.tripadvisor.com/Attractions-g54946-Activities-Chattanooga_Tennessee.html
Visit Sevierville, TN - What To Do?
What is there to do in Sevierville, Tennessee? More than you ever imagined. Spend the day visiting exciting attractions and the nights attending spectacular .
http://www.visitsevierville.com/vswhattodo.aspx
Appealing a Denial of Benefits
Things to do in Nashville: Check out 93 Nashville Attractions ...
Things to do in Nashville, Tennessee: See TripAdvisor's 7441 reviews and photos of 93 Nashville attractions.
http://www.tripadvisor.com/Attractions-g55229-Activities-Nashville_Tennessee.html
Tennessee Plates Lyrics - John Hiatt
Tennessee Plates Lyrics - I woke up in a hotel and I didn't know what to do I turned the tv on and wrote a letter to...
http://www.lyricsfreak.com/j/john+hiatt/tennessee+plates_20074194.html |
2024-11-18T17:59:33.071513+00:00 | 2015-10-24T01:07:27 | fae9c04f734733752b4afcbecb8bcb8c26f223e8 | {
"blob_id": "fae9c04f734733752b4afcbecb8bcb8c26f223e8",
"branch_name": "refs/heads/master",
"committer_date": "2015-10-24T01:07:27",
"content_id": "35c875c3296312c0c21f79d6ef757d6e208e3ed4",
"detected_licenses": [
"MIT"
],
"directory_id": "c54da3f3ff5d0a4e7c45041b6a1908944261de87",
"extension": "html",
"filename": "index.html",
"fork_events_count": 13,
"gha_created_at": "2014-01-07T23:41:08",
"gha_event_created_at": "2015-05-03T07:42:31",
"gha_language": "HTML",
"gha_license_id": null,
"github_id": 15720111,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 6497,
"license": "MIT",
"license_type": "permissive",
"path": "/server/index.html",
"provenance": "stackv2_html-0000.json.gz:92",
"repo_name": "orviwan/91-Dub-v2.0",
"revision_date": "2015-10-24T01:07:27",
"revision_id": "37a73b140ebe90b7d270fdb3f41890826facb6e3",
"snapshot_id": "ccaf63d3711b2be40ca8fc787eb5ca3a7436221e",
"src_encoding": "UTF-8",
"star_events_count": 33,
"url": "https://raw.githubusercontent.com/orviwan/91-Dub-v2.0/37a73b140ebe90b7d270fdb3f41890826facb6e3/server/index.html",
"visit_date": "2021-01-17T17:07:56.865844"
} | stackv2 | The colon between the hours and minutes will blink every second.
Alternate colour scheme, as requested by @CaffeineJunkie.
Vibrate on Bluetooth disconnect.
Vibrate on the hour. |
2024-11-18T17:59:33.071604+00:00 | 2016-08-30T07:12:15 | e53223332f7a763dad04275a51fff6f153de346a | {
"blob_id": "e53223332f7a763dad04275a51fff6f153de346a",
"branch_name": "refs/heads/master",
"committer_date": "2016-08-30T07:12:15",
"content_id": "e295f2374404a170fdd14e21020aa9ef2ba7c9f7",
"detected_licenses": [
"BSD-3-Clause"
],
"directory_id": "67f4b0854a9c8eb446c67a81861e853cef601188",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": "2016-08-30T06:47:43",
"gha_event_created_at": "2016-08-30T06:47:44",
"gha_language": null,
"gha_license_id": null,
"github_id": 66914448,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 1855,
"license": "BSD-3-Clause",
"license_type": "permissive",
"path": "/edtrac_project/rapidsms_edtrac/education/templates/education/index.html",
"provenance": "stackv2_html-0000.json.gz:93",
"repo_name": "writefaruq/edtrac",
"revision_date": "2016-08-30T07:12:15",
"revision_id": "52973dca4635cee17509fc570a2c5b1270df97a0",
"snapshot_id": "4fc1dfb9e9259c87248e47491f95fa1162a5a2f8",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/writefaruq/edtrac/52973dca4635cee17509fc570a2c5b1270df97a0/edtrac_project/rapidsms_edtrac/education/templates/education/index.html",
"visit_date": "2020-12-31T02:22:54.594610"
} | stackv2 | {# What the dashboard of Ministry of Education will contain; template will be inherited for other role-based views #} {% extends "layout.html" %} {% block stylesheets %} {% endblock %} {% block javascripts %} {{ block.super }} {% include "education/partials/chart/javascripts.html" %} {% endblock javascripts %} {% block content %}
Welcome to the School Monitoring System, UNICEF's SMS-based Education monitoring and tracking system. Click a tab to explore.
{% if user.is_authenticated %} {% if user.is_superuser or user.get_profile.role == "Admins" %}
| Administrative Tasks |
|---|
| Manage Users | |
2024-11-18T17:59:33.071739+00:00 | 2019-05-10T18:52:37 | 8050d9ea82168567701c6b83a7196b7d1d99613e | {
"blob_id": "8050d9ea82168567701c6b83a7196b7d1d99613e",
"branch_name": "refs/heads/master",
"committer_date": "2019-05-10T18:52:37",
"content_id": "ced7ccef648294ec7f217b31bb980df905b8c681",
"detected_licenses": [
"Apache-2.0",
"bzip2-1.0.6"
],
"directory_id": "c70da176306531aa3f847c0f21be7316a818b822",
"extension": "html",
"filename": "os_file.html",
"fork_events_count": 2,
"gha_created_at": "2019-05-10T18:34:05",
"gha_event_created_at": "2019-05-10T18:52:38",
"gha_language": "C",
"gha_license_id": "Apache-2.0",
"github_id": 186037357,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 24143,
"license": "Apache-2.0,bzip2-1.0.6",
"license_type": "permissive",
"path": "/doc/os_file.html",
"provenance": "stackv2_html-0000.json.gz:94",
"repo_name": "mithralinc/cosm",
"revision_date": "2019-05-10T18:52:37",
"revision_id": "f6f40e86333af2a94e008a7ff68408ab8b6529cf",
"snapshot_id": "c8543b74e7b7ae63d00440f75b21fde128b70e8a",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/mithralinc/cosm/f6f40e86333af2a94e008a7ff68408ab8b6529cf/doc/os_file.html",
"visit_date": "2020-05-21T11:45:41.698059"
} | stackv2 | |
File and Directory Functions
CosmFileOpenSyntax#include "cosm/os_file.h" s32 CosmFileOpen( cosm_FILE * file, const ascii * filename, u32 mode, u32 lock ); DescriptionAttempt to open the filename in the mode with the lock. Paths are always in the Cosm "native|/path/path2/filename" format. This is important for the system because any platform that can will do a chroot() before running, non-chroot systems will tack addition path on the front at runtime. The 'other' slash is translated on the fly if needed, but internally, it's all stored in the same format. The native portion of the path (everything before and including the '|') is platform specific for devices/nodes on wierd OSes. e.g. "e:|/temp/a.txt"(win32), or "//4|/tmp/a.txt" (qnx). If paths are ever sent over the net, this native portion will be stripped. File Modes:
Files Locks:
Return ValuesCOSM_PASS on success, or an error code on failure. Errors
Examplecosm_FILE * file; s32 result; file = CosmMemAlloc( sizeof( cosm_FILE ) ); result = CosmFileOpen( file, "/etc/fstab", COSM_FILE_MODE_READ, COSM_FILE_LOCK_NONE ); if ( result == COSM_PASS ) CosmPrint( "/etc/fstab open for reading.\n" ); else CosmPrint( "Unable to open /etc/fstab for reading.\n" ); CosmFileReadSyntax#include "cosm/os_file.h" s32 CosmFileRead( void * buffer, u64 * bytes_read, cosm_FILE * file, u64 length ); DescriptionRead length bytes from the file into the buffer. bytes_read is set to the number of bytes actually read. Return ValuesCOSM_PASS on success, or an error code on failure. ErrorsUpon failure last_error of file will be set to one of the following:
Examplecosm_FILE * file; char getbuff[31]; u64 bytesread; s32 error; /* ... */ error = CosmFileRead( getbuff, &bytesread, file, 30LL ); if ( error != COSM_PASS ) { CosmPrint( "We weren't able to read from the file.\n" ); } else { *( (u8 *) CosmMemOffset( getbuff, bytesread ) ) = 0; CosmPrint( "We read %u bytes: %.30s\n", bytesread, getbuff ); } CosmFileWriteSyntax#include "cosm/os_file.h" s32 CosmFileWrite( cosm_FILE * file, u64 * bytes_written, const void * const buffer, u64 length ); DescriptionWrite length bytes to the file from the buffer. bytes_written is set to the number of bytes actually written. Return ValuesCOSM_PASS on success, or an error code on failure. ErrorsUpon failure last_error of file will be set to one of the following:
Exampleutf8 to_write[30]; cosm_FILE * file; u64 written; u64 length; s32 error; /* ... */ CosmStrCopy( to_write, "Hello World!\n", 30LL ); length = CosmStrBytes( to_write ); error = CosmFileWrite( file, &written, to_write, length ); if ( ( length == written ) ) { CosmPrint( "Success! %v bytes written.\n", written ); } else { /* do stuff with error */ /* ... */ CosmPrint( "Wrote only %v bytes (of %v)\n", written, length ); } CosmFileSeekSyntax#include "cosm/os_file.h" s32 CosmFileSeek( cosm_FILE * file, u64 offset ); DescriptionMove the current file offset (in bytes). If the file is open in mode COSM_FILE_MODE_APPEND, you can't seek. Return ValuesCOSM_PASS on success, or an error code on failure. Errors
Examplecosm_FILE * file; s32 result; /* ... */ result = CosmFileSeek( file, 4096LL ); if ( result == COSM_PASS ) CosmPrint( "Now at byte position 4096 in the file.\n" ); else CosmPrint( "Seek failed.\n" ); CosmFileTellSyntax#include "cosm/os_file.h" s32 CosmFileTell( u64 * offset, cosm_FILE * file ); DescriptionGet the current file offset. Return ValuesCOSM_PASS on success, or an error code on failure. Errors
Examplecosm_FILE * file; u64 offset; s32 result; /* ... */ result = CosmFileTell( &offset, file ); if ( result == COSM_PASS ) CosmPrint( "Currently at byte offset %v in the file.\n", offset ); else CosmPrint( "Unable to read position in file.\n" ); CosmFileEOFSyntax#include "cosm/os_file.h" s32 CosmFileEOF( cosm_FILE * file ); DescriptionTest EOF (End Of File) state. Return ValuesCOSM_PASS if there is more to read, COSM_FILE_ERROR_EOF if EOF, or an error code on failure. Errors
Examplecosm_FILE * file; /* ... */ if ( !CosmFileEOF( file ) ) CosmPrint( "There is more data to read.\n" ); else { CosmPrint( "No more data to be read.\n" ); return 0; } CosmFileLengthSyntax#include "cosm/os_file.h" s32 CosmFileLength( u64 * length, cosm_FILE * file ); DescriptionSet length to the length of the open file. Return ValuesCOSM_PASS on success, or an error code on failure. Errors
Examplecosm_FILE * file; u64 length; s32 result; /* ... */ result = CosmFileLength( &length, file ); if ( result == COSM_PASS ) CosmPrint( "The length of the file is %v bytes.\n", length); else if ( result == COSM_FILE_ERROR_CLOSED ) CosmPrint( "The file is closed. Can not read length.\n" ); else CosmPrint( "Error. Unable to read file length.\n" ); CosmFileTruncateSyntax#include "cosm/os_file.h" s32 CosmFileTruncate( cosm_FILE * file, u64 length ); DescriptionTruncate the file at length bytes. Current offset will be moved to the end of the file. Return ValuesCOSM_PASS on success, or an error code on failure. Errors
Examplecosm_FILE * file; s32 result; /* ... */ result = CosmFileTruncate( file, 10000LL ); if ( result == COSM_PASS ) CosmPrint( "File truncated to exactly 10000 bytes in length.\n" ); else CosmPrint( "Could not truncate file.\n" ); CosmFileCloseSyntax#include "cosm/os_file.h" s32 CosmFileClose( cosm_FILE * file ); DescriptionClose the file. Return ValuesCOSM_PASS on success, or an error code on failure. Errors
Examplecosm_FILE * file; /* ... */ CosmFileClose( file ); CosmProcessEnd( 0 ); CosmFileDeleteSyntax#include "cosm/os_file.h" s32 CosmFileDelete( const ascii * filename ); DescriptionAttempt to delete the file specified by filename. See CosmFileOpen for how to specify the path and file name. Deletion will involve a full wipe of the file data. Return ValuesCOSM_PASS on success, or an error code on failure. Errors
Examples32 result; result = CosmFileDelete( "/tmp/file" ); if ( result == COSM_PASS ) CosmPrint( "File /tmp/file was successfully removed.\n" ); else { if ( result == COSM_FILE_ERROR_DENIED ) CosmPrint( "Unable to delete /tmp/file: Access denied.\n" ); else CosmPrint( "Unable to delete /tmp/file: File doesn't exist.\n" ); } CosmFileInfoSyntax#include "cosm/os_file.h" s32 CosmFileInfo( cosm_FILE_INFO * info, const ascii * filename ); DescriptionGet Information about a file. The cosm_FILE_INFO struct has the following structure. typedef struct cosm_FILE_INFO { u64 length; u32 type; u32 rights; cosmtime create; cosmtime modify; cosmtime access; } cosm_FILE_INFO; Return ValuesCOSM_PASS on success, or an error code on failure. ErrorsExampleCosmDirOpenSyntax#include "cosm/os_file.h" s32 CosmDirOpen( cosm_DIR * dir, const ascii * dirname, u32 mode ); DescriptionAttempt to open the dirname in the specified mode. See CosmFileOpen for how to specify the path. Directory Modes:
Return ValuesCOSM_PASS on success, or an error code on failure. Errors
Examplecosm_DIR * dir; s32 result; dir = CosmMemAlloc( sizeof( cosm_DIR ) ); result = CosmDirOpen( dir, "/var/", COSM_DIR_MODE_READ ); if ( result == COSM_PASS ) CosmPrint( "Call to CosmDirOpen passed. /var is open.\n" ); else { CosmPrint( "Call to CosmDirOpen failed. Dying.\n" ); return 1; } CosmDirReadSyntax#include "cosm/os_file.h" s32 CosmDirRead( cosm_FILENAME * buffer, u64 * names_read, u64 length, cosm_DIR * dir ); DescriptionRead length file names from the dir into the buffer. Set names_read to the number of filenames read, zero on error. Return ValuesCOSM_PASS on success, or an error code on failure. ErrorsUpon failure last_error of dir will be set to one of the following:
Examplecosm_DIR * dir; cosm_FILENAME getbuff; u64 count; /* ... */ while ( CosmDirRead( &getbuff, &count, (u64) 1, dir ) ) == COSM_PASS ) { CosmPrint( "File: %.256s\n", getbuff ); } CosmDirDeleteSyntax#include "cosm/os_file.h" s32 CosmDirDelete( const ascii * dirname ); DescriptionAttempt to delete the directory specified by dirname. Will only work if the directory is empty. See CosmFileOpen for how to specify the path. Return ValuesCOSM_PASS on success, or an error code on failure. Errors
Examples32 result; result = CosmDirDelete( "/tmp/dir" ); if ( result == COSM_PASS ) CosmPrint( "/tmp/dir was successfully deleted.\n" ); else { if ( result == COSM_DIR_ERROR_NOTFOUND ) CosmPrint( "/tmp/dir doesn't exist.\n" ); else CosmPrint( "/tmp/dir cannot be deleted.\n" ); } CosmDirCloseSyntax#include "cosm/os_file.h" s32 CosmDirClose( cosm_DIR * dir ); DescriptionClose the directory. Return ValuesCOSM_PASS on success, or an error code on failure. Errors
Examplecosm_DIR * dir; s32 result; /* ... */ result = CosmDirClose( dir ); if ( result == COSM_PASS ) CosmPrint( "The directory was closed.\n" ); else CosmPrint( "The directory was not open or doesn't exist.\n" ); CosmLoadSyntax#include "cosm/os_file.h" void CosmU16Load( u16 * num, void * bytes ); void CosmU32Load( u32 * num, void * bytes ); void CosmU64Load( u64 * num, void * bytes ); void CosmU128Load( u128 * num, void * bytes ); DescriptionLoad the big endian bytes of specified type into the native num. Return ValuesNone. ErrorsNone. Note that if bytes or num is NULL, no action will be performed. Exampleu8 * bytes; u128 num; bytes = CosmMemAlloc( 16LL ); /* ...'bytes' gets read from a file or from the net... */ CosmU128Load( &num, bytes ); CosmSaveSyntax#include "cosm/os_file.h" void CosmU16Save( void * bytes, u16 * num ); void CosmU32Save( void * bytes, u32 * num ); void CosmU64Save( void * bytes, u64 * num ); void CosmU128Save( void * bytes, u128 * num ); DescriptionSave the native num of specified type into big endian bytes. Return ValuesNone. ErrorsNone. Note that if bytes or num is NULL, no action will be performed. Exampleu8 * bytes; u128 num; bytes = CosmMemAlloc( 16LL ); /* ... */ CosmU128Save( bytes, &num ); /* 'bytes' is now safe to send to a file or over the net */
© Copyright Mithral Communications & Design Inc.
1995-.
All rights reserved.
Mithral® and Cosm® are trademarks of
Mithral Communications & Design Inc.
| |
2024-11-18T17:59:33.072874+00:00 | 2014-04-09T07:14:03 | d8e6e076a417b70a4995c588877b93786441394c | {
"blob_id": "d8e6e076a417b70a4995c588877b93786441394c",
"branch_name": "refs/heads/master",
"committer_date": "2014-04-09T07:14:03",
"content_id": "c450fc40b65a73fbd12cc251765746270ff1bcd1",
"detected_licenses": [
"Apache-2.0"
],
"directory_id": "26e99aede8248f2c6a571c6e53568873de181b41",
"extension": "html",
"filename": "Time.html",
"fork_events_count": 1,
"gha_created_at": "2013-10-11T11:55:17",
"gha_event_created_at": "2016-03-09T17:01:11",
"gha_language": "Java",
"gha_license_id": null,
"github_id": 13497717,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 14945,
"license": "Apache-2.0",
"license_type": "permissive",
"path": "/giraph-core/target/site/apidocs/org/apache/giraph/time/class-use/Time.html",
"provenance": "stackv2_html-0000.json.gz:95",
"repo_name": "zfighter/giraph-research",
"revision_date": "2014-04-09T07:14:03",
"revision_id": "010cd6cc7dcbd2e39d331451048aa15f71f0061e",
"snapshot_id": "037521fc85600fe47e555fd31c15150085223ace",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/zfighter/giraph-research/010cd6cc7dcbd2e39d331451048aa15f71f0061e/giraph-core/target/site/apidocs/org/apache/giraph/time/class-use/Time.html",
"visit_date": "2020-12-24T14:01:57.093596"
} | stackv2 | | 程序包 | 说明 |
|---|---|
| org.apache.giraph.time |
Time related things.
|
| org.apache.giraph.zk |
Package of
ZooKeeper related objects. |
| 限定符和类型 | 类和说明 |
|---|---|
class |
FakeTime
Thread-safe implementation of Time for testing that can help get time based
ordering of events when desired.
|
class |
SystemTime
Implementation of Time that is thread-safe and should be used in
production.
|
| 限定符和类型 | 方法和说明 |
|---|---|
static Time |
SystemTime.get()
Get an instance (shared) of this object
|
| 限定符和类型 | 方法和说明 |
|---|---|
static long |
Times.get(Time time,
TimeUnit timeUnit)
Convenience method to measure time in a given TimeUnit.
|
static long |
Times.getDiff(Time time,
TimeUnit timeUnit,
long startTime)
Convenience method to get time since the beginning of an event in a given
TimeUnit.
|
static long |
Times.getMicrosSince(Time time,
long previousMicros)
Convenience method to get microseconds since a previous microseconds point.
|
static long |
Times.getMillisecondsSince(Time time,
long previousMilliseconds)
Convenience method to get milliseconds since a previous milliseconds
point.
|
static long |
Times.getMsSince(Time time,
long previousMs)
Convenience method to get milliseconds since a previous milliseconds
point.
|
static long |
Times.getNanosecondsSince(Time time,
long previousNanoseconds)
Convenience method to get nanoseconds since a previous nanoseconds
point.
|
static long |
Times.getNanosSince(Time time,
long previousNanos)
Convenience method to get nanoseconds since a previous nanoseconds
point.
|
static int |
Times.getSecondsSince(Time time,
int previousSeconds)
Convenience method to get seconds since a previous seconds
point.
|
static int |
Times.getSecSince(Time time,
int previousSec)
Convenience method to get seconds since a previous seconds
point.
|
| 构造器和说明 |
|---|
PredicateLock(org.apache.hadoop.util.Progressable progressable,
int msecPeriod,
Time time)
Constructor.
|
Copyright © 2011-2013 The Apache Software Foundation. All Rights Reserved. |
2024-11-18T17:59:33.076284+00:00 | 2018-07-18T14:29:43 | 82a32b4b727373fc595ebac4398ede4ef80b81d8 | {
"blob_id": "82a32b4b727373fc595ebac4398ede4ef80b81d8",
"branch_name": "refs/heads/master",
"committer_date": "2018-07-18T14:29:43",
"content_id": "8c78949855f23f7d2d13f6f80ac8c06ec6d7c671",
"detected_licenses": [
"MIT"
],
"directory_id": "c51f13b3894547f25b65f600b7dfc62a44fee5c1",
"extension": "html",
"filename": "months.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 140578216,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 2806,
"license": "MIT",
"license_type": "permissive",
"path": "/months.html",
"provenance": "stackv2_html-0000.json.gz:96",
"repo_name": "elisamanzoni/mint",
"revision_date": "2018-07-18T14:29:43",
"revision_id": "b67b042fd1373891d93c4e25b81400d5a78a34e0",
"snapshot_id": "f14035186be60b4c05e94043e6d7b4bdc064f2a0",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/elisamanzoni/mint/b67b042fd1373891d93c4e25b81400d5a78a34e0/months.html",
"visit_date": "2020-03-22T20:10:24.633033"
} | stackv2 | Months
September: Perspectives
September is a new beginning that force to make a prospectus of the year. This changes the perspectives for the new year.
October: Food |
2024-11-18T17:59:33.082428+00:00 | 2020-08-24T00:06:18 | 29c6159655d6c74519e758826527cf01eb332182 | {
"blob_id": "29c6159655d6c74519e758826527cf01eb332182",
"branch_name": "refs/heads/master",
"committer_date": "2020-08-24T00:06:18",
"content_id": "d0de182b9746336222b772d6f8c4228a2c3b10d8",
"detected_licenses": [
"MIT"
],
"directory_id": "97595121e94f2b5772b9afaf7d0cf29514bd3384",
"extension": "html",
"filename": "SvgFontMetrics.html",
"fork_events_count": 0,
"gha_created_at": "2020-08-24T00:07:43",
"gha_event_created_at": "2020-08-24T00:07:43",
"gha_language": null,
"gha_license_id": null,
"github_id": 289788002,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 15712,
"license": "MIT",
"license_type": "permissive",
"path": "/docs/dxf2svg/svg/SvgFontMetrics.html",
"provenance": "stackv2_html-0000.json.gz:97",
"repo_name": "Park-jihoon/dxf2svg",
"revision_date": "2020-08-24T00:06:18",
"revision_id": "5608e287e54eeb6be935634a8c62bd7b5b68e278",
"snapshot_id": "cef63ee85fec95ad6d2dc69e0b2cc3929e467532",
"src_encoding": "WINDOWS-1252",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/Park-jihoon/dxf2svg/5608e287e54eeb6be935634a8c62bd7b5b68e278/docs/dxf2svg/svg/SvgFontMetrics.html",
"visit_date": "2022-12-03T14:32:41.158590"
} | stackv2 | |
|||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Object dxf2svg.svg.SvgFontMetrics
This class represents the encapsulation of the metrics of a
text styles font and line metrics. There are several useful
methods that can be called to get information about this style's
font. The default measurement values returned from this class
are doubles to be consistant with expected returns and unlike
java.awt.FontMetrics.
The implementation of this class within Dxf2Svg stops the conversion
if the font required for the conversion does not exist on the system.
SvgFontMetrics.UnResolveableSvgFontMetricsException
| Nested Class Summary | |
class |
SvgFontMetrics.UnResolveableSvgFontMetricsException
This checked exception can occur if the SvgFontMetrics object is instantiated before the style table has its font name or font size set. |
| Constructor Summary | |
SvgFontMetrics(java.lang.String FontName,
double TextHeight)
Create a new SvgFontMetrics object with a FontName and TextHeight as reference. |
| Method Summary | |
double |
getAscent()
Returns the ascent or distance from the baseline to the top of the tallest character. |
double |
getDecent()
Returns the distance from the baseline to the bottom of the lowest decender. |
double |
getLeading()
Returns the leading of a line of text. |
double |
getLineSpacing()
Returns the height of the text. |
double |
getWidth(java.lang.String str)
|
java.lang.String |
toString()
Returns a String representation of this class. |
| Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
| Constructor Detail |
public SvgFontMetrics(java.lang.String FontName, double TextHeight) throws SvgFontMetrics.UnResolveableSvgFontMetricsException
SvgFontMetrics.UnResolveableSvgFontMetricsException
| Method Detail |
public final double getWidth(java.lang.String str)
public final double getLineSpacing()
public final double getAscent()
public final double getDecent()
public final double getLeading()
public final java.lang.String toString()
|
|||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | |
2024-11-18T17:59:33.082543+00:00 | 2020-09-01T09:18:01 | 637d19d056d1b12d33eaaf23a48766ccc273f1c3 | {
"blob_id": "637d19d056d1b12d33eaaf23a48766ccc273f1c3",
"branch_name": "refs/heads/master",
"committer_date": "2020-09-01T09:18:01",
"content_id": "993f8075eb2a88d2562a0e009fb0b8e243c23bf6",
"detected_licenses": [
"MIT"
],
"directory_id": "7c5955bd659ad4f67c38a007d1b06c3373371e28",
"extension": "html",
"filename": "transaction-history.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 291949118,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 9199,
"license": "MIT",
"license_type": "permissive",
"path": "/Solution/src/main/resources/templates/admin/transaction-history.html",
"provenance": "stackv2_html-0000.json.gz:98",
"repo_name": "RadomirRalev/virtual-wallet",
"revision_date": "2020-09-01T09:18:01",
"revision_id": "f7e7dcafe136aea72ce094ccae0b9356a8982214",
"snapshot_id": "481963d22ef4ade36a6aff11d8af461a3e3c60f0",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/RadomirRalev/virtual-wallet/f7e7dcafe136aea72ce094ccae0b9356a8982214/Solution/src/main/resources/templates/admin/transaction-history.html",
"visit_date": "2022-12-06T21:13:08.726927"
} | stackv2 | Admin panel
All
Outgoing
Incoming
Sort
Sort by Amount - Ascending
Sort by Amount - Descending
Sort by Date - Ascending
Sort by Date - Descending
FILTER
DATE
TYPE
SENDER
RECEIVER
AMOUNT
$ |
2024-11-18T17:59:33.083160+00:00 | 2020-05-29T01:17:39 | b95f0b48f367df82ab5eb1988760cef640af20b9 | {
"blob_id": "b95f0b48f367df82ab5eb1988760cef640af20b9",
"branch_name": "refs/heads/master",
"committer_date": "2020-05-29T01:17:39",
"content_id": "8851229f66b129afaf95a91cbe2a8287fb20f87c",
"detected_licenses": [
"MIT"
],
"directory_id": "4af38435675ceff4eacf0412f899362b4853e393",
"extension": "html",
"filename": "index.html",
"fork_events_count": 1,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 265667048,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 1262,
"license": "MIT",
"license_type": "permissive",
"path": "/index.html",
"provenance": "stackv2_html-0000.json.gz:99",
"repo_name": "Build-Week-DevDesk-Queue2/marketing-fw",
"revision_date": "2020-05-29T01:17:39",
"revision_id": "95c0ccfca74586fff2ec6e5fa935932611fa30e3",
"snapshot_id": "11a2e37464da6e0cc470ed46de8e1de710474dc4",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/Build-Week-DevDesk-Queue2/marketing-fw/95c0ccfca74586fff2ec6e5fa935932611fa30e3/index.html",
"visit_date": "2022-09-26T11:06:00.271238"
} | stackv2 | Students
Features
Team
Login
Making it easier to help students.
View student help requests and assign tickets to yourself and others
Get Started |
2024-11-18T17:59:33.083224+00:00 | 2016-11-22T04:49:49 | 852e43dfd976cb892fbf20e88b00f07b3525fa0c | {
"blob_id": "852e43dfd976cb892fbf20e88b00f07b3525fa0c",
"branch_name": "refs/heads/master",
"committer_date": "2016-11-22T04:49:49",
"content_id": "c39689461ea43e20838fde108cad21e9cc1aa7d5",
"detected_licenses": [
"MIT"
],
"directory_id": "fd0dab8ad209bdca9fef408dc92943946ceb81cf",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": 73498627,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 10329,
"license": "MIT",
"license_type": "permissive",
"path": "/index.html",
"provenance": "stackv2_html-0000.json.gz:100",
"repo_name": "elliotaplant/ann-plant-website",
"revision_date": "2016-11-22T04:49:49",
"revision_id": "184a9c94fe4368816132c5f030338b6179d228e1",
"snapshot_id": "a5f310cfec702f1c155be95ddb3038ce31ce25df",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/elliotaplant/ann-plant-website/184a9c94fe4368816132c5f030338b6179d228e1/index.html",
"visit_date": "2021-01-19T02:34:20.247862"
} | stackv2 | A very happy birthday wish to my beautiful mom for keeping me alive these 24 years.
My mom is the coolest mom of them all. She can change this text to whatever she wants. Literally anything can go here. A poem? That works. Song lyrics? Descriptions of prehistoric mamals? Those are fine too.
This would be a great place to put a picture of a house that you've sold. Maybe a sold sign out front? It would show that you know how to close deals. Or you could put a picture of your beautiful children. That works too. |
2024-11-18T17:59:33.097565+00:00 | 2019-02-26T21:24:25 | d7843d1a19f65ab175c4f57c989f6aa579974a04 | {
"blob_id": "d7843d1a19f65ab175c4f57c989f6aa579974a04",
"branch_name": "refs/heads/master",
"committer_date": "2019-02-26T21:24:25",
"content_id": "f463eeaa8919376a293db50a160629a1e655e50c",
"detected_licenses": [
"MIT"
],
"directory_id": "fa2584f16449598bf14c5ad80872efb5ed5f930f",
"extension": "html",
"filename": "index.html",
"fork_events_count": 0,
"gha_created_at": null,
"gha_event_created_at": null,
"gha_language": null,
"gha_license_id": null,
"github_id": null,
"is_generated": false,
"is_vendor": false,
"language": "HTML",
"length_bytes": 13501,
"license": "MIT",
"license_type": "permissive",
"path": "/site/static/index.html",
"provenance": "stackv2_html-0000.json.gz:101",
"repo_name": "ramogollon1/neuronaming-dev",
"revision_date": "2019-02-26T21:24:25",
"revision_id": "2a0c6f27c502445196143d321a042d9f4eda799e",
"snapshot_id": "186d77dbcd50f54f863969d5405e8ba9aa37c7b5",
"src_encoding": "UTF-8",
"star_events_count": 0,
"url": "https://raw.githubusercontent.com/ramogollon1/neuronaming-dev/2a0c6f27c502445196143d321a042d9f4eda799e/site/static/index.html",
"visit_date": "2021-10-20T08:09:23.054494"
} | stackv2 | All names are generated in real time by recurrent neural network, built on scientific computing framework Torch using the LSTM model – mostly for fun and research. 3 million active UK companies data points
were used to teach the AI. Industry classification is based on "Standard industrial classification of economic activities (SIC)" and for some industries better results are produced because of a larger amount of companies analysed. Neural
network does not copy real world brands thus any such reference is purely coincidental. Contact us. |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.