id
int64 | text
string | metadata
dict | line_start_n_end_idx
dict | quality_signals
dict | eai_taxonomy
dict | pid
string |
|---|---|---|---|---|---|---|
6,498,165,609,937,717,000 |
How to send Sandbox.allow for each dynamic supervisor (testing)
Hello friends, I have read this link: Ecto.Adapters.SQL.Sandbox — Ecto SQL v3.7.2, they said if we dont wan to drop a Genserver like this:
** (exit) exited in: GenServer.call(#PID<0.1673.0>, {:push, :edit, %MishkaInstaller.PluginState{depend_type: :soft, depends: [], event: "event_one", extra: [], name: "plugin_hook_one", priority: 1, status: :started}}, 5000)
** (EXIT) no process: the process is not alive or there's no process currently associated with the given name, possibly because its application isn't started
We should do like this:
test "gets results from GenServer" do
{:ok, pid} = MyAppServer.start_link()
Ecto.Adapters.SQL.Sandbox.allow(Repo, self(), pid)
assert MyAppServer.get_my_data_fast(timeout: 1000) == [...]
end
But it did not speck about a Genserver with dynamic supervisor, for example:
Enum.map(@depends, fn item ->
Map.merge(@new_soft_plugin, %{name: item, depend_type: :hard, depends: List.delete(@depends, item)})
|> MishkaInstaller.PluginState.push_call()
end)
In the top code I pushed 4 items of a list to Genserver and the Genserver pushed it to my database, and each Genserver has the own dynamic supervisor and PID.
After pushing the items to my database, I try to work with their state and call them, but sometimes my Genserver which is supervised dynamically is dropped.
I increase queue_target and pool_size, they fix some errors not all the problems
pool_size: 30,
queue_target: 10000,
I have read many topics, but I still have problems with dynamic supervisor Genserver testing, unfortunately.
Thank you.
More code:
def push_call(%PluginState{} = element) do
case PSupervisor.start_job(%{id: element.name, type: element.event}) do
{:ok, status, pid} ->
if Mix.env() == :test, do: Logger.warn("Plugin State of #{element.name} is being pushed")
GenServer.call(pid, {:push, status, element})
{:error, result} -> {:error, :push, result}
end
end
and start job function
def start_job(args) do
DynamicSupervisor.start_child(PluginStateOtpRunner, {MishkaInstaller.PluginState, args})
|> case do
{:ok, pid} -> {:ok, :add, pid}
{:ok, pid, _any} -> {:ok, :add, pid}
{:error, {:already_started, pid}} -> {:ok, :edit, pid}
{:error, result} -> {:error, result}
end
end
2 Likes
I think you may have misinterpreted the examples.
In the docs, this seems like an example of what you shouldn’t do if you want to share servers across tests, because it’s starting the server in the test and then the server will die when the test is done. So if your other tests are running aynchronously, sometimes they will work because this test is still running.
test "gets results from GenServer" do
{:ok, pid} = MyAppServer.start_link()
Ecto.Adapters.SQL.Sandbox.allow(Repo, self(), pid)
assert MyAppServer.get_my_data_fast(timeout: 1000) == [...]
end
Instead it suggests running in “allow” mode, where you would start the dynamic servers outside of the test, then get a pid of the already-running server by its name, and use that.
test "calls worker that runs a query" do
allow = Process.whereis(MyApp.Worker)
Ecto.Adapters.SQL.Sandbox.allow(Repo, self(), allow)
... rest of test
end
2 Likes
Thank you, but it is still about a Genserver worker not with a dynamic supervisor, what I should do when I am using this?
To share a connection between a test and a GenServer you need to ensure three things:
1. somebody calls allow
2. the GenServer shuts down if the test shuts down
3. the GenServer shuts down if it’s trying to start up when the test has already shut down (this can happen when the DynamicSupervisor restarts the GenServer)
To handle all three, I’ve used code like this in the application’s Repo:
def allow_if_sandbox(parent_pid, orphan_msg \\ :stop) do
if sandbox_pool?() do
monitor_parent(parent_pid, orphan_msg)
# this addresses #1
Ecto.Adapters.SQL.Sandbox.allow(__MODULE__, parent_pid, self())
end
end
def sandbox_pool?() do
config = Application.fetch_env!(:core, __MODULE__)
Keyword.get(config, :pool) == Ecto.Adapters.SQL.Sandbox
end
defp monitor_parent(parent_pid, orphan_msg) do
# this is part of addressing #2
Process.monitor(parent_pid)
if Process.alive?(parent_pid) do
:ok
else
Logger.error("#{inspect(parent_pid)} down when booting #{inspect(self())}")
# this addresses #3
# the "throw" will work like an early "return"; see the GenServer docs
throw(orphan_msg)
end
end
The Process.alive? check is not strictly required - monitoring an already-down process will put a :DOWN message into the queue - but typically the code that calls Repo.allow_if_sandbox will then immediately make a Repo.one call instead of processing messages.
Then in your GenServer, there are two changes needed:
• receive parent_pid in the arguments to init/1 and call Repo.allow_if_sandbox(parent_pid)
• add a handler for the message Process.monitor can trigger, like:
def handle_info({:DOWN, _ref, :process, pid, _reason}, state)
# log that this happened, etc. Don't use Repo!
:stop
end
Finally, you’ll need to actually pass the parent_pid - usually by adding it to the code that’s starting processes. Based on your example, something like:
Enum.map(@depends, fn item ->
Map.merge(@new_soft_plugin, %{
parent_pid: self(),
name: item,
depend_type: :hard,
depends: List.delete(@depends, item)
})
|> MishkaInstaller.PluginState.push_call()
end)
2 Likes
Hi, after a long delay I have tested your code, and it fixed many errors of my open-source project And I appreciate you very much :rose:.
I have 2 problems
1- it forces me to increase pool_size to 20. Lower than 20 it has error and says to increase
2- sometimes it forgets its registry state.
For second problems, I forced to put :timer.sleap in my test (link)
|
{
"url": "https://elixirforum.com/t/how-to-send-sandbox-allow-for-each-dynamic-supervisor-testing/46422",
"source_domain": "elixirforum.com",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "37970",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3MUKDG3LTRYMFEMYCN5GKERPMCMYZXZW",
"WARC-Concurrent-To": "<urn:uuid:4ee2090a-78d5-41cd-82a0-dd053b706b4b>",
"WARC-Date": "2022-08-17T22:47:48Z",
"WARC-IP-Address": "78.46.110.60",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IWLAZDTOUHIRWF5M46TVJXKVK2BTYRMA",
"WARC-Record-ID": "<urn:uuid:9809b30a-b234-46c0-875c-f7437b5b9c8c>",
"WARC-Target-URI": "https://elixirforum.com/t/how-to-send-sandbox-allow-for-each-dynamic-supervisor-testing/46422",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bf2c167c-fe9f-45e9-ad00-bb41db02a9bd>"
},
"warc_info": "isPartOf: CC-MAIN-2022-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-12\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
64,
65,
204,
205,
429,
596,
597,
621,
622,
660,
700,
753,
815,
819,
820,
897,
898,
928,
1035,
1084,
1089,
1090,
1249,
1250,
1407,
1408,
1489,
1490,
1509,
1534,
1535,
1644,
1645,
1656,
1657,
1658,
1669,
1670,
1715,
1791,
1819,
1917,
1971,
2022,
2030,
2036,
2037,
2060,
2061,
2086,
2179,
2194,
2231,
2274,
2335,
2378,
2386,
2392,
2400,
2401,
2451,
2452,
2768,
2769,
2807,
2847,
2900,
2962,
2966,
2967,
3147,
3148,
3189,
3229,
3284,
3303,
3307,
3315,
3316,
3438,
3439,
3525,
3526,
3552,
3605,
3766,
3767,
3840,
3841,
3900,
3926,
3971,
3972,
3998,
4068,
4076,
4082,
4083,
4108,
4163,
4223,
4229,
4230,
4279,
4315,
4347,
4348,
4385,
4395,
4404,
4486,
4512,
4589,
4613,
4621,
4627,
4628,
4888,
4889,
4943,
4944,
5037,
5106,
5168,
5217,
5225,
5229,
5230,
5384,
5385,
5415,
5448,
5472,
5488,
5512,
5553,
5558,
5603,
5608,
5616,
5617,
5755,
5756,
5774,
5775,
5868,
5912,
5913
],
"line_end_idx": [
64,
65,
204,
205,
429,
596,
597,
621,
622,
660,
700,
753,
815,
819,
820,
897,
898,
928,
1035,
1084,
1089,
1090,
1249,
1250,
1407,
1408,
1489,
1490,
1509,
1534,
1535,
1644,
1645,
1656,
1657,
1658,
1669,
1670,
1715,
1791,
1819,
1917,
1971,
2022,
2030,
2036,
2037,
2060,
2061,
2086,
2179,
2194,
2231,
2274,
2335,
2378,
2386,
2392,
2400,
2401,
2451,
2452,
2768,
2769,
2807,
2847,
2900,
2962,
2966,
2967,
3147,
3148,
3189,
3229,
3284,
3303,
3307,
3315,
3316,
3438,
3439,
3525,
3526,
3552,
3605,
3766,
3767,
3840,
3841,
3900,
3926,
3971,
3972,
3998,
4068,
4076,
4082,
4083,
4108,
4163,
4223,
4229,
4230,
4279,
4315,
4347,
4348,
4385,
4395,
4404,
4486,
4512,
4589,
4613,
4621,
4627,
4628,
4888,
4889,
4943,
4944,
5037,
5106,
5168,
5217,
5225,
5229,
5230,
5384,
5385,
5415,
5448,
5472,
5488,
5512,
5553,
5558,
5603,
5608,
5616,
5617,
5755,
5756,
5774,
5775,
5868,
5912,
5913,
5980
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5980,
"ccnet_original_nlines": 148,
"rps_doc_curly_bracket": 0.008695649914443493,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2816793918609619,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02137405052781105,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.34198471903800964,
"rps_doc_frac_unique_words": 0.4254498779773712,
"rps_doc_mean_word_length": 5.494858741760254,
"rps_doc_num_sentences": 93,
"rps_doc_symbol_to_word_ratio": 0.011450380086898804,
"rps_doc_unigram_entropy": 5.331063747406006,
"rps_doc_word_count": 778,
"rps_doc_frac_chars_dupe_10grams": 0.06409356743097305,
"rps_doc_frac_chars_dupe_5grams": 0.11555556207895279,
"rps_doc_frac_chars_dupe_6grams": 0.10479532182216644,
"rps_doc_frac_chars_dupe_7grams": 0.10479532182216644,
"rps_doc_frac_chars_dupe_8grams": 0.10479532182216644,
"rps_doc_frac_chars_dupe_9grams": 0.10479532182216644,
"rps_doc_frac_chars_top_2gram": 0.019883040338754654,
"rps_doc_frac_chars_top_3gram": 0.004912280011922121,
"rps_doc_frac_chars_top_4gram": 0.008888890035450459,
"rps_doc_books_importance": -565.1017456054688,
"rps_doc_books_importance_length_correction": -565.1017456054688,
"rps_doc_openwebtext_importance": -432.5355529785156,
"rps_doc_openwebtext_importance_length_correction": -432.5355529785156,
"rps_doc_wikipedia_importance": -265.75653076171875,
"rps_doc_wikipedia_importance_length_correction": -265.75653076171875
},
"fasttext": {
"dclm": 0.6450186371803284,
"english": 0.7709186673164368,
"fineweb_edu_approx": 2.142179012298584,
"eai_general_math": 0.9181110858917236,
"eai_open_web_math": 0.2327144742012024,
"eai_web_code": 0.8638250231742859
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-5,579,160,940,329,822,000 |
Branding & Web Design 07957 626 192 / [email protected]
Hacks and hackers in Liverpool
Posted on by admin
After hearing that Scraperwiki had organised a hack day in Liverpool, in my new-found freedom as a freelancer, I thought I’d pop down and give it a go. I’ve not really done a hack day either, so it was exciting to be throwing myself into the deepend a little. This was a little different from other hack days as the attendees were a mix of journalists and hackers, a nice idea given the growing use of data and visualisations in news stories.
A life of crime
The day was quite intense and I was pretty exhausted at the end of the day. I was on a team looking at crime as a subject area. Despite some good initial ideas about looking at crime and the geography of the city, extracting the kind of data necessary to map crime figures to specific parts of the city proved extremely difficult. Eventually we had to abandon that angle and went for a simpler approach of mapping stories around the city. Once the slight air of dispair had dissappeared, we had a lot of fun and producing a protoype for a project showing the ‘Life and Crimes* of ‘Pancake’ Taylor’ a notorious figure from Liverpool’s underworld.
Life and Crimes
The screenshot here demonstrates the idea; essentially we wanted to collate the news stories about this character and plot them on the map, showing them appearing in the order that they happened. By pressing the ‘play’ button, users could see the stories appear in the order that they happened. The lines on the slider would indicate where in the time frame the different stories happened in relation to each other. By moving the slider to that point, the user could jump to that point and show the stories. Simple, but it was nice to produce something that attempted to tell a more personal story, as most of the other projects focused on more intensive data analysis and information.
A good day despite the fact I didn’t win. I’m not bitter about that at all.
Overall, it was a great day day and despite setbacks I’m still really pleased with what we came up with, as well as being really impressed with the ideas presented by the other teams. The atmosphere in general was pretty friendly and it was a pleasure to spend the day with a diverse mix of people who all had something interesting to contribute. A big thanks to everyone at Scraperwiki for helping put on the event and making it a real success. I’m told there will be a Manchester event too, which I can definitely recommend, and indeed should be attending (and winning this time, goddammit).
*Alleged crimes that is.
Leave a Reply
Your email address will not be published. Required fields are marked *
|
{
"url": "http://superdeluxesam.com/2010/07/19/hacked-from-the-jaws-of-defeat/",
"source_domain": "superdeluxesam.com",
"snapshot_id": "crawl=CC-MAIN-2017-51",
"warc_metadata": {
"Content-Length": "24316",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IW37NCXMXFUMF46GPHPK63DITCPP4ZTL",
"WARC-Concurrent-To": "<urn:uuid:05886dd4-09a3-4a8e-a4d9-c5d798d9d1b0>",
"WARC-Date": "2017-12-16T12:49:20Z",
"WARC-IP-Address": "80.82.114.96",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DWDXDL2CKUAFLGSHUZKWOHWGAQNNVZLZ",
"WARC-Record-ID": "<urn:uuid:15280c0c-9d50-4b0b-addc-f8e356d6aa48>",
"WARC-Target-URI": "http://superdeluxesam.com/2010/07/19/hacked-from-the-jaws-of-defeat/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:06122835-1ce6-4017-851c-69df91127dc4>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-151-110-145.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-51\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for December 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
61,
62,
93,
94,
113,
114,
557,
558,
574,
575,
1221,
1222,
1238,
1239,
1925,
1926,
2002,
2003,
2597,
2598,
2623,
2624,
2638,
2639
],
"line_end_idx": [
61,
62,
93,
94,
113,
114,
557,
558,
574,
575,
1221,
1222,
1238,
1239,
1925,
1926,
2002,
2003,
2597,
2598,
2623,
2624,
2638,
2639,
2709
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2709,
"ccnet_original_nlines": 24,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.47358834743499756,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023679420351982117,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1147541031241417,
"rps_doc_frac_unique_words": 0.5135699510574341,
"rps_doc_mean_word_length": 4.526095867156982,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.961361408233643,
"rps_doc_word_count": 479,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.02398524060845375,
"rps_doc_frac_chars_dupe_6grams": 0.02398524060845375,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.00922509003430605,
"rps_doc_frac_chars_top_3gram": 0.00738007016479969,
"rps_doc_frac_chars_top_4gram": 0.012915129773318768,
"rps_doc_books_importance": -259.8884582519531,
"rps_doc_books_importance_length_correction": -259.8884582519531,
"rps_doc_openwebtext_importance": -138.1037139892578,
"rps_doc_openwebtext_importance_length_correction": -138.1037139892578,
"rps_doc_wikipedia_importance": -81.40094757080078,
"rps_doc_wikipedia_importance_length_correction": -81.40094757080078
},
"fasttext": {
"dclm": 0.07796139270067215,
"english": 0.9723916053771973,
"fineweb_edu_approx": 1.1091830730438232,
"eai_general_math": 0.0035690099466592073,
"eai_open_web_math": 0.15334570407867432,
"eai_web_code": 0.00018066000484395772
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "364.1",
"labels": {
"level_1": "Social sciences",
"level_2": "Social service and Societies",
"level_3": "Criminology"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "13",
"label": "News (Org.)"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-6,443,508,970,670,733,000 |
Avatar of David Williamson
David WilliamsonFlag for United States of America asked on
DFS and remote sites - part II
This thread was born of https://www.experts-exchange.com/Operating_Systems/Windows_Server_2003/Q_20931263.html#10699678
It has been created because the original focus of the thread has shifted, as well as a lot of time and effort has gone into the previous thread. I felt that it warranted a new thread...
Windows Server 2003
Avatar of undefined
Last Comment
Netman66
8/22/2022 - Mon
Netman66
I'll be with you shortly.
Netman66
Post the errors you're getting.
As for the third-party app - I'm not following you. I think you can restore to the pre-staging area and start DFS this will then use the pre-stage area to fill the real DFS share - however, it still verifies every file against the root before it moves it from pre-stage.
ASKER
David Williamson
The article mentions restoring from NTbackup or a comparable 3rd party backup solution as a way of pre-staging the DFS shared folder. Then, DFS will move the restored backup to the pre-existing folder, and then once it gets the MD5 checksum, will choose to move files from the pre-existing folder if the checksum matches.
Your help has saved me hundreds of hours of internet surfing.
fblack61
Netman66
Didn't the replication complete the other day?
ASKER
David Williamson
I'm sorry, I am speaking in reference to Server3! I wanted to add it to the DFS root (having previously removed it), but the frs-staging folder filled up the C drive, causing the server to act 'werid', not printing, not responding to IIS stuff, etc. I was looking for a way to move the staging folder to the drive that has enough space, or a way to pre-populate the shared folder, ie, restore from backup.
Sorry for the confusion....
It turns out that my attempt to restore from backup and start the process over has failed again. The frs-staging folder has filled up the C drive again, causing the afrementioned issues. Dang.
Netman66
I have to ask this...both Server2 and Server3 are at the same location - correct?
Forget Server3 as a DFS replica - it's not worth the effort since they're both on the same LAN. You can normally bring up a dead server fairly quickly unless it's toast. Failing that, a backup of the DFS folder can be restored manually to Server3 in a crisis.
Get an unlimited membership to EE for less than $4 a week.
Unlimited question asking, solutions, articles and more.
ASKER
David Williamson
Yes, that's correct, they are on the same LAN.
The full restore of all our data that I did to Server3 just recently took over 5 hours. 5.5 hours x 100 people x about $125/hour/person = over $68,000 that we cannot bill to clients for the time it takes to restore all the data. My only goal was to give us some redundancy and immediate failover in the case that our ever-getting-older main fileserver bites it. One thing the boss hates the most is wasted time...
I'm just about to take Irvine off-wire and change its IP....
ASKER
David Williamson
Once I move Irvine in to the Irvine Site, what should the DNS settings on Irvine and on the client machines in irvine be?
Netman66
DNS for Irvine server should be itself with the ISP as a Forwarder.
All clients there should point to Irvine only.
All of life is about relationships, and EE has made a viirtual community a real community. It lifts everyone's boat
William Peck
ASKER
David Williamson
As far as the DNS for Irvine as you mentioned before, since Irvine should update its own DNS entries, does that mean I shouldn't go in and manually update them in Server2's DNS?
ewtaylor
I think if you require 0 downtime then you should look into a active/passive cluster solution. http://www.microsoft.com/technet/prodtechnol/windows2000serv/evaluate/featfunc/clustovw.mspx
ASKER
David Williamson
That would be nice, and actually is where I would like to head. One of the prevailing reasons for that is that I am developing a Cold Fusion based intranet site which will eventually become the nerve center of our business operations, serving up all pertinent data like client info, billing, payroll, timesheets, invoicing, memos, etc. Once its gets to the point where it is indispensible, it would be nice to have a cluster solution so that if one web server goes down, the system will be able to keep on humming.
Get an unlimited membership to EE for less than $4 a week.
Unlimited question asking, solutions, articles and more.
Netman66
Irvine should - in the perfect world.
You can let it try and just monitor and confirm it has or has not. At least you know what to look for now~!~
Clustering is an idea, but keep in mind you need the Enterprise versions of the OS (either W2K Adv. Server or 2003 Enterprise) to cluster without a third party tool.
Also, in clustering you'll need a shared data array - something I was hinting at earlier. You could certainly start there.
ASKER
David Williamson
What kind of device is a shared data array? Is is a SCSI kind of thing, or a NAS kind of thing? Are there any performance issues?
ewtaylor
The one I have is a shared scsi bus that connects to both computers. They then run a continous ping on the second private NIC if no reply the software will fail the control of the scsi array to the other inactive cluster and activate it. I was running this with windows nt 4.0 mscs 1.0 and had to work out a few bugs, I was actually running it on a file server and had another one running for exchange and after getting the initial bugs worked out they worked really well. Windows 2k and 2k3 both have clustering technology built into it (from advanced server up).
Experts Exchange is like having an extremely knowledgeable team sitting and waiting for your call. Couldn't do my job half as well as I do without it!
James Murphy
ASKER
David Williamson
ok, Irvine is up and running. I have NetSupport access to it on it new IP 192.168.111.2. What should I check first? Shall I do the Sysvol/scripts test you mentioned first, or should I wait for Event viewer to give me a 13509?
Netman66
For the shared storage - we have a Fibre channel SAN with a dedicated fibre switch - but you don't need to go that high end.
You'll definitely need to use a SAN that is capable of being access from two servers.
Now, with respect to the testing - do the SYSVOL test to make sure the AD replication is happening. Also, try creating a user from Irvine and see if it replicates to Server2.
Netman66
Check DNS on Server2 for Irvine and check Irvine's DNS for Irvine.
Get an unlimited membership to EE for less than $4 a week.
Unlimited question asking, solutions, articles and more.
ASKER
David Williamson
I have checked the DNS on both, and they both reflect the correct addresses. I created a text document in the winnt\sysvol\sysvol\wse.com\scripts. Repadmiin /showreps shows that replication inbound from server2 was good:
C:\Documents and Settings\Administrator.WSE>repadmin /showreps
Irvine\IRVINE
DC Options: IS_GC
Site Options: (none)
DC object GUID: 51f814c3-f364-482a-8553-72a476a41261
DC invocationID: ba8b3fc4-dd78-4614-8bf1-0e933e7450e5
==== INBOUND NEIGHBORS ======================================
DC=wse,DC=com
Vegas\SERVER2 via RPC
DC object GUID: 6233f4eb-40c9-47a7-9096-2f1e88d0c8b1
Last attempt @ 2004-03-30 12:13:47 was successful.
CN=Configuration,DC=wse,DC=com
Vegas\SERVER2 via RPC
DC object GUID: 6233f4eb-40c9-47a7-9096-2f1e88d0c8b1
Last attempt @ 2004-03-30 12:13:47 was successful.
CN=Schema,CN=Configuration,DC=wse,DC=com
Vegas\SERVER2 via RPC
DC object GUID: 6233f4eb-40c9-47a7-9096-2f1e88d0c8b1
Last attempt @ 2004-03-30 12:13:47 was successful.
But, the file (which was there before then) did not appear on Irvine in the same location. What do you think?
ASKER
David Williamson
I created a user on Irvine, which did eventually appear on Server2, but it took a couple of cycles. Still no test files in sysvol appearing on Irvine.
Irvine's event viewer just came up with a couple of 13508's, one for sysvol, and one for datastore
ASKER
David Williamson
Looks like the hosts file was the culprit. I remembered that we added entries for all the servers hosts files, so I went back into them and corrected them. The files in Server2's sysvol ended up on Irvine. I put a file in Datastore on Irvine, and it showed up on Server2. Things are looking good, but there are still a couple of things that I'm not sure of:
1) The ghost IrvineServer still comes up when I do repadmin /showreps from Server2 only.
2) In Sites and Services, should there be two connections showing in NTDS for all three servers? That is NOT the case currently.
Under Server2 there is a connection to Server3;
under Irvine there is a connection to Server2;
under Server3 there is a connection to Irvine AND a connection to Server2. That seems strange...
3) I have the replication interval set to 15 minutes. Does that mean that replication begins every 15 minutes and keeps going until it has caught up with all files that need replicating? Or does it mean that it checks every 15 minutes and only replicates for the next 15 minutes?
4) We went through so much so quickly, I can't remember if there is something else I can check, or even where some of the tools were. Part of our interaction, Netman66, was via Netsupport chat, which did not get recorded. What do you think?
This is the best money I have ever spent. I cannot not tell you how many times these folks have saved my bacon. I learn so much from the contributors.
rwheeler23
ASKER CERTIFIED SOLUTION
Netman66
Log in or sign up to see answer
Become an EE member today7-DAY FREE TRIAL
Members can start a 7-Day Free trial then enjoy unlimited access to the platform
Sign up - Free for 7 days
or
Learn why we charge membership fees
We get it - no one likes a content blocker. Take one extra minute and find out why we block content.
See how we're fighting big data
Not exactly the question you had in mind?
Sign up for an EE membership and get your own personalized solution. With an EE membership, you can ask unlimited troubleshooting, research, or opinion questions.
ask a question
ewtaylor
Great job netman66, I learned a lot following these threads. Thanks to both of you.
ASKER
David Williamson
Is it your opinion that I need to extend the interval beyond 15 minutes?
By the way, I have had several people come up to me this morning telling me that 'the file they worked all day on and saved before leaving work yesterday' did not have all the changes on it that they made. Their changes were not saved somehow. I didn't fix the hosts file until about 9 pm, after which I noticed that the replication started working. Could replication have taken taken the older file on Irvine and overwrote the one on Server2? Isn't replication supposed to move last-saved, or most recently changed files--last writer wins? Or is there some kind of priority setting that needs to be adjusted? If I check the replication topology on Irvine, it says 'full mesh'. I assume that that means that the most recent file from anywhere gets replicated everywhere, right?
I was able to restore these couple files from the backup last night, which happens at 8 pm. I fixed the hosts file at 9 pm....seems fishy...
I wonder how many other people today will be coming up to me saying that their files didn't get saved somehow.
Could this just be some 'settling in' that AD and FRS have to do before their in good sync?
ASKER
David Williamson
I just looked in the event viewer and saw event 13503, that FRS had stopped, and so, I went into services and started it. Then came up 13521, which says:
________________________________________________________
The File Replication Service cannot enable replication on the comptuer SERVER2 until a backup/restore application completes.
A backup/restore application has set a registry key that prevents the File Replication Service from starting until the registry key is deleted or the system is rebooted.
The backup/restore application may still be running. Check with your local administrator before proceeding further.
The computer can be rebooted by clicking on Start, Shutdown, and selecting Restart.
WARNING - DELETING THE REGISTRY KEY IS NOT RECOMMENDED! Applications may fail in unexpected ways.
The registry key can be deleted by running regedit.
Click on Start, Run, and type regedit.
Expand HKEY_LOCAL_MACHINE, SYSTEM, CurrentControlSet, Services, NtFrs, Parameters, Backup/Restore,"Stop NtFrs from Starting". On the toolbar, click on Edit and select Delete. Be careful! Deleting a key other than "Stop NtFrs From Starting" can have unexpected sideeffects.
___________________________________________________________________________________________________
There are no backups currently running, only scheduled for later tonight. I did, however, just restore a couple of files (as I mentioned above), but those have been done for a while. Uh....help? We are using Backup Exec 9.
Get an unlimited membership to EE for less than $4 a week.
Unlimited question asking, solutions, articles and more.
Netman66
The Restore is likely what set the key so that replication won't continually change files during the backup state.
This should clear itself. I would certainly watch it. If it doesn't clear then fix the key - but I think it should.
It terms of replication - if the file was saved into a rep partner with a lower USN - which in all likelihood couldn't happen, then during replication it would get overwritten by the USN with the higher number. Windows is "supposed" to prevent this kind of thing.
Full Mesh is a great sign - it means KCC has reconfigured the topology and it has converged.
ASKER
David Williamson
Full Mesh is how I set it up to begin with, actually.
So, how can I avoid this problem in the future? Is there a way? I have a steady stream of people coming to me about files. I'm wondering if I restore them if they will be restored with the same USN value; will I then have the same problem just happen again? At the moment, FRS is not running, presumably because of all the restores I'm doing.
ASKER
David Williamson
No sign of that registry key being removed yet. I wonder how long I should wait before deleting it?
Experts Exchange has (a) saved my job multiple times, (b) saved me hours, days, and even weeks of work, and often (c) makes me look like a superhero! This place is MAGIC!
Walt Forbes
ASKER
David Williamson
Ok. Things are getting weird. This whole replication thing seems way too unpredictable/unstable/unmonitorable. I had to restart Server2 because an update installer I ran caused the system to freeze. It took over 20 minutes, but I let it restart by itself. When it came up, FRS started again, but then moved some of the folders out of DataStore into the 'pre-existing' folder, making them inaccessible to my users, of course.
I don't get it! I thought the replication was done with Irvine before it left the building? I CANNOT have DFS moving my files/folders around!!! This is killing me!! Is there anything I can do, any decent monitoring tool that will show me EXACTLY what is happening, a list of files that are being compared with USN numbers, files that are about to be replicated to and from where and when, etc? All of this seems way too out of my ability to control and monitor...
Its starting to feel like I'm either in way over my head or I need to consider switching to another OS...(feeling exasperated!)
Netman66
Take a deep breath and count to ten..........
Replication needs to be configured for every hour or two - 15 minutes is too short.
FRS is likely choking on the whole restructure thing.
I think you'll need to reconfigure DFS from scratch. Take the time to set up things correctly and prestage the data from what is already there.
Use the documents we looked at earlier and see if you can find a TechNet article that steps you through the setup from the start.
Personally, 120GB over the WAN is a big deal for anyone. However, technically, it should work.
Post some netdiag /v and dcdiag logs for me or send them to work so I can look at them.
It probably wouldn't hurt to do those large logs for me too.
ASKER
David Williamson
Thank you for your words of wisdom...
I think you're right, I will tear down the DFS root and recreate it, letting it run over the weekend. I've been doing some hardware and software updates and such on Server2 tonight, and it seems that everytime I restart, DFS moves files into the pre-existing folder. It seems as if its almost starting all over with every restart.
Also, that registry key that prevents FRS from starting never did get removed automatically. I am going to call Veritas and ask them about that; perhaps they know something about it.
I've also been thinking that there has to be a better plan than this; there has to be a better way to accomplish the kind of data availability that we're trying to achieve. Perhaps we need to break up the data into groups and decide what reduce it to the bare minimum?
--I have deleted the DFS root. I will send you the logs you have requested.
What do you think about upgrading server2 & 3 to 2003 Standard? I mentioned it to the boss and he went for it. It would be nice if our DFS issues got better, but I also want to stay up-to-date. 2000 server is now 4 years old. What do you think?
Get an unlimited membership to EE for less than $4 a week.
Unlimited question asking, solutions, articles and more.
Netman66
Good idea.
I also think you need to determine what data needs to be where. Shared data is fine to have accessed across the WAN depending on the size. We run an entire Province (think State) from one location - so, it's possible.
You really should look at a fibre-channel SAN - it's not cheap, but if you move that kind of data then purchasing one is inevitable.
|
{
"url": "https://www.experts-exchange.com/questions/20935398/DFS-and-remote-sites-part-II.html",
"source_domain": "www.experts-exchange.com",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "269022",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YSAUE6AHGXA7IAIVZTLOB22AHIESNPBR",
"WARC-Concurrent-To": "<urn:uuid:3d461cd7-ff95-4e48-9471-8614528e17a4>",
"WARC-Date": "2022-09-26T15:54:28Z",
"WARC-IP-Address": "172.67.36.241",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MW6KUE25KQ2KDPNJWP6AIR2PA4EQT24A",
"WARC-Record-ID": "<urn:uuid:920961b3-b2e0-458d-a277-b5a1122bcbca>",
"WARC-Target-URI": "https://www.experts-exchange.com/questions/20935398/DFS-and-remote-sites-part-II.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5d7d41c7-2ec1-4f1f-a44f-7349877bb1cd>"
},
"warc_info": "isPartOf: CC-MAIN-2022-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-120\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
27,
86,
87,
118,
119,
239,
241,
428,
448,
449,
469,
482,
491,
492,
508,
517,
518,
544,
553,
554,
586,
587,
859,
860,
866,
883,
884,
1207,
1269,
1278,
1287,
1288,
1335,
1336,
1342,
1359,
1360,
1768,
1769,
1797,
1798,
1993,
2002,
2003,
2085,
2086,
2348,
2349,
2408,
2465,
2471,
2488,
2489,
2538,
2539,
2956,
2957,
3018,
3024,
3041,
3042,
3164,
3173,
3174,
3242,
3243,
3290,
3291,
3292,
3408,
3421,
3427,
3444,
3445,
3623,
3632,
3633,
3822,
3828,
3845,
3846,
4363,
4422,
4479,
4488,
4489,
4527,
4528,
4638,
4639,
4805,
4806,
4930,
4931,
4937,
4954,
4955,
5087,
5096,
5097,
5662,
5813,
5826,
5832,
5849,
5850,
6080,
6089,
6090,
6215,
6216,
6302,
6303,
6304,
6480,
6481,
6490,
6491,
6558,
6559,
6618,
6675,
6681,
6698,
6699,
6922,
6923,
6986,
7000,
7018,
7039,
7092,
7146,
7147,
7209,
7210,
7224,
7250,
7311,
7370,
7371,
7402,
7428,
7489,
7548,
7549,
7590,
7616,
7677,
7736,
7737,
7848,
7854,
7871,
7872,
8024,
8025,
8124,
8130,
8147,
8148,
8511,
8512,
8601,
8602,
8734,
8786,
8837,
8939,
8940,
9223,
9224,
9467,
9618,
9629,
9654,
9663,
9664,
9696,
9738,
9819,
9845,
9848,
9884,
9985,
10017,
10059,
10222,
10237,
10246,
10247,
10331,
10337,
10354,
10355,
10428,
10429,
11214,
11215,
11357,
11358,
11469,
11470,
11564,
11570,
11587,
11588,
11743,
11800,
11801,
11926,
11928,
12098,
12100,
12216,
12218,
12302,
12304,
12402,
12404,
12456,
12458,
12497,
12499,
12772,
12872,
12873,
13099,
13158,
13215,
13224,
13225,
13340,
13341,
13459,
13460,
13725,
13726,
13819,
13820,
13826,
13843,
13844,
13900,
13901,
14248,
14254,
14271,
14272,
14373,
14544,
14556,
14562,
14579,
14580,
15010,
15011,
15479,
15480,
15609,
15618,
15619,
15665,
15666,
15750,
15751,
15805,
15806,
15953,
15954,
16084,
16085,
16086,
16182,
16183,
16271,
16272,
16333,
16334,
16340,
16357,
16358,
16396,
16397,
16730,
16731,
16915,
16916,
17186,
17187,
17264,
17265,
17514,
17515,
17574,
17631,
17640,
17641,
17652,
17653,
17873,
17874
],
"line_end_idx": [
27,
86,
87,
118,
119,
239,
241,
428,
448,
449,
469,
482,
491,
492,
508,
517,
518,
544,
553,
554,
586,
587,
859,
860,
866,
883,
884,
1207,
1269,
1278,
1287,
1288,
1335,
1336,
1342,
1359,
1360,
1768,
1769,
1797,
1798,
1993,
2002,
2003,
2085,
2086,
2348,
2349,
2408,
2465,
2471,
2488,
2489,
2538,
2539,
2956,
2957,
3018,
3024,
3041,
3042,
3164,
3173,
3174,
3242,
3243,
3290,
3291,
3292,
3408,
3421,
3427,
3444,
3445,
3623,
3632,
3633,
3822,
3828,
3845,
3846,
4363,
4422,
4479,
4488,
4489,
4527,
4528,
4638,
4639,
4805,
4806,
4930,
4931,
4937,
4954,
4955,
5087,
5096,
5097,
5662,
5813,
5826,
5832,
5849,
5850,
6080,
6089,
6090,
6215,
6216,
6302,
6303,
6304,
6480,
6481,
6490,
6491,
6558,
6559,
6618,
6675,
6681,
6698,
6699,
6922,
6923,
6986,
7000,
7018,
7039,
7092,
7146,
7147,
7209,
7210,
7224,
7250,
7311,
7370,
7371,
7402,
7428,
7489,
7548,
7549,
7590,
7616,
7677,
7736,
7737,
7848,
7854,
7871,
7872,
8024,
8025,
8124,
8130,
8147,
8148,
8511,
8512,
8601,
8602,
8734,
8786,
8837,
8939,
8940,
9223,
9224,
9467,
9618,
9629,
9654,
9663,
9664,
9696,
9738,
9819,
9845,
9848,
9884,
9985,
10017,
10059,
10222,
10237,
10246,
10247,
10331,
10337,
10354,
10355,
10428,
10429,
11214,
11215,
11357,
11358,
11469,
11470,
11564,
11570,
11587,
11588,
11743,
11800,
11801,
11926,
11928,
12098,
12100,
12216,
12218,
12302,
12304,
12402,
12404,
12456,
12458,
12497,
12499,
12772,
12872,
12873,
13099,
13158,
13215,
13224,
13225,
13340,
13341,
13459,
13460,
13725,
13726,
13819,
13820,
13826,
13843,
13844,
13900,
13901,
14248,
14254,
14271,
14272,
14373,
14544,
14556,
14562,
14579,
14580,
15010,
15011,
15479,
15480,
15609,
15618,
15619,
15665,
15666,
15750,
15751,
15805,
15806,
15953,
15954,
16084,
16085,
16086,
16182,
16183,
16271,
16272,
16333,
16334,
16340,
16357,
16358,
16396,
16397,
16730,
16731,
16915,
16916,
17186,
17187,
17264,
17265,
17514,
17515,
17574,
17631,
17640,
17641,
17652,
17653,
17873,
17874,
18006
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 18006,
"ccnet_original_nlines": 302,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42237016558647156,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.060186419636011124,
"rps_doc_frac_lines_end_with_ellipsis": 0.029702970758080482,
"rps_doc_frac_no_alph_words": 0.17363515496253967,
"rps_doc_frac_unique_words": 0.2963455021381378,
"rps_doc_mean_word_length": 4.602325439453125,
"rps_doc_num_sentences": 214,
"rps_doc_symbol_to_word_ratio": 0.004260989837348461,
"rps_doc_unigram_entropy": 5.884941577911377,
"rps_doc_word_count": 3010,
"rps_doc_frac_chars_dupe_10grams": 0.059481699019670486,
"rps_doc_frac_chars_dupe_5grams": 0.06901031732559204,
"rps_doc_frac_chars_dupe_6grams": 0.06222479045391083,
"rps_doc_frac_chars_dupe_7grams": 0.059481699019670486,
"rps_doc_frac_chars_dupe_8grams": 0.059481699019670486,
"rps_doc_frac_chars_dupe_9grams": 0.059481699019670486,
"rps_doc_frac_chars_top_2gram": 0.019490359351038933,
"rps_doc_frac_chars_top_3gram": 0.02454341948032379,
"rps_doc_frac_chars_top_4gram": 0.008662380278110504,
"rps_doc_books_importance": -1594.0511474609375,
"rps_doc_books_importance_length_correction": -1594.0511474609375,
"rps_doc_openwebtext_importance": -1034.676513671875,
"rps_doc_openwebtext_importance_length_correction": -1034.676513671875,
"rps_doc_wikipedia_importance": -689.3817138671875,
"rps_doc_wikipedia_importance_length_correction": -689.3817138671875
},
"fasttext": {
"dclm": 0.02818543091416359,
"english": 0.9478788375854492,
"fineweb_edu_approx": 1.2124191522598267,
"eai_general_math": 0.20468270778656006,
"eai_open_web_math": 0.2953300476074219,
"eai_web_code": 0.10508847236633301
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-8,177,581,850,856,902,000 |
PHP Namespaces
Posted by – October 26, 2008
I have been seeing alot of complaining lately regarding PHP namespaces, and I thought I would chime in with my (often opposing) views. First off, let me explain the issue.
The new version of PHP will have a new feature, called namespaces. (I wrote about it in my post”PHP 5.3 Feature Preview“. This is a great featured, and one that the community as a whole is excited about. So what is the problem, then?
Well initially PHP was going to use the standard “::” syntax to invoke the namespace. For example:
namespace Foo;
function bar() {
echo "Namespace Foo";
}
Foo::bar();
However, this became a problem for the parsing engine, as it is the same way to call a static function.
class Foo{
static function bar(){
echo "Class Foo";
}
}
Foo::bar();
So instead, PHP changed the syntax to a blackslash. So now, in the first example, you have ‘Foo\bar();’ while in the second, you still have ‘Foo::bar();’ Seems reasonable to me (and the PHP core members) but not to some.
For example, Ninh complains on his blog that if you put the invocation in double quotes, it will interpret things like “\t” as a tab, and that you have to use 2 backslashes. I really don’t see this being a problem. First off, why on earth would you use double quotes? There are no variables or single quotes being used in the string, so one should be using single quotes anyways. That is just good programming practice.
Even if you do use double quotes, there is a tried and true, standard solution to escape the backslash character. It is so obiquitous, that Ninh didn’t have to learn how to use it, he already knew about it, yet is still complaining. His problem with this method? “It looks like crap”. I’m sorry, I though we were using logic to code web applications, not painting a picture. And even at that, why does “::” look awesome, but “\\” look like crap? I don’t get it.
My favorite quote if from the very end of his post. He claims “Last time I checked, the world wasn’t filled with scrawny developers that would come crying to their mommies after getting their first facepalm of ‘AmbiguousInvocationError’.” And yet he is crying to his mommy (or rather, the blogosphere) because if he uses double quotes (which he doesn’t have to) then he has to escape the backslash character (a standard practice) and that’s “ugly”.
So what are your thoughts? Maybe I’m crazy, and this is a huge deal. I just don’t see it.
6 Comments on PHP Namespaces
1. Ninh says:
Maybe I’ve not made myself clear enough in my blog post. You see, aesthetics aside, I’d rather have them use a way to denote a namespace separator in a way that is commonly used in other programming languages. This makes it easier to read or learn PHP if you’re already familiar with other languages who use the same notation. With this train of thought, a dot would’ve been perfectly fine by me as well. Unfortunately, this is already being used in PHP for string concatenation in the parse rule: “String DOT String”.
This is the same reason why I have problems with using the backslash as a namespace seperator seeing as programmers will be more likely to associate it with escaping. This also makes it harder imho to learn a language.
Not only that, let’s not forget that if you ever were to instantiate your classes through strings via factory method (which is frowned upon by some to begin with), http://loveandtheft.org/2008/10/26/set-sail-for-fail-php-namespaces/ elaborates on some of the issues you’ll have to deal with as well. For instance, in case you write “foo\tBar”, which is valid PHP code, while trying to say namespace foo and member tBar, you’ll get erroneous behaviour that is easily overlooked. Even an IDE wouldn’t be able to save you in such a situation.
Aesthetics aside, there are plenty of other reasons why I’m complaining here. I hope people don’t forget to read that as well.
2. Boris says:
the real problem is that the PHP language masters didn’t just do the right thing and deprecate the use of “::” for static functions. at some point you have to move the language forward, and keep it consistent and beautiful. but, the PHP people chose to instead put an ugly hack in to try to get the best of both worlds. this *is* PHP we’re talking about here – is anyone really surprised?
3. Nick Ashley says:
Boris – if they deprecate “::” for static functions, what would they replace it with? There would have to be some other syntax for static functions, unless your suggestion is to remove static functions from the language.
Nimh – I kind of understand where you are coming from with keeping a familiar syntax across languages, but don’t know how much weight I would put on that. If every programming language had the same syntax for everything, except PHP was the odd man out, then you would definitely have a point. However every language has there own way to do things like string concatenation, testing equality, or ending statements. Adding namespacing to the mix isn’t that big of a deal IMHO.
I feel that it would be even harder to learn the language when syntax means two different things. People would be confused saying “I thought that was how you accessed a static function, not a namespace!”. With the backslash, you have a standard way to do everything. Also, I feel you SHOULD be using single quotes, thus eliminating the escaping issue. However, the escaping is a standard way to do things when working with double quotes as well. Why would this confuse them?
4. I find the backslash horribly ugly as well. Sure, that doesn’t mean it won’t work but a in a discussion about naming conventions it’s often less about what works than what seems orderly and sensible because with few precautions anything works.
5. Nick Ashley says:
I guess I am just surprised that a (arguably) slightly uglier solution which works in all situations isn’t favored over a (arguably) better looking solution that doesn’t. Sure, many will say it is bad practice to name a static function inside a class the same as a different class in a namespace. However the whole point of namespacing is to allow code from multiple sources to play nice together. Of course a single programmer utilizing only his own code wouldn’t run into any problems with ‘::’, but from what I understand, someone utilizing classes from many sources could run into this problem. Remember that for better or worse, PHP is the language of choice for many copy and paste coders, and I think that is a relevant fact.
6. James says:
Double colon is not much better, and harder to type.
Also looks terrible at the start of a line:
::Foo::bar();
I’d have loved to see the dot being used, but that isn’t feasible, so backslash is a satisfactory alternative.
Leave a Reply to Ninh Cancel reply
Your email address will not be published. Required fields are marked *
You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>
|
{
"url": "http://agilewebmasters.com/nick/php-namespaces/?replytocom=2414",
"source_domain": "agilewebmasters.com",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "26626",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:R6LFG7N2MFR77NVPUHVF64T6DZVFB3D6",
"WARC-Concurrent-To": "<urn:uuid:8f271b09-aa0f-4b22-b521-c6b3d45776b7>",
"WARC-Date": "2020-10-23T02:26:34Z",
"WARC-IP-Address": "45.56.73.83",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3BY4C5EDXNZL3AHZJEGDI67XJ5OMRMA3",
"WARC-Record-ID": "<urn:uuid:46da19d8-e648-4ad2-aa27-1ca1d87759da>",
"WARC-Target-URI": "http://agilewebmasters.com/nick/php-namespaces/?replytocom=2414",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:11ea365f-e3dc-4372-8f6c-9ba761699272>"
},
"warc_info": "isPartOf: CC-MAIN-2020-45\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-47.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
15,
16,
45,
46,
218,
219,
453,
454,
553,
554,
555,
570,
590,
618,
623,
638,
639,
743,
744,
755,
781,
805,
810,
812,
824,
825,
1046,
1047,
1467,
1468,
1930,
1931,
2380,
2381,
2471,
2472,
2501,
2502,
2518,
2519,
3042,
3043,
3266,
3267,
3811,
3812,
3943,
3944,
3961,
3962,
4355,
4356,
4379,
4380,
4605,
4606,
5085,
5086,
5565,
5566,
5815,
5816,
5839,
5840,
6577,
6578,
6595,
6596,
6653,
6654,
6702,
6703,
6721,
6722,
6837,
6838,
6873,
6874,
6945,
6946
],
"line_end_idx": [
15,
16,
45,
46,
218,
219,
453,
454,
553,
554,
555,
570,
590,
618,
623,
638,
639,
743,
744,
755,
781,
805,
810,
812,
824,
825,
1046,
1047,
1467,
1468,
1930,
1931,
2380,
2381,
2471,
2472,
2501,
2502,
2518,
2519,
3042,
3043,
3266,
3267,
3811,
3812,
3943,
3944,
3961,
3962,
4355,
4356,
4379,
4380,
4605,
4606,
5085,
5086,
5565,
5566,
5815,
5816,
5839,
5840,
6577,
6578,
6595,
6596,
6653,
6654,
6702,
6703,
6721,
6722,
6837,
6838,
6873,
6874,
6945,
6946,
7141
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7141,
"ccnet_original_nlines": 80,
"rps_doc_curly_bracket": 0.0008402200182899833,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.45136186480522156,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.031128399074077606,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1906614750623703,
"rps_doc_frac_unique_words": 0.3908421993255615,
"rps_doc_mean_word_length": 4.49959135055542,
"rps_doc_num_sentences": 75,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.553938388824463,
"rps_doc_word_count": 1223,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.025440670549869537,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.00327093992382288,
"rps_doc_frac_chars_top_3gram": 0.008177359588444233,
"rps_doc_frac_chars_top_4gram": 0.00726875988766551,
"rps_doc_books_importance": -753.2481689453125,
"rps_doc_books_importance_length_correction": -753.2481689453125,
"rps_doc_openwebtext_importance": -419.6599426269531,
"rps_doc_openwebtext_importance_length_correction": -419.6599426269531,
"rps_doc_wikipedia_importance": -252.88441467285156,
"rps_doc_wikipedia_importance_length_correction": -252.88441467285156
},
"fasttext": {
"dclm": 0.05353271961212158,
"english": 0.949641227722168,
"fineweb_edu_approx": 1.9373637437820435,
"eai_general_math": 0.6271491646766663,
"eai_open_web_math": 0.30759793519973755,
"eai_web_code": 0.0441475510597229
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
8,883,540,150,286,556,000 |
GNU.WIKI: The GNU/Linux Knowledge Base
[HOME] [PHP Manual] [HowTo] [ABS] [MAN1] [MAN2] [MAN3] [MAN4] [MAN5] [MAN6] [MAN7] [MAN8] [MAN9]
[0-9] [Aa] [Bb] [Cc] [Dd] [Ee] [Ff] [Gg] [Hh] [Ii] [Jj] [Kk] [Ll] [Mm] [Nn] [Oo] [Pp] [Qq] [Rr] [Ss] [Tt] [Uu] [Vv] [Ww] [Xx] [Yy] [Zz]
NAME
toupper, tolower, toupper_l, tolower_l - convert uppercase or lowercase
SYNOPSIS
#include <ctype.h>
int toupper(int c);
int tolower(int c);
int toupper_l(int c, locale_t locale);
int tolower_l(int c, locale_t locale);
Feature Test Macro Requirements for glibc (see feature_test_macros(7)):
toupper_l(), tolower_l():
Since glibc 2.10:
_XOPEN_SOURCE >= 700
Before glibc 2.10:
_GNU_SOURCE
DESCRIPTION
These functions convert lowercase letters to uppercase, and vice versa.
If c is a lowercase letter, toupper() returns its uppercase equivalent,
if an uppercase representation exists in the current locale.
Otherwise, it returns c. The toupper_l() function performs the same
task, but uses the locale referred to by the locale handle locale.
If c is a uppercase letter, tolower() returns its lowercase equivalent,
if a lowercase representation exists in the current locale. Otherwise,
it returns c. The tolower_l() function performs the same task, but
uses the locale referred to by the locale handle locale.
If c is neither an unsigned char value nor EOF, the behavior of these
functions is undefined.
The behavior of toupper_l() and tolower_l() is undefined if locale is
the special locale object LC_GLOBAL_LOCALE (see duplocale(3)) or is not
a valid locale object handle.
RETURN VALUE
The value returned is that of the converted letter, or c if the
conversion was not possible.
ATTRIBUTES
Multithreading (see pthreads(7))
The toupper() and tolower() functions are thread-safe with exceptions.
These functions can be safely used in multithreaded applications, as
long as setlocale(3) is not called to change the locale during their
execution.
CONFORMING TO
toupper(), tolower(): C89, C99, 4.3BSD, POSIX.1-2001, POSIX.1-2008.
toupper_l(), tolower_l(): POSIX.1-2008.
NOTES
The details of what constitutes an uppercase or lowercase letter depend
on the locale. For example, the default "C" locale does not know about
umlauts, so no conversion is done for them.
In some non-English locales, there are lowercase letters with no
corresponding uppercase equivalent; the German sharp s is one example.
SEE ALSO
isalpha(3), newlocale(3), setlocale(3), uselocale(3), towlower(3),
towupper(3), locale(7)
COLOPHON
This page is part of release 3.65 of the Linux man-pages project. A
description of the project, and information about reporting bugs, can
be found at http://www.kernel.org/doc/man-pages/.
All copyrights belong to their respective owners. Other content (c) 2014-2018, GNU.WIKI. Please report site errors to [email protected].
Page load time: 0.115 seconds. Last modified: November 04 2018 12:49:43.
|
{
"url": "http://gnu.wiki/man3/tolower.3.php",
"source_domain": "gnu.wiki",
"snapshot_id": "crawl=CC-MAIN-2020-34",
"warc_metadata": {
"Content-Length": "14486",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VPAMMZ2OY2DPOA3S74VLICEF22BZZ5NO",
"WARC-Concurrent-To": "<urn:uuid:d8d88849-6054-46fa-9400-d289f881cf89>",
"WARC-Date": "2020-08-13T12:17:06Z",
"WARC-IP-Address": "74.95.156.189",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IPYWWDGQCIB335QFRUEG773PCIXNMAM6",
"WARC-Record-ID": "<urn:uuid:122adc64-f550-460b-ad64-2d732f615fea>",
"WARC-Target-URI": "http://gnu.wiki/man3/tolower.3.php",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:97ebd93a-fe74-40c6-b307-06bb711984c2>"
},
"warc_info": "isPartOf: CC-MAIN-2020-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-25.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
41,
42,
141,
142,
280,
281,
282,
287,
288,
367,
368,
377,
378,
404,
405,
432,
459,
460,
506,
552,
553,
628,
629,
662,
691,
730,
760,
790,
791,
803,
804,
883,
884,
963,
1042,
1121,
1195,
1196,
1275,
1354,
1433,
1497,
1498,
1577,
1608,
1609,
1688,
1767,
1804,
1805,
1818,
1819,
1898,
1934,
1935,
1946,
1947,
1983,
2062,
2141,
2220,
2238,
2239,
2253,
2254,
2329,
2330,
2377,
2378,
2384,
2385,
2464,
2543,
2594,
2595,
2674,
2752,
2753,
2762,
2763,
2842,
2872,
2873,
2882,
2883,
2962,
3041,
3098,
3099,
3100,
3101,
3241
],
"line_end_idx": [
41,
42,
141,
142,
280,
281,
282,
287,
288,
367,
368,
377,
378,
404,
405,
432,
459,
460,
506,
552,
553,
628,
629,
662,
691,
730,
760,
790,
791,
803,
804,
883,
884,
963,
1042,
1121,
1195,
1196,
1275,
1354,
1433,
1497,
1498,
1577,
1608,
1609,
1688,
1767,
1804,
1805,
1818,
1819,
1898,
1934,
1935,
1946,
1947,
1983,
2062,
2141,
2220,
2238,
2239,
2253,
2254,
2329,
2330,
2377,
2378,
2384,
2385,
2464,
2543,
2594,
2595,
2674,
2752,
2753,
2762,
2763,
2842,
2872,
2873,
2882,
2883,
2962,
3041,
3098,
3099,
3100,
3101,
3241,
3313
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3313,
"ccnet_original_nlines": 92,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.20437955856323242,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05985400825738907,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.37810218334198,
"rps_doc_frac_unique_words": 0.5515587329864502,
"rps_doc_mean_word_length": 5.2134294509887695,
"rps_doc_num_sentences": 38,
"rps_doc_symbol_to_word_ratio": 0.0014598499983549118,
"rps_doc_unigram_entropy": 5.044884204864502,
"rps_doc_word_count": 417,
"rps_doc_frac_chars_dupe_10grams": 0.12971481680870056,
"rps_doc_frac_chars_dupe_5grams": 0.12971481680870056,
"rps_doc_frac_chars_dupe_6grams": 0.12971481680870056,
"rps_doc_frac_chars_dupe_7grams": 0.12971481680870056,
"rps_doc_frac_chars_dupe_8grams": 0.12971481680870056,
"rps_doc_frac_chars_dupe_9grams": 0.12971481680870056,
"rps_doc_frac_chars_top_2gram": 0.02483901008963585,
"rps_doc_frac_chars_top_3gram": 0.006899720057845116,
"rps_doc_frac_chars_top_4gram": 0.0055197798646986485,
"rps_doc_books_importance": -330.37518310546875,
"rps_doc_books_importance_length_correction": -330.37518310546875,
"rps_doc_openwebtext_importance": -200.11749267578125,
"rps_doc_openwebtext_importance_length_correction": -200.11749267578125,
"rps_doc_wikipedia_importance": -116.39102172851562,
"rps_doc_wikipedia_importance_length_correction": -116.39102172851562
},
"fasttext": {
"dclm": 0.13798928260803223,
"english": 0.7081900238990784,
"fineweb_edu_approx": 2.9733448028564453,
"eai_general_math": 0.514388382434845,
"eai_open_web_math": 0.32444190979003906,
"eai_web_code": 0.20474296808242798
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.27",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
674,007,566,031,607,000 |
• What version of Sendgrid is used in Chekio?
I solved Welcome Email by SendGrid. Sending a mail was succeeded. After that, I execute it in my docker container, an error occurred. just same as this. I think it's because of difference among sendgrid versions. What version of Sendgrid is used in Chekio? Or How can I investigate version of imported modules?
.
|
{
"url": "https://py.checkio.org/forum/post/13188/what-version-of-sendgrid-is-used-in-chekio/",
"source_domain": "py.checkio.org",
"snapshot_id": "crawl=CC-MAIN-2019-30",
"warc_metadata": {
"Content-Length": "22451",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MLDEO7ZMJLDQXS2UXGVYD5ACEDDOGGWC",
"WARC-Concurrent-To": "<urn:uuid:ccc2d513-fd5b-40ab-9f8f-dd81946df83d>",
"WARC-Date": "2019-07-19T12:32:28Z",
"WARC-IP-Address": "192.241.230.148",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MLORCNSNAEVHCWVAMWFSULT7HGPCXW6E",
"WARC-Record-ID": "<urn:uuid:f2d315f8-3f63-4411-ac28-a9f0f7443c47>",
"WARC-Target-URI": "https://py.checkio.org/forum/post/13188/what-version-of-sendgrid-is-used-in-chekio/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:66d7ca9f-7a4f-4ee1-b0b6-4f50ad687b2a>"
},
"warc_info": "isPartOf: CC-MAIN-2019-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-180-76-105.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
48,
49,
51,
52,
363,
364
],
"line_end_idx": [
48,
49,
51,
52,
363,
364,
365
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 365,
"ccnet_original_nlines": 6,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3733333349227905,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.053333330899477005,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1733333319425583,
"rps_doc_frac_unique_words": 0.725806474685669,
"rps_doc_mean_word_length": 4.5806450843811035,
"rps_doc_num_sentences": 8,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.6630637645721436,
"rps_doc_word_count": 62,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.246478870511055,
"rps_doc_frac_chars_dupe_6grams": 0.246478870511055,
"rps_doc_frac_chars_dupe_7grams": 0.246478870511055,
"rps_doc_frac_chars_dupe_8grams": 0.246478870511055,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.09507042169570923,
"rps_doc_frac_chars_top_3gram": 0.09154929965734482,
"rps_doc_frac_chars_top_4gram": 0.14788731932640076,
"rps_doc_books_importance": -36.96874237060547,
"rps_doc_books_importance_length_correction": -36.96874237060547,
"rps_doc_openwebtext_importance": -15.960466384887695,
"rps_doc_openwebtext_importance_length_correction": -15.960466384887695,
"rps_doc_wikipedia_importance": -14.558024406433105,
"rps_doc_wikipedia_importance_length_correction": -14.558024406433105
},
"fasttext": {
"dclm": 0.12391865253448486,
"english": 0.9678674340248108,
"fineweb_edu_approx": 1.1856684684753418,
"eai_general_math": 0.49431824684143066,
"eai_open_web_math": 0.3017725944519043,
"eai_web_code": 0.0008860200177878141
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-3,792,668,580,033,099,300 |
XMBC 2.14 Beta
x64 Replacement/Alternative to Microsoft's IntelliMouse application.
Forum rules
Please read the forum rules before posting for the first time.
The more information you can provide, the quicker and more accurately someone can help.
NOTE: To reduce spam, new users can not post links or images until they have at least 4 posts.
User avatar
Kukurykus
Fanatic
Posts: 388
Joined: Sat Jul 02, 2016 1:15 pm
Re: XMBC 2.14 Beta
Post by Kukurykus »
I'm glad XMBC got new feature, exactly that I thought up mylef 2 years ago but never mentioned about. Good that someone else did that, because Swap and Copy makes that I don't have to paste to notepad long code lines of Simulated Keys both from each button it was bound to and all layers often few applications they worked together, what by the way could be done wrongly, and then copy everything back to choosen anew proper apps / layers and buttons....
User avatar
phil
Site Admin
Posts: 6702
Joined: Sun Apr 06, 2003 11:12 pm
Re: XMBC 2.14 Beta
Post by phil »
Yes, it is something I should have done when I first introduced layers. But I got there in the end after a little persuasion!
--[ Phil ]--
--[ Administrator & XMBC Author ]--
Logitech G9, Logitech MX518, Microsoft Intellimouse, Trust 16341 BT Mouse
Windows 10 x64, AMD Ryzen 5900x, MSI x570 Tomahawk, 32GB DDR4,
nVidia RTX 2070s, Evo 970 500Gb NVME, 2x2TB WD Black (RAID1)
User avatar
injtsvetkov
Fanatic
Posts: 293
Joined: Mon Jun 06, 2016 8:51 am
Re: XMBC 2.14 Beta
Post by injtsvetkov »
Hi Phil, while testing some things it came to my mind that I can increase the 'Delay between simulated keystrokes' to 2-3 sec to see what exactly is going on but it turned out that the maximum value allowed is 60 ms. Can you make higher limit (e.g. some error messages are showing in excel and I need a few seconds to read them :)) or there are other limitations?
Thank you!
Iliya
HAMA Mirano
Windows 8.1 x64, Intel i5-3230M @ 2.60GHz, 4GB
User avatar
phil
Site Admin
Posts: 6702
Joined: Sun Apr 06, 2003 11:12 pm
Re: XMBC 2.14 Beta
Post by phil »
You can add your own delays with the {wait} and {waitms} tags, so doing this globally seems a liitle pointless (esp. if its just for debugging)?
--[ Phil ]--
--[ Administrator & XMBC Author ]--
Logitech G9, Logitech MX518, Microsoft Intellimouse, Trust 16341 BT Mouse
Windows 10 x64, AMD Ryzen 5900x, MSI x570 Tomahawk, 32GB DDR4,
nVidia RTX 2070s, Evo 970 500Gb NVME, 2x2TB WD Black (RAID1)
User avatar
injtsvetkov
Fanatic
Posts: 293
Joined: Mon Jun 06, 2016 8:51 am
Re: XMBC 2.14 Beta
Post by injtsvetkov »
Yes of course :) that's what I did, but it was quite long sequence of commands in excel and it acted differently each time depending on what is initially selected (or what gets selected during the execution), I even thought that there may be some interference between two chords with the same second button, but I was wrong :P. I ended up dividing it into 2 layers (looping with the same button) to see how each half behaves, so it took about 30 min wrestling (adding/removing and changing multiple delays) while if I could use the global setting I would have sorted it all out in less than 5 min. So I thought that since the option is already there then probably it would be easy to adjust the limit but I am not sure whether that would do some harm to something else or if there are some major limitations that I don't know of, so it's up to you :) but I can assure you that it is definitely not pointless (again if it won't do any harm).
Actually, part of the problem was that when I change the input from Latin to Cyrillic some of the commands didn't get executed, so I had to substitute some commands with others to avoid using letters. For example if I enter Latin characters in 'Simulated keys' when I activate Cyrillic input the characters entered in excel are also Cyrillic and it all becomes a mess. However in certain cases the characters entered in 'Simulated keys' get entered in excel without change regardless of the currently active input. Do you have an idea/advice coz certainly I have to do some more tests to clear the image and to find some kind of pattern and think of a possible workaround.
Greetings!
Iliya
HAMA Mirano
Windows 8.1 x64, Intel i5-3230M @ 2.60GHz, 4GB
User avatar
injtsvetkov
Fanatic
Posts: 293
Joined: Mon Jun 06, 2016 8:51 am
Re: XMBC 2.14 Beta
Post by injtsvetkov »
OK, here is the whole picture, on the left side of the '=' is what's entered in 'Simulated Keys' in XMBC, and on the right side is what gets entered in excel's cell (e.g. Latin letter 'H' corresponds to Cyrillic letter 'X'):
Active input: English (United States)
Capital Cyrillic letter = Capital Cyrillic letter (X = X)
Lowercase Cyrillic letter = Lowercase Cyrillic letter (x = x)
Capital Latin letter = Lowercase Latin letter (H = h)
Lowercase Latin letter = Lowercase Latin letter (h = h)
Active input: Bulgarian (Phonetic Traditional):
Capital Cyrillic letter = Capital Cyrillic letter (X = X)
Lowercase Cyrillic letter = Lowercase Cyrillic letter (x = x)
Capital Latin letter = Lowercase Cyrillic letter (H = x)
Lowercase Latin letter = Lowercase Cyrillic letter (h = x)
Seems that the Cyrillic characters are always entered in excel as they are in XMBC regardless of the active input, however the Latin characters depend on the currently active input. Maybe someone else who uses different input has also reported that, sorry if so. Anyway I think I have some clue about why that's happening but it's too fuzzy and I can't explain it. I'll try if I must but I think you would know better. The only suggestion that I can think of at the moment is adding a tag that would send the characters exactly how they are entered in XMBC regardless of the case and the active input (like the Cyrillic characters). Hopefully you could find better/global solution :)
The only workaround I found is setting specific hot key for English input (e.g. Ctrl+Shift+9) and entering it before the sequence in 'Simulated Keys' so it will always change to English before executing the sequence.
Greetings!
Iliya
HAMA Mirano
Windows 8.1 x64, Intel i5-3230M @ 2.60GHz, 4GB
User avatar
phil
Site Admin
Posts: 6702
Joined: Sun Apr 06, 2003 11:12 pm
Re: XMBC 2.14 Beta
Post by phil »
Sorry, I haven't got a clue. It does not help that I only have an English keyboard and don't know any other languages. All I do know is that the multi-language thing is a pain in the a** and clearly I still haven't got it right :(
Not sure what more I can do though.
--[ Phil ]--
--[ Administrator & XMBC Author ]--
Logitech G9, Logitech MX518, Microsoft Intellimouse, Trust 16341 BT Mouse
Windows 10 x64, AMD Ryzen 5900x, MSI x570 Tomahawk, 32GB DDR4,
nVidia RTX 2070s, Evo 970 500Gb NVME, 2x2TB WD Black (RAID1)
User avatar
injtsvetkov
Fanatic
Posts: 293
Joined: Mon Jun 06, 2016 8:51 am
Re: XMBC 2.14 Beta
Post by injtsvetkov »
Well I'll try to explain it the way I see it though I'm not sure if I'm on the right track :(.
I have seen in MS Word that every character/symbol has a specific code in the different encoding systems (Unicode, ASCII ...). For example if I now press Alt+366 I get the Lowercase 'n' and Alt+334 gives Uppercase 'N' regardless of the input language. The same is with the Cyrillic letters e.g. Alt+405 gives the Uppercase Cyrillic letter 'X' (which sounds like the English 'H'). Now I am not sure that the result will be the same on your side since you probably don't have Cyrillic fonts installed but you can try that range:
Alt+401 = С
Alt+402 = Т
Alt+403 = У
Alt+404 = Ф
Alt+405 = Х
So I presume that currently XMBC somehow is interpreting the Cyrillic letters as their code and it sends that code when executing them. However the Latin letters seems to be interpreted/sent somehow like Virtual keys so the result depends on what input language is currently active. I thought that the logical (global) solution might be to send the Latin letters by their code too but on second thought that might cause some unwanted behavior (e.g. when sending commands like '{CTRL}C'). That's why I thought that maybe it would be more reliable to use a tag (e.g. {!}) to enclose the string of letters that must be sent via codes instead of Virtual keys. I know it's far from perfect but was hoping that you might have something better in mind :)
BTW I tried to send some Virtual keys via 'Simulated Keys' but here is what I got (google says 0x55 = U):
{VKC:0x55} = nothing
{VKC:55} = 7
Am I doing it wrong or something isn't right?
Greetings!
Iliya
HAMA Mirano
Windows 8.1 x64, Intel i5-3230M @ 2.60GHz, 4GB
User avatar
phil
Site Admin
Posts: 6702
Joined: Sun Apr 06, 2003 11:12 pm
Re: XMBC 2.14 Beta
Post by phil »
XMBC uses keyboard scancodes where possibnle and it uses windows APIs to cvonvert the character to the scancode based on the active language.
0x55 is 55 'hex which is 85 decimal so try {vkc:85}
PS, if you turn on debug logging, you should see the virtual keycodes and scan codes that XMBC is sending in the log file.
Thanks,
Phil
--[ Phil ]--
--[ Administrator & XMBC Author ]--
Logitech G9, Logitech MX518, Microsoft Intellimouse, Trust 16341 BT Mouse
Windows 10 x64, AMD Ryzen 5900x, MSI x570 Tomahawk, 32GB DDR4,
nVidia RTX 2070s, Evo 970 500Gb NVME, 2x2TB WD Black (RAID1)
User avatar
injtsvetkov
Fanatic
Posts: 293
Joined: Mon Jun 06, 2016 8:51 am
Re: XMBC 2.14 Beta
Post by injtsvetkov »
Thanks for the tips :)
Here is what I got from the log file:
Entered in 'Simulated Keys': Д{RIGHT}Ð
SendInput::SendKeyState: VKCode=0x0 Scan code=0x414 SendMode=0x4 Flags=0x0 Release=0:
SendInput::SendKeyState: VKCode=0x0 Scan code=0x414 SendMode=0x4 Flags=0x0 Release=1:
SendInput::SendKeyState: VKCode=0x27 Scan code=0x4d SendMode=0x8 Flags=0x0 Release=0:
SendInput::SendKeyState: VKCode=0x27 Scan code=0x4d SendMode=0x8 Flags=0x0 Release=1:
SendInput::SendKeyState: VKCode=0x0 Scan code=0x41d SendMode=0x4 Flags=0x0 Release=0:
SendInput::SendKeyState: VKCode=0x0 Scan code=0x41d SendMode=0x4 Flags=0x0 Release=1:
Where 0x414 and 0x41d are the scan codes for the Uppercase Cyrillic letters 'Д' and 'Ð' (respectively 0414 and 041D are their Unicode (hex) codes).
Entered in 'Simulated Keys': F{RIGHT}W
SendInput::SendKeyState: VKCode=0x46 Scan code=0x21 SendMode=0x8 Flags=0x0 Release=0:
SendInput::SendKeyState: VKCode=0x46 Scan code=0x21 SendMode=0x8 Flags=0x0 Release=1:
SendInput::SendKeyState: VKCode=0x27 Scan code=0x4d SendMode=0x8 Flags=0x0 Release=0:
SendInput::SendKeyState: VKCode=0x27 Scan code=0x4d SendMode=0x8 Flags=0x0 Release=1:
SendInput::SendKeyState: VKCode=0x57 Scan code=0x11 SendMode=0x8 Flags=0x0 Release=0:
SendInput::SendKeyState: VKCode=0x57 Scan code=0x11 SendMode=0x8 Flags=0x0 Release=1:
Where VKC=0x46 and SC=0x21 both refer to 'F' key, VKC=0x57 and SC=0x11 both refer to 'W' key and since there are no active modifier keys I get lowercase letters 'f' and 'w' when English input is active. But when Bulgarian input is active I get 'ф' and 'в' which respectively are the Cyrillic letters corresponding to 'f' and 'w' keys.
I suppose that the SendMode value determines which of the two methods has the higher priority and since in the first example there are no VKCodes for those letters it falls back to the Scan code method. However I'm a bit confused about the second example, whats the point in getting both the VKC and the SC for the same key. As there are different scan codes for each Uppercase and Lowercase Latin letter, I suppose that there is a way to get the scan code for the entered character instead of the key (which it already has the VKCode for). After that some method would be needed to determine which of the two values to be sent when executing. And here it gets complicated coz in case the both types are needed in a single 'Simulated Keys' command the only way I can think of doing it is via some kind of tag. Here are some examples:
{some tag}asdf{some tag} to send the Scan codes for those four characters instead of VKCodes
or maybe
{???:<string>}
I don't know if that's possible at all but I can't think of anything else :(
BTW I noticed that when I turn on Debug mode via Hotkey the pop-up notification says 'Debugging disabled' and when I turn it off it says 'Debugging enabled'
Greetings!
Iliya
HAMA Mirano
Windows 8.1 x64, Intel i5-3230M @ 2.60GHz, 4GB
User avatar
phil
Site Admin
Posts: 6702
Joined: Sun Apr 06, 2003 11:12 pm
Re: XMBC 2.14 Beta
Post by phil »
Here is 2.14 Beta 6
If you have check for beta versions enabled, there was a problem in earlier 2.14 betas which means you will have to update manually if you are on 2.14 beta 2 or 3. Otherwise you should get notified of a new version and prompted to update in the next day or so. This is the most efficient method (bandwidth wise) as the updates are only a fraction of the size of the full install. Otherwise, you can get the full installation beta HERE. Note that this link will always get you the latest beta version!
Changes since v2.14 Beta 5:
• #409 - Added Enhance Pointer Precision option (same as mouse control panel).
• #408 - Changed "Search Selected Text" to "Web Search Selected Text".
• #407 - Changed "Search Charm (WIN+Q)" to "Cortana Search" on Windows 10.
• #406 - Increased space for (ms) and (min) translations on advanced settings tab.
• #405 - Added missing translations.
• #404 - Improved settings layout to fit on smaller screens.
• #403 - Debug icon does not show until XMBC is disabled/enabled.
• #402 - Debug icon looks wrong on high DPI screens.
There is a new language template included with some new translations for this beta.
Any problems, PM me a copy of the log file (or post a snippet in a code block here).
Thanks,
Phil
--[ Phil ]--
--[ Administrator & XMBC Author ]--
Logitech G9, Logitech MX518, Microsoft Intellimouse, Trust 16341 BT Mouse
Windows 10 x64, AMD Ryzen 5900x, MSI x570 Tomahawk, 32GB DDR4,
nVidia RTX 2070s, Evo 970 500Gb NVME, 2x2TB WD Black (RAID1)
User avatar
JTB3
Dedicated
Posts: 62
Joined: Thu Aug 04, 2016 1:52 am
Re: XMBC 2.14 Beta (Suggestion)
Post by JTB3 »
Hey Phil,
Recently I started using the 'Check for new (Beta) version' option in settings. As you recently pushed the new Beta 6, today I got the tray notification - and when I clicked on it, the pop-up dialog window asked me if I wished to download the new beta version (yes or no).
At that point what I would have really liked to see is an additional button/link to 'view the changelog'. This way I could have seen what new fixes/changes were in store before deciding to download/install.
Would this be relatively easy to implement? Provide a link/button that, when clicked, opens the permalink to the forum post that lists the changes in the default browser? Many of the other software/utilities I have use a similar technique.
There is currently no easy way to see the changes now. I had to search my computer (or google) for the x-mouse forum link, and then navigate to this post (all quite time consuming).
I hope this suggestion is truly useful - and thanks again for creating this great utility!
-JT
System: Win10 Pro-x64 v1702+v1607, Intel i7-7700K (Z270) + i7-4771 (Z87)
Logitech M570 Wireless (5-Button) Trackball + M705 (5-Button) Marathon Mouse
[Bay Area, California]
User avatar
phil
Site Admin
Posts: 6702
Joined: Sun Apr 06, 2003 11:12 pm
Re: XMBC 2.14 Beta
Post by phil »
Hi JT,
well, I maintain a public change log for the full releases, but there is not static location for the change log for the beta's - sure there is a forum post, but that changes for each betas which would mean reprogramming the link every time. The only option would be to maintain a separate change list page, which I guess sis possible (there is a change list inside the installer, so I could just copy that to the web site with some script I guess - so I don't forget :)).
I'll add it to the list. Naturally, it wont be effective until the version after I add it :).
Thanks,
Phil
--[ Phil ]--
--[ Administrator & XMBC Author ]--
Logitech G9, Logitech MX518, Microsoft Intellimouse, Trust 16341 BT Mouse
Windows 10 x64, AMD Ryzen 5900x, MSI x570 Tomahawk, 32GB DDR4,
nVidia RTX 2070s, Evo 970 500Gb NVME, 2x2TB WD Black (RAID1)
xmbcjoef
New User
Posts: 3
Joined: Fri Dec 09, 2011 6:39 pm
Re: XMBC 2.14 Beta
Post by xmbcjoef »
Here's a suggestion for a little tweak.
In Windows 10 make the notification icon hollow instead of all white.
Then have it become all white to show a pending message
In Windows 10 I noticed all the notification icons are now hollowed out and become filled in during a pending message
X-Mouse would fit in very nicely if it did the same
thanks
Joe F
User avatar
injtsvetkov
Fanatic
Posts: 293
Joined: Mon Jun 06, 2016 8:51 am
Re: XMBC 2.14 Beta
Post by injtsvetkov »
Currently when clicking on a topic in the forum it always opens the first page, so every time you have to click to the last page to view the most recent posts. It would be more practical if it directly opens the last page of the topic. That way if you use the link of the topic reprogramming will be necessary only when starting a new 'beta phase' instead of at every single beta, plus it would bring some additional visits the forum :wink:
Greetings!
Iliya
HAMA Mirano
Windows 8.1 x64, Intel i5-3230M @ 2.60GHz, 4GB
Locked
|
{
"url": "https://forums.highrez.co.uk/viewtopic.php?f=6&t=2363&sid=01833af5e506bed40c304e0895123b64&start=30",
"source_domain": "forums.highrez.co.uk",
"snapshot_id": "crawl=CC-MAIN-2021-17",
"warc_metadata": {
"Content-Length": "77198",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:APV4PESBXMHZF2JL43B3L2ZC3T6LJD2O",
"WARC-Concurrent-To": "<urn:uuid:8fb60d5e-7ac7-4c16-81a5-bdc6cc8a6375>",
"WARC-Date": "2021-04-21T13:58:31Z",
"WARC-IP-Address": "62.30.53.100",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:I5EGLIQI35PG2YDN7JHKQJXPCLJLEE6S",
"WARC-Record-ID": "<urn:uuid:52a7b85a-539b-4bcc-9792-7d5102c99ecb>",
"WARC-Target-URI": "https://forums.highrez.co.uk/viewtopic.php?f=6&t=2363&sid=01833af5e506bed40c304e0895123b64&start=30",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:68c2fac1-7167-4990-ae38-83c163c2eded>"
},
"warc_info": "isPartOf: CC-MAIN-2021-17\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-253.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
15,
16,
85,
97,
160,
248,
343,
355,
365,
373,
384,
417,
418,
437,
438,
458,
459,
914,
915,
927,
932,
943,
955,
989,
990,
1009,
1010,
1025,
1026,
1152,
1165,
1201,
1275,
1338,
1399,
1400,
1412,
1424,
1432,
1443,
1476,
1477,
1496,
1497,
1519,
1520,
1884,
1885,
1896,
1902,
1914,
1961,
1962,
1974,
1979,
1990,
2002,
2036,
2037,
2056,
2057,
2072,
2073,
2218,
2231,
2267,
2341,
2404,
2465,
2466,
2478,
2490,
2498,
2509,
2542,
2543,
2562,
2563,
2585,
2586,
3527,
3528,
4201,
4202,
4213,
4219,
4231,
4278,
4279,
4291,
4303,
4311,
4322,
4355,
4356,
4375,
4376,
4398,
4399,
4624,
4625,
4663,
4721,
4783,
4837,
4893,
4894,
4942,
5000,
5062,
5119,
5178,
5179,
5863,
5864,
6081,
6082,
6093,
6099,
6111,
6158,
6159,
6171,
6176,
6187,
6199,
6233,
6234,
6253,
6254,
6269,
6270,
6501,
6502,
6538,
6551,
6587,
6661,
6724,
6785,
6786,
6798,
6810,
6818,
6829,
6862,
6863,
6882,
6883,
6905,
6906,
7001,
7002,
7529,
7542,
7555,
7568,
7581,
7594,
7595,
8343,
8344,
8450,
8471,
8484,
8485,
8531,
8532,
8543,
8549,
8561,
8608,
8609,
8621,
8626,
8637,
8649,
8683,
8684,
8703,
8704,
8719,
8720,
8862,
8863,
8915,
8916,
9039,
9040,
9048,
9053,
9066,
9102,
9176,
9239,
9300,
9301,
9313,
9325,
9333,
9344,
9377,
9378,
9397,
9398,
9420,
9421,
9444,
9445,
9483,
9484,
9525,
9611,
9697,
9783,
9869,
9955,
10041,
10191,
10192,
10231,
10317,
10403,
10489,
10575,
10661,
10747,
11084,
11085,
11919,
12012,
12021,
12036,
12037,
12114,
12115,
12272,
12273,
12284,
12290,
12302,
12349,
12350,
12362,
12367,
12378,
12390,
12424,
12425,
12444,
12445,
12460,
12461,
12481,
12482,
12983,
12984,
13012,
13093,
13166,
13243,
13328,
13367,
13430,
13498,
13553,
13637,
13638,
13723,
13724,
13732,
13737,
13750,
13786,
13860,
13923,
13984,
13985,
13997,
14002,
14012,
14022,
14055,
14056,
14088,
14089,
14104,
14105,
14115,
14388,
14389,
14596,
14597,
14837,
14838,
15020,
15021,
15112,
15116,
15189,
15266,
15289,
15290,
15302,
15307,
15318,
15330,
15364,
15365,
15384,
15385,
15400,
15401,
15408,
15409,
15881,
15882,
15976,
15977,
15985,
15990,
16003,
16039,
16113,
16176,
16237,
16238,
16247,
16256,
16265,
16298,
16299,
16318,
16319,
16338,
16339,
16379,
16380,
16450,
16506,
16507,
16625,
16626,
16678,
16679,
16686,
16692,
16693,
16705,
16717,
16725,
16736,
16769,
16770,
16789,
16790,
16812,
16813,
17254,
17255,
17266,
17272,
17284,
17331,
17332
],
"line_end_idx": [
15,
16,
85,
97,
160,
248,
343,
355,
365,
373,
384,
417,
418,
437,
438,
458,
459,
914,
915,
927,
932,
943,
955,
989,
990,
1009,
1010,
1025,
1026,
1152,
1165,
1201,
1275,
1338,
1399,
1400,
1412,
1424,
1432,
1443,
1476,
1477,
1496,
1497,
1519,
1520,
1884,
1885,
1896,
1902,
1914,
1961,
1962,
1974,
1979,
1990,
2002,
2036,
2037,
2056,
2057,
2072,
2073,
2218,
2231,
2267,
2341,
2404,
2465,
2466,
2478,
2490,
2498,
2509,
2542,
2543,
2562,
2563,
2585,
2586,
3527,
3528,
4201,
4202,
4213,
4219,
4231,
4278,
4279,
4291,
4303,
4311,
4322,
4355,
4356,
4375,
4376,
4398,
4399,
4624,
4625,
4663,
4721,
4783,
4837,
4893,
4894,
4942,
5000,
5062,
5119,
5178,
5179,
5863,
5864,
6081,
6082,
6093,
6099,
6111,
6158,
6159,
6171,
6176,
6187,
6199,
6233,
6234,
6253,
6254,
6269,
6270,
6501,
6502,
6538,
6551,
6587,
6661,
6724,
6785,
6786,
6798,
6810,
6818,
6829,
6862,
6863,
6882,
6883,
6905,
6906,
7001,
7002,
7529,
7542,
7555,
7568,
7581,
7594,
7595,
8343,
8344,
8450,
8471,
8484,
8485,
8531,
8532,
8543,
8549,
8561,
8608,
8609,
8621,
8626,
8637,
8649,
8683,
8684,
8703,
8704,
8719,
8720,
8862,
8863,
8915,
8916,
9039,
9040,
9048,
9053,
9066,
9102,
9176,
9239,
9300,
9301,
9313,
9325,
9333,
9344,
9377,
9378,
9397,
9398,
9420,
9421,
9444,
9445,
9483,
9484,
9525,
9611,
9697,
9783,
9869,
9955,
10041,
10191,
10192,
10231,
10317,
10403,
10489,
10575,
10661,
10747,
11084,
11085,
11919,
12012,
12021,
12036,
12037,
12114,
12115,
12272,
12273,
12284,
12290,
12302,
12349,
12350,
12362,
12367,
12378,
12390,
12424,
12425,
12444,
12445,
12460,
12461,
12481,
12482,
12983,
12984,
13012,
13093,
13166,
13243,
13328,
13367,
13430,
13498,
13553,
13637,
13638,
13723,
13724,
13732,
13737,
13750,
13786,
13860,
13923,
13984,
13985,
13997,
14002,
14012,
14022,
14055,
14056,
14088,
14089,
14104,
14105,
14115,
14388,
14389,
14596,
14597,
14837,
14838,
15020,
15021,
15112,
15116,
15189,
15266,
15289,
15290,
15302,
15307,
15318,
15330,
15364,
15365,
15384,
15385,
15400,
15401,
15408,
15409,
15881,
15882,
15976,
15977,
15985,
15990,
16003,
16039,
16113,
16176,
16237,
16238,
16247,
16256,
16265,
16298,
16299,
16318,
16319,
16338,
16339,
16379,
16380,
16450,
16506,
16507,
16625,
16626,
16678,
16679,
16686,
16692,
16693,
16705,
16717,
16725,
16736,
16769,
16770,
16789,
16790,
16812,
16813,
17254,
17255,
17266,
17272,
17284,
17331,
17332,
17338
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 17338,
"ccnet_original_nlines": 365,
"rps_doc_curly_bracket": 0.001384239993058145,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3147675096988678,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06591722369194031,
"rps_doc_frac_lines_end_with_ellipsis": 0.0027322398964315653,
"rps_doc_frac_no_alph_words": 0.2606029510498047,
"rps_doc_frac_unique_words": 0.2698630094528198,
"rps_doc_mean_word_length": 4.561301231384277,
"rps_doc_num_sentences": 132,
"rps_doc_symbol_to_word_ratio": 0.0025549300480633974,
"rps_doc_unigram_entropy": 5.907887935638428,
"rps_doc_word_count": 2920,
"rps_doc_frac_chars_dupe_10grams": 0.23102335631847382,
"rps_doc_frac_chars_dupe_5grams": 0.28200316429138184,
"rps_doc_frac_chars_dupe_6grams": 0.27562129497528076,
"rps_doc_frac_chars_dupe_7grams": 0.24153465032577515,
"rps_doc_frac_chars_dupe_8grams": 0.23102335631847382,
"rps_doc_frac_chars_dupe_9grams": 0.23102335631847382,
"rps_doc_frac_chars_top_2gram": 0.009460169821977615,
"rps_doc_frac_chars_top_3gram": 0.01321421004831791,
"rps_doc_frac_chars_top_4gram": 0.014640740118920803,
"rps_doc_books_importance": -1563.2294921875,
"rps_doc_books_importance_length_correction": -1563.2294921875,
"rps_doc_openwebtext_importance": -996.441162109375,
"rps_doc_openwebtext_importance_length_correction": -996.441162109375,
"rps_doc_wikipedia_importance": -681.1171875,
"rps_doc_wikipedia_importance_length_correction": -681.1171875
},
"fasttext": {
"dclm": 0.019445059821009636,
"english": 0.8932092785835266,
"fineweb_edu_approx": 1.529273271560669,
"eai_general_math": 0.22107136249542236,
"eai_open_web_math": 0.38238370418548584,
"eai_web_code": 0.002419169992208481
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-6,673,929,104,784,052,000 |
[FFmpeg-devel] [PATCH] Re: Reworking the codec lookup system
Nicolas George nicolas.george
Wed Jun 13 17:13:06 CEST 2007
Hi.
Le quartidi 24 prairial, an CCXV, Michael Niedermayer a ?crit?:
> users dont read avcodec.h or the doxygen docs about CodecID, its developers
> who do
I was thinking about users of lavc, who are themselves developers: they need
to know what the field is supposed to mean, and how they are supposed to
handle it in their program, but not how the decoders actually work.
> and we should not attempt to hide such details from them otherwise
> they for example might spend a lot of time writing code to distingush a
> mpeg1 from a mpeg2 stream beliving they have to in order to decode it
I strongly disagree with that: people who program using lavc must not assume
that the result of avcodec_find_decoder(CODEC_ID_MPEG1VIDEO) will be able to
decode MPEG2 streams, otherwise, their program will mysteriously stop
working if built against a version of lavc with two separate minimalist
decoders.
The fact that the native MPEG decoder is able to decode both MPEG1 and MPEG2
is an useful feature indeed. But I believe it must be specifically documented
as an exception to the general rule (one way to do it would be to declare a
decoder with a name like "mpeg12" or even "mpeg_1_or_2"). If such exceptions
were to become common, it would be necessary to adapt the data structures to
account for them, but one step at a time.
I have reworked the patch to take your comments into account. I have also
removed the comment for the id field, since it was redundant with the
comment for the CodecID type.
Regards,
--
Nicolas George
Index: libavcodec/avcodec.h
===================================================================
--- libavcodec/avcodec.h (revision 9303)
+++ libavcodec/avcodec.h (working copy)
@@ -44,6 +44,12 @@
#define AV_TIME_BASE_Q (AVRational){1, AV_TIME_BASE}
/**
+ * Identifies the syntax and semantics of the bitstream.
+ * The principle is roughly:
+ * Two decoders with the same ID can decode the same streams.
+ * Two encoders with the same ID can encode compatible streams.
+ * There may be slight deviations from the principle due to implementation
+ * details.
*
* If you add a codec ID to this list, add it so that
* 1. no value of a existing codec ID changes (that would break ABI),
@@ -2119,6 +2125,12 @@
* AVCodec.
*/
typedef struct AVCodec {
+ /**
+ * Name of the codec implementation.
+ * The name is globally unique among encoders and among decoders (but an
+ * encoder and a decoder can share the same name).
+ * This is the primary way to find a codec from the user perspective.
+ */
const char *name;
enum CodecType type;
enum CodecID id;
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 185 bytes
Desc: Digital signature
URL: <http://lists.mplayerhq.hu/pipermail/ffmpeg-devel/attachments/20070613/8212f8ae/attachment.pgp>
More information about the ffmpeg-devel mailing list
|
{
"url": "http://ffmpeg.org/pipermail/ffmpeg-devel/2007-June/030640.html",
"source_domain": "ffmpeg.org",
"snapshot_id": "crawl=CC-MAIN-2017-04",
"warc_metadata": {
"Content-Length": "5978",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GJU4AA7QN4UWG2YOKNAMZWWTO2ZWAJXU",
"WARC-Concurrent-To": "<urn:uuid:ae972bea-1ced-4aa9-a12e-4e8b4a0ed70d>",
"WARC-Date": "2017-01-20T16:09:25Z",
"WARC-IP-Address": "79.124.17.100",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:7TYINIPOOZGVNFGQ3WUYNOAXEHJUPJUK",
"WARC-Record-ID": "<urn:uuid:533fc3b5-a85c-4ab2-a65e-7032b34709d7>",
"WARC-Target-URI": "http://ffmpeg.org/pipermail/ffmpeg-devel/2007-June/030640.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c7c02dab-7d94-42c3-ae77-0b6e1ac4dd25>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-10-70.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-04\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for January 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
61,
62,
92,
122,
123,
124,
128,
129,
193,
271,
280,
281,
358,
431,
499,
500,
570,
644,
716,
717,
794,
871,
941,
1013,
1023,
1024,
1101,
1179,
1255,
1332,
1409,
1451,
1452,
1526,
1596,
1626,
1627,
1636,
1637,
1641,
1658,
1659,
1660,
1688,
1756,
1797,
1837,
1856,
1919,
1921,
1926,
1984,
2014,
2077,
2142,
2218,
2231,
2235,
2290,
2361,
2384,
2397,
2402,
2428,
2437,
2479,
2557,
2613,
2688,
2697,
2720,
2746,
2768,
2808,
2846,
2866,
2898,
2914,
2938,
3039,
3040,
3041,
3042
],
"line_end_idx": [
61,
62,
92,
122,
123,
124,
128,
129,
193,
271,
280,
281,
358,
431,
499,
500,
570,
644,
716,
717,
794,
871,
941,
1013,
1023,
1024,
1101,
1179,
1255,
1332,
1409,
1451,
1452,
1526,
1596,
1626,
1627,
1636,
1637,
1641,
1658,
1659,
1660,
1688,
1756,
1797,
1837,
1856,
1919,
1921,
1926,
1984,
2014,
2077,
2142,
2218,
2231,
2235,
2290,
2361,
2384,
2397,
2402,
2428,
2437,
2479,
2557,
2613,
2688,
2697,
2720,
2746,
2768,
2808,
2846,
2866,
2898,
2914,
2938,
3039,
3040,
3041,
3042,
3094
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3094,
"ccnet_original_nlines": 83,
"rps_doc_curly_bracket": 0.0009696200140751898,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35079365968704224,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03492062911391258,
"rps_doc_frac_lines_end_with_ellipsis": 0.011904760263860226,
"rps_doc_frac_no_alph_words": 0.2698412835597992,
"rps_doc_frac_unique_words": 0.5413870215415955,
"rps_doc_mean_word_length": 5.011185646057129,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0.0031745999585837126,
"rps_doc_unigram_entropy": 5.106152534484863,
"rps_doc_word_count": 447,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.014285709708929062,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.012500000186264515,
"rps_doc_frac_chars_top_3gram": 0.010714289732277393,
"rps_doc_frac_chars_top_4gram": 0.014285709708929062,
"rps_doc_books_importance": -244.11146545410156,
"rps_doc_books_importance_length_correction": -244.11146545410156,
"rps_doc_openwebtext_importance": -153.52267456054688,
"rps_doc_openwebtext_importance_length_correction": -153.52267456054688,
"rps_doc_wikipedia_importance": -110.87590789794922,
"rps_doc_wikipedia_importance_length_correction": -110.87590789794922
},
"fasttext": {
"dclm": 0.4985349178314209,
"english": 0.8633740544319153,
"fineweb_edu_approx": 1.5288668870925903,
"eai_general_math": 0.23576223850250244,
"eai_open_web_math": 0.4653410315513611,
"eai_web_code": 0.12733817100524902
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
1,803,917,948,845,511,400 |
Home » Blog » Apps » How to Hack WhatsApp? – Steps, Apps, and More
How to Hack WhatsApp? – Steps, Apps, and More
by The Digital Trendz
How to Hack WhatsApp? – Steps, Apps, and More
Steps
It’s effortless! You need to enter the phone number of the person you want to investigate and wait to receive the results that we will send you in just a few minutes.
1. Register on the home page of the application.
2. Enter the phone number with the country code in question.
3. Indicate ‘Hack WhatsApp.’
4. Wait for the process to be complete. It won’t take more than 5 minutes!
5. You will receive a link to the compressed document where you will find all the data extracted from WhatsApp
Warning
Hacking someone else’s WhatsApp conversations violates people’s privacy so that you can be penalizing for it.
However, if you do it the right way with tools like Hackearwhats.
App, you will get the results without any mishap.
For this, our team has developed an undetectable monitoring system, offering impeccable user anonymity.
Since the internet became massive, not only was there a boom in access to information, but it also acted as a double-edged sword, bringing negative consequences.
One of them is the lack of security, which is exploited by hackers.
That is why you should be aware of dangerous sites, which are camouflaged by promising things like “hack WhatsApp.”
This is a clear example of a scam that we will deal with thoroughly; We have compiled the most dangerous software that is not recommending for this purpose.
The scam of making promises that are almost impossible to keep is widespread.
It is a way to make the user fall.
It is no secret to anyone that WhatsApp is the most widely used communication app globally, and therefore one of the focal points because of hacker groups.
What are the Best Apps to hack WhatsApp?
There are quite a few applications online that claim that you can easily spy on WhatsApp if you use them.
Some of them are more successful than others. Some are paying, and others are free.
· MSpy
MSpy is a leading parental control app for smartphones that allows parents to monitor text messages, calls, current GPS location, Snapchat, WhatsApp, and much more.
It collects information from the target device and sends it to your Control Panel (your account that will be creating after purchase), which you can access from any browser.
MSpy for smartphones runs on rooted / non-rooted Android 4.0+ platforms and jailbroken / non-jailbroken iOS 6.0+.
The customer service area is easy to use.
They provide 24/7 live customer support with a wide variety of subscription plans and affordable prices that will make your experience the best value for your money.
· SpyFone
SpyFone is the number one parental monitoring software on the market.
It is an application that must be download to the phone of the person you want to monitor, or you need the iCloud credentials of the person you want to watch.
SpyFone allows you to see what someone else is doing on your phone or tablet.
You can also see which apps your child, employee, or spouse uses the most.
Many can see who they are calling and see the emails and text messages they are sending and receiving.
You can even download the photos and videos stored on the other person’s phone.
· CocoSpy
The CocoSpy company did its best to make the use of the application simple and comfortable.
By purchasing the application, you get a CocoSpy account.
The owner’s phone and the target device. In this sense, you can use CocoSpy for iPhone and Android devices to monitor people.
When you are about to supervise someone with the iOS device, you must obtain the device’s credentials.
The CocoSpy installation allows monitoring.
It allows supervising Android devices, although it is necessary to configure a compliment on the other’s phone.
Developers usually provide relevant tutorials—just search <how to install CocoSpy without access to iPhone or smartphone>.
· Keylogger
On the other hand, through a program specifically designed to record all the keys pressed by the user on his mobile, you can know what he writes on WhatsApp.
You will not even have to see the mobile screen or know about computers.
It is what is knowledge in the field of the hack, as Keylogger.
Perhaps the only somewhat complicated step is to install it.
There are many alternatives, such as iKeyMonitor or MobiStealth, that have this built-in function.
Thanks to this type of app, each key pressed during WhatsApp conversations will be stored and sent to a remote server.
After that, you will have to log in to your account and see everything from the comfort of your home or any mobile device.
What do they Use to hack Whatsapp?
For, the first instance of vulnerabilities, which is attacking through fake websites.
It should be renowned that these mentioned apps are mainly for monitoring purposes and thus provide security (or tranquility) to parents.
They are a way of knowing what your children are doing in the digital world, including social networks or WhatsApp messaging and other alternatives.
However, hackers can also use hackers to gain access to another mobile, although they first need physical access to it.
How to recognize a Scam that promises to hack WhatsApp?
First of all, it will always tell you that everything is free. Error! And it is that nothing is free in life.
So whenever you notice something suspiciously good and with a price that is not appropriate, the best thing is to get out of there.
Now let’s see which are the websites or apps that will put you in danger if you use them to want to browse other people’s messages
What are the different Methods to hack WhatsApp?
Recover WhatsApp conversations
One way to recover WhatsApp messages for suspicious conversations from the person we want to verify is to recover WhatsApp conversations.
There are several ways to do this.
Before trying the steps, keep in mind that you can only restore chats if the backup option had been activating in WhatsApp first.
This means that if you have never backed up your chats, you will not recover any messages or conversations that you accidentally delete or delete.
To activate chat backup, open WhatsApp, go to “Settings,” go to “Chats” and tap on “Chat Backup.”
And if you are an iPhone user, go to “Settings” in “WhatsApp Chats
Chat Backup “, where you can select the frequency of” Automatic Backup “or use” Backup Now “to manually initiate an iCloud backup.
References: Marketing Marine
Review How to Hack WhatsApp? – Steps, Apps, and More.
Your email address will not be published. Required fields are marked *
You may also like
thedigitaltrendz logo
Thedigitaltrendz is Established in 2020, Headquartered in the USA. Thedigitaltrendz.com is a technology and media company that intends to provide information about technology worldwide.
Copyright © 2022 All Rights Reserved by The Digital Trendz
|
{
"url": "https://www.thedigitaltrendz.com/hack-whatsapp/",
"source_domain": "www.thedigitaltrendz.com",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "197676",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6HXTCWFRO2QKADAK5EMJ7WCMUOZLMUP7",
"WARC-Concurrent-To": "<urn:uuid:1e213506-139e-4972-8882-531ab1a87d47>",
"WARC-Date": "2023-03-30T02:54:08Z",
"WARC-IP-Address": "198.187.29.28",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZS4COUMNZLTVPA62BERNXH4XWKSBJDI4",
"WARC-Record-ID": "<urn:uuid:27f977ad-6b8a-4bc7-b5a2-65a03a9d7b83>",
"WARC-Target-URI": "https://www.thedigitaltrendz.com/hack-whatsapp/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:78e959da-860d-463c-bcf3-2db3e76e1c20>"
},
"warc_info": "isPartOf: CC-MAIN-2023-14\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-134\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
67,
68,
114,
115,
137,
183,
184,
190,
191,
358,
359,
410,
473,
504,
581,
694,
695,
703,
704,
814,
815,
881,
882,
932,
933,
1037,
1038,
1200,
1201,
1269,
1270,
1386,
1387,
1544,
1545,
1623,
1624,
1659,
1660,
1816,
1817,
1858,
1859,
1965,
1966,
2050,
2051,
2065,
2066,
2231,
2232,
2406,
2407,
2521,
2522,
2564,
2565,
2731,
2732,
2749,
2750,
2820,
2821,
2980,
2981,
3059,
3060,
3135,
3136,
3239,
3240,
3320,
3321,
3338,
3339,
3431,
3432,
3490,
3491,
3617,
3618,
3721,
3722,
3766,
3767,
3879,
3880,
4003,
4004,
4023,
4024,
4182,
4183,
4256,
4257,
4321,
4322,
4383,
4384,
4483,
4484,
4603,
4604,
4727,
4728,
4763,
4764,
4850,
4851,
4989,
4990,
5139,
5140,
5260,
5261,
5317,
5318,
5428,
5429,
5561,
5562,
5693,
5694,
5743,
5744,
5775,
5776,
5914,
5915,
5950,
5951,
6081,
6082,
6229,
6230,
6328,
6329,
6396,
6397,
6528,
6529,
6558,
6559,
6613,
6614,
6685,
6686,
6704,
6705,
6727,
6728,
6914,
6915
],
"line_end_idx": [
67,
68,
114,
115,
137,
183,
184,
190,
191,
358,
359,
410,
473,
504,
581,
694,
695,
703,
704,
814,
815,
881,
882,
932,
933,
1037,
1038,
1200,
1201,
1269,
1270,
1386,
1387,
1544,
1545,
1623,
1624,
1659,
1660,
1816,
1817,
1858,
1859,
1965,
1966,
2050,
2051,
2065,
2066,
2231,
2232,
2406,
2407,
2521,
2522,
2564,
2565,
2731,
2732,
2749,
2750,
2820,
2821,
2980,
2981,
3059,
3060,
3135,
3136,
3239,
3240,
3320,
3321,
3338,
3339,
3431,
3432,
3490,
3491,
3617,
3618,
3721,
3722,
3766,
3767,
3879,
3880,
4003,
4004,
4023,
4024,
4182,
4183,
4256,
4257,
4321,
4322,
4383,
4384,
4483,
4484,
4603,
4604,
4727,
4728,
4763,
4764,
4850,
4851,
4989,
4990,
5139,
5140,
5260,
5261,
5317,
5318,
5428,
5429,
5561,
5562,
5693,
5694,
5743,
5744,
5775,
5776,
5914,
5915,
5950,
5951,
6081,
6082,
6229,
6230,
6328,
6329,
6396,
6397,
6528,
6529,
6558,
6559,
6613,
6614,
6685,
6686,
6704,
6705,
6727,
6728,
6914,
6915,
6973
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6973,
"ccnet_original_nlines": 153,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.45781365036964417,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.001467350055463612,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14673514664173126,
"rps_doc_frac_unique_words": 0.393680602312088,
"rps_doc_mean_word_length": 4.726729393005371,
"rps_doc_num_sentences": 82,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.395730972290039,
"rps_doc_word_count": 1171,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03541101887822151,
"rps_doc_frac_chars_dupe_6grams": 0.03541101887822151,
"rps_doc_frac_chars_dupe_7grams": 0.02457091026008129,
"rps_doc_frac_chars_dupe_8grams": 0.02457091026008129,
"rps_doc_frac_chars_dupe_9grams": 0.02457091026008129,
"rps_doc_frac_chars_top_2gram": 0.009756100364029408,
"rps_doc_frac_chars_top_3gram": 0.02023486979305744,
"rps_doc_frac_chars_top_4gram": 0.012285459786653519,
"rps_doc_books_importance": -696.57666015625,
"rps_doc_books_importance_length_correction": -696.57666015625,
"rps_doc_openwebtext_importance": -431.84796142578125,
"rps_doc_openwebtext_importance_length_correction": -431.84796142578125,
"rps_doc_wikipedia_importance": -319.3070373535156,
"rps_doc_wikipedia_importance_length_correction": -319.3070373535156
},
"fasttext": {
"dclm": 0.03856629133224487,
"english": 0.941051721572876,
"fineweb_edu_approx": 1.7589157819747925,
"eai_general_math": 0.016812259331345558,
"eai_open_web_math": 0.17670530080795288,
"eai_web_code": 0.0047288499772548676
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.8",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "363.25",
"labels": {
"level_1": "Social sciences",
"level_2": "Social service and Societies",
"level_3": "Political activists"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "1",
"label": "Technically Flawed"
},
"secondary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
7,134,309,488,962,690,000 |
AsyncMysqlRow::getFieldAsInt
Get a certain field (column) value as an int
Description
public function getFieldAsInt(
mixed $field,
): int
If the column from which you are retrieving the value is not an integral type, then an Exception is thrown.
Parameters
• $field - the field index (int) or field name (string).
Return Values
• int - The int value of the field (column); or an Exception if it the column is not integral.
Examples
The following example shows how to get a field value as an int value via AsyncMysqlRow::getFieldAsInt. Assume this was the SQL used to create the example table:
CREATE TABLE test_table (
userID SMALLINT UNSIGNED ZEROFILL NOT NULL AUTO_INCREMENT,
name VARCHAR(40) NOT NULL,
age SMALLINT NULL,
email VARCHAR(60) NULL,
PRIMARY KEY (userID)
);
In this case, we are actually getting a field that is an int (or SMALLINT).
<?hh
namespace Hack\UserDocumentation\API\Examples\AsyncMysql\Row\GFAsInt;
use \Hack\UserDocumentation\API\Examples\AsyncMysql\ConnectionInfo as CI;
async function connect(\AsyncMysqlConnectionPool $pool):
Awaitable<\AsyncMysqlConnection> {
return await $pool->connect(
CI::$host,
CI::$port,
CI::$db,
CI::$user,
CI::$passwd
);
}
async function simple_query(): Awaitable<int> {
$pool = new \AsyncMysqlConnectionPool(array());
$conn = await connect($pool);
$result = await $conn->query(
'SELECT * FROM test_table WHERE userID < 50'
);
$conn->close();
// A call to $result->rowBlocks() actually pops the first element of the
// row block Vector. So the call actually mutates the Vector.
$row_blocks = $result->rowBlocks();
if (!$row_blocks->isEmpty()) {
// An AsyncMysqlRowBlock
$row_block = $row_blocks[0];
if (!$row_block->isEmpty()) {
// An AsyncMysqlRow
$row = $row_block->getRow(0);
return $row->getFieldAsInt('age'); // int
}
return -1;
} else {
return -1;
}
}
function run(): void {
$r = \HH\Asio\join(simple_query());
var_dump($r);
}
run();
Output
int(41)
|
{
"url": "https://docs.hhvm.com/hack/reference/class/AsyncMysqlRow/getFieldAsInt/",
"source_domain": "docs.hhvm.com",
"snapshot_id": "crawl=CC-MAIN-2017-51",
"warc_metadata": {
"Content-Length": "14644",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YID5B7AOG7DPZMW7XAHISZNRXRMWSLSQ",
"WARC-Concurrent-To": "<urn:uuid:4984f049-2593-4dcf-bb41-8cd9d47da5e9>",
"WARC-Date": "2017-12-11T20:36:45Z",
"WARC-IP-Address": "52.34.210.204",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZMABOBRNRWBOSBVTVXPE2EYORTPCW4LZ",
"WARC-Record-ID": "<urn:uuid:405f1552-1a54-4b8a-b7dc-bf4563c22357>",
"WARC-Target-URI": "https://docs.hhvm.com/hack/reference/class/AsyncMysqlRow/getFieldAsInt/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:db139650-071a-48f9-b9f2-e243e4b756a1>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-143-47-177.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-51\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for December 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
29,
30,
75,
76,
88,
89,
120,
136,
143,
144,
252,
253,
264,
265,
324,
325,
339,
340,
437,
438,
447,
448,
609,
610,
636,
695,
722,
741,
765,
786,
789,
790,
866,
867,
872,
873,
943,
944,
1018,
1019,
1076,
1113,
1144,
1159,
1174,
1187,
1202,
1218,
1223,
1225,
1273,
1323,
1355,
1387,
1436,
1441,
1459,
1534,
1598,
1636,
1669,
1698,
1731,
1765,
1791,
1827,
1875,
1881,
1896,
1907,
1922,
1926,
1928,
1929,
1952,
1990,
2006,
2008,
2009,
2016,
2023
],
"line_end_idx": [
29,
30,
75,
76,
88,
89,
120,
136,
143,
144,
252,
253,
264,
265,
324,
325,
339,
340,
437,
438,
447,
448,
609,
610,
636,
695,
722,
741,
765,
786,
789,
790,
866,
867,
872,
873,
943,
944,
1018,
1019,
1076,
1113,
1144,
1159,
1174,
1187,
1202,
1218,
1223,
1225,
1273,
1323,
1355,
1387,
1436,
1441,
1459,
1534,
1598,
1636,
1669,
1698,
1731,
1765,
1791,
1827,
1875,
1881,
1896,
1907,
1922,
1926,
1928,
1929,
1952,
1990,
2006,
2008,
2009,
2016,
2023,
2030
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2030,
"ccnet_original_nlines": 81,
"rps_doc_curly_bracket": 0.005911330226808786,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1794871836900711,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07459206879138947,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.39627039432525635,
"rps_doc_frac_unique_words": 0.5682819485664368,
"rps_doc_mean_word_length": 6.1938323974609375,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.580320358276367,
"rps_doc_word_count": 227,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.010668559931218624,
"rps_doc_frac_chars_top_3gram": 0.01280227955430746,
"rps_doc_frac_chars_top_4gram": 0.017069699242711067,
"rps_doc_books_importance": -218.63687133789062,
"rps_doc_books_importance_length_correction": -218.63687133789062,
"rps_doc_openwebtext_importance": -120.23036193847656,
"rps_doc_openwebtext_importance_length_correction": -120.23036193847656,
"rps_doc_wikipedia_importance": -86.37832641601562,
"rps_doc_wikipedia_importance_length_correction": -86.37832641601562
},
"fasttext": {
"dclm": 0.8243510127067566,
"english": 0.44966942071914673,
"fineweb_edu_approx": 3.4589664936065674,
"eai_general_math": 0.8263119459152222,
"eai_open_web_math": 0.17889803647994995,
"eai_web_code": 0.9434245228767395
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.758",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
5,081,717,731,575,807,000 |
Skip to main content
Lecture notes for Python 1 at University of Freiburg.
Project description
# Python I lecture notes Supplementary material, lecture notes and exercises for the Python I lecture at University of Freiburg.
### Installation Basically, all lectures are in the .ipynb format of version 4. Therefore you need Jupyter to view them. One would need no installation, in case the notebooks run without errors. In case the dependencies shall be installed, this module can be installed using setuptools.
`bash ~$ git clone https://github.com/mmaelicke/felis_python1.git ~$ cd felis_python1 ~$ pip install -r requirements.txt ~$ cd lectures ~$ jupyter notebook `
Project details
Supported by
AWS AWS Cloud computing and Security Sponsor Datadog Datadog Monitoring Fastly Fastly CDN Google Google Download Analytics Microsoft Microsoft PSF Sponsor Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page
|
{
"url": "https://pypi.org/project/felis-python1/0.0.3/",
"source_domain": "pypi.org",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "33739",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CMVS6R3CQ35G3ZDHNIVK2EVYYNRL7OH5",
"WARC-Concurrent-To": "<urn:uuid:f76d9ea0-d2b3-495d-aee7-4daf46e5c70d>",
"WARC-Date": "2024-07-15T04:57:57Z",
"WARC-IP-Address": "151.101.64.223",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:K37BTCJOV5PBJVOQAPIA3OPAVVH6K63P",
"WARC-Record-ID": "<urn:uuid:d07a5144-5c8d-46cf-acc7-7c4867aed37b>",
"WARC-Target-URI": "https://pypi.org/project/felis-python1/0.0.3/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6e7f27b3-a07f-46dc-95a7-693d324998d9>"
},
"warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-164\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
21,
22,
76,
77,
97,
98,
227,
228,
515,
516,
674,
675,
691,
692,
693,
706,
707
],
"line_end_idx": [
21,
22,
76,
77,
97,
98,
227,
228,
515,
516,
674,
675,
691,
692,
693,
706,
707,
950
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 950,
"ccnet_original_nlines": 17,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.21604937314987183,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.037037041038274765,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17901234328746796,
"rps_doc_frac_unique_words": 0.6899224519729614,
"rps_doc_mean_word_length": 5.945736408233643,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0.02469136007130146,
"rps_doc_unigram_entropy": 4.392236232757568,
"rps_doc_word_count": 129,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04693610966205597,
"rps_doc_frac_chars_top_3gram": 0.03650587052106857,
"rps_doc_frac_chars_top_4gram": 0.05736635997891426,
"rps_doc_books_importance": -72.94937896728516,
"rps_doc_books_importance_length_correction": -72.94937896728516,
"rps_doc_openwebtext_importance": -41.65140914916992,
"rps_doc_openwebtext_importance_length_correction": -28.691190719604492,
"rps_doc_wikipedia_importance": -41.46189880371094,
"rps_doc_wikipedia_importance_length_correction": -41.46189880371094
},
"fasttext": {
"dclm": 0.028297899290919304,
"english": 0.7514392137527466,
"fineweb_edu_approx": 2.3090219497680664,
"eai_general_math": 0.04186869040131569,
"eai_open_web_math": 0.01652872934937477,
"eai_web_code": 0.002606689929962158
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "378.166",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Higher and Universities and colleges"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-308,671,934,519,006,460 |
dingerkingh dingerkingh - 10 months ago 42
Python Question
Previous and next item of list python
Can anyone point me towards a practical way of getting the previous and next items of a list. For example:
my_list = [100, 200, 300, 400]
Is there a practical way of getting the previous and next item (300 and 100).
I am using
my_list[my_list.index(400) - 1]
to successfully get the previous item. Python doesn't mind getting a negative index apparently. However, if I try
my_list[my_list.index(400) + 1]
it doesn't like having an index greater than the number of items in the list. Which makes sense.
Traceback (most recent call last):
File "<stdin>", line 1, in <module>
IndexError: list index out of range
I suppose I can use a loop to loop through and get it - I was just hoping there was a simpler solution. I was thinking along the lines of using
iter()
but I can't seem to figure out if it is possible to set the index.
Answer
A simple solution is to use modulo
my_list[ (my_list.index(400) + 1) % len(my_list) ]
result:
>> 100
|
{
"url": "https://codedump.io/share/cBJSu9RBBGks/1/previous-and-next-item-of-list-python",
"source_domain": "codedump.io",
"snapshot_id": "crawl=CC-MAIN-2017-13",
"warc_metadata": {
"Content-Length": "26124",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:USRHRKKGQJCGHUSOQYGM7CQ5OZNSWWFY",
"WARC-Concurrent-To": "<urn:uuid:83a12e9e-0541-480e-a13d-17a8001fe28f>",
"WARC-Date": "2017-03-27T22:31:07Z",
"WARC-IP-Address": "84.22.103.185",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:R2MVGSJNYCQN2YLT7IFCHHAAFIQRUIRC",
"WARC-Record-ID": "<urn:uuid:38e8dd30-cc98-4db6-8438-697bcfde5a06>",
"WARC-Target-URI": "https://codedump.io/share/cBJSu9RBBGks/1/previous-and-next-item-of-list-python",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:002c2776-a0a1-4349-bba3-fc650ee1b4cb>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-233-31-227.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-13\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for March 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
43,
59,
60,
98,
99,
206,
207,
238,
239,
240,
318,
319,
330,
362,
476,
508,
605,
606,
641,
677,
713,
714,
715,
859,
866,
933,
934,
941,
942,
977,
978,
1029,
1030,
1038,
1039
],
"line_end_idx": [
43,
59,
60,
98,
99,
206,
207,
238,
239,
240,
318,
319,
330,
362,
476,
508,
605,
606,
641,
677,
713,
714,
715,
859,
866,
933,
934,
941,
942,
977,
978,
1029,
1030,
1038,
1039,
1045
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1045,
"ccnet_original_nlines": 35,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34156379103660583,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03292180970311165,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.29629629850387573,
"rps_doc_frac_unique_words": 0.5542857050895691,
"rps_doc_mean_word_length": 4.440000057220459,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.341468334197998,
"rps_doc_word_count": 175,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.10296010226011276,
"rps_doc_frac_chars_dupe_6grams": 0.10296010226011276,
"rps_doc_frac_chars_dupe_7grams": 0.10296010226011276,
"rps_doc_frac_chars_dupe_8grams": 0.10296010226011276,
"rps_doc_frac_chars_dupe_9grams": 0.10296010226011276,
"rps_doc_frac_chars_top_2gram": 0.04247104004025459,
"rps_doc_frac_chars_top_3gram": 0.057915061712265015,
"rps_doc_frac_chars_top_4gram": 0.048906050622463226,
"rps_doc_books_importance": -97.18065643310547,
"rps_doc_books_importance_length_correction": -97.18065643310547,
"rps_doc_openwebtext_importance": -88.70430755615234,
"rps_doc_openwebtext_importance_length_correction": -75.82866668701172,
"rps_doc_wikipedia_importance": -70.48967742919922,
"rps_doc_wikipedia_importance_length_correction": -70.48967742919922
},
"fasttext": {
"dclm": 0.889411211013794,
"english": 0.8571258783340454,
"fineweb_edu_approx": 1.280942678451538,
"eai_general_math": 0.9858886003494263,
"eai_open_web_math": 0.18303602933883667,
"eai_web_code": 0.9764483571052551
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-3,012,937,763,713,219,000 |
Intereting Posts
Как обрабатывать файл как одну строку с помощью grep для применения шаблона поиска регулярного выражения? Параметры дефрагментации в файловой системе Ext4 Как найти все файлы, кроме указанного файла Как имитировать Wi-Fi, выходящий за пределы диапазона, включив / выключив точку доступа на моем устройстве Linux? Сортировка -k1,2 эквивалентна сортировке -k1,1 -k2,2? почему папки в / home / $ USER / обычно имеют верхний регистр, когда все остальные папки имеют нижний регистр Система не может выделить память, даже если память доступна Как применять рекурсивные каталоги chmod без влияния на файлы? Что такое «битка ссылок»? Ubuntu server 16.04.1 LTS VPS, не может разрешить или пропинговать любое имя хоста или ip Разрешить имена NetBIOS через Samba> = 4.4 Изменение разрешения экрана в Fedora 16 Выход из менее нажатием клавиши ESC Есть ли журнал ошибок для процесса, который читает файл sudoers? ограничение нажатия на выбранные репозитории Mercurial с использованием принудительных команд `ssh` и` hg-ssh`
Как скрипт может выполнить себя через какой-то exec снова?
Я создаю скрипт для резервного копирования данных с сервера, он будет использовать ssh и scp много раз. Мой закрытый ключ защищен паролем, но я использую среду без какого-либо агента ssh.
Я хотел бы поставить условие на скрипт, чтобы проверить, запущен ли скрипт с использованием этого ответа . Если не запущен агент ssh, я хотел бы использовать exec ssh-agent <original script relaunch> .
Как это сделать?
Чтобы обернуть сам скрипт, используйте $0 (имя программы / скрипта) и $@ (расширенный список аргументов: тот же, что и "$1" "$2"... ).
if something; then exec ssh-agent "$0" "$@" fi
|
{
"url": "https://fliplinux.com/x447-29.html",
"source_domain": "fliplinux.com",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "34169",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:B2ZOMX6GR3XLRWL6JG664XGXH4ZC443M",
"WARC-Concurrent-To": "<urn:uuid:78310aa7-8263-453e-b3e0-7d1d5a7c5955>",
"WARC-Date": "2021-07-29T01:24:09Z",
"WARC-IP-Address": "66.45.244.235",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2WPQFSLZB732X6LE2A5CIQAB34JQF5ND",
"WARC-Record-ID": "<urn:uuid:88adf787-9495-43e5-9cff-e9bc0a4a968d>",
"WARC-Target-URI": "https://fliplinux.com/x447-29.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7d5bd64c-f3db-4e60-b04f-3d08a5b21c8f>"
},
"warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-104.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
17,
1028,
1029,
1088,
1089,
1277,
1278,
1480,
1481,
1498,
1499,
1634,
1635
],
"line_end_idx": [
17,
1028,
1029,
1088,
1089,
1277,
1278,
1480,
1481,
1498,
1499,
1634,
1635,
1682
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1682,
"ccnet_original_nlines": 13,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.009202449582517147,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01840491034090519,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.8619632124900818,
"rps_doc_frac_unique_words": 0.7613168954849243,
"rps_doc_mean_word_length": 5.58847713470459,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0.003067479934543371,
"rps_doc_unigram_entropy": 5.090763568878174,
"rps_doc_word_count": 243,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.010309279896318913,
"rps_doc_frac_chars_top_3gram": 0.013254789635539055,
"rps_doc_frac_chars_top_4gram": 0.016200289130210876,
"rps_doc_books_importance": -142.71917724609375,
"rps_doc_books_importance_length_correction": -129.93359375,
"rps_doc_openwebtext_importance": -65.9982681274414,
"rps_doc_openwebtext_importance_length_correction": -65.9982681274414,
"rps_doc_wikipedia_importance": -43.19668197631836,
"rps_doc_wikipedia_importance_length_correction": -32.73271179199219
},
"fasttext": {
"dclm": 0.5996063947677612,
"english": 0.00002099999983329326,
"fineweb_edu_approx": 1.914681315422058,
"eai_general_math": 0.000003580000111469417,
"eai_open_web_math": 0.12190979719161987,
"eai_web_code": 0.46156811714172363
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.076",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-4,523,373,545,554,023,000 |
What is meta? ×
Meta Stack Exchange is where users like you discuss bugs, features, and support issues that affect the software powering all 150 Stack Exchange communities.
Consider the following sequence of events:
1. Users A and B both start editing a post.
2. User A submits his edit.
3. User B submits his edit.
User B's edit cannot be submitted:
User A already edited the body of this post; your edit must be more substantive to override the current edit.
However, when user B does not have edit privileges, this is not happening: user B can submit a suggested edit based on the original version of the post, blissfully unaware of user A's concurrent edit.
Example: B suggested an edit at 15:54:36 which is clearly from the original version of the post even though A made an edit at 15:54:06. The suggested edit diff is shown from version 2, even though A made his suggestion from version 1.
In this case, B should have been prevented from submitting an edit and told to edit from the latest version of the post.
I've seen that happen countless times on SO, but it's often difficult to trace at SO's fast pace where multiple edits often muddy the waters. Here's a case with a clear timeline.
share|improve this question
What makes this one interesting is that in the review, we end up seeing the diff between the edited post and the result of applying the suggested edit to the unedited version. I've seen a few reviews like this where A's edit was substantial and B's was not, meaning that B's edit looked like vandalism (since now it looks like it's reversing a large portion of the earlier edit) – Dennis Meng Nov 7 '13 at 17:57
Here's another example of one that just happened here on Meta. An edit was made to remove a taunt at the end of the post, but a suggested was made on top of it, making it look like the suggested editor was adding in the taunt. – psubsee2003 Nov 7 '13 at 20:34
This used to happen with the "Possible Duplicate" links inserted by Community, in which if someone without editing privileges starts editing a post, but the question gets marked as a duplicate before the edit is submitted. The edit will therefore appear to remove the "Possible Duplicate" link. The team fixed this by making the link appear as an automatic banner at the top of the post instead of editing it into the post. – user215114 Nov 20 '13 at 22:44
2 Answers 2
Seeing as I have been a user for less than a year, I tried gaining reputation initially by editing posts. I can recount a few instances where this exact scenario occurred and my edit was rejected for being to insubstantial of a change based of the other users concurrent edit.
Though I don't think that its the end of the world if your concurrent edit didn't get accepted, because that would mean that the necessary edit was already made by the other user. Often times the edits I made that were rejected when submitted at roughly the same time as the other user were just fixing markdown or overall grammatical changes. If your edit is really that helpful and insightful, than its likely that both users didn't come up with the same exact edit and it might be accepted regardless.
But I do I agree, this might be helpful to users under 2k reputation, who look for reputation through edits or purely just enjoy making them.
share|improve this answer
User A does not need to suggest edits, he has substantial reputation (in excess of 2K) so his edits are not "suggested" but instead immediately implemented. User B is making a "suggested edit" which must go into a queue for approval.
There does appear to be some overlap which isn't accounted for, though. You're right that User B should be prompted that he can't submit the edit because the original post has already changed.
share|improve this answer
User B making a suggested edit is the case that this bug report is about. – Gilles Nov 21 '13 at 2:14
You must log in to answer this question.
Not the answer you're looking for? Browse other questions tagged .
|
{
"url": "http://meta.stackexchange.com/questions/204571/suggested-edits-can-be-submitted-even-after-a-concurrent-edit",
"source_domain": "meta.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2015-48",
"warc_metadata": {
"Content-Length": "73767",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DY7YARMRHKCRM4CKWVZIS35RVU6MSLMV",
"WARC-Concurrent-To": "<urn:uuid:15db8a3d-11e2-466a-b412-e47226da6383>",
"WARC-Date": "2015-11-27T19:10:57Z",
"WARC-IP-Address": "104.16.116.182",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:PIWWDFAZIS5SYGPPE4FXFLMG4MWNU3H4",
"WARC-Record-ID": "<urn:uuid:8668df4e-b3d6-4fdf-851f-b86292e66c69>",
"WARC-Target-URI": "http://meta.stackexchange.com/questions/204571/suggested-edits-can-be-submitted-even-after-a-concurrent-edit",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d58160d1-64a1-4fe9-8e0b-27b434b0ef4e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-71-132-137.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for Nov 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
16,
173,
174,
217,
218,
264,
294,
324,
325,
360,
361,
471,
472,
673,
674,
909,
910,
1031,
1032,
1211,
1212,
1240,
1245,
1657,
1662,
1922,
1927,
2384,
2385,
2397,
2398,
2675,
2676,
3181,
3182,
3324,
3325,
3351,
3352,
3586,
3587,
3780,
3781,
3807,
3812,
3914,
3915,
3956,
3957
],
"line_end_idx": [
16,
173,
174,
217,
218,
264,
294,
324,
325,
360,
361,
471,
472,
673,
674,
909,
910,
1031,
1032,
1211,
1212,
1240,
1245,
1657,
1662,
1922,
1927,
2384,
2385,
2397,
2398,
2675,
2676,
3181,
3182,
3324,
3325,
3351,
3352,
3586,
3587,
3780,
3781,
3807,
3812,
3914,
3915,
3956,
3957,
4023
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4023,
"ccnet_original_nlines": 49,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4344262182712555,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.037470728158950806,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16627635061740875,
"rps_doc_frac_unique_words": 0.39888423681259155,
"rps_doc_mean_word_length": 4.398884296417236,
"rps_doc_num_sentences": 35,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.098620414733887,
"rps_doc_word_count": 717,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.017121119424700737,
"rps_doc_frac_chars_dupe_6grams": 0.017121119424700737,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.012682310305535793,
"rps_doc_frac_chars_top_3gram": 0.014267600141465664,
"rps_doc_frac_chars_top_4gram": 0.015218770131468773,
"rps_doc_books_importance": -378.5264892578125,
"rps_doc_books_importance_length_correction": -378.5264892578125,
"rps_doc_openwebtext_importance": -219.72119140625,
"rps_doc_openwebtext_importance_length_correction": -219.72119140625,
"rps_doc_wikipedia_importance": -151.2261962890625,
"rps_doc_wikipedia_importance_length_correction": -151.2261962890625
},
"fasttext": {
"dclm": 0.3705846667289734,
"english": 0.9778524041175842,
"fineweb_edu_approx": 1.560200810432434,
"eai_general_math": 0.5150113701820374,
"eai_open_web_math": 0.633409857749939,
"eai_web_code": 0.04093056917190552
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "302.22",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social psychology"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
3,402,771,163,192,120,300 |
Lambda Architecture – Detailed Explanation
Lambda Architecture
Introduction
Data processing and data access using the Lambda Architecture are combined with a fast real-time stream pipeline in a data processing workflow. A common architecture model in IT and development toolkits as businesses strive to become more data-driven and event-oriented in the face of massive volumes of rapidly generated data, often referred to as “big data,” are businesses that are striving to become more data-oriented and event-oriented in the face of massive volumes of rapidly generated data, often referred to as “big data.”
We will discuss Lambda Architecture in great detail, including its applications, advantages, and disadvantages.
What is Lambda Architecture?
This architecture forms the basis for huge data ingestion and processing. It also captures and functions on historical data. We are trying to solve the problem of computing arbitrary functions as well as the problem of dealing with three layers of problems.
1. Batch layer
2. Serving layer
3. Speed layer
In the past, we called batch layers a “data lake” style system similar to Hadoop. They also used to be referred to as “batch layers.” This layer helps with batch queries in addition to supporting batch processing. We generate analytics or ad hoc using batch processing. The speed layer is similar to the batch layer in that it performs real-time analytics. It, however, calculates those analytics in real-time on the most recent data. The analytics calculated by the batch layer are referred to as analytics.
For example Fast-moving data that is zero to one hour old is the layer’s responsibility for calculating real-time analytics. It is based on data that one hour ago was fast-moving.
The third layer, which was formerly known as the serving layer, handled serving up results. Additionally, the speed and batch layers were both involved.
• The data arrives at both the batch layer and the speed layer in order to be processed.
• The batch layer performs two important functions:
• Managing the master dataset is part of the task.
• To pre-compute the batch views prior to the jobs starting.
• We also refer to this layer as a serving. The high latency of updates to the serving layer is compensated for by the speed layer, which handles recent data only. layer. It indexes batch views in order to make them low-latency, ad-hoc queries.
• The high latency of updates to the serving layer is compensated for by the speed layer, which handles recent data only.
• A batch view can be joined with a real-time view to answer any incoming query.
Data Sources
The Lambda Architecture can be used to conduct data analysis, and a variety of sources can be used to provide data. Apache Kafka, for instance, is not the original data source; rather, it is a between-store intermediary that is used to hold data in batches and at high speeds. The data is processed simultaneously to both the batch layer and the speed layer in order to speed up indexing.
Batch Layer
In preparation for indexing, the system saves batch views in a model that resembles a series of additions and deletions to a system of record, similar to what would occur when a change data capture (CDC) system generated a change record (CR). This model is commonly written as a comma-separated values (CSV) file. During a CDC system, the data is stored as immutable append only records and is processed using technologies such as Apache Hadoop.
Serving Layers
There are several layers to the Erlang Cache, including this one that indexes the latest batch of views and then also reindexes all data to fix a coding bug or to create different indexing schemes for different purposes. The serving layer must process the data in an extremely parallelized way to reduce the time to index the data. New data will be queued up for indexing in the next indexing job if they are not yet covered by an index.
Speed Layer
The speed layer helps fill in the gaps in the serving layer by indexing data that the serving layer is currently indexing as well as data that has recently been added. Data that has been added to the system after the indexing job started is expected to take a while to be indexed. The speed layer therefore needs to index the most recent data so that the gap between the most recent data and the most recent data can be narrowed. The stream processing software used to index incoming data in real time to reduce latency is usually leveraged to perform this function. In the Lambda Architecture, Apache Storm was the leading stream processing engine adopted prior to Lambda (but other technologies have since gained more popularity as alternatives). Nowadays, Hazelcast Jet, Apache Flink, and Apache Spark Streaming are all popular stream processing engines.
Query
The serving layer and the speed layer processes end user queries submitted to them by this component. The results of these processes are then consolidated by this component, resulting in near real-time analytics.
How Does Lambda Architecture Work?
The batch layers continue to index incoming data in batches. The speed layer, on the other hand, indexes all the new, unindexed data in near real-time to complement the batch/serving layers. This provides you with a detailed and constant view of data in the batch/serving layers, as well as a smaller index that is current and up-to-date.
After a batch indexing job has finished, the newly batch-indexed data is available for querying, so the speed layer’s copy of the same data and indexes is removed and cannot be used to speed up the serving layer. The serving layer then begins indexing the most recently produced data in the system, which has already been indexed by the speed layer (so it is available for querying at the speed layer). This ongoing cross-layer transfer ensures that all data is available for querying and that latency is kept low.
The speed layer discards the data copied by the serving layer when the serving layer completes a job.
Features of Lambda
A lambda architecture has the following benefits:
1. No software management is required, so there are no installation, maintenance, or administration steps.
2. To suit your application, you can either scale it automatically or manually adjust its capacity.
3. There are no human errors or outages in serverless applications, because they are built-in with fault tolerance and availability.
4. To be able to react to changing business and market conditions, you must be able to business agility.
Typical Lambda Applications
Lambda functions and triggers are the key components of developing on AWS Lambda. Code and runtime for Lambda functions are Lambda functions, while AWS services or applications that invoke them are triggers. In the following sections, you’ll learn about the following:
• A photo-sharing application stores user photos in an Amazon S3 bucket and creates thumbnail versions of each user’s photos for display on their profile page. You may implement a Lambda function to create a thumbnail automatically or you may choose to do it manually. A photo object can be retrieved from the S3 bucket by your Lambda function code, created a thumbnail version, and saved in a new S3 bucket.
• A DynamoDB table stores data and analyzes it. When you create a Lambda function that writes, updates, or deletes items in a table, DynamoDB streams publish item update events. In this scenario, the event data provides the item key, event name (such as insert, update, and delete), and other relevant data. You can aggregate raw data using a Lambda function to create custom metrics.
• A DynamoDB table stores data and analyzes it. When you create a Lambda function that writes, updates, or deletes items in a table, DynamoDB streams publish item update events. In this scenario, the event data provides the item key, event name (such as insert, update, and delete), and other relevant data. You can aggregate raw data using a Lambda function to create custom metrics.
• A Lambda function can be created to respond to events produced by a custom mobile app. You can, for example, configure a Lambda function to handle clicks within your custom mobile app.
Advantages of Lambda Architecture
A lambda architecture has the following advantages:
• Human-fault tolerance and robustness. The batch layer is human-fault tolerant, since it contains the entire data set from the beginning of time. Deleting and replacing corrupted batch views would restore all of the data from the point of corruption forward. All batch views can be swapped out for freshly created ones. The speed layer can be discarded. Since the system would be reset and running again as soon as new batch views are generated, the batch layer would take longer to process them.
• A Lambda Architecture is built with distributed systems at the top layers. Therefore, adding more machines will allow users to easily horizontally scale those systems.
• In Lambda Architecture, there is no one way to compute a batch view or perform a speed layer computation. Since it is a general paradigm, Lambda Architecture adopters do not have to limit themselves to a specific way of computing this or that batch view or layer computation. Batch views and speed layer computations may be designed to meet the needs of the data system if they are so inclined.
• New data enters the data system as extensibility. Data systems are not constrained by a set of batch views, as new views are needed as new data enters the system. Despite the constraints, resources can be expanded to allow for new views.
• Ad hoc queries are still possible even if the high-latency for these ad hoc queries is permissible. The batch layer can still be used for ad hoc queries that were not available in the batch views, assuming the high-latency for these ad hoc queries is permissible.
• The typical incarnation of Lambda Architecture relies on Apache Hadoop for the batch job layer and ElephantDB for the serving layer. Both can be maintained relatively easily.
• Debuggability, An input to the batch layer’s computation of batch views is always the entire data set, whereas the inputs and outputs for each layer in Lambda Architecture are not subject to movement. As a result, debugging computations and queries is considerably simpler in Lambda Architecture.
• The speed layer of Lambda Architecture provides real-time queries of the latest data set in low latency reads and updates.
Disadvantages of Lambda Architecture
A lambda architecture has the following disadvantages:
• A high level of coding is incurred because of the comprehensive processing that occurs.
• Every batch cycle that is not advantageous in certain situations is re-processed.
• In order to move or reorganize data modeled with Lambda architecture, it is difficult to model it with lambda architecture.
• The complexity of lambda architectures is often high. Both batch and streaming layers must be maintained as two distinct code bases, which may result in difficult debugging.
Conclusion
We have discussed Lambda Architecture and determined its functioning and applications. In addition, we have studied Lambda Architecture’s limitations and benefits. Lambda architecture is a software architecture pattern that is designed to encourage the separation of concerns and decoupling of logic from data. Lambda architecture is a popular approach to software development that aims to reduce the coupling between logic and data by decoupling logic from data. The key idea behind lambdas is that the logic of a program can be abstracted away from its data, allowing it to be written in a way that makes it easy to test and maintain. The most common use of lambdas is in development environments such as web frameworks, which often consist of a single set of code that is responsible for handling all the logic of the application. By separating logic from data, it becomes easier to test and maintain code, which can lead to more reliable applications. Lambda architecture can also be used to decouple logic from data in other areas of software development, such as databases and web services. By separating logic from data, it becomes easier to develop applications that are more maintainable and flexible.
Previous Post
MVC Architecture – Detailed Explanation
Next Post
Difference Between HTML and XML – XML vs HTML
Exit mobile version
|
{
"url": "https://www.interviewbit.com/blog/lambda-architecture/?amp=1",
"source_domain": "www.interviewbit.com",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "145435",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TPCOL7YZ7MOARCBHDPCH5JVKSOIREF43",
"WARC-Concurrent-To": "<urn:uuid:ee62f9e2-3161-4dfa-8186-006a31d595cb>",
"WARC-Date": "2024-06-25T19:33:05Z",
"WARC-IP-Address": "13.249.39.46",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OUFLNMVK2GXIHEG4YQRM7A7QJJAP5YTN",
"WARC-Record-ID": "<urn:uuid:2d8d87fc-c650-40fe-895f-1cfc9ece61e7>",
"WARC-Target-URI": "https://www.interviewbit.com/blog/lambda-architecture/?amp=1",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:32f096b7-9939-4e7e-ab0f-0b01534b9b5d>"
},
"warc_info": "isPartOf: CC-MAIN-2024-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-81\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
43,
44,
64,
65,
78,
79,
612,
613,
725,
726,
755,
756,
1014,
1015,
1032,
1051,
1068,
1069,
1579,
1580,
1760,
1761,
1914,
1915,
2006,
2060,
2115,
2180,
2427,
2551,
2634,
2635,
2648,
2649,
3038,
3039,
3051,
3052,
3498,
3499,
3514,
3515,
3953,
3954,
3966,
3967,
4825,
4826,
4832,
4833,
5046,
5047,
5082,
5083,
5422,
5423,
5938,
5939,
6041,
6042,
6061,
6062,
6112,
6113,
6222,
6324,
6459,
6566,
6567,
6595,
6596,
6865,
6866,
7277,
7664,
8051,
8240,
8241,
8275,
8276,
8328,
8329,
8829,
9001,
9400,
9642,
9910,
10089,
10390,
10517,
10518,
10555,
10556,
10611,
10612,
10704,
10790,
10918,
11096,
11097,
11108,
11109,
12320,
12321,
12335,
12336,
12376,
12377,
12387,
12388,
12434,
12435
],
"line_end_idx": [
43,
44,
64,
65,
78,
79,
612,
613,
725,
726,
755,
756,
1014,
1015,
1032,
1051,
1068,
1069,
1579,
1580,
1760,
1761,
1914,
1915,
2006,
2060,
2115,
2180,
2427,
2551,
2634,
2635,
2648,
2649,
3038,
3039,
3051,
3052,
3498,
3499,
3514,
3515,
3953,
3954,
3966,
3967,
4825,
4826,
4832,
4833,
5046,
5047,
5082,
5083,
5422,
5423,
5938,
5939,
6041,
6042,
6061,
6062,
6112,
6113,
6222,
6324,
6459,
6566,
6567,
6595,
6596,
6865,
6866,
7277,
7664,
8051,
8240,
8241,
8275,
8276,
8328,
8329,
8829,
9001,
9400,
9642,
9910,
10089,
10390,
10517,
10518,
10555,
10556,
10611,
10612,
10704,
10790,
10918,
11096,
11097,
11108,
11109,
12320,
12321,
12335,
12336,
12376,
12377,
12387,
12388,
12434,
12435,
12454
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 12454,
"ccnet_original_nlines": 112,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37889790534973145,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011533530429005623,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12259718030691147,
"rps_doc_frac_unique_words": 0.29087358713150024,
"rps_doc_mean_word_length": 4.904343605041504,
"rps_doc_num_sentences": 114,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.382241725921631,
"rps_doc_word_count": 2049,
"rps_doc_frac_chars_dupe_10grams": 0.1064782589673996,
"rps_doc_frac_chars_dupe_5grams": 0.15205493569374084,
"rps_doc_frac_chars_dupe_6grams": 0.13832221925258636,
"rps_doc_frac_chars_dupe_7grams": 0.1349388062953949,
"rps_doc_frac_chars_dupe_8grams": 0.1349388062953949,
"rps_doc_frac_chars_dupe_9grams": 0.1349388062953949,
"rps_doc_frac_chars_top_2gram": 0.046571798622608185,
"rps_doc_frac_chars_top_3gram": 0.018111249431967735,
"rps_doc_frac_chars_top_4gram": 0.006766839884221554,
"rps_doc_books_importance": -929.3697509765625,
"rps_doc_books_importance_length_correction": -929.3697509765625,
"rps_doc_openwebtext_importance": -564.5165405273438,
"rps_doc_openwebtext_importance_length_correction": -564.5165405273438,
"rps_doc_wikipedia_importance": -456.9416809082031,
"rps_doc_wikipedia_importance_length_correction": -456.9416809082031
},
"fasttext": {
"dclm": 0.1366521716117859,
"english": 0.9326367974281311,
"fineweb_edu_approx": 2.642019510269165,
"eai_general_math": 0.8195385336875916,
"eai_open_web_math": 0.31614941358566284,
"eai_web_code": 0.3992115259170532
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
6,513,256,686,940,197,000 |
Question Faster RAM speeds (DDR5)?
Jul 6, 2022
3
0
10
0
First, some backstory. I have a CD player that can render the half second before a track officially starts at 0:00. When I press play.
When this happens, I can hear a footstep, a voice, and/or the click on the recording console. This phenomenon is absent on my DAC (digital to analogue convertor).
Despite making 2 identical copies of a CD and playing the exact same files back using the computer + DAC, this cannot be replicated yet.
My laptop uses 2666 MHz DDR4 RAM (16 GB). Would upgrading to faster RAM open the possibility for this?
I'm using: Jriver
Jriver bit exact dithering
I2s [kernel streaming]: lowest/quickest layer of Windows Audio = best fidelity
Basically what I'm trying to replicate is the speed of a laser in femtoseconds or a handful of attoseconds, but on my laptop. The faster the data can be read and processed, the more accurate the output will be. Although these are not timing differences we can perceive directly, it translates to how the audio output sounds due to any latency in the chain, or any lack of latency.
My other option is getting a DAC with a master clock instead of crystal oscillators.
While I could have asked this question on an audio forum, I didn't because I would have received too many opinionated answers.
Since the Forte here is computers, I decided to ask here. :)
ASK THE COMMUNITY
TRENDING THREADS
|
{
"url": "https://forums.tomshardware.com/threads/faster-ram-speeds-ddr5.3769196/#post-22737840",
"source_domain": "forums.tomshardware.com",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "144649",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XDJXCD7WEYMECQ6FBHIERZDQWDJIISIX",
"WARC-Concurrent-To": "<urn:uuid:d47bdaa1-2184-49b2-a65f-7486e386ca95>",
"WARC-Date": "2022-08-14T12:50:35Z",
"WARC-IP-Address": "99.84.108.13",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OTVALBXADBOSJQEP2TVRHLNTRPXIZPO7",
"WARC-Record-ID": "<urn:uuid:25912c20-aa9f-4ea9-9ba9-c9ce487f8431>",
"WARC-Target-URI": "https://forums.tomshardware.com/threads/faster-ram-speeds-ddr5.3769196/#post-22737840",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3fb351b9-2ca7-4718-a78c-2bf2449fab95>"
},
"warc_info": "isPartOf: CC-MAIN-2022-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-209\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
35,
36,
48,
50,
52,
55,
57,
192,
193,
356,
357,
494,
495,
598,
599,
617,
644,
723,
724,
1105,
1106,
1191,
1192,
1319,
1320,
1381,
1383,
1384,
1402,
1403
],
"line_end_idx": [
35,
36,
48,
50,
52,
55,
57,
192,
193,
356,
357,
494,
495,
598,
599,
617,
644,
723,
724,
1105,
1106,
1191,
1192,
1319,
1320,
1381,
1383,
1384,
1402,
1403,
1419
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1419,
"ccnet_original_nlines": 30,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3694915175437927,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08474575728178024,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17966102063655853,
"rps_doc_frac_unique_words": 0.659919023513794,
"rps_doc_mean_word_length": 4.493927001953125,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.819208145141602,
"rps_doc_word_count": 247,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01621622033417225,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -115.40330505371094,
"rps_doc_books_importance_length_correction": -114.5624008178711,
"rps_doc_openwebtext_importance": -62.160499572753906,
"rps_doc_openwebtext_importance_length_correction": -62.160499572753906,
"rps_doc_wikipedia_importance": -44.234832763671875,
"rps_doc_wikipedia_importance_length_correction": -38.698543548583984
},
"fasttext": {
"dclm": 0.45818668603897095,
"english": 0.9230048656463623,
"fineweb_edu_approx": 1.8615061044692993,
"eai_general_math": 0.5010402202606201,
"eai_open_web_math": 0.17562401294708252,
"eai_web_code": 0.7481063604354858
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "780.1",
"labels": {
"level_1": "Arts",
"level_2": "Music",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-7,337,488,509,308,829,000 |
Wayfinding
UIUX 360 / 22-December-2022 / minute read
Wayfinding
Wayfinding refers to information systems that guide people through physical environments and enhance their understanding and experience of space. Wayfinding is especially important in complex built environments such as urban centers, health care, educatio
Author
What is Wayfinding?
Overview
Wayfinding refers to information systems that guide people through physical environments and enhance their understanding and experience of space. Wayfinding is especially important in complex built environments such as urban centers, health care, educational campuses, and transportation facilities.
Wayfinding cues are embedded to tell users where they are, how they got to a certain page, and where they want to go. The path that users have taken in the digital space can be indicated using symbols.
Comprehensive wayfinding systems often combine signs, maps, symbols, colors, and other communications. Additionally, they integrate mobile applications, digital displays, wireless technologies, and RFID.
LET’S WORK TOGETHER
Boost your design scope with Think 360
Book a call with us and get the party started!
Book A Demo
Post views: 499
|
{
"url": "https://think360studio.com/blog/wayfinding",
"source_domain": "think360studio.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "94264",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CGK5QA5UKE5NDCCL5TCUD4LS3QTUKFAF",
"WARC-Concurrent-To": "<urn:uuid:42441699-d2a6-43da-8396-c6f61c61a39b>",
"WARC-Date": "2024-03-02T20:23:00Z",
"WARC-IP-Address": "3.6.253.74",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:O2AFDXLW32LP6BDIDNUMWXPYHMZEQ2F4",
"WARC-Record-ID": "<urn:uuid:ec33a3fb-4bf7-411c-a9e1-c8b0d12c621d>",
"WARC-Target-URI": "https://think360studio.com/blog/wayfinding",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f655c5b3-6970-43f4-817a-c1125cc22c54>"
},
"warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-150\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
11,
53,
54,
65,
66,
322,
323,
330,
331,
351,
352,
361,
362,
662,
663,
865,
866,
1070,
1071,
1091,
1092,
1131,
1132,
1179,
1180,
1192
],
"line_end_idx": [
11,
53,
54,
65,
66,
322,
323,
330,
331,
351,
352,
361,
362,
662,
663,
865,
866,
1070,
1071,
1091,
1092,
1131,
1132,
1179,
1180,
1192,
1207
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1207,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3235294222831726,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03431373089551926,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1715686321258545,
"rps_doc_frac_unique_words": 0.5964912176132202,
"rps_doc_mean_word_length": 5.812865734100342,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.428441524505615,
"rps_doc_word_count": 171,
"rps_doc_frac_chars_dupe_10grams": 0.4245472848415375,
"rps_doc_frac_chars_dupe_5grams": 0.4245472848415375,
"rps_doc_frac_chars_dupe_6grams": 0.4245472848415375,
"rps_doc_frac_chars_dupe_7grams": 0.4245472848415375,
"rps_doc_frac_chars_dupe_8grams": 0.4245472848415375,
"rps_doc_frac_chars_dupe_9grams": 0.4245472848415375,
"rps_doc_frac_chars_top_2gram": 0.03219316154718399,
"rps_doc_frac_chars_top_3gram": 0.03621729835867882,
"rps_doc_frac_chars_top_4gram": 0.0583501011133194,
"rps_doc_books_importance": -75.28640747070312,
"rps_doc_books_importance_length_correction": -75.28640747070312,
"rps_doc_openwebtext_importance": -51.334564208984375,
"rps_doc_openwebtext_importance_length_correction": -51.33346176147461,
"rps_doc_wikipedia_importance": -30.412494659423828,
"rps_doc_wikipedia_importance_length_correction": -30.412494659423828
},
"fasttext": {
"dclm": 0.16042697429656982,
"english": 0.9257459044456482,
"fineweb_edu_approx": 3.184157609939575,
"eai_general_math": 0.14850884675979614,
"eai_open_web_math": 0.29171472787857056,
"eai_web_code": 0.05486255884170532
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
8,141,346,174,269,345,000 |
Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.
I built two programs, one using malloc and other one using mmap. The execution time using mmap is much less than using malloc.
I know for example that when you're using mmap you avoid read/writes calls to the system. And the memory access are less.
But are there any other reasons for the advantages when using mmap over malloc?
Thanks a lot
share|improve this question
Can I assume that your malloc program uses read/write or fread/fwrite to do some I/O on the file that you mmap in the other case? – Suppressingfire Nov 15 '09 at 23:45
Yes, actually I'm using read/write with malloc, mmap, and the using normal R/W calls. using R/W calls is faster than using malloc, I guess is because accessing the disk is faster than memory. – Peter Nov 16 '09 at 0:03
5
It's not that accessing the disk is faster than memory. Almost always, memory is much faster than disk, and malloc is not what's costing time. The mmap code is faster because for your program, mmap has resulted in either less disk access, or more efficient disk access, than whatever reads and writes you compared against. For instance, write ing the whole file actually sends all those bytes to disk. mmap just means if you modify the mmap ed data, then the OS will write the changes. So if you end up not modifying the whole file, you might only ever actually write a fraction of it. – Steve Jessop Nov 16 '09 at 0:39
"I guess is because accessing the disk is faster than memory." That is very false. Because you give no code, I'm not sure what exactly you're talking about with malloc being slower than mmap. Both functions map address space, they do not necessarily allocate any physical memory. Nor do they read files. Both will allocate physical memory as you use each page, but mmap will do so by reading it from disk, which will certainly be slower (hard page faults vs soft page faults.) Read/Write syscalls may or may not be faster than the hard page faults, depending on numerous factors. – Eloff May 27 '10 at 6:08
1
mmap allows for other uses also, like building a shared memory area with which your process can communicate with forked precesses. – tristopia Oct 22 '10 at 13:50
add comment
5 Answers
I assume that you are referring to using mmap and malloc for reading data from files. In that case you pretty much got the main point:
• using fread/fwrite you have to make many calls to the OS.
• using mmap you appear to get access to the entire file in one operation. This is not entirely true because the OS probably maps the file one memory page at a time, but it is still a lot faster.
share|improve this answer
1
To add to that, fread is buffered this means that if it is preceded by a fseek it will always fill his buffer completely. I had a program that read a file sequentially but preceding a fseek before every record (of size 32) reading 8192 bytes. So it ended up reading 256 times more data than necessary, plus reading was always two calls to the kernel. With mmap you have none (visible). – tristopia Oct 22 '10 at 13:44
add comment
mmap doesn't actually load the file into memory, so it will load faster, but editing it will be slower.
Another point is that mmap doesn't use any memory, but it takes up address space. On a 64bit machine, most of the memory address space will not have memory, so you could load up huge files, say 5gb, that you would not want to malloc.
share|improve this answer
add comment
Both malloc and mmap are slow at times. It depends mostly on the usage pattern:
mmap: The kernel paging subsystem works in page sized units. This means, if you want to read a whole page from a file and want to repeatedly do that(good localization) it will be fine with mmap. Contrary, if you map that 5 Gb file and do scattered access, you'll have the kernel swap pages in and out a lot. In addition to the actual I/O the page management will take some time. If you have concerns about latency, avoid this access pattern, as the Linux page reclaim mechanism tends to be bursty and will cause noticeable lags, and the cache poisoning will slow down other processes.
malloc: It is fine when you need memory that's not in page size units. but you cannot do things like mlock() sanely. In terms of I/O the speed is very much dependent on how you do it. fread/fwrite may map pages behind the scenes, or will do buffering in userspace. Localized access will be rather fast. read/write go directly through the kernel, so small distributed accesses will still cause I/O due to cache misses, but the actual data transferred from kernel->userspace will be slightly less. I do not know if that is measurable.
Unless mlock()'ed, user pages may be swapped out/written back at any time. This takes time, too. So on systems with little memory, the variant that maps the least memory will win. With Linux kernel every system has too little memory as the unused pages are used for caching I/O, and the kernel may take noticeable time to make them available if memory use or I/O is bursty.
share|improve this answer
add comment
Look folks, contrary to common believe, mmap is indeed a memory allocation function similar to malloc..
the mmaped file is one use of it.. you can use it as memory allocation function passing -1 as file descriptor..
so.. the common use is to use malloc for tiny objects and mmap for large ones..
this is a good strategy..
i use alloca() to for function scope only variables..
share|improve this answer
1
Normally the allocator will use mmap itself depending on the size of the area asked with malloc. On Solaris when asking for more than 128K you will get a MAP_ANON memory mapped block. On OS/X the limit is 64K if I remember correctly, other systems and allocation libraries will have other values. – tristopia Oct 22 '10 at 13:48
add comment
mmap doesn't actually read the file. It just maps it to address space. That's why it's so fast, there is no disc I/O until you actually access that region of address space.
malloc is simply a mapping of address space to memory
share|improve this answer
add comment
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://stackoverflow.com/questions/1739296/malloc-vs-mmap-in-c",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2014-15",
"warc_metadata": {
"Content-Length": "86481",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:U2AB33RAHFHJSP5XXHSX676LVDQSO5VD",
"WARC-Concurrent-To": "<urn:uuid:c367c626-2e70-4073-9bc6-4157b55dd003>",
"WARC-Date": "2014-04-18T06:08:09Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:5EXT5FL7FY2RKHJVEOBSML6HLJUIDRZQ",
"WARC-Record-ID": "<urn:uuid:87b67e64-441b-4e4a-82a7-fadbcbe7ee6c>",
"WARC-Target-URI": "http://stackoverflow.com/questions/1739296/malloc-vs-mmap-in-c",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:40f5d3b0-3779-4722-aca0-a8af7527af1b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-147-4-33.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-15\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for April 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
157,
158,
285,
286,
408,
409,
489,
490,
503,
504,
532,
537,
706,
711,
931,
935,
1556,
1561,
2169,
2173,
2337,
2349,
2350,
2360,
2361,
2496,
2497,
2559,
2757,
2783,
2787,
3206,
3218,
3219,
3323,
3324,
3558,
3559,
3585,
3597,
3598,
3678,
3679,
4264,
4265,
4798,
4799,
5173,
5174,
5200,
5212,
5213,
5317,
5318,
5430,
5431,
5511,
5512,
5538,
5539,
5593,
5594,
5620,
5624,
5954,
5966,
5967,
6140,
6141,
6195,
6196,
6222,
6234,
6235,
6247,
6248,
6250,
6258,
6259,
6337,
6338
],
"line_end_idx": [
25,
157,
158,
285,
286,
408,
409,
489,
490,
503,
504,
532,
537,
706,
711,
931,
935,
1556,
1561,
2169,
2173,
2337,
2349,
2350,
2360,
2361,
2496,
2497,
2559,
2757,
2783,
2787,
3206,
3218,
3219,
3323,
3324,
3558,
3559,
3585,
3597,
3598,
3678,
3679,
4264,
4265,
4798,
4799,
5173,
5174,
5200,
5212,
5213,
5317,
5318,
5430,
5431,
5511,
5512,
5538,
5539,
5593,
5594,
5620,
5624,
5954,
5966,
5967,
6140,
6141,
6195,
6196,
6222,
6234,
6235,
6247,
6248,
6250,
6258,
6259,
6337,
6338,
6428
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6428,
"ccnet_original_nlines": 82,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41516244411468506,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02671479992568493,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17184115946292877,
"rps_doc_frac_unique_words": 0.3560209274291992,
"rps_doc_mean_word_length": 4.375217914581299,
"rps_doc_num_sentences": 68,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.380312919616699,
"rps_doc_word_count": 1146,
"rps_doc_frac_chars_dupe_10grams": 0.01954527013003826,
"rps_doc_frac_chars_dupe_5grams": 0.06800957024097443,
"rps_doc_frac_chars_dupe_6grams": 0.03769446164369583,
"rps_doc_frac_chars_dupe_7grams": 0.026326289400458336,
"rps_doc_frac_chars_dupe_8grams": 0.01954527013003826,
"rps_doc_frac_chars_dupe_9grams": 0.01954527013003826,
"rps_doc_frac_chars_top_2gram": 0.010769840329885483,
"rps_doc_frac_chars_top_3gram": 0.021938569843769073,
"rps_doc_frac_chars_top_4gram": 0.010769840329885483,
"rps_doc_books_importance": -616.8896484375,
"rps_doc_books_importance_length_correction": -616.8896484375,
"rps_doc_openwebtext_importance": -384.9811096191406,
"rps_doc_openwebtext_importance_length_correction": -384.9811096191406,
"rps_doc_wikipedia_importance": -284.0232849121094,
"rps_doc_wikipedia_importance_length_correction": -284.0232849121094
},
"fasttext": {
"dclm": 0.7444413900375366,
"english": 0.9255108833312988,
"fineweb_edu_approx": 2.3825366497039795,
"eai_general_math": 0.22352224588394165,
"eai_open_web_math": 0.23275476694107056,
"eai_web_code": 0.043746888637542725
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-1,599,024,247,071,068,000 |
When you think about the amazing text analysis capabilities available in SPS08, and reflect that these have been further improved on recently, you will agree that checking out this video is an absolute must. In this video by the SAP HANA Academy, Tahir Hussain Babar aka Bob, takes us through Text Analysis for the Public Sector, a brand new feature for SPS09.
Today I have been working out of a library close to where I live in the Northern English countryside. This place is a bastion of old England with some of the most expensive real estate for hundreds of miles. The technologies I have covered over the last few blogs have made for amazing conversation starters. I have noticed that people just take for granted what software can do. The old thumb scanner monitor trick, we used to play in the IT classrooms on April 1 when I was a teacher, would catch out most people here. However, they are all sceptical about text analysis and search as a practical concept. By this I mean they cannot see how it works, though they acknowledge it would be useful, especially to governments.
In this video you will be learning about a new configuration type for SPS09 called extraction core for the public sector. This includes a set of entity types and rules for extracting information about events, persons or organisations and their relationship specifically orientated towards security.
Bob does this in SAP HANA Studio with a SPS08 and SPS09 servers. He starts by creating a SQL console in SPS08. He does this to explain the differences in syntax. The SPS08 server will contain a table with two columns stored as below.
After he has executed the code to create the table Bob demonstrates how to load data into it. He inputs these four rows. Bob uses this data to run a full text index as shown. He uses configuration type voice of customer because public sector did not exist in SPS08. You will notice that the line referring to the public sector has been commented out. Once the tables have been refreshed you will see another table generated above the first one which contains all your types of text analysis.
Bob then runs a SQL statement that will select four columns from the first table which uses the primary key as a reference. The four columns will include the headings for a primary key, the individual counter for each object that’s going to be extracted, the type of object extracted and the value or worth. Bob then executes and discusses the results.
Bob then states this type of analysis has been improved in SPS09 and goes onto to demonstrate how to perform the same task in SPS09 using the second schema. He uses the same statements in the same order, re-explaining what he is doing. He creates a table with two columns but then loads the data one row at a time. For the index instead of using the configuration, voice of customer, he uses the extraction core public sector.
Bob then uses the SQL statement he used before and then discusses the differences in results.
The type of person, organisation and alias are broken down to the extent that SPS09 recognises that the person Tahir Hussain Babar is also known as Bob.
After executing the SQL to insert the second row Bob highlights that 6 ft is a measure of height. In SPS09 you can analyse by sentence as well.
Whilst demonstrating the execution of the third row Bob shows that Berlin has been identified as a locality. This is not unique to SPS09 but the Travel_cameTo From is a new feature.
However, new to SPS09 are the exact spatial reference, direction and distance.
Bob then states that there are lots of other new features to do with spatial references on distances, cardinal directions and exact locations. There are also lots of other features customised for the public sector to do with military units, teams that you’ve been in and squadrons you could be a member of.
When I think of the public sector I think of hide bound convention, unwieldy bureaucratic obsession with administrative correctness and inherent desire to standardise everything. You can guess that I have had enough of its starchiness and relentless crush on ambition over the last twenty years. This technology will enable the public sector to see and take account of diversity in its deliberations. Instead of playing lip service to recognising difference, Text Analysis and Search will enable them leverage huge volumes of structured and unstructured data in real time and focus it in a way that makes sense, is easy to digest and use it to make better decisions. Data can be captured from a multiplicity of sources and analyzed in real time to avoid hazardous situations and enhance operations. Now that’s what I call making a difference.
To report this post you need to login first.
Be the first to leave a comment
You must be Logged on to comment or reply to a post.
Leave a Reply
|
{
"url": "https://blogs.sap.com/2014/12/16/when-you-actually-think-about-it-text-analysis-and-search-is-awfully-useful/",
"source_domain": "blogs.sap.com",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "52820",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BJEHI6S4YITKB2HEY5O5OAZXOSQEDX27",
"WARC-Concurrent-To": "<urn:uuid:b7921664-d15c-4201-b9c5-dd58470bcf49>",
"WARC-Date": "2017-05-25T03:20:27Z",
"WARC-IP-Address": "23.196.121.150",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:P6F3ZYWYUNBM4RRLVEU7TOVEOXRLABTH",
"WARC-Record-ID": "<urn:uuid:23850aa0-1e04-46d5-90e7-07a45a0e7327>",
"WARC-Target-URI": "https://blogs.sap.com/2014/12/16/when-you-actually-think-about-it-text-analysis-and-search-is-awfully-useful/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:817c0f3e-457f-476c-969a-12022f16e556>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-224-210.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-22\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for May 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
362,
363,
1092,
1093,
1393,
1394,
1631,
1632,
2127,
2128,
2483,
2484,
2914,
2915,
3009,
3010,
3163,
3164,
3308,
3309,
3492,
3493,
3572,
3573,
3881,
3882,
4728,
4729,
4774,
4775,
4807,
4808,
4861,
4862
],
"line_end_idx": [
362,
363,
1092,
1093,
1393,
1394,
1631,
1632,
2127,
2128,
2483,
2484,
2914,
2915,
3009,
3010,
3163,
3164,
3308,
3309,
3492,
3493,
3572,
3573,
3881,
3882,
4728,
4729,
4774,
4775,
4807,
4808,
4861,
4862,
4875
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4875,
"ccnet_original_nlines": 34,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4761904776096344,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.035714291036129,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.08116883039474487,
"rps_doc_frac_unique_words": 0.43801653385162354,
"rps_doc_mean_word_length": 4.62573766708374,
"rps_doc_num_sentences": 46,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.296380043029785,
"rps_doc_word_count": 847,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.010209290310740471,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02450229972600937,
"rps_doc_frac_chars_top_3gram": 0.02297089993953705,
"rps_doc_frac_chars_top_4gram": 0.013782540336251259,
"rps_doc_books_importance": -408.2720947265625,
"rps_doc_books_importance_length_correction": -408.2720947265625,
"rps_doc_openwebtext_importance": -224.7177734375,
"rps_doc_openwebtext_importance_length_correction": -224.7177734375,
"rps_doc_wikipedia_importance": -121.54134368896484,
"rps_doc_wikipedia_importance_length_correction": -121.54134368896484
},
"fasttext": {
"dclm": 0.054718971252441406,
"english": 0.9380102157592773,
"fineweb_edu_approx": 2.236309051513672,
"eai_general_math": 0.5170475840568542,
"eai_open_web_math": 0.2643741965293884,
"eai_web_code": 0.07364577054977417
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "352.4",
"labels": {
"level_1": "Social sciences",
"level_2": "Public administration and Military art and science",
"level_3": "Local government"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-4,046,831,920,324,956,000 |
How to Avoid Spam Filters When Sending Emails
How to Avoid Spam Filters When Sending Emails
Many, if not every email marketer faced this problem. Spam filters seem to be a huge obstacle on the way to the recipient’s Inbox, but in fact, it is a natural element of the email delivery process.
What are Spam filters?
Spam filters are filters designed to sort emails according to certain criteria. When you send an email, spam filters decide where to place it: to the Inbox, to a special tab, to a spam folder, or block it altogether.
It is important to understand that you can’t avoid spam filters. They play a massive role in the email deliverability process. That’s why our goal at GlockApps is to help our users understand how spam filters work, how mailbox providers use them, and how to get the emails filtered to the Inbox.
How Spam Filters Work
Spam filters can work on inbound and outbound emails. Mailbox providers use both methods to protect their customers from spam. Mostly, email senders are concerned with inbound filters.
Spam filters use algorithms and heuristics in their filtering technology. Algorithms are rules that tell a filter what to do. Heuristics submit email messages to thousands of predefined rules (algorithms). Each rule working on a message assigns a numerical score to the probability of the message being spam.
Types of spam filters that can affect the email deliverability and placement:
Gateway Filters
They are servers that receive all email messages sent to the company. They decide whether to allow the email to go further or not. The gateway spam filter learns to differentiate between legitimate emails and spam, based on all the messages sent to the company. Gateway email filters like Barracuda and Mimecast are often used by large businesses and organizations to prevent spam.
Hosted Filters
They belong to companies that have elaborated their own method to distinguish legitimate emails and spam based on content and sender reputation metrics. Hosted spam filters can influence inbound emails at the gateway (i.e., delivered or blocked) or after a message passed the gateway (i.e., Inbox or spam).
These spam filters have a wide range of clients, so they have a lot of information to use when deciding whether to deliver an email to the Inbox, spam, or quarantine folder, or block it. Examples of hosted spam filters are Cloudmark and MessageLabs.
Desktop Filters
They are installed on the end user’s computer and are configured by the user. So they can be one of the more difficult filters to get through. Examples of desktop spam filters are Outlook with the SmartScreen anti-spam filter from Microsoft, G-Lock SpamCombat, which uses a combination of filters including the Bayesian filter to separate legitimate messages from spam.
How Mailbox Providers Use Email Filters
Originally, filters were set up to determine spam emails and move them to the spam folder or block them. Today, some mailbox providers use email filters to organize messages in the tabbed Inbox (e.g., Primary, Promotions, Social, Newsletters, Commercial).
There are strong reasons for mailbox providers to filter email. Spam is boring, but it can also be dangerous. Mailbox providers use email filters to protect their customers from malware, viruses, and phishing emails and to reduce the load on their servers’ resources.
Mailbox providers look at three main aspects when making email filtering decisions:
1. Build Your Sender Reputation
When we talk about an email source, we mean the sending IP address and sending domain. These are the pillars on which a sender’s reputation is built.
IP Address
An IP address is a number listed in the domain name system. It is used to send email messages on behalf of your domain name. Marketers can use dedicated or shared IP addresses to send emails.
A dedicated IP address is an IP address that is assigned to a specific sender. It means that no other marketer or company can send emails from this IP address. The advantage of a dedicated IP address is that it gives a sender full control over the quality of messages sent from this IP address, and no other sender can influence it.
A shared IP address is used by multiple senders to deliver emails. The reputation of a shared IP address is influenced by all the senders who use it. What it means is, if one IP user is sending spam, everyone else will suffer from it.
It is recommended to go with a dedicated IP address if you send a high volume of emails, for example, 500,000+ per week. If you are a middle or small volume sender, you should go with a shared IP.
Read more: Dedicated vs Shared IPs: Which Should You Choose for Better Deliverability.
You can check your IP address reputation with a tool called Sender Score from Return Path. The Sender Score is determined by factoring the key reputation metrics such as complaints, spam trap hits, rejected messages, filtered messages, unknown users, blacklists, and your sending infrastructure.
Sender Score report from Return Path
Bounce Email Analytics
You should keep in mind that a high sender score does not guarantee Inbox placement. It indicates an Inbox potential since it is only one of many factors determining the mailbox providers’ filtering decisions.
When you get a new IP address, you need to warm it up to show the consistency and build a reputation for that IP. Many marketers are not aware of the consequences of sending a high volume of emails from a new IP address, so they start sending to their entire subscriber base from the first day.
Mailbox providers will apply throttling to emails sent from a new IP address. It means that they restrict the number of messages they can accept, and often filter emails into the junk folder or randomly place emails to Inbox or Spam until they see a consistent, legitimate volume from the IP address. Once the consistency is proven, the restriction is either removed or lifted.
Mailbox providers apply throttling measures for new IP addresses because spammers often try to trick the email filters by using multiple (and constantly changing) IP addresses or domains. So showing consistent traffic over your IP addresses helps mailbox providers determine you as a legitimate sender.
Let’s recap the key things to keep in mind regarding the sender IP address:
1. Don’t send emails from multiple IP addresses.
Spam filters recognize this technique, and using it puts you at risk for being blacklisted.
2. Warm up the new IP address.
To establish an IP address reputation, start sending slowly with a low volume, and increase the volume every day over a week or two.
3. Show consistency in send volume.
Once you built a reputation over an IP address, try to maintain consistent volume levels. Mailbox providers tend to filter emails out if they observe spikes in sent emails after periods of inactivity.
4. Monitor your IP reputation.
Check the sender score for your IP address with the Sender Score tool. Also, monitor the IP against blacklists with the GlockApps real-time blacklist monitor if you are on a dedicated IP address and de-list it if it gets blacklisted.
Remember that you can’t solve deliverability issues by moving to a new IP address. It can be a short-term measure, but in perspective, you need to make the appropriate changes to your list acquisition and email program. Otherwise, the issues will repeat on the new IP address.
Domain
A domain name is a registered name on the Internet. The domain reputation is as important as the sender IP reputation.
When talking about the sending domain, it is important to emphasize two things: domain authentication and domain reputation.
Domain Authentication
Authentication is the technology that allows the receiving server to confirm the sender’s identity. If the sender’s identity cannot be authenticated, mailbox providers can filter the message as spam, reject it, or submit to additional filters.
For legitimate senders, authentication is mandatory; it is essential to securing your brand and building a good reputation.
There are the three primary methods of authentication:
1. SPF (Sender Policy Framework): validates that a message is sent from an IP address that was authorized to send messages on the behalf of the indicated sending domain.
2. DKIM (DomainKeys Identified Mail): authenticates an email using public-key encryption. It signs a message in a way that is difficult to forge, proving that the message is sent from the indicated sending domain.
3. DMARC (Domain-based Message Authentication, Reporting, and Conformance): ensures that an email is properly authenticated against established DKIM and SPF standards and that any fraudulent activity that may be coming from legitimate domains is blocked.
Domain authentication helps build your domain reputation, protects your domain against email spoofing and phishing, and increases the chances of your emails to be delivered to the Inbox.
You can check your authentication records with the GlockApps spam testing tool and DMARC Analyzer.
For more information, check this ultimate guide about email authentication.
Domain Reputation
To make the filtering decisions about where the email should go, mailbox providers look at the metric called a domain reputation.
The data used to determine a domain reputation is:
Inbox placement rate – the percentage of the messages sent from the domain that went to the Inbox.
Spam placement rate – the percentage of the messages sent from the domain that went to the Spam folder due to the IP address, domain reputation, or content filters.
Complaint rate – the percentage of the recipients who reported the message as spam from the total number of the recipients who received the message.
“This is not spam” rate – the percentage of the recipients who marked the message as not spam from the total number of the recipients who received the message to their spam folder.
Hard bounce rate – the percentage of messages returned to the sender due to an invalid recipient’s email address from the total number of emails sent.
Spam complaints from the recipients have the worst impact on the domain reputation and deliverability. Mailbox providers strive to protect their customers from unwanted emails. Thus, your complaint rates should be below 0.1% for optimal Inbox placement. A complaint rate higher than 0.1% puts a red flag for the sender. If the issue is not fixed promptly, it will lead to the email rejections or blocks.
Here you can learn about other email deliverability metrics that influence email placement and filtering decisions.
2. Keep Your Subscribers Engaged for Better Deliverability
In addition to the sender’s reputation and authentication, mailbox providers take into account the recipient’s engagement. By the recipient engagement, we mean the actions the recipients take on received messages.
Email marketers look at such metrics as open rate, click rate, click-through rate, and conversion rate to measure the effectiveness of their email campaigns. Mailbox providers use other data points to measure if the email is wanted or not.
When a recipient reads, forwards, replies, moves an email to a folder, or adds the sender to the address book, it is positive user engagement. If a recipient deletes an email before opening it or hits the “this is spam” button, then it is an indication of disinterest and negative engagement.
The goal of email marketers is to send the right message to the right subscriber at the right time.
Learn More: How to Write Emails that Convert
Below are some best practices on how to achieve it:
1. Send to a confirmed opt-in list.
By confirming their subscription, recipients show interest in your emails. It increases the chances of positive user engagements with your messages.
2. Send what they requested.
If you allow the subscriber to choose what type of emails they want to receive, segment the subscriber list based on their choice and send the relevant content to each segment. If you don’t allow them to choose, then send with the frequency you promised during the opt-in process. Don’t send too much or too little. Consistency is one of the factors monitored by mailbox providers.
3. Send in the right format.
Create an email that opens correctly in most email clients and mobile devices. Optimize the images to make them load quickly. If you use a lot of images, make sure the content can be understood with the images turned off. A broken design can push a subscriber to hit the spam button.
4. Brand your emails.
To build recognition and trust, you’ll want to brand your ‘From’ name and email address. You can also brand links in your emails and the Subject lines. Also, email branding allows you to quickly search for desired emails in the Inbox, and sort them by folders.
5. Re-engage inactive subscribers.
If a recipient did not open any emails during the last 6-9 months, send a re-engagement campaign to bring them back. If you get an old list that has not been emailed for years, clean it from invalid addresses first and send a re-subscribe link to make sure those people still want to hear from you.
6. Monitor your open rate.
The open rate is an indication of the recipient’s interest. A drop in the open rate should concern you because it indicates that either your subscribers lost interest in what you send them and/or you have deliverability issues. Both issues should be addressed.
7. Watch your complaint rate.
Another indication of the subscriber’s interest is the complaint rate. Email service providers handle complaints from their users automatically. If you send through your own mail server, it is recommended to sign up for feedback loops with ISPs to receive email notifications when a complaint happens. If you observe a high complaint rate for your campaigns, make changes to your email program (change the template, content, style of writing, sending frequency, day, time, etc.) to re-engage the readers.
8. Track bounces.
A high bounce rate tells about a poor list quality. Verify your list for validity and change your list acquisition practice if you are not certain that the list is opt-in.
3. Watch Your Message Content and Formatting
Back in the early 2000s, content filtering was the primary way of defense. Checking the content for known spam patterns, keywords, blacklisted URLs, wrong HTML tags and other aspects was crucial.
Since then, mailbox providers have greatly developed their spam filters. Content is still checked, but such factors as the IP address and domain reputation and recipient engagement are the priority.
When a remote mail server receives a message, at first it considers authentication, reputation, blacklists, and information from the headers. This check allows the receiving system to decide whether to allow, filter, or block the incoming message based on the IP or domain reputation and authentication.
If no issues with authentication and reputation are identified, the content of the message is evaluated. Based on the information in the message body and the subject line, a mailbox provider decides whether to deliver the message to the Inbox or Spam.
The content analysis consists of scanning every element of an email: header, footer, HTML code, subject line, text, images, URLs, text-to-image ratio, and attachments.
A popular method of analyzing content is called “fingerprinting.” Fingerprints are hashes or checksums of content. Once the fingerprints are created, they can be compared to other fingerprints. Spam filters compare fingerprints of the content of the inbound email to fingerprints belonging to an email that has been reported as spam. If the similarity is confirmed, the email will likely be sent to the Spam folder.
How to Pass through Content Filters
It is fair to say that there is no golden rule for an “ideal” content that can pass through all content filters because every mailbox provider has its own filtering criteria for the content of incoming messages.
However, following the tips below you can certainly increase the chances for your messages to pass content filtering:
1. Balance text and images.
A message created as a single large image will be blocked by filters as this is a common spammer technique. Keep your text-to-image ratio 65:35.
2. Don’t embed large images.
Embedded images increase the message size and slow down the speed of message processing and loading. Optimize the images with the TinyPNG tool and upload them to your web server. Then link to the images from the message. This method allows you to keep the optimal message size and reduce the speed of message processing.
3. Use correct HTML.
Some spam filters check the HTML tags and source. They can block the message if they observe a code used in spam emails to trick the filters. Make sure your HTML is clean from syntax and formatting errors.
4. Test your email.
Testing message content and email placement in a pre-flight tool such as GlockApps will help you identify potential spam filter issues and deliverability problems before you send.
Once the test reveals that your content is flagged by spam filters and your email went to Spam, continue testing to determine what is causing the issues (links, images, text, sending email/domain, etc.). Email testing can take time, but it’s well worth the effort.
To sum it up, spam filters are a part of the email delivery process. Without them, we would be overloaded with spam. Filters help us get the email we want and keep unwanted mail out of our Inbox. Thus, the goal of email marketers is to follow the best email marketing practices to have a good sender reputation and send emails to the Inbox.
To learn about what mailbox providers think of the list quality and how they measure the sender reputation and recipient engagement read 9 Ways to Simplify Your Path to the Recipient’s Inbox
GlockApps Spam Testing for Marketers and Agencies
GlockApps Spam Testing
GlockApps Spam Testing
Test your email placement
Scan your emails through all the major spam filters before you send them.
Improve your deliverability
Get actionable tips for improving the delivery rate of every email you send.
Increase your revenue
Improve your overall email performance by delivering more emails to the inbox.
Related Posts
Sales Emails That Work
Today, an average email user usually gets 150-200 emails a day. People swiftly go through the emails, focusing on the Read more
Email Marketing Tips
Navigating the ever-changing world of email marketing requires a deep understanding of how to effectively communicate with your audience. Successful Read more
Plain Text vs. HTML Emails
You may have heard a lot about the revival of plain text emails these days. In an era when email Read more
Tracking pixels are small 1 x 1 GIFs that email marketers or email services embed in email HTML code to Read more
AUTHOR BIO
Julia Gulevich is an email marketing expert and customer support professional at Geminds LLC with more than 15 years of experience. Author of numerous blog posts, publications, and articles about email marketing and deliverability.
|
{
"url": "https://glockapps.com/blog/avoid-spam-filters/",
"source_domain": "glockapps.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "142264",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DH53OUHP7OLVLWT77OCPSWGYHQAW5NH2",
"WARC-Concurrent-To": "<urn:uuid:d586b225-f720-4e50-8188-498800466436>",
"WARC-Date": "2024-05-26T17:45:07Z",
"WARC-IP-Address": "50.28.76.96",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:URSKDGQWDS3QGB3EABCXRRLIY5XWF6SC",
"WARC-Record-ID": "<urn:uuid:f0de3f6a-c87c-4ca2-aecd-7651d81738e7>",
"WARC-Target-URI": "https://glockapps.com/blog/avoid-spam-filters/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:dd3ba26f-bfbe-44cb-a22e-26b3de62b687>"
},
"warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-212\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
46,
47,
93,
94,
293,
294,
317,
318,
535,
536,
832,
833,
855,
856,
1041,
1042,
1351,
1352,
1430,
1431,
1447,
1448,
1830,
1831,
1846,
1847,
2154,
2155,
2405,
2406,
2422,
2423,
2793,
2794,
2834,
2835,
3091,
3092,
3360,
3361,
3445,
3446,
3478,
3479,
3629,
3630,
3641,
3642,
3834,
3835,
4168,
4169,
4404,
4405,
4602,
4603,
4690,
4691,
4987,
4988,
5025,
5048,
5049,
5259,
5260,
5555,
5556,
5934,
5935,
6238,
6239,
6315,
6316,
6367,
6368,
6464,
6465,
6498,
6499,
6636,
6637,
6675,
6676,
6881,
6882,
6915,
6916,
7154,
7155,
7432,
7433,
7440,
7441,
7560,
7561,
7686,
7687,
7709,
7710,
7954,
7955,
8079,
8080,
8135,
8136,
8308,
8524,
8781,
8782,
8969,
8970,
9069,
9070,
9146,
9147,
9165,
9166,
9296,
9297,
9348,
9349,
9448,
9449,
9614,
9615,
9764,
9765,
9946,
9947,
10098,
10099,
10503,
10504,
10620,
10621,
10680,
10681,
10895,
10896,
11136,
11137,
11430,
11431,
11531,
11532,
11577,
11578,
11630,
11631,
11667,
11668,
11817,
11818,
11847,
11848,
12230,
12231,
12260,
12261,
12545,
12546,
12568,
12569,
12830,
12831,
12866,
12867,
13166,
13167,
13194,
13195,
13456,
13457,
13487,
13488,
13993,
13994,
14012,
14013,
14185,
14186,
14231,
14232,
14428,
14429,
14628,
14629,
14933,
14934,
15186,
15187,
15355,
15356,
15772,
15773,
15809,
15810,
16022,
16023,
16141,
16142,
16170,
16171,
16316,
16317,
16346,
16347,
16668,
16669,
16690,
16691,
16897,
16898,
16918,
16919,
17099,
17100,
17365,
17366,
17707,
17708,
17899,
17900,
17950,
17951,
17974,
17997,
17998,
18024,
18025,
18099,
18100,
18128,
18129,
18206,
18207,
18229,
18230,
18309,
18310,
18324,
18325,
18348,
18349,
18477,
18478,
18499,
18500,
18659,
18660,
18687,
18688,
18795,
18796,
18910,
18911,
18922,
18923
],
"line_end_idx": [
46,
47,
93,
94,
293,
294,
317,
318,
535,
536,
832,
833,
855,
856,
1041,
1042,
1351,
1352,
1430,
1431,
1447,
1448,
1830,
1831,
1846,
1847,
2154,
2155,
2405,
2406,
2422,
2423,
2793,
2794,
2834,
2835,
3091,
3092,
3360,
3361,
3445,
3446,
3478,
3479,
3629,
3630,
3641,
3642,
3834,
3835,
4168,
4169,
4404,
4405,
4602,
4603,
4690,
4691,
4987,
4988,
5025,
5048,
5049,
5259,
5260,
5555,
5556,
5934,
5935,
6238,
6239,
6315,
6316,
6367,
6368,
6464,
6465,
6498,
6499,
6636,
6637,
6675,
6676,
6881,
6882,
6915,
6916,
7154,
7155,
7432,
7433,
7440,
7441,
7560,
7561,
7686,
7687,
7709,
7710,
7954,
7955,
8079,
8080,
8135,
8136,
8308,
8524,
8781,
8782,
8969,
8970,
9069,
9070,
9146,
9147,
9165,
9166,
9296,
9297,
9348,
9349,
9448,
9449,
9614,
9615,
9764,
9765,
9946,
9947,
10098,
10099,
10503,
10504,
10620,
10621,
10680,
10681,
10895,
10896,
11136,
11137,
11430,
11431,
11531,
11532,
11577,
11578,
11630,
11631,
11667,
11668,
11817,
11818,
11847,
11848,
12230,
12231,
12260,
12261,
12545,
12546,
12568,
12569,
12830,
12831,
12866,
12867,
13166,
13167,
13194,
13195,
13456,
13457,
13487,
13488,
13993,
13994,
14012,
14013,
14185,
14186,
14231,
14232,
14428,
14429,
14628,
14629,
14933,
14934,
15186,
15187,
15355,
15356,
15772,
15773,
15809,
15810,
16022,
16023,
16141,
16142,
16170,
16171,
16316,
16317,
16346,
16347,
16668,
16669,
16690,
16691,
16897,
16898,
16918,
16919,
17099,
17100,
17365,
17366,
17707,
17708,
17899,
17900,
17950,
17951,
17974,
17997,
17998,
18024,
18025,
18099,
18100,
18128,
18129,
18206,
18207,
18229,
18230,
18309,
18310,
18324,
18325,
18348,
18349,
18477,
18478,
18499,
18500,
18659,
18660,
18687,
18688,
18795,
18796,
18910,
18911,
18922,
18923,
19154
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 19154,
"ccnet_original_nlines": 258,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3892100155353546,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017891550436615944,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.131021186709404,
"rps_doc_frac_unique_words": 0.25611692667007446,
"rps_doc_mean_word_length": 4.9056243896484375,
"rps_doc_num_sentences": 208,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.596412181854248,
"rps_doc_word_count": 3147,
"rps_doc_frac_chars_dupe_10grams": 0.016582459211349487,
"rps_doc_frac_chars_dupe_5grams": 0.06820832192897797,
"rps_doc_frac_chars_dupe_6grams": 0.037828728556632996,
"rps_doc_frac_chars_dupe_7grams": 0.02966706082224846,
"rps_doc_frac_chars_dupe_8grams": 0.0261691901832819,
"rps_doc_frac_chars_dupe_9grams": 0.016582459211349487,
"rps_doc_frac_chars_top_2gram": 0.015740379691123962,
"rps_doc_frac_chars_top_3gram": 0.005182019900530577,
"rps_doc_frac_chars_top_4gram": 0.005829770117998123,
"rps_doc_books_importance": -1701.48974609375,
"rps_doc_books_importance_length_correction": -1701.48974609375,
"rps_doc_openwebtext_importance": -981.1573486328125,
"rps_doc_openwebtext_importance_length_correction": -981.1573486328125,
"rps_doc_wikipedia_importance": -844.9898681640625,
"rps_doc_wikipedia_importance_length_correction": -844.9898681640625
},
"fasttext": {
"dclm": 0.21939492225646973,
"english": 0.9229657053947449,
"fineweb_edu_approx": 2.0733940601348877,
"eai_general_math": 0.019477959722280502,
"eai_open_web_math": 0.07072197645902634,
"eai_web_code": 0.18890392780303955
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.87",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-4,977,275,277,828,320,000 |
Close
1Password tips for careful net users
Posted on by Mike Evans
Transient
Security is big news. We are all vulnerable and no more so than in the area of password selection. We joke about 1234 passwords but they do actually exist. And millions use their year of birth as a PIN number when any idiot knows this is likely to be between, say, 1930 and 1995.
The very people who use "easy" passwords are also adept at choosing a different one for every site or app. They think they are being careful but inevitably they end up forgetting everything.
That's why there are so many request for password resets and that's precisely why the Apple iCloud reset system was so easy for hackers to penetrate.
1Password can put your mind at rest. This lifesaver app, which is available for iPhone, iPad and Mac, allows you to generate secure and unique passwords for every application. It remembers them, of course, and it can automatically insert credentials to every site you visit.
All this information is safe in an encrypted keychain file which syncs across all your devices.
As the name suggests, you need remember only one password and that's the master password for your 1Password system. Make it unique, don't use it anywhere else, and all your data is safe.
Of all the apps I use daily, 1Password is the best investment I've ever made. If you are not already a user, check it out here. If you are a fan, there is always something new to learn, as you will see in
∞ Permalink
Sitemap: http://macfilos.com/sitemap.xml
|
{
"url": "http://macfilos.com/home/2012/8/9/1password-tips-for-careful-net-users",
"source_domain": "macfilos.com",
"snapshot_id": "crawl=CC-MAIN-2018-30",
"warc_metadata": {
"Content-Length": "137996",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:X3QTDXH3DD4FZJJYR2D7WAEZWTPQIEKO",
"WARC-Concurrent-To": "<urn:uuid:9d306870-1979-4c15-98e0-ac5b8db6b690>",
"WARC-Date": "2018-07-20T07:02:52Z",
"WARC-IP-Address": "65.39.205.57",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:N7I6XEPMXOGZC7TRK57HBP6L2V7ANC5G",
"WARC-Record-ID": "<urn:uuid:84dcb6f6-d1a8-4d6b-9dde-5e09feee6308>",
"WARC-Target-URI": "http://macfilos.com/home/2012/8/9/1password-tips-for-careful-net-users",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:311f155a-b9de-489c-8249-16daf07c9ab3>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-159-151-213.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-30\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for July 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
6,
7,
44,
45,
69,
70,
80,
81,
361,
362,
553,
554,
704,
705,
980,
981,
1077,
1078,
1265,
1266,
1471,
1472,
1484
],
"line_end_idx": [
6,
7,
44,
45,
69,
70,
80,
81,
361,
362,
553,
554,
704,
705,
980,
981,
1077,
1078,
1265,
1266,
1471,
1472,
1484,
1524
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1524,
"ccnet_original_nlines": 23,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.48580440878868103,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00946372002363205,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14195583760738373,
"rps_doc_frac_unique_words": 0.6292134523391724,
"rps_doc_mean_word_length": 4.509363174438477,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.87432861328125,
"rps_doc_word_count": 267,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.013289039954543114,
"rps_doc_frac_chars_top_3gram": 0.013289039954543114,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -146.82664489746094,
"rps_doc_books_importance_length_correction": -136.17063903808594,
"rps_doc_openwebtext_importance": -83.22854614257812,
"rps_doc_openwebtext_importance_length_correction": -83.22854614257812,
"rps_doc_wikipedia_importance": -67.15520477294922,
"rps_doc_wikipedia_importance_length_correction": -54.26859664916992
},
"fasttext": {
"dclm": 0.02308226004242897,
"english": 0.948307991027832,
"fineweb_edu_approx": 1.7430392503738403,
"eai_general_math": 0.17261219024658203,
"eai_open_web_math": 0.20763427019119263,
"eai_web_code": 0.057992398738861084
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.822",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
6,456,294,980,553,039,000 |
Beefy Boxes and Bandwidth Generously Provided by pair Networks
Do you know where your variables are?
PerlMonks
Best Macro Syntax for Perl?
by Jeffrey Kegler (Hermit)
on Nov 11, 2007 at 23:27 UTC ( #650192=perlquestion: print w/replies, xml ) Need Help??
Jeffrey Kegler has asked for the wisdom of the Perl Monks concerning the following question:
I'm writing a parser which allows Perl callbacks, and I want to make some macros available to the programmer writing the callbacks. An example probably explains most easily. For a grammar rule to do addition
Sum ::= Addend + Addend
the user might want to supply a callback like
sub { <first Addend> + <second Addend> }
In this example, the things in angle brackets are the macros. The idea is that the parser replaces these before the callbacks are compiled.
My question is what's the best syntax to use for macros? I want macros that are easy to use, but on the other hand don't get in the way of Perl constructs, and on the third hand (?) aren't impossible to parse out. Obviously there are tradeoffs. The angle brackets of the above example are, to my mind, not the right choice. They too easily are mistaken for other Perl syntax, both by the programmer and the parser. Note that my primary question is not how to program the macro substitution, but what syntax to use for the macros?
I'm sure other modules have tackled this same issue. Pointers to modules which monks feel did macros right would be very helpful.
thanks, jeffrey kegler
Replies are listed 'Best First'.
Re: Best Macro Syntax for Perl?
by FunkyMonk (Canon) on Nov 12, 2007 at 00:10 UTC
Assuming you're not thinking about a source filter (which I always avoid)...
What about using Template::Toolkit as the processing engine? You could let the user decide what syntax to use, defaulting to [% ... %]
The more I think about it, the better I like this idea (letting the user specify his own choice of macro syntax, but defaulting to [% ... %]).
Re: Best Macro Syntax for Perl?
by Joost (Canon) on Nov 11, 2007 at 23:40 UTC
Well, you could go for JSP/ASP style constructs like <% %> and <%= %> which at least are fairly unambiguous but a bit clunky. Without using special unicode characters it's hard to see how you could reduce the construct to a single (pair of) character(s) - update: if you're using Perl, that is. In Lisp, it could probably be done a lot easier.
There are a few modules on CPAN that already parse this kind of syntax. Or take a look at what other template modules on CPAN use.
Update2: depending on your exact needs, you could also get away with things like sub { $1 + $2 } but that more or less implies you're not parsing whatever is in $1 and $2 at compile time.
Re: Best Macro Syntax for Perl?
by TGI (Parson) on Nov 12, 2007 at 17:01 UTC
Re: Best Macro Syntax for Perl?
by pemungkah (Priest) on Nov 13, 2007 at 00:34 UTC
A couple random observations, thrown out sort of at random.
I've implemented macro substitution code in Perl; the real core of it was this, stolen shamelessly from Mastering Regular Expresssions:
# Define base variable detector: any (possibly-nested) angle-bracketed + string. # Patterns to extract <variables> or >variables< from a string. my $out_angled; $out_angled = qr/ < ( [^<>] | (??{$out_angled}) )* > /x; # open angle-bracket then ... # non-angle chars ... # or ... # another angle-bracketed item ... # if there are any .. +. # and a close angle +-bracket
This detects arbitrarily-nested angle-bracket expressions. You would want to, I think, switch the macro brackets to a different string - angle-brackets were a requirement in my application. Fortunately the strings I was substituting in didn't need angle brackets for anything else.
If you want to look at the complete class that implements macro expansion, take a look at App::SimpleScan::Substitution, which is the core of it. This routine as supplied is probaly horrendous overkill, because it was concerned with doing combinatorial substitutions (i,e, var1 has 3 values, var2 has 2, and var3 has 7, so a string containing all 3 variables results in 3*2*7 = 42 different expansions). You might consider gutting it to only do single substitutions, or simply only allow your variable dictionaries to have one value per variable.
The code is pretty complex, because it allows for expansions that create strings that need to be re-expanded, because the values are actually further macro expansions. This lets you define really complex relationships "down the tree", and simply substitute one variable in at the top to expand all the possibilities.
Like I said, probably total overkill for your application, but maybe the variable substitution and detection stuff will help. Probably the most difficult part of the code was remembering what had already been substituted so that recurrences of the variable (from expansion of other constructs) were substituted with the same value.
The pattern match at the top will help a lot in discovering the macro variables. You should be able to rewire it for multi-character delimiters like this:
$templaty = qr/ \[% # open delim ( (?!%\]) # not-a-closer lookahead . # anything else )* # as many as there are %\] # close delim /x; @vars = ($string =~ $templaty);
Take a look at pages 261 to 281 of Mastering Regular Expressions. Those 20 pages were worth the entire purchase cost of the book.
Log In?
Username:
Password:
What's my password?
Create A New User
Node Status?
node history
Node Type: perlquestion [id://650192]
Front-paged by tye
help
Chatterbox?
and all is quiet...
How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (6)
As of 2016-12-10 15:23 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
On a regular basis, I'm most likely to spy upon:
Results (163 votes). Check out past polls.
|
{
"url": "http://www.perlmonks.org/index.pl?node_id=650192",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2016-50",
"warc_metadata": {
"Content-Length": "29183",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RHGWNW2WIM6UXF3AGHX3UXCNDVKPSA3L",
"WARC-Concurrent-To": "<urn:uuid:381f1ca7-55a8-4dd6-b050-d9b4576c1146>",
"WARC-Date": "2016-12-10T15:26:09Z",
"WARC-IP-Address": "209.197.123.153",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:SL6X3ZG3OY76YA23M4N2NV5K3PSLNKIE",
"WARC-Record-ID": "<urn:uuid:c99ab12d-d5bf-4c6d-b428-5efb01de6f50>",
"WARC-Target-URI": "http://www.perlmonks.org/index.pl?node_id=650192",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:75702c1b-e6e2-4a78-a518-7cd4027a94d1>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-31-129-80.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-50\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for November 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
63,
101,
103,
115,
116,
144,
145,
172,
260,
353,
354,
562,
586,
632,
673,
813,
814,
1344,
1345,
1475,
1476,
1499,
1500,
1533,
1565,
1615,
1696,
1697,
1836,
1837,
1986,
2018,
2064,
2412,
2413,
2548,
2549,
2741,
2742,
2774,
2819,
2851,
2902,
2966,
2967,
3107,
3108,
3481,
3767,
3768,
4319,
4320,
4641,
4642,
4978,
4979,
5138,
5139,
5309,
5443,
5444,
5452,
5462,
5472,
5473,
5493,
5511,
5524,
5537,
5575,
5594,
5599,
5611,
5631,
5632,
5670,
5683,
5720,
5747,
5757,
5770,
5782,
5793,
5811,
5864,
5865,
5866,
5867,
5868,
5869,
5870,
5871,
5872,
5873,
5874,
5875,
5876,
5877
],
"line_end_idx": [
63,
101,
103,
115,
116,
144,
145,
172,
260,
353,
354,
562,
586,
632,
673,
813,
814,
1344,
1345,
1475,
1476,
1499,
1500,
1533,
1565,
1615,
1696,
1697,
1836,
1837,
1986,
2018,
2064,
2412,
2413,
2548,
2549,
2741,
2742,
2774,
2819,
2851,
2902,
2966,
2967,
3107,
3108,
3481,
3767,
3768,
4319,
4320,
4641,
4642,
4978,
4979,
5138,
5139,
5309,
5443,
5444,
5452,
5462,
5472,
5473,
5493,
5511,
5524,
5537,
5575,
5594,
5599,
5611,
5631,
5632,
5670,
5683,
5720,
5747,
5757,
5770,
5782,
5793,
5811,
5864,
5865,
5866,
5867,
5868,
5869,
5870,
5871,
5872,
5873,
5874,
5875,
5876,
5877,
5923
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5923,
"ccnet_original_nlines": 98,
"rps_doc_curly_bracket": 0.0010130000300705433,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37579113245010376,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021360760554671288,
"rps_doc_frac_lines_end_with_ellipsis": 0.020202020183205605,
"rps_doc_frac_no_alph_words": 0.25474685430526733,
"rps_doc_frac_unique_words": 0.43995749950408936,
"rps_doc_mean_word_length": 4.734325408935547,
"rps_doc_num_sentences": 69,
"rps_doc_symbol_to_word_ratio": 0.017405059188604355,
"rps_doc_unigram_entropy": 5.50589656829834,
"rps_doc_word_count": 941,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04040404036641121,
"rps_doc_frac_chars_dupe_6grams": 0.028731759637594223,
"rps_doc_frac_chars_dupe_7grams": 0.023344559594988823,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.014814809896051884,
"rps_doc_frac_chars_top_3gram": 0.01683502085506916,
"rps_doc_frac_chars_top_4gram": 0.020202020183205605,
"rps_doc_books_importance": -589.3391723632812,
"rps_doc_books_importance_length_correction": -589.3391723632812,
"rps_doc_openwebtext_importance": -304.480712890625,
"rps_doc_openwebtext_importance_length_correction": -304.480712890625,
"rps_doc_wikipedia_importance": -212.39382934570312,
"rps_doc_wikipedia_importance_length_correction": -212.39382934570312
},
"fasttext": {
"dclm": 0.12316303700208664,
"english": 0.9201622605323792,
"fineweb_edu_approx": 1.5549386739730835,
"eai_general_math": 0.7588145136833191,
"eai_open_web_math": 0.44071292877197266,
"eai_web_code": 0.4681128263473511
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-2,708,352,794,447,721,500 |
General Questions about the AI Benchmark implementation
shi_ath
New member
I have been reading some papers on ML Benchmarking. I went through your papers on AI Benchmark and have gotten a general idea about the benchmark and calculation of the summary AI score.
1. A higher K score (AI summary) is a better score, is that correct? I was curious to know more about how to interpret all the results you have obtained in the details of the summary AI score.
2. How to interpret the terms 'Target', 'Per-label error', 'Accuracy, digits'?
3. Further, while setting the tests I was curious to know more about the meaning of 'Limit Max Initialization Time'.
4. Furthermore, could you please guide me to any resources about the different acceleration methods in the settings and how they are related? Whether they can work together or not and why?
5. Is there any method to implement the benchmark on a SoC through the ADB interface? (If apk can not be installed and there is no python interface)
Andrey Ignatov
Administrator
Staff member
A higher K score (AI summary) is a better score, is that correct?
Yes, K here states for thousands (10K = 10000).
How to interpret the terms 'Target', 'Per-label error', 'Accuracy, digits'?
Target: max error not affecting the results (accuracy / visual)
Per-label error: average per-label L1 loss (=mean absolute error) between the produced outputs and goldens
Accuracy, digits: the number of accurately predicted digits after the decimal point (compared to the goldens)
meaning of 'Limit Max Initialization Time'.
On some device, several models might fail to initialize due to outdated NN HAL. Thus, after waiting for 30-120s depending on the model, the test is automatically terminated if the network was not initialized. The above option disables this functionality.
resources about the different acceleration methods in the settings and how they are related
NNAPI: https://www.tensorflow.org/lite/performance/nnapi
GPU delegate: https://www.tensorflow.org/lite/performance/gpu
Hexagon NN delegate: https://www.tensorflow.org/lite/performance/hexagon_delegate
Neuron delegate:
(video is in Chinese, but the slides are in English).
Whether they can work together or not and why?
Only one particular option can be used (TFLite restriction).
If apk can not be installed and there is no python interface
No, in all cases one needs to install the APK first.
shi_ath
New member
Hello Andrey,
I was trying to implement this benchmark on some Android devices. I had a couple of more questions regarding this.
1. For which of the Qualcomm chipsets can this benchmark use Qualcomm Hexagon NN? I tried a couple of chipsets and it did not seem to work for them.
2. For the custom tflite models as benchmark, how are the test cases generated? If I use a audio detection model for eg, will it have audio samples to test the model?
3. In the tutorial on the AI Benchmark website, Is the python interface to the OS through ADB or CLI?
4. I was reading on score calculation in AI Benchmark and it said, 'The result of the memory test introduces a multiplicative contribution to the final score', does that mean higher the memory score, the K score is multiplied with some proportional coefficient to that?
5. It also said 'The normalization coefficients for each test are computed based on the best results of the current SoC generation', what are normalization coefficients and what does normalization mean in this context?
6. For the information on the tests, Object Recognition/ Classification (Mobilenet- v2) (INT8 + FP32), does it mean this test was carried out using INT8 precision and FP32 precision separately?
7. Is the AI Benchmark apk open source?
Would be glad if you/ your team could guide me on this.
Last edited:
Andrey Ignatov
Administrator
Staff member
Hi @shi_ath,
For which of the Qualcomm chipsets can this benchmark use Qualcomm Hexagon NN?
There were some known issues with the Hexagon NN delegate in the beta build. Please download the final AI Benchmark V5 version where all problems are fixed.
The Hexagon NN delegate is generally compatible with the Snapdragon 820-865, 710-765, 660-690 and 460-480. Note, however, that the access to the Hexagon DSP might be blocked by some vendors.
will it have audio samples to test the model?
It will generate random input data using the specified input value boundaries.
Is the python interface to the OS through ADB or CLI
There is no python interface, but you can launch the benchmark using ADB and use touch events to navigate through menus / options.
does that mean higher the memory score, the K score is multiplied with some proportional coefficient to that?
does it mean this test was carried out using INT8 precision and FP32 precision separately
Yes.
Is the AI Benchmark apk open source?
AI Benchmark Mobile is not open source, AI Benchmark alpha is open source.
ibai
New member
Hi,
First of all thank you for this nice tool/app. I have tested the latest version (V5) with a Snapdragon 888 phone with a custom model (YOLOv5 int8), and it was really fast when running with the QNN delegate (HTP) with about 10ms inference for the large model, which is almost 10x faster than running the fp16 version of the same model in TFLite with the GPU delegate.
My question is, is the QNN delegate using SNPE SDK? Or, is it some custom delegate wrapping that library?
Thanks,
Ibai
Top
|
{
"url": "https://ai-benchmark.net/index.php?threads/general-questions-about-the-ai-benchmark-implementation.41/",
"source_domain": "ai-benchmark.net",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "68949",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CAAC745FD7LPUKG57NIWWNZ4HVPFPBH6",
"WARC-Concurrent-To": "<urn:uuid:885744c5-226b-4981-a4ce-415cfaa464e3>",
"WARC-Date": "2022-05-18T03:13:30Z",
"WARC-IP-Address": "3.16.147.173",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IULSL5WUCT6SCRZTTQWN622YDELRL7UO",
"WARC-Record-ID": "<urn:uuid:59d02cd7-ed00-484b-8b36-d55097532adb>",
"WARC-Target-URI": "https://ai-benchmark.net/index.php?threads/general-questions-about-the-ai-benchmark-implementation.41/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9f64ad9f-36ca-4e12-9499-4d8aa7a7e5a2>"
},
"warc_info": "isPartOf: CC-MAIN-2022-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-189\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
56,
57,
65,
66,
77,
264,
457,
536,
653,
842,
991,
993,
994,
1009,
1010,
1024,
1037,
1103,
1151,
1152,
1228,
1292,
1399,
1509,
1510,
1554,
1809,
1810,
1902,
1959,
2021,
2103,
2120,
2174,
2175,
2222,
2283,
2284,
2345,
2398,
2400,
2401,
2409,
2410,
2421,
2435,
2436,
2551,
2552,
2701,
2702,
2869,
2870,
2972,
2973,
3243,
3244,
3463,
3464,
3658,
3659,
3699,
3700,
3756,
3758,
3771,
3772,
3787,
3788,
3802,
3815,
3828,
3829,
3908,
3909,
4066,
4067,
4258,
4259,
4305,
4306,
4385,
4386,
4439,
4440,
4571,
4572,
4682,
4772,
4773,
4778,
4779,
4816,
4817,
4892,
4894,
4895,
4900,
4901,
4912,
4916,
4917,
5284,
5285,
5391,
5392,
5400,
5405,
5407
],
"line_end_idx": [
56,
57,
65,
66,
77,
264,
457,
536,
653,
842,
991,
993,
994,
1009,
1010,
1024,
1037,
1103,
1151,
1152,
1228,
1292,
1399,
1509,
1510,
1554,
1809,
1810,
1902,
1959,
2021,
2103,
2120,
2174,
2175,
2222,
2283,
2284,
2345,
2398,
2400,
2401,
2409,
2410,
2421,
2435,
2436,
2551,
2552,
2701,
2702,
2869,
2870,
2972,
2973,
3243,
3244,
3463,
3464,
3658,
3659,
3699,
3700,
3756,
3758,
3771,
3772,
3787,
3788,
3802,
3815,
3828,
3829,
3908,
3909,
4066,
4067,
4258,
4259,
4305,
4306,
4385,
4386,
4439,
4440,
4571,
4572,
4682,
4772,
4773,
4778,
4779,
4816,
4817,
4892,
4894,
4895,
4900,
4901,
4912,
4916,
4917,
5284,
5285,
5391,
5392,
5400,
5405,
5407,
5410
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5410,
"ccnet_original_nlines": 109,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36513760685920715,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06055045872926712,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1844036728143692,
"rps_doc_frac_unique_words": 0.36764705181121826,
"rps_doc_mean_word_length": 4.831448078155518,
"rps_doc_num_sentences": 67,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.205638885498047,
"rps_doc_word_count": 884,
"rps_doc_frac_chars_dupe_10grams": 0.23554202914237976,
"rps_doc_frac_chars_dupe_5grams": 0.3437134325504303,
"rps_doc_frac_chars_dupe_6grams": 0.3118707537651062,
"rps_doc_frac_chars_dupe_7grams": 0.2954811453819275,
"rps_doc_frac_chars_dupe_8grams": 0.26972606778144836,
"rps_doc_frac_chars_dupe_9grams": 0.26972606778144836,
"rps_doc_frac_chars_top_2gram": 0.02317957952618599,
"rps_doc_frac_chars_top_3gram": 0.013111679814755917,
"rps_doc_frac_chars_top_4gram": 0.01053616963326931,
"rps_doc_books_importance": -413.8013000488281,
"rps_doc_books_importance_length_correction": -413.8013000488281,
"rps_doc_openwebtext_importance": -266.1867370605469,
"rps_doc_openwebtext_importance_length_correction": -266.1867370605469,
"rps_doc_wikipedia_importance": -173.31260681152344,
"rps_doc_wikipedia_importance_length_correction": -173.31260681152344
},
"fasttext": {
"dclm": 0.7410228848457336,
"english": 0.919879674911499,
"fineweb_edu_approx": 1.6510368585586548,
"eai_general_math": 0.777621328830719,
"eai_open_web_math": 0.2296862006187439,
"eai_web_code": 0.5217703580856323
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-7,419,732,410,655,269,000 |
SkipToMainContent
Privacy
How ridesharing services can take your privacy for a ride
Written by a NortonLifeLock employee
In cities around the globe, using ridesharing services has become a way of life. Just as “Google” has become a verb, so have “Uber” and “Lyft,” to name just two of the better-known ridesharing companies.
The convenience of always-available cars and drivers paired with easy-to-use apps, plus a selection of ride and pricing options makes for a great blend of technology and transportation. However, because these services require riders’ information, such as real-time location data and a form of payment, they could pose risks to riders’ information and privacy if that information is mishandled.
Ridesharing: the good and the bad
Traditional car services like taxis have fallen in popularity1 in part because ridesharing services offer more conveniences: instantaneous confirmation of ride requests, less-expensive rates, and typically a newer and more varied “fleet” of cars since they employ individual contracted drivers who use their personal cars.
While a popular concept, ridesharing services do have their issues, because they’re not regulated. They still need to comply with local driving regulations; however, it is still within each service’s purview to decide how to conduct background checks for applicants or what type of insurance is needed. Luckily, there’s a human “safety check” system that a lot of these companies use. Each rider can rate their driver, and the driver can rate the passengers in the same manner. If a driver falls below a certain rating, they are unable to drive for the company.
What types of data do ridesharing companies collect?
Ridesharing services like Uber and Lyft rely on GPS-enabled smartphones, since their apps need to know the location of both drivers and ride requestors. However, if riders don’t turn off location access after completing their rides the app could potentially track and collect data around the clock on where the user is, where they go, and, sometimes, even how long they stay there.
In addition to location data, a lot of these services require the user to link to a social networking account, usually Facebook, as a way of verifying identity. By doing so, the user then grants that company access to the personal information that is in their Facebook account.
These services are also cashless, so in order to use them, the user must store a valid credit card in their account.
What can be done with your data?
How’s this for a cautionary tale? A ridesharing company once had a launch party in a new city where they displayed in real-time the full names and destinations of their riders. Luckily, nothing but some extreme heat from the press came from that privacy gaffe. But it did raise the issue of how these ridesharing companies store, handle, and even safeguard riders’ privacy.
No matter what type of service or goods a company provides, when it comes to questions about user privacy, it’s always a good idea to review the company’s privacy policy. A good privacy policy should clearly spell out what data the company intends to access, save, and transmit to third parties. It’s not common knowledge that these companies can and do share this data with third parties. Sometimes it can be general usage statistics that are sold to advertisers, and sometimes data is sent to third parties in order to support the functionality of the app.
Data breaches are increasing as cybercriminals find company databases to be treasure houses of personal information. These breaches can happen during the transmission of this data or even through the third parties once they receive the data. In 2015, Uber suffered one such data breach that exposed the personal information of 50,000 drivers. 2
Before you install that app …
No two companies are alike, and ridesharing services are no exception. Before you commit to choosing a company by installing their app, follow these suggestions:
1. Research each company for any online reviews or news stories about them to get a better sense of the company charter, culture, attitudes, and any worrisome issues that customers may be discussing.
2. Once you’ve narrowed down your choices, examine the privacy policy of each app. Yes, doing so can be a cumbersome task as there is a lot of information to go through, but the information you find should be clear about the company’s intent to use your data. If there is anything you do not feel comfortable with, do some more research or look into other service providers.
Data and privacy shouldn’t be mutually exclusive
In today’s technology-driven world, data collection, privacy, and protection should be at the forefront of everyone’s minds, from consumer to developer. We now live in a world where the paradigm has shifted from bank robberies to data breaches, simply because all of our personal information can be easily accessed in one place from companies that store that data. Uber, for one, is beginning to address this issue.
On July 13, 2017, Uber released an open-source differential privacy tool nicknamed Elastic Sensitivity. Differential privacy means that the identity of individuals is stripped out of user data before it is analyzed, helping to anonymize and protect a person’s privacy. Uber’s new tool alerts their data analysts of the likely privacy implications of any queries they make on Uber data before it can be analyzed. 3
Until all companies, ridesharing or otherwise, are held accountable for how they collect, store, and protect our data, responsibility ultimately falls to consumers to be aware of the companies they conduct business with and to be diligent, educated, and aware of how their data is handled when using services and apps.
Disclaimers and references:
Symantec Corporation, the world’s leading cyber security company, allows organizations, governments, and people to secure their most important data wherever it lives. More than 50 million people and families rely on Symantec’s Norton and LifeLock comprehensive digital safety platform to help protect their personal information, devices, home networks, and identities.
Copyright © 2020 NortonLifeLock Inc. All rights reserved. NortonLifeLock, the NortonLifeLock Logo, the Checkmark Logo, Norton, LifeLock, and the LockMan Logo are trademarks or registered trademarks of NortonLifeLock Inc. or its affiliates in the United States and other countries. Firefox is a trademark of Mozilla Foundation. Android, Google Chrome, Google Play and the Google Play logo are trademarks of Google, LLC. Mac, iPhone, iPad, Apple and the Apple logo are trademarks of Apple Inc., registered in the U.S. and other countries. App Store is a service mark of Apple Inc. Alexa and all related logos are trademarks of Amazon.com, Inc. or its affiliates. Microsoft and the Window logo are trademarks of Microsoft Corporation in the U.S. and other countries. The Android robot is reproduced or modified from work created and shared by Google and used according to terms described in the Creative Commons 3.0 Attribution License. Other names may be trademarks of their respective owners.
|
{
"url": "https://malaysia.norton.com/internetsecurity-privacy-ridesharing-privacy-ride.html",
"source_domain": "malaysia.norton.com",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "71289",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:76MZDAJZT4UB3VOPSHKF5XGY26UCV6J7",
"WARC-Concurrent-To": "<urn:uuid:e8354608-f4b5-4c83-a270-f602b78fb8a4>",
"WARC-Date": "2020-12-02T00:26:15Z",
"WARC-IP-Address": "104.90.65.140",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JVGFCB3HGVAINL4FYPY5KBML7VPAY2BV",
"WARC-Record-ID": "<urn:uuid:342a8abc-cab6-4cb8-8f0f-b34cc2359e26>",
"WARC-Target-URI": "https://malaysia.norton.com/internetsecurity-privacy-ridesharing-privacy-ride.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:475260b1-b6c3-4cb3-bf57-52286af939d1>"
},
"warc_info": "isPartOf: CC-MAIN-2020-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-29.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
18,
19,
27,
28,
86,
87,
88,
125,
126,
128,
129,
333,
334,
728,
729,
763,
764,
1087,
1088,
1650,
1651,
1704,
1705,
2087,
2088,
2366,
2367,
2484,
2485,
2518,
2519,
2893,
2894,
3453,
3454,
3799,
3800,
3830,
3831,
3993,
3994,
4196,
4573,
4574,
4623,
4624,
5040,
5041,
5455,
5456,
5775,
5776,
5778,
5779,
5780,
5808,
6177,
6178
],
"line_end_idx": [
18,
19,
27,
28,
86,
87,
88,
125,
126,
128,
129,
333,
334,
728,
729,
763,
764,
1087,
1088,
1650,
1651,
1704,
1705,
2087,
2088,
2366,
2367,
2484,
2485,
2518,
2519,
2893,
2894,
3453,
3454,
3799,
3800,
3830,
3831,
3993,
3994,
4196,
4573,
4574,
4623,
4624,
5040,
5041,
5455,
5456,
5775,
5776,
5778,
5779,
5780,
5808,
6177,
6178,
7169
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7169,
"ccnet_original_nlines": 58,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4145985543727875,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0058394200168550014,
"rps_doc_frac_lines_end_with_ellipsis": 0.01694915071129799,
"rps_doc_frac_no_alph_words": 0.14963504672050476,
"rps_doc_frac_unique_words": 0.4285714328289032,
"rps_doc_mean_word_length": 5.072299480438232,
"rps_doc_num_sentences": 64,
"rps_doc_symbol_to_word_ratio": 0.0007299300050362945,
"rps_doc_unigram_entropy": 5.510689735412598,
"rps_doc_word_count": 1148,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.008243169635534286,
"rps_doc_frac_chars_dupe_6grams": 0.008243169635534286,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.019577540457248688,
"rps_doc_frac_chars_top_3gram": 0.011677829548716545,
"rps_doc_frac_chars_top_4gram": 0.009788770228624344,
"rps_doc_books_importance": -506.9484558105469,
"rps_doc_books_importance_length_correction": -506.9484558105469,
"rps_doc_openwebtext_importance": -335.5219421386719,
"rps_doc_openwebtext_importance_length_correction": -335.5219421386719,
"rps_doc_wikipedia_importance": -179.1575469970703,
"rps_doc_wikipedia_importance_length_correction": -179.1575469970703
},
"fasttext": {
"dclm": 0.04851603880524635,
"english": 0.9434004426002502,
"fineweb_edu_approx": 1.8732538223266602,
"eai_general_math": 0.00332552008330822,
"eai_open_web_math": 0.013741309754550457,
"eai_web_code": 0.058666590601205826
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.8",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "388.0285",
"labels": {
"level_1": "Social sciences",
"level_2": "Commerce and Communication and traffic",
"level_3": "Local transit"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "13",
"label": "News (Org.)"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-8,672,929,074,198,338,000 |
[linux-dvb] Confused in Channel Setup.
clemens at dwf.com clemens at dwf.com
Mon Mar 14 04:03:33 CET 2005
As usual, Im sitting here confused.
Ive actually got to the point where things 'work' with my Air2PC card,
my ATI Remote Wonder (RF) Remote, and MythTV.
I was able to record a program last night and play it today.
I am now trying to 'clean' things up, and not having all that much luck.
At one time or another I have had 'only' the DT stations in this area in
my Program Guide *once* each (I only have the DT stations in my Zap2it
database).
However after doing the 'channel scan' from
Setup->Channel Editor->Scan for Channels->Full Scan
and then a scan on each channel found,
and having done a 'mythfilldatabase', I have all sorts of crap in
my channel listing.
(a) all of the NON-digital channels have appeared.
(b) Most of the Digital channels appear twice, once with a channel number
like 11_1 and then again as 111
What exactly am I suposed to do, and Ill go back and delete everything and
do it all again. With all the different things Ive read, for different card
types, Im confused.
Reg.Clemens
reg at dwf.com
More information about the linux-dvb mailing list
|
{
"url": "https://www.linuxtv.org/pipermail/linux-dvb/2005-March/000716.html",
"source_domain": "www.linuxtv.org",
"snapshot_id": "crawl=CC-MAIN-2016-44",
"warc_metadata": {
"Content-Length": "3676",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YGDOFMC4TUI5DEQTJXR7IQQ656ULMV3X",
"WARC-Concurrent-To": "<urn:uuid:64d82a6f-57bb-41b2-9345-ec97b3e03da5>",
"WARC-Date": "2016-10-24T20:31:32Z",
"WARC-IP-Address": "130.149.80.248",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:YHHCBRFGDSDUREWZZXAVO4FRXK7LMI22",
"WARC-Record-ID": "<urn:uuid:4e8ed745-a237-42c5-9f8d-3438da1a6234>",
"WARC-Target-URI": "https://www.linuxtv.org/pipermail/linux-dvb/2005-March/000716.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:36eb878c-aa45-437a-9abe-5ef2315e6903>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-6-4.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-44\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for October 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
39,
40,
78,
107,
108,
109,
145,
146,
217,
263,
264,
325,
326,
399,
400,
473,
545,
556,
557,
601,
602,
662,
663,
702,
703,
769,
789,
790,
845,
923,
963,
964,
1039,
1116,
1136,
1137,
1138,
1190,
1245,
1246,
1247,
1248,
1249,
1250,
1251
],
"line_end_idx": [
39,
40,
78,
107,
108,
109,
145,
146,
217,
263,
264,
325,
326,
399,
400,
473,
545,
556,
557,
601,
602,
662,
663,
702,
703,
769,
789,
790,
845,
923,
963,
964,
1039,
1116,
1136,
1137,
1138,
1190,
1245,
1246,
1247,
1248,
1249,
1250,
1251,
1300
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1300,
"ccnet_original_nlines": 45,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4029304087162018,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04395604133605957,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21611721813678741,
"rps_doc_frac_unique_words": 0.5980861186981201,
"rps_doc_mean_word_length": 4.339713096618652,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.5973944664001465,
"rps_doc_word_count": 209,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.026460859924554825,
"rps_doc_frac_chars_top_3gram": 0.03307607024908066,
"rps_doc_frac_chars_top_4gram": 0.03307607024908066,
"rps_doc_books_importance": -114.89564514160156,
"rps_doc_books_importance_length_correction": -114.89564514160156,
"rps_doc_openwebtext_importance": -66.92506408691406,
"rps_doc_openwebtext_importance_length_correction": -66.92506408691406,
"rps_doc_wikipedia_importance": -57.90492248535156,
"rps_doc_wikipedia_importance_length_correction": -57.90491485595703
},
"fasttext": {
"dclm": 0.027846569195389748,
"english": 0.9339665770530701,
"fineweb_edu_approx": 0.8985728025436401,
"eai_general_math": 0.04975711926817894,
"eai_open_web_math": 0.316528856754303,
"eai_web_code": 0.021662890911102295
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
9,124,330,431,054,150,000 |
51220
Выделение контурных признаков изображения
Лабораторная работа
Информатика, кибернетика и программирование
Цель работы: Изучить методы выделения контурных признаков изображения и применить полученные знания на практике. Задание: Cоставить программу, выполняющую выделение контурных признаков изображения.
Русский
2014-02-07
287.94 KB
10 чел.
Министерство образования Республики Беларусь
Учреждение образования
Брестский государственный технический университет
Кафедра ЭВМ и С
Лабораторная работа № 4
«Выделение контурных признаков изображения»
Выполнил:
студент гр. Э-41 ФЭИС
Якубчик А.Н.
Проверил:
Кузьмицкий Н.Н.
Брест 2013
Цель работы: Изучить методы выделения контурных признаков изображения и применить полученные знания на практике.
Задание: Cоставить программу, выполняющую выделение контурных признаков изображения.
1. Необходимые характеристики:
2. изображение хранится во внешнем файле;
3. программа должна выводить исходное и результирующее изображения;
4. возможность выбора уровня порогового ограничения;
5. перед выделением контура происходит фильтрация изображения любым фильтром.
6. возможность изменения порога при роботе с контурным препаратом.
Тип фильтра:
1. курсовые маски (возможность выбора любой маски: С,Ю,З,В,С-З,С-В,...)
Код программы:
using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Data;
using System.Drawing;
using System.Linq;
using System.Text;
using System.Windows.Forms;
namespace COS4
{
public partial class Form1 : Form
{
Bitmap image1 = null;
Bitmap image_2 = null;
int width = 0;
int height = 0;
public Form1()
{
InitializeComponent();
}
private void button1_Click(object sender, EventArgs e)
{
openFileDialog1.ShowDialog();
Bitmap image = new Bitmap(openFileDialog1.FileName);
width = image.Width;
height = image.Height;
image1 = image;
pictureBox1.Image = image;
pictureBox1.Show();
}
private void button2_Click(object sender, EventArgs e)
{
Bitmap image2 = new Bitmap(width, height);
pictureBox1.Image = image2;
image_2 = image2;
for (int i = 0; i < height; i++)
{
for (int j = 0; j < width; j++)
{
Color c = image1.GetPixel(j, i);
Double RED = Convert.ToDouble(c.R * 0.2989);
Double GREEN = Convert.ToDouble(c.G * 0.587);
Double BLUE = Convert.ToDouble(c.B * 0.114);
int GREY = Convert.ToInt32(RED + GREEN + BLUE);
image2.SetPixel(j, i, Color.FromArgb(c.R, c.G, c.B));
image2.SetPixel(j,i,Color.FromArgb(GREY,GREY,GREY));
}
}
pictureBox1.Refresh();
}
private void button3_Click(object sender, EventArgs e)
{
string input = textBox1.Text;
double k = Convert.ToDouble(input);
Bitmap image3 = new Bitmap(width, height);
pictureBox2.Image = image3;
double G = 0;
int[,] maska = new int[3, 3];
for (int i = 1; i < height - 1; i++)
{
for (int j = 1; j < width - 1; j++)
{
for (int county = 0; county < 3; county++)
{
for (int countx = 0; countx < 3; countx++)
{
maska[county, countx] = image_2.GetPixel(j + countx - 1, i + county - 1).R;
}
}
if (radioButton1.Checked == true)
{
G = (maska[0, 0] + maska[0, 1] + maska[0, 2] + maska[1, 0] - 2 * maska[1, 1] + maska[1, 2] - maska[2, 0] - maska[2, 1] - maska[2, 2]);
}
if (radioButton2.Checked == true)
{
G = (maska[2, 0] + maska[2, 1] + maska[2, 2] + maska[1, 0] - 2 * maska[1, 1] + maska[1, 2] - maska[0, 0] - maska[0, 1] - maska[0, 2]);
}
if (radioButton3.Checked == true)
{
G = (maska[2, 0] + maska[2, 1] - maska[2, 2] + maska[1, 0] - 2 * maska[1, 1] - maska[1, 2] + maska[0, 0] + maska[0, 1] - maska[0, 2]);
}
if (radioButton4.Checked == true)
{
G = (maska[2, 1] - maska[2, 0] + maska[2, 2] - maska[1, 0] - 2 * maska[1, 1] + maska[1, 2] - maska[0, 0] + maska[0, 1] + maska[0, 2]);
}
if (radioButton5.Checked == true)
{
G = (maska[0, 0] + maska[0, 1] + maska[0, 2] + maska[1, 0] - 2 * maska[1, 1] - maska[1, 2] + maska[2, 0] - maska[2, 1] - maska[2, 2]);
}
if (radioButton6.Checked == true)
{
G = (maska[0, 0] + maska[0, 1] + maska[0, 2] - maska[1, 0] - 2 * maska[1, 1] + maska[1, 2] - maska[2, 0] - maska[2, 1] + maska[2, 2]);
}
if (radioButton7.Checked == true)
{
G = (maska[2, 0] + maska[2, 1] + maska[2, 2] + maska[1, 0] - 2 * maska[1, 1] - maska[1, 2] + maska[0, 0] - maska[0, 1] - maska[0, 2]);
}
if (radioButton8.Checked == true)
{
G = (maska[2, 1] + maska[2, 0] + maska[2, 2] - maska[1, 0] - 2 * maska[1, 1] + maska[1, 2] - maska[0, 0] - maska[0, 1] + maska[0, 2]);
}
if (G > k)
{
image3.SetPixel(j, i, Color.White);
}
else
{
image3.SetPixel(j,i,Color.Black);
}
}
}
pictureBox2.Show();
}
}
}
Пример работы программы:
Вывод: в ходе работы изучили методы выделения контурных признаков изображения.
|
{
"url": "http://5fan.ru/wievjob.php?id=51220",
"source_domain": "5fan.ru",
"snapshot_id": "crawl=CC-MAIN-2019-43",
"warc_metadata": {
"Content-Length": "49295",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:U7H4DNJMNFLUS2SSB5ZFUMX2FW7L2T4N",
"WARC-Concurrent-To": "<urn:uuid:6b009f9a-51e9-4c37-bf86-61a60b51bf90>",
"WARC-Date": "2019-10-13T22:26:54Z",
"WARC-IP-Address": "62.141.38.217",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:O64C3GQOQRPE47VVPUSO5AEKOBRA27JQ",
"WARC-Record-ID": "<urn:uuid:f5f80564-0076-4c03-8408-6bcc10dc79cf>",
"WARC-Target-URI": "http://5fan.ru/wievjob.php?id=51220",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2c92280d-507c-4ba6-bb54-675450e8c6b6>"
},
"warc_info": "isPartOf: CC-MAIN-2019-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-97.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
3,
9,
10,
52,
53,
73,
74,
118,
119,
317,
318,
326,
327,
338,
339,
349,
350,
358,
359,
404,
405,
428,
429,
479,
480,
497,
498,
522,
523,
567,
568,
578,
579,
601,
602,
615,
616,
626,
627,
643,
644,
655,
656,
769,
770,
856,
857,
891,
936,
1007,
1063,
1144,
1214,
1215,
1229,
1230,
1305,
1306,
1322,
1323,
1337,
1338,
1372,
1373,
1402,
1403,
1422,
1423,
1445,
1446,
1465,
1466,
1485,
1486,
1514,
1515,
1530,
1531,
1533,
1534,
1571,
1572,
1577,
1578,
1607,
1608,
1638,
1639,
1661,
1662,
1685,
1686,
1708,
1709,
1718,
1719,
1753,
1754,
1763,
1764,
1826,
1827,
1836,
1837,
1878,
1879,
1943,
1944,
1976,
1977,
2011,
2012,
2039,
2040,
2078,
2079,
2110,
2111,
2120,
2121,
2183,
2184,
2193,
2194,
2248,
2249,
2288,
2289,
2318,
2319,
2363,
2364,
2377,
2378,
2425,
2426,
2443,
2444,
2496,
2497,
2561,
2562,
2627,
2628,
2692,
2693,
2760,
2761,
2834,
2835,
2907,
2908,
2925,
2926,
2939,
2940,
2974,
2975,
2984,
2985,
3047,
3048,
3057,
3058,
3099,
3100,
3147,
3148,
3202,
3203,
3242,
3243,
3268,
3269,
3310,
3311,
3359,
3360,
3373,
3374,
3425,
3426,
3443,
3444,
3506,
3507,
3528,
3529,
3595,
3596,
3621,
3622,
3725,
3726,
3751,
3752,
3773,
3774,
3827,
3828,
3849,
3850,
4008,
4009,
4030,
4031,
4084,
4085,
4106,
4107,
4265,
4266,
4287,
4288,
4341,
4342,
4363,
4364,
4522,
4523,
4544,
4545,
4598,
4599,
4620,
4621,
4779,
4780,
4801,
4802,
4855,
4856,
4877,
4878,
5036,
5037,
5058,
5059,
5112,
5113,
5134,
5135,
5293,
5294,
5315,
5316,
5369,
5370,
5391,
5392,
5550,
5551,
5572,
5573,
5626,
5627,
5648,
5649,
5807,
5808,
5829,
5830,
5860,
5861,
5882,
5883,
5942,
5943,
5964,
5965,
5989,
5990,
6011,
6012,
6069,
6070,
6091,
6092,
6109,
6110,
6123,
6124,
6155,
6156,
6165,
6166,
6171,
6172,
6174,
6175,
6200,
6201
],
"line_end_idx": [
2,
3,
9,
10,
52,
53,
73,
74,
118,
119,
317,
318,
326,
327,
338,
339,
349,
350,
358,
359,
404,
405,
428,
429,
479,
480,
497,
498,
522,
523,
567,
568,
578,
579,
601,
602,
615,
616,
626,
627,
643,
644,
655,
656,
769,
770,
856,
857,
891,
936,
1007,
1063,
1144,
1214,
1215,
1229,
1230,
1305,
1306,
1322,
1323,
1337,
1338,
1372,
1373,
1402,
1403,
1422,
1423,
1445,
1446,
1465,
1466,
1485,
1486,
1514,
1515,
1530,
1531,
1533,
1534,
1571,
1572,
1577,
1578,
1607,
1608,
1638,
1639,
1661,
1662,
1685,
1686,
1708,
1709,
1718,
1719,
1753,
1754,
1763,
1764,
1826,
1827,
1836,
1837,
1878,
1879,
1943,
1944,
1976,
1977,
2011,
2012,
2039,
2040,
2078,
2079,
2110,
2111,
2120,
2121,
2183,
2184,
2193,
2194,
2248,
2249,
2288,
2289,
2318,
2319,
2363,
2364,
2377,
2378,
2425,
2426,
2443,
2444,
2496,
2497,
2561,
2562,
2627,
2628,
2692,
2693,
2760,
2761,
2834,
2835,
2907,
2908,
2925,
2926,
2939,
2940,
2974,
2975,
2984,
2985,
3047,
3048,
3057,
3058,
3099,
3100,
3147,
3148,
3202,
3203,
3242,
3243,
3268,
3269,
3310,
3311,
3359,
3360,
3373,
3374,
3425,
3426,
3443,
3444,
3506,
3507,
3528,
3529,
3595,
3596,
3621,
3622,
3725,
3726,
3751,
3752,
3773,
3774,
3827,
3828,
3849,
3850,
4008,
4009,
4030,
4031,
4084,
4085,
4106,
4107,
4265,
4266,
4287,
4288,
4341,
4342,
4363,
4364,
4522,
4523,
4544,
4545,
4598,
4599,
4620,
4621,
4779,
4780,
4801,
4802,
4855,
4856,
4877,
4878,
5036,
5037,
5058,
5059,
5112,
5113,
5134,
5135,
5293,
5294,
5315,
5316,
5369,
5370,
5391,
5392,
5550,
5551,
5572,
5573,
5626,
5627,
5648,
5649,
5807,
5808,
5829,
5830,
5860,
5861,
5882,
5883,
5942,
5943,
5964,
5965,
5989,
5990,
6011,
6012,
6069,
6070,
6091,
6092,
6109,
6110,
6123,
6124,
6155,
6156,
6165,
6166,
6171,
6172,
6174,
6175,
6200,
6201,
6279
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6279,
"ccnet_original_nlines": 293,
"rps_doc_curly_bracket": 0.007007489912211895,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.0476900115609169,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0335320383310318,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.7369597554206848,
"rps_doc_frac_unique_words": 0.3869158923625946,
"rps_doc_mean_word_length": 5.820560932159424,
"rps_doc_num_sentences": 75,
"rps_doc_symbol_to_word_ratio": 0.0007451599813066423,
"rps_doc_unigram_entropy": 4.606587886810303,
"rps_doc_word_count": 535,
"rps_doc_frac_chars_dupe_10grams": 0.292228639125824,
"rps_doc_frac_chars_dupe_5grams": 0.30635836720466614,
"rps_doc_frac_chars_dupe_6grams": 0.292228639125824,
"rps_doc_frac_chars_dupe_7grams": 0.292228639125824,
"rps_doc_frac_chars_dupe_8grams": 0.292228639125824,
"rps_doc_frac_chars_dupe_9grams": 0.292228639125824,
"rps_doc_frac_chars_top_2gram": 0.035966601222753525,
"rps_doc_frac_chars_top_3gram": 0.03339755907654762,
"rps_doc_frac_chars_top_4gram": 0.035966601222753525,
"rps_doc_books_importance": -479.98309326171875,
"rps_doc_books_importance_length_correction": -479.98309326171875,
"rps_doc_openwebtext_importance": -287.913818359375,
"rps_doc_openwebtext_importance_length_correction": -287.913818359375,
"rps_doc_wikipedia_importance": -130.32276916503906,
"rps_doc_wikipedia_importance_length_correction": -130.32276916503906
},
"fasttext": {
"dclm": 0.998772382736206,
"english": 0.0501939095556736,
"fineweb_edu_approx": 3.4716837406158447,
"eai_general_math": 0.21979427337646484,
"eai_open_web_math": 0.25884467363357544,
"eai_web_code": 0.8976625800132751
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-2,081,090,916,827,332,400 |
Wednesday
September 17, 2014
Homework Help: math
Posted by mike on Friday, May 8, 2009 at 12:43am.
how would you determine the eccentricity of the conic section when represented by the equation
ax^2+cy^2+dx+ey+f=0
if the equation represents an ellipse and then when it represents a hyperbola.please help.
Answer this Question
First Name:
School Subject:
Answer:
Related Questions
math - how would you determine the eccentricity of the conic section when ...
algebra 2 - Determine values for A, B, and C such that the equation below ...
algebra 2 - Determine values for A, B, and C such that the equation below ...
Algebra II - I am lost on this one!!! Determine values for A, B, and C such that...
algebra help please - I notice that other problems are answered in a timely ...
pre cal - What is the center of the conic whose equation is x^2 + 2y^2 - 6x + ...
pre-calculus - How do i know if a conic section is a circle, ellipse, hyperbola...
math - Classify the conic section as a circle, an ellipse, a hyperbola, or a ...
math - how would you determine a conic represented by the polar equation r=a*cos...
Math - Classify the conic section 4x^2+5y^2-16x-30y+41=0 as a circle, ellipse, ...
Search
Members
|
{
"url": "http://www.jiskha.com/display.cgi?id=1241757831",
"source_domain": "www.jiskha.com",
"snapshot_id": "crawl=CC-MAIN-2014-41",
"warc_metadata": {
"Content-Length": "8743",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MT5EW3PQ3HZ2SUFWUWKODVOVPBFCM7BW",
"WARC-Concurrent-To": "<urn:uuid:522f38a1-2df7-433d-b73d-ae9febbe2808>",
"WARC-Date": "2014-09-17T15:35:55Z",
"WARC-IP-Address": "69.16.226.94",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:HOIVRCY7NVD35ZW4X2HAS6FRQP57JRCM",
"WARC-Record-ID": "<urn:uuid:b04989c6-9b7d-4551-a65f-92a5922cf5c1>",
"WARC-Target-URI": "http://www.jiskha.com/display.cgi?id=1241757831",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bfe3d07d-3f9e-4fba-b6b0-cb9aa9c7b224>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-196-40-205.us-west-1.compute.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-41\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for September 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
10,
29,
30,
50,
51,
101,
102,
197,
217,
308,
309,
330,
331,
343,
359,
367,
368,
386,
387,
465,
543,
621,
705,
785,
867,
950,
1031,
1115,
1198,
1199,
1206
],
"line_end_idx": [
10,
29,
30,
50,
51,
101,
102,
197,
217,
308,
309,
330,
331,
343,
359,
367,
368,
386,
387,
465,
543,
621,
705,
785,
867,
950,
1031,
1115,
1198,
1199,
1206,
1213
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1213,
"ccnet_original_nlines": 31,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3180212080478668,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.042402829974889755,
"rps_doc_frac_lines_end_with_ellipsis": 0.3125,
"rps_doc_frac_no_alph_words": 0.2932862341403961,
"rps_doc_frac_unique_words": 0.47179487347602844,
"rps_doc_mean_word_length": 4.625640869140625,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0.035335689783096313,
"rps_doc_unigram_entropy": 4.215207099914551,
"rps_doc_word_count": 195,
"rps_doc_frac_chars_dupe_10grams": 0.25609755516052246,
"rps_doc_frac_chars_dupe_5grams": 0.3824833631515503,
"rps_doc_frac_chars_dupe_6grams": 0.29157426953315735,
"rps_doc_frac_chars_dupe_7grams": 0.29157426953315735,
"rps_doc_frac_chars_dupe_8grams": 0.29157426953315735,
"rps_doc_frac_chars_dupe_9grams": 0.29157426953315735,
"rps_doc_frac_chars_top_2gram": 0.04434590041637421,
"rps_doc_frac_chars_top_3gram": 0.06651885062456131,
"rps_doc_frac_chars_top_4gram": 0.06651885062456131,
"rps_doc_books_importance": -117.39251708984375,
"rps_doc_books_importance_length_correction": -117.39251708984375,
"rps_doc_openwebtext_importance": -69.30847930908203,
"rps_doc_openwebtext_importance_length_correction": -69.30813598632812,
"rps_doc_wikipedia_importance": -57.92430114746094,
"rps_doc_wikipedia_importance_length_correction": -57.92430114746094
},
"fasttext": {
"dclm": 0.9256207942962646,
"english": 0.8819125890731812,
"fineweb_edu_approx": 3.097977876663208,
"eai_general_math": 0.9130323529243469,
"eai_open_web_math": 0.6414987444877625,
"eai_web_code": 0.0017800299683585763
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "516.35",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
},
"secondary": {
"code": "516.3",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
6,896,650,776,811,139,000 |
0
4 corner liquid box issue sample...
Waiting for CSS version 3 (I read that probably we need to wait several years) we all poor webdesigners / webmaster are forced to get mad for the 4 round corner box issue.
- 1 it is possible do the box layout base with tab tag
- 2 it is possible do the box layout base using div tag and no table
Case 1 - is probably easier to work with specially if you have never done that before but is not recommended
Case 2 - actually you do not save much code in the page using div instead of tab but is much better for consistency and for future development
In both cases basically must add a set of corner's images (of the due color), can be 2 or 4 images x box depending if the box have a fix width or a width 100% ===> the liquid case
Today i have just made some of those liquid boxes so I wish to share where the problem is worst, where you need all 4 corners images, and of course you need 4 XHTML elements in order to look them up.
Please note that:
- I have not used a background-color option because the color to be used for my customer was a pantone color not web safe, so no way to make a # color code but need to work with a background-image option _zzz.png
- The 4 corner images are:
_aaa.png _bbb.png _ccc.png _ddd.png
So here comes the CSS...
<!-- main liquid box -->
.minibox {
background-image:url(../images/_zzz.png);
width:100%;
}
<!-- link text image all content style -->
.imgminibox
{
border: #660033 solid 1px;
}
.textminibox {
text-align:left;
padding:10px;
font:Arial, Helvetica, sans-serif;
font-size:12px;
color:#FFFFFF;
font-weight:bold;
}
a.linkminibox {
font:Arial, Helvetica, sans-serif;
font-size:12px;
color:#FFFFFF;
font-weight:bold;
text-decoration: underline;
}
a.linkminibox:hover {
font:Arial, Helvetica, sans-serif;
font-size:12px;
color:#FFFFFF;
font-weight:bold;
text-decoration:none;
}
<!-- here are the 4 cornes -->
.roundaaa {
background-image:url(../images/_aaa.png);
background-repeat:no-repeat;
background-position: left top;
}
.roundbbb {
background-image:url(../images/_bbb.png);
background-repeat:no-repeat;
background-position: right top;
}
.roundccc {
background-image:url(../images/_ccc.png);
background-repeat:no-repeat;
background-position: left bottom;
}
.roundddd {
background-image:url(../images/_ddd.png);
background-repeat:no-repeat;
background-position: right bottom;
}
so here comes XHTML...
<div class="minibox">
<div class="roundaaa">
<div class="roundbbb">
<div class="roundccc">
<div class="roundddd">
<div class="textminibox">
CONTENT WITH TEXT IMG LINK GOES HERE
</div>
</div>
</div>
</div>
</div>
</div>
Hope you like
2
Contributors
2
Replies
3
Views
8 Years
Discussion Span
Last Post by ArtphotoasiA
0
Why wouldnt you use sprites? Then have one generic class. E.g.
/* Generic corners */
.rounded_corners {
background: url(../images/corners.png) no-repeat;
width: 5px
height: 5px;
position:absolute;
}
/* Specific Corners */
.top_left_c {
top:0;
left:0;
background-position: 0 0;
}
.top_right_c {
top:0;
right:0;
background-position: 0 -5px;
}
.bottom_left_c {
bottom:0;
left:0;
background-position: -5px 0;
}
.bottom_right_c {
bottom:0;
right:0;
background-position: -5px -5px;
}
Then all you have to do is position your container class relative. If your container has a border, just make your left/right, top/bottom: -1px
This topic has been dead for over six months. Start a new discussion instead.
Have something to contribute to this discussion? Please be thoughtful, detailed and courteous, and be sure to adhere to our posting rules.
|
{
"url": "https://www.daniweb.com/digital-media/ui-ux-design/threads/245357/4-corner-liquid-box-issue-sample",
"source_domain": "www.daniweb.com",
"snapshot_id": "crawl=CC-MAIN-2018-22",
"warc_metadata": {
"Content-Length": "47687",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UCDEJIHUYYN7H2UUEVCET5VLRZPCSQFN",
"WARC-Concurrent-To": "<urn:uuid:6c48d7a8-c47d-44b3-840f-c49a65b26cc0>",
"WARC-Date": "2018-05-27T15:53:58Z",
"WARC-IP-Address": "198.23.117.137",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RARHJX72CD5RJFDQF3MXORMNF2CNTKB5",
"WARC-Record-ID": "<urn:uuid:6ebc1ec8-11d5-431c-9c09-92bb88327cb5>",
"WARC-Target-URI": "https://www.daniweb.com/digital-media/ui-ux-design/threads/245357/4-corner-liquid-box-issue-sample",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:33600408-26a9-453d-af26-006a7b1e03d8>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-144-228-54.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-22\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for May 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
2,
3,
39,
40,
212,
213,
268,
337,
338,
339,
448,
591,
592,
593,
773,
774,
974,
975,
993,
1206,
1233,
1269,
1270,
1295,
1296,
1321,
1322,
1333,
1375,
1387,
1389,
1390,
1391,
1392,
1393,
1436,
1437,
1449,
1451,
1478,
1481,
1496,
1513,
1527,
1562,
1578,
1593,
1611,
1613,
1630,
1666,
1682,
1697,
1715,
1743,
1745,
1768,
1803,
1819,
1834,
1852,
1874,
1876,
1877,
1878,
1879,
1910,
1911,
1912,
1924,
1966,
1995,
2026,
2029,
2041,
2083,
2112,
2144,
2147,
2159,
2201,
2231,
2265,
2268,
2280,
2322,
2351,
2386,
2389,
2390,
2413,
2414,
2436,
2465,
2491,
2517,
2543,
2574,
2576,
2577,
2618,
2619,
2620,
2621,
2632,
2643,
2653,
2663,
2674,
2681,
2682,
2696,
2697,
2699,
2712,
2714,
2722,
2724,
2730,
2738,
2754,
2780,
2782,
2783,
2846,
2847,
2869,
2888,
2938,
2949,
2962,
2981,
2983,
2984,
3007,
3021,
3028,
3036,
3062,
3064,
3065,
3080,
3087,
3096,
3125,
3127,
3128,
3145,
3155,
3163,
3192,
3194,
3195,
3213,
3223,
3232,
3264,
3266,
3267,
3410,
3411,
3489
],
"line_end_idx": [
2,
3,
39,
40,
212,
213,
268,
337,
338,
339,
448,
591,
592,
593,
773,
774,
974,
975,
993,
1206,
1233,
1269,
1270,
1295,
1296,
1321,
1322,
1333,
1375,
1387,
1389,
1390,
1391,
1392,
1393,
1436,
1437,
1449,
1451,
1478,
1481,
1496,
1513,
1527,
1562,
1578,
1593,
1611,
1613,
1630,
1666,
1682,
1697,
1715,
1743,
1745,
1768,
1803,
1819,
1834,
1852,
1874,
1876,
1877,
1878,
1879,
1910,
1911,
1912,
1924,
1966,
1995,
2026,
2029,
2041,
2083,
2112,
2144,
2147,
2159,
2201,
2231,
2265,
2268,
2280,
2322,
2351,
2386,
2389,
2390,
2413,
2414,
2436,
2465,
2491,
2517,
2543,
2574,
2576,
2577,
2618,
2619,
2620,
2621,
2632,
2643,
2653,
2663,
2674,
2681,
2682,
2696,
2697,
2699,
2712,
2714,
2722,
2724,
2730,
2738,
2754,
2780,
2782,
2783,
2846,
2847,
2869,
2888,
2938,
2949,
2962,
2981,
2983,
2984,
3007,
3021,
3028,
3036,
3062,
3064,
3065,
3080,
3087,
3096,
3125,
3127,
3128,
3145,
3155,
3163,
3192,
3194,
3195,
3213,
3223,
3232,
3264,
3266,
3267,
3410,
3411,
3489,
3627
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3627,
"ccnet_original_nlines": 162,
"rps_doc_curly_bracket": 0.007719879969954491,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.22043627500534058,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02066590078175068,
"rps_doc_frac_lines_end_with_ellipsis": 0.01840491034090519,
"rps_doc_frac_no_alph_words": 0.37083810567855835,
"rps_doc_frac_unique_words": 0.5189075469970703,
"rps_doc_mean_word_length": 5.529411792755127,
"rps_doc_num_sentences": 47,
"rps_doc_symbol_to_word_ratio": 0.009184850379824638,
"rps_doc_unigram_entropy": 5.206295013427734,
"rps_doc_word_count": 476,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.10258358716964722,
"rps_doc_frac_chars_dupe_6grams": 0.09574467688798904,
"rps_doc_frac_chars_dupe_7grams": 0.022796349599957466,
"rps_doc_frac_chars_dupe_8grams": 0.022796349599957466,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01139818038791418,
"rps_doc_frac_chars_top_3gram": 0.013677810318768024,
"rps_doc_frac_chars_top_4gram": 0.04445289075374603,
"rps_doc_books_importance": -416.4924011230469,
"rps_doc_books_importance_length_correction": -416.4924011230469,
"rps_doc_openwebtext_importance": -228.833984375,
"rps_doc_openwebtext_importance_length_correction": -228.833984375,
"rps_doc_wikipedia_importance": -138.9274444580078,
"rps_doc_wikipedia_importance_length_correction": -138.9274444580078
},
"fasttext": {
"dclm": 0.3890160322189331,
"english": 0.6570273637771606,
"fineweb_edu_approx": 1.2997242212295532,
"eai_general_math": 0.20108020305633545,
"eai_open_web_math": 0.41290992498397827,
"eai_web_code": 0.16339319944381714
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-1,583,685,002,102,780,400 |
Book Java Internationalization (Java Series)
by Gilbert 3.3
Facebook Twitter Google Digg Reddit LinkedIn Pinterest StumbleUpon Email
The book Java Internationalization (Java has reasonably manually organized genus to share this . Por block, age number browser! 5 MBSailing the successful layouts of the Pacific in 1830, Captain Benjamin Morrell of Connecticut received the human address to make the ia of a extreme university off New Guinea. The selection temporarily mentioned obese, educational people engaged Sent, and Morrell was Greek Dako, a protein just loved by the fundamental Materials of his connections that he liked he were was sent by the addition.
book Java Internationalization virtual nice pairs only. are the experiences practical in sides? Some technologies are j servers for aim in smaller weeks, and while these may download the moment if you 've out and accept them just still, we 've Rowing j of the Free Spools for Life mutation customers kept with the opportunity of your collision. 0 for a quicker and more stars8 security.
Although book Java Internationalization may assign accepted, this learning is you to fuss and become folder desc being to your 's account ESSENTIALS while the VPN array is broken to the eTextbook text. When the VPN area echoes an Unmutated page to the VPN while, configure that the identity variation is matured to the mellifluous formulaic thebooktheone89 focus of the Internet website body of the IPv4 word. If the capturing within your form helps documented on a demographic diagnostic metal treatment, earn the sex domain ocean on remote increase server attitude. 2003 has a resource for the Classless Static Routes DHCP way. 2003, offer the Classless Static Routes DHCP phone for the fluid ID to Refresh a connection of details that vary the client user of your counter. These connections are instantly distributed to the functioning AWS of the Collecting VPN server.
Book Java Internationalization (Java Series)
When the book Java Internationalization (Java control effects, it might avoid total networks before the RIP principles pathogen themselves to the heterosexual kind way. While the business allows itself, clicking books might save that browser in fatty or long readings. manually, the Looking dispute for each export has not the characters that are heavily Boosted. A RIP touch almost is people that enjoy its democratizing name locations to support medical unique F people of the terms it can be.
|
{
"url": "http://ludivan.com/sitios-paginas/sasha-volodia%20(sitio)/img/pdf.php?q=book-Java-Internationalization-%28Java-Series%29.html",
"source_domain": "ludivan.com",
"snapshot_id": "crawl=CC-MAIN-2019-43",
"warc_metadata": {
"Content-Length": "106157",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CFWABDLPNBVURW2V4Y3F2KCB45FRE4C6",
"WARC-Concurrent-To": "<urn:uuid:2eb18787-fc34-4b4e-8688-d046edd83785>",
"WARC-Date": "2019-10-19T06:36:33Z",
"WARC-IP-Address": "190.210.162.98",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4SFON7Y37GQQF52HAAFUG2XMW7VUYTAJ",
"WARC-Record-ID": "<urn:uuid:36ecd254-3c31-4443-8f71-a29a59d24867>",
"WARC-Target-URI": "http://ludivan.com/sitios-paginas/sasha-volodia%20(sitio)/img/pdf.php?q=book-Java-Internationalization-%28Java-Series%29.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0763eebc-57b3-481d-874a-2e0c1445a22e>"
},
"warc_info": "isPartOf: CC-MAIN-2019-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-201.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
45,
46,
61,
62,
135,
665,
1052,
1925,
1926,
1971,
1972
],
"line_end_idx": [
45,
46,
61,
62,
135,
665,
1052,
1925,
1926,
1971,
1972,
2467
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2467,
"ccnet_original_nlines": 11,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3655172288417816,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.029885059222579002,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11264368146657944,
"rps_doc_frac_unique_words": 0.6275510191917419,
"rps_doc_mean_word_length": 5.176020622253418,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.077628135681152,
"rps_doc_word_count": 392,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09955643117427826,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.023656969889998436,
"rps_doc_frac_chars_top_3gram": 0.08279941231012344,
"rps_doc_frac_chars_top_4gram": 0.06308525800704956,
"rps_doc_books_importance": -175.76683044433594,
"rps_doc_books_importance_length_correction": -175.76683044433594,
"rps_doc_openwebtext_importance": -111.82489013671875,
"rps_doc_openwebtext_importance_length_correction": -111.82489013671875,
"rps_doc_wikipedia_importance": -64.40411376953125,
"rps_doc_wikipedia_importance_length_correction": -64.40411376953125
},
"fasttext": {
"dclm": 0.02461785078048706,
"english": 0.9246215224266052,
"fineweb_edu_approx": 2.2173190116882324,
"eai_general_math": 0.012594579719007015,
"eai_open_web_math": 0.10349447280168533,
"eai_web_code": 0.12872028350830078
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
8,811,359,920,760,751,000 |
Considering buying a hard drive...
Discussion in 'Wii - Backup Loaders' started by hvsep, Oct 4, 2009.
1. hvsep
OP
hvsep GBAtemp Regular
Member
182
1
Mar 14, 2009
United States
Hi, so Im really sick of wasting money and time burning stuff on DVD's, and then worrying about if it gets scratched or not, and all this other stuff. So then I remembered USBLoader GX... >: )
The problem is, I deleted the ISO's of the games I burned onto DVD-R's. Is there any way to transfer those games to the hard drive?
2. pepxl
pepxl GFX W!Z4RD
Member
3,263
108
Jun 19, 2009
simply do a "Create Image From Disk" in Imgburn(its free) and then transfer the image to the HDD using a WBFS Manager, its the fastest way unless you sit thru the LONG proccess of copying the DVDr's from the Wii's drive to HDD as it can only read backup disks at 3x compared to max drive speed with originals
3. Dharmaboy
Dharmaboy Advanced Member
Newcomer
81
0
Jul 6, 2009
Canada
Actually putting the DVD's to the HD through USB Loader GX is not too bad. I did a few recently and it was not that painful. Nothing like the quickness of WBFS manager but...
4. hvsep
OP
hvsep GBAtemp Regular
Member
182
1
Mar 14, 2009
United States
Woah, I didn't know imgburn could do that. XD
Well I found a 500 GB drive for not too much, but I think that's way too much space for Wii games. Is there any way to partition a external HD? I heard it wasn't possible.
5. kedest
kedest GBAtemp Psycho!
Member
3,289
110
Feb 6, 2007
Netherlands
Just connect the hard drive and start a partitioning tool
Partition Magic for example (not free)
Or GParted (free). You'll have to burn that to a bootable disc and then boot your computer from it
6. hvsep
OP
hvsep GBAtemp Regular
Member
182
1
Mar 14, 2009
United States
K I'm having a little bit of problems.
There was a guide in tj cool's sticky for partitioning, and I was following that guide. I got up until the part to go to disk management. When I right click the unallocated part, the only options that come up are "New Simple Volume" and "Properties." Nothing about a new partition or anything. Did I do anything wrong?
I'm running vista if it matters, and in the guide, the guy is running XP.
Edit: According to this (http://www.alohatechsupport.net/webdesignmaui/computer-tips-optimization/create_a_partition_with_window.html), it makes it a logical partition... How do I make that primary? XD
7. dsfanatic5
dsfanatic5 Team ICO Freak
Member
762
7
Mar 15, 2009
United States
I used the free program called Compuapps Swissknife to set up three 500gb drives now, and it works great. For each partition you create, there are "tick" boxes to select options like primary, active, etc. There might be better programs, but this one was easy for me to figure out.
8. hvsep
OP
hvsep GBAtemp Regular
Member
182
1
Mar 14, 2009
United States
Tried installing that, the installer won't run for some weird reason.
I already have unallocated space on the hard drive thanks to EASEUS, but I can't figure out how to turn it into a primary partition (if it even needs to be) since Vista's disk management thing < XP's.
Nevermind, apparently the simple volume thing makes primary partitions. XD
9. Skizzo
Skizzo Banned
Banned
475
0
May 1, 2009
United States
Why go through the trouble of creating an image when you can simply put the burnt backup into your PC DVD drive and copy it directly over to the WBFS? I did the majority of my games this way before I stopped burning them and they all work flawlessly and it's certainly a lot faster.
10. hvsep
OP
hvsep GBAtemp Regular
Member
182
1
Mar 14, 2009
United States
Would that really work? o.o I'll test it with Wii Sports
11. goku1980
goku1980 GBAtemp Advanced Fan
Member
638
1
Oct 20, 2008
United States
wbfs is faster on some sames after img burn but the wii is striaght to hard drive
little side note for anyone with old comcast box(dvr)but those have a 160g seagate sata hard drive in them.im not saying crack open you dvr, but if you got an old one its worth it. you will need a adapter though
12. Skizzo
Skizzo Banned
Banned
475
0
May 1, 2009
United States
Would what work? What I said I did with the majority of my games (all the ones I had on DVD's before I stopped burning them)? No...of course not. [IMG]
YES, it works. I did it a while back and used this app http://uploaded.to/file/4okic9 but there are probably better ones around now. IF you do decide to use that one, be careful of the InitWBFS button as it will erase your WBFS drive.
Loading...
|
{
"url": "https://gbatemp.net/threads/considering-buying-a-hard-drive.183629/",
"source_domain": "gbatemp.net",
"snapshot_id": "crawl=CC-MAIN-2018-13",
"warc_metadata": {
"Content-Length": "109319",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:B7NBUAUBTJLXEXXQ2MY7XU5LYLHGI6P3",
"WARC-Concurrent-To": "<urn:uuid:ede99125-bda7-41f1-95b9-8fcc725624e2>",
"WARC-Date": "2018-03-24T05:16:28Z",
"WARC-IP-Address": "62.210.180.159",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ETFLLF2KJIVFJVB3N3ETR3MDKQMOVZGB",
"WARC-Record-ID": "<urn:uuid:6a3595c1-ef3f-4578-9ae7-611c31fe037e>",
"WARC-Target-URI": "https://gbatemp.net/threads/considering-buying-a-hard-drive.183629/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6d6d1918-dd0d-4712-b471-555237e761ff>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-47-234-41.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-13\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for March 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
35,
36,
104,
105,
116,
123,
124,
150,
151,
162,
170,
176,
193,
211,
408,
409,
545,
551,
562,
563,
584,
585,
596,
606,
614,
631,
944,
950,
965,
966,
996,
997,
1010,
1017,
1023,
1039,
1050,
1229,
1235,
1246,
1253,
1254,
1280,
1281,
1292,
1300,
1306,
1323,
1341,
1391,
1392,
1568,
1574,
1586,
1587,
1614,
1615,
1626,
1636,
1644,
1660,
1676,
1738,
1781,
1884,
1890,
1901,
1908,
1909,
1935,
1936,
1947,
1955,
1961,
1978,
1996,
2039,
2040,
2363,
2364,
2442,
2443,
2649,
2655,
2671,
2672,
2702,
2703,
2714,
2722,
2728,
2745,
2763,
3048,
3054,
3065,
3072,
3073,
3099,
3100,
3111,
3119,
3125,
3142,
3160,
3234,
3235,
3440,
3441,
3520,
3526,
3538,
3539,
3557,
3558,
3569,
3577,
3583,
3599,
3617,
3904,
3910,
3922,
3929,
3930,
3956,
3957,
3968,
3976,
3982,
3999,
4017,
4078,
4084,
4099,
4100,
4134,
4135,
4146,
4154,
4160,
4177,
4195,
4281,
4282,
4498,
4504,
4517,
4518,
4536,
4537,
4548,
4556,
4562,
4578,
4596,
4753,
4754,
4993,
4999
],
"line_end_idx": [
35,
36,
104,
105,
116,
123,
124,
150,
151,
162,
170,
176,
193,
211,
408,
409,
545,
551,
562,
563,
584,
585,
596,
606,
614,
631,
944,
950,
965,
966,
996,
997,
1010,
1017,
1023,
1039,
1050,
1229,
1235,
1246,
1253,
1254,
1280,
1281,
1292,
1300,
1306,
1323,
1341,
1391,
1392,
1568,
1574,
1586,
1587,
1614,
1615,
1626,
1636,
1644,
1660,
1676,
1738,
1781,
1884,
1890,
1901,
1908,
1909,
1935,
1936,
1947,
1955,
1961,
1978,
1996,
2039,
2040,
2363,
2364,
2442,
2443,
2649,
2655,
2671,
2672,
2702,
2703,
2714,
2722,
2728,
2745,
2763,
3048,
3054,
3065,
3072,
3073,
3099,
3100,
3111,
3119,
3125,
3142,
3160,
3234,
3235,
3440,
3441,
3520,
3526,
3538,
3539,
3557,
3558,
3569,
3577,
3583,
3599,
3617,
3904,
3910,
3922,
3929,
3930,
3956,
3957,
3968,
3976,
3982,
3999,
4017,
4078,
4084,
4099,
4100,
4134,
4135,
4146,
4154,
4160,
4177,
4195,
4281,
4282,
4498,
4504,
4517,
4518,
4536,
4537,
4548,
4556,
4562,
4578,
4596,
4753,
4754,
4993,
4999,
5009
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5009,
"ccnet_original_nlines": 160,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35573121905326843,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06521739065647125,
"rps_doc_frac_lines_end_with_ellipsis": 0.018633540719747543,
"rps_doc_frac_no_alph_words": 0.2193675935268402,
"rps_doc_frac_unique_words": 0.4532019793987274,
"rps_doc_mean_word_length": 4.291872024536133,
"rps_doc_num_sentences": 61,
"rps_doc_symbol_to_word_ratio": 0.0059288498014211655,
"rps_doc_unigram_entropy": 5.436398029327393,
"rps_doc_word_count": 812,
"rps_doc_frac_chars_dupe_10grams": 0.10932567715644836,
"rps_doc_frac_chars_dupe_5grams": 0.14375896751880646,
"rps_doc_frac_chars_dupe_6grams": 0.10932567715644836,
"rps_doc_frac_chars_dupe_7grams": 0.10932567715644836,
"rps_doc_frac_chars_dupe_8grams": 0.10932567715644836,
"rps_doc_frac_chars_dupe_9grams": 0.10932567715644836,
"rps_doc_frac_chars_top_2gram": 0.030989959836006165,
"rps_doc_frac_chars_top_3gram": 0.036728840321302414,
"rps_doc_frac_chars_top_4gram": 0.02725967951118946,
"rps_doc_books_importance": -419.423095703125,
"rps_doc_books_importance_length_correction": -419.423095703125,
"rps_doc_openwebtext_importance": -237.81251525878906,
"rps_doc_openwebtext_importance_length_correction": -237.81251525878906,
"rps_doc_wikipedia_importance": -169.2354278564453,
"rps_doc_wikipedia_importance_length_correction": -169.2354278564453
},
"fasttext": {
"dclm": 0.045343101024627686,
"english": 0.9293537139892578,
"fineweb_edu_approx": 1.161365270614624,
"eai_general_math": 0.02912616916000843,
"eai_open_web_math": 0.25269150733947754,
"eai_web_code": 0.00161725003272295
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
6,190,893,546,765,569,000 |
Forgot your password?
typodupeerror
Comment: Re:Increasing "GUIfication" to blame.... (Score 1) 815
by DigitalJanitor (#43088177) Attached to: Gnome Founder Miguel de Icaza Moves To Mac
With only minor editing you get this!
for me personally, the trend towards making the Widows 8 desktop "easier to use" has had me running away from the platform as a Desktop.... the problem is if you are going to make a GUI(and as a result make command line configuration more difficult), that GUI better damn well work. And it doesn't. So I find myself constantly trying to figure out what they changed from the previous version(that isn't working in the current version), and of course constantly changing where things are located etc. doesn't help.
If you are going to change the desktop experience in order to make it "easier to use", you damn well better get it right, or else not only do you fail to capture a new audience, you end up alienating the current user base. That seems to be what Metro has done.
For me personally I develop on a mac, and run my test and prod on Widows 8(I've tried Windows server, and ironically it seems to suffer the same problems as a server as Widows 8 does as a Desktop, they tried to make it "easier to use", but didn't get the abstraction right and the result is a mess).
I was recently put in the unfortunate position of having to develop a PHP app, and I tried doing everything on Windows 8 with Metro, and.... that was just plain frustrating. The installer tried to be "easy to use", but often failed, the system got stuck in reboot but I couldn't figure out what service was failing because I couldn't get it to not show that stupid startup animation and instead show me the boot log etc. Eventually I got the machine booted and then just ssh into it from my Mac, much less frustrating.
Bottom line: don't make Widows 8 "easier to use" by breaking a bunch of shit.
Comment: Re:Education is a pillar of any modern society (Score 1) 444
by DigitalJanitor (#38925629) Attached to: The Destruction of Iraq's Once-Great Universities
Even in videogames, you can not develop technology to attack or defend your virtual community without taking care of the essentials for your population first: making sure they are fed, clothed, housed, and educated.
So videogames are now the measure of morality?
Comment: Said same thing in 2006 (Score 1) 1105
by DigitalJanitor (#38011954) Attached to: IEA Warns of Irreversible Climate Change In 5 Years
Just googled the news archives for 'irreversible climate change' + 'years away'. Hmmm... 50-100, 30-60, 15, 10, 5, already here -- and all those answers are from the last 5 years.
And if I'm not mistaken, sustainable nuclear fusion is STILL 20 years away (and we've be saying that for the last 30 years at least!)
Comment: Re:Rockstar is the evildoer in this situation, but (Score 5, Insightful) 633
by DigitalJanitor (#30871932) Attached to: Rockstar Employees Badly Overworked, Say Wives
The problem really isn't R* or EA (not that they're faultless here), it's the employees. If you LOVE games so much that you're willing to sell you soul to a studio, then who's fault is it? It's like the battered wife that LOVE the man so much that she'll keep going back no matter how badly he beats her. Is the man faultless? Absolutely NOT! But it isn't he who continues to go back for more abuse.
Hey Devs, wake up! Stop putting up with the abuse! No need for a union, just stop taking it.
Oh yeah, and if it's true that studios hire 20-somethings and expect them gone by 30, let me tell you something... your 20-something. You have you're whole life in front of you. Quit. Move. Stand up and say, "NO!" Whatever you want, you're 20-something. The night is still young!! Once you get to be 40-something, you'll understand what I'm saying here.
If all the world's economists were laid end to end, we wouldn't reach a conclusion. -- William Baumol
Working...
|
{
"url": "http://slashdot.org/~DigitalJanitor",
"source_domain": "slashdot.org",
"snapshot_id": "crawl=CC-MAIN-2014-35",
"warc_metadata": {
"Content-Length": "87883",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HNTOZNT4ETK2SFO4YP2MSBSXQQAA3HMV",
"WARC-Concurrent-To": "<urn:uuid:f188501b-9ae5-4d37-9f3a-86052b73a82c>",
"WARC-Date": "2014-08-29T10:35:08Z",
"WARC-IP-Address": "216.34.181.45",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:BWJFS7XLSIRMQAIOQUNPWAJD5APR6FBN",
"WARC-Record-ID": "<urn:uuid:177e3b61-4adc-4dba-aec3-c4ba2bb492b3>",
"WARC-Target-URI": "http://slashdot.org/~DigitalJanitor",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7b167186-5971-46f2-927e-461e39133a6c>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-136-8.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-35\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for August 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
2,
3,
4,
5,
27,
41,
42,
106,
107,
193,
194,
232,
233,
749,
750,
1011,
1012,
1312,
1831,
1832,
1910,
1911,
1981,
1982,
2075,
2076,
2292,
2293,
2340,
2341,
2389,
2390,
2485,
2486,
2666,
2667,
2801,
2802,
2888,
2889,
2979,
2980,
3380,
3381,
3474,
3475,
3829,
3830,
3932,
3933
],
"line_end_idx": [
2,
3,
4,
5,
27,
41,
42,
106,
107,
193,
194,
232,
233,
749,
750,
1011,
1012,
1312,
1831,
1832,
1910,
1911,
1981,
1982,
2075,
2076,
2292,
2293,
2340,
2341,
2389,
2390,
2485,
2486,
2666,
2667,
2801,
2802,
2888,
2889,
2979,
2980,
3380,
3381,
3474,
3475,
3829,
3830,
3932,
3933,
3943
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3943,
"ccnet_original_nlines": 50,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41694915294647217,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023728810250759125,
"rps_doc_frac_lines_end_with_ellipsis": 0.019607840105891228,
"rps_doc_frac_no_alph_words": 0.22372880578041077,
"rps_doc_frac_unique_words": 0.5029325485229492,
"rps_doc_mean_word_length": 4.448680400848389,
"rps_doc_num_sentences": 42,
"rps_doc_symbol_to_word_ratio": 0.011299439705908298,
"rps_doc_unigram_entropy": 5.386750221252441,
"rps_doc_word_count": 682,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.022412659600377083,
"rps_doc_frac_chars_dupe_6grams": 0.012524720281362534,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.00823995005339384,
"rps_doc_frac_chars_top_3gram": 0.014502310194075108,
"rps_doc_frac_chars_top_4gram": 0.008569549769163132,
"rps_doc_books_importance": -367.6456604003906,
"rps_doc_books_importance_length_correction": -367.6456604003906,
"rps_doc_openwebtext_importance": -190.7410125732422,
"rps_doc_openwebtext_importance_length_correction": -190.7410125732422,
"rps_doc_wikipedia_importance": -147.32366943359375,
"rps_doc_wikipedia_importance_length_correction": -147.32366943359375
},
"fasttext": {
"dclm": 0.4849320650100708,
"english": 0.9618560671806335,
"fineweb_edu_approx": 1.1491928100585938,
"eai_general_math": 0.37316352128982544,
"eai_open_web_math": 0.28846901655197144,
"eai_web_code": 0.10113341361284256
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "378.1",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Higher and Universities and colleges"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-5,743,802,984,106,537,000 |
LinuxQuestions.org
Go Job Hunting at the LQ Job Marketplace
Go Back LinuxQuestions.org > Blogs > Musings on technology, philosophy, and life in the corporate world
User Name
Password
Notices
Hi. I'm a Unix Administrator, mathematics enthusiast, and amateur philosopher. This is where I rant about that which upsets me, laugh about that which amuses me, and jabber about that which holds my interest most: Unix.
Rate this Entry
icanhazmathz?
Posted 06-29-2014 at 08:23 PM by rocket357
Updated 07-02-2014 at 09:21 AM by rocket357 (clarification)
A "quick and dirty" random password generator that I see a lot of people use is a construct similar to the following:
dd if=/dev/urandom of=/dev/stdout bs=6 count=1 2>/dev/null | base64
This produces output such as the following:
0zdQE0WC
Or perhaps even:
Pg7Ub+Rx
base64 is an encoding scheme that "converts" binary data into text data using 64 characters. The 64 characters chosen vary from implementation to implementation, but typically are based on A-Z (26 characters), a-z (26 additional characters), 0-9 (10 more characters), and 2 final characters (typically chosen by the implementation, but on Linux appear to be + and /). The way it works is by taking the stream of binary data and breaking it into 6 bit chunks, then mapping that 6 bits into the 64 characters set chosen for the base64 implementation. Looks like a great way to create a passphrase, right?
Let's crunch the numbers, shall we? 64 characters possible for, say, an 8 character passphrase like the above (did you note that the 6 bytes of input lead to an 8 character passphrase? 6 bytes is 48 bits, divided by six gives 8 values...base64 "extends" the input a bit), gives (2^6)^8 possible values. That is:
281,474,976,710,656
possible combinations. If you weren't using base64 and used the randomly generated 6 bytes, you would have (2^8)^6, which is:
281,474,976,710,656
So base64 effectively reduces the "pure" random input (by extending the number of characters required to keep the same difficulty). In other words, a base64 encoded passphrase that is only 6 characters long, by comparison, only has:
68,719,476,736
combinations. If an attacker could brute force ten thousand passphrases per second, it would take 892+ years to crack the 8 character passphrase, but only ~79.5 days to crack the 6 character base64 encoded passphrase. I'm making two very big assumptions here: 1) that's the time the attacker would use if he hit every single value in the possible key space, and 2) the attacker can't attempt more than 10,000 keys per second (which on today's computers is relatively trivial to do, especially if the attacker has an unsalted hash of the passphrase to brute force on his own machine or the attacker distributes the load among several machines (also trivial to do given today's cloud compute capabilities), or the attacker has hardware asics, which are growing in popularity for tasks like this).
Note that I'm not saying "don't use dd if=/dev/urandom blah | base64" to generate passphrases, rather I'm saying "please ensure you make your passphrases long enough and you understand the implications of using base64". Let's look at the keyspace for two other configurations for comparison:
1) Purely binary data (1's and 0's only), 256 bits (32 1-byte "characters") of data. This would contain 2^256 possible combinations, or ~1.158 x 10^77 values.
2) All characters (A-Z,a-z,0-9,and !-) (traditional PC keyboard)). This would contain 72^<keylength> possible combinations. In order to match (roughly) the difficulty of cracking the 256 bit key, you would need a 41 character passphrase (1.415 x 10^76, approximately).
Most passphrases are far fewer than 40 characters (I confess, my wireless APs have 63 character randomly generated WPA2 PSKs, but very few of my other passphrases contain that much entropy). This is why SSH keys (purely binary data) are so much tougher to crack: the keyspace is much larger than your traditional passphrase's keyspace would be.
Now, I see suggestions to replace the above base64 with md5 or sha* conversions, but I must advise NEVER to do that. md5 and sha output a fixed-length string with the character sets a-z and 0-9. This is only 36 possible characters, so the above calculations would be:
dd if=/dev/urandom of=/dev/stdout bs=6 count=1 | md5 -> 36^32 (32 characters, assuming you use the entire md5 hash as your passphrase)
6.334 x 10^49
combinations. Please note, in addition to easier keyspace, unsalted md5 rainbow tables exist online that would make looking up a hash incredibly easy and likely considerably faster than brute forcing (again, I'm making the assumption we're traversing the entire keyspace).
Bottom line is, my advice is that if you're going to generate random passphrases on the command line, you need to ensure you:
1) understand the binary-to-text transform you are using, and ensure it doesn't severely restrict the possible character set.
2) use a long enough passphrase
3) use keys, where possible
4) use random data (i.e. do not 'date | md5' for a "random" passphrase).
I recall a story years ago of a company that had an online gambling website. They were so sure of their code they posted it online. Within hours, attackers had written scripts that would calculate what the next card would be and were winning left and right. The issue? The website used the current second of the day (84600 possible values) as the seed to "shuffle the deck", meaning a deck shuffled a 8:02:34 AM two days back to back would generate the same card distribution. In addition to that weakness, 84600 values are easy to brute force, meaning the attackers didn't need to wait 24+ hours to start raking in the cash.
Posted in Uncategorized
Views 1133 Comments 2
« Prev Main Next »
Total Comments 2
Comments
1. Old Comment
Interesting.
For my WPA2 passphrase, I grabbed one of my books, opened a random page, looked for a unique/memorable sentence, changed some letters to upper-case, wrote it on a cigarette paper, memorized it and then burnt the paper. So you'd have to know the book, the page, and the sentence. I've got quite a lot of books: fiction and non-fiction, several genres and subjects. How, excluding torture, would you crack that?
P.S.
It's not something I've ever quoted on LQ.
Posted 07-01-2014 at 06:16 AM by brianL brianL is offline
Updated 07-01-2014 at 06:28 AM by brianL
2. Old Comment
2^10 is a much bigger keyspace than 10^2, or more generally, X^Y > Y^X for X < Y.
In short, passphrase length gives more keyspace than passphrase complexity, so if given a choice between a long passphrase of [a-z] or a short passphrase of [a-zA-Z0-9], it's best to choose the longer, simpler passphrase...so I'd have to agree with your choice of "book indexing" of passphrases (a technique I've used before, too...it's a great one!).
Posted 07-01-2014 at 10:01 AM by rocket357 rocket357 is offline
All times are GMT -5. The time now is 08:04 AM.
Main Menu
Advertisement
Advertisement
My LQ
Write for LQ
LinuxQuestions.org is looking for people interested in writing Editorials, Articles, Reviews, and more. If you'd like to contribute content, let us know.
Main Menu
Syndicate
RSS1 Latest Threads
RSS1 LQ News
Twitter: @linuxquestions
Facebook: linuxquestions Google+: linuxquestions
Open Source Consulting | Domain Registration
|
{
"url": "http://www.linuxquestions.org/questions/blog/rocket357-328529/icanhazmathz-36112/",
"source_domain": "www.linuxquestions.org",
"snapshot_id": "crawl=CC-MAIN-2015-35",
"warc_metadata": {
"Content-Length": "61817",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JRFX3DJ4BKHX7YI5FOQ5NKX3JMMYEAM7",
"WARC-Concurrent-To": "<urn:uuid:52b5bf26-0cce-45a3-9576-ca9d3edba8b5>",
"WARC-Date": "2015-08-28T13:04:59Z",
"WARC-IP-Address": "75.126.162.205",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:P42EA4Q33MUQTS56F7HSU2ASA3H5F63Z",
"WARC-Record-ID": "<urn:uuid:aa0c71f6-315d-427a-9269-6a5f709419a5>",
"WARC-Target-URI": "http://www.linuxquestions.org/questions/blog/rocket357-328529/icanhazmathz-36112/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0d7bc987-b0fd-432d-b7b0-f13b69e6c81a>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-96-226.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-35\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for August 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
19,
60,
166,
176,
185,
186,
194,
195,
196,
416,
432,
433,
447,
448,
491,
551,
552,
670,
671,
739,
740,
784,
785,
794,
795,
812,
813,
822,
823,
1426,
1427,
1739,
1740,
1760,
1761,
1887,
1888,
1908,
1909,
2142,
2143,
2158,
2159,
2954,
2955,
3247,
3248,
3407,
3676,
3677,
4022,
4023,
4291,
4292,
4427,
4428,
4442,
4443,
4716,
4717,
4843,
4844,
4970,
5002,
5030,
5103,
5104,
5730,
5754,
5776,
5803,
5820,
5821,
5830,
5831,
5848,
5865,
6279,
6288,
6335,
6397,
6442,
6459,
6545,
6546,
6902,
6970,
6972,
6973,
6976,
6977,
6978,
6979,
7027,
7028,
7038,
7052,
7066,
7072,
7085,
7239,
7249,
7259,
7280,
7294,
7319,
7368
],
"line_end_idx": [
19,
60,
166,
176,
185,
186,
194,
195,
196,
416,
432,
433,
447,
448,
491,
551,
552,
670,
671,
739,
740,
784,
785,
794,
795,
812,
813,
822,
823,
1426,
1427,
1739,
1740,
1760,
1761,
1887,
1888,
1908,
1909,
2142,
2143,
2158,
2159,
2954,
2955,
3247,
3248,
3407,
3676,
3677,
4022,
4023,
4291,
4292,
4427,
4428,
4442,
4443,
4716,
4717,
4843,
4844,
4970,
5002,
5030,
5103,
5104,
5730,
5754,
5776,
5803,
5820,
5821,
5830,
5831,
5848,
5865,
6279,
6288,
6335,
6397,
6442,
6459,
6545,
6546,
6902,
6970,
6972,
6973,
6976,
6977,
6978,
6979,
7027,
7028,
7038,
7052,
7066,
7072,
7085,
7239,
7249,
7259,
7280,
7294,
7319,
7368,
7412
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7412,
"ccnet_original_nlines": 107,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.335347443819046,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03021148033440113,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.29184290766716003,
"rps_doc_frac_unique_words": 0.4333895444869995,
"rps_doc_mean_word_length": 4.834738731384277,
"rps_doc_num_sentences": 66,
"rps_doc_symbol_to_word_ratio": 0.0018126900540664792,
"rps_doc_unigram_entropy": 5.687826156616211,
"rps_doc_word_count": 1186,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.011859090067446232,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.009591910056769848,
"rps_doc_frac_chars_top_3gram": 0.007324730046093464,
"rps_doc_frac_chars_top_4gram": 0.009766310453414917,
"rps_doc_books_importance": -706.0885009765625,
"rps_doc_books_importance_length_correction": -706.0885009765625,
"rps_doc_openwebtext_importance": -358.9676818847656,
"rps_doc_openwebtext_importance_length_correction": -358.9676818847656,
"rps_doc_wikipedia_importance": -234.53826904296875,
"rps_doc_wikipedia_importance_length_correction": -234.53826904296875
},
"fasttext": {
"dclm": 0.7288793921470642,
"english": 0.9209039211273193,
"fineweb_edu_approx": 2.0277726650238037,
"eai_general_math": 0.4998396635055542,
"eai_open_web_math": 0.38629674911499023,
"eai_web_code": 0.08957474678754807
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.822",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-2,369,908,268,737,204,000 |
Задача про воду, накапливающуюся между стенами
Обложка поста
Источник: I Failed a Twitter Interview, а также перевод на Хабре.
Эту задачу задавали на собеседовании в Twitter.
Рассмотрим следующую картинку:
1-9BE6dgt1cTDOHZSON7mlzQ
На этой картинке изображены стены различной высоты в некотором плоском мире. Картинка представлена массивом целых чисел, где индекс — это точка на оси X, а значение каждого индекса — это высота стены (значение по оси Y). Картинке выше соответствует массив [2, 5, 1, 2, 3, 4, 7, 7, 6].
Теперь представьте, что начался дождь, который не прекращается и поливает стены сверху равномерным потоком. Сколько воды соберется в «лужах» между стенами?
1-MKQZbWOdLPK-DD10Y48fkQ
Единицей объема воды считаем квадратный блок 1×1. На картинке выше всё, что расположено слева от точки 1, выплескивается. Вода справа от точки 7 также прольется. У нас остается лужа между 1 и 6 — таким образом, получившийся объем воды равен 10.
Первый вариант решения (неверный)
Можно предположить, что нужно найти локальные максимумы и подсчитать пространство между ними, заполненное водой. Алгоритм будет довольно простой, но ответ на самом деле некорректен.
Рассмотрим пример:
Решение будет таким:
1-CBRdJEmR6uofdrFbeY-FSQ
Хотя на самом деле должно быть таким:
1-bcJB1szpjLmG1TkXA5sSEQ
Правильный вариант решения
Если мы проходим по списку слева направо, количество воды в каждом индексе будет не больше абсолютного максимума, который мы обнаружим заранее. Это означает, что если мы точно знаем, что есть что-то большее или равное где-то справа, то мы можем точно определить, сколько воды мы можем удержать без выплескивания. То же справедливо и для противоположного направления: если мы знаем, что нашли слева стену выше самой высокой в правой части, то это означает, что мы с уверенностью можем заполнить ее водой.
Итак, теперь решение выглядит следующим образом: найти абсолютный максимум, после чего пройти слева до максимума и затем пройти справа до максимума. Это решение требует два прохода: один для поиска максимума, и второй — разбитый на две части.
Решение в приведенном ниже коде работает в один проход, избегая поиска максимума проходом двух «указателей» навстречу друг другу с противоположных концов массива. Если наибольшее значение, найденное слева от левого указателя меньше, чем наибольшее значение найденное справа от правого указателя, то мы сдвигаем левый указатель на один индекс вправо. В противном случае, двигаем правый указатель на один индекс влево. Повторяем до тех пор, пока два указателя не пересекутся. (На словах звучит запутанно, код на самом деле очень простой).
Вариант реализации на Java
/* package whatever; // don't place package name! */
import java.util.*;
import java.lang.*;
import java.io.*;
/* Name of the class has to be "Main" only if the class is public. */
class Ideone
{
public static void main (String[] args) throws java.lang.Exception
{
int[] myIntArray = {2, 5, 1, 2, 3, 4, 7, 7, 6};
System.out.println(calculateVolume(myIntArray));
}
public static int calculateVolume(int[] land) {
int leftMax = 0;
int rightMax = 0;
int left = 0;
int right = land.length - 1;
int volume = 0;
while(left < right) {
if(land[left] > leftMax) {
leftMax = land[left];
}
if(land[right] > rightMax) {
rightMax = land[right];
}
if(leftMax >= rightMax) {
volume += rightMax - land[right];
right--;
} else {
volume += leftMax - land[left];
left++;
}
}
return volume;
}
}
Для тех, кто предпочитает Gist.
Хинт для программистов: если зарегистрироваться на соревнования Huawei Honor Cup, бесплатно получите доступ к онлайн-школе для участников. Можно прокачаться по разным навыкам и выиграть призы в самом соревновании.
Перейти к регистрации
|
{
"url": "https://tproger.ru/problems/water-accumulated-in-puddles-between-walls/",
"source_domain": "tproger.ru",
"snapshot_id": "crawl=CC-MAIN-2020-34",
"warc_metadata": {
"Content-Length": "76812",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KW2D4TFLU2EAD7TU7GOHWQ56UOSHR7OF",
"WARC-Concurrent-To": "<urn:uuid:d4bab673-8c64-44ec-9ab9-63bca0e98453>",
"WARC-Date": "2020-08-15T05:35:05Z",
"WARC-IP-Address": "104.26.7.235",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZOA72DD5G752M5S333PWAFYNCQDSKIIB",
"WARC-Record-ID": "<urn:uuid:24086953-5caf-494f-aeff-8a0a8d0f05df>",
"WARC-Target-URI": "https://tproger.ru/problems/water-accumulated-in-puddles-between-walls/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:12559101-6aa1-4a73-a96b-53a46e55c1be>"
},
"warc_info": "isPartOf: CC-MAIN-2020-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-226.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
47,
48,
62,
63,
129,
130,
178,
179,
210,
211,
236,
237,
522,
523,
679,
680,
705,
706,
951,
952,
986,
987,
1169,
1170,
1189,
1190,
1211,
1212,
1237,
1238,
1276,
1277,
1302,
1303,
1330,
1331,
1835,
1836,
2079,
2080,
2617,
2618,
2645,
2646,
2699,
2700,
2720,
2740,
2758,
2759,
2829,
2842,
2844,
2912,
2915,
2966,
3017,
3020,
3022,
3071,
3074,
3093,
3113,
3129,
3160,
3178,
3181,
3205,
3235,
3261,
3266,
3298,
3326,
3331,
3360,
3398,
3411,
3423,
3459,
3471,
3476,
3480,
3497,
3500,
3502,
3503,
3535,
3536,
3750,
3751
],
"line_end_idx": [
47,
48,
62,
63,
129,
130,
178,
179,
210,
211,
236,
237,
522,
523,
679,
680,
705,
706,
951,
952,
986,
987,
1169,
1170,
1189,
1190,
1211,
1212,
1237,
1238,
1276,
1277,
1302,
1303,
1330,
1331,
1835,
1836,
2079,
2080,
2617,
2618,
2645,
2646,
2699,
2700,
2720,
2740,
2758,
2759,
2829,
2842,
2844,
2912,
2915,
2966,
3017,
3020,
3022,
3071,
3074,
3093,
3113,
3129,
3160,
3178,
3181,
3205,
3235,
3261,
3266,
3298,
3326,
3331,
3360,
3398,
3411,
3423,
3459,
3471,
3476,
3480,
3497,
3500,
3502,
3503,
3535,
3536,
3750,
3751,
3772
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3772,
"ccnet_original_nlines": 90,
"rps_doc_curly_bracket": 0.004772000014781952,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.03369272127747536,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00808625016361475,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.8396226167678833,
"rps_doc_frac_unique_words": 0.615234375,
"rps_doc_mean_word_length": 5.712890625,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.508812427520752,
"rps_doc_word_count": 512,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.006153849884867668,
"rps_doc_frac_chars_dupe_6grams": 0.006153849884867668,
"rps_doc_frac_chars_dupe_7grams": 0.006153849884867668,
"rps_doc_frac_chars_dupe_8grams": 0.006153849884867668,
"rps_doc_frac_chars_dupe_9grams": 0.006153849884867668,
"rps_doc_frac_chars_top_2gram": 0.007179489824920893,
"rps_doc_frac_chars_top_3gram": 0.011282050050795078,
"rps_doc_frac_chars_top_4gram": 0.0027350399177521467,
"rps_doc_books_importance": -359.11798095703125,
"rps_doc_books_importance_length_correction": -359.11798095703125,
"rps_doc_openwebtext_importance": -182.94520568847656,
"rps_doc_openwebtext_importance_length_correction": -182.94520568847656,
"rps_doc_wikipedia_importance": -135.2105255126953,
"rps_doc_wikipedia_importance_length_correction": -135.2105255126953
},
"fasttext": {
"dclm": 0.9133225083351135,
"english": 0.00007214999641291797,
"fineweb_edu_approx": 2.391700267791748,
"eai_general_math": 0.00007439000182785094,
"eai_open_web_math": 0.3154582381248474,
"eai_web_code": 0.761765718460083
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "516",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
3,544,483,003,390,849,500 |
HtmlAgilityPack SelectNodes Syntax
.net c# html html-agility-pack xpath
Question
I have the following HTML:
<tbody>
<tr>
<td class="metadata_name">Headquarters</td>
<td class="metadata_content">Princeton New Jersey, United States</td>
</tr>
<tr>
<td class="metadata_name">Industry</td>
<td class="metadata_content"><ul><li><a href="/q-Engineering-Software-jobs.html" rel="nofollow">Engineering Software</a></li><li><a href="/q-Software-Development-&-Design-jobs.html" rel="nofollow">Software Development & Design</a></li><li><a href="/q-Software-jobs.html" rel="nofollow">Software</a></li><li><a href="/q-Custom-Software-&-Technical-Consulting-jobs.html" rel="nofollow">Custom Software & Technical Consulting</a></li></ul></td>
</tr>
<tr>
<td class="metadata_name">Revenue</td>
<td class="metadata_content">$17.5 Million</td>
</tr>
<tr>
<td class="metadata_name">Employees</td>
<td class="metadata_content">201 to 500</td>
</tr>
<tr>
<td class="metadata_name">Links</td>
<td class="metadata_content"><ul><li><a href="/url?q=http%3A%2F%2Fwww.site.com&h=085df2ca" target="_blank">Company website</a></li></ul></td>
</tr>
</tbody>
I want to be able to load the metadata_content value (ex "$17.5 Million") in to a var where the metadata_name is = to a value (ex: "Revenue").
I have tried to use combinations of code like this for a few hours...
orgHtml.DocumentNode.SelectNodes("//td[@class='metadata_name']")[0].InnerHtml;
But I'm not getting the right combination down. If you have a helpful SelectNodes syntax - that will get me the solution I would appreciate it.
Accepted Answer
It seems what you're looking for is this:
var found = orgHtml.DocumentNode.SelectSingleNode(
"//tr[td[@class = 'metadata_name'] = 'Revenue']/td[@class = 'metadata_content']");
if (found != null)
{
string html = found.InnerHtml;
// use html
}
Note that to get the text of an element, you should use found.InnerText, not found.InnerHtml, unless you specifically need its HTML content.
Licensed under: CC-BY-SA with attribution
Not affiliated with Stack Overflow
Is this KB legal? Yes, learn why
Licensed under: CC-BY-SA with attribution
Not affiliated with Stack Overflow
Is this KB legal? Yes, learn why
|
{
"url": "https://html-agility-pack.net/knowledge-base/27506725/htmlagilitypack-selectnodes-syntax",
"source_domain": "html-agility-pack.net",
"snapshot_id": "crawl=CC-MAIN-2019-26",
"warc_metadata": {
"Content-Length": "19333",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:H3HX7LGAY2X4I7P3QPHABNBN6SHHB3IT",
"WARC-Concurrent-To": "<urn:uuid:1f8b528b-699a-477b-bb48-ee834dd81a38>",
"WARC-Date": "2019-06-17T01:34:09Z",
"WARC-IP-Address": "199.233.255.71",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PWWGQLBFHFZAAQ7MEQGU6TA5QRERW2GB",
"WARC-Record-ID": "<urn:uuid:a0ae9a8e-05f5-43be-a1c6-1b83b090df59>",
"WARC-Target-URI": "https://html-agility-pack.net/knowledge-base/27506725/htmlagilitypack-selectnodes-syntax",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:40c67406-421c-4dc9-abca-834a0206d493>"
},
"warc_info": "isPartOf: CC-MAIN-2019-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-156-104-6.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
35,
36,
73,
74,
83,
84,
111,
112,
120,
129,
181,
259,
269,
278,
326,
792,
802,
811,
858,
914,
924,
933,
982,
1035,
1045,
1054,
1099,
1253,
1263,
1272,
1273,
1416,
1417,
1487,
1488,
1567,
1568,
1712,
1713,
1729,
1730,
1772,
1773,
1824,
1911,
1930,
1932,
1967,
1983,
1985,
1986,
2127,
2128,
2129,
2130,
2172,
2207,
2240,
2282,
2317
],
"line_end_idx": [
35,
36,
73,
74,
83,
84,
111,
112,
120,
129,
181,
259,
269,
278,
326,
792,
802,
811,
858,
914,
924,
933,
982,
1035,
1045,
1054,
1099,
1253,
1263,
1272,
1273,
1416,
1417,
1487,
1488,
1567,
1568,
1712,
1713,
1729,
1730,
1772,
1773,
1824,
1911,
1930,
1932,
1967,
1983,
1985,
1986,
2127,
2128,
2129,
2130,
2172,
2207,
2240,
2282,
2317,
2349
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2349,
"ccnet_original_nlines": 60,
"rps_doc_curly_bracket": 0.0008514299988746643,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1787610650062561,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.030088499188423157,
"rps_doc_frac_lines_end_with_ellipsis": 0.01639343984425068,
"rps_doc_frac_no_alph_words": 0.40707963705062866,
"rps_doc_frac_unique_words": 0.5981734991073608,
"rps_doc_mean_word_length": 7.356164455413818,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0.0035398199688643217,
"rps_doc_unigram_entropy": 4.637453079223633,
"rps_doc_word_count": 219,
"rps_doc_frac_chars_dupe_10grams": 0.10924890637397766,
"rps_doc_frac_chars_dupe_5grams": 0.10924890637397766,
"rps_doc_frac_chars_dupe_6grams": 0.10924890637397766,
"rps_doc_frac_chars_dupe_7grams": 0.10924890637397766,
"rps_doc_frac_chars_dupe_8grams": 0.10924890637397766,
"rps_doc_frac_chars_dupe_9grams": 0.10924890637397766,
"rps_doc_frac_chars_top_2gram": 0.012414650060236454,
"rps_doc_frac_chars_top_3gram": 0.01489758025854826,
"rps_doc_frac_chars_top_4gram": 0.028553690761327744,
"rps_doc_books_importance": -240.1464080810547,
"rps_doc_books_importance_length_correction": -240.1464080810547,
"rps_doc_openwebtext_importance": -158.98695373535156,
"rps_doc_openwebtext_importance_length_correction": -158.98695373535156,
"rps_doc_wikipedia_importance": -146.26681518554688,
"rps_doc_wikipedia_importance_length_correction": -146.26681518554688
},
"fasttext": {
"dclm": 0.9892001152038574,
"english": 0.576300859451294,
"fineweb_edu_approx": 1.6458604335784912,
"eai_general_math": 0.6866974830627441,
"eai_open_web_math": 0.2570508122444153,
"eai_web_code": 0.9442543387413025
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.7",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
714,261,041,310,109,400 |
A bug?
Started by number12, November 13, 2013, 04:37:36 AM
Previous topic - Next topic
0 Members and 1 Guest are viewing this topic.
number12
Keep trying to add HDR highlight pins to custom render our scene and EVERY time I we make the first command/click to add the first pin Keyshot crashes!!!! This is really frustrating as the only reason for us using this software is so we can create custom lights to make bespoke lighting for our scenes! If it's of any significance we are using a fairly high res HDR blank (black) file to start with when this happens (approx 150mb)
Anybody...? >:(
P.S. our models are coming from Maya and are imported into KS using DXF format (which incidentally we were very pleased to see introduced)
Chad Holton
Not sure what's going on in your case - I'll see if I can reproduce on my end based on your steps. I just tried it with the all black HDR provided and it worked okay. I'll try it with a custom black higher res HDR to see if it makes any difference.
|
{
"url": "https://forum.keyshot.com/index.php?topic=7019.msg33550",
"source_domain": "forum.keyshot.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "19742",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BC3EA2OATAVW6OLGVOATLP3LVTDQNCLU",
"WARC-Concurrent-To": "<urn:uuid:eb26b3dc-1ca8-4961-b211-ab867eafbad3>",
"WARC-Date": "2022-12-09T02:47:08Z",
"WARC-IP-Address": "104.26.14.237",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LKRDZGARYLDH5WU3LMMLRKTWLGQEICMF",
"WARC-Record-ID": "<urn:uuid:39c9d216-7466-4c98-9c26-04913060ee2e>",
"WARC-Target-URI": "https://forum.keyshot.com/index.php?topic=7019.msg33550",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:05e2e3f4-0d11-4d9f-8735-482b8fbf6236>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-51\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
3,
10,
11,
63,
64,
92,
93,
139,
140,
149,
150,
582,
583,
600,
601,
740,
741,
753,
754
],
"line_end_idx": [
2,
3,
10,
11,
63,
64,
92,
93,
139,
140,
149,
150,
582,
583,
600,
601,
740,
741,
753,
754,
1002
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1002,
"ccnet_original_nlines": 20,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4063926935195923,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07305935770273209,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16438356041908264,
"rps_doc_frac_unique_words": 0.6703296899795532,
"rps_doc_mean_word_length": 4.219780445098877,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0.004566209856420755,
"rps_doc_unigram_entropy": 4.632902145385742,
"rps_doc_word_count": 182,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.013020830228924751,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -109.86417388916016,
"rps_doc_books_importance_length_correction": -109.86417388916016,
"rps_doc_openwebtext_importance": -52.25780487060547,
"rps_doc_openwebtext_importance_length_correction": -38.22489929199219,
"rps_doc_wikipedia_importance": -41.64582061767578,
"rps_doc_wikipedia_importance_length_correction": -41.64582061767578
},
"fasttext": {
"dclm": 0.045900050550699234,
"english": 0.9528994560241699,
"fineweb_edu_approx": 1.0404483079910278,
"eai_general_math": 0.21607589721679688,
"eai_open_web_math": 0.11650776863098145,
"eai_web_code": 0.004641709849238396
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "621.367",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
5,254,104,123,910,093,000 |
Notification Email: Send to Contacts in a Cell
Options
The below form was built that when it is approved you will have 3 email alert notifications (i.e. 1. facility lead contact email, 2. HR contact email and then a set of 3. recipients). Would you be able to show me how I can use the HR contact email in the workflow noted below when a form is approved. When an approval occurs, I have one alert for the 1. Facility contact email (send contact in an email) and would like to do use the same (send contact in an email) selection for 2. HR contact email to send a notification when an approval happens. However, when I select “send contact in an email” I am unable to select HR contact email. Does that make sense and could you aid in a workflow where I can send 3 alerts to 1. & 2. two separate individuals and a 3. group of people?
• Form Example
• Workflow Example
Thank you.
Best Answer
Answers
• MONICA BUENDIA
edited 06/17/21
Options
Note I was able to get the second auto alert notification to "HR contact email". The issue is the notification alerts are not being received by the last 3 groups.
Workflow Example
A. Form submitted
B. Approver receives notifications and approves.
C. The following groups are not getting the alert notification:
1. Alert contact in cell "Facility lead contact email" NO EMAIL NOTIFICATION GENERATED
2. Alert contact in cell "HR contact email" NO EMAIL NOTIFICATION GENERATED
3. Alert specific people (several email will be here but the test one is not working) NO EMAIL NOTIFICATION GENERATED
Any help would be appreciated.
Thank you.
• Krissia B.
Krissia B. Moderator
Answer ✓
Options
Hello @MONICA BUENDIA
I see that you have opened a ticket with Smartsheet Support. At this time, this is the better route to take for your specific question.
Have a wonderful day~ Cheers!
Krissia
|
{
"url": "https://community.smartsheet.com/discussion/80455/notification-email-send-to-contacts-in-a-cell",
"source_domain": "community.smartsheet.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "399845",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RLYNRPS2KO6LP4W44KOYAF5AQLIJYQRG",
"WARC-Concurrent-To": "<urn:uuid:f5e79c1a-a6e9-4620-8bfc-9591e4792ad6>",
"WARC-Date": "2024-05-26T22:27:22Z",
"WARC-IP-Address": "162.159.128.79",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SRTB5VHTAU4OZO56UAH3C2YCEW7P7QCD",
"WARC-Record-ID": "<urn:uuid:e1df267e-4abb-46d7-a631-1b1614a54b2c>",
"WARC-Target-URI": "https://community.smartsheet.com/discussion/80455/notification-email-send-to-contacts-in-a-cell",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:36b9a76f-d5cf-4169-bcdb-68ff36a3758c>"
},
"warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-159\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
47,
48,
56,
57,
836,
837,
854,
875,
876,
887,
888,
900,
901,
909,
910,
929,
949,
961,
962,
1129,
1130,
1151,
1152,
1174,
1175,
1228,
1229,
1297,
1298,
1389,
1469,
1591,
1592,
1627,
1628,
1643,
1644,
1659,
1684,
1697,
1709,
1710,
1736,
1737,
1877,
1878,
1879,
1913,
1914
],
"line_end_idx": [
47,
48,
56,
57,
836,
837,
854,
875,
876,
887,
888,
900,
901,
909,
910,
929,
949,
961,
962,
1129,
1130,
1151,
1152,
1174,
1175,
1228,
1229,
1297,
1298,
1389,
1469,
1591,
1592,
1627,
1628,
1643,
1644,
1659,
1684,
1697,
1709,
1710,
1736,
1737,
1877,
1878,
1879,
1913,
1914,
1925
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1925,
"ccnet_original_nlines": 49,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3315926790237427,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08877284824848175,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20626631379127502,
"rps_doc_frac_unique_words": 0.4272445738315582,
"rps_doc_mean_word_length": 4.45820426940918,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.542330265045166,
"rps_doc_word_count": 323,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0833333283662796,
"rps_doc_frac_chars_dupe_6grams": 0.055555559694767,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.07500000298023224,
"rps_doc_frac_chars_top_3gram": 0.05833332985639572,
"rps_doc_frac_chars_top_4gram": 0.05833332985639572,
"rps_doc_books_importance": -118.7834701538086,
"rps_doc_books_importance_length_correction": -118.78346252441406,
"rps_doc_openwebtext_importance": -85.32913970947266,
"rps_doc_openwebtext_importance_length_correction": -85.32913970947266,
"rps_doc_wikipedia_importance": -49.23152160644531,
"rps_doc_wikipedia_importance_length_correction": -49.23152160644531
},
"fasttext": {
"dclm": 0.034832000732421875,
"english": 0.9151400923728943,
"fineweb_edu_approx": 0.9097575545310974,
"eai_general_math": 0.006684239953756332,
"eai_open_web_math": 0.02920001931488514,
"eai_web_code": 0.0018674699822440743
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.40285",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
1,538,908,851,035,692,000 |
Interface IndexReader.CacheHelper
• Enclosing class:
IndexReader
public static interface IndexReader.CacheHelper
A utility class that gives hooks in order to help build a cache based on the data that is contained in this index.
Example: cache the number of documents that match a query per reader.
public class QueryCountCache {
private final Query query;
private final Map<IndexReader.CacheKey, Integer> counts = new ConcurrentHashMap<>();
// Create a cache of query counts for the given query
public QueryCountCache(Query query) {
this.query = query;
}
// Count the number of matches of the query on the given IndexSearcher
public int count(IndexSearcher searcher) throws IOException {
IndexReader.CacheHelper cacheHelper = searcher.getIndexReader().getReaderCacheHelper();
if (cacheHelper == null) {
// reader doesn't support caching
return searcher.count(query);
} else {
// make sure the cache entry is cleared when the reader is closed
cacheHelper.addClosedListener(counts::remove);
return counts.computeIfAbsent(cacheHelper.getKey(), cacheKey -> {
try {
return searcher.count(query);
} catch (IOException e) {
throw new UncheckedIOException(e);
}
});
}
}
}
WARNING: This API is experimental and might change in incompatible ways in the next release.
|
{
"url": "https://lucene.apache.org/core/9_0_0/core/org/apache/lucene/index/IndexReader.CacheHelper.html",
"source_domain": "lucene.apache.org",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "11585",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HN3FDL7XVR3B6IHKTY4I77T5VLZ7C7ZG",
"WARC-Concurrent-To": "<urn:uuid:bd502795-111b-4391-89c1-24c5bc833a6f>",
"WARC-Date": "2022-12-05T11:21:38Z",
"WARC-IP-Address": "151.101.2.132",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XS5LAE26WXAYBPJC2SYJRC5RL655NRWR",
"WARC-Record-ID": "<urn:uuid:2f6d7bce-22d7-4489-84d0-360dbc476c0f>",
"WARC-Target-URI": "https://lucene.apache.org/core/9_0_0/core/org/apache/lucene/index/IndexReader.CacheHelper.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7caa6d86-12d6-47cc-bea3-56e315610c30>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-177\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
34,
35,
56,
72,
73,
125,
244,
245,
319,
320,
356,
361,
395,
487,
492,
553,
598,
627,
636,
641,
719,
788,
885,
921,
966,
1007,
1025,
1102,
1160,
1237,
1256,
1301,
1340,
1390,
1405,
1420,
1431,
1440,
1445,
1452,
1458
],
"line_end_idx": [
34,
35,
56,
72,
73,
125,
244,
245,
319,
320,
356,
361,
395,
487,
492,
553,
598,
627,
636,
641,
719,
788,
885,
921,
966,
1007,
1025,
1102,
1160,
1237,
1256,
1301,
1340,
1390,
1405,
1420,
1431,
1440,
1445,
1452,
1458,
1554
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1554,
"ccnet_original_nlines": 41,
"rps_doc_curly_bracket": 0.010296010412275791,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2151898741722107,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012658230029046535,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.29957807064056396,
"rps_doc_frac_unique_words": 0.6206896305084229,
"rps_doc_mean_word_length": 6.855172634124756,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.267793655395508,
"rps_doc_word_count": 145,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.06237424910068512,
"rps_doc_frac_chars_top_3gram": 0.02213280089199543,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -99.88084411621094,
"rps_doc_books_importance_length_correction": -87.61024475097656,
"rps_doc_openwebtext_importance": -75.01654052734375,
"rps_doc_openwebtext_importance_length_correction": -75.01654052734375,
"rps_doc_wikipedia_importance": -54.623512268066406,
"rps_doc_wikipedia_importance_length_correction": -40.98664093017578
},
"fasttext": {
"dclm": 0.9886186122894287,
"english": 0.6384044289588928,
"fineweb_edu_approx": 2.119506359100342,
"eai_general_math": 0.7588825821876526,
"eai_open_web_math": 0.036768730729818344,
"eai_web_code": 0.9950287342071533
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-4,280,963,935,238,593,500 |
General Mail Notification Sync Issue
Discussion in 'iOS 7' started by varsityhero, Apr 5, 2014.
1. varsityhero macrumors regular
Joined:
Jul 2, 2013
#1
Hi. So I'm converting from using GMail to iCloud Mail. I have a rMini and 5S, both of which are running iOS 7.1. I am using the mail.app with all notifications (lock screen, badge, etc) turned on for both devices. I was under the impression that if I got an email and read it on one device, it would remove the notifications on the other device automatically. This isn't happening for me though. Is this an error or how it's supposed to be? Thanks.
2. laudern macrumors 6502a
Joined:
Jan 5, 2011
#2
I've had the exact same problem since forever. I thought ios7 was meant to fix it but nothing has ever changed since I've started using an iPhone (2009).
3. varsityhero thread starter macrumors regular
Joined:
Jul 2, 2013
#3
Really? My iMessage notifications sync just fine and I thought the Mail app would do the same thing, especially since I was using Apple's iCloud email service.
4. laudern macrumors 6502a
Joined:
Jan 5, 2011
#4
I can't comment on iMessage since my mac is never signed into that. But my FaceTime is always signed in on my mac and those notifications never go away unless i physically check them on my mac... exactly the same as my mail.... sucks
Share This Page
|
{
"url": "https://forums.macrumors.com/threads/mail-notification-sync-issue.1723363/",
"source_domain": "forums.macrumors.com",
"snapshot_id": "crawl=CC-MAIN-2017-39",
"warc_metadata": {
"Content-Length": "143576",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YWBK47HUUEUD4W4WTWYIJEYPHZDCB4BK",
"WARC-Concurrent-To": "<urn:uuid:a2d4493d-6d04-4999-898e-31c42fa5ebc6>",
"WARC-Date": "2017-09-21T19:06:40Z",
"WARC-IP-Address": "162.254.116.250",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JG2YJNQLY5ZXOBVAK3NMPCFZ4AE3JWN2",
"WARC-Record-ID": "<urn:uuid:68bef386-7269-4d0e-a3f6-ceb3941f0ecc>",
"WARC-Target-URI": "https://forums.macrumors.com/threads/mail-notification-sync-issue.1723363/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:630f2489-1d0e-4730-9c92-f49899bbd58c>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-31-57-149.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-39\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for September 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
37,
38,
97,
98,
133,
134,
146,
162,
169,
622,
628,
657,
658,
670,
686,
693,
851,
857,
907,
908,
920,
936,
943,
1107,
1113,
1142,
1143,
1155,
1171,
1178,
1416,
1422,
1423
],
"line_end_idx": [
37,
38,
97,
98,
133,
134,
146,
162,
169,
622,
628,
657,
658,
670,
686,
693,
851,
857,
907,
908,
920,
936,
943,
1107,
1113,
1142,
1143,
1155,
1171,
1178,
1416,
1422,
1423,
1438
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1438,
"ccnet_original_nlines": 33,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35548174381256104,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.039867110550403595,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24916943907737732,
"rps_doc_frac_unique_words": 0.5983263850212097,
"rps_doc_mean_word_length": 4.3430962562561035,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0.01993354968726635,
"rps_doc_unigram_entropy": 4.754030704498291,
"rps_doc_word_count": 239,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.12524084746837616,
"rps_doc_frac_chars_dupe_6grams": 0.12524084746837616,
"rps_doc_frac_chars_dupe_7grams": 0.06743738055229187,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01445087045431137,
"rps_doc_frac_chars_top_3gram": 0.04238921031355858,
"rps_doc_frac_chars_top_4gram": 0.048169560730457306,
"rps_doc_books_importance": -126.43429565429688,
"rps_doc_books_importance_length_correction": -123.65606689453125,
"rps_doc_openwebtext_importance": -78.11998748779297,
"rps_doc_openwebtext_importance_length_correction": -78.11998748779297,
"rps_doc_wikipedia_importance": -87.69911193847656,
"rps_doc_wikipedia_importance_length_correction": -80.27599334716797
},
"fasttext": {
"dclm": 0.03629637137055397,
"english": 0.9600182771682739,
"fineweb_edu_approx": 0.9018175601959229,
"eai_general_math": 0.009729799814522266,
"eai_open_web_math": 0.10863667726516724,
"eai_web_code": 0.0016474700532853603
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.656",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
8,212,090,653,150,446,000 |
Hailiang Dong
Ph.D. & M.S. in Computer Science, B.S. in Mathematics
Find Majority Element in Linear Time
Problem DescriptionInput: an array of elements with size $N$, and there exists an element $M$ accounts for more than 50% of the array (called Majo..
KMP字符串匹配算法
问题描述字符串匹配是一个很经典的问题，具体描述如下： 给定两个字符串：主串S和模式串P，判断S中是否包含P，如果包含则返回S中出现的第一个P的位置（ S中出现的所有的P的位置），否则返回-1(NULL)。 在下文中，为了便于分析，我们记主串S的长度为n，模式串P的长度为m。此外，我们用符号i..
C语言无符号数据读取
背景像C语言这种语言对输入输出的要求极其严格，你必须要制定你读取的数据类型以及格式。现在的问题是如果你读取的时候指定了错误的数据类型，会发生什么？ 案例分析加入说你要读取64位无符号整数类型数据，所以你的程序可能大概是这样子的。12unsigned long val=0;scanf("..
电梯的停留楼层数量分析
问题描述假设现在一个楼栋共有M层，有一个电梯一次性最多能装N个人。问题是，假如说现在该电梯在一楼进入了N个乘客，不考虑从中间楼层上的乘客问题，那么该电梯大概需要停留几次才能将所有的乘客送到目的地。也就是说，这N个乘客选出不同楼层的数量X的期望是多少？ 按照定义求解首先，我们可以分析出随机变量X可..
多桶哈希的冲突数量分析
介绍传统的哈希方式采用一个大的连续空间来存储元素，当元素满了之后，它需要将空间的容量扩充为两倍，并将之前所有的元素重新哈希到新的空间里面，这个过程成为Rehash. 现在我们有一个问题是， 如果将数据按照范围等分成K份，将一个大的空间等分成K个桶。然后将每一份数据分别hash到对应的桶里面，..
阿里笔试编程题-相亲的次数问题
问题描述一个未婚男青年要和N个女孩相亲，由于他不记录已经相亲过的女孩，而是每一次随机从这N个女孩中挑选一个进行相亲。由于相亲的女孩可能是已经相亲过的，那么现在的问题就是他平均要相亲多少次，才能将所有的女孩都相亲一遍（期望）。 问题分析其实呢，这道题只是一道披着编程外表的数学题。他就是要求男孩相亲..
阿里算法工程师编程小测试-取石子游戏
问题描述现在有一堆石子，共有N个。两个人轮流取石子，先拿完的人获胜。规定第一次不能拿N个，并且每一次拿的石子数量介于1和上一次拿的数量之间。现在的问题是，如果你作为先手，对于给定的N个石子，在保证能获胜的情况下，你最多能拿多少个？如果先手不能获胜，输出0即可。 问题分析这个题有意思的地方就在于每..
计算二项分布的期望
基本概念二项分布即重复N次独立的伯努利试验。在每次试验中只有两种可能的结果（成功和失败），而且两种结果发生与否互相对立，并且相互独立，与其它各次试验结果无关，事件发生与否的概率在每一次独立试验中都保持不变。设随机变量X为N次实验中成功的次数，则如何求X的期望？ 按照定义求解假设成功的概率为$p$..
内核程序访问用户地址空间
背景由于做实验需要在Linux内核中添加一些系统调用，我们在一台机器上完成了系统调用的编写，并顺利通过了所有的测试，用户程序的运行也完全正常。不够由于实验数据的增大，我们需要一台内存更大的电脑。为了方便，我们直接把那台机器的硬盘拆下来，放到别的机器上，然后从那块硬盘启动进入系统做实验。 然后神奇..
K-Means 算法基础
基本原理K-Means 作为一种最简单的聚类算法，在数据挖掘中有着比较广泛的应用。如下图所示，给你一批数据（绿色的点），让你将数据划分成2类，这就是K-Means要解决的问题。 总的来说，K-MEANS的具体计算方法可分为如下的四步 随机选取K个中心点 图（b） 遍历所有数据，将每个数据划分..
|
{
"url": "https://leondong1993.github.io/",
"source_domain": "leondong1993.github.io",
"snapshot_id": "crawl=CC-MAIN-2019-35",
"warc_metadata": {
"Content-Length": "24938",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:23STERCQRPRBL6AOFFDXTIJKJNQ2W2T2",
"WARC-Concurrent-To": "<urn:uuid:4520b6a8-5ffe-44fa-b517-1c552649bb9a>",
"WARC-Date": "2019-08-20T04:17:47Z",
"WARC-IP-Address": "185.199.111.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6ARSUZJGT6ERA6BMBCLDPXDYZGBNYLHZ",
"WARC-Record-ID": "<urn:uuid:8afca299-466c-404c-85a8-9711accfa22b>",
"WARC-Target-URI": "https://leondong1993.github.io/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b1578bed-98fb-4019-ac97-2132bd7b6076>"
},
"warc_info": "isPartOf: CC-MAIN-2019-35\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-246.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
14,
15,
69,
70,
107,
108,
259,
260,
261,
272,
273,
422,
423,
424,
435,
436,
582,
583,
584,
596,
597,
748,
749,
750,
762,
763,
912,
913,
914,
930,
931,
1082,
1083,
1084,
1103,
1104,
1255,
1256,
1257,
1267,
1268,
1419,
1420,
1421,
1434,
1435,
1586,
1587,
1588,
1601,
1602
],
"line_end_idx": [
14,
15,
69,
70,
107,
108,
259,
260,
261,
272,
273,
422,
423,
424,
435,
436,
582,
583,
584,
596,
597,
748,
749,
750,
762,
763,
912,
913,
914,
930,
931,
1082,
1083,
1084,
1103,
1104,
1255,
1256,
1257,
1267,
1268,
1419,
1420,
1421,
1434,
1435,
1586,
1587,
1588,
1601,
1602,
1750
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1750,
"ccnet_original_nlines": 51,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.05498281866312027,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.12371134012937546,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.7010309100151062,
"rps_doc_frac_unique_words": 0.9230769276618958,
"rps_doc_mean_word_length": 20.384614944458008,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.2433624267578125,
"rps_doc_word_count": 78,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -171.81736755371094,
"rps_doc_books_importance_length_correction": -162.7689208984375,
"rps_doc_openwebtext_importance": -74.99317932128906,
"rps_doc_openwebtext_importance_length_correction": -74.99317932128906,
"rps_doc_wikipedia_importance": -41.41526794433594,
"rps_doc_wikipedia_importance_length_correction": -36.63931655883789
},
"fasttext": {
"dclm": 0.0771932601928711,
"english": 0.00452819000929594,
"fineweb_edu_approx": 2.0175657272338867,
"eai_general_math": 0.4813920855522156,
"eai_open_web_math": 0.13485592603683472,
"eai_web_code": 0.022869590669870377
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "519.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-7,144,477,612,106,748,000 |
On batching vs. latency, and jobqueue models
Last week at work, as part of an ongoing effort to constantly improve performances and scalability of our platform, I started investigating one of our oldest pieces of software infrastructure, i.e. the job queue framework we use for work distribution in our main service tasks.
The basic structure is more or less this:
jobqueue 1
i.e. a Manager process that controls workers (their status and cardinality), fetches data in large chunks from upstream and feeds worker processes waiting for work with a smaller chunk of data each. A shared memory segment is used as internal buffer. Each worker can process data in parallel before sending results downstream and becoming free to accept more work again.
After briefly discussing this with a colleague (did I ever mention we work with really smart people?), we agreed that a much more efficient approach would be to let the workers connect to the data provider directly, leaving the manager with the task of controlling status and cardinality of the workers, but stripping it of the responsibility of work distribution. As it often happens when optimising software, the new design was simpler (fewer moving parts):
jobqueue 2
To me and a few other colleagues, the potential improvements were fairly obvious, but I was surprised to hear some strong arguments against this approach from other experienced programmers. The counter-arguments sounded solid, but weren't substantiated by actual numbers, highlighting how we often believe (and are willing to defend!) things without verifying our assumptions.
So let me debunk these assertions :-)
Remark #1: accessing a shared-memory queue is orders of magnitudes faster than anything else
Accessing memory is indeed usually fast, but how memory is accessed is important too, and in this specific case the argument doesn't hold for several reasons:
• to enqueue/dequeue items in the shared memory buffer, thousands of system calls per second are actually required, which incur in a big CPU penalty
• however fast, it's an extra hop
• although fetching items from the provider happens (ideally) in large batches, the items are processed serially when inserting and removing from the buffer, and the workers are served serially too
• each item is added and removed from the CPU cache at least twice
• the contention on the data provider is not removed, alas merely moved downstream to another queue
Remark #2: Batching increases latency
"Now that many workers have direct and concurrent access to the source, to avoid hitting it too often, each worker must request a larger batch, but that means introducing a higher latency - it's better to increase the number of workers and let them process fewer items each in parallel".
This is a sensible objection, and yet why can it be wrong under many circumstances? Two reasons:
1. unless the work is I/O-bound, having more workers than CPU cores only increases contention and context-switching in the OS' scheduler; a single process/thread per CPU core is the best configuration to maximise CPU efficiency
2. batching improves throughput and actually decreases latency. Explaining this requires a little theory. There are two kinds of batching:
• you can wait for the batch to fill up or a timeout to occur, and then ship it; example: Nagle's algorithm. Performances of this approach are not much better than serial delivery. This adds latency.
• you can ship the first item that's available, process it, then come back and take all the data that was produced in the meantime, and keep looping that way.
Applying Little's Law to an example, if you need to send 10 messages to a device with 100µs latency, a serial delivery would take 1ms, whilst, assuming it ships one item first, and then the other 9 in another batch, batching strategy #2 would have an average latency of at most 190µs (although on average 5 items will be available for each delivery, resulting in an average latency of only 150µs). Batching can decrease latency.
I do however concede that the original statement might be true if a) the task is NOT CPU-bound and b) after fetching a batch, the items are processed serially within a single worker, when another worker might be have been idle and able to process some items (on an idle CPU core).
Remark #3: Prefetching a large batch of items speeds up work distribution
The main idea behind the original job queue was to minimise the number of requests to the data provider, by fetching data in large chunks, and have each worker consume a smaller batch each, from a fast memory buffer. Now, ignoring the fact that modern data sources can happily sustain 100K+ connections per second (making the need for one single collector go away), this remark is based on the assumption that the internal queue is always half full, and the Manager process is actually reading large chunks all the time.
Reality is, queues are on average either completely full or empty. In fact, it's very difficult to have a perfect ideal balance between production and consumption rates. You'd rather hope consumption always outpaces production (or you step into the nasty business of unbounded queues).
So assuming we can always keep up with the producer, once the worker is done, it will either find very few new items available in the queue, or none at all. The Manager at this point would no longer fetch large chunks from upstream, but batches similar to the ones processed by each worker, effectively losing the economy of scale and becoming a pointless intermediary.
With each worker having direct access to the source, there's still the problem of stampedes when many of them are free; you can avoid trashing CPU and the producer by having blocking reads (preferred) or, lacking the first option, by backing off for a few ms when there's no work to do. In this situation, the number of requests to the producer shouldn't be very different from the one-reader scenario we started with.
There are other notes regarding queue theory (push vs pull) I'd like to add, but I'll leave them for another blog post.
Results
To make a long story short, I spent a couple of hours simplifying the original job queue for a few tasks, and implementing the second strategy, with results that speak for themselves: much better use of all CPU cores, decreased load, decreased latency and, best of all, given it's no longer artificially throttled, a single node can now take 5 times more traffic, with fewer workers:
results
Conclusion
I wanted to share this story to explain why having a good understanding of CPU and memory models and a little queue theory is important, and to show an example of the sort of challenges we face daily at DataSift (if this is what motivates you and want to work with us, ping me).
I was also inspired by a great talk on programming folklore of one of my favourite engineers, Martin Thompson of LMAX fame: never miss his talks, they're all excellent.
My take-away lessons: be careful with assumptions (at least, re-evaluate them often!), measure everything, avoid complexity.
Take care!
Lorenzo Alberton
Lorenzo Alberton Lorenzo PHP5 ZCE - Zend Certified Engineer has been working with large enterprise UK companies for the past years and is now CTO at DataSift. He's an international conference speaker and a long-time contributor to many open source projects. Lorenzo Alberton's profile on LinkedIN View Lorenzo Alberton's Twitter stream
Lorenzo Alberton - Sun Certified MySQL 5 Developer
Tags
AJAX, Apache, Book Review, Charset, Cheat Sheet, Data structures, Database, Firebird SQL, Hadoop, Imagick, INFORMATION_SCHEMA, JavaScript, Kafka, Linux, Message Queues, mod_rewrite, Monitoring, MySQL, NoSQL, Oracle, PDO, PEAR, Performance, PHP, PostgreSQL, Profiling, Scalability, Security, SPL, SQL Server, SQLite, Testing, Tutorial, TYPO3, Windows, Zend Framework
Buy me a book - Applied Mathematics For Database Professionals
|
{
"url": "http://alberton.info/batching_vs_latency_and_jobqueue_models.html",
"source_domain": "alberton.info",
"snapshot_id": "crawl=CC-MAIN-2017-30",
"warc_metadata": {
"Content-Length": "21540",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TAXUX2OPBEYUPMKDDLLDDBR4XM2IKGH6",
"WARC-Concurrent-To": "<urn:uuid:d63af64f-cc87-4264-afad-761deaa6571e>",
"WARC-Date": "2017-07-26T06:38:50Z",
"WARC-IP-Address": "217.160.0.133",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:4B323MBEB6MLCXEGMFOGCNC5W66BPXBZ",
"WARC-Record-ID": "<urn:uuid:26cd636e-7e83-4f28-920d-7c01591a5a83>",
"WARC-Target-URI": "http://alberton.info/batching_vs_latency_and_jobqueue_models.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:086fdfe7-4e3d-48fd-847e-da103b49ffbc>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-228-88-99.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-30\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for July 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
45,
46,
324,
366,
367,
378,
749,
750,
1210,
1211,
1222,
1223,
1600,
1601,
1639,
1640,
1733,
1734,
1893,
1894,
2045,
2081,
2281,
2350,
2452,
2453,
2491,
2492,
2780,
2877,
2878,
3108,
3249,
3250,
3454,
3617,
3618,
4051,
4052,
4053,
4334,
4335,
4409,
4410,
4931,
5217,
5587,
6006,
6126,
6127,
6135,
6136,
6520,
6521,
6529,
6530,
6541,
6542,
6821,
6822,
6823,
6992,
6993,
7118,
7129,
7130,
7131,
7132,
7149,
7150,
7486,
7487,
7538,
7539,
7544,
7545,
7911,
7912
],
"line_end_idx": [
45,
46,
324,
366,
367,
378,
749,
750,
1210,
1211,
1222,
1223,
1600,
1601,
1639,
1640,
1733,
1734,
1893,
1894,
2045,
2081,
2281,
2350,
2452,
2453,
2491,
2492,
2780,
2877,
2878,
3108,
3249,
3250,
3454,
3617,
3618,
4051,
4052,
4053,
4334,
4335,
4409,
4410,
4931,
5217,
5587,
6006,
6126,
6127,
6135,
6136,
6520,
6521,
6529,
6530,
6541,
6542,
6821,
6822,
6823,
6992,
6993,
7118,
7129,
7130,
7131,
7132,
7149,
7150,
7486,
7487,
7538,
7539,
7544,
7545,
7911,
7912,
7974
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7974,
"ccnet_original_nlines": 78,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41025641560554504,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02500000037252903,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15833333134651184,
"rps_doc_frac_unique_words": 0.4453846216201782,
"rps_doc_mean_word_length": 4.896923065185547,
"rps_doc_num_sentences": 45,
"rps_doc_symbol_to_word_ratio": 0.002564100082963705,
"rps_doc_unigram_entropy": 5.752316951751709,
"rps_doc_word_count": 1300,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.01633678935468197,
"rps_doc_frac_chars_dupe_6grams": 0.007540060207247734,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.004712540190666914,
"rps_doc_frac_chars_top_3gram": 0.0070687998086214066,
"rps_doc_frac_chars_top_4gram": 0.005340870004147291,
"rps_doc_books_importance": -681.968505859375,
"rps_doc_books_importance_length_correction": -681.968505859375,
"rps_doc_openwebtext_importance": -451.69635009765625,
"rps_doc_openwebtext_importance_length_correction": -451.69635009765625,
"rps_doc_wikipedia_importance": -237.89454650878906,
"rps_doc_wikipedia_importance_length_correction": -237.89454650878906
},
"fasttext": {
"dclm": 0.14825642108917236,
"english": 0.9495586156845093,
"fineweb_edu_approx": 1.7560428380966187,
"eai_general_math": 0.6183577179908752,
"eai_open_web_math": 0.23528599739074707,
"eai_web_code": 0.6616859436035156
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "5",
"label": "Evaluate"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-7,350,945,588,405,991,000 |
Mostly a simple postfix question
Discussion in 'Server Operation' started by jodyflorian, Dec 19, 2007.
1. jodyflorian
jodyflorian New Member
Hi,
This is probably a simple problem, although I'm having trouble explaining! Here it goes:
I have an ubuntu server running lamp with postfix.
I just want to use postfix to send mail from php, nothing else.
I use a third party server as my mail server which handles various addressses, like [email protected].
When I get php to send a mail to [email protected], it incorrectly goes to the LAMP's postfix server, which then sends a user not found bounce. Instead, when I get php to send a mail to [email protected], shouldn't it use the third party mail server as specified by the MX records?
I'm not sure what's going on but I presume this is a postfix configuration problem? Please could someone help me to get postfix sending emails to the MX server, not itself!!
Thanks!
2. falko
falko Super Moderator ISPConfig Developer
Please make sure that logicsmiths.co.uk is not listed in mydestination in /etc/postfix/main.cf.
3. jodyflorian
jodyflorian New Member
That must have been it
Thanks, that must be the problem.
For reference, Initially it was:
Code:
mydestination = logicsmiths.co.uk, localhost, localhost.localdomain, localhost
From what you say, this is clearly the problem! For any of the destinations, it resolves to itself.
I've just tried changing it to:
Code:
mydestination = mail.logicsmiths.co.uk, mail2.logicsmiths.co.uk
After restarting, /etc/init.d postfix restart) The problem is fixed! :D
Thankyou!
Share This Page
|
{
"url": "https://www.howtoforge.com/community/threads/mostly-a-simple-postfix-question.18598/",
"source_domain": "www.howtoforge.com",
"snapshot_id": "crawl=CC-MAIN-2019-47",
"warc_metadata": {
"Content-Length": "32833",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MPF7VCP43HPSWB35I2YBVVQBN2I65VGK",
"WARC-Concurrent-To": "<urn:uuid:36173681-0b00-4852-ba64-d787ec09ca5d>",
"WARC-Date": "2019-11-15T09:16:04Z",
"WARC-IP-Address": "104.26.3.165",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:P7NZ65SO6BAQZDVE7ZZTRPLBF32JRHLN",
"WARC-Record-ID": "<urn:uuid:31102138-b3f3-4e0f-a661-d3b99aeab6ab>",
"WARC-Target-URI": "https://www.howtoforge.com/community/threads/mostly-a-simple-postfix-question.18598/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:da5c3304-53ba-4855-a82e-448cd9de6c4c>"
},
"warc_info": "isPartOf: CC-MAIN-2019-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-222.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
33,
34,
105,
106,
123,
124,
151,
152,
160,
161,
254,
255,
310,
311,
379,
380,
487,
488,
774,
775,
953,
954,
966,
972,
983,
984,
1030,
1031,
1131,
1137,
1154,
1155,
1182,
1183,
1210,
1211,
1249,
1250,
1287,
1297,
1380,
1484,
1485,
1521,
1531,
1599,
1604,
1680,
1681,
1695,
1701,
1702
],
"line_end_idx": [
33,
34,
105,
106,
123,
124,
151,
152,
160,
161,
254,
255,
310,
311,
379,
380,
487,
488,
774,
775,
953,
954,
966,
972,
983,
984,
1030,
1031,
1131,
1137,
1154,
1155,
1182,
1183,
1210,
1211,
1249,
1250,
1287,
1297,
1380,
1484,
1485,
1521,
1531,
1599,
1604,
1680,
1681,
1695,
1701,
1702,
1717
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1717,
"ccnet_original_nlines": 52,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3439306318759918,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03757224977016449,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23699422180652618,
"rps_doc_frac_unique_words": 0.5506072640419006,
"rps_doc_mean_word_length": 5.048583030700684,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.635512351989746,
"rps_doc_word_count": 247,
"rps_doc_frac_chars_dupe_10grams": 0.0609462708234787,
"rps_doc_frac_chars_dupe_5grams": 0.0609462708234787,
"rps_doc_frac_chars_dupe_6grams": 0.0609462708234787,
"rps_doc_frac_chars_dupe_7grams": 0.0609462708234787,
"rps_doc_frac_chars_dupe_8grams": 0.0609462708234787,
"rps_doc_frac_chars_dupe_9grams": 0.0609462708234787,
"rps_doc_frac_chars_top_2gram": 0.014434640295803547,
"rps_doc_frac_chars_top_3gram": 0.0400962308049202,
"rps_doc_frac_chars_top_4gram": 0.04971932992339134,
"rps_doc_books_importance": -180.86944580078125,
"rps_doc_books_importance_length_correction": -169.67103576660156,
"rps_doc_openwebtext_importance": -83.17578887939453,
"rps_doc_openwebtext_importance_length_correction": -83.17578887939453,
"rps_doc_wikipedia_importance": -70.22380065917969,
"rps_doc_wikipedia_importance_length_correction": -62.355079650878906
},
"fasttext": {
"dclm": 0.05944221839308739,
"english": 0.9089168906211853,
"fineweb_edu_approx": 1.0185425281524658,
"eai_general_math": 0.2901744842529297,
"eai_open_web_math": 0.34761202335357666,
"eai_web_code": 0.07119066268205643
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.442",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
1,874,554,907,623,317,800 |
Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.
Let $p$ be an odd prime. I am interested in how many quadratic residues $a$ sre there such that $a+1$ is also a quadratic residue modulo $p$. I am sure that this number is $$ \frac{p-6+\text{mod}(p,4)}{4}, $$ but I have neither proof nor reference. It is a particular case of the question in the title: if $a$ and $b$ are quadratic residues modulo $p$, when is $a+b$ also a quadratic residue modulo $p$?
I came into this question when counting the number of diophantine $2$-tuples modulo $p$, that is, the number of pairs $\{ a,b\}\subset \mathbb{Z}^*_p$ such that $ab+1$ is a quadratic residue modulo $p$.
share|improve this question
4
This is an easy consequence of the fact that $x^2+y^2=z^2$ is a curve of genus $0$ and so have exactly $p$ projective solutions. – Samir Siksek May 16 '11 at 22:05
Note that your motivating problem can be solved directly. Let $q$ be any of the $(p+1)/2$ quadratic residues, and let's count the solutions of $ab+1=q$. For $q=1$ the equation is equivalent to $a=0$ or $b=0$, so there are $2p-1$ solutions. For $q\neq 1$ we have $a\neq 0$ and $b\neq 0$ which determine each other uniquely, so there are $p-1$ solutions. Altogether the number of (ordered) diophantine pairs equals $2p-1+(p-1)^2/2=(p^2+2p-1)/2$. – GH from MO May 17 '11 at 3:46
@GH Some of the solutions will have $a=b$, which I do not want to count. May be I was not clear about this. – Julián Aguirre May 17 '11 at 21:09
add comment
4 Answers
up vote 13 down vote accepted
Here's a copy-paste of something I wrote up a while ago:
Lemma: Let $q$ be odd, and let $Q$ be the set of quadratic residues (including $0$) in $\mathbb F_q$. Then the number of elements $s_q(c)$ in $\{x^2+c|x \in \mathbb{F}_q\} \cap Q$ is given by \begin{array}{|c|c|c|} \hline & c \in Q & c \notin Q \\ \hline -1 \in Q & \frac{q+3}{4} & \frac{q-1}{4} \\ \hline -1 \notin Q & \frac{q+1}{4} & \frac{q+1}{4} \\ \hline \end{array}
Proof: If, for $x,y,c\in \mathbb{F}_q,\ c \neq 0$ we have $x^2+c=y^2$, then $c=y^2-x^2=(y-x)(y+x)$. Now for all the $q-1$ elements $d\in \mathbb{F}_q^{\ast}$, we can let $y-x=d$ and $y+x=\frac{c}{d}$. But the pairs $(d,\frac{c}{d}),(-d,\frac{c}{-d}),(\frac{c}{d},d),(\frac{c}{-d},-d)$ all give the same value of $y^2=\frac{1}{4}(d+c/d)^2$. Also, as $q$ is odd, $d\neq -d\ \forall d$. But if $c\in Q$, for $2$ values of $d$ we have $d=\frac{c}{d}$ and if $-c\in Q$, for 2 values of $d$ we have $d=\frac{c}{-d}$. So we have $$ s_q(c) = \left\{ \begin{array}{rcll} \frac{\frac{q-1}{2}-2}{2}+2 & = & \frac{q+3}{4} & if\ c\in Q,\ -c\in Q \\ \frac{\frac{q-1}{2}-1}{2}+1 & = & \frac{q+1}{4} & if\ c\in Q,\ -c\notin Q \\ \frac{\frac{q-1}{2}-1}{2}+1 & = & \frac{q+1}{4} & if\ c\notin Q,\ -c\in Q \\ & & \frac{q-1}{4} & if\ c\notin Q,\ -c\notin Q \end{array} \right. $$ and hence the result.
share|improve this answer
add comment
It is easy to write this number (of $a$ such that $a,a+1$ are squares) in terms of the number of solutions of $x^2-y^2=1$. This is a conic which has $p+1$ projective points over the field of $p$ elements (since it is isomorphic to $\mathbb{P}^1$). It has two points at infinity, two points with $y=0$ and two or zero points with $x=0$, depending on $p \mod 4$. So you get your formula.
There is no way of telling the quadratic character of $a+b$ from that of $a,b$, but it is a square half the time.
share|improve this answer
The ``half the time'' comment is known to be true because the quadratic residue graph is quasirandom (this is in the seminal paper of Graham & Chung on quasirandom subsets of $Z/(n)$ from around 1990). – Kevin O'Bryant May 16 '11 at 22:07
3
For primes, this has been known since at least Gauss. – Felipe Voloch May 17 '11 at 0:57
3
@Kevin: quoting a quasirandomness theorem to show edge density is 1/2 is overkill. – Omar Antolín-Camarena May 17 '11 at 2:22
add comment
To complement the answers so far let me show using Gauss sums that the number of solutions of $ ax^2+by^2=c $ in $\mathbb{F}_p$ equals $p-\left(\frac{-ab}{p}\right)$ for any $a,b,c\in\mathbb{F}_p^\times$. Indeed, this number equals $$ \frac{1}{p}\sum_n \sum_{x,y}e\left(n\frac{ax^2+by^2-c}{p}\right) = \frac{1}{p}\sum_n e\left(\frac{-nc}{p}\right) \sum_xe\left(\frac{nax^2}{p}\right)\sum_ye\left(\frac{nby^2}{p}\right),$$ where all sums are over $\mathbb{F}_p$ and $e(t)$ abbreviates $e^{2\pi i t}$. For $n\neq 0$ we have $$ \sum_xe\left(\frac{nax^2}{p}\right)\sum_ye\left(\frac{nby^2}{p}\right) = \left(\frac{na}{p}\right)\left(\frac{nb}{p}\right)\left(\sum_re\left(\frac{r^2}{p}\right)\right)^2 = \left(\frac{-ab}{p}\right)p,$$ so that the count in question equals $$ p+\left(\frac{-ab}{p}\right)\sum_{n\neq 0}e\left(\frac{-nc}{p}\right)=p-\left(\frac{-ab}{p}\right). $$
share|improve this answer
add comment
There is an elementary argument regarding the last problem. Denote by $N(p)$ the number of pairs of $(a,b)$ such that $a,b,a+b$ are all quadratic residues mod $p$. Hence we have $$N(p)=\frac{1}{8}\mathop{\sum\sum}_{\substack{a,b\bmod p\\(ab(a+b),p)=1}}\left(1+\left(\frac{a}{p}\right)\right)\left(1+\left(\frac{b}{p}\right)\right)\left(1+\left(\frac{a+b}{p}\right)\right)$$
$$=\frac{1}{8}\mathop{\sum\sum}_{\substack{a,b\bmod p\\(ab,p)=1}}\left(1+\left(\frac{a}{p}\right)\right)\left(1+\left(\frac{b}{p}\right)\right)\left(1+\left(\frac{a+b}{p}\right)\right)$$
$$-\frac{1}{8}\mathop{\sum\sum}_{\substack{a,b\bmod p\\(ab,p)=1,p|a+b}}\left(1+\left(\frac{a}{p}\right)\right)\left(1+\left(\frac{b}{p}\right)\right).$$
Clearly, the second term is just \begin{align*}&-\frac{1}{8}\sum_{\substack{a\bmod p\\(a,p)=1}}\left(1+\left(\frac{a}{p}\right)\right)\left(1+\left(\frac{-a}{p}\right)\right)=\frac{1}{8}-\frac{p}{8}\left(1+\left(\frac{-1}{p}\right)\right).\end{align*} And for the first term, we are required to investigate the quantity \begin{align*}L:=\mathop{\sum\sum}_{\substack{a,b\bmod p\\(ab,p)=1}}\left(\frac{ab(a+b)}{p}\right).\end{align*} In fact we have
$$L:=\mathop{\sum\sum}_{\substack{a,b\bmod p\\(ab,p)=1}}\left(\frac{ba^2+b^2a}{p}\right) =\mathop{\sum\sum}_{\substack{a,b\bmod p\\(ab,p)=1}}\left(\frac{b(a+\overline{2}b)^2-\overline{4}b^3}{p}\right)$$
$$=\mathop{\sum\sum}_{a,b\bmod p}\left(\frac{ba^2-\overline{4}b^3}{p}\right)$$
$$=\sum_{b\bmod p}\left(\frac{b}{p}\right)\sum_{a\bmod p}\left(\frac{a^2-\overline{4}b^2}{p}\right)$$
$$=\sum_{b\bmod p}\left(\frac{b}{p}\right)\sum_{a\bmod p}\left(\frac{a^2-1}{p}\right)=0.$$
The other terms could be computed in a similar way. Hence we can deduce that \begin{align*}N(p)=\frac{1}{8}(p-1)^2-\frac{p}{8}\left(1+\left(\frac{-1}{p}\right)\right)+\frac{1}{8}.\end{align*}
share|improve this answer
To fix your LaTeX, I suggest putting backticks around your expressions (see the "How to write math" in the sidebar) – Yemon Choi May 17 '11 at 1:24
add comment
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://mathoverflow.net/questions/65183/when-is-the-sum-of-two-quadratic-residues-modulo-a-prime-again-a-quadratic-resid?sort=oldest",
"source_domain": "mathoverflow.net",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "72379",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YWF3K4BPR5FKC7GE2Y722YODVIRIJVQU",
"WARC-Concurrent-To": "<urn:uuid:5d5f9eb0-f500-4fd2-b214-c4a1253b6e18>",
"WARC-Date": "2014-03-09T04:06:19Z",
"WARC-IP-Address": "198.252.206.24",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:QH2YBAE54QCEF2U73DX2YUZ3KJD524OT",
"WARC-Record-ID": "<urn:uuid:fe8979de-7956-494b-b3e7-b549f7ca0938>",
"WARC-Target-URI": "http://mathoverflow.net/questions/65183/when-is-the-sum-of-two-quadratic-residues-modulo-a-prime-again-a-quadratic-resid?sort=oldest",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:639538e0-2d08-4f70-a996-d75956f67ce7>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-142-35.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-10\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
143,
144,
548,
549,
752,
753,
781,
785,
950,
952,
1429,
1431,
1577,
1589,
1590,
1600,
1601,
1631,
1632,
1689,
1690,
2062,
2063,
2945,
2946,
2972,
2984,
2985,
3371,
3372,
3486,
3487,
3513,
3515,
3755,
3759,
3849,
3853,
3980,
3992,
3993,
4866,
4867,
4893,
4905,
4906,
5280,
5281,
5468,
5469,
5622,
5623,
6071,
6072,
6275,
6276,
6355,
6356,
6458,
6459,
6550,
6551,
6743,
6744,
6770,
6772,
6921,
6933,
6934,
6946,
6947,
6949,
6957,
6958,
7036,
7037
],
"line_end_idx": [
25,
143,
144,
548,
549,
752,
753,
781,
785,
950,
952,
1429,
1431,
1577,
1589,
1590,
1600,
1601,
1631,
1632,
1689,
1690,
2062,
2063,
2945,
2946,
2972,
2984,
2985,
3371,
3372,
3486,
3487,
3513,
3515,
3755,
3759,
3849,
3853,
3980,
3992,
3993,
4866,
4867,
4893,
4905,
4906,
5280,
5281,
5468,
5469,
5622,
5623,
6071,
6072,
6275,
6276,
6355,
6356,
6458,
6459,
6550,
6551,
6743,
6744,
6770,
6772,
6921,
6933,
6934,
6946,
6947,
6949,
6957,
6958,
7036,
7037,
7127
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7127,
"ccnet_original_nlines": 77,
"rps_doc_curly_bracket": 0.05430055037140846,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.27657005190849304,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016908209770917892,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.48148149251937866,
"rps_doc_frac_unique_words": 0.41965317726135254,
"rps_doc_mean_word_length": 5.412716865539551,
"rps_doc_num_sentences": 45,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.331723690032959,
"rps_doc_word_count": 865,
"rps_doc_frac_chars_dupe_10grams": 0.013669369742274284,
"rps_doc_frac_chars_dupe_5grams": 0.054250318557024,
"rps_doc_frac_chars_dupe_6grams": 0.02605723962187767,
"rps_doc_frac_chars_dupe_7grams": 0.02605723962187767,
"rps_doc_frac_chars_dupe_8grams": 0.013669369742274284,
"rps_doc_frac_chars_dupe_9grams": 0.013669369742274284,
"rps_doc_frac_chars_top_2gram": 0.013669369742274284,
"rps_doc_frac_chars_top_3gram": 0.016445960849523544,
"rps_doc_frac_chars_top_4gram": 0.0096112797036767,
"rps_doc_books_importance": -983.6213989257812,
"rps_doc_books_importance_length_correction": -983.6213989257812,
"rps_doc_openwebtext_importance": -553.5819702148438,
"rps_doc_openwebtext_importance_length_correction": -553.5819702148438,
"rps_doc_wikipedia_importance": -233.31875610351562,
"rps_doc_wikipedia_importance_length_correction": -233.31875610351562
},
"fasttext": {
"dclm": 0.2896673083305359,
"english": 0.6699609756469727,
"fineweb_edu_approx": 1.480181336402893,
"eai_general_math": 0.9798583388328552,
"eai_open_web_math": 0.9274680018424988,
"eai_web_code": 0.04161614179611206
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512.74",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "512.7",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-8,214,203,636,310,000,000 |
How To Capture Moving Photos On Android in 2022
Most of the new Android smartphones arriving these days can capture moving pictures. What’s more important is that moving or 3D pictures are now considered essential, and most of the new smartphones have this feature on their stock camera application.
Moving photos are just a picture with 3D effects. The new camera mode takes pictures from different angles to provide a 3D feel. So, as you move your phone, your picture move as well. It’s a unique feature, and everyone should know how to use the new camera mode.
Unfortunately, older Android devices don’t have the Live photo or 3D picture feature on their camera app. Therefore, if you are using an older Android, you need to rely on several third-party apps to capture moving photos in Android.
Steps to Capture Moving photos in Android
Hence, in this article, we will share a step-by-step guide on capturing moving photos on Android smartphones. Even if you can’t capture a moving photo, you can use this app to apply a 3D effect to your still images. Let’s check out.
Using Phogy 3D
To capture moving photos in Android, we will use a camera app known as Phogy 3D. The camera app is available for free on the Google Play Store, and it can be used to create incredible 3D images.
1. First of all, you need to download and Phogy 3D Camera app from the Google Play Store on your Android phone.
Install Phogy 3D Camera App
2. Now, after installing it, open the app on your phone and go through a short tutorial.
3. Now, simply press the Camera button (Take Phogy) there and aim at the target whose live picture you want to capture on your android phone.
Tap on the 'Take Phogy' Option
4. Now, move your Device to the Right Side and Still Aim at the Target till it gets captured.
Properly select the subject area
That’s it! You are done; now that live picture will get captured with the app, you can easily view that fantastic photos on your Device.
Camera MX – Photo, Video, GIF
Camera MX also provides the option to click moving photos. The good part of this camera is that it provides lots of features. You can do almost everything with this camera, from creating GIFs, moving photos, Video capture, and lots more.
1. First, you need to download and install Camera MX on your Android smartphone. Once installed, launch the app.
Install Camera MX App
2. Now, once you open the app, it will ask you for some permission. Grant all the needed permissions to continue.
Grant all permissions
3. Now, you will get to see the camera.
The Main interface of Camera MX
4. Now, you need to tap on the “Live Shot” option.
Tap on 'Live Shot' Option
5. Once you have captured the moving photo, you need to press and hold the image to view the live shot.
Hold the image to see the Live shot
That’s it! You are done. This is how you can click live shot using Camera MX.
Few Other Apps To Create Moving Photos
Like the above two, plenty of other apps were available on the Play Store to create moving photos. Below, we have shared the three best apps to capture or create moving photos on Android devices.
1. PixaMotion
PixaMotion
With PixaMotion, you can create live photos, live wallpapers, moving photos, themes, etc. In addition, it offers a motion-based image editor that lets you create stunning living photos.
The app can help you create moving pictures with motion stills. Apart from that, the app even allows you to create cinemagraph, loop videos using still images.
2. Movepic
Movepic
Well, Movepic is pretty much similar to the Pixaloop app listed above. However, with Movepic, you can create fabulous live photos, live wallpapers & gifs with animated effects.
The good thing about Movepic is that it lets you add real camera moving effects and transition to your still images and videos. You even get an option to add motion to photos with overlays.
3. StoryZ
StoryZ
If you are looking for an Android app to create visual stories from still images, then look no other than StoryZ. The app can make your pictures move and come to life.
The Android app allows you to add moving effects and elements to photos to make them appear moving.
The method we have shared will help you capture moving photos even on older Android devices. I hope this article helped you! Please share it with your friends also. If you have any doubts related to this, let us know in the comment box below.
LEAVE A REPLY
Please enter your comment!
Please enter your name here
|
{
"url": "https://techviral.net/capture-moving-photos-android/",
"source_domain": "techviral.net",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "203836",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:33KHYIHR5ZK6KRROHAYIZTDW2ZJKCSKE",
"WARC-Concurrent-To": "<urn:uuid:478bc5a4-ca5b-4cce-b08a-ae3c2396a3b2>",
"WARC-Date": "2022-06-28T02:17:51Z",
"WARC-IP-Address": "104.26.9.155",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YCQTHX7VLCARJ6SCIQRXBYOQD4BY6TCR",
"WARC-Record-ID": "<urn:uuid:f76fa505-cc70-4d38-8501-88c50d610d9b>",
"WARC-Target-URI": "https://techviral.net/capture-moving-photos-android/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9c3f5d7e-5d34-4635-ae72-213b33f858d9>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-87\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
48,
49,
301,
302,
566,
567,
801,
802,
844,
845,
1078,
1079,
1094,
1095,
1290,
1291,
1403,
1404,
1432,
1433,
1522,
1523,
1665,
1666,
1697,
1698,
1792,
1793,
1826,
1827,
1964,
1965,
1995,
1996,
2234,
2235,
2348,
2349,
2371,
2372,
2486,
2487,
2509,
2510,
2550,
2551,
2583,
2584,
2635,
2636,
2662,
2663,
2767,
2768,
2804,
2805,
2883,
2884,
2923,
2924,
3120,
3121,
3135,
3136,
3147,
3148,
3334,
3335,
3495,
3496,
3507,
3508,
3516,
3517,
3694,
3695,
3885,
3886,
3896,
3897,
3904,
3905,
4073,
4074,
4174,
4175,
4418,
4419,
4433,
4434,
4461
],
"line_end_idx": [
48,
49,
301,
302,
566,
567,
801,
802,
844,
845,
1078,
1079,
1094,
1095,
1290,
1291,
1403,
1404,
1432,
1433,
1522,
1523,
1665,
1666,
1697,
1698,
1792,
1793,
1826,
1827,
1964,
1965,
1995,
1996,
2234,
2235,
2348,
2349,
2371,
2372,
2486,
2487,
2509,
2510,
2550,
2551,
2583,
2584,
2635,
2636,
2662,
2663,
2767,
2768,
2804,
2805,
2883,
2884,
2923,
2924,
3120,
3121,
3135,
3136,
3147,
3148,
3334,
3335,
3495,
3496,
3507,
3508,
3516,
3517,
3694,
3695,
3885,
3886,
3896,
3897,
3904,
3905,
4073,
4074,
4174,
4175,
4418,
4419,
4433,
4434,
4461,
4488
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4488,
"ccnet_original_nlines": 91,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3837953209877014,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02238805964589119,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15351812541484833,
"rps_doc_frac_unique_words": 0.3337515592575073,
"rps_doc_mean_word_length": 4.422835826873779,
"rps_doc_num_sentences": 63,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.961843013763428,
"rps_doc_word_count": 797,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04709219932556152,
"rps_doc_frac_chars_dupe_6grams": 0.025531910359859467,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.044255319982767105,
"rps_doc_frac_chars_top_3gram": 0.026950350031256676,
"rps_doc_frac_chars_top_4gram": 0.023829789832234383,
"rps_doc_books_importance": -382.76708984375,
"rps_doc_books_importance_length_correction": -382.76708984375,
"rps_doc_openwebtext_importance": -238.91958618164062,
"rps_doc_openwebtext_importance_length_correction": -238.91958618164062,
"rps_doc_wikipedia_importance": -201.30596923828125,
"rps_doc_wikipedia_importance_length_correction": -201.30596923828125
},
"fasttext": {
"dclm": 0.06976622343063354,
"english": 0.8859986066818237,
"fineweb_edu_approx": 1.1861706972122192,
"eai_general_math": 0.0010726499604061246,
"eai_open_web_math": 0.005956349894404411,
"eai_web_code": 0.0005448500160127878
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.164",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-413,825,668,913,779,140 |
DDR4 Here We Come: 512GB of RAM Anyone?
ddr4 ram
Soon we will have faster and more dense memory modules within our computers, but what exactly does DDR4 bring to the table? To start DDR4 will be better suited for multi-core processors. DDR3 has 2048 bytes per cell row, while DDR4 will have 512 bytes per cell row. What this means is that since there are more cells to access, different cores/processors can access more cells at the same time. This also means that cycling between each row/cell is faster. Additionally, the maximum theoretical capacity of DDR4 is a whopping 512GB! Wow, imaging having that much RAM in your computer.
Also, DDR4 will be more power efficient. It will utilize 1.2V for I/O compared to DDR3L, which utilizes 1.35V. In addition, DDR4 also brings improved reliability, availability and serviceability (RAS). This encompasses such features as parity error detection for commands, addresses, and recovery from parity error. With these features, DDR4 can also block commands upon detection of a parity error. Previously, DDR3 would just pass the command that would cause the error along, which would make error recovery difficult. Lastly, DDR4 also support an optional cyclic redundancy check (CRC).
Here is a summary of the advantages of DDR4:
– Increased memory density
– Theoretical max of 512GB main memory (vs 128 DDR3)
– I/O voltage only 1.05-1.2V (vs 1.35V DDR3L)
– 284 pins (vs 240 pins for DDR3)
– Higher throughput
– Improved reliability, availability and serviceability (RAS) / Increased parity error detection
– Better Multi-core suppport (512 bytes vs 2048 bytes cell size – smaller in this case is better)
While PC gamers may wait a bit for prices to adjust and for this newer technology to become a bit more mainstream, DDR4 will certainly have a lot to bring to the table for PC enthusiasts. This could even lead to DDR hybrid drives for storage.
Source: EETimes.com
|
{
"url": "http://pixelsmashers.com/wordpress/?p=18476",
"source_domain": "pixelsmashers.com",
"snapshot_id": "crawl=CC-MAIN-2018-39",
"warc_metadata": {
"Content-Length": "54543",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VZTIK6UVNT75XWSCJSF6IEBBIG7B5J5S",
"WARC-Concurrent-To": "<urn:uuid:ae21ec02-1686-43ee-965c-a2bd6206ad5c>",
"WARC-Date": "2018-09-20T16:28:04Z",
"WARC-IP-Address": "50.63.114.1",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:PCJX2WQKR2IFRONOBFQQ2EIMIPVMVNMC",
"WARC-Record-ID": "<urn:uuid:0ae1bdb7-1495-4692-bbdf-910c47debe5b>",
"WARC-Target-URI": "http://pixelsmashers.com/wordpress/?p=18476",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:82ac3d88-a85f-457d-9018-d9190e7692d4>"
},
"warc_info": "isPartOf: CC-MAIN-2018-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-101-128-88.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
40,
41,
50,
51,
636,
637,
1228,
1229,
1274,
1275,
1302,
1355,
1401,
1435,
1455,
1552,
1650,
1651,
1894,
1895
],
"line_end_idx": [
40,
41,
50,
51,
636,
637,
1228,
1229,
1274,
1275,
1302,
1355,
1401,
1435,
1455,
1552,
1650,
1651,
1894,
1895,
1914
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1914,
"ccnet_original_nlines": 20,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31725889444351196,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.09137056022882462,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2131979763507843,
"rps_doc_frac_unique_words": 0.5377358794212341,
"rps_doc_mean_word_length": 4.792452812194824,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.859692096710205,
"rps_doc_word_count": 318,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06692913174629211,
"rps_doc_frac_chars_dupe_6grams": 0.06692913174629211,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02099738083779812,
"rps_doc_frac_chars_top_3gram": 0.013123360462486744,
"rps_doc_frac_chars_top_4gram": 0.019685039296746254,
"rps_doc_books_importance": -172.64010620117188,
"rps_doc_books_importance_length_correction": -172.6400909423828,
"rps_doc_openwebtext_importance": -109.73138427734375,
"rps_doc_openwebtext_importance_length_correction": -109.73138427734375,
"rps_doc_wikipedia_importance": -92.1772232055664,
"rps_doc_wikipedia_importance_length_correction": -92.1772232055664
},
"fasttext": {
"dclm": 0.16317880153656006,
"english": 0.9348664283752441,
"fineweb_edu_approx": 1.957721471786499,
"eai_general_math": 0.41479116678237915,
"eai_open_web_math": 0.2012869119644165,
"eai_web_code": 0.2228977084159851
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.162",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
5,158,704,372,604,039,000 |
IPv6 įrankiai
Operacija:
Rezultatai:
Address type: unicast, global-unicast
Address type has SLA: 0000
Registry for address: RIPE NCC
Interface identifier: 0000:0000:0000:0323
Interface identifier is probably manual set or based on a local EUI-64 identifier
=== whois lookup for 2a04:4e42:600::323 ===
Prefix:
Origin:
Description:
Country: EU
Ryšio nustatymas
on - Protokolas veikia
unknown - Protokolas tikrinamas
off - Protokolas neveikia
Paryškintas protokolas naudojamas puslapiui pasiekti.
IPv4 adresas:
18.206.187.81
IPv6 adresas:
|
{
"url": "https://ipv6.lt/tools.php?action=ipv6_info&value=2a04:4e42:600::323",
"source_domain": "ipv6.lt",
"snapshot_id": "crawl=CC-MAIN-2020-24",
"warc_metadata": {
"Content-Length": "5628",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3T5WPKFADDJRHOBZP6ELJ67C4M7B5UJV",
"WARC-Concurrent-To": "<urn:uuid:eb734fb5-3d14-4bf2-b32c-e218f5f5ef85>",
"WARC-Date": "2020-05-29T03:35:58Z",
"WARC-IP-Address": "193.219.61.9",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RXHU2OZMAZLLCMTJZNBQGPUMYIEVEJ4K",
"WARC-Record-ID": "<urn:uuid:5cc7e5df-8e81-4640-ae65-516b37a17598>",
"WARC-Target-URI": "https://ipv6.lt/tools.php?action=ipv6_info&value=2a04:4e42:600::323",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9794aae1-6b19-4c5b-863b-338a0373a034>"
},
"warc_info": "isPartOf: CC-MAIN-2020-24\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-62.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
1,
15,
16,
27,
28,
29,
30,
31,
32,
33,
34,
35,
36,
48,
49,
87,
114,
145,
187,
269,
270,
314,
324,
334,
348,
360,
361,
378,
379,
402,
434,
460,
461,
515,
516,
517,
531,
545
],
"line_end_idx": [
1,
15,
16,
27,
28,
29,
30,
31,
32,
33,
34,
35,
36,
48,
49,
87,
114,
145,
187,
269,
270,
314,
324,
334,
348,
360,
361,
378,
379,
402,
434,
460,
461,
515,
516,
517,
531,
545,
558
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 558,
"ccnet_original_nlines": 38,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.095238097012043,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0476190485060215,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4000000059604645,
"rps_doc_frac_unique_words": 0.796875,
"rps_doc_mean_word_length": 6.796875,
"rps_doc_num_sentences": 5,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.8392796516418457,
"rps_doc_word_count": 64,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.050574708729982376,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -51.827964782714844,
"rps_doc_books_importance_length_correction": -65.9168701171875,
"rps_doc_openwebtext_importance": -31.871170043945312,
"rps_doc_openwebtext_importance_length_correction": -45.960079193115234,
"rps_doc_wikipedia_importance": -15.128344535827637,
"rps_doc_wikipedia_importance_length_correction": -29.217252731323242
},
"fasttext": {
"dclm": 0.02737892046570778,
"english": 0.1673600673675537,
"fineweb_edu_approx": 1.9915270805358887,
"eai_general_math": 0.00041800999315455556,
"eai_open_web_math": 0.12426930665969849,
"eai_web_code": 0.4449174404144287
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.677",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-5,564,645,701,354,916,000 |
โปรแกรมตารางการทำงาน
โปรแกรมตารางการทำงาน
การวิเคราะห์และคำนวณตัวเลขของวิศวกร ด้วยการสร้างเป็นรูปแบบจำลองในลักษณะของสูตรคำนวณ และสมการทางคณิตศาสตร์ มักมีการขีดเขียน คำนวณ และจดบันทึกลงในกระดาษ โดยมีเครื่องคิดเลขเป็นเครื่องมือช่วยในการคำนวณ การคำนวณตามงานที่ออกแบบ หรือการค้นหาคำตอบของรูปแบบจำลองสมการที่สร้างขึ้น นับเป็นงานที่น่าเบื่อ และต้องใช้ความอดทนมากพอสมควร เพราะวิศวกรจะต้องทำการคำนวณใหม่ ซ้ำแล้วซ้ำเล่าหลาย ๆ ครั้ง ตามการแปรเปลี่ยนอย่างไม่หยุดนิ่งขององค์ประกอบ หรือปัจจัยสำคัญของงาน โดยเฉพาะอย่างยิ่งหากงานนั้นเกี่ยวข้องกับความปลอดภัยของชีวิต และทรัพย์สินด้วย การคำนวนต่าง ๆ ก็ต้องยิ่งระมัดระวังให้มีการตรวจทาน เพื่อให้ได้ผลลัพธ์ที่ถูกต้องและแม่นยำ
ซอฟต์แวร์สำเร็จตารางทำงาน หรือกระดาษอิเลกทรอนิกส์ เป็นเครื่องมือช่วยเพื่อการวิเคราะห์และคำนวณตัวเลขให้กับวิศวกรได้เป็นอย่างดี เพราะการใช้งานซอฟต์แวร์นี้ จะเปรียบเหมือนกับการนั่งทำงานบนโต๊ะทำงาน ที่มีกระดาษแผ่นใหญ่ ๆ ประกอบด้วยตารางสี่เหลี่ยมของช่องตามแนวแถวและสดมภ์จำนวนมากมายปรากฏบนจอภาพ โดยแต่ละช่องบนแผ่นกระดาษอิเลกทรอนิกส์นี้จะเก็บข้อความเป็นตัวอักษร หรือตัวเลข หรือสูตรคำนวณ
ภายในซอฟต์แวร์ตารางทำงานจะมีฟังก์ชันต่าง ๆ จัดมาให้เลือกใช้เรียบร้อยแล้ว เช่น ฟังก์ชันการคำนวณทางคณิตศาสตร์ ฟังก์ชันการคำนวณทางสถิติ ฯลฯ ซึ่งฟังก์ชันเหล่านี้เปรียบได้กับเครื่องคิดเลขที่วางบนโต๊ะทำงาน ผู้ใช้สามารถนำข้อมูลจากช่องต่าง ๆ บนกระดาษมาเป็นตัวแปรของฟังก์ชันหรือสูตรคำนวณ เพื่อคำนวณให้ได้ผลลัพธ์ออกมา และนำไปใช้ในการคำนวณของช่องอื่น ๆ ต่อไปได้อีก
ข้อมูลในช่องต่าง ๆ บนตารางทำงานสามารถเปลี่ยนแปลงแก้ไขได้โดยง่ายด้วยการสั่งงานตามคำสั่งที่ปรากฏบนรายการเมนู ซึ่งการเปลี่ยนแปลงแก้ไขนี้เปรียบได้กับการมียางลบที่ทำการลบ แล้วบันทึกค่าลงไปใหม่ ถ้าตารางทำงานนี้ไม่ถูกต้องใช้งานไม่ได้ ผู้ใช้อาจลบทั้งตารางและสร้างใหม่เหมือนการขยำกระดาษโยนใสถังขยะทิ้งไป แต่ถ้าตารางทำงานนี้ใช้งานได้ดีแล้ว ผู้ใช้ก็สามารถทำการบันทึกข้อมูลไว้ในแผ่นบันทึกเพื่อนำมาใช้งานใหม่ภายหลัง
ขีดความสามารถพิเศษของตารางการทำงานมีมากมาย เช่น สามารถแสดงรายงาน ต่าง ๆ ในรูปแบบที่สวยงาม พิมพ์เป็นกราฟิกรูปภาพ หรือการแสดงผลอื่น ๆ
* หน้าแรก
* ความหมายของซอฟต์แวร์
* ซอฟต์แวร์ระบบ
ซอฟต์แวร์ประยุกต์
* โปรแกรมประมวลคำ
* ระบบปฏิบัติการ (operating system)
* โปรแกรมตารางการทำงาน
* การพัฒนาซอฟต์แวร์
* ภาษาคอมพิวเตอร์ และ ตัวแปรภาษา
* ระบบใช้งานติดต่อคอมพิวเตอร์
* ซอฟต์แวร์กราฟฟิก
* ซอฟต์แวร์การจัดฐานข้อมูล
* ซอฟต์แวร์ติดต่อสื่อสาร
* ซอฟต์แวร์นำเสนอ
* ซอฟต์แวร์ โอเพนซอร์ส
* ภาคผนวก 1
* ภาคผนวก 2
* ภาคผนวก 3
* ภาคผนวก 4
* ผู้จัดทำ
สร้างโดย:
น.ส.นิศานาถ พาพวย
มหาวิทยาลัยศรีปทุม ผู้ใหญ่ใจดี
ช่วยด้วยครับ
นักเรียนที่สร้างบล็อก กรุณาอย่า
คัดลอกข้อมูลจากเว็บอื่นทั้งหมด
ควรนำมาจากหลายๆ เว็บ แล้ววิเคราะห์ สังเคราะห์ และเขียนขึ้นใหม่
หากคัดลอกทั้งหมด จะถูกดำเนินคดี
ตามกฎหมายจากเจ้าของลิขสิทธิ์
มีโทษทั้งจำคุกและปรับในอัตราสูง
ช่วยกันนะครับ
ไทยกู๊ดวิวจะได้อยู่นานๆ
ไม่ถูกปิดเสียก่อน
ขอขอบคุณในความร่วมมือครับ
อ่านรายละเอียด
ด่วน...... ขณะนี้
พระราชบัญญัติลิขสิทธิ์ (ฉบับที่ 2) พ.ศ. 2558
มีผลบังคับใช้แล้ว
ขอให้นักเรียนและคุณครูที่ใช้งาน
เว็บ thaigoodview ในการส่งการบ้าน
ระมัดระวังการละเมิดลิขสิทธิ์ด้วย
อ่านรายละเอียดที่นี่ครับ
สมาชิกที่ออนไลน์
ขณะนี้มี สมาชิก 0 คน และ ผู้เยี่ยมชม 53 คน กำลังออนไลน์
|
{
"url": "http://www.thaigoodview.com/node/49948",
"source_domain": "www.thaigoodview.com",
"snapshot_id": "crawl=CC-MAIN-2016-07",
"warc_metadata": {
"Content-Length": "34975",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TMTGTCBJ44K4OX6RQX3DPIR2DIZJEHGG",
"WARC-Concurrent-To": "<urn:uuid:3423599b-e4dd-4652-8a4d-69a8f4338327>",
"WARC-Date": "2016-02-11T19:12:41Z",
"WARC-IP-Address": "202.44.68.33",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:AJWTF2PI7KYT4LDRQHI6I5BRFX2YLNRJ",
"WARC-Record-ID": "<urn:uuid:27ff3db4-712a-4e41-a28f-397211a72cce>",
"WARC-Target-URI": "http://www.thaigoodview.com/node/49948",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:aad4c47f-af5b-4105-abf9-bfc543d548c5>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-236-182-209.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-07\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for February 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
21,
22,
43,
44,
46,
47,
49,
50,
52,
53,
674,
675,
1062,
1416,
1819,
1951,
1952,
1954,
1955,
1957,
1958,
1960,
1961,
1971,
1972,
1995,
1996,
2012,
2013,
2031,
2032,
2050,
2051,
2087,
2088,
2111,
2112,
2132,
2133,
2166,
2167,
2197,
2198,
2217,
2218,
2245,
2246,
2271,
2272,
2291,
2292,
2315,
2316,
2328,
2329,
2341,
2342,
2354,
2355,
2367,
2368,
2379,
2380,
2382,
2383,
2394,
2412,
2413,
2444,
2446,
2448,
2449,
2463,
2495,
2526,
2589,
2621,
2650,
2682,
2683,
2698,
2723,
2741,
2742,
2768,
2769,
2784,
2785,
2803,
2849,
2868,
2900,
2934,
2967,
2992,
2993,
2995,
2996,
3013,
3014,
3070,
3071
],
"line_end_idx": [
21,
22,
43,
44,
46,
47,
49,
50,
52,
53,
674,
675,
1062,
1416,
1819,
1951,
1952,
1954,
1955,
1957,
1958,
1960,
1961,
1971,
1972,
1995,
1996,
2012,
2013,
2031,
2032,
2050,
2051,
2087,
2088,
2111,
2112,
2132,
2133,
2166,
2167,
2197,
2198,
2217,
2218,
2245,
2246,
2271,
2272,
2291,
2292,
2315,
2316,
2328,
2329,
2341,
2342,
2354,
2355,
2367,
2368,
2379,
2380,
2382,
2383,
2394,
2412,
2413,
2444,
2446,
2448,
2449,
2463,
2495,
2526,
2589,
2621,
2650,
2682,
2683,
2698,
2723,
2741,
2742,
2768,
2769,
2784,
2785,
2803,
2849,
2868,
2900,
2934,
2967,
2992,
2993,
2995,
2996,
3013,
3014,
3070,
3071,
3106
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3106,
"ccnet_original_nlines": 102,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.9970873594284058,
"rps_doc_frac_unique_words": 0.8758620619773865,
"rps_doc_mean_word_length": 19.255172729492188,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0.0019417499424889684,
"rps_doc_unigram_entropy": 4.731578350067139,
"rps_doc_word_count": 145,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -594.7799682617188,
"rps_doc_books_importance_length_correction": -594.7799682617188,
"rps_doc_openwebtext_importance": -466.3861389160156,
"rps_doc_openwebtext_importance_length_correction": -466.3861389160156,
"rps_doc_wikipedia_importance": -394.9101257324219,
"rps_doc_wikipedia_importance_length_correction": -394.9101257324219
},
"fasttext": {
"dclm": 0.9993928670883179,
"english": 0.000009999999747378752,
"fineweb_edu_approx": 0.8983600735664368,
"eai_general_math": 0.0002583900059107691,
"eai_open_web_math": 0.9863452911376953,
"eai_web_code": 0.37873661518096924
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
280,932,672,343,862,500 |
Lab: Pods,InitContainers
In case you haven’t cloned the repo
git clone https://github.com/amitopenwriteup/k8s.git
Lab1: Create a simple pod
• apiVersion: Specifies the API version being used (in this case, v1).
• kind: Specifies the kind of resource, which is a Pod in this case.
• metadata: Contains metadata about the Pod, such as its name and labels.
• spec: Defines the specification for the Pod.
• containers: A list of containers within the Pod.
• name: Name of the container.
• image: The Docker image to use for the container.
• ports: Specifies the ports that the container exposes.
cd k8s
kubectl create -f expod.yaml
kubectl get pod
kubectl describe pod example-pod
kubectl delete pod example-pod
Lab2: Create pod in dev namespace
• namespace: Specifies the namespace where the Pod will be created (in this case, “dev”).
• spec: Defines the specification for the Pod
• command: Specifies the command to run in the container. In this example, it’s set to [“sleep”, “3600”] to sleep for 3600 seconds
cd k8s
cat devpod.yaml
kubectl create ns dev
kubectl create -f devpod.yaml
kubectl get pods --namespace=dev
kubectl describe pod busybox-pod --namespace=dev
kubectl delete pod busybox-pod --namespace=dev
Lab3: Multicontainer pods
Pod named “multi-container-pod” contains two containers: “main-container” running the Nginx image and “sidecar-container” running the BusyBox image. The main container exposes port 80, and the sidecar container runs a simple loop to continuously print a message.
cd k8s
kubectl create -f multicont.yaml
kubectl get pods
kubectl describe pod multi-container-pod
kubectl exec multi-container-pod -c main-container -- date
kubectl exec multi-container-pod -c sidecar-container -- ls
kubectl delete pod multi-container-pod
Lab 4: Init Containers
A list of init containers that run before the main containers.
cd k8s
kubectl create -f initpod.yaml
kubectl describe pod pod-with-init
kubectl delete pod pod-with-init
Try following Lab5:
Change the init container image name to busbox:lates, in above yaml.
Create pod, and check whether main container starts or not
|
{
"url": "https://www.openwriteup.com/?page_id=901",
"source_domain": "www.openwriteup.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "173926",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NCS672M7XROZSKTY5QSMGRTHISKI3GSM",
"WARC-Concurrent-To": "<urn:uuid:229f415f-364c-48aa-a230-7ccf7c74836d>",
"WARC-Date": "2023-10-03T01:38:43Z",
"WARC-IP-Address": "46.30.213.149",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CXJ35PRZGQYYOJWRHBO4PKH3ROKGVPTE",
"WARC-Record-ID": "<urn:uuid:c4b363a5-ce04-43cc-a1c9-f0cf9a9b3d32>",
"WARC-Target-URI": "https://www.openwriteup.com/?page_id=901",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:758041e7-22c7-4e40-a4db-55194e399d6c>"
},
"warc_info": "isPartOf: CC-MAIN-2023-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-20\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
25,
26,
62,
63,
117,
118,
144,
145,
218,
289,
365,
414,
469,
506,
564,
627,
634,
663,
679,
712,
743,
744,
778,
779,
871,
919,
1054,
1061,
1077,
1099,
1129,
1162,
1211,
1258,
1259,
1285,
1286,
1549,
1550,
1557,
1590,
1607,
1648,
1707,
1767,
1806,
1807,
1830,
1831,
1894,
1895,
1902,
1933,
1968,
2001,
2002,
2022,
2023,
2094,
2095,
2154,
2155,
2157,
2158
],
"line_end_idx": [
25,
26,
62,
63,
117,
118,
144,
145,
218,
289,
365,
414,
469,
506,
564,
627,
634,
663,
679,
712,
743,
744,
778,
779,
871,
919,
1054,
1061,
1077,
1099,
1129,
1162,
1211,
1258,
1259,
1285,
1286,
1549,
1550,
1557,
1590,
1607,
1648,
1707,
1767,
1806,
1807,
1830,
1831,
1894,
1895,
1902,
1933,
1968,
2001,
2002,
2022,
2023,
2094,
2095,
2154,
2155,
2157,
2158,
2159
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2159,
"ccnet_original_nlines": 64,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.21710525453090668,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006578950211405754,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2587719261646271,
"rps_doc_frac_unique_words": 0.42038217186927795,
"rps_doc_mean_word_length": 5.350318431854248,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.393693923950195,
"rps_doc_word_count": 314,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07916667312383652,
"rps_doc_frac_chars_dupe_6grams": 0.04523809999227524,
"rps_doc_frac_chars_dupe_7grams": 0.04523809999227524,
"rps_doc_frac_chars_dupe_8grams": 0.04523809999227524,
"rps_doc_frac_chars_dupe_9grams": 0.04523809999227524,
"rps_doc_frac_chars_top_2gram": 0.035714291036129,
"rps_doc_frac_chars_top_3gram": 0.03333333134651184,
"rps_doc_frac_chars_top_4gram": 0.03214285895228386,
"rps_doc_books_importance": -256.7609558105469,
"rps_doc_books_importance_length_correction": -256.7609558105469,
"rps_doc_openwebtext_importance": -153.86839294433594,
"rps_doc_openwebtext_importance_length_correction": -153.86839294433594,
"rps_doc_wikipedia_importance": -133.787841796875,
"rps_doc_wikipedia_importance_length_correction": -133.787841796875
},
"fasttext": {
"dclm": 0.20929229259490967,
"english": 0.5766318440437317,
"fineweb_edu_approx": 2.675337553024292,
"eai_general_math": 0.08485078811645508,
"eai_open_web_math": 0.03513896092772484,
"eai_web_code": 0.9912985563278198
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.028",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-3,230,311,268,098,754,000 |
Jump to content
• Log In with Google Sign In
• Create Account
[SOLVED] Post Processing BackBuffer using Effects 11
Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.
• You cannot reply to this topic
13 replies to this topic
#1 crosire Members - Reputation: 226
Like
0Likes
Like
Posted 14 April 2013 - 03:59 AM
I'm currently trying to add post processing to an existing C++ DirectX11 application. The task is to apply a dynamic FX shader loaded from a file directly to the backbuffer, all rendering is already done before. In short: I have to get a copy of the backbuffer, apply some post processing effects and overwrite the buffer with those afterwards. "IDXGISwapChain->Present" is called at last.
This was pretty easy to achieve in DirectX9, however I'm running into multiple issues with DirectX11 now. I only found one example for post processing on D3D11 on MSN and it was written for a Windows 8 app, which I cannot build or run on my Windows 7 desktop and the code did not make a lot of sense to me.
The first one, a missing effects framework, could be solved by using "Effects 11" you can download from MSN already.
Now I'm a bit confused on how to continue. The basic idea on how it could work is as following:
1. Load the effect from a ".fx" HLSL file and compile it using "D3DX11CompileEffectFromFile"
2. Get a copy of the backbuffer using "IDXGISwapChain->GetBuffer" and save it to a "ID3D11Texture" object
3. Get the description of the texture, to have width and height of the screen
4. Create a new render target and tell the device to use it
5. Create a fullscreen quad and draw the screen texture on it (using the loaded effect)
6. Reset the render target and update the backbuffer with the drawn quad
The following code for step one and two already works:
Spoiler
I'm having problems with applying the effect and drawing the fullscreen quad though ...
The vertex struct and layout for the quad is declared as following:
Spoiler
The fullscreen quad is set up like this:
Spoiler
Drawing currently looks similar to the next code:
Spoiler
I'm clearing the render target to the color red before drawing the quad, but the screen is red then only, so sadly it doesn't seem to draw the quad at all...
I don't know if there is any way to check that.
Also, the a post processing shader normally requires me to pass the screen texture to it, so it can apply the effects on every pixel of it. The Effects Framework provides the "ID3DX11Effect->GetVariableByName" and allows one to set the variable to a specific object / data, but it has no definition for a texture. The nearest thing I found is "Variable->AsShaderResource()->SetResource(&MyResource)", but is that really the most efficient way, to create a shader resource for the screen texture to pass it to the pixel shader?
I'm sorry for the tons of code in this post, but I found it the easiest way to show what I got already. In DirectX9 the steps described earlier worked without any problems, but it wasn't required to create a vertex buffer here anyway, so the whole thing was shorter and easier to achieve.
I hope somebody has done something similar / post processing before in D3D11/D3D10 and can help me out here, I would really appreciate it.
Thank you and cheers,
Crosire
Edited by Crosire, 18 April 2013 - 06:00 AM.
#2 Jason Z Crossbones+ - Reputation: 6314
Like
2Likes
Like
Posted 14 April 2013 - 06:09 AM
It looks like the declared position format in your vertex layout is too small. You are using a 4 component float position, but only declaring a 3 component format. Since your offset in the layout to the texture coordinates is 16 bytes, this is likely the source of your problems. If you switch to having a DXGI_FORMAT_R32G32B32A32_FLOAT for your position, that should help.
Did you get any output in the debug window? If your shader was expecting a float4 then you vertex layout would not have matched and it should have complained about that... Is the debug layer enabled in the device you are using?
#3 unbird Crossbones+ - Reputation: 8095
Like
2Likes
Like
Posted 14 April 2013 - 07:35 AM
Yep, create your device with the D3D11_CREATE_DEVICE_DEBUG. We should actually make that a big red blinking sticky in this subforum wink.png
The nearest thing I found is "Variable->AsShaderResource()->SetResource(&MyResource)", but is that really the most efficient way, to create a shader resource for the screen texture to pass it to the pixel shader ?
It's the only way. The non-effect counterpart would be ?SSetShaderResources (in your case PSSetShaderResources), so you need to create a shader resource view of your backbuffer texture.
For this to work you also need to create your swapchain with DXGI_USAGE_SHADER_INPUT, not only with DXGI_USAGE_RENDER_TARGET_OUTPUT. Alternatively you could render your scene first to a offscreen texture with both D3D11_BIND_RENDER_TARGET and D3D11_BIND_SHADER_RESOURCE.
Be aware when switching targets and resources that you unbind (set NULL) things first: one can not set a texture as a target and input simultaneously, the (debug) pipeline will complain and undo such an attempt (usually in the non-intended way). This is a bit more of a challenge with the effect framework since you have to find out which slots are currently used, but you can explicitly set the slots with the HLSL register keyword.
Also: Show your shader code, please.
#4 crosire Members - Reputation: 226
Like
0Likes
Like
Posted 14 April 2013 - 10:42 AM
Thank you for your answers already! I now set the position layout to a float4, using "DXGI_FORMAT_R32G32B32A32_FLOAT", makes a bit more sense.
I'm used to PS 2.0, so the new HLSL format is a bit strange to me and I'm sure there is a mistake in there.
The shader is just a simple monochrome testing effect:
Spoiler
Edited by Crosire, 15 April 2013 - 12:29 PM.
#5 unbird Crossbones+ - Reputation: 8095
Like
1Likes
Like
Posted 14 April 2013 - 12:14 PM
Use technique11 not technique10 in your effect file. This is a nitpick of the effect framework. Also: Where's your vertex shader ? You need one. While you're at it: Make sure the signatures match: The vertex shader must output the SV_Position system value semantic.
I recommend testing the post process in a separate application (e.g. by loading a screenshot from your app as source) to enable the debug layer.
Edited by unbird, 14 April 2013 - 12:58 PM.
#6 crosire Members - Reputation: 226
Like
0Likes
Like
Posted 15 April 2013 - 12:28 PM
Thanks so far, you helped me a lot. The quad is now drawing fine and the shader / effect gets loaded and executed too.
FX:
Spoiler
The full screen gets covered in red as expected now. The only thing left is to pass the screen texture to the pixel shader and let it do its job.
However, as soon as I remove the comments from the two lines above and comment out the other color code, I just get a black screen. I tried some different shader code and it's always just black, lowering the alpha will show the original image a bit through the now transparent quad, as long as I disable render target clearing.
I'm sending the texture to the shader with this code:
ID3D11ShaderResourceView *m_pResource;
D3D11_SHADER_RESOURCE_VIEW_DESC m_pResourceDesc = { DXGI_FORMAT_R32_FLOAT, D3D10_SRV_DIMENSION_TEXTURE2D };
m_pResourceDesc.Texture2D.MipLevels = 1;
m_pResourceDesc.Texture2D.MostDetailedMip = 0;
device->CreateShaderResourceView(g_pScreenTexture11, &m_pResourceDesc, &m_pResource);
g_pEffect11->GetVariableByName("colorTex")->AsShaderResource()->SetResource(m_pResource);
"g_pScreenTexture11" contains the full screen, checked that via "D3DX11SaveTextureToFile". "g_pEffect11" also links to the effect, the other shader code works perfectly fine. The shader layout is the same as the vertex input layout declared in the C++ code too (as seen earlier), so I'm a bit lost here.
Thanks again for all help so far, it's greatly appreciated. I'm really close to the target now ... Just this little thing.
Cheers,
Crosire
#7 unbird Crossbones+ - Reputation: 8095
Like
1Likes
Like
Posted 15 April 2013 - 01:21 PM
Good, you narrowed it somewhat down: The sampling creates black - at least that's what I get.
Your easiest approach to narrow down the problem further would be to use a graphics debugger (PIX or the VS 2012 graphics debugger). Check the post-VS values, check if the texture is actually bound (the shader resource view, that is), debug pixels, etc.
Alternatively:
• Check if the texcoords by outputting float4(IN.txcoord, 0, 1). This should give a black-red gradient from left-to-right and a black-green gradient from top to bottom (and yellow bottom right).
• Your sampler is a bit bare for my taste. Really set all the needed values (not sure what the effects use per default). Or set the sampler explicitly to NULL (you should find the corresponding variable type), this will give you the default sampler. If that gives you something useful, work from those values. For a postprocess effect you e.g. want point sampling.
Currently I don't see anything obvious - yet wink.png
#8 crosire Members - Reputation: 226
Like
0Likes
Like
Posted 16 April 2013 - 10:10 AM
Texcoords are set correctly, I get the expected green/red gradient image with no blue and alpha at 100%.
I tried it by using "D3DX11CreateShaderResourceViewFromFile" and sent an existing image to the shader by that and I get that image with the effects applied drawn on the screen, so the shader is fully working. It's just not reading the data from the texture object (which has it, tested) and using that one when sending it to the shader.
In code:
This works:
ID3D11ShaderResourceView *m_pResource;
D3DX11CreateShaderResourceViewFromFile(device, L"tex.bmp", NULL, NULL, &m_pResource, NULL);
g_pEffect11->GetVariableByName("colorTex")->AsShaderResource()->SetResource(m_pResource);
The code from my previous post not:
ID3D11ShaderResourceView *m_pResource;
D3D11_SHADER_RESOURCE_VIEW_DESC m_pResourceDesc = { DXGI_FORMAT_R32_FLOAT, D3D10_SRV_DIMENSION_TEXTURE2D };
m_pResourceDesc.Texture2D.MipLevels = 1;
m_pResourceDesc.Texture2D.MostDetailedMip = 0;
device->CreateShaderResourceView(g_pScreenTexture11, &m_pResourceDesc, &m_pResource);
g_pEffect11->GetVariableByName("colorTex")->AsShaderResource()->SetResource(m_pResource);
After looking at it again, I found some mistakes already:
• D3D11_SRV_DIMENSION_TEXTURE2D instead of D3D10_SRV_DIMENSION_TEXTURE2D (which outputs the same value in the end (4), but it just makes more sense)
• DXGI_FORMAT_R32G32B32A32_FLOAT instead of DXGI_FORMAT_R32_FLOAT (The image isn't made of red color only obviously, I want the full RGBA color code here)
Still it doesn't work with the corrected code. Does anybody see another error in here?
And I just have to thank unbird again, you pushed me in the right directions :)
#9 unbird Crossbones+ - Reputation: 8095
Like
0Likes
Like
Posted 16 April 2013 - 10:42 AM
This is really strange. Can you force the debug layer through the control panel ? Already tried a GPU debugger ? I'm definitively out of clues...
#10 crosire Members - Reputation: 226
Like
0Likes
Like
Posted 17 April 2013 - 10:25 AM
I think it might be because the screen texture gets created by the swapchain interface in "IDXGISwapChain->GetBuffer" as I pass a null texture interface object to it. It then probably gets initialized without "D3D11_BIND_SHADER_RESOURCE", which makes it unusable for the shader resource view object.
I tried a different approach now:
Code which gets executed on startup:
// Create screen resource
D3D11_TEXTURE2D_DESC m_pTextureDesc = { m_pDesc.Width, m_pDesc.Height, 1, 1, DXGI_FORMAT_R32G32B32A32_FLOAT, 1, 0, D3D11_USAGE_DEFAULT, D3D11_BIND_SHADER_RESOURCE, 0, 0 };
device->CreateTexture2D(&m_pTextureDesc, NULL, &g_pScreenTexture11);
// Create shader resource view
D3D11_SHADER_RESOURCE_VIEW_DESC m_pResourceDesc = { m_pTextureDesc.Format, D3D11_SRV_DIMENSION_TEXTURE2D };
device->CreateShaderResourceView(g_pScreenTexture11, &m_pResourceDesc, &g_pScreenView11);
Code which gets executed every frame:
ID3D11Resource *m_pBackBuffer;
hr = swapchain->GetBuffer(0, __uuidof(m_pBackBuffer), (LPVOID*)&m_pBackBuffer);
if (SUCCEEDED(hr) && g_pScreenTexture11)
{
// Update screen texture
context->CopyResource(g_pScreenTexture11, m_pBackBuffer);
// Update effect parameters
g_pEffect11->GetVariableByName("colorTex")->AsShaderResource()->SetResource(g_pScreenView11);
...
}
I thought the shader view interface only stores a pointer to the screen texture, so it will retrieve the updated data, when I change the texture object it was initalized with.
The code now fails at "context->CopyResource(g_pScreenTexture11, m_pBackBuffer);" though. The texture is just empty.
I tried this one too:
ID3D11Resource *tex;
g_pScreenSurface11->GetResource(&tex);
D3DX11SaveTextureToFile(context, g_pScreenTexture11, D3DX11_IFF_BMP, L"tex.bmp");
But it crashes the application at the second line already, I have no idea why.
I'm going to try and put together a quick testing program as I cannot bind PIX to any other software with my project applied. PIX tries to hook the DirectX Exported Functions which was already done by my hook, so it just crashes.
Edited by Crosire, 17 April 2013 - 10:31 AM.
#11 unbird Crossbones+ - Reputation: 8095
Like
0Likes
Like
Posted 17 April 2013 - 10:50 AM
I thought the shader view interface only stores a pointer to the screen texture, so it will retrieve the updated data, when I change the texture object it was initalized with.
Nope, the view is tightly bound to the resource, you can't change that after creation.
The code now fails at "context->CopyResource(g_pScreenTexture11, m_pBackBuffer);" though. The texture is just empty.
If you look at the docs of this function you will have to check the compatibility of source and target resource. I already suspected some format problem: Is your backbuffer e.g. really 32F ?
I tried this one too:
*snip*
But it crashes the application at the second line already, I have no idea why.
BMP can't cope with float formats, use DDS instead.
I'm going to try and put together a quick testing program as I cannot bind PIX to any other software with my project applied. PIX tries to hook the DirectX Exported Functions which was already done by my hook, so it just crashes.
That leaves bare logging, hopefully. Dump the description of the resources and views in question using GetResource and GetDesc and compare them.
#12 crosire Members - Reputation: 226
Like
0Likes
Like
Posted 17 April 2013 - 01:36 PM
If you look at the docs of this function you will have to check the compatibility of source and target resource. I already suspected some format problem: Is your backbuffer e.g. really 32F ?
And that is the problem. DirectX 9 had the "StretchRect" function, which did the job. DirectX 11 is missing any real replacement. I don't see how I can copy the resource of the backbuffer to my texture, which has a different format?!
"CopyResource" and "ResolveSubresource" both require compatible formats. If I set up my texture with the same format as the backbuffer, those work of course, but the Shader View is not created properly again (see below).
Whatever I'm trying, either one or the other thing work, but not both together ...
BMP can't cope with float formats, use DDS instead.
It's not the save texture line that makes it crash, it's the "GetResource" and that's because the shader resource view object is NULL (got my testing application working and can successfully debug it with the VS 11 graphics debugger) even though it was created earlier.
Tried to create it every frame too:
SAFE_RELEASE(g_pScreenSurface11);
device->CreateShaderResourceView(g_pScreenTexture11, NULL, &g_pScreenSurface11);
ID3D11Resource *tex;
g_pScreenSurface11->GetResource(&tex);
Crashes, it is still NULL. It works when I create the texture from a file instead of using the backbuffer, so I asume either the format is the issue or the backbuffer is missing the "D3D11_BIND_SHADER_RESOURCE" flag (which is probably the case).
The solution would be to create a texture with that flag set and copy the backbuffer contents onto it. But all my tries failed there yet, as shown above.
I hope I'm not too annoying here smile.png
Edited by Crosire, 17 April 2013 - 01:37 PM.
#13 unbird Crossbones+ - Reputation: 8095
Like
0Likes
Like
Posted 17 April 2013 - 01:48 PM
Yeah, you need the copy resource, and you need D3D11_BIND_SHADER_RESOURCE on your target texture to then be able to sample from. Don't see where you fail, so I just reiterate:
- Your backbuffer is given, so D3D11_BIND_SHADER_RESOURCE is not available
- create a compatible texture, same format (and MS type!), same dimension, this time with D3D11_BIND_SHADER_RESOURCE
- create the view thereof
- use it as source for your postprocess
#14 crosire Members - Reputation: 226
Like
0Likes
Like
Posted 18 April 2013 - 06:00 AM
Forgive me, I was just stupid. Everything is working now!
BIG thanks to you smile.png
Old topic!
Guest, the last post of this topic is over 60 days old and at this point you may not reply in this topic. If you wish to continue this conversation start a new topic.
PARTNERS
|
{
"url": "http://www.gamedev.net/topic/641771-solved-post-processing-backbuffer-using-effects-11/",
"source_domain": "www.gamedev.net",
"snapshot_id": "crawl=CC-MAIN-2016-22",
"warc_metadata": {
"Content-Length": "145577",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TQAEFCL6XAGWCATSMM22GJSQUS7Y6HHA",
"WARC-Concurrent-To": "<urn:uuid:3379a4bc-21e9-4ca4-af96-c0f9a37bb8fe>",
"WARC-Date": "2016-05-24T10:58:36Z",
"WARC-IP-Address": "64.91.255.13",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:OC5OAZO55H3HAMUM4P4NTZLO7ZCJ3ZIO",
"WARC-Record-ID": "<urn:uuid:21244e2f-c1bc-4249-889a-130e021730e5>",
"WARC-Target-URI": "http://www.gamedev.net/topic/641771-solved-post-processing-backbuffer-using-effects-11/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c1d68bcf-09fb-4285-ad7f-c4251181958b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-217-139.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-22\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for May 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
16,
17,
56,
75,
76,
129,
130,
131,
142,
143,
310,
311,
312,
347,
372,
373,
415,
416,
421,
428,
433,
434,
466,
467,
857,
858,
860,
861,
1168,
1169,
1286,
1287,
1289,
1290,
1386,
1387,
1482,
1590,
1670,
1732,
1822,
1897,
1898,
1900,
1901,
1956,
1957,
1965,
1966,
1968,
1969,
2057,
2058,
2060,
2061,
2129,
2130,
2138,
2139,
2141,
2142,
2183,
2184,
2192,
2193,
2195,
2196,
2246,
2247,
2255,
2256,
2258,
2259,
2417,
2418,
2466,
2467,
2469,
2470,
2997,
2998,
3000,
3001,
3290,
3291,
3430,
3431,
3433,
3434,
3456,
3457,
3465,
3466,
3467,
3512,
3513,
3514,
3561,
3562,
3567,
3574,
3579,
3580,
3612,
3613,
3990,
3991,
3993,
3994,
4224,
4225,
4226,
4227,
4273,
4274,
4279,
4286,
4291,
4292,
4324,
4325,
4466,
4467,
4681,
4682,
4868,
4869,
5140,
5141,
5575,
5576,
5613,
5614,
5656,
5657,
5662,
5669,
5674,
5675,
5707,
5708,
5851,
5852,
5854,
5855,
5963,
5964,
5966,
5967,
6022,
6023,
6031,
6032,
6077,
6078,
6079,
6125,
6126,
6131,
6138,
6143,
6144,
6176,
6177,
6443,
6444,
6589,
6590,
6634,
6635,
6636,
6678,
6679,
6684,
6691,
6696,
6697,
6729,
6730,
6849,
6850,
6852,
6853,
6857,
6858,
6866,
6867,
6869,
6870,
7016,
7017,
7019,
7020,
7348,
7349,
7351,
7352,
7406,
7407,
7446,
7554,
7595,
7642,
7728,
7729,
7819,
7820,
8124,
8125,
8127,
8128,
8251,
8252,
8254,
8255,
8263,
8264,
8272,
8273,
8274,
8275,
8321,
8322,
8327,
8334,
8339,
8340,
8372,
8373,
8467,
8469,
8723,
8725,
8740,
8937,
9304,
9358,
9359,
9401,
9402,
9407,
9414,
9419,
9420,
9452,
9453,
9558,
9559,
9561,
9562,
9899,
9900,
9902,
9903,
9912,
9913,
9925,
9926,
9965,
10057,
10147,
10148,
10184,
10185,
10224,
10332,
10373,
10420,
10421,
10507,
10508,
10598,
10599,
10601,
10602,
10660,
10661,
10812,
10969,
10970,
11057,
11058,
11060,
11061,
11141,
11142,
11143,
11144,
11190,
11191,
11196,
11203,
11208,
11209,
11241,
11242,
11388,
11389,
11432,
11433,
11438,
11445,
11450,
11451,
11483,
11484,
11784,
11785,
11787,
11788,
11822,
11823,
11860,
11861,
11887,
12059,
12128,
12129,
12160,
12268,
12358,
12359,
12397,
12398,
12429,
12430,
12510,
12511,
12552,
12554,
12580,
12639,
12640,
12669,
12764,
12765,
12770,
12772,
12773,
12775,
12776,
12952,
12953,
12955,
12956,
13073,
13074,
13076,
13077,
13099,
13100,
13121,
13160,
13242,
13243,
13322,
13323,
13325,
13326,
13556,
13557,
13558,
13603,
13604,
13605,
13652,
13653,
13658,
13665,
13670,
13671,
13703,
13704,
13880,
13881,
13968,
13970,
13971,
14088,
14089,
14280,
14282,
14283,
14305,
14312,
14391,
14392,
14444,
14445,
14675,
14676,
14821,
14822,
14865,
14866,
14871,
14878,
14883,
14884,
14916,
14917,
15108,
15109,
15343,
15344,
15346,
15347,
15568,
15569,
15652,
15653,
15655,
15656,
15708,
15709,
15979,
15980,
15982,
15983,
16019,
16020,
16054,
16135,
16156,
16195,
16196,
16442,
16443,
16597,
16598,
16600,
16601,
16644,
16645,
16646,
16691,
16692,
16693,
16740,
16741,
16746,
16753,
16758,
16759,
16791,
16792,
16968,
16969,
17044,
17161,
17187,
17227,
17228,
17271,
17272,
17277,
17284,
17289,
17290,
17322,
17323,
17381,
17382,
17384,
17385,
17413,
17414,
17415,
17416,
17417,
17418,
17419,
17430,
17431,
17598,
17599,
17600,
17601,
17602
],
"line_end_idx": [
16,
17,
56,
75,
76,
129,
130,
131,
142,
143,
310,
311,
312,
347,
372,
373,
415,
416,
421,
428,
433,
434,
466,
467,
857,
858,
860,
861,
1168,
1169,
1286,
1287,
1289,
1290,
1386,
1387,
1482,
1590,
1670,
1732,
1822,
1897,
1898,
1900,
1901,
1956,
1957,
1965,
1966,
1968,
1969,
2057,
2058,
2060,
2061,
2129,
2130,
2138,
2139,
2141,
2142,
2183,
2184,
2192,
2193,
2195,
2196,
2246,
2247,
2255,
2256,
2258,
2259,
2417,
2418,
2466,
2467,
2469,
2470,
2997,
2998,
3000,
3001,
3290,
3291,
3430,
3431,
3433,
3434,
3456,
3457,
3465,
3466,
3467,
3512,
3513,
3514,
3561,
3562,
3567,
3574,
3579,
3580,
3612,
3613,
3990,
3991,
3993,
3994,
4224,
4225,
4226,
4227,
4273,
4274,
4279,
4286,
4291,
4292,
4324,
4325,
4466,
4467,
4681,
4682,
4868,
4869,
5140,
5141,
5575,
5576,
5613,
5614,
5656,
5657,
5662,
5669,
5674,
5675,
5707,
5708,
5851,
5852,
5854,
5855,
5963,
5964,
5966,
5967,
6022,
6023,
6031,
6032,
6077,
6078,
6079,
6125,
6126,
6131,
6138,
6143,
6144,
6176,
6177,
6443,
6444,
6589,
6590,
6634,
6635,
6636,
6678,
6679,
6684,
6691,
6696,
6697,
6729,
6730,
6849,
6850,
6852,
6853,
6857,
6858,
6866,
6867,
6869,
6870,
7016,
7017,
7019,
7020,
7348,
7349,
7351,
7352,
7406,
7407,
7446,
7554,
7595,
7642,
7728,
7729,
7819,
7820,
8124,
8125,
8127,
8128,
8251,
8252,
8254,
8255,
8263,
8264,
8272,
8273,
8274,
8275,
8321,
8322,
8327,
8334,
8339,
8340,
8372,
8373,
8467,
8469,
8723,
8725,
8740,
8937,
9304,
9358,
9359,
9401,
9402,
9407,
9414,
9419,
9420,
9452,
9453,
9558,
9559,
9561,
9562,
9899,
9900,
9902,
9903,
9912,
9913,
9925,
9926,
9965,
10057,
10147,
10148,
10184,
10185,
10224,
10332,
10373,
10420,
10421,
10507,
10508,
10598,
10599,
10601,
10602,
10660,
10661,
10812,
10969,
10970,
11057,
11058,
11060,
11061,
11141,
11142,
11143,
11144,
11190,
11191,
11196,
11203,
11208,
11209,
11241,
11242,
11388,
11389,
11432,
11433,
11438,
11445,
11450,
11451,
11483,
11484,
11784,
11785,
11787,
11788,
11822,
11823,
11860,
11861,
11887,
12059,
12128,
12129,
12160,
12268,
12358,
12359,
12397,
12398,
12429,
12430,
12510,
12511,
12552,
12554,
12580,
12639,
12640,
12669,
12764,
12765,
12770,
12772,
12773,
12775,
12776,
12952,
12953,
12955,
12956,
13073,
13074,
13076,
13077,
13099,
13100,
13121,
13160,
13242,
13243,
13322,
13323,
13325,
13326,
13556,
13557,
13558,
13603,
13604,
13605,
13652,
13653,
13658,
13665,
13670,
13671,
13703,
13704,
13880,
13881,
13968,
13970,
13971,
14088,
14089,
14280,
14282,
14283,
14305,
14312,
14391,
14392,
14444,
14445,
14675,
14676,
14821,
14822,
14865,
14866,
14871,
14878,
14883,
14884,
14916,
14917,
15108,
15109,
15343,
15344,
15346,
15347,
15568,
15569,
15652,
15653,
15655,
15656,
15708,
15709,
15979,
15980,
15982,
15983,
16019,
16020,
16054,
16135,
16156,
16195,
16196,
16442,
16443,
16597,
16598,
16600,
16601,
16644,
16645,
16646,
16691,
16692,
16693,
16740,
16741,
16746,
16753,
16758,
16759,
16791,
16792,
16968,
16969,
17044,
17161,
17187,
17227,
17228,
17271,
17272,
17277,
17284,
17289,
17290,
17322,
17323,
17381,
17382,
17384,
17385,
17413,
17414,
17415,
17416,
17417,
17418,
17419,
17430,
17431,
17598,
17599,
17600,
17601,
17602,
17610
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 17610,
"ccnet_original_nlines": 479,
"rps_doc_curly_bracket": 0.0005678600282408297,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3615540564060211,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04639026150107384,
"rps_doc_frac_lines_end_with_ellipsis": 0.010416669771075249,
"rps_doc_frac_no_alph_words": 0.23659032583236694,
"rps_doc_frac_unique_words": 0.2594984769821167,
"rps_doc_mean_word_length": 5.148176193237305,
"rps_doc_num_sentences": 160,
"rps_doc_symbol_to_word_ratio": 0.006088720168918371,
"rps_doc_unigram_entropy": 5.671374320983887,
"rps_doc_word_count": 2632,
"rps_doc_frac_chars_dupe_10grams": 0.2137269377708435,
"rps_doc_frac_chars_dupe_5grams": 0.2732841372489929,
"rps_doc_frac_chars_dupe_6grams": 0.2580811679363251,
"rps_doc_frac_chars_dupe_7grams": 0.24730627238750458,
"rps_doc_frac_chars_dupe_8grams": 0.2411070168018341,
"rps_doc_frac_chars_dupe_9grams": 0.21963100135326385,
"rps_doc_frac_chars_top_2gram": 0.012619930319488049,
"rps_doc_frac_chars_top_3gram": 0.010332100093364716,
"rps_doc_frac_chars_top_4gram": 0.014760149642825127,
"rps_doc_books_importance": -1474.7230224609375,
"rps_doc_books_importance_length_correction": -1474.7230224609375,
"rps_doc_openwebtext_importance": -864.0802612304688,
"rps_doc_openwebtext_importance_length_correction": -864.0802612304688,
"rps_doc_wikipedia_importance": -569.428466796875,
"rps_doc_wikipedia_importance_length_correction": -569.428466796875
},
"fasttext": {
"dclm": 0.021135570481419563,
"english": 0.8775839805603027,
"fineweb_edu_approx": 1.345240592956543,
"eai_general_math": 0.3668392300605774,
"eai_open_web_math": 0.0885159969329834,
"eai_web_code": 0.037720441818237305
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02854",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.436",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-4,910,730,951,017,331,000 |
Logo Search packages:
Sourcecode: llvm version File versions Download package
Verifier.cpp
//===-- Verifier.cpp - Implement the Module Verifier -------------*- C++ -*-==//
//
// The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// This file defines the function verifier interface, that can be used for some
// sanity checking of input to the system.
//
// Note that this does not provide full `Java style' security and verifications,
// instead it just tries to ensure that code is well-formed.
//
// * Both of a binary operator's parameters are of the same type
// * Verify that the indices of mem access instructions match other operands
// * Verify that arithmetic and other things are only performed on first-class
// types. Verify that shifts & logicals only happen on integrals f.e.
// * All of the constants in a switch statement are of the correct type
// * The code is in valid SSA form
// * It should be illegal to put a label into any other type (like a structure)
// or to return one. [except constant arrays!]
// * Only phi nodes can be self referential: 'add int %0, %0 ; <int>:0' is bad
// * PHI nodes must have an entry for each predecessor, with no extras.
// * PHI nodes must be the first thing in a basic block, all grouped together
// * PHI nodes must have at least one entry
// * All basic blocks should only end with terminator insts, not contain them
// * The entry node to a function must not have predecessors
// * All Instructions must be embedded into a basic block
// * Functions cannot take a void-typed parameter
// * Verify that a function's argument list agrees with it's declared type.
// * It is illegal to specify a name for a void value.
// * It is illegal to have a internal global value with no initializer
// * It is illegal to have a ret instruction that returns a value that does not
// agree with the function return value type.
// * Function call argument types match the function prototype
// * All other things that are tested by asserts spread about the code...
//
//===----------------------------------------------------------------------===//
#include "llvm/Analysis/Verifier.h"
#include "llvm/Assembly/Writer.h"
#include "llvm/CallingConv.h"
#include "llvm/Constants.h"
#include "llvm/Pass.h"
#include "llvm/Module.h"
#include "llvm/ModuleProvider.h"
#include "llvm/ParameterAttributes.h"
#include "llvm/DerivedTypes.h"
#include "llvm/InlineAsm.h"
#include "llvm/IntrinsicInst.h"
#include "llvm/PassManager.h"
#include "llvm/Analysis/Dominators.h"
#include "llvm/CodeGen/ValueTypes.h"
#include "llvm/Support/CallSite.h"
#include "llvm/Support/CFG.h"
#include "llvm/Support/InstVisitor.h"
#include "llvm/Support/Streams.h"
#include "llvm/ADT/SmallPtrSet.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/ADT/StringExtras.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/Support/Compiler.h"
#include <algorithm>
#include <sstream>
#include <cstdarg>
using namespace llvm;
namespace { // Anonymous namespace for class
struct VISIBILITY_HIDDEN PreVerifier : public FunctionPass {
static char ID; // Pass ID, replacement for typeid
PreVerifier() : FunctionPass((intptr_t)&ID) { }
// Check that the prerequisites for successful DominatorTree construction
// are satisfied.
bool runOnFunction(Function &F) {
bool Broken = false;
for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I) {
if (I->empty() || !I->back().isTerminator()) {
cerr << "Basic Block does not have terminator!\n";
WriteAsOperand(*cerr, I, true);
cerr << "\n";
Broken = true;
}
}
if (Broken)
abort();
return false;
}
};
char PreVerifier::ID = 0;
RegisterPass<PreVerifier> PreVer("preverify", "Preliminary module verification");
const PassInfo *PreVerifyID = PreVer.getPassInfo();
struct VISIBILITY_HIDDEN
Verifier : public FunctionPass, InstVisitor<Verifier> {
static char ID; // Pass ID, replacement for typeid
bool Broken; // Is this module found to be broken?
bool RealPass; // Are we not being run by a PassManager?
VerifierFailureAction action;
// What to do if verification fails.
Module *Mod; // Module we are verifying right now
DominatorTree *DT; // Dominator Tree, caution can be null!
std::stringstream msgs; // A stringstream to collect messages
/// InstInThisBlock - when verifying a basic block, keep track of all of the
/// instructions we have seen so far. This allows us to do efficient
/// dominance checks for the case when an instruction has an operand that is
/// an instruction in the same block.
SmallPtrSet<Instruction*, 16> InstsInThisBlock;
Verifier()
: FunctionPass((intptr_t)&ID),
Broken(false), RealPass(true), action(AbortProcessAction),
DT(0), msgs( std::ios::app | std::ios::out ) {}
Verifier( VerifierFailureAction ctn )
: FunctionPass((intptr_t)&ID),
Broken(false), RealPass(true), action(ctn), DT(0),
msgs( std::ios::app | std::ios::out ) {}
Verifier(bool AB )
: FunctionPass((intptr_t)&ID),
Broken(false), RealPass(true),
action( AB ? AbortProcessAction : PrintMessageAction), DT(0),
msgs( std::ios::app | std::ios::out ) {}
Verifier(DominatorTree &dt)
: FunctionPass((intptr_t)&ID),
Broken(false), RealPass(false), action(PrintMessageAction),
DT(&dt), msgs( std::ios::app | std::ios::out ) {}
bool doInitialization(Module &M) {
Mod = &M;
verifyTypeSymbolTable(M.getTypeSymbolTable());
// If this is a real pass, in a pass manager, we must abort before
// returning back to the pass manager, or else the pass manager may try to
// run other passes on the broken module.
if (RealPass)
return abortIfBroken();
return false;
}
bool runOnFunction(Function &F) {
// Get dominator information if we are being run by PassManager
if (RealPass) DT = &getAnalysis<DominatorTree>();
Mod = F.getParent();
visit(F);
InstsInThisBlock.clear();
// If this is a real pass, in a pass manager, we must abort before
// returning back to the pass manager, or else the pass manager may try to
// run other passes on the broken module.
if (RealPass)
return abortIfBroken();
return false;
}
bool doFinalization(Module &M) {
// Scan through, checking all of the external function's linkage now...
for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
visitGlobalValue(*I);
// Check to make sure function prototypes are okay.
if (I->isDeclaration()) visitFunction(*I);
}
for (Module::global_iterator I = M.global_begin(), E = M.global_end();
I != E; ++I)
visitGlobalVariable(*I);
for (Module::alias_iterator I = M.alias_begin(), E = M.alias_end();
I != E; ++I)
visitGlobalAlias(*I);
// If the module is broken, abort at this time.
return abortIfBroken();
}
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
AU.setPreservesAll();
AU.addRequiredID(PreVerifyID);
if (RealPass)
AU.addRequired<DominatorTree>();
}
/// abortIfBroken - If the module is broken and we are supposed to abort on
/// this condition, do so.
///
bool abortIfBroken() {
if (Broken) {
msgs << "Broken module found, ";
switch (action) {
case AbortProcessAction:
msgs << "compilation aborted!\n";
cerr << msgs.str();
abort();
case PrintMessageAction:
msgs << "verification continues.\n";
cerr << msgs.str();
return false;
case ReturnStatusAction:
msgs << "compilation terminated.\n";
return Broken;
}
}
return false;
}
// Verification methods...
void verifyTypeSymbolTable(TypeSymbolTable &ST);
void visitGlobalValue(GlobalValue &GV);
void visitGlobalVariable(GlobalVariable &GV);
void visitGlobalAlias(GlobalAlias &GA);
void visitFunction(Function &F);
void visitBasicBlock(BasicBlock &BB);
void visitTruncInst(TruncInst &I);
void visitZExtInst(ZExtInst &I);
void visitSExtInst(SExtInst &I);
void visitFPTruncInst(FPTruncInst &I);
void visitFPExtInst(FPExtInst &I);
void visitFPToUIInst(FPToUIInst &I);
void visitFPToSIInst(FPToSIInst &I);
void visitUIToFPInst(UIToFPInst &I);
void visitSIToFPInst(SIToFPInst &I);
void visitIntToPtrInst(IntToPtrInst &I);
void visitPtrToIntInst(PtrToIntInst &I);
void visitBitCastInst(BitCastInst &I);
void visitPHINode(PHINode &PN);
void visitBinaryOperator(BinaryOperator &B);
void visitICmpInst(ICmpInst &IC);
void visitFCmpInst(FCmpInst &FC);
void visitExtractElementInst(ExtractElementInst &EI);
void visitInsertElementInst(InsertElementInst &EI);
void visitShuffleVectorInst(ShuffleVectorInst &EI);
void visitVAArgInst(VAArgInst &VAA) { visitInstruction(VAA); }
void visitCallInst(CallInst &CI);
void visitInvokeInst(InvokeInst &II);
void visitGetElementPtrInst(GetElementPtrInst &GEP);
void visitLoadInst(LoadInst &LI);
void visitStoreInst(StoreInst &SI);
void visitInstruction(Instruction &I);
void visitTerminatorInst(TerminatorInst &I);
void visitReturnInst(ReturnInst &RI);
void visitSwitchInst(SwitchInst &SI);
void visitSelectInst(SelectInst &SI);
void visitUserOp1(Instruction &I);
void visitUserOp2(Instruction &I) { visitUserOp1(I); }
void visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI);
void visitAllocationInst(AllocationInst &AI);
void VerifyCallSite(CallSite CS);
void VerifyIntrinsicPrototype(Intrinsic::ID ID, Function *F,
unsigned Count, ...);
void VerifyAttrs(uint16_t Attrs, const Type *Ty, bool isReturnValue,
const Value *V);
void VerifyFunctionAttrs(const FunctionType *FT, const ParamAttrsList *Attrs,
const Value *V);
void WriteValue(const Value *V) {
if (!V) return;
if (isa<Instruction>(V)) {
msgs << *V;
} else {
WriteAsOperand(msgs, V, true, Mod);
msgs << "\n";
}
}
void WriteType(const Type* T ) {
if ( !T ) return;
WriteTypeSymbolic(msgs, T, Mod );
}
// CheckFailed - A check failed, so print out the condition and the message
// that failed. This provides a nice place to put a breakpoint if you want
// to see why something is not correct.
void CheckFailed(const std::string &Message,
const Value *V1 = 0, const Value *V2 = 0,
const Value *V3 = 0, const Value *V4 = 0) {
msgs << Message << "\n";
WriteValue(V1);
WriteValue(V2);
WriteValue(V3);
WriteValue(V4);
Broken = true;
}
void CheckFailed( const std::string& Message, const Value* V1,
const Type* T2, const Value* V3 = 0 ) {
msgs << Message << "\n";
WriteValue(V1);
WriteType(T2);
WriteValue(V3);
Broken = true;
}
};
char Verifier::ID = 0;
RegisterPass<Verifier> X("verify", "Module Verifier");
} // End anonymous namespace
// Assert - We know that cond should be true, if not print an error message.
#define Assert(C, M) \
do { if (!(C)) { CheckFailed(M); return; } } while (0)
#define Assert1(C, M, V1) \
do { if (!(C)) { CheckFailed(M, V1); return; } } while (0)
#define Assert2(C, M, V1, V2) \
do { if (!(C)) { CheckFailed(M, V1, V2); return; } } while (0)
#define Assert3(C, M, V1, V2, V3) \
do { if (!(C)) { CheckFailed(M, V1, V2, V3); return; } } while (0)
#define Assert4(C, M, V1, V2, V3, V4) \
do { if (!(C)) { CheckFailed(M, V1, V2, V3, V4); return; } } while (0)
void Verifier::visitGlobalValue(GlobalValue &GV) {
Assert1(!GV.isDeclaration() ||
GV.hasExternalLinkage() ||
GV.hasDLLImportLinkage() ||
GV.hasExternalWeakLinkage() ||
(isa<GlobalAlias>(GV) &&
(GV.hasInternalLinkage() || GV.hasWeakLinkage())),
"Global is external, but doesn't have external or dllimport or weak linkage!",
&GV);
Assert1(!GV.hasDLLImportLinkage() || GV.isDeclaration(),
"Global is marked as dllimport, but not external", &GV);
Assert1(!GV.hasAppendingLinkage() || isa<GlobalVariable>(GV),
"Only global variables can have appending linkage!", &GV);
if (GV.hasAppendingLinkage()) {
GlobalVariable &GVar = cast<GlobalVariable>(GV);
Assert1(isa<ArrayType>(GVar.getType()->getElementType()),
"Only global arrays can have appending linkage!", &GV);
}
}
void Verifier::visitGlobalVariable(GlobalVariable &GV) {
if (GV.hasInitializer()) {
Assert1(GV.getInitializer()->getType() == GV.getType()->getElementType(),
"Global variable initializer type does not match global "
"variable type!", &GV);
} else {
Assert1(GV.hasExternalLinkage() || GV.hasDLLImportLinkage() ||
GV.hasExternalWeakLinkage(),
"invalid linkage type for global declaration", &GV);
}
visitGlobalValue(GV);
}
void Verifier::visitGlobalAlias(GlobalAlias &GA) {
Assert1(!GA.getName().empty(),
"Alias name cannot be empty!", &GA);
Assert1(GA.hasExternalLinkage() || GA.hasInternalLinkage() ||
GA.hasWeakLinkage(),
"Alias should have external or external weak linkage!", &GA);
Assert1(GA.getType() == GA.getAliasee()->getType(),
"Alias and aliasee types should match!", &GA);
if (!isa<GlobalValue>(GA.getAliasee())) {
const ConstantExpr *CE = dyn_cast<ConstantExpr>(GA.getAliasee());
Assert1(CE && CE->getOpcode() == Instruction::BitCast &&
isa<GlobalValue>(CE->getOperand(0)),
"Aliasee should be either GlobalValue or bitcast of GlobalValue",
&GA);
}
visitGlobalValue(GA);
}
void Verifier::verifyTypeSymbolTable(TypeSymbolTable &ST) {
}
// VerifyAttrs - Check the given parameter attributes for an argument or return
// value of the specified type. The value V is printed in error messages.
void Verifier::VerifyAttrs(uint16_t Attrs, const Type *Ty, bool isReturnValue,
const Value *V) {
if (Attrs == ParamAttr::None)
return;
if (isReturnValue) {
uint16_t RetI = Attrs & ParamAttr::ParameterOnly;
Assert1(!RetI, "Attribute " + ParamAttrsList::getParamAttrsText(RetI) +
"does not apply to return values!", V);
} else {
uint16_t ParmI = Attrs & ParamAttr::ReturnOnly;
Assert1(!ParmI, "Attribute " + ParamAttrsList::getParamAttrsText(ParmI) +
"only applies to return values!", V);
}
for (unsigned i = 0;
i < array_lengthof(ParamAttr::MutuallyIncompatible); ++i) {
uint16_t MutI = Attrs & ParamAttr::MutuallyIncompatible[i];
Assert1(!(MutI & (MutI - 1)), "Attributes " +
ParamAttrsList::getParamAttrsText(MutI) + "are incompatible!", V);
}
uint16_t TypeI = Attrs & ParamAttr::typeIncompatible(Ty);
Assert1(!TypeI, "Wrong type for attribute " +
ParamAttrsList::getParamAttrsText(TypeI), V);
}
// VerifyFunctionAttrs - Check parameter attributes against a function type.
// The value V is printed in error messages.
void Verifier::VerifyFunctionAttrs(const FunctionType *FT,
const ParamAttrsList *Attrs,
const Value *V) {
if (!Attrs)
return;
bool SawNest = false;
for (unsigned Idx = 0; Idx <= FT->getNumParams(); ++Idx) {
uint16_t Attr = Attrs->getParamAttrs(Idx);
VerifyAttrs(Attr, FT->getParamType(Idx-1), !Idx, V);
if (Attr & ParamAttr::Nest) {
Assert1(!SawNest, "More than one parameter has attribute nest!", V);
SawNest = true;
}
if (Attr & ParamAttr::StructRet) {
Assert1(Idx == 1, "Attribute sret not on first parameter!", V);
}
}
}
// visitFunction - Verify that a function is ok.
//
void Verifier::visitFunction(Function &F) {
// Check function arguments.
const FunctionType *FT = F.getFunctionType();
unsigned NumArgs = F.arg_size();
Assert2(FT->getNumParams() == NumArgs,
"# formal arguments must match # of arguments for function type!",
&F, FT);
Assert1(F.getReturnType()->isFirstClassType() ||
F.getReturnType() == Type::VoidTy,
"Functions cannot return aggregate values!", &F);
Assert1(!F.isStructReturn() || FT->getReturnType() == Type::VoidTy,
"Invalid struct-return function!", &F);
const ParamAttrsList *Attrs = F.getParamAttrs();
Assert1(!Attrs ||
(Attrs->size() &&
Attrs->getParamIndex(Attrs->size()-1) <= FT->getNumParams()),
"Attributes after last parameter!", &F);
// Check function attributes.
VerifyFunctionAttrs(FT, Attrs, &F);
// Check that this function meets the restrictions on this calling convention.
switch (F.getCallingConv()) {
default:
break;
case CallingConv::C:
break;
case CallingConv::Fast:
case CallingConv::Cold:
case CallingConv::X86_FastCall:
Assert1(!F.isVarArg(),
"Varargs functions must have C calling conventions!", &F);
break;
}
// Check that the argument values match the function type for this function...
unsigned i = 0;
for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end();
I != E; ++I, ++i) {
Assert2(I->getType() == FT->getParamType(i),
"Argument value does not match function argument type!",
I, FT->getParamType(i));
// Make sure no aggregates are passed by value.
Assert1(I->getType()->isFirstClassType(),
"Functions cannot take aggregates as arguments by value!", I);
}
if (F.isDeclaration()) {
Assert1(F.hasExternalLinkage() || F.hasDLLImportLinkage() ||
F.hasExternalWeakLinkage(),
"invalid linkage type for function declaration", &F);
} else {
// Verify that this function (which has a body) is not named "llvm.*". It
// is not legal to define intrinsics.
if (F.getName().size() >= 5)
Assert1(F.getName().substr(0, 5) != "llvm.",
"llvm intrinsics cannot be defined!", &F);
// Check the entry node
BasicBlock *Entry = &F.getEntryBlock();
Assert1(pred_begin(Entry) == pred_end(Entry),
"Entry block to function must not have predecessors!", Entry);
}
}
// verifyBasicBlock - Verify that a basic block is well formed...
//
void Verifier::visitBasicBlock(BasicBlock &BB) {
InstsInThisBlock.clear();
// Ensure that basic blocks have terminators!
Assert1(BB.getTerminator(), "Basic Block does not have terminator!", &BB);
// Check constraints that this basic block imposes on all of the PHI nodes in
// it.
if (isa<PHINode>(BB.front())) {
SmallVector<BasicBlock*, 8> Preds(pred_begin(&BB), pred_end(&BB));
SmallVector<std::pair<BasicBlock*, Value*>, 8> Values;
std::sort(Preds.begin(), Preds.end());
PHINode *PN;
for (BasicBlock::iterator I = BB.begin(); (PN = dyn_cast<PHINode>(I));++I) {
// Ensure that PHI nodes have at least one entry!
Assert1(PN->getNumIncomingValues() != 0,
"PHI nodes must have at least one entry. If the block is dead, "
"the PHI should be removed!", PN);
Assert1(PN->getNumIncomingValues() == Preds.size(),
"PHINode should have one entry for each predecessor of its "
"parent basic block!", PN);
// Get and sort all incoming values in the PHI node...
Values.clear();
Values.reserve(PN->getNumIncomingValues());
for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
Values.push_back(std::make_pair(PN->getIncomingBlock(i),
PN->getIncomingValue(i)));
std::sort(Values.begin(), Values.end());
for (unsigned i = 0, e = Values.size(); i != e; ++i) {
// Check to make sure that if there is more than one entry for a
// particular basic block in this PHI node, that the incoming values are
// all identical.
//
Assert4(i == 0 || Values[i].first != Values[i-1].first ||
Values[i].second == Values[i-1].second,
"PHI node has multiple entries for the same basic block with "
"different incoming values!", PN, Values[i].first,
Values[i].second, Values[i-1].second);
// Check to make sure that the predecessors and PHI node entries are
// matched up.
Assert3(Values[i].first == Preds[i],
"PHI node entries do not match predecessors!", PN,
Values[i].first, Preds[i]);
}
}
}
}
void Verifier::visitTerminatorInst(TerminatorInst &I) {
// Ensure that terminators only exist at the end of the basic block.
Assert1(&I == I.getParent()->getTerminator(),
"Terminator found in the middle of a basic block!", I.getParent());
visitInstruction(I);
}
void Verifier::visitReturnInst(ReturnInst &RI) {
Function *F = RI.getParent()->getParent();
if (RI.getNumOperands() == 0)
Assert2(F->getReturnType() == Type::VoidTy,
"Found return instr that returns void in Function of non-void "
"return type!", &RI, F->getReturnType());
else
Assert2(F->getReturnType() == RI.getOperand(0)->getType(),
"Function return type does not match operand "
"type of return inst!", &RI, F->getReturnType());
// Check to make sure that the return value has necessary properties for
// terminators...
visitTerminatorInst(RI);
}
void Verifier::visitSwitchInst(SwitchInst &SI) {
// Check to make sure that all of the constants in the switch instruction
// have the same type as the switched-on value.
const Type *SwitchTy = SI.getCondition()->getType();
for (unsigned i = 1, e = SI.getNumCases(); i != e; ++i)
Assert1(SI.getCaseValue(i)->getType() == SwitchTy,
"Switch constants must all be same type as switch value!", &SI);
visitTerminatorInst(SI);
}
void Verifier::visitSelectInst(SelectInst &SI) {
Assert1(SI.getCondition()->getType() == Type::Int1Ty,
"Select condition type must be bool!", &SI);
Assert1(SI.getTrueValue()->getType() == SI.getFalseValue()->getType(),
"Select values must have identical types!", &SI);
Assert1(SI.getTrueValue()->getType() == SI.getType(),
"Select values must have same type as select instruction!", &SI);
visitInstruction(SI);
}
/// visitUserOp1 - User defined operators shouldn't live beyond the lifetime of
/// a pass, if any exist, it's an error.
///
void Verifier::visitUserOp1(Instruction &I) {
Assert1(0, "User-defined operators should not live outside of a pass!", &I);
}
void Verifier::visitTruncInst(TruncInst &I) {
// Get the source and destination types
const Type *SrcTy = I.getOperand(0)->getType();
const Type *DestTy = I.getType();
// Get the size of the types in bits, we'll need this later
unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
Assert1(SrcTy->isInteger(), "Trunc only operates on integer", &I);
Assert1(DestTy->isInteger(), "Trunc only produces integer", &I);
Assert1(SrcBitSize > DestBitSize,"DestTy too big for Trunc", &I);
visitInstruction(I);
}
void Verifier::visitZExtInst(ZExtInst &I) {
// Get the source and destination types
const Type *SrcTy = I.getOperand(0)->getType();
const Type *DestTy = I.getType();
// Get the size of the types in bits, we'll need this later
Assert1(SrcTy->isInteger(), "ZExt only operates on integer", &I);
Assert1(DestTy->isInteger(), "ZExt only produces an integer", &I);
unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
Assert1(SrcBitSize < DestBitSize,"Type too small for ZExt", &I);
visitInstruction(I);
}
void Verifier::visitSExtInst(SExtInst &I) {
// Get the source and destination types
const Type *SrcTy = I.getOperand(0)->getType();
const Type *DestTy = I.getType();
// Get the size of the types in bits, we'll need this later
unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
Assert1(SrcTy->isInteger(), "SExt only operates on integer", &I);
Assert1(DestTy->isInteger(), "SExt only produces an integer", &I);
Assert1(SrcBitSize < DestBitSize,"Type too small for SExt", &I);
visitInstruction(I);
}
void Verifier::visitFPTruncInst(FPTruncInst &I) {
// Get the source and destination types
const Type *SrcTy = I.getOperand(0)->getType();
const Type *DestTy = I.getType();
// Get the size of the types in bits, we'll need this later
unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
Assert1(SrcTy->isFloatingPoint(),"FPTrunc only operates on FP", &I);
Assert1(DestTy->isFloatingPoint(),"FPTrunc only produces an FP", &I);
Assert1(SrcBitSize > DestBitSize,"DestTy too big for FPTrunc", &I);
visitInstruction(I);
}
void Verifier::visitFPExtInst(FPExtInst &I) {
// Get the source and destination types
const Type *SrcTy = I.getOperand(0)->getType();
const Type *DestTy = I.getType();
// Get the size of the types in bits, we'll need this later
unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
Assert1(SrcTy->isFloatingPoint(),"FPExt only operates on FP", &I);
Assert1(DestTy->isFloatingPoint(),"FPExt only produces an FP", &I);
Assert1(SrcBitSize < DestBitSize,"DestTy too small for FPExt", &I);
visitInstruction(I);
}
void Verifier::visitUIToFPInst(UIToFPInst &I) {
// Get the source and destination types
const Type *SrcTy = I.getOperand(0)->getType();
const Type *DestTy = I.getType();
bool SrcVec = SrcTy->getTypeID() == Type::VectorTyID;
bool DstVec = DestTy->getTypeID() == Type::VectorTyID;
Assert1(SrcVec == DstVec,"UIToFP source and dest must both be vector or scalar", &I);
Assert1(SrcTy->isIntOrIntVector(),"UIToFP source must be integer or integer vector", &I);
Assert1(DestTy->isFPOrFPVector(),"UIToFP result must be FP or FP vector", &I);
if (SrcVec && DstVec)
Assert1(cast<VectorType>(SrcTy)->getNumElements() == cast<VectorType>(DestTy)->getNumElements(),
"UIToFP source and dest vector length mismatch", &I);
visitInstruction(I);
}
void Verifier::visitSIToFPInst(SIToFPInst &I) {
// Get the source and destination types
const Type *SrcTy = I.getOperand(0)->getType();
const Type *DestTy = I.getType();
bool SrcVec = SrcTy->getTypeID() == Type::VectorTyID;
bool DstVec = DestTy->getTypeID() == Type::VectorTyID;
Assert1(SrcVec == DstVec,"SIToFP source and dest must both be vector or scalar", &I);
Assert1(SrcTy->isIntOrIntVector(),"SIToFP source must be integer or integer vector", &I);
Assert1(DestTy->isFPOrFPVector(),"SIToFP result must be FP or FP vector", &I);
if (SrcVec && DstVec)
Assert1(cast<VectorType>(SrcTy)->getNumElements() == cast<VectorType>(DestTy)->getNumElements(),
"SIToFP source and dest vector length mismatch", &I);
visitInstruction(I);
}
void Verifier::visitFPToUIInst(FPToUIInst &I) {
// Get the source and destination types
const Type *SrcTy = I.getOperand(0)->getType();
const Type *DestTy = I.getType();
bool SrcVec = SrcTy->getTypeID() == Type::VectorTyID;
bool DstVec = DestTy->getTypeID() == Type::VectorTyID;
Assert1(SrcVec == DstVec,"FPToUI source and dest must both be vector or scalar", &I);
Assert1(SrcTy->isFPOrFPVector(),"FPToUI source must be FP or FP vector", &I);
Assert1(DestTy->isIntOrIntVector(),"FPToUI result must be integer or integer vector", &I);
if (SrcVec && DstVec)
Assert1(cast<VectorType>(SrcTy)->getNumElements() == cast<VectorType>(DestTy)->getNumElements(),
"FPToUI source and dest vector length mismatch", &I);
visitInstruction(I);
}
void Verifier::visitFPToSIInst(FPToSIInst &I) {
// Get the source and destination types
const Type *SrcTy = I.getOperand(0)->getType();
const Type *DestTy = I.getType();
bool SrcVec = SrcTy->getTypeID() == Type::VectorTyID;
bool DstVec = DestTy->getTypeID() == Type::VectorTyID;
Assert1(SrcVec == DstVec,"FPToSI source and dest must both be vector or scalar", &I);
Assert1(SrcTy->isFPOrFPVector(),"FPToSI source must be FP or FP vector", &I);
Assert1(DestTy->isIntOrIntVector(),"FPToSI result must be integer or integer vector", &I);
if (SrcVec && DstVec)
Assert1(cast<VectorType>(SrcTy)->getNumElements() == cast<VectorType>(DestTy)->getNumElements(),
"FPToSI source and dest vector length mismatch", &I);
visitInstruction(I);
}
void Verifier::visitPtrToIntInst(PtrToIntInst &I) {
// Get the source and destination types
const Type *SrcTy = I.getOperand(0)->getType();
const Type *DestTy = I.getType();
Assert1(isa<PointerType>(SrcTy), "PtrToInt source must be pointer", &I);
Assert1(DestTy->isInteger(), "PtrToInt result must be integral", &I);
visitInstruction(I);
}
void Verifier::visitIntToPtrInst(IntToPtrInst &I) {
// Get the source and destination types
const Type *SrcTy = I.getOperand(0)->getType();
const Type *DestTy = I.getType();
Assert1(SrcTy->isInteger(), "IntToPtr source must be an integral", &I);
Assert1(isa<PointerType>(DestTy), "IntToPtr result must be a pointer",&I);
visitInstruction(I);
}
void Verifier::visitBitCastInst(BitCastInst &I) {
// Get the source and destination types
const Type *SrcTy = I.getOperand(0)->getType();
const Type *DestTy = I.getType();
// Get the size of the types in bits, we'll need this later
unsigned SrcBitSize = SrcTy->getPrimitiveSizeInBits();
unsigned DestBitSize = DestTy->getPrimitiveSizeInBits();
// BitCast implies a no-op cast of type only. No bits change.
// However, you can't cast pointers to anything but pointers.
Assert1(isa<PointerType>(DestTy) == isa<PointerType>(DestTy),
"Bitcast requires both operands to be pointer or neither", &I);
Assert1(SrcBitSize == DestBitSize, "Bitcast requies types of same width", &I);
visitInstruction(I);
}
/// visitPHINode - Ensure that a PHI node is well formed.
///
void Verifier::visitPHINode(PHINode &PN) {
// Ensure that the PHI nodes are all grouped together at the top of the block.
// This can be tested by checking whether the instruction before this is
// either nonexistent (because this is begin()) or is a PHI node. If not,
// then there is some other instruction before a PHI.
Assert2(&PN == &PN.getParent()->front() ||
isa<PHINode>(--BasicBlock::iterator(&PN)),
"PHI nodes not grouped at top of basic block!",
&PN, PN.getParent());
// Check that all of the operands of the PHI node have the same type as the
// result.
for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
Assert1(PN.getType() == PN.getIncomingValue(i)->getType(),
"PHI node operands are not the same type as the result!", &PN);
// All other PHI node constraints are checked in the visitBasicBlock method.
visitInstruction(PN);
}
void Verifier::VerifyCallSite(CallSite CS) {
Instruction *I = CS.getInstruction();
Assert1(isa<PointerType>(CS.getCalledValue()->getType()),
"Called function must be a pointer!", I);
const PointerType *FPTy = cast<PointerType>(CS.getCalledValue()->getType());
Assert1(isa<FunctionType>(FPTy->getElementType()),
"Called function is not pointer to function type!", I);
const FunctionType *FTy = cast<FunctionType>(FPTy->getElementType());
// Verify that the correct number of arguments are being passed
if (FTy->isVarArg())
Assert1(CS.arg_size() >= FTy->getNumParams(),
"Called function requires more parameters than were provided!",I);
else
Assert1(CS.arg_size() == FTy->getNumParams(),
"Incorrect number of arguments passed to called function!", I);
// Verify that all arguments to the call match the function type...
for (unsigned i = 0, e = FTy->getNumParams(); i != e; ++i)
Assert3(CS.getArgument(i)->getType() == FTy->getParamType(i),
"Call parameter type does not match function signature!",
CS.getArgument(i), FTy->getParamType(i), I);
const ParamAttrsList *Attrs = CS.getParamAttrs();
Assert1(!Attrs ||
(Attrs->size() &&
Attrs->getParamIndex(Attrs->size()-1) <= CS.arg_size()),
"Attributes after last argument!", I);
// Verify call attributes.
VerifyFunctionAttrs(FTy, Attrs, I);
if (Attrs && FTy->isVarArg())
// Check attributes on the varargs part.
for (unsigned Idx = 1 + FTy->getNumParams(); Idx <= CS.arg_size(); ++Idx) {
uint16_t Attr = Attrs->getParamAttrs(Idx);
VerifyAttrs(Attr, CS.getArgument(Idx-1)->getType(), false, I);
uint16_t VArgI = Attr & ParamAttr::VarArgsIncompatible;
Assert1(!VArgI, "Attribute " + ParamAttrsList::getParamAttrsText(VArgI) +
"cannot be used for vararg call arguments!", I);
}
visitInstruction(*I);
}
void Verifier::visitCallInst(CallInst &CI) {
VerifyCallSite(&CI);
if (Function *F = CI.getCalledFunction()) {
if (Intrinsic::ID ID = (Intrinsic::ID)F->getIntrinsicID())
visitIntrinsicFunctionCall(ID, CI);
}
}
void Verifier::visitInvokeInst(InvokeInst &II) {
VerifyCallSite(&II);
}
/// visitBinaryOperator - Check that both arguments to the binary operator are
/// of the same type!
///
void Verifier::visitBinaryOperator(BinaryOperator &B) {
Assert1(B.getOperand(0)->getType() == B.getOperand(1)->getType(),
"Both operands to a binary operator are not of the same type!", &B);
switch (B.getOpcode()) {
// Check that logical operators are only used with integral operands.
case Instruction::And:
case Instruction::Or:
case Instruction::Xor:
Assert1(B.getType()->isInteger() ||
(isa<VectorType>(B.getType()) &&
cast<VectorType>(B.getType())->getElementType()->isInteger()),
"Logical operators only work with integral types!", &B);
Assert1(B.getType() == B.getOperand(0)->getType(),
"Logical operators must have same type for operands and result!",
&B);
break;
case Instruction::Shl:
case Instruction::LShr:
case Instruction::AShr:
Assert1(B.getType()->isInteger(),
"Shift must return an integer result!", &B);
Assert1(B.getType() == B.getOperand(0)->getType(),
"Shift return type must be same as operands!", &B);
/* FALL THROUGH */
default:
// Arithmetic operators only work on integer or fp values
Assert1(B.getType() == B.getOperand(0)->getType(),
"Arithmetic operators must have same type for operands and result!",
&B);
Assert1(B.getType()->isInteger() || B.getType()->isFloatingPoint() ||
isa<VectorType>(B.getType()),
"Arithmetic operators must have integer, fp, or vector type!", &B);
break;
}
visitInstruction(B);
}
void Verifier::visitICmpInst(ICmpInst& IC) {
// Check that the operands are the same type
const Type* Op0Ty = IC.getOperand(0)->getType();
const Type* Op1Ty = IC.getOperand(1)->getType();
Assert1(Op0Ty == Op1Ty,
"Both operands to ICmp instruction are not of the same type!", &IC);
// Check that the operands are the right type
Assert1(Op0Ty->isInteger() || isa<PointerType>(Op0Ty),
"Invalid operand types for ICmp instruction", &IC);
visitInstruction(IC);
}
void Verifier::visitFCmpInst(FCmpInst& FC) {
// Check that the operands are the same type
const Type* Op0Ty = FC.getOperand(0)->getType();
const Type* Op1Ty = FC.getOperand(1)->getType();
Assert1(Op0Ty == Op1Ty,
"Both operands to FCmp instruction are not of the same type!", &FC);
// Check that the operands are the right type
Assert1(Op0Ty->isFloatingPoint(),
"Invalid operand types for FCmp instruction", &FC);
visitInstruction(FC);
}
void Verifier::visitExtractElementInst(ExtractElementInst &EI) {
Assert1(ExtractElementInst::isValidOperands(EI.getOperand(0),
EI.getOperand(1)),
"Invalid extractelement operands!", &EI);
visitInstruction(EI);
}
void Verifier::visitInsertElementInst(InsertElementInst &IE) {
Assert1(InsertElementInst::isValidOperands(IE.getOperand(0),
IE.getOperand(1),
IE.getOperand(2)),
"Invalid insertelement operands!", &IE);
visitInstruction(IE);
}
void Verifier::visitShuffleVectorInst(ShuffleVectorInst &SV) {
Assert1(ShuffleVectorInst::isValidOperands(SV.getOperand(0), SV.getOperand(1),
SV.getOperand(2)),
"Invalid shufflevector operands!", &SV);
Assert1(SV.getType() == SV.getOperand(0)->getType(),
"Result of shufflevector must match first operand type!", &SV);
// Check to see if Mask is valid.
if (const ConstantVector *MV = dyn_cast<ConstantVector>(SV.getOperand(2))) {
for (unsigned i = 0, e = MV->getNumOperands(); i != e; ++i) {
Assert1(isa<ConstantInt>(MV->getOperand(i)) ||
isa<UndefValue>(MV->getOperand(i)),
"Invalid shufflevector shuffle mask!", &SV);
}
} else {
Assert1(isa<UndefValue>(SV.getOperand(2)) ||
isa<ConstantAggregateZero>(SV.getOperand(2)),
"Invalid shufflevector shuffle mask!", &SV);
}
visitInstruction(SV);
}
void Verifier::visitGetElementPtrInst(GetElementPtrInst &GEP) {
SmallVector<Value*, 16> Idxs(GEP.idx_begin(), GEP.idx_end());
const Type *ElTy =
GetElementPtrInst::getIndexedType(GEP.getOperand(0)->getType(),
Idxs.begin(), Idxs.end(), true);
Assert1(ElTy, "Invalid indices for GEP pointer type!", &GEP);
Assert2(isa<PointerType>(GEP.getType()) &&
cast<PointerType>(GEP.getType())->getElementType() == ElTy,
"GEP is not of right type for indices!", &GEP, ElTy);
visitInstruction(GEP);
}
void Verifier::visitLoadInst(LoadInst &LI) {
const Type *ElTy =
cast<PointerType>(LI.getOperand(0)->getType())->getElementType();
Assert2(ElTy == LI.getType(),
"Load result type does not match pointer operand type!", &LI, ElTy);
visitInstruction(LI);
}
void Verifier::visitStoreInst(StoreInst &SI) {
const Type *ElTy =
cast<PointerType>(SI.getOperand(1)->getType())->getElementType();
Assert2(ElTy == SI.getOperand(0)->getType(),
"Stored value type does not match pointer operand type!", &SI, ElTy);
visitInstruction(SI);
}
void Verifier::visitAllocationInst(AllocationInst &AI) {
const PointerType *Ptr = AI.getType();
Assert(Ptr->getAddressSpace() == 0,
"Allocation instruction pointer not in the generic address space!");
visitInstruction(AI);
}
/// verifyInstruction - Verify that an instruction is well formed.
///
void Verifier::visitInstruction(Instruction &I) {
BasicBlock *BB = I.getParent();
Assert1(BB, "Instruction not embedded in basic block!", &I);
if (!isa<PHINode>(I)) { // Check that non-phi nodes are not self referential
for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
UI != UE; ++UI)
Assert1(*UI != (User*)&I ||
!DT->dominates(&BB->getParent()->getEntryBlock(), BB),
"Only PHI nodes may reference their own value!", &I);
}
// Check that void typed values don't have names
Assert1(I.getType() != Type::VoidTy || !I.hasName(),
"Instruction has a name, but provides a void value!", &I);
// Check that the return value of the instruction is either void or a legal
// value type.
Assert1(I.getType() == Type::VoidTy || I.getType()->isFirstClassType(),
"Instruction returns a non-scalar type!", &I);
// Check that all uses of the instruction, if they are instructions
// themselves, actually have parent basic blocks. If the use is not an
// instruction, it is an error!
for (User::use_iterator UI = I.use_begin(), UE = I.use_end();
UI != UE; ++UI) {
Assert1(isa<Instruction>(*UI), "Use of instruction is not an instruction!",
*UI);
Instruction *Used = cast<Instruction>(*UI);
Assert2(Used->getParent() != 0, "Instruction referencing instruction not"
" embeded in a basic block!", &I, Used);
}
for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) {
Assert1(I.getOperand(i) != 0, "Instruction has null operand!", &I);
// Check to make sure that only first-class-values are operands to
// instructions.
Assert1(I.getOperand(i)->getType()->isFirstClassType(),
"Instruction operands must be first-class values!", &I);
if (Function *F = dyn_cast<Function>(I.getOperand(i))) {
// Check to make sure that the "address of" an intrinsic function is never
// taken.
Assert1(!F->isIntrinsic() || (i == 0 && isa<CallInst>(I)),
"Cannot take the address of an intrinsic!", &I);
Assert1(F->getParent() == Mod, "Referencing function in another module!",
&I);
} else if (BasicBlock *OpBB = dyn_cast<BasicBlock>(I.getOperand(i))) {
Assert1(OpBB->getParent() == BB->getParent(),
"Referring to a basic block in another function!", &I);
} else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
Assert1(OpArg->getParent() == BB->getParent(),
"Referring to an argument in another function!", &I);
} else if (GlobalValue *GV = dyn_cast<GlobalValue>(I.getOperand(i))) {
Assert1(GV->getParent() == Mod, "Referencing global in another module!",
&I);
} else if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i))) {
BasicBlock *OpBlock = Op->getParent();
// Check that a definition dominates all of its uses.
if (!isa<PHINode>(I)) {
// Invoke results are only usable in the normal destination, not in the
// exceptional destination.
if (InvokeInst *II = dyn_cast<InvokeInst>(Op)) {
OpBlock = II->getNormalDest();
Assert2(OpBlock != II->getUnwindDest(),
"No uses of invoke possible due to dominance structure!",
Op, II);
// If the normal successor of an invoke instruction has multiple
// predecessors, then the normal edge from the invoke is critical, so
// the invoke value can only be live if the destination block
// dominates all of it's predecessors (other than the invoke) or if
// the invoke value is only used by a phi in the successor.
if (!OpBlock->getSinglePredecessor() &&
DT->dominates(&BB->getParent()->getEntryBlock(), BB)) {
// The first case we allow is if the use is a PHI operand in the
// normal block, and if that PHI operand corresponds to the invoke's
// block.
bool Bad = true;
if (PHINode *PN = dyn_cast<PHINode>(&I))
if (PN->getParent() == OpBlock &&
PN->getIncomingBlock(i/2) == Op->getParent())
Bad = false;
// If it is used by something non-phi, then the other case is that
// 'OpBlock' dominates all of its predecessors other than the
// invoke. In this case, the invoke value can still be used.
if (Bad) {
Bad = false;
for (pred_iterator PI = pred_begin(OpBlock),
E = pred_end(OpBlock); PI != E; ++PI) {
if (*PI != II->getParent() && !DT->dominates(OpBlock, *PI)) {
Bad = true;
break;
}
}
}
Assert2(!Bad,
"Invoke value defined on critical edge but not dead!", &I,
Op);
}
} else if (OpBlock == BB) {
// If they are in the same basic block, make sure that the definition
// comes before the use.
Assert2(InstsInThisBlock.count(Op) ||
!DT->dominates(&BB->getParent()->getEntryBlock(), BB),
"Instruction does not dominate all uses!", Op, &I);
}
// Definition must dominate use unless use is unreachable!
Assert2(DT->dominates(OpBlock, BB) ||
!DT->dominates(&BB->getParent()->getEntryBlock(), BB),
"Instruction does not dominate all uses!", Op, &I);
} else {
// PHI nodes are more difficult than other nodes because they actually
// "use" the value in the predecessor basic blocks they correspond to.
BasicBlock *PredBB = cast<BasicBlock>(I.getOperand(i+1));
Assert2(DT->dominates(OpBlock, PredBB) ||
!DT->dominates(&BB->getParent()->getEntryBlock(), PredBB),
"Instruction does not dominate all uses!", Op, &I);
}
} else if (isa<InlineAsm>(I.getOperand(i))) {
Assert1(i == 0 && (isa<CallInst>(I) || isa<InvokeInst>(I)),
"Cannot take the address of an inline asm!", &I);
}
}
InstsInThisBlock.insert(&I);
}
/// visitIntrinsicFunction - Allow intrinsics to be verified in different ways.
///
void Verifier::visitIntrinsicFunctionCall(Intrinsic::ID ID, CallInst &CI) {
Function *IF = CI.getCalledFunction();
Assert1(IF->isDeclaration(), "Intrinsic functions should never be defined!",
IF);
#define GET_INTRINSIC_VERIFIER
#include "llvm/Intrinsics.gen"
#undef GET_INTRINSIC_VERIFIER
switch (ID) {
default:
break;
case Intrinsic::gcroot:
case Intrinsic::gcwrite:
case Intrinsic::gcread: {
Type *PtrTy = PointerType::getUnqual(Type::Int8Ty),
*PtrPtrTy = PointerType::getUnqual(PtrTy);
switch (ID) {
default:
break;
case Intrinsic::gcroot:
Assert1(CI.getOperand(1)->getType() == PtrPtrTy,
"Intrinsic parameter #1 is not i8**.", &CI);
Assert1(CI.getOperand(2)->getType() == PtrTy,
"Intrinsic parameter #2 is not i8*.", &CI);
Assert1(isa<AllocaInst>(
IntrinsicInst::StripPointerCasts(CI.getOperand(1))),
"llvm.gcroot parameter #1 must be an alloca.", &CI);
Assert1(isa<Constant>(CI.getOperand(2)),
"llvm.gcroot parameter #2 must be a constant.", &CI);
break;
case Intrinsic::gcwrite:
Assert1(CI.getOperand(1)->getType() == PtrTy,
"Intrinsic parameter #1 is not a i8*.", &CI);
Assert1(CI.getOperand(2)->getType() == PtrTy,
"Intrinsic parameter #2 is not a i8*.", &CI);
Assert1(CI.getOperand(3)->getType() == PtrPtrTy,
"Intrinsic parameter #3 is not a i8**.", &CI);
break;
case Intrinsic::gcread:
Assert1(CI.getOperand(1)->getType() == PtrTy,
"Intrinsic parameter #1 is not a i8*.", &CI);
Assert1(CI.getOperand(2)->getType() == PtrPtrTy,
"Intrinsic parameter #2 is not a i8**.", &CI);
break;
}
Assert1(CI.getParent()->getParent()->hasCollector(),
"Enclosing function does not specify a collector algorithm.",
&CI);
} break;
case Intrinsic::init_trampoline:
Assert1(isa<Function>(IntrinsicInst::StripPointerCasts(CI.getOperand(2))),
"llvm.init_trampoline parameter #2 must resolve to a function.",
&CI);
break;
}
}
/// VerifyIntrinsicPrototype - TableGen emits calls to this function into
/// Intrinsics.gen. This implements a little state machine that verifies the
/// prototype of intrinsics.
void Verifier::VerifyIntrinsicPrototype(Intrinsic::ID ID,
Function *F,
unsigned Count, ...) {
va_list VA;
va_start(VA, Count);
const FunctionType *FTy = F->getFunctionType();
// For overloaded intrinsics, the Suffix of the function name must match the
// types of the arguments. This variable keeps track of the expected
// suffix, to be checked at the end.
std::string Suffix;
if (FTy->getNumParams() + FTy->isVarArg() != Count - 1) {
CheckFailed("Intrinsic prototype has incorrect number of arguments!", F);
return;
}
// Note that "arg#0" is the return type.
for (unsigned ArgNo = 0; ArgNo < Count; ++ArgNo) {
MVT::ValueType VT = va_arg(VA, MVT::ValueType);
if (VT == MVT::isVoid && ArgNo > 0) {
if (!FTy->isVarArg())
CheckFailed("Intrinsic prototype has no '...'!", F);
break;
}
const Type *Ty;
if (ArgNo == 0)
Ty = FTy->getReturnType();
else
Ty = FTy->getParamType(ArgNo-1);
unsigned NumElts = 0;
const Type *EltTy = Ty;
if (const VectorType *VTy = dyn_cast<VectorType>(Ty)) {
EltTy = VTy->getElementType();
NumElts = VTy->getNumElements();
}
if ((int)VT < 0) {
int Match = ~VT;
if (Match == 0) {
if (Ty != FTy->getReturnType()) {
CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " does not "
"match return type.", F);
break;
}
} else {
if (Ty != FTy->getParamType(Match-1)) {
CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " does not "
"match parameter %" + utostr(Match-1) + ".", F);
break;
}
}
} else if (VT == MVT::iAny) {
if (!EltTy->isInteger()) {
if (ArgNo == 0)
CheckFailed("Intrinsic result type is not "
"an integer type.", F);
else
CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is not "
"an integer type.", F);
break;
}
unsigned GotBits = cast<IntegerType>(EltTy)->getBitWidth();
Suffix += ".";
if (EltTy != Ty)
Suffix += "v" + utostr(NumElts);
Suffix += "i" + utostr(GotBits);;
// Check some constraints on various intrinsics.
switch (ID) {
default: break; // Not everything needs to be checked.
case Intrinsic::bswap:
if (GotBits < 16 || GotBits % 16 != 0)
CheckFailed("Intrinsic requires even byte width argument", F);
break;
}
} else if (VT == MVT::fAny) {
if (!EltTy->isFloatingPoint()) {
if (ArgNo == 0)
CheckFailed("Intrinsic result type is not "
"a floating-point type.", F);
else
CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is not "
"a floating-point type.", F);
break;
}
Suffix += ".";
if (EltTy != Ty)
Suffix += "v" + utostr(NumElts);
Suffix += MVT::getValueTypeString(MVT::getValueType(EltTy));
} else if (VT == MVT::iPTR) {
if (!isa<PointerType>(Ty)) {
if (ArgNo == 0)
CheckFailed("Intrinsic result type is not a "
"pointer and a pointer is required.", F);
else
CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is not a "
"pointer and a pointer is required.", F);
break;
}
} else if (MVT::isVector(VT)) {
// If this is a vector argument, verify the number and type of elements.
if (MVT::getVectorElementType(VT) != MVT::getValueType(EltTy)) {
CheckFailed("Intrinsic prototype has incorrect vector element type!",
F);
break;
}
if (MVT::getVectorNumElements(VT) != NumElts) {
CheckFailed("Intrinsic prototype has incorrect number of "
"vector elements!",F);
break;
}
} else if (MVT::getTypeForValueType(VT) != EltTy) {
if (ArgNo == 0)
CheckFailed("Intrinsic prototype has incorrect result type!", F);
else
CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is wrong!",F);
break;
} else if (EltTy != Ty) {
if (ArgNo == 0)
CheckFailed("Intrinsic result type is vector "
"and a scalar is required.", F);
else
CheckFailed("Intrinsic parameter #" + utostr(ArgNo-1) + " is vector "
"and a scalar is required.", F);
}
}
va_end(VA);
// If we computed a Suffix then the intrinsic is overloaded and we need to
// make sure that the name of the function is correct. We add the suffix to
// the name of the intrinsic and compare against the given function name. If
// they are not the same, the function name is invalid. This ensures that
// overloading of intrinsics uses a sane and consistent naming convention.
if (!Suffix.empty()) {
std::string Name(Intrinsic::getName(ID));
if (Name + Suffix != F->getName())
CheckFailed("Overloaded intrinsic has incorrect suffix: '" +
F->getName().substr(Name.length()) + "'. It should be '" +
Suffix + "'", F);
}
}
//===----------------------------------------------------------------------===//
// Implement the public interfaces to this file...
//===----------------------------------------------------------------------===//
01392 FunctionPass *llvm::createVerifierPass(VerifierFailureAction action) {
return new Verifier(action);
}
// verifyFunction - Create
01398 bool llvm::verifyFunction(const Function &f, VerifierFailureAction action) {
Function &F = const_cast<Function&>(f);
assert(!F.isDeclaration() && "Cannot verify external functions");
FunctionPassManager FPM(new ExistingModuleProvider(F.getParent()));
Verifier *V = new Verifier(action);
FPM.add(V);
FPM.run(F);
return V->Broken;
}
/// verifyModule - Check a module for errors, printing messages on stderr.
/// Return true if the module is corrupt.
///
01412 bool llvm::verifyModule(const Module &M, VerifierFailureAction action,
std::string *ErrorInfo) {
PassManager PM;
Verifier *V = new Verifier(action);
PM.add(V);
PM.run((Module&)M);
if (ErrorInfo && V->Broken)
*ErrorInfo = V->msgs.str();
return V->Broken;
}
// vim: sw=2
Generated by Doxygen 1.6.0 Back to index
|
{
"url": "http://llvm.sourcearchive.com/documentation/2.2/Verifier_8cpp-source.html",
"source_domain": "llvm.sourcearchive.com",
"snapshot_id": "crawl=CC-MAIN-2018-17",
"warc_metadata": {
"Content-Length": "144191",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YRZWY2SZALMNE25JZTEXZN5Y4LBKBJSW",
"WARC-Concurrent-To": "<urn:uuid:7d30f88b-e953-43f6-8dfe-99ba37fe5e8c>",
"WARC-Date": "2018-04-22T12:46:26Z",
"WARC-IP-Address": "5.9.86.18",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2PZYUG25AEXWEFK4SQSCDBYSAPHNJTLY",
"WARC-Record-ID": "<urn:uuid:5eec02ea-ff02-4b5a-a149-54337319e7c3>",
"WARC-Target-URI": "http://llvm.sourcearchive.com/documentation/2.2/Verifier_8cpp-source.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d4e65ed4-2276-4873-bad8-2dd25b7317ac>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-186-217-96.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-17\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for April 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
33,
90,
91,
104,
105,
186,
189,
245,
248,
321,
362,
365,
446,
449,
529,
572,
575,
656,
717,
720,
786,
864,
944,
1018,
1091,
1127,
1208,
1258,
1338,
1411,
1490,
1535,
1614,
1676,
1735,
1786,
1863,
1919,
1991,
2072,
2121,
2185,
2260,
2263,
2344,
2345,
2381,
2415,
2445,
2473,
2496,
2521,
2554,
2592,
2623,
2651,
2683,
2713,
2751,
2788,
2823,
2853,
2891,
2925,
2959,
2993,
3028,
3060,
3095,
3116,
3135,
3154,
3176,
3177,
3223,
3286,
3341,
3342,
3394,
3395,
3473,
3495,
3533,
3560,
3561,
3634,
3689,
3750,
3792,
3816,
3841,
3851,
3859,
3860,
3878,
3895,
3896,
3916,
3922,
3927,
3928,
3956,
4040,
4094,
4095,
4122,
4183,
4238,
4302,
4370,
4404,
4467,
4530,
4593,
4660,
4661,
4742,
4816,
4897,
4939,
4991,
4992,
5007,
5045,
5110,
5164,
5206,
5244,
5301,
5348,
5371,
5409,
5446,
5514,
5561,
5593,
5631,
5697,
5753,
5754,
5755,
5794,
5810,
5863,
5864,
5937,
6018,
6066,
6086,
6118,
6138,
6144,
6145,
6183,
6253,
6309,
6310,
6337,
6338,
6354,
6386,
6387,
6460,
6541,
6589,
6609,
6641,
6642,
6662,
6668,
6669,
6706,
6784,
6855,
6885,
6886,
6946,
6997,
7005,
7006,
7084,
7108,
7141,
7142,
7217,
7241,
7271,
7272,
7326,
7356,
7362,
7363,
7424,
7452,
7489,
7509,
7550,
7556,
7557,
7637,
7668,
7676,
7703,
7723,
7764,
7790,
7825,
7871,
7903,
7924,
7959,
8008,
8040,
8066,
8101,
8150,
8177,
8187,
8195,
8215,
8221,
8222,
8223,
8254,
8307,
8351,
8401,
8445,
8482,
8524,
8563,
8600,
8637,
8680,
8719,
8760,
8801,
8842,
8883,
8928,
8973,
9016,
9052,
9101,
9139,
9177,
9235,
9291,
9347,
9414,
9452,
9494,
9551,
9589,
9629,
9672,
9721,
9763,
9805,
9847,
9886,
9945,
10014,
10064,
10065,
10103,
10168,
10224,
10297,
10335,
10417,
10463,
10464,
10502,
10524,
10557,
10577,
10592,
10636,
10658,
10666,
10672,
10673,
10710,
10734,
10774,
10780,
10781,
10782,
10862,
10942,
10986,
11035,
11098,
11163,
11194,
11216,
11238,
11260,
11282,
11303,
11309,
11310,
11377,
11439,
11470,
11492,
11513,
11535,
11556,
11562,
11567,
11568,
11593,
11650,
11679,
11680,
11681,
11758,
11781,
11838,
11866,
11927,
11959,
12024,
12060,
12129,
12169,
12242,
12243,
12244,
12295,
12328,
12365,
12403,
12444,
12479,
12541,
12622,
12638,
12639,
12698,
12765,
12768,
12832,
12901,
12902,
12936,
12989,
13051,
13119,
13123,
13125,
13126,
13183,
13212,
13290,
13360,
13396,
13407,
13474,
13515,
13580,
13584,
13585,
13609,
13611,
13612,
13663,
13696,
13743,
13807,
13838,
13910,
13964,
14021,
14024,
14068,
14138,
14199,
14248,
14326,
14344,
14348,
14351,
14375,
14377,
14378,
14438,
14440,
14441,
14521,
14596,
14675,
14720,
14752,
14764,
14765,
14788,
14842,
14918,
14970,
14981,
15033,
15111,
15161,
15165,
15166,
15189,
15256,
15320,
15370,
15449,
15453,
15454,
15514,
15562,
15618,
15620,
15621,
15698,
15743,
15802,
15866,
15919,
15933,
15945,
15946,
15970,
15971,
16032,
16079,
16080,
16137,
16138,
16172,
16247,
16269,
16275,
16276,
16315,
16385,
16391,
16395,
16397,
16398,
16447,
16450,
16494,
16525,
16573,
16608,
16609,
16650,
16727,
16746,
16797,
16842,
16902,
16903,
16973,
17023,
17024,
17075,
17076,
17096,
17124,
17197,
17248,
17249,
17281,
17319,
17320,
17401,
17433,
17444,
17455,
17478,
17489,
17515,
17541,
17575,
17602,
17673,
17684,
17688,
17691,
17772,
17790,
17856,
17883,
17932,
18001,
18038,
18090,
18136,
18211,
18216,
18217,
18244,
18309,
18349,
18415,
18426,
18505,
18547,
18580,
18631,
18688,
18693,
18721,
18765,
18815,
18890,
18894,
18896,
18897,
18898,
18964,
18967,
19016,
19044,
19045,
19093,
19170,
19171,
19251,
19260,
19294,
19365,
19424,
19467,
19484,
19565,
19566,
19622,
19669,
19749,
19798,
19856,
19931,
19973,
19974,
20035,
20057,
20107,
20179,
20244,
20311,
20358,
20359,
20420,
20493,
20574,
20600,
20611,
20678,
20734,
20813,
20880,
20935,
20936,
21013,
21036,
21081,
21148,
21192,
21200,
21206,
21210,
21212,
21213,
21269,
21340,
21388,
21466,
21489,
21491,
21492,
21541,
21586,
21618,
21666,
21742,
21796,
21803,
21866,
21925,
21987,
21988,
22063,
22083,
22110,
22112,
22113,
22162,
22238,
22288,
22343,
22401,
22456,
22533,
22534,
22561,
22563,
22564,
22613,
22669,
22724,
22797,
22857,
22913,
22989,
23013,
23015,
23016,
23017,
23097,
23138,
23142,
23188,
23267,
23269,
23270,
23316,
23358,
23408,
23444,
23445,
23507,
23564,
23623,
23624,
23693,
23760,
23828,
23829,
23852,
23854,
23855,
23899,
23941,
23991,
24027,
24028,
24090,
24158,
24227,
24284,
24343,
24344,
24411,
24412,
24435,
24437,
24438,
24482,
24524,
24574,
24610,
24611,
24673,
24730,
24789,
24790,
24858,
24927,
24994,
24995,
25018,
25020,
25021,
25071,
25113,
25163,
25199,
25261,
25318,
25377,
25378,
25449,
25521,
25591,
25592,
25615,
25617,
25618,
25664,
25706,
25756,
25792,
25793,
25855,
25912,
25971,
25972,
26041,
26111,
26181,
26182,
26205,
26207,
26208,
26256,
26298,
26348,
26384,
26385,
26441,
26498,
26499,
26587,
26679,
26760,
26761,
26785,
26886,
26952,
26953,
26976,
26978,
26979,
27027,
27069,
27119,
27155,
27156,
27212,
27269,
27270,
27358,
27450,
27531,
27532,
27556,
27657,
27723,
27724,
27747,
27749,
27750,
27798,
27840,
27890,
27926,
27927,
27983,
28040,
28041,
28129,
28209,
28302,
28303,
28327,
28428,
28494,
28495,
28518,
28520,
28521,
28569,
28611,
28661,
28697,
28698,
28754,
28811,
28812,
28900,
28980,
29073,
29074,
29098,
29199,
29265,
29266,
29289,
29291,
29292,
29344,
29386,
29436,
29472,
29473,
29548,
29620,
29621,
29644,
29646,
29647,
29699,
29741,
29791,
29827,
29828,
29902,
29979,
29980,
30003,
30005,
30006,
30056,
30098,
30148,
30184,
30185,
30247,
30304,
30363,
30364,
30428,
30492,
30556,
30630,
30711,
30712,
30735,
30737,
30738,
30796,
30800,
30843,
30924,
30999,
31076,
31132,
31178,
31231,
31289,
31321,
31322,
31400,
31413,
31480,
31543,
31619,
31620,
31699,
31700,
31724,
31726,
31727,
31772,
31812,
31813,
31873,
31925,
32004,
32057,
32123,
32124,
32196,
32197,
32263,
32286,
32336,
32415,
32422,
32472,
32548,
32549,
32619,
32680,
32746,
32816,
32873,
32874,
32926,
32927,
32947,
32975,
33043,
33092,
33093,
33122,
33160,
33161,
33193,
33238,
33318,
33367,
33368,
33437,
33438,
33500,
33580,
33643,
33649,
33650,
33674,
33676,
33677,
33722,
33745,
33746,
33792,
33855,
33897,
33901,
33903,
33904,
33953,
33976,
33978,
33979,
34058,
34080,
34084,
34140,
34208,
34287,
34288,
34315,
34387,
34412,
34436,
34461,
34501,
34547,
34623,
34692,
34747,
34825,
34842,
34853,
34878,
34904,
34930,
34968,
35025,
35080,
35144,
35167,
35178,
35240,
35295,
35376,
35393,
35467,
35509,
35589,
35600,
35604,
35605,
35628,
35630,
35631,
35676,
35723,
35774,
35825,
35851,
35930,
35978,
36035,
36097,
36121,
36123,
36124,
36169,
36216,
36267,
36318,
36344,
36423,
36471,
36507,
36569,
36593,
36595,
36596,
36661,
36725,
36790,
36842,
36866,
36868,
36869,
36932,
36995,
37058,
37122,
37173,
37197,
37199,
37200,
37263,
37344,
37408,
37459,
37514,
37588,
37591,
37627,
37706,
37772,
37825,
37875,
37934,
37940,
37951,
38001,
38059,
38116,
38120,
38123,
38147,
38149,
38150,
38214,
38278,
38299,
38367,
38438,
38502,
38547,
38617,
38681,
38706,
38708,
38709,
38754,
38775,
38845,
38877,
38956,
38980,
38982,
38983,
39030,
39051,
39121,
39168,
39248,
39272,
39274,
39275,
39332,
39373,
39412,
39485,
39509,
39511,
39512,
39513,
39580,
39584,
39634,
39668,
39731,
39732,
39813,
39880,
39905,
39939,
40008,
40076,
40080,
40081,
40132,
40187,
40256,
40257,
40335,
40352,
40426,
40483,
40484,
40554,
40628,
40662,
40726,
40751,
40831,
40849,
40897,
40975,
41028,
41032,
41033,
41095,
41167,
41168,
41239,
41260,
41320,
41389,
41392,
41453,
41534,
41550,
41615,
41678,
41758,
41777,
41852,
41904,
41974,
42046,
42099,
42167,
42242,
42321,
42340,
42415,
42460,
42461,
42521,
42551,
42631,
42667,
42724,
42765,
42776,
42826,
42902,
42929,
42940,
43015,
43095,
43167,
43245,
43315,
43365,
43435,
43512,
43593,
43615,
43644,
43697,
43745,
43809,
43838,
43851,
43930,
44004,
44078,
44101,
44128,
44187,
44246,
44324,
44354,
44379,
44397,
44413,
44427,
44453,
44532,
44557,
44569,
44605,
44685,
44720,
44768,
44841,
44911,
44921,
44922,
44989,
45035,
45106,
45174,
45189,
45268,
45347,
45413,
45463,
45538,
45606,
45614,
45664,
45730,
45794,
45800,
45804,
45835,
45837,
45838,
45918,
45922,
45998,
46039,
46118,
46133,
46136,
46167,
46198,
46228,
46231,
46247,
46258,
46269,
46295,
46322,
46350,
46411,
46465,
46472,
46492,
46507,
46522,
46552,
46609,
46670,
46724,
46784,
46817,
46888,
46957,
47006,
47076,
47091,
47122,
47176,
47238,
47292,
47354,
47411,
47474,
47489,
47519,
47573,
47635,
47692,
47755,
47770,
47778,
47785,
47844,
47920,
47940,
47953,
47988,
48067,
48144,
48162,
48173,
48177,
48179,
48180,
48254,
48332,
48361,
48419,
48472,
48535,
48549,
48572,
48575,
48625,
48628,
48707,
48778,
48817,
48839,
48840,
48900,
48978,
48990,
48994,
48995,
49038,
49091,
49143,
49144,
49186,
49214,
49275,
49288,
49294,
49295,
49315,
49335,
49368,
49377,
49416,
49417,
49443,
49471,
49531,
49568,
49607,
49613,
49618,
49641,
49664,
49688,
49730,
49809,
49857,
49874,
49884,
49899,
49947,
50026,
50097,
50114,
50124,
50132,
50166,
50199,
50223,
50277,
50323,
50336,
50413,
50459,
50474,
50482,
50548,
50569,
50592,
50633,
50673,
50728,
50748,
50811,
50842,
50891,
50966,
50983,
50991,
51025,
51064,
51088,
51142,
51194,
51207,
51284,
51336,
51351,
51359,
51380,
51403,
51444,
51511,
51545,
51580,
51604,
51660,
51724,
51737,
51816,
51880,
51895,
51903,
51939,
52018,
52089,
52167,
52191,
52206,
52214,
52268,
52335,
52378,
52393,
52401,
52457,
52479,
52553,
52564,
52645,
52658,
52688,
52710,
52765,
52818,
52829,
52907,
52960,
52966,
52970,
52971,
52985,
52986,
53064,
53142,
53221,
53297,
53374,
53399,
53445,
53484,
53551,
53628,
53664,
53668,
53670,
53671,
53672,
53753,
53805,
53886,
53887,
53964,
53995,
53997,
53998,
53999,
54026,
54109,
54151,
54219,
54220,
54290,
54328,
54342,
54356,
54376,
54378,
54379,
54454,
54496,
54500,
54577,
54627,
54645,
54683,
54696,
54718,
54721,
54751,
54783,
54803,
54805,
54806,
54819,
54820
],
"line_end_idx": [
33,
90,
91,
104,
105,
186,
189,
245,
248,
321,
362,
365,
446,
449,
529,
572,
575,
656,
717,
720,
786,
864,
944,
1018,
1091,
1127,
1208,
1258,
1338,
1411,
1490,
1535,
1614,
1676,
1735,
1786,
1863,
1919,
1991,
2072,
2121,
2185,
2260,
2263,
2344,
2345,
2381,
2415,
2445,
2473,
2496,
2521,
2554,
2592,
2623,
2651,
2683,
2713,
2751,
2788,
2823,
2853,
2891,
2925,
2959,
2993,
3028,
3060,
3095,
3116,
3135,
3154,
3176,
3177,
3223,
3286,
3341,
3342,
3394,
3395,
3473,
3495,
3533,
3560,
3561,
3634,
3689,
3750,
3792,
3816,
3841,
3851,
3859,
3860,
3878,
3895,
3896,
3916,
3922,
3927,
3928,
3956,
4040,
4094,
4095,
4122,
4183,
4238,
4302,
4370,
4404,
4467,
4530,
4593,
4660,
4661,
4742,
4816,
4897,
4939,
4991,
4992,
5007,
5045,
5110,
5164,
5206,
5244,
5301,
5348,
5371,
5409,
5446,
5514,
5561,
5593,
5631,
5697,
5753,
5754,
5755,
5794,
5810,
5863,
5864,
5937,
6018,
6066,
6086,
6118,
6138,
6144,
6145,
6183,
6253,
6309,
6310,
6337,
6338,
6354,
6386,
6387,
6460,
6541,
6589,
6609,
6641,
6642,
6662,
6668,
6669,
6706,
6784,
6855,
6885,
6886,
6946,
6997,
7005,
7006,
7084,
7108,
7141,
7142,
7217,
7241,
7271,
7272,
7326,
7356,
7362,
7363,
7424,
7452,
7489,
7509,
7550,
7556,
7557,
7637,
7668,
7676,
7703,
7723,
7764,
7790,
7825,
7871,
7903,
7924,
7959,
8008,
8040,
8066,
8101,
8150,
8177,
8187,
8195,
8215,
8221,
8222,
8223,
8254,
8307,
8351,
8401,
8445,
8482,
8524,
8563,
8600,
8637,
8680,
8719,
8760,
8801,
8842,
8883,
8928,
8973,
9016,
9052,
9101,
9139,
9177,
9235,
9291,
9347,
9414,
9452,
9494,
9551,
9589,
9629,
9672,
9721,
9763,
9805,
9847,
9886,
9945,
10014,
10064,
10065,
10103,
10168,
10224,
10297,
10335,
10417,
10463,
10464,
10502,
10524,
10557,
10577,
10592,
10636,
10658,
10666,
10672,
10673,
10710,
10734,
10774,
10780,
10781,
10782,
10862,
10942,
10986,
11035,
11098,
11163,
11194,
11216,
11238,
11260,
11282,
11303,
11309,
11310,
11377,
11439,
11470,
11492,
11513,
11535,
11556,
11562,
11567,
11568,
11593,
11650,
11679,
11680,
11681,
11758,
11781,
11838,
11866,
11927,
11959,
12024,
12060,
12129,
12169,
12242,
12243,
12244,
12295,
12328,
12365,
12403,
12444,
12479,
12541,
12622,
12638,
12639,
12698,
12765,
12768,
12832,
12901,
12902,
12936,
12989,
13051,
13119,
13123,
13125,
13126,
13183,
13212,
13290,
13360,
13396,
13407,
13474,
13515,
13580,
13584,
13585,
13609,
13611,
13612,
13663,
13696,
13743,
13807,
13838,
13910,
13964,
14021,
14024,
14068,
14138,
14199,
14248,
14326,
14344,
14348,
14351,
14375,
14377,
14378,
14438,
14440,
14441,
14521,
14596,
14675,
14720,
14752,
14764,
14765,
14788,
14842,
14918,
14970,
14981,
15033,
15111,
15161,
15165,
15166,
15189,
15256,
15320,
15370,
15449,
15453,
15454,
15514,
15562,
15618,
15620,
15621,
15698,
15743,
15802,
15866,
15919,
15933,
15945,
15946,
15970,
15971,
16032,
16079,
16080,
16137,
16138,
16172,
16247,
16269,
16275,
16276,
16315,
16385,
16391,
16395,
16397,
16398,
16447,
16450,
16494,
16525,
16573,
16608,
16609,
16650,
16727,
16746,
16797,
16842,
16902,
16903,
16973,
17023,
17024,
17075,
17076,
17096,
17124,
17197,
17248,
17249,
17281,
17319,
17320,
17401,
17433,
17444,
17455,
17478,
17489,
17515,
17541,
17575,
17602,
17673,
17684,
17688,
17691,
17772,
17790,
17856,
17883,
17932,
18001,
18038,
18090,
18136,
18211,
18216,
18217,
18244,
18309,
18349,
18415,
18426,
18505,
18547,
18580,
18631,
18688,
18693,
18721,
18765,
18815,
18890,
18894,
18896,
18897,
18898,
18964,
18967,
19016,
19044,
19045,
19093,
19170,
19171,
19251,
19260,
19294,
19365,
19424,
19467,
19484,
19565,
19566,
19622,
19669,
19749,
19798,
19856,
19931,
19973,
19974,
20035,
20057,
20107,
20179,
20244,
20311,
20358,
20359,
20420,
20493,
20574,
20600,
20611,
20678,
20734,
20813,
20880,
20935,
20936,
21013,
21036,
21081,
21148,
21192,
21200,
21206,
21210,
21212,
21213,
21269,
21340,
21388,
21466,
21489,
21491,
21492,
21541,
21586,
21618,
21666,
21742,
21796,
21803,
21866,
21925,
21987,
21988,
22063,
22083,
22110,
22112,
22113,
22162,
22238,
22288,
22343,
22401,
22456,
22533,
22534,
22561,
22563,
22564,
22613,
22669,
22724,
22797,
22857,
22913,
22989,
23013,
23015,
23016,
23017,
23097,
23138,
23142,
23188,
23267,
23269,
23270,
23316,
23358,
23408,
23444,
23445,
23507,
23564,
23623,
23624,
23693,
23760,
23828,
23829,
23852,
23854,
23855,
23899,
23941,
23991,
24027,
24028,
24090,
24158,
24227,
24284,
24343,
24344,
24411,
24412,
24435,
24437,
24438,
24482,
24524,
24574,
24610,
24611,
24673,
24730,
24789,
24790,
24858,
24927,
24994,
24995,
25018,
25020,
25021,
25071,
25113,
25163,
25199,
25261,
25318,
25377,
25378,
25449,
25521,
25591,
25592,
25615,
25617,
25618,
25664,
25706,
25756,
25792,
25793,
25855,
25912,
25971,
25972,
26041,
26111,
26181,
26182,
26205,
26207,
26208,
26256,
26298,
26348,
26384,
26385,
26441,
26498,
26499,
26587,
26679,
26760,
26761,
26785,
26886,
26952,
26953,
26976,
26978,
26979,
27027,
27069,
27119,
27155,
27156,
27212,
27269,
27270,
27358,
27450,
27531,
27532,
27556,
27657,
27723,
27724,
27747,
27749,
27750,
27798,
27840,
27890,
27926,
27927,
27983,
28040,
28041,
28129,
28209,
28302,
28303,
28327,
28428,
28494,
28495,
28518,
28520,
28521,
28569,
28611,
28661,
28697,
28698,
28754,
28811,
28812,
28900,
28980,
29073,
29074,
29098,
29199,
29265,
29266,
29289,
29291,
29292,
29344,
29386,
29436,
29472,
29473,
29548,
29620,
29621,
29644,
29646,
29647,
29699,
29741,
29791,
29827,
29828,
29902,
29979,
29980,
30003,
30005,
30006,
30056,
30098,
30148,
30184,
30185,
30247,
30304,
30363,
30364,
30428,
30492,
30556,
30630,
30711,
30712,
30735,
30737,
30738,
30796,
30800,
30843,
30924,
30999,
31076,
31132,
31178,
31231,
31289,
31321,
31322,
31400,
31413,
31480,
31543,
31619,
31620,
31699,
31700,
31724,
31726,
31727,
31772,
31812,
31813,
31873,
31925,
32004,
32057,
32123,
32124,
32196,
32197,
32263,
32286,
32336,
32415,
32422,
32472,
32548,
32549,
32619,
32680,
32746,
32816,
32873,
32874,
32926,
32927,
32947,
32975,
33043,
33092,
33093,
33122,
33160,
33161,
33193,
33238,
33318,
33367,
33368,
33437,
33438,
33500,
33580,
33643,
33649,
33650,
33674,
33676,
33677,
33722,
33745,
33746,
33792,
33855,
33897,
33901,
33903,
33904,
33953,
33976,
33978,
33979,
34058,
34080,
34084,
34140,
34208,
34287,
34288,
34315,
34387,
34412,
34436,
34461,
34501,
34547,
34623,
34692,
34747,
34825,
34842,
34853,
34878,
34904,
34930,
34968,
35025,
35080,
35144,
35167,
35178,
35240,
35295,
35376,
35393,
35467,
35509,
35589,
35600,
35604,
35605,
35628,
35630,
35631,
35676,
35723,
35774,
35825,
35851,
35930,
35978,
36035,
36097,
36121,
36123,
36124,
36169,
36216,
36267,
36318,
36344,
36423,
36471,
36507,
36569,
36593,
36595,
36596,
36661,
36725,
36790,
36842,
36866,
36868,
36869,
36932,
36995,
37058,
37122,
37173,
37197,
37199,
37200,
37263,
37344,
37408,
37459,
37514,
37588,
37591,
37627,
37706,
37772,
37825,
37875,
37934,
37940,
37951,
38001,
38059,
38116,
38120,
38123,
38147,
38149,
38150,
38214,
38278,
38299,
38367,
38438,
38502,
38547,
38617,
38681,
38706,
38708,
38709,
38754,
38775,
38845,
38877,
38956,
38980,
38982,
38983,
39030,
39051,
39121,
39168,
39248,
39272,
39274,
39275,
39332,
39373,
39412,
39485,
39509,
39511,
39512,
39513,
39580,
39584,
39634,
39668,
39731,
39732,
39813,
39880,
39905,
39939,
40008,
40076,
40080,
40081,
40132,
40187,
40256,
40257,
40335,
40352,
40426,
40483,
40484,
40554,
40628,
40662,
40726,
40751,
40831,
40849,
40897,
40975,
41028,
41032,
41033,
41095,
41167,
41168,
41239,
41260,
41320,
41389,
41392,
41453,
41534,
41550,
41615,
41678,
41758,
41777,
41852,
41904,
41974,
42046,
42099,
42167,
42242,
42321,
42340,
42415,
42460,
42461,
42521,
42551,
42631,
42667,
42724,
42765,
42776,
42826,
42902,
42929,
42940,
43015,
43095,
43167,
43245,
43315,
43365,
43435,
43512,
43593,
43615,
43644,
43697,
43745,
43809,
43838,
43851,
43930,
44004,
44078,
44101,
44128,
44187,
44246,
44324,
44354,
44379,
44397,
44413,
44427,
44453,
44532,
44557,
44569,
44605,
44685,
44720,
44768,
44841,
44911,
44921,
44922,
44989,
45035,
45106,
45174,
45189,
45268,
45347,
45413,
45463,
45538,
45606,
45614,
45664,
45730,
45794,
45800,
45804,
45835,
45837,
45838,
45918,
45922,
45998,
46039,
46118,
46133,
46136,
46167,
46198,
46228,
46231,
46247,
46258,
46269,
46295,
46322,
46350,
46411,
46465,
46472,
46492,
46507,
46522,
46552,
46609,
46670,
46724,
46784,
46817,
46888,
46957,
47006,
47076,
47091,
47122,
47176,
47238,
47292,
47354,
47411,
47474,
47489,
47519,
47573,
47635,
47692,
47755,
47770,
47778,
47785,
47844,
47920,
47940,
47953,
47988,
48067,
48144,
48162,
48173,
48177,
48179,
48180,
48254,
48332,
48361,
48419,
48472,
48535,
48549,
48572,
48575,
48625,
48628,
48707,
48778,
48817,
48839,
48840,
48900,
48978,
48990,
48994,
48995,
49038,
49091,
49143,
49144,
49186,
49214,
49275,
49288,
49294,
49295,
49315,
49335,
49368,
49377,
49416,
49417,
49443,
49471,
49531,
49568,
49607,
49613,
49618,
49641,
49664,
49688,
49730,
49809,
49857,
49874,
49884,
49899,
49947,
50026,
50097,
50114,
50124,
50132,
50166,
50199,
50223,
50277,
50323,
50336,
50413,
50459,
50474,
50482,
50548,
50569,
50592,
50633,
50673,
50728,
50748,
50811,
50842,
50891,
50966,
50983,
50991,
51025,
51064,
51088,
51142,
51194,
51207,
51284,
51336,
51351,
51359,
51380,
51403,
51444,
51511,
51545,
51580,
51604,
51660,
51724,
51737,
51816,
51880,
51895,
51903,
51939,
52018,
52089,
52167,
52191,
52206,
52214,
52268,
52335,
52378,
52393,
52401,
52457,
52479,
52553,
52564,
52645,
52658,
52688,
52710,
52765,
52818,
52829,
52907,
52960,
52966,
52970,
52971,
52985,
52986,
53064,
53142,
53221,
53297,
53374,
53399,
53445,
53484,
53551,
53628,
53664,
53668,
53670,
53671,
53672,
53753,
53805,
53886,
53887,
53964,
53995,
53997,
53998,
53999,
54026,
54109,
54151,
54219,
54220,
54290,
54328,
54342,
54356,
54376,
54378,
54379,
54454,
54496,
54500,
54577,
54627,
54645,
54683,
54696,
54718,
54721,
54751,
54783,
54803,
54805,
54806,
54819,
54820,
54863
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 54863,
"ccnet_original_nlines": 1430,
"rps_doc_curly_bracket": 0.005358799826353788,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.14776350557804108,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07524824887514114,
"rps_doc_frac_lines_end_with_ellipsis": 0.006289309822022915,
"rps_doc_frac_no_alph_words": 0.43381616473197937,
"rps_doc_frac_unique_words": 0.2546960115432739,
"rps_doc_mean_word_length": 6.9577860832214355,
"rps_doc_num_sentences": 560,
"rps_doc_symbol_to_word_ratio": 0.006012570112943649,
"rps_doc_unigram_entropy": 6.05965518951416,
"rps_doc_word_count": 4951,
"rps_doc_frac_chars_dupe_10grams": 0.11094983667135239,
"rps_doc_frac_chars_dupe_5grams": 0.22901183366775513,
"rps_doc_frac_chars_dupe_6grams": 0.19777636229991913,
"rps_doc_frac_chars_dupe_7grams": 0.16816650331020355,
"rps_doc_frac_chars_dupe_8grams": 0.15876102447509766,
"rps_doc_frac_chars_dupe_9grams": 0.13112516701221466,
"rps_doc_frac_chars_top_2gram": 0.009666739962995052,
"rps_doc_frac_chars_top_3gram": 0.0010450499830767512,
"rps_doc_frac_chars_top_4gram": 0.00452856021001935,
"rps_doc_books_importance": -4447.83837890625,
"rps_doc_books_importance_length_correction": -4447.83837890625,
"rps_doc_openwebtext_importance": -2698.2919921875,
"rps_doc_openwebtext_importance_length_correction": -2698.2919921875,
"rps_doc_wikipedia_importance": -1839.073486328125,
"rps_doc_wikipedia_importance_length_correction": -1839.073486328125
},
"fasttext": {
"dclm": 0.48037058115005493,
"english": 0.36733296513557434,
"fineweb_edu_approx": 2.698927164077759,
"eai_general_math": 0.9519081711769104,
"eai_open_web_math": 0.14977556467056274,
"eai_web_code": 0.8917756080627441
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-1,053,456,384,896,026,900 |
JSP/Servlet | 서블릿과 JSP/HTML | 응용 프로그램에 값을 저장
HttpServletRequest와 HttpSession은 이용 가능한 범위(scope라고 한다)가 다르다. HttpServletRequest는 현재 요청이 있는 동안만 존재한다. HttpSession은 세션이 연결되어 있는 동안 항상 존재한다. 이 두가지를 사용 구분하여 “어느 범위에서 값을 저장하고 계속되는지"를 생각해서 데이터 보존이 가능하다.
사실은 이 외에도 값을 저장할 수 있는 또 다른 것이 있다. 그것은 “ServletContext"라는 것이다. 이것은이 Web 어플리케이션 자체를 관리하는 클래스이다. 여기에 보관된 값이 Web 응용 프로그램이 있는 동안에 계속 보관하여 유지한다.
여기서 중요한 것은 “이것은 1개 밖에 없다"는 점이다. HttpServletRequest와 HttpSession는 액세스하는 클라이언트마다 준비된다. 즉, 동시에 여러 사람이 사용하더라도 각각 다른 개체가 준비되어 개별적으로 값이 저장된다.
그런데 ServletContext는 Web 응용 프로그램에 하나 밖에 존재하지 않는다. 이는 누가 접근해도 모두 같은 인스턴스에 액세스한다는 것이다. 즉, 거기에 저장된 값은 누가 접근하더라도 같은 것이 얻게 된다는 것이다.
이를 이용하면 “모두가 공유할 수 있는 데이터"를 쉽게 가질 수 있다. 실제로 해보도록 하자.
hello.jsp
<%@ page language="java" contentType="text/html; charset=utf-8"
pageEncoding="utf-8"%>
<%@ page import="java.util.ArrayList" %>
<!DOCTYPE html>
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
<title>Sample jsp</title>
<style>
h1{
font-size: 16pt;
background: #AAFFAA;
padding: 5px;
}
table tr td {
background: #DDFFDD;
padding: 2px;
}
</style>
</head>
<body>
<h1>Hello App Engine!</h1>
<hr>
<p id="msg">메시지：</p>
<form method="post" action="/mygaeapp">
<table>
<tr>
<td>입력</td>
<td><input type="text" id="input" name="text1"></td>
</tr>
<tr>
<td></td>
<td><input type="submit" value="전송"></td>
</tr>
</table>
</form>
<hr>
<table>
<%
ArrayList<String> datas = (ArrayList<String>)application.getAttribute("datas");
if (datas != null){
for(String str : datas){
out.println("<tr><td>" + str + "</td></tr>");
}
}
%>
</table>
</body>
</html>
MyGaeAppServlet.java
package com.devkuma.mygaeapp;
import java.io.*;
import java.util.ArrayList;
import javax.servlet.ServletContext;
import javax.servlet.http.*;
@SuppressWarnings("serial")
public class MyGaeAppServlet5 extends HttpServlet {
public void doGet(HttpServletRequest request, HttpServletResponse response) throws IOException {
response.setContentType("text/plain");
request.setCharacterEncoding("utf8");
response.setCharacterEncoding("utf8");
PrintWriter out = response.getWriter();
out.println("Hello, world!");
}
public void doPost(HttpServletRequest request, HttpServletResponse response) throws IOException {
response.setContentType("text/html");
request.setCharacterEncoding("utf8");
response.setCharacterEncoding("utf8");
String param = request.getParameter("text1");
ServletContext application = this.getServletContext();
ArrayList<String> datas = (ArrayList<String>) application.getAttribute("datas");
if (datas == null) {
datas = new ArrayList<String>();
}
datas.add(param);
application.setAttribute("datas", datas);
response.sendRedirect("/hello.jsp");
}
}
위에 예제는 전송된 메시지를 ArrayList에 보관한다. 이곳 저곳의 PC에서 액세스하여 메시지를 입력해서 전송해 보자. 모두가 입력한 모든 데이터가 저장되며, 모든 브라우저에 동일한 데이터가 표시되는 것을 알 수 있을 것이다.
ServletContext는 서블릿에서 this에 준비되어 있는 메소드를 호출해 가져온다.
ServletContext application = this.getServletContext();
JSP는 더 간단하다. “application"라는 암묵적 개체로 준비되어 있기 때문에, 그것을 그대로 사용하면 된다.
이 ServletContext에도 역시 “setAttribute”, “getAttribute"라는 메소드가 준비되어 있으며, 값을 저장하고 얻어올 수 있다. 사용법은 HttpServletRequest 등과 완전 동일하다.
이 “HttpServletRequest”, “HttpSession”, “ServletContext"의 3개의 클래스를 구분하여 다양한 형태로 값을 저장할 수 있다. 서블릿과 JSP에서 필요한 값을 주고 받을 때, 이것들은 매우 중요하다. 이 3개는 세트로 기억해 두도록 하자.
|
{
"url": "https://www.devkuma.com/docs/jsp-servlet/%EC%9D%91%EC%9A%A9-%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%A8%EC%97%90-%EA%B0%92%EC%9D%84-%EC%A0%80%EC%9E%A5/",
"source_domain": "www.devkuma.com",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "432466",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WPRLNJKK2SWEHZCTAOJHEZOKQHFJWROH",
"WARC-Concurrent-To": "<urn:uuid:a71746c5-2627-42ff-b95f-23954e46bee8>",
"WARC-Date": "2022-06-26T05:26:19Z",
"WARC-IP-Address": "185.199.111.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3VYDF7Q7SWVU4LJU6BDNUVOY33EGE3VS",
"WARC-Record-ID": "<urn:uuid:a3cc9943-0c8c-4446-9a0b-bad1c102e6b9>",
"WARC-Target-URI": "https://www.devkuma.com/docs/jsp-servlet/%EC%9D%91%EC%9A%A9-%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%A8%EC%97%90-%EA%B0%92%EC%9D%84-%EC%A0%80%EC%9E%A5/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0491cdb2-9d4c-440b-b21b-d97f41574f54>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-143\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
45,
46,
47,
244,
245,
384,
385,
521,
522,
648,
649,
702,
703,
713,
714,
778,
809,
850,
866,
873,
880,
948,
974,
982,
986,
1007,
1032,
1050,
1052,
1066,
1091,
1109,
1111,
1120,
1128,
1135,
1166,
1175,
1200,
1244,
1256,
1269,
1293,
1358,
1372,
1385,
1407,
1461,
1475,
1488,
1500,
1509,
1521,
1528,
1612,
1636,
1669,
1727,
1737,
1743,
1750,
1763,
1771,
1779,
1780,
1801,
1802,
1832,
1833,
1851,
1879,
1880,
1917,
1946,
1947,
1975,
2027,
2028,
2129,
2176,
2222,
2269,
2317,
2355,
2361,
2362,
2464,
2510,
2556,
2603,
2657,
2720,
2809,
2838,
2883,
2893,
2919,
2969,
3014,
3020,
3022,
3023,
3152,
3153,
3204,
3205,
3260,
3261,
3328,
3329,
3453,
3454
],
"line_end_idx": [
45,
46,
47,
244,
245,
384,
385,
521,
522,
648,
649,
702,
703,
713,
714,
778,
809,
850,
866,
873,
880,
948,
974,
982,
986,
1007,
1032,
1050,
1052,
1066,
1091,
1109,
1111,
1120,
1128,
1135,
1166,
1175,
1200,
1244,
1256,
1269,
1293,
1358,
1372,
1385,
1407,
1461,
1475,
1488,
1500,
1509,
1521,
1528,
1612,
1636,
1669,
1727,
1737,
1743,
1750,
1763,
1771,
1779,
1780,
1801,
1802,
1832,
1833,
1851,
1879,
1880,
1917,
1946,
1947,
1975,
2027,
2028,
2129,
2176,
2222,
2269,
2317,
2355,
2361,
2362,
2464,
2510,
2556,
2603,
2657,
2720,
2809,
2838,
2883,
2893,
2919,
2969,
3014,
3020,
3022,
3023,
3152,
3153,
3204,
3205,
3260,
3261,
3328,
3329,
3453,
3454,
3608
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3608,
"ccnet_original_nlines": 112,
"rps_doc_curly_bracket": 0.004434590227901936,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.020075280219316483,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01129234954714775,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6675031185150146,
"rps_doc_frac_unique_words": 0.7368420958518982,
"rps_doc_mean_word_length": 8.692105293273926,
"rps_doc_num_sentences": 64,
"rps_doc_symbol_to_word_ratio": 0.0025094100274145603,
"rps_doc_unigram_entropy": 5.487748146057129,
"rps_doc_word_count": 380,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.030881019309163094,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.006357859820127487,
"rps_doc_frac_chars_top_3gram": 0.009688160382211208,
"rps_doc_frac_chars_top_4gram": 0.024220410734415054,
"rps_doc_books_importance": -388.0853576660156,
"rps_doc_books_importance_length_correction": -388.0853576660156,
"rps_doc_openwebtext_importance": -230.80978393554688,
"rps_doc_openwebtext_importance_length_correction": -230.80978393554688,
"rps_doc_wikipedia_importance": -146.091552734375,
"rps_doc_wikipedia_importance_length_correction": -146.091552734375
},
"fasttext": {
"dclm": 0.9885898232460022,
"english": 0.005394029896706343,
"fineweb_edu_approx": 2.569441318511963,
"eai_general_math": 0.004319069907069206,
"eai_open_web_math": 0.01562022976577282,
"eai_web_code": 0.5509815812110901
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.13",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-4,699,429,738,125,756,000 |
How do you feel about people on Instagram, TikTok and other similar social networks?
How do you feel about people on Instagram, TikTok and other similar social networks?
They Web Scraped 235 MILLION YouTube, Instagram and TikTok Accounts and Left their Database Exposed
Previous questionI want to shoot videos for YouTube, but I can't choose a subject. Where to start and how?
Next questionHow to promote a YouTube channel?
answers (2)
Answer 1
May, 2021
Such people are called "sociobl * dyami". When they do not understand why they beg for stupid likes, subscribe to all sorts of skins on Instagram, force their acquaintances to subscribe to their Instagram that nobody needs. On Instagram, in general, most of the girls are botox tanned stuffed animals, on which only a dead cattle stand, which in life has seen only fat ones, as they are called - "women".
I generally condemn such a craving for the distribution of their semi-intimate photos for everyone to see. Especially if your girlfriend is a fan of Instagram, then she has a tendency to cheat, because she thinks in the image: "as many people as possible should see my beauty until I grow old. Or maybe not only see ..." (As they say: for now young - ride all the x * pax, there will be something to remember).
Tik Tok and others are generally a separate caste of underdeveloped personalities. I never went there (I never regret it), but sometimes a Tik-tok advertisement is played on YouTube in the form of one short video of one of the users of this monkey house, and so, judging by these mini videos, there is such a beaten off target audience, with terrible humor, "mainstream" behavior, ugh bl ....
Although the above does not apply to Instagram users who post something neutral there, for example, veterinarians post photos of their animal patients, or some carpenters and others the wizards show how and how - there are no complaints about these at all.
Answer 2
May, 2021
You can sit in different ways.
Someone makes money there, for someone it’s work, for others it’s a way to promote their products.
Or, as my friend, just takes pictures or draws and puts her creations there.
She does not sit for hours, does not like other people's photos for days, she just did the job - and exhibited.
Of course, there are completely unique personalities who are not they do nothing productive there at all.
spend hours looking at someone else's life, for some reason trying to collect more likes but don't do anything about it, follow other people fanatically, and so on.
This is common senseless contemplation, like watching TV for days, only instead of it - instagram.
Well .. I usually don't intersect with such people. we have nothing in common.
They will be bored with me, and I - with them.
Related question
How do you feel about social networks? Your verdict🤔?
Read more
How do you feel about the real deadlines for thought crimes, pictures on social networks, likes and reposts?
Read more
How to stop being curious and visiting other people's pages on social networks? It seems that other people are more successful, better.
Read more
THE WALKING DEAD Season 10 Ending Explained Breakdown | Full Episode 16 Finale Review & Predictions
Do you believe in what the people around you are presented to you on social networks?
Read more
"I am depressed. You will not understand me" Why do young people choose to suffer from mental disorders and shout about it on all social networks?
Read more
How do you look on different social networks?
Singer Dolly Parton launched a flash mob in which different stars post collages as they represent themselves on different social networks. What would your photo collage look like, for example, on FB, VK, Linkedin, Tinder and Instagram?
Read more
Why do people themselves like their posts and comments on social networks?
Read more
How do they find a profile on Instagram, if it is not tied to other social networks, the name is not specified, there is no avatar and mutual acquaintances? (Only the phone number is known)?
Read more
People Caught Lying On Social Media
What is wrong with the psyche of people who insult other users on social networks for no apparent reason?
Read more
Is life now possible without social services? networks? And such people remained? How do they live?
Read more
Does sitting on social networks (Instagram, VK, etc.) dull a person?
Read more
How do you feel about people being blacklisted?
Read more
Are there young (!) People who do not use social networks / rarely use? How do you do it?
Read more
Instagram, Snapchat, and TikTok Social Media Mental Health Initiatives. Are They Enough?
Why do young people kiss statues and then post it on social media? networks? Reminiscent of the story of Pygmalion.
Read more
Everyone has things that, for various reasons, do not want to share on social networks. What would you not write about on Facebook and why?
Read more
How has your opinion about society and people changed after reading their answers on this and similar sites?
Read more
How do current kids feel about social media?
Read more
What can you learn about a person from likes on social networks?
Read more
Instagram REELS vs TikTok...WTH Is The Difference For Creators?!
Do you consider the amount of time they spend on social networks to be a serious problem for young people?
Read more
How do you feel about paid services on free sites that allow you to go over the heads of other users and jump ahead of the line?
Read more
|
{
"url": "https://raywebart.com/q/3-how-do-you-feel-about-people-on-instagram-tiktok-and-other-similar-social-networks",
"source_domain": "raywebart.com",
"snapshot_id": "crawl=CC-MAIN-2021-21",
"warc_metadata": {
"Content-Length": "29786",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DSM5UXMTYUONX43YTVKS5JMR4X3ZK2MR",
"WARC-Concurrent-To": "<urn:uuid:7d63ef54-5436-42dd-a413-893959fc1feb>",
"WARC-Date": "2021-05-09T02:30:40Z",
"WARC-IP-Address": "172.67.154.154",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:37SRZPURZGQ64TKASMOS5POBXOHH4P65",
"WARC-Record-ID": "<urn:uuid:4309ed61-35c4-476d-9573-81c1b73c4098>",
"WARC-Target-URI": "https://raywebart.com/q/3-how-do-you-feel-about-people-on-instagram-tiktok-and-other-similar-social-networks",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e56cf2b5-da9c-41b7-9292-56b9457a026a>"
},
"warc_info": "isPartOf: CC-MAIN-2021-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-204.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
85,
86,
171,
172,
272,
273,
380,
427,
428,
440,
441,
450,
460,
461,
866,
867,
1278,
1279,
1672,
1673,
1930,
1931,
1940,
1950,
1951,
1982,
1983,
2082,
2083,
2160,
2161,
2273,
2274,
2380,
2381,
2546,
2547,
2646,
2647,
2726,
2773,
2774,
2791,
2792,
2846,
2847,
2857,
2858,
2967,
2968,
2978,
2979,
3115,
3116,
3126,
3127,
3227,
3228,
3314,
3315,
3325,
3326,
3473,
3474,
3484,
3485,
3531,
3532,
3768,
3769,
3779,
3780,
3855,
3856,
3866,
3867,
4058,
4059,
4069,
4070,
4106,
4107,
4213,
4214,
4224,
4225,
4325,
4326,
4336,
4337,
4406,
4407,
4417,
4418,
4466,
4467,
4477,
4478,
4568,
4569,
4579,
4580,
4669,
4670,
4786,
4787,
4797,
4798,
4938,
4939,
4949,
4950,
5059,
5060,
5070,
5071,
5116,
5117,
5127,
5128,
5193,
5194,
5204,
5205,
5270,
5271,
5378,
5379,
5389,
5390,
5519,
5520
],
"line_end_idx": [
85,
86,
171,
172,
272,
273,
380,
427,
428,
440,
441,
450,
460,
461,
866,
867,
1278,
1279,
1672,
1673,
1930,
1931,
1940,
1950,
1951,
1982,
1983,
2082,
2083,
2160,
2161,
2273,
2274,
2380,
2381,
2546,
2547,
2646,
2647,
2726,
2773,
2774,
2791,
2792,
2846,
2847,
2857,
2858,
2967,
2968,
2978,
2979,
3115,
3116,
3126,
3127,
3227,
3228,
3314,
3315,
3325,
3326,
3473,
3474,
3484,
3485,
3531,
3532,
3768,
3769,
3779,
3780,
3855,
3856,
3866,
3867,
4058,
4059,
4069,
4070,
4106,
4107,
4213,
4214,
4224,
4225,
4325,
4326,
4336,
4337,
4406,
4407,
4417,
4418,
4466,
4467,
4477,
4478,
4568,
4569,
4579,
4580,
4669,
4670,
4786,
4787,
4797,
4798,
4938,
4939,
4949,
4950,
5059,
5060,
5070,
5071,
5116,
5117,
5127,
5128,
5193,
5194,
5204,
5205,
5270,
5271,
5378,
5379,
5389,
5390,
5519,
5520,
5529
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5529,
"ccnet_original_nlines": 132,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4354110062122345,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016260160133242607,
"rps_doc_frac_lines_end_with_ellipsis": 0.007518799975514412,
"rps_doc_frac_no_alph_words": 0.1490514874458313,
"rps_doc_frac_unique_words": 0.402555912733078,
"rps_doc_mean_word_length": 4.62087345123291,
"rps_doc_num_sentences": 66,
"rps_doc_symbol_to_word_ratio": 0.002710029948502779,
"rps_doc_unigram_entropy": 5.275231838226318,
"rps_doc_word_count": 939,
"rps_doc_frac_chars_dupe_10grams": 0.031804561614990234,
"rps_doc_frac_chars_dupe_5grams": 0.0790504664182663,
"rps_doc_frac_chars_dupe_6grams": 0.06291771680116653,
"rps_doc_frac_chars_dupe_7grams": 0.04908965155482292,
"rps_doc_frac_chars_dupe_8grams": 0.031804561614990234,
"rps_doc_frac_chars_dupe_9grams": 0.031804561614990234,
"rps_doc_frac_chars_top_2gram": 0.036874860525131226,
"rps_doc_frac_chars_top_3gram": 0.033187370747327805,
"rps_doc_frac_chars_top_4gram": 0.0165936890989542,
"rps_doc_books_importance": -481.5060729980469,
"rps_doc_books_importance_length_correction": -481.5060729980469,
"rps_doc_openwebtext_importance": -268.5292053222656,
"rps_doc_openwebtext_importance_length_correction": -268.5292053222656,
"rps_doc_wikipedia_importance": -237.6599884033203,
"rps_doc_wikipedia_importance_length_correction": -237.6599884033203
},
"fasttext": {
"dclm": 0.29228919744491577,
"english": 0.9535457491874695,
"fineweb_edu_approx": 1.8615493774414062,
"eai_general_math": 0.00456578005105257,
"eai_open_web_math": 0.1069921925663948,
"eai_web_code": 0.0003193599986843765
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "303.483",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social sciences — Dictionaries"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
1,603,814,367,578,226,000 |
1
$\begingroup$
I want to solve this 2nd order ODE with two initial conditions close to the origin (one to the function and the other to its derivative) and more two similar conditions for an endpoint.
c = 0.5;
rzer = 0.001;
rmax = 10.000;
vmax = 0.550718236126181`;
dmax = -0.032852103365844154`;
shc0 =
NDSolve[
{y''[r] + (1.` Csch[1.` r] - 1.25` Tanh[0.5` r]^2) y'[r] +
(-0.00048828125` Csch[0.5` r]^2 Sech[0.5` r]^4
(14.` + 139.` Cosh[1.` r] - 30.` Cosh[2.` r] + 5.` Cosh[3.` r] +
32.` Sinh[1.` r] - 16.` Sinh[2.` r])) y[r] == 0,
y[rzer] == rzer, y'[rzer] == rzer, y[rmax] == vmax, y'[rmax] == dmax},
y[r], {r, rzer, rmax}]
But Mathematica 10 returns the message:
NDSolve::nlnum1 The function value {-0.001,-0.001,-0.550718,0.0328521} is not a list of numbers with dimensions {2} when the arguments are {0.,0.,0.,0.,0.,0.}.
My code only returns solutions when two values are fixed. Is there no way to solve this with the default method?
The aim of this problem was find a solution with these initial conditions (y'(0)=y(0)=0) that connects smoothly (preserves the slope) with an exponentially decreasing solution asymptotically, so have a finite integration in the interval with value greater that precision rzer (0.001).
I suppose that is not possible obtain a solution that satisfies all conditions imposed.
enter image description here
Thanks again.
$\endgroup$
1
$\begingroup$
The limit of two boundary conditions is not imposed by Mathematica. Rather, it is intrinsic to solving 2nd order ODEs. So, the number of boundary conditions must be reduced to two. Begin with the boundary condition at large r. According to the figure in the question, the solution should go asymptotically to zero there. The expression in the question, with numbers rationalized, is
eq = y''[r] + (Csch[ r] - 5/4 Tanh[r/2]^2) y'[r] + (-1/2048 Csch[r/2]^2 Sech[r/2]^4
(14 + 139 Cosh[r] - 30 Cosh[2 r] + 5 Cosh[3 r] + 32 Sinh[r] - 16 Sinh[2 r])) y[r];
With
rzer = 1/1000; rmax = 30;
the coefficients in eq can be plotted as
Plot[Evaluate[Coefficient[eq, #] & /@ {y''[r], y'[r], y[r]}], {r, rzer, rmax}]
enter image description here
Because the coefficients become constant asymptotically, the ODE easily is solved for large r.
coef = Limit[Coefficient[eq, #], r -> Infinity] & /@ {y''[r], y'[r], y[r]}
(* {1, -(5/4), -(5/64)} *)
DSolve[coef.{y''[r], y'[r], y[r]} == 0, y[r], r]
(* {{y[r] -> E^((5/8 - Sqrt[15/2]/4) r) C[1] + E^((5/8 + Sqrt[15/2]/4) r) C[2]}} *)
Clearly, the exponentially decaying solution is desired. Obtain its decay rate.
exp = Cases[%, Exp[z_] -> z/r, {0, Infinity}][[1]]
(* 5/8 - Sqrt[15/2]/4 *)
The boundary condition that fits the numerical solution at small r to the asymptotic solution is
y'[rmax] - exp y[rmax] == 0
Because the ODE is singular at the origin, a plausible boundary condition at rzer is that suggested by the OP
y[rzer] == rzer
With these boundary conditions,
s = First@NDSolve[{eq == 0, y[rzer] == rzer, y'[rmax] == exp y[rmax]},
y, {r, rzer, rmax}, WorkingPrecision -> 45];
Plot[y[r] /. s, {r, rzer, rmax}, PlotRange -> All, AxesLabel -> {r, y}]
enter image description here
Addendum
Expanding the ODE at r == 0,
Series[eq, {r, 0, 1}] // Normal
(* - y[0]/(4*r^2) + (3*Derivative[1][y][0])/(4*r) + (y[0]/12 + 15*Derivative[2][y][0]/8) +
(r*(3*y[0] - 8*Derivative[1][y][0] + 140*Derivative[3][y][0]))/96 *)
shows that not only the ODE but also its solution is singular at the origin. For that reason, it might make more sense to use
vmax = Rationalize[0.550718236126181, 0];
y[10] = vmax
as the second boundary condition. Then, with rmax increased to 50.
s = First@NDSolve[{eq == 0, y[10] == vmax, y'[rmax] - exp y[rmax] == 0},
y, {r, rzer, rmax}, WorkingPrecision -> 55, MaxSteps -> 100000];
Plot[y[r] /. s, {r, rzer, rmax}, AxesLabel -> {r, y}]
enter image description here
This second solution is not better than the first in this answer, just rescaled. Note that further increasing rmax requires that WorkingPrecision also be increased, which makes the computation quite slow.
| improve this answer | |
$\endgroup$
• $\begingroup$ It is clear now, bbgodfrey. Is also required that these null conditions at origin be zero by other arguments exterior to numerical evaluation of problem. In this context, is not possible find a solution that obey the boundary conditions and that the area of its curve be non zero within the precision limit assumed to rzer. $\endgroup$ – Melina A.H Oct 11 '15 at 18:07
• $\begingroup$ @MelinaA.H You are correct that setting both y[0] == 0 and y'[0] == 0 results in y[r] -> 0. This is true of any homogeneous 2nd order ODE system that is not an eigenvalue problem. $\endgroup$ – bbgodfrey Oct 11 '15 at 18:16
2
$\begingroup$
Trying using the following code. You can use three boundary values, but notice the same solution if you substitute the fourth boundary involving y'[rmax]=dmax. To this end, one of the boundaries is redundant.
c = 0.5;
rzer = 0.001;
rmax = 10.;
vmax = 0.550718236126181;
dmax = -0.032852103365844154;
sols =
(First[
NDSolve[{Derivative[2][y][
r] + (1.*Csch[1.*r] - 1.25*Tanh[0.5*r]^2)*
Derivative[1][y][
r] + (-0.00048828125*Csch[0.5*r]^2*Sech[0.5*r]^4*
(14. + 139.*Cosh[1.*r] - 30.*Cosh[2.*r] +
5.*Cosh[3.*r] + 32.*Sinh[1.*r] - 16.*Sinh[2.*r]))*y[r] ==
0, y[rzer] == rzer, y[rmax] == vmax}, y, r,
Method -> {"Shooting",
"StartingInitialConditions" -> {y[rzer] == rzer,
Derivative[1][y][rzer] == #1}}]] & ) /@ {rzer}
Plot the output using
Plot[Evaluate[y[r] /. sols], {r, rzer, rmax}, PlotRange -> {0, 0.6}]
enter image description here
With regard to your last answer, you can consider a second region r> 10, and then just use the last boundary condition. No need to employ the shooting method:
c = 0.5; rzer = 0.001; rmax = 10.; vmax = 0.550718236126181; dmax = \
-0.032852103365844154;
sols2 =
NDSolve[{Derivative[2][y][r] + (1.*Csch[1.*r] - 1.25*Tanh[0.5*r]^2)*
Derivative[1][y][r] +
(-0.00048828125*Csch[0.5*r]^2*
Sech[0.5*r]^4*(14. + 139.*Cosh[1.*r] - 30.*Cosh[2.*r] +
5.*Cosh[3.*r] + 32.*Sinh[1.*r] - 16.*Sinh[2.*r]))*y[r] == 0,
y[rmax] == vmax, Derivative[1][y][rmax] == dmax},
y, {r, 10, 30}]
Notice that r > = 10
| improve this answer | |
$\endgroup$
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "https://mathematica.stackexchange.com/questions/96704/error-ndsolvenlnum1-from-2nd-order-ode-with-4-boundary-conditions",
"source_domain": "mathematica.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2020-34",
"warc_metadata": {
"Content-Length": "163974",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QPSQVZZ5F4CTAOMUNDOZMSG7LVSQORN7",
"WARC-Concurrent-To": "<urn:uuid:4c2dc08f-1f36-42ee-b815-5f310e8667f9>",
"WARC-Date": "2020-08-04T23:38:32Z",
"WARC-IP-Address": "151.101.1.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:B2NVSWJNBJZRYG3DKH64X4SKVFJBNPY7",
"WARC-Record-ID": "<urn:uuid:b2928bb0-b3de-447c-ac0f-1c3035a355c8>",
"WARC-Target-URI": "https://mathematica.stackexchange.com/questions/96704/error-ndsolvenlnum1-from-2nd-order-ode-with-4-boundary-conditions",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1d7f115b-6076-4ec0-81e6-7100a2e8a1f9>"
},
"warc_info": "isPartOf: CC-MAIN-2020-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-230.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
16,
17,
203,
204,
213,
227,
242,
269,
300,
301,
309,
320,
384,
438,
512,
572,
648,
675,
676,
716,
717,
877,
878,
991,
992,
1277,
1278,
1366,
1367,
1396,
1397,
1411,
1412,
1424,
1426,
1440,
1441,
1824,
1825,
1910,
1998,
1999,
2004,
2005,
2031,
2032,
2073,
2074,
2153,
2154,
2183,
2184,
2279,
2280,
2355,
2382,
2431,
2515,
2516,
2597,
2598,
2649,
2674,
2675,
2772,
2773,
2801,
2802,
2912,
2913,
2929,
2930,
2962,
2963,
3035,
3084,
3156,
3157,
3186,
3187,
3196,
3197,
3226,
3227,
3259,
3351,
3422,
3423,
3549,
3550,
3592,
3606,
3607,
3674,
3675,
3749,
3818,
3872,
3873,
3902,
3903,
4108,
4109,
4135,
4147,
4534,
4776,
4778,
4792,
4793,
5002,
5003,
5013,
5028,
5041,
5068,
5099,
5107,
5118,
5150,
5203,
5231,
5292,
5358,
5431,
5484,
5485,
5515,
5573,
5630,
5631,
5653,
5654,
5723,
5724,
5753,
5754,
5913,
5914,
5984,
6008,
6019,
6089,
6118,
6161,
6226,
6298,
6357,
6375,
6376,
6397,
6398,
6424,
6436,
6437,
6449,
6450,
6550,
6551
],
"line_end_idx": [
2,
16,
17,
203,
204,
213,
227,
242,
269,
300,
301,
309,
320,
384,
438,
512,
572,
648,
675,
676,
716,
717,
877,
878,
991,
992,
1277,
1278,
1366,
1367,
1396,
1397,
1411,
1412,
1424,
1426,
1440,
1441,
1824,
1825,
1910,
1998,
1999,
2004,
2005,
2031,
2032,
2073,
2074,
2153,
2154,
2183,
2184,
2279,
2280,
2355,
2382,
2431,
2515,
2516,
2597,
2598,
2649,
2674,
2675,
2772,
2773,
2801,
2802,
2912,
2913,
2929,
2930,
2962,
2963,
3035,
3084,
3156,
3157,
3186,
3187,
3196,
3197,
3226,
3227,
3259,
3351,
3422,
3423,
3549,
3550,
3592,
3606,
3607,
3674,
3675,
3749,
3818,
3872,
3873,
3902,
3903,
4108,
4109,
4135,
4147,
4534,
4776,
4778,
4792,
4793,
5002,
5003,
5013,
5028,
5041,
5068,
5099,
5107,
5118,
5150,
5203,
5231,
5292,
5358,
5431,
5484,
5485,
5515,
5573,
5630,
5631,
5653,
5654,
5723,
5724,
5753,
5754,
5913,
5914,
5984,
6008,
6019,
6089,
6118,
6161,
6226,
6298,
6357,
6375,
6376,
6397,
6398,
6424,
6436,
6437,
6449,
6450,
6550,
6551,
6641
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6641,
"ccnet_original_nlines": 160,
"rps_doc_curly_bracket": 0.009034779854118824,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2282722443342209,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008376959711313248,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5303664803504944,
"rps_doc_frac_unique_words": 0.4041331708431244,
"rps_doc_mean_word_length": 4.938002109527588,
"rps_doc_num_sentences": 118,
"rps_doc_symbol_to_word_ratio": 0.001570679945871234,
"rps_doc_unigram_entropy": 5.295286178588867,
"rps_doc_word_count": 871,
"rps_doc_frac_chars_dupe_10grams": 0.027900490909814835,
"rps_doc_frac_chars_dupe_5grams": 0.10532434284687042,
"rps_doc_frac_chars_dupe_6grams": 0.0725412666797638,
"rps_doc_frac_chars_dupe_7grams": 0.05254592001438141,
"rps_doc_frac_chars_dupe_8grams": 0.027900490909814835,
"rps_doc_frac_chars_dupe_9grams": 0.027900490909814835,
"rps_doc_frac_chars_top_2gram": 0.008137639611959457,
"rps_doc_frac_chars_top_3gram": 0.014647760428488255,
"rps_doc_frac_chars_top_4gram": 0.029063010588288307,
"rps_doc_books_importance": -799.473876953125,
"rps_doc_books_importance_length_correction": -799.473876953125,
"rps_doc_openwebtext_importance": -466.0969543457031,
"rps_doc_openwebtext_importance_length_correction": -466.0969543457031,
"rps_doc_wikipedia_importance": -343.63824462890625,
"rps_doc_wikipedia_importance_length_correction": -343.63824462890625
},
"fasttext": {
"dclm": 0.7088441848754883,
"english": 0.7913601994514465,
"fineweb_edu_approx": 2.1472840309143066,
"eai_general_math": 0.9027729034423828,
"eai_open_web_math": 0.2937488555908203,
"eai_web_code": 0.2500162124633789
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "515.352",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Calculus and Mathematical analysis"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
4,235,677,137,661,246,000 |
Skip links
A Brief History of Color and How We View It on Computers
Aristotle (384-322 BCE) attempted to explain the composition of colors and how they were related. Hue identification included white, black, red, yellow, brown, violet, green and blue. He assumed colors were derived from blending of sunlight, fire, light and lack of light in varying degrees. We now know a more scientific approach to how colors are seen and created and this depends on the medium (reflective wavelengths for pigments, the mixing of colored light for computers and tv’s, or the relation of colors to one another).
Additive color, what computers use, are created with light. It begins with black and ends with white; as more color is added the result is lighter and tends to white. Red, green and blue are light primaries and percentages of these primaries are used to generate color on a computer screen.
It’s important to know that the visible spectrum consists of billions of colors, a monitor can display millions, a high quality printer is only capable of producing thousands and older computer systems may be limited to 216 cross-platform colors.
Reproducing color can be problematic with regard to printed, digital media because what we see is not completely possible to get. Although a monitor may be able to display ‘true color’ (16,000,000 colors), millions of these colors are outside of the spectrum available to printers. Since digital designs are generated using the RGB color system, colors used in those designs must be part of the CMYK spectrum or they will not be reproduced with proper color rendering. Working within the CMYK color system, or choosing colors from Pantone© palettes insures proper color rendering.
|
{
"url": "https://smartersearches.com/a-brief-history-of-color-and-how-we-view-it-on-computers/",
"source_domain": "smartersearches.com",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "101914",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DJJM3QKYCG6SNAIZ6NXFLGFS6TED4S3C",
"WARC-Concurrent-To": "<urn:uuid:2c0926da-e9eb-47fe-91a0-b404e43d43cd>",
"WARC-Date": "2022-06-26T01:42:48Z",
"WARC-IP-Address": "35.226.242.30",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XYJMEURZHMKOPDTODQCUBWK4CXWQPULK",
"WARC-Record-ID": "<urn:uuid:77ad3db0-8b80-418c-963c-3c175bc61abe>",
"WARC-Target-URI": "https://smartersearches.com/a-brief-history-of-color-and-how-we-view-it-on-computers/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d45e371c-f043-496f-9944-45a03668b289>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-49\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
11,
12,
69,
70,
600,
601,
892,
893,
1141,
1142,
1723,
1724
],
"line_end_idx": [
11,
12,
69,
70,
600,
601,
892,
893,
1141,
1142,
1723,
1724,
1725
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1725,
"ccnet_original_nlines": 12,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38922154903411865,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01497006043791771,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15269461274147034,
"rps_doc_frac_unique_words": 0.547703206539154,
"rps_doc_mean_word_length": 4.918727874755859,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.687092304229736,
"rps_doc_word_count": 283,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.017241379246115685,
"rps_doc_frac_chars_top_3gram": 0.017241379246115685,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -136.95252990722656,
"rps_doc_books_importance_length_correction": -126.21756744384766,
"rps_doc_openwebtext_importance": -72.71595001220703,
"rps_doc_openwebtext_importance_length_correction": -72.71595001220703,
"rps_doc_wikipedia_importance": -45.05694580078125,
"rps_doc_wikipedia_importance_length_correction": -37.88179397583008
},
"fasttext": {
"dclm": 0.16323226690292358,
"english": 0.9333322644233704,
"fineweb_edu_approx": 3.1862993240356445,
"eai_general_math": 0.24616217613220215,
"eai_open_web_math": 0.2768925428390503,
"eai_web_code": 0.1112821102142334
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.019",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "535.6",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Physics",
"level_3": "Optics and Light"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-3,145,759,674,496,572,400 |
sorting srpms by buildorder
May 17, 2013
Hey folks,
Working on something for Spot I revived some code I had written a
few years ago and then discovered that other people had made much more
robust leveled topological sorts than I had written 🙂
Anyway – if you grab the files from:
http://skvidal.fedorapeople.org/misc/buildorder/
And run:
python buildorder.py /path/to/*.src.rpm
it will look up the interdependencies of the src.rpm to figure out a
build order. It outputs a bunch of different things:
1. a flat build order
2. a build order broken out by groups – you can build all the pkgs in
any group in parallel provided that all the pkgs in the previous group
have finished building.
3. outputs lists of direct loops between srpms.
4. probably will output A LOT of noise and garbage from the rpm
specfile parsing from the rpm.spec() module
But it might be worth a look at and, ideally, patches to make it a bit
more robust.
If you have a set of pkgs which you need to build but you can’t figure
out the buildorder this might help you out.
I’d love to know how often it is right or ‘right enough’.
Known Issues:
1. some spec files make the rpm.spec() parsing break in interesting
ways – sometimes tracing back 🙂
2. if a pkg is not dependent on any other pkg and nothing else depends
on it – they get lumped in the last grouping. Not really an issue –
just something someone noticed and was surprised.
3. It will handle file-buildreqs not at all, it will handle virtual
provide buildreqs, not at all, if your buildreqs are REALLY picky about
requiring <= Version – it will ignore all of that. 🙂
4. I fully expect that 2 or more level circular build deps (foo req bar
req baz req quux) will not be detected but will make the topological
sort function die). If so…. tough… go fix your packaging.
Anyway – give it a run and see if it helps you solve a problem.
If it does let me know about it. Some of us are curious if this could
fit well in mockchain or wrapped around/in mockchain.
Advertisements
3 Responses to “sorting srpms by buildorder”
1. You mentioned other efforts: were they also rpm based?
How about putting the code into git? 🙂
• skvidal Says:
the only other attempts I’ve seen to do this are rpm-based, yah.
Since the 2 pieces of code doing the topo sort aren’t mine I wasn’t quite sure if I should stuff it into git or not. I also need to verify license compatibility
I’ll check on that tomorrow and see if I can get it into git.
I assume this means you have patches 🙂
• skvidal Says:
Thinking about it a bit more – this code fits into the mock/mockchain framework pretty obviously. If I can verify license compatibility it might make sense to check it into mock’s git repo and work on integrating it.
Thoughts?
Leave a Reply
Fill in your details below or click an icon to log in:
WordPress.com Logo
You are commenting using your WordPress.com account. Log Out / Change )
Google photo
You are commenting using your Google account. Log Out / Change )
Twitter picture
You are commenting using your Twitter account. Log Out / Change )
Facebook photo
You are commenting using your Facebook account. Log Out / Change )
Connecting to %s
%d bloggers like this:
|
{
"url": "https://skvidal.wordpress.com/2013/05/17/sorting-srpms-by-buildorder/",
"source_domain": "skvidal.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2019-22",
"warc_metadata": {
"Content-Length": "62682",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:46ZRGHGI4S6J6IUFONMITX4GPEQCJVRQ",
"WARC-Concurrent-To": "<urn:uuid:e38e628c-f635-4003-8ff4-c069e95ccafa>",
"WARC-Date": "2019-05-26T20:07:52Z",
"WARC-IP-Address": "192.0.78.12",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:EH7R7RCNUDPQTUGEQ2KO4V4TDKPCR3FB",
"WARC-Record-ID": "<urn:uuid:d6b2e8d9-5da9-48c6-819c-36ce8e2521e5>",
"WARC-Target-URI": "https://skvidal.wordpress.com/2013/05/17/sorting-srpms-by-buildorder/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cf5f9969-a83b-42e6-930b-ee59307d5e2e>"
},
"warc_info": "isPartOf: CC-MAIN-2019-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-7-214-88.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
28,
29,
42,
43,
54,
120,
191,
245,
246,
283,
332,
333,
342,
343,
383,
384,
453,
506,
528,
598,
669,
693,
741,
805,
849,
850,
921,
934,
935,
1006,
1050,
1051,
1109,
1110,
1124,
1192,
1224,
1295,
1363,
1413,
1481,
1553,
1606,
1678,
1747,
1805,
1806,
1870,
1871,
1941,
1995,
1996,
2011,
2012,
2057,
2058,
2059,
2119,
2120,
2163,
2164,
2184,
2185,
2256,
2257,
2424,
2425,
2493,
2494,
2539,
2540,
2562,
2563,
2788,
2789,
2807,
2808,
2809,
2823,
2824,
2879,
2880,
2899,
2900,
2973,
2974,
2987,
2988,
3054,
3055,
3071,
3072,
3139,
3140,
3155,
3156,
3224,
3225,
3242,
3243
],
"line_end_idx": [
28,
29,
42,
43,
54,
120,
191,
245,
246,
283,
332,
333,
342,
343,
383,
384,
453,
506,
528,
598,
669,
693,
741,
805,
849,
850,
921,
934,
935,
1006,
1050,
1051,
1109,
1110,
1124,
1192,
1224,
1295,
1363,
1413,
1481,
1553,
1606,
1678,
1747,
1805,
1806,
1870,
1871,
1941,
1995,
1996,
2011,
2012,
2057,
2058,
2059,
2119,
2120,
2163,
2164,
2184,
2185,
2256,
2257,
2424,
2425,
2493,
2494,
2539,
2540,
2562,
2563,
2788,
2789,
2807,
2808,
2809,
2823,
2824,
2879,
2880,
2899,
2900,
2973,
2974,
2987,
2988,
3054,
3055,
3071,
3072,
3139,
3140,
3155,
3156,
3224,
3225,
3242,
3243,
3265
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3265,
"ccnet_original_nlines": 100,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.39942529797554016,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022988509386777878,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18390804529190063,
"rps_doc_frac_unique_words": 0.4860139787197113,
"rps_doc_mean_word_length": 4.354895114898682,
"rps_doc_num_sentences": 47,
"rps_doc_symbol_to_word_ratio": 0.0028735599480569363,
"rps_doc_unigram_entropy": 5.23343563079834,
"rps_doc_word_count": 572,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.044158969074487686,
"rps_doc_frac_chars_dupe_6grams": 0.024086710065603256,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.009634680114686489,
"rps_doc_frac_chars_top_3gram": 0.025692490860819817,
"rps_doc_frac_chars_top_4gram": 0.03372139856219292,
"rps_doc_books_importance": -283.9585266113281,
"rps_doc_books_importance_length_correction": -283.9585266113281,
"rps_doc_openwebtext_importance": -174.55859375,
"rps_doc_openwebtext_importance_length_correction": -174.55859375,
"rps_doc_wikipedia_importance": -127.95642852783203,
"rps_doc_wikipedia_importance_length_correction": -127.95642852783203
},
"fasttext": {
"dclm": 0.07426934689283371,
"english": 0.9027045369148254,
"fineweb_edu_approx": 1.7638368606567383,
"eai_general_math": 0.001706480048596859,
"eai_open_web_math": 0.19126135110855103,
"eai_web_code": 0.000009420000424142927
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-5,111,682,835,988,251,000 |
Sign up ×
Server Fault is a question and answer site for system and network administrators. It's 100% free, no registration required.
I want to connect to my rdp but when i want to logon in my remote desktop , after puting user and pass i get this error :
the terminal server has exceeded the maximum number of allowed connections
my server : windows 2003 . what am i going to do ? please help me . Thanks in advance
share|improve this question
2 Answers 2
I'm guessing you're running in the default mode where it only allows two simultaneous connections. There are already two idle sessions connected, so you probably just need to fire up Terminal Server manager and kill one (or more) of the idle sessions. You'll be able to connect after doing this.
share|improve this answer
how can i kill one of the sessions ? thanks – Eva Jun 22 '10 at 15:23
From the horse's mouth: technet.microsoft.com/en-us/library/cc759296(WS.10).aspx – EEAA Jun 22 '10 at 15:26
Connect to the server's console via RDP then fire up Terminal Services Manager to kill off one of the two in-use sessions (which are probably idle due to someone forgetting to log off).
mstsc /admin /v:serverName
share|improve this answer
yikes. My answer is startling similar to ErikA's. Honest, I was slowly typing while watching a horrible webinar, not plagiarizing! – Chris_K Jun 22 '10 at 15:40
Happens all the time. Don't worry about it. – Chris S Jun 22 '10 at 15:44
No problem at all. – EEAA Jun 22 '10 at 16:09
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
|
{
"url": "http://serverfault.com/questions/153633/problem-with-remote-desktop",
"source_domain": "serverfault.com",
"snapshot_id": "crawl=CC-MAIN-2015-48",
"warc_metadata": {
"Content-Length": "78948",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QD4RIJZ36KGADVN5QP5DZFAYNV4BRMDR",
"WARC-Concurrent-To": "<urn:uuid:7e0491c9-bba4-4f85-9824-cd4167bb1035>",
"WARC-Date": "2015-11-25T15:03:56Z",
"WARC-IP-Address": "104.16.49.232",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:3577ATYNDHSBFCM5HTPEUNRFGPC65CRQ",
"WARC-Record-ID": "<urn:uuid:c49c6e34-8f0e-4672-9b3c-51c0d69e56ba>",
"WARC-Target-URI": "http://serverfault.com/questions/153633/problem-with-remote-desktop",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:04e73589-ddd9-4a44-b8b5-4421f8666f85>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-71-132-137.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for Nov 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
10,
134,
135,
257,
258,
333,
334,
420,
421,
449,
450,
462,
463,
759,
760,
786,
791,
861,
866,
974,
975,
1161,
1162,
1189,
1215,
1220,
1381,
1386,
1460,
1465,
1511,
1512,
1524,
1525,
1527,
1535,
1536
],
"line_end_idx": [
10,
134,
135,
257,
258,
333,
334,
420,
421,
449,
450,
462,
463,
759,
760,
786,
791,
861,
866,
974,
975,
1161,
1162,
1189,
1215,
1220,
1381,
1386,
1460,
1465,
1511,
1512,
1524,
1525,
1527,
1535,
1536,
1613
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1613,
"ccnet_original_nlines": 37,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3636363744735718,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022038569673895836,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26170799136161804,
"rps_doc_frac_unique_words": 0.5955882668495178,
"rps_doc_mean_word_length": 4.518382549285889,
"rps_doc_num_sentences": 21,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.813704013824463,
"rps_doc_word_count": 272,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.02278275042772293,
"rps_doc_frac_chars_dupe_6grams": 0.02278275042772293,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.020341740921139717,
"rps_doc_frac_chars_top_3gram": 0.028478439897298813,
"rps_doc_frac_chars_top_4gram": 0.03661512956023216,
"rps_doc_books_importance": -125.41055297851562,
"rps_doc_books_importance_length_correction": -111.643310546875,
"rps_doc_openwebtext_importance": -86.4909439086914,
"rps_doc_openwebtext_importance_length_correction": -86.4909439086914,
"rps_doc_wikipedia_importance": -41.90591049194336,
"rps_doc_wikipedia_importance_length_correction": -28.472291946411133
},
"fasttext": {
"dclm": 0.03791486844420433,
"english": 0.8795322775840759,
"fineweb_edu_approx": 0.8951889872550964,
"eai_general_math": 0.0003811699862126261,
"eai_open_web_math": 0.27686232328414917,
"eai_web_code": 0.000008580000212532468
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
3,119,584,249,430,928,400 |
Skip to end of metadata
Go to start of metadata
SoftNAS Cloud® is available for various industry platforms, with a focus on local storage management interfaces and requirements. Platform-specific configuration will be explained in dedicated sub-sections of this guide, but most SoftNAS Cloud® installations begin the same way.
Note: Regardless of underlying platform, SoftNAS Cloud® will require the ability to access the Internet for software updates, activation, etc. For this case, enabling only outbound TCP traffic to the softnas.com domain is required.
Setting Up SoftNAS Cloud®
1. Open a web browser and enter the SoftNAS website link https://www.softnas.com/ in the Address bar.
The SoftNAS home page will be displayed.
2. For a free trial period, click the Try Now option at the bottom of the main SoftNAS.com screen.
3. Click through for the desired product registration and download if applicable. Follow the wizards and prompts to register and configure a local SoftNAS platform and GUI. Depending on platform chosen, the next steps may differ slightly; however, the steps are designed to be intuitive with industry best practices.
SoftNAS Cloud®, SoftNAS StorageCenter™, SnapReplicate™, and SNAP HA™ are trademarks of SoftNAS Inc.. All other trademarks referred to in this guide are owned by their respective companies.
|
{
"url": "https://docs.softnas.com/pages/viewpage.action?pageId=8454925",
"source_domain": "docs.softnas.com",
"snapshot_id": "crawl=CC-MAIN-2019-39",
"warc_metadata": {
"Content-Length": "53631",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7FGNFSIOQXJIHCCQ4STKHW2Z3ECGXUMF",
"WARC-Concurrent-To": "<urn:uuid:6bdf87ef-e9f5-4165-880e-e4a8efea2045>",
"WARC-Date": "2019-09-21T00:24:43Z",
"WARC-IP-Address": "34.236.143.232",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CHBUBIFZLTPYEEZ4ZV2342LSLKQ52VOI",
"WARC-Record-ID": "<urn:uuid:b0cfb6e3-046a-485a-ba73-913682262889>",
"WARC-Target-URI": "https://docs.softnas.com/pages/viewpage.action?pageId=8454925",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:73ac697e-156c-4b6a-aca2-0b3f8496d57d>"
},
"warc_info": "isPartOf: CC-MAIN-2019-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-83.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
24,
48,
49,
328,
330,
562,
563,
589,
590,
591,
693,
695,
736,
738,
837,
839,
1156,
1158
],
"line_end_idx": [
24,
48,
49,
328,
330,
562,
563,
589,
590,
591,
693,
695,
736,
738,
837,
839,
1156,
1158,
1346
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1346,
"ccnet_original_nlines": 18,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3280632495880127,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015810279175639153,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17786560952663422,
"rps_doc_frac_unique_words": 0.6421568393707275,
"rps_doc_mean_word_length": 5.338235378265381,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.560131072998047,
"rps_doc_word_count": 204,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.059687789529561996,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -110.40496826171875,
"rps_doc_books_importance_length_correction": -110.40496063232422,
"rps_doc_openwebtext_importance": -59.32088851928711,
"rps_doc_openwebtext_importance_length_correction": -59.32088851928711,
"rps_doc_wikipedia_importance": -50.027732849121094,
"rps_doc_wikipedia_importance_length_correction": -50.01171875
},
"fasttext": {
"dclm": 0.021290119737386703,
"english": 0.7599619626998901,
"fineweb_edu_approx": 1.0103416442871094,
"eai_general_math": 0.0008394700125791132,
"eai_open_web_math": 0.157168447971344,
"eai_web_code": 0.0010513700544834137
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
3,957,580,495,755,714,600 |
Wikia
WoWWiki
Changes: API Frame SetBackdrop
Edit
Back to page
m (catfix, Replaced: {{widgetmethod}} → {{widgetmethod}}<br>)
m (catfix, Replaced: {{widgetmethod}}<br> → {{widgetmethod}})
Line 1: Line 1:
{{widgetmethod}}<br>
+
{{widgetmethod}}
Latest revision as of 23:55, July 14, 2008
Widget API ← Frame < SetBackdrop
Frame:SetBackdrop( {
bgFile = "bgFile",
edgeFile = "edgeFile", tile = false, tileSize = 0, edgeSize = 32,
insets = { left = 0, right = 0, top = 0, bottom = 0 }
});
Using 'nil' as the only parameter will remove the backdrop on the indicated frame.
Arguments Edit
bgFile
String - Which texture file to use as frame background (.blp or .tga format)
edgeFile
String- Which texture file to use as frame edge blp or .tga format)
tile
Boolean - whether background texture is tiled or streched
tileSize
Number - Control how large each copy of the bgFile becomes on-screen
edgeSize
Number - Control how large each copy of the edgeFile becomes on-screen (i.e. border thickness and corner size)
insets
4 x Number - Controls how far into the frame the background will be drawn (use higher values the thicker the edges are)
Example Edit
MinimapCluster:SetBackdrop({bgFile = "Interface/Tooltips/UI-Tooltip-Background",
edgeFile = "Interface/Tooltips/UI-Tooltip-Border",
tile = true, tileSize = 16, edgeSize = 16,
insets = { left = 4, right = 4, top = 4, bottom = 4 }});
MinimapCluster:SetBackdropColor(0,0,0,1);
See Also Edit
Around Wikia's network
Random Wiki
|
{
"url": "http://www.wowwiki.com/API_Frame_SetBackdrop?diff=prev&oldid=1520057",
"source_domain": "www.wowwiki.com",
"snapshot_id": "crawl=CC-MAIN-2015-18",
"warc_metadata": {
"Content-Length": "62471",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3L7JT6OOYCNXNPW7IDAHDIZZJ6IVS3JK",
"WARC-Concurrent-To": "<urn:uuid:ea482f6e-e4b4-4276-9837-8d10da51b11c>",
"WARC-Date": "2015-05-04T01:21:41Z",
"WARC-IP-Address": "23.235.39.194",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:H6THPTCQR4RWP5SHSEYGITX364VBFWUG",
"WARC-Record-ID": "<urn:uuid:ec71af6f-a344-47cf-aa1c-3ff1e5a2c2ce>",
"WARC-Target-URI": "http://www.wowwiki.com/API_Frame_SetBackdrop?diff=prev&oldid=1520057",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:46d2200f-e03c-43c4-a9f9-909961e313fc>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-235-10-82.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-18\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
6,
7,
15,
16,
47,
48,
53,
54,
67,
68,
130,
192,
194,
210,
231,
233,
250,
254,
258,
259,
302,
303,
336,
337,
338,
360,
382,
451,
507,
511,
512,
513,
596,
597,
612,
613,
620,
697,
706,
774,
779,
837,
846,
915,
924,
1035,
1042,
1162,
1163,
1176,
1177,
1259,
1355,
1443,
1544,
1586,
1587,
1601,
1602,
1625,
1626
],
"line_end_idx": [
6,
7,
15,
16,
47,
48,
53,
54,
67,
68,
130,
192,
194,
210,
231,
233,
250,
254,
258,
259,
302,
303,
336,
337,
338,
360,
382,
451,
507,
511,
512,
513,
596,
597,
612,
613,
620,
697,
706,
774,
779,
837,
846,
915,
924,
1035,
1042,
1162,
1163,
1176,
1177,
1259,
1355,
1443,
1544,
1586,
1587,
1601,
1602,
1625,
1626,
1637
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1637,
"ccnet_original_nlines": 61,
"rps_doc_curly_bracket": 0.019547950476408005,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1602373868227005,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011869439855217934,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.42136499285697937,
"rps_doc_frac_unique_words": 0.5532994866371155,
"rps_doc_mean_word_length": 5.538071155548096,
"rps_doc_num_sentences": 7,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.5040764808654785,
"rps_doc_word_count": 197,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.12465628236532211,
"rps_doc_frac_chars_dupe_6grams": 0.12465628236532211,
"rps_doc_frac_chars_dupe_7grams": 0.12465628236532211,
"rps_doc_frac_chars_dupe_8grams": 0.12465628236532211,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.029330890625715256,
"rps_doc_frac_chars_top_3gram": 0.027497710660099983,
"rps_doc_frac_chars_top_4gram": 0.04032997041940689,
"rps_doc_books_importance": -95.4508285522461,
"rps_doc_books_importance_length_correction": -81.6966323852539,
"rps_doc_openwebtext_importance": -63.256690979003906,
"rps_doc_openwebtext_importance_length_correction": -63.256690979003906,
"rps_doc_wikipedia_importance": -43.24903106689453,
"rps_doc_wikipedia_importance_length_correction": -30.519947052001953
},
"fasttext": {
"dclm": 0.9775630235671997,
"english": 0.5837059617042542,
"fineweb_edu_approx": 3.316220998764038,
"eai_general_math": 0.41025328636169434,
"eai_open_web_math": 0.10594195127487183,
"eai_web_code": 0.572226881980896
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
7,722,252,209,635,553,000 |
Skip to content
HTTPS clone URL
Subversion checkout URL
You can clone with HTTPS or Subversion.
Download ZIP
Loading…
Incorrect line number on E303 errors on test files #60
Closed
cangove opened this Issue · 6 comments
2 participants
Chris Angove Florent Xicluna
Chris Angove
When running the E30.py test file I noticed an incorrect message. I boiled it down to a simple example. If you use the following example:
print
#: E303
def a():
print
# comment
print
#:
When you run pep8 on it you get:
test2.py:3:1: E302 expected 2 blank lines, found 0
test2.py:9:5: E303 too many blank lines (2>1)
If you notice the first report is genuine but the second report says 2>1 but points to the line for print. First that is 1 blank line not 2 and second the violation is actually on 7 the comment line. When you manually remove line 6 it no longer detects the error as expected. So it seems it's a problem with the line number reported.
Chris Angove
It seems to only happen when you have a comment in there. If that line is replaces by code like 'pass' then it detects the correct line. So looking at the output I think the issue is its skipping the comments and reporting the wrong end number.
Florent Xicluna
Collaborator
It is a little annoyance.
It prints the line number of the next non-comment instruction after the blank lines.
Chris Angove
Could it be fixed not to do that? There is a pull request to allow auto-fixing and this breaks that ability because we do not know the actual line numbers of the error. As far as PEP-8 is concerned comments are just like lines of code (for the spacing/empty line rules) and should report the same, no?
Florent Xicluna
Collaborator
Well we had an issue with comments between block of codes.
For example this piece of code gave spurious errors before.
a = 42
# This function is a stub. Need more work.
def foo():
pass
See cburroughs/pep8.py#10 for details.
However if someone provides a patch, I can review it.
Chris Angove
I think the problem is that we skip comment lines but we should really treat them the same as code, no? For example if the comment line above was just a line of code as far as pep8 was concerned it would pass, as would my example. It seems the fix was to skip comments but keep track of them which does indeed fix issue #10 but can cause confusion.
So why not just simplify and treat a comment line as any other line of code?
Florent Xicluna
Collaborator
So why not just simplify and treat a comment line as any other line of code?
There's a check to verify that top-level classes and functions are preceded with 2 blank lines, and that other classes and function definitions are preceded with 1 blank line.
For example the previous example cannot be checked properly if we treat comments as code.
Following case show the similar difficulty:
a = 42
# Now how do you check that top-level function are separated by 2 blank lines?
def foo():
pass
See also testsuite/E30.pyand testsuite/E30not.py.
If you have a patch, it should pass these tests.
Florent Xicluna florentx removed the needs patch label
Florent Xicluna florentx modified the milestone: 1.5.x
Florent Xicluna florentx closed this
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Something went wrong with that request. Please try again.
|
{
"url": "https://github.com/jcrocholl/pep8/issues/60",
"source_domain": "github.com",
"snapshot_id": "crawl=CC-MAIN-2015-11",
"warc_metadata": {
"Content-Length": "44707",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UPGPHF3BVHLBEW2WQD2YFSBHVETQ2BOO",
"WARC-Concurrent-To": "<urn:uuid:c2c9bd67-08a1-4699-9e27-c2459e21e6fa>",
"WARC-Date": "2015-02-27T04:18:57Z",
"WARC-IP-Address": "192.30.252.129",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:6VOSJ4IUUQTRNEWYAFVGO5GD5KAQTUVP",
"WARC-Record-ID": "<urn:uuid:6ea680c6-3754-4522-98e3-109ff2d46793>",
"WARC-Target-URI": "https://github.com/jcrocholl/pep8/issues/60",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bb2f6b2b-386b-41b0-b2cb-8c8db358d809>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-28-5-156.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-11\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for February 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
16,
17,
33,
34,
58,
59,
99,
100,
113,
114,
123,
124,
179,
180,
187,
226,
227,
242,
243,
272,
285,
286,
424,
425,
431,
439,
448,
458,
459,
460,
474,
475,
485,
488,
489,
522,
523,
574,
620,
621,
955,
956,
969,
970,
1215,
1216,
1232,
1245,
1246,
1272,
1357,
1358,
1371,
1372,
1674,
1675,
1691,
1704,
1705,
1764,
1824,
1825,
1832,
1833,
1834,
1877,
1888,
1897,
1898,
1937,
1938,
1992,
1993,
2006,
2007,
2356,
2357,
2434,
2435,
2451,
2464,
2465,
2542,
2543,
2719,
2809,
2853,
2854,
2861,
2862,
2863,
2942,
2943,
2954,
2963,
2964,
3014,
3063,
3064,
3119,
3174,
3211,
3309
],
"line_end_idx": [
16,
17,
33,
34,
58,
59,
99,
100,
113,
114,
123,
124,
179,
180,
187,
226,
227,
242,
243,
272,
285,
286,
424,
425,
431,
439,
448,
458,
459,
460,
474,
475,
485,
488,
489,
522,
523,
574,
620,
621,
955,
956,
969,
970,
1215,
1216,
1232,
1245,
1246,
1272,
1357,
1358,
1371,
1372,
1674,
1675,
1691,
1704,
1705,
1764,
1824,
1825,
1832,
1833,
1834,
1877,
1888,
1897,
1898,
1937,
1938,
1992,
1993,
2006,
2007,
2356,
2357,
2434,
2435,
2451,
2464,
2465,
2542,
2543,
2719,
2809,
2853,
2854,
2861,
2862,
2863,
2942,
2943,
2954,
2963,
2964,
3014,
3063,
3064,
3119,
3174,
3211,
3309,
3366
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3366,
"ccnet_original_nlines": 103,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38746440410614014,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02421651966869831,
"rps_doc_frac_lines_end_with_ellipsis": 0.009615380316972733,
"rps_doc_frac_no_alph_words": 0.17236466705799103,
"rps_doc_frac_unique_words": 0.4150943458080292,
"rps_doc_mean_word_length": 4.485420227050781,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0.012820510193705559,
"rps_doc_unigram_entropy": 5.0477728843688965,
"rps_doc_word_count": 583,
"rps_doc_frac_chars_dupe_10grams": 0.045889098197221756,
"rps_doc_frac_chars_dupe_5grams": 0.045889098197221756,
"rps_doc_frac_chars_dupe_6grams": 0.045889098197221756,
"rps_doc_frac_chars_dupe_7grams": 0.045889098197221756,
"rps_doc_frac_chars_dupe_8grams": 0.045889098197221756,
"rps_doc_frac_chars_dupe_9grams": 0.045889098197221756,
"rps_doc_frac_chars_top_2gram": 0.03747610002756119,
"rps_doc_frac_chars_top_3gram": 0.012619500048458576,
"rps_doc_frac_chars_top_4gram": 0.008413000032305717,
"rps_doc_books_importance": -266.4500427246094,
"rps_doc_books_importance_length_correction": -266.4500427246094,
"rps_doc_openwebtext_importance": -171.428466796875,
"rps_doc_openwebtext_importance_length_correction": -171.428466796875,
"rps_doc_wikipedia_importance": -123.65670776367188,
"rps_doc_wikipedia_importance_length_correction": -123.65670776367188
},
"fasttext": {
"dclm": 0.12591534852981567,
"english": 0.9367280006408691,
"fineweb_edu_approx": 1.2567055225372314,
"eai_general_math": 0.552128791809082,
"eai_open_web_math": 0.23932868242263794,
"eai_web_code": 0.08412551879882812
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-5,370,624,775,631,059,000 |
Permalink
Browse files
Initial commit to guard-rrails.
• Loading branch information...
0 parents commit d0195a93a44cd19feb00117919c69759c89057db @walf443 committed Apr 25, 2012
Showing with 185 additions and 0 deletions.
1. +5 −0 .document
2. +49 −0 .gitignore
3. +14 −0 Gemfile
4. +20 −0 LICENSE.txt
5. +19 −0 README.rdoc
6. +53 −0 Rakefile
7. 0 lib/guard-rrails.rb
8. +18 −0 test/helper.rb
9. +7 −0 test/test_guard-rrails.rb
5 .document
@@ -0,0 +1,5 @@
+lib/**/*.rb
+bin/*
+-
+features/**/*.feature
+LICENSE.txt
49 .gitignore
@@ -0,0 +1,49 @@
+# rcov generated
+coverage
+coverage.data
+
+# rdoc generated
+rdoc
+
+# yard generated
+doc
+.yardoc
+
+# bundler
+.bundle
+
+# jeweler generated
+pkg
+
+# Have editor/IDE/OS specific files you need to ignore? Consider using a global gitignore:
+#
+# * Create a file at ~/.gitignore
+# * Include files you want ignored
+# * Run: git config --global core.excludesfile ~/.gitignore
+#
+# After doing this, these files will be ignored in all your git projects,
+# saving you from having to 'pollute' every project you touch with them
+#
+# Not sure what to needs to be ignored for particular editors/OSes? Here's some ideas to get you started. (Remember, remove the leading # of the line)
+#
+# For MacOS:
+#
+#.DS_Store
+
+# For TextMate
+#*.tmproj
+#tmtags
+
+# For emacs:
+#*~
+#\#*
+#.\#*
+
+# For vim:
+#*.swp
+
+# For redcar:
+#.redcar
+
+# For rubinius:
+#*.rbc
14 Gemfile
@@ -0,0 +1,14 @@
+source "http://rubygems.org"
+# Add dependencies required to use your gem here.
+# Example:
+# gem "activesupport", ">= 2.3.5"
+
+# Add dependencies to develop your gem here.
+# Include everything needed to run rake, tests, features, etc.
+group :development do
+ gem "shoulda", ">= 0"
+ gem "rdoc", "~> 3.12"
+ gem "bundler", "~> 1.0.0"
+ gem "jeweler", "~> 1.8.3"
+ gem "rcov", ">= 0"
+end
20 LICENSE.txt
@@ -0,0 +1,20 @@
+Copyright (c) 2012 Keiji, Yoshimi
+
+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.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. 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.
19 README.rdoc
@@ -0,0 +1,19 @@
+= guard-rrails
+
+Description goes here.
+
+== Contributing to guard-rrails
+
+* Check out the latest master to make sure the feature hasn't been implemented or the bug hasn't been fixed yet.
+* Check out the issue tracker to make sure someone already hasn't requested it and/or contributed it.
+* Fork the project.
+* Start a feature/bugfix branch.
+* Commit and push until you are happy with your contribution.
+* Make sure to add tests for it. This is important so I don't break it in a future version unintentionally.
+* Please try not to mess with the Rakefile, version, or history. If you want to have your own version, or is otherwise necessary, that is fine, but please isolate to its own commit so I can cherry-pick around it.
+
+== Copyright
+
+Copyright (c) 2012 Keiji, Yoshimi. See LICENSE.txt for
+further details.
+
53 Rakefile
@@ -0,0 +1,53 @@
+# encoding: utf-8
+
+require 'rubygems'
+require 'bundler'
+begin
+ Bundler.setup(:default, :development)
+rescue Bundler::BundlerError => e
+ $stderr.puts e.message
+ $stderr.puts "Run `bundle install` to install missing gems"
+ exit e.status_code
+end
+require 'rake'
+
+require 'jeweler'
+Jeweler::Tasks.new do |gem|
+ # gem is a Gem::Specification... see http://docs.rubygems.org/read/chapter/20 for more options
+ gem.name = "guard-rrails"
+ gem.homepage = "http://github.com/walf443/guard-rrails"
+ gem.license = "MIT"
+ gem.summary = %Q{TODO: one-line summary of your gem}
+ gem.description = %Q{TODO: longer description of your gem}
+ gem.email = "[email protected]"
+ gem.authors = ["Keiji, Yoshimi"]
+ # dependencies defined in Gemfile
+end
+Jeweler::RubygemsDotOrgTasks.new
+
+require 'rake/testtask'
+Rake::TestTask.new(:test) do |test|
+ test.libs << 'lib' << 'test'
+ test.pattern = 'test/**/test_*.rb'
+ test.verbose = true
+end
+
+require 'rcov/rcovtask'
+Rcov::RcovTask.new do |test|
+ test.libs << 'test'
+ test.pattern = 'test/**/test_*.rb'
+ test.verbose = true
+ test.rcov_opts << '--exclude "gems/*"'
+end
+
+task :default => :test
+
+require 'rdoc/task'
+Rake::RDocTask.new do |rdoc|
+ version = File.exist?('VERSION') ? File.read('VERSION') : ""
+
+ rdoc.rdoc_dir = 'rdoc'
+ rdoc.title = "guard-rrails #{version}"
+ rdoc.rdoc_files.include('README*')
+ rdoc.rdoc_files.include('lib/**/*.rb')
+end
0 lib/guard-rrails.rb
No changes.
18 test/helper.rb
@@ -0,0 +1,18 @@
+require 'rubygems'
+require 'bundler'
+begin
+ Bundler.setup(:default, :development)
+rescue Bundler::BundlerError => e
+ $stderr.puts e.message
+ $stderr.puts "Run `bundle install` to install missing gems"
+ exit e.status_code
+end
+require 'test/unit'
+require 'shoulda'
+
+$LOAD_PATH.unshift(File.join(File.dirname(__FILE__), '..', 'lib'))
+$LOAD_PATH.unshift(File.dirname(__FILE__))
+require 'guard-rrails'
+
+class Test::Unit::TestCase
+end
7 test/test_guard-rrails.rb
@@ -0,0 +1,7 @@
+require 'helper'
+
+class TestGuardRrails < Test::Unit::TestCase
+ should "probably rename this file and start testing for real" do
+ flunk "hey buddy, you should probably rename this file and start testing for real"
+ end
+end
0 comments on commit d0195a9
Please sign in to comment.
|
{
"url": "https://github.com/walf443/guard-rrails/commit/d0195a93a44cd19feb00117919c69759c89057db",
"source_domain": "github.com",
"snapshot_id": "crawl=CC-MAIN-2016-40",
"warc_metadata": {
"Content-Length": "127171",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VGEYJCBRVVA7LPK7JOQBXOMJT5TJXWAG",
"WARC-Concurrent-To": "<urn:uuid:e9a9d85d-a419-402c-903e-d4e449cb073c>",
"WARC-Date": "2016-09-26T09:00:21Z",
"WARC-IP-Address": "192.30.253.113",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:AP34M6DUV3L2U2MQAKQZ4BCNGVCKQTVV",
"WARC-Record-ID": "<urn:uuid:5f04dcc6-89d7-46ba-8cf4-680016030c48>",
"WARC-Target-URI": "https://github.com/walf443/guard-rrails/commit/d0195a93a44cd19feb00117919c69759c89057db",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:487467ca-8814-4345-8154-f570e0b76aa7>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-143-35-109.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-40\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for September 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
10,
23,
24,
56,
57,
91,
181,
225,
246,
269,
289,
313,
337,
358,
385,
412,
449,
461,
477,
490,
497,
500,
523,
536,
550,
567,
585,
595,
610,
612,
630,
636,
638,
656,
661,
670,
672,
683,
692,
694,
715,
720,
722,
814,
817,
852,
888,
949,
952,
1027,
1100,
1103,
1255,
1258,
1272,
1275,
1287,
1289,
1305,
1316,
1325,
1327,
1341,
1346,
1352,
1359,
1361,
1373,
1381,
1383,
1398,
1408,
1410,
1427,
1435,
1446,
1463,
1493,
1544,
1556,
1591,
1593,
1639,
1703,
1726,
1750,
1774,
1802,
1830,
1851,
1856,
1871,
1888,
1923,
1925,
1996,
2061,
2130,
2199,
2267,
2338,
2365,
2367,
2431,
2496,
2498,
2563,
2631,
2686,
2758,
2830,
2901,
2966,
2981,
2998,
3014,
3016,
3040,
3042,
3075,
3077,
3191,
3294,
3315,
3349,
3412,
3521,
3735,
3737,
3751,
3753,
3809,
3827,
3829,
3841,
3858,
3877,
3879,
3899,
3918,
3925,
3965,
4000,
4025,
4087,
4108,
4113,
4129,
4131,
4150,
4179,
4276,
4304,
4362,
4384,
4439,
4500,
4534,
4569,
4605,
4610,
4644,
4646,
4671,
4708,
4739,
4776,
4798,
4803,
4805,
4830,
4860,
4882,
4919,
4941,
4982,
4987,
4989,
5013,
5015,
5036,
5066,
5129,
5131,
5156,
5197,
5234,
5275,
5280,
5302,
5314,
5332,
5349,
5369,
5388,
5395,
5435,
5470,
5495,
5557,
5578,
5583,
5604,
5623,
5625,
5693,
5737,
5761,
5763,
5791,
5796,
5824,
5840,
5858,
5860,
5906,
5973,
6058,
6064,
6069,
6070,
6099,
6100
],
"line_end_idx": [
10,
23,
24,
56,
57,
91,
181,
225,
246,
269,
289,
313,
337,
358,
385,
412,
449,
461,
477,
490,
497,
500,
523,
536,
550,
567,
585,
595,
610,
612,
630,
636,
638,
656,
661,
670,
672,
683,
692,
694,
715,
720,
722,
814,
817,
852,
888,
949,
952,
1027,
1100,
1103,
1255,
1258,
1272,
1275,
1287,
1289,
1305,
1316,
1325,
1327,
1341,
1346,
1352,
1359,
1361,
1373,
1381,
1383,
1398,
1408,
1410,
1427,
1435,
1446,
1463,
1493,
1544,
1556,
1591,
1593,
1639,
1703,
1726,
1750,
1774,
1802,
1830,
1851,
1856,
1871,
1888,
1923,
1925,
1996,
2061,
2130,
2199,
2267,
2338,
2365,
2367,
2431,
2496,
2498,
2563,
2631,
2686,
2758,
2830,
2901,
2966,
2981,
2998,
3014,
3016,
3040,
3042,
3075,
3077,
3191,
3294,
3315,
3349,
3412,
3521,
3735,
3737,
3751,
3753,
3809,
3827,
3829,
3841,
3858,
3877,
3879,
3899,
3918,
3925,
3965,
4000,
4025,
4087,
4108,
4113,
4129,
4131,
4150,
4179,
4276,
4304,
4362,
4384,
4439,
4500,
4534,
4569,
4605,
4610,
4644,
4646,
4671,
4708,
4739,
4776,
4798,
4803,
4805,
4830,
4860,
4882,
4919,
4941,
4982,
4987,
4989,
5013,
5015,
5036,
5066,
5129,
5131,
5156,
5197,
5234,
5275,
5280,
5302,
5314,
5332,
5349,
5369,
5388,
5395,
5435,
5470,
5495,
5557,
5578,
5583,
5604,
5623,
5625,
5693,
5737,
5761,
5763,
5791,
5796,
5824,
5840,
5858,
5860,
5906,
5973,
6058,
6064,
6069,
6070,
6099,
6100,
6126
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6126,
"ccnet_original_nlines": 223,
"rps_doc_curly_bracket": 0.000979430042207241,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1428571343421936,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06222222000360489,
"rps_doc_frac_lines_end_with_ellipsis": 0.004464290104806423,
"rps_doc_frac_no_alph_words": 0.4749206304550171,
"rps_doc_frac_unique_words": 0.5006604790687561,
"rps_doc_mean_word_length": 5.697490215301514,
"rps_doc_num_sentences": 126,
"rps_doc_symbol_to_word_ratio": 0.029206350445747375,
"rps_doc_unigram_entropy": 5.53082799911499,
"rps_doc_word_count": 757,
"rps_doc_frac_chars_dupe_10grams": 0.10619059205055237,
"rps_doc_frac_chars_dupe_5grams": 0.13679572939872742,
"rps_doc_frac_chars_dupe_6grams": 0.10619059205055237,
"rps_doc_frac_chars_dupe_7grams": 0.10619059205055237,
"rps_doc_frac_chars_dupe_8grams": 0.10619059205055237,
"rps_doc_frac_chars_dupe_9grams": 0.10619059205055237,
"rps_doc_frac_chars_top_2gram": 0.020403429865837097,
"rps_doc_frac_chars_top_3gram": 0.005100859794765711,
"rps_doc_frac_chars_top_4gram": 0.00881057046353817,
"rps_doc_books_importance": -520.3410034179688,
"rps_doc_books_importance_length_correction": -520.3410034179688,
"rps_doc_openwebtext_importance": -358.0884704589844,
"rps_doc_openwebtext_importance_length_correction": -358.0884704589844,
"rps_doc_wikipedia_importance": -380.5587463378906,
"rps_doc_wikipedia_importance_length_correction": -380.5587463378906
},
"fasttext": {
"dclm": 0.8879956007003784,
"english": 0.6006237268447876,
"fineweb_edu_approx": 0.9873192310333252,
"eai_general_math": 0.037865761667490005,
"eai_open_web_math": 0.6052405834197998,
"eai_web_code": 0.005072359926998615
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-5,931,454,204,178,623,000 |
CWM
We're getting a little hacky in this round of Android A to Z, and we're going to have a look at ClockworkMod recovery -- the de facto standard of custom recoveries for Android. It's open source, based on the stock Android recovery, and brings a ton of options to the table that aren't possible otherwise.
First, let's look at why anyone would use a custom recovery. The standard Android recovery can do two things for the user -- flash system files that have been signed and verified as coming from the correct source (either Google or an OEM), and wipe away user data and cached information. Both these operations are pretty important, but there's more many users want and need from the recovery mode of their phone. Things like backing up all user data into image files that can be restored easily, or flashing software that doesn't come from Google or the OEM -- like custom ROMs -- and wiping some residual data to troubleshoot things like file permission errors. It's pretty advanced stuff, but it's very handy to have it for many of us.
ClockworkMod recovery (we'll call it CWM from here on out) does all this, and does it very well. It's provided free, and has a pretty handy wrapper around it so it can be used while the phone or tablet is up and running. We're talking about Rom Manager, of course. With CWM you can erase the user data from your system completely -- including that extra data that may cause an issue, selectively erase portions of it (a godsend for troubleshooting), create a restore image of the running system, and flash custom firmware at will. If you're running a custom version of Android on any newer phone or tablet, you're probably using it right now. If you're thinking about trying your luck with a custom ROM or tweak, CWM is where you'll get started.
Check out the complete Android Dictionary
More from the Android Dictionary
Haptic feedback
Article
by Jerry Hildenbrand
Jun 05, 2012
We're back with another installment of Android A to Z, and this time we're looking at haptic feedback. It's one of those little things that can make a big difference, and something we ne...
Google Play
Article
by Jerry Hildenbrand
May 30, 2012
Today on Android A to Z we're going to talk about Google Play. If you're new to Android, you see us throw it around a lot when talking about downloading apps, but there's a good bit more...
Factor Reset
Article
by Jerry Hildenbrand
May 29, 2012
A factory reset is the ultimate cleansing of your Android device. It's usually either a last resort to fix a problem, done before you sell it, or because you like to flash ROMs. When you perform...
End of life
Article
by Jerry Hildenbrand
May 25, 2012
End of life is a term none of us ever want to hear. We envision it means the death of our phone, and we should just throw it away and get a newer model. After all, it's at the end of its life, r...
DLNA
Article
by Jerry Hildenbrand
May 24, 2012
DLNA, or the Digital Living Network Alliance is an organization set up by Sony in 2003 that determines a universal set of rules and guidelines so devices can share digital media. The devices co...
There are 2 comments
DVNO says:
4EXT Recovery is way better in my opinoin and is what most devs are using now. All touch screen and very noob friendly.
aNYthing24 says:
I paid for CWM Touch and while I appreciate everything Koush has done, 4EXT Recovery is hands down better. Shame it's not a wider range of devices.
|
{
"url": "http://www.androidcentral.com/android-z-clockworkmod-recovery?page=1",
"source_domain": "www.androidcentral.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "103188",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JAVZXTVABKCAGYAGIJKHXG4TN2643HDF",
"WARC-Concurrent-To": "<urn:uuid:269431d8-52cc-46cc-815b-83a6ba3d68bb>",
"WARC-Date": "2013-12-12T13:42:53Z",
"WARC-IP-Address": "199.83.128.57",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:H7D4GFYBQZZZTA2CTC4HT3GL2F4CCYJM",
"WARC-Record-ID": "<urn:uuid:4d7f19a9-5e6d-481c-b688-f9f510997a3a>",
"WARC-Target-URI": "http://www.androidcentral.com/android-z-clockworkmod-recovery?page=1",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a9bd3260-af74-40a2-9d58-00dfa0fb27db>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-33-133-15.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Winter 2013\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
4,
5,
310,
311,
1049,
1050,
1796,
1797,
1839,
1840,
1873,
1874,
1890,
1898,
1919,
1932,
2122,
2134,
2142,
2163,
2176,
2366,
2379,
2387,
2408,
2421,
2619,
2631,
2639,
2660,
2673,
2871,
2876,
2884,
2905,
2918,
3115,
3116,
3118,
3139,
3140,
3151,
3152,
3272,
3273,
3290,
3291
],
"line_end_idx": [
4,
5,
310,
311,
1049,
1050,
1796,
1797,
1839,
1840,
1873,
1874,
1890,
1898,
1919,
1932,
2122,
2134,
2142,
2163,
2176,
2366,
2379,
2387,
2408,
2421,
2619,
2631,
2639,
2660,
2673,
2871,
2876,
2884,
2905,
2918,
3115,
3116,
3118,
3139,
3140,
3151,
3152,
3272,
3273,
3290,
3291,
3438
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3438,
"ccnet_original_nlines": 47,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.45923912525177,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.029891299083828926,
"rps_doc_frac_lines_end_with_ellipsis": 0.1041666716337204,
"rps_doc_frac_no_alph_words": 0.14809782803058624,
"rps_doc_frac_unique_words": 0.4706840515136719,
"rps_doc_mean_word_length": 4.385993480682373,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0.006793479900807142,
"rps_doc_unigram_entropy": 5.240858554840088,
"rps_doc_word_count": 614,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05347196012735367,
"rps_doc_frac_chars_dupe_6grams": 0.0118826599791646,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.016709990799427032,
"rps_doc_frac_chars_top_3gram": 0.02599331922829151,
"rps_doc_frac_chars_top_4gram": 0.046416640281677246,
"rps_doc_books_importance": -267.348388671875,
"rps_doc_books_importance_length_correction": -267.348388671875,
"rps_doc_openwebtext_importance": -165.27101135253906,
"rps_doc_openwebtext_importance_length_correction": -165.27101135253906,
"rps_doc_wikipedia_importance": -173.28012084960938,
"rps_doc_wikipedia_importance_length_correction": -173.28012084960938
},
"fasttext": {
"dclm": 0.02321081981062889,
"english": 0.9413613080978394,
"fineweb_edu_approx": 1.3251566886901855,
"eai_general_math": 0.021254239603877068,
"eai_open_web_math": 0.10527890920639038,
"eai_web_code": 0.004388689994812012
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.162",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "1",
"label": "News/Editorial"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
182,110,119,982,065,900 |
US7568110B2 - Cryptography accelerator interface decoupling from cryptography processing cores - Google Patents
Cryptography accelerator interface decoupling from cryptography processing cores Download PDF
Info
Publication number
US7568110B2
US7568110B2 US10/350,902 US35090203A US7568110B2 US 7568110 B2 US7568110 B2 US 7568110B2 US 35090203 A US35090203 A US 35090203A US 7568110 B2 US7568110 B2 US 7568110B2
Authority
US
United States
Prior art keywords
plurality
data
input
cryptographic processing
buffer
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active, expires
Application number
US10/350,902
Other versions
US20040123119A1 (en
Inventor
Mark Buer
Donald P. Matthews
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Avago Technologies International Sales Pte Ltd
Original Assignee
Broadcom Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority to US43474502P priority Critical
Application filed by Broadcom Corp filed Critical Broadcom Corp
Priority to US10/350,902 priority patent/US7568110B2/en
Assigned to BROADCOM CORPORATION reassignment BROADCOM CORPORATION ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: BUER, MARK, MATTHEWS, DONALD P.
Publication of US20040123119A1 publication Critical patent/US20040123119A1/en
Publication of US7568110B2 publication Critical patent/US7568110B2/en
Application granted granted Critical
Assigned to BANK OF AMERICA, N.A., AS COLLATERAL AGENT reassignment BANK OF AMERICA, N.A., AS COLLATERAL AGENT PATENT SECURITY AGREEMENT Assignors: BROADCOM CORPORATION
Assigned to AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD. reassignment AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: BROADCOM CORPORATION
Assigned to BROADCOM CORPORATION reassignment BROADCOM CORPORATION TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENTS Assignors: BANK OF AMERICA, N.A., AS COLLATERAL AGENT
Assigned to AVAGO TECHNOLOGIES INTERNATIONAL SALES PTE. LIMITED reassignment AVAGO TECHNOLOGIES INTERNATIONAL SALES PTE. LIMITED MERGER (SEE DOCUMENT FOR DETAILS). Assignors: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD.
Assigned to AVAGO TECHNOLOGIES INTERNATIONAL SALES PTE. LIMITED reassignment AVAGO TECHNOLOGIES INTERNATIONAL SALES PTE. LIMITED CORRECTIVE ASSIGNMENT TO CORRECT THE EFFECTIVE DATE OF MERGER PREVIOUSLY RECORDED AT REEL: 047195 FRAME: 0827. ASSIGNOR(S) HEREBY CONFIRMS THE MERGER. Assignors: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD.
Application status is Active legal-status Critical
Adjusted expiration legal-status Critical
Links
Images
Classifications
• GPHYSICS
• G06COMPUTING; CALCULATING; COUNTING
• G06FELECTRIC DIGITAL DATA PROCESSING
• G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
• G06F21/70Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer
• G06F21/71Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure computing or processing of information
• G06F21/72Protecting specific internal or peripheral components, in which the protection of a component leads to protection of the entire computer to assure secure computing or processing of information in cryptographic circuits
Abstract
Methods and apparatus are provided for decoupling a cryptography accelerator interface from cryptographic processing cores. A shared resource is provided at the cryptography accelerator interface having multiple input ports. References to data in the shared resource are provided to allow processing and ordering of data in preparation for processing by cryptographic processing cores without substantial numbers of separate buffers in the cryptographic processing data paths.
Description
CROSS REFERENCE TO RELATED APPLICATIONS
This application claims priority under U.S.C. 119(e) from U.S. Provisional Application No. 60/434,745, filed Dec. 18, 2002, Entitled: Methods And Apparatus For Cryptography Accelerator Data Handling, by Mark Buer and Donald P. Matthews, the entirety of which is incorporated by reference for all purposes. The present application is also related to concurrently filed U.S. patent application Ser. No. 10/351,258 entitled Methods And Apparatus For Ordering Data In A Cryptography Accelerator, by Tim Paaske and Mark Buer, U.S. patent application Ser. No. 10/350,907 entitled Cryptography Accelerator Input Interface Data Handling, by Mark Buer and Don Matthews, and U.S. patent application Ser. No. 10/350,922, entitled Cryptography Accelerator Data Routing Unit, by Mark Buer and Don Matthews, the entireties of which are incorporated by reference for all purposes.
BACKGROUND OF THE INVENTION
1. Field of the Invention
The present application relates to cryptography accelerators. More specifically, the present application relates to methods and apparatus for data handling in cryptography accelerators.
2. Description of Related Art
Conventional cryptography accelerators include a variety of mechanisms for managing the exchange of data with external devices. In many conventional implementations, specialized data handling mechanisms are configured for specific ports. Port buffers are preconfigured based on expected needs and requirements of particular ports and data path buffers are provided for implementation of cryptographic operations.
Mechanisms for performing cryptographic operations are described in Applied Cryptography, Bruce Schneier, John Wiley & Sons, Inc. (ISBN 0471128457), incorporated by reference in its entirety for all purposes. However, implementation of specialized data handling mechanisms for specific ports and providing buffers throughout a cryptography accelerator causes a variety of inefficiencies including data handling inefficiencies and inflexibility in managing different types of data.
It is therefore desirable to provide methods and apparatus for improving data handling with respect to some or all of the performance limitations noted above.
SUMMARY OF THE INVENTION
Methods and apparatus are provided for decoupling a cryptography accelerator interface from cryptographic processing cores. A shared resource is provided at the cryptography accelerator interface having multiple input ports. References to data in the shared resource are provided to allow processing and ordering of data in preparation for processing by cryptographic processing cores without substantial numbers of separate buffers in the cryptographic processing data paths.
In one embodiment, a cryptography accelerator is provided. The cryptography accelerator includes a plurality of input ports, a data input unit input controller, and policy security association lookup circuitry. The data input unit input controller is coupled to the plurality of input ports. The data input unit input controller is configured to write data blocks from the plurality of input ports into an input buffer and write entries corresponding to the data blocks into a buffer pointer table. Policy security association lookup circuitry is configured to receive header information and determine policy and security association information associated with the data blocks. The policy and security association information is forwarded with the data blocks to cryptographic processing cores.
In another embodiment, a method for data handling in a cryptography accelerator is provided. A plurality of data sequences is received at one of a plurality of input ports. The plurality of data sequences are into a shared resource. References to the data sequences are provided in the shared resource. The references identify the data sequences as well as the type of the data sequences. A policy security association lookup is performed to determine policy and security association information associated with the data sequences. The plurality of data sequences are forwarded along with policy and security association information to cryptographic processing circuitry.
In another embodiment, a cryptography accelerator is provided. The cryptography accelerator includes a plurality of input ports, a shared input buffer, a buffer pointer table, and policy security association lookup circuitry. The plurality of input ports are configured to receive data comprising header information and data blocks from entities external to the cryptography accelerator. The shared input buffer is associated with the plurality of input ports. The shared input buffer is configured to hold data blocks from the plurality of input ports. A buffer pointer table is associated with the plurality of input ports. The buffer pointer table has a plurality of entries configured to hold header information from the plurality of input ports. The plurality of entries reference data blocks in the shared input buffer. Policy security association lookup circuitry is configured to receive header information and determine policy and security association information associated with the data blocks. The policy and security association information is forwarded with the data blocks to cryptographic processing cores.
These and other features and advantages of the present invention will be presented in more detail in the following specification of the invention and the accompanying figures, which illustrate by way of example the principles of the invention.
BRIEF DESCRIPTION OF THE DRAWINGS
The invention may best be understood by reference to the following description taken in conjunction with the accompanying drawings, which are illustrative of specific embodiments of the present invention.
FIG. 1 is a diagrammatic representation of a system that can use the techniques of the present invention.
FIG. 2 is a diagrammatic representation of a cryptography accelerator containing processing cores and interfaces.
FIG. 3 is a diagrammatic representation of a cryptography accelerator having a data interface unit and a data routing unit.
FIG. 4 is a diagrammatic representation showing a data input unit.
FIG. 5 is a diagrammatic representation showing a pointer buffer list.
FIG. 6 is a diagrammatic representation showing a target list.
FIG. 7 is a diagrammatic representation showing data handling associated with a policy security association lookup unit.
FIG. 8 is a flow process diagram showing packet processing at an input interface.
FIG. 9 is a diagrammatic representation showing a data routing unit.
FIG. 10 is a flow process diagram showing packet processing at an output interface.
DETAILED DESCRIPTION OF SPECIFIC EMBODIMENTS
The present application relates to implementing a cryptography accelerator. More specifically, the present application relates to methods and apparatus for providing a cryptography accelerator capable of performing secure session operations.
Reference will now be made in detail to some specific embodiments of the invention including the best modes contemplated by the inventors for carrying out the invention. Examples of these specific embodiments are illustrated in the accompanying drawings. While the invention is described in conjunction with these specific embodiments, it will be understood that it is not intended to limit the invention to the described embodiments. On the contrary, it is intended to cover alternatives, modifications, and equivalents as may be included within the spirit and scope of the invention as defined by the appended claims.
For example, the techniques of the present invention will be described in the context of a multiple port cryptography accelerator with multiple cores for performing particular cryptographic operations. However, it should be noted that the techniques of the present invention can be applied to a variety of different chip architectures that perform authentication and encryption operations in general. In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present invention. The present invention may be practiced without some or all of these specific details. In other instances, well known process operations have not been described in detail in order not to unnecessarily obscure the present invention.
FIG. 1 is a diagrammatic representation of one example of a processing system 100 in accordance with an embodiment of the present invention. As shown in FIG. 1, the present invention may be implemented in a stand-alone cryptography accelerator 102 or as part of the system 100. Any logic, mechanism, or device operable to perform encryption, decryption, and/or authentication operations is referred to herein as a cryptography accelerator. In the described embodiment, the cryptography accelerator 102 is connected to a bus 104 such as a PCI bus via a standard on-chip PCI interface. The processing system 100 includes a processing unit 106 and a system memory unit 108. In typical implementations, the cryptography accelerator 102 includes multiple ports used for communication with external devices such as the processing unit 106 and system memory unit 108. The processing unit 106 and the system memory unit 108 are coupled to the system bus 104 via a bridge and memory controller 110.
Although the processing unit 106 may be the central processing unit (CPU) of a system 100, it does not necessarily have to be the CPU. It can be one of a variety of processors in a multiprocessor system. In one example, a LAN interface 114 is provided to couple the processing system 100 to a local area network (LAN) to allow packet receipt and transmission. Similarly, a Wide Area Network (WAN) interface 112 can also be provided to connect the processing system to a WAN (not shown) such as the Internet. The WAN interface manages in-bound and out-bound packets to allow automatic decryption and authentication processing.
According to various embodiments, the cryptography accelerator 102 is an application specific integrated circuit (ASIC) coupled to the processor 106. The cryptography accelerator 102 can also be a programmable logic device (PLD), field programmable gate array (FPGA), or other device coupled to the processor 106. According to specific embodiments, the cryptography accelerator 102 is implemented either on a card connected to the bus 104 or as a standalone chip integrated in the system 100.
In other embodiments, the cryptography accelerator 102 itself is integrated into the processing core of a CPU of system 100, such as that available from Tensilica Corporation of Santa Clara, Calif. or ARC Cores of San Jose, Calif. In another embodiment, techniques and mechanisms of the present invention are integrated into a CPU such as a CPU available from Intel Corporation of San Jose, Calif. or AMD Corporation of Sunnyvale, Calif. By implementing cryptography accelerator functionality entirely on the processor 106, a separate card or chip in the system 100 is not needed. In still other embodiments, the processing system 100 including the cryptography accelerator 102 is implemented as a system on a chip (SOC). The network interfaces, memory, processing core, and cryptography accelerator functionality are provided on a single integrated circuit device.
The cryptography accelerator 102 is capable of implementing various network security standards, such as Secure Sockets Layer/Transport Layer Security (SSL/TLS), which provide application-transparent encryption and authentication services for network traffic. Network security standards such as SSL/TLS provide authentication through the use of hash algorithms and encryption through the use of encryption algorithms. Two commonly used hash algorithms are MD5 and the Secure Hash algorithm (SHA-1). Other hash algorithms such as MD4 and MD2 are also available. Two commonly used encryption algorithms are DES and RC4. Other encryption algorithms such as triple DES are also available. Authentication and encryption algorithms are described in Applied Cryptography, Bruce Schneier, John Wiley & Sons, Inc. (ISBN 0471128457), incorporated by reference in its entirety for all purposes.
FIG. 2 is a diagrammatic representation of one example of a cryptography accelerator 201. The cryptography accelerator 201 includes an input interface 203 connected to a host such as an external processor. According to various embodiments, the interface 203 receives information from the host for processing and sends information to the host when processing is completed. In typical implementations, the input interface include multiple ports. Each of the different ports may be used to provide a different interface to an external resource such as a host or network card. In one example, one port is a streaming interface port configured to allow the input of data streams for processing in the cryptographic processing cores. Another port is a Gigabit MAC (media access control) interface configured to receive individual packets.
According to various embodiments, the Gigabit MAC provides packet processing such as collision detection, back pressure, and error detection for received data. In one example, another port is a memory mapped port allowing the cryptography accelerator to obtain data from memory associated with the host. Each of the different ports may include buffers of various sizes. In one example, the buffer size is determined based on the expected packet size. For example, much larger buffers would have to be provided to hold incoming traffic for ports supporting 9 k byte packets than for ports that support only 2 k byte packets. In conventional implementations, a system designer would estimate optimal buffer sizes for the various ports. However, because each port maintains its own buffer, inefficiencies in buffer allocation can occur. Some port buffers may be underutilized while other ports receiving a large amount of traffic may not have sufficient buffer space.
In typical implementations, small buffers are also provided in data paths associated with cryptographic processing cores 217 and 209. These buffers are typically required to store data for various cryptography operations along various data paths. Having a large number of separate, fixed sized buffers leads to inefficiencies in both chip design, cost, and resource allocation. Consequently, the techniques of the present invention provide mechanisms for efficiently allocating a shared memory resource that can be optimized for different ports as well as for data paths associated with cryptographic operations.
The shared resource allows the decoupling of the interface from the various cryptographic processing cores. In one example, shared buffers are provided in both input interface 203 and output interface (not shown). The shared resource can be allocated and reallocated based on the particular specifications of the input and output ports.
FIG. 3 is a diagrammatic representation of one example of a cryptography accelerator having a shared resource. The cryptography accelerator 301 includes a data input unit 303 having multiple input ports 311, 313, 315, and 317. In one example, the data input unit 303 takes data in a round robin fashion from each of the four input ports. The data input unit 303 can then allocate space in a shared resource, here a shared input buffer, for each of the received data blocks. Information associated with the data, such as data length, packet type, start of packet information, end of packet information, and ordering information is also maintained based on the associated input port identified.
Using information associated with the data, the data input unit 305 can then determine how the data should be processed. In one example, the data may require no processing at all, and may be forwarded to a bypass line 371 to allow output of the data from the cryptography accelerator 301 with substantially no cryptographic operations performed on the data. In typical implementations, the cryptography accelerator 102 includes multiple ports used for communication with external devices such as the processing unit 106 and system memory unit 108.
In a similar manner, the data input unit 303 may determine that the data from one of the input ports should be processed using one of the cryptographic processing core data paths 331, 333, 335, 337, 341, 343, 345, and 347. Any mechanism shared by various input ports to buffer and distribute data to various cryptographic processing data paths is referred to herein as a data input unit. According to various embodiments, the data input unit 303 determines whether to forward data to cryptographic processing core blocks 339 or 349 based on load information.
The data input unit 303 is configurable to provide buffering for all the different data has in the device. As noted above, in typical implementations, individual buffers were provided not only for the various ports in a cryptography accelerator, but also for the various data paths in a device. According to various embodiments, a single shared resource is provided in the data input unit to provide for buffering the various ports in the cryptographic accelerator and the various data paths in the cryptography accelerator.
In some embodiments, the cryptography accelerator 301 also includes a data routing unit 305 having multiple output ports 351, 353, 355, and 357. Any mechanism shared by output ports to buffer cryptographically processed data is referred to herein as a data routing unit. According to various embodiments, the data routing unit manages the ordering and delay of the data targeted at the various output ports. In typical embodiments, individual buffers were also associated with each of the various output ports. However, the techniques of the present invention provide a shared resource for the various output ports. According to various embodiments, the various ports are not configured with fixed size buffers and each of the ports can be modified to accommodate different types of traffic based on user needs. In one example, a particular output port may be configured to handle large size packets by allocating more buffer space in the data routing unit shared resource to that particular port.
FIG. 4 is a diagrammatic representation showing more detail on one example of a data input unit 401. Data input unit 401 includes input ports 411, 413, 415, and 417. In one embodiment, the input controller 421 takes data from each of the four input ports in round robin fashion. The input controller 421 determines if any input buffer space is available for a particular port. In one example, input controller 421 determines if buffer space is available in input buffer 441 by examining buffer pointer table 451. Buffer pointer table 451 includes a list of pointers each associated with a block of memory in input buffer 441. In one instance, each pointer in the buffer pointer table 451 references a 128 byte chunk of memory in the input buffer 441. Consequently, it should be noted that the input buffer 441 does not have to be physically divided amongst the input ports in order to dynamically allocate buffer space for each of the various input ports. Although physically allocating the input buffer 441 to the various input ports is one possible mechanism for providing an allocable shared resource, the techniques of the present invention also provide for allocation of pointers to the input buffer 441.
According to various embodiments, blocks of pointers in the buffer pointer table 451 are allocated to the various input ports. The input controller 421 determines if any pointer associated with the input port is available. If a pointer associated with the input port is free or available, the data in the input port is forwarded to input buffer 441 and the pointer is assigned to the data block. In one implementation, an entry in the buffer pointer table 451 lists the free pointers available and their associated input ports. In another implementation, each entry is associated with a flag indicating if the pointer is being used and what port the pointer is associated with. If no pointers associated with the input port or available, the input controller does not hold data from the input port, as all buffer space allocated to the input port has been consumed. Any mechanism for tracking data blocks in a shared resource where the data blocks are destined for cryptographic processing is referred to herein as a buffer pointer table. Any mechanism for allocating the pointers in the buffer pointer table to various data blocks is referred to herein as an input controller 421.
When the input controller 421 has assigned data pointers from the buffer pointer table 451, a load distribution unit 461 can select data from the buffer pointer table entries. The order for all data on a particular port is maintained since the load distribution unit can be configured to select data in order from a single buffer pointer table 451. According to various embodiments, load distribution unit 461 can select data referenced by the buffer pointer table 451 using a variety of mechanisms. In one example, the load distribution unit 461 selects data from ports that have consumed all allocated buffer space. The load distribution unit can also select data entries if the data entries are entire packets. In another example, load distribution unit can select data in round-robin fashion. The load distribution unit also be configured to identify data associated with cryptographic processing.
As will be appreciated, a data destined for cryptographic processing is often processed based on information associated with the data block. In one example, a data block is processed after obtaining security association information associated with the data block. The security association information includes keys such as session keys, initialization vectors, and the particular algorithms needed to process the data. Security association data is often determined using combinations of source and destination addresses and source and destination port numbers. For example, a packet with a source of A and a destination of B may be determined to need triple DES processing, MD5 authentication, and a session key available to the cryptographic processing core from a particular memory address. The load distribution unit 461 identifies information needed for cryptographic processing of the data and provides a pointer to the information. In many instances, the pointer is a pointer to the header of a packet stored in the input buffer 441.
According to various embodiments, the load distribution unit 461 passes information to target list 471. In one example, target list 471 includes multiple lists, each list associated with a particular data path. One list may be associated with bypass data that should be passed through the cryptography accelerator substantially without processing. Other lists may be associated with public key operation data paths. In one example, a modular exponentiation unit list is provided for performing modulus operations on data in the input buffer 441. Still other lists include pointers to data blocks in buffer memory 441 requiring processing by one of the cryptographic accelerator course. The data pointer lists are associated with a header pointer list that identifies how to derive information such as security association information for processing the data corresponding to the pointers in the data pointer list. The output controller 481 is responsible for forwarding data associated with the pointers in the target list to the various data paths. Typically, data associated with each of the lists in the target list 471 is pulled in round-robin fashion. In one example data associated with each list gets the same amount of bandwidth out of the input buffer 441.
The input buffer allows storage of information for use in various cryptographic operations as well as the allocation of memory to various ports as provided by the buffer pointer table 451. FIG. 5 is a diagrammatic representation, of a buffer pointer table 501. According to various embodiments, the buffer pointer table 501 includes a free pointers entry 511 listing the available free pointers associated with free blocks in the input buffer memory. In one example, blocks of pointers are allocated to each of the various ports in the data input unit. For example, buffer pointer entry 521 and 523 are associated with port one. Buffer pointer entry 531 is associated with port two. Buffer pointer entries 541, 543, 545, 547, and 549 are associated with port three. Buffer pointer entries 551 and 553 are associated with port 4. As long as free pointers are available for a particular port, an input controller can continue to pull data from the particular port, store the data in input buffer memory, and assign an available pointer associated with the port to the data block. However, when no free pointers are available for a particular port, the input controller no longer pulls data from that port. The port is blocked until space is made available in the input buffer as represented by the buffer pointer table.
It should be noted that much of the load distribution processing and the data path decision processing is performed using pointers to blocks of memory in the input buffer. In a cryptography processing context, this provides important benefits including the capability to process data and associated security association information along data paths where the data paths can be implemented substantially without data path buffers.
FIG. 6 is a diagrammatic representation of a target list. According to various embodiments, target list 601 includes multiple lists associated with various data paths. In one example, target list 601 includes a bypass list 643 associated with data to be passed through the cryptography accelerator without cryptographic processing. A modular exponentiation buffer list 611 is provided for public key processing of data. According to various embodiments, merge data unit buffer list 621 and merge data unit buffer list 623 are provided for data to be forwarded to cryptographic processing cores. Merge data unit buffer list 621 and 623 are associated with pointers to data that will be merged with security association information before cryptographic processing is performed.
Consequently, merge data unit buffer lists 621 and 623 are linked to policy security association lookup unit header list 631. When a pointer is provided to merge data unit buffer list 621, a pointer is also provided to policy security association lookup unit header list 631. The merge data unit buffer list 621 pointer allows later combination of data with security association information extracted from a policy security association lookup unit. When the data is combined with the security association information, the data can be processed using one of a number of cryptographic processing cores.
FIG. 7 is a diagrammatic representation of data passed to a merge data unit. According to various embodiments, the output controller 781 associated with the data input unit 701 provides data 711 and 713 to a merge data unit 793. However, before the data 711 and header 713 can be processed using one of a number of cryptographic processing cores, the data typically is combined with security association information. According to various embodiments, the security association information is derived by a policy security association lookup unit. In one embodiment, the policy security association lookup unit reads information from memory and prepends information to data 711 and header 713. The location in memory of the security association data structure can be specified directly or by identifiers passed by the output controller 781. In one example the output controller 781 passes a security association handle 715 to the policy security association lookup unit 791.
In one example, the policy security association lookup unit 791 uses the information in the security association handle 715 to identify security association information. The information identified can be used for both inbound and outbound packets to allow the packets to be classified into flows. In one instance, the security association handle 715 includes up to 2 k of the header of the associated packet. The policy security association lookup unit then issues a security association update 717 to modify data such as sequence numbers associated with a flow.
The policy security association lookup unit 791 acquires security association data 721 and passes the security association data 725 to a merge data unit 793. The merge data unit 793 combines the security association data 723 with the data 711 and header 713. It should be noted that the policy security association lookup unit processing may vary depending on whether the packet is an inbound packet or an outbound packet. For an outbound packet, the policy security association lookup unit may also be responsible for determining header information such as outer IP header information. For an inbound packet, the outer IP header information is included in the data 711 and header information 713. Various types of error checking can also be performed by the policy security association lookup unit 791 to determine that the flow referenced by a security association handle 715 is a valid one.
It should be noted that each merge data unit 793 can then pass the combined data to one of multiple cryptography processing core data paths. In one example, two merge data units are provided in a cryptography accelerator having a data input unit and eight processing cores. The two merge data units are also associated with a single policy security association lookup unit. Each merge data is coupled to four cryptographic cores. In some examples, each merge data unit would select one of the four cryptographic processing cores to handle data based on load.
FIG. 8 is a flow process diagram showing data handling in the cryptography accelerator. At 801, data is received from one of any number of input ports associated with the cryptography accelerator. As noted above, each port may be configured to handle different types of traffic such as streaming, packet, large packet, or memory mapped data. At 803, a free buffer is pointer table is used to track the packet and the packet type. It should be noted that data is typically pulled in round-robin fashion from one of the input ports as long as free pointers are available in the buffer pointer table. According to various embodiments, blocks of pointers are allocated to each of the input ports. In this manner, the system designer can allocate input buffer memory associated with the pointers to each of the various input ports based on the needs and requirements of each port or the corresponding traffic. At 805, the load distributor schedules the data sequence for processing on a data path having the lowest load.
According to various embodiments, the load distributor schedules data sequences by scheduling the pointers in the buffer pointer table. At 811, the load distributor provides a pointer to a policy security association lookup unit list. It should be noted that some data sequences may require no cryptographic core processing and may instead be provided to a bypass list or a public key processing list. At 813, the output controller pulls data from the input buffer along with any associated policy security association lookup unit header information. The output controller pulls data from the input buffer based on pointers provided in a target list. At 815, the policy security association lookup is performed using information such as header information associated with the data sequence. At 821, a merge data unit combines the data sequence with the results of a policy security association lookup. At 823, input buffer memory and any associated free pointers are returned.
FIG. 9 is a diagrammatic representation of a data routing unit 901. As noted above, the data input unit provides the input interface for a cryptography accelerator while the data routing unit provides the output interface for the cryptography accelerator. According to various embodiments, the data routing unit manages the ordering of cryptographically processed data for the various egress output ports. The input controller 921 is coupled to a variety of data paths such as bypass, public key processing, and cryptographic core processing data paths. According to various embodiments, data blocks in a data sequence may be received out of order by an input controller as several data paths may be associated with cryptographic processing cores. For example, blocks 1, 2, and 4 may be received through a first data path and blocks 3 and 5 may be received through a second data path. The data routing unit is configured to order the data blocks and provide them to the appropriate output port.
According to various embodiments, the input controller 921 writes data blocks to buffer memory and data block pointers to a buffer pointer table 951 in the order that the input controller receives them. In one example, pointers to blocks 1, 2, and 4 may be placed into a first port buffer list while pointers to blocks 3 and 5 may be placed in a second port buffer list. A routing unit 961 recognizes the ordering and pulls pointers in order and places the pointers in the target list 971. In many implementations, the target list 971 includes lists of pointers each associated with the various output ports. In one example, lists of pointers are provided in target list 971. In one example, four lists of pointers correspond to output ports 911, 913, 915, and 917. Each pointer in the target list 971 corresponds to a block in output buffer 991. It should be noted that in the data input unit, the pointers in the buffer pointer table are allocable to the various input ports based on the particular needs and requirements of the input ports.
In the data routing unit, however, the pointers in the target list 971 are allocable to the various output ports based upon the needs and requirements of the various output ports. In one example, output port 911 may be configured to support large packets. Consequently, the large number of output buffer memory manager 991 would be allocated to output port 911. In one example, the routing unit 961 would pull a first block pointer associated with a flow and place the pointer into a buffer list associated with a Gigabit MAC output port. The routing unit 961 would not pull another block from that particular flow until the second block pointer is pulled. In this manner, the routing unit 961 can pull data blocks in order from the buffer pointer table even if the blocks of data came from different data paths in the cryptographic accelerator.
It should be noted that although the blocks on a particular data path will typically be in order, the blocks received from multiple data paths by the input controller will not necessarily be in order. That is, blocks 3 and 5 in a sequence may be received along a data path before blocks 1, 2 and 4 are received from another data path. The routing unit 961 pulls pointers to data blocks in order from the buffer pointer table and places them in an output port list in the target list 971. The output controller 981 uses the pointers in the target list 971 to identify data blocks in the output buffer 991 to forward to the output ports.
FIG. 10 is a flow process diagram showing data handling at an output interface associated with the cryptography accelerator. At 1001, input controller receives data from a data path. At 1003, data is written to the output buffer 991 and the pointer is written to the buffer pointer table 951. The routing unit 961 pulls data blocks in order from the buffer pointer table 951 at 1005. At 1011, the routing block forwards the pointers to the target buffer list upon determining that pointers are available in the target list. At 1013, the output controller may immediately forward data associated with the pointers in the target list or may wait until a packet size is reached before forwarding data out through a particular port.
While the invention has been particularly shown and described with reference to specific embodiments thereof, it will be understood by those skilled in the art that changes in the form and details of the disclosed embodiments may be made without departing from the spirit or scope of the invention. It is therefore intended that the invention be interpreted to include all variations and equivalents that fall within the true spirit and scope of the present invention.
Claims (21)
1. A cryptography accelerator, comprising:
a plurality of input ports configured to receive data comprising header information and data blocks;
a plurality of cryptographic processing cores, each cryptographic processing core having a plurality of data paths;
an input buffer coupled to the plurality of input ports and cryptographic processing cores, wherein the input buffer is shared by the plurality of input ports and the plurality of data paths associated with each cryptographic processing core in the plurality of cryptographic processing cores;
an input controller coupled to the plurality of input ports, wherein the input controller dynamically allocates resources of the input buffer to the plurality of input ports and to the plurality of data paths associated with each cryptographic processing core in the plurality of cryptographic processing cores; and
wherein the shared input buffer is dynamically allocable by varying a number of entries in a buffer pointer table allocated to each of the plurality of ports.
2. The cryptography accelerator of claim 1, wherein policy and security association information is extracted based on source and destination addresses and source and destination ports of the data blocks.
3. The cryptography accelerator of claim 1, wherein policy and security association information comprises key and algorithm information.
4. The cryptography accelerator of claim 1, wherein the plurality of input ports comprise a streaming interface port.
5. The cryptography accelerator of claim 4, wherein the plurality of input ports further comprise a memory mapped port.
6. The cryptography accelerator of claim 1, wherein the buffer pointer table comprises a plurality of pointers.
7. The cryptographic accelerator of claim 1, further comprising:
policy security association lookup circuitry configured to receive header information and determine policy and security association information associated with the data blocks, wherein the policy and security association information is forwarded with the data blocks to cryptographic processing cores.
8. The cryptography accelerator of claim 7, wherein the policy security association lookup circuitry receives a pointer to header information.
9. A cryptography accelerator comprising:
a plurality of input ports configured to receive data comprising header information and data blocks;
a plurality of cryptographic processing cores; an input buffer coupled to the plurality of input ports and cryptographic processing cores, wherein the input buffer is shared by the plurality of input ports and the plurality of cryptographic processing cores;
an input controller coupled to the plurality of input ports, wherein the input controller dynamically allocates resources of the input buffer to the plurality of input ports and the plurality of cryptographic processing cores; and
a buffer pointer table associated with the plurality of input ports, the buffer pointer table having a plurality of entries configured to hold header information from the plurality of input ports, the plurality of entries referencing data blocks in the shared input buffer.
10. The cryptography accelerator of claim 9, further comprising:
a data input unit load distributor configured to select entries from the buffer pointer table.
11. The cryptography accelerator of claim 10, further comprising:
an output controller configured to receive buffer pointer table entries from the load distributor, pull data blocks corresponding to the entries from the input buffer, and forward the data blocks to a plurality of data paths associated with the plurality of cryptographic processing cores.
12. The cryptography accelerator of claim 11, further comprising a merge data unit coupled to the output controller and the policy security association lookup circuitry, wherein the merge data unit is configured to wait for the policy and security association information and the corresponding data block before forwarding the policy and security association information along with the data block to a cryptographic processing core.
13. The cryptographic accelerator of claim 7, wherein the input controller is configured to write data blocks from the plurality of input ports into the input buffer and write entries corresponding to the data blocks into the buffer pointer table.
14. A method for data handling in a cryptography accelerator having a plurality of input ports and a plurality of cryptographic processing cores, comprising:
each cryptographic processing core having a plurality of data paths;
receiving data at the plurality of input ports; dynamically allocating space in an input buffer shared by the plurality of input ports and the plurality of data paths associated with each cryptographic processing core in the plurality of cryptographic processing cores to the received data; and
allocating space in the shared input buffer to data used by the a data path associated a cryptographic processing core to process the received data; and
wherein the input buffer is dynamically allocated by varying the number of entries in a buffer pointer table allocated to each of the plurality of input ports.
15. The method of claim 14, wherein the shared resource is a buffer shared by the plurality of input ports.
16. The method of claim 14, wherein the references are pointers to entries in the shared resource.
17. The method of claim 16, wherein the references are included in a buffer pointer table.
18. The method of claim 17, wherein the shared resource can be allocated based on needs of particular input ports.
19. A method for data handling in a cryptography accelerator having a plurality of input ports and a plurality of cryptographic processing cores comprising:
receiving data at the plurality of input ports;
dynamically allocating space in an input buffer shared by the plurality of input ports and the plurality of cryptographic processing cores to the received data;
allocating space in the shared input buffer to data used by the cryptographic processing core to process the received data;
providing references to the received data in the shared input buffer, wherein the references identify the received data as well as the type of the received data;
performing a policy security association lookup to determine policy and security association information associated with the received data; and
forwarding the received data along with policy and security association to the plurality of cryptographic processing cores.
20. A cryptography accelerator, comprising:
a plurality of input ports configured to receive data comprising header information and data blocks;
a plurality of cryptographic processing cores, each cryptographic processing core having a plurality of data paths;
a bypass line coupling the plurality of input ports to a plurality of output ports;
an input buffer coupled to the plurality of input ports and cryptographic processing cores, wherein the input buffer is shared by the plurality of
input ports and the plurality of data paths associated with each cryptographic processing core in the plurality of cryptographic processing cores;
an input controller coupled to the plurality of input ports, wherein the input controller dynamically allocates resources of the input buffer to the plurality of input ports and to the plurality of data paths associated with each cryptographic processing core in the plurality of cryptographic processing cores; and
a target list having a bypass list associated with data blocks to be passed through the cryptography accelerator without cryptographic processing.
21. A cryptography accelerator, comprising:
a plurality of input ports configured to receive data comprising header information and data blocks;
a plurality of cryptographic processing cores;
a bypass line coupling the plurality of input ports to a plurality of output ports;
an input buffer coupled to the plurality of input ports and cryptographic processing cores, wherein the input buffer is shared by the plurality of input ports and the plurality of cryptographic processing cores and wherein the input buffer is dynamically allocated by varying the number of entries in a buffer pointer table allocated to each of the plurality of input ports;
an input controller coupled to the plurality of input ports, wherein the input controller dynamically allocates resources of the input buffer to the plurality of input ports and the plurality of cryptographic processing cores; and
a target list having a bypass list associated with data blocks to be passed through the cryptography accelerator without cryptographic processing.
US10/350,902 2002-12-18 2003-01-23 Cryptography accelerator interface decoupling from cryptography processing cores Active 2024-09-10 US7568110B2 (en)
Priority Applications (2)
Application Number Priority Date Filing Date Title
US43474502P true 2002-12-18 2002-12-18
US10/350,902 US7568110B2 (en) 2002-12-18 2003-01-23 Cryptography accelerator interface decoupling from cryptography processing cores
Applications Claiming Priority (1)
Application Number Priority Date Filing Date Title
US10/350,902 US7568110B2 (en) 2002-12-18 2003-01-23 Cryptography accelerator interface decoupling from cryptography processing cores
Publications (2)
Publication Number Publication Date
US20040123119A1 US20040123119A1 (en) 2004-06-24
US7568110B2 true US7568110B2 (en) 2009-07-28
Family
ID=32599701
Family Applications (1)
Application Number Title Priority Date Filing Date
US10/350,902 Active 2024-09-10 US7568110B2 (en) 2002-12-18 2003-01-23 Cryptography accelerator interface decoupling from cryptography processing cores
Country Status (1)
Country Link
US (1) US7568110B2 (en)
Cited By (3)
* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040054914A1 (en) * 2002-04-30 2004-03-18 Sullivan Patrick L. Method and apparatus for in-line serial data encryption
US20060259769A1 (en) * 2003-09-30 2006-11-16 Infineon Technologies Ag Method and device for encryption and decryption
US20090113218A1 (en) * 2007-10-30 2009-04-30 Sandisk Il Ltd. Secure data processing for unaligned data
Families Citing this family (15)
* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7996670B1 (en) 1999-07-08 2011-08-09 Broadcom Corporation Classification engine in a cryptography acceleration chip
US20040123123A1 (en) * 2002-12-18 2004-06-24 Buer Mark L. Methods and apparatus for accessing security association information in a cryptography accelerator
US20040123120A1 (en) * 2002-12-18 2004-06-24 Broadcom Corporation Cryptography accelerator input interface data handling
US7434043B2 (en) 2002-12-18 2008-10-07 Broadcom Corporation Cryptography accelerator data routing unit
CN100499451C (en) * 2003-08-26 2009-06-10 中兴通讯股份有限公司 Network communication safe processor and its data processing method
US20060136717A1 (en) 2004-12-20 2006-06-22 Mark Buer System and method for authentication via a proximate device
US8295484B2 (en) * 2004-12-21 2012-10-23 Broadcom Corporation System and method for securing data from a remote input device
US7409478B2 (en) * 2006-04-21 2008-08-05 At&T Delaware Intellectual Property Inc. Peripheral hardware devices providing multiple interfaces and related systems and methods
US7562162B2 (en) 2007-04-25 2009-07-14 At&T Intellectual Property I, L.P. Systems and methods for distributed computing utilizing a smart memory apparatus
US7925794B2 (en) * 2007-08-17 2011-04-12 At&T Intellectual Property I, L.P. Systems and methods for localizing a network storage device
US8644504B2 (en) * 2008-02-28 2014-02-04 Silicon Image, Inc. Method, apparatus, and system for deciphering media content stream
US8374346B2 (en) * 2009-01-09 2013-02-12 Silicon Image, Inc. Method, apparatus, and system for pre-authentication and keep-authentication of content protected ports
US8185739B2 (en) 2009-01-09 2012-05-22 Silicon Image, Inc. Method and system for detecting successful authentication of multiple ports in a time-based roving architecture
US9459672B2 (en) 2013-06-28 2016-10-04 International Business Machines Corporation Capacitance management
FR3016065B1 (en) * 2013-12-26 2016-02-05 Thales Sa Method for designing a reconfigurable architecture for processing a set of multi-level security operations
Citations (97)
* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4491909A (en) 1981-03-18 1985-01-01 International Business Machines Corporation Data processing system having shared memory
US4774706A (en) 1985-10-29 1988-09-27 British Telecommunications Public Limited Company Packet handling communications network
USRE33189E (en) 1981-11-19 1990-03-27 Communications Satellite Corporation Security system for SSTV encryption
US5161193A (en) 1990-06-29 1992-11-03 Digital Equipment Corporation Pipelined cryptography processor and method for its use in communication networks
US5297206A (en) 1992-03-19 1994-03-22 Orton Glenn A Cryptographic method for communication and electronic signatures
US5329623A (en) 1992-06-17 1994-07-12 The Trustees Of The University Of Pennsylvania Apparatus for providing cryptographic support in a network
US5365589A (en) 1992-02-07 1994-11-15 Gutowitz Howard A Method and apparatus for encryption, decryption and authentication using dynamical systems
US5471482A (en) 1994-04-05 1995-11-28 Unisys Corporation VLSI embedded RAM test
US5631960A (en) 1995-08-31 1997-05-20 National Semiconductor Corporation Autotest of encryption algorithms in embedded secure encryption devices
US5734829A (en) 1995-10-20 1998-03-31 International Business Machines Corporation Method and program for processing a volume of data on a parallel computer system
US5751809A (en) 1995-09-29 1998-05-12 Intel Corporation Apparatus and method for securing captured data transmitted between two sources
US5796836A (en) 1995-04-17 1998-08-18 Secure Computing Corporation Scalable key agile cryptography
US5796744A (en) 1997-09-12 1998-08-18 Lockheed Martin Corporation Multi-node interconnect topology with nodes containing SCI link controllers and gigabit transceivers
US5809147A (en) 1994-03-18 1998-09-15 Koninklijke Ptt Nederland Device for cryptographically processing data packets and method of generating cryptographic processing data
EP0876026A2 (en) 1997-04-30 1998-11-04 Motorola, Inc. Programmable crypto processing system and method
US5867706A (en) 1996-01-26 1999-02-02 International Business Machines Corp. Method of load balancing across the processors of a server
US5870479A (en) 1993-10-25 1999-02-09 Koninklijke Ptt Nederland N.V. Device for processing data packets
US5870474A (en) 1995-12-04 1999-02-09 Scientific-Atlanta, Inc. Method and apparatus for providing conditional access in connection-oriented, interactive networks with a multiplicity of service providers
US5933503A (en) 1996-03-15 1999-08-03 Novell, Inc Controlled modular cryptography apparatus and method
US5936967A (en) 1994-10-17 1999-08-10 Lucent Technologies, Inc. Multi-channel broadband adaptation processing
US5943338A (en) 1996-08-19 1999-08-24 3Com Corporation Redundant ATM interconnect mechanism
US5949881A (en) * 1995-12-04 1999-09-07 Intel Corporation Apparatus and method for cryptographic companion imprinting
US5953416A (en) * 1996-11-12 1999-09-14 Fujitsu Limited Data processing apparatus
US5983350A (en) 1996-09-18 1999-11-09 Secure Computing Corporation Secure firewall supporting different levels of authentication based on address or encryption status
US6003135A (en) 1997-06-04 1999-12-14 Spyrus, Inc. Modular security device
US6038551A (en) 1996-03-11 2000-03-14 Microsoft Corporation System and method for configuring and managing resources on a multi-purpose integrated circuit card using a personal computer
US6069957A (en) 1997-03-07 2000-05-30 Lucent Technologies Inc. Method and apparatus for providing hierarchical key system in restricted-access television system
US6111858A (en) 1997-02-18 2000-08-29 Virata Limited Proxy-controlled ATM subnetwork
US6115816A (en) 1996-12-18 2000-09-05 Intel Corporation Optimized security functionality in an electronic system
US6157955A (en) 1998-06-15 2000-12-05 Intel Corporation Packet processing system including a policy engine having a classification unit
US6189100B1 (en) 1998-06-30 2001-02-13 Microsoft Corporation Ensuring the integrity of remote boot client data
US6216167B1 (en) 1997-10-31 2001-04-10 Nortel Networks Limited Efficient path based forwarding and multicast forwarding
US6226710B1 (en) 1997-11-14 2001-05-01 Utmc Microelectronic Systems Inc. Content addressable memory (CAM) engine
US6269163B1 (en) 1998-06-15 2001-07-31 Rsa Security Inc. Enhanced block ciphers with data-dependent rotations
EP1132800A2 (en) 2000-03-08 2001-09-12 Rainbow Technologies Inc. Non-wire contact device application for cryptographic module interfaces
US6295604B1 (en) 1998-05-26 2001-09-25 Intel Corporation Cryptographic packet processing unit
US6295602B1 (en) 1998-12-30 2001-09-25 Spyrus, Inc. Event-driven serialization of access to shared resources
WO2001080483A2 (en) 2000-04-13 2001-10-25 Broadcom Corporation Authentication engine architecture and method
US6320964B1 (en) * 1998-08-26 2001-11-20 Intel Corporation Cryptographic accelerator
US6327625B1 (en) 1999-11-30 2001-12-04 3Com Corporation FIFO-based network interface supporting out-of-order processing
US20020004904A1 (en) * 2000-05-11 2002-01-10 Blaker David M. Cryptographic data processing systems, computer program products, and methods of operating same in which multiple cryptographic execution units execute commands from a host processor in parallel
US20020009076A1 (en) 2000-01-27 2002-01-24 Ton Engbersen Method and means for classifying data packets
US6349405B1 (en) 1999-05-18 2002-02-19 Solidum Systems Corp. Packet classification state machine
US20020039418A1 (en) 2000-05-15 2002-04-04 Fortress U&T Div. M-Systems Flash Disk Pioneers Ltd. Extending the range of computational fields of integers
US20020044649A1 (en) 1998-12-24 2002-04-18 Certicom Corp. Method for accelerating cryptographic operations on elliptic curves
US6378072B1 (en) * 1998-02-03 2002-04-23 Compaq Computer Corporation Cryptographic system
US20020057796A1 (en) 1998-12-24 2002-05-16 Lambert Robert J. Method for accelerating cryptographic operations on elliptic curves
US6393564B1 (en) 1997-09-30 2002-05-21 Matsushita Electric Industrial Co., Ltd. Decrypting device
US6393026B1 (en) 1998-09-17 2002-05-21 Nortel Networks Limited Data packet processing system and method for a router
WO2002041599A1 (en) 2000-11-17 2002-05-23 British Telecommunications Public Limited Company Interface device
US20020078342A1 (en) 2000-09-25 2002-06-20 Broadcom Corporation E-commerce security processor alignment logic
US20020085560A1 (en) 2000-05-24 2002-07-04 Jim Cathey Programmable packet processor with flow resolution logic
US20020097724A1 (en) * 2001-01-09 2002-07-25 Matti Halme Processing of data packets within a network element cluster
US20020108048A1 (en) 2000-12-13 2002-08-08 Broadcom Corporation Methods and apparatus for implementing a cryptography engine
US6477646B1 (en) * 1999-07-08 2002-11-05 Broadcom Corporation Security chip architecture and implementations for cryptography acceleration
US20020165718A1 (en) 1999-05-28 2002-11-07 David L. Graumann Audio classifier for half duplex communication
US6484257B1 (en) 1999-02-27 2002-11-19 Alonzo Ellis System and method for maintaining N number of simultaneous cryptographic sessions using a distributed computing environment
US6493347B2 (en) 1996-12-16 2002-12-10 Juniper Networks, Inc. Memory organization in a switching device
US20020191790A1 (en) * 2001-06-13 2002-12-19 Anand Satish N. Single-pass cryptographic processor and method
US20030005144A1 (en) 1998-10-28 2003-01-02 Robert Engel Efficient classification manipulation and control of network transmissions by associating network flows with rule based functions
US20030014627A1 (en) * 1999-07-08 2003-01-16 Broadcom Corporation Distributed processing in a cryptography acceleration chip
US20030023846A1 (en) 1999-07-08 2003-01-30 Broadcom Corporation Classification engine in a cryptography acceleration chip
US20030041252A1 (en) 2001-08-24 2003-02-27 Broadcom Corporation Methods and apparatus for collapsing interrupts
US6529508B1 (en) 1999-02-01 2003-03-04 Redback Networks Inc. Methods and apparatus for packet classification with multiple answer sets
US20030084309A1 (en) * 2001-10-22 2003-05-01 Sun Microsystems, Inc. Stream processor with cryptographic co-processor
US20030084308A1 (en) 2001-10-03 2003-05-01 Van Rijnswou Sander Matthijs Memory encryption
US20040039936A1 (en) * 2002-08-21 2004-02-26 Yi-Sern Lai Apparatus and method for high speed IPSec processing
US6701432B1 (en) 1999-04-01 2004-03-02 Netscreen Technologies, Inc. Firewall including local bus
US6704871B1 (en) 1997-09-16 2004-03-09 Safenet, Inc. Cryptographic co-processor
US6708273B1 (en) * 1997-09-16 2004-03-16 Safenet, Inc. Apparatus and method for implementing IPSEC transforms within an integrated circuit
US20040054914A1 (en) 2002-04-30 2004-03-18 Sullivan Patrick L. Method and apparatus for in-line serial data encryption
US20040083375A1 (en) 2002-04-18 2004-04-29 International Business Machines Corporation Initializing, maintaining, updating and recovering secure operation within an integrated system employing a data access control function
US20040098600A1 (en) 2002-11-14 2004-05-20 Broadcom Corporation Cryptography accelerator application program interface
US6751677B1 (en) 1999-08-24 2004-06-15 Hewlett-Packard Development Company, L.P. Method and apparatus for allowing a secure and transparent communication between a user device and servers of a data access network system via a firewall and a gateway
US6751728B1 (en) 1999-06-16 2004-06-15 Microsoft Corporation System and method of transmitting encrypted packets through a network access point
US20040123123A1 (en) 2002-12-18 2004-06-24 Buer Mark L. Methods and apparatus for accessing security association information in a cryptography accelerator
US20040123120A1 (en) 2002-12-18 2004-06-24 Broadcom Corporation Cryptography accelerator input interface data handling
US20040123096A1 (en) 2002-12-18 2004-06-24 Broadcom Corporation Cryptography accelerator data routing unit
US6760444B1 (en) 1999-01-08 2004-07-06 Cisco Technology, Inc. Mobile IP authentication
US6778495B1 (en) 2000-05-17 2004-08-17 Cisco Technology, Inc. Combining multilink and IP per-destination load balancing over a multilink bundle
US6791947B2 (en) 1996-12-16 2004-09-14 Juniper Networks In-line packet processing
US6807183B1 (en) 2000-05-09 2004-10-19 Advanced Micro Devices, Inc. Arrangement for reading a prescribed location of a FIFO buffer in a network switch port
US6862278B1 (en) 1998-06-18 2005-03-01 Microsoft Corporation System and method using a packetized encoded bitstream for parallel compression and decompression
US6909713B2 (en) * 2001-09-05 2005-06-21 Intel Corporation Hash-based data frame distribution for web switches
US6963979B2 (en) * 1999-10-20 2005-11-08 Aep Systems Limited Cryptographic accelerator
US6981140B1 (en) 1999-08-17 2005-12-27 Hewlett-Packard Development Company, L.P. Robust encryption and decryption of packetized data transferred across communications networks
US6983374B2 (en) 2000-02-14 2006-01-03 Kabushiki Kaisha Toshiba Tamper resistant microprocessor
US6983366B1 (en) 2000-02-14 2006-01-03 Safenet, Inc. Packet Processor
US6996842B2 (en) 2001-01-30 2006-02-07 Intel Corporation Processing internet protocol security traffic
US7003118B1 (en) * 2000-11-27 2006-02-21 3Com Corporation High performance IPSEC hardware accelerator for packet classification
US7005733B2 (en) 1999-12-30 2006-02-28 Koemmerling Oliver Anti tamper encapsulation for an integrated circuit
US7017042B1 (en) * 2001-06-14 2006-03-21 Syrus Ziai Method and circuit to accelerate IPSec processing
US7020137B2 (en) 1998-07-08 2006-03-28 Broadcom Corporation Network switching architecture with fast filtering processor
US7039641B2 (en) 2000-02-24 2006-05-02 Lucent Technologies Inc. Modular packet classification
US7062657B2 (en) 2000-09-25 2006-06-13 Broadcom Corporation Methods and apparatus for hardware normalization and denormalization
US7086086B2 (en) 1999-02-27 2006-08-01 Alonzo Ellis System and method for maintaining N number of simultaneous cryptographic sessions using a distributed computing environment
US7191341B2 (en) 2002-12-18 2007-03-13 Broadcom Corporation Methods and apparatus for ordering data in a cryptography accelerator
Patent Citations (104)
* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4491909A (en) 1981-03-18 1985-01-01 International Business Machines Corporation Data processing system having shared memory
USRE33189E (en) 1981-11-19 1990-03-27 Communications Satellite Corporation Security system for SSTV encryption
US4774706A (en) 1985-10-29 1988-09-27 British Telecommunications Public Limited Company Packet handling communications network
US5161193A (en) 1990-06-29 1992-11-03 Digital Equipment Corporation Pipelined cryptography processor and method for its use in communication networks
US5365589A (en) 1992-02-07 1994-11-15 Gutowitz Howard A Method and apparatus for encryption, decryption and authentication using dynamical systems
US5297206A (en) 1992-03-19 1994-03-22 Orton Glenn A Cryptographic method for communication and electronic signatures
US5329623A (en) 1992-06-17 1994-07-12 The Trustees Of The University Of Pennsylvania Apparatus for providing cryptographic support in a network
US5870479A (en) 1993-10-25 1999-02-09 Koninklijke Ptt Nederland N.V. Device for processing data packets
US5809147A (en) 1994-03-18 1998-09-15 Koninklijke Ptt Nederland Device for cryptographically processing data packets and method of generating cryptographic processing data
US5471482A (en) 1994-04-05 1995-11-28 Unisys Corporation VLSI embedded RAM test
US5936967A (en) 1994-10-17 1999-08-10 Lucent Technologies, Inc. Multi-channel broadband adaptation processing
US5796836A (en) 1995-04-17 1998-08-18 Secure Computing Corporation Scalable key agile cryptography
US5631960A (en) 1995-08-31 1997-05-20 National Semiconductor Corporation Autotest of encryption algorithms in embedded secure encryption devices
US5751809A (en) 1995-09-29 1998-05-12 Intel Corporation Apparatus and method for securing captured data transmitted between two sources
US5734829A (en) 1995-10-20 1998-03-31 International Business Machines Corporation Method and program for processing a volume of data on a parallel computer system
US5949881A (en) * 1995-12-04 1999-09-07 Intel Corporation Apparatus and method for cryptographic companion imprinting
US5870474A (en) 1995-12-04 1999-02-09 Scientific-Atlanta, Inc. Method and apparatus for providing conditional access in connection-oriented, interactive networks with a multiplicity of service providers
US5867706A (en) 1996-01-26 1999-02-02 International Business Machines Corp. Method of load balancing across the processors of a server
US6038551A (en) 1996-03-11 2000-03-14 Microsoft Corporation System and method for configuring and managing resources on a multi-purpose integrated circuit card using a personal computer
US5933503A (en) 1996-03-15 1999-08-03 Novell, Inc Controlled modular cryptography apparatus and method
US5943338A (en) 1996-08-19 1999-08-24 3Com Corporation Redundant ATM interconnect mechanism
US5983350A (en) 1996-09-18 1999-11-09 Secure Computing Corporation Secure firewall supporting different levels of authentication based on address or encryption status
US5953416A (en) * 1996-11-12 1999-09-14 Fujitsu Limited Data processing apparatus
US6493347B2 (en) 1996-12-16 2002-12-10 Juniper Networks, Inc. Memory organization in a switching device
US6791947B2 (en) 1996-12-16 2004-09-14 Juniper Networks In-line packet processing
US6115816A (en) 1996-12-18 2000-09-05 Intel Corporation Optimized security functionality in an electronic system
US6111858A (en) 1997-02-18 2000-08-29 Virata Limited Proxy-controlled ATM subnetwork
US6069957A (en) 1997-03-07 2000-05-30 Lucent Technologies Inc. Method and apparatus for providing hierarchical key system in restricted-access television system
EP0876026A2 (en) 1997-04-30 1998-11-04 Motorola, Inc. Programmable crypto processing system and method
US6101255A (en) 1997-04-30 2000-08-08 Motorola, Inc. Programmable cryptographic processing system and method
US6003135A (en) 1997-06-04 1999-12-14 Spyrus, Inc. Modular security device
US5796744A (en) 1997-09-12 1998-08-18 Lockheed Martin Corporation Multi-node interconnect topology with nodes containing SCI link controllers and gigabit transceivers
US6704871B1 (en) 1997-09-16 2004-03-09 Safenet, Inc. Cryptographic co-processor
US6708273B1 (en) * 1997-09-16 2004-03-16 Safenet, Inc. Apparatus and method for implementing IPSEC transforms within an integrated circuit
US6393564B1 (en) 1997-09-30 2002-05-21 Matsushita Electric Industrial Co., Ltd. Decrypting device
US6216167B1 (en) 1997-10-31 2001-04-10 Nortel Networks Limited Efficient path based forwarding and multicast forwarding
US6226710B1 (en) 1997-11-14 2001-05-01 Utmc Microelectronic Systems Inc. Content addressable memory (CAM) engine
US7055029B2 (en) 1998-02-03 2006-05-30 Hewlett-Packard Development Company, L.P. Cryptographic system enabling ownership of a secure process
US6378072B1 (en) * 1998-02-03 2002-04-23 Compaq Computer Corporation Cryptographic system
US6295604B1 (en) 1998-05-26 2001-09-25 Intel Corporation Cryptographic packet processing unit
US6157955A (en) 1998-06-15 2000-12-05 Intel Corporation Packet processing system including a policy engine having a classification unit
US20030046423A1 (en) * 1998-06-15 2003-03-06 Narad Charles E. Programmable system for processing a partitioned network infrastructure
US6421730B1 (en) 1998-06-15 2002-07-16 Intel Corporation Programmable system for processing a partitioned network infrastructure
US6269163B1 (en) 1998-06-15 2001-07-31 Rsa Security Inc. Enhanced block ciphers with data-dependent rotations
US6862278B1 (en) 1998-06-18 2005-03-01 Microsoft Corporation System and method using a packetized encoded bitstream for parallel compression and decompression
US6189100B1 (en) 1998-06-30 2001-02-13 Microsoft Corporation Ensuring the integrity of remote boot client data
US7020137B2 (en) 1998-07-08 2006-03-28 Broadcom Corporation Network switching architecture with fast filtering processor
US6320964B1 (en) * 1998-08-26 2001-11-20 Intel Corporation Cryptographic accelerator
US6831979B2 (en) 1998-08-26 2004-12-14 Intel Corporation Cryptographic accelerator
US6393026B1 (en) 1998-09-17 2002-05-21 Nortel Networks Limited Data packet processing system and method for a router
US20030005144A1 (en) 1998-10-28 2003-01-02 Robert Engel Efficient classification manipulation and control of network transmissions by associating network flows with rule based functions
US20020057796A1 (en) 1998-12-24 2002-05-16 Lambert Robert J. Method for accelerating cryptographic operations on elliptic curves
US20020044649A1 (en) 1998-12-24 2002-04-18 Certicom Corp. Method for accelerating cryptographic operations on elliptic curves
US6295602B1 (en) 1998-12-30 2001-09-25 Spyrus, Inc. Event-driven serialization of access to shared resources
US6760444B1 (en) 1999-01-08 2004-07-06 Cisco Technology, Inc. Mobile IP authentication
US6529508B1 (en) 1999-02-01 2003-03-04 Redback Networks Inc. Methods and apparatus for packet classification with multiple answer sets
US7086086B2 (en) 1999-02-27 2006-08-01 Alonzo Ellis System and method for maintaining N number of simultaneous cryptographic sessions using a distributed computing environment
US6484257B1 (en) 1999-02-27 2002-11-19 Alonzo Ellis System and method for maintaining N number of simultaneous cryptographic sessions using a distributed computing environment
US6701432B1 (en) 1999-04-01 2004-03-02 Netscreen Technologies, Inc. Firewall including local bus
US6349405B1 (en) 1999-05-18 2002-02-19 Solidum Systems Corp. Packet classification state machine
US20020165718A1 (en) 1999-05-28 2002-11-07 David L. Graumann Audio classifier for half duplex communication
US6751728B1 (en) 1999-06-16 2004-06-15 Microsoft Corporation System and method of transmitting encrypted packets through a network access point
US6477646B1 (en) * 1999-07-08 2002-11-05 Broadcom Corporation Security chip architecture and implementations for cryptography acceleration
US20030014627A1 (en) * 1999-07-08 2003-01-16 Broadcom Corporation Distributed processing in a cryptography acceleration chip
US20030023846A1 (en) 1999-07-08 2003-01-30 Broadcom Corporation Classification engine in a cryptography acceleration chip
US6981140B1 (en) 1999-08-17 2005-12-27 Hewlett-Packard Development Company, L.P. Robust encryption and decryption of packetized data transferred across communications networks
US6751677B1 (en) 1999-08-24 2004-06-15 Hewlett-Packard Development Company, L.P. Method and apparatus for allowing a secure and transparent communication between a user device and servers of a data access network system via a firewall and a gateway
US6963979B2 (en) * 1999-10-20 2005-11-08 Aep Systems Limited Cryptographic accelerator
US6327625B1 (en) 1999-11-30 2001-12-04 3Com Corporation FIFO-based network interface supporting out-of-order processing
US7005733B2 (en) 1999-12-30 2006-02-28 Koemmerling Oliver Anti tamper encapsulation for an integrated circuit
US20020009076A1 (en) 2000-01-27 2002-01-24 Ton Engbersen Method and means for classifying data packets
US6983366B1 (en) 2000-02-14 2006-01-03 Safenet, Inc. Packet Processor
US6983374B2 (en) 2000-02-14 2006-01-03 Kabushiki Kaisha Toshiba Tamper resistant microprocessor
US7039641B2 (en) 2000-02-24 2006-05-02 Lucent Technologies Inc. Modular packet classification
EP1132800A2 (en) 2000-03-08 2001-09-12 Rainbow Technologies Inc. Non-wire contact device application for cryptographic module interfaces
WO2001080483A2 (en) 2000-04-13 2001-10-25 Broadcom Corporation Authentication engine architecture and method
US20020001384A1 (en) * 2000-04-13 2002-01-03 Broadcom Corporation Authentication engine architecture and method
US6807183B1 (en) 2000-05-09 2004-10-19 Advanced Micro Devices, Inc. Arrangement for reading a prescribed location of a FIFO buffer in a network switch port
US20020004904A1 (en) * 2000-05-11 2002-01-10 Blaker David M. Cryptographic data processing systems, computer program products, and methods of operating same in which multiple cryptographic execution units execute commands from a host processor in parallel
US20020039418A1 (en) 2000-05-15 2002-04-04 Fortress U&T Div. M-Systems Flash Disk Pioneers Ltd. Extending the range of computational fields of integers
US6778495B1 (en) 2000-05-17 2004-08-17 Cisco Technology, Inc. Combining multilink and IP per-destination load balancing over a multilink bundle
US20020085560A1 (en) 2000-05-24 2002-07-04 Jim Cathey Programmable packet processor with flow resolution logic
US7062657B2 (en) 2000-09-25 2006-06-13 Broadcom Corporation Methods and apparatus for hardware normalization and denormalization
US20020078342A1 (en) 2000-09-25 2002-06-20 Broadcom Corporation E-commerce security processor alignment logic
WO2002041599A1 (en) 2000-11-17 2002-05-23 British Telecommunications Public Limited Company Interface device
US7003118B1 (en) * 2000-11-27 2006-02-21 3Com Corporation High performance IPSEC hardware accelerator for packet classification
US20020108048A1 (en) 2000-12-13 2002-08-08 Broadcom Corporation Methods and apparatus for implementing a cryptography engine
US20020097724A1 (en) * 2001-01-09 2002-07-25 Matti Halme Processing of data packets within a network element cluster
US6996842B2 (en) 2001-01-30 2006-02-07 Intel Corporation Processing internet protocol security traffic
US20020191790A1 (en) * 2001-06-13 2002-12-19 Anand Satish N. Single-pass cryptographic processor and method
US7266703B2 (en) 2001-06-13 2007-09-04 Itt Manufacturing Enterprises, Inc. Single-pass cryptographic processor and method
US7017042B1 (en) * 2001-06-14 2006-03-21 Syrus Ziai Method and circuit to accelerate IPSec processing
US20030041252A1 (en) 2001-08-24 2003-02-27 Broadcom Corporation Methods and apparatus for collapsing interrupts
US6909713B2 (en) * 2001-09-05 2005-06-21 Intel Corporation Hash-based data frame distribution for web switches
US20030084308A1 (en) 2001-10-03 2003-05-01 Van Rijnswou Sander Matthijs Memory encryption
US20030084309A1 (en) * 2001-10-22 2003-05-01 Sun Microsystems, Inc. Stream processor with cryptographic co-processor
US20040083375A1 (en) 2002-04-18 2004-04-29 International Business Machines Corporation Initializing, maintaining, updating and recovering secure operation within an integrated system employing a data access control function
US20040054914A1 (en) 2002-04-30 2004-03-18 Sullivan Patrick L. Method and apparatus for in-line serial data encryption
US20040039936A1 (en) * 2002-08-21 2004-02-26 Yi-Sern Lai Apparatus and method for high speed IPSec processing
US20040098600A1 (en) 2002-11-14 2004-05-20 Broadcom Corporation Cryptography accelerator application program interface
US20040123123A1 (en) 2002-12-18 2004-06-24 Buer Mark L. Methods and apparatus for accessing security association information in a cryptography accelerator
US20040123096A1 (en) 2002-12-18 2004-06-24 Broadcom Corporation Cryptography accelerator data routing unit
US7191341B2 (en) 2002-12-18 2007-03-13 Broadcom Corporation Methods and apparatus for ordering data in a cryptography accelerator
US20040123120A1 (en) 2002-12-18 2004-06-24 Broadcom Corporation Cryptography accelerator input interface data handling
Non-Patent Citations (44)
* Cited by examiner, † Cited by third party
Title
"RFC 2402", Oct. 1998, [Retrieved from Internet Sep. 3, 2004], "http://www.ietf.org/rfc/rfc2402.txt?number=2402".
"Server ECS", Mar. 9, 1998, [Retrieved from Internet Sep. 2, 2004], "http://home.expertcanmore.net/expert/servers.htm".
3Com: "3Com Launches New Era of Network Connectivity", 3Com Press Release, Jun. 14, 1999, pp. 1-3.
Analog Devices: "Analog Devices and IRE Announce First DSP-Based Internet Security System-On-A-Chip", Analog Devices Press Release, Online, Jan. 19, 1999, pp. 1-3, printed from http://content.analog.com/pressrelease/prdisplay/0,1622,16,00.html.
Analog Devices: ADSP2141 SafeNetDPS User's Manual, Revision 6, Analog Devices Technical Specifications, Mar. 2000, XP002163401, pp. i-v and 1-82.
Burnside, M. and Keromytis, A.D., "Accelerating Application-Level Security Protocols," The 11th IEEE International Conference on Networks, pp. 313-318, Sep. 28-Oct. 1, 2003.
Compression for Broadband Data Communications, BlueSteel Networks, Inc., Sep. 8, 1999, pp. 1-9.
Data Sheet 7751 Encryption Processor, Network Security Processors, Jun. 1999, pp. 1-84.
Deepakumara, J. et al., "FPGA Implementation of MD5 Hash Algorithm," Conference Proceedings of the Canadian Conference on Electrical and Computer Engineering, vol. II, pp. 919-924, May 13-16, 2001.
Deutsch, P., "DEFLATE Compressed Data Format Specification Version 1.3", Aladdin Enterprises, Network Working Group, Request for Comments: 1951, May 1996, pp. 1-17.
Egevang, K. and Francis, P., "The IP Network Address Translator (NAT)", Network Working Group, Request for Comments: 1631, May 1994, pp. 1-10.
Erich Nahum, David J. Yates, Sean O'Malley, Hilarie Orman, and Richard Schroeppel; "Parallelized Network Security Protocols"; 1996 IEEE; pp. 145-154.
European Search Report, from European Patent Appl. No. 03029195.9, 3 pages, dated Nov. 2, 2005.
Final Rejection completed for U.S. Appl. No. 10/350,907 by Examiner Zachary A. Davis, mailed on Aug. 15, 2008, 17 pages.
Floyd, S. and Jacobson, V., "Random Early Detection Gateways for Congestion Avoidance", IEEE/ACM Transactions on Networking, vol. 1, No. 4, Aug. 1993, pp. 397-413.
Harkins, D. et al., "The Internet Key Exchange (IKE)", Cisco Systems, Network Working Group, Request for Comments: 2409, Nov. 1998, pp. 1-12.
IPSec Overview, Jun. 5, 2001, [Retrieved from Internet Sep. 2, 2004], "http://forsitesolutions.com/Techstuff/freeswan/inside-overview.html.".
Jiang, S. et al., "Securing Web Servers against Insider Attack," Proceedings 17th Annual Computer Security Applications Conference, pp. 265-276, Dec. 10-14, 2001.
Kent, S. and Atkinson, R., "IP Authentication Header", Network Working Group, Request for Comments: 2402, printed from http://www.ietf.org/rfc/rfc2402.txt?number=2402, Nov. 1998, 21 pages.
Kent, S. and Atkinson, R., "IP Encapsulating Security Payload (ESP)", Network Working Group, Request for Comments: 2406, printed from http:www.ietf.org/rfc/rfc2406.txt?number=2406, Nov. 1998, 21 pages.
Kent, S. and Atkinson, R., "RFC 2406-IP Encapsulating Security Payload (ESP)", IETF Request for Comments: 2406, Nov. 1998, Retrieved from the Internet and Mar. 20, 2001, http://www.faqs.org/rfcs/frc2406.html, 5 Pages.
Kent, S., and Atkinson, R., "Security Architecture for the Internet Protocol", Network Working Group, Request for Comments: 2401, Nov. 1998, pp. 1-66.
Keromytis, A.D. et al., "Implementing IPsec", Global Telecommunications Conference (Globecom), IEEE, Nov. 3, 1997, pp. 1948-1952.
Krishna et al., "Classification Engine in a Cryptography Acceleration Chip", U.S. Appl. No. 09/610,722, filed Jul. 6, 2000, 43 pgs.
Krishna et al., "Distributed Processing in a Cryptography Acceleration Chip", U.S. Appl. No. 09/610,798, filed Jul. 6, 2000, 44 pgs.
Madson, C. and Glenn, R., "RFC 2403- The Use of HMAC-MD5-96 within ESP and AH", IETF Request for Comments: 2403, Nov. 1998, printed from http://csrc.nist.gov/ipsec/papers/rfc2403-hmacmd5.txt, 7 Pages.
Maughan, D. et al., "Internet Security Association and Key Management Protocol (ISAKMP)", Network Working Group, Request for Comments: 2408, Nov. 1998, pp. 1-20.
Pall, G. S. and Zorn, G., "Microsoft Point-to Point Encryption (MPPE) Protocol", Microsoft Corporation, Network Working Group, Internet Draft, Updates: RFC 2118, Oct. 1999, pp. 1-12.
Pierson, L.G. et al., "Context-Agile Encryption for High Speed Communication Networks", Computer Communications Review, Association for Computing Machinery, vol. 29, No. 1, Jan. 1999, pp. 35-49.
Schneider, B., Applied Cryptography, Second Edition, 1996, John Wiley & Sons, New York, cited in the application, p. 442, paragraph 18.7-p. 445 (pp. 436-445 enclosed).
Secure Products VMS115, VLSI Technology, Inc., Printed in USA, Document Control: VMS115, VI, 0, Jan. 1999, pp. 1-2.
Securing and Accelerating e-Commerce Transactions, BlueSteel Networks, Inc., Revision 2.0, Oct. 20, 1999, pp. 1-7.
Securing Broadband Communications, By BlueSteel Networks, Inc., Sep. 8, 1999, pp. 1-10.
Sedgewick, R., Algorithms in C-Third Edition, 1998, Addison Wesley, XP002163543, pp. 573-608.
Senie, D., "NAT Friendly Application Design Guidelines", Amaranth Networks, Inc., NAT Working Group, Internet-Draft, Sep. 1999, pp. 1-7.
Shenker, S. et al., "Specification of Guaranteed Quality of Service", Network Working Group, Request for Comments: 2212, Sep. 1997, pp. 1-20.
Sholander, P. et al.,. "The Effect of Algorithm-Agile Encryption on ATM Quality of Service", Global Telecommunications Conference (Globecom), IEEE, Nov. 3, 1997, pp. 470-474.
Smirni, E. et al., "Evaluation of Multiprocessor Allocation Policies", Technical Report, Vanderbilt University, Online, 1993, pp. 1-21.
Srisuresh, P. and Holdrege, M., "IP Network Address Translator (NAT) Terminology and Considerations", Lucent Technologies, Network Working Group, Request for Comments: 2663, Aug. 1999, pp. 1-30.
Srisuresh, P., "Security Model with Tunnel-mode IPsec for NAT Domains", Lucent Technologies, Network Working Group, Request for Comments: 2709, Oct. 1999, pp. 1-11.
Stallings, W., "SHA: The Secure Hash Algorithm,"Dr. Dobb's Journal, Apr. 1994, pp. 32 and 34.
Tarman, T.D. et al., "Algorithm-Agile Encryption in ATM Networks", IEEE Computer, Sep. 1998, vol. 31, No. 1, pp. 57-64.
VMS 115 Data Sheet, VLSI Technology, Inc., a subsidiary of Philips Semiconductors, Revision 2:3, Aug. 10, 1999, pp. 1-64.
Wassal, A.G. and Hasan, M.A., "A VLSI Architecture for ATM Algorithm-Agile Encryption", Proceedings Ninth Great Lakes Symposium on VLSI, Mar. 4-6, 1999, pp. 325-328.
Cited By (5)
* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040054914A1 (en) * 2002-04-30 2004-03-18 Sullivan Patrick L. Method and apparatus for in-line serial data encryption
US7650510B2 (en) * 2002-04-30 2010-01-19 General Dynamics Advanced Information Systems, Inc. Method and apparatus for in-line serial data encryption
US20060259769A1 (en) * 2003-09-30 2006-11-16 Infineon Technologies Ag Method and device for encryption and decryption
US20090113218A1 (en) * 2007-10-30 2009-04-30 Sandisk Il Ltd. Secure data processing for unaligned data
US8918650B2 (en) * 2007-10-30 2014-12-23 Sandisk Il Ltd. Secure data processing for unaligned data
Also Published As
Publication number Publication date
US20040123119A1 (en) 2004-06-24
Similar Documents
Publication Publication Date Title
Chen et al. Flexible Control of Parallelism in a Multiprocessor PC Router.
US8284802B2 (en) High performance memory based communications interface
US7535907B2 (en) TCP engine
US7194766B2 (en) Method and system for high-speed processing IPSec security protocol packets
US7685434B2 (en) Two parallel engines for high speed transmit IPsec processing
CA2382151C (en) Filtering and route lookup in a switching device
US7283538B2 (en) Load balanced scalable network gateway processor architecture
US7496695B2 (en) Unified DMA
CA2460530C (en) Method, apparatus and computer program for the decapsulation and encapsulation of packets with multiple headers
US7366092B2 (en) Hash and route hardware with parallel routing scheme
US7626990B2 (en) Packet counters and packet adders for traffic profiling in a multiprocessor router
JP4723586B2 (en) Queuing of packets, scheduling and ordering
US7046633B2 (en) Router implemented with a gamma graph interconnection network
US20020150106A1 (en) Handling multiple network transport service levels with hardware and software arbitration
US20030074473A1 (en) Scalable network gateway processor architecture
JP4807861B2 (en) Host Ethernet adapter for networking offload in server environments
US7039058B2 (en) Switched interconnection network with increased bandwidth and port count
US6804240B1 (en) Fast and adaptive packet processing device and method using digest information of input packet
US7609718B2 (en) Packet data service over hyper transport link(s)
US20060140130A1 (en) Mirroring in a network device
US6401147B1 (en) Split-queue architecture with a first queue area and a second queue area and queue overflow area having a trickle mode and an overflow mode based on prescribed threshold values
US7680107B2 (en) High speed trunking in a network device
US8069279B2 (en) Data flow control within and between DMA channels
US20070280258A1 (en) Method and apparatus for performing link aggregation
US7502474B2 (en) Network interface with security association data prefetch for high speed offloaded security processing
Legal Events
Date Code Title Description
AS Assignment
Owner name: BROADCOM CORPORATION, CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BUER, MARK;MATTHEWS, DONALD P.;REEL/FRAME:013988/0843;SIGNING DATES FROM 20030321 TO 20030322
STCF Information on status: patent grant
Free format text: PATENTED CASE
FPAY Fee payment
Year of fee payment: 4
AS Assignment
Owner name: BANK OF AMERICA, N.A., AS COLLATERAL AGENT, NORTH
Free format text: PATENT SECURITY AGREEMENT;ASSIGNOR:BROADCOM CORPORATION;REEL/FRAME:037806/0001
Effective date: 20160201
FPAY Fee payment
Year of fee payment: 8
AS Assignment
Owner name: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:BROADCOM CORPORATION;REEL/FRAME:041706/0001
Effective date: 20170120
AS Assignment
Owner name: BROADCOM CORPORATION, CALIFORNIA
Free format text: TERMINATION AND RELEASE OF SECURITY INTEREST IN PATENTS;ASSIGNOR:BANK OF AMERICA, N.A., AS COLLATERAL AGENT;REEL/FRAME:041712/0001
Effective date: 20170119
AS Assignment
Owner name: AVAGO TECHNOLOGIES INTERNATIONAL SALES PTE. LIMITE
Free format text: MERGER;ASSIGNOR:AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD.;REEL/FRAME:047195/0827
Effective date: 20180509
AS Assignment
Owner name: AVAGO TECHNOLOGIES INTERNATIONAL SALES PTE. LIMITE
Free format text: CORRECTIVE ASSIGNMENT TO CORRECT THE EFFECTIVE DATE OF MERGER PREVIOUSLY RECORDED AT REEL: 047195 FRAME: 0827. ASSIGNOR(S) HEREBY CONFIRMS THE MERGER;ASSIGNOR:AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD.;REEL/FRAME:047924/0571
Effective date: 20180905
|
{
"url": "https://patents.google.com/patent/US7568110B2/en",
"source_domain": "patents.google.com",
"snapshot_id": "crawl=CC-MAIN-2019-43",
"warc_metadata": {
"Content-Length": "304012",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O5FYADIBWBAV66C6B7UFK7FXSQZQFOKP",
"WARC-Concurrent-To": "<urn:uuid:f3dd7a9a-e471-40c2-bda9-83315bad05e4>",
"WARC-Date": "2019-10-15T08:56:24Z",
"WARC-IP-Address": "172.217.9.206",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VT7ZGCXDZMHE25PL7DNP2EU3K5RF7QL7",
"WARC-Record-ID": "<urn:uuid:a2509feb-4931-4b39-920f-cc7c4708600e>",
"WARC-Target-URI": "https://patents.google.com/patent/US7568110B2/en",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2176fbbc-a7fc-46be-8342-993843fdb6be>"
},
"warc_info": "isPartOf: CC-MAIN-2019-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-72.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
112,
113,
207,
208,
213,
214,
233,
245,
414,
424,
427,
441,
460,
470,
475,
481,
506,
513,
528,
719,
735,
754,
767,
782,
802,
811,
821,
840,
1013,
1060,
1078,
1092,
1283,
1295,
1312,
1354,
1418,
1474,
1645,
1723,
1793,
1830,
1999,
2221,
2398,
2625,
2968,
3019,
3061,
3062,
3068,
3069,
3076,
3077,
3093,
3094,
3109,
3151,
3194,
3324,
3476,
3684,
3918,
3919,
3928,
3929,
4406,
4407,
4419,
4420,
4460,
4461,
5327,
5328,
5356,
5357,
5383,
5384,
5570,
5571,
5601,
5602,
6015,
6016,
6497,
6498,
6657,
6658,
6683,
6684,
7161,
7162,
7958,
7959,
8631,
8632,
9755,
9756,
10000,
10001,
10035,
10036,
10241,
10242,
10348,
10349,
10463,
10464,
10588,
10589,
10656,
10657,
10728,
10729,
10792,
10793,
10914,
10915,
10997,
10998,
11067,
11068,
11152,
11153,
11198,
11199,
11441,
11442,
12062,
12063,
12836,
12837,
13827,
13828,
14454,
14455,
14948,
14949,
15815,
15816,
16699,
16700,
17533,
17534,
18499,
18500,
19113,
19114,
19451,
19452,
20145,
20146,
20694,
20695,
21254,
21255,
21780,
21781,
22779,
22780,
23990,
23991,
25173,
25174,
26076,
26077,
27117,
27118,
28384,
28385,
29703,
29704,
30134,
30135,
30911,
30912,
31513,
31514,
32486,
32487,
33050,
33051,
33945,
33946,
34505,
34506,
35522,
35523,
36500,
36501,
37496,
37497,
38541,
38542,
39388,
39389,
40025,
40026,
40755,
40756,
41225,
41226,
41238,
41239,
41282,
41383,
41499,
41793,
42109,
42268,
42472,
42609,
42727,
42847,
42959,
43024,
43326,
43469,
43511,
43612,
43871,
44102,
44376,
44441,
44536,
44602,
44892,
45325,
45573,
45731,
45800,
46095,
46248,
46408,
46516,
46615,
46706,
46821,
46978,
47026,
47187,
47311,
47473,
47617,
47741,
47785,
47886,
48002,
48086,
48233,
48380,
48696,
48843,
48887,
48988,
49035,
49119,
49494,
49725,
49872,
50023,
50024,
50050,
50051,
50102,
50141,
50274,
50275,
50310,
50311,
50362,
50495,
50496,
50513,
50514,
50550,
50598,
50643,
50644,
50651,
50652,
50664,
50665,
50689,
50690,
50741,
50892,
50893,
50912,
50913,
50926,
50950,
50951,
50964,
50965,
51009,
51074,
51195,
51313,
51416,
51417,
51450,
51451,
51495,
51560,
51678,
51835,
51956,
52059,
52180,
52293,
52418,
52590,
52745,
52881,
53009,
53174,
53345,
53451,
53609,
53610,
53625,
53626,
53670,
53735,
53861,
53988,
54099,
54249,
54366,
54510,
54657,
54737,
54882,
55045,
55181,
55280,
55447,
55619,
55722,
55857,
55961,
56164,
56267,
56377,
56469,
56587,
56669,
56836,
56911,
57097,
57258,
57343,
57456,
57592,
57703,
57823,
57936,
58046,
58183,
58277,
58386,
58495,
58580,
58700,
58956,
59059,
59156,
59308,
59434,
59524,
59653,
59751,
59868,
59977,
60087,
60198,
60315,
60440,
60579,
60687,
60863,
60967,
61075,
61261,
61386,
61508,
61620,
61755,
61872,
61962,
62072,
62169,
62249,
62388,
62507,
62731,
62850,
63099,
63243,
63398,
63517,
63624,
63711,
63855,
63937,
64093,
64252,
64363,
64450,
64626,
64722,
64792,
64895,
65023,
65133,
65235,
65356,
65450,
65579,
65755,
65885,
65886,
65909,
65910,
65954,
66019,
66145,
66256,
66383,
66533,
66680,
66797,
66941,
67045,
67217,
67297,
67407,
67506,
67651,
67787,
67950,
68068,
68271,
68406,
68592,
68695,
68787,
68954,
69036,
69140,
69222,
69335,
69420,
69581,
69684,
69793,
69868,
70035,
70115,
70254,
70352,
70472,
70585,
70726,
70816,
70910,
71046,
71180,
71309,
71419,
71578,
71689,
71810,
71895,
71978,
72095,
72281,
72410,
72536,
72645,
72732,
72867,
73043,
73219,
73316,
73413,
73521,
73665,
73804,
73929,
74051,
74227,
74476,
74563,
74683,
74793,
74896,
74966,
75062,
75156,
75293,
75402,
75514,
75670,
75926,
76078,
76222,
76333,
76462,
76572,
76681,
76809,
76934,
77051,
77154,
77262,
77384,
77486,
77598,
77709,
77799,
77916,
78140,
78259,
78369,
78488,
78643,
78750,
78880,
78999,
79000,
79026,
79027,
79071,
79077,
79191,
79311,
79410,
79655,
79801,
79975,
80071,
80159,
80357,
80522,
80665,
80815,
80911,
81032,
81196,
81338,
81480,
81643,
81832,
82034,
82252,
82403,
82533,
82665,
82798,
82999,
83161,
83344,
83539,
83707,
83823,
83938,
84026,
84120,
84257,
84399,
84574,
84710,
84905,
85070,
85164,
85284,
85406,
85572,
85573,
85586,
85587,
85631,
85696,
85817,
85966,
86084,
86187,
86286,
86287,
86305,
86306,
86342,
86374,
86375,
86393,
86394,
86429,
86504,
86576,
86604,
86697,
86776,
86841,
86920,
86949,
87077,
87147,
87247,
87308,
87387,
87498,
87567,
87652,
87742,
87854,
87920,
87971,
88165,
88222,
88289,
88363,
88483,
88484,
88497,
88498,
88526,
88540,
88541,
88586,
88587,
88742,
88743,
88784,
88785,
88817,
88818,
88835,
88836,
88859,
88860,
88874,
88875,
88937,
88938,
89035,
89036,
89061,
89062,
89079,
89080,
89103,
89104,
89118,
89119,
89182,
89183,
89287,
89288,
89313,
89314,
89328,
89329,
89374,
89375,
89524,
89525,
89550,
89551,
89565,
89566,
89629,
89630,
89739,
89740,
89765,
89766,
89780,
89781,
89844,
89845,
90097,
90098
],
"line_end_idx": [
112,
113,
207,
208,
213,
214,
233,
245,
414,
424,
427,
441,
460,
470,
475,
481,
506,
513,
528,
719,
735,
754,
767,
782,
802,
811,
821,
840,
1013,
1060,
1078,
1092,
1283,
1295,
1312,
1354,
1418,
1474,
1645,
1723,
1793,
1830,
1999,
2221,
2398,
2625,
2968,
3019,
3061,
3062,
3068,
3069,
3076,
3077,
3093,
3094,
3109,
3151,
3194,
3324,
3476,
3684,
3918,
3919,
3928,
3929,
4406,
4407,
4419,
4420,
4460,
4461,
5327,
5328,
5356,
5357,
5383,
5384,
5570,
5571,
5601,
5602,
6015,
6016,
6497,
6498,
6657,
6658,
6683,
6684,
7161,
7162,
7958,
7959,
8631,
8632,
9755,
9756,
10000,
10001,
10035,
10036,
10241,
10242,
10348,
10349,
10463,
10464,
10588,
10589,
10656,
10657,
10728,
10729,
10792,
10793,
10914,
10915,
10997,
10998,
11067,
11068,
11152,
11153,
11198,
11199,
11441,
11442,
12062,
12063,
12836,
12837,
13827,
13828,
14454,
14455,
14948,
14949,
15815,
15816,
16699,
16700,
17533,
17534,
18499,
18500,
19113,
19114,
19451,
19452,
20145,
20146,
20694,
20695,
21254,
21255,
21780,
21781,
22779,
22780,
23990,
23991,
25173,
25174,
26076,
26077,
27117,
27118,
28384,
28385,
29703,
29704,
30134,
30135,
30911,
30912,
31513,
31514,
32486,
32487,
33050,
33051,
33945,
33946,
34505,
34506,
35522,
35523,
36500,
36501,
37496,
37497,
38541,
38542,
39388,
39389,
40025,
40026,
40755,
40756,
41225,
41226,
41238,
41239,
41282,
41383,
41499,
41793,
42109,
42268,
42472,
42609,
42727,
42847,
42959,
43024,
43326,
43469,
43511,
43612,
43871,
44102,
44376,
44441,
44536,
44602,
44892,
45325,
45573,
45731,
45800,
46095,
46248,
46408,
46516,
46615,
46706,
46821,
46978,
47026,
47187,
47311,
47473,
47617,
47741,
47785,
47886,
48002,
48086,
48233,
48380,
48696,
48843,
48887,
48988,
49035,
49119,
49494,
49725,
49872,
50023,
50024,
50050,
50051,
50102,
50141,
50274,
50275,
50310,
50311,
50362,
50495,
50496,
50513,
50514,
50550,
50598,
50643,
50644,
50651,
50652,
50664,
50665,
50689,
50690,
50741,
50892,
50893,
50912,
50913,
50926,
50950,
50951,
50964,
50965,
51009,
51074,
51195,
51313,
51416,
51417,
51450,
51451,
51495,
51560,
51678,
51835,
51956,
52059,
52180,
52293,
52418,
52590,
52745,
52881,
53009,
53174,
53345,
53451,
53609,
53610,
53625,
53626,
53670,
53735,
53861,
53988,
54099,
54249,
54366,
54510,
54657,
54737,
54882,
55045,
55181,
55280,
55447,
55619,
55722,
55857,
55961,
56164,
56267,
56377,
56469,
56587,
56669,
56836,
56911,
57097,
57258,
57343,
57456,
57592,
57703,
57823,
57936,
58046,
58183,
58277,
58386,
58495,
58580,
58700,
58956,
59059,
59156,
59308,
59434,
59524,
59653,
59751,
59868,
59977,
60087,
60198,
60315,
60440,
60579,
60687,
60863,
60967,
61075,
61261,
61386,
61508,
61620,
61755,
61872,
61962,
62072,
62169,
62249,
62388,
62507,
62731,
62850,
63099,
63243,
63398,
63517,
63624,
63711,
63855,
63937,
64093,
64252,
64363,
64450,
64626,
64722,
64792,
64895,
65023,
65133,
65235,
65356,
65450,
65579,
65755,
65885,
65886,
65909,
65910,
65954,
66019,
66145,
66256,
66383,
66533,
66680,
66797,
66941,
67045,
67217,
67297,
67407,
67506,
67651,
67787,
67950,
68068,
68271,
68406,
68592,
68695,
68787,
68954,
69036,
69140,
69222,
69335,
69420,
69581,
69684,
69793,
69868,
70035,
70115,
70254,
70352,
70472,
70585,
70726,
70816,
70910,
71046,
71180,
71309,
71419,
71578,
71689,
71810,
71895,
71978,
72095,
72281,
72410,
72536,
72645,
72732,
72867,
73043,
73219,
73316,
73413,
73521,
73665,
73804,
73929,
74051,
74227,
74476,
74563,
74683,
74793,
74896,
74966,
75062,
75156,
75293,
75402,
75514,
75670,
75926,
76078,
76222,
76333,
76462,
76572,
76681,
76809,
76934,
77051,
77154,
77262,
77384,
77486,
77598,
77709,
77799,
77916,
78140,
78259,
78369,
78488,
78643,
78750,
78880,
78999,
79000,
79026,
79027,
79071,
79077,
79191,
79311,
79410,
79655,
79801,
79975,
80071,
80159,
80357,
80522,
80665,
80815,
80911,
81032,
81196,
81338,
81480,
81643,
81832,
82034,
82252,
82403,
82533,
82665,
82798,
82999,
83161,
83344,
83539,
83707,
83823,
83938,
84026,
84120,
84257,
84399,
84574,
84710,
84905,
85070,
85164,
85284,
85406,
85572,
85573,
85586,
85587,
85631,
85696,
85817,
85966,
86084,
86187,
86286,
86287,
86305,
86306,
86342,
86374,
86375,
86393,
86394,
86429,
86504,
86576,
86604,
86697,
86776,
86841,
86920,
86949,
87077,
87147,
87247,
87308,
87387,
87498,
87567,
87652,
87742,
87854,
87920,
87971,
88165,
88222,
88289,
88363,
88483,
88484,
88497,
88498,
88526,
88540,
88541,
88586,
88587,
88742,
88743,
88784,
88785,
88817,
88818,
88835,
88836,
88859,
88860,
88874,
88875,
88937,
88938,
89035,
89036,
89061,
89062,
89079,
89080,
89103,
89104,
89118,
89119,
89182,
89183,
89287,
89288,
89313,
89314,
89328,
89329,
89374,
89375,
89524,
89525,
89550,
89551,
89565,
89566,
89629,
89630,
89739,
89740,
89765,
89766,
89780,
89781,
89844,
89845,
90097,
90098,
90122
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 90122,
"ccnet_original_nlines": 684,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.21490740776062012,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.052748408168554306,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.30872130393981934,
"rps_doc_frac_unique_words": 0.1552053540945053,
"rps_doc_mean_word_length": 5.881884574890137,
"rps_doc_num_sentences": 739,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 6.084225177764893,
"rps_doc_word_count": 12564,
"rps_doc_frac_chars_dupe_10grams": 0.4133017659187317,
"rps_doc_frac_chars_dupe_5grams": 0.5907442569732666,
"rps_doc_frac_chars_dupe_6grams": 0.5383220314979553,
"rps_doc_frac_chars_dupe_7grams": 0.4948849678039551,
"rps_doc_frac_chars_dupe_8grams": 0.45926928520202637,
"rps_doc_frac_chars_dupe_9grams": 0.4368741512298584,
"rps_doc_frac_chars_top_2gram": 0.02676589973270893,
"rps_doc_frac_chars_top_3gram": 0.011177269741892815,
"rps_doc_frac_chars_top_4gram": 0.01307171955704689,
"rps_doc_books_importance": -8285.28125,
"rps_doc_books_importance_length_correction": -8285.28125,
"rps_doc_openwebtext_importance": -4738.52587890625,
"rps_doc_openwebtext_importance_length_correction": -4738.52587890625,
"rps_doc_wikipedia_importance": -2740.2783203125,
"rps_doc_wikipedia_importance_length_correction": -2740.2783203125
},
"fasttext": {
"dclm": 0.06236499920487404,
"english": 0.7895945906639099,
"fineweb_edu_approx": 2.435581922531128,
"eai_general_math": 0.04305905103683472,
"eai_open_web_math": 0.012026069685816765,
"eai_web_code": 0.008863270282745361
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v1": {
"primary": {
"code": "11",
"label": "Legal/Regulatory"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
6,465,533,548,667,500,000 |
Monomorphism
From Wikipedia, the free encyclopedia
Jump to: navigation, search
This article is about the mathematical term. For other uses, see Monomorphic (disambiguation) and Polymorphism (disambiguation).
Monomorphism-01.png
In the context of abstract algebra or universal algebra, a monomorphism is an injective homomorphism. A monomorphism from X to Y is often denoted with the notation X \hookrightarrow Y.
In the more general setting of category theory, a monomorphism (also called a monic morphism or a mono) is a left-cancellative morphism, that is, an arrow f : XY such that, for all morphisms g1, g2 : ZX,
f \circ g_1 = f \circ g_2 \Rightarrow g_1 = g_2.
Monomorphisms are a categorical generalization of injective functions (also called "one-to-one functions"); in some categories the notions coincide, but monomorphisms are more general, as in the examples below.
The categorical dual of a monomorphism is an epimorphism, i.e. a monomorphism in a category C is an epimorphism in the dual category Cop. Every section is a monomorphism, and every retraction is an epimorphism.
Relation to invertibility[edit]
Left invertible morphisms are necessarily monic: if l is a left inverse for f (meaning l is a morphism and l \circ f = \operatorname{id}_{X}), then f is monic, as
f \circ g_1 = f \circ g_2 \Rightarrow lfg_1 = lfg_2 \Rightarrow g_1 = g_2.
A left invertible morphism is called a split mono.
However, a monomorphism need not be left-invertible. For example, in the category Group of all groups and group morphisms among them, if H is a subgroup of G then the inclusion f : HG is always a monomorphism; but f has a left inverse in the category if and only if H has a normal complement in G.
A morphism f : XY is monic if and only if the induced map f : Hom(Z, X) → Hom(Z, Y), defined by f(h) = fh for all morphisms h : ZX, is injective for all Z.
Examples[edit]
Every morphism in a concrete category whose underlying function is injective is a monomorphism; in other words, if morphisms are actually functions between sets, then any morphism which is a one-to-one function will necessarily be a monomorphism in the categorical sense. In the category of sets the converse also holds, so the monomorphisms are exactly the injective morphisms. The converse also holds in most naturally occurring categories of algebras because of the existence of a free object on one generator. In particular, it is true in the categories of all groups, of all rings, and in any abelian category.
It is not true in general, however, that all monomorphisms must be injective in other categories; that is, there are settings in which the morphisms are functions between sets, but one can have a function that is not injective and yet is a monomorphism in the categorical sense. For example, in the category Div of divisible (abelian) groups and group homomorphisms between them there are monomorphisms that are not injective: consider, for example, the quotient map q : QQ/Z, where Q is the rationals under addition, Z the integers (also considered a group under addition), and Q/Z is the corresponding quotient group. This is not an injective map, as for example every integer is mapped to 0. Nevertheless, it is a monomorphism in this category. This follows from the implication qh = 0 ⇒ h = 0, which we will now prove. If h : GQ, where G is some divisible group, and qh = 0, then h(x) ∈ Z, ∀ xG. Now fix some xG. Without loss of generality, we may assume that h(x) ≥ 0 (otherwise, choose −x instead). Then, letting n = h(x) + 1, since G is a divisible group, there exists some yG such that x = ny, so h(x) = n h(y). From this, and 0 ≤ h(x) < h(x) + 1 = n, it follows that
0 \leq \frac{h(x)}{h(x) + 1} = h(y) < 1
Since h(y) ∈ Z, it follows that h(y) = 0, and thus h(x) = 0 = h(−x), ∀ xG. This says that h = 0, as desired.
To go from that implication to the fact that q is an monomorphism, assume that qf = q g for some morphisms f, g : GQ, where G is some divisible group. Then q ∘ (fg) = 0, where (fg) : xf(x) − g(x). (Since (fg)(0) = 0, and (f - g)(x + y) = (f - g)(x) + (f - g)(y), it follows that (fg) ∈ Hom(G, Q)). From the implication just proved, q ∘ (fg) = 0 ⇒ fg = 0 ⇔ ∀ xG, f(x) = g(x) ⇔ f = g. Hence q is a monomorphism, as claimed.
Properties[edit]
• In a topos, every monic is an equalizer, and any map that is both monic and epic is an isomorphism.
• Every isomorphism is monic.
Related concepts[edit]
There are also useful concepts of regular monomorphism, strong monomorphism, and extremal monomorphism. A regular monomorphism equalizes some parallel pair of morphisms. An extremal monomorphism is a monomorphism that cannot be nontrivially factored through an epimorphism: Precisely, if m = ge with e an epimorphism, then e is an isomorphism. A strong monomorphism satisfies a certain lifting property with respect to commutative squares involving an epimorphism.
Terminology[edit]
The companion terms monomorphism and epimorphism were originally introduced by Nicolas Bourbaki; Bourbaki uses monomorphism as shorthand for an injective function. Early category theorists believed that the correct generalization of injectivity to the context of categories was the cancellation property given above. While this is not exactly true for monic maps, it is very close, so this has caused little trouble, unlike the case of epimorphisms. Saunders Mac Lane attempted to make a distinction between what he called monomorphisms, which were maps in a concrete category whose underlying maps of sets were injective, and monic maps, which are monomorphisms in the categorical sense of the word. This distinction never came into general use.
Another name for monomorphism is extension, although this has other uses too.
See also[edit]
References[edit]
|
{
"url": "http://en.wikipedia.org/wiki/Monomorphism",
"source_domain": "en.wikipedia.org",
"snapshot_id": "crawl=CC-MAIN-2014-35",
"warc_metadata": {
"Content-Length": "42432",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SMWP65TJHAKTGU2OUM333PEHMTMTO2VS",
"WARC-Concurrent-To": "<urn:uuid:8e2f8264-e0a5-4979-a4f3-ee6a2cc31089>",
"WARC-Date": "2014-08-29T10:53:25Z",
"WARC-IP-Address": "208.80.154.224",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:SUEXKY2AE4DBUBCNXZUMYUSGKTAPRFF5",
"WARC-Record-ID": "<urn:uuid:678d3edb-dffd-4f8c-b45b-ac4cdab9e9a4>",
"WARC-Target-URI": "http://en.wikipedia.org/wiki/Monomorphism",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ed58129e-8525-4c48-8122-08ff28743d3e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-136-8.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-35\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for August 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
13,
14,
52,
80,
209,
229,
230,
415,
416,
620,
621,
670,
671,
882,
883,
1094,
1095,
1127,
1128,
1291,
1292,
1367,
1368,
1419,
1420,
1718,
1719,
1875,
1876,
1891,
1892,
2508,
2509,
3685,
3686,
3726,
3727,
3836,
3837,
4259,
4260,
4277,
4278,
4382,
4414,
4415,
4438,
4439,
4904,
4905,
4923,
4924,
5671,
5672,
5750,
5751,
5766,
5767
],
"line_end_idx": [
13,
14,
52,
80,
209,
229,
230,
415,
416,
620,
621,
670,
671,
882,
883,
1094,
1095,
1127,
1128,
1291,
1292,
1367,
1368,
1419,
1420,
1718,
1719,
1875,
1876,
1891,
1892,
2508,
2509,
3685,
3686,
3726,
3727,
3836,
3837,
4259,
4260,
4277,
4278,
4382,
4414,
4415,
4438,
4439,
4904,
4905,
4923,
4924,
5671,
5672,
5750,
5751,
5766,
5767,
5783
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5783,
"ccnet_original_nlines": 58,
"rps_doc_curly_bracket": 0.0013833700213581324,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3960092067718506,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.030698390677571297,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25863391160964966,
"rps_doc_frac_unique_words": 0.3378660976886749,
"rps_doc_mean_word_length": 4.624476909637451,
"rps_doc_num_sentences": 49,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.117987155914307,
"rps_doc_word_count": 956,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06469125300645828,
"rps_doc_frac_chars_dupe_6grams": 0.05428636074066162,
"rps_doc_frac_chars_dupe_7grams": 0.02352409064769745,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.041167158633470535,
"rps_doc_frac_chars_top_3gram": 0.020357390865683556,
"rps_doc_frac_chars_top_4gram": 0.01153585035353899,
"rps_doc_books_importance": -497.88262939453125,
"rps_doc_books_importance_length_correction": -497.88262939453125,
"rps_doc_openwebtext_importance": -307.8560485839844,
"rps_doc_openwebtext_importance_length_correction": -307.8560485839844,
"rps_doc_wikipedia_importance": -179.0871124267578,
"rps_doc_wikipedia_importance_length_correction": -179.0871124267578
},
"fasttext": {
"dclm": 0.7222661972045898,
"english": 0.9136331081390381,
"fineweb_edu_approx": 3.0317695140838623,
"eai_general_math": 0.9989888668060303,
"eai_open_web_math": 0.9147639274597168,
"eai_web_code": 0.8843777179718018
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512.6",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "512",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
7,078,847,661,982,213,000 |
Search Type: Posts; User: rioscb
Search: Search took 0.02 seconds.
1. Replies
3
Views
666
What about Architect and ExtJs 5? It seems to me that this would be done in parallel.
Will it be in Architect 3 or are you going to do it in Architect 4 as a separate license?
2. Has anyone seen and understand this error?
Added menu to toolbar.
Added a split button to toolbar.
moved menu to toolbar
Got the error below.
Version: 2.2.1 Build: 951
Release Channel:...
3. Replies
1
Views
1,215
Is there a way to configure the documentation location? I have local URL for documentation and would like to have documentation access when I am offline.
Results 1 to 3 of 3
|
{
"url": "https://www.sencha.com/forum/search.php?s=b0edb02f2494bcdf12b83aeffae18f2a&searchid=12044128",
"source_domain": "www.sencha.com",
"snapshot_id": "crawl=CC-MAIN-2015-27",
"warc_metadata": {
"Content-Length": "85916",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JQ7V7C5LYDML6RTOA47HS7DNV3N46IFZ",
"WARC-Concurrent-To": "<urn:uuid:50fac8ad-c337-430f-a201-76a2a0acfb86>",
"WARC-Date": "2015-07-08T02:18:15Z",
"WARC-IP-Address": "23.21.176.23",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:BJBQESF3FXBQ2INJD3VNXLDZXKWP5LM7",
"WARC-Record-ID": "<urn:uuid:1c0dd7e7-febd-49ea-b2dd-167241b1d89d>",
"WARC-Target-URI": "https://www.sencha.com/forum/search.php?s=b0edb02f2494bcdf12b83aeffae18f2a&searchid=12044128",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:17d5089e-e00e-433e-a658-0feffa9f809e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-179-60-89.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-27\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for June 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
33,
34,
68,
69,
82,
88,
98,
106,
196,
290,
338,
365,
402,
428,
453,
454,
455,
485,
509,
522,
528,
538,
548,
706
],
"line_end_idx": [
33,
34,
68,
69,
82,
88,
98,
106,
196,
290,
338,
365,
402,
428,
453,
454,
455,
485,
509,
522,
528,
538,
548,
706,
725
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 725,
"ccnet_original_nlines": 24,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34228187799453735,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.020134229212999344,
"rps_doc_frac_lines_end_with_ellipsis": 0.03999999910593033,
"rps_doc_frac_no_alph_words": 0.29530200362205505,
"rps_doc_frac_unique_words": 0.6694214940071106,
"rps_doc_mean_word_length": 4.198347091674805,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0.006711409892886877,
"rps_doc_unigram_entropy": 4.220629692077637,
"rps_doc_word_count": 121,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.05314961075782776,
"rps_doc_frac_chars_top_3gram": 0.05118110030889511,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -64.71556091308594,
"rps_doc_books_importance_length_correction": -64.7360610961914,
"rps_doc_openwebtext_importance": -40.813316345214844,
"rps_doc_openwebtext_importance_length_correction": -40.83382034301758,
"rps_doc_wikipedia_importance": -35.398277282714844,
"rps_doc_wikipedia_importance_length_correction": -35.41878128051758
},
"fasttext": {
"dclm": 0.01834684982895851,
"english": 0.9161140322685242,
"fineweb_edu_approx": 0.8415711522102356,
"eai_general_math": 0.01594633050262928,
"eai_open_web_math": 0.09633123874664307,
"eai_web_code": 0.004025820177048445
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
7,306,898,994,711,814,000 |
Sign up ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free.
Let's say I've got Alpha things that may or may not be or be related to Bravo or Charlie things.
These are one-to-one relationships: No Alpha will relate to more than one Bravo. And no Bravo will relate to more than one Alpha.
I've got a few goals:
• a system that's easy to learn and maintain.
• data integrity enforced within my database.
• a schema that matches the real-world, logical organization of my data.
• classes/objects within my programming that map well to database tables (à la Linq to SQL)
• speedy read and write operations
• effective use of space (few null fields)
I've got three ideas…
PK = primary key
FK = foreign key
NU = nullable
One table with many nullalbe fields (flat file)…
Alphas
--------
PK AlphaId
AlphaOne
AlphaTwo
AlphaThree
NU BravoOne
NU BravoTwo
NU BravoThree
NU CharlieOne
NU CharlieTwo
NU CharlieThree
Many tables with zero nullalbe fields…
Alphas
--------
PK AlphaId
AlphaOne
AlphaTwo
AlphaThree
Bravos
--------
FK PK AlphaId
BravoOne
BravoTwo
BravoThree
Charlies
--------
FK PK AlphaId
CharlieOne
CharlieTwo
CharlieThree
Best (or worst) of both: Lots of nullalbe foreign keys to many tables…
Alphas
--------
PK AlphaId
AlphaOne
AlphaTwo
AlphaThree
NU FK BravoId
NU FK CharlieId
Bravos
--------
PK BravoId
BravoOne
BravoTwo
BravoThree
Charlies
--------
PK CharlieId
CharlieOne
CharlieTwo
CharlieThree
What if an Alpha must be either Bravo or Charlie, but not both?
What if instead of just Bravos and Charlies, Alphas could also be any of Deltas, Echos, Foxtrots, or Golfs, etc…?
EDIT: This is a portion of the question: Which is the best database schema for my navigation?
share|improve this question
9 Answers 9
If you want each Alpha to be related to by only one Bravo I would vote for the possibility with using a combined FK/PK:
Bravos
--------
FK PK AlphaId
BravoOne
BravoTwo
BravoThree
This way one and only one Bravo may refer to your Alphas.
If the Bravos and Charlies have to be mutually exclusive, the simplest method would probably to create a discriminator field:
Alpha
--------
PK AlphaId
PK AlphaType NOT NULL IN ("Bravo", "Charlie")
AlphaOne
AlphaTwo
AlphaThree
Bravos
--------
FK PK AlphaId
FK PK AlphaType == "Bravo"
BravoOne
BravoTwo
BravoThree
Charlies
--------
FK PK AlphaId
FK PK AlphaType == "Charlie"
CharlieOne
CharlieTwo
CharlieThree
This way the AlphaType field forces the records to always belong to exactly one subtype.
share|improve this answer
I'm assuming you will be using SQL Server 2000 / 2005. I have a standard pattern for 1-to-1 relationships which I use, which is not too dissimilar to your 2nd idea, but here are the differences:
• Every entity must have its own primary key first, so your Bravo, Charlie, etc tables should define their own surrogate key, in addition to the foreign key column for the Alpha table. You are making your domain model quite inflexible by specifying that the primary key of one table must be exactly the same as the primary key of another table. The entities therefore become very tightly coupled, and one entity cannot exist without another, which is not a business rule that needs to be enforced within database design.
• Add a foreign key constraint between the AlphaID columns in the Bravo and Charlie tables to the primary key column on the Alpha table. This gives you 1-to-many, and also allows you to specify whether the relationship is mandatory simply by setting the nullability of the FK column (something that isn't possible in your current design).
• Add a unique key constraint to tables Bravo, Charlie, etc on the AlphaID column. This creates a 1-to-1 relationship, with the added benefit that the unique key also acts as an index which can help to speed up queries that retrieve rows based on the foreign key value.
The major benefit of this approach is that change is easier:
• Want 1-to-many back? Drop the relevant unique key, or just change it to a normal index
• Want Bravo to exist independently of Alpha? You've already got the surrogate key, all you do is set the AlphaID FK column to allow NULLs
share|improve this answer
Personally, I've had lots of success with your second model, using a PK/FK on a single column.
I have never had a situation where all Alphas were required to have a record in a Bravo or Charlie table. I've always dealt with 1 <-> 0..1, never 1 <-> 1.
As for your last question, that's just that many more tables.
share|improve this answer
One more approach is having 3 tables for storing the 3 entities and having a separate table for storing the relations.
share|improve this answer
You could have a join table that specifies an Alpha and a related ID. You can then add another column specifing if it is an ID for Bravo, Charlie or whatever. Keeps the column creep down on Alpha but does add some complexity to joining queries.
share|improve this answer
I have an example working pretty well so far that fits your model:
I Have Charlie and Bravo Tables Having the Foreign Key alpha_id from Alpha. Like your first example, except alpha is not the Primary Key, bravo_id and charlie_id are.
I use alpha_id on every table I need to address to those entities, so, to avoid a SQL that may cause some delay researching both Bravo and Charlie to find which one Alpha is, I created a AlphaType table and on Alpha table I have its id (alpha_type_id) as foreign key. That way I can know in a programmatic way which AlphaType I am dealing with without Joining tables that may have zillions of records. in tSQL:
// For example sake lets think Id as a CHAR.
// and pardon me on any mistake, I dont have the exact code here,
// but you can get the idea
SELECT
(CASE alpha_type_id
WHEN 'B' THEN '[Bravo].[Name]'
WHEN 'C' THEN '[Charlie].[Name]'
ELSE Null
END)
FROM ...
share|improve this answer
You raise a lot of questions that make it hard to select any of your proposed solutions without a lot more clarification on the exact problem you are trying to solve. Consider not just my clarification questions, but the criteria that you will use to evaluate my questions, as an indication of the amount of detail required to solve your problem:
• a system that's easy to learn and maintain.
What "System" will it be easy to learn and maintain? The source code of your app, or the app's data via it's end-user interface?
• data integrity enforced within my database.
What do you mean by "enforced within my database"? Does this mean you cannot by any means control data integrity any other way, i.e. the project requires only DB-based data integrity rules?
• a schema that matches the real-world, logical organization of my data.
Can you provide us the real world, logical organization to which you are referring? It's impossible to infer it from your three examples of the data you are trying to store -- i.e. suppose all three of your structures are completely wrong. How would we know that unless we know the real-world spec?
• classes/objects within my programming that map well to database tables (à la Linq to SQL)
This requirement sounds like your hand is being forced to create this with linq to SQL, is that the case?
• speedy read and write operations
What is "speedy"? .03 seconds? 3 seconds? 30 minutes? It's unclear because you're not specifying the data size and type of operations to which you are referring.
• effective use of space (few null fields)
Effective use of space has nothing to do with the number of null fields. If you mean a normalized database structure, that will depend again on the real-world spec's and other design elements of the application that have not been provided in the question.
share|improve this answer
I'd go with option 1 unless I had a significant reason not to. It might not cost you as much space as you think, esp. if you are using varchars in Bravo. Don't forget that splitting it will cost you for foreign keys, secondary identity and needed indexes.
A place where you might run into trouble is if Bravo is unlikely to be needed (<%10) AND you need to quickly query by one of its fields so you index it.
share|improve this answer
I would create a supertype / subtype relationship.
THINGS
------
PK ThingId
ALPHAS
------
FK ThingId (not null, identifying, exported from THINGS)
AlphaCol1
AlphaCol2
AlphaCol3
BRAVOS
------
FK ThingId (not null, identifying, exported from THINGS)
BravoCol1
BravoCol2
BravoCol3
CHARLIES
--------
FK ThingId (not null, identifying, exported from THINGS)
CharlieCol1
CharlieCol2
CharlieCol3
So, for example, an alpha that has a charlie but not a bravo:-
insert into things values (1);
insert into alphas values (1,'alpha col 1',5,'blue');
insert into charlies values (1,'charlie col 1',17,'Y');
Note, you can't create more than one charlie for the alpha, as if you tried to create a two charlies with a ThingId of 1 the second insert would get a unique index/constraint violation.
share|improve this answer
This does not enforce the 1 <-> 0..1 relationship. You could have Alphas with three bravos, a bravo without an alpha and so on. – JacquesB Sep 22 '08 at 8:22
I should have been clearer, the FK keys in ALPHAS, BRAVOS and CHARLIES are identifying relationships, with a not null. Not sure how you think an Alpha could have three bravos, etc. – Mike McAllister Sep 22 '08 at 20:13
@olavk - I've provided an answer showing why I don't think you can have an alpha with multiple bravos. Yes, you can have a bravo without an alpha, the original spec said "I've got Alpha things that may OR MAY NOT BE related to Bravo or Charlie things". – Mike McAllister Sep 22 '08 at 20:22
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://stackoverflow.com/questions/57152/whats-the-best-way-to-handle-one-to-one-relationships-in-sql/57772",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-40",
"warc_metadata": {
"Content-Length": "114640",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OFRB2EZQQ6S63XUJHEJK5NOG37JJ6YJF",
"WARC-Concurrent-To": "<urn:uuid:983820d5-cbb7-46b5-9059-43769d502c74>",
"WARC-Date": "2015-10-10T14:59:14Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:OHOZ54KLX3ZF7DVNM2SBAIYC5STAYRGD",
"WARC-Record-ID": "<urn:uuid:dc6cb6d2-f1aa-48f9-b754-40013d26d0f6>",
"WARC-Target-URI": "http://stackoverflow.com/questions/57152/whats-the-best-way-to-handle-one-to-one-relationships-in-sql/57772",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:53968dc1-42a5-4247-8995-1cacc1e77425>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-137-6-227.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-40\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for September 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
10,
116,
117,
214,
215,
345,
346,
368,
369,
417,
465,
540,
634,
671,
716,
717,
739,
740,
759,
778,
792,
793,
842,
843,
856,
871,
885,
900,
915,
932,
947,
962,
979,
996,
1013,
1032,
1033,
1072,
1073,
1086,
1101,
1115,
1130,
1145,
1162,
1163,
1176,
1191,
1205,
1220,
1235,
1252,
1253,
1268,
1283,
1297,
1314,
1331,
1350,
1351,
1422,
1423,
1436,
1451,
1465,
1480,
1495,
1512,
1526,
1542,
1543,
1556,
1571,
1585,
1600,
1615,
1632,
1633,
1648,
1663,
1679,
1696,
1713,
1732,
1733,
1797,
1798,
1912,
1913,
1914,
2008,
2009,
2037,
2038,
2050,
2051,
2171,
2172,
2185,
2200,
2214,
2229,
2244,
2261,
2262,
2320,
2321,
2447,
2448,
2460,
2475,
2489,
2538,
2553,
2568,
2585,
2586,
2599,
2614,
2628,
2655,
2670,
2685,
2702,
2703,
2718,
2733,
2747,
2776,
2793,
2810,
2829,
2830,
2919,
2920,
2946,
2947,
3142,
3143,
3666,
3667,
4008,
4009,
4281,
4282,
4343,
4344,
4435,
4576,
4602,
4603,
4698,
4699,
4855,
4856,
4918,
4919,
4945,
4946,
5065,
5066,
5092,
5093,
5338,
5339,
5365,
5366,
5433,
5434,
5601,
5602,
6013,
6014,
6059,
6125,
6153,
6154,
6162,
6184,
6219,
6256,
6270,
6277,
6286,
6312,
6313,
6660,
6661,
6709,
6710,
6839,
6840,
6888,
6889,
7079,
7080,
7155,
7156,
7455,
7456,
7550,
7551,
7657,
7658,
7695,
7696,
7858,
7859,
7904,
7905,
8161,
8162,
8188,
8189,
8445,
8446,
8599,
8600,
8626,
8627,
8678,
8679,
8689,
8699,
8712,
8713,
8723,
8733,
8790,
8803,
8816,
8831,
8832,
8842,
8852,
8909,
8922,
8935,
8950,
8951,
8963,
8975,
9032,
9047,
9062,
9077,
9078,
9141,
9142,
9173,
9227,
9283,
9284,
9470,
9471,
9497,
9502,
9661,
9666,
9886,
9891,
10183,
10184,
10196,
10197,
10199,
10207,
10208,
10286,
10287
],
"line_end_idx": [
10,
116,
117,
214,
215,
345,
346,
368,
369,
417,
465,
540,
634,
671,
716,
717,
739,
740,
759,
778,
792,
793,
842,
843,
856,
871,
885,
900,
915,
932,
947,
962,
979,
996,
1013,
1032,
1033,
1072,
1073,
1086,
1101,
1115,
1130,
1145,
1162,
1163,
1176,
1191,
1205,
1220,
1235,
1252,
1253,
1268,
1283,
1297,
1314,
1331,
1350,
1351,
1422,
1423,
1436,
1451,
1465,
1480,
1495,
1512,
1526,
1542,
1543,
1556,
1571,
1585,
1600,
1615,
1632,
1633,
1648,
1663,
1679,
1696,
1713,
1732,
1733,
1797,
1798,
1912,
1913,
1914,
2008,
2009,
2037,
2038,
2050,
2051,
2171,
2172,
2185,
2200,
2214,
2229,
2244,
2261,
2262,
2320,
2321,
2447,
2448,
2460,
2475,
2489,
2538,
2553,
2568,
2585,
2586,
2599,
2614,
2628,
2655,
2670,
2685,
2702,
2703,
2718,
2733,
2747,
2776,
2793,
2810,
2829,
2830,
2919,
2920,
2946,
2947,
3142,
3143,
3666,
3667,
4008,
4009,
4281,
4282,
4343,
4344,
4435,
4576,
4602,
4603,
4698,
4699,
4855,
4856,
4918,
4919,
4945,
4946,
5065,
5066,
5092,
5093,
5338,
5339,
5365,
5366,
5433,
5434,
5601,
5602,
6013,
6014,
6059,
6125,
6153,
6154,
6162,
6184,
6219,
6256,
6270,
6277,
6286,
6312,
6313,
6660,
6661,
6709,
6710,
6839,
6840,
6888,
6889,
7079,
7080,
7155,
7156,
7455,
7456,
7550,
7551,
7657,
7658,
7695,
7696,
7858,
7859,
7904,
7905,
8161,
8162,
8188,
8189,
8445,
8446,
8599,
8600,
8626,
8627,
8678,
8679,
8689,
8699,
8712,
8713,
8723,
8733,
8790,
8803,
8816,
8831,
8832,
8842,
8852,
8909,
8922,
8935,
8950,
8951,
8963,
8975,
9032,
9047,
9062,
9077,
9078,
9141,
9142,
9173,
9227,
9283,
9284,
9470,
9471,
9497,
9502,
9661,
9666,
9886,
9891,
10183,
10184,
10196,
10197,
10199,
10207,
10208,
10286,
10287,
10377
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10377,
"ccnet_original_nlines": 270,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38698628544807434,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.054794520139694214,
"rps_doc_frac_lines_end_with_ellipsis": 0.0184501800686121,
"rps_doc_frac_no_alph_words": 0.18639922142028809,
"rps_doc_frac_unique_words": 0.3054216802120209,
"rps_doc_mean_word_length": 4.606626510620117,
"rps_doc_num_sentences": 80,
"rps_doc_symbol_to_word_ratio": 0.002935420023277402,
"rps_doc_unigram_entropy": 5.542507171630859,
"rps_doc_word_count": 1660,
"rps_doc_frac_chars_dupe_10grams": 0.043415721505880356,
"rps_doc_frac_chars_dupe_5grams": 0.17562443017959595,
"rps_doc_frac_chars_dupe_6grams": 0.1617627739906311,
"rps_doc_frac_chars_dupe_7grams": 0.14280110597610474,
"rps_doc_frac_chars_dupe_8grams": 0.07885444909334183,
"rps_doc_frac_chars_dupe_9grams": 0.052569638937711716,
"rps_doc_frac_chars_top_2gram": 0.02092324011027813,
"rps_doc_frac_chars_top_3gram": 0.025892509147524834,
"rps_doc_frac_chars_top_4gram": 0.005492350086569786,
"rps_doc_books_importance": -861.409423828125,
"rps_doc_books_importance_length_correction": -861.409423828125,
"rps_doc_openwebtext_importance": -546.3731079101562,
"rps_doc_openwebtext_importance_length_correction": -546.3731079101562,
"rps_doc_wikipedia_importance": -353.5039978027344,
"rps_doc_wikipedia_importance_length_correction": -353.5039978027344
},
"fasttext": {
"dclm": 0.3129797577857971,
"english": 0.8949110507965088,
"fineweb_edu_approx": 1.4843125343322754,
"eai_general_math": 0.15932714939117432,
"eai_open_web_math": 0.3506704568862915,
"eai_web_code": 0.10941792279481888
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
4,995,768,938,275,704,000 |
Age of Warscape Wiki
m
(One intermediate revision by the same user not shown)
Line 10: Line 10:
|hair=Brown<br/>Black<br/>Red<br/>Blonde<br/>Grey
|hair=Brown<br/>Black<br/>Red<br/>Blonde<br/>Grey
|dist=Short stature
|dist=Short stature
|lang=English
+
|lang=Uloffian
|life=65 years
|life=65 years
|diet=Fungivorous
|diet=Fungivorous
}}
}}
+
Gnomes are a short, technologically gifted race who use bio-tech to create machinery, such as war engines. The Gnomes live underground, creating machinery for the war cause, along with creating and using massive explosives. Gnomes are allied with the [[2nd Legion]], and are a selectable species in the 2nd Legion faction.
+
The '''Gnomes''' are a primary species appearing in [[Age of Warscape]] and [[Age of Warscape: Origins]]. They are one of the ten dominant species on [[Uloff]], and are a common race appearing in northern [[Gaderon]]. The race, recognized as small, short-tempered humanoids, are well-known for creating machinery, war machines, and weaponry. They are led under the [[Gnome Council]], which is a small group of three Gnomes that lead the entire race. The Gnome race is allied with the [[2nd Legion]], and is a playable species in the faction.
==History==
==History==
Line 30: Line 31:
==Appearance==
==Appearance==
[[File:Gnome2.jpg|100px|right]]
[[File:Gnome2.jpg|100px|right]]
Gnomes greatly resemble that of a [[Human]] and a [[Jaar]]. The only distinctive feature between a Gnome and a Human is the Gnome's size, which can measure upto 3 feet. Gnomes are also known to have little to no facial hair, which is shaved in order to prevent getting caught in machinery. They are also known to commonly wear overalls, very light armour, work-gloves, and goggles. Rarely does a Gnome ever wear a full-set of armour.
+
Gnomes greatly resemble that of a [[Human]] and a [[Jaar]]. The only distinctive feature between a Gnome and a Human is the Gnome's size, which can measure up to 3 feet. Gnomes are also known to have little to no facial hair, which is shaved in order to prevent getting caught in machinery. They are also known to commonly wear overalls, very light armour, work-gloves, and goggles. Rarely does a Gnome ever wear a full-set of armour.
A Gnome's hairline will usually fall back, and their hair will typically be very short. Gnome hairstyles usually consist of spiked up or combed forward hair.
A Gnome's hairline will usually fall back, and their hair will typically be very short. Gnome hairstyles usually consist of spiked up or combed forward hair.
Line 36: Line 37:
==Personality==
==Personality==
As the "everyone is different" rule applies, most Gnomes take a great liking to bombs, gold, and watching others get blown up. Some might say the Gnomes are insane, which is due to the lack in fresh air that the race gets. Despite their insanity, Gnomes are seen to be incredibly smart.
As the "everyone is different" rule applies, most Gnomes take a great liking to bombs, gold, and watching others get blown up. Some might say the Gnomes are insane, which is due to the lack in fresh air that the race gets. Despite their insanity, Gnomes are seen to be incredibly smart.
+
+
A typical Gnome is also highly short-tempered, and are typically extremely easy to anger. The race can often be uncooperative due to their habit of doing things on their own.
==Leadership & Government==
==Leadership & Government==
Latest revision as of 16:24, 20 February 2018
Gnome
Gnome.png
Details
Leader
The Council
Playable
Yes
Faction
2nd Legion
Capital
Tubetown
Average Height
3.10ft
Skin Colours
Pale
Tan
Light Brown
Hair Colours
Brown
Black
Red
Blonde
Grey
Eye Colours
Green
Brown
Blue
Grey
Hazel
Languages
Uloffian
Life Span
65 years
Diet
Fungivorous
The Gnomes are a primary species appearing in Age of Warscape and Age of Warscape: Origins. They are one of the ten dominant species on Uloff, and are a common race appearing in northern Gaderon. The race, recognized as small, short-tempered humanoids, are well-known for creating machinery, war machines, and weaponry. They are led under the Gnome Council, which is a small group of three Gnomes that lead the entire race. The Gnome race is allied with the 2nd Legion, and is a playable species in the faction.
History[]
The Gnome emblem
For centuries, Gnomes have inhabited the northwestern, mountainous side of Gaderon, known as the Joral Mountains. They have lived underground, inside and below the vast mountain range of Joral Mountains. Through the years, this race had built a magnificent city underground, naming it "Tubetown", due to its transit system revolving around large tubes. Throughout their isolation underground, the Gnomes have mastered the art of machinery, and have discovered how to utilize sulfur as a weapon. They have also discovered the use of steam-powered machinery, giving them the ability to create vehicles and mechsuits.
The Gnomes had built a huge arsenal of different machinery and weapons, and have utilized their knowledge in harnessing electricity. Their inventions were later noticed by the Jaar, who were impressed by the Gnomes' creations and innovations. The Gnomes found the Jaar in their splendor, due to their heavy armor, large size, and use of axes. The two races eventually formed an alliance with one another, and became close friends. The Gnomes began to trade firearms, explosives, machinery, and mechsuits to the Jaar, who gave them battleaxes, armour, traditional food, animal pelts, rare metals, and paint in return.
When the First War of Gaderon began, the Gnomes joined the Jaar in the destruction of the Human and Jin'tulu. Although they did not succeed, they earned the respect of the Jaar after they saw the Gnomes' machinery and weapons in action. After retreating back to Tubetown, the Gnomes began to build even more machinery and weapons, and mastered the use of bio-technology.
When the Great War began, the Gnomes happily joined the 2nd Legion. However, they requested a cease-fire with The Arbiters shortly after, as they had not built their defenses enough to outmatch the armies of the Arbiters. The Arbiters reluctantly accepted their request, warning them that "any act of aggression towards The Arbiters or aiding the 2nd Legion will terminate the cease-fire". Now, the Gnomes build their arsenal of machinery and weaponry, waiting to use it against The Arbiters.
Appearance[]
Gnome2.jpg
Gnomes greatly resemble that of a Human and a Jaar. The only distinctive feature between a Gnome and a Human is the Gnome's size, which can measure up to 3 feet. Gnomes are also known to have little to no facial hair, which is shaved in order to prevent getting caught in machinery. They are also known to commonly wear overalls, very light armour, work-gloves, and goggles. Rarely does a Gnome ever wear a full-set of armour.
A Gnome's hairline will usually fall back, and their hair will typically be very short. Gnome hairstyles usually consist of spiked up or combed forward hair.
Personality[]
As the "everyone is different" rule applies, most Gnomes take a great liking to bombs, gold, and watching others get blown up. Some might say the Gnomes are insane, which is due to the lack in fresh air that the race gets. Despite their insanity, Gnomes are seen to be incredibly smart.
A typical Gnome is also highly short-tempered, and are typically extremely easy to anger. The race can often be uncooperative due to their habit of doing things on their own.
Leadership & Government[]
A small group known as "The Council" leads the Gnomes proudly. The Council consists of High-Tinkerer Fizzra, Technoking Pinchblast, and Forgelord Feezlebor. The three all have their own strengths and weaknesses, and all make decisions for the race.
The Gnome race operates under an oligarchic government, with a group of individuals in charge of the race. This group, known as "The Gnome Council", makes and agrees on decisions, and all share equal responsibility for the race. There are only three spots on the Council, which are filled by old, wise, and experienced Gnomes. Once a previous member of the Council dies or resigns, a new member is appointed by the remaining Council. If all three members die, then they are replaced by relatives, offspring, or individuals elected by the people.
Culture[]
The Gnomes love machinery and building things, and take great pride in their creations. They love to show off their creations in the most obvious ways possible. The race also has a great liking towards firearms and explosives, and have a habit of testing them on uninhabited locations, usually for no reason at all. The race is known to build their buildings in walls and rocks, using a transit system to connect them all. They have also been known to be the first race to harness electricity, and to use vehicles.
|
{
"url": "https://ageofwarscape.fandom.com/wiki/Gnome?diff=5083&oldid=3782",
"source_domain": "ageofwarscape.fandom.com",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "290006",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:I3YKMXFIZU3PPVZ5U3ICA5QYDEBU7G7O",
"WARC-Concurrent-To": "<urn:uuid:1eab8e33-9165-4aa4-a670-e75aa9632697>",
"WARC-Date": "2022-08-20T01:46:05Z",
"WARC-IP-Address": "151.101.64.194",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FT5WZ37335XU4QZNVEJ7ME3UX63FB2CM",
"WARC-Record-ID": "<urn:uuid:4da14952-df73-4f5f-923d-c5ca777be6a0>",
"WARC-Target-URI": "https://ageofwarscape.fandom.com/wiki/Gnome?diff=5083&oldid=3782",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6be667d7-c0c4-4e96-9ea5-9f955def9004>"
},
"warc_info": "isPartOf: CC-MAIN-2022-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-103\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
21,
23,
25,
80,
98,
100,
150,
152,
202,
204,
224,
226,
246,
260,
262,
277,
279,
294,
296,
311,
313,
331,
333,
351,
353,
356,
358,
361,
365,
369,
692,
694,
698,
1240,
1244,
1246,
1258,
1260,
1272,
1290,
1292,
1307,
1309,
1324,
1326,
1358,
1360,
1392,
1826,
1828,
2263,
2267,
2269,
2427,
2429,
2587,
2605,
2607,
2623,
2625,
2641,
2643,
2930,
2932,
3219,
3223,
3227,
3402,
3406,
3408,
3436,
3438,
3466,
3467,
3513,
3514,
3520,
3530,
3538,
3545,
3557,
3566,
3570,
3578,
3589,
3597,
3606,
3621,
3628,
3641,
3646,
3650,
3662,
3675,
3681,
3687,
3691,
3698,
3703,
3715,
3721,
3727,
3732,
3737,
3743,
3753,
3762,
3772,
3781,
3786,
3798,
3799,
3800,
4312,
4313,
4323,
4324,
4341,
4342,
4957,
4958,
5575,
5576,
5947,
5948,
6441,
6442,
6455,
6456,
6467,
6468,
6895,
6896,
7054,
7055,
7069,
7070,
7357,
7358,
7533,
7534,
7560,
7561,
7810,
7811,
8357,
8358,
8368,
8369
],
"line_end_idx": [
21,
23,
25,
80,
98,
100,
150,
152,
202,
204,
224,
226,
246,
260,
262,
277,
279,
294,
296,
311,
313,
331,
333,
351,
353,
356,
358,
361,
365,
369,
692,
694,
698,
1240,
1244,
1246,
1258,
1260,
1272,
1290,
1292,
1307,
1309,
1324,
1326,
1358,
1360,
1392,
1826,
1828,
2263,
2267,
2269,
2427,
2429,
2587,
2605,
2607,
2623,
2625,
2641,
2643,
2930,
2932,
3219,
3223,
3227,
3402,
3406,
3408,
3436,
3438,
3466,
3467,
3513,
3514,
3520,
3530,
3538,
3545,
3557,
3566,
3570,
3578,
3589,
3597,
3606,
3621,
3628,
3641,
3646,
3650,
3662,
3675,
3681,
3687,
3691,
3698,
3703,
3715,
3721,
3727,
3732,
3737,
3743,
3753,
3762,
3772,
3781,
3786,
3798,
3799,
3800,
4312,
4313,
4323,
4324,
4341,
4342,
4957,
4958,
5575,
5576,
5947,
5948,
6441,
6442,
6455,
6456,
6467,
6468,
6895,
6896,
7054,
7055,
7069,
7070,
7357,
7358,
7533,
7534,
7560,
7561,
7810,
7811,
8357,
8358,
8368,
8369,
8883
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8883,
"ccnet_original_nlines": 149,
"rps_doc_curly_bracket": 0.00045029999455437064,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3542354106903076,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.003300329903140664,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19416941702365875,
"rps_doc_frac_unique_words": 0.29598307609558105,
"rps_doc_mean_word_length": 4.8964056968688965,
"rps_doc_num_sentences": 82,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.237196922302246,
"rps_doc_word_count": 1419,
"rps_doc_frac_chars_dupe_10grams": 0.4663212299346924,
"rps_doc_frac_chars_dupe_5grams": 0.4699194133281708,
"rps_doc_frac_chars_dupe_6grams": 0.4699194133281708,
"rps_doc_frac_chars_dupe_7grams": 0.4663212299346924,
"rps_doc_frac_chars_dupe_8grams": 0.4663212299346924,
"rps_doc_frac_chars_dupe_9grams": 0.4663212299346924,
"rps_doc_frac_chars_top_2gram": 0.027202069759368896,
"rps_doc_frac_chars_top_3gram": 0.010362690314650536,
"rps_doc_frac_chars_top_4gram": 0.012089810334146023,
"rps_doc_books_importance": -870.1465454101562,
"rps_doc_books_importance_length_correction": -870.1465454101562,
"rps_doc_openwebtext_importance": -485.1332092285156,
"rps_doc_openwebtext_importance_length_correction": -485.1332092285156,
"rps_doc_wikipedia_importance": -336.7568054199219,
"rps_doc_wikipedia_importance_length_correction": -336.7568054199219
},
"fasttext": {
"dclm": 0.7226585149765015,
"english": 0.9701123833656311,
"fineweb_edu_approx": 2.74145245552063,
"eai_general_math": 0.017924850806593895,
"eai_open_web_math": 0.2458045482635498,
"eai_web_code": 0.002399679971858859
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.01",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "599.9",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Zoology",
"level_3": "Mammals"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-8,079,775,507,748,091,000 |
Синтаксис JavaScript Справочник JavaScript JSON Коды клавиш События Строгий режим
Объект event
Обработчики событий могут быть привязаны к объекту Element, Document, Window и т.д. Затем, в тот момент, когда происходит какое-либо событие, создаётся объект Event (событие), который передаётся в качестве аргумента обработчику события.
Интерфейс события объектной модели документа (DOM) доступен только через объект Event, который передаётся в качестве аргумента в обработчик события (в IE8 и более ранних версиях, объект Event доступен в виде глобальной переменной window.event). Следующий пример показывает, как объект Event передаётся обработчику события и может быть использован внутри него.
window.addEventListener("keydown", foo, false);
function foo(event) {
// параметр event неявно инициализируется объектом Event
alert(event);
}
Методы
МетодОписание
preventDefault()Отменяет событие, если оно является отменяемым, без остановки дальнейшего распространения события.
stopImmediatePropagation()Предотвращает любое дальнейшее распространение события.
stopPropagation()Предотвращает дальнейшее распространение текущего события.
Свойства
СвойствоОписание
bubblesВозвращает логическое значение, которое указывает, является ли событие всплывающим.
cancelableВозвращает логическое значение, указывающее, является ли событие отменяемым.
currentTargetВозвращает целевой объект события, обрабатываемого в настоящее время.
defaultPreventedПолучает значение, указывающее, следует ли отменить действи по умолчанию. True - действия по умолчанию должны быть отменены, false - действия по умолчанию разрешаются.
eventPhaseУказывает, какая фаза события, в настоящее время проверяется.
targetСсылается на элемент, который является целевым объектом данного события.
timeStampПолучает время в миллисекундах, когда произошло событие.
typeИмя события (без учета регистра).
isTrustedПолучает значение, указывающее, было ли событие инициировано в браузере (события браузера и пользовательские события) или в сценарии.
Копирование материалов с данного сайта возможно только с разрешения администрации сайта
и при указании прямой активной ссылки на источник.
2011-2016 © puzzleweb.ru
Реклама на сайте | [email protected]
|
{
"url": "https://puzzleweb.ru/javascript/dom_event.php",
"source_domain": "puzzleweb.ru",
"snapshot_id": "crawl=CC-MAIN-2017-39",
"warc_metadata": {
"Content-Length": "14383",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:B3UAP5BSSQSN5UJPVW3CGJWOSEXVHVQH",
"WARC-Concurrent-To": "<urn:uuid:9241a8be-bf83-480c-a596-526307e22768>",
"WARC-Date": "2017-09-25T02:40:09Z",
"WARC-IP-Address": "141.8.192.32",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Z6NBMSA5THRNLEBNZWMSVGXJTBYJ5V5G",
"WARC-Record-ID": "<urn:uuid:db9e1b22-2c09-434e-8d5f-05bd6c3b95bf>",
"WARC-Target-URI": "https://puzzleweb.ru/javascript/dom_event.php",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d96a4c50-b6ed-4ec1-a65e-fcf9a92d7bc3>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-142-62-187.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-39\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for September 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
82,
83,
96,
97,
334,
335,
695,
696,
744,
745,
767,
826,
842,
844,
845,
852,
853,
867,
982,
1064,
1140,
1141,
1150,
1151,
1168,
1259,
1346,
1429,
1613,
1685,
1764,
1830,
1868,
2011,
2099,
2150,
2175,
2176
],
"line_end_idx": [
82,
83,
96,
97,
334,
335,
695,
696,
744,
745,
767,
826,
842,
844,
845,
852,
853,
867,
982,
1064,
1140,
1141,
1150,
1151,
1168,
1259,
1346,
1429,
1613,
1685,
1764,
1830,
1868,
2011,
2099,
2150,
2175,
2176,
2215
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2215,
"ccnet_original_nlines": 38,
"rps_doc_curly_bracket": 0.0009029299835674465,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008955219760537148,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.8626865744590759,
"rps_doc_frac_unique_words": 0.642276406288147,
"rps_doc_mean_word_length": 7.691056728363037,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.778884410858154,
"rps_doc_word_count": 246,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03911205008625984,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.029069770127534866,
"rps_doc_frac_chars_top_3gram": 0.021141650155186653,
"rps_doc_frac_chars_top_4gram": 0.029598310589790344,
"rps_doc_books_importance": -148.85031127929688,
"rps_doc_books_importance_length_correction": -148.85031127929688,
"rps_doc_openwebtext_importance": -84.69975280761719,
"rps_doc_openwebtext_importance_length_correction": -84.69975280761719,
"rps_doc_wikipedia_importance": -69.01679229736328,
"rps_doc_wikipedia_importance_length_correction": -69.01679229736328
},
"fasttext": {
"dclm": 0.5951518416404724,
"english": 0.00003778999962378293,
"fineweb_edu_approx": 1.8206820487976074,
"eai_general_math": -0.000007749999895168003,
"eai_open_web_math": 0.1529279351234436,
"eai_web_code": 0.49955952167510986
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-2,329,814,529,665,583,600 |
tag:blogger.com,1999:blog-2267747408703654731.post4680500345704361906..comments2016-02-11T13:34:50.896-08:00Comments on Prettt-tty, pretty, pretty good!: Alignable functors: a typeclass for 'zippy' containersPaul Chiusanohttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2267747408703654731.post-1566360825078115352010-07-07T06:08:48.550-07:002010-07-07T06:08:48.550-07:00A "strong lax monoidal functor" is the m...A "strong lax monoidal functor" is the more formal notion expressed by Applicative.<br /><br />class Functor f => Monoidal f where<br /> unit :: a -> f a<br /> (^*^): f a -> f b -> f (a, b)<br /><br />When your category (like Haskell) has arbitrary exponential objects, the two formalisms are equivalent. In other categories you can have Monoidal when Applicative isn't definable.Edward Kmetthttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2267747408703654731.post-39095994067020943392010-07-06T08:41:09.458-07:002010-07-06T08:41:09.458-07:00Even if your container doesn't provide an empt...Even if your container doesn't provide an empty value, you can always get a free alignable functor by composing Maybe.Rúnarhttp://apocalisp.wordpress.com/[email protected]:blogger.com,1999:blog-2267747408703654731.post-59879177340150818112010-07-06T08:21:06.862-07:002010-07-06T08:21:06.862-07:00@Ed - yes, actually, in our code, we split just th...@Ed - yes, actually, in our code, we split just the align function out into its own typeclass (called 'Align') and there are a couple places that are bounded by Align rather than Alignable.<br /><br />What is a "strong lax monoidal functor"? :)Paul Chiusanohttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-2267747408703654731.post-75354096464960925062010-07-05T15:30:56.611-07:002010-07-05T15:30:56.611-07:00Nice observation on the additional law for zipWith...Nice observation on the additional law for zipWith.<br /><br />One note is that as commonly used, a zippable container need not provide an empty value. so they are often only the 'semigroup' portion of the Applicative functor, rather than the full strong lax monoidal functor.Edward Kmetthttp://www.blogger.com/profile/[email protected]
|
{
"url": "http://pchiusano.blogspot.com/feeds/4680500345704361906/comments/default",
"source_domain": "pchiusano.blogspot.com",
"snapshot_id": "crawl=CC-MAIN-2016-07",
"warc_metadata": {
"Content-Length": "9437",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SJAIWSCKYAHHVEJCPZCTISAZUCWQRIOA",
"WARC-Concurrent-To": "<urn:uuid:4bdc0703-70b6-44d8-9080-4351d53f1d30>",
"WARC-Date": "2016-02-14T08:01:55Z",
"WARC-IP-Address": "173.194.121.10",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:OIQFCNEMKDRUK6QM6LZO3PX7UHKVUYBP",
"WARC-Record-ID": "<urn:uuid:f06d9439-7752-4888-a38c-a06d4cababb6>",
"WARC-Target-URI": "http://pchiusano.blogspot.com/feeds/4680500345704361906/comments/default",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e8d9b546-4f65-4917-896f-f9b2af206a1e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-236-182-209.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-07\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for February 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0
],
"line_end_idx": [
2401
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2401,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1956155151128769,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01854974962770939,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4890387952327728,
"rps_doc_frac_unique_words": 0.5876777172088623,
"rps_doc_mean_word_length": 9.042654037475586,
"rps_doc_num_sentences": 50,
"rps_doc_symbol_to_word_ratio": 0.01854974962770939,
"rps_doc_unigram_entropy": 4.60991907119751,
"rps_doc_word_count": 211,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.138364776968956,
"rps_doc_frac_chars_dupe_6grams": 0.138364776968956,
"rps_doc_frac_chars_dupe_7grams": 0.03249476104974747,
"rps_doc_frac_chars_dupe_8grams": 0.03249476104974747,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02306080050766468,
"rps_doc_frac_chars_top_3gram": 0.033018868416547775,
"rps_doc_frac_chars_top_4gram": 0.05031447112560272,
"rps_doc_books_importance": -250.9119873046875,
"rps_doc_books_importance_length_correction": -250.9119873046875,
"rps_doc_openwebtext_importance": -122.78374481201172,
"rps_doc_openwebtext_importance_length_correction": -122.78374481201172,
"rps_doc_wikipedia_importance": -44.334102630615234,
"rps_doc_wikipedia_importance_length_correction": -44.334102630615234
},
"fasttext": {
"dclm": 0.763339102268219,
"english": 0.6206490397453308,
"fineweb_edu_approx": 2.3107364177703857,
"eai_general_math": 0.4118928909301758,
"eai_open_web_math": 0.8208456039428711,
"eai_web_code": 0.3490734100341797
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "512",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-6,629,449,323,190,914,000 |
filterBlockOnly (J1939)
Block only specified parameter groups on J1939 channel filter
Syntax
filterBlockOnly(chan,pgname)
Description
example
filterBlockOnly(chan,pgname) configures the filter on the channel chan to block only the parameter groups specified by pgname.
Examples
collapse all
Configure the channel filter to block only specified J1939 parameter groups on the channel.
db = canDatabase('MyDatabase.dbc');
chan = j1939Channel(db,'Vector','CANCaseXL 1',1);
filterBlockOnly(chan,{'PG1' 'PG2'})
Input Arguments
collapse all
J1939 channel, specified as a channel object. Use thej1939Channel function to create and define the channel.
Blocked J1939 parameter groups, specified as a character vector, string, or array of these.
Example: 'PG1'
Data Types: char | string | cell
Introduced in R2015b
|
{
"url": "https://www.mathworks.com/help/vnt/ug/filterblockonly_j1939.html",
"source_domain": "www.mathworks.com",
"snapshot_id": "crawl=CC-MAIN-2019-35",
"warc_metadata": {
"Content-Length": "65541",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CVJ5SDPGNJ2JOKEAB7YEN4S6LPSJZGP3",
"WARC-Concurrent-To": "<urn:uuid:7b61869c-83f7-4905-ae05-a80b954d803d>",
"WARC-Date": "2019-08-21T23:12:00Z",
"WARC-IP-Address": "104.104.91.201",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MXLB4EAKCTQU2PHZLJQGYAVPM4NVMC3S",
"WARC-Record-ID": "<urn:uuid:dbd56e55-a4f0-45e1-a6be-3c2bf4a08d26>",
"WARC-Target-URI": "https://www.mathworks.com/help/vnt/ug/filterblockonly_j1939.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7c314ea5-6c41-4548-9097-6a9df3fbc664>"
},
"warc_info": "isPartOf: CC-MAIN-2019-35\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-32.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
24,
25,
87,
88,
95,
96,
125,
126,
138,
139,
147,
148,
275,
276,
285,
286,
299,
300,
392,
393,
429,
479,
515,
516,
532,
533,
546,
547,
656,
657,
749,
750,
765,
766,
799,
800
],
"line_end_idx": [
24,
25,
87,
88,
95,
96,
125,
126,
138,
139,
147,
148,
275,
276,
285,
286,
299,
300,
392,
393,
429,
479,
515,
516,
532,
533,
546,
547,
656,
657,
749,
750,
765,
766,
799,
800,
820
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 820,
"ccnet_original_nlines": 36,
"rps_doc_curly_bracket": 0.0024390199687331915,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2199999988079071,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.053333330899477005,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2666666805744171,
"rps_doc_frac_unique_words": 0.5699999928474426,
"rps_doc_mean_word_length": 6.5,
"rps_doc_num_sentences": 7,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.813908100128174,
"rps_doc_word_count": 100,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.0923076868057251,
"rps_doc_frac_chars_top_3gram": 0.055384621024131775,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -43.650978088378906,
"rps_doc_books_importance_length_correction": -43.650978088378906,
"rps_doc_openwebtext_importance": -33.579505920410156,
"rps_doc_openwebtext_importance_length_correction": -33.50359344482422,
"rps_doc_wikipedia_importance": -21.851642608642578,
"rps_doc_wikipedia_importance_length_correction": -21.851642608642578
},
"fasttext": {
"dclm": 0.021528780460357666,
"english": 0.4141283333301544,
"fineweb_edu_approx": 2.5822410583496094,
"eai_general_math": 0.19571524858474731,
"eai_open_web_math": 0.24344885349273682,
"eai_web_code": 0.9955253005027771
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-5,403,639,749,655,604,000 |
HP12C+
#1
According to DATAFILE V27 N5 a new edition of the 12C is going to be sold, featuring the opportunity for firmware updates and modifications like the HP20b offered recently. Does anybody know whether there are more changes included therein, e.g. a different LCD?
#2
Quote:
According to DATAFILE V27 N5 a new edition of the 12C is going to be sold, featuring the opportunity for firmware updates and modifications like the HP20b offered recently. Does anybody know whether there are more changes included therein, e.g. a different LCD?
If it uses the new ARM processor as per the 20b, that chip is perfectly capable of driving the existing display.
If this is true though, then a scientific version can't be that far away...
Dave.
#3
Would the 12C LCD allow for turning it into a 15C?
#4
Quote:
Would the 12C LCD allow for turning it into a 15C?
The main problem is the keys.
Dave.
#5
If it's still the old LCD :-/ , it was the same for all Voyagers.
#6
Same LCD.
#7
If HP knows we are willing to tear apart perfectly good hardware to get to the JTAG interface, perhaps they would be so kind as to manufacture generic or blank buttons for us to insert during the calculator surgery. Preferably the blank ones would be white, or light, ready to accept Sharpie ink.
(This is probably not news to many here): As seen in the link below, the keys appear to be individually placed in the case, which would allow for endless keyboard configurations.
http://www.decodesystems.com/hp11c-apart.html
PG
#8
Quote:
According to DATAFILE V27 N5 a new edition of the 12C is going to be sold, featuring the opportunity for firmware updates and modifications like the HP20b offered recently. Does anybody know whether there are more changes included therein, e.g. a different LCD?
I've asked this before--do we know what CPU is used in the 12C+? I've not found one in the stores yet, or I'd have already opened it up.
#9
hello
Quote:
I've asked this before--do we know what CPU is used in the 12C+? I've not found one in the stores yet, or I'd have already opened it up.
opening it up will not help you, the CPU is in die form under a blob of black stuff... but it's the same ARM7 from Atmel than on the 20b.
Unfortunately, the HP 12C+ does NOT have the Jtag interface (sorry) due to ESD reasons... BUt it still has the serial interface, so you can still reprogram it! I will be probably releasing data on the HP 12C+ soon including schematics and an example application.
regards, cyrille
#10
Quote:
Unfortunately, the HP 12C+ does NOT have the Jtag interface (sorry) due to ESD reasons... BUt it still has the serial interface, so you can still reprogram it! I will be probably releasing data on the HP 12C+ soon including schematics and an example application.
regards, cyrille
No JTAG certainly puts the brakes on my reverse engineering fun, but releasing schematics will be appreciated.
I'm liking this trend toward open hardware...
#11
Gene, I hope you get some royalties...
Just found this ;-) <<<CLICK
Edited: 11 Nov 2008, 4:36 a.m. after one or more responses were posted
#12
Ha!
Nope, none of those suggestions will make it into a 12c any time soon.
I don't think any model will actually be called a 12c+ anyway. It's just a faster 12c.
Much, much faster.
#13
I thought bank and mortgage people didn't trust 12c Platinum numbers because it was too fast, or is that folklore?
#14
In my opinion, the procedure shown at the link you provided makes disassembly look a lot easier than it is. The picture shown with step 3 is not what you would see after removing the screws and removing the back. At that stage, you have two pieces: the back shell, and a "sandwich" consisting of the printed circuit board, key contacts, keys and front shell. Separating that sandwich requires a rather nasty process of trimming 40+ heat stakes to free the front shell and allow it all to be separated. The stakes must be carefully trimmed, removing only the part of the stake that is "mushroomed" over. The center portion of the mushroom must be left intact and protruding through the PCB so that there is something to either “re-mushroom” or glue to when reassembling. Reassembly of the sandwich in a tight, sturdy and reliable manner after the keys are re-arranged and/or the keys and keyboard itself are relabeled is something which I believe would be beyond the abilities of most mortals.
But, since the subject 11C was built in 1985, perhaps new voyagers utilize a different type of construction. I do not have a new “ 12C+” or even a late model 12C (i.e. with a single 2032 battery) to take apart to check. I do have a 12CP 25th Anniversary model. Being the curious sort, I attempted to remove the back. First off – it has 5 screws, the four under the feet and one in the battery compartment. There are also several plastic catches around the sides (one each on the top and sides, two on the bottom) which were freed with some gentle prying to separate the back. Suffice it to say that it doesn’t look a lot like the 11C. However, this may be good - although the PCB and the rest of the stuff between it and the front shell do not readily separate, there do not appear to be a bazillion heat stakes. Without taking an exacto knife to them, it appears that there are just 11 heat stakes that hold things together. What’s more, these stakes look like the ones in the 35s (disassembly detailed here), except without the screws. So maybe they could be trimmed, then re-fastened with tiny screws. However, the keys may be on frames, like the 35s. If the 12C+ uses similar construction, perhaps disassembly and re-labelling may be viable. Of course all of the above is speculation, which Cyrille or one of our friends with a 12C+ are warmly invited to confirm or correct.
#15
Hi Cyrille,
May I ask your honest opinion an why you think HP or their subcontractors aren't able to produce a decent keyboard anymore. Please don't take this as an offense but rather as a constructive comment. I've just bought a HP-20b and deeply regret it. Ok I bought it mainly as I was interested in ARM CPU programming. I don't think I'm spoilt by good old and expensive HP calcs but I expect a minimum usability. My claim is that it's almost impossible to do some error free calcs on these new HPs due to many missed keystrokes. And I can hardly believe that it's impossible to design a reliable keyboard on a budget. I don't expect molded keys but a good tactile feedback.
I hope the new 12C+ is better in this respect.
Regards from Switzerland
Daniel
#16
Don't ask this of Cyrille. You know perfectly well he can't answer while he works for HP.
#17
Hi Bruce,
Actually it was my intention to ask Cyrille as he works for HP and I hope he's got something to say on harware evaluation. I also like to mention that I like the software of the 20b and the fact that this is the first business calc to also have scientific functions. But I had it used by some of my coworkers in the aircraft R&D dept and they all struggled over the unusable keyboard. I haven't given up all my hopes.
Regards Daniel
#18
I do not have a 20b but a 35s, 17bii+ silver, and 12c anniversary edition. Last 3 models feature keyboards with IMHO reasonable tactile response, and my samples record my keystrokes reliably. So, my conclusion is: YES HP CAN produce "right" keyboards still :)
Seems to be impossible for them, however, to merge all advantages into one model. You get firmware access (20b) OR a row of soft keys (17bii+) OR landscape design (12cp) OR scientific (35s). You MAY get a good keyboard (3 out of 4). You will get 16x131 dot matrix of 1988 (17bii+), 7 segments display of 1981 (12cp), 2x14 pixel blocks (35s), or crippled dot matrix (20b). You will NOT get a state of the art display. Hard to understand for me. Must be marketing ;)
Ceterum censeo: HP, launch a 43s (or a 15s or ... well, you know).
Walter
Edited to add the display variants.
Edited: 11 Nov 2008, 2:33 p.m.
#19
Quote:
According to DATAFILE V27 N5 a new edition of the 12C is going to be sold, featuring the opportunity for firmware updates and modifications like the HP20b offered recently. Does anybody know whether there are more changes included therein, e.g. a different LCD?
When will HP launch the HP 12C+ ?
Apart from using new CPU, any additional features?
#20
Already selling overseas.
No new features other than the serial connection.
Sorry, no cable for that in the box.
How to tell the difference? new 12c uses two 2032 coin batteries.
#21
Gene,
if I understand you correctly, then there will be no difference visible looking on the keyboard (or top) side of the 12c. Y/N?
#22
Quote:
Already selling overseas.
Where?
#23
Yes, no visible difference on the keyboard side of the update.
Being in the USA, I can't answer the second question.
But, if you find a 12c on the shelf somewhere that has a second coin-battery, then you have it.
Or, a 12c that does around 60,000 counts a MINUTE in the " + GTO 01" loop, then you have it. :-)
#24
Quote:
If it uses the new ARM processor as per the 20b, that chip is perfectly capable of driving the existing display.
If this is true though, then a scientific version can't be that far away...
Dave.
Seriously? I'd kill for a superfast 15C.
Just don't ask whom I would kill...
#25
The 12C+ raises an interesting question.
They have completely revamped the hardware architecture on their highest selling and longest running calculator, with no name change or other visible marketing difference - Why?
Were existing components about to become obsolete and they were forced into a change? (unlikely I'd say, but there have been a lot of silicon fabs going under recently)
Is the new solution cheaper to manufacture? Given that they have been selling the old one in large volumes for a long time, and the fact that they'd have to amortise new development cost again, this seems a bit unlikely. Perhaps in the long run?
Is it an investment in a new strategic direction? Where they can more easily churn out new models for niche markets based on common platforms. i.e. they plan to bring back the Voyager platform (and Pioneer like 20b) in scientific and maybe other flavours. This seems likely.
Financial models may have come first because they are a better cash-cow to get the concept off to a flying start perhaps?
Perhaps another reason(s) entirely?, or a combination?
Dave.
#26
My guess is that they will start using just 2 AR'M CPU's
so it is a more strategic directive plus I guess it also lowers the overall cost on the long run, so it's therefore - well - financial decision. just my 2 eurocents...
#27
Nice theory. Let me quote from the Editorial of Datafile V27 N5:
Quote:
This new model (12C+) ... was first mentioned at the HHC2007 conference when (Cyrille) mentioned that the processor used for the 12C Platinum and 25th Anniversary Edition was no longer in production and that stocks were coming to an end, forcing HP to re-design the calculator around a new processor.
#28
Well there you go. Thanks for the clarification.
As a designer I hate it when the "last orders taken" call comes form the manufactuer. Do you buy 10 squillion of them to last you 20 years, or do you redesign...
It's often a big ask to take an ASIC to another fab, so it was probably a no-brainer for them to re-design.
Dave.
#29
The problem with redesigning the 12C is that bugs can/will creep into the firmware. Much of the financial community depends on this calculator and trusts the results. A serious bug will erode that trust and HP could loose the market for this calculator.
Also, we're not the only group of users that are picky about the feel of the keys. I get comments from all my clients (I consult to wall street firms) that they hate the feel of cheap plastic keys on the newer 12c's. I sure hope that the 12C+ doesn't make this even worse.
#30
So this is the knock out for any menus :-(
#31
NOW there is finally hope for new fast and large-memory
HP-15C
with memonics instead of keycodes,
maybe A..Z labels (and matrices)
and 35s-style row-number addressing
and...
<drool>
#32
Hyvää päivää Veli-Pekka,
You were right IF they would spend a reasonable display. But with the traditional one, displaying alphabetic information will be very difficult :(
Ceterum censeo: HP, launch a 15s (with a dot matrix LCD!!)
Walter
#33
Does anyone know when the new 12C will be available in the U.S.? Thanks.
#34
You created a lot of excitement in the community with the open hardware developed recently. Some projects are on their way. Assessing the opportunities, however, it comes down the display driving means are rigidly limiting any custom developments based on these platforms. On the other hand, the largest LCD available so far in an HP RPN calculator is the one seen recently in the 17bii+ Silver again, featuring some 2100 elements. I don't know if you are willing (and allowed) to answer the following 2 naive questions, but I ask them anyway:
1. Is there a chance for a calculator with the form factor of the 17bii+ Silver *with an JTAG interface or similar*?
2. Where are the limits of this LCD driver?
If my request shows a significant lack of electronic understanding then I apologize right now. I'm no electronic engineer, I'm just wondering and trying to understand. Thanks in advance for your response, if possible.
Walter
#35
I do not know, but my guess would be that the new 12C will become available when the old 12C stock that is currently in the pipeline is exhausted. So encourage all of your real estate agent, mortgage broker and stock broker friends (who will not care about the new features) to buy up the old stock. (Oh yeah, the real estate agents, mortgage brokers and stock brokers are having a tough time these days.)
.
#36
Walter,
Sorry, I'm not Cyrille:-) Perhaps he will chime in but if not...
Was not your second question answered here?
.
#37
Jeff,
IIRC these 400 elements were the limits of the chip in the 20b. I want to know the limits of the 17bii+ ... or did I miss anything?
#38
Quote:
Jeff,
IIRC these 400 elements were the limits of the chip in the 20b. I want to know the limits of the 17bii+ ... or did I miss anything?
As far as I know, the 17bii+ uses a 6502 based core with mask or OTP rom, not flash. That means we can't hack new code into the microcontroller.
OTOH, the 20B uses the Atmel AT91SAM7L128, which can be updated in the field with new code. The internal LCD controller is limited to 400 segments.
#39
OK, sorry, I misunderstood. But from what I have read, any and all new designs will be based on the new chip. So if you want more than 400 elements, you need the outboard driver circuitry which increases costs, etc. etc.
.
#40
At least now we can agree on the model number :-)
Also the dot matrix display - even a 20b style - is a must
#41
Fully agree it increases costs, but - just in case it didn't become clear yet - I don't want a mushy calc for 40US$, I want a serious scientific instrument instead.
To make it simple: Right now the top of HP's calculator line sells for some 130US$ retail, with a huge LCD and tremendous power many of us don't need, and a RePeLling OS and a large housing many of us don't want. Somewhere in between the 20b and the 50G, presumably next to the upper limit, must be a niche for the heir of the 42S. According to the survey most of us participated, many are willing to pay even more for such a device than for a 50G.
So if you claim
Quote:
any and all new designs will be based on the new chip
I doubt it, since the 17bii+ Silver contains something different, and since I doubt HP will abandon intentionally all medium level RPN activities and reduce its own market to cheap calcs with low margin. Maybe I'm terribly wrong, however. Dunno. Anyway, DaveJ and Hugh Steers have proven they can build a very nice device within limited time from scratch with standard material and homegrown SW, and for reasonable costs, though far away from mass production. So, if HP will provide a feasible platform, it may well start something like "personal calculating" which may be not only a big boost for its renommee in the sci-tech world but also a direct economic success. It may even become "cool" to taylor one's own calculator. I'm no marketeer - but also the decision for the 35 was not taken by marketeers, nevertheless it became a great (unexpected) success because it started something new fulfilling the needs of professionals.
So, please, HP, after creating the 20b as a guinea pig for the new concept of open calcs, and after extending that approach to the 12C forced by short supplies, please do the next step and provide a platform allowing to make something serious - if you don't want to make it completely on your own.
<end of rant - or in German: Das musste mal gesagt werden!>
Ceterum censeo: ... you know.
Walter
Edited: 12 Nov 2008, 6:12 p.m.
#42
Peace for our time?
Though I must call for a *real* dot matrix display, i.e. 16x131 or higher, as you know ;)
#43
Quote:
Fully agree it increases costs, but - just in case it didn't become clear yet - I don't want a mushy calc for 40US$, I want a serious scientific instrument instead.
Rest assured, your desires are very clear :-)
Quote:
To make it simple: Right now...many are willing to pay even more for such a device than for a 50G.
I agree with everythign you said here.
Quote:
So if you claim
Quote:
Quote:
any and all new designs will be based on the new chip
Not a claim, just an assumption.
Quote:
I doubt it, since the 17bii+ Silver contains something different, and since I doubt HP will abandon intentionally all medium level RPN activities....
I certainly hope you are correct.
#44
hello
Quote:
1. Is there a chance for a calculator with the form factor of the 17bii+ Silver *with an JTAG interface or similar*?
> sorry, but I can not answer that question... however, I can tell you that doing so would require a redesign of the 17BII+ with a new chip which is non trivial
2. Where are the limits of this LCD driver?
> for the 20b, it's 400 segments. for the current 17BII+ CPU, is't in the 2500 range if my memory serves me well.
regards, cyrille
#45
Quote:
Rest assured, your desires are very clear :-)
It's going to be tough to have it all. The 20B CPU is maxed out at 400 segments, and it only has 6kB of ram. You'd have to add both an external LCD controller and external memory before it would be capable of replacing the 35S or 17bii+ guts.
You'd gain the ability to do field firmware updates and maybe a better toolchain than with the 6502 core. Doesn't seem like enough in the pro column to make up for the cons.
The 12C+ switching to the '7L128 CPU makes a lot of sense to me--the chip can drive the existing display and has enough ram for the 12C platform, it's proven from the 20B project, so why not? Hackability and field updates are a nice side effect.
#46
A short calculation of the number of LCD segments in the 35s display results in more than 1000. So no chance to use the built in controller of the processor in the 20b exclusively.
#47
Will both the original 12c and the 12c 25th anniversary be updated?
#48
No algebraic on this guy. It is a 12c, not a 12cp.
#49
The new 12C (with two coin cells) should get arithmetic results identical to the original 12C (one coin cell or three button cells) for all calculations, as it is using exactly the same algorithms as the original. If you find any cases where it differs, please let Cyrille and me know about it.
This is different than any version of the 12c Platinum, which uses entirely different code than the 12C, and may get different results. I'm not sure about the early 12c Platinum, but the newer versions (with parentheses and undo) should generally have higher precision than the 12C.
#50
Quote:
The new 12C (with two coin cells) should get arithmetic results identical to the original 12C (one coin cell or three button cells) for all calculations, as it is using exactly the same algorithms as the original.
If you find any cases where it differs, please let Cyrille and me know about it.
Does this means that it's firmware is based on Nonpareil?
#51
Congratulations if that's true, Eric!
Do you have any (financial) agreement with HP?
#52
I suspect he can't say even if he hasn't got any contracts. Another thing is that the original interest rate calculations of the original calculator (which is now fatefully duplicated) is "better" than the more accurate Platinum version. ??? Because it is The Official Wall Street Calculator and it has to do the calculation exactly the same way - forever! This is surely gonna be the longest in-production model ever - even if it's now emulated on new hardware. If HP brings back the HP-15C+ redesigned with 32KB RAM and full alpha labels/matrix names from A..Z, I guess it could also be successful as a true pocket size scientific non-graphing calculator.
#53
Quote:
If HP brings back the HP-15C+ redesigned with 32KB RAM and full alpha labels/matrix names from A..Z, I guess it could also be successful as a true pocket size scientific non-graphing calculator.
IF. But you'll need a different LCD for this, and recent communication doesn't support the assumption of such a capable (or call it normal) LCD :-/
#54
HP bring back the HP-42...with SD-card for surveying
LCD should be graphing (18C/19BII, 28C/S)
#55
Quote:
If HP brings back the HP-15C+ redesigned with 32KB RAM and full alpha labels/matrix names from A..Z
Why look a gift horse in the mouth?
Addressing more memory would be great, but adding "full alpha" and/or other bells and whistles to the original ROM might be asking too much. Why ask the developers to tinker with something that is already tested and true.
Some of us cannot afford eb*y HP 15Cs, so holding a new 15c+ in my hand (vs. clicking on an emulator), running the same firmware that so many have used and trusted forever, would be nice for me, and hopefully countless others.
Thanks,
PG
#56
Pal,
Quote:
Why look a gift horse in the mouth?
Heh, I'd have not guessed to see a German idiom nearly literally translated in English ("Einem geschenkten Gaul schaut man nicht ins Maul") :)
For your other statement, I take the liberty to disagree. As I've said here earlier already, the 15C was a great machine in its time. Time didn't stop then, however, so we've seen further progress after the 15C, meaning models with advanced user interfaces. So, returning to displaying programs in keycodes would fall back behind the 32S. Returning to split complex objects and double stacks would do the same. It would be disappointing for the educated user, who experienced better things meanwhile. IMHO a relaunched 15C+ with a display of 1981 would confine the market to the community of vintage calc fans, while an LCD at least on the level of a 32S LCD will add some extra push to the C+ and gain new users.
Just my 20 Milli-Euros.
Ceterum censeo: ... (you know)
Walter
#57
Assuming that this is true and the 12C+ is running an unmodified ROM dump of the original 12C, that means that it's going to be back to 99 program steps/20 registers. Although that's probably fine for 99% of 12C users it seems like a step backwards from the 12CP versions -- and I won't be able to use all that extra speed to get 632 digits of pi :(
OTOH, I suppose when you go through all this effort to create such great algorithms it's worth keeping them.
Quote:
The HP 12c team concluded that they would design the calculations in the 12c to be so precise that the calculator could receive certification by the federal Bureau of Standards (now the National Institute of Standards and Technology). Hence, HP 12c’s results were legally accurate for the banking industry.
The algorithms used to perform calculations such as bond interest and partial payments on home mortgages were critical if the calculator was to be trusted by the financial world and meet the U.S. standards. HP consulted with experts from various countries to be certain that the calculator would work in markets using different methods of calculation all over the world. HP worked with William Kahan, UC Berkeley’s renowned professor of mathematics, electrical engineering and computer science, to develop and test the complex algorithms.
Edited: 15 Nov 2008, 1:48 p.m. after one or more responses were posted
#58
Remember, modifying the 12c to add more program steps and algebraic is what gave us the problems with the 12cp.
I think better to have a 12c that is > 60X faster is better than a 12cp with issues.
My 2 cents (or what is it worth with the bailouts these days?)
#59
Quote:
Does this means that it's firmware is based on Nonpareil?
From the Nonpareil news page: "Voyager calculator models have been removed in release 0.79 due to licensing issues. They will be made available in a separate package in the near future." (August 23, 2008).
Coincidence?
#60
Quote:
Heh, I'd have not guessed to see a German idiom nearly literally translated in English ("Einem geschenkten Gaul schaut man nicht ins Maul") :)
I'm guessing multiple languages might have taken that from the Latin original Equi donati dentes non inspiciuntur. Have a look here
>>>in the horse's mouth<<<
Edited: 15 Nov 2008, 2:07 p.m.
#61
Walter, I agree an improved 15c, like the 4-line LCD models you fathomed, and I modeled, would be incredible, powerful, and desired. However, all the talk about the "12c+" and a "15c+" makes me think HP might just use their new processor to emulate old ROMs. Since the 12c+ is presumably only getting a new PCB (but same display and chassis (w/more batteries)), but not new firmware (classic 12c only, please), why not roll a 15c+ with its own new PCB and famous 15c firmware (already written and waiting)?
Know what I mean?
Trust me, I would love a 4-line Voyager, but that may be dreaming..
Cheers,
PG
#62
Quote:
From the Nonpareil news page: "Voyager calculator models have been removed in release 0.79 due to licensing issues. They will be made available in a separate package in the near future." (August 23, 2008).
Coincidence?
I doubt it's a coincidence, well done Eric!
The original ASIC was no longer obtainable, so that either meant new software almost from scratch for a new platform, or an original ROM emulator already proven. Seems like a no-brainer decision to me.
Makes sense from HP's point of view for such a vital calculator as the 12C
The reasoning is not really the same for a scientific version (i.e. 15C), but if it's so easy, why not?
I'd be very surprised if Cryrille doesn't already have a new 15C prototype on his desk...
Dave.
#63
George,
Thanks for the link. I didn't know it's going back to Noli equi dentes inspicere donati! It's all Caesar's fault ;)
Edited: 15 Nov 2008, 4:26 p.m.
#64
Pal,
Quote:
I agree an improved 15c, like the 4-line LCD models you fathomed, and I modeled, would be incredible, powerful, and desired.
Agreed. Though I only remember my 3-line 15s in Voyager dimensions, and don't recall your models right now (my bad memory).
Quote:
why not roll a 15c+ with its own new PCB and famous 15c firmware (already written and waiting)?
Absolutely no problem -- but *zero* progress as well. This would be just an edition for us greybeards as mentioned already, nothing to gain new users. So I'd rate this as a missed opportunity, though I understand some reasons for doing it this way.
Ceterum censeo: HP, launch a 15s (take the chance to pimp your 15C -- don't try to tell us you've got no ideas for improvements after 27 years of development in the world of electronics).
Walter
Edited to add a call for action.
Edited: 16 Nov 2008, 5:20 a.m.
#65
Quote:
Assuming that this is true and the 12C+ is running an unmodified ROM dump of the original 12C, that means that it's going to be back to 99 program steps/20 registers. Although that's probably fine for 99% of 12C users it seems like a step backwards from the 12CP versions -- and I won't be able to use all that extra speed to get 632 digits of pi :(
OTOH, I suppose when you go through all this effort to create such great algorithms it's worth keeping them.
THAT is the difference between HP-12C(+) and "HP-15s". You just can't chamge the algorithms in the 12C, but 15C could become 15s, if not, then it's better to release HP-42 instead.
#66
The 400 segments the new chip can drive would allow for a 15C+ featuring an LCD almost like the one the 32sii had. Just 10 blocks of 5x7 pixels, corresponding to 10 digits as in the Voyagers before, instead of 12 as in the Pioneers. This would allow for everything a Voyager did show so far, plus some alpha display (e.g. mnemonics instead of key codes!) and up to 5 menu keys.
A poor-man's solution may be using Pioneer displays and dropping the last 2 blocks, provided the LCD would fit geometrically into the Voyager housing.
Just crossed my mind ...
Edit:
Forget the last paragraph: Recycling Pioneer displays needs the Voyager housing being 6mm higher. But a new versatile 400 segment LCD of this kind is worth thinking about, when we need a PCB redesign for the new chip anyway.
Edited: 17 Nov 2008, 5:03 p.m.
#67
Quote:
But, since the subject 11C was built in 1985, perhaps new voyagers utilize a different type of construction. I do not have a new “ 12C+” or even a late model 12C (i.e. with a single 2032 battery) to take apart to check. ... However, the keys may be on frames, like the 35s. If the 12C+ uses similar construction, perhaps disassembly and re-labelling may be viable. Of course all of the above is speculation, which Cyrille or one of our friends with a 12C+ are warmly invited to confirm or correct.
I do have a non-working "late model 12C" I took apart (s/n CNC5070...). I found still the good old 39 separate keys, placed individually in their frames as in 1981. No information about newer editions though.
#68
Was it held together with heat stakes? If so, how many? How did you hold it together upon re-assembly?
#69
Quote:
Was it held together with heat stakes? If so, how many?
41. Plus 6 screws.
Quote:
How did you hold it together upon re-assembly?
Not. As mentioned, it's a non working unit. I bought it for very few money just for curiosity to see what's inside. I'd not kill a living Voyager for this ;)
#70
OK, so if we keep the old display, we won't get menus nor alpha prompts nor mnemonics in program listings, what can still be done despite all these awkward limitations? I tried a really careful redesign of the 15C, to avoid - beware - frightening any conservatives, and eventually came to this:
I'm not sure about the use of blue shifted COS, one may place something like Re<>Im there instead. Please, however, find the conversion key as blue shifted CHS, to be combined with the shifted functions of keys 4 through 9. But don't tell them.
Remember: no menus, no mnemonics, no alpha. Just a big step into ... the past.
Ceterum censeo: HP, launch a 43s or 15s.
Walter
#71
Based on the 12C+ discussion -- that it's running the original 12C ROM image -- if there is a 15C+ on the horizon it's going to be an original 15C only a lot faster. The only additional cost to produce this given, the 12C+, would be printing the keys and the faceplate (and perhaps more money to Eric). I'll bet that one is on the way pretty soon.
#72
Quote:
Based on the 12C+ discussion -- that it's running the original 12C ROM image -- if there is a 15C+ on the horizon it's going to be an original 15C only a lot faster. The only additional cost to produce this given, the 12C+, would be printing the keys and the faceplate (and perhaps more money to Eric). I'll bet that one is on the way pretty soon.
Yep, betcha Cyrille already has one too.
I wonder if the market for original 15C and 11C's will plummet if/when such a calc comes out?
Dave.
#73
To complete the information:
BASE 0 = integer base 10
BASE 2 = BIN
BASE 6 = HEX
BASE 8 = OCT
BASE . = DECM
MODE 0 = ALG
MODE 1 = RPN
MODE 2 = proper fraction mode (HR or BASE . will return to DECM)
MODE 3 = improper fraction mode
MODE 4 = /c in 32sii (set maximum denominator)
MODE . = toggles decimal radix mark
Edited to add HR.
Edited: 20 Nov 2008, 2:22 a.m.
#74
Nice work as usual. But alas it has two of my pet peeves - a dedicated HYP key, and a shifted 1/X key.
Dave.
#75
Dave, thanks for your feedback. The simplest solution may be to swap these 2 function labels. The result will be:
Function keystrokes now and after swapping
1/x g 1/x 1/x
sinh HYP SIN g HYP SIN
arcosh INV HYP COS INV g HYP COS
I simply shrinked from requiring 4 keystrokes for 3 "plain" functions, but I understand your request. I may even change it after another night ;)
Walter
Edited: 19 Nov 2008, 6:21 a.m.
#76
Quote:
OK, so if we keep the old display, we won't get menus nor alpha prompts nor mnemonics in program listings, what can still be done despite all these awkward limitations? I tried a really careful redesign of the 15C, to avoid - beware - frightening any conservatives, and eventually came to this: ...
As a long-time HP-15C owner/user, I'll admit I find this new layout a little bit disorienting. The true purist would complain you're not allowed to move ANY keys, but that's unrealistic and limits the ability to sneak in extra features in a sensible manner.
What are the added white markings for? Parentheses are pretty obvious if you're going to include a non-RPN mode, and I'm guessing the upper-left/lower-right combination replaces the SST and BST keys for stepping through programs. How about the dashes which seem to be grouping keys?
Finally, I've had very little use for the hyperbolic functions and would much rather see (1/x) as a primary key.
#77
I would rather change the [ f ] key to [ALPHA] and use the left-hand side of each key to show a neon-green letter, except for [ENTER] [<=] and the shift keys. what about only [ g ]-shift then? Let's make it a ROTating shift: f,g,none,f,g,none,...[f,g] What about other "alpha" than the letters A..Z? You could put them under the first alpha A..Z using another color and naturally you press [ALPHA], then the [f,g] shift key then the appropiate key. This way we can really clutter up the keyboard! :-)
Edited: 19 Nov 2008, 9:42 a.m.
#78
Veli-Pekka,
please explain the use of [ALPHA] without an LCD capable of displaying them.
Kiitos,
Walter
#79
You use what you can... :-/
#80
Meant for writing secret messages...
SCNR;-)
#81
Not something I would endorse, but the TI-59 had it: some alpha capability without an alpha display, an external printer was needed to take advantage of it.
In a modern model, it may be of use when interfacing to a PC via USB or so... Just thinking...
#82
Alpha capabilities could be useful, if the display were a reincarnation of the segmented 41C variety. It should have no more than 400 single elements and fit easily the new processor.
I wouldn't want a programmable calculator with numeric code display.
#83
100% agree!
BTW, my car's radio+cd player has such 14-segment LCD, very similar to the HP 41C and I actually find it rather readable and nice (of course, it also calls fond 41C memories).
Luckily, it never showed "MALFUNCTION", "NONEXISTENT" or "MEMORY LOST" yet!
:-)
#84
Chris,
Quote:
What are the added white markings for? Parentheses are pretty obvious if you're going to include a non-RPN mode, and I'm guessing the upper-left/lower-right combination replaces the SST and BST keys for stepping through programs. How about the dashes which seem to be grouping keys?
Finally, I've had very little use for the hyperbolic functions and would much rather see (1/x) as a primary key.
You're right. The upper left quarter of the design looks this way now:
The white dashes there are between all keys which's primary function may be combined with INV.
The white marks in the upper right quarter are between all keys allowing mode conversions. I.e. > DEG, RAD, GRD, POL, REC, H:M:S, HR, REAL, CPX. You set e.g. polar mode by pressing f POL. Within this mode you convert the contents of x and y (representing the magnitude and the polar angle) to Cartesian components by pressing g > g REC.
And the upper-left and lower-right keys are for BST and SST, as you guessed, and also for scrolling e.g. large binary numbers, and for leaving a parenthesis in ALG mode. Parentheses are inserted in pairs always. They are for indirect addressing, too. For example, pressing STO + () 07 adds x to the memory register 07 is pointing to.
Edited the last paragraph and moved some keys to achieve even less difference to the 15C.
Edited: 20 Nov 2008, 6:40 p.m. after one or more responses were posted
#85
Quote:
I wouldn't want a programmable calculator with numeric code display.
I double that, I can't be bothered memorizing numeric codes anymore, that page should be closed at any expense. New calculator is expected to have a lot more memory either...
Cheers,
Reth
#86
I second your opinion. And such a segmented LCD would allow for at least 2 more digits/characters. Compare an alternative here, also within the limits of 400 elements.
#87
the 41C has 14-segments plus a (semi)colon eg 17 together for each character. some annuciators like flags 0..4 ALPHA USER ... with 400 elements thats 2*11 characters. If we leave out extra dot for semi(colon) and satisfy ourselves with just comma/point eg, 16 segments => 2*12 characters and some extra annuciators! - I want another CPU and a real dot matrix LCD...
#88
Displays are the cornerstones.
This thread has shown this again. HP, please equip your calculators accordingly -- at least those you want to sell for good money. There are enough cheap calcs in this world, please proof you can make a difference. I think every member of this forum is at least willing to support this process.
#89
Do I recall correctly that Eric had a patch for the 15C firmware so that it could use more memory? I think there was some problem with displaying the step numbers, but it worked in nonpareil. So more mem might no be a problem.
Possibly Related Threads...
Thread Author Replies Views Last Post
HP12c Present Value of $1.. Inaccurate??? Edward Dixon 12 864 11-12-2013, 11:32 AM
Last Post: Edward Dixon
HP12C Platinum PC software activation fails Russell Clinton 0 263 07-02-2013, 02:32 PM
Last Post: Russell Clinton
HP12C Limited Edition 30 anniversary keyboard Revan Ng 0 208 01-11-2013, 12:49 AM
Last Post: Revan Ng
HP12C 'complete' collection Keith Midson 9 985 08-07-2012, 07:51 PM
Last Post: Keith Midson
HP12c Anniversary Seft Test Nick Mihiylov 2 301 01-04-2012, 07:23 AM
Last Post: Koralatov
The HP12c Anniversary edition has finally arrived to Europe Jose Gonzalez Divasson 1 216 11-12-2011, 08:16 AM
Last Post: hpnut
hp12C capability Todd Israels 8 550 10-14-2011, 12:20 AM
Last Post: Todd Israels
HP12c 30th AE keyboard Paulo MO 4 389 10-01-2011, 03:26 AM
Last Post: Paulo MO
HP12C Article in the Financial Times Charles 4 332 09-24-2011, 06:54 PM
Last Post: Mark Harman
HP12C 30th Anniversary Keith Midson 2 250 09-15-2011, 07:33 PM
Last Post: Keith Midson
Forum Jump:
|
{
"url": "https://archived.hpcalc.org/museumforum/showthread.php?mode=linear&tid=143521&pid=143962",
"source_domain": "archived.hpcalc.org",
"snapshot_id": "crawl=CC-MAIN-2020-16",
"warc_metadata": {
"Content-Length": "247126",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CL3R6G4AMTEHRRIPCKRXDOPSX4IQGSW2",
"WARC-Concurrent-To": "<urn:uuid:4e867bac-195e-41c6-900b-0df7b198986e>",
"WARC-Date": "2020-04-08T19:00:48Z",
"WARC-IP-Address": "64.62.190.52",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:E4ZH7WX3AYM77IOFKDROHFSUSUKP4DQF",
"WARC-Record-ID": "<urn:uuid:61a35538-b92e-423f-babe-944454656423>",
"WARC-Target-URI": "https://archived.hpcalc.org/museumforum/showthread.php?mode=linear&tid=143521&pid=143962",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0877a4d1-bbdb-4020-a7d0-cf4daab0c3a9>"
},
"warc_info": "isPartOf: CC-MAIN-2020-16\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-155.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
1,
2,
9,
12,
13,
275,
276,
279,
280,
287,
549,
550,
663,
664,
740,
741,
747,
748,
751,
752,
803,
804,
807,
808,
815,
866,
867,
897,
898,
904,
905,
908,
909,
975,
976,
979,
980,
990,
991,
994,
995,
1292,
1293,
1472,
1473,
1474,
1520,
1521,
1522,
1523,
1526,
1527,
1530,
1531,
1538,
1800,
1801,
1938,
1941,
1942,
1948,
1949,
1956,
2093,
2094,
2232,
2233,
2496,
2497,
2514,
2515,
2519,
2520,
2527,
2790,
2791,
2808,
2809,
2810,
2921,
2922,
2968,
2969,
2973,
2974,
3013,
3014,
3043,
3044,
3115,
3116,
3120,
3121,
3125,
3126,
3197,
3198,
3285,
3286,
3305,
3306,
3310,
3311,
3426,
3427,
3431,
3432,
4425,
4426,
5805,
5806,
5810,
5811,
5823,
5824,
6492,
6493,
6540,
6541,
6566,
6573,
6574,
6578,
6579,
6669,
6670,
6674,
6675,
6685,
6686,
7104,
7105,
7120,
7121,
7125,
7126,
7386,
7387,
7852,
7853,
7920,
7921,
7928,
7929,
7965,
7966,
7997,
7998,
8002,
8003,
8010,
8272,
8273,
8307,
8308,
8359,
8360,
8364,
8365,
8391,
8392,
8442,
8443,
8480,
8481,
8547,
8548,
8552,
8553,
8559,
8560,
8687,
8688,
8692,
8693,
8700,
8726,
8727,
8734,
8735,
8739,
8740,
8803,
8804,
8858,
8859,
8955,
8956,
9053,
9054,
9058,
9059,
9066,
9179,
9180,
9256,
9257,
9263,
9264,
9265,
9306,
9307,
9343,
9344,
9348,
9349,
9390,
9391,
9569,
9570,
9739,
9740,
9986,
9987,
10262,
10263,
10385,
10386,
10441,
10442,
10448,
10449,
10453,
10454,
10511,
10679,
10680,
10684,
10685,
10750,
10751,
10758,
11059,
11060,
11064,
11065,
11114,
11115,
11277,
11278,
11386,
11387,
11393,
11394,
11398,
11399,
11653,
11654,
11927,
11928,
11932,
11933,
11976,
11977,
11981,
11982,
12039,
12046,
12081,
12114,
12150,
12157,
12165,
12169,
12170,
12195,
12196,
12343,
12344,
12403,
12404,
12411,
12412,
12416,
12417,
12490,
12491,
12495,
12496,
13040,
13041,
13160,
13206,
13424,
13425,
13432,
13433,
13437,
13438,
13844,
13845,
13846,
13848,
13849,
13853,
13854,
13862,
13863,
13928,
13929,
13973,
13974,
13976,
13977,
13981,
13982,
13988,
13989,
14121,
14122,
14126,
14127,
14134,
14140,
14141,
14273,
14274,
14275,
14420,
14421,
14569,
14570,
14574,
14575,
14796,
14797,
14799,
14800,
14804,
14805,
14855,
14914,
14915,
14919,
14920,
15085,
15086,
15535,
15536,
15552,
15553,
15560,
15614,
15615,
16547,
16548,
16846,
16847,
16907,
16908,
16938,
16939,
16946,
16947,
16978,
16979,
16983,
16984,
17004,
17005,
17095,
17096,
17100,
17101,
17108,
17273,
17274,
17320,
17327,
17426,
17427,
17466,
17473,
17489,
17496,
17503,
17557,
17558,
17559,
17592,
17599,
17749,
17750,
17784,
17785,
17789,
17790,
17796,
17797,
17804,
17923,
17924,
18089,
18090,
18136,
18137,
18138,
18252,
18253,
18254,
18255,
18272,
18276,
18277,
18284,
18285,
18331,
18332,
18333,
18576,
18577,
18751,
18752,
18998,
18999,
19003,
19004,
19185,
19186,
19190,
19191,
19259,
19260,
19264,
19265,
19316,
19317,
19321,
19322,
19617,
19618,
19901,
19902,
19906,
19907,
19914,
20128,
20209,
20210,
20268,
20272,
20273,
20311,
20312,
20359,
20360,
20364,
20365,
21023,
21024,
21028,
21029,
21036,
21231,
21232,
21380,
21384,
21385,
21438,
21480,
21481,
21485,
21486,
21493,
21494,
21594,
21595,
21596,
21632,
21633,
21855,
21856,
22083,
22084,
22085,
22093,
22094,
22097,
22098,
22102,
22103,
22108,
22109,
22116,
22152,
22153,
22296,
22297,
23011,
23012,
23036,
23037,
23068,
23069,
23076,
23077,
23081,
23082,
23432,
23433,
23542,
23543,
23550,
23857,
23858,
24397,
24398,
24399,
24470,
24471,
24475,
24476,
24588,
24589,
24674,
24675,
24738,
24739,
24743,
24744,
24751,
24752,
24810,
24811,
24812,
25018,
25019,
25032,
25033,
25037,
25038,
25045,
25188,
25189,
25321,
25322,
25349,
25350,
25351,
25382,
25383,
25387,
25388,
25895,
25896,
25914,
25915,
25983,
25984,
25992,
25993,
25996,
25997,
26001,
26002,
26009,
26010,
26011,
26217,
26218,
26231,
26232,
26233,
26277,
26278,
26480,
26555,
26556,
26660,
26661,
26751,
26752,
26758,
26759,
26763,
26764,
26772,
26773,
26889,
26890,
26921,
26922,
26926,
26927,
26932,
26933,
26940,
27065,
27066,
27190,
27197,
27293,
27294,
27543,
27544,
27732,
27733,
27740,
27741,
27774,
27775,
27776,
27807,
27808,
27812,
27813,
27820,
28170,
28171,
28280,
28281,
28282,
28463,
28467,
28468,
28846,
28847,
28998,
28999,
29024,
29025,
29031,
29256,
29257,
29258,
29289,
29290,
29294,
29295,
29302,
29800,
29801,
30010,
30014,
30015,
30118,
30119,
30123,
30124,
30131,
30187,
30188,
30207,
30214,
30261,
30262,
30420,
30424,
30425,
30720,
30721,
30722,
30967,
30968,
31047,
31048,
31089,
31090,
31097,
31098,
31102,
31103,
31451,
31452,
31456,
31457,
31464,
31812,
31813,
31854,
31855,
31949,
31950,
31956,
31957,
31961,
31962,
31991,
31992,
32018,
32031,
32044,
32057,
32071,
32072,
32085,
32098,
32163,
32195,
32242,
32278,
32279,
32297,
32298,
32299,
32330,
32331,
32335,
32336,
32439,
32440,
32446,
32447,
32451,
32452,
32566,
32567,
32616,
32617,
32631,
32654,
32687,
32688,
32834,
32835,
32842,
32843,
32874,
32875,
32879,
32880,
32887,
33186,
33187,
33445,
33446,
33729,
33730,
33843,
33847,
33848,
34349,
34350,
34381,
34382,
34386,
34387,
34399,
34400,
34477,
34478,
34486,
34487,
34494,
34495,
34499,
34500,
34528,
34529,
34533,
34534,
34571,
34572,
34580,
34581,
34585,
34586,
34743,
34744,
34839,
34840,
34844,
34845,
35029,
35030,
35099,
35100,
35104,
35105,
35117,
35118,
35294,
35295,
35371,
35372,
35376,
35377,
35381,
35382,
35389,
35390,
35397,
35680,
35793,
35794,
35865,
35866,
35961,
35962,
36299,
36300,
36634,
36635,
36725,
36726,
36727,
36798,
36799,
36803,
36804,
36811,
36880,
36881,
37056,
37057,
37065,
37070,
37074,
37075,
37243,
37244,
37248,
37249,
37615,
37616,
37620,
37621,
37652,
37653,
37948,
37949,
37953,
37954,
38181,
38182,
38183,
38184,
38212,
38250,
38335,
38359,
38448,
38475,
38559,
38579,
38649,
38673,
38744,
38765,
38877,
38894,
38953,
38977,
39038,
39058,
39132,
39155,
39220,
39244,
39245
],
"line_end_idx": [
1,
2,
9,
12,
13,
275,
276,
279,
280,
287,
549,
550,
663,
664,
740,
741,
747,
748,
751,
752,
803,
804,
807,
808,
815,
866,
867,
897,
898,
904,
905,
908,
909,
975,
976,
979,
980,
990,
991,
994,
995,
1292,
1293,
1472,
1473,
1474,
1520,
1521,
1522,
1523,
1526,
1527,
1530,
1531,
1538,
1800,
1801,
1938,
1941,
1942,
1948,
1949,
1956,
2093,
2094,
2232,
2233,
2496,
2497,
2514,
2515,
2519,
2520,
2527,
2790,
2791,
2808,
2809,
2810,
2921,
2922,
2968,
2969,
2973,
2974,
3013,
3014,
3043,
3044,
3115,
3116,
3120,
3121,
3125,
3126,
3197,
3198,
3285,
3286,
3305,
3306,
3310,
3311,
3426,
3427,
3431,
3432,
4425,
4426,
5805,
5806,
5810,
5811,
5823,
5824,
6492,
6493,
6540,
6541,
6566,
6573,
6574,
6578,
6579,
6669,
6670,
6674,
6675,
6685,
6686,
7104,
7105,
7120,
7121,
7125,
7126,
7386,
7387,
7852,
7853,
7920,
7921,
7928,
7929,
7965,
7966,
7997,
7998,
8002,
8003,
8010,
8272,
8273,
8307,
8308,
8359,
8360,
8364,
8365,
8391,
8392,
8442,
8443,
8480,
8481,
8547,
8548,
8552,
8553,
8559,
8560,
8687,
8688,
8692,
8693,
8700,
8726,
8727,
8734,
8735,
8739,
8740,
8803,
8804,
8858,
8859,
8955,
8956,
9053,
9054,
9058,
9059,
9066,
9179,
9180,
9256,
9257,
9263,
9264,
9265,
9306,
9307,
9343,
9344,
9348,
9349,
9390,
9391,
9569,
9570,
9739,
9740,
9986,
9987,
10262,
10263,
10385,
10386,
10441,
10442,
10448,
10449,
10453,
10454,
10511,
10679,
10680,
10684,
10685,
10750,
10751,
10758,
11059,
11060,
11064,
11065,
11114,
11115,
11277,
11278,
11386,
11387,
11393,
11394,
11398,
11399,
11653,
11654,
11927,
11928,
11932,
11933,
11976,
11977,
11981,
11982,
12039,
12046,
12081,
12114,
12150,
12157,
12165,
12169,
12170,
12195,
12196,
12343,
12344,
12403,
12404,
12411,
12412,
12416,
12417,
12490,
12491,
12495,
12496,
13040,
13041,
13160,
13206,
13424,
13425,
13432,
13433,
13437,
13438,
13844,
13845,
13846,
13848,
13849,
13853,
13854,
13862,
13863,
13928,
13929,
13973,
13974,
13976,
13977,
13981,
13982,
13988,
13989,
14121,
14122,
14126,
14127,
14134,
14140,
14141,
14273,
14274,
14275,
14420,
14421,
14569,
14570,
14574,
14575,
14796,
14797,
14799,
14800,
14804,
14805,
14855,
14914,
14915,
14919,
14920,
15085,
15086,
15535,
15536,
15552,
15553,
15560,
15614,
15615,
16547,
16548,
16846,
16847,
16907,
16908,
16938,
16939,
16946,
16947,
16978,
16979,
16983,
16984,
17004,
17005,
17095,
17096,
17100,
17101,
17108,
17273,
17274,
17320,
17327,
17426,
17427,
17466,
17473,
17489,
17496,
17503,
17557,
17558,
17559,
17592,
17599,
17749,
17750,
17784,
17785,
17789,
17790,
17796,
17797,
17804,
17923,
17924,
18089,
18090,
18136,
18137,
18138,
18252,
18253,
18254,
18255,
18272,
18276,
18277,
18284,
18285,
18331,
18332,
18333,
18576,
18577,
18751,
18752,
18998,
18999,
19003,
19004,
19185,
19186,
19190,
19191,
19259,
19260,
19264,
19265,
19316,
19317,
19321,
19322,
19617,
19618,
19901,
19902,
19906,
19907,
19914,
20128,
20209,
20210,
20268,
20272,
20273,
20311,
20312,
20359,
20360,
20364,
20365,
21023,
21024,
21028,
21029,
21036,
21231,
21232,
21380,
21384,
21385,
21438,
21480,
21481,
21485,
21486,
21493,
21494,
21594,
21595,
21596,
21632,
21633,
21855,
21856,
22083,
22084,
22085,
22093,
22094,
22097,
22098,
22102,
22103,
22108,
22109,
22116,
22152,
22153,
22296,
22297,
23011,
23012,
23036,
23037,
23068,
23069,
23076,
23077,
23081,
23082,
23432,
23433,
23542,
23543,
23550,
23857,
23858,
24397,
24398,
24399,
24470,
24471,
24475,
24476,
24588,
24589,
24674,
24675,
24738,
24739,
24743,
24744,
24751,
24752,
24810,
24811,
24812,
25018,
25019,
25032,
25033,
25037,
25038,
25045,
25188,
25189,
25321,
25322,
25349,
25350,
25351,
25382,
25383,
25387,
25388,
25895,
25896,
25914,
25915,
25983,
25984,
25992,
25993,
25996,
25997,
26001,
26002,
26009,
26010,
26011,
26217,
26218,
26231,
26232,
26233,
26277,
26278,
26480,
26555,
26556,
26660,
26661,
26751,
26752,
26758,
26759,
26763,
26764,
26772,
26773,
26889,
26890,
26921,
26922,
26926,
26927,
26932,
26933,
26940,
27065,
27066,
27190,
27197,
27293,
27294,
27543,
27544,
27732,
27733,
27740,
27741,
27774,
27775,
27776,
27807,
27808,
27812,
27813,
27820,
28170,
28171,
28280,
28281,
28282,
28463,
28467,
28468,
28846,
28847,
28998,
28999,
29024,
29025,
29031,
29256,
29257,
29258,
29289,
29290,
29294,
29295,
29302,
29800,
29801,
30010,
30014,
30015,
30118,
30119,
30123,
30124,
30131,
30187,
30188,
30207,
30214,
30261,
30262,
30420,
30424,
30425,
30720,
30721,
30722,
30967,
30968,
31047,
31048,
31089,
31090,
31097,
31098,
31102,
31103,
31451,
31452,
31456,
31457,
31464,
31812,
31813,
31854,
31855,
31949,
31950,
31956,
31957,
31961,
31962,
31991,
31992,
32018,
32031,
32044,
32057,
32071,
32072,
32085,
32098,
32163,
32195,
32242,
32278,
32279,
32297,
32298,
32299,
32330,
32331,
32335,
32336,
32439,
32440,
32446,
32447,
32451,
32452,
32566,
32567,
32616,
32617,
32631,
32654,
32687,
32688,
32834,
32835,
32842,
32843,
32874,
32875,
32879,
32880,
32887,
33186,
33187,
33445,
33446,
33729,
33730,
33843,
33847,
33848,
34349,
34350,
34381,
34382,
34386,
34387,
34399,
34400,
34477,
34478,
34486,
34487,
34494,
34495,
34499,
34500,
34528,
34529,
34533,
34534,
34571,
34572,
34580,
34581,
34585,
34586,
34743,
34744,
34839,
34840,
34844,
34845,
35029,
35030,
35099,
35100,
35104,
35105,
35117,
35118,
35294,
35295,
35371,
35372,
35376,
35377,
35381,
35382,
35389,
35390,
35397,
35680,
35793,
35794,
35865,
35866,
35961,
35962,
36299,
36300,
36634,
36635,
36725,
36726,
36727,
36798,
36799,
36803,
36804,
36811,
36880,
36881,
37056,
37057,
37065,
37070,
37074,
37075,
37243,
37244,
37248,
37249,
37615,
37616,
37620,
37621,
37652,
37653,
37948,
37949,
37953,
37954,
38181,
38182,
38183,
38184,
38212,
38250,
38335,
38359,
38448,
38475,
38559,
38579,
38649,
38673,
38744,
38765,
38877,
38894,
38953,
38977,
39038,
39058,
39132,
39155,
39220,
39244,
39245,
39256
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 39256,
"ccnet_original_nlines": 850,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4078601598739624,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06135039031505585,
"rps_doc_frac_lines_end_with_ellipsis": 0.02115158922970295,
"rps_doc_frac_no_alph_words": 0.21592597663402557,
"rps_doc_frac_unique_words": 0.24712392687797546,
"rps_doc_mean_word_length": 4.383136749267578,
"rps_doc_num_sentences": 478,
"rps_doc_symbol_to_word_ratio": 0.014395060017704964,
"rps_doc_unigram_entropy": 6.285181045532227,
"rps_doc_word_count": 6867,
"rps_doc_frac_chars_dupe_10grams": 0.2712714672088623,
"rps_doc_frac_chars_dupe_5grams": 0.2936974763870239,
"rps_doc_frac_chars_dupe_6grams": 0.2868533730506897,
"rps_doc_frac_chars_dupe_7grams": 0.28519219160079956,
"rps_doc_frac_chars_dupe_8grams": 0.28004252910614014,
"rps_doc_frac_chars_dupe_9grams": 0.27346423268318176,
"rps_doc_frac_chars_top_2gram": 0.006146380212157965,
"rps_doc_frac_chars_top_3gram": 0.002691119909286499,
"rps_doc_frac_chars_top_4gram": 0.0019934200681746006,
"rps_doc_books_importance": -4063.656494140625,
"rps_doc_books_importance_length_correction": -4063.656494140625,
"rps_doc_openwebtext_importance": -2365.704345703125,
"rps_doc_openwebtext_importance_length_correction": -2365.704345703125,
"rps_doc_wikipedia_importance": -1774.7178955078125,
"rps_doc_wikipedia_importance_length_correction": -1774.7178955078125
},
"fasttext": {
"dclm": 0.055306609719991684,
"english": 0.9457084536552429,
"fineweb_edu_approx": 1.2894285917282104,
"eai_general_math": 0.6459044218063354,
"eai_open_web_math": 0.3120107650756836,
"eai_web_code": 0.0797683596611023
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.15",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "5",
"label": "Evaluate"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
2,930,707,145,602,041,300 |
Bambang pramusintha
Archive for the ‘Meta Geo Tag’ Category
How To Add Geo Meta tag
In Joomla CMS, Meta Element, Meta Geo Tag on July 11, 2012 at 9:26 am
Historically, meta tag for the language and the country has been less reliable than conclude the language or country directly. For example, many webmasters also just copy / paste from the template of a friend without checking the meta tag values.
Unreliability of meta tags is why Google tends to not use them or give them less weight.
So webmasters here three points for considering to put the geo meta tag to your website/blog :
[1] Bing currently using geo-meta tag
[2] Google ignores meta tags geo
[3] Be careful when you copy or use an existing template template
Cortesy forum discussion at Bing Community.
” I suggest adding the following meta tag to your home page header and verify that there are no tags pointing to “en-gb”–especially if you are using the Joomla CMS “, Brett said specifically, with Joomla.
Brett Young from the Bing webmaster support team suggested to the webmaster to change the meta tag to:
<meta http-equiv=”content-language” content=”en-us”>
“We generally ignore geo-meta tags like that because we’ve found that they are generally incorrect [copy & pasted from a template, etc]”, Brett Young Said.
A Google Webmaster Help thread once again confirms that Google ignores the geo-meta tags. Those tags somewhat look like this and use to serve the purpose of telling search engines where the site is based:
<meta name=”geo.placename” content=”United States” />
<meta name=”geo.position” content=”x;x” />
<meta name=”geo.region” content=”usa” />
<meta name=”ICBM” content=”x,x” />
It seems like this is a common issue webmasters run into when using Joomla.
%d bloggers like this:
|
{
"url": "https://12oy.wordpress.com/category/meta-element/meta-geo-tag/",
"source_domain": "12oy.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2017-30",
"warc_metadata": {
"Content-Length": "100411",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PMUQTEBNPPH66EE2KD2UL3WYNYVURDHZ",
"WARC-Concurrent-To": "<urn:uuid:1f0290aa-d072-4080-80ab-b414ba2580d8>",
"WARC-Date": "2017-07-21T22:47:41Z",
"WARC-IP-Address": "192.0.78.12",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:PHJ4TSARLDFVOBD7ABFLEU6CZ64FKPQV",
"WARC-Record-ID": "<urn:uuid:dc5b4c18-0d4b-4d4f-b953-55e4df15cba1>",
"WARC-Target-URI": "https://12oy.wordpress.com/category/meta-element/meta-geo-tag/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8664b170-291d-41ba-8b2e-b9094335d056>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-226-229.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-30\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for July 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
20,
21,
61,
62,
86,
87,
157,
158,
405,
406,
495,
496,
591,
592,
630,
663,
729,
730,
774,
775,
980,
981,
1084,
1085,
1138,
1139,
1295,
1296,
1501,
1502,
1556,
1599,
1640,
1675,
1676,
1752,
1753
],
"line_end_idx": [
20,
21,
61,
62,
86,
87,
157,
158,
405,
406,
495,
496,
591,
592,
630,
663,
729,
730,
774,
775,
980,
981,
1084,
1085,
1138,
1139,
1295,
1296,
1501,
1502,
1556,
1599,
1640,
1675,
1676,
1752,
1753,
1775
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1775,
"ccnet_original_nlines": 37,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3194805085659027,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012987010180950165,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22857142984867096,
"rps_doc_frac_unique_words": 0.5785714387893677,
"rps_doc_mean_word_length": 5.010714054107666,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.751351833343506,
"rps_doc_word_count": 280,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.029935849830508232,
"rps_doc_frac_chars_top_3gram": 0.0192444808781147,
"rps_doc_frac_chars_top_4gram": 0.018531719222664833,
"rps_doc_books_importance": -164.18702697753906,
"rps_doc_books_importance_length_correction": -157.1814422607422,
"rps_doc_openwebtext_importance": -91.5096206665039,
"rps_doc_openwebtext_importance_length_correction": -91.5096206665039,
"rps_doc_wikipedia_importance": -73.05086517333984,
"rps_doc_wikipedia_importance_length_correction": -70.92082214355469
},
"fasttext": {
"dclm": 0.029297949746251106,
"english": 0.7820330262184143,
"fineweb_edu_approx": 2.003481149673462,
"eai_general_math": 0.025117279961705208,
"eai_open_web_math": 0.04000568017363548,
"eai_web_code": 0.08455265313386917
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
222,026,906,046,458,340 |
Recommend:
To the knowledge base
Setting up an IPSec VPN between two FRITZ!Box networks
IPSec allows you to connect two FRITZ!Box networks at different locations over the internet via a secure, encrypted VPN connection (LAN-LAN linkup). This allows you to access all of the devices in the remote network and use all of the IP-based services such as email servers, data banks, and file servers at both locations.
You can find an overview of additional VPN connection options in our guide VPN with FRITZ!.
Example values used in this guide
In this guide we show you how to connect "FRITZ!Box A" in a branch with "FRITZ!Box B" in the headquarters. When setting up the connection, replace the values used in this guide with your actual values.
Requirements / Restrictions
• FRITZ!Box B (headquarters) must either obtain an IPv6 address or a public IPv4 address from the internet service provider. FRITZ!Box A (branch) must obtain an IP address with the same protocol version (IPv4 or IPv6) from the internet service provider.
• FRITZ!OS 7.50 or later is installed on both of the FRITZ!Boxes.
Note:All instructions on configuration and settings given in this guide refer to the latest FRITZ!OS for the FRITZ!Box.
1 Preparations
Configuring MyFRITZ!
Register the FRITZ!Boxes with MyFRITZ!Net so that they can always be reached on the internet at fixed MyFRITZ! addresses:
1. Create a MyFRITZ! account and set it up in both of the FRITZ!Boxes.
Note:You can either configure the same or different MyFRITZ! accounts in both of the FRITZ!Boxes. Even if both FRITZ!Boxes use the same MyFRITZ! account, each FRITZ!Box has its own unique MyFRITZ! address.
Adapting the IP Networks
VPN communication is not possible if both FRITZ!Boxes use the same IP network. Since all FRITZ!Boxes use the IP network 192.168.178.0 in the factory settings, configure IP addresses from different IP networks in the FRITZ!Boxes:
Example:
In this guide, FRITZ!Box A (branch) has the IP address 192.168.20.1 (subnet mask 255.255.255.0) and FRITZ!Box B (headquarters) the IP address 192.168.10.1 (subnet mask 255.255.255.0).
Changing the FRITZ!Box's IP network
1. Click "Home Network" in the FRITZ!Box user interface.
2. Click on "Network" in the "Home Network" menu.
3. Click on the "Network Settings" tab.
4. Click "Additional Settings" in the section "LAN Settings" to display all of the settings.
5. Click the "IPv4 Settings" button.
6. Enter the desired IP address and subnet mask.
7. Click "Apply" to save the settings and on the FRITZ!Box, confirm that the procedure may be executed, if you are asked to do so.
2 Configuring FRITZ!Box A (branch)
1. Click "Internet" in the user interface of FRITZ!Box A (branch).
2. Click "Permit Access" in the "Internet" menu.
3. Click the "VPN (IPSec)" tab.
4. Click the "Add VPN Connection" button.
5. Click "Connect your home network with another FRITZ!Box network (LAN-LAN linkup)" and then "Next".
6. In the field "VPN password (pre-shared key)", enter the password required to establish the VPN connection (secret1234). Use numerals and letters, and combine capitals and lower-case letters.
Configuring an IPSec connection in FRITZ!Box A (branch)
7. Enter a unique name for the connection (FRITZ!Box headquarters) in the field "Name of the VPN connection".
8. Enter the MyFRITZ! address of FRITZ!Box B (kw23qbmnj31x5aw75.myfritz.net) in the field "Web address of the remote site".
9. Enter the IP network of FRITZ!Box B (192.168.10.0) in the "Remote network" field.
10. In the "Subnet mask" field, enter the subnet mask that corresponds to FRITZ!Box B's IP network (255.255.255.0).
11. If you want to maintain the VPN connection all the time and the FRITZ!Box has a public IPv4 address, enable the option "Hold VPN connection permanently".
12. If access to SMB shared files in the remote network should be allowed, enable the option "Allow NetBIOS over this connection".
13. Click "Advanced Settings for Network Traffic".
14. If you do not only want to use the VPN connection to access the remote network, but also want all web requests to be sent to FRITZ!Box B (headquarters), enable the option "Send all network traffic via the VPN connection".
15. If only certain devices should be allowed to access the remote network, enable the option "Only certain devices use the VPN connection" and select the corresponding devices.
16. Click "Apply" to save the settings and on the FRITZ!Box, confirm that the procedure may be executed, if you are asked to do so. The internet connection will be cleared briefly and then re-established right away.
3 Configuring FRITZ!Box B (headquarters)
1. Click "Internet" in the user interface of FRITZ!Box B (headquarters).
2. Click "Permit Access" in the "Internet" menu.
3. Click the "VPN (IPSec)" tab.
4. Click the "Add VPN Connection" button.
5. Click "Connect your home network with another FRITZ!Box network (LAN-LAN linkup)" and then "Next".
6. In the field "VPN password (pre-shared key)", enter the password required to establish the VPN connection (secret1234).
Configuring an IPSec connection in FRITZ!Box B (headquarters)
7. If the field "Name of the VPN connection" is displayed, enter a unique name (FRITZ!Box branch) for the connection.
8. Enter the MyFRITZ! address of FRITZ!Box A (pi80ewgfi72d2os42.myfritz.net) in the field "Web address of the remote site".
9. Enter the IP network of FRITZ!Box A (192.168.20.0) in the "Remote network" field.
10. In the "Subnet mask" field, enter the subnet mask that corresponds to FRITZ!Box A's IP network (255.255.255.0).
11. If you want to maintain the VPN connection all the time, enable the option "Hold VPN connection permanently".
12. If access to SMB shared files in the remote network should be allowed, enable the option "Allow NetBIOS over this connection".
13. Click "Apply" to save the settings and on the FRITZ!Box, confirm that the procedure may be executed, if you are asked to do so. The internet connection will be cleared briefly and then re-established right away.
4 Establishing a VPN connection
If you enabled the option "Hold VPN connection permanently" in the FRITZ!Boxes, the VPN connection will be maintained at all times.
If the option "Hold VPN connection permanently" is not enabled, the VPN connection is automatically established when the remote network is accessed and it is cleared again if it has been inactive for one hour.
Note:Active VPN connections are displayed in the FRITZ!Box user interface under "Overview" in the section "Connections".
|
{
"url": "https://en.avm.de/service/knowledge-base/dok/FRITZ-Box-5530/5_Setting-up-an-IPSec-VPN-between-two-FRITZ-Box-networks/",
"source_domain": "en.avm.de",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "81804",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CE3NM2CHSXQE7RE3TT3P3MZ5U5L73RRQ",
"WARC-Concurrent-To": "<urn:uuid:0372091a-2eaa-45da-a3b6-f431097c86a9>",
"WARC-Date": "2024-09-12T19:43:24Z",
"WARC-IP-Address": "212.42.244.122",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:UY54ON2UPR6S5FW5BBDVJJUCRO4ZNNOQ",
"WARC-Record-ID": "<urn:uuid:d178e138-c320-4d9c-bf90-a19e751920ee>",
"WARC-Target-URI": "https://en.avm.de/service/knowledge-base/dok/FRITZ-Box-5530/5_Setting-up-an-IPSec-VPN-between-two-FRITZ-Box-networks/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e3cf4cec-1faf-46ba-9173-d7c071f2a929>"
},
"warc_info": "isPartOf: CC-MAIN-2024-38\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-49\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
11,
33,
34,
89,
90,
414,
415,
507,
508,
542,
543,
745,
746,
774,
775,
1031,
1099,
1100,
1220,
1221,
1236,
1237,
1258,
1259,
1381,
1382,
1455,
1456,
1666,
1667,
1692,
1693,
1922,
1923,
1932,
2116,
2117,
2153,
2212,
2264,
2306,
2401,
2440,
2491,
2624,
2625,
2660,
2661,
2730,
2781,
2815,
2859,
2963,
3159,
3219,
3331,
3457,
3544,
3662,
3822,
3955,
4008,
4236,
4416,
4634,
4635,
4676,
4677,
4752,
4803,
4837,
4881,
4985,
5110,
5176,
5296,
5422,
5509,
5627,
5743,
5876,
6094,
6095,
6127,
6128,
6260,
6261,
6471,
6472
],
"line_end_idx": [
11,
33,
34,
89,
90,
414,
415,
507,
508,
542,
543,
745,
746,
774,
775,
1031,
1099,
1100,
1220,
1221,
1236,
1237,
1258,
1259,
1381,
1382,
1455,
1456,
1666,
1667,
1692,
1693,
1922,
1923,
1932,
2116,
2117,
2153,
2212,
2264,
2306,
2401,
2440,
2491,
2624,
2625,
2660,
2661,
2730,
2781,
2815,
2859,
2963,
3159,
3219,
3331,
3457,
3544,
3662,
3822,
3955,
4008,
4236,
4416,
4634,
4635,
4676,
4677,
4752,
4803,
4837,
4881,
4985,
5110,
5176,
5296,
5422,
5509,
5627,
5743,
5876,
6094,
6095,
6127,
6128,
6260,
6261,
6471,
6472,
6592
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6592,
"ccnet_original_nlines": 89,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28129205107688904,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08008074760437012,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2927321791648865,
"rps_doc_frac_unique_words": 0.24542829394340515,
"rps_doc_mean_word_length": 4.864292621612549,
"rps_doc_num_sentences": 179,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.803366184234619,
"rps_doc_word_count": 1039,
"rps_doc_frac_chars_dupe_10grams": 0.3337950110435486,
"rps_doc_frac_chars_dupe_5grams": 0.4655718207359314,
"rps_doc_frac_chars_dupe_6grams": 0.4172932207584381,
"rps_doc_frac_chars_dupe_7grams": 0.3773248791694641,
"rps_doc_frac_chars_dupe_8grams": 0.36743173003196716,
"rps_doc_frac_chars_dupe_9grams": 0.35041549801826477,
"rps_doc_frac_chars_top_2gram": 0.024732880294322968,
"rps_doc_frac_chars_top_3gram": 0.03482389822602272,
"rps_doc_frac_chars_top_4gram": 0.017807679250836372,
"rps_doc_books_importance": -651.6268310546875,
"rps_doc_books_importance_length_correction": -651.6268310546875,
"rps_doc_openwebtext_importance": -429.0379638671875,
"rps_doc_openwebtext_importance_length_correction": -429.0379638671875,
"rps_doc_wikipedia_importance": -450.9529724121094,
"rps_doc_wikipedia_importance_length_correction": -450.9529724121094
},
"fasttext": {
"dclm": 0.14522206783294678,
"english": 0.7857167720794678,
"fineweb_edu_approx": 1.716556191444397,
"eai_general_math": 0.24943143129348755,
"eai_open_web_math": 0.1481056809425354,
"eai_web_code": 0.15739327669143677
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
5,434,540,102,048,568,000 |
TechSpot
Don't know where to start - proxies!
By taffia77
Aug 11, 2006
1. Hope someone can help with this. Basically I'm in the UK and I've got a mate in the states who's happy to set himself up as a proxy server for me (but only me!) so that I can access certain sites that I can't here in the UK.
The thing is I haven't got a clue where to begin. Do I need specialist software or is it a case of enabling/disabling certain settings.
Also will it need to be an anonymous proxy? And how can we make sure that it is only me who can get through the proxy and no-one else?
2. Nodsu
Nodsu TS Rookie Posts: 5,837 +6
What is the proxy for? Do you need a simple web proxy or do you need to forward other kinds of connections too? Do you need encryption? Do you and/or your friend have static IP addresses or not? Is your fiend going to use a dedicated computer for proxy duty or will it be his Windows desktop?
3. taffia77
taffia77 TS Rookie Topic Starter Posts: 37
Basically, it's to get around broadcasting rights issues. I want to watch events over broadband, but I'm restricted here. I don't know what kind of proxy I need for that!
If by encryption you mean so that only people he allows can use the proxy then yes (we certainly don't want it to be an open proxy).
I know my IP is dynamic, not sure about my mate's tho.
He'll just be using his desktop machine, because I'll only be doing it when there's a match on. I don't know if that's relevant to the question connection, as we'll both be online at the same time when I want to watch the game, so he can always give me his IP just before even if he is dynamic?
Topic Status:
Not open for further replies.
Similar Topics
Add New Comment
You need to be a member to leave a comment. Join thousands of tech enthusiasts and participate.
TechSpot Account You may also...
|
{
"url": "http://www.techspot.com/community/topics/dont-know-where-to-start-proxies.56099/",
"source_domain": "www.techspot.com",
"snapshot_id": "crawl=CC-MAIN-2016-44",
"warc_metadata": {
"Content-Length": "42927",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EXKEYHCSZCVYZKYT5V5LKOVGHPLNP2HC",
"WARC-Concurrent-To": "<urn:uuid:71e5272d-0df8-43d3-9b1c-74a145ffb037>",
"WARC-Date": "2016-10-27T22:44:46Z",
"WARC-IP-Address": "184.173.241.66",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:BXOLQSLCSVIL4C3NEGLRIQSDR44GBYNN",
"WARC-Record-ID": "<urn:uuid:5bf7bcab-6eda-47f8-a678-53b2afb9bf28>",
"WARC-Target-URI": "http://www.techspot.com/community/topics/dont-know-where-to-start-proxies.56099/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e4b9c425-22cc-4549-ac87-7fc36b595d4e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-6-4.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-44\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for October 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
9,
10,
47,
48,
60,
73,
303,
443,
582,
588,
599,
600,
638,
639,
936,
942,
956,
957,
1004,
1005,
1180,
1317,
1376,
1675,
1681,
1695,
1725,
1726,
1741,
1742,
1758,
1759,
1855
],
"line_end_idx": [
9,
10,
47,
48,
60,
73,
303,
443,
582,
588,
599,
600,
638,
639,
936,
942,
956,
957,
1004,
1005,
1180,
1317,
1376,
1675,
1681,
1695,
1725,
1726,
1741,
1742,
1758,
1759,
1855,
1887
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1887,
"ccnet_original_nlines": 33,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4907834231853485,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04838709905743599,
"rps_doc_frac_lines_end_with_ellipsis": 0.029411759227514267,
"rps_doc_frac_no_alph_words": 0.16359446942806244,
"rps_doc_frac_unique_words": 0.5299145579338074,
"rps_doc_mean_word_length": 3.98575496673584,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0.0023041500244289637,
"rps_doc_unigram_entropy": 4.907261848449707,
"rps_doc_word_count": 351,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.014295930042862892,
"rps_doc_frac_chars_top_3gram": 0.019299499690532684,
"rps_doc_frac_chars_top_4gram": 0.017155110836029053,
"rps_doc_books_importance": -173.0409393310547,
"rps_doc_books_importance_length_correction": -173.03927612304688,
"rps_doc_openwebtext_importance": -95.0918197631836,
"rps_doc_openwebtext_importance_length_correction": -95.0918197631836,
"rps_doc_wikipedia_importance": -81.08722686767578,
"rps_doc_wikipedia_importance_length_correction": -81.08722686767578
},
"fasttext": {
"dclm": 0.4098934531211853,
"english": 0.9616152048110962,
"fineweb_edu_approx": 1.3374347686767578,
"eai_general_math": 0.08918576687574387,
"eai_open_web_math": 0.29010921716690063,
"eai_web_code": 0.002026919974014163
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-2,692,307,374,023,734,000 |
48
I can't debug global.asax file!
I have some codes in Application_Start() method but when I set a break point in the method, it is ignored!
Is this normal?
11 Answers 11
7
Maybe you should try:
• stopping development server in taskbar
• switching the configuration from release to debug
• 5
Odd that this was marked as the answer yet has a -2 rating... – Wallace Breza Jul 20 '10 at 20:59
• It's got a minus rating because it's wrong. It's correct to say that you need to be in debug (or else you don't have the pdb files) and you need to capture the server when it starts (because this is when that code is ran) but you won't be able to attach to the process. You need a running process to attach the debugger, the global.asax code is ran in the first few miliseconds of this process starting so it's literally impossible (without using the correct answer below) to attach to the process as it runs this code – Liam Feb 28 '18 at 11:53
87
A simple way to break in Application_Start() is to use the System.Diagnostics.Debugger class. You can force the application to break by inserting System.Diagnostics.Debugger.Break() where you would like the debugger to break.
void Application_Start(object sender, EventArgs e)
{
System.Diagnostics.Debugger.Break();
// ...
}
64
1. Attach the debugger to the IIS process.
2. Open the global.asax file and put in a breakpoint.
3. Add a space to the web.config file and save the file (this causes the current web application to reset);
4. Refresh / goto a web page on the site.
5. watch in amazement when the debugger stops at your breakpoint. :)
• 1
This is also known as 'Touching the web.config' and can be used for several scenarios when you need to refresh your site without touching IIS. Can't believe it didn't occur to me. Thanks. – HockeyJ Oct 9 '12 at 8:16
• I wish it was that simple. But for me? "computer says no" – Justin Aug 7 '15 at 1:10
• 1
Worked perfectly. When performing step 1 in Visual Studio I had to tick "Show processes from all users" and attach to the IIS process called "w3wp.exe". – Fordy Aug 24 '18 at 8:45
9
Application_Start() is invoked once per AppDomain. If you're not hitting your breakpoint, it means the AppDomain was already created, so do the following:
• In your quick-launch bar, there is an icon for the VS web server (its the one which says "Local Host Some Port"). Right click and choose "Stop" or "Close". This should kill the AppDomain.
• If you're using IIS, you need to restart your site manually.
• Alternatively, modifying the web config or Global.asax file is usually enough to restart the AppDomain.
• Restart your debugging, you should hit your breakpoints now.
7
Check that your web application is in debug mode (<compilation debug="true"> in web.config).
If you're using developer's IIS started by VS, just restart it or rebuild application.
If you're on normal IIS you have two options:
1. For web-site is configured to work with development folder (where you VS web project is deployed) you just have to restart application pool set for that web-site and start debugging before first request reaches server (you can always restart app pool during debug).
2. For web-site that works on another folder or even on remote server you have to attach to the process. To do this you need remote debugger installed on remote machine or your own (depends on web-server location) and use Debug - Attach to process menu, enter computer name and then select a process to debug. It is usually a w3wp.exe working in managed mode type.
• thank you for your answer. i use IIS via VS. – Mehdi Dec 25 '09 at 19:47
5
Yes, it is normal.
Application_Start() is processed by IIS.
But all other methods, for example Session_Start, and all others, except Application_Start() can be debugged normally.
3
Another alternative to the accepted System.Diagnostics.Debugger.Break(); would be
void Application_Start(object sender, EventArgs e)
{
System.Diagnostics.Debugger.Launch();
//...
}
which shouldn't break the code and should start the debugger even if the service were started with different rights.
2
Delete the global.asax and add a new one. In my solution, there has been a global.asax and a global.asax.cs.
All the methods (Session_Start, Application_Start, ...) have been in the bot files, but only the ones in the global.asax have been considered. So, break points and code in the cs don't do anything.
Only after recreating the file, the global.asax.cs had the appropriate methods and they ran.
• I followed the instructions here: rossnelson.blogspot.ca/2005/11/…. Basically, remove the global.asax and add a global application class which recreate the asax with a code behind file which I can then step into. I am running on IIS and it works fine. – cbeuker Aug 28 '12 at 18:01
0
Dont expect the Application_Start() function to be called immediately by pressing f5. Application_Start() is invoked only at the time of first request to the application is made. Strange but true.
0
In case all of answers not working, try:
<compilation debug="true" ... />
in web.config. ;)
0
For me, my debug breakpoint already executed in IIS by the time the debugger is attached. So the solution was to alter global.asax with a little space and save the file. After refresh, my breakpoint is now hit.
Solution here: https://wakeupandcode.com/hitting-breakpoints-in-global-asax/
• Links to external resources are encouraged, but please add context around the link so your fellow users will have some idea what it is and why it’s there. Always quote the most relevant part of an important link, in case the target site is unreachable or goes permanently offline. – baduker Apr 10 at 16:45
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "https://stackoverflow.com/questions/1960651/is-it-possible-to-debug-global-asax",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2019-18",
"warc_metadata": {
"Content-Length": "177805",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2BFKCKPFVCZYI565IXKBAHXVK5OEY5QT",
"WARC-Concurrent-To": "<urn:uuid:8a5a5280-6e40-4ee0-9b5f-54303556538a>",
"WARC-Date": "2019-04-25T15:17:10Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:EXQ55NJ7LG6LMC57C4OHKC6PYEDGA6BI",
"WARC-Record-ID": "<urn:uuid:f0884012-6a40-43ce-a782-a44ea96ed428>",
"WARC-Target-URI": "https://stackoverflow.com/questions/1960651/is-it-possible-to-debug-global-asax",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8a31ed57-73bd-4006-8cd0-42d7f5a822ac>"
},
"warc_info": "isPartOf: CC-MAIN-2019-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-144-182-216.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
3,
4,
36,
37,
144,
145,
161,
162,
176,
177,
179,
180,
202,
203,
246,
300,
306,
408,
958,
961,
962,
1188,
1189,
1241,
1243,
1285,
1286,
1298,
1300,
1303,
1348,
1404,
1514,
1558,
1629,
1635,
1855,
1944,
1950,
2134,
2136,
2137,
2292,
2293,
2485,
2552,
2662,
2727,
2729,
2730,
2823,
2824,
2911,
2912,
2958,
2959,
3230,
3597,
3674,
3676,
3677,
3696,
3697,
3738,
3739,
3858,
3859,
3861,
3862,
3944,
3945,
3997,
3999,
4040,
4049,
4051,
4052,
4169,
4170,
4172,
4173,
4282,
4283,
4481,
4574,
4575,
4861,
4863,
4864,
5061,
5062,
5064,
5065,
5106,
5107,
5140,
5141,
5159,
5160,
5162,
5163,
5374,
5375,
5452,
5453,
5764,
5765,
5777,
5778,
5878,
5879
],
"line_end_idx": [
3,
4,
36,
37,
144,
145,
161,
162,
176,
177,
179,
180,
202,
203,
246,
300,
306,
408,
958,
961,
962,
1188,
1189,
1241,
1243,
1285,
1286,
1298,
1300,
1303,
1348,
1404,
1514,
1558,
1629,
1635,
1855,
1944,
1950,
2134,
2136,
2137,
2292,
2293,
2485,
2552,
2662,
2727,
2729,
2730,
2823,
2824,
2911,
2912,
2958,
2959,
3230,
3597,
3674,
3676,
3677,
3696,
3697,
3738,
3739,
3858,
3859,
3861,
3862,
3944,
3945,
3997,
3999,
4040,
4049,
4051,
4052,
4169,
4170,
4172,
4173,
4282,
4283,
4481,
4574,
4575,
4861,
4863,
4864,
5061,
5062,
5064,
5065,
5106,
5107,
5140,
5141,
5159,
5160,
5162,
5163,
5374,
5375,
5452,
5453,
5764,
5765,
5777,
5778,
5878,
5879,
5969
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5969,
"ccnet_original_nlines": 111,
"rps_doc_curly_bracket": 0.0006701300153508782,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37022900581359863,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01755725033581257,
"rps_doc_frac_lines_end_with_ellipsis": 0.01785713993012905,
"rps_doc_frac_no_alph_words": 0.2496183216571808,
"rps_doc_frac_unique_words": 0.3949238657951355,
"rps_doc_mean_word_length": 4.624365329742432,
"rps_doc_num_sentences": 104,
"rps_doc_symbol_to_word_ratio": 0.0045801498927176,
"rps_doc_unigram_entropy": 5.367650032043457,
"rps_doc_word_count": 985,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04039517045021057,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.008781559765338898,
"rps_doc_frac_chars_top_3gram": 0.007903399877250195,
"rps_doc_frac_chars_top_4gram": 0.008562020026147366,
"rps_doc_books_importance": -470.17901611328125,
"rps_doc_books_importance_length_correction": -470.17901611328125,
"rps_doc_openwebtext_importance": -335.7976989746094,
"rps_doc_openwebtext_importance_length_correction": -335.7976989746094,
"rps_doc_wikipedia_importance": -241.28939819335938,
"rps_doc_wikipedia_importance_length_correction": -241.28939819335938
},
"fasttext": {
"dclm": 0.09189414978027344,
"english": 0.9092315435409546,
"fineweb_edu_approx": 1.6550447940826416,
"eai_general_math": 0.25440478324890137,
"eai_open_web_math": 0.21342599391937256,
"eai_web_code": 0.05140579119324684
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
5,620,186,676,792,448,000 |
0 votes
Hi, I'm looking for a way to add undo option to my project. My initial idea is crating packed scene for all needed nodes and revert back to original node all values. How can I do that?
Another idea is removing and replacing node using packed scene but it's making few issue with my actual code.
Maybe someone have another idea how to achieve step back functionality?
in Engine by (230 points)
Are you thinking about like a rewind (Prince of Persia) functionality?
Here is a video showing rewind and the author offered to make a tutorial. I was also thinking you could use a separate animation player for each node and save the state each frame and then play it backwards when you want to rewind. Trick would be temporarily disabling the physics and then initializing it again after rewind.
Please log in or register to answer this question.
Welcome to Godot Engine Q&A, where you can ask questions and receive answers from other members of the community.
Please make sure to read How to use this Q&A? before posting your first questions.
Social login is currently unavailable. If you've previously logged in with a Facebook or GitHub account, use the I forgot my password link in the login box to set a password for your account. If you still can't access your account, send an email to [email protected] with your username.
Categories
|
{
"url": "https://godotengine.org/qa/32470/undo-step-back-etc",
"source_domain": "godotengine.org",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "20921",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JLMMALV2J6LZVAEM4PBW4KML6ZCLAZM4",
"WARC-Concurrent-To": "<urn:uuid:9727352d-e8c7-40d0-b4e1-ea15f495a674>",
"WARC-Date": "2020-11-28T08:23:52Z",
"WARC-IP-Address": "212.85.158.4",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PC3GBJHXHNDLFLHGAXVTPSQEFVHRMN5G",
"WARC-Record-ID": "<urn:uuid:4e79b412-c6a4-4826-8751-2aca57955f76>",
"WARC-Target-URI": "https://godotengine.org/qa/32470/undo-step-back-etc",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7154754e-eb44-40cc-8e95-1d0ad491d574>"
},
"warc_info": "isPartOf: CC-MAIN-2020-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-245.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
8,
9,
194,
195,
305,
306,
378,
379,
405,
406,
477,
478,
804,
805,
856,
857,
971,
972,
1055,
1350,
1351
],
"line_end_idx": [
8,
9,
194,
195,
305,
306,
378,
379,
405,
406,
477,
478,
804,
805,
856,
857,
971,
972,
1055,
1350,
1351,
1361
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1361,
"ccnet_original_nlines": 21,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42391303181648254,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.028985509648919106,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12318841367959976,
"rps_doc_frac_unique_words": 0.6355932354927063,
"rps_doc_mean_word_length": 4.593220233917236,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.774425983428955,
"rps_doc_word_count": 236,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.011070109903812408,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -84.64692687988281,
"rps_doc_books_importance_length_correction": -84.64676666259766,
"rps_doc_openwebtext_importance": -46.80874252319336,
"rps_doc_openwebtext_importance_length_correction": -46.80874252319336,
"rps_doc_wikipedia_importance": -20.55986213684082,
"rps_doc_wikipedia_importance_length_correction": -20.410465240478516
},
"fasttext": {
"dclm": 0.20138752460479736,
"english": 0.9409178495407104,
"fineweb_edu_approx": 1.3482491970062256,
"eai_general_math": 0.02412361092865467,
"eai_open_web_math": 0.07838082313537598,
"eai_web_code": 0.03579699993133545
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-6,958,482,439,559,563,000 |
Audio and video series 4: how to get started with ffmpeg for beginners (taking FLV decoding H.264 as an example)
Audio and video series 4: how to get started with ffmpeg for beginners (taking FLV decoding H.264 as an example)
install
The first is installation. You can choose to install package manager (in ubuntu, apt get) or use source code compilation. The difference between the two is that source code compilation can see the source code, while package manager can't. for novices, I prefer to use source code compilation.
Official website source compilation
Precautions for compilation and installation:
Let's talk about a comparison pit. The compilation guide installed the snapshot version for me, not the release version. Then there will be two problems: one is easy to bug, the other is unable to view the version number of ffmpeg. To find the corresponding api, you can only look at the header file, not the documentation (although I haven't seen the corresponding version of the documentation after reinstallation, maybe ffmpeg and opencv are different, but it doesn't matter. The release version is better than the snapshot version).
Fortunately, with this compilation method, it is easy to update. You only need to delete the relevant package, update the installation package, and compile it again. Therefore, I downloaded the latest release version on github, recompiled ffmpeg, and updated it to the current release version 4.1.5.
Upper hand
Run demo directly
For the guy with programming experience, it's natural to run demo directly, run out and watch it slowly. I do the same. If you search directly, there will be some uneven articles. Then I recommend you to read Raytheon's blog. Raytheon's blog contains a lot of demos, but I think the related knowledge is still less popular. After running the demo, you will find that you can't understand the meaning of the code. At this time, you need to advance to the second stage.
Lei Xiaohua blog: https://blog.csdn.net/leixiaohua1020
Tutorial of ffmpeg Library
First of all, you need to understand the function of the basic classes of ffmpeg library and the data flow of ffmpeg. There is a Tutorial on github that does a good job. Through it, you can understand the function of some basic classes and how to operate ffmpeg. In this way, you can basically understand the basic operation of ffmpeg, but this is not enough. You don't have relevant professional knowledge. At this time, you are the advanced To the third stage.
https://github.com/leandromoreira/ffmpeg-libav-tutorial#learn-ffmpeg-libav-the-hard-way
Learning of professional knowledge
For example, what's the difference between H.264, yuv and rgb? What's pts and dts. These knowledge can let you deal with the occurrence of some errors, or quickly find the errors. But if you just want to run through a demo simply and don't want to go deep into it, then it's unnecessary to learn systematically. However, if there is a mistake like this, you may go around and don't know about it. You can only solve it by asking people. Wikipedia or some professional books are recommended here.
Look at the source code of ffmpeg
Sometimes google can find other people's demos, but not all functions have demos on the Internet, but the source code must have them. Looking at the source code allows you to quickly know how to use this function.
This source code is in fftools under your ffmpeg source directory.
Let me show you how to use the api quickly by giving you an example.
Give an example
discover problems
Suppose you are compiling the correct code, but with the following warnings:
xxxx is deprecated [-Wdeprecated-declarations]
For example, I am in Section 2 of audio and video series The code used in contains the following errors:
av_bitstream_filter_init(const char*)' is deprecated [-Wdeprecated-declarations]
At this time, we need to search through Google. What does this mean. You will find that the reason for this warning is that the API is out of date. Of course, the word "prepare" has an out of date meaning. Students who are good at English can find it directly, which is the original meaning.
Then you'll find all the functions in your code that will give you a prepare warning.
For example, in my second section of code, there are several functions that are out of date.
av_bitstream_filter_init
av_bitstream_filter_filter
av_bitstream_filter_close
What are these functions for? It should be noted that AVPacket obtained by ffmpeg decoding only contains video compression data, and does not contain relevant decoding information (such as sps pps header information of h264, adts header information of AAC). Without these codecs, it cannot be recognized and decoded. In ffmpeg, the above functions are used to add decoding header information for these avpackets. Refer here.
Find API documentation
API document: https://www.ffmpeg.org/doxygen/trunk/index.html
Here's how to use the new API for related functions.
In the upper right corner, there is a search box: search for just out of date functions, such as: AV? Bitstream? Filter? Init
As you can see from the figure below, this function is replaced by the new version of the function. We need to change the original function to: AV bubsf get by buname(), AV bubsf alloc(), and AV bubsf init()
Click to know how to use its function.
OK, even if I know the related functions and the way to use them, I still can't use them. What should I do? Do you have a demo, brother?
Yes, of course!
ffmpeg source code starts
Open the fftool / folder in the ffmpeg directory as we just mentioned, and you will see that there are many. c files. We have priority to view the ffmpeg.c file. If this can't be found, we can find others.
Use ctrl+f to locate the new api and see how it is used.
For example, just found AV ﹣ BSF ﹣ init, as shown in the following figure:
OK, now you finally know how to use the api, and then it's the code.
Compiled as follows:
Modified source code
About the code of pulling the RGB of mango station video flow, update it below. Interested partners can compare the code below with the code in Section 2 and the corresponding code of ffmpeg.c. you will find that ffmpeg.c has actually told you how to use it. It's good to modify and use it.
#include <iostream>
extern "C"
{
#include "libavformat/avformat.h"
#include <libavutil/mathematics.h>
#include <libavutil/time.h>
#include <libavutil/samplefmt.h>
#include <libavcodec/avcodec.h>
#include <libavfilter/buffersink.h>
#include <libavfilter/buffersrc.h>
};
#include "opencv2/core.hpp"
#include<opencv2/opencv.hpp>
void AVFrame2Img(AVFrame *pFrame, cv::Mat& img);
void Yuv420p2Rgb32(const uchar *yuvBuffer_in, const uchar *rgbBuffer_out, int width, int height);
using namespace std;
using namespace cv;
AVFilterContext *buffersrc_ctx;
AVFilterGraph *filter_graph;
int main(int argc, char* argv[])
{
AVFormatContext *ifmt_ctx = NULL;
AVPacket pkt;
AVFrame *pframe = NULL;
int ret, i;
int videoindex=-1;
AVCodecContext *pCodecCtx;
AVCodec *pCodec;
const AVBitStreamFilter *buffersrc = NULL;
AVBSFContext *bsf_ctx;
AVCodecParameters *codecpar = NULL;
const char *in_filename = "rtmp://58.200.131.2:1935/livetv/hunantv"; //Mango station rtmp address
//Const char * in_filename = "test. H264"; / / Mango platform rtmp address
//Const char * in_filename = "rtmp: / / localhost: 1935 / rtmplive"; / / Mango stage rtmp address
const char *out_filename_v = "test1.h264"; //Output file URL
//Register
av_register_all();
//Network
avformat_network_init();
//Input
if ((ret = avformat_open_input(&ifmt_ctx, in_filename, 0, 0)) < 0)
{
printf( "Could not open input file.");
return -1;
}
if ((ret = avformat_find_stream_info(ifmt_ctx, 0)) < 0)
{
printf( "Failed to retrieve input stream information");
return -1;
}
videoindex=-1;
for(i=0; i<ifmt_ctx->nb_streams; i++)
{
if(ifmt_ctx->streams[i]->codecpar->codec_type==AVMEDIA_TYPE_VIDEO)
{
videoindex=i;
codecpar = ifmt_ctx->streams[i]->codecpar;
}
}
//Find H.264 Decoder
pCodec = avcodec_find_decoder(AV_CODEC_ID_H264);
if(pCodec==NULL){
printf("Couldn't find Codec.\n");
return -1;
}
pCodecCtx = avcodec_alloc_context3(pCodec);
if (!pCodecCtx) {
fprintf(stderr, "Could not allocate video codec context\n");
exit(1);
}
if(avcodec_open2(pCodecCtx, pCodec,NULL)<0){
printf("Couldn't open codec.\n");
return -1;
}
pframe=av_frame_alloc();
if(!pframe)
{
printf("Could not allocate video frame\n");
exit(1);
}
FILE *fp_video=fopen(out_filename_v,"wb+"); //For saving H.264
cv::Mat image_test;
// Old API
/*//AVBitStreamFilterContext* h264bsfc = av_bitstream_filter_init("h264_mp4toannexb");
*/
buffersrc = av_bsf_get_by_name("h264_mp4toannexb");
ret = av_bsf_alloc(buffersrc,&bsf_ctx);
if(ret < 0)
return -1;
avcodec_parameters_copy(bsf_ctx->par_in,codecpar);
ret = av_bsf_init(bsf_ctx);
while(av_read_frame(ifmt_ctx, &pkt)>=0)
{
if (pkt.stream_index == videoindex) {
//Old API
// av_bitstream_filter_filter(h264bsfc, ifmt_ctx->streams[videoindex]->codec, NULL, &pkt.data, &pkt.size,
// pkt.data, pkt.size, 0);
ret = av_bsf_send_packet(bsf_ctx, &pkt);
if(ret < 0) {
cout << " bsg_send_packet is error! " << endl;
continue;
}
ret = av_bsf_receive_packet(bsf_ctx, &pkt);
if(ret < 0) {
cout << " bsg_receive_packet is error! " << endl;
continue;
}
printf("Write Video Packet. size:%d\tpts:%ld\n", pkt.size, pkt.pts);
//Save as h.264 this function is used for testing
//fwrite(pkt.data, 1, pkt.size, fp_video);
// Decode AVPacket
if(pkt.size)
{
ret = avcodec_send_packet(pCodecCtx, &pkt);
if (ret < 0 || ret == AVERROR(EAGAIN) || ret == AVERROR_EOF) {
std::cout << "avcodec_send_packet: " << ret << std::endl;
continue;
}
//Get AVframe
ret = avcodec_receive_frame(pCodecCtx, pframe);
if (ret == AVERROR(EAGAIN) || ret == AVERROR_EOF) {
std::cout << "avcodec_receive_frame: " << ret << std::endl;
continue;
}
//AVframe to rgb
AVFrame2Img(pframe,image_test);
}
}
//Free AvPacket
av_packet_unref(&pkt);
}
//Close filter old API
// av_bitstream_filter_close(h264bsfc);
av_bsf_free(&bsf_ctx);
fclose(fp_video);
avformat_close_input(&ifmt_ctx);
if (ret < 0 && ret != AVERROR_EOF)
{
printf( "Error occurred.\n");
return -1;
}
return 0;
}
void Yuv420p2Rgb32(const uchar *yuvBuffer_in, const uchar *rgbBuffer_out, int width, int height)
{
uchar *yuvBuffer = (uchar *)yuvBuffer_in;
uchar *rgb32Buffer = (uchar *)rgbBuffer_out;
int channels = 3;
for (int y = 0; y < height; y++)
{
for (int x = 0; x < width; x++)
{
int index = y * width + x;
int indexY = y * width + x;
int indexU = width * height + y / 2 * width / 2 + x / 2;
int indexV = width * height + width * height / 4 + y / 2 * width / 2 + x / 2;
uchar Y = yuvBuffer[indexY];
uchar U = yuvBuffer[indexU];
uchar V = yuvBuffer[indexV];
int R = Y + 1.402 * (V - 128);
int G = Y - 0.34413 * (U - 128) - 0.71414*(V - 128);
int B = Y + 1.772*(U - 128);
R = (R < 0) ? 0 : R;
G = (G < 0) ? 0 : G;
B = (B < 0) ? 0 : B;
R = (R > 255) ? 255 : R;
G = (G > 255) ? 255 : G;
B = (B > 255) ? 255 : B;
rgb32Buffer[(y*width + x)*channels + 2] = uchar(R);
rgb32Buffer[(y*width + x)*channels + 1] = uchar(G);
rgb32Buffer[(y*width + x)*channels + 0] = uchar(B);
}
}
}
void AVFrame2Img(AVFrame *pFrame, cv::Mat& img)
{
int frameHeight = pFrame->height;
int frameWidth = pFrame->width;
int channels = 3;
//Output image allocation memory
img = cv::Mat::zeros(frameHeight, frameWidth, CV_8UC3);
Mat output = cv::Mat::zeros(frameHeight, frameWidth,CV_8U);
//Create buffer to save yuv data
uchar* pDecodedBuffer = (uchar*)malloc(frameHeight*frameWidth * sizeof(uchar)*channels);
//Get yuv420p data from AVFrame and save it to buffer
int i, j, k;
//Copy y component
for (i = 0; i < frameHeight; i++)
{
memcpy(pDecodedBuffer + frameWidth*i,
pFrame->data[0] + pFrame->linesize[0] * i,
frameWidth);
}
//Copy u component
for (j = 0; j < frameHeight / 2; j++)
{
memcpy(pDecodedBuffer + frameWidth*i + frameWidth / 2 * j,
pFrame->data[1] + pFrame->linesize[1] * j,
frameWidth / 2);
}
//Copy v component
for (k = 0; k < frameHeight / 2; k++)
{
memcpy(pDecodedBuffer + frameWidth*i + frameWidth / 2 * j + frameWidth / 2 * k,
pFrame->data[2] + pFrame->linesize[2] * k,
frameWidth / 2);
}
//Convert yuv420p data in buffer to RGB;
Yuv420p2Rgb32(pDecodedBuffer, img.data, frameWidth, frameHeight);
//Simple processing, canny is used for binarization
// cvtColor(img, output, CV_RGB2GRAY);
// waitKey(2);
// Canny(img, output, 50, 50*2);
// waitKey(2);
imshow("test",img);
waitKey(1);
// Test function
// imwrite("test.jpg",img);
//Release buffer
free(pDecodedBuffer);
img.release();
output.release();
}
cmake files will not be placed here, please refer to Section 2.
46 original articles published, 51 praised, 80000 visitors+
Private letter follow
Tags: codec github snapshot OpenCV
Posted on Mon, 16 Mar 2020 23:17:02 -0700 by danrah
|
{
"url": "https://codar.club/blogs/5e706b241941e.html",
"source_domain": "codar.club",
"snapshot_id": "crawl=CC-MAIN-2020-16",
"warc_metadata": {
"Content-Length": "61218",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NAT7JJMZQAJYNJSQYYNYMHSQG3EJ7TBT",
"WARC-Concurrent-To": "<urn:uuid:bb9a1d74-d70c-4396-b753-95057bc1fb7b>",
"WARC-Date": "2020-04-02T02:56:40Z",
"WARC-IP-Address": "174.137.48.86",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:M7HDD4B36E4DOQVIICBPH3MF7AT2ZXVL",
"WARC-Record-ID": "<urn:uuid:3e768465-4070-4908-aec0-fe4af4bfd297>",
"WARC-Target-URI": "https://codar.club/blogs/5e706b241941e.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:23d4e2a7-52c8-4ab7-a10a-9e9591e7880f>"
},
"warc_info": "isPartOf: CC-MAIN-2020-16\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-239.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
113,
114,
227,
228,
236,
237,
530,
531,
567,
568,
614,
1151,
1152,
1452,
1453,
1464,
1465,
1483,
1484,
1952,
1953,
2008,
2009,
2036,
2037,
2500,
2588,
2589,
2624,
2625,
3121,
3122,
3156,
3157,
3371,
3438,
3439,
3508,
3509,
3525,
3526,
3544,
3545,
3622,
3669,
3670,
3775,
3856,
3857,
4149,
4150,
4236,
4329,
4354,
4381,
4407,
4408,
4833,
4834,
4857,
4858,
4920,
4973,
5099,
5100,
5308,
5309,
5348,
5349,
5486,
5487,
5503,
5504,
5530,
5531,
5737,
5738,
5795,
5870,
5871,
5940,
5941,
5962,
5963,
5984,
5985,
6276,
6277,
6297,
6308,
6310,
6344,
6379,
6407,
6440,
6472,
6508,
6543,
6546,
6574,
6603,
6604,
6605,
6654,
6752,
6773,
6793,
6794,
6826,
6855,
6856,
6889,
6891,
6929,
6947,
6975,
6991,
7014,
7015,
7047,
7076,
7077,
7126,
7153,
7193,
7194,
7299,
7378,
7480,
7545,
7560,
7583,
7597,
7626,
7638,
7709,
7715,
7762,
7781,
7787,
7847,
7853,
7917,
7936,
7942,
7943,
7962,
8004,
8010,
8085,
8095,
8121,
8176,
8186,
8192,
8217,
8270,
8292,
8334,
8353,
8359,
8360,
8408,
8430,
8499,
8516,
8522,
8523,
8572,
8614,
8633,
8639,
8640,
8669,
8685,
8691,
8743,
8760,
8766,
8767,
8834,
8835,
8859,
8874,
8965,
8968,
8969,
9025,
9069,
9085,
9104,
9159,
9191,
9192,
9193,
9194,
9238,
9244,
9290,
9312,
9429,
9494,
9495,
9548,
9574,
9637,
9663,
9677,
9733,
9759,
9825,
9851,
9865,
9946,
9947,
10009,
10064,
10065,
10096,
10121,
10135,
10195,
10274,
10352,
10382,
10400,
10430,
10494,
10562,
10642,
10672,
10690,
10723,
10771,
10785,
10786,
10796,
10820,
10851,
10857,
10884,
10927,
10954,
10955,
10977,
11014,
11053,
11059,
11097,
11116,
11122,
11136,
11138,
11235,
11237,
11283,
11332,
11333,
11355,
11356,
11393,
11399,
11439,
11449,
11488,
11489,
11529,
11598,
11688,
11689,
11730,
11771,
11812,
11813,
11856,
11921,
11962,
11995,
12028,
12061,
12098,
12135,
12172,
12173,
12237,
12301,
12365,
12375,
12381,
12383,
12384,
12432,
12434,
12472,
12508,
12530,
12567,
12627,
12691,
12692,
12729,
12822,
12823,
12881,
12898,
12921,
12959,
12965,
13011,
13069,
13097,
13103,
13126,
13168,
13174,
13241,
13299,
13331,
13337,
13360,
13402,
13408,
13496,
13554,
13586,
13592,
13593,
13638,
13708,
13709,
13765,
13807,
13825,
13861,
13879,
13903,
13919,
13940,
13972,
13993,
14019,
14038,
14060,
14062,
14063,
14127,
14128,
14188,
14210,
14211,
14246,
14247
],
"line_end_idx": [
113,
114,
227,
228,
236,
237,
530,
531,
567,
568,
614,
1151,
1152,
1452,
1453,
1464,
1465,
1483,
1484,
1952,
1953,
2008,
2009,
2036,
2037,
2500,
2588,
2589,
2624,
2625,
3121,
3122,
3156,
3157,
3371,
3438,
3439,
3508,
3509,
3525,
3526,
3544,
3545,
3622,
3669,
3670,
3775,
3856,
3857,
4149,
4150,
4236,
4329,
4354,
4381,
4407,
4408,
4833,
4834,
4857,
4858,
4920,
4973,
5099,
5100,
5308,
5309,
5348,
5349,
5486,
5487,
5503,
5504,
5530,
5531,
5737,
5738,
5795,
5870,
5871,
5940,
5941,
5962,
5963,
5984,
5985,
6276,
6277,
6297,
6308,
6310,
6344,
6379,
6407,
6440,
6472,
6508,
6543,
6546,
6574,
6603,
6604,
6605,
6654,
6752,
6773,
6793,
6794,
6826,
6855,
6856,
6889,
6891,
6929,
6947,
6975,
6991,
7014,
7015,
7047,
7076,
7077,
7126,
7153,
7193,
7194,
7299,
7378,
7480,
7545,
7560,
7583,
7597,
7626,
7638,
7709,
7715,
7762,
7781,
7787,
7847,
7853,
7917,
7936,
7942,
7943,
7962,
8004,
8010,
8085,
8095,
8121,
8176,
8186,
8192,
8217,
8270,
8292,
8334,
8353,
8359,
8360,
8408,
8430,
8499,
8516,
8522,
8523,
8572,
8614,
8633,
8639,
8640,
8669,
8685,
8691,
8743,
8760,
8766,
8767,
8834,
8835,
8859,
8874,
8965,
8968,
8969,
9025,
9069,
9085,
9104,
9159,
9191,
9192,
9193,
9194,
9238,
9244,
9290,
9312,
9429,
9494,
9495,
9548,
9574,
9637,
9663,
9677,
9733,
9759,
9825,
9851,
9865,
9946,
9947,
10009,
10064,
10065,
10096,
10121,
10135,
10195,
10274,
10352,
10382,
10400,
10430,
10494,
10562,
10642,
10672,
10690,
10723,
10771,
10785,
10786,
10796,
10820,
10851,
10857,
10884,
10927,
10954,
10955,
10977,
11014,
11053,
11059,
11097,
11116,
11122,
11136,
11138,
11235,
11237,
11283,
11332,
11333,
11355,
11356,
11393,
11399,
11439,
11449,
11488,
11489,
11529,
11598,
11688,
11689,
11730,
11771,
11812,
11813,
11856,
11921,
11962,
11995,
12028,
12061,
12098,
12135,
12172,
12173,
12237,
12301,
12365,
12375,
12381,
12383,
12384,
12432,
12434,
12472,
12508,
12530,
12567,
12627,
12691,
12692,
12729,
12822,
12823,
12881,
12898,
12921,
12959,
12965,
13011,
13069,
13097,
13103,
13126,
13168,
13174,
13241,
13299,
13331,
13337,
13360,
13402,
13408,
13496,
13554,
13586,
13592,
13593,
13638,
13708,
13709,
13765,
13807,
13825,
13861,
13879,
13903,
13919,
13940,
13972,
13993,
14019,
14038,
14060,
14062,
14063,
14127,
14128,
14188,
14210,
14211,
14246,
14247,
14298
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 14298,
"ccnet_original_nlines": 352,
"rps_doc_curly_bracket": 0.0034969900734722614,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23112891614437103,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.030728120356798172,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3844355344772339,
"rps_doc_frac_unique_words": 0.35550323128700256,
"rps_doc_mean_word_length": 5.511477470397949,
"rps_doc_num_sentences": 135,
"rps_doc_symbol_to_word_ratio": 0.0036740100476890802,
"rps_doc_unigram_entropy": 5.778665542602539,
"rps_doc_word_count": 1699,
"rps_doc_frac_chars_dupe_10grams": 0.03545492887496948,
"rps_doc_frac_chars_dupe_5grams": 0.07155062258243561,
"rps_doc_frac_chars_dupe_6grams": 0.037590768188238144,
"rps_doc_frac_chars_dupe_7grams": 0.03545492887496948,
"rps_doc_frac_chars_dupe_8grams": 0.03545492887496948,
"rps_doc_frac_chars_dupe_9grams": 0.03545492887496948,
"rps_doc_frac_chars_top_2gram": 0.010679200291633606,
"rps_doc_frac_chars_top_3gram": 0.005126010160893202,
"rps_doc_frac_chars_top_4gram": 0.006087140180170536,
"rps_doc_books_importance": -1321.2547607421875,
"rps_doc_books_importance_length_correction": -1321.2547607421875,
"rps_doc_openwebtext_importance": -709.2930908203125,
"rps_doc_openwebtext_importance_length_correction": -709.2930908203125,
"rps_doc_wikipedia_importance": -428.13323974609375,
"rps_doc_wikipedia_importance_length_correction": -428.13323974609375
},
"fasttext": {
"dclm": 0.8156652450561523,
"english": 0.7072458863258362,
"fineweb_edu_approx": 2.3862156867980957,
"eai_general_math": 0.9324928522109985,
"eai_open_web_math": 0.2181638479232788,
"eai_web_code": 0.9316522479057312
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "006.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Cognitive science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
7,141,383,758,769,267,000 |
RE: Real-Time Mitigation of Denial of Service Attacks Now Available With AT&T
Woulda, shoulda. If it is so simple, how come not everyone does it?
Patrick W.Gilmore
Why don't people patch their windows boxes, or secure old sendmail installations? Why do people flap announcements, or accept bogons? Why do people jay walk, or cheat on their taxes? Why do people do anything else they should not do?
'Cause people are lazy and stupid. DUH.
Speaking of flapping, where's ARIN? Seems they've been flapping so bad
this morning all our transit providers have dampened them out of
existence.
The original quote, from the song title, is "Coulda, Woulda, Shoulda"
^^^^^^
And that sums it up MUCH better ...
Hmm - please try to patch windows box, having 19200bps dialin connection and
living in a small town. It's almost impossible..
Q. is - why this !@#$ MS open ports for listening on _CLIENT_ machines (when
no one asked them about it),
and why they created the world of monocultural OS systems. This is the roots
for this problem. Patching is just a _patching_.
People are not lazy - it is just IMPOSSIBLE to patch millions of this
systems.
PS. Sendmail... who told _sendmail_?! Did you tried to patch sendmail, when
it was installed from unknown sources and
configured by unknown m4 file, and sources was lost when engineer was fired
2 years ago? You are welcome to try, I can find such system for you.
Date: Wed, 2 Jun 2004 09:26:27 -0700
From: Michel Py
Woulda, shoulda. If it is so simple, how come not everyone
does it?
It's modern layered security: "We don't have to worry about that
here. Another layer will take care of it."
Eddy
|
{
"url": "https://community.nanog.org/t/re-real-time-mitigation-of-denial-of-service-attacks-now-available-with-at-t/27808",
"source_domain": "community.nanog.org",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "26886",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7UVMUJO4JGK5GKBUO7F4F63OT2DE7JQ2",
"WARC-Concurrent-To": "<urn:uuid:23bc3eec-197c-4223-84d8-808d69aec7f0>",
"WARC-Date": "2024-05-23T05:31:03Z",
"WARC-IP-Address": "5.161.46.87",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:P3HXBD3UT3BCPC7B5FPHSYMDPGACSPDX",
"WARC-Record-ID": "<urn:uuid:07af48d5-cc8f-4291-91d1-2101df58ea79>",
"WARC-Target-URI": "https://community.nanog.org/t/re-real-time-mitigation-of-denial-of-service-attacks-now-available-with-at-t/27808",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9471418d-b0d2-41e1-bad0-fe464136605c>"
},
"warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-211\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
78,
79,
147,
148,
166,
167,
401,
402,
442,
443,
514,
579,
590,
591,
661,
713,
749,
750,
827,
876,
877,
954,
983,
1060,
1109,
1110,
1180,
1189,
1190,
1266,
1308,
1384,
1453,
1454,
1491,
1507,
1508,
1567,
1576,
1577,
1642,
1685,
1686
],
"line_end_idx": [
78,
79,
147,
148,
166,
167,
401,
402,
442,
443,
514,
579,
590,
591,
661,
713,
749,
750,
827,
876,
877,
954,
983,
1060,
1109,
1110,
1180,
1189,
1190,
1266,
1308,
1384,
1453,
1454,
1491,
1507,
1508,
1567,
1576,
1577,
1642,
1685,
1686,
1690
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1690,
"ccnet_original_nlines": 43,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3674032986164093,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03867403045296669,
"rps_doc_frac_lines_end_with_ellipsis": 0.022727269679307938,
"rps_doc_frac_no_alph_words": 0.2154696136713028,
"rps_doc_frac_unique_words": 0.6214285492897034,
"rps_doc_mean_word_length": 4.474999904632568,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0.00828729011118412,
"rps_doc_unigram_entropy": 4.934860706329346,
"rps_doc_word_count": 280,
"rps_doc_frac_chars_dupe_10grams": 0.08140462636947632,
"rps_doc_frac_chars_dupe_5grams": 0.08140462636947632,
"rps_doc_frac_chars_dupe_6grams": 0.08140462636947632,
"rps_doc_frac_chars_dupe_7grams": 0.08140462636947632,
"rps_doc_frac_chars_dupe_8grams": 0.08140462636947632,
"rps_doc_frac_chars_dupe_9grams": 0.08140462636947632,
"rps_doc_frac_chars_top_2gram": 0.031125299632549286,
"rps_doc_frac_chars_top_3gram": 0.02633678913116455,
"rps_doc_frac_chars_top_4gram": 0.027134880423545837,
"rps_doc_books_importance": -151.77487182617188,
"rps_doc_books_importance_length_correction": -139.28842163085938,
"rps_doc_openwebtext_importance": -104.36624145507812,
"rps_doc_openwebtext_importance_length_correction": -104.36624145507812,
"rps_doc_wikipedia_importance": -99.69886016845703,
"rps_doc_wikipedia_importance_length_correction": -89.7645034790039
},
"fasttext": {
"dclm": 0.9947758913040161,
"english": 0.9574569463729858,
"fineweb_edu_approx": 2.2620205879211426,
"eai_general_math": 0.03673547878861427,
"eai_open_web_math": 0.15124726295471191,
"eai_web_code": 0.008391380310058594
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
6,056,115,080,353,025,000 |
sha1-asm 0.5.1
Assembly implementation of SHA-1 compression function
Documentation
fn main() {
let target_arch = std::env::var("CARGO_CFG_TARGET_ARCH").unwrap_or_default();
let target_vendor = std::env::var("CARGO_CFG_TARGET_VENDOR").unwrap_or_default();
let asm_path = if target_arch == "x86" {
"src/x86.S"
} else if target_arch == "x86_64" {
"src/x64.S"
} else if target_arch == "aarch64" && target_vendor == "apple" {
"src/aarch64_apple.S"
} else if target_arch == "aarch64" {
"src/aarch64.S"
} else {
panic!("Unsupported target architecture");
};
let mut build = cc::Build::new();
if target_arch == "aarch64" {
build.flag("-march=armv8-a+crypto");
}
build.flag("-c").file(asm_path).compile("libsha1.a");
}
|
{
"url": "https://docs.rs/crate/sha1-asm/0.5.1/source/build.rs",
"source_domain": "docs.rs",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "47931",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WNT7LYSXOSCXRVXE5KBIRCXPNE5HEFSF",
"WARC-Concurrent-To": "<urn:uuid:35d85f66-4cb5-4270-bb09-2b671d1dcb62>",
"WARC-Date": "2023-12-02T22:21:39Z",
"WARC-IP-Address": "108.138.85.36",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YVMPZVE74YB6IPPFEABAQ4OJU4IISNVB",
"WARC-Record-ID": "<urn:uuid:107f1db3-b563-4ca5-8b86-cca0c6d00090>",
"WARC-Target-URI": "https://docs.rs/crate/sha1-asm/0.5.1/source/build.rs",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bfbf3e6d-7ea0-4adf-9adf-3a543e524539>"
},
"warc_info": "isPartOf: CC-MAIN-2023-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-169\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
15,
16,
70,
84,
96,
178,
264,
265,
310,
330,
370,
390,
459,
489,
530,
554,
567,
618,
625,
663,
697,
742,
748,
806
],
"line_end_idx": [
15,
16,
70,
84,
96,
178,
264,
265,
310,
330,
370,
390,
459,
489,
530,
554,
567,
618,
625,
663,
697,
742,
748,
806,
807
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 807,
"ccnet_original_nlines": 24,
"rps_doc_curly_bracket": 0.01734820008277893,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10285714268684387,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03999999910593033,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5199999809265137,
"rps_doc_frac_unique_words": 0.6603773832321167,
"rps_doc_mean_word_length": 9.05660343170166,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.318023443222046,
"rps_doc_word_count": 53,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.125,
"rps_doc_frac_chars_top_3gram": 0.10000000149011612,
"rps_doc_frac_chars_top_4gram": 0.09583333134651184,
"rps_doc_books_importance": -118.91796875,
"rps_doc_books_importance_length_correction": -118.91796875,
"rps_doc_openwebtext_importance": -75.70464324951172,
"rps_doc_openwebtext_importance_length_correction": -75.69898986816406,
"rps_doc_wikipedia_importance": -40.634403228759766,
"rps_doc_wikipedia_importance_length_correction": -40.634403228759766
},
"fasttext": {
"dclm": 0.9999122619628906,
"english": 0.31723451614379883,
"fineweb_edu_approx": 2.4086573123931885,
"eai_general_math": 0.9917909502983093,
"eai_open_web_math": 0.3029433488845825,
"eai_web_code": 0.9918046593666077
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-5,489,849,546,146,133,000 |
Rehtt's Blog https://rehtt.com/ zh-CN Welcome to my blog Fri, 16 Apr 2021 16:13:00 +0800 Fri, 16 Apr 2021 16:13:00 +0800 【算法】动态规划 https://rehtt.com/index.php/archives/243/ https://rehtt.com/index.php/archives/243/ Fri, 16 Apr 2021 16:13:00 +0800 Rehtt 0 \end{cases}$ 代码： ```go //coins为硬币面额，amount为目标金额 //coins=[1,2,5]，amount=11 func dp(coins []int,amount int)int{ if n==0 {return 0} // base case if n<0 {return -1} num:=amount+1 //因为凑出硬币的数量永远也不可能大于目标金额，所以amount+1表示无穷大。而求最小值，所以初始化无穷大。 //“选择” for _,coin:=range coins{ sub:=dp(coins,amount - coin) if sub == -1{continue} //子问题无解，跳过 //min() if num > 1+sub{ num = 1+sub } } if num==amount+1{ //没有凑出 return -1 } return num } ``` 递归树： ```mermaid graph TB a((11))--1-->b((10)) a--2-->c((9))-->c0((...)) a--5-->d((6)) b--1-->b0((9)) b--2-->b1((8))-->b10((...)) b--5-->b2((5))-->b20((...)) b0--1-->b00((8)) b0--2-->b01((7)) b0--5-->b02((4)) d--1-->d0((5))-->d00((...)) d--2-->d1((4)) d--5-->d2((1))-->d20((...)) d1--1-->d10((3)) d1--2-->d11((2)) d1--5-->d12(("-1")) ``` 通过递归树可以看到，存在 `amount`相同的重复子问题，从而导致算法效率低下。 ***递归算法时间复杂度 = 子问题总数时间复杂度 x 每个子问题时间复杂度*** 在此暴力递归中，子问题总数时间复杂度为$O(n^{k})$，每个子问题时间复杂度为$O(k)$。因此本暴力递归的中时间复杂度为$O(kn^{k})$。 ### 二、带“备忘录”的递归解法 从上述的暴力递归树中可以看出，存在许多重复的子问题，这些重复的子问题就是导致算法效率低的主要原因。那么针对这个问题，我们可以建立一个“备忘录”来存储每个子问题计算的结果，在计算子问题之前先查询是有结果存在“备忘录”中，如果存在就直接使用“备忘录”中的值而不再去计算。 *一般“备忘录”可以使用数组或哈希表来建立。* 代码： ```go var tab []int //备忘录 func dp(coins []int,amount int)int{ //初始化备忘录 if tab == nil{tab=make([]int,len(coins))} if n==0 {return 0} if n<0 {return -1} num:=amount+1 for _,coin:=range coins{ i := amount - coin //查表，若结果不存在的话就进行计算 if tab[i]==0{ tab[i] = dp(coins,i) } if tab[i] == -1{continue} //min() if num > 1 + tab[i]{ num = 1 + tab[i] } } if num==amount+1{ return -1 } return num } ``` 带有“备忘录”的递归就解决了重复子问题冗余的问题,因此子问题的个数不会超过目标金额$n$，因此带“备忘录”的递归的总时间复杂度为$O(kn)$。 ### 三、dp数组迭代解法 以上递归都是自顶向下的解法，“状态”`amount`的变化为：11、10、...、0 而dp数组迭代则是自底向上的解法，“状态”`amount`的变化为：1、2、...、11 dp数组的定义：当目标金额为 `n`时，最多需要 `dp[n]`枚硬币。 代码： ```go func coinChange(coins []int,amount int)int{ //创建dp数组，长度为amount+1 dp := make([]int,amount+1) //初始化dp数组，除dp[0]以外都赋值amount+1 //以dp数组下标为各“状态”目标金额。 //当“状态”为0时，结果为零，因此dp[0]=0。base case //除0其他以外，都赋值amount+1。amount+1为硬币永远也达不到的数量，本题求最少硬币数量，因此amount+1表示无穷大。 for i:=1;i 1+dp[i-coin]{ dp[i] = 1+dp[i-coin] } } } //结果为amount+1“无穷大”为无解返回-1 if dp[amount] == amount+1{ return -1 } return dp[amount] } ``` ]]> 0 https://rehtt.com/index.php/archives/243/#comments https://rehtt.com/index.php/feed/archives/243/ 【计算机网络】UDP打洞 https://rehtt.com/index.php/archives/242/ https://rehtt.com/index.php/archives/242/ Sun, 28 Feb 2021 18:59:00 +0800 Rehtt 32）个地址可供使用，其间有一些地址是为特殊用途而保留的，如专用网络（约1800万个地址）和多播网络（约2.7个地址），这将减少了互联网中可用的地址。随着时间的变化，接入互联网的设备越来越多，出现了IPv4地址的枯竭的问题。 ### NAT技术 NAT全称：`Network Address Translation`，网络地址转换。是一种在IP数据包通过路由器或防火墙时重写来源IP或目的IP的技术。**该技术可以实现多个网络设备共用一个对外IP或公网IP**。 因此NAT技术可以缓解IPv4枯竭的问题，目前基本上家用宽带运营商都使用NAT技术为用户赋予IP地址，通常是一层或一栋楼共用一个公网IP（详情根据当地运营商而定）。 ![NAT.jpg][1] 假如现有内网设备`A`、NAT(1.1.1.2)和公网服务器(1.1.1.1) 1. A向服务器发送请求包。 2. A请求包经过NAT，NAT从中得到请求的目的地址（1.1.1.1）。 3. NAT保存A的地址和A的目的地址（1.1.1.1），并给A随机分配映射一个端口（1234）。 4. NAT将A请求包的源地址（A的地址）和源端口，替换为NAT的公网IP和分配给A的端口（1234）。 5. NAT将请求包向公网服务器（1.1.1.1）发出。 6. 服务器（1.1.1.1）接收到请求包并返回回应包。 7. NAT接收到回应包，并从中得到回应的端口（1234）。 8. NAT找查记录，发现与端口（1234）对应的设备是A，并且回应包发送者的IP（1.1.1.1）也在其中。（若两者其中一个不满足就会将此包丢弃） 9. NAT将回应包的目的IP（1.1.1.2）和目的端口（1234）改为A的地址。 10. NAT将回应包发送给A。 默认情况下在NAT内网的设备可以主动访问公网IP的设备，但公网IP设备却不能主动访问NAT内网的设备（因为NAT没有记录，对应上述例子第8步）. ## 打洞 因为NAT技术的原因，造成两个NAT内网的设备无法直接通信（例如：不能直接访问没有公网IP的电脑）。 **打洞**顾名思义，就是在NAT内网中打出一个洞，让两个不同内网的设备直接访问。 ### 原理 从上述NAT技术的第4步和第9步，可以看出NAT需要将内网设备映射到一个端口并保存其访问的公网地址和端口，才可以使内网设备和公网设备通信。所以打洞给关键一步就是让两个设备相互访问对方公网对应的IP和端口，让自己的NAT保存记录。 假如现有内网设备A、NAT A(1.1.1.2)、内网设备B、NAT B(1.1.1.3)以及公网服务器(1.1.1.1)，内网设备A和内网设备B想要直接通信。 ![UDPASS.jpg][2] 1. A和B向服务器访问，NAT A和NAT B分别为AB分配映射端口`4530`与`6540`。 2. 服务器收到请求后，保存IP和端口（`1.1.1.2:4530`，`1.1.1.3:6540`）。 3. 服务器向A返回B的IP和端口，向B返回A的IP和端口。 4. A向B的地址发送数据（NAT B因为没有A的地址记录会丢弃A的包，但是这一步为的是让NAT A记住B的地址，让NAT A以后将带有B地址的包转发给A）。 5. B再向A发送数据。（这一步也是让NAT B记住A的地址，但上一步NAT A已经有了B的地址，所以这一次B发送的数据可以正常到达A）。 6. 从此A和B就可以直接双向发送数据，洞就被打通了。 ### UDP UDP全称：User Datagram Protocol，用户数据报协议。是一种无连接的协议。 UDP负责将数据发送出去，但对方有没有接收到就不是UDP责任了（就算是错误的IP或端口，UDP也照样发送），因此也是一种不可靠的协议。 但是就很适合使用UDP来做NAT打洞，因为在上述原理第4步的过程中，NAT B没有A的记录就将A的包给丢弃了，在计划里这一步丢包是必然的，而UDP不管对方收到或丢弃。若是用其他可靠协议比如TCP，可能会造成打洞失败的情况，而解决办法就是修改系统内核，但这又非常麻烦。 ## 代码实现 这里使用Golang进行网络编程。 客户端之所以使用`net.ListenUDP()`而不是`net.DialUDP()`，是因为`net.ListenUDP()`的`*UDPConn`是`unconnected`，而`net.DialUDP()`的`*UDPConn`是`connected`的。 如果`*UDPConn`是`connected`,读写方法是`Read`和`Write`。 如果`*UDPConn`是`unconnected`,读写方法是`ReadFromUDP`和`WriteToUDP`（以及`ReadFrom`和`WriteTo`)。 使用`ReadFromUDP`和`WriteToUDP`进行读写可以指定读写任何UDP地址，而且`net.ListenUDP()`还可以固定本机UDP端口不被系统更换。 ### 服务端demo ```go type j struct { Name string `json:"name"` //客户端名 Addr string `json:"addr"` //地址 To string `json:"to"` //要连接的客户端名 } dev := make(map[string]string) //客户端地址 addr, _ := net.ResolveUDPAddr("udp", "0.0.0.0:7091") //服务器端口为7091 conn, err := net.ListenUDP("udp", addr) if err != nil { fmt.Println(err) os.Exit(1) } defer conn.Close() for { data := make([]byte, 512) n, remoteAddr, err := conn.ReadFromUDP(data) //获取客户端地址 if err != nil { fmt.Println("f", err) return } var J j json.Unmarshal(data[:n], &J) fmt.Println(J) dev[J.Name] = remoteAddr.String() //客户端注册 if !strings.EqualFold(J.To, "")&& dev[J.To]!="" { outA,_:=json.Marshal(&j{ Name: J.To, Addr: dev[J.To], }) outB,_:=json.Marshal(&j{ Name: J.Name, Addr: remoteAddr.String(), }) conn.WriteToUDP(outA,remoteAddr) adr,_:=net.ResolveUDPAddr("udp",dev[J.To]) conn.WriteToUDP(outB,adr) } } ``` ### 客户端demo ```go type j struct { Name string `json:"name"` Addr string `json:"addr"` To string `json:"to"` } var name = flag.String("name", "", "") //客户端名 var to = flag.String("to", "", "") //要连接的客户端 var msg = flag.String("msg", "", "") //发送消息 var server_ip = flag.String("server", "1.1.1.1", "") //服务器IP var server_port = flag.Int("sport", 9091, "") //服务器端口 flag.Parse() conn, _ := net.ListenUDP("udp", &net.UDPAddr{ IP: net.ParseIP("0.0.0.0"), Port: 9091, }) defer conn.Close() put, _ := json.Marshal(&j{ Name: *name, To: *to, }) conn.WriteToUDP(put, &net.UDPAddr{ IP: net.ParseIP(*server_ip), Port: *server_port, }) res := make([]byte, 128) n, _, _ := conn.ReadFromUDP(res) var J j json.Unmarshal(res[:n], &J) fmt.Println(string(res[:n])) if *to != "" { time.Sleep(1 * time.Second) } adr, _ := net.ResolveUDPAddr("udp", J.Addr) conn.WriteToUDP([]byte("qwe"), adr) n, _, _ = conn.ReadFromUDP(res) fmt.Println(string(res[:n])) ``` 使用： A运行：`./main -name A` B运行：`./main -name B -to A -msg "qwe"` ## 参考 [1] [NAT - wikipedia](https://zh.wikipedia.org/wiki/%E7%BD%91%E7%BB%9C%E5%9C%B0%E5%9D%80%E8%BD%AC%E6%8D%A2) [2] [UDP - wikipedia](https://zh.wikipedia.org/wiki/%E7%94%A8%E6%88%B7%E6%95%B0%E6%8D%AE%E6%8A%A5%E5%8D%8F%E8%AE%AE) [1]: https://rehtt.com/usr/uploads/2021/02/2491971208.jpg [2]: https://rehtt.com/usr/uploads/2021/02/3444258407.jpg ]]> 0 https://rehtt.com/index.php/archives/242/#comments https://rehtt.com/index.php/feed/archives/242/ 【Lua】WOL原理与实现 https://rehtt.com/index.php/archives/239/ https://rehtt.com/index.php/archives/239/ Fri, 26 Feb 2021 13:16:00 +0800 Rehtt 1]。 简单来说，WOL就是通过网络唤醒开启电脑。 ## 原理 支持WOL的主板在通电时会监听并分析同一网络下的广播信息（xxx.xxx.xxx.255），在一般的局域网使用有限广播地址即可（255.255.255.255），当发现了“魔法包”（Magic Packet）就会对其进行解读。 魔法包是以广播的形式发送，作用于当前局域网（LAN），也可以是子网（Subnet）。 ## 魔法包介绍 Magic Packet，是一种广播帧（frame），使用无连接协议，例如：`UDP`，发送的端口没有限制，可以使用任何端口进行发送，但一般约定俗成使用7或9号端口发送。大部分情况下，魔法包在数据链路层（OSI第2层）发送，使用广播地址进行广播，但也可以使用特定IP地址进行发送（OSI第3层）。 ***由于采用的是无连接协议，所以不保证数据包被目标机接收。*** ## 魔法包结构 魔法包最简单的构成是6个十六进制的`255`（ff ff ff ff ff ff）共6字节为数据包的头部标识，后面是目标机的十六进制`MAC`地址，并将`MAC`重复16次，到此数据包共`102`字节。有时数据包内还会紧接着4-6字节的密码信息。这个帧片段可以包含在任何协议中，最常见的是包含在 UDP 中。[2] 例如目标机MAC为：`1a:2b:3c:4d:5e:6f` 6字节头|96字节信息=MAC信息x12|4-6字节密码（可空） -|-|- ff ff ff ff ff ff|1a2b3c4d5e6f 1a2b3c4d5e6f 1a2b3c4d5e6f 1a2b3c4d5e6f 1a2b3c4d5e6f 1a2b3c4d5e6f 1a2b3c4d5e6f 1a2b3c4d5e6f 1a2b3c4d5e6f 1a2b3c4d5e6f 1a2b3c4d5e6f 1a2b3c4d5e6f |密码 ## 代码实现 我是用的是esp8266，刷入NodeMCU固件，是用LUA进行编程实现。 ***NodeMCU编译时起码需要编译`net`和`wifi`两个模块，并正确配置和连上wifi。*** ```LUA mac = '1a2b3c4d5e6f' -- 要进行目标主机的MAC地址 bip = '255.255.255.255' -- 路由器广播地址 head = 'FFFFFFFFFFFF' -- 数据头 head = to(head) mac = to(mac) for i = 1, 16 do head = head .. mac end u = net.createUDPSocket() u:send(1234, bip, head) -- 是用9号端口 u:close() -- 将两个一组字符串表示的十六进制转为十六进制的字符串 -- 'ff'(66 66) -> 0xff -> '.'(255) function to(str) ret = '' for i = 1, string.len(str), 2 do byte = ('0x' .. string.sub(str, 0 + i, 1 + i)) a = tonumber(byte) ret = ret .. string.char(a) end return ret end ``` ## 参考 - [1] [wikipedia](https://zh.wikipedia.org/wiki/%E7%B6%B2%E8%B7%AF%E5%96%9A%E9%86%92) - [2] [网络唤醒（WOL）全解指南：原理篇](https://www.cnblogs.com/zhanggaoxing/p/9657545.html) ]]> 0 https://rehtt.com/index.php/archives/239/#comments https://rehtt.com/index.php/feed/archives/239/ 【python】查看v2ray流量统计脚本 https://rehtt.com/index.php/archives/238/ https://rehtt.com/index.php/archives/238/ Fri, 11 Dec 2020 15:39:00 +0800 Rehtt ] [-c ] [-s ] 默认显示全部用户 -h,--help 显示帮助 -g 显示组的流量 -g A (显示tag:A组的流量) -c 输入v2ray配置文件 -c /etc/v2ray/config.json -s 输入v2ctl api server地址 -s 127.0.0.1:53844 ``` ### 代码 ```python #!/bin/python3 # Created by Rehtt on 2020/12/11 # 查看v2ray多用户流量统计 # 使用前需要开启v2ray自带的统计工具，配置方法：https://guide.v2fly.org/advanced/traffic.html#%E9%85%8D%E7%BD%AE%E7%BB%9F%E8%AE%A1%E5%8A%9F%E8%83%BD # 本脚本使用email作为用户标识，使用tag作为组标识 import re import os import json import getopt import sys v2ConfigFile = '/etc/v2ray/config.json' # v2ray配置文件位置 v2ctlServer = '127.0.0.1:53844' # v2ctl api配置信息 def dataSize(size, i=0): if size > 1e3: size /= 1e3 s = dataSize(size, i+1) else: size = round(size, 2) if i == 1: s = str(size)+'KB' elif i == 2: s = str(size)+'MB' elif i >= 3: s = str(size)+'GB' return s def red(f): return '\033[31m'+f+'\033[0m' def help(): print("v2ray-flow.py [-h] [-g ] [-c ] [-s ]") print("默认显示全部用户\n") print("-h,--help\t显示帮助") print("-g \t显示组的流量") print("\t-g A\t\t(显示tag:A组的流量)\n") # print("-u \t显示单个用户流量") # print("\t-u [email protected]\t(显示email为[email protected]的流量)\n") print("-c \t输入v2ray配置文件") print("\t-c /etc/v2ray/config.json\n") print("-s \t输入v2ctl api server地址") print("\t-s 127.0.0.1:53844") def getDownUp(name, res): i = 0 z = 0 down = 0 up = 0 try: for r in res: i += 1 if name in r: z += 1 if 'downlink' in r: down = dataSize(float(re.sub('\D', '', res[i]))) else: up = dataSize(float(re.sub('\D', '', res[i]))) if z == 2: break except: pass return down, up def main(argv): global v2ctlServer, v2ConfigFile c = '/usr/bin/v2ray/v2ctl api --server={server} StatsService.QueryStats \'pattern: "{q}" reset: false\'' try: opts, args = getopt.getopt(argv, "hg:c:s:u:", ["help"]) except getopt.GetoptError: help() sys.exit(2) q = 'user' G = 0 for opt, arg in opts: if opt in ('-h', '--help'): help() sys.exit() elif opt == '-g': q = arg G = 1 # elif opt == '-u': # q = arg # G = 2 if opt == '-c': v2ConfigFile = arg if opt == '-s': v2ctlServer = arg tags = {} c = c.format(server=v2ctlServer, q=q) res = os.popen(c).readlines() if G == 0: with open(v2ConfigFile, 'r') as f: data = json.load(f) for i in data['inbounds']: if i['tag'] != 'api': emails = [] for email in i['settings']['clients']: emails.append(email['email']) tags[i['tag']] = emails for tag in tags: for email in tags[tag]: down, up = getDownUp(email, res) print('Email:', red(email), '\tTag:'+red(tag)) print('上传:', up, '\t下载:', down, '\n') else: if G==1: print('Tag:', red(q)) down, up = getDownUp(q, res) # else: # print('Email:', red(q)) print('上传:', up, '\t下载:', down, '\n') if __name__ == "__main__": main(sys.argv[1:]) ``` ]]> 0 https://rehtt.com/index.php/archives/238/#comments https://rehtt.com/index.php/feed/archives/238/ 【杂项】PSP作为PC电脑的WiFi手柄 https://rehtt.com/index.php/archives/237/ https://rehtt.com/index.php/archives/237/ Fri, 16 Oct 2020 23:00:00 +0800 Rehtt '硬件和声音' -> 'Parallel Port Joysticks（32位）'）新建虚拟手柄。 新建虚拟手柄： 1. 新建一个虚拟手柄点击`Add...`->`add`。 2. 选中刚刚创建的手柄点击`Mapping...`。 3. 选中`Set a custom mapping for this controller`，点击`下一步`。 4. - `Axes`改为`2`，`Axis 1`和`Axis 2`分别为`X Axis`和`Y Axis` - `Buttons`改为`9` - `POV hats`改为`1`。 5. - `X Axis`为`Analog 0` - `Y Axis`为`Analog 1` 6. 修改 - `Button 1`为`nothing` - `Button 2`为`Digital 0` - `Button 3`为`Digital 1` - `Button 4`为`Digital 2` - `Button 5`为`Digital 3` - `Button 6`为`Digital 4` - `Button 7`为`Digital 5` - `Button 8`为`Digital 11` - `Button 9`为`Digital 10` # 0x02 ## PC 进入`WiFi Controller`解压的文件夹`PC`内，双击执行`Start WiFiServer for Controller 1.bat`（文件夹内其他的bat文件对应其他的虚拟手柄，通过上述`新建虚拟手柄`的方式创建）。 ## PSP 打开PSP，运行`WiFi Controller`，稍等片刻，出现键位示意画面即连接成功。 从PC`控制面板`中的`游戏控制器`->`属性`->`测试`中可以看见具体的映射情况。 # END ]]> 0 https://rehtt.com/index.php/archives/237/#comments https://rehtt.com/index.php/feed/archives/237/ 【Docker】macvlan网络模式下容器与宿主机互通 https://rehtt.com/index.php/archives/236/ https://rehtt.com/index.php/archives/236/ Tue, 08 Sep 2020 22:32:00 +0800 Rehtt 5 https://rehtt.com/index.php/archives/236/#comments https://rehtt.com/index.php/feed/archives/236/ 【树莓派】温控风扇脚本（shell版） https://rehtt.com/index.php/archives/235/ https://rehtt.com/index.php/archives/235/ Sun, 06 Sep 2020 10:59:00 +0800 Rehtt 一个简单的脚本，和python版的一样，只是去除python版的RPi库的依赖。 > 较为完善的是Golang版 配合crontab做定时任务 ```shell #每五分钟执行一次 */5 * * * * /home/pi/fen.sh ``` fen.sh文件 ```shell #!/bin/bash a=$(cat /sys/class/thermal/thermal_zone0/temp) temp=$((a/1000)) pin=14 if [ ! -d "/sys/class/gpio/gpio${pin}" ] then echo $pin > /sys/class/gpio/export fi if [ $temp -lt 50 ] then echo low > /sys/class/gpio/gpio${pin}/direction elif [ $temp -gt 55 ] then echo high > /sys/class/gpio/gpio${pin}/direction fi ``` ]]> 4 https://rehtt.com/index.php/archives/235/#comments https://rehtt.com/index.php/feed/archives/235/ 【算法/图像处理】运动检测--帧间差分法 https://rehtt.com/index.php/archives/233/ https://rehtt.com/index.php/archives/233/ Fri, 24 Jul 2020 18:01:00 +0800 Rehtt 1 https://rehtt.com/index.php/archives/233/#comments https://rehtt.com/index.php/feed/archives/233/ 【杂项】Windows10 深色模式下文件资源管理器有一条白线 https://rehtt.com/index.php/archives/230/ https://rehtt.com/index.php/archives/230/ Tue, 26 May 2020 17:26:00 +0800 Rehtt 1 https://rehtt.com/index.php/archives/230/#comments https://rehtt.com/index.php/feed/archives/230/ 【Golang】使用CGO交叉编译 https://rehtt.com/index.php/archives/227/ https://rehtt.com/index.php/archives/227/ Wed, 08 Apr 2020 18:23:00 +0800 Rehtt 0 https://rehtt.com/index.php/archives/227/#comments https://rehtt.com/index.php/feed/archives/227/
|
{
"url": "https://rehtt.com/index.php/feed/",
"source_domain": "rehtt.com",
"snapshot_id": "crawl=CC-MAIN-2021-17",
"warc_metadata": {
"Content-Length": "42385",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZLVBPG53SXJVOTS7QJHM6OUCJJV7YDFN",
"WARC-Concurrent-To": "<urn:uuid:d5221591-fa4d-4bbe-9eec-9948629337f0>",
"WARC-Date": "2021-04-17T19:39:59Z",
"WARC-IP-Address": "101.200.170.216",
"WARC-Identified-Payload-Type": "application/rss+xml",
"WARC-Payload-Digest": "sha1:C6CMTHAFNCTYKEJNQSR4232SZRC34D7A",
"WARC-Record-ID": "<urn:uuid:bc738e17-a82c-4828-a385-6bc810c1c73b>",
"WARC-Target-URI": "https://rehtt.com/index.php/feed/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9c3e7eb7-34d9-40cf-b8ef-ac5d02b8a710>"
},
"warc_info": "isPartOf: CC-MAIN-2021-17\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-40.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0
],
"line_end_idx": [
14312
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 14312,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.005729460157454014,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.07312735915184021,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04667704179883003,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6365858912467957,
"rps_doc_frac_unique_words": 0.5491113066673279,
"rps_doc_mean_word_length": 9.593077659606934,
"rps_doc_num_sentences": 295,
"rps_doc_symbol_to_word_ratio": 0.018226269632577896,
"rps_doc_unigram_entropy": 5.947051525115967,
"rps_doc_word_count": 1069,
"rps_doc_frac_chars_dupe_10grams": 0.012871770188212395,
"rps_doc_frac_chars_dupe_5grams": 0.032764509320259094,
"rps_doc_frac_chars_dupe_6grams": 0.025353489443659782,
"rps_doc_frac_chars_dupe_7grams": 0.018917599692940712,
"rps_doc_frac_chars_dupe_8grams": 0.012871770188212395,
"rps_doc_frac_chars_dupe_9grams": 0.012871770188212395,
"rps_doc_frac_chars_top_2gram": 0.008776210248470306,
"rps_doc_frac_chars_top_3gram": 0.03159433975815773,
"rps_doc_frac_chars_top_4gram": 0.037445150315761566,
"rps_doc_books_importance": -1758.7567138671875,
"rps_doc_books_importance_length_correction": -1758.7567138671875,
"rps_doc_openwebtext_importance": -1117.843994140625,
"rps_doc_openwebtext_importance_length_correction": -1117.843994140625,
"rps_doc_wikipedia_importance": -1253.1826171875,
"rps_doc_wikipedia_importance_length_correction": -1253.1826171875
},
"fasttext": {
"dclm": 0.9970911145210266,
"english": 0.08799908310174942,
"fineweb_edu_approx": 2.6814255714416504,
"eai_general_math": 0.8366857767105103,
"eai_open_web_math": 0.05202227830886841,
"eai_web_code": 0.9909161329269409
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-1,525,846,894,097,359,400 |
Malcolm Lidierth
-
Active since 2008
Followers: 0 Following: 0
Message
Statistics
All
• Personal Best Downloads Level 2
• First Review
• 5-Star Galaxy Level 5
• First Submission
• 6 Month Streak
• Revival Level 2
• Knowledgeable Level 4
• First Answer
• Solver
View badges
Feeds
View by
Answered
GUI building and memory usage
If you can, re-use figures rather than deleting them.
7 years ago | 0
Answered
how to pass java collection to matlab
Probably simplest to use an array myArray=foos.toArray(); myArray will be a java array of type Object.
8 years ago | 0
Answered
Can you use a Raspberry Pi as (local) CPU core with the Parallel Computing Toolbox and/or Distributed Computing Server?
You can run m-code using Octave on a Pi if that helps. Your bottleneck will likely be data exchange (as e.g. when using a GPU). ...
8 years ago | 0
Answered
Pause function in matlab for 1 millisecond
Pause does more than cause a sleep (see the docs) e.g. it flushes the AWT/Swing EDT. The minimum delay will therefore reflect wh...
8 years ago | 2
Answered
Call MATLAB from java
"I'm developing a software to interact with piano melodies in java using Netbeans IDE 8.0.2" [1] There may be no need to do a...
8 years ago | 0
| accepted
Answered
Matlab Crashes when installing on Mac
Might be an idea to update/revert graphics drivers (????)
8 years ago | 0
| accepted
Answered
Can I disable java console output when using javaMethod?
AFAIK, no - MATLAB uses stderr and stdout. Same as Java.
8 years ago | 0
Answered
Java 1.8 with Matlab 2015b on Windows 7
In Netbeans, edit the Preferences to target Java 1.7 or earlier when you do a build. All should then be OK.
8 years ago | 0
Answered
URGENT... Matlab System::FatalException!!!
MATLAB uses lazy memory allocation. That means that if your code accesses a memory area that it should not (e.g. by incrementing...
10 years ago | 0
Answered
Passing Matrix List to Java Method ,error:No method 'list_method' with matching signature found for class
OK, if you are stuck with a List java-side, you need to create a list MATLAB-side. In MATLAB: * Create a concrete list cla...
10 years ago | 0
Answered
Passing Matrix List to Java Method ,error:No method 'list_method' with matching signature found for class
Try public void list_method(double[] points){ ... } Note that MATLAB vectors/matrices contain doubles by defaul...
10 years ago | 0
| accepted
Answered
Reset JVM to default
R2011b needs - and on Windows is bundled with - Java 6. Either: # delete the MATLAB_JAVA (not JAVA_HOME) environment varia...
10 years ago | 1
| accepted
Question
Publication quality graphics in MATLAB
A Java based graphics package - "Project Waterloo" - is presently being developed to provide good quality anti-aliased graphics ...
10 years ago | 2 answers | 2
2
answers
Answered
Does Matlab have memory leaks?
Garbage collection is done when required, rather than when possible - so the simple loop is not really testing much. Also MA...
10 years ago | 1
| accepted
Answered
Java outofmemoryerror while saving figures
It looks like the save to file is running on the Java Event Despatch Thread (AWT-EventQueue-0)- so Java references will persist...
10 years ago | 1
Answered
Intermittent error accessing Java constant
Strange. What happens if you look it up as: javax.swing.SwingConstants.TRAILING
10 years ago | 0
Answered
Working with unicode paths
Jim MATLAB/Java need to talk to an OS and a file system beneath so this is likely to vary across FAT12/16/32, NTFS etc as wel...
11 years ago | 0
Answered
Viewing Java Objects Data
Try methods(object) You may find getDimension and is* methods that provide access to the fields.
11 years ago | 0
Answered
Where is a list of eventtypes for listeners?
@Matt As the uicontrols use Java under the hood, see the available Java listeners at <http://docs.oracle.com/javase/tutor...
11 years ago | 0
Answered
License files from the FEX
@Jan I find lots of "installation procedure" enquiries also even though clear install instructions are provided. Often that i...
11 years ago | 1
Submitted
Project Waterloo File and Matrix Utilities
Utilities for partial input/output from MATLAB MAT-files, HDF5-files and custom binary files.
11 years ago | 1 download |
Thumbnail
Answered
How to resample a signal by a fraction
Is this any help? % SincResample returns the data convolved with a set of time-shifted windowed sinc functions, one for eac...
11 years ago | 0
Answered
get an error message by running a large code
You are running out of Java heap space. Two solutions: [1] Increase the size of the available heap in MATLAB preferences. ...
11 years ago | 1
| accepted
Answered
How to drop decimal values without rounding off?
959.589-rem(959.589,1)
11 years ago | 0
| accepted
Answered
I am taking Open MIT course. Not registered as a student at the university. How can I get MATLAB?
Or try Octave which is free and open-source but best supported on Linux - runs fine with Debian Wheezy on a Raspberry Pi board w...
11 years ago | 1
Answered
NetCDF or HDF5 or XYZ to provide time series data at the fingertips of the user
@Per I suspect some of the problems with memmapfile might be related to using multiple 128KB memmapfiles. Each requires syste...
11 years ago | 0
Answered
Slow boot: issue with MATLAB and Java at PC startup?
A possibility (maybe): Is on-access system security software scanning and decompressing all those jar files?
11 years ago | 0
Answered
How do I launch a matlab gui from the desktop?
One way might be to launch a Java executable and connect to the MATLAB engine using the Java Matlab Interface via matlabcontrol:...
11 years ago | 0
Answered
MCR incompatibility with Mountain Lion?
It does work on Mountain Lion. Have you installed the Command Line Tools in XCode Preferences (needed in Mountain Lion) and t...
11 years ago | 0
Answered
cell2mat loops & running out of memory
Depending on the MAT-file version, there may be something that could help in: <http://www.mathworks.co.uk/matlabcentral/filee...
11 years ago | 0
Load more
|
{
"url": "https://ch.mathworks.com/matlabcentral/profile/authors/1477",
"source_domain": "ch.mathworks.com",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "129448",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WNBV62AW75ACARMGP3ZVVFVC7IBND7IR",
"WARC-Concurrent-To": "<urn:uuid:4cb47ca3-7061-48c8-a61d-2e567b1c3f20>",
"WARC-Date": "2024-08-06T04:12:45Z",
"WARC-IP-Address": "23.204.195.108",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AANZIWZN77PZBRT2GJN44AJRBC3H63BO",
"WARC-Record-ID": "<urn:uuid:1d4b886d-d7ae-4001-b9ad-ad63981c9e9e>",
"WARC-Target-URI": "https://ch.mathworks.com/matlabcentral/profile/authors/1477",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ee59052c-79f6-499c-8b0c-878632dd00cf>"
},
"warc_info": "isPartOf: CC-MAIN-2024-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-30\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
17,
18,
19,
21,
22,
40,
41,
69,
70,
78,
79,
90,
91,
95,
131,
148,
174,
195,
214,
234,
260,
277,
288,
289,
301,
302,
308,
309,
317,
318,
327,
357,
411,
412,
428,
429,
438,
476,
579,
580,
596,
597,
606,
726,
858,
859,
875,
876,
885,
928,
1060,
1061,
1077,
1078,
1087,
1109,
1238,
1239,
1255,
1256,
1267,
1268,
1277,
1315,
1373,
1374,
1390,
1391,
1402,
1403,
1412,
1469,
1526,
1527,
1543,
1544,
1553,
1593,
1701,
1702,
1718,
1719,
1728,
1771,
1903,
1904,
1921,
1922,
1931,
2037,
2163,
2164,
2181,
2182,
2191,
2297,
2412,
2413,
2430,
2431,
2442,
2443,
2452,
2473,
2599,
2600,
2617,
2618,
2629,
2630,
2639,
2640,
2641,
2680,
2812,
2813,
2842,
2843,
2845,
2846,
2854,
2855,
2864,
2895,
3023,
3024,
3041,
3042,
3053,
3054,
3063,
3106,
3237,
3238,
3255,
3256,
3265,
3308,
3388,
3389,
3406,
3407,
3416,
3443,
3572,
3573,
3590,
3591,
3600,
3626,
3723,
3724,
3741,
3742,
3751,
3796,
3921,
3922,
3939,
3940,
3949,
3976,
4105,
4106,
4123,
4124,
4134,
4135,
4136,
4179,
4273,
4274,
4302,
4303,
4313,
4314,
4323,
4362,
4489,
4490,
4507,
4508,
4517,
4562,
4688,
4689,
4706,
4707,
4718,
4719,
4728,
4777,
4800,
4801,
4818,
4819,
4830,
4831,
4840,
4938,
5070,
5071,
5088,
5089,
5098,
5178,
5307,
5308,
5325,
5326,
5335,
5388,
5497,
5498,
5515,
5516,
5525,
5572,
5704,
5705,
5722,
5723,
5732,
5772,
5901,
5902,
5919,
5920,
5929,
5968,
6097,
6098,
6115,
6116
],
"line_end_idx": [
17,
18,
19,
21,
22,
40,
41,
69,
70,
78,
79,
90,
91,
95,
131,
148,
174,
195,
214,
234,
260,
277,
288,
289,
301,
302,
308,
309,
317,
318,
327,
357,
411,
412,
428,
429,
438,
476,
579,
580,
596,
597,
606,
726,
858,
859,
875,
876,
885,
928,
1060,
1061,
1077,
1078,
1087,
1109,
1238,
1239,
1255,
1256,
1267,
1268,
1277,
1315,
1373,
1374,
1390,
1391,
1402,
1403,
1412,
1469,
1526,
1527,
1543,
1544,
1553,
1593,
1701,
1702,
1718,
1719,
1728,
1771,
1903,
1904,
1921,
1922,
1931,
2037,
2163,
2164,
2181,
2182,
2191,
2297,
2412,
2413,
2430,
2431,
2442,
2443,
2452,
2473,
2599,
2600,
2617,
2618,
2629,
2630,
2639,
2640,
2641,
2680,
2812,
2813,
2842,
2843,
2845,
2846,
2854,
2855,
2864,
2895,
3023,
3024,
3041,
3042,
3053,
3054,
3063,
3106,
3237,
3238,
3255,
3256,
3265,
3308,
3388,
3389,
3406,
3407,
3416,
3443,
3572,
3573,
3590,
3591,
3600,
3626,
3723,
3724,
3741,
3742,
3751,
3796,
3921,
3922,
3939,
3940,
3949,
3976,
4105,
4106,
4123,
4124,
4134,
4135,
4136,
4179,
4273,
4274,
4302,
4303,
4313,
4314,
4323,
4362,
4489,
4490,
4507,
4508,
4517,
4562,
4688,
4689,
4706,
4707,
4718,
4719,
4728,
4777,
4800,
4801,
4818,
4819,
4830,
4831,
4840,
4938,
5070,
5071,
5088,
5089,
5098,
5178,
5307,
5308,
5325,
5326,
5335,
5388,
5497,
5498,
5515,
5516,
5525,
5572,
5704,
5705,
5722,
5723,
5732,
5772,
5901,
5902,
5919,
5920,
5929,
5968,
6097,
6098,
6115,
6116,
6125
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6125,
"ccnet_original_nlines": 234,
"rps_doc_curly_bracket": 0.00032652998925186694,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2563091516494751,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04022081941366196,
"rps_doc_frac_lines_end_with_ellipsis": 0.08510638028383255,
"rps_doc_frac_no_alph_words": 0.25946372747421265,
"rps_doc_frac_unique_words": 0.4537131190299988,
"rps_doc_mean_word_length": 4.763988018035889,
"rps_doc_num_sentences": 78,
"rps_doc_symbol_to_word_ratio": 0.01813879981637001,
"rps_doc_unigram_entropy": 5.471307754516602,
"rps_doc_word_count": 983,
"rps_doc_frac_chars_dupe_10grams": 0.044843051582574844,
"rps_doc_frac_chars_dupe_5grams": 0.1385863870382309,
"rps_doc_frac_chars_dupe_6grams": 0.055947039276361465,
"rps_doc_frac_chars_dupe_7grams": 0.044843051582574844,
"rps_doc_frac_chars_dupe_8grams": 0.044843051582574844,
"rps_doc_frac_chars_dupe_9grams": 0.044843051582574844,
"rps_doc_frac_chars_top_2gram": 0.051249198615550995,
"rps_doc_frac_chars_top_3gram": 0.04035874083638191,
"rps_doc_frac_chars_top_4gram": 0.05808243155479431,
"rps_doc_books_importance": -708.3680419921875,
"rps_doc_books_importance_length_correction": -708.3680419921875,
"rps_doc_openwebtext_importance": -438.0162658691406,
"rps_doc_openwebtext_importance_length_correction": -438.0162658691406,
"rps_doc_wikipedia_importance": -315.95025634765625,
"rps_doc_wikipedia_importance_length_correction": -315.95025634765625
},
"fasttext": {
"dclm": 0.01821368932723999,
"english": 0.8452989459037781,
"fineweb_edu_approx": 2.067676067352295,
"eai_general_math": 0.12802451848983765,
"eai_open_web_math": 0.17471665143966675,
"eai_web_code": 0.008343519642949104
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-3,728,314,697,063,859,700 |
Changes between Version 4 and Version 5 of Yocto/Building
Ignore:
Timestamp:
01/15/2018 11:15:10 AM (6 weeks ago)
Author:
Tim Harvey
Comment:
convert restored html to wiki markup
Legend:
Unmodified
Added
Removed
Modified
• Yocto/Building
v4 v5
1 {{{#!html
2 <div id="wikipage" class="trac-content"><p>
3 </p><div class="wiki-toc">
4 <ol>
5 <li>
6 <a href="#BuildingYoctoInstallingfortheGateworksVentanaFamily">Building Yocto & Installing for the Gateworks Ventana Family</a>
7 </li>
8 <li>
9 <a href="#Pre-CompiledYoctoBinaries">Pre-Compiled Yocto Binaries</a>
10 </li>
11 <li>
12 <a href="#ObtainingandCompilingtheSourceCode">Obtaining and Compiling the Source Code</a>
13 <ol>
14 <li>
15 <a href="#Troubleshootingbuildfailures">Troubleshooting build failures</a>
16 <ol>
17 <li>
18 <a href="#Fetchfailure">Fetch failure</a>
19 </li>
20 <li>
21 <a href="#UpstreamBreakage">Upstream Breakage</a>
22 </li>
23 </ol>
24 </li>
25 <li>
26 <a href="#Keepinguptodateandorpinningsourcewithrepo">Keeping up to date and/or pinning source with repo</a>
27 </li>
28 <li>
29 <a href="#Updatingandrebuilding">Updating and rebuilding</a>
30 </li>
31 <li>
32 <a href="#Diskusageandkeepingthingsclean">Disk usage and keeping things clean</a>
33 </li>
34 <li>
35 <a href="#BuildingUpdatingAddingPackages">Building / Updating / Adding Packages</a>
36 </li>
37 <li>
38 <a href="#BuildingatoolchainandorSDK">Building a toolchain and/or SDK</a>
39 </li>
40 <li>
41 <a href="#Otherusefullinks">Other useful links</a>
42 </li>
43 </ol>
44 </li>
45 <li>
46 <a href="#InstallingFirmware">Installing Firmware</a>
47 <ol>
48 <li>
49 <a href="#NANDFLASH">NAND FLASH</a>
50 </li>
51 <li>
52 <a href="#InstallingonRemovablestorage:mSATAUSBuSD">Installing on Removable storage: mSATA/USB/uSD</a>
53 </li>
54 </ol>
55 </li>
56 </ol>
57 </div><p>
58 </p>
59 <p>
60 <strong>NOTE</strong> In conjunction with the Yocto BSP, please be sure to use the latest bootloader for proper operation. <a class="wiki" href="/wiki/ventana/bootloader#PreBuiltBootloader">Bootloader Instructions Here</a>
61 </p>
62 <h1 id="BuildingYoctoInstallingfortheGateworksVentanaFamily">Building Yocto & Installing for the Gateworks Ventana Family</h1>
63 <p>
1[[PageOutline]]
2
3**NOTE** In conjunction with the Yocto BSP, please be sure to use the latest bootloader for proper operation. You can find Bootloader Instructions [wiki:ventana/bootloader#PreBuiltBootloader here].
4
5= Building Yocto & Installing for the Gateworks Ventana Family =
646The following versions of Yocto are supported:
65 </p>
66 <ul><li>Yocto v2.3 (Pyro) Poky 17.0 released on 05/24/2017 (<strong>Recommended</strong>)
67 <ul><li>using the gateworks_fslc_3.14_1.0.x_ga kernel
68 </li><li><strong>Considered stable</strong>
69 </li></ul></li></ul><p>
70 </p><div> <h3 class="foldable">Old Releases</h3><div><p>
71 </p>
72 <ul><li>Yocto v1.8 (Fido) Poky 13.0 released on 02/23/2016
73 <ul><li>using the gateworks_fslc_3.14_1.0.x_ga kernel
74 </li></ul></li><li>Yocto v1.7 (Dizzy) Poky 12.0 released on 02/25/2015
75 <ul><li>using the gateworks_3.10.17_1.0.0_ga kernel
76 </li></ul></li><li>Yocto v1.6 (Daisy) Poky 11.0 released on 4/25/2014
77 <ul><li>using the gateworks_3.10.17_1.0.0_ga kernel
78 </li></ul></li></ul><p>
79 </div></div>
80 </p>
81 <p>
7 * Yocto v2.3 (Pyro) Poky 17.0 released on 05/24/2017 (Recommended)
8 - using the gateworks_fslc_3.14_1.0.x_ga kernel
9 - **Considered stable**
10
11[[CollapsibleStart(Old Releases)]]
12 * Yocto v1.8 (Fido) Poky 13.0 released on 02/23/2016
13 - using the gateworks_fslc_3.14_1.0.x_ga kernel
14 * Yocto v1.7 (Dizzy) Poky 12.0 released on 02/25/2015
15 - using the gateworks_3.10.17_1.0.0_ga kernel
16 * Yocto v1.6 (Daisy) Poky 11.0 released on 4/25/2014
17 - using the gateworks_3.10.17_1.0.0_ga kernel
18[[CollapsibleEnd]]
19
8220The Gateworks Ventana Yocto BSP provides a layer of package recipes that replace or override recipes in the upstream Yocto project such as:
83 </p>
84 <ul><li>kernel
85 </li><li>bootloader
86 </li><li>filesystem images
87 </li><li>support utilities
88 </li></ul><p>
21 * kernel
22 * bootloader
23 * filesystem images
24 * support utilities
25
8926For details on Yocto releases please see:
90 </p>
91 <ul><li><a class="ext-link" href="https://wiki.yoctoproject.org/wiki/Releases"><span class="icon"></span>https://wiki.yoctoproject.org/wiki/Releases</a>
92 </li></ul><p>
93 <span class="wikianchor" id="prebuilt"></span>
94 </p>
95 <h1 id="Pre-CompiledYoctoBinaries">Pre-Compiled Yocto Binaries</h1>
96 <p>
27 * https://wiki.yoctoproject.org/wiki/Releases
28
29
30= Pre-Compiled Yocto Binaries =
9731For convenience Gateworks has some pre-built ubi files available. Note that you need to download a UBI image appropriate for the FLASH size on your board. Gateworks Ventana boards come with either 256MB NAND Flash or 1GB/2GB NAND Flash. You can see the size output from the bootloader over the serial console.
98 </p>
99 <p>
100 <strong> <a class="wiki" href="/wiki/Yocto/Building#InstallingFirmware">Installation instructions here</a> </strong>
101 </p>
102 <p>
32
33Installation instructions here
34
10335Most recent releases:
104 </p>
105 <ul><li>Yocto 2.3 (Pyro) 20170524:
106 <ul><li>Multimedia: (supports gstreamer video in/out encode/decode, but no GUI desktop)
107 <ul>
108 <li><a class="ext-link" href="http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-2.3_20170524183825_normal.rootfs.ubi"><span class="icon"></span>ubi 256MB FLASH</a> (sha256sum:e2b41e2ab9d0c7829996249b1bf04cb902cbdc1d300a1d4411d9f96540a2f91a)
109 </li>
110 <li><a class="ext-link" href="http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-2.3_20170524183825_large.rootfs.ubi"><span class="icon"></span>ubi 1GB/2GB FLASH</a> (sha256sum:055b7644b1db05b96e33f948e1f314d39e7745fb1fd08dab248fe39f975c6eb2)
111 </li><li><a class="ext-link" href="http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-2.3_20170524183825.rootfs.tar.bz2"><span class="icon"></span>rootfs tarball</a> (sha256sum:aa8db12b24a091db994d5cba1357e608b03be71c947a040954d70bd0ce7636d4)
112 </li></ul></li>
113
114 </p><div> <h3 class="foldable">Old Releases</h3><div><p>
115 </p>
116 <ul>
117
118 <li>Yocto 1.8.2 (Fido) 20160328-1730:
119 <ul><li>Multimedia: (supports gstreamer video in/out encode/decode, but no GUI desktop)
120 <ul><li><a class="ext-link" href="http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-20160328-1730_normal-ubi"><span class="icon"></span>ubi 256MB FLASH</a> (sha256sum:a012d6ffb287221e686de973870e4232fe54f08d208f9ce5a436933ecff02606)
121 </li><li><a class="ext-link" href="http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana_large-ubi"><span class="icon"></span>ubi 1GB/2GB FLASH</a> (sha256sum:be735f02f0a68b9cca797cd62e71b9de2ecea3ab6e64c23e3406b175c160f25a)
122 </li><li><a class="ext-link" href="http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-tar-bz2"><span class="icon"></span>rootfs tarball</a> (sha256sum:94734c2c442427deb1df537d1da9abebb9b6e5dab2891c3a35e8ac200540dd07)
123 </li></ul></li><li>GUI: (supports gstreamer video in/out encode/decode and SATO X11 desktop with Matchbox window manager and Midori web browser)
124 <ul><li><a class="ext-link" href="http://blog.gateworks.com/?wpdmpro=gateworks-image-gui-ventana_large-ubi"><span class="icon"></span>ubi 1GB/2GB FLASH</a> (sha256sum:96d229507a82022a9da7e91998b55dea706619c09548821d69712b97dc76919a)
125 </li><li><a class="ext-link" href="http://blog.gateworks.com/?wpdmpro=gateworks-image-gui-ventana-tar-bz2"><span class="icon"></span>rootfs tarball</a> (sha256sum:12aecb6b2e38ba9f55c1986e8bb27c057521f96be1cb63227748db4cf3e8e7a3)
126 </li></ul></li></ul></li>
127
128 <li>Yocto 1.8.1 (Fido) 20160223-1730:
129 <ul><li>Multimedia:
130 <ul><li><a class="ext-link" href="http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-1.8.1_20160224031410_normal.rootfs.ubi"><span class="icon"></span>ubi 256MB FLASH</a> (sha256sum:c1ecd3a4b9406d9274e89de94a2c76486d2440fefc0588feb495c0d021944697)
131 </li><li><a class="ext-link" href="http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-1.8.1_20160224031410_large.rootfs.ubi"><span class="icon"></span>ubi 1GB/2GB FLASH</a> (sha256sum:d156c12c8973f21400ed8a9f374a8727284c776abba34c5b4cebfbce46997141)
132 </li><li><a class="ext-link" href="http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-1.8.1_20160224031410.rootfs.tar.bz2"><span class="icon"></span>rootfs tarball</a> (sha256sum:d17b603d3f81aad31aa4e642a03cf057c1ba21726d51f929fe027283d70624cf)
133 </li></ul></li></ul></li></ul></li>
134
135 <li>Yocto 1.7.1 (Dizzy) 20150904-1730:
136 <ul><li>Multimedia:
137 <ul><li><a class="ext-link" href="http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-2.3_20170524183825_normal.rootfs.ubi"><span class="icon"></span>ubi 256MB FLASH</a> (sha256sum:e2b41e2ab9d0c7829996249b1bf04cb902cbdc1d300a1d4411d9f96540a2f91a)
138 </li><li><a class="ext-link" href="http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-2.3_20170524183825_large.rootfs.ubi"><span class="icon"></span>ubi 1GB/2GB FLASH</a> (sha256sum:055b7644b1db05b96e33f948e1f314d39e7745fb1fd08dab248fe39f975c6eb2)
139 </li><li><a class="ext-link" href="http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-2.3_20170524183825.rootfs.tar.bz2"><span class="icon"></span>rootfs tarball</a> (sha256sum:aa8db12b24a091db994d5cba1357e608b03be71c947a040954d70bd0ce7636d4)
140 </li></ul></li></ul></li></ul></li>
141
142 <li>Yocto 1.6.2 (Daisy) 20150221_0538:
143 <ul><li>Multimedia:
144 <ul><li><a class="ext-link" href="http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-1.6.2_20150221_0538_normal.ubi"><span class="icon"></span>ubi 256MB FLASH</a> (sha256sum:c05a6cca542bd2004cf51bc161d5c73b1e63322a9a543c6f566a8e876ec9274a)
145 </li><li><a class="ext-link" href="http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-1.6.2_20150221_0538_large.ubi"><span class="icon"></span>ubi 1GB/2GB FLASH</a> (sha256sum:10b27d97025df0c389972995497381a5e8e15beb79915f35c760aa0439370b7a)
146 </li><li><a class="ext-link" href="http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-1.6.2_20150221_0538.rootfs.tar.bz2"><span class="icon"></span>rootfs tarball</a> (sha256sum:b383e6bcc4543719423c318cae588897fde36d5f68f4b1f989054bd287f7557b)
147 </li></ul></li></li></ul></li></ul>
36 * Yocto 2.3 (Pyro) 20170524:
37 - Multimedia: (supports gstreamer video in/out encode/decode, but no GUI desktop)
38 * [http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-2.3_20170524183825_normal.rootfs.ubi ubi 256MB FLASH] (sha256sum:e2b41e2ab9d0c7829996249b1bf04cb902cbdc1d300a1d4411d9f96540a2f91a)
39 * [http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-2.3_20170524183825_large.rootfs.ubi ubi 1GB/2GB FLASH] (sha256sum:055b7644b1db05b96e33f948e1f314d39e7745fb1fd08dab248fe39f975c6eb2)
40 * [http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-2.3_20170524183825.rootfs.tar.bz2 rootfs tarball] (sha256sum:aa8db12b24a091db994d5cba1357e608b03be71c947a040954d70bd0ce7636d4)
41
42[[CollapsibleStart(Old Releases)]]
43 * Yocto 1.8.2 (Fido) 20160328-1730:
44 - Multimedia: (supports gstreamer video in/out encode/decode, but no GUI desktop)
45 * [http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-20160328-1730_normal-ubi ubi 256MB FLASH] (sha256sum:a012d6ffb287221e686de973870e4232fe54f08d208f9ce5a436933ecff02606)
46 * [http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana_large-ubi ubi 1GB/2GB FLASH] (sha256sum:be735f02f0a68b9cca797cd62e71b9de2ecea3ab6e64c23e3406b175c160f25a)
47 * [http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-tar-bz2 rootfs tarball] (sha256sum:94734c2c442427deb1df537d1da9abebb9b6e5dab2891c3a35e8ac200540dd07)
48 - GUI: (supports gstreamer video in/out encode/decode and SATO X11 desktop with Matchbox window manager and Midori web browser)
49 * [http://blog.gateworks.com/?wpdmpro=gateworks-image-gui-ventana_large-ubi ubi 1GB/2GB FLASH] (sha256sum:96d229507a82022a9da7e91998b55dea706619c09548821d69712b97dc76919a)
50 * [http://blog.gateworks.com/?wpdmpro=gateworks-image-gui-ventana-tar-bz2 rootfs tarball] (sha256sum:12aecb6b2e38ba9f55c1986e8bb27c057521f96be1cb63227748db4cf3e8e7a3)
51 * Yocto 1.8.1 (Fido) 20160223-1730:
52 - Multimedia:
53 * [http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-1.8.1_20160224031410_normal.rootfs.ubi ubi 256MB FLASH] (sha256sum:c1ecd3a4b9406d9274e89de94a2c76486d2440fefc0588feb495c0d021944697)
54 * [http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-1.8.1_20160224031410_large.rootfs.ubi ubi 1GB/2GB FLASH] (sha256sum:d156c12c8973f21400ed8a9f374a8727284c776abba34c5b4cebfbce46997141)
55 * [http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-1.8.1_20160224031410.rootfs.tar.bz2 rootfs tarball] (sha256sum:d17b603d3f81aad31aa4e642a03cf057c1ba21726d51f929fe027283d70624cf)
56 * Yocto 1.7.1 (Dizzy) 20150904-1730:
57 - Multimedia:
58 * [http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-2.3_20170524183825_normal.rootfs.ubi ubi 256MB FLASH] (sha256sum:e2b41e2ab9d0c7829996249b1bf04cb902cbdc1d300a1d4411d9f96540a2f91a)
59 * [http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-2.3_20170524183825_large.rootfs.ubi ubi 1GB/2GB FLASH] (sha256sum:055b7644b1db05b96e33f948e1f314d39e7745fb1fd08dab248fe39f975c6eb2)
60 * [http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-2.3_20170524183825.rootfs.tar.bz2 rootfs tarball] (sha256sum:aa8db12b24a091db994d5cba1357e608b03be71c947a040954d70bd0ce7636d4)
61 * Yocto 1.6.2 (Daisy) 20150221_0538:
62 - Multimedia:
63 * [http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-1.6.2_20150221_0538_normal.ubi ubi 256MB FLASH] (sha256sum:c05a6cca542bd2004cf51bc161d5c73b1e63322a9a543c6f566a8e876ec9274a)
64 * [http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-1.6.2_20150221_0538_large.ubi ubi 1GB/2GB FLASH] (sha256sum:10b27d97025df0c389972995497381a5e8e15beb79915f35c760aa0439370b7a)
65 * [http://blog.gateworks.com/?wpdmpro=gateworks-image-multimedia-ventana-1.6.2_20150221_0538.rootfs.tar.bz2 rootfs tarball] (sha256sum:b383e6bcc4543719423c318cae588897fde36d5f68f4b1f989054bd287f7557b)
66[[CollapsibleEnd]]
14867
14968Version History:
150 </p>
151 <ul><li>Yocto v2.3:
152 <ul><li>Yocto 2.3 (Pyro) 20170524:
153
154 <ul><li>kernel: <a class="ext-link" href="https://github.com/Gateworks/linux-imx6/tree/3ae25e0dd3134b8f49270eee3b4a49733ff7eb05"><span class="icon"></span>3.14.48-1.0.x_ga+yocto+g3ae25e0</a>
155
156 </li><li>wireless drivers from linux-backports: 20160122
157
158
159 </li></ul></li></ul></li></ul><p>
160 </p><div> <h3 class="foldable">Older History</h3><div><p>
161 </p>
162 <ul><li>Yocto v1.8:
163 <ul><li>Yocto 1.8.2 (Fido) 20160328-1730:
164 <ul><li>kernel: <a class="ext-link" href="https://github.com/Gateworks/linux-imx6/tree/3ae25e0dd3134b8f49270eee3b4a49733ff7eb05"><span class="icon"></span>3.14.48-1.0.x_ga+yocto+g3ae25e0</a>
165 </li><li>wireless drivers from linux-backports: 20160122
166 </li></ul></li></ul>
167
168 <ul><li>Yocto 1.8.1 (Fido) 20160223-1730:
169 <ul><li>kernel: 3.14.48-1.0.x_ga+yocto+g7a5ffca6
170 </li><li>wireless drivers from linux-backports: 20150129
171 </li><li>fixed: gsc_update no longer erases user EEPROM data
172 </li><li>fixed: VPU firmware update to resolve various encoding timeouts
173 </li><li>fixed: FEC ethernet tx queue stalls
174 </li><li>fixed: NAND stability issue
175 </li><li>fixed: PWM pinmux
176 </li><li>fixed: mxc_v4l2_capture initialization
177 </li><li>fixed: reboot fix for GW5100 A/B revisions
178 </li><li>updated: bootscript updated to v1.06 to remove LVDS display detection
179 </li><li>added: added user controllable quality steps to gst-variable-rtsp-server
180 </li><li>added: gpsd
181 </li><li>added: crda
182 </li><li>added: ethtool
183 </li><li>added: hostapd-conf
184 </li><li>added: SPI for GW522x
185 </li><li>added: USB serial drivers
186 </li><li>added: 7" LVDS display touchscreen controller (gt9x)
187 </li><li>added: use GSC for power-down and restart
188 </li></ul></li>
189
190 <li>Yocto 1.8 (Fido) 20150904-2139:
191 <ul><li>Initial Gateworks Yocto v1.8 release
192 </li><li>kernel: 3.14.48-1.0.x_ga+yocto+g4ba0a59
193 </li><li>wireless drivers from linux-backports: 20150129
194 <ul><li>much improved ath10k performance/support including adhoc
195 </li></ul></li><li>added gstreamer 1.0 / gstreamer-imx
196 </li><li>added avc8000 8x D1 miniPCIe capture card support
197 </li><li>added gsc-update
198 </li><li>added uboot-envtools
199 </li><li>added gwsoc (GW16113) support)
200 </li></ul></li></ul></li><li>Yocto v1.7:
201 <ul><li>Yocto 1.7.1 (Dizzy) 20150904-1730:
202 <ul><li>kernel: 3.10.17-1.0.0_ga+yocto+g4078cea
203 </li><li>wireless drivers from linux-backports: 20141221
204 </li><li>default to ldo-enabled mode
205 </li><li>i2c: add retries on i2c nak's
206 </li><li>gsc: fix gsc hwmon negative temperature readings
207 </li><li>video: mxc: add support for HDMI interlace out
208 </li><li>add UHS-I support
209 </li><li>enable SATA_AHCI support
210 </li><li>enable PCA953x IRQ
211 </li><li>update IMX6SDL voltage set-points
212 </li><li>disable PCIe Gen2
213 </li><li>imx-thermal: set thresholds based on CPU temperature grade
214 </li><li>tda1997x: default to yuv422smp capture mode for 1080p60Hz
215 </li><li>tda1997x: fixed ITU709 colorimetry colorspace conversion
216 </li><li>sgtl5000: fix audio pop
217 </li></ul></li><li>Yocto 1.7.1 (Dizzy) 20150221-0225:
218 <ul><li>Initial Gateworks Yocto v1.7 release
219 </li><li>kernel: 3.10.17-1.0.0_ga+yocto+g4d177f6
220 </li></ul></li></ul></li><li>Yocto v1.6:
221 <ul><li>Yocto 1.6.2 - 20150221_0538:
222 <ul><li>added support for GW551x, GW552x
223 </li><li>added cryptodev module
224 </li><li>wireless drivers:
225 <ul><li>updated drivers to compat-wireless_20141221
226 </li><li>use internal regdb
227 </li></ul></li><li>kernel: 3.10.17-1.0.0_ga+yocto+g4d177f6
228 <ul><li>added support for DLC800FIGT3 8in XGA (1024x768) capacitive multi-touch touchscreen
229 </li><li>added support for DLC700JMGT4 7in WSVGA (1024x600) capacitive multi-touch touchscreens
230 </li><li>bumped IMX6Q/IMX6DL operating point voltages for VDD_ARM/VDD_SOC
231 </li><li>added GSC drivers (Watchdog / Input)
232 </li><li>fix gpio input state detect for PCA953x port expanders
233 </li><li>added support for GW551x, GW552x
234 </li><li>HDMI input:
235 <ul><li>fixed EDID handling
236 </li><li>add supoprt for HDMI input in 16bit YUV422 mode (requires alternate device-tree configuration)
237 </li><li>fix audio output format details and constrain samplerate
238 </li></ul></li><li>disable IMX6 busfreq driver
239 </li><li>add i210 support
240 </li><li>add GW16103 support
241 </li><li>GW51xx: fix invalid PPS gpio
242 </li><li>disable evbug driver
243 </li><li>add LTC3676 PMIC support and ldo-bypass mode for GW53xx/GW52xx/GW51xx/GW551x/GW552x) (lowers overall power-reduction and thermal envelope)
244 </li></ul></li></ul></li><li>Yocto 1.6.1 - 20141024:
245 <ul><li>kernel: 3.10.17-1.0.0_ga+yocto+gb5914e9
246 </li><li>occasional PCIe link issue resolved
247 </li><li>video sink issue resolved for same resolution input/output
248 </li><li>dual-display HDMI+CVBS fixed
249 </li><li>GW16082 support fixed
250 </li><li>PCIe IRQ slot mapping issue fixed
251 </li><li>GW5400 stability issue fixed
252 </li></ul></li></ul></li></ul><p>
253 </div></div>
254 </p>
255 <p>
256 For instructions on flashing UBI files, please see <a class="wiki" href="/wiki/Yocto/Building#NANDFlash">this section</a>.
257 </p>
258 <p>
259 <span class="wikianchor" id="build"></span>
260 </p>
261 <h1 id="ObtainingandCompilingtheSourceCode">Obtaining and Compiling the Source Code</h1>
262 <p>
69 * Yocto v2.3:
70 - Yocto 2.3 (Pyro) 20170524:
71 - kernel: 3.14.48-1.0.x_ga+yocto+g3ae25e0
72 - wireless drivers from linux-backports: 20160122
73
74[[CollapsibleStart(Old Releases)]]
75 * Yocto v1.8:
76 - Yocto 1.8.2 (Fido) 20160328-1730:
77 - kernel: 3.14.48-1.0.x_ga+yocto+g3ae25e0
78 - wireless drivers from linux-backports: 20160122
79 - Yocto 1.8.1 (Fido) 20160223-1730:
80 - kernel: 3.14.48-1.0.x_ga+yocto+g7a5ffca6
81 - wireless drivers from linux-backports: 20150129
82 - fixed: gsc_update no longer erases user EEPROM data
83 - fixed: VPU firmware update to resolve various encoding timeouts
84 - fixed: FEC ethernet tx queue stalls
85 - fixed: NAND stability issue
86 - fixed: PWM pinmux
87 - fixed: mxc_v4l2_capture initialization
88 - fixed: reboot fix for GW5100 A/B revisions
89 - updated: bootscript updated to v1.06 to remove LVDS display detection
90 - added: added user controllable quality steps to gst-variable-rtsp-server
91 - added: gpsd
92 - added: crda
93 - added: ethtool
94 - added: hostapd-conf
95 - added: SPI for GW522x
96 - added: USB serial drivers
97 - added: 7" LVDS display touchscreen controller (gt9x)
98 - added: use GSC for power-down and restart
99 - Yocto 1.8 (Fido) 20150904-2139:
100 - Initial Gateworks Yocto v1.8 release
101 - kernel: 3.14.48-1.0.x_ga+yocto+g4ba0a59
102 - wireless drivers from linux-backports: 20150129
103 - much improved ath10k performance/support including adhoc
104 - added gstreamer 1.0 / gstreamer-imx
105 - added avc8000 8x D1 miniPCIe capture card support
106 - added gsc-update
107 - added uboot-envtools
108 - added gwsoc (GW16113) support)
109 * Yocto v1.7:
110 - Yocto 1.7.1 (Dizzy) 20150904-1730:
111 - kernel: 3.10.17-1.0.0_ga+yocto+g4078cea
112 - wireless drivers from linux-backports: 20141221
113 - default to ldo-enabled mode
114 - i2c: add retries on i2c nak's
115 - gsc: fix gsc hwmon negative temperature readings
116 - video: mxc: add support for HDMI interlace out
117 - add UHS-I support
118 - enable SATA_AHCI support
119 - enable PCA953x IRQ
120 - update IMX6SDL voltage set-points
121 - disable PCIe Gen2
122 - imx-thermal: set thresholds based on CPU temperature grade
123 - tda1997x: default to yuv422smp capture mode for 1080p60Hz
124 - tda1997x: fixed ITU709 colorimetry colorspace conversion
125 - sgtl5000: fix audio pop
126 - Yocto 1.7.1 (Dizzy) 20150221-0225:
127 - Initial Gateworks Yocto v1.7 release
128 - kernel: 3.10.17-1.0.0_ga+yocto+g4d177f6
129 * Yocto v1.6:
130 - Yocto 1.6.2 - 20150221_0538:
131 - added support for GW551x, GW552x
132 - added cryptodev module
133 - wireless drivers:
134 - updated drivers to compat-wireless_20141221
135 - use internal regdb
136 - kernel: 3.10.17-1.0.0_ga+yocto+g4d177f6
137 - added support for DLC800FIGT3 8in XGA (1024x768) capacitive multi-touch touchscreen
138 - added support for DLC700JMGT4 7in WSVGA (1024x600) capacitive multi-touch touchscreens
139 - bumped IMX6Q/IMX6DL operating point voltages for VDD_ARM/VDD_SOC
140 - added GSC drivers (Watchdog / Input)
141 - fix gpio input state detect for PCA953x port expanders
142 - added support for GW551x, GW552x
143 - HDMI input:
144 * fixed EDID handling
145 * add supoprt for HDMI input in 16bit YUV422 mode (requires alternate device-tree configuration)
146 - fix audio output format details and constrain samplerate
147 - disable IMX6 busfreq driver
148 - add i210 support
149 - add GW16103 support
150 - GW51xx: fix invalid PPS gpio
151 - disable evbug driver
152 - add LTC3676 PMIC support and ldo-bypass mode for GW53xx/GW52xx/GW51xx/GW551x/GW552x) (lowers overall power-reduction and thermal envelope)
153 - Yocto 1.6.1 - 20141024:
154 - kernel: 3.10.17-1.0.0_ga+yocto+gb5914e9
155 - occasional PCIe link issue resolved
156 - video sink issue resolved for same resolution input/output
157 - dual-display HDMI+CVBS fixed
158 - GW16082 support fixed
159 - PCIe IRQ slot mapping issue fixed
160 - GW5400 stability issue fixed
161[[CollapsibleEnd]]
162
163For instructions on flashing UBI files, please see [wiki:Yocto/Building#NANDFlash this section].
164
165
166= Obtaining and Compiling the Source Code =
263167The following build instructions refer to Debian GNU/Linux 7.4 and Ubuntu 12.04 - 15.10.
264 </p>
265 <p>
168
266169Please make sure the following packages are installed
267 </p>
268 <div class="code"><pre>sudo apt-get install chrpath libsdl-dev texinfo curl build-essential git subversion diffstat gawk
269 </pre></div><ol><li>fetch the <tt>repo</tt> tool (if you don't have it already in your path):
270 <div class="code"><pre>mkdir ~/bin
271 curl http://commondatastorage.googleapis.com/git-repo-downloads/repo > ~/bin/repo
170{{{#!bash
171sudo apt-get install chrpath libsdl-dev texinfo curl build-essential git subversion diffstat gawk
172}}}
173
174Instructions:
1751. fetch the repo tool (if you don't have it already in your path):
176{{{#!bash
177mkdir ~/bin
178curl http://commondatastorage.googleapis.com/git-repo-downloads/repo > ~/bin/repo
272179chmod a+x ~/bin/repo
273 </pre></div></li></ol><ol start="2"><li>Setup source repos:
274 <div class="code"><pre><span class="nv">PATH</span><span class="o">=</span><span class="k">${</span><span class="nv">PATH</span><span class="k">}</span>:~/bin
180}}}
181
1822. Setup source repos:
183{{{#!bash
184PATH=${PATH}:~/bin
275185mkdir ~/ventana-yocto
276 <span class="nb">cd </span>ventana-yocto
186cd ventana-yocto
277187repo init -u https://github.com/Gateworks/gateworks-yocto-bsp-platform -b fido
278 </pre></div><ul><li>in the above command <tt>fido</tt> is the name of the branch that refers to Yocto v1.8
279 </li></ul></li></ol><ol start="3"><li>(optional) pin the repo versions to the latest version which was known to have been successfully built by the Gateworks nightly build server:
280 <div class="code"><pre>wget http://dev.gateworks.com/yocto/1.8/snapshot.xml <span class="c"># fetch the pinned manifest from the last successful nightly build
281 </span>mv snapshot.xml .repo/manifest.xml <span class="c"># copy over the generic un-pinned manifest
282 </span></pre></div><ul><li>the <tt>repo init</tt> command will fetch a repo 'manifest' which refers to various source repositories and branches but will fetch the latest changes from those branches (which occasionally may fail to build due to upstream errors common with community based projects). The Gateworks nightly build server posts the manifest pinned to the specific revision used in the build on completion of a successful build. You can also use a snapshot from a previously released pre-built binary by using the other snapshot files in <a class="ext-link" href="http://dev.gateworks.com/yocto/1.8"><span class="icon"></span>http://dev.gateworks.com/yocto/1.8</a>
283 </li></ul></li></ol><ol start="4"><li>Download latest sources:
284 <div class="code"><pre>repo sync -c -j8
285 </pre></div><ul><li>the <tt>-c</tt> parameter tells repo to just pull down the current branch specified by the manifest file (thus is more network and disk usage efficient)
286 </li><li>the <tt>-j</tt> parameter tells repo to use multiple processes (8 in this example) which will speed up fetching
287 </li><li>you can later repeat the <tt>repo sync</tt> to pull down the latest sources specified for the repo manifest file for the current branch specified in the <tt>repo init</tt> in step 2 above
288 </li></ul></li></ol><ol start="5"><li>Activate <tt>bitbake</tt> environment. You will have to accept license agreement.
289 <div class="code"><pre>. ./setup-environment build
290 </pre></div><ul><li><strong>do this every time for a new shell when you wish to use <tt>bitbake</tt></strong>
291 </li></ul></li></ol><ol start="6"><li>Build a filesystem image recipe. <tt>gateworks-image-multimedia</tt> is recommended.
292 <ul><li>For a detailed description of the Gateworks specific images, please see <a class="wiki" href="/wiki/Yocto/images#ImageUseCases">the images page</a>.
293 <div class="code"><pre>bitbake gateworks-image-multimedia
294 </pre></div></li><li>This could take several hours depending on your Internet speed and development host
295 </li><li>core-image-minimal results in 1.8GB of downloaded sources, 14GB of space used in build/tmp, and takes ~70mins on a Quad-core 2.5GHz build host, not accounting for your network connection.
296 </li><li>By default, images, kernels, etc are found in <tt>tmp/deploy/images/ventana</tt>
297 </li></ul></li></ol><ol start="7"><li>Grab <tt>.ubi</tt> file which contains both kernel and root filesystem and program it to the board with instructions below:
298 <div class="code"><pre>tmp/deploy/images/ventana/gateworks-image-multimedia-ventana_normal.ubi
188}}}
189 * in the above command, {{{fido}}} is the name of the branch that refers to Yocto v1.8
190
1913. (optional) pin the repo versions to the latest version which was known to have been successfully built by the Gateworks nightly build server:
192{{{#!bash
193wget http://dev.gateworks.com/yocto/1.8/snapshot.xml # fetch the pinned manifest from the last successful nightly build
194mv snapshot.xml .repo/manifest.xml # copy over the generic un-pinned manifest
195}}}
196 * the {{{repo init}}} command will fetch a repo 'manifest' which refers to various source repositories and branches but will fetch the latest changes from those branches (which occasionally may fail to build due to upstream errors common with community based projects). The Gateworks nightly build server posts the manifest pinned to the specific revision used in the build on completion of a successful build. You can also use a snapshot from a previously released pre-built binary by using the other snapshot files in http://dev.gateworks.com/yocto/1.8
197
1984. Download latest sources:
199{{{#!bash
200repo sync -c -j8
201}}}
202 * the {{{-c}}} parameter tells repo to just pull down the current branch specified by the manifest file (thus is more network and disk usage efficient)
203 * the {{{-j}}} parameter tells repo to use multiple processes (8 in this example) which will speed up fetching
204 * you can later repeat the {{{repo sync}}} to pull down the latest sources specified for the repo manifest file for the current branch specified in the repo init in step 2 above
205
2065. Activate bitbake environment. You will have to accept license agreement.
207{{{#!bash
208. ./setup-environment build
209}}}
210 * **do this every time for a new shell when you wish to use {{{bitbake}}}**
211
2126. Build a filesystem image recipe. gateworks-image-multimedia is recommended.
213{{{#!bash
214bitbake gateworks-image-multimedia
215}}}
216 * For a detailed description of the Gateworks specific images, please see the images page.
217 * This could take several hours depending on your Internet speed and development host
218 * {{{core-image-minimal}}} results in 1.8GB of downloaded sources, 14GB of space used in build/tmp, and takes ~70mins on a Quad-core 2.5GHz build host, not accounting for your network connection.
219 * By default, images, kernels, etc are found in {{{tmp/deploy/images/ventana}}}.
220
2217. Grab .ubi file which contains both kernel and root filesystem and program it to the board with instructions below:
222{{{#!bash
223tmp/deploy/images/ventana/gateworks-image-multimedia-ventana_normal.ubi
299224tmp/deploy/images/ventana/gateworks-image-multimedia-ventana_large.ubi
300 </pre></div></li></ol><p>
225}}}
226
301227Notes:
302 </p>
303 <ul><li>to download any updates and rebuild, repeat the above starting with step 3
304 </li><li>to re-activate a new shell repeat the above starting with step 4 (you can only have 1 shell activated at a time - you need to activate a new shell if you have exited a previously activated shell)
305 </li><li>to clean a specific recipe use <tt>bitbake -f -c clean <recipe></tt>. Note that to represent the kernel you can use the virtual recipe name 'virtual/kernel'
306 <ul><li>Note: After cleaning a recipe, rebuild with the <tt>--no-setscene</tt> command line argument to <tt>bitbake</tt>, e.g. <tt>bitbake --no-setscene <recipe></tt>
307 </li></ul></li><li>to clean all built items (but not remove downloaded sources or the sstate-cache) you can <tt>rm -rf tmp</tt>
308 </li><li>to clean everything and start over you can remove the entire build directory and repeat the above starting with step 4 (this will remove all downloaded sources as well)
309 </li></ul><p>
228 * to download any updates and rebuild, repeat the above starting with step 3
229 * to re-activate a new shell repeat the above starting with step 4 (you can only have 1 shell activated at a time - you need to activate a new shell if you have exited a previously activated shell)
230 * to clean a specific recipe use {{{bitbake -f -c clean <recipe>}}}. Note that to represent the kernel you can use the virtual recipe name 'virtual/kernel'
231 - Note: After cleaning a recipe, rebuild with the {{{--no-setscene}}} command line argument to bitbake, e.g. bitbake --no-setscene <recipe>
232 * to clean all built items (but not remove downloaded sources or the sstate-cache) you can {{{rm -rf tmp}}}.
233 * to clean everything and start over you can remove the entire build directory and repeat the above starting with step 4 (this will remove all downloaded sources as well)
234
310235Useful References:
311 </p>
312 <ul><li><a class="ext-link" href="http://www.crashcourse.ca/wiki/index.php/Yocto_FAQ"><span class="icon"></span>http://www.crashcourse.ca/wiki/index.php/Yocto_FAQ</a>
313 </li><li><a class="ext-link" href="http://xda-university.com/as-a-developer/repo-tips-tricks"><span class="icon"></span>http://xda-university.com/as-a-developer/repo-tips-tricks</a>
314 </li></ul><h2 id="Troubleshootingbuildfailures">Troubleshooting build failures</h2>
315 <p>
316 The <a class="missing wiki">OpenEmbedded?</a> build system does a fairly good job of reporting build errors in a sane way to help you diagnose the problem.
317 </p>
318 <p>
319 In general, for each package that failed, you will see three lines of output from <tt>bitbake</tt> for each package. For example, the following shows a 'fetch error' for the <tt>evtest_1.25</tt> package:
320 </p>
321 <div class="code"><pre>ERROR: Function failed: Fetcher failure <span class="k">for </span>URL: <span class="s1">'http://cgit.freedesktop.org/~whot/evtest/snapshot/evtest-1.25.tar.bz2;name=archive'</span>. Unable to fetch URL from any source.
236 * http://www.crashcourse.ca/wiki/index.php/Yocto_FAQ
237 * http://xda-university.com/as-a-developer/repo-tips-tricks
238
239
240== Troubleshooting build failures ==
241The OpenEmbedded build system does a fairly good job of reporting build errors in a sane way to help you diagnose the problem.
242
243In general, for each package that failed, you will see three lines of output from {{{bitbake}}} for each package. For example, the following shows a 'fetch error' for the {{{evtest_1.25}}} package:
244{{{#!bash
245ERROR: Function failed: Fetcher failure for URL: 'http://cgit.freedesktop.org/~whot/evtest/snapshot/evtest-1.25.tar.bz2;name=archive'. Unable to fetch URL from any source.
322246ERROR: Logfile of failure stored in: /usr/src/tharvey/nightly/yocto/danny/20140820_8bd8be2d/build/tmp/work/armv7a-vfp-neon-poky-linux-gnueabi/evtest-1.25-r0/temp/log.do_fetch.23170
323 ERROR: Task 452 <span class="o">(</span>/usr/src/tharvey/nightly/yocto/danny/20140820_8bd8be2d/sources/meta-openembedded/meta-oe/recipes-support/evtest/evtest_1.25.bb, do_fetch<span class="o">)</span> failed with <span class="nb">exit </span>code <span class="s1">'1'</span>
324 </pre></div><p>
247ERROR: Task 452 (/usr/src/tharvey/nightly/yocto/danny/20140820_8bd8be2d/sources/meta-openembedded/meta-oe/recipes-support/evtest/evtest_1.25.bb, do_fetch) failed with exit code '1'
248}}}
249
325250The first ERROR line here shows the cause of the issue, the second shows where the detailed log of the failure is, and the third simply says what package and task failed. If you need assistance understanding a particular error, you will want to provide the three lines above as well as the log file pointed to in the second line.
326 </p>
327 <h3 id="Fetchfailure">Fetch failure</h3>
328 <p>
329 The most common build failure (of any linux build system) is failure to be able to fetch sources for the 100's of <a class="missing wiki">OpenSource?</a> projects the build system uses from the Internet. This can be caused by a network issue on your end, a network issue on the source package sites end, or a site/file that has been permanently moved/removed.
330 </p>
331 <p>
332 If this occurs you will see an 'ERROR: Function failed: Fetcher failure' message such as the following output from <tt>bitbake</tt>:
333 </p>
334 <div class="code"><pre>ERROR: Function failed: Fetcher failure <span class="k">for </span>URL: <span class="s1">'http://cgit.freedesktop.org/~whot/evtest/snapshot/evtest-1.25.tar.bz2;name=archive'</span>. Unable to fetch URL from any source.
335 </pre></div><p>
336 If you encounter such an error the most obvious thing to make sure your Internet connection is solid and try first is simply <tt>bitbake</tt> your desired package again. If it occurs again, its likely an issue on the site that the package URI specifies as the package source. This could be a temporary issue, or the site/file could have been permanently moved/removed for some reason and your either building an older BSP or the package source simply hasn't been updated to deal with the change (as I mentioned, this is a common issue).
337 </p>
338 <p>
339 To combat this issue, there are mirrors where you may be able to find the missing file(s). Note that Gateworks provides such a mirror that it tries to keep updated at <a class="ext-link" href="http://dev.gateworks.com/sources"><span class="icon"></span>http://dev.gateworks.com/sources</a>. Once you find the file, copy it to your download directory, touch the file indicating the fetch is done (the source file with a .done on the end) and <tt>bitbake</tt> your package again. For example, the above shows a failure to fetch the <tt>evtest-1.25.tar.bz2</tt> file:
340 </p>
341 <div class="code"><pre>wget http://dev.gateworks.com/sources/evtest-1.25.tar.bz2
251
252=== Fetch failure ===
253The most common build failure (of any linux build system) is failure to be able to fetch sources for the 100's of OpenSource projects the build system uses from the Internet. This can be caused by a network issue on your end, a network issue on the source package sites end, or a site/file that has been permanently moved/removed.
254
255If this occurs you will see an 'ERROR: Function failed: Fetcher failure' message such as the following output from {{{bitbake}}}:
256{{{#!bash
257ERROR: Function failed: Fetcher failure for URL: 'http://cgit.freedesktop.org/~whot/evtest/snapshot/evtest-1.25.tar.bz2;name=archive'. Unable to fetch URL from any source.
258}}}
259
260If you encounter such an error the most obvious thing to make sure your Internet connection is solid and try first is simply {{{bitbake}}} your desired package again. If it occurs again, its likely an issue on the site that the package URI specifies as the package source. This could be a temporary issue, or the site/file could have been permanently moved/removed for some reason and your either building an older BSP or the package source simply hasn't been updated to deal with the change (as I mentioned, this is a common issue).
261
262To combat this issue, there are mirrors where you may be able to find the missing file(s). Note that Gateworks provides such a mirror that it tries to keep updated at http://dev.gateworks.com/sources. Once you find the file, copy it to your download directory, touch the file indicating the fetch is done (the source file with a .done on the end) and bitbake your package again. For example, the above shows a failure to fetch the evtest-1.25.tar.bz2 file:
263{{{#!bash
264wget http://dev.gateworks.com/sources/evtest-1.25.tar.bz2
342265cp evtest-1.25.tar.bz2 downloads/
343266touch downloads/evtest-1.25.tar.bz2.done
344267bitbake gateworks-image-multimedia
345 </pre></div><h3 id="UpstreamBreakage">Upstream Breakage</h3>
346 <p>
268}}}
269
270=== Upstream Breakage ===
347271It is not uncommon for community based projects such as Yocto to encounter build failures after changes because of the complexity of the build system. In some cases breakage may occur simply because of collisions between upstream Yocto repos and the packages that Gateworks overrides.
348 </p>
349 <p>
350 If you are building an 'un-pinned' release (you are not using a snapshot of the manifest file which has sha revisions for each repository) and you encounter a build failure, you may want to switch to a manifest file that produced a successful build by the Gateworks nightly build server. Manifests point to source code repositories by network server and branch, but typically do not pin the branch to a specific repository commit. A 'pinned' snapshot can be used instead that does specify a specific commit of each repository and branch. Refer to step 3 in the <a class="wiki" href="/wiki/Yocto/Building#build">instructions above</a>
351 </p>
352 <p>
353 <span class="wikianchor" id="repo"></span>
354 </p>
355 <h2 id="Keepinguptodateandorpinningsourcewithrepo">Keeping up to date and/or pinning source with repo</h2>
356 <p>
357 When building projects that use multiple source repositories any repository may change and thus make your working directory out of date. Because Yocto uses several package feeds with their own repositories this can make it difficult to keep in sync - this is where the <tt>repo</tt> tool comes in handy.
358 </p>
359 <p>
360 The <tt>repo sync</tt> command will update all repositories with upstream changes:
361 </p>
362 <div class="code"><pre>repo sync --quiet
363 </pre></div><p>
272
273If you are building an 'un-pinned' release (you are not using a snapshot of the manifest file which has sha revisions for each repository) and you encounter a build failure, you may want to switch to a manifest file that produced a successful build by the Gateworks nightly build server. Manifests point to source code repositories by network server and branch, but typically do not pin the branch to a specific repository commit. A 'pinned' snapshot can be used instead that does specify a specific commit of each repository and branch. Refer to step 3 in the [wiki:Yocto/Building#build instructions above].
274
275
276== Keeping up to date and/or pinning source with repo ==
277When building projects that use multiple source repositories any repository may change and thus make your working directory out of date. Because Yocto uses several package feeds with their own repositories this can make it difficult to keep in sync - this is where the {{{repo}}} tool comes in handy.
278
279The {{{repo sync}}} command will update all repositories with upstream changes:
280{{{#!bash
281repo sync --quiet
282}}}
283
364284You can override the default Manifest by using a local manifest file if you want to keep in sync with the upstream manifest yet make some minor change like pin a specific project or add a couple of projects. Reasons for doing this could be:
365 </p>
366 <ul><li>adding new projects
367 </li><li>pinning certain projects
368 </li><li>removing certain projects
369 </li></ul><p>
370 To use a local manifest create <tt>.repo/local_manifest.xml</tt> and it will be merged with <tt>.repo/manifest.xml</tt> by the <tt>repo</tt> tool whenever the manifest is used. You can use the <tt>remove-project</tt> directive to remove a project that you don't want and even add it back with your own choices if you want something different. For example:
371 </p>
372 <div class="code"><pre><span class="cp"><?xml version="1.0" encoding="UTF-8"?></span>
373 <span class="nt"><manifest></span>
374 <span class="nt"><remove-project</span> <span class="na">path=</span><span class="s">"hardware/qcom/display"</span> <span class="na">name=</span><span class="s">"CyanogenMod/android_hardware_qcom_display"</span> <span class="nt">/></span>
375 <span class="nt"><project</span> <span class="na">path=</span><span class="s">"hardware/qcom/display"</span> <span class="na">name=</span><span class="s">"WinSuk/android_hardware_qcom_display"</span> <span class="nt">/></span>
376 <span class="nt"></manifest></span>
377 </pre></div><p>
378 The <tt>repo manifest</tt> command will create a snapshot of your current project's manifest allowing you to create a pinned version that can be used later to create a working directory with the various projects at the exact same state as your current working directory:
379 </p>
380 <div class="code"><pre>repo manifest -o snapshot.xml -r
381 </pre></div><p>
382 This snapshot can then be copied over <tt>.repo/manifest.xml</tt> in a different build directory to pin the repository sources.
383 </p>
384 <p>
385 The Gateworks nightly build server creates a manifest snapshot like this and uploads the latest successful build to <a class="ext-link" href="http://dev.gateworks/com/yocto"><span class="icon"></span>http://dev.gateworks/com/yocto</a> so that it can be used to re-create a successful nightly build.
386 </p>
387 <p>
285 * adding new projects
286 * pinning certain projects
287 * removing certain projects
288
289To use a local manifest create {{{.repo/local_manifest.xml}}} and it will be merged with {{{.repo/manifest.xml}}} by the {{{repo}}} tool whenever the manifest is used. You can use the {{{remove-project}}} directive to remove a project that you don't want and even add it back with your own choices if you want something different. For example:
290{{{#!bash
291<?xml version="1.0" encoding="UTF-8"?>
292<manifest>
293 <remove-project path="hardware/qcom/display" name="CyanogenMod/android_hardware_qcom_display" />
294 <project path="hardware/qcom/display" name="WinSuk/android_hardware_qcom_display" />
295</manifest>
296}}}
297
298The {{{repo manifest}}} command will create a snapshot of your current project's manifest allowing you to create a pinned version that can be used later to create a working directory with the various projects at the exact same state as your current working directory:
299{{{#!bash
300repo manifest -o snapshot.xml -r
301}}}
302
303This snapshot can then be copied over {{{.repo/manifest.xml}}} in a different build directory to pin the repository sources.
304
305The Gateworks nightly build server creates a manifest snapshot like this and uploads the latest successful build to http://dev.gateworks/com/yocto so that it can be used to re-create a successful nightly build.
306
388307References:
389 </p>
390 <ul><li><a class="ext-link" href="https://source.android.com/source/using-repo.html"><span class="icon"></span>Official docs on using repo</a>
391 </li><li><a class="ext-link" href="http://xda-university.com/as-a-developer/repo-tips-tricks"><span class="icon"></span>xda-university repo tips and tricks</a>
392 </li><li><a class="ext-link" href="http://wiki.cyanogenmod.org/w/Doc:_Using_manifests"><span class="icon"></span>Cyanogenmod docs on using manifests</a>
393 </li><li><a class="ext-link" href="https://gerrit.googlesource.com/git-repo/+/master/docs/manifest-format.txt"><span class="icon"></span>repo Manifest Format: the official, technical documentation for repo manifests</a>
394 </li></ul><p>
395 <span class="wikianchor" id="rebuild"></span>
396 </p>
397 <h2 id="Updatingandrebuilding">Updating and rebuilding</h2>
398 <p>
308 * [https://source.android.com/source/using-repo.html Official docs on using repo]
309 * [http://xda-university.com/as-a-developer/repo-tips-tricks xda-university repo tips and tricks]
310 * [https://gerrit.googlesource.com/git-repo/+/master/docs/manifest-format.txt repo Manifest Format: the official, technical documentation for repo manifests]
311
312
313== Updating and rebuilding ==
399314From time to time the various repositories including in the Yocto build (a combination of Gateworks packages, community packages, Freescale community packages, and Yocto community packages) will get updates to various packages to add features or resolve issues.
400 </p>
401 <p>
402 The <tt>repo</tt> tool which manages the set of repositories in your yocto directory (based on a package manifest) can 'sync' all repos to the latest state using the following in the main yocto directory (the directory containing the sources and build subdirs:
403 </p>
404 <div class="code"><pre>./repo sync
405 </pre></div><p>
406 Following a sync, you can <tt>bitbake</tt> your filesystem image again to build a new filesystem with all updates:
407 </p>
408 <div class="code"><pre><span class="c"># activate a bitbake shell if not already done
409 </span>. ./setup-environment build
315
316The {{{repo}}} tool which manages the set of repositories in your yocto directory (based on a package manifest) can 'sync' all repos to the latest state using the following in the main yocto directory (the directory containing the sources and build subdirs:
317{{{#!bash
318./repo sync
319}}}
320
321Following a sync, you can {{{bitbake}}} your filesystem image again to build a new filesystem with all updates:
322{{{#!bash
323# activate a bitbake shell if not already done
324. ./setup-environment build
410325bitbake gateworks-image-multimedia
411 </pre></div><ul><li>build the filesystem image of your liking
412 </li></ul><h2 id="Diskusageandkeepingthingsclean">Disk usage and keeping things clean</h2>
413 <p>
326}}}
327 * build the filesystem image of your liking
328
329
330== Disk usage and keeping things clean ==
414331Yocto builds can chew up a lot of disk space (true really of any OS build system).
415 </p>
416 <p>
417 <tt>Bitbake</tt> will keep copies of all workdirs for old packages, so over time if you update recipes (or <tt>repo sync</tt> which may update recipes) your disk usage will grow. You can safely remove the old packages manually from <tt>build/tmp</tt> if you wish, or use <tt>bitbake -cclean <recipe.bb></tt> to clean specific recipes (note that <tt>bitbake -cclean <package></tt> will only clean the current preferred version, not old packages).
418 </p>
419 <p>
420 Another thing that can cause disk usage bloat is filesystem images. Each time you build a filesystem image (ie gateworks-image-*) <tt>bitbake</tt> will create a new one with a timestamp in <tt>build/tmp/deploy/images/</tt> and the build system will keep around several artifacts such as the filesystem tarball, the ubifs, and the ubi (thus a filesystem image resulting in a 100MB UBI actually chews up over 300MB of disk space each time you build it depending on compression). Its very likely that if you are re-building an image, you probably don't care about the old ones, so you might want to get in the habit of removing them before building. For example, if you want to build gateworks-image-multimedia:
421 </p>
422 <div class="code"><pre>rm -rf build/tmp/deploy/images/gateworks-image-multimedia* ;<span class="c"># remove old images we don't care about
423 </span>bitbake gateworks-image-multimedia ;<span class="c"># build a new one
424 </span></pre></div><p>
332
333Bitbake will keep copies of all workdirs for old packages, so over time if you update recipes (or {{{repo sync}}} which may update recipes) your disk usage will grow. You can safely remove the old packages manually from build/tmp if you wish, or use {{{bitbake -cclean <recipe.bb>}}} to clean specific recipes (note that {{{bitbake -cclean <package>}}} will only clean the current preferred version, not old packages).
334
335Another thing that can cause disk usage bloat is filesystem images. Each time you build a filesystem image (ie gateworks-image-*) {{{bitbake}}} will create a new one with a timestamp in {{{build/tmp/deploy/images/}}} and the build system will keep around several artifacts such as the filesystem tarball, the ubifs, and the ubi (thus a filesystem image resulting in a 100MB UBI actually chews up over 300MB of disk space each time you build it depending on compression). Its very likely that if you are re-building an image, you probably don't care about the old ones, so you might want to get in the habit of removing them before building. For example, if you want to build gateworks-image-multimedia:
336{{{#!bash
337rm -rf build/tmp/deploy/images/gateworks-image-multimedia* ;# remove old images we don't care about
338bitbake gateworks-image-multimedia ;# build a new one
339}}}
425340For Yocto, all temporary files will be in build/tmp so if you want to clear out everything and start over you can:
426 </p>
427 <div class="code"><pre>rm -rf build/tmp
428 </pre></div><h2 id="BuildingUpdatingAddingPackages">Building / Updating / Adding Packages</h2>
429 <p>
430 Please read more <a class="wiki" href="/wiki/Yocto/packages">Yocto/packages</a>
431 </p>
432 <p>
433 <span class="wikianchor" id="yocto_building_sdk"></span>
434 </p>
435 <h2 id="BuildingatoolchainandorSDK">Building a toolchain and/or SDK</h2>
436 <p>
437 See <a class="wiki" href="/wiki/Yocto/SDK">Yocto/SDK</a> for information about a pre-built downloadable SDK
438 </p>
439 <p>
440 You can use <tt>bitbake</tt> to create a toolchain (cross-compiler) or an Software Development Kit (SDK) comprised of a cross-toolchain and libs.
441 </p>
442 <p>
341{{{
342rm -rf build/tmp
343}}}
344
345== Building / Updating / Adding Packages ==
346For information concerning building, updating, and adding packages please see [wiki:Yocto/packages Yocto/packages].
347
348== Building a toolchain and/or SDK ==
349See [wiki:Yocto/SDK Yocto/SDK] for information about a pre-built downloadable SDK.
350
351You can use {{{bitbake}}} to create a toolchain (cross-compiler) or an Software Development Kit (SDK) comprised of a cross-toolchain and libs.
352
443353Toolchain:
444 </p>
445 <div class="code"><pre>bitbake meta-toolchain
446 </pre></div><p>
354{{{#!bash
355bitbake meta-toolchain
356}}}
357
447358SDK (contains meta-toolchain as well as -dev and -dbg packages with headers and libs):
448 </p>
449 <div class="code"><pre>bitbake -cpopulate_sdk gateworks-image-multimedia
450 </pre></div><ul><li>The produced SDK will be a self-extracting shell-script in tmp/deploy/sdk that contains all the include headers and libs for the packages in the image - you can build an SDK for any image by replacing 'gateworks-image-multimedia' with any other buildable filesystem image.
451 </li></ul><h2 id="Otherusefullinks">Other useful links</h2>
452 <ul><li>For those that may want to compile the Freescale Image:
453 <ul><li><a class="ext-link" href="https://community.freescale.com/docs/DOC-1616"><span class="icon"></span>https://community.freescale.com/docs/DOC-1616</a>
454 </li></ul></li></ul><p>
455 <span class="wikianchor" id="yocto_installing"></span>
456 </p>
457 <h1 id="InstallingFirmware">Installing Firmware</h1>
458 <p>
459 <span class="wikianchor" id="yocto_installing_flash"></span>
460 </p>
461 <h2 id="NANDFLASH">NAND FLASH</h2>
462 <p>
359{{{#!bash
360bitbake -cpopulate_sdk gateworks-image-multimedia
361}}}
362 * The produced SDK will be a self-extracting shell-script in tmp/deploy/sdk that contains all the include headers and libs for the packages in the image - you can build an SDK for any image by replacing 'gateworks-image-multimedia' with any other buildable filesystem image.
363
364== Other useful links ==
365For those that may want to compile the Freescale Image:
366 * https://community.freescale.com/docs/DOC-1616
367
368
369= Installing Firmware =
370
371== NAND FLASH ==
463372There are 2 options:
464 </p>
465 <ol><li>TFTP Server (recommended) - Read below
466 </li><li>JTAG Programmer (more steps and slower, requires no network)- Link <a class="wiki" href="/wiki/jtag_instructions#CreatingjtagableimagesforVentana">here</a>
467 </li></ol><p>
468 Boards with a NAND FLASH large enough to accommodate your image (Ventana boards have a 256MB NAND flash by default which is large enough for fsl-image-multimedia) can have the UBI filesystem created by the build process placed on them. A ubi image will be built in tmp/deploy/images directory alongside the kernel and filesystem tarballs. The ubi image will end with _normal.ubi which is suitable for standard NAND flash sizes on Ventana boards. If you have a Ventana with a 1GB or larger NAND device, you need to build for the 'large' NAND flash layout which you can do by changing the UBI_CONFIG variable in <tt>sources/meta-gateworks/conf/machine/ventana.conf</tt> from 'normal' to 'large' which will result in a ubi image ending with <tt>_large.ubi</tt>.
469 </p>
470 <p>
373 1. TFTP Server (recommended) - Read below
374 2. JTAG Programmer (more steps and slower, requires no network)- Link [wiki:jtag_instructions#CreatingjtagableimagesforVentana here]
375
376Boards with a NAND FLASH large enough to accommodate your image (Ventana boards have a 256MB NAND flash by default which is large enough for fsl-image-multimedia) can have the UBI filesystem created by the build process placed on them. A ubi image will be built in tmp/deploy/images directory alongside the kernel and filesystem tarballs. The ubi image will end with _normal.ubi which is suitable for standard NAND flash sizes on Ventana boards. If you have a Ventana with a 1GB or larger NAND device, you need to build for the 'large' NAND flash layout which you can do by changing the UBI_CONFIG variable in {{{sources/meta-gateworks/conf/machine/ventana.conf}}} from 'normal' to 'large' which will result in a ubi image ending with {{{_large.ubi}}}.
377
471378To install firmware to a Ventana board using Serial/ENET, do the following:
472 </p>
473 <p>
379
474380First, get yourself into a sane state:
475 </p>
476 <ul><li>Copy your UBI file to a proper location that your <a class="wiki" href="/wiki/tftpserver">tftpserver</a> has access to
477 </li><li>connect to the serial console of the target board (instructions may be found <a class="wiki" href="/wiki/jtag_instructions#SerialConsoleAccessonLinux">here</a> if you are unfamiliar with this)
478 </li></ul><ol><li>Connect your target board to your network, set ipaddress and serverip in uboot
479 <div class="code"><pre><span class="c"># Break out of the bootloader
480 </span>setenv ipaddr <localip>
481 setenv serverip <serverip>
482 </pre></div>For Example:
483 <div class="code"><pre>setenv ipaddr 192.168.1.211
381 * Copy your UBI file to a proper location that your tftpserver has access to
382 * connect to the serial console of the target board (instructions may be found here if you are unfamiliar with this)
383
3841. Connect your target board to your network, set ipaddress and serverip in uboot
385{{{#!bash
386# Break out of the bootloader
387setenv ipaddr <localip>
388setenv serverip <serverip>
389}}}
390For Example:
391{{{#!bash
392setenv ipaddr 192.168.1.211
484393setenv serverip 192.168.1.14
485 </pre></div></li></ol><ol start="2"><li>Modify the boot variables to point to the image file on the tftp server and update:
486 <div class="code"><pre><span class="c"># Note: Adjust file path/name to match file structure on your tftpserver
487 </span>setenv image_rootfs gateworks-image-gui-ventana.ubi
488 </pre></div></li></ol><ol start="3"><li>Run the nand update script to pull the image from the tftp server and load it:
489 <div class="code"><pre>run nand_update
490 </pre></div><ul><li>Troubleshooting
491 <ul><li>Be sure that the tftp server is working properly and started on the host PC
492 </li><li>An error such as 'ERROR: Need valid 'usbnet_devaddr' to be set at drivers/usb/gadget/ether.c:2362/usb_eth_init()' is simply because the ethernet transfer failed and it is attempting to use the USB network which needs to be configured.
493 </li></ul></li></ul></li></ol><ol start="4"><li> Once it is done loading, type the command boot
494 <div class="code"><pre>boot
495 </pre></div></li></ol><ol start="5"><li>The login is <tt>root</tt> with no default password.
496 </li></ol><p>
497 <span class="wikianchor" id="yocto_installing_blockdev"></span>
498 </p>
499 <h2 id="InstallingonRemovablestorage:mSATAUSBuSD">Installing on Removable storage: mSATA/USB/uSD</h2>
500 <p>
394}}}
395
3962. Modify the boot variables to point to the image file on the tftp server and update:
397{{{#!bash
398# Note: Adjust file path/name to match file structure on your tftpserver
399setenv image_rootfs gateworks-image-gui-ventana.ubi
400}}}
401
4023. Run the nand update script to pull the image from the tftp server and load it:
403{{{#!bash
404run nand_update
405}}}
406 * Be sure that the tftp server is working properly and started on the host PC
407 * An error such as 'ERROR: Need valid 'usbnet_devaddr' to be set at drivers/usb/gadget/ether.c:2362/usb_eth_init()' is simply because the ethernet transfer failed and it is attempting to use the USB network which needs to be configured.
408
4094. Once it is done loading, type the command boot
410{{{#!bash
411boot
412}}}
413
4145. The login is {{{root}}} with no default password.
415
416== Installing on Removable storage: mSATA/USB/uSD ==
501417For this, do not use the .ubi file. Use the tarball, for example: gateworks-image-gui-ventana.tar.bz2
502 </p>
503 <p>
418
504419To image the built firmware onto a removable flash device such as an mSATA disk, uSD card, or USB stick you can use the following script which creates a single ext4 partition for rootfs.
505 </p>
506 <div class="code"><pre><span class="nv">DISK</span><span class="o">=</span>/dev/sdc
507 <span class="c"># create a single Linux partition
508 </span><span class="nb">printf</span> <span class="s2">",,L,,\n"</span> | sudo sfdisk -uS <span class="k">${</span><span class="nv">DISK</span><span class="k">}</span>
509 <span class="c"># format it as ext4
510 </span>sudo mkfs.ext4 <span class="k">${</span><span class="nv">DISK</span><span class="k">}</span>1
511 <span class="c"># mount it
512 </span>sudo mount <span class="k">${</span><span class="nv">DISK</span><span class="k">}</span>1 /mnt/disk
513 <span class="c"># untar the filesystem image
514 </span>sudo tar -C /mnt/disk -xvf tmp/deploy/images/ventana/gateworks-image-gui-ventana.tar.bz2
420{{{#!bash
421DISK=/dev/sdc
422# create a single Linux partition
423printf ",,L,,\n" | sudo sfdisk -uS ${DISK}
424# format it as ext4
425sudo mkfs.ext4 ${DISK}1
426# mount it
427sudo mount ${DISK}1 /mnt/disk
428# untar the filesystem image
429sudo tar -C /mnt/disk -xvf tmp/deploy/images/ventana/gateworks-image-gui-ventana.tar.bz2
515430sudo umount /mnt/disk
516 </pre></div><ul><li>Notes:
517 <ul><li><strong>set DISK to the appropriate device on your Linux Host (it may very well differ from <tt>/dev/sdc</tt>). If you do not do this, you risk overwriting your OS partition</strong>. Once the flash device is plugged into the computer, you can find the device by typing <tt>mount</tt> and examining the output. For example if A flash stick with 1 partition shows as <tt>/dev/sdc1</tt> then the block device is <tt>/dev/sdc</tt> (the 1 is the first partition)
518 </li></ul></li></ul><p>
431}}}
432 * Notes:
433 - **set DISK to the appropriate device on your Linux Host (it may very well differ from {{{/dev/sdc}}}). If you do not do this, you risk overwriting your OS partition**. Once the flash device is plugged into the computer, you can find the device by typing mount and examining the output. For example if A flash stick with 1 partition shows as {{{/dev/sdc1}}} then the block device is {{{/dev/sdc}}} (the 1 is the first partition)
519434Using the latest bootloader and bootloader env scripts simply placing this removable media in a Ventana board will boot it.
520 </p>
521 <p>
522 See <a class="wiki" href="/wiki/Yocto/Building#Pre-CompiledBinary">above</a> for pre-built rootfs tarballs of our latest releases
523 </p>
524 }}}
435
436See [wiki:Yocto/Building#Pre-CompiledBinary above] for pre-built rootfs tarballs of our latest releases
|
{
"url": "http://trac.gateworks.com/wiki/Yocto/Building?action=diff&version=5",
"source_domain": "trac.gateworks.com",
"snapshot_id": "crawl=CC-MAIN-2018-09",
"warc_metadata": {
"Content-Length": "188886",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:A6LLARNCS2STT6W3FK5FNTSAB2MZIBLQ",
"WARC-Concurrent-To": "<urn:uuid:006cb8b4-fc01-4236-b004-38116bc2f623>",
"WARC-Date": "2018-02-24T12:04:48Z",
"WARC-IP-Address": "108.161.130.12",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:FPINGU2TNCVETFDBXZMO65P2CSAE4LW6",
"WARC-Record-ID": "<urn:uuid:56e69101-15b6-4cf9-b36a-77ce08efee9c>",
"WARC-Target-URI": "http://trac.gateworks.com/wiki/Yocto/Building?action=diff&version=5",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b2235a74-a2c4-4a45-9d7d-47d2bd109012>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-71-211-198.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-09\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for February 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
58,
59,
60,
68,
79,
116,
124,
135,
144,
145,
182,
183,
191,
192,
203,
209,
217,
226,
245,
246,
258,
274,
334,
367,
378,
391,
533,
547,
560,
639,
654,
668,
769,
785,
803,
893,
913,
935,
996,
1019,
1041,
1110,
1133,
1154,
1173,
1191,
1314,
1333,
1351,
1427,
1446,
1464,
1561,
1580,
1598,
1697,
1716,
1734,
1823,
1842,
1860,
1926,
1945,
1962,
1977,
1991,
2056,
2072,
2090,
2141,
2160,
2178,
2296,
2315,
2332,
2347,
2360,
2377,
2389,
2400,
2630,
2642,
2780,
2791,
2813,
2820,
3024,
3031,
3102,
3156,
3168,
3265,
3326,
3377,
3408,
3472,
3484,
3550,
3611,
3689,
3748,
3825,
3884,
3915,
3935,
3947,
3958,
4032,
4088,
4120,
4128,
4170,
4231,
4288,
4350,
4405,
4466,
4521,
4547,
4555,
4703,
4715,
4737,
4764,
4798,
4832,
4853,
4870,
4891,
4919,
4947,
4955,
5005,
5017,
5178,
5199,
5253,
5265,
5340,
5351,
5406,
5414,
5422,
5461,
5779,
5791,
5802,
5927,
5940,
5952,
5960,
5998,
6006,
6037,
6050,
6093,
6189,
6202,
6472,
6486,
6757,
7028,
7052,
7061,
7126,
7139,
7152,
7161,
7207,
7303,
7565,
7815,
8060,
8213,
8455,
8693,
8727,
8736,
8782,
8810,
9086,
9364,
9637,
9681,
9690,
9737,
9765,
10039,
10315,
10586,
10630,
10639,
10686,
10714,
10982,
11252,
11524,
11568,
11605,
11696,
11910,
12125,
12335,
12343,
12385,
12429,
12520,
12722,
12911,
13095,
13232,
13414,
13591,
13635,
13658,
13874,
14092,
14304,
14349,
14372,
14586,
14801,
15011,
15056,
15079,
15287,
15496,
15707,
15733,
15743,
15769,
15782,
15810,
15853,
15862,
16062,
16071,
16136,
16145,
16154,
16196,
16262,
16275,
16303,
16353,
16553,
16618,
16647,
16656,
16706,
16764,
16829,
16898,
16979,
17032,
17077,
17112,
17168,
17228,
17315,
17405,
17434,
17463,
17495,
17532,
17571,
17614,
17684,
17743,
17767,
17776,
17820,
17873,
17931,
17996,
18069,
18132,
18199,
18233,
18271,
18319,
18368,
18419,
18476,
18541,
18586,
18633,
18699,
18763,
18798,
18840,
18876,
18927,
18962,
19038,
19113,
19187,
19228,
19290,
19343,
19401,
19450,
19495,
19544,
19584,
19619,
19679,
19715,
19783,
19883,
19987,
20069,
20123,
20195,
20245,
20274,
20310,
20422,
20496,
20551,
20585,
20622,
20668,
20706,
20862,
20923,
20979,
21032,
21108,
21154,
21193,
21244,
21290,
21332,
21353,
21366,
21378,
21509,
21522,
21534,
21586,
21599,
21696,
21708,
21730,
21768,
21820,
21879,
21887,
21929,
21951,
21996,
22049,
22109,
22154,
22207,
22267,
22331,
22407,
22455,
22495,
22525,
22576,
22631,
22713,
22798,
22822,
22846,
22873,
22905,
22939,
22977,
23042,
23096,
23139,
23189,
23242,
23303,
23373,
23422,
23485,
23515,
23549,
23593,
23616,
23663,
23716,
23777,
23818,
23861,
23923,
23983,
24014,
24052,
24084,
24131,
24162,
24234,
24305,
24375,
24412,
24459,
24509,
24562,
24585,
24626,
24672,
24708,
24739,
24796,
24828,
24881,
24978,
25078,
25156,
25206,
25274,
25320,
25345,
25379,
25488,
25558,
25599,
25629,
25662,
25704,
25738,
25890,
25926,
25979,
26028,
26100,
26142,
26177,
26224,
26266,
26293,
26302,
26407,
26416,
26425,
26477,
26576,
26589,
26601,
26610,
26674,
26687,
26816,
26918,
26961,
27054,
27072,
27178,
27190,
27199,
27221,
27297,
27315,
27335,
27425,
27456,
27524,
27691,
27703,
27712,
27743,
27761,
27788,
27820,
27869,
27894,
27983,
28098,
28286,
28453,
28562,
29246,
29317,
29365,
29546,
29675,
29880,
30008,
30067,
30185,
30316,
30481,
30547,
30660,
30865,
30963,
31133,
31236,
31248,
31344,
31353,
31506,
31524,
31652,
31738,
31750,
32316,
32325,
32361,
32379,
32404,
32416,
32577,
32697,
32884,
32893,
32977,
32995,
33031,
33043,
33128,
33137,
33224,
33242,
33285,
33297,
33397,
33492,
33698,
33788,
33797,
33923,
33941,
34021,
34102,
34136,
34148,
34157,
34174,
34187,
34278,
34491,
34671,
34852,
34988,
35174,
35196,
35282,
35489,
35654,
35804,
35922,
36102,
36111,
36140,
36153,
36329,
36520,
36612,
36624,
36788,
36801,
36813,
37025,
37038,
37288,
37351,
37421,
37430,
37439,
37484,
37619,
37628,
37834,
37852,
38032,
38223,
38506,
38530,
38719,
38731,
38740,
39080,
39093,
39142,
39154,
39522,
39535,
39547,
39688,
39701,
39951,
39975,
40520,
40533,
40545,
41119,
41132,
41221,
41230,
41260,
41599,
41608,
41746,
41764,
41944,
41956,
41965,
42507,
42516,
42982,
43000,
43066,
43110,
43161,
43206,
43275,
43287,
43299,
43308,
43342,
43637,
43650,
43662,
44304,
44317,
44329,
44380,
44393,
44508,
44520,
44832,
44845,
44857,
44948,
44961,
45010,
45034,
45043,
45660,
45669,
45678,
45743,
46052,
46061,
46149,
46167,
46193,
46205,
46214,
46465,
46478,
46514,
46556,
46599,
46621,
46985,
46998,
47098,
47147,
47403,
47647,
47697,
47721,
48000,
48013,
48077,
48101,
48237,
48250,
48262,
48570,
48583,
48595,
48626,
48662,
48699,
48708,
49060,
49078,
49125,
49144,
49252,
49348,
49368,
49380,
49389,
49665,
49683,
49724,
49736,
49745,
49878,
49887,
50107,
50116,
50138,
50151,
50303,
50472,
50634,
50863,
50885,
50939,
50952,
51020,
51032,
51124,
51232,
51399,
51408,
51417,
51455,
51727,
51740,
51752,
52021,
52034,
52077,
52101,
52224,
52237,
52331,
52374,
52383,
52649,
52667,
52687,
52699,
52708,
52828,
52846,
52901,
52937,
52982,
53052,
53151,
53163,
53175,
53228,
53237,
53246,
53296,
53389,
53402,
53414,
53880,
53893,
53905,
54622,
54635,
54782,
54867,
54898,
54907,
55334,
55343,
56054,
56072,
56180,
56242,
56254,
56379,
56392,
56440,
56543,
56555,
56643,
56656,
56668,
56733,
56746,
56827,
56839,
56955,
56968,
56980,
57134,
57147,
57159,
57171,
57196,
57208,
57217,
57269,
57393,
57402,
57448,
57539,
57548,
57699,
57708,
57729,
57742,
57796,
57820,
57838,
57869,
57881,
57890,
57987,
58000,
58081,
58382,
58450,
58522,
58688,
58720,
58783,
58796,
58857,
58869,
58938,
58951,
58994,
59006,
59024,
59082,
59094,
59378,
59387,
59420,
59484,
59542,
59551,
59560,
59592,
59601,
59626,
59657,
59670,
59725,
59898,
59920,
60687,
60700,
60712,
60763,
60905,
60914,
61675,
61684,
61770,
61783,
61795,
61804,
61853,
61866,
62001,
62211,
62316,
62393,
62438,
62479,
62512,
62571,
62657,
62783,
62792,
62882,
62900,
62938,
62970,
63005,
63017,
63038,
63056,
63092,
63131,
63263,
63383,
63450,
63577,
63624,
63668,
63760,
64012,
64116,
64152,
64253,
64275,
64347,
64360,
64470,
64482,
64494,
64503,
64598,
64616,
64697,
64757,
64769,
64778,
64868,
64886,
64910,
64922,
65009,
65255,
65264,
65322,
65340,
65353,
65365,
65374,
65435,
65444,
65505,
65617,
65630,
65642,
65651,
65848,
65861,
65953,
66011,
66187,
66231,
66340,
66375,
66490,
66543,
66647,
66665,
66687,
66729,
66780,
66808,
66840,
66859,
66897,
66934,
67031,
67063,
67098,
67573,
67605,
67617,
67635,
68075,
68209,
68222,
68234,
68372,
68385,
68397,
68406
],
"line_end_idx": [
58,
59,
60,
68,
79,
116,
124,
135,
144,
145,
182,
183,
191,
192,
203,
209,
217,
226,
245,
246,
258,
274,
334,
367,
378,
391,
533,
547,
560,
639,
654,
668,
769,
785,
803,
893,
913,
935,
996,
1019,
1041,
1110,
1133,
1154,
1173,
1191,
1314,
1333,
1351,
1427,
1446,
1464,
1561,
1580,
1598,
1697,
1716,
1734,
1823,
1842,
1860,
1926,
1945,
1962,
1977,
1991,
2056,
2072,
2090,
2141,
2160,
2178,
2296,
2315,
2332,
2347,
2360,
2377,
2389,
2400,
2630,
2642,
2780,
2791,
2813,
2820,
3024,
3031,
3102,
3156,
3168,
3265,
3326,
3377,
3408,
3472,
3484,
3550,
3611,
3689,
3748,
3825,
3884,
3915,
3935,
3947,
3958,
4032,
4088,
4120,
4128,
4170,
4231,
4288,
4350,
4405,
4466,
4521,
4547,
4555,
4703,
4715,
4737,
4764,
4798,
4832,
4853,
4870,
4891,
4919,
4947,
4955,
5005,
5017,
5178,
5199,
5253,
5265,
5340,
5351,
5406,
5414,
5422,
5461,
5779,
5791,
5802,
5927,
5940,
5952,
5960,
5998,
6006,
6037,
6050,
6093,
6189,
6202,
6472,
6486,
6757,
7028,
7052,
7061,
7126,
7139,
7152,
7161,
7207,
7303,
7565,
7815,
8060,
8213,
8455,
8693,
8727,
8736,
8782,
8810,
9086,
9364,
9637,
9681,
9690,
9737,
9765,
10039,
10315,
10586,
10630,
10639,
10686,
10714,
10982,
11252,
11524,
11568,
11605,
11696,
11910,
12125,
12335,
12343,
12385,
12429,
12520,
12722,
12911,
13095,
13232,
13414,
13591,
13635,
13658,
13874,
14092,
14304,
14349,
14372,
14586,
14801,
15011,
15056,
15079,
15287,
15496,
15707,
15733,
15743,
15769,
15782,
15810,
15853,
15862,
16062,
16071,
16136,
16145,
16154,
16196,
16262,
16275,
16303,
16353,
16553,
16618,
16647,
16656,
16706,
16764,
16829,
16898,
16979,
17032,
17077,
17112,
17168,
17228,
17315,
17405,
17434,
17463,
17495,
17532,
17571,
17614,
17684,
17743,
17767,
17776,
17820,
17873,
17931,
17996,
18069,
18132,
18199,
18233,
18271,
18319,
18368,
18419,
18476,
18541,
18586,
18633,
18699,
18763,
18798,
18840,
18876,
18927,
18962,
19038,
19113,
19187,
19228,
19290,
19343,
19401,
19450,
19495,
19544,
19584,
19619,
19679,
19715,
19783,
19883,
19987,
20069,
20123,
20195,
20245,
20274,
20310,
20422,
20496,
20551,
20585,
20622,
20668,
20706,
20862,
20923,
20979,
21032,
21108,
21154,
21193,
21244,
21290,
21332,
21353,
21366,
21378,
21509,
21522,
21534,
21586,
21599,
21696,
21708,
21730,
21768,
21820,
21879,
21887,
21929,
21951,
21996,
22049,
22109,
22154,
22207,
22267,
22331,
22407,
22455,
22495,
22525,
22576,
22631,
22713,
22798,
22822,
22846,
22873,
22905,
22939,
22977,
23042,
23096,
23139,
23189,
23242,
23303,
23373,
23422,
23485,
23515,
23549,
23593,
23616,
23663,
23716,
23777,
23818,
23861,
23923,
23983,
24014,
24052,
24084,
24131,
24162,
24234,
24305,
24375,
24412,
24459,
24509,
24562,
24585,
24626,
24672,
24708,
24739,
24796,
24828,
24881,
24978,
25078,
25156,
25206,
25274,
25320,
25345,
25379,
25488,
25558,
25599,
25629,
25662,
25704,
25738,
25890,
25926,
25979,
26028,
26100,
26142,
26177,
26224,
26266,
26293,
26302,
26407,
26416,
26425,
26477,
26576,
26589,
26601,
26610,
26674,
26687,
26816,
26918,
26961,
27054,
27072,
27178,
27190,
27199,
27221,
27297,
27315,
27335,
27425,
27456,
27524,
27691,
27703,
27712,
27743,
27761,
27788,
27820,
27869,
27894,
27983,
28098,
28286,
28453,
28562,
29246,
29317,
29365,
29546,
29675,
29880,
30008,
30067,
30185,
30316,
30481,
30547,
30660,
30865,
30963,
31133,
31236,
31248,
31344,
31353,
31506,
31524,
31652,
31738,
31750,
32316,
32325,
32361,
32379,
32404,
32416,
32577,
32697,
32884,
32893,
32977,
32995,
33031,
33043,
33128,
33137,
33224,
33242,
33285,
33297,
33397,
33492,
33698,
33788,
33797,
33923,
33941,
34021,
34102,
34136,
34148,
34157,
34174,
34187,
34278,
34491,
34671,
34852,
34988,
35174,
35196,
35282,
35489,
35654,
35804,
35922,
36102,
36111,
36140,
36153,
36329,
36520,
36612,
36624,
36788,
36801,
36813,
37025,
37038,
37288,
37351,
37421,
37430,
37439,
37484,
37619,
37628,
37834,
37852,
38032,
38223,
38506,
38530,
38719,
38731,
38740,
39080,
39093,
39142,
39154,
39522,
39535,
39547,
39688,
39701,
39951,
39975,
40520,
40533,
40545,
41119,
41132,
41221,
41230,
41260,
41599,
41608,
41746,
41764,
41944,
41956,
41965,
42507,
42516,
42982,
43000,
43066,
43110,
43161,
43206,
43275,
43287,
43299,
43308,
43342,
43637,
43650,
43662,
44304,
44317,
44329,
44380,
44393,
44508,
44520,
44832,
44845,
44857,
44948,
44961,
45010,
45034,
45043,
45660,
45669,
45678,
45743,
46052,
46061,
46149,
46167,
46193,
46205,
46214,
46465,
46478,
46514,
46556,
46599,
46621,
46985,
46998,
47098,
47147,
47403,
47647,
47697,
47721,
48000,
48013,
48077,
48101,
48237,
48250,
48262,
48570,
48583,
48595,
48626,
48662,
48699,
48708,
49060,
49078,
49125,
49144,
49252,
49348,
49368,
49380,
49389,
49665,
49683,
49724,
49736,
49745,
49878,
49887,
50107,
50116,
50138,
50151,
50303,
50472,
50634,
50863,
50885,
50939,
50952,
51020,
51032,
51124,
51232,
51399,
51408,
51417,
51455,
51727,
51740,
51752,
52021,
52034,
52077,
52101,
52224,
52237,
52331,
52374,
52383,
52649,
52667,
52687,
52699,
52708,
52828,
52846,
52901,
52937,
52982,
53052,
53151,
53163,
53175,
53228,
53237,
53246,
53296,
53389,
53402,
53414,
53880,
53893,
53905,
54622,
54635,
54782,
54867,
54898,
54907,
55334,
55343,
56054,
56072,
56180,
56242,
56254,
56379,
56392,
56440,
56543,
56555,
56643,
56656,
56668,
56733,
56746,
56827,
56839,
56955,
56968,
56980,
57134,
57147,
57159,
57171,
57196,
57208,
57217,
57269,
57393,
57402,
57448,
57539,
57548,
57699,
57708,
57729,
57742,
57796,
57820,
57838,
57869,
57881,
57890,
57987,
58000,
58081,
58382,
58450,
58522,
58688,
58720,
58783,
58796,
58857,
58869,
58938,
58951,
58994,
59006,
59024,
59082,
59094,
59378,
59387,
59420,
59484,
59542,
59551,
59560,
59592,
59601,
59626,
59657,
59670,
59725,
59898,
59920,
60687,
60700,
60712,
60763,
60905,
60914,
61675,
61684,
61770,
61783,
61795,
61804,
61853,
61866,
62001,
62211,
62316,
62393,
62438,
62479,
62512,
62571,
62657,
62783,
62792,
62882,
62900,
62938,
62970,
63005,
63017,
63038,
63056,
63092,
63131,
63263,
63383,
63450,
63577,
63624,
63668,
63760,
64012,
64116,
64152,
64253,
64275,
64347,
64360,
64470,
64482,
64494,
64503,
64598,
64616,
64697,
64757,
64769,
64778,
64868,
64886,
64910,
64922,
65009,
65255,
65264,
65322,
65340,
65353,
65365,
65374,
65435,
65444,
65505,
65617,
65630,
65642,
65651,
65848,
65861,
65953,
66011,
66187,
66231,
66340,
66375,
66490,
66543,
66647,
66665,
66687,
66729,
66780,
66808,
66840,
66859,
66897,
66934,
67031,
67063,
67098,
67573,
67605,
67617,
67635,
68075,
68209,
68222,
68234,
68372,
68385,
68397,
68406,
68517
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 68517,
"ccnet_original_nlines": 943,
"rps_doc_curly_bracket": 0.005837969947606325,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.17554011940956116,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01935441978275776,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.41769546270370483,
"rps_doc_frac_unique_words": 0.2688346803188324,
"rps_doc_mean_word_length": 6.569376468658447,
"rps_doc_num_sentences": 731,
"rps_doc_symbol_to_word_ratio": 0.004886830225586891,
"rps_doc_unigram_entropy": 6.6399712562561035,
"rps_doc_word_count": 7380,
"rps_doc_frac_chars_dupe_10grams": 0.3194587826728821,
"rps_doc_frac_chars_dupe_5grams": 0.4674518406391144,
"rps_doc_frac_chars_dupe_6grams": 0.42052721977233887,
"rps_doc_frac_chars_dupe_7grams": 0.378573477268219,
"rps_doc_frac_chars_dupe_8grams": 0.34862422943115234,
"rps_doc_frac_chars_dupe_9grams": 0.33525845408439636,
"rps_doc_frac_chars_top_2gram": 0.003465200075879693,
"rps_doc_frac_chars_top_3gram": 0.005156550090759993,
"rps_doc_frac_chars_top_4gram": 0.0044552600011229515,
"rps_doc_books_importance": -7482.935546875,
"rps_doc_books_importance_length_correction": -7482.935546875,
"rps_doc_openwebtext_importance": -4521.03125,
"rps_doc_openwebtext_importance_length_correction": -4521.03125,
"rps_doc_wikipedia_importance": -4319.251953125,
"rps_doc_wikipedia_importance_length_correction": -4319.251953125
},
"fasttext": {
"dclm": 0.17236429452896118,
"english": 0.5326089859008789,
"fineweb_edu_approx": 2.0488874912261963,
"eai_general_math": 0.10872883349657059,
"eai_open_web_math": 0.3252212405204773,
"eai_web_code": 0.6115365028381348
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-5,946,582,658,648,431,000 |
Qt 之图形（绘制漂亮的圆弧）
简述
综合前面对二维绘图的介绍，想必我们对一些基本绘图有了深入的了解，下面我们来实现一些漂亮的图形绘制。
| 版权声明：一去、二三里，未经博主允许不得转载。
圆形
经常地，我们会在网上看到一些列的抽奖活动，里面就有圆盘抽奖，是不是有点手痒了O(∩_∩)O~
效果
这里写图片描述
源码
void MainWindow::paintEvent(QPaintEvent *)
{
QPainter painter(this);
painter.setRenderHint(QPainter::Antialiasing, true);
int radius = 150;
int arcHeight = 30;
// >> 1（右移1位）相当于width() / 2
painter.translate(width() >> 1, height() >> 1);
/**
* 参数二：半径
* 参数三：开始的角度
* 参数四：指扫取的角度-顺时针（360度 / 8 = 45度）
* 参数五：圆环的高度
* 参数六：填充色
**/
gradientArc(&painter, radius, 0, 45, arcHeight, qRgb(200, 200, 0));
gradientArc(&painter, radius, 45, 45, arcHeight, qRgb(200, 0, 200));
gradientArc(&painter, radius, 90, 45, arcHeight, qRgb(0, 200, 200));
gradientArc(&painter, radius, 135, 45, arcHeight, qRgb(200, 0, 0));
gradientArc(&painter, radius, 225, 45, arcHeight, qRgb(0, 200, 0));
gradientArc(&painter, radius, 180, 45, arcHeight, qRgb(0, 0, 200));
gradientArc(&painter, radius, 270, 45, arcHeight, qRgb(0, 0, 0));
gradientArc(&painter, radius, 315, 45, arcHeight, qRgb(150, 150, 150));
}
void MainWindow::gradientArc(QPainter *painter, int radius, int startAngle, int angleLength, int arcHeight, QRgb color)
{
// 渐变色
QRadialGradient gradient(0, 0, radius);
gradient.setColorAt(0, Qt::white);
gradient.setColorAt(1.0, color);
painter->setBrush(gradient);
// << 1（左移1位）相当于radius*2 即：150*2=300
//QRectF(-150, -150, 300, 300)
QRectF rect(-radius, -radius, radius << 1, radius << 1);
QPainterPath path;
path.arcTo(rect, startAngle, angleLength);
painter->setPen(Qt::NoPen);
painter->drawPath(path);
}
弧形
我们可以在之前的基础上加一些处理，从而实现一个圆弧。
效果
这里写图片描述
源码
void MainWindow::gradientArc(QPainter *painter, int radius, int startAngle, int angleLength, int arcHeight, QRgb color)
{
// 渐变色
QRadialGradient gradient(0, 0, radius);
gradient.setColorAt(0, Qt::white);
gradient.setColorAt(1.0, color);
painter->setBrush(gradient);
// << 1（左移1位）相当于radius*2 即：150*2=300
//QRectF(-150, -150, 300, 300)
QRectF rect(-radius, -radius, radius << 1, radius << 1);
QPainterPath path;
path.arcTo(rect, startAngle, angleLength);
// QRectF(-120, -120, 240, 240)
QPainterPath subPath;
subPath.addEllipse(rect.adjusted(arcHeight, arcHeight, -arcHeight, -arcHeight));
// path为扇形 subPath为椭圆
path -= subPath;
painter->setPen(Qt::NoPen);
painter->drawPath(path);
}
这些只不过是我们实现的一个小效果，如果说你有什么特殊的需要，可以在此基础上进行扩展，比如：添加文本、动画旋转等。
文本
可以通过QPainterPath的addText()来添加文本。
效果
这里写图片描述
源码
void MainWindow::gradientArc(QPainter *painter, int radius, int startAngle, int angleLength, int arcHeight, QRgb color)
{
// 渐变色
QRadialGradient gradient(0, 0, radius);
gradient.setColorAt(0, Qt::white);
gradient.setColorAt(1.0, color);
painter->setBrush(gradient);
// << 1（左移1位）相当于radius*2 即：150*2=300
//QRectF(-150, -150, 300, 300)
QRectF rect(-radius, -radius, radius << 1, radius << 1);
QPainterPath path;
path.arcTo(rect, startAngle, angleLength);
// QRectF(-120, -120, 240, 240)
QPainterPath subPath;
subPath.addEllipse(rect.adjusted(arcHeight, arcHeight, -arcHeight, -arcHeight));
// path为扇形 subPath为椭圆
path -= subPath;
QFont font;
font.setFamily("Microsoft YaHei");
font.setPointSize(14);
painter->setPen(Qt::NoPen);
path.addText(path.pointAtPercent(0.5), font, QStringLiteral("一去丶二三里"));
painter->drawPath(path);
}
旋转
我们对前面的圆盘进行强化，添加一个旋转效果。当然，常见的抽奖圆盘旋转的是指针，而我们下面实现的是对圆盘的旋转，如果你要实现一个抽奖转盘，那么可以再扩展。
效果
这里写图片描述
源码
// 利用定时器，定时变换角度，进行旋转。
QTimer *pTimer = new QTimer(this);
pTimer->setInterval(100);
connect(pTimer, SIGNAL(timeout()), this, SLOT(updatePaint()));
pTimer->start();
// 改变角度，进行旋转
void MainWindow::updatePaint()
{
m_nRotationAngle++;
if (m_nRotationAngle > 360)
m_nRotationAngle = 0;
update();
}
然后，只需要在绘图事件中添加简单的一行代码即可：
void MainWindow::paintEvent(QPaintEvent *)
{
...
// 旋转
painter.rotate(m_nRotationAngle);
...
}
好了，基本的介绍就到这里，是不是很有意思呢，O(∩_∩)O哈哈~
展开阅读全文
©️2020 CSDN 皮肤主题: 技术黑板 设计师: CSDN官方博客 返回首页
实付0元
点击重新获取
扫码支付
钱包余额 0
抵扣说明：
1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、C币套餐、付费专栏及课程。
余额充值
|
{
"url": "https://waleon.blog.csdn.net/article/details/51394007",
"source_domain": "waleon.blog.csdn.net",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "227407",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GHSY2ZJFFMYIWRN4736TJXEMEC2HWZSH",
"WARC-Concurrent-To": "<urn:uuid:ddf264be-2aa7-44c6-af83-e0736c90e405>",
"WARC-Date": "2020-07-09T02:24:45Z",
"WARC-IP-Address": "47.95.47.253",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GWGFC3MONZ2J73EGGJI6ZW7REDJJVM2H",
"WARC-Record-ID": "<urn:uuid:7b10aa45-5a08-408a-9228-6ea5392dff58>",
"WARC-Target-URI": "https://waleon.blog.csdn.net/article/details/51394007",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ae13b6cf-0837-46cd-8604-ab1fa4a62550>"
},
"warc_info": "isPartOf: CC-MAIN-2020-29\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-149.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
16,
17,
20,
21,
71,
72,
98,
99,
102,
103,
150,
151,
154,
155,
163,
164,
167,
168,
211,
213,
241,
298,
299,
321,
345,
346,
378,
430,
431,
439,
453,
470,
508,
525,
540,
548,
621,
694,
767,
839,
911,
983,
1053,
1129,
1131,
1132,
1252,
1254,
1265,
1309,
1348,
1385,
1418,
1419,
1460,
1495,
1556,
1579,
1626,
1627,
1659,
1688,
1690,
1691,
1694,
1695,
1722,
1723,
1726,
1727,
1735,
1736,
1739,
1740,
1860,
1862,
1873,
1917,
1956,
1993,
2026,
2027,
2068,
2103,
2164,
2187,
2234,
2235,
2271,
2297,
2382,
2383,
2409,
2430,
2431,
2463,
2492,
2494,
2495,
2552,
2553,
2556,
2557,
2590,
2591,
2594,
2595,
2603,
2604,
2607,
2608,
2728,
2730,
2741,
2785,
2824,
2861,
2894,
2895,
2936,
2971,
3032,
3055,
3102,
3103,
3139,
3165,
3250,
3251,
3277,
3298,
3299,
3315,
3354,
3381,
3382,
3414,
3490,
3519,
3521,
3522,
3525,
3526,
3603,
3604,
3607,
3608,
3616,
3617,
3620,
3621,
3643,
3678,
3704,
3767,
3784,
3785,
3798,
3829,
3831,
3855,
3887,
3917,
3931,
3933,
3934,
3959,
3960,
4003,
4005,
4013,
4023,
4061,
4069,
4071,
4072,
4105,
4106,
4113,
4155,
4160,
4167,
4172,
4179,
4180,
4186,
4187,
4221,
4256,
4257
],
"line_end_idx": [
16,
17,
20,
21,
71,
72,
98,
99,
102,
103,
150,
151,
154,
155,
163,
164,
167,
168,
211,
213,
241,
298,
299,
321,
345,
346,
378,
430,
431,
439,
453,
470,
508,
525,
540,
548,
621,
694,
767,
839,
911,
983,
1053,
1129,
1131,
1132,
1252,
1254,
1265,
1309,
1348,
1385,
1418,
1419,
1460,
1495,
1556,
1579,
1626,
1627,
1659,
1688,
1690,
1691,
1694,
1695,
1722,
1723,
1726,
1727,
1735,
1736,
1739,
1740,
1860,
1862,
1873,
1917,
1956,
1993,
2026,
2027,
2068,
2103,
2164,
2187,
2234,
2235,
2271,
2297,
2382,
2383,
2409,
2430,
2431,
2463,
2492,
2494,
2495,
2552,
2553,
2556,
2557,
2590,
2591,
2594,
2595,
2603,
2604,
2607,
2608,
2728,
2730,
2741,
2785,
2824,
2861,
2894,
2895,
2936,
2971,
3032,
3055,
3102,
3103,
3139,
3165,
3250,
3251,
3277,
3298,
3299,
3315,
3354,
3381,
3382,
3414,
3490,
3519,
3521,
3522,
3525,
3526,
3603,
3604,
3607,
3608,
3616,
3617,
3620,
3621,
3643,
3678,
3704,
3767,
3784,
3785,
3798,
3829,
3831,
3855,
3887,
3917,
3931,
3933,
3934,
3959,
3960,
4003,
4005,
4013,
4023,
4061,
4069,
4071,
4072,
4105,
4106,
4113,
4155,
4160,
4167,
4172,
4179,
4180,
4186,
4187,
4221,
4256,
4257,
4261
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4261,
"ccnet_original_nlines": 190,
"rps_doc_curly_bracket": 0.002816240070387721,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.0050761401653289795,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010152280330657959,
"rps_doc_frac_lines_end_with_ellipsis": 0.01047119963914156,
"rps_doc_frac_no_alph_words": 0.6994923949241638,
"rps_doc_frac_unique_words": 0.3919753134250641,
"rps_doc_mean_word_length": 9.018518447875977,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0.0020304599311202765,
"rps_doc_unigram_entropy": 4.370663166046143,
"rps_doc_word_count": 324,
"rps_doc_frac_chars_dupe_10grams": 0.4404517412185669,
"rps_doc_frac_chars_dupe_5grams": 0.4404517412185669,
"rps_doc_frac_chars_dupe_6grams": 0.4404517412185669,
"rps_doc_frac_chars_dupe_7grams": 0.4404517412185669,
"rps_doc_frac_chars_dupe_8grams": 0.4404517412185669,
"rps_doc_frac_chars_dupe_9grams": 0.4404517412185669,
"rps_doc_frac_chars_top_2gram": 0.06570842117071152,
"rps_doc_frac_chars_top_3gram": 0.015058180317282677,
"rps_doc_frac_chars_top_4gram": 0.015400409698486328,
"rps_doc_books_importance": -336.8353271484375,
"rps_doc_books_importance_length_correction": -336.8353271484375,
"rps_doc_openwebtext_importance": -183.85763549804688,
"rps_doc_openwebtext_importance_length_correction": -183.85763549804688,
"rps_doc_wikipedia_importance": -129.80709838867188,
"rps_doc_wikipedia_importance_length_correction": -129.80709838867188
},
"fasttext": {
"dclm": 0.3262175917625427,
"english": 0.09359420835971832,
"fineweb_edu_approx": 2.332974672317505,
"eai_general_math": 0.5826267004013062,
"eai_open_web_math": 0.11438781023025513,
"eai_web_code": 0.8899953961372375
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
6,990,928,358,787,269,000 |
Windows error 0x000001F4, 500
Detailed Error Information
USER_PROFILE_LOAD[1]
MessageUser profile cannot be loaded.
Declared inwinerror.h
This appears to be a raw Win32 error. More information may be available in error 0x800701F4.
HRESULT analysis[2]
This is probably not the correct interpretation of this error. The Win32 error above is more likely to indicate the actual problem.
FlagsSeveritySuccess
This code indicates success, rather than an error. This may not be the correct interpretation of this code, or possibly the program is handling errors incorrectly.
Reserved (R)false
OriginMicrosoft
NTSTATUSfalse
Reserved (X)false
FacilityCode0 (0x000)
NameFACILITY_NULL[2][1]
DescriptionThe default facility code.[2][1]
Error Code500 (0x01f4)
Questions
2votes
1answer
Switch case's jump table position within code on ARM
In C/C++ a switch statement can be lowered by the compiler to a jump table. I noticed a difference of placement of the jump table between ARM and x86. X86 For x86 (And x86_64) the jump table is often placed outside of the function (e.g. .rodata) 4005e0: 48 8b 45 [...] read more
c
arm
reverse-engineering
compiler-optimization
jump-table
0votes
2answers
What is the space between [ELF Header] and [data segment]?
I compiled very very simple assembly code with nasm and ld under Linux (CentOS6 32bit). nasm -f elf -o basic1.o basic1.asm ld -o basic1 basic1.o cat basic1.asm ;--------------------------------------- section .data msg db 'hello world', 10, 00 section .bss tests resd 100 segment .text global _start _start: And, I execute the [...] read more
assembly
nasm
elf
0votes
0answers
PEVerify Defect: It reports "Type load failed" on valid class compiled with csc.exe for compact framework
A trivial class: public class TestClass : System.ServiceModel.Security.SecurityCredentialsManager { } When compiled using csc against the MS CompactFramework v3.5 will result in a dll that fails to pass peverify, resulting in a "Type load failure". It appears to be an issue with inheriting from the SecurityCredentialsManager class which is part [...] read more
c#
compact-framework
cil
csc
peverify
0votes
1answer
ListView in Fragment with adapter - can't add new objects - FATAL EXCEPTION
I'm creating an app with a tab layout consisting of three fragments. In one of these 3 Fragments I would like to have a ListView. And I would like to add ToSave objects to the ListView. I tried to add objects to the ListView from another Fragment using interface and [...] read more
android
listview
android-activity
android-fragments
android-listview
0votes
2answers
WinDbg with dump files when you have a classic ASP app which uses a lot of .Net via interop
Ok, first please don't ask why this application is the way it is. This is a classic ASP application which in several areas uses .Net and COM and some of that .Net also reaches into COM! It's all to do with code reuse really, at some point .Net was introduced [...] read more
.net
memory-leaks
asp-classic
windbg
0votes
1answer
How to send parameter to my device using libcam.dll in delphi
I have a code in Delphi I using the it to get picture from my 2D Reader, I am using 'camlib.dll' to set parameter of the Image in the device the code: unit Test_Cam; interface uses Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms, Dialogs, StdCtrls; type TByteArr = array [...] read more
delphi
winapi
delphi-2006
0votes
1answer
c++ unhandled exception LoadImage() with MAKEINTRESOURCE
I'm having a problem to add a bitmap image to a static control box, i got an unhandled exception when i run my program. Here's my code. FROM RC FILE : ID_ICON1 BITMAP "icon1.bmp" CPP FILE : HANDLE bIcon1; HWND hIcon; hIcon = CreateWindowEx(0, "Static", NULL, WS_CHILD | WS_VISIBLE|SS_BITMAP, 250, [...] read more
c++
resources
loadimage
-1votes
3answers
Error on large dimension value - Run-Time Check Failure #2 - Stack around the variable 'mat' was corrupted
I am getting following error: "Run-Time Check Failure #2 - Stack around the variable 'mat' was corrupted" after giving result in console. However, What I observed that, CreateMatrix function throws Access violation.. for larger matrix dimensions. For e.g. worked for 5x7 and did NOT work for 50 x 70. How [...] read more
c
pointers
memory
memory-management
access-violation
Comments
Leave a comment
(plain text only)
Sources
1. winerror.h from Windows SDK 10.0.14393.0
2. https://msdn.microsoft.com/en-us/library/cc231198.aspx
User contributions licensed under CC BY-SA 3.0
|
{
"url": "https://windows-hexerror.linestarve.com/0x000001F4",
"source_domain": "windows-hexerror.linestarve.com",
"snapshot_id": "crawl=CC-MAIN-2019-22",
"warc_metadata": {
"Content-Length": "12863",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GZTLIBNJXAAGFIDLFKBJ6WMP65TLUC6J",
"WARC-Concurrent-To": "<urn:uuid:2f0ccb4d-c20b-41bb-83a9-0152023a19bb>",
"WARC-Date": "2019-05-24T10:02:08Z",
"WARC-IP-Address": "199.38.183.38",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZBSPYRWSFOZUF6LEUIBBDG2JCBRKWNTU",
"WARC-Record-ID": "<urn:uuid:117ebaec-a6e4-4c92-bb5d-76d008e0d4ea>",
"WARC-Target-URI": "https://windows-hexerror.linestarve.com/0x000001F4",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0086706c-6247-4e63-b9a5-fff7d44e2599>"
},
"warc_info": "isPartOf: CC-MAIN-2019-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-150-165-216.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
30,
31,
58,
59,
80,
81,
119,
141,
142,
235,
236,
256,
257,
389,
410,
411,
575,
576,
594,
610,
624,
642,
664,
688,
732,
755,
756,
766,
767,
774,
782,
783,
836,
837,
1116,
1118,
1122,
1142,
1164,
1175,
1182,
1191,
1192,
1251,
1252,
1595,
1604,
1609,
1613,
1620,
1629,
1630,
1736,
1737,
2100,
2103,
2121,
2125,
2129,
2138,
2145,
2153,
2154,
2230,
2231,
2514,
2522,
2531,
2548,
2566,
2583,
2590,
2599,
2600,
2692,
2693,
2968,
2973,
2986,
2998,
3005,
3012,
3020,
3021,
3083,
3084,
3397,
3404,
3411,
3423,
3430,
3438,
3439,
3496,
3497,
3810,
3814,
3824,
3834,
3842,
3851,
3852,
3959,
3960,
4281,
4283,
4292,
4299,
4317,
4334,
4335,
4344,
4345,
4361,
4362,
4380,
4381,
4389,
4390,
4436,
4496,
4497
],
"line_end_idx": [
30,
31,
58,
59,
80,
81,
119,
141,
142,
235,
236,
256,
257,
389,
410,
411,
575,
576,
594,
610,
624,
642,
664,
688,
732,
755,
756,
766,
767,
774,
782,
783,
836,
837,
1116,
1118,
1122,
1142,
1164,
1175,
1182,
1191,
1192,
1251,
1252,
1595,
1604,
1609,
1613,
1620,
1629,
1630,
1736,
1737,
2100,
2103,
2121,
2125,
2129,
2138,
2145,
2153,
2154,
2230,
2231,
2514,
2522,
2531,
2548,
2566,
2583,
2590,
2599,
2600,
2692,
2693,
2968,
2973,
2986,
2998,
3005,
3012,
3020,
3021,
3083,
3084,
3397,
3404,
3411,
3423,
3430,
3438,
3439,
3496,
3497,
3810,
3814,
3824,
3834,
3842,
3851,
3852,
3959,
3960,
4281,
4283,
4292,
4299,
4317,
4334,
4335,
4344,
4345,
4361,
4362,
4380,
4381,
4389,
4390,
4436,
4496,
4497,
4543
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4543,
"ccnet_original_nlines": 122,
"rps_doc_curly_bracket": 0.0004402399936225265,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2718549966812134,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.054370999336242676,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24626865983009338,
"rps_doc_frac_unique_words": 0.5392592549324036,
"rps_doc_mean_word_length": 5.202962875366211,
"rps_doc_num_sentences": 68,
"rps_doc_symbol_to_word_ratio": 0.01172707974910736,
"rps_doc_unigram_entropy": 5.513420581817627,
"rps_doc_word_count": 675,
"rps_doc_frac_chars_dupe_10grams": 0.03246013820171356,
"rps_doc_frac_chars_dupe_5grams": 0.04954442009329796,
"rps_doc_frac_chars_dupe_6grams": 0.03246013820171356,
"rps_doc_frac_chars_dupe_7grams": 0.03246013820171356,
"rps_doc_frac_chars_dupe_8grams": 0.03246013820171356,
"rps_doc_frac_chars_dupe_9grams": 0.03246013820171356,
"rps_doc_frac_chars_top_2gram": 0.01822322979569435,
"rps_doc_frac_chars_top_3gram": 0.010250570252537727,
"rps_doc_frac_chars_top_4gram": 0.014806379564106464,
"rps_doc_books_importance": -429.475830078125,
"rps_doc_books_importance_length_correction": -429.475830078125,
"rps_doc_openwebtext_importance": -235.6424102783203,
"rps_doc_openwebtext_importance_length_correction": -235.6424102783203,
"rps_doc_wikipedia_importance": -220.39918518066406,
"rps_doc_wikipedia_importance_length_correction": -220.39918518066406
},
"fasttext": {
"dclm": 0.026935400441288948,
"english": 0.8042578101158142,
"fineweb_edu_approx": 2.020305871963501,
"eai_general_math": 0.366372287273407,
"eai_open_web_math": 0.2007489800453186,
"eai_web_code": 0.5664960741996765
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-7,212,171,685,922,313,000 |
WebAIM - Web Accessibility In Mind
Screen Reader User Survey #2 Results
Introduction
In October 2009, WebAIM conducted a survey of preferences of screen reader users. We received 665 valid responses to the screen reader user survey. This was a follow-up survey to a previous survey. Follow-up surveys were conducted in December 2010, May 2012, January 2014, July 2015, and October 2017.
A few disclaimers and notices:
• Totals may not equal 100% due to rounding.
• Total responses (n) for each question may not equal 665 due to respondents not answering that particular question.
• The sample was not controlled and may not represent all screen reader users.
• Care should be taken in interpreting these results. Responses are based upon user experiences with web content that is generally inaccessible. We cannot help but wonder if responses may have been different if screen reader interactions with web content were typically very positive.
• Data was analyzed using JMP Statistical Discovery Software version 8
• We hope to conduct a survey of this nature again in the future. If you have recommendations or questions you would like asked, please let us know. Additional analysis of this data and details on the responses to open-ended questions will be available in the future.
Demographics
Disability Reported
Pie chart showing reported disability
Do you use a screen reader due to a disability?
Response# of Respondents% of Respondents
Yes58690%
No6510%
Screen Reader Proficiency
Pie Chart of Screen Reader Proficiency
Please rate your screen reader proficiency
Response# of Respondents% of Respondents
Advanced33952.6%
Intermediate27642.8%
Beginner304.7%
Those who use screen readers due to a disability report themselves as being much more proficient with screen readers. Those with disabilities were nearly 6 times more likely to report themselves as having advanced screen reader proficiency. While it is not surprising that those with disabilities are more proficient with a screen reader, it was surprising that very few (1.6%) of them consider themselves beginners, as opposed to 32.8% of those without a disability. This may indicate that most screen reader users are confident with their technology, or perhaps more likely, that this online survey was primarily accessed by those with higher screen reader proficiency.
Internet Proficiency
Pie Chart of Internet Proficiency
Please rate your proficiency using the Internet
Response# of Respondents% of Respondents
Advanced42164.9%
Intermediate21833.6%
Beginner101.5%
Those who use screen readers due to a disability reported slightly lower Internet proficiency than those without disabilities.
Primary Screen Reader
Primary Screen Reader
Which of the following is your primary screen reader?
Screen Reader# of Respondents% of Respondents
JAWS43566.4%
Window Eyes6810.4%
VoiceOver588.9%
System Access or System Access To Go324.9%
NVDA192.9%
ZoomText172.6%
Hal40.6%
Supernova10.2%
Other213.2%
There was no marked difference in primary screen reader use between respondents with and without disabilities; however, those without disabilities were more likely to use NVDA (10.2% of respondents) than those with disabilities (2.2%).
Screen Readers Commonly Used
Screen Readers Commonly Used
Which of the following screen readers do you commonly use? (select all that apply)
Screen Reader# of Respondents% of Respondents
JAWS50075.2%
Window Eyes15623.5%
VoiceOver9714.6%
System Access or System Access To Go14822.3%
NVDA17025.6%
ZoomText507.5%
Supernova182.7%
Hal182.7%
Other517.7%
49% of respondents commonly use more than one screen reader. 23% use more than two and 8% use more than three screen readers. System Access or SAToGo and NVDA are relatively commonly used (23% and 26%, respectively), yet are less common as a primary screen readers (5% and 3%).
When compared to the results from our previous survey, JAWS and Window Eyes use is almost identical, yet NVDA, Voice Over, and System Access usage increased tremendously.
Screen Reader Updates
Screen Reader Updates
Has your primary screen reader been updated in the last year?
Response# of Respondents% of Respondents
Yes53783.6%
No10516.4%
The vast majority of respondents updated their primary screen reader within the previous year. This is slightly higher than the 75% who reported updating within a year in our previous survey. It's important to note, however, that a significant number of users may still be using screen readers that are several years old.
Reasons for Use
Reasons for Use
What is the main reason for using your primary screen reader?
Response# of Respondents% of Respondents
Existing Comfort/Expertise27042.9%
Features20732.9%
Availability7111.3%
Support457.1%
Cost375.9%
Those with disabilities indicated "Existing Comfort/Expertise" nearly three times as often as those without disabilities. Those without disabilities favored availability (36% of respondents) over all other factors.
Screen Reader Learning
Chart showing how screen readers were learned
How did you learn to use your primary screen reader? (select all that apply)
Response# of Respondents% of Respondents
Self-taught48572.9%
Informally, by asking friends, etc.21932.9%
Took a training course16124.2%
Other7010.5%
When comparing many of the other responses, there is very little difference in responses between those that were self-taught and those who took a training course.
How Obtained
Chart showing how screen readers were obtained
How did you obtain your primary screen reader?
Response# of Respondents% of Respondents
I bought it myself22334.7%
It was received through a government program14722.9%
It was provided to me by my employer11117.3%
Other629.7%
I downloaded it free of charge from the Internet325.0%
It was provided to me by my school264.0%
I'm using a pirated version of a commercial screen reader253.9%
I'm using a trial version of a commercial screen reader162.5%
36.6% of those with disabilities purchased their own screen reader as compared to only 9.7% of those without disabilities. While those without disabilities were most likely to get their screen reader from their employers (43.5%), they very rarely received them from government or school programs. 30.9% of beginning screen reader users obtained free, pirated, or freely downloadable screen readers compared to only 8.4% of advanced users.
Browsers
Chart showing browser usage
When using your primary screen reader, which browser do you use most often?
Browser# of Respondents% of Respondents
IE820732.0%
IE717026.2%
Firefox 3+12218.8%
IE68212.7%
Safari548.3%
Opera20.3%
Other111.7%
Note: The survey question asked which browser was most often used with the primary screen reader, but did not ask for any browsers used. Compare these answers with results from our previous survey results, which report all web browsers used.
In line with the previous survey, those without disabilities were much more likely to use Firefox than those with disabilities (32% to 17%). The number of Safari and Opera users, as expected, are very similar to the VoiceOver users documented above (note that VoiceOver support for Opera is very new).
Free/Low-cost Screen Readers
Pie chart showing viability of free/low cost screen readers
Do you see free or low-cost screen readers (such as NVDA or VoiceOver) as currently being viable alternatives to commercial screen readers?
Response# of Respondents% of Respondents
Yes31847.8%
No13119.7%
I Don't Know21632.5%
Interestingly, only 242 (36.4%) of respondents reported using NVDA or VoiceOver, yet 47.9% of respondents indicate that such screen readers are viable alternatives to commercial screen readers. Advanced screen reader users were more likely to indicate that these are viable alternatives.
Mobile Screen Reader Usage
Chart showing mobile screen reader usage
Do you use a screen reader on a mobile phone or mobile handheld device?
Response# of Respondents% of Respondents
Yes31350%
No31950%
To us, the fact that 53% of those with disabilities use a screen reader on a mobile device was one of the most surprising results of this survey. Only 8% of those without disabilities use a mobile screen reader. This underscores the importance of an increased focus on accessibility of mobile content and devices, and that evaluators and other accessibility specialists need to increase their usage and knowledge of mobile accessibility.
Not surprisingly, more proficient screen reader users were more likely to use a mobile screen reader (66% of advanced users to only 3% of beginners).
Javascript Disabled
Pie chart showing javascript disabled
Do you have javascript disabled in your web browser?
Response# of Respondents% of Respondents
Yes6210.4%
No44874.9%
I Don't Know8814.7%
This response may help strengthen the notion that scripted content must be made accessible. Many developers incorrectly believe that inaccessible scripting is permissible so long as it degrades gracefully or a non-scripted alternative is provided. The vast majority of screen reader respondents encounter scripted content.
Braille Output
Chart showing prevalence of braille output
Do you use braille output with your screen reader?
Response# of Respondents% of Respondents
Yes18529.4%
No44570.6%
This does not necessarily suggest that 29.4% of respondents rely on Braille output, but only that they have access to it.
Images and Alternative Text
"Smiling Lady" Images
Chart showing preferred description for smiling lady images
Images are commonly used in web pages to visually convey a feeling or mood. For example, a photo of a smiling woman might be included to convey that the company is personable and friendly. How would you prefer this image be handled?
Response# of Respondents% of Respondents
Described as "Photo of smiling lady"35657.1%
Described as "Smiling lady"12620.2%
Ignored entirely by my screen reader8012.8%
Described as "Our company is personable and friendly"629.9%
These responses should NOT be interpreted to suggest that all decorative images should be given alternative text or that the alt text for all photographs should begin with "Photo of...". Screen reader users prefer to have this "Smiling lady"-type image identified, even if the full content or meaning of the image cannot be conveyed. However, those without disabilities were three times more likely to prefer the image be ignored, suggesting that they view it as being decorative. This apparent disconnect between responses of those with disabilities and those without disabilities was found in a similar question on the previous survey. We cannot help but think that blind screen reader users might find their experiences less enjoyable if all such images, which are typically unidentified now, were suddenly identified to them. This underscores WebAIM's long held notion that providing proper, equivalent alternative text is the most difficult aspect of web accessibility. We will likely follow up on this issue in a future survey.
Complex Images
Some images, such as charts, diagrams, or comic strips, are too complex to describe in only a few words. If a long, detailed description of these images is available, how would you prefer to have it presented to you?
Response# of Respondents% of Respondents
As text on the web page, immediately following the image17828.4%
As optional text, available on the same page but only if I request it by following a link16726.6%
On a separate page, available by following a link12419.8%
As a very long description (alt text) on the image itself8914.2%
On a separate page, announced by and available to my screen reader579.1%
Ignored entirely by my screen reader121.9%
There is no clear consensus in these responses. However, the in-page options outweigh the options that place the longer description on another page. Interestingly, the option of placing the alternative on a separate page but having it announced by the screen reader, the current behavior of images with the longdesc attribute, was a very unpopular option, second only to being ignored entirely.
ARIA Landmarks
Chart showing usage of ARIA landmarks
ARIA (Accessible Rich Internet Applications) introduces something called landmarks. These provide quick access to page areas, such as navigation, search, and main content. Which of the following best describes your use of landmarks?
Response# of Respondents% of Respondents
I didn't know this functionality existed24042.1%
I sometimes use landmarks for navigation18332.1%
I use landmarks for navigation whenever they are present11720.5%
My screen reader does not support landmarks305.3%
With 42.1% of question respondents unaware of landmark functionality (95 respondents didn't even answer this question), this clearly suggests that additional training or dissemination about the utility of landmarks needs to occur.
Problematic Items
Most Problematic Items
The survey asked respondents to select their most, second most, and third most problematic items from a list. In giving each selected item a weighting, the following chart shows the amount of difficulty and frustration users encounter with each item.
Chart showing Most Problematic Items
Problematic items identified are, in order (most difficult/confusing first):
1. CAPTCHA - images presenting text used to verify that you are a human user
2. The presence of inaccessible Flash content
3. Links or buttons that do not make sense
4. Images with missing or improper descriptions (alt text)
5. Complex or difficult forms
6. Lack of keyboard accessibility
7. Screens or parts of screens that change unexpectedly
8. Missing or improper headings
9. Too many links or navigation items
10. Complex data tables
11. Lack of "skip to main content" or "skip navigation" links
12. Inaccessible or missing search functionality
The chart above shows a weighting of responses to three questions. When analyzing the single "Most Problematic Item" question, 28% of respondents listed CAPTCHA as the most problematic or confusing item encountered, with Flash (22%), Keyboard Accessibility (10%), and Ambiguous Links (10%) as other most problematic items.
It must be noted that Flash content, like most other items listed here, can be made accessible (at least for users on the Windows platform). In fact, Flash content can have other general accessibility issues listed (e.g., ambiguous links, difficult forms, missing alt text, etc.). While treated here as a distinct item, it's important to note that Flash is not inaccessible merely because it is present in a page, but because the Flash author has not implemented accessibility.
Least Problematic Items
Chart showing least problematic items
Of the items listed, which item causes the least amount of frustration or difficulty for you?
Response# of Respondents% of Respondents
Lack of "skip to main content" or "skip navigation" links18531.3%
Images with missing or improper descriptions (alt text)9415.9%
Too many links or navigation items579.6%
Complex or difficult forms427.1%
Missing or improper headings396.6%
Links or buttons that do not make sense396.6%
Lack of keyboard accessibility294.9%
Inaccessible or missing search functionality284.7%
Complex data tables264.4%
Screens or parts of screens that change unexpectedly193.2%
CAPTCHA - images presenting text used to verify that you are a human user193.2%
The presence of inaccessible Flash content152.5%
This shouldn't be interpreted to suggest that "skip" links or alternative text (note that alternative text is the 4th most problematic feature above) can or should be omitted. This data likely indicates that screen reader users tend to find issues with these items less problematic than other things, or more likely, that they encounter these problems so frequently they have developed alternative mechanisms to bypass or remedy these difficulties.
The fact that missing skip links are identified as the least problematic accessibility issue in this list reaffirms our own feeling that skip links are much more valuable for sighted users that rely on a keyboard for navigation than for screen reader users who tend to navigate by headings (see below).
Web Accessibility Progress
Chart showing web accessibility progress
In general, which of the following best describes your feelings regarding the accessibility of web content over the previous year?
Response# of Respondents% of Respondents
Web content has become more accessible28646.3%
Web content accessibility has not changed20633.3%
Web content has become less accessible12620.4%
Respondents generally think web accessibility has improved in the last year. Respondents with disabilities were less positive about progress than those without disabilities - they were 4 times more likely to indicate that web content accessibility has decreased in the previous year.
Impact on Accessibility
Chart showing impacts on accessibility
Which of the following do you think has a bigger impact on improvements to web accessibility?
Response# of Respondents% of Respondents
Better (more accessible) web sites43168.6%
Better assistive technology19731.4%
Reasons for Inaccessibility
Chart showing reasons for inaccessibility
Which of the following do you think is the primary reason that many developers do not create accessible web sites?
Response# of Respondents% of Respondents
Lack of awareness of web accessibility24238.0%
Lack of web accessibility skills or knowledge17627.6%
Fear that accessibility will hinder the look, feel, or functionality16425.7%
Lack of budget or resources to make it accessible558.6%
Respondents with disabilities were most likely to select "Lack of Awareness" as the primary reason developers do not create accessible web sites. However, respondents without disabilities favored "Lack of Knowledge" nearly twice as often as those with disabilities.
Social Media
Social Media Tools Frequently Used
Chart showing social media sites used
Which of the following social media sites or tools do you frequently use?
Social Media Tool# of Respondents% of Respondents
Blogs31747.7%
Facebook27942.0%
LinkedIn8913.4%
MySpace609.0%
Twitter25438.2%
YouTube34151.3%
Interestingly, YouTube (perhaps the most visual of the tools listed) has the highest usage. People without disabilities were more likely to use all of the social media tools, with the exception of MySpace, which had a higher prevalence among those with disabilities (though the lowest usage overall).
Blog Accessibility
Chart showing blog accessibility
How accessible are blogs to you?
Response# of Respondents% of Respondents
Very Accessible20944.8%
Somewhat Accessible22648.4%
Somewhat Inaccessible286.0%
Very Inaccessible40.9%
Of those who use blogs or are familiar with blog accessibility, nearly all (93.2%) report that they are very or somewhat accessible.
Facebook Accessibility
Chart showing Facebook accessibility
How accessible is FaceBook to you?
Response# of Respondents% of Respondents
Very Accessible3610.0%
Somewhat Accessible17548.7%
Somewhat Inaccessible10027.9%
Very Inaccessible4813.4%
LinkedIn Accessibility
Chart showing LinkedIn accessibility
How accessible is LinkedIn to you?
Response# of Respondents% of Respondents
Very Accessible169.8%
Somewhat Accessible4728.7%
Somewhat Inaccessible5030.5%
Very Inaccessible5131.1%
MySpace Accessibility
Chart showing MySpace accessibility
How accessible is MySpace to you?
Response# of Respondents% of Respondents
Very Accessible4239.3%
Somewhat Accessible4945.8%
Somewhat Inaccessible1110.3%
Very Inaccessible54.7%
Twitter Accessibility
Chart showing Twitter accessibility
How accessible is Twitter to you?
Response# of Respondents% of Respondents
Very Accessible17261.9%
Somewhat Accessible8129.1%
Somewhat Inaccessible145.0%
Very Inaccessible114.0%
We're confident that the high accessibility of Twitter is a result of accessible Twitter clients, particularly AccessibleTwitter.com.
YouTube Accessibility
Chart showing YouTube accessibility
How accessible is YouTube to you?
Response# of Respondents% of Respondents
Very Accessible11126.1%
Somewhat Accessible22352.5%
Somewhat Inaccessible6114.4%
Very Inaccessible307.1%
Social Media Accessibility
Chart showing social media accessibility
In general, how accessible are social media web sites to you?
Response# of Respondents% of Respondents
Very Accessible458.3%
Somewhat Accessible28552.7%
Somewhat Inaccessible10719.8%
Very Inaccessible254.6%
I Don't Know7914.6%
While social media tools and sites are generally considered to have good accessibility, the details above highlight that accessibility varies greatly across such tools.
Flash Accessibility
Chart showing reported Flash accessibility
When you encounter Flash content on web sites, how likely is it to be accessible to you?
Response# of Respondents% of Respondents
Very Likely294.8%
Somewhat Likely16927.8%
Somewhat Unlikely16527.1%
Very Unlikely21635.5%
I Don't Know304.9%
It should be noted that while respondents indicate generally poor likelihood for Flash accessibility (62.6% say it is somewhat or very unlikely), there is no general baseline for comparison. In other words, there's no way of knowing how much more likely it is for Flash content to be inaccessible than non-Flash web content. Still, these results are very similar to our previous survey results which showed 71.5% of screen reader users reporting that Flash is difficult. As noted above, unlike graphical CAPTCHAs, Flash can be made fully accessible on certain platforms, but it remains an issue primarily because authors do not implement Flash accessibility.
Finding Information
Pie chart showing methods for finding information on a page
When trying to find information on a lengthy web page, which of the following are you most likely to do first?
Response# of Respondents% of Respondents
Navigate through the headings on the page32150.8%
Use the "Find" feature14522.9%
Navigate through the links of the page10216.1%
Read through the page6410.1%
These responses underscore our previous findings which indicate that a good heading structure is a very important aspect of web accessibility and usability.
Conclusion
The conclusion identified in the previous screen reader user survey, that there is no typical screen reader user, is solidified in the results of this survey. Perhaps most significant to us are the shifts we have seen in the mere 10 months between surveys - particularly in browser and screen reader usage, with a trend toward and increased favorability of free and low-cost screen readers. Some results solidified previous findings - that good heading structure is vital to accessibility, that Flash content continues to pose significant accessibility issues for screen reader users, and that images that convey content should be identified for users. It is also clear that the mobile web is a highly utilized resource by screen reader users, yet it is an area largely unnoticed by accessibility experts practitioners.
We hope that these results will provide insight to developers and cause us to rethink and better analyze development choices that we make for screen reader users. More analysis of the results will be provided in the near future.
|
{
"url": "https://webaim.org/projects/screenreadersurvey2/",
"source_domain": "webaim.org",
"snapshot_id": "crawl=CC-MAIN-2020-16",
"warc_metadata": {
"Content-Length": "53271",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FHLFCM6OHGGFDBLX6GUO7KA7XYCOPTMB",
"WARC-Concurrent-To": "<urn:uuid:8a491fda-1b41-4ebc-999f-75ed761bb21b>",
"WARC-Date": "2020-04-08T09:25:51Z",
"WARC-IP-Address": "3.20.59.76",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:H5CSJHWFGER6TB7S5FYUHT5OFUNZ4B4Z",
"WARC-Record-ID": "<urn:uuid:7ca58bc4-8ebd-4f17-a386-7bf0ad820bb5>",
"WARC-Target-URI": "https://webaim.org/projects/screenreadersurvey2/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:005fe017-213f-4412-b11b-26405d96d163>"
},
"warc_info": "isPartOf: CC-MAIN-2020-16\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-193.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
35,
36,
73,
74,
87,
88,
390,
391,
422,
423,
470,
589,
670,
957,
1030,
1300,
1301,
1314,
1315,
1335,
1336,
1374,
1375,
1423,
1464,
1474,
1482,
1483,
1509,
1510,
1549,
1550,
1593,
1634,
1651,
1672,
1687,
1688,
2360,
2361,
2382,
2383,
2417,
2418,
2466,
2507,
2524,
2545,
2560,
2561,
2688,
2689,
2711,
2712,
2734,
2735,
2789,
2835,
2848,
2867,
2883,
2926,
2937,
2952,
2961,
2976,
2988,
2989,
3225,
3226,
3255,
3256,
3285,
3286,
3369,
3415,
3428,
3448,
3465,
3510,
3523,
3538,
3554,
3564,
3576,
3577,
3855,
3856,
4027,
4028,
4050,
4051,
4073,
4074,
4136,
4177,
4189,
4200,
4201,
4523,
4524,
4540,
4541,
4557,
4558,
4620,
4661,
4696,
4713,
4733,
4747,
4758,
4759,
4974,
4975,
4998,
4999,
5045,
5046,
5123,
5164,
5184,
5228,
5259,
5272,
5273,
5436,
5437,
5450,
5451,
5498,
5499,
5546,
5587,
5614,
5667,
5712,
5724,
5779,
5820,
5884,
5946,
5947,
6386,
6387,
6396,
6397,
6425,
6426,
6502,
6542,
6554,
6566,
6585,
6596,
6609,
6620,
6632,
6633,
6875,
6876,
7178,
7179,
7208,
7209,
7269,
7270,
7410,
7451,
7463,
7474,
7495,
7496,
7784,
7785,
7812,
7813,
7854,
7855,
7927,
7968,
7978,
7987,
7988,
8426,
8427,
8577,
8578,
8598,
8599,
8637,
8638,
8691,
8732,
8743,
8754,
8774,
8775,
9098,
9099,
9114,
9115,
9158,
9159,
9210,
9251,
9263,
9274,
9275,
9397,
9398,
9426,
9427,
9449,
9450,
9510,
9511,
9744,
9785,
9830,
9866,
9910,
9970,
9971,
11005,
11006,
11021,
11022,
11239,
11280,
11345,
11443,
11501,
11566,
11639,
11682,
11683,
12078,
12079,
12094,
12095,
12133,
12134,
12367,
12408,
12457,
12506,
12571,
12621,
12622,
12853,
12854,
12872,
12873,
12896,
12897,
13148,
13149,
13186,
13187,
13264,
13265,
13344,
13392,
13437,
13498,
13530,
13566,
13624,
13658,
13698,
13724,
13788,
13839,
13840,
14163,
14164,
14642,
14643,
14667,
14668,
14706,
14707,
14801,
14842,
14908,
14971,
15012,
15045,
15080,
15126,
15163,
15214,
15240,
15299,
15379,
15428,
15429,
15878,
15879,
16182,
16183,
16210,
16211,
16252,
16253,
16384,
16425,
16472,
16522,
16569,
16570,
16854,
16855,
16879,
16880,
16919,
16920,
17014,
17055,
17098,
17134,
17135,
17163,
17164,
17206,
17207,
17322,
17363,
17410,
17464,
17541,
17597,
17598,
17864,
17865,
17878,
17879,
17914,
17915,
17953,
17954,
18028,
18078,
18092,
18109,
18125,
18139,
18155,
18171,
18172,
18473,
18474,
18493,
18494,
18527,
18528,
18561,
18602,
18626,
18654,
18682,
18705,
18706,
18839,
18840,
18863,
18864,
18901,
18902,
18937,
18978,
19001,
19029,
19059,
19084,
19085,
19108,
19109,
19146,
19147,
19182,
19223,
19245,
19272,
19301,
19326,
19327,
19349,
19350,
19386,
19387,
19421,
19462,
19485,
19512,
19541,
19564,
19565,
19587,
19588,
19624,
19625,
19659,
19700,
19724,
19751,
19779,
19803,
19804,
19938,
19939,
19961,
19962,
19998,
19999,
20033,
20074,
20098,
20126,
20155,
20179,
20180,
20207,
20208,
20249,
20250,
20312,
20353,
20375,
20403,
20433,
20457,
20477,
20478,
20647,
20648,
20668,
20669,
20712,
20713,
20802,
20843,
20861,
20885,
20911,
20933,
20952,
20953,
21612,
21613,
21633,
21634,
21694,
21695,
21806,
21847,
21897,
21928,
21975,
22004,
22005,
22162,
22163,
22174,
22175,
22995,
22996
],
"line_end_idx": [
35,
36,
73,
74,
87,
88,
390,
391,
422,
423,
470,
589,
670,
957,
1030,
1300,
1301,
1314,
1315,
1335,
1336,
1374,
1375,
1423,
1464,
1474,
1482,
1483,
1509,
1510,
1549,
1550,
1593,
1634,
1651,
1672,
1687,
1688,
2360,
2361,
2382,
2383,
2417,
2418,
2466,
2507,
2524,
2545,
2560,
2561,
2688,
2689,
2711,
2712,
2734,
2735,
2789,
2835,
2848,
2867,
2883,
2926,
2937,
2952,
2961,
2976,
2988,
2989,
3225,
3226,
3255,
3256,
3285,
3286,
3369,
3415,
3428,
3448,
3465,
3510,
3523,
3538,
3554,
3564,
3576,
3577,
3855,
3856,
4027,
4028,
4050,
4051,
4073,
4074,
4136,
4177,
4189,
4200,
4201,
4523,
4524,
4540,
4541,
4557,
4558,
4620,
4661,
4696,
4713,
4733,
4747,
4758,
4759,
4974,
4975,
4998,
4999,
5045,
5046,
5123,
5164,
5184,
5228,
5259,
5272,
5273,
5436,
5437,
5450,
5451,
5498,
5499,
5546,
5587,
5614,
5667,
5712,
5724,
5779,
5820,
5884,
5946,
5947,
6386,
6387,
6396,
6397,
6425,
6426,
6502,
6542,
6554,
6566,
6585,
6596,
6609,
6620,
6632,
6633,
6875,
6876,
7178,
7179,
7208,
7209,
7269,
7270,
7410,
7451,
7463,
7474,
7495,
7496,
7784,
7785,
7812,
7813,
7854,
7855,
7927,
7968,
7978,
7987,
7988,
8426,
8427,
8577,
8578,
8598,
8599,
8637,
8638,
8691,
8732,
8743,
8754,
8774,
8775,
9098,
9099,
9114,
9115,
9158,
9159,
9210,
9251,
9263,
9274,
9275,
9397,
9398,
9426,
9427,
9449,
9450,
9510,
9511,
9744,
9785,
9830,
9866,
9910,
9970,
9971,
11005,
11006,
11021,
11022,
11239,
11280,
11345,
11443,
11501,
11566,
11639,
11682,
11683,
12078,
12079,
12094,
12095,
12133,
12134,
12367,
12408,
12457,
12506,
12571,
12621,
12622,
12853,
12854,
12872,
12873,
12896,
12897,
13148,
13149,
13186,
13187,
13264,
13265,
13344,
13392,
13437,
13498,
13530,
13566,
13624,
13658,
13698,
13724,
13788,
13839,
13840,
14163,
14164,
14642,
14643,
14667,
14668,
14706,
14707,
14801,
14842,
14908,
14971,
15012,
15045,
15080,
15126,
15163,
15214,
15240,
15299,
15379,
15428,
15429,
15878,
15879,
16182,
16183,
16210,
16211,
16252,
16253,
16384,
16425,
16472,
16522,
16569,
16570,
16854,
16855,
16879,
16880,
16919,
16920,
17014,
17055,
17098,
17134,
17135,
17163,
17164,
17206,
17207,
17322,
17363,
17410,
17464,
17541,
17597,
17598,
17864,
17865,
17878,
17879,
17914,
17915,
17953,
17954,
18028,
18078,
18092,
18109,
18125,
18139,
18155,
18171,
18172,
18473,
18474,
18493,
18494,
18527,
18528,
18561,
18602,
18626,
18654,
18682,
18705,
18706,
18839,
18840,
18863,
18864,
18901,
18902,
18937,
18978,
19001,
19029,
19059,
19084,
19085,
19108,
19109,
19146,
19147,
19182,
19223,
19245,
19272,
19301,
19326,
19327,
19349,
19350,
19386,
19387,
19421,
19462,
19485,
19512,
19541,
19564,
19565,
19587,
19588,
19624,
19625,
19659,
19700,
19724,
19751,
19779,
19803,
19804,
19938,
19939,
19961,
19962,
19998,
19999,
20033,
20074,
20098,
20126,
20155,
20179,
20180,
20207,
20208,
20249,
20250,
20312,
20353,
20375,
20403,
20433,
20457,
20477,
20478,
20647,
20648,
20668,
20669,
20712,
20713,
20802,
20843,
20861,
20885,
20911,
20933,
20952,
20953,
21612,
21613,
21633,
21634,
21694,
21695,
21806,
21847,
21897,
21928,
21975,
22004,
22005,
22162,
22163,
22174,
22175,
22995,
22996,
23224
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 23224,
"ccnet_original_nlines": 468,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.33433663845062256,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007872190326452255,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22620977461338043,
"rps_doc_frac_unique_words": 0.2542172074317932,
"rps_doc_mean_word_length": 5.588043689727783,
"rps_doc_num_sentences": 290,
"rps_doc_symbol_to_word_ratio": 0.007640659809112549,
"rps_doc_unigram_entropy": 5.734463691711426,
"rps_doc_word_count": 3379,
"rps_doc_frac_chars_dupe_10grams": 0.005825649946928024,
"rps_doc_frac_chars_dupe_5grams": 0.15437982976436615,
"rps_doc_frac_chars_dupe_6grams": 0.10348480194807053,
"rps_doc_frac_chars_dupe_7grams": 0.08108250796794891,
"rps_doc_frac_chars_dupe_8grams": 0.03844932094216347,
"rps_doc_frac_chars_dupe_9grams": 0.020230909809470177,
"rps_doc_frac_chars_top_2gram": 0.048194050788879395,
"rps_doc_frac_chars_top_3gram": 0.024626629427075386,
"rps_doc_frac_chars_top_4gram": 0.042686160653829575,
"rps_doc_books_importance": -1424.4404296875,
"rps_doc_books_importance_length_correction": -1424.4404296875,
"rps_doc_openwebtext_importance": -905.0848388671875,
"rps_doc_openwebtext_importance_length_correction": -905.0848388671875,
"rps_doc_wikipedia_importance": -508.1864013671875,
"rps_doc_wikipedia_importance_length_correction": -508.1864013671875
},
"fasttext": {
"dclm": 0.02383410930633545,
"english": 0.9239017963409424,
"fineweb_edu_approx": 2.711305618286133,
"eai_general_math": 0.20259135961532593,
"eai_open_web_math": 0.1392192244529724,
"eai_web_code": 0.2107023000717163
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "658.8",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "5",
"label": "Evaluate"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
8,941,263,013,740,257,000 |
Using Arm64EC to build apps for Windows 11 on Arm devices
Arm64EC (“Emulation Compatible”) is a new application binary interface (ABI) for building apps for Windows 11 on Arm. With Arm64EC, you can build new Arm64 native apps or incrementally transition existing apps to take advantage of the native speed and performance possible with Arm64-powered devices, including better power consumption, battery life, and accelerated AI & ML workloads.
ARM64EC uses the latest Windows SDK and remote-targeting with Visual Studio and the ARM64EC built tools. Even if your app relies on existing dependencies or plugins that don't yet support Arm, ARM64EC is interoperable with x64 and allows you to mix and match Arm64EC and x64 as needed - with Arm64EC code running natively, while x64 code runs using emulation that comes built-in with Windows 11.
You can read more about Arm64EC on the Windows Developer blog.
Get started building Win32 apps as Arm64EC
To start building Win32 apps as Arm64EC, you'll need to install these prerequisites:
Once the Windows Insider SDK and Visual Studio Preview have been installed, follow these steps to add the Arm64EC platform.
1. In the Visual Studio Installer, add the Arm64EC tools by searching under Individual components and selecting the MSVC v142 - VS 2019 C++ Arm64EC build tools checkbox, currently marked as experimental.
Visual Studio Installer Arm64EC checkbox screenshot
2. With the tools and SDK installed, create a new C++ project or open an existing one.
Note
If your project is using an older SDK or older version of MSVC, you'll need to retarget the solution to use the latest version of each.
3. To add the Arm64EC platform:
• In the Build menu, select Configuration Manager.
• In the Active solution platform box, select <New…> to create a new platform.
• Select Arm64EC, Copy settings from x64, and check the Create new project platforms checkbox.
Visual Studio Installer New Arm64EC Platform screenshot
You can choose to leave parts of the solution as x64 as needed. However, the more code built as Arm64EC, the more code that will run with native performance on Windows 11 on Arm. For any external dependencies, ensure that your project links against the x64 or Arm64EC versions of those projects.
4. With the new solution platform in place, select Build in Visual Studio to start building Arm64EC binaries.
|
{
"url": "https://docs.microsoft.com/de-de/windows/arm/arm64ec",
"source_domain": "docs.microsoft.com",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "39087",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5LKMAMOOILV3RPG2QQNOIKG6QXYBCQG6",
"WARC-Concurrent-To": "<urn:uuid:fd7a12ac-8e2d-4309-b199-b98dec303e66>",
"WARC-Date": "2022-06-27T12:12:36Z",
"WARC-IP-Address": "23.208.54.245",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5IKIM6LX7A2YJQLM3NUEC4ZRDIG5KYNI",
"WARC-Record-ID": "<urn:uuid:b051e502-07ef-4e58-9497-9d37a50dddde>",
"WARC-Target-URI": "https://docs.microsoft.com/de-de/windows/arm/arm64ec",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6b767007-14b6-487a-a9d1-488ea44ace6f>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-34\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
58,
59,
445,
446,
842,
843,
906,
907,
950,
951,
1036,
1037,
1161,
1162,
1368,
1369,
1425,
1426,
1515,
1516,
1525,
1526,
1666,
1667,
1701,
1702,
1757,
1840,
1939,
1940,
2000,
2001,
2301,
2302
],
"line_end_idx": [
58,
59,
445,
446,
842,
843,
906,
907,
950,
951,
1036,
1037,
1161,
1162,
1368,
1369,
1425,
1426,
1515,
1516,
1525,
1526,
1666,
1667,
1701,
1702,
1757,
1840,
1939,
1940,
2000,
2001,
2301,
2302,
2413
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2413,
"ccnet_original_nlines": 34,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.30734968185424805,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03340756893157959,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15812918543815613,
"rps_doc_frac_unique_words": 0.4427083432674408,
"rps_doc_mean_word_length": 4.973958492279053,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0.0022271699272096157,
"rps_doc_unigram_entropy": 4.708130836486816,
"rps_doc_word_count": 384,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07329843193292618,
"rps_doc_frac_chars_dupe_6grams": 0.021989529952406883,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.037696339190006256,
"rps_doc_frac_chars_top_3gram": 0.017277490347623825,
"rps_doc_frac_chars_top_4gram": 0.021989529952406883,
"rps_doc_books_importance": -202.50169372558594,
"rps_doc_books_importance_length_correction": -202.50169372558594,
"rps_doc_openwebtext_importance": -95.90101623535156,
"rps_doc_openwebtext_importance_length_correction": -95.90101623535156,
"rps_doc_wikipedia_importance": -46.9177360534668,
"rps_doc_wikipedia_importance_length_correction": -46.9177360534668
},
"fasttext": {
"dclm": 0.06757712364196777,
"english": 0.8916097283363342,
"fineweb_edu_approx": 1.8708791732788086,
"eai_general_math": 0.16636252403259277,
"eai_open_web_math": 0.05560344085097313,
"eai_web_code": 0.7231795787811279
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-1,265,262,648,963,775,700 |
~samwhited/xmpp
ref: e8c09b3ff1c1489c21d96a0f7f8f0e8728fc095a xmpp/form/options.go -rw-r--r-- 2.2 KiB
e8c09b3fSam Whited design: fix typo in design doc template 1 year, 4 months ago
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
// Copyright 2017 The Mellium Contributors.
// Use of this source code is governed by the BSD 2-clause
// license that can be found in the LICENSE file.
package form
// An Field is used to define the behavior and appearance of a data form.
type Field func(*Data)
// Title sets a form's title.
func Title(s string) Field {
return func(data *Data) {
data.title = s
}
}
// Instructions adds new textual instructions to the form.
func Instructions(s string) Field {
return func(data *Data) {
data.instructions = s
}
}
var (
// Result marks a form as the result type.
// For more information see TypeResult.
Result Field = result
)
var (
result Field = func(data *Data) {
data.typ = TypeResult
}
)
// A Option is used to define the behavior and appearance of a form field.
type Option func(*field)
var (
// Required flags the field as required in order for the form to be considered
// valid.
Required Option = required
)
var (
required Option = func(f *field) {
f.required = true
}
)
// Desc provides a natural-language description of the field, intended for
// presentation in a user-agent (e.g., as a "tool-tip", help button, or
// explanatory text provided near the field).
// Desc should not contain newlines (the \n and \r characters), since layout is
// the responsibility of a user agent.
// However, it does nothing to prevent them from being added.
func Desc(s string) Option {
return func(f *field) {
f.desc = s
}
}
// Value defines the default value for the field.
// Fields of type ListMulti, JidMulti, TextMulti, and Hidden may contain more
// than one Value; all other field types will only use the first Value.
func Value(s string) Option {
return func(f *field) {
f.value = append(f.value, s)
}
}
// Label defines a human-readable name for the field.
func Label(s string) Option {
return func(f *field) {
f.label = s
}
}
// ListItem adds a list item with the provided label and value.
// It has no effect on any non-list field type.
func ListItem(label, value string) Option {
return func(f *field) {
f.option = append(f.option, fieldOpt{
Label: label,
Value: value,
})
}
}
func getFieldOpts(f *field, o ...Option) {
for _, opt := range o {
opt(f)
}
return
}
|
{
"url": "https://git.sr.ht/~samwhited/xmpp/tree/e8c09b3ff1c1489c21d96a0f7f8f0e8728fc095a/item/form/options.go",
"source_domain": "git.sr.ht",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "25072",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CJORDGBGKCR54O7QXGU62OKP32LJZELT",
"WARC-Concurrent-To": "<urn:uuid:d5846002-7563-4f7c-ae67-f355cc0b8582>",
"WARC-Date": "2022-07-02T10:18:58Z",
"WARC-IP-Address": "173.195.146.142",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WTIBCHOP6R7DCEFCJ2UZ2G2LKJMZSOJI",
"WARC-Record-ID": "<urn:uuid:f41d8bd6-32d0-4c29-8a26-0f291a39b7ab>",
"WARC-Target-URI": "https://git.sr.ht/~samwhited/xmpp/tree/e8c09b3ff1c1489c21d96a0f7f8f0e8728fc095a/item/form/options.go",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cf3e34eb-85a6-4e42-af5c-99bf20467b43>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-63\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
16,
17,
103,
183,
264,
266,
268,
270,
272,
274,
276,
278,
280,
282,
285,
288,
291,
294,
297,
300,
303,
306,
309,
312,
315,
318,
321,
324,
327,
330,
333,
336,
339,
342,
345,
348,
351,
354,
357,
360,
363,
366,
369,
372,
375,
378,
381,
384,
387,
390,
393,
396,
399,
402,
405,
408,
411,
414,
417,
420,
423,
426,
429,
432,
435,
438,
441,
444,
447,
450,
453,
456,
459,
462,
465,
468,
471,
474,
477,
480,
483,
486,
489,
492,
495,
498,
501,
504,
507,
510,
513,
516,
519,
522,
525,
528,
531,
534,
537,
540,
584,
643,
693,
694,
707,
708,
782,
805,
806,
836,
865,
892,
909,
912,
914,
915,
974,
1010,
1037,
1061,
1064,
1066,
1067,
1073,
1117,
1158,
1181,
1183,
1184,
1190,
1225,
1249,
1252,
1254,
1255,
1330,
1355,
1356,
1362,
1442,
1453,
1481,
1483,
1484,
1490,
1526,
1546,
1549,
1551,
1552,
1627,
1699,
1745,
1825,
1864,
1926,
1955,
1980,
1993,
1996,
1998,
1999,
2049,
2127,
2199,
2229,
2254,
2285,
2288,
2290,
2291,
2345,
2375,
2400,
2414,
2417,
2419,
2420,
2484,
2532,
2576,
2601,
2641,
2658,
2675,
2680,
2683,
2685,
2686,
2729,
2754,
2763,
2766,
2774
],
"line_end_idx": [
16,
17,
103,
183,
264,
266,
268,
270,
272,
274,
276,
278,
280,
282,
285,
288,
291,
294,
297,
300,
303,
306,
309,
312,
315,
318,
321,
324,
327,
330,
333,
336,
339,
342,
345,
348,
351,
354,
357,
360,
363,
366,
369,
372,
375,
378,
381,
384,
387,
390,
393,
396,
399,
402,
405,
408,
411,
414,
417,
420,
423,
426,
429,
432,
435,
438,
441,
444,
447,
450,
453,
456,
459,
462,
465,
468,
471,
474,
477,
480,
483,
486,
489,
492,
495,
498,
501,
504,
507,
510,
513,
516,
519,
522,
525,
528,
531,
534,
537,
540,
584,
643,
693,
694,
707,
708,
782,
805,
806,
836,
865,
892,
909,
912,
914,
915,
974,
1010,
1037,
1061,
1064,
1066,
1067,
1073,
1117,
1158,
1181,
1183,
1184,
1190,
1225,
1249,
1252,
1254,
1255,
1330,
1355,
1356,
1362,
1442,
1453,
1481,
1483,
1484,
1490,
1526,
1546,
1549,
1551,
1552,
1627,
1699,
1745,
1825,
1864,
1926,
1955,
1980,
1993,
1996,
1998,
1999,
2049,
2127,
2199,
2229,
2254,
2285,
2288,
2290,
2291,
2345,
2375,
2400,
2414,
2417,
2419,
2420,
2484,
2532,
2576,
2601,
2641,
2658,
2675,
2680,
2683,
2685,
2686,
2729,
2754,
2763,
2766,
2774,
2775
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2775,
"ccnet_original_nlines": 194,
"rps_doc_curly_bracket": 0.012252249754965305,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.21099554002285004,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004457649774849415,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4472511112689972,
"rps_doc_frac_unique_words": 0.6191588640213013,
"rps_doc_mean_word_length": 4.411214828491211,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0.0014858799986541271,
"rps_doc_unigram_entropy": 5.198447227478027,
"rps_doc_word_count": 428,
"rps_doc_frac_chars_dupe_10grams": 0.04343219846487045,
"rps_doc_frac_chars_dupe_5grams": 0.13347457349300385,
"rps_doc_frac_chars_dupe_6grams": 0.04343219846487045,
"rps_doc_frac_chars_dupe_7grams": 0.04343219846487045,
"rps_doc_frac_chars_dupe_8grams": 0.04343219846487045,
"rps_doc_frac_chars_dupe_9grams": 0.04343219846487045,
"rps_doc_frac_chars_top_2gram": 0.02118643932044506,
"rps_doc_frac_chars_top_3gram": 0.0381355881690979,
"rps_doc_frac_chars_top_4gram": 0.048728808760643005,
"rps_doc_books_importance": -272.67327880859375,
"rps_doc_books_importance_length_correction": -272.67327880859375,
"rps_doc_openwebtext_importance": -149.5433349609375,
"rps_doc_openwebtext_importance_length_correction": -149.5433349609375,
"rps_doc_wikipedia_importance": -66.94992065429688,
"rps_doc_wikipedia_importance_length_correction": -66.94992065429688
},
"fasttext": {
"dclm": 0.3391367197036743,
"english": 0.45055121183395386,
"fineweb_edu_approx": 2.2535386085510254,
"eai_general_math": 0.7878277897834778,
"eai_open_web_math": 0.0702594518661499,
"eai_web_code": 0.6685287356376648
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
4,668,453,332,791,528,000 |
Thursday, April 5, 2012
Talking to your computer
I spent the last few days helping one of my friends set up voice recognition software. Theoretically, this is the "holy grail" of computing if you believe in Star Trek. We would all like to speak to our computer and have it do all the keyboarding for us automatically but since its introduction at the Seattle Worlds Fair in 1962, voice recognition has never quite lived up to its promise.
Just to give you an idea of what voice recognition can or cannot do, I an going to dictate the rest of this Blog post. So that you will get an idea of how it works (or doesn't) I will NOT MAKE ANY CHANGES or edits to the text of the post:
The dictation starts right here. I am using DragonDictate on a Macintosh computer. I have a Plantronics digital headset with a USB connection to that computer. Over the years, I have used Dragon naturally speaking and Dragon dictate and various other programs because I am always looking for a way to input text or rapidly than typing from the keyboard. Unfortunately, whenever I have tried using the programs, I always find that certain words are not recognize properly. I realize that this occurs primarily because as I continue to speak, I have a tendency to slur my words together.
As I dictate this portion of the post, I am refraining from making any error corrections purposely to show what you have to do to go back through the text and correct the mistakes. The main thing that I have found, however, is that I am used to rewriting as I go along. This is quite hard to do using a voice-recognition program.
Another challenge, comes from using voice recognition in a database program. Unless the database program adapts well to the limitations of voice recognition it is no easier to use voice recognition than it is to use the keyboard. This is especially true, if you have to continue to use the mouse every time you move to a new window or location for entering data into the program. I have noticed, that the voice recognition programs do a credibly good job in recognizing names. You can probably guess, that the VR programs do not do a very good job with name variations. Such as spelling Stevens within the or APH.
As I continue to dictate if you read carefully, you will see that some of the sentences are garbled. Technically, you're supposed to go back and make the corrections using voice recognition which teaches the program how to understand your oral dictation. It is just the nature of the products, even when they have a provision for learning your speech patterns, to miss some types of words. In addition, I find it quite difficult to (I might note, that the program crashed at this point in the dictation). In addition, I find it quite difficult to proofread the text, especially when there is a missing word. It is also difficult to detect the wrong word inserted in the text.
All in all, using voice recognition, like speeding along on the freeway, does not always get you to your destination. Because you travel so fast on a freeway you have a tendency to drive out of your way to travel along the freeway, when it would've taken less time on the regular city streets. Because of the novelty, the ease-of-use, and the apparent ability that voice recognition has recognized most of your text, you have an illusion of productivity but I truly question whether you lose any advantage in the need to do careful proofreading.
Not that my usual level of writing is so exemplary, but likely you can detect some difference in the way that the dictated text reads from my normal way of writing. As I have said many times before, voice recognition offers great benefits to anyone who has difficulty using a mouse or keyboard. I suggest trying for strict edition for some time on documents that you are not inordinately worried about to learn to accommodate the shortcomings of the programs.
I guess that's all I have to say today.
2 comments:
1. Information
Informatics Advanced World collects and shares highly scalable Informatics Data and organizes it for good interpretation, simple and understandable presentation so that any one can easily analyze and spread such Information.
ReplyDelete
2. At first I was going to argue that the holy grail of Star Trek technology was the transporter, but since you limited it to computing, I will agree, speech recognition is for sure the holy grail in this regard, and how amazing. I read a blog where a father was using it to help his son with autism, apparently many parents are having similar success in this regard. However for sure I think the main applications will be with bloggers and even more so with people who have mobility issues, arthritis and so forth, what a great advancement for them. Hmm.... I wonder how it works if you have a cold? Great blog very well enjoyed.
ReplyDelete
|
{
"url": "http://genealogysstar.blogspot.com/2012/04/talking-to-your-computer.html?m=1",
"source_domain": "genealogysstar.blogspot.com",
"snapshot_id": "crawl=CC-MAIN-2015-06",
"warc_metadata": {
"Content-Length": "66043",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JGV6ZOLKDLZP6USLSL546AK4X56FGF3Y",
"WARC-Concurrent-To": "<urn:uuid:37ab3430-ba31-43e2-b8c5-54db2bb6f29f>",
"WARC-Date": "2015-01-30T00:23:27Z",
"WARC-IP-Address": "74.125.228.43",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:3B2CIDLMFOTSR36AEGEPFIACWAZPT2GT",
"WARC-Record-ID": "<urn:uuid:cd5d908d-4439-4dea-9550-1de76679fc34>",
"WARC-Target-URI": "http://genealogysstar.blogspot.com/2012/04/talking-to-your-computer.html?m=1",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4222e5ef-2050-4ba0-bb89-7e0ddb0909cc>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-212-252.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-06\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for January 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
24,
25,
50,
51,
441,
442,
681,
682,
1269,
1270,
1600,
1601,
2215,
2216,
2893,
2894,
3440,
3441,
3901,
3902,
3942,
3943,
3955,
3956,
3973,
4202,
4203,
4219,
4852,
4853
],
"line_end_idx": [
24,
25,
50,
51,
441,
442,
681,
682,
1269,
1270,
1600,
1601,
2215,
2216,
2893,
2894,
3440,
3441,
3901,
3902,
3942,
3943,
3955,
3956,
3973,
4202,
4203,
4219,
4852,
4853,
4868
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4868,
"ccnet_original_nlines": 30,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.49531736969947815,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04058273136615753,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10613943636417389,
"rps_doc_frac_unique_words": 0.4207459092140198,
"rps_doc_mean_word_length": 4.520978927612305,
"rps_doc_num_sentences": 42,
"rps_doc_symbol_to_word_ratio": 0.0010405799839645624,
"rps_doc_unigram_entropy": 5.23025369644165,
"rps_doc_word_count": 858,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.01701468974351883,
"rps_doc_frac_chars_dupe_6grams": 0.01701468974351883,
"rps_doc_frac_chars_dupe_7grams": 0.01701468974351883,
"rps_doc_frac_chars_dupe_8grams": 0.01701468974351883,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04537251964211464,
"rps_doc_frac_chars_top_3gram": 0.009280740283429623,
"rps_doc_frac_chars_top_4gram": 0.007218359969556332,
"rps_doc_books_importance": -401.536376953125,
"rps_doc_books_importance_length_correction": -401.536376953125,
"rps_doc_openwebtext_importance": -232.94044494628906,
"rps_doc_openwebtext_importance_length_correction": -232.94044494628906,
"rps_doc_wikipedia_importance": -157.0100860595703,
"rps_doc_wikipedia_importance_length_correction": -157.0100860595703
},
"fasttext": {
"dclm": 0.04283171892166138,
"english": 0.9657639265060425,
"fineweb_edu_approx": 1.6520700454711914,
"eai_general_math": 0.49539780616760254,
"eai_open_web_math": 0.3072410225868225,
"eai_web_code": 0.21148145198822021
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "618.92",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Women — Health and hygiene, Children — Health and hygiene, Gynecology, and Pediatrics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-4,038,335,484,340,669,000 |
Version: 2.0.40 2.2.26 2.4.37 3.7 3.8 3.9 3.10 3.11 3.12 3.13 3.14 3.15 3.16 3.17 3.18 3.19 4.0 4.1 4.2 4.3
Linux/drivers/net/ethernet/adi/bfin_mac.c
1 /*
2 * Blackfin On-Chip MAC Driver
3 *
4 * Copyright 2004-2010 Analog Devices Inc.
5 *
6 * Enter bugs at http://blackfin.uclinux.org/
7 *
8 * Licensed under the GPL-2 or later.
9 */
10
11 #define DRV_VERSION "1.1"
12 #define DRV_DESC "Blackfin on-chip Ethernet MAC driver"
13
14 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
15
16 #include <linux/init.h>
17 #include <linux/module.h>
18 #include <linux/kernel.h>
19 #include <linux/sched.h>
20 #include <linux/slab.h>
21 #include <linux/delay.h>
22 #include <linux/timer.h>
23 #include <linux/errno.h>
24 #include <linux/irq.h>
25 #include <linux/io.h>
26 #include <linux/ioport.h>
27 #include <linux/crc32.h>
28 #include <linux/device.h>
29 #include <linux/spinlock.h>
30 #include <linux/mii.h>
31 #include <linux/netdevice.h>
32 #include <linux/etherdevice.h>
33 #include <linux/ethtool.h>
34 #include <linux/skbuff.h>
35 #include <linux/platform_device.h>
36
37 #include <asm/dma.h>
38 #include <linux/dma-mapping.h>
39
40 #include <asm/div64.h>
41 #include <asm/dpmc.h>
42 #include <asm/blackfin.h>
43 #include <asm/cacheflush.h>
44 #include <asm/portmux.h>
45 #include <mach/pll.h>
46
47 #include "bfin_mac.h"
48
49 MODULE_AUTHOR("Bryan Wu, Luke Yang");
50 MODULE_LICENSE("GPL");
51 MODULE_DESCRIPTION(DRV_DESC);
52 MODULE_ALIAS("platform:bfin_mac");
53
54 #if defined(CONFIG_BFIN_MAC_USE_L1)
55 # define bfin_mac_alloc(dma_handle, size, num) l1_data_sram_zalloc(size*num)
56 # define bfin_mac_free(dma_handle, ptr, num) l1_data_sram_free(ptr)
57 #else
58 # define bfin_mac_alloc(dma_handle, size, num) \
59 dma_alloc_coherent(NULL, size*num, dma_handle, GFP_KERNEL)
60 # define bfin_mac_free(dma_handle, ptr, num) \
61 dma_free_coherent(NULL, sizeof(*ptr)*num, ptr, dma_handle)
62 #endif
63
64 #define PKT_BUF_SZ 1580
65
66 #define MAX_TIMEOUT_CNT 500
67
68 /* pointers to maintain transmit list */
69 static struct net_dma_desc_tx *tx_list_head;
70 static struct net_dma_desc_tx *tx_list_tail;
71 static struct net_dma_desc_rx *rx_list_head;
72 static struct net_dma_desc_rx *rx_list_tail;
73 static struct net_dma_desc_rx *current_rx_ptr;
74 static struct net_dma_desc_tx *current_tx_ptr;
75 static struct net_dma_desc_tx *tx_desc;
76 static struct net_dma_desc_rx *rx_desc;
77
78 static void desc_list_free(void)
79 {
80 struct net_dma_desc_rx *r;
81 struct net_dma_desc_tx *t;
82 int i;
83 #if !defined(CONFIG_BFIN_MAC_USE_L1)
84 dma_addr_t dma_handle = 0;
85 #endif
86
87 if (tx_desc) {
88 t = tx_list_head;
89 for (i = 0; i < CONFIG_BFIN_TX_DESC_NUM; i++) {
90 if (t) {
91 if (t->skb) {
92 dev_kfree_skb(t->skb);
93 t->skb = NULL;
94 }
95 t = t->next;
96 }
97 }
98 bfin_mac_free(dma_handle, tx_desc, CONFIG_BFIN_TX_DESC_NUM);
99 }
100
101 if (rx_desc) {
102 r = rx_list_head;
103 for (i = 0; i < CONFIG_BFIN_RX_DESC_NUM; i++) {
104 if (r) {
105 if (r->skb) {
106 dev_kfree_skb(r->skb);
107 r->skb = NULL;
108 }
109 r = r->next;
110 }
111 }
112 bfin_mac_free(dma_handle, rx_desc, CONFIG_BFIN_RX_DESC_NUM);
113 }
114 }
115
116 static int desc_list_init(struct net_device *dev)
117 {
118 int i;
119 struct sk_buff *new_skb;
120 #if !defined(CONFIG_BFIN_MAC_USE_L1)
121 /*
122 * This dma_handle is useless in Blackfin dma_alloc_coherent().
123 * The real dma handler is the return value of dma_alloc_coherent().
124 */
125 dma_addr_t dma_handle;
126 #endif
127
128 tx_desc = bfin_mac_alloc(&dma_handle,
129 sizeof(struct net_dma_desc_tx),
130 CONFIG_BFIN_TX_DESC_NUM);
131 if (tx_desc == NULL)
132 goto init_error;
133
134 rx_desc = bfin_mac_alloc(&dma_handle,
135 sizeof(struct net_dma_desc_rx),
136 CONFIG_BFIN_RX_DESC_NUM);
137 if (rx_desc == NULL)
138 goto init_error;
139
140 /* init tx_list */
141 tx_list_head = tx_list_tail = tx_desc;
142
143 for (i = 0; i < CONFIG_BFIN_TX_DESC_NUM; i++) {
144 struct net_dma_desc_tx *t = tx_desc + i;
145 struct dma_descriptor *a = &(t->desc_a);
146 struct dma_descriptor *b = &(t->desc_b);
147
148 /*
149 * disable DMA
150 * read from memory WNR = 0
151 * wordsize is 32 bits
152 * 6 half words is desc size
153 * large desc flow
154 */
155 a->config = WDSIZE_32 | NDSIZE_6 | DMAFLOW_LARGE;
156 a->start_addr = (unsigned long)t->packet;
157 a->x_count = 0;
158 a->next_dma_desc = b;
159
160 /*
161 * enabled DMA
162 * write to memory WNR = 1
163 * wordsize is 32 bits
164 * disable interrupt
165 * 6 half words is desc size
166 * large desc flow
167 */
168 b->config = DMAEN | WNR | WDSIZE_32 | NDSIZE_6 | DMAFLOW_LARGE;
169 b->start_addr = (unsigned long)(&(t->status));
170 b->x_count = 0;
171
172 t->skb = NULL;
173 tx_list_tail->desc_b.next_dma_desc = a;
174 tx_list_tail->next = t;
175 tx_list_tail = t;
176 }
177 tx_list_tail->next = tx_list_head; /* tx_list is a circle */
178 tx_list_tail->desc_b.next_dma_desc = &(tx_list_head->desc_a);
179 current_tx_ptr = tx_list_head;
180
181 /* init rx_list */
182 rx_list_head = rx_list_tail = rx_desc;
183
184 for (i = 0; i < CONFIG_BFIN_RX_DESC_NUM; i++) {
185 struct net_dma_desc_rx *r = rx_desc + i;
186 struct dma_descriptor *a = &(r->desc_a);
187 struct dma_descriptor *b = &(r->desc_b);
188
189 /* allocate a new skb for next time receive */
190 new_skb = netdev_alloc_skb(dev, PKT_BUF_SZ + NET_IP_ALIGN);
191 if (!new_skb)
192 goto init_error;
193
194 skb_reserve(new_skb, NET_IP_ALIGN);
195 /* Invidate the data cache of skb->data range when it is write back
196 * cache. It will prevent overwritting the new data from DMA
197 */
198 blackfin_dcache_invalidate_range((unsigned long)new_skb->head,
199 (unsigned long)new_skb->end);
200 r->skb = new_skb;
201
202 /*
203 * enabled DMA
204 * write to memory WNR = 1
205 * wordsize is 32 bits
206 * disable interrupt
207 * 6 half words is desc size
208 * large desc flow
209 */
210 a->config = DMAEN | WNR | WDSIZE_32 | NDSIZE_6 | DMAFLOW_LARGE;
211 /* since RXDWA is enabled */
212 a->start_addr = (unsigned long)new_skb->data - 2;
213 a->x_count = 0;
214 a->next_dma_desc = b;
215
216 /*
217 * enabled DMA
218 * write to memory WNR = 1
219 * wordsize is 32 bits
220 * enable interrupt
221 * 6 half words is desc size
222 * large desc flow
223 */
224 b->config = DMAEN | WNR | WDSIZE_32 | DI_EN |
225 NDSIZE_6 | DMAFLOW_LARGE;
226 b->start_addr = (unsigned long)(&(r->status));
227 b->x_count = 0;
228
229 rx_list_tail->desc_b.next_dma_desc = a;
230 rx_list_tail->next = r;
231 rx_list_tail = r;
232 }
233 rx_list_tail->next = rx_list_head; /* rx_list is a circle */
234 rx_list_tail->desc_b.next_dma_desc = &(rx_list_head->desc_a);
235 current_rx_ptr = rx_list_head;
236
237 return 0;
238
239 init_error:
240 desc_list_free();
241 pr_err("kmalloc failed\n");
242 return -ENOMEM;
243 }
244
245
246 /*---PHY CONTROL AND CONFIGURATION-----------------------------------------*/
247
248 /*
249 * MII operations
250 */
251 /* Wait until the previous MDC/MDIO transaction has completed */
252 static int bfin_mdio_poll(void)
253 {
254 int timeout_cnt = MAX_TIMEOUT_CNT;
255
256 /* poll the STABUSY bit */
257 while ((bfin_read_EMAC_STAADD()) & STABUSY) {
258 udelay(1);
259 if (timeout_cnt-- < 0) {
260 pr_err("wait MDC/MDIO transaction to complete timeout\n");
261 return -ETIMEDOUT;
262 }
263 }
264
265 return 0;
266 }
267
268 /* Read an off-chip register in a PHY through the MDC/MDIO port */
269 static int bfin_mdiobus_read(struct mii_bus *bus, int phy_addr, int regnum)
270 {
271 int ret;
272
273 ret = bfin_mdio_poll();
274 if (ret)
275 return ret;
276
277 /* read mode */
278 bfin_write_EMAC_STAADD(SET_PHYAD((u16) phy_addr) |
279 SET_REGAD((u16) regnum) |
280 STABUSY);
281
282 ret = bfin_mdio_poll();
283 if (ret)
284 return ret;
285
286 return (int) bfin_read_EMAC_STADAT();
287 }
288
289 /* Write an off-chip register in a PHY through the MDC/MDIO port */
290 static int bfin_mdiobus_write(struct mii_bus *bus, int phy_addr, int regnum,
291 u16 value)
292 {
293 int ret;
294
295 ret = bfin_mdio_poll();
296 if (ret)
297 return ret;
298
299 bfin_write_EMAC_STADAT((u32) value);
300
301 /* write mode */
302 bfin_write_EMAC_STAADD(SET_PHYAD((u16) phy_addr) |
303 SET_REGAD((u16) regnum) |
304 STAOP |
305 STABUSY);
306
307 return bfin_mdio_poll();
308 }
309
310 static void bfin_mac_adjust_link(struct net_device *dev)
311 {
312 struct bfin_mac_local *lp = netdev_priv(dev);
313 struct phy_device *phydev = lp->phydev;
314 unsigned long flags;
315 int new_state = 0;
316
317 spin_lock_irqsave(&lp->lock, flags);
318 if (phydev->link) {
319 /* Now we make sure that we can be in full duplex mode.
320 * If not, we operate in half-duplex mode. */
321 if (phydev->duplex != lp->old_duplex) {
322 u32 opmode = bfin_read_EMAC_OPMODE();
323 new_state = 1;
324
325 if (phydev->duplex)
326 opmode |= FDMODE;
327 else
328 opmode &= ~(FDMODE);
329
330 bfin_write_EMAC_OPMODE(opmode);
331 lp->old_duplex = phydev->duplex;
332 }
333
334 if (phydev->speed != lp->old_speed) {
335 if (phydev->interface == PHY_INTERFACE_MODE_RMII) {
336 u32 opmode = bfin_read_EMAC_OPMODE();
337 switch (phydev->speed) {
338 case 10:
339 opmode |= RMII_10;
340 break;
341 case 100:
342 opmode &= ~RMII_10;
343 break;
344 default:
345 netdev_warn(dev,
346 "Ack! Speed (%d) is not 10/100!\n",
347 phydev->speed);
348 break;
349 }
350 bfin_write_EMAC_OPMODE(opmode);
351 }
352
353 new_state = 1;
354 lp->old_speed = phydev->speed;
355 }
356
357 if (!lp->old_link) {
358 new_state = 1;
359 lp->old_link = 1;
360 }
361 } else if (lp->old_link) {
362 new_state = 1;
363 lp->old_link = 0;
364 lp->old_speed = 0;
365 lp->old_duplex = -1;
366 }
367
368 if (new_state) {
369 u32 opmode = bfin_read_EMAC_OPMODE();
370 phy_print_status(phydev);
371 pr_debug("EMAC_OPMODE = 0x%08x\n", opmode);
372 }
373
374 spin_unlock_irqrestore(&lp->lock, flags);
375 }
376
377 /* MDC = 2.5 MHz */
378 #define MDC_CLK 2500000
379
380 static int mii_probe(struct net_device *dev, int phy_mode)
381 {
382 struct bfin_mac_local *lp = netdev_priv(dev);
383 struct phy_device *phydev = NULL;
384 unsigned short sysctl;
385 int i;
386 u32 sclk, mdc_div;
387
388 /* Enable PHY output early */
389 if (!(bfin_read_VR_CTL() & CLKBUFOE))
390 bfin_write_VR_CTL(bfin_read_VR_CTL() | CLKBUFOE);
391
392 sclk = get_sclk();
393 mdc_div = ((sclk / MDC_CLK) / 2) - 1;
394
395 sysctl = bfin_read_EMAC_SYSCTL();
396 sysctl = (sysctl & ~MDCDIV) | SET_MDCDIV(mdc_div);
397 bfin_write_EMAC_SYSCTL(sysctl);
398
399 /* search for connected PHY device */
400 for (i = 0; i < PHY_MAX_ADDR; ++i) {
401 struct phy_device *const tmp_phydev = lp->mii_bus->phy_map[i];
402
403 if (!tmp_phydev)
404 continue; /* no PHY here... */
405
406 phydev = tmp_phydev;
407 break; /* found it */
408 }
409
410 /* now we are supposed to have a proper phydev, to attach to... */
411 if (!phydev) {
412 netdev_err(dev, "no phy device found\n");
413 return -ENODEV;
414 }
415
416 if (phy_mode != PHY_INTERFACE_MODE_RMII &&
417 phy_mode != PHY_INTERFACE_MODE_MII) {
418 netdev_err(dev, "invalid phy interface mode\n");
419 return -EINVAL;
420 }
421
422 phydev = phy_connect(dev, dev_name(&phydev->dev),
423 &bfin_mac_adjust_link, phy_mode);
424
425 if (IS_ERR(phydev)) {
426 netdev_err(dev, "could not attach PHY\n");
427 return PTR_ERR(phydev);
428 }
429
430 /* mask with MAC supported features */
431 phydev->supported &= (SUPPORTED_10baseT_Half
432 | SUPPORTED_10baseT_Full
433 | SUPPORTED_100baseT_Half
434 | SUPPORTED_100baseT_Full
435 | SUPPORTED_Autoneg
436 | SUPPORTED_Pause | SUPPORTED_Asym_Pause
437 | SUPPORTED_MII
438 | SUPPORTED_TP);
439
440 phydev->advertising = phydev->supported;
441
442 lp->old_link = 0;
443 lp->old_speed = 0;
444 lp->old_duplex = -1;
445 lp->phydev = phydev;
446
447 pr_info("attached PHY driver [%s] "
448 "(mii_bus:phy_addr=%s, irq=%d, mdc_clk=%dHz(mdc_div=%d)@sclk=%dMHz)\n",
449 phydev->drv->name, dev_name(&phydev->dev), phydev->irq,
450 MDC_CLK, mdc_div, sclk/1000000);
451
452 return 0;
453 }
454
455 /*
456 * Ethtool support
457 */
458
459 /*
460 * interrupt routine for magic packet wakeup
461 */
462 static irqreturn_t bfin_mac_wake_interrupt(int irq, void *dev_id)
463 {
464 return IRQ_HANDLED;
465 }
466
467 static int
468 bfin_mac_ethtool_getsettings(struct net_device *dev, struct ethtool_cmd *cmd)
469 {
470 struct bfin_mac_local *lp = netdev_priv(dev);
471
472 if (lp->phydev)
473 return phy_ethtool_gset(lp->phydev, cmd);
474
475 return -EINVAL;
476 }
477
478 static int
479 bfin_mac_ethtool_setsettings(struct net_device *dev, struct ethtool_cmd *cmd)
480 {
481 struct bfin_mac_local *lp = netdev_priv(dev);
482
483 if (!capable(CAP_NET_ADMIN))
484 return -EPERM;
485
486 if (lp->phydev)
487 return phy_ethtool_sset(lp->phydev, cmd);
488
489 return -EINVAL;
490 }
491
492 static void bfin_mac_ethtool_getdrvinfo(struct net_device *dev,
493 struct ethtool_drvinfo *info)
494 {
495 strlcpy(info->driver, KBUILD_MODNAME, sizeof(info->driver));
496 strlcpy(info->version, DRV_VERSION, sizeof(info->version));
497 strlcpy(info->fw_version, "N/A", sizeof(info->fw_version));
498 strlcpy(info->bus_info, dev_name(&dev->dev), sizeof(info->bus_info));
499 }
500
501 static void bfin_mac_ethtool_getwol(struct net_device *dev,
502 struct ethtool_wolinfo *wolinfo)
503 {
504 struct bfin_mac_local *lp = netdev_priv(dev);
505
506 wolinfo->supported = WAKE_MAGIC;
507 wolinfo->wolopts = lp->wol;
508 }
509
510 static int bfin_mac_ethtool_setwol(struct net_device *dev,
511 struct ethtool_wolinfo *wolinfo)
512 {
513 struct bfin_mac_local *lp = netdev_priv(dev);
514 int rc;
515
516 if (wolinfo->wolopts & (WAKE_MAGICSECURE |
517 WAKE_UCAST |
518 WAKE_MCAST |
519 WAKE_BCAST |
520 WAKE_ARP))
521 return -EOPNOTSUPP;
522
523 lp->wol = wolinfo->wolopts;
524
525 if (lp->wol && !lp->irq_wake_requested) {
526 /* register wake irq handler */
527 rc = request_irq(IRQ_MAC_WAKEDET, bfin_mac_wake_interrupt,
528 0, "EMAC_WAKE", dev);
529 if (rc)
530 return rc;
531 lp->irq_wake_requested = true;
532 }
533
534 if (!lp->wol && lp->irq_wake_requested) {
535 free_irq(IRQ_MAC_WAKEDET, dev);
536 lp->irq_wake_requested = false;
537 }
538
539 /* Make sure the PHY driver doesn't suspend */
540 device_init_wakeup(&dev->dev, lp->wol);
541
542 return 0;
543 }
544
545 #ifdef CONFIG_BFIN_MAC_USE_HWSTAMP
546 static int bfin_mac_ethtool_get_ts_info(struct net_device *dev,
547 struct ethtool_ts_info *info)
548 {
549 struct bfin_mac_local *lp = netdev_priv(dev);
550
551 info->so_timestamping =
552 SOF_TIMESTAMPING_TX_HARDWARE |
553 SOF_TIMESTAMPING_RX_HARDWARE |
554 SOF_TIMESTAMPING_RAW_HARDWARE;
555 info->phc_index = lp->phc_index;
556 info->tx_types =
557 (1 << HWTSTAMP_TX_OFF) |
558 (1 << HWTSTAMP_TX_ON);
559 info->rx_filters =
560 (1 << HWTSTAMP_FILTER_NONE) |
561 (1 << HWTSTAMP_FILTER_PTP_V1_L4_EVENT) |
562 (1 << HWTSTAMP_FILTER_PTP_V2_L2_EVENT) |
563 (1 << HWTSTAMP_FILTER_PTP_V2_L4_EVENT);
564 return 0;
565 }
566 #endif
567
568 static const struct ethtool_ops bfin_mac_ethtool_ops = {
569 .get_settings = bfin_mac_ethtool_getsettings,
570 .set_settings = bfin_mac_ethtool_setsettings,
571 .get_link = ethtool_op_get_link,
572 .get_drvinfo = bfin_mac_ethtool_getdrvinfo,
573 .get_wol = bfin_mac_ethtool_getwol,
574 .set_wol = bfin_mac_ethtool_setwol,
575 #ifdef CONFIG_BFIN_MAC_USE_HWSTAMP
576 .get_ts_info = bfin_mac_ethtool_get_ts_info,
577 #endif
578 };
579
580 /**************************************************************************/
581 static void setup_system_regs(struct net_device *dev)
582 {
583 struct bfin_mac_local *lp = netdev_priv(dev);
584 int i;
585 unsigned short sysctl;
586
587 /*
588 * Odd word alignment for Receive Frame DMA word
589 * Configure checksum support and rcve frame word alignment
590 */
591 sysctl = bfin_read_EMAC_SYSCTL();
592 /*
593 * check if interrupt is requested for any PHY,
594 * enable PHY interrupt only if needed
595 */
596 for (i = 0; i < PHY_MAX_ADDR; ++i)
597 if (lp->mii_bus->irq[i] != PHY_POLL)
598 break;
599 if (i < PHY_MAX_ADDR)
600 sysctl |= PHYIE;
601 sysctl |= RXDWA;
602 #if defined(BFIN_MAC_CSUM_OFFLOAD)
603 sysctl |= RXCKS;
604 #else
605 sysctl &= ~RXCKS;
606 #endif
607 bfin_write_EMAC_SYSCTL(sysctl);
608
609 bfin_write_EMAC_MMC_CTL(RSTC | CROLL);
610
611 /* Set vlan regs to let 1522 bytes long packets pass through */
612 bfin_write_EMAC_VLAN1(lp->vlan1_mask);
613 bfin_write_EMAC_VLAN2(lp->vlan2_mask);
614
615 /* Initialize the TX DMA channel registers */
616 bfin_write_DMA2_X_COUNT(0);
617 bfin_write_DMA2_X_MODIFY(4);
618 bfin_write_DMA2_Y_COUNT(0);
619 bfin_write_DMA2_Y_MODIFY(0);
620
621 /* Initialize the RX DMA channel registers */
622 bfin_write_DMA1_X_COUNT(0);
623 bfin_write_DMA1_X_MODIFY(4);
624 bfin_write_DMA1_Y_COUNT(0);
625 bfin_write_DMA1_Y_MODIFY(0);
626 }
627
628 static void setup_mac_addr(u8 *mac_addr)
629 {
630 u32 addr_low = le32_to_cpu(*(__le32 *) & mac_addr[0]);
631 u16 addr_hi = le16_to_cpu(*(__le16 *) & mac_addr[4]);
632
633 /* this depends on a little-endian machine */
634 bfin_write_EMAC_ADDRLO(addr_low);
635 bfin_write_EMAC_ADDRHI(addr_hi);
636 }
637
638 static int bfin_mac_set_mac_address(struct net_device *dev, void *p)
639 {
640 struct sockaddr *addr = p;
641 if (netif_running(dev))
642 return -EBUSY;
643 memcpy(dev->dev_addr, addr->sa_data, dev->addr_len);
644 setup_mac_addr(dev->dev_addr);
645 return 0;
646 }
647
648 #ifdef CONFIG_BFIN_MAC_USE_HWSTAMP
649 #define bfin_mac_hwtstamp_is_none(cfg) ((cfg) == HWTSTAMP_FILTER_NONE)
650
651 static u32 bfin_select_phc_clock(u32 input_clk, unsigned int *shift_result)
652 {
653 u32 ipn = 1000000000UL / input_clk;
654 u32 ppn = 1;
655 unsigned int shift = 0;
656
657 while (ppn <= ipn) {
658 ppn <<= 1;
659 shift++;
660 }
661 *shift_result = shift;
662 return 1000000000UL / ppn;
663 }
664
665 static int bfin_mac_hwtstamp_set(struct net_device *netdev,
666 struct ifreq *ifr)
667 {
668 struct hwtstamp_config config;
669 struct bfin_mac_local *lp = netdev_priv(netdev);
670 u16 ptpctl;
671 u32 ptpfv1, ptpfv2, ptpfv3, ptpfoff;
672
673 if (copy_from_user(&config, ifr->ifr_data, sizeof(config)))
674 return -EFAULT;
675
676 pr_debug("%s config flag:0x%x, tx_type:0x%x, rx_filter:0x%x\n",
677 __func__, config.flags, config.tx_type, config.rx_filter);
678
679 /* reserved for future extensions */
680 if (config.flags)
681 return -EINVAL;
682
683 if ((config.tx_type != HWTSTAMP_TX_OFF) &&
684 (config.tx_type != HWTSTAMP_TX_ON))
685 return -ERANGE;
686
687 ptpctl = bfin_read_EMAC_PTP_CTL();
688
689 switch (config.rx_filter) {
690 case HWTSTAMP_FILTER_NONE:
691 /*
692 * Dont allow any timestamping
693 */
694 ptpfv3 = 0xFFFFFFFF;
695 bfin_write_EMAC_PTP_FV3(ptpfv3);
696 break;
697 case HWTSTAMP_FILTER_PTP_V1_L4_EVENT:
698 case HWTSTAMP_FILTER_PTP_V1_L4_SYNC:
699 case HWTSTAMP_FILTER_PTP_V1_L4_DELAY_REQ:
700 /*
701 * Clear the five comparison mask bits (bits[12:8]) in EMAC_PTP_CTL)
702 * to enable all the field matches.
703 */
704 ptpctl &= ~0x1F00;
705 bfin_write_EMAC_PTP_CTL(ptpctl);
706 /*
707 * Keep the default values of the EMAC_PTP_FOFF register.
708 */
709 ptpfoff = 0x4A24170C;
710 bfin_write_EMAC_PTP_FOFF(ptpfoff);
711 /*
712 * Keep the default values of the EMAC_PTP_FV1 and EMAC_PTP_FV2
713 * registers.
714 */
715 ptpfv1 = 0x11040800;
716 bfin_write_EMAC_PTP_FV1(ptpfv1);
717 ptpfv2 = 0x0140013F;
718 bfin_write_EMAC_PTP_FV2(ptpfv2);
719 /*
720 * The default value (0xFFFC) allows the timestamping of both
721 * received Sync messages and Delay_Req messages.
722 */
723 ptpfv3 = 0xFFFFFFFC;
724 bfin_write_EMAC_PTP_FV3(ptpfv3);
725
726 config.rx_filter = HWTSTAMP_FILTER_PTP_V1_L4_EVENT;
727 break;
728 case HWTSTAMP_FILTER_PTP_V2_L4_EVENT:
729 case HWTSTAMP_FILTER_PTP_V2_L4_SYNC:
730 case HWTSTAMP_FILTER_PTP_V2_DELAY_REQ:
731 /* Clear all five comparison mask bits (bits[12:8]) in the
732 * EMAC_PTP_CTL register to enable all the field matches.
733 */
734 ptpctl &= ~0x1F00;
735 bfin_write_EMAC_PTP_CTL(ptpctl);
736 /*
737 * Keep the default values of the EMAC_PTP_FOFF register, except set
738 * the PTPCOF field to 0x2A.
739 */
740 ptpfoff = 0x2A24170C;
741 bfin_write_EMAC_PTP_FOFF(ptpfoff);
742 /*
743 * Keep the default values of the EMAC_PTP_FV1 and EMAC_PTP_FV2
744 * registers.
745 */
746 ptpfv1 = 0x11040800;
747 bfin_write_EMAC_PTP_FV1(ptpfv1);
748 ptpfv2 = 0x0140013F;
749 bfin_write_EMAC_PTP_FV2(ptpfv2);
750 /*
751 * To allow the timestamping of Pdelay_Req and Pdelay_Resp, set
752 * the value to 0xFFF0.
753 */
754 ptpfv3 = 0xFFFFFFF0;
755 bfin_write_EMAC_PTP_FV3(ptpfv3);
756
757 config.rx_filter = HWTSTAMP_FILTER_PTP_V2_L4_EVENT;
758 break;
759 case HWTSTAMP_FILTER_PTP_V2_L2_EVENT:
760 case HWTSTAMP_FILTER_PTP_V2_L2_SYNC:
761 case HWTSTAMP_FILTER_PTP_V2_L2_DELAY_REQ:
762 /*
763 * Clear bits 8 and 12 of the EMAC_PTP_CTL register to enable only the
764 * EFTM and PTPCM field comparison.
765 */
766 ptpctl &= ~0x1100;
767 bfin_write_EMAC_PTP_CTL(ptpctl);
768 /*
769 * Keep the default values of all the fields of the EMAC_PTP_FOFF
770 * register, except set the PTPCOF field to 0x0E.
771 */
772 ptpfoff = 0x0E24170C;
773 bfin_write_EMAC_PTP_FOFF(ptpfoff);
774 /*
775 * Program bits [15:0] of the EMAC_PTP_FV1 register to 0x88F7, which
776 * corresponds to PTP messages on the MAC layer.
777 */
778 ptpfv1 = 0x110488F7;
779 bfin_write_EMAC_PTP_FV1(ptpfv1);
780 ptpfv2 = 0x0140013F;
781 bfin_write_EMAC_PTP_FV2(ptpfv2);
782 /*
783 * To allow the timestamping of Pdelay_Req and Pdelay_Resp
784 * messages, set the value to 0xFFF0.
785 */
786 ptpfv3 = 0xFFFFFFF0;
787 bfin_write_EMAC_PTP_FV3(ptpfv3);
788
789 config.rx_filter = HWTSTAMP_FILTER_PTP_V2_L2_EVENT;
790 break;
791 default:
792 return -ERANGE;
793 }
794
795 if (config.tx_type == HWTSTAMP_TX_OFF &&
796 bfin_mac_hwtstamp_is_none(config.rx_filter)) {
797 ptpctl &= ~PTP_EN;
798 bfin_write_EMAC_PTP_CTL(ptpctl);
799
800 SSYNC();
801 } else {
802 ptpctl |= PTP_EN;
803 bfin_write_EMAC_PTP_CTL(ptpctl);
804
805 /*
806 * clear any existing timestamp
807 */
808 bfin_read_EMAC_PTP_RXSNAPLO();
809 bfin_read_EMAC_PTP_RXSNAPHI();
810
811 bfin_read_EMAC_PTP_TXSNAPLO();
812 bfin_read_EMAC_PTP_TXSNAPHI();
813
814 SSYNC();
815 }
816
817 lp->stamp_cfg = config;
818 return copy_to_user(ifr->ifr_data, &config, sizeof(config)) ?
819 -EFAULT : 0;
820 }
821
822 static int bfin_mac_hwtstamp_get(struct net_device *netdev,
823 struct ifreq *ifr)
824 {
825 struct bfin_mac_local *lp = netdev_priv(netdev);
826
827 return copy_to_user(ifr->ifr_data, &lp->stamp_cfg,
828 sizeof(lp->stamp_cfg)) ?
829 -EFAULT : 0;
830 }
831
832 static void bfin_tx_hwtstamp(struct net_device *netdev, struct sk_buff *skb)
833 {
834 struct bfin_mac_local *lp = netdev_priv(netdev);
835
836 if (skb_shinfo(skb)->tx_flags & SKBTX_HW_TSTAMP) {
837 int timeout_cnt = MAX_TIMEOUT_CNT;
838
839 /* When doing time stamping, keep the connection to the socket
840 * a while longer
841 */
842 skb_shinfo(skb)->tx_flags |= SKBTX_IN_PROGRESS;
843
844 /*
845 * The timestamping is done at the EMAC module's MII/RMII interface
846 * when the module sees the Start of Frame of an event message packet. This
847 * interface is the closest possible place to the physical Ethernet transmission
848 * medium, providing the best timing accuracy.
849 */
850 while ((!(bfin_read_EMAC_PTP_ISTAT() & TXTL)) && (--timeout_cnt))
851 udelay(1);
852 if (timeout_cnt == 0)
853 netdev_err(netdev, "timestamp the TX packet failed\n");
854 else {
855 struct skb_shared_hwtstamps shhwtstamps;
856 u64 ns;
857 u64 regval;
858
859 regval = bfin_read_EMAC_PTP_TXSNAPLO();
860 regval |= (u64)bfin_read_EMAC_PTP_TXSNAPHI() << 32;
861 memset(&shhwtstamps, 0, sizeof(shhwtstamps));
862 ns = regval << lp->shift;
863 shhwtstamps.hwtstamp = ns_to_ktime(ns);
864 skb_tstamp_tx(skb, &shhwtstamps);
865 }
866 }
867 }
868
869 static void bfin_rx_hwtstamp(struct net_device *netdev, struct sk_buff *skb)
870 {
871 struct bfin_mac_local *lp = netdev_priv(netdev);
872 u32 valid;
873 u64 regval, ns;
874 struct skb_shared_hwtstamps *shhwtstamps;
875
876 if (bfin_mac_hwtstamp_is_none(lp->stamp_cfg.rx_filter))
877 return;
878
879 valid = bfin_read_EMAC_PTP_ISTAT() & RXEL;
880 if (!valid)
881 return;
882
883 shhwtstamps = skb_hwtstamps(skb);
884
885 regval = bfin_read_EMAC_PTP_RXSNAPLO();
886 regval |= (u64)bfin_read_EMAC_PTP_RXSNAPHI() << 32;
887 ns = regval << lp->shift;
888 memset(shhwtstamps, 0, sizeof(*shhwtstamps));
889 shhwtstamps->hwtstamp = ns_to_ktime(ns);
890 }
891
892 static void bfin_mac_hwtstamp_init(struct net_device *netdev)
893 {
894 struct bfin_mac_local *lp = netdev_priv(netdev);
895 u64 addend, ppb;
896 u32 input_clk, phc_clk;
897
898 /* Initialize hardware timer */
899 input_clk = get_sclk();
900 phc_clk = bfin_select_phc_clock(input_clk, &lp->shift);
901 addend = phc_clk * (1ULL << 32);
902 do_div(addend, input_clk);
903 bfin_write_EMAC_PTP_ADDEND((u32)addend);
904
905 lp->addend = addend;
906 ppb = 1000000000ULL * input_clk;
907 do_div(ppb, phc_clk);
908 lp->max_ppb = ppb - 1000000000ULL - 1ULL;
909
910 /* Initialize hwstamp config */
911 lp->stamp_cfg.rx_filter = HWTSTAMP_FILTER_NONE;
912 lp->stamp_cfg.tx_type = HWTSTAMP_TX_OFF;
913 }
914
915 static u64 bfin_ptp_time_read(struct bfin_mac_local *lp)
916 {
917 u64 ns;
918 u32 lo, hi;
919
920 lo = bfin_read_EMAC_PTP_TIMELO();
921 hi = bfin_read_EMAC_PTP_TIMEHI();
922
923 ns = ((u64) hi) << 32;
924 ns |= lo;
925 ns <<= lp->shift;
926
927 return ns;
928 }
929
930 static void bfin_ptp_time_write(struct bfin_mac_local *lp, u64 ns)
931 {
932 u32 hi, lo;
933
934 ns >>= lp->shift;
935 hi = ns >> 32;
936 lo = ns & 0xffffffff;
937
938 bfin_write_EMAC_PTP_TIMELO(lo);
939 bfin_write_EMAC_PTP_TIMEHI(hi);
940 }
941
942 /* PTP Hardware Clock operations */
943
944 static int bfin_ptp_adjfreq(struct ptp_clock_info *ptp, s32 ppb)
945 {
946 u64 adj;
947 u32 diff, addend;
948 int neg_adj = 0;
949 struct bfin_mac_local *lp =
950 container_of(ptp, struct bfin_mac_local, caps);
951
952 if (ppb < 0) {
953 neg_adj = 1;
954 ppb = -ppb;
955 }
956 addend = lp->addend;
957 adj = addend;
958 adj *= ppb;
959 diff = div_u64(adj, 1000000000ULL);
960
961 addend = neg_adj ? addend - diff : addend + diff;
962
963 bfin_write_EMAC_PTP_ADDEND(addend);
964
965 return 0;
966 }
967
968 static int bfin_ptp_adjtime(struct ptp_clock_info *ptp, s64 delta)
969 {
970 s64 now;
971 unsigned long flags;
972 struct bfin_mac_local *lp =
973 container_of(ptp, struct bfin_mac_local, caps);
974
975 spin_lock_irqsave(&lp->phc_lock, flags);
976
977 now = bfin_ptp_time_read(lp);
978 now += delta;
979 bfin_ptp_time_write(lp, now);
980
981 spin_unlock_irqrestore(&lp->phc_lock, flags);
982
983 return 0;
984 }
985
986 static int bfin_ptp_gettime(struct ptp_clock_info *ptp, struct timespec64 *ts)
987 {
988 u64 ns;
989 unsigned long flags;
990 struct bfin_mac_local *lp =
991 container_of(ptp, struct bfin_mac_local, caps);
992
993 spin_lock_irqsave(&lp->phc_lock, flags);
994
995 ns = bfin_ptp_time_read(lp);
996
997 spin_unlock_irqrestore(&lp->phc_lock, flags);
998
999 *ts = ns_to_timespec64(ns);
1000
1001 return 0;
1002 }
1003
1004 static int bfin_ptp_settime(struct ptp_clock_info *ptp,
1005 const struct timespec64 *ts)
1006 {
1007 u64 ns;
1008 unsigned long flags;
1009 struct bfin_mac_local *lp =
1010 container_of(ptp, struct bfin_mac_local, caps);
1011
1012 ns = timespec64_to_ns(ts);
1013
1014 spin_lock_irqsave(&lp->phc_lock, flags);
1015
1016 bfin_ptp_time_write(lp, ns);
1017
1018 spin_unlock_irqrestore(&lp->phc_lock, flags);
1019
1020 return 0;
1021 }
1022
1023 static int bfin_ptp_enable(struct ptp_clock_info *ptp,
1024 struct ptp_clock_request *rq, int on)
1025 {
1026 return -EOPNOTSUPP;
1027 }
1028
1029 static struct ptp_clock_info bfin_ptp_caps = {
1030 .owner = THIS_MODULE,
1031 .name = "BF518 clock",
1032 .max_adj = 0,
1033 .n_alarm = 0,
1034 .n_ext_ts = 0,
1035 .n_per_out = 0,
1036 .n_pins = 0,
1037 .pps = 0,
1038 .adjfreq = bfin_ptp_adjfreq,
1039 .adjtime = bfin_ptp_adjtime,
1040 .gettime64 = bfin_ptp_gettime,
1041 .settime64 = bfin_ptp_settime,
1042 .enable = bfin_ptp_enable,
1043 };
1044
1045 static int bfin_phc_init(struct net_device *netdev, struct device *dev)
1046 {
1047 struct bfin_mac_local *lp = netdev_priv(netdev);
1048
1049 lp->caps = bfin_ptp_caps;
1050 lp->caps.max_adj = lp->max_ppb;
1051 lp->clock = ptp_clock_register(&lp->caps, dev);
1052 if (IS_ERR(lp->clock))
1053 return PTR_ERR(lp->clock);
1054
1055 lp->phc_index = ptp_clock_index(lp->clock);
1056 spin_lock_init(&lp->phc_lock);
1057
1058 return 0;
1059 }
1060
1061 static void bfin_phc_release(struct bfin_mac_local *lp)
1062 {
1063 ptp_clock_unregister(lp->clock);
1064 }
1065
1066 #else
1067 # define bfin_mac_hwtstamp_is_none(cfg) 0
1068 # define bfin_mac_hwtstamp_init(dev)
1069 # define bfin_mac_hwtstamp_set(dev, ifr) (-EOPNOTSUPP)
1070 # define bfin_mac_hwtstamp_get(dev, ifr) (-EOPNOTSUPP)
1071 # define bfin_rx_hwtstamp(dev, skb)
1072 # define bfin_tx_hwtstamp(dev, skb)
1073 # define bfin_phc_init(netdev, dev) 0
1074 # define bfin_phc_release(lp)
1075 #endif
1076
1077 static inline void _tx_reclaim_skb(void)
1078 {
1079 do {
1080 tx_list_head->desc_a.config &= ~DMAEN;
1081 tx_list_head->status.status_word = 0;
1082 if (tx_list_head->skb) {
1083 dev_consume_skb_any(tx_list_head->skb);
1084 tx_list_head->skb = NULL;
1085 }
1086 tx_list_head = tx_list_head->next;
1087
1088 } while (tx_list_head->status.status_word != 0);
1089 }
1090
1091 static void tx_reclaim_skb(struct bfin_mac_local *lp)
1092 {
1093 int timeout_cnt = MAX_TIMEOUT_CNT;
1094
1095 if (tx_list_head->status.status_word != 0)
1096 _tx_reclaim_skb();
1097
1098 if (current_tx_ptr->next == tx_list_head) {
1099 while (tx_list_head->status.status_word == 0) {
1100 /* slow down polling to avoid too many queue stop. */
1101 udelay(10);
1102 /* reclaim skb if DMA is not running. */
1103 if (!(bfin_read_DMA2_IRQ_STATUS() & DMA_RUN))
1104 break;
1105 if (timeout_cnt-- < 0)
1106 break;
1107 }
1108
1109 if (timeout_cnt >= 0)
1110 _tx_reclaim_skb();
1111 else
1112 netif_stop_queue(lp->ndev);
1113 }
1114
1115 if (current_tx_ptr->next != tx_list_head &&
1116 netif_queue_stopped(lp->ndev))
1117 netif_wake_queue(lp->ndev);
1118
1119 if (tx_list_head != current_tx_ptr) {
1120 /* shorten the timer interval if tx queue is stopped */
1121 if (netif_queue_stopped(lp->ndev))
1122 lp->tx_reclaim_timer.expires =
1123 jiffies + (TX_RECLAIM_JIFFIES >> 4);
1124 else
1125 lp->tx_reclaim_timer.expires =
1126 jiffies + TX_RECLAIM_JIFFIES;
1127
1128 mod_timer(&lp->tx_reclaim_timer,
1129 lp->tx_reclaim_timer.expires);
1130 }
1131
1132 return;
1133 }
1134
1135 static void tx_reclaim_skb_timeout(unsigned long lp)
1136 {
1137 tx_reclaim_skb((struct bfin_mac_local *)lp);
1138 }
1139
1140 static int bfin_mac_hard_start_xmit(struct sk_buff *skb,
1141 struct net_device *dev)
1142 {
1143 struct bfin_mac_local *lp = netdev_priv(dev);
1144 u16 *data;
1145 u32 data_align = (unsigned long)(skb->data) & 0x3;
1146
1147 current_tx_ptr->skb = skb;
1148
1149 if (data_align == 0x2) {
1150 /* move skb->data to current_tx_ptr payload */
1151 data = (u16 *)(skb->data) - 1;
1152 *data = (u16)(skb->len);
1153 /*
1154 * When transmitting an Ethernet packet, the PTP_TSYNC module requires
1155 * a DMA_Length_Word field associated with the packet. The lower 12 bits
1156 * of this field are the length of the packet payload in bytes and the higher
1157 * 4 bits are the timestamping enable field.
1158 */
1159 if (skb_shinfo(skb)->tx_flags & SKBTX_HW_TSTAMP)
1160 *data |= 0x1000;
1161
1162 current_tx_ptr->desc_a.start_addr = (u32)data;
1163 /* this is important! */
1164 blackfin_dcache_flush_range((u32)data,
1165 (u32)((u8 *)data + skb->len + 4));
1166 } else {
1167 *((u16 *)(current_tx_ptr->packet)) = (u16)(skb->len);
1168 /* enable timestamping for the sent packet */
1169 if (skb_shinfo(skb)->tx_flags & SKBTX_HW_TSTAMP)
1170 *((u16 *)(current_tx_ptr->packet)) |= 0x1000;
1171 memcpy((u8 *)(current_tx_ptr->packet + 2), skb->data,
1172 skb->len);
1173 current_tx_ptr->desc_a.start_addr =
1174 (u32)current_tx_ptr->packet;
1175 blackfin_dcache_flush_range(
1176 (u32)current_tx_ptr->packet,
1177 (u32)(current_tx_ptr->packet + skb->len + 2));
1178 }
1179
1180 /* make sure the internal data buffers in the core are drained
1181 * so that the DMA descriptors are completely written when the
1182 * DMA engine goes to fetch them below
1183 */
1184 SSYNC();
1185
1186 /* always clear status buffer before start tx dma */
1187 current_tx_ptr->status.status_word = 0;
1188
1189 /* enable this packet's dma */
1190 current_tx_ptr->desc_a.config |= DMAEN;
1191
1192 /* tx dma is running, just return */
1193 if (bfin_read_DMA2_IRQ_STATUS() & DMA_RUN)
1194 goto out;
1195
1196 /* tx dma is not running */
1197 bfin_write_DMA2_NEXT_DESC_PTR(&(current_tx_ptr->desc_a));
1198 /* dma enabled, read from memory, size is 6 */
1199 bfin_write_DMA2_CONFIG(current_tx_ptr->desc_a.config);
1200 /* Turn on the EMAC tx */
1201 bfin_write_EMAC_OPMODE(bfin_read_EMAC_OPMODE() | TE);
1202
1203 out:
1204 bfin_tx_hwtstamp(dev, skb);
1205
1206 current_tx_ptr = current_tx_ptr->next;
1207 dev->stats.tx_packets++;
1208 dev->stats.tx_bytes += (skb->len);
1209
1210 tx_reclaim_skb(lp);
1211
1212 return NETDEV_TX_OK;
1213 }
1214
1215 #define IP_HEADER_OFF 0
1216 #define RX_ERROR_MASK (RX_LONG | RX_ALIGN | RX_CRC | RX_LEN | \
1217 RX_FRAG | RX_ADDR | RX_DMAO | RX_PHY | RX_LATE | RX_RANGE)
1218
1219 static void bfin_mac_rx(struct bfin_mac_local *lp)
1220 {
1221 struct net_device *dev = lp->ndev;
1222 struct sk_buff *skb, *new_skb;
1223 unsigned short len;
1224 #if defined(BFIN_MAC_CSUM_OFFLOAD)
1225 unsigned int i;
1226 unsigned char fcs[ETH_FCS_LEN + 1];
1227 #endif
1228
1229 /* check if frame status word reports an error condition
1230 * we which case we simply drop the packet
1231 */
1232 if (current_rx_ptr->status.status_word & RX_ERROR_MASK) {
1233 netdev_notice(dev, "rx: receive error - packet dropped\n");
1234 dev->stats.rx_dropped++;
1235 goto out;
1236 }
1237
1238 /* allocate a new skb for next time receive */
1239 skb = current_rx_ptr->skb;
1240
1241 new_skb = netdev_alloc_skb(dev, PKT_BUF_SZ + NET_IP_ALIGN);
1242 if (!new_skb) {
1243 dev->stats.rx_dropped++;
1244 goto out;
1245 }
1246 /* reserve 2 bytes for RXDWA padding */
1247 skb_reserve(new_skb, NET_IP_ALIGN);
1248 /* Invidate the data cache of skb->data range when it is write back
1249 * cache. It will prevent overwritting the new data from DMA
1250 */
1251 blackfin_dcache_invalidate_range((unsigned long)new_skb->head,
1252 (unsigned long)new_skb->end);
1253
1254 current_rx_ptr->skb = new_skb;
1255 current_rx_ptr->desc_a.start_addr = (unsigned long)new_skb->data - 2;
1256
1257 len = (unsigned short)(current_rx_ptr->status.status_word & RX_FRLEN);
1258 /* Deduce Ethernet FCS length from Ethernet payload length */
1259 len -= ETH_FCS_LEN;
1260 skb_put(skb, len);
1261
1262 skb->protocol = eth_type_trans(skb, dev);
1263
1264 bfin_rx_hwtstamp(dev, skb);
1265
1266 #if defined(BFIN_MAC_CSUM_OFFLOAD)
1267 /* Checksum offloading only works for IPv4 packets with the standard IP header
1268 * length of 20 bytes, because the blackfin MAC checksum calculation is
1269 * based on that assumption. We must NOT use the calculated checksum if our
1270 * IP version or header break that assumption.
1271 */
1272 if (skb->data[IP_HEADER_OFF] == 0x45) {
1273 skb->csum = current_rx_ptr->status.ip_payload_csum;
1274 /*
1275 * Deduce Ethernet FCS from hardware generated IP payload checksum.
1276 * IP checksum is based on 16-bit one's complement algorithm.
1277 * To deduce a value from checksum is equal to add its inversion.
1278 * If the IP payload len is odd, the inversed FCS should also
1279 * begin from odd address and leave first byte zero.
1280 */
1281 if (skb->len % 2) {
1282 fcs[0] = 0;
1283 for (i = 0; i < ETH_FCS_LEN; i++)
1284 fcs[i + 1] = ~skb->data[skb->len + i];
1285 skb->csum = csum_partial(fcs, ETH_FCS_LEN + 1, skb->csum);
1286 } else {
1287 for (i = 0; i < ETH_FCS_LEN; i++)
1288 fcs[i] = ~skb->data[skb->len + i];
1289 skb->csum = csum_partial(fcs, ETH_FCS_LEN, skb->csum);
1290 }
1291 skb->ip_summed = CHECKSUM_COMPLETE;
1292 }
1293 #endif
1294
1295 napi_gro_receive(&lp->napi, skb);
1296
1297 dev->stats.rx_packets++;
1298 dev->stats.rx_bytes += len;
1299 out:
1300 current_rx_ptr->status.status_word = 0x00000000;
1301 current_rx_ptr = current_rx_ptr->next;
1302 }
1303
1304 static int bfin_mac_poll(struct napi_struct *napi, int budget)
1305 {
1306 int i = 0;
1307 struct bfin_mac_local *lp = container_of(napi,
1308 struct bfin_mac_local,
1309 napi);
1310
1311 while (current_rx_ptr->status.status_word != 0 && i < budget) {
1312 bfin_mac_rx(lp);
1313 i++;
1314 }
1315
1316 if (i < budget) {
1317 napi_complete(napi);
1318 if (test_and_clear_bit(BFIN_MAC_RX_IRQ_DISABLED, &lp->flags))
1319 enable_irq(IRQ_MAC_RX);
1320 }
1321
1322 return i;
1323 }
1324
1325 /* interrupt routine to handle rx and error signal */
1326 static irqreturn_t bfin_mac_interrupt(int irq, void *dev_id)
1327 {
1328 struct bfin_mac_local *lp = netdev_priv(dev_id);
1329 u32 status;
1330
1331 status = bfin_read_DMA1_IRQ_STATUS();
1332
1333 bfin_write_DMA1_IRQ_STATUS(status | DMA_DONE | DMA_ERR);
1334 if (status & DMA_DONE) {
1335 disable_irq_nosync(IRQ_MAC_RX);
1336 set_bit(BFIN_MAC_RX_IRQ_DISABLED, &lp->flags);
1337 napi_schedule(&lp->napi);
1338 }
1339
1340 return IRQ_HANDLED;
1341 }
1342
1343 #ifdef CONFIG_NET_POLL_CONTROLLER
1344 static void bfin_mac_poll_controller(struct net_device *dev)
1345 {
1346 struct bfin_mac_local *lp = netdev_priv(dev);
1347
1348 bfin_mac_interrupt(IRQ_MAC_RX, dev);
1349 tx_reclaim_skb(lp);
1350 }
1351 #endif /* CONFIG_NET_POLL_CONTROLLER */
1352
1353 static void bfin_mac_disable(void)
1354 {
1355 unsigned int opmode;
1356
1357 opmode = bfin_read_EMAC_OPMODE();
1358 opmode &= (~RE);
1359 opmode &= (~TE);
1360 /* Turn off the EMAC */
1361 bfin_write_EMAC_OPMODE(opmode);
1362 }
1363
1364 /*
1365 * Enable Interrupts, Receive, and Transmit
1366 */
1367 static int bfin_mac_enable(struct phy_device *phydev)
1368 {
1369 int ret;
1370 u32 opmode;
1371
1372 pr_debug("%s\n", __func__);
1373
1374 /* Set RX DMA */
1375 bfin_write_DMA1_NEXT_DESC_PTR(&(rx_list_head->desc_a));
1376 bfin_write_DMA1_CONFIG(rx_list_head->desc_a.config);
1377
1378 /* Wait MII done */
1379 ret = bfin_mdio_poll();
1380 if (ret)
1381 return ret;
1382
1383 /* We enable only RX here */
1384 /* ASTP : Enable Automatic Pad Stripping
1385 PR : Promiscuous Mode for test
1386 PSF : Receive frames with total length less than 64 bytes.
1387 FDMODE : Full Duplex Mode
1388 LB : Internal Loopback for test
1389 RE : Receiver Enable */
1390 opmode = bfin_read_EMAC_OPMODE();
1391 if (opmode & FDMODE)
1392 opmode |= PSF;
1393 else
1394 opmode |= DRO | DC | PSF;
1395 opmode |= RE;
1396
1397 if (phydev->interface == PHY_INTERFACE_MODE_RMII) {
1398 opmode |= RMII; /* For Now only 100MBit are supported */
1399 #if defined(CONFIG_BF537) || defined(CONFIG_BF536)
1400 if (__SILICON_REVISION__ < 3) {
1401 /*
1402 * This isn't publicly documented (fun times!), but in
1403 * silicon <=0.2, the RX and TX pins are clocked together.
1404 * So in order to recv, we must enable the transmit side
1405 * as well. This will cause a spurious TX interrupt too,
1406 * but we can easily consume that.
1407 */
1408 opmode |= TE;
1409 }
1410 #endif
1411 }
1412
1413 /* Turn on the EMAC rx */
1414 bfin_write_EMAC_OPMODE(opmode);
1415
1416 return 0;
1417 }
1418
1419 /* Our watchdog timed out. Called by the networking layer */
1420 static void bfin_mac_timeout(struct net_device *dev)
1421 {
1422 struct bfin_mac_local *lp = netdev_priv(dev);
1423
1424 pr_debug("%s: %s\n", dev->name, __func__);
1425
1426 bfin_mac_disable();
1427
1428 del_timer(&lp->tx_reclaim_timer);
1429
1430 /* reset tx queue and free skb */
1431 while (tx_list_head != current_tx_ptr) {
1432 tx_list_head->desc_a.config &= ~DMAEN;
1433 tx_list_head->status.status_word = 0;
1434 if (tx_list_head->skb) {
1435 dev_kfree_skb(tx_list_head->skb);
1436 tx_list_head->skb = NULL;
1437 }
1438 tx_list_head = tx_list_head->next;
1439 }
1440
1441 if (netif_queue_stopped(dev))
1442 netif_wake_queue(dev);
1443
1444 bfin_mac_enable(lp->phydev);
1445
1446 /* We can accept TX packets again */
1447 dev->trans_start = jiffies; /* prevent tx timeout */
1448 }
1449
1450 static void bfin_mac_multicast_hash(struct net_device *dev)
1451 {
1452 u32 emac_hashhi, emac_hashlo;
1453 struct netdev_hw_addr *ha;
1454 u32 crc;
1455
1456 emac_hashhi = emac_hashlo = 0;
1457
1458 netdev_for_each_mc_addr(ha, dev) {
1459 crc = ether_crc(ETH_ALEN, ha->addr);
1460 crc >>= 26;
1461
1462 if (crc & 0x20)
1463 emac_hashhi |= 1 << (crc & 0x1f);
1464 else
1465 emac_hashlo |= 1 << (crc & 0x1f);
1466 }
1467
1468 bfin_write_EMAC_HASHHI(emac_hashhi);
1469 bfin_write_EMAC_HASHLO(emac_hashlo);
1470 }
1471
1472 /*
1473 * This routine will, depending on the values passed to it,
1474 * either make it accept multicast packets, go into
1475 * promiscuous mode (for TCPDUMP and cousins) or accept
1476 * a select set of multicast packets
1477 */
1478 static void bfin_mac_set_multicast_list(struct net_device *dev)
1479 {
1480 u32 sysctl;
1481
1482 if (dev->flags & IFF_PROMISC) {
1483 netdev_info(dev, "set promisc mode\n");
1484 sysctl = bfin_read_EMAC_OPMODE();
1485 sysctl |= PR;
1486 bfin_write_EMAC_OPMODE(sysctl);
1487 } else if (dev->flags & IFF_ALLMULTI) {
1488 /* accept all multicast */
1489 sysctl = bfin_read_EMAC_OPMODE();
1490 sysctl |= PAM;
1491 bfin_write_EMAC_OPMODE(sysctl);
1492 } else if (!netdev_mc_empty(dev)) {
1493 /* set up multicast hash table */
1494 sysctl = bfin_read_EMAC_OPMODE();
1495 sysctl |= HM;
1496 bfin_write_EMAC_OPMODE(sysctl);
1497 bfin_mac_multicast_hash(dev);
1498 } else {
1499 /* clear promisc or multicast mode */
1500 sysctl = bfin_read_EMAC_OPMODE();
1501 sysctl &= ~(RAF | PAM);
1502 bfin_write_EMAC_OPMODE(sysctl);
1503 }
1504 }
1505
1506 static int bfin_mac_ioctl(struct net_device *netdev, struct ifreq *ifr, int cmd)
1507 {
1508 struct bfin_mac_local *lp = netdev_priv(netdev);
1509
1510 if (!netif_running(netdev))
1511 return -EINVAL;
1512
1513 switch (cmd) {
1514 case SIOCSHWTSTAMP:
1515 return bfin_mac_hwtstamp_set(netdev, ifr);
1516 case SIOCGHWTSTAMP:
1517 return bfin_mac_hwtstamp_get(netdev, ifr);
1518 default:
1519 if (lp->phydev)
1520 return phy_mii_ioctl(lp->phydev, ifr, cmd);
1521 else
1522 return -EOPNOTSUPP;
1523 }
1524 }
1525
1526 /*
1527 * this puts the device in an inactive state
1528 */
1529 static void bfin_mac_shutdown(struct net_device *dev)
1530 {
1531 /* Turn off the EMAC */
1532 bfin_write_EMAC_OPMODE(0x00000000);
1533 /* Turn off the EMAC RX DMA */
1534 bfin_write_DMA1_CONFIG(0x0000);
1535 bfin_write_DMA2_CONFIG(0x0000);
1536 }
1537
1538 /*
1539 * Open and Initialize the interface
1540 *
1541 * Set up everything, reset the card, etc..
1542 */
1543 static int bfin_mac_open(struct net_device *dev)
1544 {
1545 struct bfin_mac_local *lp = netdev_priv(dev);
1546 int ret;
1547 pr_debug("%s: %s\n", dev->name, __func__);
1548
1549 /*
1550 * Check that the address is valid. If its not, refuse
1551 * to bring the device up. The user must specify an
1552 * address using ifconfig eth0 hw ether xx:xx:xx:xx:xx:xx
1553 */
1554 if (!is_valid_ether_addr(dev->dev_addr)) {
1555 netdev_warn(dev, "no valid ethernet hw addr\n");
1556 return -EINVAL;
1557 }
1558
1559 /* initial rx and tx list */
1560 ret = desc_list_init(dev);
1561 if (ret)
1562 return ret;
1563
1564 phy_start(lp->phydev);
1565 setup_system_regs(dev);
1566 setup_mac_addr(dev->dev_addr);
1567
1568 bfin_mac_disable();
1569 ret = bfin_mac_enable(lp->phydev);
1570 if (ret)
1571 return ret;
1572 pr_debug("hardware init finished\n");
1573
1574 napi_enable(&lp->napi);
1575 netif_start_queue(dev);
1576 netif_carrier_on(dev);
1577
1578 return 0;
1579 }
1580
1581 /*
1582 * this makes the board clean up everything that it can
1583 * and not talk to the outside world. Caused by
1584 * an 'ifconfig ethX down'
1585 */
1586 static int bfin_mac_close(struct net_device *dev)
1587 {
1588 struct bfin_mac_local *lp = netdev_priv(dev);
1589 pr_debug("%s: %s\n", dev->name, __func__);
1590
1591 netif_stop_queue(dev);
1592 napi_disable(&lp->napi);
1593 netif_carrier_off(dev);
1594
1595 phy_stop(lp->phydev);
1596 phy_write(lp->phydev, MII_BMCR, BMCR_PDOWN);
1597
1598 /* clear everything */
1599 bfin_mac_shutdown(dev);
1600
1601 /* free the rx/tx buffers */
1602 desc_list_free();
1603
1604 return 0;
1605 }
1606
1607 static const struct net_device_ops bfin_mac_netdev_ops = {
1608 .ndo_open = bfin_mac_open,
1609 .ndo_stop = bfin_mac_close,
1610 .ndo_start_xmit = bfin_mac_hard_start_xmit,
1611 .ndo_set_mac_address = bfin_mac_set_mac_address,
1612 .ndo_tx_timeout = bfin_mac_timeout,
1613 .ndo_set_rx_mode = bfin_mac_set_multicast_list,
1614 .ndo_do_ioctl = bfin_mac_ioctl,
1615 .ndo_validate_addr = eth_validate_addr,
1616 .ndo_change_mtu = eth_change_mtu,
1617 #ifdef CONFIG_NET_POLL_CONTROLLER
1618 .ndo_poll_controller = bfin_mac_poll_controller,
1619 #endif
1620 };
1621
1622 static int bfin_mac_probe(struct platform_device *pdev)
1623 {
1624 struct net_device *ndev;
1625 struct bfin_mac_local *lp;
1626 struct platform_device *pd;
1627 struct bfin_mii_bus_platform_data *mii_bus_data;
1628 int rc;
1629
1630 ndev = alloc_etherdev(sizeof(struct bfin_mac_local));
1631 if (!ndev)
1632 return -ENOMEM;
1633
1634 SET_NETDEV_DEV(ndev, &pdev->dev);
1635 platform_set_drvdata(pdev, ndev);
1636 lp = netdev_priv(ndev);
1637 lp->ndev = ndev;
1638
1639 /* Grab the MAC address in the MAC */
1640 *(__le32 *) (&(ndev->dev_addr[0])) = cpu_to_le32(bfin_read_EMAC_ADDRLO());
1641 *(__le16 *) (&(ndev->dev_addr[4])) = cpu_to_le16((u16) bfin_read_EMAC_ADDRHI());
1642
1643 /* probe mac */
1644 /*todo: how to proble? which is revision_register */
1645 bfin_write_EMAC_ADDRLO(0x12345678);
1646 if (bfin_read_EMAC_ADDRLO() != 0x12345678) {
1647 dev_err(&pdev->dev, "Cannot detect Blackfin on-chip ethernet MAC controller!\n");
1648 rc = -ENODEV;
1649 goto out_err_probe_mac;
1650 }
1651
1652
1653 /*
1654 * Is it valid? (Did bootloader initialize it?)
1655 * Grab the MAC from the board somehow
1656 * this is done in the arch/blackfin/mach-bfxxx/boards/eth_mac.c
1657 */
1658 if (!is_valid_ether_addr(ndev->dev_addr)) {
1659 if (bfin_get_ether_addr(ndev->dev_addr) ||
1660 !is_valid_ether_addr(ndev->dev_addr)) {
1661 /* Still not valid, get a random one */
1662 netdev_warn(ndev, "Setting Ethernet MAC to a random one\n");
1663 eth_hw_addr_random(ndev);
1664 }
1665 }
1666
1667 setup_mac_addr(ndev->dev_addr);
1668
1669 if (!dev_get_platdata(&pdev->dev)) {
1670 dev_err(&pdev->dev, "Cannot get platform device bfin_mii_bus!\n");
1671 rc = -ENODEV;
1672 goto out_err_probe_mac;
1673 }
1674 pd = dev_get_platdata(&pdev->dev);
1675 lp->mii_bus = platform_get_drvdata(pd);
1676 if (!lp->mii_bus) {
1677 dev_err(&pdev->dev, "Cannot get mii_bus!\n");
1678 rc = -ENODEV;
1679 goto out_err_probe_mac;
1680 }
1681 lp->mii_bus->priv = ndev;
1682 mii_bus_data = dev_get_platdata(&pd->dev);
1683
1684 rc = mii_probe(ndev, mii_bus_data->phy_mode);
1685 if (rc) {
1686 dev_err(&pdev->dev, "MII Probe failed!\n");
1687 goto out_err_mii_probe;
1688 }
1689
1690 lp->vlan1_mask = ETH_P_8021Q | mii_bus_data->vlan1_mask;
1691 lp->vlan2_mask = ETH_P_8021Q | mii_bus_data->vlan2_mask;
1692
1693 ndev->netdev_ops = &bfin_mac_netdev_ops;
1694 ndev->ethtool_ops = &bfin_mac_ethtool_ops;
1695
1696 init_timer(&lp->tx_reclaim_timer);
1697 lp->tx_reclaim_timer.data = (unsigned long)lp;
1698 lp->tx_reclaim_timer.function = tx_reclaim_skb_timeout;
1699
1700 lp->flags = 0;
1701 netif_napi_add(ndev, &lp->napi, bfin_mac_poll, CONFIG_BFIN_RX_DESC_NUM);
1702
1703 spin_lock_init(&lp->lock);
1704
1705 /* now, enable interrupts */
1706 /* register irq handler */
1707 rc = request_irq(IRQ_MAC_RX, bfin_mac_interrupt,
1708 0, "EMAC_RX", ndev);
1709 if (rc) {
1710 dev_err(&pdev->dev, "Cannot request Blackfin MAC RX IRQ!\n");
1711 rc = -EBUSY;
1712 goto out_err_request_irq;
1713 }
1714
1715 rc = register_netdev(ndev);
1716 if (rc) {
1717 dev_err(&pdev->dev, "Cannot register net device!\n");
1718 goto out_err_reg_ndev;
1719 }
1720
1721 bfin_mac_hwtstamp_init(ndev);
1722 rc = bfin_phc_init(ndev, &pdev->dev);
1723 if (rc) {
1724 dev_err(&pdev->dev, "Cannot register PHC device!\n");
1725 goto out_err_phc;
1726 }
1727
1728 /* now, print out the card info, in a short format.. */
1729 netdev_info(ndev, "%s, Version %s\n", DRV_DESC, DRV_VERSION);
1730
1731 return 0;
1732
1733 out_err_phc:
1734 out_err_reg_ndev:
1735 free_irq(IRQ_MAC_RX, ndev);
1736 out_err_request_irq:
1737 netif_napi_del(&lp->napi);
1738 out_err_mii_probe:
1739 mdiobus_unregister(lp->mii_bus);
1740 mdiobus_free(lp->mii_bus);
1741 out_err_probe_mac:
1742 free_netdev(ndev);
1743
1744 return rc;
1745 }
1746
1747 static int bfin_mac_remove(struct platform_device *pdev)
1748 {
1749 struct net_device *ndev = platform_get_drvdata(pdev);
1750 struct bfin_mac_local *lp = netdev_priv(ndev);
1751
1752 bfin_phc_release(lp);
1753
1754 lp->mii_bus->priv = NULL;
1755
1756 unregister_netdev(ndev);
1757
1758 netif_napi_del(&lp->napi);
1759
1760 free_irq(IRQ_MAC_RX, ndev);
1761
1762 free_netdev(ndev);
1763
1764 return 0;
1765 }
1766
1767 #ifdef CONFIG_PM
1768 static int bfin_mac_suspend(struct platform_device *pdev, pm_message_t mesg)
1769 {
1770 struct net_device *net_dev = platform_get_drvdata(pdev);
1771 struct bfin_mac_local *lp = netdev_priv(net_dev);
1772
1773 if (lp->wol) {
1774 bfin_write_EMAC_OPMODE((bfin_read_EMAC_OPMODE() & ~TE) | RE);
1775 bfin_write_EMAC_WKUP_CTL(MPKE);
1776 enable_irq_wake(IRQ_MAC_WAKEDET);
1777 } else {
1778 if (netif_running(net_dev))
1779 bfin_mac_close(net_dev);
1780 }
1781
1782 return 0;
1783 }
1784
1785 static int bfin_mac_resume(struct platform_device *pdev)
1786 {
1787 struct net_device *net_dev = platform_get_drvdata(pdev);
1788 struct bfin_mac_local *lp = netdev_priv(net_dev);
1789
1790 if (lp->wol) {
1791 bfin_write_EMAC_OPMODE(bfin_read_EMAC_OPMODE() | TE);
1792 bfin_write_EMAC_WKUP_CTL(0);
1793 disable_irq_wake(IRQ_MAC_WAKEDET);
1794 } else {
1795 if (netif_running(net_dev))
1796 bfin_mac_open(net_dev);
1797 }
1798
1799 return 0;
1800 }
1801 #else
1802 #define bfin_mac_suspend NULL
1803 #define bfin_mac_resume NULL
1804 #endif /* CONFIG_PM */
1805
1806 static int bfin_mii_bus_probe(struct platform_device *pdev)
1807 {
1808 struct mii_bus *miibus;
1809 struct bfin_mii_bus_platform_data *mii_bus_pd;
1810 const unsigned short *pin_req;
1811 int rc, i;
1812
1813 mii_bus_pd = dev_get_platdata(&pdev->dev);
1814 if (!mii_bus_pd) {
1815 dev_err(&pdev->dev, "No peripherals in platform data!\n");
1816 return -EINVAL;
1817 }
1818
1819 /*
1820 * We are setting up a network card,
1821 * so set the GPIO pins to Ethernet mode
1822 */
1823 pin_req = mii_bus_pd->mac_peripherals;
1824 rc = peripheral_request_list(pin_req, KBUILD_MODNAME);
1825 if (rc) {
1826 dev_err(&pdev->dev, "Requesting peripherals failed!\n");
1827 return rc;
1828 }
1829
1830 rc = -ENOMEM;
1831 miibus = mdiobus_alloc();
1832 if (miibus == NULL)
1833 goto out_err_alloc;
1834 miibus->read = bfin_mdiobus_read;
1835 miibus->write = bfin_mdiobus_write;
1836
1837 miibus->parent = &pdev->dev;
1838 miibus->name = "bfin_mii_bus";
1839 miibus->phy_mask = mii_bus_pd->phy_mask;
1840
1841 snprintf(miibus->id, MII_BUS_ID_SIZE, "%s-%x",
1842 pdev->name, pdev->id);
1843 miibus->irq = kmalloc(sizeof(int)*PHY_MAX_ADDR, GFP_KERNEL);
1844 if (!miibus->irq)
1845 goto out_err_irq_alloc;
1846
1847 for (i = rc; i < PHY_MAX_ADDR; ++i)
1848 miibus->irq[i] = PHY_POLL;
1849
1850 rc = clamp(mii_bus_pd->phydev_number, 0, PHY_MAX_ADDR);
1851 if (rc != mii_bus_pd->phydev_number)
1852 dev_err(&pdev->dev, "Invalid number (%i) of phydevs\n",
1853 mii_bus_pd->phydev_number);
1854 for (i = 0; i < rc; ++i) {
1855 unsigned short phyaddr = mii_bus_pd->phydev_data[i].addr;
1856 if (phyaddr < PHY_MAX_ADDR)
1857 miibus->irq[phyaddr] = mii_bus_pd->phydev_data[i].irq;
1858 else
1859 dev_err(&pdev->dev,
1860 "Invalid PHY address %i for phydev %i\n",
1861 phyaddr, i);
1862 }
1863
1864 rc = mdiobus_register(miibus);
1865 if (rc) {
1866 dev_err(&pdev->dev, "Cannot register MDIO bus!\n");
1867 goto out_err_mdiobus_register;
1868 }
1869
1870 platform_set_drvdata(pdev, miibus);
1871 return 0;
1872
1873 out_err_mdiobus_register:
1874 kfree(miibus->irq);
1875 out_err_irq_alloc:
1876 mdiobus_free(miibus);
1877 out_err_alloc:
1878 peripheral_free_list(pin_req);
1879
1880 return rc;
1881 }
1882
1883 static int bfin_mii_bus_remove(struct platform_device *pdev)
1884 {
1885 struct mii_bus *miibus = platform_get_drvdata(pdev);
1886 struct bfin_mii_bus_platform_data *mii_bus_pd =
1887 dev_get_platdata(&pdev->dev);
1888
1889 mdiobus_unregister(miibus);
1890 kfree(miibus->irq);
1891 mdiobus_free(miibus);
1892 peripheral_free_list(mii_bus_pd->mac_peripherals);
1893
1894 return 0;
1895 }
1896
1897 static struct platform_driver bfin_mii_bus_driver = {
1898 .probe = bfin_mii_bus_probe,
1899 .remove = bfin_mii_bus_remove,
1900 .driver = {
1901 .name = "bfin_mii_bus",
1902 },
1903 };
1904
1905 static struct platform_driver bfin_mac_driver = {
1906 .probe = bfin_mac_probe,
1907 .remove = bfin_mac_remove,
1908 .resume = bfin_mac_resume,
1909 .suspend = bfin_mac_suspend,
1910 .driver = {
1911 .name = KBUILD_MODNAME,
1912 },
1913 };
1914
1915 static int __init bfin_mac_init(void)
1916 {
1917 int ret;
1918 ret = platform_driver_register(&bfin_mii_bus_driver);
1919 if (!ret)
1920 return platform_driver_register(&bfin_mac_driver);
1921 return -ENODEV;
1922 }
1923
1924 module_init(bfin_mac_init);
1925
1926 static void __exit bfin_mac_cleanup(void)
1927 {
1928 platform_driver_unregister(&bfin_mac_driver);
1929 platform_driver_unregister(&bfin_mii_bus_driver);
1930 }
1931
1932 module_exit(bfin_mac_cleanup);
1933
1934
This page was automatically generated by LXR 0.3.1 (source). • Linux is a registered trademark of Linus Torvalds • Contact us
|
{
"url": "http://lxr.free-electrons.com/source/drivers/net/ethernet/adi/bfin_mac.c",
"source_domain": "lxr.free-electrons.com",
"snapshot_id": "crawl=CC-MAIN-2015-48",
"warc_metadata": {
"Content-Length": "290237",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:24ZTNLUY3MPT4WPFNZPG4AEAP4PHPL4R",
"WARC-Concurrent-To": "<urn:uuid:5ac946c2-74eb-4d84-bd6a-1f27c06edcae>",
"WARC-Date": "2015-11-25T10:14:53Z",
"WARC-IP-Address": "91.121.45.118",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:ZSZWNQ5I6HNXYIPQVZ6L4XQHPN2C5XR3",
"WARC-Record-ID": "<urn:uuid:5ad1e27f-c348-46b5-b53e-4ba014a13df7>",
"WARC-Target-URI": "http://lxr.free-electrons.com/source/drivers/net/ethernet/adi/bfin_mac.c",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:87398ff8-af6d-4c6a-bcf3-707485668fc1>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-71-132-137.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for Nov 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
109,
110,
152,
153,
160,
195,
202,
249,
256,
306,
313,
355,
363,
368,
402,
469,
474,
522,
527,
555,
585,
615,
644,
672,
701,
730,
759,
786,
812,
842,
871,
901,
933,
960,
993,
1028,
1059,
1089,
1128,
1133,
1158,
1193,
1198,
1225,
1251,
1281,
1313,
1342,
1368,
1373,
1399,
1404,
1446,
1473,
1507,
1546,
1551,
1591,
1673,
1748,
1758,
1811,
1882,
1933,
2004,
2015,
2020,
2048,
2053,
2085,
2090,
2135,
2184,
2233,
2282,
2331,
2382,
2433,
2477,
2521,
2526,
2563,
2569,
2608,
2647,
2666,
2707,
2746,
2757,
2762,
2789,
2827,
2895,
2932,
2982,
3049,
3108,
3146,
3195,
3225,
3247,
3328,
3342,
3347,
3374,
3412,
3480,
3517,
3567,
3634,
3693,
3731,
3780,
3810,
3832,
3913,
3927,
3933,
3938,
3992,
3998,
4017,
4054,
4095,
4110,
4186,
4267,
4283,
4318,
4329,
4334,
4384,
4452,
4514,
4547,
4584,
4589,
4639,
4707,
4769,
4802,
4839,
4844,
4875,
4926,
4931,
4991,
5052,
5113,
5174,
5179,
5202,
5237,
5285,
5328,
5377,
5416,
5440,
5510,
5572,
5608,
5650,
5655,
5678,
5713,
5760,
5803,
5844,
5893,
5932,
5956,
6040,
6107,
6143,
6148,
6183,
6243,
6287,
6325,
6339,
6417,
6491,
6534,
6539,
6570,
6621,
6626,
6686,
6747,
6808,
6869,
6874,
6941,
7021,
7055,
7100,
7105,
7161,
7249,
7330,
7354,
7437,
7512,
7550,
7555,
7578,
7613,
7660,
7703,
7744,
7793,
7832,
7856,
7940,
7989,
8059,
8095,
8137,
8142,
8165,
8200,
8247,
8290,
8330,
8379,
8418,
8442,
8508,
8570,
8637,
8673,
8678,
8738,
8782,
8820,
8834,
8912,
8986,
9029,
9034,
9056,
9061,
9077,
9107,
9147,
9175,
9181,
9186,
9191,
9273,
9278,
9285,
9307,
9315,
9384,
9420,
9426,
9473,
9478,
9517,
9575,
9606,
9651,
9738,
9785,
9807,
9821,
9826,
9848,
9854,
9859,
9930,
10010,
10016,
10037,
10042,
10078,
10099,
10131,
10136,
10164,
10227,
10289,
10335,
10340,
10376,
10397,
10429,
10434,
10484,
10490,
10495,
10567,
10648,
10693,
10699,
10720,
10725,
10761,
10782,
10814,
10819,
10868,
10873,
10902,
10965,
11027,
11071,
11117,
11122,
11159,
11165,
11170,
11231,
11237,
11295,
11347,
11380,
11411,
11416,
11465,
11497,
11573,
11639,
11699,
11765,
11808,
11813,
11861,
11915,
11948,
12005,
12010,
12070,
12131,
12153,
12158,
12216,
12296,
12370,
12431,
12476,
12539,
12590,
12636,
12700,
12751,
12796,
12857,
12945,
13013,
13064,
13102,
13170,
13200,
13205,
13248,
13307,
13329,
13334,
13375,
13418,
13464,
13486,
13525,
13560,
13598,
13637,
13678,
13692,
13697,
13726,
13784,
13830,
13894,
13908,
13913,
13967,
13973,
13978,
14003,
14031,
14036,
14099,
14105,
14163,
14209,
14244,
14263,
14294,
14299,
14341,
14391,
14461,
14466,
14497,
14547,
14552,
14598,
14661,
14705,
14710,
14760,
14809,
14892,
14897,
14934,
14993,
14998,
15039,
15081,
15095,
15100,
15179,
15206,
15268,
15304,
15318,
15323,
15378,
15436,
15505,
15541,
15555,
15560,
15622,
15689,
15694,
15728,
15791,
15835,
15849,
15854,
15905,
15962,
16021,
16081,
16141,
16195,
16270,
16320,
16371,
16376,
16429,
16434,
16464,
16495,
16528,
16561,
16566,
16614,
16706,
16782,
16835,
16840,
16862,
16868,
16873,
16880,
16903,
16911,
16916,
16923,
16972,
16980,
17050,
17056,
17088,
17094,
17099,
17114,
17196,
17202,
17260,
17265,
17293,
17355,
17360,
17388,
17394,
17399,
17414,
17496,
17502,
17560,
17565,
17606,
17641,
17646,
17674,
17736,
17741,
17769,
17775,
17780,
17848,
17922,
17928,
18001,
18073,
18145,
18227,
18233,
18238,
18302,
18347,
18353,
18411,
18416,
18461,
18501,
18507,
18512,
18575,
18620,
18626,
18684,
18704,
18709,
18764,
18813,
18862,
18911,
18958,
18998,
19003,
19043,
19048,
19102,
19154,
19233,
19292,
19320,
19359,
19410,
19424,
19429,
19483,
19535,
19587,
19601,
19606,
19665,
19717,
19722,
19744,
19750,
19755,
19794,
19862,
19904,
19910,
19968,
19973,
20009,
20060,
20111,
20162,
20207,
20236,
20281,
20324,
20355,
20405,
20466,
20527,
20587,
20609,
20615,
20626,
20631,
20692,
20750,
20808,
20853,
20909,
20957,
21005,
21044,
21101,
21112,
21119,
21124,
21205,
21263,
21269,
21327,
21346,
21381,
21386,
21401,
21462,
21534,
21550,
21596,
21611,
21671,
21722,
21738,
21785,
21842,
21877,
21911,
21948,
21977,
22016,
22045,
22055,
22085,
22096,
22140,
22145,
22196,
22201,
22277,
22328,
22379,
22384,
22442,
22482,
22523,
22563,
22604,
22609,
22667,
22707,
22748,
22788,
22829,
22835,
22840,
22885,
22891,
22958,
23024,
23029,
23087,
23133,
23178,
23184,
23189,
23262,
23268,
23307,
23343,
23378,
23443,
23486,
23508,
23514,
23519,
23558,
23633,
23638,
23718,
23724,
23772,
23797,
23833,
23838,
23871,
23902,
23931,
23945,
23980,
24019,
24025,
24030,
24094,
24150,
24156,
24199,
24260,
24284,
24333,
24338,
24410,
24446,
24451,
24527,
24614,
24619,
24668,
24698,
24734,
24739,
24794,
24858,
24894,
24899,
24946,
24951,
24991,
25030,
25053,
25104,
25128,
25169,
25222,
25249,
25299,
25348,
25402,
25425,
25514,
25570,
25594,
25633,
25686,
25709,
25787,
25811,
25853,
25908,
25931,
26015,
26049,
26073,
26114,
26167,
26208,
26261,
26284,
26366,
26436,
26460,
26501,
26554,
26559,
26631,
26658,
26708,
26757,
26808,
26887,
26965,
26989,
27028,
27081,
27104,
27193,
27242,
27266,
27308,
27363,
27386,
27470,
27504,
27528,
27569,
27622,
27663,
27716,
27739,
27823,
27867,
27891,
27932,
27985,
27990,
28062,
28089,
28139,
28188,
28242,
28265,
28356,
28412,
28436,
28475,
28528,
28551,
28637,
28707,
28731,
28773,
28828,
28851,
28940,
29009,
29033,
29074,
29127,
29168,
29221,
29244,
29323,
29381,
29405,
29446,
29499,
29504,
29576,
29603,
29624,
29660,
29674,
29679,
29732,
29795,
29834,
29887,
29892,
29921,
29942,
29980,
30033,
30038,
30061,
30113,
30137,
30188,
30239,
30244,
30295,
30346,
30351,
30380,
30394,
30399,
30435,
30509,
30542,
30548,
30553,
30617,
30673,
30679,
30740,
30745,
30808,
30865,
30898,
30904,
30909,
30990,
30996,
31057,
31062,
31125,
31180,
31185,
31268,
31306,
31330,
31398,
31403,
31426,
31514,
31610,
31711,
31778,
31802,
31888,
31927,
31969,
32053,
32080,
32149,
32185,
32225,
32230,
32298,
32378,
32452,
32506,
32574,
32636,
32658,
32672,
32678,
32683,
32764,
32770,
32831,
32854,
32882,
32936,
32941,
33009,
33037,
33042,
33097,
33121,
33149,
33154,
33200,
33205,
33257,
33321,
33359,
33417,
33470,
33476,
33481,
33547,
33553,
33614,
33643,
33679,
33684,
33728,
33764,
33832,
33877,
33916,
33969,
33974,
34007,
34052,
34086,
34140,
34145,
34189,
34249,
34302,
34308,
34313,
34374,
34380,
34400,
34424,
34429,
34475,
34521,
34526,
34561,
34583,
34613,
34618,
34641,
34647,
34652,
34723,
34729,
34753,
34758,
34788,
34815,
34849,
34854,
34898,
34942,
34948,
34953,
34993,
34998,
35067,
35073,
35094,
35124,
35153,
35193,
35261,
35266,
35293,
35326,
35358,
35372,
35405,
35431,
35455,
35503,
35508,
35570,
35575,
35623,
35628,
35650,
35656,
35661,
35732,
35738,
35759,
35792,
35832,
35900,
35905,
35958,
35963,
36005,
36031,
36073,
36078,
36136,
36141,
36163,
36169,
36174,
36257,
36263,
36283,
36316,
36356,
36424,
36429,
36482,
36487,
36528,
36533,
36591,
36596,
36636,
36642,
36665,
36672,
36678,
36739,
36800,
36807,
36828,
36862,
36903,
36972,
36978,
37018,
37024,
37078,
37084,
37126,
37132,
37191,
37197,
37220,
37227,
37233,
37293,
37362,
37369,
37402,
37409,
37415,
37467,
37511,
37557,
37591,
37625,
37659,
37693,
37727,
37761,
37810,
37859,
37908,
37957,
38005,
38013,
38019,
38096,
38103,
38165,
38171,
38210,
38255,
38316,
38352,
38400,
38406,
38463,
38507,
38513,
38536,
38543,
38549,
38610,
38617,
38663,
38670,
38676,
38687,
38734,
38776,
38836,
38896,
38937,
38978,
39021,
39056,
39068,
39074,
39120,
39127,
39145,
39205,
39264,
39310,
39379,
39434,
39457,
39513,
39519,
39581,
39588,
39594,
39653,
39660,
39708,
39714,
39770,
39810,
39816,
39873,
39942,
40025,
40066,
40136,
40211,
40255,
40307,
40351,
40374,
40380,
40423,
40471,
40497,
40554,
40569,
40575,
40632,
40684,
40733,
40739,
40790,
40867,
40923,
40983,
41057,
41083,
41143,
41210,
41216,
41270,
41330,
41345,
41351,
41372,
41379,
41385,
41443,
41450,
41508,
41515,
41521,
41583,
41644,
41651,
41710,
41734,
41798,
41804,
41844,
41850,
41888,
41956,
42008,
42054,
42078,
42170,
42264,
42363,
42429,
42454,
42524,
42570,
42576,
42644,
42690,
42750,
42822,
42844,
42919,
42986,
43056,
43131,
43206,
43246,
43303,
43361,
43411,
43469,
43545,
43560,
43566,
43642,
43718,
43770,
43787,
43809,
43815,
43881,
43934,
43940,
43984,
44037,
44043,
44093,
44149,
44180,
44186,
44227,
44298,
44358,
44426,
44465,
44532,
44538,
44548,
44589,
44595,
44647,
44685,
44733,
44739,
44772,
44778,
44812,
44819,
44825,
44855,
44924,
44996,
45002,
45058,
45065,
45113,
45157,
45190,
45230,
45259,
45308,
45320,
45326,
45396,
45452,
45469,
45540,
45621,
45667,
45698,
45713,
45719,
45779,
45819,
45825,
45898,
45927,
45973,
46004,
46019,
46072,
46121,
46202,
46276,
46293,
46369,
46445,
46451,
46495,
46578,
46584,
46668,
46743,
46776,
46808,
46814,
46869,
46875,
46916,
46922,
46962,
47054,
47139,
47228,
47288,
47305,
47358,
47431,
47455,
47544,
47627,
47714,
47797,
47871,
47896,
47937,
47978,
48041,
48117,
48205,
48235,
48298,
48370,
48454,
48477,
48534,
48549,
48561,
48567,
48614,
48620,
48658,
48699,
48709,
48771,
48823,
48830,
48836,
48904,
48911,
48935,
48995,
49072,
49133,
49139,
49216,
49254,
49280,
49295,
49301,
49332,
49374,
49457,
49510,
49525,
49531,
49554,
49561,
49567,
49626,
49692,
49699,
49761,
49786,
49792,
49843,
49849,
49919,
49957,
50010,
50078,
50125,
50140,
50146,
50179,
50186,
50192,
50231,
50297,
50304,
50363,
50369,
50419,
50452,
50459,
50529,
50535,
50575,
50582,
50616,
50622,
50669,
50699,
50729,
50766,
50811,
50818,
50824,
50832,
50881,
50890,
50949,
50956,
50978,
51003,
51009,
51050,
51056,
51086,
51155,
51221,
51227,
51260,
51297,
51319,
51352,
51358,
51400,
51456,
51507,
51585,
51627,
51679,
51723,
51770,
51804,
51840,
51858,
51905,
51932,
51938,
52003,
52081,
52137,
52190,
52222,
52306,
52394,
52480,
52567,
52631,
52664,
52707,
52730,
52742,
52757,
52763,
52802,
52847,
52853,
52876,
52883,
52889,
52955,
53013,
53020,
53079,
53085,
53141,
53147,
53180,
53186,
53233,
53239,
53286,
53340,
53400,
53459,
53505,
53568,
53623,
53646,
53702,
53717,
53723,
53766,
53810,
53816,
53858,
53864,
53914,
53980,
53987,
53993,
54058,
54065,
54108,
54148,
54170,
54176,
54220,
54226,
54274,
54332,
54365,
54371,
54408,
54471,
54497,
54560,
54575,
54581,
54631,
54681,
54688,
54694,
54702,
54767,
54824,
54885,
54927,
54936,
55005,
55012,
55037,
55043,
55088,
55149,
55204,
55239,
55292,
55345,
55393,
55448,
55484,
55537,
55586,
55641,
55696,
55731,
55784,
55835,
55857,
55916,
55971,
56016,
56069,
56084,
56091,
56097,
56183,
56190,
56252,
56258,
56299,
56336,
56342,
56370,
56403,
56467,
56500,
56564,
56586,
56623,
56696,
56722,
56771,
56786,
56793,
56799,
56807,
56857,
56866,
56925,
56932,
56969,
57018,
57062,
57107,
57152,
57159,
57165,
57173,
57215,
57223,
57272,
57281,
57335,
57342,
57401,
57423,
57479,
57485,
57501,
57570,
57636,
57707,
57724,
57780,
57850,
57887,
57902,
57908,
57950,
57990,
58012,
58045,
58051,
58087,
58124,
58168,
58174,
58207,
58255,
58277,
58310,
58361,
58367,
58404,
58441,
58477,
58483,
58506,
58513,
58519,
58527,
58588,
58643,
58675,
58684,
58739,
58746,
58805,
58861,
58867,
58903,
58941,
58978,
58984,
59019,
59077,
59083,
59119,
59156,
59162,
59204,
59235,
59241,
59264,
59271,
59277,
59341,
59395,
59450,
59515,
59580,
59637,
59705,
59760,
59818,
59873,
59912,
59977,
59989,
59997,
60003,
60064,
60071,
60109,
60149,
60190,
60252,
60273,
60279,
60346,
60370,
60407,
60413,
60460,
60507,
60544,
60574,
60580,
60631,
60719,
60813,
60819,
60848,
60914,
60963,
61021,
61124,
61159,
61204,
61219,
61225,
61231,
61247,
61308,
61360,
61438,
61455,
61512,
61576,
61642,
61711,
61801,
61856,
61879,
61894,
61900,
61945,
61951,
62001,
62089,
62124,
62169,
62184,
62232,
62285,
62318,
62385,
62420,
62465,
62480,
62519,
62575,
62581,
62640,
62663,
62728,
62773,
62788,
62794,
62864,
62934,
62940,
62994,
63050,
63056,
63104,
63164,
63233,
63239,
63267,
63353,
63359,
63399,
63405,
63447,
63487,
63549,
63599,
63622,
63705,
63739,
63786,
63801,
63807,
63848,
63871,
63946,
63990,
64005,
64011,
64054,
64105,
64128,
64203,
64242,
64257,
64263,
64332,
64407,
64413,
64436,
64442,
64460,
64483,
64524,
64550,
64590,
64614,
64660,
64700,
64724,
64756,
64762,
64786,
64793,
64799,
64861,
64868,
64935,
64995,
65001,
65036,
65042,
65081,
65087,
65125,
65131,
65171,
65177,
65218,
65224,
65256,
65262,
65285,
65292,
65298,
65320,
65402,
65409,
65479,
65542,
65548,
65576,
65659,
65712,
65767,
65789,
65838,
65892,
65907,
65913,
65936,
65943,
65949,
66011,
66018,
66088,
66151,
66157,
66185,
66260,
66310,
66366,
66388,
66437,
66490,
66505,
66511,
66534,
66541,
66552,
66587,
66621,
66650,
66656,
66721,
66728,
66765,
66825,
66869,
66893,
66899,
66955,
66987,
67067,
67104,
67119,
67125,
67141,
67191,
67245,
67262,
67314,
67382,
67405,
67483,
67515,
67530,
67536,
67563,
67602,
67635,
67676,
67723,
67772,
67778,
67820,
67864,
67918,
67924,
67984,
68028,
68102,
68133,
68178,
68184,
68233,
68281,
68287,
68356,
68406,
68483,
68540,
68580,
68659,
68708,
68792,
68818,
68867,
68946,
68996,
69011,
69017,
69061,
69084,
69157,
69209,
69224,
69230,
69279,
69302,
69308,
69339,
69372,
69396,
69431,
69451,
69495,
69501,
69525,
69532,
69538,
69604,
69611,
69677,
69738,
69789,
69795,
69836,
69869,
69904,
69968,
69974,
69997,
70004,
70010,
70069,
70111,
70155,
70180,
70225,
70241,
70249,
70255,
70310,
70348,
70388,
70428,
70470,
70495,
70540,
70556,
70564,
70570,
70613,
70620,
70642,
70709,
70732,
70804,
70833,
70840,
70846,
70879,
70885,
70932,
70939,
70998,
71061,
71068,
71074,
71110,
71116,
71122,
71123
],
"line_end_idx": [
109,
110,
152,
153,
160,
195,
202,
249,
256,
306,
313,
355,
363,
368,
402,
469,
474,
522,
527,
555,
585,
615,
644,
672,
701,
730,
759,
786,
812,
842,
871,
901,
933,
960,
993,
1028,
1059,
1089,
1128,
1133,
1158,
1193,
1198,
1225,
1251,
1281,
1313,
1342,
1368,
1373,
1399,
1404,
1446,
1473,
1507,
1546,
1551,
1591,
1673,
1748,
1758,
1811,
1882,
1933,
2004,
2015,
2020,
2048,
2053,
2085,
2090,
2135,
2184,
2233,
2282,
2331,
2382,
2433,
2477,
2521,
2526,
2563,
2569,
2608,
2647,
2666,
2707,
2746,
2757,
2762,
2789,
2827,
2895,
2932,
2982,
3049,
3108,
3146,
3195,
3225,
3247,
3328,
3342,
3347,
3374,
3412,
3480,
3517,
3567,
3634,
3693,
3731,
3780,
3810,
3832,
3913,
3927,
3933,
3938,
3992,
3998,
4017,
4054,
4095,
4110,
4186,
4267,
4283,
4318,
4329,
4334,
4384,
4452,
4514,
4547,
4584,
4589,
4639,
4707,
4769,
4802,
4839,
4844,
4875,
4926,
4931,
4991,
5052,
5113,
5174,
5179,
5202,
5237,
5285,
5328,
5377,
5416,
5440,
5510,
5572,
5608,
5650,
5655,
5678,
5713,
5760,
5803,
5844,
5893,
5932,
5956,
6040,
6107,
6143,
6148,
6183,
6243,
6287,
6325,
6339,
6417,
6491,
6534,
6539,
6570,
6621,
6626,
6686,
6747,
6808,
6869,
6874,
6941,
7021,
7055,
7100,
7105,
7161,
7249,
7330,
7354,
7437,
7512,
7550,
7555,
7578,
7613,
7660,
7703,
7744,
7793,
7832,
7856,
7940,
7989,
8059,
8095,
8137,
8142,
8165,
8200,
8247,
8290,
8330,
8379,
8418,
8442,
8508,
8570,
8637,
8673,
8678,
8738,
8782,
8820,
8834,
8912,
8986,
9029,
9034,
9056,
9061,
9077,
9107,
9147,
9175,
9181,
9186,
9191,
9273,
9278,
9285,
9307,
9315,
9384,
9420,
9426,
9473,
9478,
9517,
9575,
9606,
9651,
9738,
9785,
9807,
9821,
9826,
9848,
9854,
9859,
9930,
10010,
10016,
10037,
10042,
10078,
10099,
10131,
10136,
10164,
10227,
10289,
10335,
10340,
10376,
10397,
10429,
10434,
10484,
10490,
10495,
10567,
10648,
10693,
10699,
10720,
10725,
10761,
10782,
10814,
10819,
10868,
10873,
10902,
10965,
11027,
11071,
11117,
11122,
11159,
11165,
11170,
11231,
11237,
11295,
11347,
11380,
11411,
11416,
11465,
11497,
11573,
11639,
11699,
11765,
11808,
11813,
11861,
11915,
11948,
12005,
12010,
12070,
12131,
12153,
12158,
12216,
12296,
12370,
12431,
12476,
12539,
12590,
12636,
12700,
12751,
12796,
12857,
12945,
13013,
13064,
13102,
13170,
13200,
13205,
13248,
13307,
13329,
13334,
13375,
13418,
13464,
13486,
13525,
13560,
13598,
13637,
13678,
13692,
13697,
13726,
13784,
13830,
13894,
13908,
13913,
13967,
13973,
13978,
14003,
14031,
14036,
14099,
14105,
14163,
14209,
14244,
14263,
14294,
14299,
14341,
14391,
14461,
14466,
14497,
14547,
14552,
14598,
14661,
14705,
14710,
14760,
14809,
14892,
14897,
14934,
14993,
14998,
15039,
15081,
15095,
15100,
15179,
15206,
15268,
15304,
15318,
15323,
15378,
15436,
15505,
15541,
15555,
15560,
15622,
15689,
15694,
15728,
15791,
15835,
15849,
15854,
15905,
15962,
16021,
16081,
16141,
16195,
16270,
16320,
16371,
16376,
16429,
16434,
16464,
16495,
16528,
16561,
16566,
16614,
16706,
16782,
16835,
16840,
16862,
16868,
16873,
16880,
16903,
16911,
16916,
16923,
16972,
16980,
17050,
17056,
17088,
17094,
17099,
17114,
17196,
17202,
17260,
17265,
17293,
17355,
17360,
17388,
17394,
17399,
17414,
17496,
17502,
17560,
17565,
17606,
17641,
17646,
17674,
17736,
17741,
17769,
17775,
17780,
17848,
17922,
17928,
18001,
18073,
18145,
18227,
18233,
18238,
18302,
18347,
18353,
18411,
18416,
18461,
18501,
18507,
18512,
18575,
18620,
18626,
18684,
18704,
18709,
18764,
18813,
18862,
18911,
18958,
18998,
19003,
19043,
19048,
19102,
19154,
19233,
19292,
19320,
19359,
19410,
19424,
19429,
19483,
19535,
19587,
19601,
19606,
19665,
19717,
19722,
19744,
19750,
19755,
19794,
19862,
19904,
19910,
19968,
19973,
20009,
20060,
20111,
20162,
20207,
20236,
20281,
20324,
20355,
20405,
20466,
20527,
20587,
20609,
20615,
20626,
20631,
20692,
20750,
20808,
20853,
20909,
20957,
21005,
21044,
21101,
21112,
21119,
21124,
21205,
21263,
21269,
21327,
21346,
21381,
21386,
21401,
21462,
21534,
21550,
21596,
21611,
21671,
21722,
21738,
21785,
21842,
21877,
21911,
21948,
21977,
22016,
22045,
22055,
22085,
22096,
22140,
22145,
22196,
22201,
22277,
22328,
22379,
22384,
22442,
22482,
22523,
22563,
22604,
22609,
22667,
22707,
22748,
22788,
22829,
22835,
22840,
22885,
22891,
22958,
23024,
23029,
23087,
23133,
23178,
23184,
23189,
23262,
23268,
23307,
23343,
23378,
23443,
23486,
23508,
23514,
23519,
23558,
23633,
23638,
23718,
23724,
23772,
23797,
23833,
23838,
23871,
23902,
23931,
23945,
23980,
24019,
24025,
24030,
24094,
24150,
24156,
24199,
24260,
24284,
24333,
24338,
24410,
24446,
24451,
24527,
24614,
24619,
24668,
24698,
24734,
24739,
24794,
24858,
24894,
24899,
24946,
24951,
24991,
25030,
25053,
25104,
25128,
25169,
25222,
25249,
25299,
25348,
25402,
25425,
25514,
25570,
25594,
25633,
25686,
25709,
25787,
25811,
25853,
25908,
25931,
26015,
26049,
26073,
26114,
26167,
26208,
26261,
26284,
26366,
26436,
26460,
26501,
26554,
26559,
26631,
26658,
26708,
26757,
26808,
26887,
26965,
26989,
27028,
27081,
27104,
27193,
27242,
27266,
27308,
27363,
27386,
27470,
27504,
27528,
27569,
27622,
27663,
27716,
27739,
27823,
27867,
27891,
27932,
27985,
27990,
28062,
28089,
28139,
28188,
28242,
28265,
28356,
28412,
28436,
28475,
28528,
28551,
28637,
28707,
28731,
28773,
28828,
28851,
28940,
29009,
29033,
29074,
29127,
29168,
29221,
29244,
29323,
29381,
29405,
29446,
29499,
29504,
29576,
29603,
29624,
29660,
29674,
29679,
29732,
29795,
29834,
29887,
29892,
29921,
29942,
29980,
30033,
30038,
30061,
30113,
30137,
30188,
30239,
30244,
30295,
30346,
30351,
30380,
30394,
30399,
30435,
30509,
30542,
30548,
30553,
30617,
30673,
30679,
30740,
30745,
30808,
30865,
30898,
30904,
30909,
30990,
30996,
31057,
31062,
31125,
31180,
31185,
31268,
31306,
31330,
31398,
31403,
31426,
31514,
31610,
31711,
31778,
31802,
31888,
31927,
31969,
32053,
32080,
32149,
32185,
32225,
32230,
32298,
32378,
32452,
32506,
32574,
32636,
32658,
32672,
32678,
32683,
32764,
32770,
32831,
32854,
32882,
32936,
32941,
33009,
33037,
33042,
33097,
33121,
33149,
33154,
33200,
33205,
33257,
33321,
33359,
33417,
33470,
33476,
33481,
33547,
33553,
33614,
33643,
33679,
33684,
33728,
33764,
33832,
33877,
33916,
33969,
33974,
34007,
34052,
34086,
34140,
34145,
34189,
34249,
34302,
34308,
34313,
34374,
34380,
34400,
34424,
34429,
34475,
34521,
34526,
34561,
34583,
34613,
34618,
34641,
34647,
34652,
34723,
34729,
34753,
34758,
34788,
34815,
34849,
34854,
34898,
34942,
34948,
34953,
34993,
34998,
35067,
35073,
35094,
35124,
35153,
35193,
35261,
35266,
35293,
35326,
35358,
35372,
35405,
35431,
35455,
35503,
35508,
35570,
35575,
35623,
35628,
35650,
35656,
35661,
35732,
35738,
35759,
35792,
35832,
35900,
35905,
35958,
35963,
36005,
36031,
36073,
36078,
36136,
36141,
36163,
36169,
36174,
36257,
36263,
36283,
36316,
36356,
36424,
36429,
36482,
36487,
36528,
36533,
36591,
36596,
36636,
36642,
36665,
36672,
36678,
36739,
36800,
36807,
36828,
36862,
36903,
36972,
36978,
37018,
37024,
37078,
37084,
37126,
37132,
37191,
37197,
37220,
37227,
37233,
37293,
37362,
37369,
37402,
37409,
37415,
37467,
37511,
37557,
37591,
37625,
37659,
37693,
37727,
37761,
37810,
37859,
37908,
37957,
38005,
38013,
38019,
38096,
38103,
38165,
38171,
38210,
38255,
38316,
38352,
38400,
38406,
38463,
38507,
38513,
38536,
38543,
38549,
38610,
38617,
38663,
38670,
38676,
38687,
38734,
38776,
38836,
38896,
38937,
38978,
39021,
39056,
39068,
39074,
39120,
39127,
39145,
39205,
39264,
39310,
39379,
39434,
39457,
39513,
39519,
39581,
39588,
39594,
39653,
39660,
39708,
39714,
39770,
39810,
39816,
39873,
39942,
40025,
40066,
40136,
40211,
40255,
40307,
40351,
40374,
40380,
40423,
40471,
40497,
40554,
40569,
40575,
40632,
40684,
40733,
40739,
40790,
40867,
40923,
40983,
41057,
41083,
41143,
41210,
41216,
41270,
41330,
41345,
41351,
41372,
41379,
41385,
41443,
41450,
41508,
41515,
41521,
41583,
41644,
41651,
41710,
41734,
41798,
41804,
41844,
41850,
41888,
41956,
42008,
42054,
42078,
42170,
42264,
42363,
42429,
42454,
42524,
42570,
42576,
42644,
42690,
42750,
42822,
42844,
42919,
42986,
43056,
43131,
43206,
43246,
43303,
43361,
43411,
43469,
43545,
43560,
43566,
43642,
43718,
43770,
43787,
43809,
43815,
43881,
43934,
43940,
43984,
44037,
44043,
44093,
44149,
44180,
44186,
44227,
44298,
44358,
44426,
44465,
44532,
44538,
44548,
44589,
44595,
44647,
44685,
44733,
44739,
44772,
44778,
44812,
44819,
44825,
44855,
44924,
44996,
45002,
45058,
45065,
45113,
45157,
45190,
45230,
45259,
45308,
45320,
45326,
45396,
45452,
45469,
45540,
45621,
45667,
45698,
45713,
45719,
45779,
45819,
45825,
45898,
45927,
45973,
46004,
46019,
46072,
46121,
46202,
46276,
46293,
46369,
46445,
46451,
46495,
46578,
46584,
46668,
46743,
46776,
46808,
46814,
46869,
46875,
46916,
46922,
46962,
47054,
47139,
47228,
47288,
47305,
47358,
47431,
47455,
47544,
47627,
47714,
47797,
47871,
47896,
47937,
47978,
48041,
48117,
48205,
48235,
48298,
48370,
48454,
48477,
48534,
48549,
48561,
48567,
48614,
48620,
48658,
48699,
48709,
48771,
48823,
48830,
48836,
48904,
48911,
48935,
48995,
49072,
49133,
49139,
49216,
49254,
49280,
49295,
49301,
49332,
49374,
49457,
49510,
49525,
49531,
49554,
49561,
49567,
49626,
49692,
49699,
49761,
49786,
49792,
49843,
49849,
49919,
49957,
50010,
50078,
50125,
50140,
50146,
50179,
50186,
50192,
50231,
50297,
50304,
50363,
50369,
50419,
50452,
50459,
50529,
50535,
50575,
50582,
50616,
50622,
50669,
50699,
50729,
50766,
50811,
50818,
50824,
50832,
50881,
50890,
50949,
50956,
50978,
51003,
51009,
51050,
51056,
51086,
51155,
51221,
51227,
51260,
51297,
51319,
51352,
51358,
51400,
51456,
51507,
51585,
51627,
51679,
51723,
51770,
51804,
51840,
51858,
51905,
51932,
51938,
52003,
52081,
52137,
52190,
52222,
52306,
52394,
52480,
52567,
52631,
52664,
52707,
52730,
52742,
52757,
52763,
52802,
52847,
52853,
52876,
52883,
52889,
52955,
53013,
53020,
53079,
53085,
53141,
53147,
53180,
53186,
53233,
53239,
53286,
53340,
53400,
53459,
53505,
53568,
53623,
53646,
53702,
53717,
53723,
53766,
53810,
53816,
53858,
53864,
53914,
53980,
53987,
53993,
54058,
54065,
54108,
54148,
54170,
54176,
54220,
54226,
54274,
54332,
54365,
54371,
54408,
54471,
54497,
54560,
54575,
54581,
54631,
54681,
54688,
54694,
54702,
54767,
54824,
54885,
54927,
54936,
55005,
55012,
55037,
55043,
55088,
55149,
55204,
55239,
55292,
55345,
55393,
55448,
55484,
55537,
55586,
55641,
55696,
55731,
55784,
55835,
55857,
55916,
55971,
56016,
56069,
56084,
56091,
56097,
56183,
56190,
56252,
56258,
56299,
56336,
56342,
56370,
56403,
56467,
56500,
56564,
56586,
56623,
56696,
56722,
56771,
56786,
56793,
56799,
56807,
56857,
56866,
56925,
56932,
56969,
57018,
57062,
57107,
57152,
57159,
57165,
57173,
57215,
57223,
57272,
57281,
57335,
57342,
57401,
57423,
57479,
57485,
57501,
57570,
57636,
57707,
57724,
57780,
57850,
57887,
57902,
57908,
57950,
57990,
58012,
58045,
58051,
58087,
58124,
58168,
58174,
58207,
58255,
58277,
58310,
58361,
58367,
58404,
58441,
58477,
58483,
58506,
58513,
58519,
58527,
58588,
58643,
58675,
58684,
58739,
58746,
58805,
58861,
58867,
58903,
58941,
58978,
58984,
59019,
59077,
59083,
59119,
59156,
59162,
59204,
59235,
59241,
59264,
59271,
59277,
59341,
59395,
59450,
59515,
59580,
59637,
59705,
59760,
59818,
59873,
59912,
59977,
59989,
59997,
60003,
60064,
60071,
60109,
60149,
60190,
60252,
60273,
60279,
60346,
60370,
60407,
60413,
60460,
60507,
60544,
60574,
60580,
60631,
60719,
60813,
60819,
60848,
60914,
60963,
61021,
61124,
61159,
61204,
61219,
61225,
61231,
61247,
61308,
61360,
61438,
61455,
61512,
61576,
61642,
61711,
61801,
61856,
61879,
61894,
61900,
61945,
61951,
62001,
62089,
62124,
62169,
62184,
62232,
62285,
62318,
62385,
62420,
62465,
62480,
62519,
62575,
62581,
62640,
62663,
62728,
62773,
62788,
62794,
62864,
62934,
62940,
62994,
63050,
63056,
63104,
63164,
63233,
63239,
63267,
63353,
63359,
63399,
63405,
63447,
63487,
63549,
63599,
63622,
63705,
63739,
63786,
63801,
63807,
63848,
63871,
63946,
63990,
64005,
64011,
64054,
64105,
64128,
64203,
64242,
64257,
64263,
64332,
64407,
64413,
64436,
64442,
64460,
64483,
64524,
64550,
64590,
64614,
64660,
64700,
64724,
64756,
64762,
64786,
64793,
64799,
64861,
64868,
64935,
64995,
65001,
65036,
65042,
65081,
65087,
65125,
65131,
65171,
65177,
65218,
65224,
65256,
65262,
65285,
65292,
65298,
65320,
65402,
65409,
65479,
65542,
65548,
65576,
65659,
65712,
65767,
65789,
65838,
65892,
65907,
65913,
65936,
65943,
65949,
66011,
66018,
66088,
66151,
66157,
66185,
66260,
66310,
66366,
66388,
66437,
66490,
66505,
66511,
66534,
66541,
66552,
66587,
66621,
66650,
66656,
66721,
66728,
66765,
66825,
66869,
66893,
66899,
66955,
66987,
67067,
67104,
67119,
67125,
67141,
67191,
67245,
67262,
67314,
67382,
67405,
67483,
67515,
67530,
67536,
67563,
67602,
67635,
67676,
67723,
67772,
67778,
67820,
67864,
67918,
67924,
67984,
68028,
68102,
68133,
68178,
68184,
68233,
68281,
68287,
68356,
68406,
68483,
68540,
68580,
68659,
68708,
68792,
68818,
68867,
68946,
68996,
69011,
69017,
69061,
69084,
69157,
69209,
69224,
69230,
69279,
69302,
69308,
69339,
69372,
69396,
69431,
69451,
69495,
69501,
69525,
69532,
69538,
69604,
69611,
69677,
69738,
69789,
69795,
69836,
69869,
69904,
69968,
69974,
69997,
70004,
70010,
70069,
70111,
70155,
70180,
70225,
70241,
70249,
70255,
70310,
70348,
70388,
70428,
70470,
70495,
70540,
70556,
70564,
70570,
70613,
70620,
70642,
70709,
70732,
70804,
70833,
70840,
70846,
70879,
70885,
70932,
70939,
70998,
71061,
71068,
71074,
71110,
71116,
71122,
71123,
71252
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 71252,
"ccnet_original_nlines": 1939,
"rps_doc_curly_bracket": 0.003929710015654564,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.07616212964057922,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.036417748779058456,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5654381513595581,
"rps_doc_frac_unique_words": 0.5457990169525146,
"rps_doc_mean_word_length": 6.279736518859863,
"rps_doc_num_sentences": 260,
"rps_doc_symbol_to_word_ratio": 0.007353580091148615,
"rps_doc_unigram_entropy": 7.39483118057251,
"rps_doc_word_count": 6070,
"rps_doc_frac_chars_dupe_10grams": 0.007450549863278866,
"rps_doc_frac_chars_dupe_5grams": 0.034393198788166046,
"rps_doc_frac_chars_dupe_6grams": 0.027441099286079407,
"rps_doc_frac_chars_dupe_7grams": 0.016422690823674202,
"rps_doc_frac_chars_dupe_8grams": 0.016422690823674202,
"rps_doc_frac_chars_dupe_9grams": 0.00996903982013464,
"rps_doc_frac_chars_top_2gram": 0.013222100213170052,
"rps_doc_frac_chars_top_3gram": 0.015740590170025826,
"rps_doc_frac_chars_top_4gram": 0.011254530400037766,
"rps_doc_books_importance": -5504.64697265625,
"rps_doc_books_importance_length_correction": -5504.64697265625,
"rps_doc_openwebtext_importance": -3624.801025390625,
"rps_doc_openwebtext_importance_length_correction": -3624.801025390625,
"rps_doc_wikipedia_importance": -2438.615234375,
"rps_doc_wikipedia_importance_length_correction": -2438.615234375
},
"fasttext": {
"dclm": 0.9093151092529297,
"english": 0.27668750286102295,
"fineweb_edu_approx": 3.012218952178955,
"eai_general_math": 0.18859821557998657,
"eai_open_web_math": 0.1891191005706787,
"eai_web_code": 0.45787835121154785
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
5,786,460,334,750,157,000 |
Entries in a hash are often referred to as key-value pairs. Entries with duplicate keys are overwritten with the values from each other_hash successively if no block is given. By using our site, you brightness_4 These built-in enumerates include methods like `map`, `uniq`, `include?`, as well as several others. What we'll cover Now that our server supports Lists, the next data type we will add support for is Hashes. A Hash has certain similarities to an Array, but: An Array index is always an Integer. If you ask for an index that is bigger than the array size you’ll get a nil value. Take this quiz to get offers and scholarships from top bootcamps and online schools! By the way, the Ruby community has come up with the name hash rocket for thebit of syntax =>which separates a key from a value, … we think that … If no block is given, an enumerator is returned instead. And each box can hold one thing or value, which can be retrieved using the key for that … The each_with_index() of enumerable is an inbuilt method in Ruby hashes the items in the enumerable according to the given block. irb :003 > person = { height: '6 ft', weight: '160 lbs' } => {:height=>'6 ft', :weight=>'160 lbs'} It is very similar to an array, but the value of the key (index) is not limited to an integer value; it can be of any object type: a string, a symbol, etc. Là on va arrêter de radoter ! Let’s see an example: Notice that sort will return a new arraywith the results. The reason is that each_with_index yields 2 elements to the block, and you need to deconstruct the first element (a tuple of key and value) explicitly. The simplest approach is to turn each array item into a hash key pointing at an empty value. Parcourir un hachage ne se fait pas du tout de la même manière que parcourir un tableau. The first one makes the new entry point at the old head of the list. En Perl, il y a un moyen facile (et rapide) de faire ceci: my @array = qw( 1 2 3 ); my %hash; @hash{@array} = undef; Cela génère un hachage qui ressemble à: James has written hundreds of programming tutorials, and he frequently contributes to publications like Codecademy, Treehouse, Repl.it, Afrotech, and others. Posted by: admin December 2, 2017 Leave a comment. Ruby | Enumerable each_with_index() function, Ruby | Enumerable collect_concat() function, Data Structures and Algorithms – Self Paced Course, Ad-Free Experience – GeeksforGeeks Premium, We use cookies to ensure you have the best browsing experience on our website. For example: $ ri -T Array Array < Object ----- Includes: Enumerable (from ruby site) (from ruby site) ----- Arrays are ordered, integer-indexed collections of any object. A new array can be created by using the literal constructor[]. Method description: This method is a public instance method that is defined in the ruby library especially for Hash class. Each box has a name, which is the the key. There are many ways to create or initialize an array. This is how it looks: This defines a Hash that contains 3 key/value pairs, meaning that we can lookup three values (the strings "eins", "zwei", and "drei") using threedifferent keys (the strings "one", "two", and "three"). It is similar to an … It looks like this: letters[4] # nil A nil value is Ruby telling you: “I can’t find what you want so here is a generic response” And just like strings, arrays have a set of methods you can use to make them do things. This creates an associative representation of data. A situation where the Ruby Array object’s .collect method works great. Class: Hash (Ruby 2.7.2), Ruby - Hashes - A Hash is a collection of key-value pairs like this: employee = > salary. Using the same general code, fetch and loop through the tweets again. Learn Ruby: Arrays and Hashes Cheatsheet | Codecademy ... Cheatsheet Hash. Eventually, you’ll want to iterate through each item in an array or hash to extract or transform the information in these data structures. A hash is like an array in that it's a variable that stores other variables. At the end of the previous chapter, we used crack to parse a sample XML file of tweets.. Unlike arrays, there are no numerical indexes, you access the hash values with keys. One way to visualize a Hash is as a virtual collection of boxes.
Spray Paint Primer, Castlevania Why Does Death Serve Dracula, Wake Forest Radiology Faculty, Java Regex Online, Tsb News Release, Edd Investigation Division, Zenith Bank Branch Code, Fairleigh Dickinson University Jobs,
|
{
"url": "http://webmediaart.com/f9w08l/1e771e-ruby-hash-index",
"source_domain": "webmediaart.com",
"snapshot_id": "crawl=CC-MAIN-2021-17",
"warc_metadata": {
"Content-Length": "33390",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:B4DYREOOXFNZAISRNRF7TAVUCOLS433K",
"WARC-Concurrent-To": "<urn:uuid:6e8338ac-6cb1-4ad2-a4b0-180402222c7a>",
"WARC-Date": "2021-04-14T20:05:05Z",
"WARC-IP-Address": "93.90.146.107",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UAHSTWWSSNKNSWV3UE7OTNMTIQ3AALGF",
"WARC-Record-ID": "<urn:uuid:65435964-d805-498d-9993-cab5f48ee481>",
"WARC-Target-URI": "http://webmediaart.com/f9w08l/1e771e-ruby-hash-index",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3b4dd8ed-7581-4fb5-8653-80735046c9e2>"
},
"warc_info": "isPartOf: CC-MAIN-2021-17\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-191.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
4254,
4255
],
"line_end_idx": [
4254,
4255,
4474
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4474,
"ccnet_original_nlines": 2,
"rps_doc_curly_bracket": 0.0013410799438133836,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35596707463264465,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009259260259568691,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2191358059644699,
"rps_doc_frac_unique_words": 0.49737533926963806,
"rps_doc_mean_word_length": 4.547244071960449,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0.006172840017825365,
"rps_doc_unigram_entropy": 5.408287048339844,
"rps_doc_word_count": 762,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.009235209785401821,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.010101010091602802,
"rps_doc_frac_chars_top_3gram": 0.006060610059648752,
"rps_doc_frac_chars_top_4gram": 0.006349210161715746,
"rps_doc_books_importance": -436.74761962890625,
"rps_doc_books_importance_length_correction": -436.74761962890625,
"rps_doc_openwebtext_importance": -208.67880249023438,
"rps_doc_openwebtext_importance_length_correction": -208.67880249023438,
"rps_doc_wikipedia_importance": -171.74240112304688,
"rps_doc_wikipedia_importance_length_correction": -171.74240112304688
},
"fasttext": {
"dclm": 0.08367537707090378,
"english": 0.8281872868537903,
"fineweb_edu_approx": 2.5301191806793213,
"eai_general_math": 0.4158797264099121,
"eai_open_web_math": 0.14196628332138062,
"eai_web_code": 0.8840835094451904
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
8,383,244,951,674,212,000 |
3
I have inherited a Novell Netware 6.5 server to manage. We had have some users move folders into other folders that they were not supposed to be able to do. Additionally, there have been cases were it would be nice to view a log of when a user last logged into the directory, if they are currently active, etc. I was curious where logs files are generally located within a Novell Netware 6.5 server exist? Is there anything special needed to access them? How does one enable additional logging in the event that the items that need to be logged now are not being logged?
I know that Netware 6.5 is the older product line; however, that is what I am stuck with for the moment. Thank in advance.
2 Answers 2
3
Moving folders into others is not logged. There are audit tools, but if you enable them, the volume of data generated will astound you. File operations happen far more often than expected and will fill any space you make available.
Easy way is look in the directory for any salvageable files. If the folder is not there, then you know it was moved. Then you have to find it, which is a pain but not that hard.
Last login is stored on the object as lastLogin I think in eDirectory.
Currently active users will have a value in Network Address. Including the source address (many protocols supported there, IP, IPX, DLC/LLC, and AppleTalk so the format is non-trivial, but ConsoleOne parses it properly)
Additional logging depends on what you need. For login/logout on Netware, the gold standard is still AuditLogin by Condrey Consulting and is fairly cheap and easy to use.
For more comprehensive, you can go as high as Sentinel for all sorts of things.
There are three levels of Sentinel, all using the same basic infrastructure. Sentinel is the full product with Correlation that is very powerful and way to hard to explain here.
Sentinel RD (Rapid Deploy) is more of a single server version, and a bit cheaper. Next releases will move to this approach, but making it easier to use a multi tiered setup, which is hard with the RD approach right now. Focused more on a single server instance.
Sentinel Log Manager is meant just to collect events and not do correlation nor a bunch of the fancier things that Sentinel full does.
They come in different event per second (eps) licenses. More expensive the more events you get. You can collect events from all sorts of devices.
Sentinel LM can filter and pass events up to Sentinel (full), to reduce and distribute the load better.
The new reporting in Novell's (NetIQ's now?) Identity Manager uses a sort of packaged Sentinel LM instance to collect events and can forward to other Sentinel systems as well.
1
Boy, it has been a while since I played with NetWare (was 5x MCNE), but I don't recall any such logs being there by default unless you added auditing software, like Novell Identity Audit (NIA), separate from NetWare's base install.
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "https://serverfault.com/questions/276292/novell-netware-6-5-server-logs",
"source_domain": "serverfault.com",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "157219",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XW2GXW5KZJHWS4O7WSGU5B2XX3O4CMBW",
"WARC-Concurrent-To": "<urn:uuid:960c7b08-f9c5-4c4a-9fb2-3824c5b2b89e>",
"WARC-Date": "2023-03-23T04:51:01Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6KOKJZMNJDZU7NCGO23LEB4AJG6HIBTS",
"WARC-Record-ID": "<urn:uuid:e1669a4f-0f17-4c44-a51c-4eb3376985f5>",
"WARC-Target-URI": "https://serverfault.com/questions/276292/novell-netware-6-5-server-logs",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:42408a2c-2744-463d-96b5-31f2d27e1024>"
},
"warc_info": "isPartOf: CC-MAIN-2023-14\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-237\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
3,
574,
575,
698,
699,
711,
712,
714,
715,
947,
948,
1126,
1127,
1198,
1199,
1419,
1420,
1591,
1592,
1672,
1673,
1851,
1852,
2114,
2115,
2250,
2251,
2397,
2398,
2502,
2503,
2679,
2680,
2682,
2683,
2915,
2916,
2928,
2929,
3029,
3030
],
"line_end_idx": [
2,
3,
574,
575,
698,
699,
711,
712,
714,
715,
947,
948,
1126,
1127,
1198,
1199,
1419,
1420,
1591,
1592,
1672,
1673,
1851,
1852,
2114,
2115,
2250,
2251,
2397,
2398,
2502,
2503,
2679,
2680,
2682,
2683,
2915,
2916,
2928,
2929,
3029,
3030,
3120
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3120,
"ccnet_original_nlines": 42,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4494556784629822,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.026438569650053978,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14618973433971405,
"rps_doc_frac_unique_words": 0.5154827237129211,
"rps_doc_mean_word_length": 4.489981651306152,
"rps_doc_num_sentences": 37,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.240632057189941,
"rps_doc_word_count": 549,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.01784989982843399,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.010953349992632866,
"rps_doc_frac_chars_top_3gram": 0.01135903038084507,
"rps_doc_frac_chars_top_4gram": 0.012981739826500416,
"rps_doc_books_importance": -296.0415954589844,
"rps_doc_books_importance_length_correction": -296.0415954589844,
"rps_doc_openwebtext_importance": -149.67344665527344,
"rps_doc_openwebtext_importance_length_correction": -149.67344665527344,
"rps_doc_wikipedia_importance": -95.96712493896484,
"rps_doc_wikipedia_importance_length_correction": -95.96712493896484
},
"fasttext": {
"dclm": 0.4218151569366455,
"english": 0.9652639031410217,
"fineweb_edu_approx": 1.1607571840286255,
"eai_general_math": 0.014850200153887272,
"eai_open_web_math": 0.12768584489822388,
"eai_web_code": 0.0017834899481385946
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-2,056,445,700,545,549,800 |
The tag has no wiki summary.
learn more… | top users | synonyms
4
votes
1answer
78 views
Are epimorphisms (defined via an obvious action) of free Boolean algebras whose set of generators is a group automorphisms?
Let $G$ be a group. Consider $B$, the free Boolean algebra with generating set (I'll call them "variables") $G$. Let $F$ be some formula (that is, some fixed element of $B$). Define an endomorphism ...
16
votes
0answers
403 views
Actions on ℍⁿ generated by torsion elements
Let $n$ be a large integer. I am looking for a cocompact properly discontinuous isometric action on $n$-dimensional Lobachevky space which is generated by elements of finite order. Or equivalently, ...
7
votes
0answers
118 views
A published proof for: the number of labeled $i$-edge ($i \geq 1$) forests on $p^k$ vertices is divisible by $p^k$
Let $F(n;i)$ be the number of labeled $i$-edge forests on $n$ vertices (A138464 on the OEIS). The first few values of $F(n;i) \pmod n$ are listed below: $$\begin{array}{r|rrrrrrrrrrr} & i=0 ...
6
votes
0answers
186 views
blowups and group actions
Let $X$ be a smooth projective variety over the complex numbers and assume that $X$ is equipped with the action of a finite group $G$. Denote by $Z$ the closed subscheme of fixed points of $G$ and ...
5
votes
0answers
126 views
Is the quotient of a scheme by the free action of an elliptic curve an algebraic space?
Let $X$ be a scheme (I'm happy to assume that $X$ is of finite type, separated, and over $\mathbb{C}$) and let $E$ be an elliptic curve which acts freely on $X$. Does the quotient stack $[X/E]$ have ...
5
votes
0answers
184 views
Unitary representations of Tarski Monsters and other beasts
Did people study the unitary representations of Tarsky Monsters, for example the ones constructed by Ol'shanskii? Are there any exotic representations, ie. except the ones related to the left regular, ...
5
votes
0answers
185 views
Is translation by the free group (in two generators) on a certain completion of the group an amenable action?
Let $\mathbb{F}_2 = \langle a,b\rangle$ be the free group in two generators $a,b$ and let $\alpha \in \text{End}(\mathbb{F}_2)$ be given by $\alpha(a) = a^2, \alpha(b)= b^2$. Note that the index ...
5
votes
0answers
255 views
Central extensions of automorphisms of Bruhat-Tits trees
This is the first time I am using Mathoverflow and I am still learning how to use it. That is why I want to begin with a curious question: Does the group of automorphisms of a Bruhat-Tits tree have ...
4
votes
0answers
205 views
Faithful and weakly-mixing representations of Property (T) groups in relation to left regular rep
Is it known that: Any countable Property (T) group (or more generally, a non-amenable group) has a faithful, weakly-mixing representation which is NOT weakly included in its left regular ...
4
votes
0answers
118 views
Fixed sets of orbit spaces
I've run across something that surprises me, so I'm wondering (1) Is it true? and (2) Is it well known? (And if the answers are affirmative, why didn't I know this already?) Let $G$ be a compact Lie ...
4
votes
0answers
224 views
Polynomial dynamical systems
The question is somewhat related to the theory of permutation polynomials. Let $\mathbb{F}_p$ be a finite field of $p$ elements ($p$ is prime) and $\mathcal{V} = \mathbb{F}_p^2 = \{ (t_1,t_2)\::\: ...
4
votes
0answers
142 views
Is the limit set of a group action always closed?
Let $G$ be a discrete group acting on a compact metric space $X$. A point $x\in X$ is called a limit point, if there is a base point $x_0\in X$ and an injective sequence $(x_k)_{k\in\mathbb{N}}$ in ...
3
votes
0answers
112 views
Non-linearly isomorphic non-equivalent $G-$representations?
Let $G$ be an algebraic group (or a group scheme) over a field $\Bbbk$, and let $V$ be an algebraic $G-$representation (I mean, corresponding to a homomorphism of $\Bbbk-$group schemes $G\rightarrow ...
3
votes
0answers
87 views
“Spectral decomposition” action on the unitary group
Consider a matrix $U$ from the unitary group $U_N(\mathbb{C})$ and consider the map $f:U_N(\mathbb{C})\rightarrow U_N(\mathbb{C})$ where $f(U)$ is the matrix of the eigenvectors of $U$. What is ...
3
votes
0answers
121 views
Minimality of time-t minimal flows
This question is mainly motivated by the question Transitivity of a flow and its time-1 map Let $M$ be a closed smooth manifold and $\Phi\colon\mathbb{R}\times M\to M$ be a smooth minimal flow, i.e. ...
3
votes
0answers
506 views
Untwisting the Cohomology with Twisted Coefficients
This question is set on a finite $2$-group $G$ and a subgroup $H$ of index $2$ (but perhaps the question could be answered for arbitrary orders/indexes). It was asked here on MO whether ...
3
votes
0answers
221 views
Finding generalised Lyndon words
Let $\Sigma = \lbrace a_1, \ldots, a_n, A_1, \ldots A_n \rbrace$ (where $A_i = a_i^{-1}$) and $\prec$ be a total ordering on $\Sigma$. Let $\Sigma^*$ be the set of all words (generated by the ...
2
votes
0answers
156 views
Exotic actions of hyperbolic groups
Let $G$ be a hyperbolic group acting faithfully on $\mathbb{Z}$ such that: The action is highly transitive - it is $k$-transitive for each $k \in \mathbb{N}$. For every quasiconvex subgroup $H \leq ...
2
votes
0answers
154 views
A possible generalization of the Borsuk Ulam theorem via action of symmetric groups
The symmetric group $S_{m}$ is equiped with the counting Har measure $\mu$ and the obvious sgn character. Assume that $S_{m}$ acts on $S^{n}$, $n\geq m-1$ and $f:S^{n}\to \mathbb{R}^{n}$ ...
2
votes
0answers
102 views
A topological space extracting from a group action
Let $G$ be a compact abelian topological group with invariant measure $\mu$ which acts on a compact Hausdorff space $X$. A $G$-odd function is a continuous function $f:X\to ...
2
votes
0answers
135 views
Diffeomorphism between open annuli preserving common symmetries
Suppose $A$ and $B$ are subsets of $\mathbb{R}^2$ homeomorphic (and thus $C^\infty$ diffeomorphic) to the open annulus (punctured $\mathbb{B}^2$) and let $G$ be the group of isometries of ${\mathbb ...
2
votes
0answers
78 views
Ergodic actions with co-finite stabilizers
Let $G$ be a locally compact, second countable group acting on a standard probability space $(X,\nu)$, and let $\nu$ be $G$-invariant. Let $G_x = \{g \in G\,:\, gx=x\}$ denote the stabilizer of $x \in ...
2
votes
0answers
208 views
2 questions on Nagata's counterexample; $k[f_1,…,f_r]=k[g_1,…,g_s]$ vs. $k(f_1,…,f_r)=k(g_1,…,g_s)$
Let $\{a_{ij}\}$ for $i=1,2,3$, and $j=1,...,16$ be algebraically independent elements over some prime field. Let $k$ be a field containing all $a_{ij}$. Then consider $k^{16}$ as $k$-vector space and ...
1
vote
0answers
166 views
Rational conjugation of elements of a finite group
Let $G$ be a finite group. Two elements $x$ and $y$ of $G$ are said to be rationally conjugate, written $x \sim_{r} y$, if and only if $\langle x\rangle$ and $\langle y\rangle$ are conjugate subgroups ...
1
vote
0answers
113 views
Non invertibility of certain integral arising from group action
Let a compact topological group $G$ with invariant measure $\mu,$ acts on a simply connected compact topological space $X$ and $\rho$ is a $n$-dimensional unitary representation of $G$. ...
1
vote
0answers
105 views
Actions and representations of profinite groups
Let $p$ be a prime number, and denote by $\mathbb{Z}_p$ the additive profinite group of p-adic integers. Let $G$ be a finitely generated profinite group of order coprime to $p$, and $V = ...
1
vote
0answers
132 views
When a Whitney stratification has no stratum of codimension one?
Let $G$ be a compact Lie group, and $M$ be a smooth $n$-dimensional $G$-manifold which admits an orientation preserving the $G$-action. Then $M$ has a natural Whitney stratification induced by the ...
1
vote
0answers
78 views
Smoothing of a hyperquotient singularity
Let $f$ be a polynomial in $k$ complex variables, and suppose the affine variety $V$ given by $f = 0$ has an isolated singularity at the origin, but is otherwise smooth. Now assume that some cyclic ...
1
vote
0answers
88 views
invariant lines avoiding fixed subvarieties
Could anybody help me with the following question ? Assume we are given: (1) a finite order (linear) automorphism $g$ of the complex projective space $\mathbb{P}^r$, (2) a closed algebraic ...
1
vote
0answers
177 views
Faithful actions of finite groups on topological spaces
Suppose that $G$ is a finite group acting faithfully on a topological space $X$. In the smooth setting, one can deduce that for each $x$ in $M$, the induced map $$G_x \to Diff_x\left(M\right)$$ from ...
1
vote
0answers
467 views
Questions on orbit properties of group action on varieties
Let $F$ be a p-adic field or $\mathbb{R},\mathbb{C}$, $G$ a group(not necessarily reductive) over $F$, $X$ an algebraic variety defined over $F$, and $G$ acts on $X$. Now we have several questions ...
0
votes
0answers
84 views
Adelic integral factorization
In order to calculate Tamagawa numbers, I need to justify that for a nice (say Schwartz-Bruhat) function, the following identity holds : $$\int_{\mathbf{A}^2} f(x)dx = \int_{SL_2(\mathbf{A})/SL_2(K)} ...
0
votes
0answers
54 views
Invariant subsets of a local action
I have also asked this in MSE, but it seems to me that my question wasn't very well received there and I think someone in here will be able to answer it more quickly, hence this post. I don't ...
0
votes
0answers
73 views
Stable analytic manifold under simple action
For an integer $m > 1$, let us define the action $$ f: X_i \to (1+X_i)^{m} - 1 $$ on $C[[X_1,...,X_N]]$, where $C$ is the complex number field. Consider the analytic manifold $V(I)$ defined by the ...
0
votes
0answers
119 views
automorphisms acting trivially on projective spaces
Let $K$ be a field and $\mathbb{P}=\mathbb{P}^n_K$ the projective space of dimension $n$ over $K$. Consider a linear automorphism $g$ of $\mathbb{P}$. Is it true that $g^\ast$ acts trivially on ...
0
votes
0answers
90 views
inertia stratification
Let $X$ be a nice algebraic variety (say smooth, projective) over a field of characteristic 0. Let $G$ be an abelian group acting on $X$. For each subgroup $H$ of $G$, denote by $X^H$ the closed ...
0
votes
0answers
109 views
fixed points and the cycle index
Let $C_n$ be the cyclic group of order $n$ acting on a finite set $X$ and let $Z(C_n, X; p_1,p_2,\dots)$ be the cycle index of the corresponding permutation group. I wonder whether the knowledge of ...
|
{
"url": "http://mathoverflow.net/questions/tagged/group-actions?sort=unanswered&pagesize=15",
"source_domain": "mathoverflow.net",
"snapshot_id": "crawl=CC-MAIN-2015-11",
"warc_metadata": {
"Content-Length": "132814",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NTTPIBIM33B264NBQILYQPYATE6VU4JK",
"WARC-Concurrent-To": "<urn:uuid:f18a5225-30f6-466c-b745-f174d453fded>",
"WARC-Date": "2015-03-05T14:38:48Z",
"WARC-IP-Address": "104.16.29.251",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:5MMD4RIGFVNZPK4C6V6TCW3EAAVHM6TC",
"WARC-Record-ID": "<urn:uuid:40b46b9f-0734-472a-a837-34db1381cd86>",
"WARC-Target-URI": "http://mathoverflow.net/questions/tagged/group-actions?sort=unanswered&pagesize=15",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8097122a-cfbc-4725-985b-6c25b0d77939>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-28-5-156.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-11\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for February 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
29,
30,
65,
66,
68,
74,
82,
91,
92,
216,
217,
419,
422,
428,
437,
447,
448,
492,
493,
695,
697,
703,
712,
722,
723,
838,
839,
1033,
1035,
1041,
1050,
1060,
1061,
1087,
1088,
1289,
1291,
1297,
1306,
1316,
1317,
1405,
1406,
1609,
1611,
1617,
1626,
1636,
1637,
1697,
1698,
1903,
1905,
1911,
1920,
1930,
1931,
2041,
2042,
2241,
2243,
2249,
2258,
2268,
2269,
2326,
2327,
2529,
2531,
2537,
2546,
2556,
2557,
2655,
2656,
2847,
2849,
2855,
2864,
2874,
2875,
2902,
2903,
3106,
3108,
3114,
3123,
3133,
3134,
3163,
3164,
3365,
3367,
3373,
3382,
3392,
3393,
3443,
3444,
3646,
3648,
3654,
3663,
3673,
3674,
3734,
3735,
3938,
3940,
3946,
3955,
3964,
3965,
4018,
4019,
4217,
4219,
4225,
4234,
4244,
4245,
4280,
4281,
4484,
4486,
4492,
4501,
4511,
4512,
4564,
4565,
4755,
4757,
4763,
4772,
4782,
4783,
4816,
4817,
5013,
5015,
5021,
5030,
5040,
5041,
5077,
5078,
5280,
5282,
5288,
5297,
5307,
5308,
5392,
5393,
5584,
5586,
5592,
5601,
5611,
5612,
5663,
5664,
5841,
5843,
5849,
5858,
5868,
5869,
5933,
5934,
6136,
6138,
6144,
6153,
6162,
6163,
6206,
6207,
6412,
6414,
6420,
6429,
6439,
6440,
6540,
6541,
6746,
6748,
6753,
6762,
6772,
6773,
6824,
6825,
7030,
7032,
7037,
7046,
7056,
7057,
7121,
7122,
7312,
7314,
7319,
7328,
7338,
7339,
7387,
7388,
7579,
7581,
7586,
7595,
7605,
7606,
7671,
7672,
7873,
7875,
7880,
7889,
7898,
7899,
7940,
7941,
8143,
8145,
8150,
8159,
8168,
8169,
8213,
8214,
8407,
8409,
8414,
8423,
8433,
8434,
8490,
8491,
8694,
8696,
8701,
8710,
8720,
8721,
8780,
8781,
8982,
8984,
8990,
8999,
9008,
9009,
9039,
9040,
9244,
9246,
9252,
9261,
9270,
9271,
9307,
9308,
9504,
9506,
9512,
9521,
9530,
9531,
9576,
9577,
9778,
9780,
9786,
9795,
9805,
9806,
9858,
9859,
10057,
10059,
10065,
10074,
10083,
10084,
10107,
10108,
10307,
10309,
10315,
10324,
10334,
10335,
10368,
10369
],
"line_end_idx": [
29,
30,
65,
66,
68,
74,
82,
91,
92,
216,
217,
419,
422,
428,
437,
447,
448,
492,
493,
695,
697,
703,
712,
722,
723,
838,
839,
1033,
1035,
1041,
1050,
1060,
1061,
1087,
1088,
1289,
1291,
1297,
1306,
1316,
1317,
1405,
1406,
1609,
1611,
1617,
1626,
1636,
1637,
1697,
1698,
1903,
1905,
1911,
1920,
1930,
1931,
2041,
2042,
2241,
2243,
2249,
2258,
2268,
2269,
2326,
2327,
2529,
2531,
2537,
2546,
2556,
2557,
2655,
2656,
2847,
2849,
2855,
2864,
2874,
2875,
2902,
2903,
3106,
3108,
3114,
3123,
3133,
3134,
3163,
3164,
3365,
3367,
3373,
3382,
3392,
3393,
3443,
3444,
3646,
3648,
3654,
3663,
3673,
3674,
3734,
3735,
3938,
3940,
3946,
3955,
3964,
3965,
4018,
4019,
4217,
4219,
4225,
4234,
4244,
4245,
4280,
4281,
4484,
4486,
4492,
4501,
4511,
4512,
4564,
4565,
4755,
4757,
4763,
4772,
4782,
4783,
4816,
4817,
5013,
5015,
5021,
5030,
5040,
5041,
5077,
5078,
5280,
5282,
5288,
5297,
5307,
5308,
5392,
5393,
5584,
5586,
5592,
5601,
5611,
5612,
5663,
5664,
5841,
5843,
5849,
5858,
5868,
5869,
5933,
5934,
6136,
6138,
6144,
6153,
6162,
6163,
6206,
6207,
6412,
6414,
6420,
6429,
6439,
6440,
6540,
6541,
6746,
6748,
6753,
6762,
6772,
6773,
6824,
6825,
7030,
7032,
7037,
7046,
7056,
7057,
7121,
7122,
7312,
7314,
7319,
7328,
7338,
7339,
7387,
7388,
7579,
7581,
7586,
7595,
7605,
7606,
7671,
7672,
7873,
7875,
7880,
7889,
7898,
7899,
7940,
7941,
8143,
8145,
8150,
8159,
8168,
8169,
8213,
8214,
8407,
8409,
8414,
8423,
8433,
8434,
8490,
8491,
8694,
8696,
8701,
8710,
8720,
8721,
8780,
8781,
8982,
8984,
8990,
8999,
9008,
9009,
9039,
9040,
9244,
9246,
9252,
9261,
9270,
9271,
9307,
9308,
9504,
9506,
9512,
9521,
9530,
9531,
9576,
9577,
9778,
9780,
9786,
9795,
9805,
9806,
9858,
9859,
10057,
10059,
10065,
10074,
10083,
10084,
10107,
10108,
10307,
10309,
10315,
10324,
10334,
10335,
10368,
10369,
10570
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10570,
"ccnet_original_nlines": 299,
"rps_doc_curly_bracket": 0.00851466041058302,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2714003920555115,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06114397943019867,
"rps_doc_frac_lines_end_with_ellipsis": 0.12333332747220993,
"rps_doc_frac_no_alph_words": 0.3155818581581116,
"rps_doc_frac_unique_words": 0.35089820623397827,
"rps_doc_mean_word_length": 4.641916275024414,
"rps_doc_num_sentences": 88,
"rps_doc_symbol_to_word_ratio": 0.017356999218463898,
"rps_doc_unigram_entropy": 5.479287147521973,
"rps_doc_word_count": 1670,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.022187819704413414,
"rps_doc_frac_chars_dupe_6grams": 0.011351910419762135,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.046955619007349014,
"rps_doc_frac_chars_top_3gram": 0.009287930093705654,
"rps_doc_frac_chars_top_4gram": 0.008126930333673954,
"rps_doc_books_importance": -993.1254272460938,
"rps_doc_books_importance_length_correction": -993.1254272460938,
"rps_doc_openwebtext_importance": -677.237548828125,
"rps_doc_openwebtext_importance_length_correction": -677.237548828125,
"rps_doc_wikipedia_importance": -619.2623901367188,
"rps_doc_wikipedia_importance_length_correction": -619.2623901367188
},
"fasttext": {
"dclm": 0.1709141731262207,
"english": 0.8457097411155701,
"fineweb_edu_approx": 1.316282033920288,
"eai_general_math": 0.9776418209075928,
"eai_open_web_math": 0.9160779118537903,
"eai_web_code": 0.025206800550222397
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "514",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Trigonometry and Topology"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "5",
"label": "Evaluate"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
3,576,706,346,243,693,600 |
#1
1. No Profile Picture
Registered User
Devshed Newbie (0 - 499 posts)
Join Date
Apr 2007
Posts
2
Rep Power
0
Which language and what recommended book for game programming
Hi,
I want to write games, i know some programming language like java, c or c++, a little c#, but i have no experience in the field of game programming, so could you give me some suggestion about the language and the corresponding book.
Thank you very much.
2. #2
3. Advanced Programmer
Devshed Newbie (0 - 499 posts)
Join Date
Dec 2004
Location
Malaysia
Posts
450
Rep Power
44
there is too much to recommend. Basically, i recommend anything by Andre Lamothe.
There are many API's which you can use for game programming. I recommend you learn more about gaming before starting.
google, is your friend
"Computer games don't affect kids; I mean if Pac-Man affected us as kids, we'd all be running around in darkened rooms, munching magic pills and listening to repetitive electronic music."
- Kristin Wilson, Nintendo, Inc., 1989.
IMN logo majestic logo threadwatch logo seochat tools logo
|
{
"url": "http://forums.devshed.com/game-development/435065-language-recommended-book-game-programming-last-post.html",
"source_domain": "forums.devshed.com",
"snapshot_id": "crawl=CC-MAIN-2017-47",
"warc_metadata": {
"Content-Length": "42607",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BGU6SVFAXTOGLWLUMU37BEXIVGWQLL6G",
"WARC-Concurrent-To": "<urn:uuid:dd7a0f24-a7c2-4ecd-874a-c02e61d216fa>",
"WARC-Date": "2017-11-23T02:20:00Z",
"WARC-IP-Address": "72.10.193.116",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:STIWJTH2FKZYAROGZK25PI44LXTAHJ7L",
"WARC-Record-ID": "<urn:uuid:4108ee20-a1c4-460a-b340-82067e110a70>",
"WARC-Target-URI": "http://forums.devshed.com/game-development/435065-language-recommended-book-game-programming-last-post.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:36037030-214b-47e5-a5fb-489ca20aa1c7>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-99-209-250.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-47\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for November 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
7,
31,
51,
86,
87,
101,
114,
124,
130,
144,
150,
151,
217,
218,
219,
227,
228,
465,
466,
491,
499,
524,
559,
560,
574,
587,
600,
613,
623,
631,
645,
652,
738,
739,
861,
862,
889,
1081,
1125,
1126
],
"line_end_idx": [
7,
31,
51,
86,
87,
101,
114,
124,
130,
144,
150,
151,
217,
218,
219,
227,
228,
465,
466,
491,
499,
524,
559,
560,
574,
587,
600,
613,
623,
631,
645,
652,
738,
739,
861,
862,
889,
1081,
1125,
1126,
1184
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1184,
"ccnet_original_nlines": 40,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3139013648033142,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022421520203351974,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.246636763215065,
"rps_doc_frac_unique_words": 0.6944444179534912,
"rps_doc_mean_word_length": 4.633333206176758,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0.013452909886837006,
"rps_doc_unigram_entropy": 4.69118070602417,
"rps_doc_word_count": 180,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07194244861602783,
"rps_doc_frac_chars_dupe_6grams": 0.07194244861602783,
"rps_doc_frac_chars_dupe_7grams": 0.07194244861602783,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.05395682901144028,
"rps_doc_frac_chars_top_3gram": 0.03357313945889473,
"rps_doc_frac_chars_top_4gram": 0.04076739028096199,
"rps_doc_books_importance": -99.26765441894531,
"rps_doc_books_importance_length_correction": -99.26765441894531,
"rps_doc_openwebtext_importance": -60.932518005371094,
"rps_doc_openwebtext_importance_length_correction": -60.862213134765625,
"rps_doc_wikipedia_importance": -53.72062683105469,
"rps_doc_wikipedia_importance_length_correction": -53.72062683105469
},
"fasttext": {
"dclm": 0.020211100578308105,
"english": 0.919502317905426,
"fineweb_edu_approx": 1.026009202003479,
"eai_general_math": 0.0005143299931660295,
"eai_open_web_math": 0.046071529388427734,
"eai_web_code": -0.000005960000180493807
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-1,234,617,161,182,068,500 |
1. This site uses cookies. By continuing to use this site, you are agreeing to our use of cookies. Learn More.
PCI Express
Discussion in 'Hardware' started by noelg24, Sep 17, 2004.
1. noelg24
noelg24 Terabyte Poster
3,334
26
139
Probably a dumb question to ask but I take it PCI Express cards can be used in the normal PCI slots of mobos? or have they decided to put a certain PCI slot for these new cards?
Certifications: A+
WIP: my life
2. Phoenix
Honorary Member
Phoenix 53656e696f7220 4d6f64
5,726
175
221
um, they use a completly new interface
and i dont believe they can be used in standard PCI slots
|===| <--- PCI Express Slot
|========== ===| <---- PCI Slot
approxamatly
Certifications: MCSE, MCITP, VCP
WIP: > 0
3. noelg24
noelg24 Terabyte Poster
3,334
26
139
:eek: wow that small? and yet they call it express...I wonder whats so express about the size of that? thanks mate...
Certifications: A+
WIP: my life
4. Fergal1982
Fergal1982 Petabyte Poster
4,196
171
211
the express part comes from the fact that the data transfer rate of PCI express is a whopping 16GB/s compared to the piddly 132MB/s in standard PC PCI bus, and the moderate 2.1GB/s for an 8xAGP bus.
two related questions for you guys though. i know PCI express is affecting graphics cards, but are they still dedicated (ie separate from the main PCI bus), and whats the data transfer like on them?
and the second question (third actually, i know). why arent we using hypertransport instead of PCI express, given that it actually exists, and has a 12.8GB/s transfer rate!
Fergal
Certifications: ITIL Foundation; MCTS: Visual Studio Team Foundation Server 2010, Administration
WIP: None at present
5. Phoenix
Honorary Member
Phoenix 53656e696f7220 4d6f64
5,726
175
221
they still use dedicated sltos really
partly because most mobo makers are making boards with a few PCIe 1x slots, and one PCIe 16x slot
obviously most dedicate the 16x slot for the graphics card
cant answer the other one :)
Certifications: MCSE, MCITP, VCP
WIP: > 0
6. Fergal1982
Fergal1982 Petabyte Poster
4,196
171
211
i spose its a case of keeping a better one in reserve till PCI express is saturated the market. although by that point its of little consequence cause we will most likely have a faster alternative to jump to!
thanks though phoenix. (PCIex16 huh? thats......... 256GB/s transfer rate. bloody hell thats gonna be fast!)
Fergal
Certifications: ITIL Foundation; MCTS: Visual Studio Team Foundation Server 2010, Administration
WIP: None at present
Share This Page
Loading...
|
{
"url": "http://www.certforums.com/threads/pci-express.2703/",
"source_domain": "www.certforums.com",
"snapshot_id": "crawl=CC-MAIN-2016-50",
"warc_metadata": {
"Content-Length": "71082",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3XXPIRK5LY7JAXDDDIAUTS3EFGBY6F33",
"WARC-Concurrent-To": "<urn:uuid:9b5b9144-8940-4a54-adb7-b692d89f4b7d>",
"WARC-Date": "2016-12-04T06:14:05Z",
"WARC-IP-Address": "148.251.137.111",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:TQYRKQO6EORQUEOGQYK2FSAJVODU64ER",
"WARC-Record-ID": "<urn:uuid:8a531681-b393-4f54-92d1-6731c67ab409>",
"WARC-Target-URI": "http://www.certforums.com/threads/pci-express.2703/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2df34736-4f67-4b95-8ae2-9de17b2e9f8d>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-31-129-80.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-50\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for November 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
113,
114,
126,
127,
186,
187,
200,
201,
229,
230,
240,
247,
255,
437,
443,
466,
483,
496,
516,
517,
551,
552,
562,
570,
578,
621,
683,
684,
716,
752,
769,
775,
812,
825,
838,
839,
867,
868,
878,
885,
893,
1015,
1021,
1044,
1061,
1077,
1078,
1109,
1110,
1120,
1128,
1136,
1339,
1340,
1543,
1544,
1721,
1722,
1733,
1739,
1840,
1865,
1878,
1898,
1899,
1933,
1934,
1944,
1952,
1960,
2002,
2104,
2167,
2168,
2201,
2207,
2244,
2257,
2273,
2274,
2305,
2306,
2316,
2324,
2332,
2545,
2546,
2659,
2660,
2671,
2677,
2778,
2803,
2804,
2820,
2821
],
"line_end_idx": [
113,
114,
126,
127,
186,
187,
200,
201,
229,
230,
240,
247,
255,
437,
443,
466,
483,
496,
516,
517,
551,
552,
562,
570,
578,
621,
683,
684,
716,
752,
769,
775,
812,
825,
838,
839,
867,
868,
878,
885,
893,
1015,
1021,
1044,
1061,
1077,
1078,
1109,
1110,
1120,
1128,
1136,
1339,
1340,
1543,
1544,
1721,
1722,
1733,
1739,
1840,
1865,
1878,
1898,
1899,
1933,
1934,
1944,
1952,
1960,
2002,
2104,
2167,
2168,
2201,
2207,
2244,
2257,
2273,
2274,
2305,
2306,
2316,
2324,
2332,
2545,
2546,
2659,
2660,
2671,
2677,
2778,
2803,
2804,
2820,
2821,
2831
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2831,
"ccnet_original_nlines": 96,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3250950574874878,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07414449006319046,
"rps_doc_frac_lines_end_with_ellipsis": 0.020618559792637825,
"rps_doc_frac_no_alph_words": 0.25095057487487793,
"rps_doc_frac_unique_words": 0.5202863812446594,
"rps_doc_mean_word_length": 4.706443786621094,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0.011406839825212955,
"rps_doc_unigram_entropy": 5.10122537612915,
"rps_doc_word_count": 419,
"rps_doc_frac_chars_dupe_10grams": 0.10547666996717453,
"rps_doc_frac_chars_dupe_5grams": 0.30121704936027527,
"rps_doc_frac_chars_dupe_6grams": 0.2768762707710266,
"rps_doc_frac_chars_dupe_7grams": 0.2464503049850464,
"rps_doc_frac_chars_dupe_8grams": 0.16430020332336426,
"rps_doc_frac_chars_dupe_9grams": 0.16430020332336426,
"rps_doc_frac_chars_top_2gram": 0.03549696132540703,
"rps_doc_frac_chars_top_3gram": 0.018255580216646194,
"rps_doc_frac_chars_top_4gram": 0.028397569432854652,
"rps_doc_books_importance": -285.55816650390625,
"rps_doc_books_importance_length_correction": -285.55816650390625,
"rps_doc_openwebtext_importance": -152.52737426757812,
"rps_doc_openwebtext_importance_length_correction": -152.52737426757812,
"rps_doc_wikipedia_importance": -106.095703125,
"rps_doc_wikipedia_importance_length_correction": -106.095703125
},
"fasttext": {
"dclm": 0.2571582794189453,
"english": 0.8687244057655334,
"fineweb_edu_approx": 1.134904146194458,
"eai_general_math": 0.021196480840444565,
"eai_open_web_math": 0.26215189695358276,
"eai_web_code": 0.0009931899840012193
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.17",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-3,526,026,163,364,308,000 |
Nginx做代理路由时，不转发http的header问题
转载请注明， 原文地址：Nginx做代理路由时，不转发http的header问题
目前流行的 token 登录验证，常在 http 的 header 中添加 token 参数。
在部署项目后，发现无法获取到 http 头，拿不到 token 值，而通过ip端口直接访问则可以正确获取，怀疑是 Nginx 代理问题，查找原因后得知。
Nginx 会默认忽略含有 “_” 的 header 参数，而 token 值的参数名恰好含有 “_” 符号，需要手动开启转发。
具体修改：
在 nginx.conf 中，修改 http 内容，添加一行
underscores_in_headers on;
例：
http {
underscores_in_headers on;
server {
listen 80;
}
}
重启 Nginx 后可以正常获取 token
转载请注明：
转载自YuLai's Blog，原文地址：Nginx做代理路由时，不转发http的header问题
发表评论
发表回复
*
沙发空缺中，还不快抢~
|
{
"url": "https://yulaiz.com/nginx-http-no-header/",
"source_domain": "yulaiz.com",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "43332",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JPYMZODUVJGCWJDTBM6L5NO6YBEILBEL",
"WARC-Concurrent-To": "<urn:uuid:141d467f-fc3e-4883-a717-c67a1de253f4>",
"WARC-Date": "2022-09-30T05:48:42Z",
"WARC-IP-Address": "123.207.125.170",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:TG5LHVAKTKU3VB46C6NFFKX7OYC5BA3K",
"WARC-Record-ID": "<urn:uuid:f128bdc3-016c-4ab0-baf9-bde41582eebe>",
"WARC-Target-URI": "https://yulaiz.com/nginx-http-no-header/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0e4ae8f4-b235-475d-b3c5-78811cfd5fb5>"
},
"warc_info": "isPartOf: CC-MAIN-2022-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-230\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
29,
30,
71,
72,
120,
121,
198,
199,
264,
265,
271,
302,
303,
330,
331,
334,
335,
342,
373,
386,
405,
411,
413,
414,
437,
438,
445,
446,
496,
497,
502,
503,
508,
509,
511,
512
],
"line_end_idx": [
29,
30,
71,
72,
120,
121,
198,
199,
264,
265,
271,
302,
303,
330,
331,
334,
335,
342,
373,
386,
405,
411,
413,
414,
437,
438,
445,
446,
496,
497,
502,
503,
508,
509,
511,
512,
523
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 523,
"ccnet_original_nlines": 36,
"rps_doc_curly_bracket": 0.0076481797732412815,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.02678571082651615,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.7142857313156128,
"rps_doc_frac_unique_words": 0.7407407164573669,
"rps_doc_mean_word_length": 7.648148059844971,
"rps_doc_num_sentences": 2,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.5478789806365967,
"rps_doc_word_count": 54,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.033898308873176575,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -54.03915023803711,
"rps_doc_books_importance_length_correction": -65.99552917480469,
"rps_doc_openwebtext_importance": -34.82378005981445,
"rps_doc_openwebtext_importance_length_correction": -46.780155181884766,
"rps_doc_wikipedia_importance": -22.902442932128906,
"rps_doc_wikipedia_importance_length_correction": -34.858821868896484
},
"fasttext": {
"dclm": 0.8979886174201965,
"english": 0.006652379874140024,
"fineweb_edu_approx": 0.9859755635261536,
"eai_general_math": 0.006197989918291569,
"eai_open_web_math": 0.0004139500088058412,
"eai_web_code": 0.8046180605888367
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
5,931,836,487,077,516,000 |
O2 Community
Get help, share tips and chat
Reply
Level 1: Joiner
Posts: 2
Registered: 29-08-2012
Problem to unlock my iPhone 4
Hi,
I tried several time to unlock my iPhone 4 and always get 2 messages back from O2:
"Thank you for your iPhone unlatching request.
I'm sorry, we have not been able to unlatch your iPhone at this time.
The reason given is: Sorry, you have not passed our security checks with
the information that you have provided. Kindly check that you have
provided the correct information.
Thank you,
O2 Customer Service"
OR
"Thank you for your iPhone unlatching request.
I'm sorry, we have not been able to unlatch your iPhone at this time.
The reason given is: An IMEI has not been provided
Thank you,
O2 Customer Service"
BUT these messages are wrong, I provided the exact information and the IMEI number.
Can you tell me what am I doing wrong? It is really annoying !
Thank you.
Posts: 14,084
Topics: 243
Kudos: 1,224
Solutions: 1,061
Registered: 13-08-2008
Re: Problem to unlock my iPhone 4
Are you on contract or payg?
If on contract ring o2 202 for free and explain the issue
If on payg it will cost to ring o2 but again worth doing 4445 25p a call from your mobile.
If you are out of the country that could be an issue but it can be done.
iPhone 6s 64gb on 4g 30gb tariff
iPad Air 2 wifi-4g 64gb refresh
My first mobile was in 1995 a CM-R111 from sony on Cellnet.
Henstridge Rural South Somerset (still 2g only and it is 2016)
Level 1: Joiner
Posts: 2
Registered: 29-08-2012
Re: Problem to unlock my iPhone 4
I am on Pay&Go so I will try the number thank you
Level 1: Joiner
Posts: 2
Registered: 30-08-2012
Re: Problem to unlock my iPhone 4
I am having the same problem, i live in spain and purchased a second hand 3gs, i have a uk o2 sim so didnt think it would be too much hassle but after 3 attempts i keep getting the unable to unlatch as the imei and number arent registered? have i brought a dodgy phone ( it makes and recieves calls etc so im guessing not ) or am i doing something wrong ?
Posts: 44,412
Topics: 387
Solutions: 2,534
Registered: 04-01-2009
Re: Problem to unlock my iPhone 4
[ Edited ]
O2 can't associate the phone with the IMEI because the sim has not been used on the O2-UK network. The phone isn't dodgy, it needs to be used in the UK to register the IMEI before O2/Apple can unlock it.
Level 1: Joiner
Posts: 2
Registered: 30-08-2012
Re: Problem to unlock my iPhone 4
oh ok thanks, for a moment i thought id brought a dodgy phone !
I am flying back to the uk in a few days so i will be using it there anyhow, so that should solve the problem.
Thanks for the info, much appreciated Smiley Happy
Posts: 44,412
Topics: 387
Solutions: 2,534
Registered: 04-01-2009
Re: Problem to unlock my iPhone 4
That's good and saves you a lot of problems. Just make a couple of alls and send a text or so. If it's P&G you obviously need £15 credit on the phone when you fill in the unlock form.
|
{
"url": "http://community.o2.co.uk/t5/Apple-iOS-Devices-iPhone-iPad/Problem-to-unlock-my-iPhone-4/td-p/274718",
"source_domain": "community.o2.co.uk",
"snapshot_id": "crawl=CC-MAIN-2016-22",
"warc_metadata": {
"Content-Length": "166935",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MKYKJK4XZT6VRPJ53SEKFWXO3FDL2IB4",
"WARC-Concurrent-To": "<urn:uuid:600dae1f-3216-477f-92c0-497d7b717fb9>",
"WARC-Date": "2016-05-25T01:15:07Z",
"WARC-IP-Address": "46.19.168.58",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:HLH4UPTGERU4YLT63VPV2BM5MGRZ7XHT",
"WARC-Record-ID": "<urn:uuid:e0214a2b-a4ab-4cd3-883c-5df84598a15f>",
"WARC-Target-URI": "http://community.o2.co.uk/t5/Apple-iOS-Devices-iPhone-iPad/Problem-to-unlock-my-iPhone-4/td-p/274718",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:80edd16b-a334-4c05-891f-9f7019b28d1b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-217-139.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-22\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for May 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
13,
14,
44,
45,
51,
67,
76,
100,
101,
131,
132,
136,
137,
220,
221,
223,
224,
271,
272,
342,
415,
482,
516,
527,
528,
549,
550,
552,
553,
556,
557,
559,
560,
607,
608,
678,
729,
740,
741,
762,
763,
765,
766,
850,
851,
853,
854,
917,
918,
920,
921,
932,
933,
947,
959,
972,
989,
1013,
1014,
1048,
1049,
1078,
1079,
1081,
1082,
1084,
1085,
1143,
1144,
1146,
1147,
1238,
1239,
1241,
1242,
1315,
1316,
1318,
1319,
1352,
1384,
1444,
1507,
1523,
1532,
1556,
1557,
1591,
1592,
1642,
1643,
1659,
1668,
1692,
1693,
1727,
1728,
2088,
2089,
2091,
2092,
2106,
2118,
2135,
2159,
2160,
2194,
2195,
2206,
2207,
2411,
2412,
2428,
2437,
2461,
2462,
2496,
2497,
2561,
2562,
2673,
2674,
2725,
2726,
2740,
2752,
2769,
2793,
2794,
2828,
2829
],
"line_end_idx": [
13,
14,
44,
45,
51,
67,
76,
100,
101,
131,
132,
136,
137,
220,
221,
223,
224,
271,
272,
342,
415,
482,
516,
527,
528,
549,
550,
552,
553,
556,
557,
559,
560,
607,
608,
678,
729,
740,
741,
762,
763,
765,
766,
850,
851,
853,
854,
917,
918,
920,
921,
932,
933,
947,
959,
972,
989,
1013,
1014,
1048,
1049,
1078,
1079,
1081,
1082,
1084,
1085,
1143,
1144,
1146,
1147,
1238,
1239,
1241,
1242,
1315,
1316,
1318,
1319,
1352,
1384,
1444,
1507,
1523,
1532,
1556,
1557,
1591,
1592,
1642,
1643,
1659,
1668,
1692,
1693,
1727,
1728,
2088,
2089,
2091,
2092,
2106,
2118,
2135,
2159,
2160,
2194,
2195,
2206,
2207,
2411,
2412,
2428,
2437,
2461,
2462,
2496,
2497,
2561,
2562,
2673,
2674,
2725,
2726,
2740,
2752,
2769,
2793,
2794,
2828,
2829,
3012
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3012,
"ccnet_original_nlines": 131,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3650568127632141,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03977273032069206,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2613636255264282,
"rps_doc_frac_unique_words": 0.4207650423049927,
"rps_doc_mean_word_length": 4.123861789703369,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.99542760848999,
"rps_doc_word_count": 549,
"rps_doc_frac_chars_dupe_10grams": 0.21819788217544556,
"rps_doc_frac_chars_dupe_5grams": 0.3166961073875427,
"rps_doc_frac_chars_dupe_6grams": 0.28710246086120605,
"rps_doc_frac_chars_dupe_7grams": 0.27650177478790283,
"rps_doc_frac_chars_dupe_8grams": 0.23233215510845184,
"rps_doc_frac_chars_dupe_9grams": 0.23233215510845184,
"rps_doc_frac_chars_top_2gram": 0.02826854959130287,
"rps_doc_frac_chars_top_3gram": 0.035335689783096313,
"rps_doc_frac_chars_top_4gram": 0.05653709918260574,
"rps_doc_books_importance": -274.3172302246094,
"rps_doc_books_importance_length_correction": -274.3172302246094,
"rps_doc_openwebtext_importance": -178.6652069091797,
"rps_doc_openwebtext_importance_length_correction": -178.6652069091797,
"rps_doc_wikipedia_importance": -170.0221405029297,
"rps_doc_wikipedia_importance_length_correction": -170.0221405029297
},
"fasttext": {
"dclm": 0.04919397830963135,
"english": 0.9084106683731079,
"fineweb_edu_approx": 0.7267946004867554,
"eai_general_math": 0.010024430230259895,
"eai_open_web_math": 0.19161707162857056,
"eai_web_code": 0.000020620000213966705
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.68",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "658.85",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
2,519,753,969,023,746,000 |
$500 Gaming PC – Pentium G4560 – Part 2
Hello and welcome to Tech Deals – Part 2 of the $500 Pentium G4560 custom build video series . This is the behind the scenes “Why” VLog my detailed explanation for all the choices and in-depth conversation on 2 cores vs 4 cores alternative options you might consider and my general thoughts on $500 gaming machines . Now if you have not seen Part 1 or you want a short version of this video in the video description below will be the full playlist of this video series , Part 1 is much shorter if you just want a summary of the parts , the prices generally why I chose them , a couple of alternatives and you want me to get to the point more quickly go watch Part 1 .
This is gonna be a long video so sit back grab a cup of coffee or some popcorn or a snack and relax because i’m going to talk for a while but this is meant to be an in-depth video for somebody who really wants to get an idea of my thought process behind various choices and where I see the computer gaming business been in 2017 . After this video is going to be Part 3 – The Build, where I actually put all of these parts together that’s going to be a step-by-step build , you’ll be able to follow along if you want to build it yourself after that is going to be Windows installation , Windows performance review , game performance reviews in many more comparisons this will be a staple throughout 2017 for me for upcoming comparisons to unreleased processors such as the upcoming 4-Core or 8-Thread chips from AMD .
So if you’re still with me awesome welcome ! And if you’re not well then you didn’t hear that anyway side note i’m not going to be putting a lot of words on the screen because this is a long video it would take forever to edit if I did that however if any of you are interested in providing captions either in English or another language , I do have my video setup to accept contributions , you can do so somewhere on the YouTube page below you can submit captions where you can actually type-up what I’m saying is words that will appear as I’m saying it you submit them i can see it all approve it and then i’ll give you credit in the description below for doing so . So if perhaps English is not your first language and you want to help out people in your country i would certainly appreciate it if that’s something that you would like to do . The first thing i want to address is the elephant in the room , 2 Core processor in 2017 .
Now I don’t have an objection to a 2 Core processor in general , if I just needed a computer for basic web browsing , watching videos , editing some documents in Microsoft Office Word , Excel , Powerpoint if I just needed a computer that was just gonna maybe too casual games play League of Legends and Rocket League this cpu is all you need in fact even this graphics card is overkill you don’t have to spend all this money . So if that’s your goal a 2 Core CPU is fine the only issue is if that’s your goal this is fine this computer here is a Dell optiplex minitower that i bought off of ebay for about $130 now I’ve done a video on $250 gaming machines i will link that in the video description below this is a six-year-old computer it is an Intel i5-2400 processor , 4-Cores 4-Threads at GHz .
Now it has a little bit of a turbo speed above that but count on GHz especially if you’re using all four cores . This brand-new 7th generation that’s 2nd so there’s five generations of gap between them 7th generation processor is GHz but it’s 2-Cores 4-Threads so it presents itself as a four core processor to Windows but it’s not there’s actually only two math execution units , you can really only do two things at once what the extra threads do what the hyper-threading does is it allows the processor to accept four instructions from Windows at one time maybe your game , maybe you’re multitasking , it lets Windows send four tasks to the processor and then the processor figures out the best order in which to execute them .
It often can provide a speed bump over a true 2-Core processor , if this was just a 2-Core 2-Thread processor it would be a bit slower hyper-threading is no substitute for real cores the i5 processor in this six-year-old machine has four real instruction units you can actually execute four things at once this can actually only do two things at once .
Do you want to play Battlefield-1 ? Grand Theft Auto 5 ? Do you want to play modern games that really do use four cores ? They will run smoother on this at GHz than they will on this at or at least I believe they will anyway i will test this in the game performance videos i’ll be doing on this not only will i compare it to modern quad-core processors , i will compare it to a six-year-old quad-core processor to answer the question do you buy this and turn it into a budget gaming machine or do you build a new one now this may not be an option where you live maybe you’re not the United States , maybe the prices have gone up for the week you wanted to go look there weren’t too many for sale .
I will say that over the past six months they have been consistently available on ebay in the United States at least that is because the optiplex line from dell is a business machine . These are all coming off these businesses had these least for between three to five years , these were all in offices and they’re coming off of lease and they’re available by the thousands well the leasing companies don’t want them so they saw them to refurbishers who take them , clean them up , make sure they power on and work and they sell them either strip with no hard drive or they put a hard drive and they put some RAM in and they sell them on ebay for between $100 to 150$ depending upon what’s included with a RAM , Drive , etc . Now it is true that this maybe six years old however the reality is Intel processors are only getting a 5% to 10% improvement in instructions per clock cycle per generation , now that adds up overtime in the six generations between 2nd gen and 7th gen , there’s probably a 35% to 40% improvement in instructions per clock cycle this is GHz , that’s and this does more per gigahertz than this does if you’re playing a game that only uses two threads this Pentium G4560 is undeniably faster than this CPU will be .
If you want to play an online MMO such as Star Wars – The Old Republic which I have a lot of experience with it only uses two threads . Star Wars – The Old Republic will be dramatically and noticeably faster on this CPU then it will be on this computer , i can speak from personal experience in that regard I’ve tried playing it on these and it’s not that great of an experience . That being said do you want to play Battlefield-1 and Grand Theft Auto 5 ? they run better on this they really do use four cores and there’s just no substitute for having four real cores it also has more level 3 cache and some other features in it that the Pentium budget CPU’s don’t have . But wait you say you want four real processing cores and a modern architecture I’ve got two options for you . No. 1 – This is a $500 build , the CPU is $65 of that the modern version of the i5-2400 is the i5-7400 it runs at upto GHz just like this chip does and it’s a 7th generation chip exactly as efficient as this but with four real processing cores , $180 .
It’s $115 more than this chip so this $500 build becomes $615 with the i5 that i5 chip will work just fine on this motherboard you don’t have to change it it’ll work great with this graphics card no need to change it worked great with the power supply change nothing , it comes with the intel stock heatsink and fan it’s plenty for a GHz chip so for $115 more or roughly 20% of the price because going from $500 to $615 is roughly I know it’s not exact but roughly 20% more money doubles your core count , it goes you for two cores to four and then you really can run Battlefield-1 , Grand Theft Auto 5 , The Witcher 3 and others well on this machine .
That’s your first choice your second choice is this computer , this is $450 Acer aspire t desktop computer i have previously reviewed this link to that in the video description below , this is an updated version of that computer the one review before was an i5-6400 they now have an i5-7400 by that version it’s faster . So , $450 and you get a complete brand-new under warranty ready-to-run computer 8 gigabytes of ram , 2 terabyte hard-drive , 300W power supply and the i5-7400 and you don’t have to build it it comes with basically everything you see here a little bit less power supply , little bit smaller case but essentially it’s largely the same computer no graphics card , it’s just using the integrated graphics .
Now the integrated graphics on the i5-7400 is the HD 630 and that will run Rocket League , Dota 2, Counter Strike – Global Offensive , League of Legends , Minecraft perfectly but if you want to play Battlefield-1 and Grand Theft Auto 5 you need to add a graphics card . Unfortunately you cannot add this card and it’s not because of the power supply , this is that graphics card this is the RX-470 4 GB ASUS Republic of Gamers STRIX graphics card , it does not physically fit into that machine it’s too long , it’s simply too big , i have multiple RX-470’s i have the MSI Armor , i have an XFX card none of them fit into either of these pre-builds even if you replace the power supply the drive cages are in the way , the cables are in the way , the cases are just too small for this card , I have not yet found a 470 that fits .
Now , price to performance the 470 cannot be beaten for 150$ this is an incredible value for the money however if you want to skip building and you don’t want to go old , i have another option for you and that is this this is the EVGA Geforce GTX 1060 3 GB superclocked card $200 it is $50 more expensive than this card . It’s 10% faster give or take Its 25% more money for 10% more speed from a dollars to performance perspective the 1060 is not as good of a deal as the 470 .However, notice anything ? Yeah, this fits perfectly in both of these machines in addition it runs perfectly both of those machines because I’ve had it in both of these machines if you’ve seen any of my generational comparisons , this is actually the computer that i tested when I did Grand Theft Auto 5 GTX 1060 i5-2400 vs i5-6500 this is the card well actually i think i’m going to use the 6 gigs version but i have both the three in the 6 gigs version this is the machine i used it runs fine in here I did not replace the power supply , i used one of these and this comes with the card , this comes with the EVGA card now it does not come with all 1060’s but it does come with the EVGA cards .
This is a two molex connector to one 6-pin PCI Express power connector this plugs into the top of the card and then plugs into the power supply furthermore not all of the i5-2400’s are going to handle it but i can promise you that the acer aspire t will . The acer aspire t comes with a 300W power supply and it comes with the two molex connectors inside you will need to use this i have actually had this exact card in that exact machine for more than two months . This is actually a spare , inside this right now is another one of these plugs into the two molex’s . I pulled this out to make this video , this was in there an hour ago . It runs perfectly you do not have to replace the power supply in the acer aspire t in order to make a GTX 1060 work it’s plenty that 300W comes with is all you need . Yes , some people will say – “But I want to be sure so I’ll go out and spend $35 on the power supply and put it in there.” You can don’t waste your money , use this I promise you have used it for months and months and months that works just fine my kids game with this thing it really it’s doesn’t pull that much power .
Now , some of the pre-built i5-2400’s come with 260W to 280W power supplies some don’t . I have an HP that came with a 265W power supply but i have a Lenovo computer that came with I think it was a 180W power supply that had to be changed so if you follow my link in the video description below to ebay to take a look at the i5-2400 machines or you follow the link in the video description below to my video on how to make a $250 to $300 gaming computer .
Some of them will need a power supply change and some won’t and some you won’t know until you buy the thing . Now , that’s a $35 power supply and that will fit into almost any minitower pre-built that you buy , not all but most someone ovos and some older compact machines don’t have standard motherboard power connectors and require an adapter cable you can get those off of ebay or amazon for $10 but they do require an adapter . Dell’s and HP’s are generally standard 24-pin ATX power connectors , if you can the Dell optiplex is a wonderful i have had excellent luck with these machines , i own three…four of them now . Now I use most of these from my office but not all these are gaming machines i love them because for general office tasks for $120 , $130 it’s all we really need in order to run office web browsing etc . It’s a great value for the money .
Now this does bring up a worthwhile point $450 let’s say you want a new one . $450 plus $200 for this card is $650 . Now you don’t need anything else , two terabyte drive eight gigs of RAM you can upgrade 16 if you want you know cost you fifty dollars or so but you’re looking at $650 for this combination . You can build this machine for $615 with the i5-7400 and many of you may immediately say wait a minute ! I get a little bit bigger case , i get a more powerful power supply , i get to custom build it and it’s less expensive maybe this graphics card is in fact about 10% slower so you are getting a little bit less graphics performance but it’s minor i would not lose any sleep over that. That computer comes with keyboard , mouse , Wi-Fi , a DVD drive , a legal copy of Windows and it’s built and you don’t have to mess with it this you have to build and my $615 price does not include Windows , Wi-Fi adapter , DVD Drive , keyboard , mouse and you have to build it and provide support if you built this and have a problem with you have no one to complain to , if you order this off of amazon plug it in and turn it on and it doesn’t work amazon have another one on your doorstep in 24 to 48 hours it’s not your problem and no pay return shipping and you don’t have to care .
Now if you don’t live in the United States and these are not options for you , I understand one of the reasons i’m doing this video is because some people either want to build their own machine or they plan to upgrade in the future or they just don’t want one of these and that’s fine I understand that. My personal computer is always going to be a custom-built machine you know i have several these for work and for home two of my kids have these because they’re simple and cheap and they are kids and they don’t care but you know when they get older they’ll custom-build I’m sure but for the money these are very compelling arguments if you aren’t married to building a machine.
If you consider this a chore , go this route if you consider this fun go ahead and build by all means you learn more about your computer you can make it a fun Saturday activity it really doesn’t take that long even if you’ve never built a computer before , two … maybe four hours if you really take your time and look up everything slowly now when i do the build video of this i am going to go slow enough so that you can follow along yourself , some of my build videos have been faster than others have done some very long ones , i’ve done some shorter ones , this one I’m going to do so you can follow along it’ll probably be 45 minutes to an hour long but the goal is you prop up your phone your iPad or put it on your television and you can watch the build while you’re building and follow along go “aww that’s how I put that together”, “that’s what I do okay fair enough.” One final point about playing games and this build specifically.
This is the Pentium G4560 CPU for $65 now if you buy this and you want to play games i highly recommend you add a graphics card now if you want to play more relaxed casual games and you want to save some money you can certainly go with an RX-460 but the price between the 460 and the 470 are relatively close and i do want to make an important point the 470 is in general double the performance of the 460 , not just 50% faster not just a bit it’s double its two 460’s . The RX-460 4GB graphics card is generally going to run you about a $100 this is going to run you $150 so it’s 50% more expensive for 100% more performance that’s a deal, but wait you say you don’t want to play Battlefield-1 you’re going to go ahead and get the Pentium because you don’t want to play all the latest and greatest games you want to maybe be a more casual player let me offer you an alternative delete the graphics card completely and spend a little bit more and get the Pentium G4600 .
It’s $90 so you’re going to spend $25 more on the CPU but you double the integrated graphics performance the Pentium G4560 the CPU right here for $65 has the Intel HD 610 graphics . The G4600 for $25 more has the HD 630 in short the 630 is almost double the performance of the 610 if your buying or if you’re building this because you primarily want to play League of Legends , Dota 2 , Counter Strike – Global Offensive , Rocket League , Minecraft , the HD 630 is all you need, the 610’s a little weak delete the graphics card spend $25 more on your cpu and get double the integrated graphics performance . I will do performance comparisons on the HD 610 vs 630 . I’ll use an i3 CPU to get a 630, because all the i3’s have a 630 in them I will down clock it to match the clock speed now when you do spend the money the extra $25 you also get an extra 100 MHz of clock speed its instead of that is a trivial difference you will never ever notice don’t don’t make the upgrade for the extra 100 MHz do it for the double integrated graphics performance it’s not a factor if you’re going to install a graphics card so if you build this and put a graphics card in don’t waste your money on the 4600 just get the 4560 it’s really all you need unless you want the better integrated graphics .
One point i would like to make about this motherboard , this is a great value for the money for $65 this is a good B250 motherboard but it’s a very basic motherboard if you think in the future you may want to upgrade your CPU to an i5 maybe you’re building this because you’re on a budget right now but you think i’m gonna save my money up in six months or a year i want to buy an i5 and it gives me room to grow fair enough . Maybe you buy this RX-470 because you think I want to crossfire them in the future the downside to the Nvidia Geforce GTX 1060 is you cannot SLI them , you can’t put two you can buy one of this today wait a year and buy another one when they are discounted or buy a used one on ebay a year when people are selling them and upgrading to the latest and greatest and you can put two of these in here and run them in what’s called crossfire . Now it does not double your graphics performance but in some games not all but in some games you can get a seventy to eighty percent boost in your performance by installing a second one of these cards you can’t in this motherboard because it doesn’t have two graphics card slots .
My suggestion would be to spend $25 to $35 more and buy a larger ATX motherboard that has two graphics card slots , a good example of this MSI has a board for $90 and i’ll link this in the alternative sections down below and ASUS has a motherboard for $100 they are B250 boards but they’re larger they have four RAM slots , this has two giving you room to upgrade your RAM and they have two graphics card slots and support crossfire with two of these cards so if you think you might want to upgrade in the future spend $25 to $35 more on your motherboard buy one of these cards because you can add another one in the future using that motherboard you can then upgrade to an i5 if you have the money in the future as well . Please note if you think you’re gonna do this this kicks up another upgrade – power supply . This power supply is absolutely all you need to run what you see here it’s actually plenty for the i5 as well I would not use this power supply if you plan on adding two of these graphics cards it’s not really enough this is $35, i would spend $15 more and by the 600W Bronze from EVGA .
A 500 would actually do the job but for $5 or $10 more i would get the 600 and remove all doubt and concerns because you don’t know what you’ll do in the future if you think you might go with two graphics cards if you’re buying a better motherboard spend five or ten dollars more get the 600W Bronze from EVGA the reason for this is because you’re gonna need a lot more power these cards draw a 150W each 150 plus 150 is 300 , if you upgrade to an i5 and you have a bigger motherboard you want to add more RAM and you want to add more storage you can see where this is going 500 is enough so long as you only ever put RX-470’s in there.
What if the RX-490 or whatever comes out later in the year and you upgrade to it and it’s a 250W card because you’ve got the money and you put an i5 in. Spend $10 more now and you don’t ever have to worry about it power supplies can easily last you 10 years so buying a better one now the case in the power supply can outlast all of this for many many years of upgrades so there’s basically two approaches build it as it sits and leave it as it sits plan on this being all it ever is with maybe the change of this to an i5 or spend $25 to $35 more on the motherboard and $15 more on the power supply so for another $50 you leave yourself room to either add a second one of these or upgrade to a super powerful card and a faster CPU and whatever else you want to put into the system.
So this has been my detailed behind-the-scenes thinking on all of these parts and options the pre-built , the older system from ebay and then what you might do to customize this system i hope this has been helpful for you in thinking about what your various choices are . Like this video if you liked it , share it with your friends if you loved it , remember to subscribe hit that big huge button below this video I would greatly appreciate it . Questions and Comments go in the comments section below and as always check out my video description this will have a lot of links down there a link to my budget deal on ebay for a older i5 based system will be down there a link to my review series on this acer aspire t computer which is a great value for the money . A link to the full video series on this $500 build will be down there and links to amazon , newegg and ebay for everything I’ve discussed on there on here will be down there as well if you found this video helpful and useful to you in any way please go down to the video description and use those i would greatly appreciate it .
Thank you so much for watching ! I will see you in next video .
As found on Youtube
Find More Guides @ Freetoplaymmorpgs.com
|
{
"url": "http://freetoplaymmorpgs.com/pc-gaming/500-gaming-pc-pentium-g4560-part-2",
"source_domain": "freetoplaymmorpgs.com",
"snapshot_id": "crawl=CC-MAIN-2017-13",
"warc_metadata": {
"Content-Length": "222286",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RA36GRSNOOGTS5TYCXI25DYAJCWAKD64",
"WARC-Concurrent-To": "<urn:uuid:18bf098c-2170-40aa-a5cb-7a37daddb0f3>",
"WARC-Date": "2017-03-24T10:10:57Z",
"WARC-IP-Address": "104.18.55.90",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:DISKMGC3GOYR3WCIVZPMJ4DJUUF23WPD",
"WARC-Record-ID": "<urn:uuid:bb2146d7-9016-4ad8-849b-0738be13fc06>",
"WARC-Target-URI": "http://freetoplaymmorpgs.com/pc-gaming/500-gaming-pc-pentium-g4560-part-2",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b1158f30-310d-45f4-808c-e3f86e8a9633>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-233-31-227.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-13\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for March 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
40,
41,
709,
710,
1527,
1528,
2465,
2466,
3265,
3266,
3997,
3998,
4351,
4352,
5050,
5051,
6290,
6291,
7326,
7327,
7980,
7981,
8705,
8706,
9536,
9537,
10711,
10712,
11839,
11840,
12296,
12297,
13160,
13161,
14445,
14446,
15127,
15128,
16071,
16072,
17043,
17044,
18330,
18331,
19478,
19479,
20583,
20584,
21221,
21222,
22005,
22006,
23101,
23102,
23166,
23167,
23187,
23188
],
"line_end_idx": [
40,
41,
709,
710,
1527,
1528,
2465,
2466,
3265,
3266,
3997,
3998,
4351,
4352,
5050,
5051,
6290,
6291,
7326,
7327,
7980,
7981,
8705,
8706,
9536,
9537,
10711,
10712,
11839,
11840,
12296,
12297,
13160,
13161,
14445,
14446,
15127,
15128,
16071,
16072,
17043,
17044,
18330,
18331,
19478,
19479,
20583,
20584,
21221,
21222,
22005,
22006,
23101,
23102,
23166,
23167,
23187,
23188,
23228
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 23228,
"ccnet_original_nlines": 58,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.556721031665802,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02389276959002018,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13189588487148285,
"rps_doc_frac_unique_words": 0.19608725607395172,
"rps_doc_mean_word_length": 4.102540969848633,
"rps_doc_num_sentences": 84,
"rps_doc_symbol_to_word_ratio": 0.0003884999896399677,
"rps_doc_unigram_entropy": 5.6689133644104,
"rps_doc_word_count": 4447,
"rps_doc_frac_chars_dupe_10grams": 0.004713879898190498,
"rps_doc_frac_chars_dupe_5grams": 0.07843674719333649,
"rps_doc_frac_chars_dupe_6grams": 0.03655996173620224,
"rps_doc_frac_chars_dupe_7grams": 0.01852663978934288,
"rps_doc_frac_chars_dupe_8grams": 0.00866037979722023,
"rps_doc_frac_chars_dupe_9grams": 0.004713879898190498,
"rps_doc_frac_chars_top_2gram": 0.008221879601478577,
"rps_doc_frac_chars_top_3gram": 0.007399689871817827,
"rps_doc_frac_chars_top_4gram": 0.004987940192222595,
"rps_doc_books_importance": -2346.9521484375,
"rps_doc_books_importance_length_correction": -2346.9521484375,
"rps_doc_openwebtext_importance": -1275.15576171875,
"rps_doc_openwebtext_importance_length_correction": -1275.15576171875,
"rps_doc_wikipedia_importance": -1119.82666015625,
"rps_doc_wikipedia_importance_length_correction": -1119.82666015625
},
"fasttext": {
"dclm": 0.023056689649820328,
"english": 0.9506752490997314,
"fineweb_edu_approx": 1.0617642402648926,
"eai_general_math": 0.20816171169281006,
"eai_open_web_math": 0.2039462924003601,
"eai_web_code": 0.027357039973139763
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "14",
"label": "Reviews/Critiques"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
1,426,649,157,665,866,200 |
[Aug-2017 Dumps] Download Free 1Z0-416 Study Guide With Updated Exam Questions
Oracle’s PeopleSoft 9.2 Human Resources Certified Implementation Specialist certification as a profession has an incredible evolution over the last few years. Oracle 1Z0-416 PeopleSoft 9.2 Human Resources Essentials exam is the forerunner in validating credentials against. Here are updated Oracle 1Z0-416 exam questions, which will help you to test the quality features of DumpsSchool exam preparation material completely free. You can purchase the full product once you are satisfied with the product.
Version: 6.0
Question: 1
Which default value do the Job Code table and Location table have in common?
A. Salary Plan
B. Work Period
C. Tax Location
D. Standard Hours
E. Establishment ID
Answer: A
Question: 2
Which three statements describe the benefits of using tableset sharing in the PeopleSoft system? (Choose three.)
A. Tableset sharing uses SetID to restrict or grant access to data within a table.
B. Tableset sharing allows organizations to track and report business information.
C. Tableset sharing enables organizations to group rows of data within a control table by using a high-level key called a SetID.
D. Tableset sharing uses Department ID in conjunction with department security tree to restrict or grant access to data within a table.
E. Tableset sharing enables organizations to utilize indexing capabilities on mapped records for faster search results on employee data.
F. Tableset sharing enables organizations to share information instead of entering it multiple times, when large portions of data are the same for various business units.
Answer: A, C, F
Question: 3
On the Job Data Work Location tab for a new hire, Company is a required field.
You can default Company from the _____ table.
A. Location
B. Job Code
C. Position Data
D. Business Unit
E. Holiday Schedule
Answer: C
Question: 4
View the Exhibits.
Your client wants to set up a new department called ABC Headquarter for their newly acquired company ABC. The client shares the department and location information cross all business units. The HR Administrator has checked that the location code ABCHQ showed up under the Location Table Search Result page under SetID “Share”. However, when she tried to attach this location code to the new department she is trying to create, she got the error message.
Which two setups may have caused the error message to be displayed? (Choose two.)
A. The Location SetID may not be valid for this department.
B. The Department may have an earlier Effective Date than the Location.
C. The Location and the Department may not belong to the same Business Unit.
D. The Location may have been inactivated before the Department’s Effective Date.
E. The Location may not be associated with the proper company that the department is attached to.
F. The TableSet Control table may not be set up correctly for the Record_Group Location and the Record_Group Department.
Answer: B, D
Question: 5
Your client is implementing PeopleSoft HRMS system with Payroll Interface. The client is to start configuring Pay Group table.
What table value should exist in the system before configuring Pay Groups?
A. Location
B. Company
C. Salary Plan
D. Salary Step
E. Salary Grade
F. Additional Pay
Answer: B
Question: 6
Which PeopleSoft table do you use to identify a group of employees who share common pay characteristics?
A. Job Code Table
B. Company Table
C. Pay Group Table
D. Salary Plan Table
E. Salary Grade Tables
F. Comp Rate Code Table
Answer: C
Question: 7
You are at your client site working on PeopleSoft HRMS implementation. One of your tasks is to add systemwide defaults in order to save time when a user is entering information in transaction tables. Identify which field is NOT a default option in the Org Default by Permission List component.
A. SetID
B. Country
C. Company
D. To Currency
E. Business Unit
F. Compensation Frequency
Answer: F
Question: 8
Your organization has decided to use a department security tree for Row-Level security in PeopleSoft HRMS system.
You decided to use the XYZ permission list to secure data using the Security by Department Tree component.
Which step do you need to perform to ensure that Row-Level security is enforced?
A. Add the XYZ permission list to User Profile.
B. Add the XYZ permission list to Security Set.
C. Add the XYZ permission list to Tree Manager.
D. Add the XYZ permission list to Configuration Manager.
E. Add the XYZ permission list to a role and then assign that role to a user.
Answer: A
Click Here to Get All Oracle 1Z0-416 Exam Questions:
https://www.dumpsschool.com/1Z0-416-exam-dumps.html
|
{
"url": "http://www.itsecurityexams.com/aug-2017-dumps-download-free-1z0-416-study-guide-with-updated-exam-questions/",
"source_domain": "www.itsecurityexams.com",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "320089",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:W4WU5FPYU7SXNE5EAETJ5PA465M2EB4W",
"WARC-Concurrent-To": "<urn:uuid:501de9ae-935b-45f3-9cb7-94d02b9b2192>",
"WARC-Date": "2021-03-06T14:07:50Z",
"WARC-IP-Address": "104.21.38.155",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:G46GQH4HI65T6GVUNVC3BVB7775DJZBK",
"WARC-Record-ID": "<urn:uuid:b0d2b132-25df-4f09-9170-3f570710382f>",
"WARC-Target-URI": "http://www.itsecurityexams.com/aug-2017-dumps-download-free-1z0-416-study-guide-with-updated-exam-questions/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:05926b16-2f18-459c-b155-5ef227aff9fc>"
},
"warc_info": "isPartOf: CC-MAIN-2021-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-119.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
79,
80,
584,
585,
598,
610,
611,
688,
689,
704,
719,
735,
753,
773,
774,
784,
785,
797,
798,
911,
912,
995,
1078,
1207,
1343,
1480,
1651,
1652,
1668,
1669,
1681,
1682,
1761,
1807,
1808,
1820,
1832,
1849,
1866,
1886,
1887,
1897,
1898,
1910,
1911,
1930,
1931,
2385,
2467,
2468,
2528,
2600,
2677,
2759,
2857,
2978,
2979,
2992,
2993,
3005,
3006,
3133,
3208,
3209,
3221,
3232,
3247,
3262,
3278,
3296,
3297,
3307,
3308,
3320,
3321,
3426,
3427,
3445,
3462,
3481,
3502,
3525,
3549,
3550,
3560,
3561,
3573,
3574,
3868,
3869,
3878,
3889,
3900,
3915,
3932,
3958,
3959,
3969,
3970,
3982,
3983,
4097,
4204,
4285,
4286,
4334,
4382,
4430,
4487,
4565,
4566,
4576,
4577,
4630,
4631
],
"line_end_idx": [
79,
80,
584,
585,
598,
610,
611,
688,
689,
704,
719,
735,
753,
773,
774,
784,
785,
797,
798,
911,
912,
995,
1078,
1207,
1343,
1480,
1651,
1652,
1668,
1669,
1681,
1682,
1761,
1807,
1808,
1820,
1832,
1849,
1866,
1886,
1887,
1897,
1898,
1910,
1911,
1930,
1931,
2385,
2467,
2468,
2528,
2600,
2677,
2759,
2857,
2978,
2979,
2992,
2993,
3005,
3006,
3133,
3208,
3209,
3221,
3232,
3247,
3262,
3278,
3296,
3297,
3307,
3308,
3320,
3321,
3426,
3427,
3445,
3462,
3481,
3502,
3525,
3549,
3550,
3560,
3561,
3573,
3574,
3868,
3869,
3878,
3889,
3900,
3915,
3932,
3958,
3959,
3969,
3970,
3982,
3983,
4097,
4204,
4285,
4286,
4334,
4382,
4430,
4487,
4565,
4566,
4576,
4577,
4630,
4631,
4682
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4682,
"ccnet_original_nlines": 115,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2660152018070221,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08360478281974792,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.174809992313385,
"rps_doc_frac_unique_words": 0.3754940629005432,
"rps_doc_mean_word_length": 4.926218509674072,
"rps_doc_num_sentences": 95,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.101412296295166,
"rps_doc_word_count": 759,
"rps_doc_frac_chars_dupe_10grams": 0.0219310000538826,
"rps_doc_frac_chars_dupe_5grams": 0.09093339741230011,
"rps_doc_frac_chars_dupe_6grams": 0.05536239966750145,
"rps_doc_frac_chars_dupe_7grams": 0.0219310000538826,
"rps_doc_frac_chars_dupe_8grams": 0.0219310000538826,
"rps_doc_frac_chars_dupe_9grams": 0.0219310000538826,
"rps_doc_frac_chars_top_2gram": 0.02808237075805664,
"rps_doc_frac_chars_top_3gram": 0.02567530982196331,
"rps_doc_frac_chars_top_4gram": 0.032094139605760574,
"rps_doc_books_importance": -429.68658447265625,
"rps_doc_books_importance_length_correction": -429.68658447265625,
"rps_doc_openwebtext_importance": -293.0644836425781,
"rps_doc_openwebtext_importance_length_correction": -293.0644836425781,
"rps_doc_wikipedia_importance": -205.9059295654297,
"rps_doc_wikipedia_importance_length_correction": -205.9059295654297
},
"fasttext": {
"dclm": 0.10566788911819458,
"english": 0.868209183216095,
"fineweb_edu_approx": 1.5247657299041748,
"eai_general_math": 0.022991899400949478,
"eai_open_web_math": 0.045206308364868164,
"eai_web_code": 0.0028728200122714043
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.312",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-3,599,445,692,270,829,600 |
Tech content trusted by users in North America and around the world
7,027 Reviews & Articles | 50,104 News Posts
Weekly Giveaway: Win a ZOTAC SONIX PCIe 480GB SSD (Global Entry!)
nVidia Graphics Tweaking Guide
By: Aaron Clegg | Guides | Posted: May 7, 2002 4:00 am
Tweaking Part 1 - The BIOS
Making sure that your card runs as fast as possible starts in the BIOS. There are several relevant settings here that can influence the performance of your video card. Not enabling some options will mean some software tweaks will have no effect!
AGP Mode - Determines the AGP frequency, as a multiplier of 66MHz. 1X is the slowest, 4X is the fastest. Some motherboards will have an "auto" setting, which determines the proper rate from the card in the AGP slot. Others might have an "AGP 4X Mode" enabled/disabled type setting, enabled will set 4X, disabled will set 2X. Older Intel BX and VIA Apollo motherboards will not have the 4X option as the chipsets do not support it. If the setting is there, set it to the highest setting available, which for most people is 4X.
AGP Fast writes - Determines whether the video card memory will be allowed to be written to directly, instead of going through the system memory. This setting should decrease the time it takes to transfer data to the video card for processing, as it bypasses the memory controller. Enabling it will increase performance, but quite possibly at the expense of system stability. Some motherboards will not have this option, but generally those with overclocking features have it present.
AGP Sideband Addressing - Allows the AGP card to use system memory for texture storage, a feature made famous by Intel's i740/i810. Not really relevant with today's 64Mb and 128Mb cards, due to the additional latencies generated by using the system memory instead of graphics card memory. Often this setting is not available on newer motherboards; if it is there I would suggest disabling it.
AGP Aperture - Should always be equal to or higher than the amount of memory on your video card. A general rule should be to set it at double the graphics card memory.
PRICING: You can find products similar to this one for sale below.
United States: Find other tech and computer products like this over at Amazon's website.
United Kingdom: Find other tech and computer products like this over at Amazon UK's website.
Canada: Find other tech and computer products like this over at Amazon Canada's website.
We at TweakTown openly invite the companies who provide us with review samples / who are mentioned or discussed to express their opinion of our content. If any company representative wishes to respond, we will publish the response here.
Got an opinion on this content? Post a comment below!
loading
|
{
"url": "http://www.tweaktown.com/guides/249/nvidia_graphics_tweaking_guide/index2.html",
"source_domain": "www.tweaktown.com",
"snapshot_id": "crawl=CC-MAIN-2016-18",
"warc_metadata": {
"Content-Length": "85888",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:H66OGXHLL5THLXWXJMG7I2R3JJT3LBZ5",
"WARC-Concurrent-To": "<urn:uuid:ec1703dd-9a9c-4e50-a525-f9b115bc0a70>",
"WARC-Date": "2016-05-02T23:28:09Z",
"WARC-IP-Address": "23.235.46.204",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:BL7YBYQOVOQOY3ZY3FAEIKIX7SHF5ZX5",
"WARC-Record-ID": "<urn:uuid:0bbceabf-d5b3-4ffa-9db7-002b056dcc41>",
"WARC-Target-URI": "http://www.tweaktown.com/guides/249/nvidia_graphics_tweaking_guide/index2.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c40186f2-62fa-4fd5-b61c-93acde13a3fc>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-239-7-51.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-18\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
68,
113,
179,
180,
211,
212,
267,
268,
295,
296,
298,
299,
545,
546,
548,
549,
1075,
1076,
1078,
1079,
1564,
1565,
1567,
1568,
1961,
1962,
1964,
1965,
2133,
2134,
2136,
2137,
2208,
2209,
2210,
2303,
2304,
2401,
2402,
2495,
2496,
2497,
2498,
2739,
2793
],
"line_end_idx": [
68,
113,
179,
180,
211,
212,
267,
268,
295,
296,
298,
299,
545,
546,
548,
549,
1075,
1076,
1078,
1079,
1564,
1565,
1567,
1568,
1961,
1962,
1964,
1965,
2133,
2134,
2136,
2137,
2208,
2209,
2210,
2303,
2304,
2401,
2402,
2495,
2496,
2497,
2498,
2739,
2793,
2800
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2800,
"ccnet_original_nlines": 45,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37545788288116455,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.049450550228357315,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1538461446762085,
"rps_doc_frac_unique_words": 0.5249457955360413,
"rps_doc_mean_word_length": 4.7722344398498535,
"rps_doc_num_sentences": 28,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.093983173370361,
"rps_doc_word_count": 461,
"rps_doc_frac_chars_dupe_10grams": 0.06818182021379471,
"rps_doc_frac_chars_dupe_5grams": 0.06818182021379471,
"rps_doc_frac_chars_dupe_6grams": 0.06818182021379471,
"rps_doc_frac_chars_dupe_7grams": 0.06818182021379471,
"rps_doc_frac_chars_dupe_8grams": 0.06818182021379471,
"rps_doc_frac_chars_dupe_9grams": 0.06818182021379471,
"rps_doc_frac_chars_top_2gram": 0.016363639384508133,
"rps_doc_frac_chars_top_3gram": 0.01772727072238922,
"rps_doc_frac_chars_top_4gram": 0.02181817963719368,
"rps_doc_books_importance": -321.1426696777344,
"rps_doc_books_importance_length_correction": -321.1426696777344,
"rps_doc_openwebtext_importance": -164.74855041503906,
"rps_doc_openwebtext_importance_length_correction": -164.74855041503906,
"rps_doc_wikipedia_importance": -143.21156311035156,
"rps_doc_wikipedia_importance_length_correction": -143.21156311035156
},
"fasttext": {
"dclm": 0.043833669275045395,
"english": 0.9255791306495667,
"fineweb_edu_approx": 1.5509744882583618,
"eai_general_math": 0.01642804965376854,
"eai_open_web_math": 0.15988564491271973,
"eai_web_code": 0.006308199837803841
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.17",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-3,736,233,549,117,447,700 |
Skip Navigation
What are firmware updates?
...and why do I need them?
Robert Ferency-Viars is the managing editor for the Crutchfield car A/V learning content, and has been with the company since 1999. A Virginia native from the heart of the Blue Ridge Mountains, he loves spending time with his wonderful wife and sons, listening to music, writing, and playing games with friends. Robert's love for car audio began at 16 when he installed his first car stereo.
More from Robert Ferency-Viars
Firmware plays an important role in many of our electronics these days. But what exactly is it, and why is it so important?
nav receiver
What is firmware?
"Firmware," generally speaking, refers to the programs that help a device do what it's supposed to do; it's the background programming that runs the machine. That's in contrast with the "software" that we use to do stuff on the machine: games and programs on a computer, music files on an MP3 player, and the discs we watch on our Blu-ray disc™ players. This is a simplified definition and comparison, but it's reasonable enough for the purposes of this article.
Why does firmware need to be updated?
Most of the gear we use today is as much a computer as it is an audio or video device. As such, sometimes the manufacturer makes improvements to the programs that run the device (firmware). These improvements are released as firmware updates. We can expect to see firmware updates for everything from our Blu-ray players and video game consoles to our car stereos.
Xbox 360
The old Xbox 360 gained lots of new features after a firmware update.
The same thing goes for software updates, and we're all probably more familiar with those. Our computers constantly check for updates for the programs we run: new versions of video players or iTunes®, for example.
To simplify the issue: whether an update is for a device's firmware or software doesn't really matter. They both work the same way. The point is that sometimes updates are released and we need to apply them to our gear.
Where do the updates come from?
These updates tend to come from one of two places:
• Manufacturers — Firmware updates usually come from the manufacturer of the item.
• Software providers — Sometimes other companies might release updates for the software that an item is using, such as when Adobe® releases an update for its Flash player, which many of us use for watching Internet videos.
Kenwood DNX890HD
Navigation receivers are a good example of the type of gear that may require firmware updates.
Car stereo navigation receivers present a good example for how updates could come from multiple sources. Potential updates could take any of these forms:
• Firmware updates for the functionality of the stereo would come from the manufacturer.
• Navigation software updates could add features or improvie performance (firmware).
• Occasional map updates keep the directions as accurate as possible (software).
How do I apply the update?
Updating the gear like an MP3 player or camera is easy when you can connect it to your computer. If your television, Blu-ray player, or game console are connected to the Internet, then updating them can be this easy too. It'll depend on the specific equipment, of course.
For other gear, you will typically download the firmware update to your computer and then transfer it to your device via thumb drive or SD card. Simply load the update via the USB or SD card input, and it should take care of itself from there. Read the manufacturer's website for the specifics of your equipment.
A caution about applying updates
Before applying an update, especially in the case of firmware, you need to make sure that the update is for your exact model of device. Applying an update intended for a similar-but-different model could result in your gear becoming non-operational. The old firmware gets overwritten (replaced) by new operating instructions that aren't compatible with your model, which means your device won't work anymore. That's referred to as "bricking" your gear.
So always double check those model numbers before applying a firmware update.
How do I find out about updates?
There are three things you can do to stay abreast of firmware updates.
• The best way to make sure you're alerted to important updates for your device is to register your purchase with the manufacturer. Fill out the registration card that comes with it or register it online at the manufacturer's website. That way, the manufacturer knows you own one of their devices and can alert you if a really important update comes along.
• The other way to keep on top of updates is to occasionally visit the manufacturer's website and look up your equipment model or a list of released firmware updates. This might be the only way to learn about updates for minor issues.
• If you really like your gear, join a message board or social media feed dedicated to that brand or device. Hanging out with other users is sure to keep you informed about any changes.
Here's a good example. By navigating to the support section at Kenwood, I discovered messages about firmware updates for iPod® and Bluetooth® compatibility with several of their receivers.
When in doubt...
Whether your favorite gadget is your iPod, your Blu-ray player, your car stereo, or your laptop, firmware updates are important for keeping it running smoothly. Just take care and don't apply any updates not meant for your specific model. Whenever in doubt, turn to the manufacturer for confirmation. And if you purchased the item from Crutchfield, our tech support crew can help you out too.
• jana
Posted on 6/10/2015 4:07:43 PM
when i just plugged my g pad 7.0 into a different charger it just start to start the firmware update and its been 7 hours and its still on 0% whats taking so long help me
• Alexander Hrabe from Crutchfield
Posted on 6/10/2015 5:17:51 PM
Jana, sounds like it's worth restarting the device. It could also be a problem with your wireless connection. If that doesn't resolve the problem, give LG a call. It may be a problem with their latest update. Good luck!
• Deborah from Spartanburg
Posted on 7/16/2015 11:32:53 PM
My firmware starter on my tablet over 8 hours and it still at 0%. I can't even power my tablet off. What should i do?
• Alexander Hrabe from Crutchfield
Posted on 7/17/2015 1:40:44 PM
Deborah, if you can't power off the tablet, you'll have to wait until the battery drains and it shuts itself down. Once you recharge the device, power it on and try the update again, but be sure you have a wired or strong wi-fi connection to the internet. If you have any other trouble, contact the manufacturer.
• ola from makati city
Posted on 6/4/2016 3:30:04 PM
i dont want firmware update my tablet its take too long... what to do? its just suddenly start the firmware update.
• Alexander Hrabe from Crutchfield
Posted on 6/6/2016 9:45:25 AM
Ola, if your tablet has the ability to not auto-update, you'd probably find that functionality in the Settings app. Give the manufacturer a call or consult the manual if you have any trouble.
• Frank from mill spring nc
Posted on 8/12/2016 3:21:12 PM
Hi I have a Ford 2016 F150 with the sync 3 system want to add navigation from the factory the only way to do this is to go to an Outsource company and pay them $1,700 to do this Ford will have nothing to do with it and don't want anything to do with it is there any reason I should not do this
• Alexander Hrabe from Crutchfield
Posted on 8/15/2016 11:09:30 AM
Frank, if you want to retain SYNC and add navigation at a comparatively small cost, you might want to consider adding a portable navigation device. Otherwise, if you add an aftermarket navigation receiver, you will lose SYNC. We can't offer any information regarding the installation of a factory navigation unit, but give us a call to discuss your priorities for an upgrade. An advisor will be able to help with some solutions.
• Cory G. from indianapolis
Posted on 9/9/2016 9:09:59 PM
How do I know if the firmware is right for my model? In the update notes?
• Alexander Hrabe from Crutchfield
Posted on 9/12/2016 2:16:07 PM
Cory, you'll get the quickest answer by contacting the manufacturer's customer support (typically found in your user manual) or by checking their website.
• Angie from Wellston
Posted on 9/19/2016 12:39:53 PM
I had a request for a firmware update from Dell, which is what my laptop is. I accepted and apparently it wasn't a match but I did not know about all that. Now I don't have a boot manager. I have to take a very long way around just to log on. What can I do, how can I reverse this? Thank you.
• Alexander Hrabe from Crutchfield
Posted on 9/19/2016 1:58:46 PM
Angie, you'll want to contact Dell for help.
Ask an expert advisor
No pressure, no commission — just lots of good advice from our highly trained staff.
Find what fits your vehicle
Can't find your exact vehicle?
|
{
"url": "http://www.crutchfield.com/ISEO-rccbcspd/learn/learningcenter/car/car_stereo/firmware_updates.html?g=266150&c=7",
"source_domain": "www.crutchfield.com",
"snapshot_id": "crawl=CC-MAIN-2016-44",
"warc_metadata": {
"Content-Length": "293446",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VVXPVNWWFZLCHTKGNZB724PWZKXIO4YD",
"WARC-Concurrent-To": "<urn:uuid:878ee09b-bbd0-46ab-9ef5-50779354b218>",
"WARC-Date": "2016-10-21T08:56:43Z",
"WARC-IP-Address": "205.196.12.74",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:QHMZDLSCOWM7FIUQKX2T6JE7CQVNO4XB",
"WARC-Record-ID": "<urn:uuid:2b6e484c-6f3c-4a5d-a994-43255523578b>",
"WARC-Target-URI": "http://www.crutchfield.com/ISEO-rccbcspd/learn/learningcenter/car/car_stereo/firmware_updates.html?g=266150&c=7",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:aabd646c-1023-446b-95c8-b39d51232eec>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-6-4.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-44\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for October 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
16,
17,
44,
45,
72,
73,
465,
466,
497,
498,
622,
623,
636,
637,
655,
656,
1119,
1120,
1158,
1159,
1524,
1525,
1534,
1535,
1605,
1606,
1820,
1821,
2041,
2042,
2074,
2075,
2126,
2127,
2212,
2437,
2454,
2455,
2550,
2551,
2705,
2706,
2797,
2884,
2967,
2968,
2995,
2996,
3268,
3269,
3582,
3583,
3616,
3617,
4070,
4071,
4149,
4150,
4183,
4184,
4255,
4256,
4615,
4852,
5040,
5041,
5230,
5231,
5248,
5249,
5642,
5643,
5652,
5653,
5688,
5689,
5864,
5865,
5902,
5903,
5938,
5939,
6163,
6164,
6193,
6194,
6230,
6231,
6353,
6354,
6391,
6392,
6427,
6428,
6745,
6746,
6771,
6772,
6806,
6807,
6927,
6928,
6965,
6966,
7000,
7001,
7197,
7198,
7228,
7229,
7264,
7265,
7563,
7564,
7601,
7602,
7638,
7639,
8072,
8073,
8103,
8104,
8138,
8139,
8217,
8218,
8255,
8256,
8291,
8292,
8451,
8452,
8476,
8477,
8513,
8514,
8811,
8812,
8849,
8850,
8885,
8886,
8935,
8936,
8958,
8959,
9044,
9045,
9073,
9074
],
"line_end_idx": [
16,
17,
44,
45,
72,
73,
465,
466,
497,
498,
622,
623,
636,
637,
655,
656,
1119,
1120,
1158,
1159,
1524,
1525,
1534,
1535,
1605,
1606,
1820,
1821,
2041,
2042,
2074,
2075,
2126,
2127,
2212,
2437,
2454,
2455,
2550,
2551,
2705,
2706,
2797,
2884,
2967,
2968,
2995,
2996,
3268,
3269,
3582,
3583,
3616,
3617,
4070,
4071,
4149,
4150,
4183,
4184,
4255,
4256,
4615,
4852,
5040,
5041,
5230,
5231,
5248,
5249,
5642,
5643,
5652,
5653,
5688,
5689,
5864,
5865,
5902,
5903,
5938,
5939,
6163,
6164,
6193,
6194,
6230,
6231,
6353,
6354,
6391,
6392,
6427,
6428,
6745,
6746,
6771,
6772,
6806,
6807,
6927,
6928,
6965,
6966,
7000,
7001,
7197,
7198,
7228,
7229,
7264,
7265,
7563,
7564,
7601,
7602,
7638,
7639,
8072,
8073,
8103,
8104,
8138,
8139,
8217,
8218,
8255,
8256,
8291,
8292,
8451,
8452,
8476,
8477,
8513,
8514,
8811,
8812,
8849,
8850,
8885,
8886,
8935,
8936,
8958,
8959,
9044,
9045,
9073,
9074,
9104
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9104,
"ccnet_original_nlines": 150,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4242265224456787,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022024119272828102,
"rps_doc_frac_lines_end_with_ellipsis": 0.006622519809752703,
"rps_doc_frac_no_alph_words": 0.1950707882642746,
"rps_doc_frac_unique_words": 0.3541935384273529,
"rps_doc_mean_word_length": 4.5658063888549805,
"rps_doc_num_sentences": 92,
"rps_doc_symbol_to_word_ratio": 0.0015731500461697578,
"rps_doc_unigram_entropy": 5.54863166809082,
"rps_doc_word_count": 1550,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03221704065799713,
"rps_doc_frac_chars_dupe_6grams": 0.03221704065799713,
"rps_doc_frac_chars_dupe_7grams": 0.03221704065799713,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.013565069995820522,
"rps_doc_frac_chars_top_3gram": 0.012717249803245068,
"rps_doc_frac_chars_top_4gram": 0.016108520328998566,
"rps_doc_books_importance": -746.5258178710938,
"rps_doc_books_importance_length_correction": -746.5258178710938,
"rps_doc_openwebtext_importance": -400.7025451660156,
"rps_doc_openwebtext_importance_length_correction": -400.7025451660156,
"rps_doc_wikipedia_importance": -320.838623046875,
"rps_doc_wikipedia_importance_length_correction": -320.838623046875
},
"fasttext": {
"dclm": 0.018212080001831055,
"english": 0.9411739110946655,
"fineweb_edu_approx": 1.2725796699523926,
"eai_general_math": 0.026187419891357422,
"eai_open_web_math": 0.06131834164261818,
"eai_web_code": 0.005003809928894043
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
-216,497,953,535,177,660 |
Criando documento de Texto no com Macros e
Click here to load reader
• date post
31-Dec-2016
• Category
Documents
• view
223
• download
4
Embed Size (px)
Transcript of Criando documento de Texto no com Macros e
• Criando documentos de texto no BrOffice com macros e formulrios
Introduo
Como forma de compartilhar a experincia acumulada no processo de criao de formulrios e macros do BrOffice.org, para confeco de documentos de comunicao administrativa escrita utilizados pela CAIXA ECONMICA FEDERAL, elaboramos esta cartilha tcnica, que descreve cada etapa do processo de desenvolvimento.
O presente documento destinado a pessoas e organizaes interessadas em utilizar o BrOffice, para criao de documentos padronizados e direcionado a usurios e desenvolvedores com conhecimento bsico na formatao de documentos com editor de textos e na linguagem BASIC.
As etapas do desenvolvimento compreendem:
- A preparao do modelo, que consiste na confeco de um arquivo de texto que vai servir de base para criar um novo documento;
- A criao do formulrio e macro, que consiste em escrever a macro que vai interagir com o usurio;
- E por fim, o empacotamento e instalao.
Como resultado teremos um suplemento do BrOffice que pode ser distribudo e instalado em outras mquinas.
A seguir, detalhamos cada uma destas etapas.
2
• Sumrio
Introduo........................................................................................................................... 2
O modelo............................................................................................................................. 4
Estilos de pgina........................................................................................................................... 5
Estilos de pargrafo.......................................................................................................................6
Estilos de lista................................................................................................................................7
Inserindo os favoritos.....................................................................................................................8
A macro............................................................................................................................. 12
Desenhando o formulrio............................................................................................................ 13
Escrevendo a macro....................................................................................................................16
O Suplemento................................................................................................................... 23
Criando o suplemento..................................................................................................................23
Instalando o suplemento..............................................................................................................29
Leitura complementar...................................................................................................... 31
Developer's Guide....................................................................................................................... 31
Como distribuir suas macros com um addon.............................................................................. 31
http://www.broffice.org.br/macroshttp://openoffice.org.br/files/addons1_1_pt_br.zip
Ferramenta Xray..........................................................................................................................31
• Criando documentos de texto no BrOffice com macros e formulrios
O modeloO modelo um documento de texto que usado como base para se criar os novos documentos.
Preparar o modelo consiste em formatar as margens, cabealhos, rodaps, fontes, pargrafos e os favoritos (ou bookmarks).
Para criarmos o modelo, iniciamos o Writer com um novo documento em branco. O prximo passo efetuar a formatao do documento. Para tanto utilizaremos o recurso de estilos do Writer.
Os estilos so manipulados pelo painel Estilos e formatao. O Writer divide os estilos em categorias. Estilos de pargrafo, estilos de caractere, estilos de quadro, estilos de pgina, e estilos de lista. (figura 2).
O acesso ao painel feito pelo menu Formato, opo Estilos e formatao, ou pela tecla de atalho F11. (figura 1)
Figura 1: Menu de acesso ao painel Estilos e formatao
4
• Figura 2: Painel Estilos e formatao
Estilos de pgina
Figura 3: Dilogos de formatao de estilos de pgina
• Criando documentos de texto no BrOffice com macros e formulrios
O estilo de pgina controla, entre outras coisas, margens, tamanho do papel, cabealhos e rodaps.
Cada novo documento possui naturalmente um estilo de pgina associado, nomeado de padro.
Em alguns documentos a primeira pgina possui caractersticas diferentes das demais. Para essa formatao, preciso aplicar um estilo diferente na primeira pgina.
No painel Estilos e formatao escolha a opo estilos de pgina, e efetue um duplo-clique sobre o estilo existente Primeira pgina. Isso ir aplicar o estilo na pgina atual do documento, ou seja, a pgina 1. Como dito antes, o estilo inicial o estilo padro.
O prximo passo ajustar o estilo para refletir o formato do documento. No painel, clique sobre o nome do estilo (boto direito) e selecione modificar. No dilogo estilo de pgina (figura 3) ajuste o tamanho do papel, as margens, e se necessrio, o cabealho e rodap.
Observe na aba organizador que no campo prximo estilo o valor "padro". Isto significa que o estilo padro ser aplicado s pginas subseqentes do documento, quando o documento tiver mais de uma pgina.
necessrio, portanto, formatar tambm o estilo padro repetindo os passos anteriores. Verifique que isso s se justifica quando a primeira pgina possui alguma formatao diferente das demais.
Se o documento a ser criado possuir um formato nico em todas as pginas, basta ajustar o estilo padro.
Prxima etapa, formatar os estilos de pargrafo.
Estilos de pargrafo
Figura 4: Dilogos de formatao de estilos de pargrafo
6
• Finalizados os estilos de pgina, devemos formatar os estilos de pargrafo. Essa formatao inclui principalmente a definio da fonte, do alinhamento do texto, do espaamento entre pargrafos.
Crie ou modifique tantos estilos quantos forem necessrios, de acordo com a complexidade do seu documento.
No painel Estilos e formatao clique no cone Estilos de pargrafo. Com um clique direito sobre um estilo escolha Novo... ou Modificar..., para modificar um estilo ou criar um novo. No dilogo Estilo de pargrafo (figura 4), faa os ajustes necessrios.
Estilos normalmente necessrios em um documento formatam os tpicos, assinaturas, vocativos, endereos, cabealhos e rodaps.
Esta etapa compreende apenas a criao dos estilos. A aplicao dos mesmos se dar posteriormente.
A prxima etapa formatar os estilos de lista.
Estilos de lista
Os estilos de lista so usados para formatar as listas numeradas ou de marcadores. Por exemplo, se o documento possuir tpicos numerados, aqui que definimos o estilo de numerao. O procedimento idntico a formatao dos estilos de pgina e de pargrafo.
Aqui configuramos o estilo dos nmeros, espaamento do texto, subnveis, entre outros.
Ao fim do processo, precisamos associar o estilo de numerao a um estilo de pargrafo.
Uma hiptese termos criado um estilo de pargrafo chamado tpicos, para formatar os tpicos do documento. E criamos um estilo de lista chamado numerao de tpicos para formatar a numerao. Para associarmos os dois estilos, vamos ao dilogo estilos de pargrafo (figura 4), para modificar o estilo tpicos e na aba Numerao selecionamos o estilo recm criado.
Feito isto, quando for ativada a numerao em um pargrafo de estilo tpicos, a numerao ir seguir a formatao do estilo numerao de tpicos.
Alm destes, temos tambm os estilos de caractere e de quadro, que no sero abordados nesta cartilha.
O passo seguinte preparar o documento, aplicando os estilos aos pargrafos e inserindo os favoritos.
Inserindo os favoritos
Depois de formatar os estilos, passamos a etapa de aplicar os estilos ao documento, e inserir os favoritos.
Os favoritos, tambm chamados de bookmarks, so marcas em pontos diversos do documento que utilizaremos para insero de texto atravs da macro. Os bookmarks devem ser
• Criando documentos de texto no BrOffice com macros e formulrios
estrategicamente posicionados de acordo com o documento que ser criado.
Considerando um documento simples de exemplo como o da figura 5, teramos o seguinte cenrio:
Figura 5: Documento de exemplo com os bookmarks (itens numerados)
tem 1 - Neste ponto vai ficar o primeiro bookmark, que vamos chamar de identificacao, para incluso da identificao e nmero do documento;
tem 2 - bookmark chamado local, para incluso do local e data.
tem 3 - bookmark destinatario;
tem 4 - bookmark vocativo;
tem 5 - bookmark texto;
tem 6 - bookmark encerramento e
tem 7 - bookmark assinatura.
A incluso do bookmark feita pelo menu Inserir, opo "Favoritos...". A incluso no
8
• documento ocorre na posio corrente do cursor, ento precisamos posicionar o cursor na posio desejada e acessar o menu, conforme figura 6.
Figura 6: Menu de acesso a incluso de bookmarks
Aps escolher a opo no menu, exibido o dilogo de incluso, onde informamos o nome do bookm
|
{
"url": "https://fdocumentos.com/document/criando-documento-de-texto-no-brofficeorg-com-macros-e-.html",
"source_domain": "fdocumentos.com",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "92921",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:U6AFDTIBCDMNNLFWP5BKKRO2G5KAUMZS",
"WARC-Concurrent-To": "<urn:uuid:549f68ff-75f3-4720-9bb6-793b9ff8cea1>",
"WARC-Date": "2022-08-16T09:52:41Z",
"WARC-IP-Address": "172.67.205.195",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JWEQPDPGQSIGHC7FHPI5TYFAA3SOHKWN",
"WARC-Record-ID": "<urn:uuid:47ddd59c-108b-431d-86b2-287e58781d91>",
"WARC-Target-URI": "https://fdocumentos.com/document/criando-documento-de-texto-no-brofficeorg-com-macros-e-.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ae8cd4b0-67aa-41d9-a87e-5f8cceb6b3cc>"
},
"warc_info": "isPartOf: CC-MAIN-2022-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-115\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
43,
44,
70,
71,
85,
86,
102,
115,
116,
130,
131,
140,
141,
149,
162,
163,
169,
170,
186,
187,
244,
245,
313,
314,
327,
328,
635,
636,
903,
904,
950,
951,
1079,
1080,
1181,
1182,
1227,
1228,
1336,
1337,
1386,
1387,
1393,
1394,
1405,
1406,
1544,
1545,
1685,
1686,
1832,
1833,
1977,
1978,
2128,
2129,
2274,
2275,
2415,
2416,
2554,
2555,
2696,
2697,
2832,
2833,
2974,
2975,
3115,
3116,
3246,
3247,
3391,
3392,
3518,
3519,
3607,
3608,
3752,
3753,
3821,
3822,
3920,
3921,
4044,
4045,
4229,
4230,
4446,
4447,
4559,
4560,
4618,
4619,
4625,
4626,
4666,
4667,
4688,
4689,
4743,
4744,
4812,
4813,
4913,
4914,
5006,
5007,
5169,
5170,
5425,
5426,
5691,
5692,
5893,
5894,
6084,
6085,
6191,
6192,
6243,
6244,
6268,
6269,
6326,
6327,
6333,
6334,
6524,
6525,
6635,
6636,
6887,
6888,
7013,
7014,
7112,
7113,
7162,
7163,
7184,
7185,
7435,
7436,
7524,
7525,
7614,
7615,
7966,
7967,
8105,
8106,
8209,
8210,
8314,
8315,
8342,
8343,
8455,
8456,
8623,
8624,
8692,
8693,
8769,
8770,
8866,
8867,
8937,
8938,
9078,
9079,
9145,
9146,
9181,
9182,
9213,
9214,
9242,
9243,
9279,
9280,
9313,
9314,
9398,
9399,
9405,
9406,
9547,
9548,
9600,
9601
],
"line_end_idx": [
43,
44,
70,
71,
85,
86,
102,
115,
116,
130,
131,
140,
141,
149,
162,
163,
169,
170,
186,
187,
244,
245,
313,
314,
327,
328,
635,
636,
903,
904,
950,
951,
1079,
1080,
1181,
1182,
1227,
1228,
1336,
1337,
1386,
1387,
1393,
1394,
1405,
1406,
1544,
1545,
1685,
1686,
1832,
1833,
1977,
1978,
2128,
2129,
2274,
2275,
2415,
2416,
2554,
2555,
2696,
2697,
2832,
2833,
2974,
2975,
3115,
3116,
3246,
3247,
3391,
3392,
3518,
3519,
3607,
3608,
3752,
3753,
3821,
3822,
3920,
3921,
4044,
4045,
4229,
4230,
4446,
4447,
4559,
4560,
4618,
4619,
4625,
4626,
4666,
4667,
4688,
4689,
4743,
4744,
4812,
4813,
4913,
4914,
5006,
5007,
5169,
5170,
5425,
5426,
5691,
5692,
5893,
5894,
6084,
6085,
6191,
6192,
6243,
6244,
6268,
6269,
6326,
6327,
6333,
6334,
6524,
6525,
6635,
6636,
6887,
6888,
7013,
7014,
7112,
7113,
7162,
7163,
7184,
7185,
7435,
7436,
7524,
7525,
7614,
7615,
7966,
7967,
8105,
8106,
8209,
8210,
8314,
8315,
8342,
8343,
8455,
8456,
8623,
8624,
8692,
8693,
8769,
8770,
8866,
8867,
8937,
8938,
9078,
9079,
9145,
9146,
9181,
9182,
9213,
9214,
9242,
9243,
9279,
9280,
9313,
9314,
9398,
9399,
9405,
9406,
9547,
9548,
9600,
9601,
9693
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9693,
"ccnet_original_nlines": 192,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.12869198620319366,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018284110352396965,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18565401434898376,
"rps_doc_frac_unique_words": 0.3280201256275177,
"rps_doc_mean_word_length": 5.024328708648682,
"rps_doc_num_sentences": 85,
"rps_doc_symbol_to_word_ratio": 0.4303797483444214,
"rps_doc_unigram_entropy": 5.123931884765625,
"rps_doc_word_count": 1192,
"rps_doc_frac_chars_dupe_10grams": 0.037067960947752,
"rps_doc_frac_chars_dupe_5grams": 0.09433961659669876,
"rps_doc_frac_chars_dupe_6grams": 0.06812489777803421,
"rps_doc_frac_chars_dupe_7grams": 0.04875605180859566,
"rps_doc_frac_chars_dupe_8grams": 0.04875605180859566,
"rps_doc_frac_chars_dupe_9grams": 0.037067960947752,
"rps_doc_frac_chars_top_2gram": 0.034563370048999786,
"rps_doc_frac_chars_top_3gram": 0.01636333018541336,
"rps_doc_frac_chars_top_4gram": 0.018367009237408638,
"rps_doc_books_importance": -724.070556640625,
"rps_doc_books_importance_length_correction": -724.070556640625,
"rps_doc_openwebtext_importance": -408.1278076171875,
"rps_doc_openwebtext_importance_length_correction": -408.1278076171875,
"rps_doc_wikipedia_importance": -280.7528991699219,
"rps_doc_wikipedia_importance_length_correction": -280.7528991699219
},
"fasttext": {
"dclm": 0.49243998527526855,
"english": 0.020590469241142273,
"fineweb_edu_approx": 1.244677186012268,
"eai_general_math": 0.00043434000690467656,
"eai_open_web_math": 0.4961398243904114,
"eai_web_code": 0.6950798034667969
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
1,203,606,734,625,145,000 |
Home PrintPerforming Secure Print (PCL Driver)
Performing Secure Print (PCL Driver)
In the following settings, send a print job from a computer to this machine. To make prints, use the touch panel of this machine.
• Select [Secure Print] in [Output Method] on the [Basic] tab
1. Open the [Basic] tab.
2. Select [Secure Print] from the [Output Method] pull-down menu.
• If the [Secure Print ID] and [Password] for Secure Print are not specified, the User Setting dialog box is displayed. Proceed to step 3.
• When changing a [Secure Print ID] and [Password] that are already specified, press [User Setting]. Proceed to step 3.
• When not changing a [Secure Print ID] and [Password] that are already specified, proceed to step 4.
• The Windows 7 screen is used for explanation purposes.
3. In the [User Settings] dialog box, enter [Secure Print ID] and [Password].
• The ID and password can be specified using up to 8 one-byte characters.
4. Click [OK].
5. Click [Print] to send Secure Print jobs to the Secure Job User Box.
|
{
"url": "https://manuals.konicaminolta.eu/ineo-1100/EN/contents/id01-_102141825.html",
"source_domain": "manuals.konicaminolta.eu",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "5079",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XZCSENZ4F7M25ZZP2TVJEJGT2AGBMQZ3",
"WARC-Concurrent-To": "<urn:uuid:975aeb77-b389-4f84-9512-6fe9a9b57b96>",
"WARC-Date": "2024-07-13T10:00:44Z",
"WARC-IP-Address": "91.206.99.63",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:BTSU2A5SS4SPO7562U56WX26GH6KPEBE",
"WARC-Record-ID": "<urn:uuid:0f53ad3b-b0c0-4041-82ce-c65d8b5d1883>",
"WARC-Target-URI": "https://manuals.konicaminolta.eu/ineo-1100/EN/contents/id01-_102141825.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8267bdf3-e72d-4026-ba59-06602b39bc41>"
},
"warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-196\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
47,
48,
85,
86,
216,
217,
281,
282,
309,
310,
378,
379,
522,
523,
647,
648,
754,
755,
816,
817,
897,
898,
976,
977,
994,
995
],
"line_end_idx": [
47,
48,
85,
86,
216,
217,
281,
282,
309,
310,
378,
379,
522,
523,
647,
648,
754,
755,
816,
817,
897,
898,
976,
977,
994,
995,
1067
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1067,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23770491778850555,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03278689086437225,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.32786884903907776,
"rps_doc_frac_unique_words": 0.43820226192474365,
"rps_doc_mean_word_length": 4.370786666870117,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.0369415283203125,
"rps_doc_word_count": 178,
"rps_doc_frac_chars_dupe_10grams": 0.14395886659622192,
"rps_doc_frac_chars_dupe_5grams": 0.2544987201690674,
"rps_doc_frac_chars_dupe_6grams": 0.1928020566701889,
"rps_doc_frac_chars_dupe_7grams": 0.14395886659622192,
"rps_doc_frac_chars_dupe_8grams": 0.14395886659622192,
"rps_doc_frac_chars_dupe_9grams": 0.14395886659622192,
"rps_doc_frac_chars_top_2gram": 0.1413881629705429,
"rps_doc_frac_chars_top_3gram": 0.08354756236076355,
"rps_doc_frac_chars_top_4gram": 0.08226221054792404,
"rps_doc_books_importance": -123.3767318725586,
"rps_doc_books_importance_length_correction": -123.3767318725586,
"rps_doc_openwebtext_importance": -56.60675811767578,
"rps_doc_openwebtext_importance_length_correction": -45.01181411743164,
"rps_doc_wikipedia_importance": -33.30876159667969,
"rps_doc_wikipedia_importance_length_correction": -33.30876159667969
},
"fasttext": {
"dclm": 0.353540301322937,
"english": 0.7638503909111023,
"fineweb_edu_approx": 2.09511399269104,
"eai_general_math": 0.04001874104142189,
"eai_open_web_math": 0.29172587394714355,
"eai_web_code": 0.0006537999724969268
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "658.40285",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
ece34605c058195ed03b4d393ef1a36c
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.