id
int64 | text
string | metadata
dict | line_start_n_end_idx
dict | quality_signals
dict | eai_taxonomy
dict | pid
string |
|---|---|---|---|---|---|---|
-2,737,580,024,816,640,000 |
0
I found a service called Juphy which unfortunately did not work even though it said they offer searching through YouTube comments.
I thought of scrolling down until all comments are shown and then just searching in the page but the browser gets a bit unstable after a while of scrolling and it isn't the best solution anyway.
This question is 6 years old and not quite the same so I think it is Ok to post a new one.
2
Assuming you just want to search for a keyword in Youtube comments of a specific video, not using stuff like RegExp.
https://ytcomment.kmcat.uk/
Does exactly this. Tried and worked.
2
• This is amazing thanks so much. Dec 24 '19 at 17:51
• This website stopped working for me, does it still work for you? Mar 19 '20 at 6:09
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://webapps.stackexchange.com/questions/137358/is-there-a-clever-way-to-search-youtube-comments-of-a-specific-video/137374#137374",
"source_domain": "webapps.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2021-39",
"warc_metadata": {
"Content-Length": "165363",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IIWUQU3AHEFQIYWZ3R4PJHLCT3DNUKAW",
"WARC-Concurrent-To": "<urn:uuid:8282407a-250b-4166-a2f3-cdf9fd4797a1>",
"WARC-Date": "2021-09-27T04:18:52Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BOB26EBA6H4LC4TDGIT3WOQLVA33TKVL",
"WARC-Record-ID": "<urn:uuid:f9e0afb9-a85c-429b-bdde-28c56e97e97f>",
"WARC-Target-URI": "https://webapps.stackexchange.com/questions/137358/is-there-a-clever-way-to-search-youtube-comments-of-a-specific-video/137374#137374",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5012a8ad-8319-420c-a5e2-de817f54ab30>"
},
"warc_info": "isPartOf: CC-MAIN-2021-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-102\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,
2,
3,
134,
135,
330,
331,
422,
423,
425,
426,
543,
544,
572,
573,
610,
611,
613,
669,
757,
758,
770,
771,
871,
872
],
"line_end_idx": [
2,
3,
134,
135,
330,
331,
422,
423,
425,
426,
543,
544,
572,
573,
610,
611,
613,
669,
757,
758,
770,
771,
871,
872,
962
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 962,
"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.45145630836486816,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01456310972571373,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1893203854560852,
"rps_doc_frac_unique_words": 0.6781609058380127,
"rps_doc_mean_word_length": 4.2988505363464355,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.604304790496826,
"rps_doc_word_count": 174,
"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.04010694846510887,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -106.58771514892578,
"rps_doc_books_importance_length_correction": -106.58771514892578,
"rps_doc_openwebtext_importance": -67.17765045166016,
"rps_doc_openwebtext_importance_length_correction": -53.722900390625,
"rps_doc_wikipedia_importance": -46.83135986328125,
"rps_doc_wikipedia_importance_length_correction": -46.83135986328125
},
"fasttext": {
"dclm": 0.03739523887634277,
"english": 0.9614468812942505,
"fineweb_edu_approx": 0.6866244077682495,
"eai_general_math": -0.000006199999916134402,
"eai_open_web_math": 0.020256100222468376,
"eai_web_code": -0.000010009999641624745
}
}
|
{
"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": "025.04",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "Library science",
"level_3": "Library administration"
}
}
},
"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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,355,064,892,512,801,000 |
RPC Miner - Bitcoin Wiki
Bitcoin - The Currency of the Internet
A community dedicated to Bitcoin, the currency of the Internet. Bitcoin is a distributed, worldwide, decentralized digital money. Bitcoins are issued and managed without any central authority whatsoever: there is no government, company, or bank in charge of Bitcoin. You might be interested in Bitcoin if you like cryptography, distributed peer-to-peer systems, or economics. A large percentage of Bitcoin enthusiasts are libertarians, though people of all political philosophies are welcome.
[link]
Blockchain Engineering - News & Technical Developments around Decentralized Ledger System
Blockchain Engineering is a Subreddit dedicated to News & Technical Development around Blockchains including Cryptocurrencies such as Bitcoin, Ethereum.
[link]
Bitcoin W Spectrum (BWS)
[link]
Write your own Bitcoin RPC API in Javascript (Node.js and React)
If you are running a full node, it's easy to setup an app that interfaces with it using a backend API such as Node, Python, etc. There's a good tutorial here about it if you want to build Node/React Javascript apps on top of Bitcoin Core! You can make a block explorer, testnet wallet, node dashboard, and more.
https://medium.com/@peterjd42/build-your-own-bitcoin-api-using-node-js-and-bitcoin-core-251e613623db
submitted by FunOptimizer42 to Bitcoin [link] [comments]
Peter McCormack makes his first Bitcoin RPC call...
(ring ring)
Woman: RPC Legal, how may I help you?
Peter: Hi, it's Peter McCormack can I speak to...
Woman (interrupts Peter): Ah hello Peter. Yes, we've all been expecting your call.
(woman laughs and some faint laughter of others is heard in the background)
Woman: I'll put you through to your solicitor.
(pause)
Solicitor: Peter. Good morning.
Peter: Hi I had a message to call you.
Solicitor: Yes. Not good news I'm afriad.
Peter: Oh?
Solicitor: Yes. I'm going to have to drop your case I'm afraid. Sorry, I can't represent you.
Peter: Huh? Why? What's happened?
Solicitor: Let me be blunt. Excuse the language. Are you a fucking idiot? What the heck were you doing on Twitter? Did you not think for one minute to actually go and investigate this Craig Wright yourself before slandering him?
Peter: Uh. Uh. But. But. What do you mean?
Solicitor: I can't represent you. Sorry.
Peter: What about the £100,000 I sent you? I want my money back.
Solicitor: Did you read the legal contract? I presume you didn't cause I did not Tweet it to you.
Peter: No. I want my money back.
Solicitor: Well if you read it you'll see that at this stage after our initial investigations of your case - or to be more honest what you seemed to think was a case, well you have to forefit 75% I'm afraid. It's in the contract.
Peter: That's not fair.
Solicitor: Life's not fair Peter. You did sign the contract. If you don't like it feel free to slander us here at RPC about it on Twitter and we'll collect a lot more from you.
Peter: So how much do I get back?
Solicitor: Well I can return £25,000 to you which is the 25%
Peter: Can you send me a cheque?
Solicitor: Hmmm. Well I didn't want to be sitting on the money so I invested it all. Is £25,000 worth of Bitcoin OK?
Peter: I guess so, as long as you pay the $5 transaction fee.
Solicitor: $5 transaction fee? What are you talking about? BSV transaction fee is less than a penny.
Peter: Whaaaaatttttt. You bought Bitcoin SV?
Solicitor: No I bought Bitcoin. Why do you call it Bitcoin SV? As far as I can see it is Bitcoin. I soon realised just how bad your case was Peter. But I kept reading and studying and I felt compelled to buy some.
Peter: What made you do that?
Solicitor: It's What Bitcoin Did Peter, it's What Bitcoin Did. Bye.
(click)
submitted by jim-btc to bitcoincashSV [link] [comments]
Searching for a GUI front-end for the bitcoin RPC protocol.
Following an old post that is outdated without useful referred projects: https://www.reddit.com/Bitcoin/comments/3cx061/looking_for_a_bitcoin_core_rpc_wallet_guimanage
There seems to be a large scarcity of such projects, all that I have found are dreadfully outdated or unkept. Pretty simple query, but I assume with little answers.
submitted by LaptonSpark to Bitcoin [link] [comments]
Peter McCormack makes his first Bitcoin RPC call...
(ring ring)
Woman: RPC Legal, how may I help you?
Peter: Hi, it's Peter McCormack can I speak to...
Woman (interrupts Peter): Ah hello Peter. Yes, we've all been expecting your call.
(woman laughs and some faint laughter of others is heard in the background)
Woman: I'll put you through to your solicitor.
(pause)
Solicitor: Peter. Good morning.
Peter: Hi I had a message to call you.
Solicitor: Yes. Not good news I'm afriad.
Peter: Oh?
Solicitor: Yes. I'm going to have to drop your case I'm afraid. Sorry, I can't represent you.
Peter: Huh? Why? What's happened?
Solicitor: Let me be blunt. Excuse the language. Are you a fucking idiot? What the heck were you doing on Twitter? Did you not think for one minute to actually go and investigate this Craig Wright yourself before slandering him?
Peter: Uh. Uh. But. But. What do you mean?
Solicitor: I can't represent you. Sorry.
Peter: What about the £100,000 I sent you? I want my money back.
Solicitor: Did you read the legal contract? I presume you didn't cause I did not Tweet it to you.
Peter: No. I want my money back.
Solicitor: Well if you read it you'll see that at this stage after our initial investigations of your case - or to be more honest what you seemed to think was a case, well you have to forefit 75% I'm afraid. It's in the contract.
Peter: That's not fair.
Solicitor: Life's not fair Peter. You did sign the contract. If you don't like it feel free to slander us here at RPC about it on Twitter and we'll collect a lot more from you.
Peter: So how much do I get back?
Solicitor: Well I can return £25,000 to you which is the 25%
Peter: Can you send me a cheque?
Solicitor: Hmmm. Well I didn't want to be sitting on the money so I invested it all. Is £25,000 worth of Bitcoin OK?
Peter: I guess so, as long as you pay the $5 transaction fee.
Solicitor: $5 transaction fee? What are you talking about? BSV transaction fee is less than a penny.
Peter: Whaaaaatttttt. You bought Bitcoin SV?
Solicitor: No I bought Bitcoin. Why do you call it Bitcoin SV? As far as I can see it is Bitcoin. I soon realised just how bad your case was Peter. But I kept reading and studying and I felt compelled to buy some.
Peter: What made you do that?
Solicitor: It's What Bitcoin Did Peter, it's What Bitcoin Did. Bye.
(click)
submitted by jim-btc to bitcoinsv [link] [comments]
Bitcoin RPC sends the remaining coins to random address?
I've send a couple of transactions using the RPC server from one of the generated addresses, the problem is that each time a transaction is sent the remaining coins end up being send to a random address, which seems to be also in control of the RPC server. Those address start with the number 3, although I don't know if that has something to do with the issue.
Does anyone know why is that happening?
Can that behavior be disabled, and if so, is it safe to do so?
submitted by rraallvv to Bitcoin [link] [comments]
Accessing Bitcoin's RPC service from PHP
Accessing Bitcoin's RPC service from PHP submitted by gr0kch8n to Bitcoin [link] [comments]
Are there any PHP-based Bitcoin RPC Libraries that are recommended? I am only trying to view transaction history / address-holdings.
Hello, I am aware of the dangers of trusting RPC calls for actually signing/broadcasting transactions -- I do not wish to do this!
I do wish to see the balance given a BTC address, and ideally the previous transactions leading up to the given address' balance.
A cursory google shows me there are a multitude of options. I figured asking you wonderful folks would help ensure I am using the right option!
Thank you very much my friends,
submitted by honestlyimeanreally to btc [link] [comments]
Bitcoin RPC sends the remaining coins to random address? /r/Bitcoin
Bitcoin RPC sends the remaining coins to random address? /Bitcoin submitted by ABitcoinAllBot to BitcoinAll [link] [comments]
Why am I getting exit code 1 after stopping bitcoin RPC server? /r/Bitcoin
Why am I getting exit code 1 after stopping bitcoin RPC server? /Bitcoin submitted by ABitcoinAllBot to BitcoinAll [link] [comments]
Bitcoin RPC
I'm creating a simple php script. When user send the payment, the payment is split and X% goes to fee wallet and Y% goes to another wallet.
Seems I can't use "sendfrom" twice even doing the right math:
feeWallet = $bitcoin->sendfrom($account, $addFee, $fee, 0); restWallet = $bitcoin->sendfrom($account, $addRest, $rest, 0);
My code is:
getbalance($account, 1); #do a math to remove X% $feeMath = fee($tax, $balance); #I was receiving "invalid amount" error. Fixed with this, I was giving 9 instead of 8 after zero. See satoshis for more. $feeFormated = number_format($feeMath, 8); #remove the fee from current balance $restMath = $balance - $feeFormated; #send the fee to the address xxxx $sendingFee = $bitcoin->sendfrom($account, $addFee, $feeFormated, 0); #send the balance minus fee to the address yyy $sendingRest = $bitcoin->sendfrom($account, $addFee, $restMath, 0); $err = $bitcoin->error; #Print message for control print_r("Fee TXID = " . $sendingFee . " Amount sent = " . "" . $feeFormated . "
"); print_r("Rest TXID = " . $sendingRest . " Amount sent = " . "" . $restMath . "
"); print_r("It's not working because: " . $err); echo var_dump($sendingFee) . "
"; echo var_dump($sendingRest) . "
"; ?>
This code return:
Fee TXID = 052024dba72141d83653d0318f927c3268fd2b7a443e26215785dd40f22af97e Amount sent = 0.00867206 Rest TXID = Amount sent = 0.07804852 It's not working because: Invalid amount string(64) "052024dba72141d83653d0318f927c3268fd2b7a443e26215785dd40f22af97e" bool(false)
But the problem is, I can send the fees but I can't send the "rest". What I'm doing wrong? Anybody can help?
submitted by JustinB1ber to Bitcoin [link] [comments]
Why am I getting exit code 1 after stopping bitcoin RPC server?
This is how I'm starting and stopping bitcoin from a service unit
[Service] ExecStart=/usbin/bitcoind -daemon=0 -datadir=/home/jsonrpc/bitcoin -conf=/home/jsonrpc/bitcoin/settings.conf ExecStop=/usbin/bitcoin-cli -datadir=/home/jsonrpc/bitcoin -conf=/home/jsonrpc/bitcoin/settings.conf stop
And this is what I get when I stop the service:
Shutdown requested. Exiting. Interrupting HTTP RPC server Interrupting RPC Shutdown: In progress... Stopping HTTP RPC server Stopping RPC RPC stopped. scheduler thread interrupt Shutdown: done bitcoin.service: Main process exited, code=exited, status=1/FAILURE
debug.log
2018-11-21T18:02:16Z Bitcoin Core version v0.17.0.0-ge1ed37edaedc85b8c3468bd9a726046344036243 (release build) 2018-11-21T18:02:16Z InitParameterInteraction: parameter interaction: -whitelistforcerelay=1 -> setting -whitelistrelay=1 2018-11-21T18:02:16Z Assuming ancestors of block 0000000000000000002e63058c023a9a1de233554f28c7b21380b6c9003f36a8 have valid signatures. 2018-11-21T18:02:16Z Setting nMinimumChainWork=0000000000000000000000000000000000000000028822fef1c230963535a90d 2018-11-21T18:02:16Z Using the 'standard' SHA256 implementation 2018-11-21T18:02:16Z Default data directory /home/jsonrpc/.bitcoin 2018-11-21T18:02:16Z Using data directory /home/jsonrpc/bitcoin 2018-11-21T18:02:16Z Using config file /home/jsonrpc/bitcoin/settings.conf 2018-11-21T18:02:16Z Using at most 4 automatic connections (1024 file descriptors available) 2018-11-21T18:02:16Z Using 16 MiB out of 32/2 requested for signature cache, able to store 524288 elements 2018-11-21T18:02:16Z Using 16 MiB out of 32/2 requested for script execution cache, able to store 524288 elements 2018-11-21T18:02:16Z Using 0 threads for script verification 2018-11-21T18:02:16Z HTTP: creating work queue of depth 16 2018-11-21T18:02:16Z Starting RPC 2018-11-21T18:02:16Z Starting HTTP RPC server 2018-11-21T18:02:16Z Config options rpcuser and rpcpassword will soon be deprecated. Locally-run instances may remove rpcuser to use cookie-based auth, or may be replaced with rpcauth. Please see share/rpcauth for rpcauth auth generation. 2018-11-21T18:02:16Z HTTP: starting 2 worker threads 2018-11-21T18:02:16Z Using wallet directory /home/jsonrpc/bitcoin 2018-11-21T18:02:16Z init message: Verifying wallet(s)... 2018-11-21T18:02:16Z Using BerkeleyDB version Berkeley DB 4.8.30: (April 9, 2010) 2018-11-21T18:02:16Z Using wallet wallet.dat 2018-11-21T18:02:16Z BerkeleyEnvironment::Open: LogDir=/home/jsonrpc/bitcoin/database ErrorFile=/home/jsonrpc/bitcoin/db.log 2018-11-21T18:02:16Z scheduler thread start 2018-11-21T18:02:24Z Cache configuration: 2018-11-21T18:02:24Z * Using 2.0MiB for block index database 2018-11-21T18:02:24Z * Using 8.0MiB for chain state database 2018-11-21T18:02:24Z * Using 40.0MiB for in-memory UTXO set (plus up to 286.1MiB of unused mempool space) 2018-11-21T18:02:24Z init message: Loading block index... 2018-11-21T18:02:24Z Opening LevelDB in /home/jsonrpc/bitcoin/blocks/index 2018-11-21T18:02:25Z Opened LevelDB successfully 2018-11-21T18:02:25Z Using obfuscation key for /home/jsonrpc/bitcoin/blocks/index: 0000000000000000 2018-11-21T18:03:38Z LoadBlockIndexDB: last block file = 1425 2018-11-21T18:03:38Z LoadBlockIndexDB: last block file info: CBlockFileInfo(blocks=71, size=79377521, heights=549167...549288, time=2018-11-07...2018-11-08) 2018-11-21T18:03:38Z Checking all blk files are present... 2018-11-21T18:03:47Z Opening LevelDB in /home/jsonrpc/bitcoin/chainstate 2018-11-21T18:03:47Z Opened LevelDB successfully 2018-11-21T18:03:48Z Using obfuscation key for /home/jsonrpc/bitcoin/chainstate: XXXXXXXXXXXXXXXX 2018-11-21T18:03:50Z Loaded best chain: hashBestChain=0000000000000000001d43d5aeb32c7d5158e48da84b896413e6439d09e53081 height=548521 date=2018-11-03T01:39:02Z progress=0.989162 2018-11-21T18:03:50Z init message: Rewinding blocks... 2018-11-21T18:04:22Z init message: Verifying blocks... 2018-11-21T18:04:22Z Verifying last 6 blocks at level 3 2018-11-21T18:04:22Z [0%]...[16%]...ThreadRPCServer method=stop user=deploy 2018-11-21T18:17:13Z block index 889465ms 2018-11-21T18:17:13Z Shutdown requested. Exiting. 2018-11-21T18:17:14Z Interrupting HTTP RPC server 2018-11-21T18:17:14Z Interrupting RPC 2018-11-21T18:17:14Z Shutdown: In progress... 2018-11-21T18:17:15Z Stopping HTTP RPC server 2018-11-21T18:17:15Z Stopping RPC 2018-11-21T18:17:15Z RPC stopped. 2018-11-21T18:17:16Z scheduler thread interrupt 2018-11-21T18:17:19Z Shutdown: done
submitted by rraallvv to Bitcoin [link] [comments]
Bitcoin RPC Remote Command Execution Exploit 2017 Secure your wallets, update!
submitted by BitcoinAllBot to BitcoinAllTV [link] [comments]
Bitcoin RPC sends the remaining coins to random address? /r/Bitcoin
Bitcoin RPC sends the remaining coins to random address? /Bitcoin submitted by cryptoanalyticabot to cryptoall [link] [comments]
Bitcoin RPC vs. Torify
I want to run joinmarket behind Tor and also have it query my local bitcoin node via RPC (instead of asking blockr.io). Is this possible? When I run, e.g., yield-generator with torify it complains that it cannot make the RPC calls.
submitted by eccentricitn_flattop to joinmarket [link] [comments]
Bitcoin RPC Remote Command Execution Exploit 2017 Secure your wallets, update!
Bitcoin RPC Remote Command Execution Exploit 2017 Secure your wallets, update! submitted by BitcoinAllBot to BitcoinAll [link] [comments]
complete newbie: "Problems communicating with bitcoin RPC 0 2" ?
i saw somewhere that the bitcoin client needs to download all blocks before i can start mining.. is this possibly the reason i'm getting this error right now, while the client is still retrieving blocks?
i can't seem to find a definitive answer anywhere else.
submitted by alefnull to mtred [link] [comments]
Introducing btcrpcclient — Bitcoin RPC Made Easy
Introducing btcrpcclient — Bitcoin RPC Made Easy submitted by davecgh to Bitcoin [link] [comments]
Bitcoin RPC No Longer Able To Estimate Next Block Inclusion Fee
bitcoin-cli estimatefee 1
https://chainquery.com/bitcoin-api/estimatefee/1
Should return the estimated fee, now returns -1 because it is unable to make an estimate.
bitcoin-cli estimatefee 2
https://chainquery.com/bitcoin-api/estimatefee/2
Is working as expected.
submitted by CoinCadence to Bitcoin [link] [comments]
"Problems communicating with Bitcoin RPC" even while mining?
I can't figure out what is going on. I am mining, and submitting shares, but even though I have the same hash rate, I'm submitting shares at a much slower rate than on other pools. I'd prefer to use MTRed, but unless I can get this solved I'm not sure I will.
So I was watching the miner, and where it shows a live stat of my hash count it will sometimes flash the text "Problems communicating with bitcoin RPC" and then continue mining. Everything I find on that error seems to be about not being able to connect at all, but I can connect and mine, just not as efficiently as I should be able to.
Here is the command I'm running (Win 7):
poclbm.exe --platform 1 -d 1 -v -w 128 -f 60 -a 15 --user=username --pass=pass -o mtred.com -p 8337
I also tried this, which gives me a higher hashrate so I'd like to figure out why so I can keep mining at that rate, but frequent "long polls" and still gives the RPC error:
poclbm.exe --platform 1 -d 1 --user=username --pass=pass -o mtred.com -p 8337
Any help is greatly appreciated!
EDIT: It sounds like it is a known issue. Any ideas on the long polling? Is that even a problem?
submitted by ferrarisnowday to mtred [link] [comments]
Consistently getting the "Problem communicating with bitcoin RPC" error. Any suggestions?
I've tried a few different clients, but I always get the same sort of error. I know someone posted a day ago that had the same problem, but his solution didn't work for me. I've looked around the net for awhile for a solution, but nothing seems to fix it.
For simplicity's sake, I'll just describe my GUIMiner setup:
Server: Other
Website: n/a
Host: mtred.com
Port: 8337
Username: [username registered on mtred.com]
Password: [password for registered username on mtred.com]
Device: [0-0] ATI RV770 (it's an ATI 4870)
Extra flags: (nothing)
I've added the computer running the miner to my router's DMZ (running dd-wrt) so port access shouldn't be a problem. Anyone have any suggestions?
EDIT: Also, my firewall is disabled. Added "bitcoin.exe.", "guiminer.exe", and "poclbm.exe" to my Microsoft Security Essentials list of excluded processes. Still no dice :(
EDIT 2: Rawlsdeep solved my problem. I needed to create a worker on mtred.com and use my worker's credentials as my username and password for my mining program. Hopefully this will help someone else later on!
submitted by hyppo to mtred [link] [comments]
"Not enough funds" error only when running through bitcoin-rpc
So I am trying to run a full node through Whonix and use joinmarket. I have it set up to where it works just fine with blockr. When I switch the source to bitcoin-rpc, I get "ERROR Exception: Not enough funds". Any ideas as to why joinmarket can't recognize the bitcoin in my wallet when it's using bitcoin core as the source? Bitcoin core is running, bitcoin.conf is correct, joinmarket.cfg is correct. I checked 1000 times.
Here's my log: https://paste.fedoraproject.org/358746/13709111/
EDIT: So it appears something is wrong with mixing depth 0. If I use -m 1, and have coins in that mixing depth, it works. tumbler.py and sendpayment.py fail if I have -m 0 set, regardless of if there are coins in there or not.
submitted by hilltopbandaids to joinmarket [link] [comments]
11-18 22:23 - 'Bitcoin RPC Remote Command Execution Exploit 2017 Secure your wallets, update!' (youtube.com) by /u/mra707 removed from /r/Bitcoin within 16-26min
Bitcoin RPC Remote Command Execution Exploit 2017 Secure your wallets, update!
Go1dfish undelete link
unreddit undelete link
Author: mra707
submitted by removalbot to removalbot [link] [comments]
JSON RPC Calls with Bitcoin qt (4 of 6) How to mine bitcoins (solo mining) with the core client ... Bitcoin JSON-RPC Tutorial 6 - JSON Parameters and Errors Bitcoin JSON-RPC Tutorial 2 - VPS Setup Programming Bitcoin-qt using the RPC api (1 of 6)
How to Do RPC Calls with C++ Bitcoind . bitcoin deamon = core value of the software (bitcoind -printtoconsole -debug=1) Bitcoind provide the RPC "interface" in which user can query with bitcoin-cli (or a library in c++). You must run bitcoind before using bitcoin-cli. Bitcoin supports SSL (https) JSON-RPC connections beginning with version 0.3.14. See the rpcssl wiki page for setup instructions and a list of all bitcoin.conf configuration options. Allowing arbitrary machines to access the JSON-RPC port (using the rpcallowip configuration option ) is dangerous and strongly discouraged -- access should be ... Wallet RPCs¶. Note: the wallet RPCs are only available if Bitcoin Core was built with wallet support, which is the default. The Bitcoin remote RPC Miner, also referred to as puddinpop's miner after the author's forum name, is a pool miner client.. There are four miner client binaries distributed: Bitcoin is an innovative payment network and a new kind of money. Find all you need to know and get started with Bitcoin on bitcoin.org. Bitcoin.org is a community funded project, donations are appreciated and used to improve the website. Make a donation
[index] [634] [3964] [2393] [1338] [1871] [1689] [5197] [1622] [1854] [1547]
JSON RPC Calls with Bitcoin qt (4 of 6)
Bitcoin JSON-RPC Tutorial 3 - bitcoin.conf - Duration: 8:10. m1xolyd1an 13,667 views. 8:10. How to build a monero full (remote) node on ubuntu linux server - Duration: 14:32. Bitcoin JSON-RPC tutorial. Handling JSON, entering parameters and receiving error messages. BTC: 1NPrfWgJfkANmd1jt88A141PjhiarT8d9U. Bitcoin JSON-RPC Tutorial 5 - Your First Calls - Duration: 10:06. m1xolyd1an 11,838 views. 10:06. Building a Blockchain in Under 15 Minutes - Programmer explains - Duration: 14:28. *****UPDATE***** Solo mining has been removed from client. I'll keep the video up for how it used to work, it might still work for some alt coins (unsure) yo... Bitcoin JSON-RPC tutorial. How to set up bitcoind on a VPS. BTC: 1NPrfWgJfkANmd1jt88A141PjhiarT8d9U.
http://pharhouboupancobu.tk
|
{
"url": "https://lapowithbe.tk/?id=408",
"source_domain": "lapowithbe.tk",
"snapshot_id": "crawl=CC-MAIN-2016-36",
"warc_metadata": {
"Content-Length": "35954",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HR4JPAQZH7HJ2QVBR2PULUNGGTXTQGFL",
"WARC-Concurrent-To": "<urn:uuid:68b94c54-1446-4903-820d-79423b54a572>",
"WARC-Date": "2021-05-12T18:44:01Z",
"WARC-IP-Address": "172.67.218.130",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UU5EIG5U6QCN6RFPR6TCKOG6YNVVBWI5",
"WARC-Record-ID": "<urn:uuid:4887b266-e1d7-4e2a-8dac-ada9a9613d1f>",
"WARC-Target-URI": "https://lapowithbe.tk/?id=408",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:af5a7326-fa71-4350-8365-4fb957b72eef>"
},
"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-81.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,
25,
26,
65,
66,
559,
566,
567,
657,
658,
811,
818,
819,
844,
845,
852,
853,
918,
919,
1231,
1332,
1389,
1390,
1442,
1443,
1455,
1493,
1543,
1626,
1702,
1749,
1757,
1789,
1828,
1870,
1881,
1975,
2009,
2238,
2281,
2322,
2387,
2485,
2518,
2748,
2772,
2949,
2983,
3044,
3077,
3194,
3256,
3357,
3402,
3616,
3646,
3714,
3722,
3778,
3779,
3839,
3840,
4008,
4173,
4227,
4228,
4280,
4281,
4293,
4331,
4381,
4464,
4540,
4587,
4595,
4627,
4666,
4708,
4719,
4813,
4847,
5076,
5119,
5160,
5225,
5323,
5356,
5586,
5610,
5787,
5821,
5882,
5915,
6032,
6094,
6195,
6240,
6454,
6484,
6552,
6560,
6612,
6613,
6670,
6671,
7033,
7073,
7136,
7187,
7188,
7229,
7230,
7322,
7323,
7456,
7457,
7588,
7718,
7862,
7894,
7952,
7953,
8021,
8022,
8148,
8149,
8224,
8225,
8358,
8359,
8371,
8372,
8512,
8513,
8575,
8699,
8711,
8712,
9381,
9382,
9465,
9466,
9547,
9548,
9583,
9584,
9590,
9608,
9609,
9879,
9988,
10042,
10043,
10107,
10108,
10174,
10400,
10448,
10710,
10720,
14591,
14642,
14643,
14722,
14723,
14784,
14785,
14853,
14854,
14983,
14984,
15007,
15008,
15240,
15306,
15307,
15386,
15387,
15525,
15526,
15591,
15592,
15796,
15852,
15901,
15902,
15951,
15952,
16051,
16052,
16116,
16117,
16144,
16193,
16283,
16310,
16359,
16383,
16437,
16438,
16499,
16500,
16760,
17098,
17139,
17240,
17414,
17492,
17525,
17622,
17677,
17678,
17768,
17769,
18025,
18086,
18100,
18113,
18129,
18140,
18185,
18243,
18286,
18309,
18455,
18628,
18837,
18883,
18884,
18947,
18948,
19374,
19438,
19665,
19726,
19727,
19889,
19890,
19969,
19992,
20015,
20030,
20086,
20087,
20334,
20335,
21503,
21504,
21581,
21582,
21622,
21623,
22374,
22375
],
"line_end_idx": [
25,
26,
65,
66,
559,
566,
567,
657,
658,
811,
818,
819,
844,
845,
852,
853,
918,
919,
1231,
1332,
1389,
1390,
1442,
1443,
1455,
1493,
1543,
1626,
1702,
1749,
1757,
1789,
1828,
1870,
1881,
1975,
2009,
2238,
2281,
2322,
2387,
2485,
2518,
2748,
2772,
2949,
2983,
3044,
3077,
3194,
3256,
3357,
3402,
3616,
3646,
3714,
3722,
3778,
3779,
3839,
3840,
4008,
4173,
4227,
4228,
4280,
4281,
4293,
4331,
4381,
4464,
4540,
4587,
4595,
4627,
4666,
4708,
4719,
4813,
4847,
5076,
5119,
5160,
5225,
5323,
5356,
5586,
5610,
5787,
5821,
5882,
5915,
6032,
6094,
6195,
6240,
6454,
6484,
6552,
6560,
6612,
6613,
6670,
6671,
7033,
7073,
7136,
7187,
7188,
7229,
7230,
7322,
7323,
7456,
7457,
7588,
7718,
7862,
7894,
7952,
7953,
8021,
8022,
8148,
8149,
8224,
8225,
8358,
8359,
8371,
8372,
8512,
8513,
8575,
8699,
8711,
8712,
9381,
9382,
9465,
9466,
9547,
9548,
9583,
9584,
9590,
9608,
9609,
9879,
9988,
10042,
10043,
10107,
10108,
10174,
10400,
10448,
10710,
10720,
14591,
14642,
14643,
14722,
14723,
14784,
14785,
14853,
14854,
14983,
14984,
15007,
15008,
15240,
15306,
15307,
15386,
15387,
15525,
15526,
15591,
15592,
15796,
15852,
15901,
15902,
15951,
15952,
16051,
16052,
16116,
16117,
16144,
16193,
16283,
16310,
16359,
16383,
16437,
16438,
16499,
16500,
16760,
17098,
17139,
17240,
17414,
17492,
17525,
17622,
17677,
17678,
17768,
17769,
18025,
18086,
18100,
18113,
18129,
18140,
18185,
18243,
18286,
18309,
18455,
18628,
18837,
18883,
18884,
18947,
18948,
19374,
19438,
19665,
19726,
19727,
19889,
19890,
19969,
19992,
20015,
20030,
20086,
20087,
20334,
20335,
21503,
21504,
21581,
21582,
21622,
21623,
22374,
22375,
22402
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 22402,
"ccnet_original_nlines": 253,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 2,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24792911112308502,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06646118313074112,
"rps_doc_frac_lines_end_with_ellipsis": 0.015748029574751854,
"rps_doc_frac_no_alph_words": 0.3332691192626953,
"rps_doc_frac_unique_words": 0.294189989566803,
"rps_doc_mean_word_length": 5.364893913269043,
"rps_doc_num_sentences": 323,
"rps_doc_symbol_to_word_ratio": 0.004623389802873135,
"rps_doc_unigram_entropy": 6.029555320739746,
"rps_doc_word_count": 3253,
"rps_doc_frac_chars_dupe_10grams": 0.2581939101219177,
"rps_doc_frac_chars_dupe_5grams": 0.31738483905792236,
"rps_doc_frac_chars_dupe_6grams": 0.2979601323604584,
"rps_doc_frac_chars_dupe_7grams": 0.28483840823173523,
"rps_doc_frac_chars_dupe_8grams": 0.2761287987232208,
"rps_doc_frac_chars_dupe_9grams": 0.26678889989852905,
"rps_doc_frac_chars_top_2gram": 0.015471009537577629,
"rps_doc_frac_chars_top_3gram": 0.005959200207144022,
"rps_doc_frac_chars_top_4gram": 0.009626399725675583,
"rps_doc_books_importance": -2283.902099609375,
"rps_doc_books_importance_length_correction": -2283.902099609375,
"rps_doc_openwebtext_importance": -1350.3726806640625,
"rps_doc_openwebtext_importance_length_correction": -1350.3726806640625,
"rps_doc_wikipedia_importance": -824.84375,
"rps_doc_wikipedia_importance_length_correction": -824.84375
},
"fasttext": {
"dclm": 0.12751752138137817,
"english": 0.8600865602493286,
"fineweb_edu_approx": 1.205179214477539,
"eai_general_math": 0.1926988959312439,
"eai_open_web_math": 0.16715192794799805,
"eai_web_code": 0.1757860779762268
}
}
|
{
"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": "332.874",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Finance"
}
}
},
"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": "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": "5",
"label": "Comment Section"
},
"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": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,432,965,879,417,318,000 |
Anyone tried PSPP (free alternative to SPSS)?
#2
Foud it somewere in Wikipedia... Quite some time ago. I downloaded for window but I didn't really like it. A bit limited and, er, ugly. But, of course, it's free, and it'a one hell of a good point. A good alternative.
#4
PSPP and other free software
I have also tried PSPP 0.6.1 and like it's SPSS feel but agree that it is very limited. I have downloaded OpenStat http://www.statpages.org/miller/openstat/ and it seems to be fully-featured and comparable to SPSS. The creator also updates it monthly. My question is if anyone has used this software.
I am a PhD student in allied health sciences and do not have a strong background in mathematics. I have attempted to use R and also with its linux GUI interface (RKWard) but am not comfortable with it. Does anyone have any experience with OpenStat? How important is it to double-check my statistical results with commercial packages such as SPSS or SigmaStat?
#7
Alnternative to Quantum
Guys!!
I tried installing PSPP but no luck !! It was a worse experience though. Curently I am using Quantum (an SPSS product), but I need a replacement for this which should be a freeware. Can sombody help me out in this regard.
gianmarco
TS Contributor
#8
Hi!
I would point out PAST (http://folk.uio.no/ohammer/past/).
It is not comparable to statistica or SPSS, but it is rather complete and very easy to use.
I believe that the scholar who made it (and who continuously update it) is a real "benefactor".
Pasting from the its site:
"PAST is a free, easy-to-use data analysis package originally aimed at paleontology but now also popular in ecology and other fields. It includes common statistical, plotting and modelling functions:
# A spreadsheet-type data entry form
# Both interactive user interface and scripting
# Graph, scatter, 3D scatter, bubble, histogram, kernel density estimation, box, percentile, ternary, survivorship, spindle, matrix, surface and normal probability plots
# Curve fitting: Linear (Standard and Reduced Major Axis) with bootstrapping and permutation, lin-log (exponential), log-log (allometric), polynomial, logistic, von Bertalanffy, sum-of-sines, B-splines, Gaussian (species packing), multiple regression.
# F, t, permutation t, Chi-squared w. permutation test, Fisher's exact, Kolmogorov-Smirnov, Mann-Whitney, Shapiro-Wilk, Jarque-Bera, Spearman's Rho and Kendall's Tau tests with permutation, correlation, covariance, contingency tables, one-way and two-way ANOVA, one-way ANCOVA, Kruskal-Wallis test, sign test, Wilcoxon signed rank test with permutation, Fligner-Killeen test for coefficients of variation, mixture analysis, survival analysis (Kaplan-Meier curves, logrank and other tests).
# Diversity indices with bootstrapping and permutation, individual- and sample-based rarefaction. Capture-recapture richness estimators. Renyi diversity profiles, SHE analysis, beta diversity.
# Abundance model fitting: Geometric, log-series, log-normal, broken stick.
# Multivariate statistics: Principal Components (with Minimal Spanning Tree, bootstrapping etc.), Principal Coordinates (19 distance measures), Non-metric Multidimensional Scaling (19 distance measures), Detrended Correspondence Analysis, Canonical Correspondence Analysis, Cluster analysis (UPGMA, single linkage, Ward's method and neighbour joining, 19 distance measures, two-way clustering, bootstrapping), k-means clustering, seriation, discriminant analysis, one-way MANOVA, one-way and two-way ANOSIM, one-way NPMANOVA, Hotelling's T2, paired Hotelling's T2, Mahalanobis-distance permutation, Mardia's multivariate normality, Box's M, Canonical Variates Analysis, multivariate allometry with bootstrapping, Mantel test, SIMPER, Imbrie & Kipp factor analysis, Modern Analog Technique, two-block Partial Least Squares.
# Time series analysis: Spectral analysis, autocorrelation, cross-correlation, wavelet transform, Walsh transform, runs test. Mantel correlogram and periodogram. ARMA, Box-Jenkins intervention analysis. Solar forcing model.
# Geometrical analysis: Directional statistics (Rayleigh, Rao, chi-squared, Watson-Williams, circular kernel density estimation, angular mean with CI, rose plots, circular correlation), kernel density estimation of point density, point distribution statistics (nearest neighbour and Ripley's K), Fourier shape analysis, elliptic Fourier shape analysis, eigenshapes, landmark analysis with Bookstein and Procrustes fitting (2D and 3D), thin-plate spline transformation grids with expansions and principal strains, partial warps and scores, relative warps and scores, centroid size from landmarks, size removal by Burnaby's method.
# Parsimony analysis (cladistics): Exhaustive, branch-and-bound and heuristic algorithms, Wagner, Fitch and Dollo characters. Bootstrap, strict and majority rule consensus trees. Consistency and retention indices. Three stratigraphic congruency indices with permutation tests. Cladograms and phylograms.
# Biostratigraphy with the methods of Unitary Associations, Ranking-Scaling (RASC), Appearence Event Ordination and Constrained Optimization (CONOP). Confidence intervals on stratigraphic ranges.
# Gridding (spatial interpolation): Moving average, thin-plate spline and kriging with three semivariogram models."
|
{
"url": "https://www.talkstats.com/threads/anyone-tried-pspp-free-alternative-to-spss.6232/",
"source_domain": "www.talkstats.com",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "62082",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YNGQCBKHHIENYKG47HNR4EEP4ZGNYQB5",
"WARC-Concurrent-To": "<urn:uuid:6516c5c9-c9c0-4c3b-8ea0-ce23c73ebea8>",
"WARC-Date": "2021-12-03T03:53:25Z",
"WARC-IP-Address": "199.167.200.62",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5EH2HSIVSSVNF2YPFKNI7CPNM2WQGTUN",
"WARC-Record-ID": "<urn:uuid:a968deac-d7c8-42c7-b6d5-2d8b5f9c62b0>",
"WARC-Target-URI": "https://www.talkstats.com/threads/anyone-tried-pspp-free-alternative-to-spss.6232/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f1465e1f-1157-41ac-8265-947d1ba2ea95>"
},
"warc_info": "isPartOf: CC-MAIN-2021-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-235\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,
46,
47,
50,
268,
270,
273,
302,
303,
604,
605,
965,
967,
970,
994,
995,
1002,
1003,
1225,
1227,
1228,
1238,
1239,
1254,
1257,
1261,
1320,
1412,
1413,
1509,
1510,
1511,
1538,
1539,
1739,
1740,
1777,
1825,
1995,
2247,
2737,
2930,
3006,
3829,
4053,
4683,
4987,
5183,
5299
],
"line_end_idx": [
46,
47,
50,
268,
270,
273,
302,
303,
604,
605,
965,
967,
970,
994,
995,
1002,
1003,
1225,
1227,
1228,
1238,
1239,
1254,
1257,
1261,
1320,
1412,
1413,
1509,
1510,
1511,
1538,
1539,
1739,
1740,
1777,
1825,
1995,
2247,
2737,
2930,
3006,
3829,
4053,
4683,
4987,
5183,
5299,
5300
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5300,
"ccnet_original_nlines": 48,
"rps_doc_curly_bracket": 0,
"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.0476190485060215,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.28285714983940125,
"rps_doc_frac_unique_words": 0.6109510064125061,
"rps_doc_mean_word_length": 6.131124019622803,
"rps_doc_num_sentences": 53,
"rps_doc_symbol_to_word_ratio": 0.01714286021888256,
"rps_doc_unigram_entropy": 5.649590015411377,
"rps_doc_word_count": 694,
"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.0037602800875902176,
"rps_doc_frac_chars_top_3gram": 0.01621622033417225,
"rps_doc_frac_chars_top_4gram": 0.01457109022885561,
"rps_doc_books_importance": -534.1795043945312,
"rps_doc_books_importance_length_correction": -534.1795043945312,
"rps_doc_openwebtext_importance": -269.5847473144531,
"rps_doc_openwebtext_importance_length_correction": -269.5847473144531,
"rps_doc_wikipedia_importance": -178.84071350097656,
"rps_doc_wikipedia_importance_length_correction": -178.84071350097656
},
"fasttext": {
"dclm": 0.028546810150146484,
"english": 0.8674710392951965,
"fineweb_edu_approx": 1.2735084295272827,
"eai_general_math": 0.8274701237678528,
"eai_open_web_math": 0.3181661367416382,
"eai_web_code": 0.6554968357086182
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.462",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
}
},
"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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
990,725,171,090,544,300 |
Go Down
Topic: Recommended basic C++ Tutorial please (Read 407 times) previous topic - next topic
robgraham
I've done quite a bit of Basic programming over many years but this is my first experience with C/C++. I'm confused for example by the terminology that is being used ("class", etc) and the use of .h and .cpp files from libraries. Looking at examples I can see how the program flow is formatted
Can some one kindly point me in the direction of a tutorial that effectively explains the structures in C/C++ without taking me through all the phases learning how to program. Googling for tutorials produces just too many hits to realistically wade through to get me the structural information I think I need.
I've had a look at the Language Reference and that is helping a bit, but not enough !
Many thanks
Rob
PeterH
Googling for tutorials produces just too many hits to realistically wade through to get me the structural information I think I need.
I'm sure that if you Google for "basic C++ tutorial" you'll get plenty of hits that give the sort of tutorial you need. Of course you don't need to wade through all of them.
I only provide help via the forum - please do not contact me for private consultancy.
sexybikeman
If you go to youtube and put in "Bucky C++" youll find a link to thenewboston channel. There you'll find tutorials on all sorts of programming taught by a guy named bucky roberts. It can get kind of corny and VERY basic at the beginning but it is a good introduction to c++ terminology. Im at the initial stages of learning the language myself and I find my problem to be that there is a lack of definite tutorial and project pairing out there. I can learn all the terminology and syntax I want but if Im not given an idea on how it can be used it's hard to make it stick. Basically just missing that "OOOOOOOOHHHH NOW I get it".
retrolefty
CrossRoads
I found the IDE to be like a fancy version of BASIC when I started using it a couple of years go.
The trickiest part was remebering the ; at the end lines, and getting the ( ) and { } to line up for the code chunks being used.
Outside of that, the programming often has more to do with the hardware you are using than the things like classes and .h and .cpp files.
One of the better things you can learn is reading millis( ) and micros( ) and making things happen at scheduled times.
Designing & building electrical circuits for over 25 years. Check out the ATMega1284P based Bobuino and other '328P & '1284P creations & offerings at www.crossroadsfencing.com/BobuinoRev17.
Arduino for Teens available at Amazon.com.
Go Up
|
{
"url": "http://forum.arduino.cc/index.php?topic=147768.0;prev_next=next",
"source_domain": "forum.arduino.cc",
"snapshot_id": "crawl=CC-MAIN-2014-42",
"warc_metadata": {
"Content-Length": "38570",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:W7NSIMXG7KNFC7SS6H5GYOG6K4TLOAED",
"WARC-Concurrent-To": "<urn:uuid:c335dfa3-f983-4abe-8e5d-44725ecdf31e>",
"WARC-Date": "2014-10-22T04:54:15Z",
"WARC-IP-Address": "54.235.88.245",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:K4K3EBHKKI4YUSMN3YPSQI4F5Q6ZM2JF",
"WARC-Record-ID": "<urn:uuid:69363b9f-ad17-4fd6-9d07-9fa243203153>",
"WARC-Target-URI": "http://forum.arduino.cc/index.php?topic=147768.0;prev_next=next",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f7ca1bec-b101-4955-9f9e-5adafe3f4c03>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-16-133-185.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-42\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for October 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,
8,
9,
99,
100,
110,
111,
407,
408,
719,
720,
806,
807,
819,
823,
824,
831,
832,
833,
967,
968,
969,
1143,
1229,
1230,
1242,
1243,
1878,
1879,
1890,
1891,
1892,
1903,
1904,
2002,
2131,
2269,
2388,
2579,
2622,
2623,
2629
],
"line_end_idx": [
8,
9,
99,
100,
110,
111,
407,
408,
719,
720,
806,
807,
819,
823,
824,
831,
832,
833,
967,
968,
969,
1143,
1229,
1230,
1242,
1243,
1878,
1879,
1890,
1891,
1892,
1903,
1904,
2002,
2131,
2269,
2388,
2579,
2622,
2623,
2629,
2630
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2630,
"ccnet_original_nlines": 41,
"rps_doc_curly_bracket": 0.000760459981393069,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.46532848477363586,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05474453046917915,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1386861354112625,
"rps_doc_frac_unique_words": 0.48695650696754456,
"rps_doc_mean_word_length": 4.443478107452393,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.975226879119873,
"rps_doc_word_count": 460,
"rps_doc_frac_chars_dupe_10grams": 0.10861057043075562,
"rps_doc_frac_chars_dupe_5grams": 0.10861057043075562,
"rps_doc_frac_chars_dupe_6grams": 0.10861057043075562,
"rps_doc_frac_chars_dupe_7grams": 0.10861057043075562,
"rps_doc_frac_chars_dupe_8grams": 0.10861057043075562,
"rps_doc_frac_chars_dupe_9grams": 0.10861057043075562,
"rps_doc_frac_chars_top_2gram": 0.009784740395843983,
"rps_doc_frac_chars_top_3gram": 0.013698630034923553,
"rps_doc_frac_chars_top_4gram": 0.011741680093109608,
"rps_doc_books_importance": -215.2894744873047,
"rps_doc_books_importance_length_correction": -215.2894744873047,
"rps_doc_openwebtext_importance": -121.5556411743164,
"rps_doc_openwebtext_importance_length_correction": -121.5556411743164,
"rps_doc_wikipedia_importance": -77.85199737548828,
"rps_doc_wikipedia_importance_length_correction": -77.85199737548828
},
"fasttext": {
"dclm": 0.025467099621891975,
"english": 0.9204423427581787,
"fineweb_edu_approx": 1.6472502946853638,
"eai_general_math": 0.6987583637237549,
"eai_open_web_math": 0.2787405252456665,
"eai_web_code": 0.36488497257232666
}
}
|
{
"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.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": "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": "23",
"label": "Tutorial"
}
},
"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": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,331,795,422,834,035,500 |
Learning to make Your Zoosk Account Invisible
Our company is requested which question several times because the beginning our Zoosk coverage. Practical question features two collection of items. Heading invisible so you can here are some other people towards the platform with out them once you understand and heading hidden as you satisfied anyone plus don’t want to be seen to be nevertheless having fun with matchmaking applications. I’ll protection both circumstances in the way and also make the Zoosk account hidden.
Zoosk is just one of the couple relationships programs that gives the latest power to invisibly take a look at matchmaking markets from the comfort of an effective trace. Usually, brand new application gets a beneficial ‘Seen Me’ area otherwise a version of it where you can here are some whoever has currently searched your aside. It is a useful feature for the majority of but features minimal use. If they searched your away and you can don’t log off a contact, they were not for your requirements anyway.
Another brand of are invisible is essentially move their relationships character off Zoosk whilst you talk about the potential of a match or after you one another agreed to go personal. It is an important part of one relationships as it’s now a significant measure of faith. Get it wrong and you’re likely condemned regarding the away from!
Make your Zoosk account undetectable while you look
Zoosk have a paid solution helpfully named Wade Undetectable. It’s a period-restricted means providing you with your half-hour to find the local sector otherwise have a look at potential matches in your area instead of leaving a shade. The newest look setting and you may Carousel work in equivalent implies typical but the other person cannot observe that you may have seemed her or him out.
This is a helpful element whenever you are bashful or is seeking to connect away someone you think are cheating however, I cannot think of other use for this. The fresh feature costs Zoosk gold coins being separate in Shreveport escort the membership.
• Accessibility Wade Hidden from the diet plan throughout the best leftover of the cell phone display screen at the end under Wade Undetectable.
• To your an internet browser, discover their profile on top best and select Wade Invisible on the dropdown eating plan.
You will need Zoosk coins for it to operate. You happen to be encouraged to shop for them if you don’t have people during the time.
Make your Zoosk account hidden while you’re private
Perhaps the more of good use element, and come up with their Zoosk account hidden while you are with some one. When you have one another accessible to become exclusive in order to not use relationships applications, you don’t want to be found with an active profile. Zoosk provides you with a couple options for that. Cover-up or Stop.
The Cover-up falls under the new Hide & Look for section of Zoosk. An use terminology where you are able to cover up your Zoosk membership of other people to your platform except people your message. Look for try a completely obvious account for instance the usual means. Just be a subscriber to make use of this new Cover-up setting.
1. Find the profile with the a web browser and choose Mask & Look for from the dropdown diet plan.
2. Pick Mask.
It covers their reputation on general Zoosk populace however, often offer you visually noticeable to some one your message. You to notice of caution although. This particular feature only works best for clients. While you are a customer and put your own character to cover up and stop their registration, their character can be visible once more given that authorized months try upwards.
Stop your own Zoosk account
The ultimate way to clean out your character out-of Zoosk will be to pause your account. It eliminates their reputation throughout the app completely. It does keep connections and you can messages but you wouldn’t come into the system anyway.
1. Indication towards the com and choose their character regarding the greatest correct.
2. Select Membership Settings and Membership Condition.
3. Pick Modify and select Stop Account.
4. Confirm and you can complete the procedure plus account usually today getting towards the hold.
1. Discover new Zoosk software.
Each other measures lose their Zoosk membership on the carousel and of social check. It does not remove your bank account otherwise intimate they, simply puts they towards the hold. You’ll keep any fits, all the messages and you may any contacts you made. You can delete the brand new membership at a later date any time you need to otherwise repeat the above to help you unpause your bank account should you should do one.
The individuals certainly are the suggests I understand from and come up with your Zoosk account hidden. Maybe you’ve put her or him? Performed they assist? Work ok? Write to us regarding the skills below!
|
{
"url": "https://simiradiagnostic.com/learning-to-make-your-zoosk-account-invisible/",
"source_domain": "simiradiagnostic.com",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "161968",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4WE42JPEVGAOU6KYQFVZFBRJ3JCZ4LGP",
"WARC-Concurrent-To": "<urn:uuid:f9da98ed-4fd0-42c0-be3d-79c802f4f561>",
"WARC-Date": "2023-12-02T01:56:23Z",
"WARC-IP-Address": "184.168.121.5",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:T362GGSJODKZXW2JV7YQEBHZUXO6PE2U",
"WARC-Record-ID": "<urn:uuid:f7aa04cc-2a8e-4512-ac00-9c63e2944846>",
"WARC-Target-URI": "https://simiradiagnostic.com/learning-to-make-your-zoosk-account-invisible/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b60f8043-8c8e-433c-a673-17cc716f69e3>"
},
"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-63\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,
524,
525,
1034,
1035,
1376,
1377,
1429,
1430,
1823,
1824,
2076,
2077,
2224,
2347,
2348,
2480,
2481,
2533,
2534,
2870,
2871,
3206,
3207,
3308,
3324,
3325,
3713,
3714,
3742,
3743,
3986,
3987,
4078,
4136,
4178,
4279,
4313,
4314,
4738,
4739
],
"line_end_idx": [
46,
47,
524,
525,
1034,
1035,
1376,
1377,
1429,
1430,
1823,
1824,
2076,
2077,
2224,
2347,
2348,
2480,
2481,
2533,
2534,
2870,
2871,
3206,
3207,
3308,
3324,
3325,
3713,
3714,
3742,
3743,
3986,
3987,
4078,
4136,
4178,
4279,
4313,
4314,
4738,
4739,
4944
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4944,
"ccnet_original_nlines": 42,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.49787235260009766,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0031914899591356516,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10531914979219437,
"rps_doc_frac_unique_words": 0.4290865361690521,
"rps_doc_mean_word_length": 4.806490421295166,
"rps_doc_num_sentences": 58,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.29364013671875,
"rps_doc_word_count": 832,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.008502130396664143,
"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.02100525051355362,
"rps_doc_frac_chars_top_3gram": 0.01600399985909462,
"rps_doc_frac_chars_top_4gram": 0.01500375010073185,
"rps_doc_books_importance": -422.6003112792969,
"rps_doc_books_importance_length_correction": -422.6003112792969,
"rps_doc_openwebtext_importance": -231.55862426757812,
"rps_doc_openwebtext_importance_length_correction": -231.55862426757812,
"rps_doc_wikipedia_importance": -206.57403564453125,
"rps_doc_wikipedia_importance_length_correction": -206.57403564453125
},
"fasttext": {
"dclm": 0.044690728187561035,
"english": 0.9486106634140015,
"fineweb_edu_approx": 1.0845911502838135,
"eai_general_math": 0.0441850982606411,
"eai_open_web_math": 0.11516773700714111,
"eai_web_code": 0.02456342987716198
}
}
|
{
"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.3",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social psychology"
}
}
},
"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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,036,970,245,099,286,000 |
What Google’s Quality Score Patent Could Teach Us about Improving Our Websites
google-site-quality-score
Search engine algorithms today are more complex than they used to be. The Site Quality Score Patent that was recently granted to Google is a good example. In general, it aims to enhance search by delivering results based on how relevant they are to user queries.
The patent itself is highly technical; patent writers April Lehman and Navneet Panda did their best to make it as detailed as possible. It’s understandable that they won’t exactly divulge the exact computations – search engines can’t have hackers and scammers suddenly taking advantage of the system.
But what is this patent really about, and what can we learn from it to enhance our SEO efforts?
Site Quality Score Patent Basics
The long and short of it is, a site’s Quality Score is determined by user queries for specific sites vs. how many of those are relevant or associated with the resources within those websites.
A blog post by Bill Slawski delves deeper into this topic. He explains that there are multiple queries that could be accounted for contributing to the site’s quality score. For instance: the query like ‘seo consultant seoexpertpage’ is meant to produce results coming from the domain name seoexpertpage.com. Thus, it will be treated as a navigational query, because it was meant to redirect the user to a particular site.
If there is a sufficient amount of navigational queries that point to a website, it may affect its site quality score.
Another example is a query for ‘seo consultant services’. A user will click on seo-example.com and within seconds, realize that it’s not what they want. They will click on a second website, example.com. Here, they will spend a couple of minutes browsing before finally submitting a contact form.
Search engines like Google will interpret this action as relevant because the user completed an action. That means resources on that site are associated with the user’s queries. If this process is repeated several times a day, over a period of a few months, it will impact that website’s quality score.
However, Bill warns that it’s NOT about site content:
“And the Site Quality Score isn’t about the quality of the content on the pages of the site, but rather about how people tend to search for the site, and what then tend to click upon after performing those queries.”
So what can we do to improve our site quality score WITHOUT touching content?
Tips To Improve Site Quality Score
There are in fact, a couple of practices you can do to enhance the quality of your website without changing its content. As this aspect of the algorithm focuses on the relevancy of queries, look into your keyword usage and see if there’s anything you can improve there. Are you still relying on exact key phrases? Where are you placing them? Are you taking advantage of semantic search?
Smart keyword research using tools like SPYFU would help you save time and effort by focusing only on what works best. There’s no sense in optimizing phrases that are NOT important to your target audience and your industry sector. Don’t forget to search for semantic keywords, which are terms that have similar meaning in context to your keywords.
seoexpertpage-semantic-keywords
Once you have a set of keywords you want to rank for, you need maximize their power. Placing them on strategic positions on your web page ensures your site is both user- and search engine-friendly.
image484
Second, check your on-site elements such as meta titles and H-tags. Are they descriptive? Are you using relevant keywords in them? Search engine crawlers are bots programmed to look for specific information on a website. And if they can’t find what they are looking for, your site may not be crawled and indexed properly. So make sure to address these issues right away.
Next, view your conversions using Analytic tools. Is your site generating leads and/or enough sales? How are people responding to your CTA? What could be the reasons behind low conversion? Remember: when people type in a query, they expect to find answers. And if your site is not providing what they need, there’s no reason to stay on your page. Google’s algorithm can detect these user behaviors and will count them when calculating for your site quality score.
Lastly, look at your overall web design. Is your site easy to navigate? Is it mobile-friendly? Are there prominent buttons or links to direct users on where to go? Google’s Site Quality algorithm counts queries per user, accounting for factors such as device, IP address, and other related information:
“Additionally, the system can use user information or user device information when counting unique queries. For example, the same query can be counted as two unique queries if it is identified as having been submitted by two different users. In this context, whether a query is the same query can be determined with or without regard to the order of the query terms, as described above. The system can identify a user based on, e.g., a user being logged into a user account, an Internet protocol address associated with the user device being used by user, or by using information provided by the user device, e.g., an Internet cookie.”
As there are more mobile searches now compared to previous years, you can expect the bulk of queries to come from those devices.
Note: just because the Site Quality Score doesn’t place an emphasis on content does NOT mean you shouldn’t put your best foot forward. Work on enhancing your site’s content still, because it’s important for your website visitors – not just to search engines.
Final Words
Just because users search for brand names does NOT immediately mean that it is going to be counted in their site quality scores. Search engine algorithms are complex; they consider multiple elements before producing an outcome. As user behaviors are also unpredictable, it’s possible that your site’s score will vary in time.
However, we as SEO services are sure of ONE thing: market for users, NOT search engines. When you do so, your quality score will just follow.
Tagged under:
Leave a Reply
Your email address will not be published.
|
{
"url": "https://www.seoexpertpage.com/google-quality-score-patent/",
"source_domain": "www.seoexpertpage.com",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "95526",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Z4HAGGGZEOBOPGS4OLWSF4Y4MUXZTSGW",
"WARC-Concurrent-To": "<urn:uuid:79f3d1ae-96d5-47ea-a770-71d0a89de9e5>",
"WARC-Date": "2017-10-23T22:42:42Z",
"WARC-IP-Address": "209.59.129.74",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NKNIBOWSQ7NWKSOEVDA5AAP5HGSVOKBK",
"WARC-Record-ID": "<urn:uuid:3a27f423-4dd0-46a4-9c2a-b1820582ac81>",
"WARC-Target-URI": "https://www.seoexpertpage.com/google-quality-score-patent/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e44e137c-57c4-4534-a011-6b425e09499e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-145-0-250.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-43\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for October 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,
79,
80,
106,
107,
370,
371,
672,
673,
769,
770,
803,
804,
996,
997,
1419,
1420,
1539,
1540,
1836,
1837,
2140,
2141,
2195,
2196,
2412,
2413,
2491,
2492,
2527,
2528,
2915,
2916,
3264,
3265,
3297,
3298,
3496,
3497,
3506,
3507,
3878,
3879,
4343,
4344,
4647,
4648,
5284,
5285,
5414,
5415,
5674,
5675,
5687,
5688,
6014,
6015,
6157,
6158,
6172,
6173,
6187,
6188
],
"line_end_idx": [
79,
80,
106,
107,
370,
371,
672,
673,
769,
770,
803,
804,
996,
997,
1419,
1420,
1539,
1540,
1836,
1837,
2140,
2141,
2195,
2196,
2412,
2413,
2491,
2492,
2527,
2528,
2915,
2916,
3264,
3265,
3297,
3298,
3496,
3497,
3506,
3507,
3878,
3879,
4343,
4344,
4647,
4648,
5284,
5285,
5414,
5415,
5674,
5675,
5687,
5688,
6014,
6015,
6157,
6158,
6172,
6173,
6187,
6188,
6229
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6229,
"ccnet_original_nlines": 62,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4363929033279419,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012077289633452892,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1304347813129425,
"rps_doc_frac_unique_words": 0.4011516273021698,
"rps_doc_mean_word_length": 4.821496963500977,
"rps_doc_num_sentences": 69,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.413689613342285,
"rps_doc_word_count": 1042,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.00676752021536231,
"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.03105095960199833,
"rps_doc_frac_chars_top_3gram": 0.025477709248661995,
"rps_doc_frac_chars_top_4gram": 0.011345540173351765,
"rps_doc_books_importance": -498.6288146972656,
"rps_doc_books_importance_length_correction": -498.6288146972656,
"rps_doc_openwebtext_importance": -244.46932983398438,
"rps_doc_openwebtext_importance_length_correction": -244.46932983398438,
"rps_doc_wikipedia_importance": -169.42909240722656,
"rps_doc_wikipedia_importance_length_correction": -169.42909240722656
},
"fasttext": {
"dclm": 0.03520328179001808,
"english": 0.9415340423583984,
"fineweb_edu_approx": 1.719529151916504,
"eai_general_math": 0.025511499494314194,
"eai_open_web_math": 0.08617526292800903,
"eai_web_code": 0.032558079808950424
}
}
|
{
"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": "658.8",
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,110,269,337,817,038,000 |
Twisted: Ticket #2983: Separate the concerns in twisted.web request processing to allow easier testability https://twistedmatrix.com/trac/ticket/2983 <p> We want twisted.web to have better unit tests, and we also want to be able to use twisted.web request-processing code easily in our unit tests for our resources. We should improve this situation by separating the concerns in request processing to allow using fewer parts of it at once. </p> <p> The change proposed here is basically separating the concepts of Request and Response, and moving the data serialization code to the HTTP Channel (i.e. the protocol implementation). </p> <p> This is kind of a major change for twisted.web, but we would like to do it without breaking backwards compatibility. </p> <p> The idea is that the HTTP Channel will pass requests off to its "HTTP Request Receiver" object. This will likely be the L{twisted.web.server.Site}. This will look up a resource for the request, render it, and return a Response object. The channel will then tell the response to write its body to the channel; the response will write the data (optionally registering itself as a producer) to the channel in a protocol-agnostic manner (i.e., chunking and stuff will be the responsibility of the channel). </p> <p> At the end of this change, Request should have no required parameters. Of course, it will still remain compatible with guys who pass arguments to it, and directly call request.write and request.finish; these will be implemented by creating a BackwardsCompatibilityResponse at request._bcResponse. request.write and request.finish will probably require having a request that had a channel passed to it. </p> en-us Twisted https://twistedmatrix.com/trac/chrome/common/trac_banner.png https://twistedmatrix.com/trac/ticket/2983 Trac 1.2 radix Tue, 08 Jan 2008 01:28:02 GMT description changed https://twistedmatrix.com/trac/ticket/2983#comment:1 https://twistedmatrix.com/trac/ticket/2983#comment:1 <ul> <li><strong>description</strong> modified (<a href="/trac/ticket/2983?action=diff&version=1">diff</a>) </li> </ul> Ticket radix Tue, 08 Jan 2008 01:36:50 GMT branch, author set https://twistedmatrix.com/trac/ticket/2983#comment:2 https://twistedmatrix.com/trac/ticket/2983#comment:2 <ul> <li><strong>branch</strong> set to <em>branches/web-concerns-2983</em> </li> <li><strong>author</strong> set to <em>radix</em> </li> </ul> <p> (In <a class="missing changeset" title="No changeset 22290 in the repository">[22290]</a>) Branching to 'web-concerns-2983' </p> Ticket radix Tue, 08 Jan 2008 03:54:10 GMT description changed https://twistedmatrix.com/trac/ticket/2983#comment:3 https://twistedmatrix.com/trac/ticket/2983#comment:3 <ul> <li><strong>description</strong> modified (<a href="/trac/ticket/2983?action=diff&version=3">diff</a>) </li> </ul> Ticket Jean-Paul Calderone Mon, 08 Sep 2008 20:59:40 GMT branch, author changed https://twistedmatrix.com/trac/ticket/2983#comment:4 https://twistedmatrix.com/trac/ticket/2983#comment:4 <ul> <li><strong>branch</strong> changed from <em>branches/web-concerns-2983</em> to <em>branches/web-concerns-2983-2</em> </li> <li><strong>author</strong> changed from <em>radix</em> to <em>exarkun</em> </li> </ul> <p> (In <a class="missing changeset" title="No changeset 24744 in the repository">[24744]</a>) Branching to 'web-concerns-2983-2' </p> Ticket Jean-Paul Calderone Mon, 08 Sep 2008 21:10:37 GMT author changed https://twistedmatrix.com/trac/ticket/2983#comment:5 https://twistedmatrix.com/trac/ticket/2983#comment:5 <ul> <li><strong>author</strong> changed from <em>exarkun</em> to <em>radix, exarkun</em> </li> </ul> Ticket Jean-Paul Calderone Mon, 08 Sep 2008 21:12:25 GMT author changed https://twistedmatrix.com/trac/ticket/2983#comment:6 https://twistedmatrix.com/trac/ticket/2983#comment:6 <ul> <li><strong>author</strong> changed from <em>radix, exarkun</em> to <em>radix</em> </li> </ul> Ticket <automation> Mon, 14 Feb 2011 04:30:49 GMT owner deleted https://twistedmatrix.com/trac/ticket/2983#comment:7 https://twistedmatrix.com/trac/ticket/2983#comment:7 <ul> <li><strong>owner</strong> <em>radix</em> deleted </li> </ul> Ticket
|
{
"url": "http://twistedmatrix.com/trac/ticket/2983?format=rss",
"source_domain": "twistedmatrix.com",
"snapshot_id": "crawl=CC-MAIN-2017-09",
"warc_metadata": {
"Content-Length": "7456",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7JEY2RPFYLGQGQMGPUOE4STMI4RLW4AH",
"WARC-Concurrent-To": "<urn:uuid:6a2b7814-b383-4edb-a2e1-9bbb971625e3>",
"WARC-Date": "2017-02-22T01:32:59Z",
"WARC-IP-Address": "66.35.39.66",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:DCO4GM7JHAQIRODSRVZWHTYXBB66THUC",
"WARC-Record-ID": "<urn:uuid:7b841759-fb9c-4a9f-b2a8-d3f6ed678fd1>",
"WARC-Target-URI": "http://twistedmatrix.com/trac/ticket/2983?format=rss",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1f74a2ae-ca23-4d50-ba2b-b6cb2545b7db>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-10-108.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-09\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for February 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
],
"line_end_idx": [
4175
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4175,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.0004790399980265647,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1711469441652298,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009856630116701126,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.448924720287323,
"rps_doc_frac_unique_words": 0.42417582869529724,
"rps_doc_mean_word_length": 7,
"rps_doc_num_sentences": 49,
"rps_doc_symbol_to_word_ratio": 0.01344086043536663,
"rps_doc_unigram_entropy": 4.820499420166016,
"rps_doc_word_count": 455,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08351647853851318,
"rps_doc_frac_chars_dupe_6grams": 0.07817895710468292,
"rps_doc_frac_chars_dupe_7grams": 0.06373625993728638,
"rps_doc_frac_chars_dupe_8grams": 0.052747249603271484,
"rps_doc_frac_chars_dupe_9grams": 0.052747249603271484,
"rps_doc_frac_chars_top_2gram": 0.008791210129857063,
"rps_doc_frac_chars_top_3gram": 0.015698589384555817,
"rps_doc_frac_chars_top_4gram": 0.01224489975720644,
"rps_doc_books_importance": -508.5355224609375,
"rps_doc_books_importance_length_correction": -508.5355224609375,
"rps_doc_openwebtext_importance": -276.47393798828125,
"rps_doc_openwebtext_importance_length_correction": -276.47393798828125,
"rps_doc_wikipedia_importance": -154.20497131347656,
"rps_doc_wikipedia_importance_length_correction": -154.20497131347656
},
"fasttext": {
"dclm": 0.03291774168610573,
"english": 0.6789466142654419,
"fineweb_edu_approx": 1.7006738185882568,
"eai_general_math": 0.015146549791097641,
"eai_open_web_math": 0.1521540880203247,
"eai_web_code": 0.11472755670547485
}
}
|
{
"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": "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": "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": "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": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,804,741,304,510,839,300 |
sammaye/yii2-audittrail
A port of audit trail
Installs: 6 964
Dependents: 3
Stars: 19
Watchers: 12
Forks: 14
Open Issues: 1
Type: yii2-extension
0.3.0 2015-05-24 12:53 UTC
README
Yii2 edition of the audittrail extension.
How to use
To use this extension you can simply add it to the model's behaviours:
use yii\db\ActiveRecord;
class Model extends ActiveRecord
{
public function behaviors()
{
return [
'sammaye\audittrail\LoggableBehavior'
];
}
}
You can convert the entered behaviour into a key - value structure to define options for the extension for that model:
class Model extends ActiveRecord
{
public function behaviors()
{
return [
'LoggableBehavior' => [
'class' => 'sammaye\audittrail\LoggableBehavior',
'ignored' => ['some_field'], // This ignores fields from a selection of all fields, not needed with allowed
'allowed' => ['another_field'] // optional, not needed if you use ignore
]
];
}
}
And that is basically how to setup this extension.
Changes
There are a couple of changes.
One of them is how to define global parameters for this extension.
An example of global parameters would be setting you own table name or defining the location of the user model.
To define your own table you can add a parameter to your params.php file called audittrail.table which would take something like {{%audit}}.
To define your own user model location you can add audittrail.model using a value like common\models\User.
The only other change is really to do with the best way to query the audit trail.
The below example is the one from the previous documentation rewritten for Yii2:
<?php
use yii\data\ActiveDataProvider;
use sammaye\audittrail\AuditTrail;
use common\models\Title;
use common\models\Product;
$model_ids = array(array($model->id, Title::className()));
foreach($model->products as $id => $product){
$model_ids[] = array($product->id, Product::className());
}
$criteria = AuditTrail::find();
$param_id = 0;
// $model_ids is the one you built in your original code
foreach( $model_ids as $id_pair ) {
$criteria->orWhere('model_id = :id' . $param_id . ' AND model = :model' . $param_id);
$criteria->addParams([
':id' . $param_id => $id_pair[0],
':model' . $param_id => $id_pair[1]
]);
$param_id++;
}
$criteria->orderBy(['stamp' => SORT_DESC]);
echo yii\grid\GridView::widget([
'dataProvider' => new ActiveDataProvider([
'query' => $criteria,
'pagination' => [
'pageSize' => 100,
]
]),
'columns' => [
[
'label' => 'Author',
'value' => function($model, $index, $widget){
return $model->user ? $model->user->email : "";
}
],
[
'attribute' => 'model',
'value' => function($model, $index, $widget){
$p = explode('\\', $model->model);
return end($p);
}
],
'model_id',
'action',
[
'label' => 'field',
'value' => function($model, $index, $widget){
return $model->getParent()->getAttributeLabel($model->field);
}
],
'old_value',
'new_value',
[
'label' => 'Date Changed',
'value' => function($model, $index, $widget){
return date("d-m-Y H:i:s", strtotime($model->stamp));
}
]
]
]); ?>
Notice the:
[
'attribute' => 'model',
'value' => function($model, $index, $widget){
$p = explode('\\', $model->model);
return end($p);
}
],
This allows us to get the name of the model without the namespace part on it.
Currently in this extension I store the fully qualified name of the class to:
• Take advantage of namespacing to create uniqueness
• To make it easier to query using the className() function in Objects.
Migration
There are two ways of doing this:
Resources
|
{
"url": "https://packagist.org/packages/sammaye/yii2-audittrail",
"source_domain": "packagist.org",
"snapshot_id": "crawl=CC-MAIN-2015-48",
"warc_metadata": {
"Content-Length": "23740",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JCJFE7SQ335ZNROMLK4ELSC4OCMVSOWW",
"WARC-Concurrent-To": "<urn:uuid:390e0c61-4747-408a-9774-66760bb62882>",
"WARC-Date": "2015-11-30T00:53:11Z",
"WARC-IP-Address": "87.98.253.214",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:WLKUH7E32TWFB5OPM45T47RXQSWTEUQO",
"WARC-Record-ID": "<urn:uuid:73332b1d-ccbc-4a61-a374-9f7e7aff26b8>",
"WARC-Target-URI": "https://packagist.org/packages/sammaye/yii2-audittrail",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ab2b86ff-1f76-4122-8342-b9149d221c22>"
},
"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,
24,
25,
47,
48,
64,
65,
79,
80,
90,
91,
104,
105,
115,
116,
131,
132,
153,
154,
181,
182,
189,
190,
232,
233,
244,
245,
316,
317,
342,
343,
376,
378,
410,
416,
433,
483,
494,
500,
502,
503,
622,
623,
656,
658,
690,
696,
713,
749,
815,
939,
1028,
1042,
1053,
1059,
1061,
1062,
1113,
1114,
1122,
1123,
1154,
1155,
1222,
1223,
1335,
1336,
1477,
1478,
1585,
1586,
1668,
1669,
1750,
1751,
1757,
1790,
1825,
1850,
1877,
1878,
1937,
1983,
2045,
2047,
2048,
2080,
2095,
2096,
2153,
2189,
2279,
2306,
2349,
2393,
2401,
2418,
2420,
2464,
2465,
2498,
2545,
2575,
2601,
2632,
2642,
2650,
2669,
2679,
2712,
2770,
2834,
2848,
2859,
2869,
2905,
2963,
3014,
3046,
3060,
3071,
3091,
3109,
3119,
3151,
3209,
3287,
3301,
3312,
3333,
3354,
3364,
3403,
3461,
3531,
3545,
3555,
3561,
3568,
3569,
3581,
3582,
3584,
3612,
3662,
3705,
3729,
3735,
3738,
3739,
3817,
3818,
3896,
3897,
3952,
4026,
4027,
4037,
4038,
4072,
4073
],
"line_end_idx": [
24,
25,
47,
48,
64,
65,
79,
80,
90,
91,
104,
105,
115,
116,
131,
132,
153,
154,
181,
182,
189,
190,
232,
233,
244,
245,
316,
317,
342,
343,
376,
378,
410,
416,
433,
483,
494,
500,
502,
503,
622,
623,
656,
658,
690,
696,
713,
749,
815,
939,
1028,
1042,
1053,
1059,
1061,
1062,
1113,
1114,
1122,
1123,
1154,
1155,
1222,
1223,
1335,
1336,
1477,
1478,
1585,
1586,
1668,
1669,
1750,
1751,
1757,
1790,
1825,
1850,
1877,
1878,
1937,
1983,
2045,
2047,
2048,
2080,
2095,
2096,
2153,
2189,
2279,
2306,
2349,
2393,
2401,
2418,
2420,
2464,
2465,
2498,
2545,
2575,
2601,
2632,
2642,
2650,
2669,
2679,
2712,
2770,
2834,
2848,
2859,
2869,
2905,
2963,
3014,
3046,
3060,
3071,
3091,
3109,
3119,
3151,
3209,
3287,
3301,
3312,
3333,
3354,
3364,
3403,
3461,
3531,
3545,
3555,
3561,
3568,
3569,
3581,
3582,
3584,
3612,
3662,
3705,
3729,
3735,
3738,
3739,
3817,
3818,
3896,
3897,
3952,
4026,
4027,
4037,
4038,
4072,
4073,
4082
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4082,
"ccnet_original_nlines": 160,
"rps_doc_curly_bracket": 0.006369430106133223,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.19347037374973297,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009673519991338253,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.44135430455207825,
"rps_doc_frac_unique_words": 0.5291262269020081,
"rps_doc_mean_word_length": 5.961164951324463,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.012967586517334,
"rps_doc_word_count": 412,
"rps_doc_frac_chars_dupe_10grams": 0.05781758949160576,
"rps_doc_frac_chars_dupe_5grams": 0.14780129492282867,
"rps_doc_frac_chars_dupe_6grams": 0.10504885762929916,
"rps_doc_frac_chars_dupe_7grams": 0.10504885762929916,
"rps_doc_frac_chars_dupe_8grams": 0.10504885762929916,
"rps_doc_frac_chars_dupe_9grams": 0.05781758949160576,
"rps_doc_frac_chars_top_2gram": 0.03664495050907135,
"rps_doc_frac_chars_top_3gram": 0.046824101358652115,
"rps_doc_frac_chars_top_4gram": 0.05903908982872963,
"rps_doc_books_importance": -407.5143737792969,
"rps_doc_books_importance_length_correction": -407.5143737792969,
"rps_doc_openwebtext_importance": -246.23072814941406,
"rps_doc_openwebtext_importance_length_correction": -246.23072814941406,
"rps_doc_wikipedia_importance": -206.5478057861328,
"rps_doc_wikipedia_importance_length_correction": -206.5478057861328
},
"fasttext": {
"dclm": 0.1607053279876709,
"english": 0.4948267936706543,
"fineweb_edu_approx": 2.399331569671631,
"eai_general_math": 0.777082085609436,
"eai_open_web_math": 0.29588043689727783,
"eai_web_code": 0.7718952298164368
}
}
|
{
"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": "-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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-654,991,051,436,126,200 |
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.
Anyone know if I can assign a keyboard shortcut such as Ctrl + F4 (for closing the current tab in IE/Firefix etc) to the Microsoft Keyboard favourite keys 1-5.
I have Microsoft Keyboard software installed and I can only browse to applications I want to run and cant seem to see anywhere else where I can assign shortcuts.
share|improve this question
Should be closed as 'notprogrammingrelated'. – George Stocker Jan 19 '09 at 22:26
Maybe, but it's the right answer ;) – CheGueVerra Jan 20 '09 at 22:23
4 Answers 4
Unlock the Function button on top of the Numkey pad, then use the F6/Close key ;)
share|improve this answer
Have fun with your new SO addiction ;) – CheGueVerra Jan 19 '09 at 20:34
trouble is it takes 2 button presses - was just looking for a single button press maybe using the user defined buttons 1 to 5 to quickly close tabs / windows etc.
share|improve this answer
It takes 2 buttons presses if you enabled disable it all the time, mine is not on to use the features. – CheGueVerra Jan 21 '09 at 15:12
There is a way! i've done it before! Now I can't figure out how I did it. I had all the media keys configured to Control-alt-home and stuff like that to match with Winamp since the default play pause wasn't working. But I can't figure out howI did it.
share|improve this answer
I found something here:
http://musingsfromtheunderground.blogspot.com/2010/02/using-microsoft-natural-ergonomic.html
which uses Autohotkey to ditch the Intellitype software altogether. Autohotkey can send any kind of key presses, for example,
Send ^{F4}
will send Ctrl+F4. Any other key combination is only up to your imagination, not to mention that you can script almost anything you want with Autohotkey and assign those functions to the favourite keys.
share|improve this answer
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/458930/can-i-assign-keyboard-shortcut-to-the-microsoft-intellitype-keyboard?answertab=votes",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2014-52",
"warc_metadata": {
"Content-Length": "83105",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VYC72L6RXUDTESNG5HLDZJALQDKQJWS4",
"WARC-Concurrent-To": "<urn:uuid:ea77bfaf-25d9-418d-b587-88195383b4e3>",
"WARC-Date": "2014-12-22T08:39:20Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:HQQHPESDBKYUM6DAJRLVC3V32IIVEYAD",
"WARC-Record-ID": "<urn:uuid:009b7719-beb9-42d2-9540-bdc034637b1c>",
"WARC-Target-URI": "http://stackoverflow.com/questions/458930/can-i-assign-keyboard-shortcut-to-the-microsoft-intellitype-keyboard?answertab=votes",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:39213735-5576-40d2-b22e-638a1c723994>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-231-17-201.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-52\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for December 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,
318,
319,
481,
482,
510,
515,
598,
603,
674,
675,
687,
688,
770,
771,
797,
802,
876,
877,
1040,
1041,
1067,
1072,
1210,
1211,
1463,
1464,
1490,
1491,
1515,
1516,
1609,
1610,
1736,
1737,
1748,
1749,
1952,
1953,
1979,
1980,
1992,
1993,
1995,
2003,
2004,
2082,
2083
],
"line_end_idx": [
25,
157,
158,
318,
319,
481,
482,
510,
515,
598,
603,
674,
675,
687,
688,
770,
771,
797,
802,
876,
877,
1040,
1041,
1067,
1072,
1210,
1211,
1463,
1464,
1490,
1491,
1515,
1516,
1609,
1610,
1736,
1737,
1748,
1749,
1952,
1953,
1979,
1980,
1992,
1993,
1995,
2003,
2004,
2082,
2083,
2173
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2173,
"ccnet_original_nlines": 50,
"rps_doc_curly_bracket": 0.0009203900117427111,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35930734872817993,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03463203087449074,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23593074083328247,
"rps_doc_frac_unique_words": 0.5609065294265747,
"rps_doc_mean_word_length": 4.7762041091918945,
"rps_doc_num_sentences": 21,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.970209121704102,
"rps_doc_word_count": 353,
"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.04744958132505417,
"rps_doc_frac_chars_top_3gram": 0.052194539457559586,
"rps_doc_frac_chars_top_4gram": 0.010676160454750061,
"rps_doc_books_importance": -186.99200439453125,
"rps_doc_books_importance_length_correction": -186.99200439453125,
"rps_doc_openwebtext_importance": -106.5934066772461,
"rps_doc_openwebtext_importance_length_correction": -106.5934066772461,
"rps_doc_wikipedia_importance": -75.18072509765625,
"rps_doc_wikipedia_importance_length_correction": -75.18072509765625
},
"fasttext": {
"dclm": 0.1392991542816162,
"english": 0.8976790904998779,
"fineweb_edu_approx": 0.9182103872299194,
"eai_general_math": 0.00004302999877836555,
"eai_open_web_math": 0.06968182325363159,
"eai_web_code": -0.000006079999820940429
}
}
|
{
"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": "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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,504,976,061,290,386,000 |
All posts by Sean Keenan
WeVideo: Creating Captions
WeVideo allows for the creation of captions in videos. Prior to opening your assignment, you will want to make sure to create an account under the Bryn Mawr license. Note that unlike typical captions that can be toggled on and off, WeVideo embeds the text into the video.
1. Login to your WeVideo account.
2. Start by creating a new video or choose an already pre-existing video.
3. Go into the Text tab on the upper toolbar, and then choose the Static folder.
4. Choose the Subtitle text box. Grab and drop the text box onto the Text track. Be default, there should be a track labeled Text when you create a new video. For already-existing projects, you can add another video track for your text, but be aware that the default name will be “Video 3”. You can rename the track to Text, but this is optional. The tracks are intentionally layered so make sure that the subtitles are placed in the top track, otherwise they will not be visible in your video.
5. To change the layout and size of the text, find the Subtitle text box in the track. Double click on the text box within the track or click once and choose the pencil icon that says Open Clip Editor.
6. You can change the text properties by using the toolbar on the left or by maneuvering the text box in the preview window on the right.
7. Make sure to click the blue button labeled Save Changes when you’re finished.
8. Repeat the process for each section of speech in the video.
|
{
"url": "https://techdocs.blogs.brynmawr.edu/author/mkeenan",
"source_domain": "techdocs.blogs.brynmawr.edu",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "50243",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GUIHGUFZCX3L7ISC5N6K4IKMQF7APQ4X",
"WARC-Concurrent-To": "<urn:uuid:a17cfb03-f2ca-418e-857b-cc8ea430107d>",
"WARC-Date": "2022-08-14T03:49:36Z",
"WARC-IP-Address": "165.106.9.105",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OXUQ5ZYI3Q4FW7UUGFV7TNLYNL7UN7RV",
"WARC-Record-ID": "<urn:uuid:2837e9a9-206b-4312-a9ad-07a8f44aa786>",
"WARC-Target-URI": "https://techdocs.blogs.brynmawr.edu/author/mkeenan",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8521ede0-fd8b-4b44-8b59-b04551e4c565>"
},
"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,
25,
26,
53,
54,
326,
327,
363,
439,
522,
1019,
1223,
1364,
1447
],
"line_end_idx": [
25,
26,
53,
54,
326,
327,
363,
439,
522,
1019,
1223,
1364,
1447,
1511
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1511,
"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.42271292209625244,
"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.15141956508159637,
"rps_doc_frac_unique_words": 0.4981818199157715,
"rps_doc_mean_word_length": 4.290909290313721,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.447880268096924,
"rps_doc_word_count": 275,
"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.047457631677389145,
"rps_doc_frac_chars_top_3gram": 0.025423729792237282,
"rps_doc_frac_chars_top_4gram": 0.03050846979022026,
"rps_doc_books_importance": -96.2610855102539,
"rps_doc_books_importance_length_correction": -86.48738098144531,
"rps_doc_openwebtext_importance": -44.55500030517578,
"rps_doc_openwebtext_importance_length_correction": -44.55500030517578,
"rps_doc_wikipedia_importance": -12.541138648986816,
"rps_doc_wikipedia_importance_length_correction": -0.16230593621730804
},
"fasttext": {
"dclm": 0.13452672958374023,
"english": 0.8211699724197388,
"fineweb_edu_approx": 1.5780130624771118,
"eai_general_math": 0.2903591990470886,
"eai_open_web_math": 0.3220010995864868,
"eai_web_code": 0.19251936674118042
}
}
|
{
"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": "791.83",
"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": "-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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,613,779,700,254,976,000 |
MozillaZine
New Theme: NASA Night Launch
Announce and Discuss the Latest Theme and Extension Releases.
Old Shingoshi
Posts: 0
Joined: December 31st, 1969, 5:00 pm
Post Posted August 17th, 2007, 10:26 pm
I am submitting this only for laughs! It's not on topic...
http://www.datalk.com/3371-post.html
Read at your own risk.
Shingoshi
Old Shingoshi
Posts: 0
Joined: December 31st, 1969, 5:00 pm
Post Posted August 17th, 2007, 11:34 pm
Ok. I wasn't really paying attention to the full context of the Console2 topic. I installed it because Seamaiden said it's an extension no one should be without (or something like that). I have been having so many issues with so many things, that I thought having a tool like Console2 would be very helpful. I didn't realize the theming issue until I installed it. So what is the final solution that has been agreed upon to resolve this? Mac, are you going to fix this, or do we have to wait until Phil does. It sounded like he was passing it off to you.
Shingoshi.
Old Shingoshi
Posts: 0
Joined: December 31st, 1969, 5:00 pm
Post Posted August 17th, 2007, 11:56 pm
Hey Mac,
I think you offered to write a css to compensate for the black on black issue with Show MyIP icon. We discussed it back here. http://forums.mozillazine.org/posting.p ... &p=2964606 Could you actually do that?
Shingoshi
Philip Chee
User avatar
Posts: 6475
Joined: March 1st, 2005, 3:03 pm
Post Posted August 18th, 2007, 6:59 am
Shingoshi wrote:Mac, are you going to fix this, or do we have to wait until Phil does. It sounded like he was passing it off to you.
There are two proposed solutions. The one by mcdavis941 involves a small change on my side and a bunch of CSS on his side. The solution suggested to me on #irc involves basically the same css but in a slightly different location in his theme.jar. I'm waiting for a reply as to which he thinks is the better solution.
Phil
Old Shingoshi
Posts: 0
Joined: December 31st, 1969, 5:00 pm
Post Posted August 18th, 2007, 9:49 am
Thanks Philip for the clarification. Sorry for implying that you might not have wanted to take care of this.
Shingoshi
mcdavis
User avatar
Posts: 3195
Joined: December 9th, 2005, 5:51 am
Post Posted August 19th, 2007, 4:54 am
Philip Chee wrote:
Shingoshi wrote:Mac, are you going to fix this, or do we have to wait until Phil does. It sounded like he was passing it off to you.
There are two proposed solutions. The one by mcdavis941 involves a small change on my side and a bunch of CSS on his side. The solution suggested to me on #irc involves basically the same css but in a slightly different location in his theme.jar. I'm waiting for a reply as to which he thinks is the better solution.
Phil
Phil, I've been traveling for a couple days and won't be able to get back to you about this for a couple more. I'll be in touch as soon as I can. Thanks again.
Theme Development is Radical Participation.
NNL Beta Builds for Current and Up-coming Firefox
Dear User: Your Help is Needed
Old Shingoshi
Posts: 0
Joined: December 31st, 1969, 5:00 pm
Post Posted August 19th, 2007, 6:42 am
Enjoy your travels, if you can!
Shingoshi
Old Shingoshi
Posts: 0
Joined: December 31st, 1969, 5:00 pm
Post Posted August 19th, 2007, 11:31 pm
I probably asked for this before, so forgive me. But I really would like you to provide a scrollbar for the tabbar. Either by altering an existing extension, such as Tab Overflow Scrollbar (TOS) (https://addons.mozilla.org/en-US/firefox/addon/3726) or Bookmarks Scrollbar (https://addons.mozilla.org/en-US/firefox/addon/2600), which I have found to provide scrolling for other things as well. TOS won't work with Tab Mix Plus, and the author doesn't care that it doesn't. I don't know which of the two would be simpler to modify, but one of them might be the solution.
Shingoshi
Old Shingoshi
Posts: 0
Joined: December 31st, 1969, 5:00 pm
Post Posted August 20th, 2007, 2:45 am
Philip,
I don't know if this is related to the Night Launch theme or not. If it has been discussed, please ignore this. If not, I need to inform you that Console2 also interferes with the functioning of Searchbar Autosizer (https://addons.mozilla.org/en-US/firefox/addon/1172).
As Console2 conflicts with this extension also, I think this is the issue of your extension, and should not be passed on to the author of Searchbar Autosizer. I am guessing, although maybe erroneously, that it conflicts with other extensions as well. I think the common point is that it conflicts with extensions which themselves interact with the user interface. If that is true, the issue of fixings these things should reside with you.
If all of these errors only occur with Console2 installed in Night Launch, I imagine that may lessen the burden on you fixing this. However, if these results are common to more than one extension, it does not. I have written the author of Searchbar Autosizer, to determine if he is getting recent complaints of it not working. I have done this to determine if this is only limited to this theme or not.
Shingoshi
Philip Chee
User avatar
Posts: 6475
Joined: March 1st, 2005, 3:03 pm
Post Posted August 20th, 2007, 3:44 am
Please repost in this thread: [Ext] Console² 0.3.8 [2007-08-14]. Also please be specific as to the exact nature of the interference. Thanks.
Phil
Old Shingoshi
Posts: 0
Joined: December 31st, 1969, 5:00 pm
Post Posted August 20th, 2007, 4:02 am
Philip Chee wrote:Please repost in this thread: [Ext] Console² 0.3.8 [2007-08-14]. Also please be specific as to the exact nature of the interference. Thanks.
Phil
Sorry I wasn't specific. Console2 eliminates the resizing of the searchbox. I will repost it as requested.
reposted here: http://forums.mozillazine.org/viewtopic ... 41#3019941
Shingoshi
mcdavis
User avatar
Posts: 3195
Joined: December 9th, 2005, 5:51 am
Post Posted August 20th, 2007, 4:18 am
Shingoshi wrote:Hey Mac,
I think you offered to write a css to compensate for the black on black issue with Show MyIP icon. We discussed it back here. http://forums.mozillazine.org/posting.p ... &p=2964606 Could you actually do that?
Shingoshi
It seemed like it would be possible to change the color of the statusbar in the area behind the icon for better contrast and hence visibility.
So Shingoshi, when are you going to start learning CSS? It's not that hard and you're talking with the right bunch of people to learn. It seems like you're chomping at the bit to make a contribution and make a difference, and CSS could be a good place to start.
I'm assuming you don't already know CSS, otherwise you wouldn't have been able to tolerate mismatches in appearance between Firefox and extensions I don't yet have explicit rules to handle.
Theme Development is Radical Participation.
NNL Beta Builds for Current and Up-coming Firefox
Dear User: Your Help is Needed
Old Shingoshi
Posts: 0
Joined: December 31st, 1969, 5:00 pm
Post Posted August 20th, 2007, 5:15 am
mcdavis941 wrote:
Shingoshi wrote:Hey Mac,
I think you offered to write a css to compensate for the black on black issue with Show MyIP icon. We discussed it back here. http://forums.mozillazine.org/posting.p ... &p=2964606 Could you actually do that?
Shingoshi
It seemed like it would be possible to change the color of the statusbar in the area behind the icon for better contrast and hence visibility.
So Shingoshi, when are you going to start learning CSS? It's not that hard and you're talking with the right bunch of people to learn. It seems like you're chomping at the bit to make a contribution and make a difference, and CSS could be a good place to start.
I'm assuming you don't already know CSS, otherwise you wouldn't have been able to tolerate mismatches in appearance between Firefox and extensions I don't yet have explicit rules to handle.
If you are saying that you would help me to learn how to write CSS, I am eager to learn (especially from the best)!
Shingoshi
mcdavis
User avatar
Posts: 3195
Joined: December 9th, 2005, 5:51 am
Post Posted August 20th, 2007, 5:24 am
Philip Chee wrote:
mcdavis941 wrote:All I had to do was edit your richlistbox.xml in the inner jar (console2.jar) by replacing the <content> tag for the first binding with the line:
<content fromConsole2="true">
because any attributes on the content tag in the binding are applied to the bound element itself.
OK I am planning to use <content Console2themeable="true"> but in the mean time Neil over on #irc said:
NeilAway> why can't NASA write his own version of chrome://console2/skin/richlistbox.css ?
NeilAway> just add skin console2 nightlaunch/1.0 jar:whatever! to the chrome.manifest
Would this be a better solution?
Phil
Phil,
My preference would be to go with <content Console2themeable="true">. This seems to be working and it'll get me what I need. Also, if I redirect chrome://console2/skin/ into my theme, then I would also need to pull in versions of your other CSS files and icons (right?), which would be extra work I'd rather avoid.
Or was Neil suggesting something else? If by any chance you saved more of your IRC chat with Neil, I'd be interested in seeing what else if anything was said.
Unless I'm missing something, since adding the Console2themeable attribute is not much work on your part, that's what I'd like to go with.
Theme Development is Radical Participation.
NNL Beta Builds for Current and Up-coming Firefox
Dear User: Your Help is Needed
kernal7
Posts: 4
Joined: August 9th, 2007, 6:09 pm
Location: Hill Country
Post Posted August 20th, 2007, 6:08 am
I was able to test NNL on a new disk with a clean install of OS X 10.4.10 and no previous Firefox install. Still the same text and background color combination of light blue background with gray text in both TMP session manager dropdown box and with add a bookmark dropdown box. Thus it appears the color combination is not the result of a previously installed theme. Again, as one begins to type, the background color changes to black, so it is just a minor nit.
Return to Extension/Theme Releases
Who is online
Users browsing this forum: No registered users and 0 guests
|
{
"url": "http://forums.mozillazine.org/viewtopic.php?p=3020003",
"source_domain": "forums.mozillazine.org",
"snapshot_id": "crawl=CC-MAIN-2019-43",
"warc_metadata": {
"Content-Length": "52496",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2P3X5JYZ5TJ7MHSBLGK4RLPKC7DWQCP7",
"WARC-Concurrent-To": "<urn:uuid:5dea4b25-2130-4d8f-b6ff-82e72bbeed7b>",
"WARC-Date": "2019-10-16T10:30:00Z",
"WARC-IP-Address": "140.211.166.86",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:6VD634WARTRIPSTEIJAR4DXBBCRIJVPL",
"WARC-Record-ID": "<urn:uuid:71a78ff0-9098-4b89-a101-f6fb0185cffa>",
"WARC-Target-URI": "http://forums.mozillazine.org/viewtopic.php?p=3020003",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8cda9132-a4f1-4b3d-b732-cb1fe23f4872>"
},
"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-179.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,
12,
13,
42,
43,
105,
119,
121,
130,
167,
168,
208,
209,
268,
305,
328,
329,
339,
340,
354,
356,
365,
402,
403,
443,
444,
999,
1000,
1011,
1012,
1026,
1028,
1037,
1074,
1075,
1115,
1116,
1125,
1334,
1335,
1345,
1346,
1358,
1359,
1371,
1373,
1385,
1418,
1419,
1458,
1459,
1592,
1909,
1910,
1915,
1916,
1930,
1932,
1941,
1978,
1979,
2018,
2019,
2128,
2129,
2139,
2140,
2148,
2149,
2161,
2163,
2175,
2211,
2212,
2251,
2252,
2271,
2404,
2721,
2722,
2727,
2728,
2729,
2889,
2933,
2983,
3014,
3015,
3029,
3031,
3040,
3077,
3078,
3117,
3118,
3150,
3151,
3161,
3162,
3176,
3178,
3187,
3224,
3225,
3265,
3266,
3835,
3836,
3846,
3847,
3861,
3863,
3872,
3909,
3910,
3949,
3950,
3958,
4228,
4229,
4668,
4669,
5072,
5073,
5083,
5084,
5096,
5097,
5109,
5111,
5123,
5156,
5157,
5196,
5197,
5338,
5339,
5344,
5345,
5359,
5361,
5370,
5407,
5408,
5447,
5448,
5607,
5608,
5613,
5614,
5615,
5722,
5723,
5793,
5794,
5804,
5805,
5813,
5814,
5826,
5828,
5840,
5876,
5877,
5916,
5917,
5942,
6151,
6152,
6162,
6163,
6164,
6307,
6308,
6570,
6571,
6761,
6805,
6855,
6886,
6887,
6901,
6903,
6912,
6949,
6950,
6989,
6990,
7008,
7033,
7242,
7243,
7253,
7254,
7255,
7398,
7399,
7661,
7662,
7852,
7853,
7854,
7970,
7971,
7981,
7982,
7990,
7991,
8003,
8005,
8017,
8053,
8054,
8093,
8094,
8113,
8276,
8277,
8307,
8308,
8406,
8510,
8601,
8687,
8720,
8721,
8726,
8727,
8728,
8734,
8735,
9050,
9051,
9210,
9211,
9350,
9394,
9444,
9475,
9476,
9484,
9486,
9495,
9529,
9552,
9553,
9592,
9593,
10057,
10058,
10093,
10094,
10095,
10109,
10110
],
"line_end_idx": [
12,
13,
42,
43,
105,
119,
121,
130,
167,
168,
208,
209,
268,
305,
328,
329,
339,
340,
354,
356,
365,
402,
403,
443,
444,
999,
1000,
1011,
1012,
1026,
1028,
1037,
1074,
1075,
1115,
1116,
1125,
1334,
1335,
1345,
1346,
1358,
1359,
1371,
1373,
1385,
1418,
1419,
1458,
1459,
1592,
1909,
1910,
1915,
1916,
1930,
1932,
1941,
1978,
1979,
2018,
2019,
2128,
2129,
2139,
2140,
2148,
2149,
2161,
2163,
2175,
2211,
2212,
2251,
2252,
2271,
2404,
2721,
2722,
2727,
2728,
2729,
2889,
2933,
2983,
3014,
3015,
3029,
3031,
3040,
3077,
3078,
3117,
3118,
3150,
3151,
3161,
3162,
3176,
3178,
3187,
3224,
3225,
3265,
3266,
3835,
3836,
3846,
3847,
3861,
3863,
3872,
3909,
3910,
3949,
3950,
3958,
4228,
4229,
4668,
4669,
5072,
5073,
5083,
5084,
5096,
5097,
5109,
5111,
5123,
5156,
5157,
5196,
5197,
5338,
5339,
5344,
5345,
5359,
5361,
5370,
5407,
5408,
5447,
5448,
5607,
5608,
5613,
5614,
5615,
5722,
5723,
5793,
5794,
5804,
5805,
5813,
5814,
5826,
5828,
5840,
5876,
5877,
5916,
5917,
5942,
6151,
6152,
6162,
6163,
6164,
6307,
6308,
6570,
6571,
6761,
6805,
6855,
6886,
6887,
6901,
6903,
6912,
6949,
6950,
6989,
6990,
7008,
7033,
7242,
7243,
7253,
7254,
7255,
7398,
7399,
7661,
7662,
7852,
7853,
7854,
7970,
7971,
7981,
7982,
7990,
7991,
8003,
8005,
8017,
8053,
8054,
8093,
8094,
8113,
8276,
8277,
8307,
8308,
8406,
8510,
8601,
8687,
8720,
8721,
8726,
8727,
8728,
8734,
8735,
9050,
9051,
9210,
9211,
9350,
9394,
9444,
9475,
9476,
9484,
9486,
9495,
9529,
9552,
9553,
9592,
9593,
10057,
10058,
10093,
10094,
10095,
10109,
10110,
10169
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10169,
"ccnet_original_nlines": 254,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3518356680870056,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.030594410374760628,
"rps_doc_frac_lines_end_with_ellipsis": 0.003921569790691137,
"rps_doc_frac_no_alph_words": 0.2482517510652542,
"rps_doc_frac_unique_words": 0.286556601524353,
"rps_doc_mean_word_length": 4.636202812194824,
"rps_doc_num_sentences": 132,
"rps_doc_symbol_to_word_ratio": 0.003933569882065058,
"rps_doc_unigram_entropy": 5.519750118255615,
"rps_doc_word_count": 1696,
"rps_doc_frac_chars_dupe_10grams": 0.4905252456665039,
"rps_doc_frac_chars_dupe_5grams": 0.5050235390663147,
"rps_doc_frac_chars_dupe_6grams": 0.4935775101184845,
"rps_doc_frac_chars_dupe_7grams": 0.4905252456665039,
"rps_doc_frac_chars_dupe_8grams": 0.4905252456665039,
"rps_doc_frac_chars_dupe_9grams": 0.4905252456665039,
"rps_doc_frac_chars_top_2gram": 0.019076690077781677,
"rps_doc_frac_chars_top_3gram": 0.030522700399160385,
"rps_doc_frac_chars_top_4gram": 0.025181230157613754,
"rps_doc_books_importance": -920.6014404296875,
"rps_doc_books_importance_length_correction": -920.6014404296875,
"rps_doc_openwebtext_importance": -454.7917785644531,
"rps_doc_openwebtext_importance_length_correction": -454.7917785644531,
"rps_doc_wikipedia_importance": -277.9198913574219,
"rps_doc_wikipedia_importance_length_correction": -277.9198913574219
},
"fasttext": {
"dclm": 0.023421049118041992,
"english": 0.9606034159660339,
"fineweb_edu_approx": 1.0620098114013672,
"eai_general_math": 0.020681319758296013,
"eai_open_web_math": 0.1767072081565857,
"eai_web_code": 0.00002443999983370304
}
}
|
{
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,963,569,507,614,876,000 |
Design question: what is the difference between a module and a controller?
Topics: blog, faq
Oct 6, 2009 at 7:36 PM
Hello,
My question is: What is the difference between a module and a controller?
So far, I have two types of requests: 1) get data from a web service, or 2) go to many web services and get the data from each. Both 1) and 2) will format the data into xml or html and return it in the response. Would these activities be accomplished by modules or controllers? Would the later case (get data from many web services) execute a module for each web service?
Thanks in advance.
csharpnewbie
Coordinator
Nov 1, 2009 at 9:41 AM
A module is more powerful and can do anything you like.
A controller is much easier to use, but can only handle URI's looking like this: http://youserver/yourcontroller/yourmethod/yourid
|
{
"url": "http://webserver.codeplex.com/discussions/71158",
"source_domain": "webserver.codeplex.com",
"snapshot_id": "crawl=CC-MAIN-2017-34",
"warc_metadata": {
"Content-Length": "36050",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BZGM2CTHQ5OMVHK3SPT4LJWWUFLT4EAP",
"WARC-Concurrent-To": "<urn:uuid:0a8e8825-8bb1-4e1c-bf31-4885d8d06b3a>",
"WARC-Date": "2017-08-20T19:06:27Z",
"WARC-IP-Address": "65.52.103.72",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:UGP43QH7XOLLM4PNXB3ILFJNOW7O3FSW",
"WARC-Record-ID": "<urn:uuid:b396294f-204e-4096-813a-1ef85cfd851f>",
"WARC-Target-URI": "http://webserver.codeplex.com/discussions/71158",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:da921671-a60b-4205-a9f9-10d37bf636af>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-166-41-69.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-34\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for August 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,
75,
76,
94,
117,
118,
125,
126,
201,
202,
579,
580,
599,
600,
613,
614,
626,
649,
650,
706,
707,
838,
839
],
"line_end_idx": [
75,
76,
94,
117,
118,
125,
126,
201,
202,
579,
580,
599,
600,
613,
614,
626,
649,
650,
706,
707,
838,
839,
840
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 840,
"ccnet_original_nlines": 22,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.39459457993507385,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0324324294924736,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2432432472705841,
"rps_doc_frac_unique_words": 0.6137930750846863,
"rps_doc_mean_word_length": 4.434482574462891,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.276876926422119,
"rps_doc_word_count": 145,
"rps_doc_frac_chars_dupe_10grams": 0.14618973433971405,
"rps_doc_frac_chars_dupe_5grams": 0.14618973433971405,
"rps_doc_frac_chars_dupe_6grams": 0.14618973433971405,
"rps_doc_frac_chars_dupe_7grams": 0.14618973433971405,
"rps_doc_frac_chars_dupe_8grams": 0.14618973433971405,
"rps_doc_frac_chars_dupe_9grams": 0.14618973433971405,
"rps_doc_frac_chars_top_2gram": 0.04354587942361832,
"rps_doc_frac_chars_top_3gram": 0.027993779629468918,
"rps_doc_frac_chars_top_4gram": 0.059097979217767715,
"rps_doc_books_importance": -68.03776550292969,
"rps_doc_books_importance_length_correction": -68.03776550292969,
"rps_doc_openwebtext_importance": -44.25186538696289,
"rps_doc_openwebtext_importance_length_correction": -42.85727310180664,
"rps_doc_wikipedia_importance": -40.53407287597656,
"rps_doc_wikipedia_importance_length_correction": -40.53407287597656
},
"fasttext": {
"dclm": 0.9682459235191345,
"english": 0.8469688892364502,
"fineweb_edu_approx": 2.8947904109954834,
"eai_general_math": 0.9522897005081177,
"eai_open_web_math": 0.05742042884230614,
"eai_web_code": 0.8470211029052734
}
}
|
{
"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": "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": "-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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,717,405,138,663,119,000 |
Kill a named process in win2K not spawned by python
Discussion in 'Python' started by [email protected], Aug 6, 2003.
1. Guest
Can someone give me a clue how to rewrite this kludgy workaround in python?
import os
from win32pdhutil import *
pid = FindPerformanceAttributesByName("WINWORD")[0]
os.system("C:\CMDUtils\kill " + str(pid))
Thanks,
Loren Poulsen
--------------------------------------------------------------------------------------------------------------------
This email and any attachments contain information from CapAnalysis, LLC, which may be confidential and/or privileged. The information is intended to be for the use of the individual or entity named on this email. If you are not the intended recipient, be aware that any disclosure, copying, distribution or use of the contents of this email is prohibited. If you receive this email in error, please notify us by reply email immediately so that we can arrange for the retrieval of the original documents at no cost to you.
, Aug 6, 2003
#1
1. Advertising
2. Syver Enstad Guest
writes:
> Can someone give me a clue how to rewrite this kludgy workaround in
> python?
>
>
> import os
> from win32pdhutil import *
> pid = FindPerformanceAttributesByName("WINWORD")[0]
import win32process, win32api, win32con
handle = win32api.OpenProcess(win32con.SYNCHRONIZE|win32con.PROCESS_QUERY_INFORMATION|win32con.PROCESS_TERMINATE, 1, pid)
win32api.TerminateProcess(handle, 1) # exit status
--
Vennlig hilsen
Syver Enstad
Syver Enstad, Aug 6, 2003
#2
1. Advertising
Want to reply to this thread or ask your own question?
It takes just 2 minutes to sign up (and it's free!). Just click the sign up button to choose a username and then you can ask your own questions on the forum.
Similar Threads
1. Steve W. Jackson
Re: close gui, let spawned process run
Steve W. Jackson, Jul 24, 2003, in forum: Java
Replies:
0
Views:
421
Steve W. Jackson
Jul 24, 2003
2. Replies:
2
Views:
716
3. Peter
Replies:
1
Views:
734
Victor Bazarov
Mar 3, 2004
4. The Dude
Replies:
0
Views:
635
The Dude
Jul 30, 2004
5. Replies:
1
Views:
119
Tad McClellan
May 4, 2005
Loading...
Share This Page
|
{
"url": "http://www.thecodingforums.com/threads/kill-a-named-process-in-win2k-not-spawned-by-python.320665/",
"source_domain": "www.thecodingforums.com",
"snapshot_id": "crawl=CC-MAIN-2014-49",
"warc_metadata": {
"Content-Length": "43581",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:E7Y2NQNQNNIVPVZRGWEFA4GLNE5NMFR5",
"WARC-Concurrent-To": "<urn:uuid:618d37ab-266f-44cc-8646-9a3154173ac0>",
"WARC-Date": "2014-11-27T13:32:06Z",
"WARC-IP-Address": "208.43.125.114",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:FTSMDH7EAQRNV7VY7BOV7JQ2RP2WVYTW",
"WARC-Record-ID": "<urn:uuid:a0b139eb-d792-4e71-90a0-84c170a01f8c>",
"WARC-Target-URI": "http://www.thecodingforums.com/threads/kill-a-named-process-in-win2k-not-spawned-by-python.320665/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:23234f70-f415-4350-b5de-7d48cc94887e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-235-23-156.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-49\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for November 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,
52,
53,
126,
127,
138,
139,
219,
220,
234,
265,
321,
367,
368,
380,
381,
399,
400,
521,
1048,
1054,
1072,
1079,
1098,
1099,
1123,
1124,
1136,
1137,
1211,
1225,
1231,
1237,
1253,
1286,
1344,
1345,
1346,
1390,
1516,
1571,
1572,
1573,
1580,
1581,
1600,
1601,
1618,
1624,
1654,
1661,
1680,
1681,
1736,
1737,
1895,
1911,
1933,
1934,
1977,
1978,
2029,
2042,
2048,
2059,
2067,
2088,
2105,
2119,
2125,
2136,
2144,
2155,
2168,
2174,
2185,
2193,
2212,
2228,
2242,
2255,
2261,
2272,
2280,
2293,
2310,
2324,
2330,
2341,
2349,
2367,
2383,
2394,
2395
],
"line_end_idx": [
52,
53,
126,
127,
138,
139,
219,
220,
234,
265,
321,
367,
368,
380,
381,
399,
400,
521,
1048,
1054,
1072,
1079,
1098,
1099,
1123,
1124,
1136,
1137,
1211,
1225,
1231,
1237,
1253,
1286,
1344,
1345,
1346,
1390,
1516,
1571,
1572,
1573,
1580,
1581,
1600,
1601,
1618,
1624,
1654,
1661,
1680,
1681,
1736,
1737,
1895,
1911,
1933,
1934,
1977,
1978,
2029,
2042,
2048,
2059,
2067,
2088,
2105,
2119,
2125,
2136,
2144,
2155,
2168,
2174,
2185,
2193,
2212,
2228,
2242,
2255,
2261,
2272,
2280,
2293,
2310,
2324,
2330,
2341,
2349,
2367,
2383,
2394,
2395,
2410
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2410,
"ccnet_original_nlines": 93,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23303167521953583,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022624429315328598,
"rps_doc_frac_lines_end_with_ellipsis": 0.010638300329446793,
"rps_doc_frac_no_alph_words": 0.3461538553237915,
"rps_doc_frac_unique_words": 0.5307443141937256,
"rps_doc_mean_word_length": 5.0679612159729,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0.009049770422279835,
"rps_doc_unigram_entropy": 4.8622660636901855,
"rps_doc_word_count": 309,
"rps_doc_frac_chars_dupe_10grams": 0.16985951364040375,
"rps_doc_frac_chars_dupe_5grams": 0.19795657694339752,
"rps_doc_frac_chars_dupe_6grams": 0.19795657694339752,
"rps_doc_frac_chars_dupe_7grams": 0.16985951364040375,
"rps_doc_frac_chars_dupe_8grams": 0.16985951364040375,
"rps_doc_frac_chars_dupe_9grams": 0.16985951364040375,
"rps_doc_frac_chars_top_2gram": 0.022988509386777878,
"rps_doc_frac_chars_top_3gram": 0.015325670130550861,
"rps_doc_frac_chars_top_4gram": 0.011494250036776066,
"rps_doc_books_importance": -160.62408447265625,
"rps_doc_books_importance_length_correction": -160.62408447265625,
"rps_doc_openwebtext_importance": -114.94618225097656,
"rps_doc_openwebtext_importance_length_correction": -114.94618225097656,
"rps_doc_wikipedia_importance": -89.52580261230469,
"rps_doc_wikipedia_importance_length_correction": -89.52580261230469
},
"fasttext": {
"dclm": 0.02137821912765503,
"english": 0.7459377646446228,
"fineweb_edu_approx": 1.1998841762542725,
"eai_general_math": 0.000781829992774874,
"eai_open_web_math": 0.14146071672439575,
"eai_web_code": -0.000006440000106522348
}
}
|
{
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-805,887,275,953,436,200 |
cmMarkAsAdvancedCommand.cxx 1.84 KB
Newer Older
1 2
/*=========================================================================
3
Program: CMake - Cross-Platform Makefile Generator
4 5 6 7 8
Module: $RCSfile$
Language: C++
Date: $Date$
Version: $Revision$
9 10
Copyright (c) 2002 Kitware, Inc., Insight Consortium. All rights reserved.
See Copyright.txt or http://www.cmake.org/HTML/Copyright.html for details.
11
Will Schroeder's avatar
Will Schroeder committed
12 13 14
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notices for more information.
15 16 17 18 19
=========================================================================*/
#include "cmMarkAsAdvancedCommand.h"
// cmMarkAsAdvancedCommand
Ken Martin's avatar
Ken Martin committed
20
bool cmMarkAsAdvancedCommand
21
::InitialPass(std::vector<std::string> const& args, cmExecutionStatus &)
22
{
23
if(args.size() < 1 )
24 25 26 27
{
this->SetError("called with incorrect number of arguments");
return false;
}
28
29 30 31 32 33 34 35 36 37 38 39 40 41
unsigned int i =0;
const char* value = "1";
bool overwrite = false;
if(args[0] == "CLEAR" || args[0] == "FORCE")
{
overwrite = true;
if(args[0] == "CLEAR")
{
value = "0";
}
i = 1;
}
for(; i < args.size(); ++i)
42 43
{
std::string variable = args[i];
Ken Martin's avatar
Ken Martin committed
44
cmCacheManager* manager = this->Makefile->GetCacheManager();
Ken Martin's avatar
Ken Martin committed
45 46
cmCacheManager::CacheIterator it =
manager->GetCacheIterator(variable.c_str());
47
if ( it.IsAtEnd() )
48
{
49
this->Makefile->GetCacheManager()
Brad King's avatar
Brad King committed
50 51
->AddCacheEntry(variable.c_str(), 0, 0,
cmCacheManager::UNINITIALIZED);
52
overwrite = true;
53
}
54 55 56 57 58 59
it.Find(variable.c_str());
if ( it.IsAtEnd() )
{
cmSystemTools::Error("This should never happen...");
return false;
}
60
if ( !it.PropertyExists("ADVANCED") || overwrite )
61 62 63
{
it.SetProperty("ADVANCED", value);
}
64 65 66 67
}
return true;
}
|
{
"url": "https://gitlab.kitware.com/cmake/cmake/-/blame/de955e4b6d969bc25d31752547ac8ccec08060c1/Source/cmMarkAsAdvancedCommand.cxx",
"source_domain": "gitlab.kitware.com",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "93551",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PJNTZMZMY7QNN75SKSZTF5VGDEMBWKHX",
"WARC-Concurrent-To": "<urn:uuid:7899d96a-f1fd-4a9b-8a16-f5ab237fb493>",
"WARC-Date": "2020-07-14T05:59:07Z",
"WARC-IP-Address": "66.162.65.214",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JGMXHQ57WGZLOYCO2CXSFRQFAHCZFXJU",
"WARC-Record-ID": "<urn:uuid:891fe2a9-3082-4697-9531-ce681ecaa8da>",
"WARC-Target-URI": "https://gitlab.kitware.com/cmake/cmake/-/blame/de955e4b6d969bc25d31752547ac8ccec08060c1/Source/cmMarkAsAdvancedCommand.cxx",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a2ad60b3-d32e-4df8-8868-a1ee14008b9c>"
},
"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,
36,
48,
52,
128,
129,
131,
186,
196,
219,
236,
256,
280,
281,
286,
364,
441,
444,
445,
469,
494,
503,
573,
647,
716,
731,
732,
808,
845,
846,
873,
893,
914,
917,
946,
949,
1022,
1025,
1027,
1030,
1053,
1065,
1071,
1136,
1154,
1160,
1163,
1164,
1203,
1224,
1251,
1277,
1324,
1330,
1352,
1379,
1387,
1406,
1414,
1425,
1431,
1461,
1467,
1473,
1509,
1529,
1550,
1553,
1618,
1638,
1659,
1665,
1705,
1756,
1759,
1783,
1786,
1794,
1797,
1837,
1856,
1876,
1882,
1930,
1972,
1975,
1999,
2002,
2010,
2028,
2059,
2083,
2091,
2150,
2170,
2178,
2181,
2236,
2245,
2253,
2294,
2302,
2314,
2320,
2335
],
"line_end_idx": [
36,
48,
52,
128,
129,
131,
186,
196,
219,
236,
256,
280,
281,
286,
364,
441,
444,
445,
469,
494,
503,
573,
647,
716,
731,
732,
808,
845,
846,
873,
893,
914,
917,
946,
949,
1022,
1025,
1027,
1030,
1053,
1065,
1071,
1136,
1154,
1160,
1163,
1164,
1203,
1224,
1251,
1277,
1324,
1330,
1352,
1379,
1387,
1406,
1414,
1425,
1431,
1461,
1467,
1473,
1509,
1529,
1550,
1553,
1618,
1638,
1659,
1665,
1705,
1756,
1759,
1783,
1786,
1794,
1797,
1837,
1856,
1876,
1882,
1930,
1972,
1975,
1999,
2002,
2010,
2028,
2059,
2083,
2091,
2150,
2170,
2178,
2181,
2236,
2245,
2253,
2294,
2302,
2314,
2320,
2335,
2336
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2336,
"ccnet_original_nlines": 104,
"rps_doc_curly_bracket": 0.006849320139735937,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10064239799976349,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03854389861226082,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5438972115516663,
"rps_doc_frac_unique_words": 0.7489539980888367,
"rps_doc_mean_word_length": 5.937238693237305,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0.004282659851014614,
"rps_doc_unigram_entropy": 5.047195911407471,
"rps_doc_word_count": 239,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07188160717487335,
"rps_doc_frac_chars_dupe_6grams": 0.07188160717487335,
"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.021141650155186653,
"rps_doc_frac_chars_top_3gram": 0.033826641738414764,
"rps_doc_frac_chars_top_4gram": 0.0401691310107708,
"rps_doc_books_importance": -153.96511840820312,
"rps_doc_books_importance_length_correction": -153.96511840820312,
"rps_doc_openwebtext_importance": -97.8299789428711,
"rps_doc_openwebtext_importance_length_correction": -97.8299789428711,
"rps_doc_wikipedia_importance": -95.60055541992188,
"rps_doc_wikipedia_importance_length_correction": -95.60055541992188
},
"fasttext": {
"dclm": 0.022851470857858658,
"english": 0.40038251876831055,
"fineweb_edu_approx": 1.0265305042266846,
"eai_general_math": 0.3616054058074951,
"eai_open_web_math": 0.08642137050628662,
"eai_web_code": 0.0031100499909371138
}
}
|
{
"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": "-1",
"label": "Abstain"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,787,691,629,328,401,000 |
The tag has no usage guidance.
learn more… | top users | synonyms
2
votes
1answer
41 views
How to prevent disabling of apps
All my searches on this topic just return results about how to disable (built-in) apps on Android, which is the opposite of what I want. I want to know how it is that some apps do not allow disabling ...
0
votes
0answers
11 views
Disable some permissions requested by an app on ANDROID [duplicate]
Some of the features I really like in iOS is that if you want to download an app that requests microphone access you can disable that permission of accessing microphone by that app (in settings) So ...
0
votes
1answer
72 views
Installed app got replaced with the Andy Android icon and doesn't start
Backstory: I went to pick up my phone to play Clash of Clans. The icon was the Android. When I tapped on it, it said, "app not installed". I went to the app menu and it disappeared. What causes this ...
1
vote
2answers
98 views
Android - Application Manager - Disable multiple apps at once?
Let me first say I am not an Android person and new to this. I am needing to disable applications on 300+ devices. I have a list that they want disabled, now I've been just manually going in and ...
0
votes
0answers
38 views
Ram manager better than Stock ram manager?
In my Samsung Galaxy GT-i8262, it has good configuration to run all apps if and only if there is a good ram manager. Here what I am asking is that is there any app or something that makes my RAM good ...
0
votes
1answer
244 views
Android 4.4.4 lenovo a6000 plus. Apps Not working post encryption
I encrypted my lenovo a6000 plus (with android 4.4.4). Most of the apps (the ones which were installed by me from play store and not pre-installed) are not operating now showing the following error: * ...
0
votes
1answer
1k views
Move apps automatically to SD card [closed]
I have samsung A5, android 5.0.2, not rooted. it supports moving to SD card from application manager. Every time I update an app, it is moved to storage and i have to move it to sd card again. Is ...
0
votes
1answer
185 views
Reenable Setting app on rooted Galaxy S 4G
I need to command my partially rooted Samsung Galaxy S 4G on KitKat 4.4.3, to simply re-enable the core app: settings.apk (a.k.a com.android.settings). After flashing a ROM, I found no settings UI ...
0
votes
1answer
1k views
How to place an link of “application manager” on the home screen?
I'm going many times daily to Application manager in Settings. (Android 4.2.2:) Settings --> More --> Application manager Is it possible to put a link of "Application Manager" on the Home screen in ...
5
votes
1answer
271 views
Moving apps to SD: is there any difference between the function in Settings and the apps offered in the Google Play store?
I noticed several apps in the Google Play store featuring the ability to move apps to the SD card. My Samsung Galaxy Tab 4 has an application manager under Settings, and this application manager ...
0
votes
1answer
96 views
How to read data pertaining to running applications?
On the Android 4.3 Jelly Bean interface of my Samsung Galaxy SIII, I have noticed there seem to be various places where an application's running state is documented. I would like to know what the ...
1
vote
1answer
2k views
Application manager: no SD card present but applications still listed under “SD CARD” and what is USB storage?
The back of my Samsung Galaxy SIII has a slot for inserting an external memory SD card (MicroSD up to 32 GB) next to the SIM card slot, but I never purchased nor inserted any, just double checked just ...
1
vote
0answers
1k views
What does a blue/white arrow on an app icon in app manager mean?
The icon in application manager for one of the applications had a blue and white arrow overlaid on it for a while. Approximately the same time the app's icon disappeared from the home screen (pressing ...
0
votes
1answer
127 views
How can I see what exactly an application does?
I'm a bit surprised I couldn't find this answers myself. I am a major minimalist when it comes to computers (my desktop and laptop both run strip-down Linuces) and I wanted to get rid of some of the ...
3
votes
0answers
622 views
Is it possible to clear-default of an app using an ADB command?
Not sure if that's the place to ask this (maybe stackOverflow is better), but here we go: Background There are plenty of possible commands that you can perform by using ADB. I use many of them on my ...
5
votes
1answer
272 views
Zombie Scramble keeps returning to life!
Scramble, by Zynga (go figure), has apparently figured out how to re-enable notifications for itself without my interaction. I have turned off notifications in the application settings menu for ...
1
vote
3answers
5k views
Reenable Google Play Services after disable
I am developing an app that requires testing without google play services (I'm on a Samsung S3). I've turned google play services off in Application Manager and tested everything. Afterwards, I went ...
1
vote
0answers
93 views
Android System Module Reads Zero Bytes
My Samsung Galaxy Tab 2 started wigging out on me. While I was desperately tapping a Retreat, I think I may have deleted or disabled something. Apps crash frequently since and the "Android System" ...
3
votes
4answers
15k views
Is there any way to block permissions on apps?
I read about being able to revoke permissions on CyanogenMod, but it seems the devs took that ability out. I found some app out on the market for 6$ or so, but it doesn't look like it would be worth ...
19
votes
4answers
136k views
What does the “Force stop” button mean?
When I go to Settings > Applications > Manage Applications > Downloaded I see an application list. If I select some applications I see button "Force stop" active, but some applications have ...
3
votes
1answer
309 views
Is clearing app data the same as uninstalling, reinstalling app?
Hopefully, the title says it all. I know some app developers say that I should uninstall then reinstall their app if experiencing problems or updating, but I wondered if stopping the app and clearing ...
1
vote
1answer
368 views
'Clock' app does not show up in Running Applications
My Nexus S comes with a default clock application where I can set an alarm. When I set an alarm then I see a little clock in my status bar. If I go to 'Manage Applications' or 'Running Services', I ...
4
votes
2answers
373 views
27 MB + 4.2 MB = 28 MB? Where'd my space go?
After getting the "low on space" message on my Nexus One for the umpteenth time, I went to into the "manage applications" screen to uninstall applications I hadn't used recently. I waited for the ...
5
votes
6answers
13k views
Android 2.2: Avoid disappearing of home shortcuts to apps into SD card. Restore app list items
I'm using a Samsung Galaxy i5510. The space in internal memory was just about to finish so I decided to move some apps to the SD card. After I did it a lot of the apps moved (not all of them) ...
4
votes
1answer
3k views
I want to password lock my “Applications” settings, but no other settings
I have an AppLock program that locks certain apps with a PIN. In order for the app to have any effectiveness, I include Settings as an App to lock. Otherwise, I could go to Settings -> ...
0
votes
1answer
541 views
Why is Widgetlocker app evading my task-killer?
The Widgetlocker app (a screen lock replacement app) has a service running which I can see in my app manager (under phone settings), but NOT in my task-killer app (Advanced Task Manager). How is its ...
|
{
"url": "http://android.stackexchange.com/questions/tagged/application-manager",
"source_domain": "android.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2016-22",
"warc_metadata": {
"Content-Length": "118878",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YLSXSSVLIS25WCX6JPYDNNP3OJUCQYY4",
"WARC-Concurrent-To": "<urn:uuid:d3c49a28-f93e-4772-91f1-84b36a562ef5>",
"WARC-Date": "2016-05-29T19:27:40Z",
"WARC-IP-Address": "104.16.116.182",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:6ZGUJZPJWNGPLSJAQITTNSNO5RL3IF24",
"WARC-Record-ID": "<urn:uuid:fdb103b3-5c53-48fa-8ae4-64f1580c124c>",
"WARC-Target-URI": "http://android.stackexchange.com/questions/tagged/application-manager",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4a67965b-edbc-4505-a316-4fdeceab5121>"
},
"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,
31,
32,
67,
68,
70,
76,
84,
93,
94,
127,
128,
332,
334,
340,
349,
358,
359,
427,
428,
630,
632,
638,
646,
655,
656,
728,
729,
932,
934,
939,
948,
957,
958,
1021,
1022,
1221,
1223,
1229,
1238,
1247,
1248,
1291,
1292,
1496,
1498,
1504,
1512,
1522,
1523,
1589,
1590,
1795,
1797,
1803,
1811,
1820,
1821,
1865,
1866,
2066,
2068,
2074,
2082,
2092,
2093,
2136,
2137,
2338,
2340,
2346,
2354,
2363,
2364,
2430,
2431,
2633,
2635,
2641,
2649,
2659,
2660,
2783,
2784,
2983,
2985,
2991,
2999,
3008,
3009,
3062,
3063,
3263,
3265,
3270,
3278,
3287,
3288,
3399,
3400,
3605,
3607,
3612,
3621,
3630,
3631,
3696,
3697,
3902,
3904,
3910,
3918,
3928,
3929,
3977,
3978,
4181,
4183,
4189,
4198,
4208,
4209,
4273,
4274,
4477,
4479,
4485,
4493,
4503,
4504,
4545,
4546,
4744,
4746,
4751,
4760,
4769,
4770,
4814,
4815,
5018,
5020,
5025,
5034,
5043,
5044,
5083,
5084,
5285,
5287,
5293,
5302,
5312,
5313,
5360,
5361,
5564,
5567,
5573,
5582,
5593,
5594,
5634,
5635,
5829,
5831,
5837,
5845,
5855,
5856,
5921,
5922,
6126,
6128,
6133,
6141,
6151,
6152,
6205,
6206,
6408,
6410,
6416,
6425,
6435,
6436,
6481,
6482,
6682,
6684,
6690,
6699,
6709,
6710,
6805,
6806,
7002,
7004,
7010,
7018,
7027,
7028,
7102,
7103,
7292,
7294,
7300,
7308,
7318,
7319,
7367,
7368
],
"line_end_idx": [
31,
32,
67,
68,
70,
76,
84,
93,
94,
127,
128,
332,
334,
340,
349,
358,
359,
427,
428,
630,
632,
638,
646,
655,
656,
728,
729,
932,
934,
939,
948,
957,
958,
1021,
1022,
1221,
1223,
1229,
1238,
1247,
1248,
1291,
1292,
1496,
1498,
1504,
1512,
1522,
1523,
1589,
1590,
1795,
1797,
1803,
1811,
1820,
1821,
1865,
1866,
2066,
2068,
2074,
2082,
2092,
2093,
2136,
2137,
2338,
2340,
2346,
2354,
2363,
2364,
2430,
2431,
2633,
2635,
2641,
2649,
2659,
2660,
2783,
2784,
2983,
2985,
2991,
2999,
3008,
3009,
3062,
3063,
3263,
3265,
3270,
3278,
3287,
3288,
3399,
3400,
3605,
3607,
3612,
3621,
3630,
3631,
3696,
3697,
3902,
3904,
3910,
3918,
3928,
3929,
3977,
3978,
4181,
4183,
4189,
4198,
4208,
4209,
4273,
4274,
4477,
4479,
4485,
4493,
4503,
4504,
4545,
4546,
4744,
4746,
4751,
4760,
4769,
4770,
4814,
4815,
5018,
5020,
5025,
5034,
5043,
5044,
5083,
5084,
5285,
5287,
5293,
5302,
5312,
5313,
5360,
5361,
5564,
5567,
5573,
5582,
5593,
5594,
5634,
5635,
5829,
5831,
5837,
5845,
5855,
5856,
5921,
5922,
6126,
6128,
6133,
6141,
6151,
6152,
6205,
6206,
6408,
6410,
6416,
6425,
6435,
6436,
6481,
6482,
6682,
6684,
6690,
6699,
6709,
6710,
6805,
6806,
7002,
7004,
7010,
7018,
7027,
7028,
7102,
7103,
7292,
7294,
7300,
7308,
7318,
7319,
7367,
7368,
7570
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7570,
"ccnet_original_nlines": 211,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35473814606666565,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05860349163413048,
"rps_doc_frac_lines_end_with_ellipsis": 0.12264151126146317,
"rps_doc_frac_no_alph_words": 0.18640898168087006,
"rps_doc_frac_unique_words": 0.36056971549987793,
"rps_doc_mean_word_length": 4.3913044929504395,
"rps_doc_num_sentences": 98,
"rps_doc_symbol_to_word_ratio": 0.016832919791340828,
"rps_doc_unigram_entropy": 5.429756164550781,
"rps_doc_word_count": 1334,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.025947419926524162,
"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.026630250737071037,
"rps_doc_frac_chars_top_3gram": 0.01775350049138069,
"rps_doc_frac_chars_top_4gram": 0.005121199879795313,
"rps_doc_books_importance": -559.4848022460938,
"rps_doc_books_importance_length_correction": -559.4848022460938,
"rps_doc_openwebtext_importance": -425.9982604980469,
"rps_doc_openwebtext_importance_length_correction": -425.9982604980469,
"rps_doc_wikipedia_importance": -285.5335388183594,
"rps_doc_wikipedia_importance_length_correction": -285.5335388183594
},
"fasttext": {
"dclm": 0.029555439949035645,
"english": 0.9401872754096985,
"fineweb_edu_approx": 1.0389554500579834,
"eai_general_math": 0.00032853998709470034,
"eai_open_web_math": 0.031100990250706673,
"eai_web_code": 0.0005552200018428266
}
}
|
{
"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": "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": "21",
"label": "Customer Support"
}
},
"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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,601,851,727,074,323,500 |
Backup VirtualBox Machine: Methods and Possibilities
VirtualBox Backup
VirtualBox backup means backing up data from VirtualBox virtual machines (VMs), the solution highly popular among both Windows and Linux users. These cross-platform capabilities slightly differs VirtualBox from other virtual machine engines such as Hyper-V and VMware.
Download Handy Backup
Version 8.2.3, built on March 29, 2021
111 MB
Fully capable to backup VirtualBox VM data under Windows, Handy Backup also has one other option, making possible VirtualBox backup under some Linux distros through Network Agents in network-oriented solutions.
The Theory of VirtualBox Backup
Backup VirtualBox machines may be achieved through one of two different methods: internal and external. Both ways require the installation of Handy Backup to the machine – VirtualBox backup VM target for the internal way, or the computer containing VirtualBox software for other method.
1
The Internal Method
A copy of Handy Backup (or a Handy Backup Network Agent) can be installed on the virtual machine, under Windows or Linux. Then VirtualBox backup VM data using this copy of Handy Backup, as any computer physically existed, with all capabilities and possibilities of this solution.
Any edition of Handy Backup can be installed to VirtualBox. If you need to perform VirtualBox backup activity on a couple of virtual machines, though, it seems to be a most logical way to use a network-oriented solution, such as Handy Backup Server Network.
2
The External Method
Using this method, Handy backup takes a snapshot of VirtualBox backup VM data from the machine where the particular VirtualBox instance is running. Backup VirtualBox with the external method is no different from backing up any single file.
Handy Backup can use the “hot” technique to perform VirtualBox backup. This means that you have no need to stop the VirtualBox instance before copying it. The Volume Shadow Copying Service (VSS) is used to perform backup VirtualBox VM in a “hot” mode.
Recommended Solution
Handy Backup Server Network
Version 8.2.3, built on March 29, 2021. 111 MB
Backup Software from Novosoft LLC. 299 USD per license.
Handy Backup Server Network
Try the complete enterprise backup solution bringing you backing up of all network workstations from a single network administrator PC.
How to Backup VirtualBox Machine Using the External Method
This simple task may be accomplished using the following instruction.
1. Open Handy Backup and select a new task item on the main menu or by pressing Ctrl+N. Select a backup task type.
2. On the Step 2, use the “Computer” as the data source. Use the navigation panel or the "File filters" option to find VirtualBox files (*.vbox).
Virtual Box Backup Masks
Note: VirtualBox machines may not have the “default” location; the exact position of any VirtualBox machine created can vary greatly from other machine positions. The reasonable way of finding the machine you need is to find it using some file explorer and then paste the path to it!
1. Select VirtualBox images you needed to backup VirtualBox data in this particular task. Press OK to return to the process of task creation.
2. Choose other parameters of the VirtualBox backup task, such as the data destination, time of execution, data encryption, etc. These steps are not specific to the VirtualBox backup task.
For Network Agents running under Linux distributives, the same technique using the “Computer” data source option applies. Some minor differences with Windows-based versions are often touches the matter of file locations, as the structure of Linux file system differs from Windows.
Linux files
VirtualBox Backup under Linux distributives
Download Handy Backup
Version 8.2.3, built on March 29, 2021
111 MB
As a rule, an external backup of VirtualBox machines with Handy Backup is as simple action as any file or folder backup.
See also:
0 comments
Who uses our backup software?
|
{
"url": "https://www.handybackup.net/virtualbox-backup.shtml",
"source_domain": "www.handybackup.net",
"snapshot_id": "crawl=CC-MAIN-2021-17",
"warc_metadata": {
"Content-Length": "27073",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:45EODXWSC5U4L2NZRWNE7PX7DNFOQPTH",
"WARC-Concurrent-To": "<urn:uuid:d3662329-795e-4731-af2e-291d991aeb0d>",
"WARC-Date": "2021-04-21T01:47:27Z",
"WARC-IP-Address": "3.222.166.138",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2PMFKQXUNEEZPW6M7JXYA5DQNOQZ2D5G",
"WARC-Record-ID": "<urn:uuid:57500824-3e60-4135-8523-3977ab8dfedd>",
"WARC-Target-URI": "https://www.handybackup.net/virtualbox-backup.shtml",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6aea2f1d-5bd6-4f8d-9db3-efed5b3f657a>"
},
"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-232.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,
53,
54,
72,
73,
342,
343,
365,
366,
405,
412,
413,
624,
625,
626,
627,
659,
660,
661,
948,
949,
951,
952,
972,
973,
1253,
1254,
1512,
1513,
1514,
1515,
1517,
1518,
1538,
1539,
1779,
1780,
2032,
2033,
2034,
2035,
2036,
2057,
2058,
2086,
2087,
2134,
2190,
2191,
2219,
2220,
2356,
2357,
2358,
2359,
2418,
2419,
2420,
2490,
2491,
2608,
2756,
2757,
2782,
2783,
3067,
3068,
3212,
3403,
3404,
3405,
3686,
3687,
3699,
3700,
3744,
3745,
3746,
3768,
3769,
3808,
3815,
3816,
3937,
3938,
3939,
3949,
3950,
3961,
3962
],
"line_end_idx": [
53,
54,
72,
73,
342,
343,
365,
366,
405,
412,
413,
624,
625,
626,
627,
659,
660,
661,
948,
949,
951,
952,
972,
973,
1253,
1254,
1512,
1513,
1514,
1515,
1517,
1518,
1538,
1539,
1779,
1780,
2032,
2033,
2034,
2035,
2036,
2057,
2058,
2086,
2087,
2134,
2190,
2191,
2219,
2220,
2356,
2357,
2358,
2359,
2418,
2419,
2420,
2490,
2491,
2608,
2756,
2757,
2782,
2783,
3067,
3068,
3212,
3403,
3404,
3405,
3686,
3687,
3699,
3700,
3744,
3745,
3746,
3768,
3769,
3808,
3815,
3816,
3937,
3938,
3939,
3949,
3950,
3961,
3962,
3995
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3995,
"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.31207597255706787,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021709630265831947,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1696065068244934,
"rps_doc_frac_unique_words": 0.3710190951824188,
"rps_doc_mean_word_length": 5.121018886566162,
"rps_doc_num_sentences": 44,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.839488506317139,
"rps_doc_word_count": 628,
"rps_doc_frac_chars_dupe_10grams": 0.03233831003308296,
"rps_doc_frac_chars_dupe_5grams": 0.042599499225616455,
"rps_doc_frac_chars_dupe_6grams": 0.042599499225616455,
"rps_doc_frac_chars_dupe_7grams": 0.042599499225616455,
"rps_doc_frac_chars_dupe_8grams": 0.042599499225616455,
"rps_doc_frac_chars_dupe_9grams": 0.042599499225616455,
"rps_doc_frac_chars_top_2gram": 0.051305968314409256,
"rps_doc_frac_chars_top_3gram": 0.016169149428606033,
"rps_doc_frac_chars_top_4gram": 0.015858210623264313,
"rps_doc_books_importance": -300.603759765625,
"rps_doc_books_importance_length_correction": -300.603759765625,
"rps_doc_openwebtext_importance": -184.5167236328125,
"rps_doc_openwebtext_importance_length_correction": -184.5167236328125,
"rps_doc_wikipedia_importance": -163.92189025878906,
"rps_doc_wikipedia_importance_length_correction": -163.92189025878906
},
"fasttext": {
"dclm": 0.02526671066880226,
"english": 0.8495895266532898,
"fineweb_edu_approx": 2.3075058460235596,
"eai_general_math": 0.6770407557487488,
"eai_open_web_math": 0.38550007343292236,
"eai_web_code": 0.16483575105667114
}
}
|
{
"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": "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": "2",
"label": "Click Here References"
}
},
"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": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,387,273,715,944,430,600 |
Fastnet(Layer2)
Very Fastnet is a Layer 2 network that proceeds with batch records on the Very Mainnet.
Governance Council
The governance council of Very Fastnet is operated by a total of 20 trustworthy companies, with plans to continuously expand the council while pursuing faster transaction speeds and stability.
Rollup Chain
Initially based on optimistic rollups, this Layer 2 structure logs the transaction records on Very Mainnet's Layer 1.
More detailed information will be provided upon the public release of Layer 2.
Last updated
|
{
"url": "https://wp.verylabs.io/fastnet-layer2",
"source_domain": "wp.verylabs.io",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "119304",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XIUODYGMYBNSFQXJ72BPU5IFFT4CGAJ3",
"WARC-Concurrent-To": "<urn:uuid:3c1d1f38-f444-43bf-acd6-bc5954bad5b5>",
"WARC-Date": "2024-09-20T04:27:11Z",
"WARC-IP-Address": "104.18.40.47",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CNDFOTXWKHXVTEDD7CZ5BAWRJEV7HYVE",
"WARC-Record-ID": "<urn:uuid:e29f3ee9-e6df-4664-b4e7-125afbfc82ec>",
"WARC-Target-URI": "https://wp.verylabs.io/fastnet-layer2",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2835feeb-0027-4049-8ed2-7dbf276550d0>"
},
"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-228\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,
16,
17,
105,
106,
125,
126,
319,
320,
333,
334,
452,
453,
532,
533
],
"line_end_idx": [
16,
17,
105,
106,
125,
126,
319,
320,
333,
334,
452,
453,
532,
533,
545
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 545,
"ccnet_original_nlines": 14,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.27659574151039124,
"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.1489361673593521,
"rps_doc_frac_unique_words": 0.6987951993942261,
"rps_doc_mean_word_length": 5.385542392730713,
"rps_doc_num_sentences": 5,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.912515878677368,
"rps_doc_word_count": 83,
"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.04026845842599869,
"rps_doc_frac_chars_top_3gram": 0.058165550231933594,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -38.394065856933594,
"rps_doc_books_importance_length_correction": -51.954532623291016,
"rps_doc_openwebtext_importance": -23.37419319152832,
"rps_doc_openwebtext_importance_length_correction": -36.93465805053711,
"rps_doc_wikipedia_importance": -14.680317878723145,
"rps_doc_wikipedia_importance_length_correction": -28.24078369140625
},
"fasttext": {
"dclm": 0.03598039969801903,
"english": 0.8765928149223328,
"fineweb_edu_approx": 1.042270302772522,
"eai_general_math": 0.051860030740499496,
"eai_open_web_math": 0.33523356914520264,
"eai_web_code": 0.00012279000657144934
}
}
|
{
"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": "332.87",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Finance"
}
}
},
"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": "1",
"label": "Truncated Snippets"
},
"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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,666,877,382,217,692,000 |
Create a gist now
Instantly share code, notes, and snippets.
What would you like to do?
Google Apps Script Gmail Utilities
##sendAndLabel(recipient, subject, body, options, label)##
An alternative to GmailApp.sendEmail(), which applies a label to the message thread in the sender's account.
Sends an email message with optional arguments. The email can contain plain text or an HTML body. The size of the email (including headers, but excluding attachments) may not exceed 20KB.
Original StackOverflow question: How to create a Gmail message with a specific label?
###Parameters###
Name Type Description
recipient String the addresses of the recipients
subject String the subject line
body String the body of the email
options Object a JavaScript object that specifies advanced parameters, as documented for GmailApp.sendEmail()
label String the label to be applied
Details
The Google Apps Script GmailApp API does not give a way to add a label to a message as you send it, something you can do from the UI. This appears as Issue 1859 in the issue tracker, visit and star it for updates.
A work-around would be to take advantage of the thread apis. If the message is blind-copied (bcc'd) to the sender, it will also appear as a new message in their inbox, where we can use getInboxThreads() to find it. Add the label to this thread, and optionally mark it read then archive it.
##inline(htmlWstyle)##
Convert html containing <style> tags to instead have inline css.
This example uses an online service from MailChimp Labs, but the same principle could be used to leverage several other online providers.
Strictly speaking, this isn't not a gmail utility, but since it's so useful for producing cross-client compatible emails, here it is!
Original StackOverflow question: How do I use Google Apps Script to change a CSS page to one with inline styles?
###Parameters###
Name Type Description
htmlWstyle String A block of HTML text including <style>..</style> tags.
Details
There are numerous online tools that do this conversion, so you could leverage one of them from Google Apps Script. (If you only need to do this once in a while, why not just use one of those services?)
This utility builds on the getElementByVal() function from this answer.
There may appear to be some black magic in there. A previous answer described how to use the old Xml Service to examine the structure of a web page to find the bits you wanted. It's still good reading, but that service is now gone, and the new XmlService doesn't have equivalent exploratory support.
To start, we found a web service that did the job we were interested in, and used the UrlFetch Service to simulate a person pasting code into the service. Ideally, we'd like one that returned just the result we wanted, in a format we could use without any further work. Alas, what we had was a complete web page, and that meant that we'd have to farm it for our result. Basic idea there: Use the XmlService to parse and explore the page, extracting just the bit we wanted.
In the Css Inline service that was selected, Chrome's ability to "Inspect Element" was used to determine the tag type (<textarea>) and a way to uniquely identify it (name="text"). Armed with that knowledge, we had everything we needed to use getElementByVal() to dig through the HTML returned from a POST request. (Alternatively, you could use String methods to find and extract the text you want.)
But when that was all put together, XmlService kept complaining about the format of the HTML in the result page - so JavaScript String & RegExp methods were used to balance the malformed tags before passing the page on.
Example
Here's a simple example illustrating use of the inline() function. Note that style information is absorbed from both the external css link AND the tagged styling.
function test_inline() {
var myHtml =
'<html>'
+ '<head>'
+ '<title>Example</title>'
+ '<link rel="stylesheet" href="http://inlinestyler.torchboxapps.com/static/css/example.css" ></link>'
+ '</head>'
+ '<body>'
+ '<style type="text/css">'
+ 'h1{'
+ 'color:yellow'
+ '}'
+ '</style>'
+ '<h1>An example title</h1>'
+ '<p>Paragraph 1</p>'
+ '<p class="p2">Paragraph 2</p>'
+ '</body>'
+ '</html>';
var inlined = inline(myHtml);
debugger; // pause in debugger, have a look at "inlined"
}
Result
<html>
<head>
<title>Example</title>
</head>
<body>
<h1 style="color: yellow;">An example title</h1>
<p style="margin: 0;padding: 0 0 10px 0;">Paragraph 1</p>
<p class="p2" style="margin: 0;padding: 0 0 10px 0;">Paragraph 2</p>
</body>
</html>
GMail Service OAuth2 functions
Simplified OAuth2 authorization for Google Apps Script use of the GMail API. Fair warning: while this is an illustration of how to do OAuth2 authentication, it's not really necessary since the addition of ScriptApp.getOAuthToken().
• Requires OAuth2 for Apps Script, library ID MswhXl8fVhTFUH_Q3UOJbXvxhMjh3Sh48
• See OAuth2 for Apps Script for details including installation of the library.
Usage:
1. Set your project-specific values in an "authorization profile" object, e.g.
var gmailAuthProfile = {
// Get the client ID and secret from the Google Developers Console.
clientId : '--redacted--.apps.googleusercontent.com',
clientSecret : '--redacted--',
// Set the project key of the script using the service.
projectKey : '--redacted--'
}
2. Authorize. See comments on doGet().
3. Use getGmailService().getAccessToken() as authorization bearer for calls to gmail API.
Send Draft Emails
Using the GMail service provided by Google Apps Script you can script many GMail capabilities. One thing you cannot do is directly send existing draft messages.
This script contains a few utilities (maybe the foundation of a library, someday) that deal with draft emails, including using the GMail API to retrieve and send draft messages.
No more need to resort to generating a whole new copy of a draft, send the copy, delete the draft... instead:
sendDraftMsg( msgId ); // Will find the draft with this msgId, and send it
This will preserve all the attributes of the draft email... To:, From:, CC: and BCC: lists, labels, inline images, attachments, and formatting.
###sendDayOldDrafts()
Written for StackOverflow question How to send a draft email using google apps script. Sends all draft emails labeled "send-tomorrow".
A simple example of how to use sendDraftMsg().
sendDraftMsg( msgId )
Sends a draft message that matches the given message ID.
Parameters
NameTypeDescription
messageId String Immutable Gmail Message ID to send
subject String the subject line
Returns
TypeDescription
Object Response object if successful, see https://developers.google.com/gmail/api/v1/reference/users/drafts/send#response
getDrafts()
Gets the current user's draft messages.
Returns
TypeDescription
Object[] If successful, returns an array of `Users.drafts` resources. (https://developers.google.com/gmail/api/v1/reference/users/drafts)
getDraftId( messageId )
Gets the draft message ID that corresponds to a given Gmail Message ID. Parameters
NameTypeDescription
messageId String Immutable Gmail Message ID to search for
Returns
TypeDescription
String Immutable Gmail Draft ID, or `null` if not found
getDraftMsg( messageId, optFormat )
Gets the draft message content that corresponds to a given Gmail Message ID.
Parameters
NameTypeDescription
messageId String Immutable Gmail Message ID to search for
optFormat String Optional format; `'object'` (default) or `'json'`
Returns
TypeDescription
Object or String If successful, returns a `Users.drafts` resource. (https://developers.google.com/gmail/api/v1/reference/users/drafts)
Label a message
Using the GMail service provided by Google Apps Script you can script many GMail capabilities. One thing you cannot do is label messages, you can only label threads. These utilities provide the ability to modify the labels on a single message, by use of the GMail API.
See labelMessage.gs for code.
Example of use:
function test_modifyMessage() {
var firstThread = GmailApp.getInboxThreads(0,1)[0];
var message = firstThread.getMessages()[0];
var messageId = message.getId();
modifyMessage('me', messageId, ['stack','overflow']); // add two labels
modifyMessage('me', messageId, null, ['stack','overflow']); // remove two labels
}
###modifyMessage()
Written for StackOverflow question Add label to specific message, not the thread. Adds or removes Labels on an individual message.
Parameters
NameTypeDescription
userId String User's email address. The special value 'me' can be used to indicate the authenticated user.
messageId String ID of Message to modify
labelsToAdd String[] Array of Label names to add
labelsToRemove String[] Array of Label names to remove
Returns
TypeDescription
Object Users.messages resource, see https://developers.google.com/gmail/api/v1/reference/users/messages#resource
getLabelId()
Get the Label ID for the given labelName. If Label isn't found, it will be created depending on the state of ok2Create.
Parameters
NameTypeDescription
labelName String Name of label to retrieve ID for.
ok2Create Boolean (optional) Set true if a label should be created when not found. Default is true.
Returns
TypeDescription
String ID of Label, or null if not found or created.
createLabel()
Create Label for given labelName. Parameters
NameTypeDescription
labelName String Name of label to create.
Returns
TypeDescription
String ID of Label.
/********************************************************************************
* GMail Service OAuth2 functions
*
* Adapted from Eric Koleda's Drive Service example.
*
* Requires OAuth2 for Apps Script, library ID MswhXl8fVhTFUH_Q3UOJbXvxhMjh3Sh48
* See https://github.com/googlesamples/apps-script-oauth2
*
* Usage:
*
* 1. Set your project-specific values in an "authorization profile"
* object, e.g.
*
* var gmailAuthProfile = {
* // Get the client ID and secret from the Google Developers Console.
* clientId : '--redacted--.apps.googleusercontent.com',
* clientSecret : '--redacted--',
*
* // Set the project key of the script using the service.
* projectKey : '--redacted--'
* }
*
* 2. Authorize. See comments on doGet().
*
* 3. Use getGmailService().getAccessToken() as authorization bearer
* for calls to gmail API.
*
*******************************************************************************/
/**
* Remove authorization for the service. (e.g. to re-authorize)
*/
function resetGmailService() {
var gmailService = getGmailService(gmailAuthProfile);
gmailService.reset();
}
/**
* Initialize and / or get OAuth2 token for GMail API.
*
* @param {Objectr} authProfile Object containing clientId, clientSecret
* & projectKey for authorization
*/
function getGmailService(authProfile) {
if (!authProfile) throw new Error( 'Require authProfile' );
// Create a new service with the given name. The name will be used when persisting the
// authorized token, so ensure it is unique within the scope of the property store.
return OAuth2.createService('gmail')
// Set the endpoint URLs, which are the same for all Google services.
.setAuthorizationBaseUrl('https://accounts.google.com/o/oauth2/auth')
.setTokenUrl('https://accounts.google.com/o/oauth2/token')
// Set the client ID and secret, from the Google Developers Console.
.setClientId(authProfile.clientId)
.setClientSecret(authProfile.clientSecret)
// Set the project key of the script using this library.
.setProjectKey(authProfile.projectKey)
// Set the name of the callback function in the script referenced above that should be
// invoked to complete the OAuth flow.
.setCallbackFunction('authCallback_')
// Set the property store where authorized tokens should be persisted.
.setPropertyStore(PropertiesService.getUserProperties())
// Set the scopes to request (space-separated for Google services).
.setScope( ['https://mail.google.com/',
'https://www.googleapis.com/auth/gmail.modify',
'https://www.googleapis.com/auth/gmail.compose',
'https://www.googleapis.com/auth/gmail.readonly'])
// Set any additional OAuth2 parameters, in this case requesting offline access and
// forcing the approval prompt to be shown.
.setParam('access_type', 'offline')
//.setParam('approval_prompt', 'force');
}
/**
* To complete authorization, script must have a UI. For a stand-alone script,
* publish as a web app. The doGet() and authCallback() functions are then available
* to the user for authentication at the published (or dev) URL.
*/
function doGet() {
var gmailService = getGmailService(gmailAuthProfile);
if (!gmailService.hasAccess()) {
var authorizationUrl = gmailService.getAuthorizationUrl();
var template = HtmlService.createTemplate(
'<a href="<?= authorizationUrl ?>" target="_blank">Authorize</a>. ' +
'Refresh the page when authorization complete.');
template.authorizationUrl = authorizationUrl;
var page = template.evaluate();
return page;
} else {
return HtmlService.createHtmlOutput("Authorization completed.")
.setSandboxMode(HtmlService.SandboxMode.NATIVE);
}
}
/**
* This function is called to provide feedback to the user attempting
* to grant authorization.
* See OAuth2.createService().setCallbackFunction('authCallback')
*/
function authCallback_(request) {
var gmailService = getGmailService(gmailAuthProfile);
var isAuthorized = gmailService.handleCallback(request);
if (isAuthorized) {
return HtmlService.createHtmlOutput('Success! You can close this tab.');
} else {
return HtmlService.createHtmlOutput('Denied. You can close this tab');
}
}
/**
* Convert html containing <style> tags to instead have inline css.
*
* This example uses an online service from MailChimp Labs, but
* the same principle could be used to leverage several other
* online providers.
*
* @param {Text} htmlWstyle A block of HTML text including
* <style>..</style> tags.
*
* @returns {Text} Same HTML, converted to inline css.
*/
function inline(htmlWstyle) {
// Generate a POST request to inline css web tool.
var payload =
{
"html" : htmlWstyle,
"strip" : "checked"
};
// Because payload is a JavaScript object, it will be interpreted as
// an HTML form. (We do not need to specify contentType; it will
// automatically default to either 'application/x-www-form-urlencoded'
// or 'multipart/form-data')
var options =
{
"method" : "post",
"payload" : payload,
"muteHttpExceptions" : true
};
var url = "http://beaker.mailchimp.com/inline-css";
var response = UrlFetchApp.fetch(url, options);
// The html from this service is non-compliant, so we need
// to massage it to satisfy the XmlService.
var badlink = new RegExp('<link (.*?)[\/]*>',"igm");
var badmeta = new RegExp('<meta (.*?)[\/]*>',"igm");
var badinput = new RegExp('<input (.*?)[\/]*>',"igm");
var xml = response.getContentText()
.replace(badlink,"<link $1></link>" )
.replace(badinput,"<input $1></input>" )
.replace(badmeta,"<meta $1></meta>" )
.replace(/<br>/g,"<br/>");
// So far, so good! Next, extract converted text from page. <textarea name="text" ...>
// Put the receieved xml response into XMLdocument format
var doc = XmlService.parse(xml);
var inlineHTML = getElementByVal( doc, 'textarea', 'name', 'text' );
return (inlineHTML == null) ? null : inlineHTML.getValue();
}
/**
* Modify the Labels a Message is associated with.
* Throws if unsuccessful.
* see https://developers.google.com/gmail/api/v1/reference/users/messages/modify
*
* @param {String} userId User's email address. The special value 'me'
* can be used to indicate the authenticated user.
* @param {String} messageId ID of Message to modify.
* @param {String} labelsToAdd Array of Label names to add.
* @param {String} labelsToRemove Array of Label names to remove.
*
* @returns {Object} Users.messages resource, see reference.
*/
function modifyMessage(userId, messageId, labelsToAdd, labelsToRemove) {
labelsToAdd = labelsToAdd || [];
labelsToRemove = labelsToRemove || [];
// see https://developers.google.com/gmail/api/v1/reference/users/messages/modify
var url = 'https://www.googleapis.com/gmail/v1/users/${userId}/messages/${id}/modify'
.replace("${userId}","me")
.replace("${id}", messageId );
var headers = {
Authorization: 'Bearer ' + ScriptApp.getOAuthToken()
};
var addLabelIds = [];
for (var i=0; i<labelsToAdd.length; i++) {
addLabelIds[i] = getLabelId( labelsToAdd[i] );
}
var removeLabelIds = [];
for (var i=0; i<labelsToRemove.length; i++) {
removeLabelIds[i] = getLabelId( labelsToRemove[i], false );
}
var request = {
'addLabelIds': addLabelIds,
'removeLabelIds': removeLabelIds
};
var params = {
method: "post",
contentType: "application/json",
headers: headers,
payload: JSON.stringify(request),
muteHttpExceptions: true
};
//var check = UrlFetchApp.getRequest(url, params); // for debugging
var response = UrlFetchApp.fetch(url, params);
var result = response.getResponseCode();
if (result == '200') { // OK
return JSON.parse(response.getContentText());
}
else {
// This is only needed when muteHttpExceptions == true
var err = JSON.parse(response.getContentText());
throw new Error( 'Error (' + result + ") " + err.error.message );
}
}
/**
* Get the Label ID for the given LabelName. If Label isn't found, it will be created
* depending on the state of ok2Create.
* Throws if unsuccessful.
* See https://developers.google.com/gmail/api/v1/reference/users/messages/modify.
*
* @param {String} labelName Immutable Gmail Message ID to modify
* @param {Boolean} ok2Create (optional) Set true if a label should be created when not found.
* Default is true.
*
* @returns {String} ID of Label, or null if not found or created.
*/
function getLabelId( labelName, ok2Create ) {
if (typeof ok2Create == 'undefined') ok2Create = true;
var id = null;
// see https://developers.google.com/gmail/api/v1/reference/users/labels/list
var url = 'https://www.googleapis.com/gmail/v1/users/${userId}/labels'
.replace("${userId}","me") // The user's email address. The special value me can be used to indicate the authenticated user.
var headers = {
Authorization: 'Bearer ' + ScriptApp.getOAuthToken()
};
var params = {
method: "get",
contentType: "application/json",
headers: headers,
muteHttpExceptions: true
};
//var check = UrlFetchApp.getRequest(url, params); // for debugging
var response = UrlFetchApp.fetch(url, params);
var result = response.getResponseCode();
if (result == '200') { // OK
var labels = JSON.parse(response.getContentText()).labels;
var found = false;
for (var i=0; i<labels.length & !found; i++) {
if (labels[i].name == labelName) {
found = true;
id = labels[i].id;
}
}
if (!found && ok2Create) {
id = createLabel( labelName );
}
return id;
}
else {
// This is only needed when muteHttpExceptions == true
var err = JSON.parse(response.getContentText());
throw new Error( 'Error (' + result + ") " + err.error.message );
}
}
/**
* Create Label given LabelName.
* Throws if unsuccessful.
* See https://developers.google.com/gmail/api/v1/reference/users/messages/modify.
*
* @param {String} labelName Immutable Gmail Message ID to modify
*
* @returns {String} ID of Label.
*/
function createLabel( labelName ) {
var id = null;
// see https://developers.google.com/gmail/api/v1/reference/users/labels/create
var url = 'https://www.googleapis.com/gmail/v1/users/${userId}/labels'
.replace("${userId}","me") // The user's email address. The special value me can be used to indicate the authenticated user.
var headers = {
Authorization: 'Bearer ' + ScriptApp.getOAuthToken()
};
var request = {
'name': labelName
};
var params = {
method: "post",
contentType: "application/json",
headers: headers,
payload: JSON.stringify(request),
muteHttpExceptions: true
};
//var check = UrlFetchApp.getRequest(url, params); // for debugging
var response = UrlFetchApp.fetch(url, params);
var result = response.getResponseCode();
if (result == '200') { // OK
var label = JSON.parse(response.getContentText());
id = label.id;
return id;
}
else {
// This is only needed when muteHttpExceptions == true
var err = JSON.parse(response.getContentText());
throw new Error( 'Error (' + result + ") " + err.error.message );
}
}
function test_modifyMessage() {
// A very basic test; grab most recent message, then add & remove labels.
var firstThread = GmailApp.getInboxThreads(0,1)[0];
var message = firstThread.getMessages()[0];
var messageId = message.getId();
modifyMessage('me', messageId, ['stack','overflow']); // add two labels
debugger; // Validate labels are visible in GMail. May need to refresh GMail.
modifyMessage('me', messageId, null, ['stack','overflow']); // remove two labels
debugger; // Validate labels have been removed from the message.
}
/**
* An alternative to GmailApp.sendEmail(), which applies a
* label to the message thread in the sender's account.
*
* Sends an email message with optional arguments. The email can
* contain plain text or an HTML body. The size of the email
* (including headers, but excluding attachments) may not
* exceed 20KB.
*
* @copyright (c) 2013 Mogsdad
* @license MIT
*
* @param {String} recipient the addresses of the recipient
* @param {String} subject the subject line
* @param {String} body the body of the email
* @param {Object} options a JavaScript object that specifies
* advanced parameters, as documented
* for GmailApp.sendEmail()
* @param {String} label the label to be applied
*/
function sendAndLabel(recipient, subject, body, options, label) {
var sender = Session.getActiveUser().getEmail();
// Add sender to bcc list
if (options.bcc) {
options.bcc = options.bcc.split(',').concat(sender).join(',');
}
else {
options.bcc = sender;
}
GmailApp.sendEmail( recipient, subject, body, options )
// Check if label already exists, create if it doesn't
var newLabel = GmailApp.getUserLabelByName(label);
if (!newLabel) newLabel = GmailApp.createLabel(label);
// Look for our new message in inbox threads
Utilities.sleep(2000); // Wait for message to be received
var inboxThreads = GmailApp.getInboxThreads();
for (var t = 0; t < inboxThreads.length; t++) {
var foundSubject = inboxThreads[t].getFirstMessageSubject();
var numLabels = inboxThreads[t].getLabels().length; // Could add more criteria
if (foundSubject === subject && numLabels === 0) {
// Found our thread
inboxThreads[t].addLabel(newLabel)
.markRead()
.moveToArchive();
break;
}
}
}
function test_sendAndLabel() {
var recipient = Session.getActiveUser().getEmail();
var subject = "Test Labelling";
var body = "This email is testing message labelling.";
// var options = {bcc:"[email protected]"};
var options = {};
var label = "LabelTest";
sendAndLabel(recipient, subject, body, options, label);
}
/*
* Send all drafts labeled "send-tomorrow".
*/
function sendDayOldDrafts() {
var threads = GmailApp.search('in:draft label:send-tomorrow');
for (var i=0; i<threads.length; i++) {
var msgId = threads[0].getMessages()[0].getId();
sendDraftMsg( msgId );
}
}
/**
* Sends a draft message that matches the given message ID.
* Throws if unsuccessful.
* See https://developers.google.com/gmail/api/v1/reference/users/drafts/send.
*
* @param {String} messageId Immutable Gmail Message ID to send
*
* @returns {Object} Response object if successful, see
* https://developers.google.com/gmail/api/v1/reference/users/drafts/send#response
*/
function sendDraftMsg( msgId ) {
// Get draft message.
var draftMsg = getDraftMsg(msgId,"json");
if (!getDraftMsg(msgId)) throw new Error( "Unable to get draft with msgId '"+msgId+"'" );
// see https://developers.google.com/gmail/api/v1/reference/users/drafts/send
var url = 'https://www.googleapis.com/gmail/v1/users/me/drafts/send'
var headers = {
Authorization: 'Bearer ' + ScriptApp.getOAuthToken()
};
var params = {
method: "post",
contentType: "application/json",
headers: headers,
muteHttpExceptions: true,
payload: JSON.stringify(draftMsg)
};
var check = UrlFetchApp.getRequest(url, params)
var response = UrlFetchApp.fetch(url, params);
var result = response.getResponseCode();
if (result == '200') { // OK
return JSON.parse(response.getContentText());
}
else {
// This is only needed when muteHttpExceptions == true
var err = JSON.parse(response.getContentText());
throw new Error( 'Error (' + result + ") " + err.error.message );
}
}
/**
* Gets the current user's draft messages.
* Throws if unsuccessful.
* See https://developers.google.com/gmail/api/v1/reference/users/drafts/list.
*
* @returns {Object[]} If successful, returns an array of
* Users.drafts resources.
*/
function getDrafts() {
var url = 'https://www.googleapis.com/gmail/v1/users/me/drafts';
var headers = {
Authorization: 'Bearer ' + ScriptApp.getOAuthToken()
};
var params = {
headers: headers,
muteHttpExceptions: true
};
var check = UrlFetchApp.getRequest(url, params)
var response = UrlFetchApp.fetch(url, params);
var result = response.getResponseCode();
if (result == '200') { // OK
return JSON.parse(response.getContentText()).drafts;
}
else {
// This is only needed when muteHttpExceptions == true
var error = JSON.parse(response.getContentText());
throw new Error( 'Error (' + result + ") " + error.message );
}
}
/**
* Gets the draft message ID that corresponds to a given Gmail Message ID.
*
* @param {String} messageId Immutable Gmail Message ID to search for
*
* @returns {String} Immutable Gmail Draft ID, or null if not found
*/
function getDraftId( messageId ) {
if (messageId) {
var drafts = getDrafts();
for (var i=0; i<drafts.length; i++) {
if (drafts[i].message.id === messageId) {
return drafts[i].id;
}
}
}
// Didn't find the requested message
return null;
}
/**
* Gets the draft message content that corresponds to a given Gmail Message ID.
* Throws if unsuccessful.
* See https://developers.google.com/gmail/api/v1/reference/users/drafts/get.
*
* @param {String} messageId Immutable Gmail Message ID to search for
* @param {String} optFormat Optional format; "object" (default) or "json"
*
* @returns {Object or String} If successful, returns a Users.drafts resource.
*/
function getDraftMsg( messageId, optFormat ) {
var draftId = getDraftId( messageId );
var url = 'https://www.googleapis.com/gmail/v1/users/me/drafts'+"/"+draftId;
var headers = {
Authorization: 'Bearer ' + ScriptApp.getOAuthToken()
};
var params = {
headers: headers,
muteHttpExceptions: true
};
var check = UrlFetchApp.getRequest(url, params)
var response = UrlFetchApp.fetch(url, params);
var result = response.getResponseCode();
if (result == '200') { // OK
if (optFormat && optFormat == "JSON") {
return response.getContentText();
}
else {
return JSON.parse(response.getContentText());
}
}
else {
// This is only needed when muteHttpExceptions == true
var error = JSON.parse(response.getContentText());
throw new Error( 'Error (' + result + ") " + error.message );
}
}
@ldeck
This comment has been minimized.
Show comment Hide comment
@ldeck
ldeck Jun 22, 2016
Shouldn't sendDayOldDrafts() refer to threads[i] rather than threads[0]?
ldeck commented Jun 22, 2016
Shouldn't sendDayOldDrafts() refer to threads[i] rather than threads[0]?
@foice
This comment has been minimized.
Show comment Hide comment
@foice
foice Apr 8, 2017
How much API quota uses this script to send an email?
foice commented Apr 8, 2017
How much API quota uses this script to send an email?
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
|
{
"url": "https://gist.github.com/mogsdad/6515581",
"source_domain": "gist.github.com",
"snapshot_id": "crawl=CC-MAIN-2018-17",
"warc_metadata": {
"Content-Length": "255796",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5QXUWVX5BNXWIZG4N25NTLVFYWSB6CWQ",
"WARC-Concurrent-To": "<urn:uuid:18cde689-cbfe-455e-94c0-6a0090738ee4>",
"WARC-Date": "2018-04-23T13:35:31Z",
"WARC-IP-Address": "192.30.253.119",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SMF7EXVTVUKZUQBVKICARP6KKNKWQUXR",
"WARC-Record-ID": "<urn:uuid:8c0566ea-9ed3-45ea-ba94-957907e4e02c>",
"WARC-Target-URI": "https://gist.github.com/mogsdad/6515581",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7bf86b1c-540e-4a3a-90ce-49a4ae2b5dc8>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-109-231-228.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,
18,
19,
62,
63,
90,
91,
126,
127,
186,
187,
296,
297,
485,
486,
572,
573,
590,
591,
613,
662,
694,
728,
838,
875,
876,
884,
885,
1099,
1100,
1390,
1391,
1414,
1415,
1480,
1481,
1619,
1620,
1754,
1755,
1868,
1869,
1886,
1887,
1909,
1982,
1983,
1991,
1992,
2195,
2196,
2268,
2269,
2569,
2570,
3043,
3044,
3443,
3444,
3664,
3665,
3673,
3674,
3837,
3838,
3863,
3878,
3891,
3906,
3939,
4048,
4064,
4079,
4113,
4130,
4161,
4176,
4195,
4231,
4260,
4300,
4316,
4331,
4334,
4366,
4426,
4428,
4429,
4436,
4437,
4446,
4457,
4486,
4498,
4509,
4564,
4628,
4703,
4715,
4725,
4726,
4757,
4758,
4990,
4991,
5073,
5074,
5156,
5157,
5164,
5165,
5246,
5247,
5276,
5350,
5410,
5447,
5452,
5514,
5548,
5554,
5559,
5600,
5601,
5693,
5694,
5712,
5713,
5874,
5875,
6053,
6054,
6164,
6165,
6241,
6242,
6386,
6387,
6409,
6410,
6545,
6546,
6593,
6594,
6616,
6617,
6674,
6675,
6686,
6687,
6707,
6759,
6791,
6792,
6800,
6801,
6817,
6939,
6940,
6952,
6953,
6993,
6994,
7002,
7003,
7019,
7157,
7158,
7182,
7183,
7266,
7267,
7287,
7345,
7346,
7354,
7355,
7371,
7427,
7428,
7464,
7465,
7542,
7543,
7554,
7555,
7575,
7633,
7700,
7701,
7709,
7710,
7726,
7861,
7862,
7878,
7879,
8148,
8149,
8179,
8180,
8196,
8197,
8229,
8283,
8329,
8364,
8367,
8447,
8530,
8532,
8533,
8552,
8553,
8684,
8685,
8696,
8697,
8717,
8824,
8865,
8914,
8969,
8970,
8978,
8979,
8995,
9108,
9109,
9122,
9123,
9243,
9244,
9255,
9256,
9276,
9327,
9427,
9428,
9436,
9437,
9453,
9506,
9507,
9521,
9522,
9567,
9568,
9588,
9630,
9631,
9639,
9640,
9656,
9676,
9758,
9791,
9793,
9845,
9847,
9927,
9985,
9987,
9996,
9998,
10066,
10081,
10083,
10110,
10180,
10236,
10269,
10271,
10329,
10359,
10363,
10365,
10406,
10408,
10476,
10502,
10504,
10585,
10589,
10652,
10655,
10686,
10740,
10762,
10764,
10768,
10822,
10824,
10896,
10929,
10932,
10972,
11032,
11119,
11203,
11240,
11310,
11380,
11439,
11508,
11543,
11586,
11643,
11682,
11769,
11808,
11846,
11917,
11974,
12042,
12082,
12130,
12179,
12230,
12314,
12358,
12394,
12435,
12437,
12441,
12519,
12603,
12667,
12670,
12689,
12743,
12776,
12835,
12878,
12948,
12998,
13044,
13076,
13089,
13098,
13162,
13211,
13213,
13215,
13219,
13288,
13314,
13379,
13382,
13416,
13470,
13527,
13547,
13620,
13629,
13700,
13702,
13704,
13708,
13775,
13777,
13840,
13901,
13921,
13923,
13981,
14007,
14009,
14063,
14066,
14096,
14147,
14161,
14163,
14184,
14204,
14207,
14276,
14341,
14412,
14441,
14455,
14457,
14476,
14497,
14525,
14528,
14580,
14628,
14687,
14731,
14784,
14837,
14892,
14928,
14966,
15007,
15045,
15072,
15159,
15217,
15250,
15319,
15379,
15381,
15385,
15435,
15461,
15542,
15544,
15614,
15664,
15717,
15776,
15841,
15843,
15903,
15906,
15979,
16012,
16051,
16133,
16219,
16246,
16277,
16293,
16346,
16349,
16371,
16414,
16461,
16463,
16488,
16534,
16594,
16596,
16612,
16640,
16673,
16676,
16691,
16707,
16740,
16758,
16792,
16817,
16820,
16888,
16935,
16976,
17005,
17051,
17053,
17060,
17115,
17164,
17230,
17232,
17234,
17238,
17323,
17362,
17388,
17470,
17472,
17537,
17631,
17650,
17652,
17718,
17721,
17767,
17822,
17837,
17915,
17986,
18111,
18127,
18180,
18183,
18198,
18213,
18246,
18264,
18289,
18292,
18360,
18407,
18448,
18477,
18536,
18555,
18602,
18637,
18651,
18670,
18672,
18674,
18701,
18732,
18734,
18745,
18747,
18754,
18809,
18858,
18924,
18926,
18928,
18932,
18964,
18990,
19072,
19074,
19139,
19141,
19174,
19177,
19213,
19228,
19308,
19379,
19504,
19520,
19573,
19576,
19592,
19610,
19613,
19628,
19644,
19677,
19695,
19729,
19754,
19757,
19825,
19872,
19913,
19942,
19993,
20008,
20019,
20021,
20028,
20083,
20132,
20198,
20200,
20202,
20234,
20308,
20360,
20404,
20437,
20509,
20587,
20668,
20733,
20735,
20739,
20797,
20852,
20854,
20918,
20978,
21035,
21050,
21052,
21082,
21097,
21099,
21158,
21201,
21246,
21307,
21344,
21371,
21419,
21422,
21488,
21537,
21563,
21582,
21645,
21647,
21654,
21676,
21678,
21734,
21789,
21840,
21895,
21940,
21998,
22045,
22093,
22154,
22233,
22284,
22304,
22339,
22351,
22369,
22376,
22378,
22380,
22382,
22413,
22465,
22497,
22552,
22598,
22616,
22641,
22697,
22699,
22702,
22745,
22748,
22778,
22841,
22880,
22929,
22952,
22954,
22956,
22960,
23019,
23045,
23123,
23125,
23188,
23190,
23245,
23327,
23330,
23363,
23385,
23427,
23517,
23595,
23664,
23680,
23733,
23736,
23751,
23767,
23800,
23818,
23844,
23878,
23881,
23929,
23976,
24017,
24046,
24092,
24094,
24101,
24156,
24205,
24271,
24273,
24275,
24279,
24321,
24347,
24425,
24427,
24484,
24510,
24513,
24536,
24601,
24617,
24670,
24673,
24688,
24706,
24731,
24734,
24782,
24829,
24870,
24899,
24952,
24954,
24961,
25016,
25067,
25129,
25131,
25133,
25137,
25211,
25213,
25282,
25284,
25351,
25354,
25389,
25406,
25432,
25470,
25512,
25533,
25535,
25537,
25539,
25576,
25589,
25591,
25595,
25674,
25700,
25777,
25779,
25848,
25922,
25924,
26002,
26005,
26052,
26091,
26168,
26184,
26237,
26240,
26255,
26273,
26298,
26301,
26349,
26396,
26437,
26466,
26506,
26540,
26542,
26549,
26595,
26597,
26599,
26606,
26661,
26712,
26774,
26776,
26778,
26785,
26786,
26819,
26820,
26846,
26853,
26854,
26873,
26874,
26947,
26948,
26977,
26978,
27051,
27052,
27059,
27060,
27093,
27094,
27120,
27127,
27128,
27146,
27147,
27201,
27202,
27230,
27231,
27285,
27286
],
"line_end_idx": [
18,
19,
62,
63,
90,
91,
126,
127,
186,
187,
296,
297,
485,
486,
572,
573,
590,
591,
613,
662,
694,
728,
838,
875,
876,
884,
885,
1099,
1100,
1390,
1391,
1414,
1415,
1480,
1481,
1619,
1620,
1754,
1755,
1868,
1869,
1886,
1887,
1909,
1982,
1983,
1991,
1992,
2195,
2196,
2268,
2269,
2569,
2570,
3043,
3044,
3443,
3444,
3664,
3665,
3673,
3674,
3837,
3838,
3863,
3878,
3891,
3906,
3939,
4048,
4064,
4079,
4113,
4130,
4161,
4176,
4195,
4231,
4260,
4300,
4316,
4331,
4334,
4366,
4426,
4428,
4429,
4436,
4437,
4446,
4457,
4486,
4498,
4509,
4564,
4628,
4703,
4715,
4725,
4726,
4757,
4758,
4990,
4991,
5073,
5074,
5156,
5157,
5164,
5165,
5246,
5247,
5276,
5350,
5410,
5447,
5452,
5514,
5548,
5554,
5559,
5600,
5601,
5693,
5694,
5712,
5713,
5874,
5875,
6053,
6054,
6164,
6165,
6241,
6242,
6386,
6387,
6409,
6410,
6545,
6546,
6593,
6594,
6616,
6617,
6674,
6675,
6686,
6687,
6707,
6759,
6791,
6792,
6800,
6801,
6817,
6939,
6940,
6952,
6953,
6993,
6994,
7002,
7003,
7019,
7157,
7158,
7182,
7183,
7266,
7267,
7287,
7345,
7346,
7354,
7355,
7371,
7427,
7428,
7464,
7465,
7542,
7543,
7554,
7555,
7575,
7633,
7700,
7701,
7709,
7710,
7726,
7861,
7862,
7878,
7879,
8148,
8149,
8179,
8180,
8196,
8197,
8229,
8283,
8329,
8364,
8367,
8447,
8530,
8532,
8533,
8552,
8553,
8684,
8685,
8696,
8697,
8717,
8824,
8865,
8914,
8969,
8970,
8978,
8979,
8995,
9108,
9109,
9122,
9123,
9243,
9244,
9255,
9256,
9276,
9327,
9427,
9428,
9436,
9437,
9453,
9506,
9507,
9521,
9522,
9567,
9568,
9588,
9630,
9631,
9639,
9640,
9656,
9676,
9758,
9791,
9793,
9845,
9847,
9927,
9985,
9987,
9996,
9998,
10066,
10081,
10083,
10110,
10180,
10236,
10269,
10271,
10329,
10359,
10363,
10365,
10406,
10408,
10476,
10502,
10504,
10585,
10589,
10652,
10655,
10686,
10740,
10762,
10764,
10768,
10822,
10824,
10896,
10929,
10932,
10972,
11032,
11119,
11203,
11240,
11310,
11380,
11439,
11508,
11543,
11586,
11643,
11682,
11769,
11808,
11846,
11917,
11974,
12042,
12082,
12130,
12179,
12230,
12314,
12358,
12394,
12435,
12437,
12441,
12519,
12603,
12667,
12670,
12689,
12743,
12776,
12835,
12878,
12948,
12998,
13044,
13076,
13089,
13098,
13162,
13211,
13213,
13215,
13219,
13288,
13314,
13379,
13382,
13416,
13470,
13527,
13547,
13620,
13629,
13700,
13702,
13704,
13708,
13775,
13777,
13840,
13901,
13921,
13923,
13981,
14007,
14009,
14063,
14066,
14096,
14147,
14161,
14163,
14184,
14204,
14207,
14276,
14341,
14412,
14441,
14455,
14457,
14476,
14497,
14525,
14528,
14580,
14628,
14687,
14731,
14784,
14837,
14892,
14928,
14966,
15007,
15045,
15072,
15159,
15217,
15250,
15319,
15379,
15381,
15385,
15435,
15461,
15542,
15544,
15614,
15664,
15717,
15776,
15841,
15843,
15903,
15906,
15979,
16012,
16051,
16133,
16219,
16246,
16277,
16293,
16346,
16349,
16371,
16414,
16461,
16463,
16488,
16534,
16594,
16596,
16612,
16640,
16673,
16676,
16691,
16707,
16740,
16758,
16792,
16817,
16820,
16888,
16935,
16976,
17005,
17051,
17053,
17060,
17115,
17164,
17230,
17232,
17234,
17238,
17323,
17362,
17388,
17470,
17472,
17537,
17631,
17650,
17652,
17718,
17721,
17767,
17822,
17837,
17915,
17986,
18111,
18127,
18180,
18183,
18198,
18213,
18246,
18264,
18289,
18292,
18360,
18407,
18448,
18477,
18536,
18555,
18602,
18637,
18651,
18670,
18672,
18674,
18701,
18732,
18734,
18745,
18747,
18754,
18809,
18858,
18924,
18926,
18928,
18932,
18964,
18990,
19072,
19074,
19139,
19141,
19174,
19177,
19213,
19228,
19308,
19379,
19504,
19520,
19573,
19576,
19592,
19610,
19613,
19628,
19644,
19677,
19695,
19729,
19754,
19757,
19825,
19872,
19913,
19942,
19993,
20008,
20019,
20021,
20028,
20083,
20132,
20198,
20200,
20202,
20234,
20308,
20360,
20404,
20437,
20509,
20587,
20668,
20733,
20735,
20739,
20797,
20852,
20854,
20918,
20978,
21035,
21050,
21052,
21082,
21097,
21099,
21158,
21201,
21246,
21307,
21344,
21371,
21419,
21422,
21488,
21537,
21563,
21582,
21645,
21647,
21654,
21676,
21678,
21734,
21789,
21840,
21895,
21940,
21998,
22045,
22093,
22154,
22233,
22284,
22304,
22339,
22351,
22369,
22376,
22378,
22380,
22382,
22413,
22465,
22497,
22552,
22598,
22616,
22641,
22697,
22699,
22702,
22745,
22748,
22778,
22841,
22880,
22929,
22952,
22954,
22956,
22960,
23019,
23045,
23123,
23125,
23188,
23190,
23245,
23327,
23330,
23363,
23385,
23427,
23517,
23595,
23664,
23680,
23733,
23736,
23751,
23767,
23800,
23818,
23844,
23878,
23881,
23929,
23976,
24017,
24046,
24092,
24094,
24101,
24156,
24205,
24271,
24273,
24275,
24279,
24321,
24347,
24425,
24427,
24484,
24510,
24513,
24536,
24601,
24617,
24670,
24673,
24688,
24706,
24731,
24734,
24782,
24829,
24870,
24899,
24952,
24954,
24961,
25016,
25067,
25129,
25131,
25133,
25137,
25211,
25213,
25282,
25284,
25351,
25354,
25389,
25406,
25432,
25470,
25512,
25533,
25535,
25537,
25539,
25576,
25589,
25591,
25595,
25674,
25700,
25777,
25779,
25848,
25922,
25924,
26002,
26005,
26052,
26091,
26168,
26184,
26237,
26240,
26255,
26273,
26298,
26301,
26349,
26396,
26437,
26466,
26506,
26540,
26542,
26549,
26595,
26597,
26599,
26606,
26661,
26712,
26774,
26776,
26778,
26785,
26786,
26819,
26820,
26846,
26853,
26854,
26873,
26874,
26947,
26948,
26977,
26978,
27051,
27052,
27059,
27060,
27093,
27094,
27120,
27127,
27128,
27146,
27147,
27201,
27202,
27230,
27231,
27285,
27286,
27383
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 27383,
"ccnet_original_nlines": 779,
"rps_doc_curly_bracket": 0.0075959498062729836,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.18504135310649872,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015363840386271477,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.382407546043396,
"rps_doc_frac_unique_words": 0.24588045477867126,
"rps_doc_mean_word_length": 6.503715515136719,
"rps_doc_num_sentences": 416,
"rps_doc_symbol_to_word_ratio": 0.0054026697762310505,
"rps_doc_unigram_entropy": 5.776378631591797,
"rps_doc_word_count": 3095,
"rps_doc_frac_chars_dupe_10grams": 0.32351332902908325,
"rps_doc_frac_chars_dupe_5grams": 0.4352426826953888,
"rps_doc_frac_chars_dupe_6grams": 0.41388046741485596,
"rps_doc_frac_chars_dupe_7grams": 0.39410799741744995,
"rps_doc_frac_chars_dupe_8grams": 0.36658552289009094,
"rps_doc_frac_chars_dupe_9grams": 0.33901336789131165,
"rps_doc_frac_chars_top_2gram": 0.004471160005778074,
"rps_doc_frac_chars_top_3gram": 0.00834617018699646,
"rps_doc_frac_chars_top_4gram": 0.009141040034592152,
"rps_doc_books_importance": -2834.768310546875,
"rps_doc_books_importance_length_correction": -2834.768310546875,
"rps_doc_openwebtext_importance": -1622.4005126953125,
"rps_doc_openwebtext_importance_length_correction": -1622.4005126953125,
"rps_doc_wikipedia_importance": -1165.9923095703125,
"rps_doc_wikipedia_importance_length_correction": -1165.9923095703125
},
"fasttext": {
"dclm": 0.9014977216720581,
"english": 0.5086687207221985,
"fineweb_edu_approx": 1.9887144565582275,
"eai_general_math": 0.2375006079673767,
"eai_open_web_math": 0.2028941512107849,
"eai_web_code": 0.9045443534851074
}
}
|
{
"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": "2",
"label": "Click Here References"
}
},
"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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,592,030,041,074,874,000 |
117 users online (0 members and 117 guests)
Thread: Audio
Results 1 to 5 of 5
Related
1. Replies: 1
2. Replies: 5
3. Need Help adding audio links to my website Forum: Introduce Yourself
Replies: 1
1. #1
Mr.Chaotix's Avatar
New User
Status
Offline
Join Date
Oct 2005
Posts
14
Arrow Audio
Need help on how i can securely put audio files online, so that any 1 can listen but noone can copy them. Some thing on the lines of Launch player.
I am an audio engg: and artist and dont want my work to leak out.
Folks! Mr.Chaotix is an audio dude, Any one requiring any help or assistance regarding sound, music, audio can ask 4 it right away!
Cheers M8s!
-Mr.Chaotix
2. #2
ALL's Avatar
Super Dooper Nerd
Status
Offline
Join Date
Feb 2005
Location
localhost
Posts
382
Re: Audio
It is impossable to allow somone to listen, but not download!
BUT... you can make it EXTREMELY hard for the person to copy the files.
if you use php, jsp, asp, perl, python, or any other scripting language you can restrict the way people can get it.
I'll explain it thourghly...
when you go to a website, like this one, the users web browser submitts something like this:
GET / HTTP/1.1
Accept: image/gif, image/x-xbitmap, image/jpeg, image/pjpeg, application/x-shockwave-flash, application/vnd.ms-excel, application/vnd.ms-powerpoint, application/msword, */*
Accept-Language: en-us
---------------: ----- -------
User-Agent: Mozilla/4.0 (compatible; MSIE 6.0; Windows NT 5.1; SV1; Media Center PC 3.0; .NET CLR 1.0.3705; .NET CLR 1.1.4322)
Host: ahfb2000.com
Connection: Keep-Alive
Cookie: ahfblastvisit; ahfblastactivity=; ahfbuserid=; ahfbpassword=; ahfb2000lastvisit=; ahfb2000lastactivity=; ahfb2000userid=; ahfb2000password=you wish!
This tells the server: what type of browser it has, what images it will eassily accept, the host it is connecting to, the connection type, the language, tells the server what type of file it is trying to get, and your cookie info.
now... let's think of what we can do to protect your sound files with what the user's browser does...
first... we can restrict the types of browsers that are allowed to access those files. the only ones that should be allowed to get those files are:
Windows Media Player,
Quick Time,
and Real Player.
(they send a line like this: User-Agent: Windows-Media-Player/10.00.00.3646)
now you have the problem of people just oppening the file in their media player and downloading it...
that is were sessions come in handy! you can do this 2 ways (that i can think of).
first... you can require refferals (this is the eassiest way, but the most incompatable way, and i am not sure if those players all send refferals)
second, the harder way, is when people try and access your file, they get their own session code. it would look something like this:
your-web-site.com/your-directory/yoursoundfile.php?session=SEdB35S32H4GG4fcc5h3spd3B5
this is a uniqe code generated when they go to the webpage that the sound file(s) are on. (this part it gets tricky) you have to get the webpage and the php sound files to work together. after the webpage generates a session code for the sound file (verifying that it is trying to be accessed though a webpage) the sound file has to decode the session to verify that it has been generated by your generator, and not just put together (probably by using a database, with timeouts to remove the old entries) then have the php file have some code in it that tells it, "if i get stopped or i finish, delete the session."
Then you have 1 more opsticle... stopping people from starting it, then trying to run another instance of it at the same time... to over come that opsticle, you can only allow the session to work once, by putting the session in a type of "i have/am already been/being used state" rejecting the 2ed instance from running at all!
then just simpally, tell the browser not to cach anything.
Now, did that overwhelm you? I know it sounds hard, but it is really much harder than it sounds
but really it is still possable for people to download your file, or they could just do a system record, which is almost impossable to stop, unless you have put some software in their computer that locks the sound card when it is being played!
if you wanted to still go a step further than that, you could have it run in a Flash, or Java applet, and have it programmed personally to comply with all of that, and not show the origional location of the file.
I hope that helps in your long journy ahead,
-ALL
3. #3
Mr.Chaotix's Avatar
New User
Status
Offline
Join Date
Oct 2005
Posts
14
Smile Re: Audio
thanX m8, am lookin into it!!!
This is of some great help!
-Mr.ChaotiX
4. #4
ALL's Avatar
Super Dooper Nerd
Status
Offline
Join Date
Feb 2005
Location
localhost
Posts
382
Re: Audio
no problem, i go to atomfilms.com they have a similer way of protecting their movie files, but i found a way around it... but if you did it my way, you should beable to over come that!
-ALL
5. #5
Mr.Chaotix's Avatar
New User
Status
Offline
Join Date
Oct 2005
Posts
14
Re: Audio
Too bad, am too new in the world of web designing to be able to write such codes.
Thanks any how, You have gone a long way to try to help me.
Tags for this Thread
|
{
"url": "http://www.ahfb2000.com/threads/4901-Audio",
"source_domain": "www.ahfb2000.com",
"snapshot_id": "crawl=CC-MAIN-2017-26",
"warc_metadata": {
"Content-Length": "61588",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LHEY3YUDJHPVVOXXOMMWWPGRRXZOXXCQ",
"WARC-Concurrent-To": "<urn:uuid:abeb4509-df19-4320-97d8-47f1d588448a>",
"WARC-Date": "2017-06-28T15:57:04Z",
"WARC-IP-Address": "209.222.17.61",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:CUWWDAODWF6MU2FGVN4Y7CASUQKG4PON",
"WARC-Record-ID": "<urn:uuid:68bc441e-6362-403d-a21c-12973f4f4305>",
"WARC-Target-URI": "http://www.ahfb2000.com/threads/4901-Audio",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:301698e7-e30a-40d8-afe9-645daacc06b5>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-141-54-108.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 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,
46,
47,
61,
62,
63,
85,
86,
94,
95,
111,
127,
204,
219,
227,
251,
264,
265,
276,
288,
302,
315,
325,
332,
333,
349,
350,
502,
572,
573,
709,
710,
726,
727,
743,
744,
752,
769,
791,
792,
803,
815,
829,
842,
855,
869,
879,
887,
888,
902,
903,
969,
970,
1046,
1047,
1167,
1168,
1201,
1202,
1299,
1300,
1319,
1320,
1497,
1498,
1525,
1526,
1561,
1562,
1693,
1694,
1717,
1718,
1745,
1746,
1907,
2142,
2143,
2249,
2250,
2402,
2403,
2429,
2445,
2466,
2547,
2548,
2549,
2655,
2656,
2743,
2744,
2896,
2897,
3034,
3035,
3125,
3126,
3747,
3748,
4080,
4081,
4144,
4145,
4245,
4246,
4494,
4495,
4712,
4713,
4762,
4763,
4772,
4773,
4781,
4805,
4818,
4819,
4830,
4842,
4856,
4869,
4879,
4886,
4887,
4907,
4908,
4943,
4944,
4976,
4977,
4993,
4994,
5002,
5019,
5041,
5042,
5053,
5065,
5079,
5092,
5105,
5119,
5129,
5137,
5138,
5152,
5153,
5342,
5343,
5352,
5353,
5361,
5385,
5398,
5399,
5410,
5422,
5436,
5449,
5459,
5466,
5467,
5481,
5482,
5568,
5569,
5633,
5634,
5635,
5636
],
"line_end_idx": [
46,
47,
61,
62,
63,
85,
86,
94,
95,
111,
127,
204,
219,
227,
251,
264,
265,
276,
288,
302,
315,
325,
332,
333,
349,
350,
502,
572,
573,
709,
710,
726,
727,
743,
744,
752,
769,
791,
792,
803,
815,
829,
842,
855,
869,
879,
887,
888,
902,
903,
969,
970,
1046,
1047,
1167,
1168,
1201,
1202,
1299,
1300,
1319,
1320,
1497,
1498,
1525,
1526,
1561,
1562,
1693,
1694,
1717,
1718,
1745,
1746,
1907,
2142,
2143,
2249,
2250,
2402,
2403,
2429,
2445,
2466,
2547,
2548,
2549,
2655,
2656,
2743,
2744,
2896,
2897,
3034,
3035,
3125,
3126,
3747,
3748,
4080,
4081,
4144,
4145,
4245,
4246,
4494,
4495,
4712,
4713,
4762,
4763,
4772,
4773,
4781,
4805,
4818,
4819,
4830,
4842,
4856,
4869,
4879,
4886,
4887,
4907,
4908,
4943,
4944,
4976,
4977,
4993,
4994,
5002,
5019,
5041,
5042,
5053,
5065,
5079,
5092,
5105,
5119,
5129,
5137,
5138,
5152,
5153,
5342,
5343,
5352,
5353,
5361,
5385,
5398,
5399,
5410,
5422,
5436,
5449,
5459,
5466,
5467,
5481,
5482,
5568,
5569,
5633,
5634,
5635,
5636,
5656
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5656,
"ccnet_original_nlines": 170,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.40050166845321655,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016722410917282104,
"rps_doc_frac_lines_end_with_ellipsis": 0.017543859779834747,
"rps_doc_frac_no_alph_words": 0.24749164283275604,
"rps_doc_frac_unique_words": 0.40674155950546265,
"rps_doc_mean_word_length": 4.493258476257324,
"rps_doc_num_sentences": 75,
"rps_doc_symbol_to_word_ratio": 0.012541810050606728,
"rps_doc_unigram_entropy": 5.362430572509766,
"rps_doc_word_count": 890,
"rps_doc_frac_chars_dupe_10grams": 0.08602151274681091,
"rps_doc_frac_chars_dupe_5grams": 0.09802450984716415,
"rps_doc_frac_chars_dupe_6grams": 0.09802450984716415,
"rps_doc_frac_chars_dupe_7grams": 0.08602151274681091,
"rps_doc_frac_chars_dupe_8grams": 0.08602151274681091,
"rps_doc_frac_chars_dupe_9grams": 0.08602151274681091,
"rps_doc_frac_chars_top_2gram": 0.00700175017118454,
"rps_doc_frac_chars_top_3gram": 0.021255310624837875,
"rps_doc_frac_chars_top_4gram": 0.026256559416651726,
"rps_doc_books_importance": -498.8052978515625,
"rps_doc_books_importance_length_correction": -498.8052978515625,
"rps_doc_openwebtext_importance": -279.3522033691406,
"rps_doc_openwebtext_importance_length_correction": -279.3522033691406,
"rps_doc_wikipedia_importance": -209.5790557861328,
"rps_doc_wikipedia_importance_length_correction": -209.5790557861328
},
"fasttext": {
"dclm": 0.1201024129986763,
"english": 0.9016112685203552,
"fineweb_edu_approx": 1.6514569520950317,
"eai_general_math": 0.014994139783084393,
"eai_open_web_math": 0.4023180603981018,
"eai_web_code": 0.004110340029001236
}
}
|
{
"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.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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,797,384,852,514,684,000 |
0
We're building a Django-based project with a template/generator component. This component will be separate from the project as such and can be Django/Python, Node, Java or whatever works. The idea is to generate questions based on a pattern. For eg., I would want to generate questions like "What is 2 + 3", "What is 5 + 8" based on the pattern "What is X + Y ; where X,Y < 10". In this sense, it's like a template engine.
The templates will contain references to objects with properties that are defined in the DB, say, a Bus. For eg, it could be something like
[object type="vehicle" weight="heavy"]
and it would have to pull a random object from the DB fulfilling the criteria : type="vehicle" weight="heavy" (bus/truck/jet) and then substitute that tag with an image, say, of a Bus. Also it would have to be able to handle some processing. Eg:
What is [X type="integer" lte="10"] + [Y type="integer" lte="10"]
[option X+Y correct_ans="true"]
[option X-Y correct_ans="false"]
[option X+y+1 correct_ans="false"]
The engine would be expected to fill in a random integer value <= 10 for X and Y and show radioboxes for each of the options. Would also have to store the fact that the first option is the correct answer.
Does it to make sense to write something from the scratch? Or is it better to use an existing templating system (like Django's own templating system) as a starting point? Any suggestions on how I can approach this?
edit : Clarification of use case
3
• template engines that allow for logic like this are anti-patterns and bad designs plain and simple. templates should be side effect free, which means no logic in the them, your idea is a terrible way to implement an easy to use or maintain templating system. – user7519 Jun 29 '12 at 12:53
• Not too sure if it's really a template engine in the traditional sense. The idea is to be able to generate many questions based on a pattern. Let me try and update the question – Anirudh Jun 30 '12 at 4:16
• StringTemplate exists for a reason. It is the only side effect free template system available. It is the only one that I use anymore, everything else that allows the tiniest bit of logic to be embedded in the templates quickly devolves into a nightmare. – user7519 Mar 17 '18 at 18:09
3
First of all, I think having the template system pull items from the database directly is a bad idea. It introduces a tight coupling between your templates (presentation) and database (data storage), with no way to add any logic between the two. This means that any change to your database schema has a potential impact on your templates, and vv.
Instead, the template engine should be able to consume arbitrary data structures, as long as they implement a dictionary-like interface. If you throw in the ability to call functions / methods, you can have the same functionality, only on top of objects rather than the naked database. If your objects have lazy-loading properties, then you can even trigger trips to the database from the template after all (by requesting such a property), only that the request still goes through your normal application logic before hitting the database. Not only does this mean you can change your database schema and catch the regression through the use of compatibility adapters, it also allows you to:
• add authorization to your data access
• pre-massage data before sending it to the template
• display data from sources other than a database
• implement all sorts of caching
• do i18n by calling a special function (many template engines call it _()) on anything you want translated (and, obviously, implementing that special function to do your translating)
Typically, this is solved either by passing a data structure to the template engine when evaluating a template, or by making the templates so that whatever is currently in scope at the time the template is called, is accessible in the template.
As to whether you should invent your own template engine: Making template engines is great fun, especially if you love building parsers and lexers and tweaking AST's and optimizing rendering code, but I'd first hit the market and see what's already out there. This page (despite the source, not specific to CherryPy) gives a nice starting point. If you know for sure that no template engine exists to fill your needs, by all means make your own, but be advised that it's harder than it looks.
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://softwareengineering.stackexchange.com/questions/154808/building-a-template-engine-starting-point",
"source_domain": "softwareengineering.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "155994",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TZDZ62YQXC5WZCA5FHYFKU7FAJ5FPIUE",
"WARC-Concurrent-To": "<urn:uuid:10c72891-d3a6-4a9c-9701-03ff6ed66410>",
"WARC-Date": "2021-03-06T10:12:44Z",
"WARC-IP-Address": "151.101.129.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ICQ3SJS3BGGB6TKAA5TOON6OJCZFFCA5",
"WARC-Record-ID": "<urn:uuid:0996b221-1de9-4798-9ba8-56c1bb332b3d>",
"WARC-Target-URI": "https://softwareengineering.stackexchange.com/questions/154808/building-a-template-engine-starting-point",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:576ae9e6-35eb-4a9e-9ae4-5b080710f7c8>"
},
"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-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: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
3,
426,
427,
567,
568,
607,
608,
854,
855,
921,
922,
954,
955,
988,
989,
1024,
1025,
1230,
1231,
1446,
1447,
1480,
1481,
1483,
1777,
1987,
2276,
2278,
2279,
2626,
2627,
3319,
3320,
3362,
3417,
3469,
3504,
3690,
3691,
3936,
3937,
4430,
4431,
4443,
4444,
4544,
4545
],
"line_end_idx": [
2,
3,
426,
427,
567,
568,
607,
608,
854,
855,
921,
922,
954,
955,
988,
989,
1024,
1025,
1230,
1231,
1446,
1447,
1480,
1481,
1483,
1777,
1987,
2276,
2278,
2279,
2626,
2627,
3319,
3320,
3362,
3417,
3469,
3504,
3690,
3691,
3936,
3937,
4430,
4431,
4443,
4444,
4544,
4545,
4635
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4635,
"ccnet_original_nlines": 48,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41896024346351624,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021406730636954308,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1957186460494995,
"rps_doc_frac_unique_words": 0.4282083809375763,
"rps_doc_mean_word_length": 4.597204685211182,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.262901782989502,
"rps_doc_word_count": 787,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.013267000205814838,
"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.021282479166984558,
"rps_doc_frac_chars_top_3gram": 0.006633500102907419,
"rps_doc_frac_chars_top_4gram": 0.0060807098634541035,
"rps_doc_books_importance": -480.1375732421875,
"rps_doc_books_importance_length_correction": -480.1375732421875,
"rps_doc_openwebtext_importance": -274.45684814453125,
"rps_doc_openwebtext_importance_length_correction": -274.45684814453125,
"rps_doc_wikipedia_importance": -215.0106964111328,
"rps_doc_wikipedia_importance_length_correction": -215.0106964111328
},
"fasttext": {
"dclm": 0.3627486228942871,
"english": 0.9036056399345398,
"fineweb_edu_approx": 1.848275065422058,
"eai_general_math": 0.2978145480155945,
"eai_open_web_math": 0.07101839780807495,
"eai_web_code": 0.06426715850830078
}
}
|
{
"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.74",
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,973,332,091,783,198,700 |
1
vote
1answer
120 views
References into the tables in different style of the text
I would like to do one question concerning to references into the tables. So, I am writing my Phd thesis and I have so many tables with theoretical and experimental values. For the experimental values ...
1
vote
1answer
660 views
Position of Exponent Relative to Base
I'm having a problem in that the position of an exponent, relative to the base, is too low. For example, with capital letters or mathbb the top of the exponent is almost in line with the top of the ...
96
votes
6answers
22k views
What's the quickest way to write “2nd” “3rd” etc in LaTeX?
If I want to use abbreviations for second, third and so on in my LaTeX documents, I am currently doing this: 2$^{nd}$ which seems unsatisfactory. Is there a macro I'm missing? I'm sure I could define ...
|
{
"url": "http://tex.stackexchange.com/questions/tagged/superscripts+formatting",
"source_domain": "tex.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "47736",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TM3RWPVDO56C32M2HE5HX57H4QZ4MIIC",
"WARC-Concurrent-To": "<urn:uuid:e2ecb46c-fea5-4df6-b02e-c98a2e8221fa>",
"WARC-Date": "2014-03-16T11:21:04Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:DCDUNWQKNCXBU4YWSDYQXINJKCCYCZHP",
"WARC-Record-ID": "<urn:uuid:dc77533f-57b4-46ba-b0dd-d8d296ab82ce>",
"WARC-Target-URI": "http://tex.stackexchange.com/questions/tagged/superscripts+formatting",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7ecf86d4-d3ab-4913-ad6d-1b6ef0fc2285>"
},
"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,
2,
7,
15,
25,
26,
84,
85,
290,
292,
297,
305,
315,
316,
354,
355,
557,
560,
566,
575,
585,
586,
645,
646
],
"line_end_idx": [
2,
7,
15,
25,
26,
84,
85,
290,
292,
297,
305,
315,
316,
354,
355,
557,
560,
566,
575,
585,
586,
645,
646,
849
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 849,
"ccnet_original_nlines": 23,
"rps_doc_curly_bracket": 0.0023557099048048258,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.44262295961380005,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04918032884597778,
"rps_doc_frac_lines_end_with_ellipsis": 0.125,
"rps_doc_frac_no_alph_words": 0.17486338317394257,
"rps_doc_frac_unique_words": 0.5986841917037964,
"rps_doc_mean_word_length": 4.3289475440979,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0.01639343984425068,
"rps_doc_unigram_entropy": 4.271056175231934,
"rps_doc_word_count": 152,
"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.022796349599957466,
"rps_doc_frac_chars_top_3gram": 0.036474160850048065,
"rps_doc_frac_chars_top_4gram": 0.06990881264209747,
"rps_doc_books_importance": -84.00715637207031,
"rps_doc_books_importance_length_correction": -84.00715637207031,
"rps_doc_openwebtext_importance": -41.852787017822266,
"rps_doc_openwebtext_importance_length_correction": -39.18482971191406,
"rps_doc_wikipedia_importance": -16.298744201660156,
"rps_doc_wikipedia_importance_length_correction": -16.298744201660156
},
"fasttext": {
"dclm": 0.3404848575592041,
"english": 0.9411581754684448,
"fineweb_edu_approx": 0.906090259552002,
"eai_general_math": 0.9548602104187012,
"eai_open_web_math": 0.7186297178268433,
"eai_web_code": 0.519503116607666
}
}
|
{
"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": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,178,138,824,126,524,000 |
Top 3 Solutions to Apex Legends Invalid Game Executable
Apex Legends is a free-to-play first-person shooter battle royale game developed by Respawn Entertainment. It is available on many game platforms, including Microsoft Windows, PlayStation 4, Xbox One and Nintendo Switch.
Unfortunately, some users encounter a launch error while playing the game on Windows PC. And here is the involved error message: Invalid game executable: C:\Program Files (x86)\Origin Games\Apex\R5Apex.exe.
There are various factors which might lead to this error, but you can try fixing it with the following solutions.
Solution 1: Restore R5Apex.exe from Your Antivirus
In some cases, antivirus programs like AVG and Avast regard R5Apex.exe as virus or threat and they quarantine this file, which leads to the error invalid game executable in Apex Legends. To solve the problem, you need to add exception for the file from the programs.
If you’re using the built-in Windows Defender, you can follow the steps blow to add exception.
Step 1: Press Win + I to open Windows Settings. Then click Update & Security.
Step 2: In the left pane, select Windows Security. In the right pane, click Virus & threat protection > Protection history.
Step 3: Scroll down to check for Quarantined items. If you can find R5Apex.exe file in the list, click it and select Restore.
After restoring the involved file to the game folder, you can restart your PC and run the game again to check whether the error has been solved. If it still exists, you need to move on to the following solution.
Solution 2: Repair Game Files
An inconsistency with the game installation could also cause Apex Legends invalid game executable error. This usually happens due to corrupted or missing game files. Fortunately, Origin provides a helpful feature to repair them.
You just need to go to Origin client and click My Game Library. Then select the settings icon for Apex Legends and click Repair. Wait until the process is finished and restart Origin. Then launch the game and check if it works properly.
Solution 3: Clear the Game Cache
Another reason for Apex Legends invalid game executable issue is the problem related to game cache files. In this case, you need to clear the game cache. Some users have solved it with this solution and you can also have a try.
Here are the detailed steps.
Step 2: Navigate to: C:\Users\Username\Saved Games\Respawn\Apex\local.
Step 3: Click View tab form the tool bar and check Hidden items. Then delete all the items in the local folder.
After that, you should reboot your computer and run Apex Legends again.
For Windows 8.1, you can also try installing the following updates to fix the problem: KB3173424 and KB3172614. You can download them from the official website of Microsoft.
Hope these solutions could be helpful for you!
Originally published at https://www.partitionwizard.com on August 20, 2020.
--
--
Get the Medium app
A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
|
{
"url": "https://1061742939sherry.medium.com/top-3-solutions-to-apex-legends-invalid-game-executable-1822ddc0d57b",
"source_domain": "1061742939sherry.medium.com",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "110292",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LDCRVR5ZWFCCR7PAEERC4PMNBKKHN4RH",
"WARC-Concurrent-To": "<urn:uuid:218bcab6-bf3e-45f9-83c1-6532eb55ad44>",
"WARC-Date": "2023-02-07T11:40:10Z",
"WARC-IP-Address": "162.159.153.4",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AV4AVSGK6S7E3756RREF2T7QOMROTYGK",
"WARC-Record-ID": "<urn:uuid:1a9cbf24-9d2a-4007-b6b4-987f55732cc2>",
"WARC-Target-URI": "https://1061742939sherry.medium.com/top-3-solutions-to-apex-legends-invalid-game-executable-1822ddc0d57b",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ac4f49f2-d2e8-46d8-9051-766b1f9adce2>"
},
"warc_info": "isPartOf: CC-MAIN-2023-06\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January/February 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-96\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,
56,
57,
278,
279,
486,
487,
601,
602,
653,
654,
921,
922,
1017,
1018,
1096,
1097,
1221,
1222,
1348,
1349,
1561,
1562,
1592,
1593,
1822,
1823,
2060,
2061,
2094,
2095,
2323,
2324,
2353,
2354,
2425,
2426,
2538,
2539,
2611,
2612,
2786,
2787,
2834,
2835,
2911,
2912,
2915,
2916,
2919,
2920,
2939,
2940,
3041
],
"line_end_idx": [
56,
57,
278,
279,
486,
487,
601,
602,
653,
654,
921,
922,
1017,
1018,
1096,
1097,
1221,
1222,
1348,
1349,
1561,
1562,
1592,
1593,
1822,
1823,
2060,
2061,
2094,
2095,
2323,
2324,
2353,
2354,
2425,
2426,
2538,
2539,
2611,
2612,
2786,
2787,
2834,
2835,
2911,
2912,
2915,
2916,
2919,
2920,
2939,
2940,
3041,
3142
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3142,
"ccnet_original_nlines": 53,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.32761308550834656,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015600619837641716,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17940717935562134,
"rps_doc_frac_unique_words": 0.43713733553886414,
"rps_doc_mean_word_length": 4.806576251983643,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.9264326095581055,
"rps_doc_word_count": 517,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06277666240930557,
"rps_doc_frac_chars_dupe_6grams": 0.024144869297742844,
"rps_doc_frac_chars_dupe_7grams": 0.024144869297742844,
"rps_doc_frac_chars_dupe_8grams": 0.024144869297742844,
"rps_doc_frac_chars_dupe_9grams": 0.024144869297742844,
"rps_doc_frac_chars_top_2gram": 0.030985919758677483,
"rps_doc_frac_chars_top_3gram": 0.0422535203397274,
"rps_doc_frac_chars_top_4gram": 0.026559360325336456,
"rps_doc_books_importance": -287.197998046875,
"rps_doc_books_importance_length_correction": -287.197998046875,
"rps_doc_openwebtext_importance": -80.3270263671875,
"rps_doc_openwebtext_importance_length_correction": -80.3270263671875,
"rps_doc_wikipedia_importance": -97.63093566894531,
"rps_doc_wikipedia_importance_length_correction": -97.63093566894531
},
"fasttext": {
"dclm": 0.029131589457392693,
"english": 0.8983285427093506,
"fineweb_edu_approx": 1.271658182144165,
"eai_general_math": 0.1498611569404602,
"eai_open_web_math": 0.045063380151987076,
"eai_web_code": 0.17794138193130493
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.468",
"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": "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": "2",
"label": "Click Here References"
}
},
"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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,284,394,610,572,273,000 |
Share via
Xamarin.Forms Binding Value Converters
Data bindings usually transfer data from a source property to a target property, and in some cases from the target property to the source property. This transfer is straightforward when the source and target properties are of the same type, or when one type can be converted to the other type through an implicit conversion. When that is not the case, a type conversion must take place.
In the String Formatting article, you saw how you can use the StringFormat property of a data binding to convert any type into a string. For other types of conversions, you need to write some specialized code in a class that implements the IValueConverter interface. (The Universal Windows Platform contains a similar class named IValueConverter in the Windows.UI.Xaml.Data namespace, but this IValueConverter is in the Xamarin.Forms namespace.) Classes that implement IValueConverter are called value converters, but they are also often referred to as binding converters or binding value converters.
The IValueConverter Interface
Suppose you want to define a data binding where the source property is of type int but the target property is a bool. You want this data binding to produce a false value when the integer source is equal to 0, and true otherwise.
You can do this with a class that implements the IValueConverter interface:
public class IntToBoolConverter : IValueConverter
{
public object Convert(object value, Type targetType, object parameter, CultureInfo culture)
{
return (int)value != 0;
}
public object ConvertBack(object value, Type targetType, object parameter, CultureInfo culture)
{
return (bool)value ? 1 : 0;
}
}
You set an instance of this class to the Converter property of the Binding class or to the Converter property of the Binding markup extension. This class becomes part of the data binding.
The Convert method is called when data moves from the source to the target in OneWay or TwoWay bindings. The value parameter is the object or value from the data-binding source. The method must return a value of the type of the data-binding target. The method shown here casts the value parameter to an int and then compares it with 0 for a bool return value.
The ConvertBack method is called when data moves from the target to the source in TwoWay or OneWayToSource bindings. ConvertBack performs the opposite conversion: It assumes the value parameter is a bool from the target, and converts it to an int return value for the source.
If the data binding also includes a StringFormat setting, the value converter is invoked before the result is formatted as a string.
The Enable Buttons page in the sample demonstrates how to use this value converter in a data binding. The IntToBoolConverter is instantiated in the page's resource dictionary. It is then referenced with a StaticResource markup extension to set the Converter property in two data bindings. It is very common to share data converters among multiple data bindings on the page:
<ContentPage xmlns="http://xamarin.com/schemas/2014/forms"
xmlns:x="http://schemas.microsoft.com/winfx/2009/xaml"
xmlns:local="clr-namespace:DataBindingDemos"
x:Class="DataBindingDemos.EnableButtonsPage"
Title="Enable Buttons">
<ContentPage.Resources>
<ResourceDictionary>
<local:IntToBoolConverter x:Key="intToBool" />
</ResourceDictionary>
</ContentPage.Resources>
<StackLayout Padding="10, 0">
<Entry x:Name="entry1"
Text=""
Placeholder="enter search term"
VerticalOptions="CenterAndExpand" />
<Button Text="Search"
HorizontalOptions="Center"
VerticalOptions="CenterAndExpand"
IsEnabled="{Binding Source={x:Reference entry1},
Path=Text.Length,
Converter={StaticResource intToBool}}" />
<Entry x:Name="entry2"
Text=""
Placeholder="enter destination"
VerticalOptions="CenterAndExpand" />
<Button Text="Submit"
HorizontalOptions="Center"
VerticalOptions="CenterAndExpand"
IsEnabled="{Binding Source={x:Reference entry2},
Path=Text.Length,
Converter={StaticResource intToBool}}" />
</StackLayout>
</ContentPage>
If a value converter is used in multiple pages of your application, you can instantiate it in the resource dictionary in the App.xaml file.
The Enable Buttons page demonstrates a common need when a Button performs an operation based on text that the user types into an Entry view. If nothing has been typed into the Entry, the Button should be disabled. Each Button contains a data binding on its IsEnabled property. The data-binding source is the Length property of the Text property of the corresponding Entry. If that Length property is not 0, the value converter returns true and the Button is enabled:
Enable Buttons
Notice that the Text property in each Entry is initialized to an empty string. The Text property is null by default, and the data binding will not work in that case.
Some value converters are written specifically for particular applications, while others are generalized. If you know that a value converter will only be used in OneWay bindings, then the ConvertBack method can simply return null.
The Convert method shown above implicitly assumes that the value argument is of type int and the return value must be of type bool. Similarly, the ConvertBack method assumes that the value argument is of type bool and the return value is int. If that is not the case, a runtime exception will occur.
You can write value converters to be more generalized and to accept several different types of data. The Convert and ConvertBack methods can use the as or is operators with the value parameter, or can call GetType on that parameter to determine its type, and then do something appropriate. The expected type of each method's return value is given by the targetType parameter. Sometimes, value converters are used with data bindings of different target types; the value converter can use the targetType argument to perform a conversion for the correct type.
If the conversion being performed is different for different cultures, use the culture parameter for this purpose. The parameter argument to Convert and ConvertBack is discussed later in this article.
Binding Converter Properties
Value converter classes can have properties and generic parameters. This particular value converter converts a bool from the source to an object of type T for the target:
public class BoolToObjectConverter<T> : IValueConverter
{
public T TrueObject { set; get; }
public T FalseObject { set; get; }
public object Convert(object value, Type targetType, object parameter, CultureInfo culture)
{
return (bool)value ? TrueObject : FalseObject;
}
public object ConvertBack(object value, Type targetType, object parameter, CultureInfo culture)
{
return ((T)value).Equals(TrueObject);
}
}
The Switch Indicators page demonstrates how it can be used to display the value of a Switch view. Although it's common to instantiate value converters as resources in a resource dictionary, this page demonstrates an alternative: Each value converter is instantiated between Binding.Converter property-element tags. The x:TypeArguments indicates the generic argument, and TrueObject and FalseObject are both set to objects of that type:
<ContentPage xmlns="http://xamarin.com/schemas/2014/forms"
xmlns:x="http://schemas.microsoft.com/winfx/2009/xaml"
xmlns:local="clr-namespace:DataBindingDemos"
x:Class="DataBindingDemos.SwitchIndicatorsPage"
Title="Switch Indicators">
<ContentPage.Resources>
<ResourceDictionary>
<Style TargetType="Label">
<Setter Property="FontSize" Value="18" />
<Setter Property="VerticalOptions" Value="Center" />
</Style>
<Style TargetType="Switch">
<Setter Property="VerticalOptions" Value="Center" />
</Style>
</ResourceDictionary>
</ContentPage.Resources>
<StackLayout Padding="10, 0">
<StackLayout Orientation="Horizontal"
VerticalOptions="CenterAndExpand">
<Label Text="Subscribe?" />
<Switch x:Name="switch1" />
<Label>
<Label.Text>
<Binding Source="{x:Reference switch1}"
Path="IsToggled">
<Binding.Converter>
<local:BoolToObjectConverter x:TypeArguments="x:String"
TrueObject="Of course!"
FalseObject="No way!" />
</Binding.Converter>
</Binding>
</Label.Text>
</Label>
</StackLayout>
<StackLayout Orientation="Horizontal"
VerticalOptions="CenterAndExpand">
<Label Text="Allow popups?" />
<Switch x:Name="switch2" />
<Label>
<Label.Text>
<Binding Source="{x:Reference switch2}"
Path="IsToggled">
<Binding.Converter>
<local:BoolToObjectConverter x:TypeArguments="x:String"
TrueObject="Yes"
FalseObject="No" />
</Binding.Converter>
</Binding>
</Label.Text>
<Label.TextColor>
<Binding Source="{x:Reference switch2}"
Path="IsToggled">
<Binding.Converter>
<local:BoolToObjectConverter x:TypeArguments="Color"
TrueObject="Green"
FalseObject="Red" />
</Binding.Converter>
</Binding>
</Label.TextColor>
</Label>
</StackLayout>
<StackLayout Orientation="Horizontal"
VerticalOptions="CenterAndExpand">
<Label Text="Learn more?" />
<Switch x:Name="switch3" />
<Label FontSize="18"
VerticalOptions="Center">
<Label.Style>
<Binding Source="{x:Reference switch3}"
Path="IsToggled">
<Binding.Converter>
<local:BoolToObjectConverter x:TypeArguments="Style">
<local:BoolToObjectConverter.TrueObject>
<Style TargetType="Label">
<Setter Property="Text" Value="Indubitably!" />
<Setter Property="FontAttributes" Value="Italic, Bold" />
<Setter Property="TextColor" Value="Green" />
</Style>
</local:BoolToObjectConverter.TrueObject>
<local:BoolToObjectConverter.FalseObject>
<Style TargetType="Label">
<Setter Property="Text" Value="Maybe later" />
<Setter Property="FontAttributes" Value="None" />
<Setter Property="TextColor" Value="Red" />
</Style>
</local:BoolToObjectConverter.FalseObject>
</local:BoolToObjectConverter>
</Binding.Converter>
</Binding>
</Label.Style>
</Label>
</StackLayout>
</StackLayout>
</ContentPage>
In the last of the three Switch and Label pairs, the generic argument is set to Style, and entire Style objects are provided for the values of TrueObject and FalseObject. These override the implicit style for Label set in the resource dictionary, so the properties in that style are explicitly assigned to the Label. Toggling the Switch causes the corresponding Label to reflect the change:
Switch Indicators
It's also possible to use Triggers to implement similar changes in the user-interface based on other views.
Binding Converter Parameters
The Binding class defines a ConverterParameter property, and the Binding markup extension also defines a ConverterParameter property. If this property is set, then the value is passed to the Convert and ConvertBack methods as the parameter argument. Even if the instance of the value converter is shared among several data bindings, the ConverterParameter can be different to perform somewhat different conversions.
The use of ConverterParameter is demonstrated with a color-selection program. In this case, the RgbColorViewModel has three properties of type double named Red, Green, and Blue that it uses to construct a Color value:
public class RgbColorViewModel : INotifyPropertyChanged
{
Color color;
string name;
public event PropertyChangedEventHandler PropertyChanged;
public double Red
{
set
{
if (color.R != value)
{
Color = new Color(value, color.G, color.B);
}
}
get
{
return color.R;
}
}
public double Green
{
set
{
if (color.G != value)
{
Color = new Color(color.R, value, color.B);
}
}
get
{
return color.G;
}
}
public double Blue
{
set
{
if (color.B != value)
{
Color = new Color(color.R, color.G, value);
}
}
get
{
return color.B;
}
}
public Color Color
{
set
{
if (color != value)
{
color = value;
PropertyChanged?.Invoke(this, new PropertyChangedEventArgs("Red"));
PropertyChanged?.Invoke(this, new PropertyChangedEventArgs("Green"));
PropertyChanged?.Invoke(this, new PropertyChangedEventArgs("Blue"));
PropertyChanged?.Invoke(this, new PropertyChangedEventArgs("Color"));
Name = NamedColor.GetNearestColorName(color);
}
}
get
{
return color;
}
}
public string Name
{
private set
{
if (name != value)
{
name = value;
PropertyChanged?.Invoke(this, new PropertyChangedEventArgs("Name"));
}
}
get
{
return name;
}
}
}
The Red, Green, and Blue properties range between 0 and 1. However, you might prefer that the components be displayed as two-digit hexadecimal values.
To display these as hexadecimal values in XAML, they must be multiplied by 255, converted to an integer, and then formatted with a specification of "X2" in the StringFormat property. The first two tasks (multiplying by 255 and converting to an integer) can be handled by the value converter. To make the value converter as generalized as possible, the multiplication factor can be specified with the ConverterParameter property, which means that it enters the Convert and ConvertBack methods as the parameter argument:
public class DoubleToIntConverter : IValueConverter
{
public object Convert(object value, Type targetType, object parameter, CultureInfo culture)
{
return (int)Math.Round((double)value * GetParameter(parameter));
}
public object ConvertBack(object value, Type targetType, object parameter, CultureInfo culture)
{
return (int)value / GetParameter(parameter);
}
double GetParameter(object parameter)
{
if (parameter is double)
return (double)parameter;
else if (parameter is int)
return (int)parameter;
else if (parameter is string)
return double.Parse((string)parameter);
return 1;
}
}
The Convert converts from a double to int while multiplying by the parameter value; the ConvertBack divides the integer value argument by parameter and returns a double result. (In the program shown below, the value converter is used only in connection with string formatting, so ConvertBack is not used.)
The type of the parameter argument is likely to be different depending on whether the data binding is defined in code or XAML. If the ConverterParameter property of Binding is set in code, it's likely to be set to a numeric value:
binding.ConverterParameter = 255;
The ConverterParameter property is of type Object, so the C# compiler interprets the literal 255 as an integer, and sets the property to that value.
In XAML, however, the ConverterParameter is likely to be set like this:
<Label Text="{Binding Red,
Converter={StaticResource doubleToInt},
ConverterParameter=255,
StringFormat='Red = {0:X2}'}" />
The 255 looks like a number, but because ConverterParameter is of type Object, the XAML parser treats the 255 as a string.
For that reason, the value converter shown above includes a separate GetParameter method that handles cases for parameter being of type double, int, or string.
The RGB Color Selector page instantiates DoubleToIntConverter in its resource dictionary following the definition of two implicit styles:
<ContentPage xmlns="http://xamarin.com/schemas/2014/forms"
xmlns:x="http://schemas.microsoft.com/winfx/2009/xaml"
xmlns:local="clr-namespace:DataBindingDemos"
x:Class="DataBindingDemos.RgbColorSelectorPage"
Title="RGB Color Selector">
<ContentPage.Resources>
<ResourceDictionary>
<Style TargetType="Slider">
<Setter Property="VerticalOptions" Value="CenterAndExpand" />
</Style>
<Style TargetType="Label">
<Setter Property="HorizontalTextAlignment" Value="Center" />
</Style>
<local:DoubleToIntConverter x:Key="doubleToInt" />
</ResourceDictionary>
</ContentPage.Resources>
<StackLayout>
<StackLayout.BindingContext>
<local:RgbColorViewModel Color="Gray" />
</StackLayout.BindingContext>
<BoxView Color="{Binding Color}"
VerticalOptions="FillAndExpand" />
<StackLayout Margin="10, 0">
<Label Text="{Binding Name}" />
<Slider Value="{Binding Red}" />
<Label Text="{Binding Red,
Converter={StaticResource doubleToInt},
ConverterParameter=255,
StringFormat='Red = {0:X2}'}" />
<Slider Value="{Binding Green}" />
<Label Text="{Binding Green,
Converter={StaticResource doubleToInt},
ConverterParameter=255,
StringFormat='Green = {0:X2}'}" />
<Slider Value="{Binding Blue}" />
<Label>
<Label.Text>
<Binding Path="Blue"
StringFormat="Blue = {0:X2}"
Converter="{StaticResource doubleToInt}">
<Binding.ConverterParameter>
<x:Double>255</x:Double>
</Binding.ConverterParameter>
</Binding>
</Label.Text>
</Label>
</StackLayout>
</StackLayout>
</ContentPage>
The values of the Red and Green properties are displayed with a Binding markup extension. The Blue property, however, instantiates the Binding class to demonstrate how an explicit double value can be set to ConverterParameter property.
Here's the result:
RGB Color Selector
|
{
"url": "https://learn.microsoft.com/en-us/previous-versions/xamarin/xamarin-forms/app-fundamentals/data-binding/converters",
"source_domain": "learn.microsoft.com",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "66074",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WPUTUPSSG54NR5XP2DCFUZHSBEL5OKOO",
"WARC-Concurrent-To": "<urn:uuid:e9b7eca4-7931-413e-8356-48f92c56d0d3>",
"WARC-Date": "2024-07-23T08:50:01Z",
"WARC-IP-Address": "23.50.126.168",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2S3L4D22H6ZOJZQUKLRBFL7RQH5LG57J",
"WARC-Record-ID": "<urn:uuid:93290013-6cab-45b6-b362-8830b609c0e7>",
"WARC-Target-URI": "https://learn.microsoft.com/en-us/previous-versions/xamarin/xamarin-forms/app-fundamentals/data-binding/converters",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1b54ac9b-ee5f-4766-95ca-df01aecbb444>"
},
"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,
1,
11,
12,
13,
52,
53,
440,
441,
1042,
1043,
1073,
1074,
1303,
1304,
1380,
1381,
1431,
1433,
1529,
1535,
1567,
1573,
1574,
1674,
1680,
1716,
1722,
1724,
1725,
1913,
1914,
2274,
2275,
2551,
2552,
2685,
2686,
3060,
3061,
3120,
3188,
3246,
3304,
3341,
3369,
3398,
3457,
3487,
3516,
3517,
3551,
3582,
3605,
3652,
3704,
3705,
3735,
3778,
3828,
3893,
3947,
4025,
4026,
4057,
4080,
4127,
4179,
4180,
4210,
4253,
4303,
4368,
4422,
4500,
4519,
4534,
4535,
4675,
4676,
5143,
5144,
5159,
5160,
5326,
5327,
5558,
5559,
5859,
5860,
6417,
6418,
6619,
6620,
6649,
6650,
6821,
6822,
6878,
6880,
6918,
6919,
6958,
6959,
7055,
7061,
7116,
7122,
7123,
7223,
7229,
7275,
7281,
7283,
7284,
7720,
7721,
7780,
7848,
7906,
7967,
8007,
8035,
8064,
8103,
8161,
8230,
8251,
8252,
8292,
8361,
8382,
8412,
8441,
8442,
8476,
8522,
8578,
8618,
8658,
8678,
8707,
8767,
8814,
8858,
8942,
9023,
9105,
9150,
9181,
9211,
9232,
9255,
9256,
9302,
9358,
9401,
9441,
9461,
9490,
9550,
9597,
9641,
9725,
9799,
9876,
9921,
9952,
9982,
10016,
10076,
10123,
10167,
10248,
10324,
10402,
10447,
10478,
10513,
10534,
10557,
10558,
10604,
10660,
10701,
10741,
10774,
10819,
10849,
10909,
10956,
11000,
11082,
11155,
11218,
11306,
11404,
11490,
11571,
11645,
11646,
11720,
11783,
11870,
11960,
12044,
12089,
12164,
12223,
12268,
12299,
12330,
12351,
12374,
12393,
12408,
12409,
12800,
12801,
12819,
12820,
12928,
12929,
12958,
12959,
13375,
13376,
13594,
13595,
13651,
13653,
13670,
13687,
13688,
13750,
13751,
13773,
13779,
13791,
13801,
13835,
13849,
13909,
13923,
13933,
13945,
13955,
13983,
13993,
13999,
14000,
14024,
14030,
14042,
14052,
14086,
14100,
14160,
14174,
14184,
14196,
14206,
14234,
14244,
14250,
14251,
14274,
14280,
14292,
14302,
14336,
14350,
14410,
14424,
14434,
14446,
14456,
14484,
14494,
14500,
14501,
14524,
14530,
14542,
14552,
14584,
14598,
14629,
14713,
14799,
14884,
14970,
14971,
15033,
15047,
15057,
15069,
15079,
15105,
15115,
15121,
15122,
15145,
15151,
15171,
15181,
15212,
15226,
15256,
15341,
15355,
15365,
15377,
15387,
15412,
15422,
15428,
15430,
15431,
15582,
15583,
16102,
16103,
16155,
16157,
16253,
16259,
16332,
16338,
16339,
16439,
16445,
16498,
16504,
16505,
16547,
16553,
16586,
16624,
16625,
16660,
16695,
16696,
16734,
16786,
16787,
16805,
16811,
16813,
16814,
17120,
17121,
17352,
17353,
17387,
17388,
17537,
17538,
17610,
17611,
17638,
17700,
17746,
17801,
17802,
17925,
17926,
18086,
18087,
18225,
18226,
18285,
18353,
18411,
18472,
18513,
18541,
18570,
18610,
18688,
18709,
18710,
18749,
18826,
18847,
18848,
18911,
18941,
18970,
18971,
18989,
19026,
19079,
19117,
19118,
19159,
19211,
19212,
19249,
19293,
19294,
19339,
19378,
19452,
19510,
19577,
19578,
19625,
19666,
19740,
19798,
19867,
19868,
19914,
19934,
19963,
20004,
20062,
20133,
20186,
20239,
20293,
20324,
20354,
20375,
20398,
20417,
20436,
20437,
20673,
20674,
20693,
20694
],
"line_end_idx": [
1,
11,
12,
13,
52,
53,
440,
441,
1042,
1043,
1073,
1074,
1303,
1304,
1380,
1381,
1431,
1433,
1529,
1535,
1567,
1573,
1574,
1674,
1680,
1716,
1722,
1724,
1725,
1913,
1914,
2274,
2275,
2551,
2552,
2685,
2686,
3060,
3061,
3120,
3188,
3246,
3304,
3341,
3369,
3398,
3457,
3487,
3516,
3517,
3551,
3582,
3605,
3652,
3704,
3705,
3735,
3778,
3828,
3893,
3947,
4025,
4026,
4057,
4080,
4127,
4179,
4180,
4210,
4253,
4303,
4368,
4422,
4500,
4519,
4534,
4535,
4675,
4676,
5143,
5144,
5159,
5160,
5326,
5327,
5558,
5559,
5859,
5860,
6417,
6418,
6619,
6620,
6649,
6650,
6821,
6822,
6878,
6880,
6918,
6919,
6958,
6959,
7055,
7061,
7116,
7122,
7123,
7223,
7229,
7275,
7281,
7283,
7284,
7720,
7721,
7780,
7848,
7906,
7967,
8007,
8035,
8064,
8103,
8161,
8230,
8251,
8252,
8292,
8361,
8382,
8412,
8441,
8442,
8476,
8522,
8578,
8618,
8658,
8678,
8707,
8767,
8814,
8858,
8942,
9023,
9105,
9150,
9181,
9211,
9232,
9255,
9256,
9302,
9358,
9401,
9441,
9461,
9490,
9550,
9597,
9641,
9725,
9799,
9876,
9921,
9952,
9982,
10016,
10076,
10123,
10167,
10248,
10324,
10402,
10447,
10478,
10513,
10534,
10557,
10558,
10604,
10660,
10701,
10741,
10774,
10819,
10849,
10909,
10956,
11000,
11082,
11155,
11218,
11306,
11404,
11490,
11571,
11645,
11646,
11720,
11783,
11870,
11960,
12044,
12089,
12164,
12223,
12268,
12299,
12330,
12351,
12374,
12393,
12408,
12409,
12800,
12801,
12819,
12820,
12928,
12929,
12958,
12959,
13375,
13376,
13594,
13595,
13651,
13653,
13670,
13687,
13688,
13750,
13751,
13773,
13779,
13791,
13801,
13835,
13849,
13909,
13923,
13933,
13945,
13955,
13983,
13993,
13999,
14000,
14024,
14030,
14042,
14052,
14086,
14100,
14160,
14174,
14184,
14196,
14206,
14234,
14244,
14250,
14251,
14274,
14280,
14292,
14302,
14336,
14350,
14410,
14424,
14434,
14446,
14456,
14484,
14494,
14500,
14501,
14524,
14530,
14542,
14552,
14584,
14598,
14629,
14713,
14799,
14884,
14970,
14971,
15033,
15047,
15057,
15069,
15079,
15105,
15115,
15121,
15122,
15145,
15151,
15171,
15181,
15212,
15226,
15256,
15341,
15355,
15365,
15377,
15387,
15412,
15422,
15428,
15430,
15431,
15582,
15583,
16102,
16103,
16155,
16157,
16253,
16259,
16332,
16338,
16339,
16439,
16445,
16498,
16504,
16505,
16547,
16553,
16586,
16624,
16625,
16660,
16695,
16696,
16734,
16786,
16787,
16805,
16811,
16813,
16814,
17120,
17121,
17352,
17353,
17387,
17388,
17537,
17538,
17610,
17611,
17638,
17700,
17746,
17801,
17802,
17925,
17926,
18086,
18087,
18225,
18226,
18285,
18353,
18411,
18472,
18513,
18541,
18570,
18610,
18688,
18709,
18710,
18749,
18826,
18847,
18848,
18911,
18941,
18970,
18971,
18989,
19026,
19079,
19117,
19118,
19159,
19211,
19212,
19249,
19293,
19294,
19339,
19378,
19452,
19510,
19577,
19578,
19625,
19666,
19740,
19798,
19867,
19868,
19914,
19934,
19963,
20004,
20062,
20133,
20186,
20239,
20293,
20324,
20354,
20375,
20398,
20417,
20436,
20437,
20673,
20674,
20693,
20694,
20712
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 20712,
"ccnet_original_nlines": 432,
"rps_doc_curly_bracket": 0.005697180051356554,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24724602699279785,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009485919959843159,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.32129743695259094,
"rps_doc_frac_unique_words": 0.25090721249580383,
"rps_doc_mean_word_length": 6.703991889953613,
"rps_doc_num_sentences": 151,
"rps_doc_symbol_to_word_ratio": 0.0003060000017285347,
"rps_doc_unigram_entropy": 5.324741840362549,
"rps_doc_word_count": 1929,
"rps_doc_frac_chars_dupe_10grams": 0.04175687953829765,
"rps_doc_frac_chars_dupe_5grams": 0.1347046047449112,
"rps_doc_frac_chars_dupe_6grams": 0.11862047761678696,
"rps_doc_frac_chars_dupe_7grams": 0.09000927954912186,
"rps_doc_frac_chars_dupe_8grams": 0.077482208609581,
"rps_doc_frac_chars_dupe_9grams": 0.052582740783691406,
"rps_doc_frac_chars_top_2gram": 0.00989792961627245,
"rps_doc_frac_chars_top_3gram": 0.01051655039191246,
"rps_doc_frac_chars_top_4gram": 0.011599129997193813,
"rps_doc_books_importance": -1854.6900634765625,
"rps_doc_books_importance_length_correction": -1854.6900634765625,
"rps_doc_openwebtext_importance": -964.8915405273438,
"rps_doc_openwebtext_importance_length_correction": -964.8915405273438,
"rps_doc_wikipedia_importance": -635.6851806640625,
"rps_doc_wikipedia_importance_length_correction": -635.6851806640625
},
"fasttext": {
"dclm": 0.3442866802215576,
"english": 0.5875832438468933,
"fineweb_edu_approx": 3.031018018722534,
"eai_general_math": 0.7912900447845459,
"eai_open_web_math": 0.23219335079193115,
"eai_web_code": 0.882355272769928
}
}
|
{
"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": "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": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,772,336,304,999,111,000 |
Campaign Content
Retrieve historical UTM content data
GETtrends/campaign_content
Retrieves a list of summarised UTM content metrics over a given time period.
Query String Parameters
from
String
The start date-time for the query
to
String
The end date-time for the query
dateFormat
String
The format that any date parameters will be returned in. This takes any value permitted by Moment.
format
StringDefault Value: json
Accepted values: json, csv
The response format required (overrides header)
limit
StringDefault Value: 0,20
The maximum number of results e.g. 10 to return with an optional offset e.g. 5,10
Run in PostmanPostman is a useful developer tool for experimenting with and managing APIs that you work with
Definition
GET https://api.gosquared.com/trends/v2/campaign_content
Example Request
var GoSquared = require('gosquared');
var gosquared = new GoSquared({
api_key: 'demo',
site_token: 'GSN-106863-S'
});
gosquared.trends.v2.campaign_content(function(err, res) {
if (err) return console.log(err);
console.log(res);
});
Live Responseundefined undefined
Your API Key is not authorised for this endpoint
Please fill in the required fields in the Query Builder
|
{
"url": "https://www.gosquared.com/docs/trends/campaign_content/node/",
"source_domain": "www.gosquared.com",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "23713",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DU7LED5PNOAXGOI46SGX3SXRGVUV2P4R",
"WARC-Concurrent-To": "<urn:uuid:d54891dc-3a65-4bd2-8087-3681b89cb520>",
"WARC-Date": "2020-07-06T06:43:59Z",
"WARC-IP-Address": "34.192.145.205",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OOPDXOCBTDZ3A5R2JF7FI6OI5OETE67X",
"WARC-Record-ID": "<urn:uuid:81950690-de10-473d-92fa-2b43a5a7692e>",
"WARC-Target-URI": "https://www.gosquared.com/docs/trends/campaign_content/node/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c9fc1f29-215d-4a4e-87c1-0eaa6edcbde6>"
},
"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-193.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,
17,
18,
55,
56,
83,
84,
161,
162,
186,
187,
192,
193,
200,
201,
235,
236,
239,
240,
247,
248,
280,
281,
292,
293,
300,
301,
400,
401,
408,
409,
435,
436,
463,
464,
512,
513,
519,
520,
546,
547,
629,
630,
739,
740,
751,
752,
809,
810,
826,
827,
865,
897,
916,
945,
949,
950,
1008,
1044,
1064,
1068,
1069,
1102,
1103,
1152,
1153
],
"line_end_idx": [
17,
18,
55,
56,
83,
84,
161,
162,
186,
187,
192,
193,
200,
201,
235,
236,
239,
240,
247,
248,
280,
281,
292,
293,
300,
301,
400,
401,
408,
409,
435,
436,
463,
464,
512,
513,
519,
520,
546,
547,
629,
630,
739,
740,
751,
752,
809,
810,
826,
827,
865,
897,
916,
945,
949,
950,
1008,
1044,
1064,
1068,
1069,
1102,
1103,
1152,
1153,
1208
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1208,
"ccnet_original_nlines": 65,
"rps_doc_curly_bracket": 0.0033112599048763514,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.20425531268119812,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025531910359859467,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2595744729042053,
"rps_doc_frac_unique_words": 0.6967741847038269,
"rps_doc_mean_word_length": 6.0580644607543945,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.511004447937012,
"rps_doc_word_count": 155,
"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.028753990307450294,
"rps_doc_frac_chars_top_3gram": 0.029818959534168243,
"rps_doc_frac_chars_top_4gram": 0.04046858102083206,
"rps_doc_books_importance": -74.49995422363281,
"rps_doc_books_importance_length_correction": -74.49995422363281,
"rps_doc_openwebtext_importance": -32.90353012084961,
"rps_doc_openwebtext_importance_length_correction": -32.90262222290039,
"rps_doc_wikipedia_importance": -25.700456619262695,
"rps_doc_wikipedia_importance_length_correction": -25.700456619262695
},
"fasttext": {
"dclm": 0.026851650327444077,
"english": 0.5878491997718811,
"fineweb_edu_approx": 1.226805567741394,
"eai_general_math": 0.03668886050581932,
"eai_open_web_math": 0.013094129972159863,
"eai_web_code": 0.7822287082672119
}
}
|
{
"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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,147,050,775,680,667,000 |
Git开源工具Github Selfies、Magit、GitCompound、dgit介绍
以下为你介绍的Git开源工具都可用在Linux系统上：Github Selfies（Github 自拍插件）、Magit（Emacs 的 Git 扩展）、GitCompound（Git 项目构建工具）、dgit（获取任意包的 Git 视图）。
1、Github Selfies（Github 自拍插件）
Git开源工具Github Selfies、Magit、GitCompound、dgit介绍
Github Selfies 可以在你 Github 的需求和贡献上加上你的自拍照。
首先，克隆此存储库：git clone https://github.com/thieman/github-selfies，然后按照给定平台的说明进行操作，为了方便起见，您可以运行./build.sh来构建和打包Chrome和Firefox扩展。
Chrome：
1]、在Chrome中启用Chrome扩展程序开发人员模式。
2]、在设置>扩展程序中，单击“加载解压缩的扩展程序（Load unpacked extension）”，然后选择此存储库的chrome/子文件夹。
火狐浏览器：
1]、安装NodeJS和npm。
2]、安装jpm（npm install -g jpm）。
3]、从该存储库的firefox/子文件夹中运行jpm run。
下载地址：https://github.com/thieman/github-selfies
2、Magit（Emacs 的 Git 扩展）
Git开源工具Github Selfies、Magit、GitCompound、dgit介绍
Magit 是 Git 版本控制系统的接口，作为一个 Emacs 包实现的。它封装了绝大多数 Git 命令，可直接在 Emacs 编辑器中使用。
下载地址：https://github.com/magit/magit
3、GitCompound（Git 项目构建工具）
GitCompound 可以用 Git 库和 Ruby 任务建立你的项目。它结合了 Git 子模块的功能和类似 Bundler 或者 Composer 的公共依赖管理器。
核心特点：
GitCompound 引入了特定领域的语言来设计 manifest。
Manifest 文件用于指定的项目。
Manifest 可以用不版本策略来描述组件依赖 (Rubygems 类似的版本，标签，分支或者确定的 SHA)。
Manifests 可以用分级的方式进行处理。
示例代码：
name :base_component
maintainer 'Your Name <[email protected]>'
component :vendor_1 do
version '~>1.1'
source '[email protected]:/user/repository'
destination 'src/component_1'
end
component :second_component do
version '>=2.0'
source '[email protected]:/user/repository_2'
destination 'src/component_2'
end
component :my_component do
branch 'feature/new-feature'
source '/my/component_3/repository'
destination 'src/component_3'
end
task 'print details', :each do |_path, component|
puts "Component `#{component.name}` installed in #{component.path}"
end
下载地址：https://github.com/grzesiek/git_compound/
4、dgit（获取任意包的 Git 视图）
Git开源工具Github Selfies、Magit、GitCompound、dgit介绍
dgit 允许你把 Debian 文档看成一个 Git 库，可以获取任意包的 Git 视图。如果你有足够的访问权限，可以上传到 Git，或者从 Git 构建，其他 dgit 用户可以看到你的 Git 库。
下载地址：https://browse.dgit.debian.org/dgit.git/
注明
以上就是Git开源工具Github Selfies、Magit、GitCompound、dgit的介绍内容，这些Git开源工具都能使用在Linux操作系统中。
栏目相关文章
|
{
"url": "https://www.linux110.com/ruanjian/1046.html",
"source_domain": "www.linux110.com",
"snapshot_id": "crawl=CC-MAIN-2020-16",
"warc_metadata": {
"Content-Length": "11719",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:76B4L2HD7TFH5EYDL7PGVLKNFJ7QWOQQ",
"WARC-Concurrent-To": "<urn:uuid:ab24db6c-6ed6-4eb1-8d63-cff063194eb1>",
"WARC-Date": "2020-03-28T08:56:09Z",
"WARC-IP-Address": "47.94.218.17",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LJPUTYP4S7O7OYRWLIFDN3YU2KIJXWDX",
"WARC-Record-ID": "<urn:uuid:25e46314-7556-4a89-a9b3-bbd3eb922e32>",
"WARC-Target-URI": "https://www.linux110.com/ruanjian/1046.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:627d8dbf-3ecd-4c58-af05-9c48414edfd0>"
},
"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-202.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,
47,
48,
170,
171,
201,
202,
249,
250,
293,
294,
418,
419,
427,
428,
459,
460,
535,
536,
543,
544,
561,
562,
592,
593,
626,
627,
674,
675,
699,
700,
747,
748,
821,
822,
858,
859,
885,
886,
973,
974,
980,
981,
1017,
1018,
1038,
1039,
1097,
1098,
1122,
1123,
1129,
1130,
1151,
1152,
1200,
1201,
1224,
1225,
1241,
1242,
1284,
1285,
1315,
1316,
1320,
1321,
1352,
1353,
1369,
1370,
1414,
1415,
1445,
1446,
1450,
1451,
1478,
1479,
1508,
1509,
1546,
1547,
1577,
1578,
1582,
1583,
1633,
1634,
1702,
1703,
1707,
1708,
1755,
1756,
1778,
1779,
1826,
1827,
1930,
1931,
1977,
1978,
1981,
1982,
2062,
2063
],
"line_end_idx": [
47,
48,
170,
171,
201,
202,
249,
250,
293,
294,
418,
419,
427,
428,
459,
460,
535,
536,
543,
544,
561,
562,
592,
593,
626,
627,
674,
675,
699,
700,
747,
748,
821,
822,
858,
859,
885,
886,
973,
974,
980,
981,
1017,
1018,
1038,
1039,
1097,
1098,
1122,
1123,
1129,
1130,
1151,
1152,
1200,
1201,
1224,
1225,
1241,
1242,
1284,
1285,
1315,
1316,
1320,
1321,
1352,
1353,
1369,
1370,
1414,
1415,
1445,
1446,
1450,
1451,
1478,
1479,
1508,
1509,
1546,
1547,
1577,
1578,
1582,
1583,
1633,
1634,
1702,
1703,
1707,
1708,
1755,
1756,
1778,
1779,
1826,
1827,
1930,
1931,
1977,
1978,
1981,
1982,
2062,
2063,
2069
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2069,
"ccnet_original_nlines": 106,
"rps_doc_curly_bracket": 0.0019333000527694821,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.04454343020915985,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0022271699272096157,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5723830461502075,
"rps_doc_frac_unique_words": 0.74842768907547,
"rps_doc_mean_word_length": 10.823899269104004,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0.004454339854419231,
"rps_doc_unigram_entropy": 4.571324825286865,
"rps_doc_word_count": 159,
"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.10459034889936447,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -206.1710968017578,
"rps_doc_books_importance_length_correction": -206.1710968017578,
"rps_doc_openwebtext_importance": -122.74037170410156,
"rps_doc_openwebtext_importance_length_correction": -122.74037170410156,
"rps_doc_wikipedia_importance": -89.93511962890625,
"rps_doc_wikipedia_importance_length_correction": -89.93511962890625
},
"fasttext": {
"dclm": 0.8451395630836487,
"english": 0.025470100343227386,
"fineweb_edu_approx": 3.420396089553833,
"eai_general_math": 0.034186240285634995,
"eai_open_web_math": 0.024504009634256363,
"eai_web_code": 0.8874990940093994
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.135",
"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": "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": "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": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,792,639,274,481,224,000 |
+0
0
14
1
avatar+8
For some real number a and some positive integer n, the first few terms in the expansion of (1 + ax)^n are \[1 - 20x + 150x^2 + cx^3 + \dotsb.\]Find c.
Mar 13, 2023
edited by Starziq Mar 13, 2023
edited by Starziq Mar 13, 2023
#1
avatar
+1
We notice that the first three terms of the expansion are given as:
(1 + ax)^n = 1 + (n)(ax) + (n)(n-1)/(2!)(ax)^2 + ...
Comparing this with the given expansion, we have:
1 - 20x + 150x^2 + cx^3 + ... = 1 + (n)(ax) + (n)(n-1)/(2!)(ax)^2 + ...
Therefore, we can see that:
n = -20a
(n)(n-1)/(2!) = 150a^2
Solving for a and n, we have:
a = -3/10 and n = 12
Substituting these values back into the expansion, we have:
(1 - 0.3x)^12 = 1 - 20x + 150x^2 - 600x^3/7 + ...
Therefore, the missing coefficient is -600/7.
Mar 13, 2023
7 Online Users
avatar
avatar
|
{
"url": "https://web2.0calc.com/questions/binomial-theorem-question",
"source_domain": "web2.0calc.com",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "21533",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:75WPNV4YMBLGSIOGEQMXC6PXPADTNULW",
"WARC-Concurrent-To": "<urn:uuid:207b0b65-835a-4408-8cde-2d90edbeef9b>",
"WARC-Date": "2023-03-25T17:12:59Z",
"WARC-IP-Address": "49.12.76.224",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IR2RWFV22IOEBTNIDU2UDYO27GIL4M5D",
"WARC-Record-ID": "<urn:uuid:0ed5cf34-8e72-4849-9e8b-d07f3e18e0ec>",
"WARC-Target-URI": "https://web2.0calc.com/questions/binomial-theorem-question",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:dd3e019d-9e53-453b-9335-1a6dabef5f56>"
},
"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-113\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,
7,
9,
11,
14,
16,
26,
27,
179,
180,
194,
226,
258,
262,
269,
272,
273,
341,
342,
395,
396,
446,
447,
519,
520,
548,
549,
558,
559,
582,
583,
613,
614,
635,
636,
696,
697,
747,
748,
794,
795,
809,
810,
825,
826,
833
],
"line_end_idx": [
2,
7,
9,
11,
14,
16,
26,
27,
179,
180,
194,
226,
258,
262,
269,
272,
273,
341,
342,
395,
396,
446,
447,
519,
520,
548,
549,
558,
559,
582,
583,
613,
614,
635,
636,
696,
697,
747,
748,
794,
795,
809,
810,
825,
826,
833,
839
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 839,
"ccnet_original_nlines": 46,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2319391667842865,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0.06382978707551956,
"rps_doc_frac_no_alph_words": 0.5551331043243408,
"rps_doc_frac_unique_words": 0.518796980381012,
"rps_doc_mean_word_length": 3.872180461883545,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0.01901140995323658,
"rps_doc_unigram_entropy": 3.994760274887085,
"rps_doc_word_count": 133,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.11067961156368256,
"rps_doc_frac_chars_dupe_6grams": 0.11067961156368256,
"rps_doc_frac_chars_dupe_7grams": 0.11067961156368256,
"rps_doc_frac_chars_dupe_8grams": 0.11067961156368256,
"rps_doc_frac_chars_dupe_9grams": 0.11067961156368256,
"rps_doc_frac_chars_top_2gram": 0.03883495181798935,
"rps_doc_frac_chars_top_3gram": 0.06990291178226471,
"rps_doc_frac_chars_top_4gram": 0.04660193994641304,
"rps_doc_books_importance": -121.75786590576172,
"rps_doc_books_importance_length_correction": -121.75786590576172,
"rps_doc_openwebtext_importance": -85.01337432861328,
"rps_doc_openwebtext_importance_length_correction": -83.74464416503906,
"rps_doc_wikipedia_importance": -39.1842155456543,
"rps_doc_wikipedia_importance_length_correction": -39.1842155456543
},
"fasttext": {
"dclm": 0.9963189959526062,
"english": 0.7247040867805481,
"fineweb_edu_approx": 1.194825530052185,
"eai_general_math": 0.9992450475692749,
"eai_open_web_math": 0.8649171590805054,
"eai_web_code": 0.22126322984695435
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512.0",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "515.0",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Calculus and Mathematical analysis"
}
}
},
"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": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,312,311,177,344,984,000 |
MySQL Forums
Forum List » Partitioning
Is partitioning likely useful for this application
Posted by: Steve Fatula
Date: January 13, 2017 05:02PM
Let's say I have a table of products with lots of data in it, 15GB. Just for the sake of argument, say 12,000,000 rows. This table has built up over the years as new products come and go. Products are never removed for a variety of reasons. So, say today half of those are active products, the rest are inactive, and in rare cases, inactive products can be re-activated. Products are activated and inactivated during the day.
Let's further say there this table ends up feeding a variety of systems, each with their own unique data requirements. So, some data might go to system A, some data might go to system B after joining with various other tables, etc.
In the end, the problem has become the time to serial read the table to pick out active items to be processed in 100 or so different ways and purposes. Not that any one particular use by itself is overly slow, but, when you have so many different systems needing the data, each in different ways with many different tables potentially needing joined, it can get lengthy when all added up, and, if there was a simple way to halve this time, that would be a gold mine.
So, do not worry about mixing such queries with online purposes, not the case here. I realize there are many potential ways to tackle this, but for various reasons, most of them are just not feasible. So, let's stay OT here and only deal with partitioning as a potential solution as there is no need to discuss the myriad of other potential ways to deal with it and I am not asking about those.
Would partitioning on a single field, active or inactive flag, likely be a good way to deal with this, i.e., we would then easily read only the active products for 99% of our processes that need only active items. Anything else that also needs inactive products can get those also by reading the entire table. Seems like if 50% of the items are active, then, the time will be around 50% to retrieve those over the table as is.
Is there any potential downside to this method, or, will the performance not likely be as good as it may seem to me?
Options: ReplyQuote
Subject
Views
Written By
Posted
Is partitioning likely useful for this application
1541
January 13, 2017 05:02PM
Sorry, you can't reply to this topic. It has been closed.
Content reproduced on this site is the property of the respective copyright holders. It is not reviewed in advance by Oracle and does not necessarily represent the opinion of Oracle or any other party.
|
{
"url": "https://forums.mysql.com/read.php?106,654225,654225",
"source_domain": "forums.mysql.com",
"snapshot_id": "crawl=CC-MAIN-2020-40",
"warc_metadata": {
"Content-Length": "22422",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VUBCHU3KXIDZZ3NI4GMGMODPSRSELE3X",
"WARC-Concurrent-To": "<urn:uuid:843ac7fc-f7f0-49d0-b973-33f8e62389e1>",
"WARC-Date": "2020-09-25T22:46:28Z",
"WARC-IP-Address": "137.254.60.13",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BB2CQZIKWH4ZJ3X63LV6P2ZLRI5YLKG5",
"WARC-Record-ID": "<urn:uuid:38f77b9b-14aa-49d9-8b0b-712147186d36>",
"WARC-Target-URI": "https://forums.mysql.com/read.php?106,654225,654225",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5fa1bab8-3fee-4172-8d03-c22b905af515>"
},
"warc_info": "isPartOf: CC-MAIN-2020-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-232.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,
13,
41,
42,
93,
117,
148,
149,
575,
576,
808,
809,
1276,
1277,
1672,
1673,
2100,
2101,
2218,
2219,
2239,
2240,
2241,
2249,
2255,
2266,
2273,
2324,
2329,
2354,
2355,
2356,
2414,
2415
],
"line_end_idx": [
13,
41,
42,
93,
117,
148,
149,
575,
576,
808,
809,
1276,
1277,
1672,
1673,
2100,
2101,
2218,
2219,
2239,
2240,
2241,
2249,
2255,
2266,
2273,
2324,
2329,
2354,
2355,
2356,
2414,
2415,
2616
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2616,
"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.49272727966308594,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016363639384508133,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15636363625526428,
"rps_doc_frac_unique_words": 0.4669509530067444,
"rps_doc_mean_word_length": 4.394456386566162,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.013713836669922,
"rps_doc_word_count": 469,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0650169774889946,
"rps_doc_frac_chars_dupe_6grams": 0.0650169774889946,
"rps_doc_frac_chars_dupe_7grams": 0.0426977202296257,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.011644829995930195,
"rps_doc_frac_chars_top_3gram": 0.019408050924539566,
"rps_doc_frac_chars_top_4gram": 0.025230469182133675,
"rps_doc_books_importance": -209.11563110351562,
"rps_doc_books_importance_length_correction": -209.11563110351562,
"rps_doc_openwebtext_importance": -136.27613830566406,
"rps_doc_openwebtext_importance_length_correction": -136.27613830566406,
"rps_doc_wikipedia_importance": -107.02381896972656,
"rps_doc_wikipedia_importance_length_correction": -107.02381896972656
},
"fasttext": {
"dclm": 0.31431543827056885,
"english": 0.9659603834152222,
"fineweb_edu_approx": 1.8091226816177368,
"eai_general_math": 0.558177649974823,
"eai_open_web_math": 0.22490298748016357,
"eai_web_code": 0.2633669972419739
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.746",
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,443,484,716,754,628,000 |
Kingsumo.com Site Title
KingSumo Giveaways for WordPress
Kingsumo.com Test Results
Kingsumo.com Mobile Usability: 100/100
Kingsumo.com Mobile Speed: 47/100
Quick overview:
Eliminate render-blocking JavaScript and CSS in above-the-fold content
Your page has 6 blocking script resources and 9 blocking CSS resources. This causes a delay in rendering your page.
Remove render-blocking JavaScript:
http://kingsumo.com/wp-content/themes/king-sumo-theme/js/jquery/dist/jquery.min.js
...
Optimize CSS Delivery of the following:
http://kingsumo.com/wp-content/themes/king-sumo-theme/css/app.css
...
Enable compression
Compressing resources with gzip or deflate can reduce the number of bytes sent over the network.
Enable compression for the following resources to reduce their transfer size by 309.9KiB (73% reduction).
Compressing http://kingsumo.com/wp-content/themes/king-sumo-theme/css/app.css could save 112.6KiB (85% reduction).
...
Leverage browser caching
Setting an expiry date or a maximum age in the HTTP headers for static resources instructs the browser to load previously downloaded resources from local disk rather than over the network.
Leverage browser caching for the following cacheable resources:
http://kingsumo.com/wp-content/plugins/affiliate-wp/assets/js/jquery.cookie.min.js (expiration not specified)
...
Reduce server response time
Optimize images
Properly formatting and compressing images can save many bytes of data.
Optimize the following images to reduce their size by 7.2KiB (39% reduction).
Compressing http://kingsumo.com/wp-content/themes/king-sumo-theme/assets/img/ks-giveaways-viral-256.png could save 2.6KiB (45% reduction).
...
Minify HTML
Compacting HTML code, including any inline JavaScript and CSS contained in it, can save many bytes of data and speed up download and parse times.
Minify HTML for the following resources to reduce their size by 3.1KiB (17% reduction).
Minifying http://kingsumo.com/ could save 3.1KiB (17% reduction).
Minify JavaScript
Compacting JavaScript code can save many bytes of data and speed up downloading, parsing, and execution time.
Minify JavaScript for the following resources to reduce their size by 1.5KiB (16% reduction).
Minifying http://kingsumo.com/wp-content/plugins/contact-form-7/includes/js/scripts.js could save 1.5KiB (16% reduction).
Similar tests
www.kingsumo.com
www.kingsumo.net
www.kingsumo.org
www.kingsumo.info
www.kingsumo.biz
www.kingsumo.us
www.kingsumo.mobi
www.ingsumo.com
www.kingsumo.com
www.jingsumo.com
www.kjingsumo.com
www.jkingsumo.com
www.iingsumo.com
www.kiingsumo.com
www.ikingsumo.com
www.mingsumo.com
www.kmingsumo.com
www.mkingsumo.com
www.lingsumo.com
www.klingsumo.com
www.lkingsumo.com
www.oingsumo.com
www.koingsumo.com
www.okingsumo.com
www.kngsumo.com
www.kungsumo.com
www.kiungsumo.com
www.kuingsumo.com
www.kjngsumo.com
www.kijngsumo.com
www.kkngsumo.com
www.kikngsumo.com
www.kkingsumo.com
www.kongsumo.com
www.kiongsumo.com
www.kigsumo.com
www.kibgsumo.com
www.kinbgsumo.com
www.kibngsumo.com
www.kihgsumo.com
www.kinhgsumo.com
www.kihngsumo.com
www.kijgsumo.com
www.kinjgsumo.com
www.kimgsumo.com
www.kinmgsumo.com
www.kimngsumo.com
www.kinsumo.com
www.kinfsumo.com
www.kingfsumo.com
www.kinfgsumo.com
www.kinvsumo.com
www.kingvsumo.com
www.kinvgsumo.com
www.kintsumo.com
www.kingtsumo.com
www.kintgsumo.com
www.kinbsumo.com
www.kingbsumo.com
www.kinysumo.com
www.kingysumo.com
www.kinygsumo.com
www.kinhsumo.com
www.kinghsumo.com
www.kingumo.com
www.kingwumo.com
www.kingswumo.com
www.kingwsumo.com
www.kingeumo.com
www.kingseumo.com
www.kingesumo.com
www.kingdumo.com
www.kingsdumo.com
www.kingdsumo.com
www.kingzumo.com
www.kingszumo.com
www.kingzsumo.com
www.kingxumo.com
www.kingsxumo.com
www.kingxsumo.com
www.kingaumo.com
www.kingsaumo.com
www.kingasumo.com
www.kingsmo.com
www.kingsymo.com
www.kingsuymo.com
www.kingsyumo.com
www.kingshmo.com
www.kingsuhmo.com
www.kingshumo.com
www.kingsjmo.com
www.kingsujmo.com
www.kingsjumo.com
www.kingsimo.com
www.kingsuimo.com
www.kingsiumo.com
www.kingsuo.com
www.kingsuno.com
www.kingsumno.com
www.kingsunmo.com
www.kingsujo.com
www.kingsumjo.com
www.kingsuko.com
www.kingsumko.com
www.kingsukmo.com
www.kingsum.com
www.kingsumi.com
www.kingsumoi.com
www.kingsumio.com
www.kingsumk.com
www.kingsumok.com
www.kingsuml.com
www.kingsumol.com
www.kingsumlo.com
www.kingsump.com
www.kingsumop.com
www.kingsumpo.com
www.kingsumo.con
Last Tested:
This website uses cookies to ensure you get the best experience on our website. Learn more. Got it.
|
{
"url": "http://minify.mobi/results/kingsumo.com",
"source_domain": "minify.mobi",
"snapshot_id": "crawl=CC-MAIN-2016-50",
"warc_metadata": {
"Content-Length": "161604",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KJRSQH34FMQP6MEXSMHGUV2BDBXMELV7",
"WARC-Concurrent-To": "<urn:uuid:b2cecccf-c18c-4509-8ee4-2a92ecd12841>",
"WARC-Date": "2016-12-11T12:15:19Z",
"WARC-IP-Address": "159.148.27.197",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:QISCI7GJ3OL72NMTWYQ7R2YIE75QV43F",
"WARC-Record-ID": "<urn:uuid:e920cc0a-6b33-4d5b-af51-e63a070eea6e>",
"WARC-Target-URI": "http://minify.mobi/results/kingsumo.com",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f5408043-e0f6-447d-bc2a-5c007756b743>"
},
"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,
24,
25,
58,
59,
85,
86,
125,
126,
160,
161,
177,
248,
364,
399,
482,
486,
526,
592,
596,
615,
712,
818,
933,
937,
962,
1151,
1215,
1325,
1329,
1357,
1373,
1445,
1523,
1662,
1666,
1678,
1824,
1912,
1978,
1996,
2106,
2200,
2322,
2323,
2337,
2354,
2371,
2388,
2406,
2423,
2439,
2457,
2473,
2490,
2507,
2525,
2543,
2560,
2578,
2596,
2613,
2631,
2649,
2666,
2684,
2702,
2719,
2737,
2755,
2771,
2788,
2806,
2824,
2841,
2859,
2876,
2894,
2912,
2929,
2947,
2963,
2980,
2998,
3016,
3033,
3051,
3069,
3086,
3104,
3121,
3139,
3157,
3173,
3190,
3208,
3226,
3243,
3261,
3279,
3296,
3314,
3332,
3349,
3367,
3384,
3402,
3420,
3437,
3455,
3471,
3488,
3506,
3524,
3541,
3559,
3577,
3594,
3612,
3630,
3647,
3665,
3683,
3700,
3718,
3736,
3753,
3771,
3789,
3805,
3822,
3840,
3858,
3875,
3893,
3911,
3928,
3946,
3964,
3981,
3999,
4017,
4033,
4050,
4068,
4086,
4103,
4121,
4138,
4156,
4174,
4190,
4207,
4225,
4243,
4260,
4278,
4295,
4313,
4331,
4348,
4366,
4384,
4401,
4414,
4415
],
"line_end_idx": [
24,
25,
58,
59,
85,
86,
125,
126,
160,
161,
177,
248,
364,
399,
482,
486,
526,
592,
596,
615,
712,
818,
933,
937,
962,
1151,
1215,
1325,
1329,
1357,
1373,
1445,
1523,
1662,
1666,
1678,
1824,
1912,
1978,
1996,
2106,
2200,
2322,
2323,
2337,
2354,
2371,
2388,
2406,
2423,
2439,
2457,
2473,
2490,
2507,
2525,
2543,
2560,
2578,
2596,
2613,
2631,
2649,
2666,
2684,
2702,
2719,
2737,
2755,
2771,
2788,
2806,
2824,
2841,
2859,
2876,
2894,
2912,
2929,
2947,
2963,
2980,
2998,
3016,
3033,
3051,
3069,
3086,
3104,
3121,
3139,
3157,
3173,
3190,
3208,
3226,
3243,
3261,
3279,
3296,
3314,
3332,
3349,
3367,
3384,
3402,
3420,
3437,
3455,
3471,
3488,
3506,
3524,
3541,
3559,
3577,
3594,
3612,
3630,
3647,
3665,
3683,
3700,
3718,
3736,
3753,
3771,
3789,
3805,
3822,
3840,
3858,
3875,
3893,
3911,
3928,
3946,
3964,
3981,
3999,
4017,
4033,
4050,
4068,
4086,
4103,
4121,
4138,
4156,
4174,
4190,
4207,
4225,
4243,
4260,
4278,
4295,
4313,
4331,
4348,
4366,
4384,
4401,
4414,
4415,
4514
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4514,
"ccnet_original_nlines": 165,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.19538187980651855,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007104800082743168,
"rps_doc_frac_lines_end_with_ellipsis": 0.030120480805635452,
"rps_doc_frac_no_alph_words": 0.36323267221450806,
"rps_doc_frac_unique_words": 0.6528117656707764,
"rps_doc_mean_word_length": 8.990220069885254,
"rps_doc_num_sentences": 285,
"rps_doc_symbol_to_word_ratio": 0.004440499935299158,
"rps_doc_unigram_entropy": 5.329646587371826,
"rps_doc_word_count": 409,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06200706958770752,
"rps_doc_frac_chars_dupe_6grams": 0.05683981999754906,
"rps_doc_frac_chars_dupe_7grams": 0.05085667967796326,
"rps_doc_frac_chars_dupe_8grams": 0.04079413041472435,
"rps_doc_frac_chars_dupe_9grams": 0.04079413041472435,
"rps_doc_frac_chars_top_2gram": 0.019581180065870285,
"rps_doc_frac_chars_top_3gram": 0.01631765067577362,
"rps_doc_frac_chars_top_4gram": 0.019581180065870285,
"rps_doc_books_importance": -447.2645568847656,
"rps_doc_books_importance_length_correction": -447.2645568847656,
"rps_doc_openwebtext_importance": -238.80661010742188,
"rps_doc_openwebtext_importance_length_correction": -238.80661010742188,
"rps_doc_wikipedia_importance": -144.02511596679688,
"rps_doc_wikipedia_importance_length_correction": -144.02511596679688
},
"fasttext": {
"dclm": 0.09939485788345337,
"english": 0.617107629776001,
"fineweb_edu_approx": 2.6407575607299805,
"eai_general_math": 0.009061279706656933,
"eai_open_web_math": 0.011964979581534863,
"eai_web_code": 0.04133838042616844
}
}
|
{
"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.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": "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": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,086,203,672,265,725,000 |
Equivalence is a relationship in which two or more identifiers are abstractions for the same data structure.
learn more… | top users | synonyms
1
vote
1answer
40 views
Proving equivalence between non-tail-recursive and tail-recursive functions
I have a recursive function* that is similar to an "optional map", with the following signature: omap (f : option Z -> list nat) (l : list Z) : option (list nat) I defined an equivalent (modulo ...
0
votes
1answer
41 views
vectored input port driving output port of single bit net
Why are these two codes not equivalent? I am checking the logical equivalence between the two, they are failing, what could be the error? Will it take it as width mismatch, or net driven by multiple ...
0
votes
2answers
70 views
how to make a function which tells if two lists are equivalent in python
This question will be really annoying due to the fact it is for a class and we have a lot of restrictions on our code. The objective is to make a function to see if two lists (random ordered) have ...
0
votes
0answers
36 views
An equivalence relation on instances of a class
I'm a newbie to python, writing a python script to keep track of notation in a math paper. If the paper defines values (numbers, groups, etc.) with names "A", "B", "C", "D", I want to easily be able ...
0
votes
2answers
39 views
How do I Convert this expression to a DNF
I am able to get up to a certain point with this expression however not fully. Here is what I have done: (~~P or Q) => (~P or Q) (P or Q) => (~P or Q) ~(P or Q) or (~P or Q) (~P and ~Q) or (~P or ...
2
votes
1answer
53 views
Scheme equivalence relation
I need help defining a Scheme function that takes a partition (list of lists) and returns a list of pairs that represents an equivalence relation. I've started writing some code but I'm realizing I'm ...
0
votes
1answer
46 views
Fortran Equivalence
I want to use Equivalence. How can it be used in gfortran-5? I am using: Select Case (dst) Case ("cm") Equivalence :: (cm2Mm_r32, r32), (cm2Mm_r64, r64) Call qcdiv (qb, qa, r32, r64, cm2Mm_r128) ...
0
votes
2answers
57 views
Counting how many times a pair of words appears together in a text file using R
I have a function that takes in a document of text and two words that I want to find within that text, and I'm trying to figure out the probability that those 2 words appear next to each other in the ...
0
votes
2answers
60 views
Overloading equivalence (==) operator for custom class in Swift
Is it possible to overload equivalence (==) operator for a custom class inside that custom class. However I know that it is possible to have this operator overloaded outside class scope. Appreciate ...
1
vote
1answer
67 views
Is the domain & range of owl:equivalentClass rdfs:Class or owl:Class?
The domain and range of owl:equivalentClass raises some questions to which I have been unable to locate the answers. First of all, in OWL itself, the domain and range of owl:equivalentClass is set to ...
4
votes
1answer
65 views
Test for equivalence with only less than operator?
Say I have two literals of type 'T'. I'd like to test if they were equivalent, but type 'T' only has the "less than" operator implemented. How would I be able to test this in C++?
3
votes
2answers
89 views
In Matlab, how do I compare two container.Map objects element-wise?
I have two container.Map objects, with identical keys and values. Is there a Matlab function, that is going to return true in the following scenario: >> m1 = containers.Map('hi', 'ho'); ...
0
votes
1answer
68 views
Mysql to MongoDB and Query Equivalent to this schema
I have a complex location database with the following schema : table States id : INT PK AutoIncrement name : VarChar 50 UNIQUE table Counties id: INT PK AutoIncrement stateID : INT ForeignKey ...
1
vote
1answer
88 views
Trouble with EQUIVALENCE statements in Fortran 77 Code
I am working on getting a raytracing code working and I think I may have isolated the problem. I am new to working with Fortran 77, but would like to gain more experience using this language (even if ...
0
votes
0answers
48 views
HW Seems too easy - Overloading equivalency operator as a member and as a non-member function
The assignment is to create a class that implements a dynamic cstring (null-terminated char array).The default constructor should create an empty array and there should also be an overloaded ...
-6
votes
2answers
124 views
Equivalence percentage between two array [closed]
i need a way to compare two array and compute the Equivalence percentage so if equivalence Percentage exceed (for example 60%) do some actions used language is C# .NET 4.0
2
votes
1answer
237 views
IP address v4/v6 equivalence testing
Is it possible to test IP addresses for equivalence in a dual stack environment using both IPv4 and IPv6? If so, how? My application uses websocket++ on top of Boost ASIO. As an example, on my LAN, ...
-2
votes
1answer
104 views
C++'s equivalent of Matlab's randsample
Is there any cpp's equivalent of the randsample in Matlab. The function randsample in Matlab is as follows: y = randsample(n,k,true,w) which returns a weighted sample taken with replacement, using ...
1
vote
2answers
75 views
the equivalent of a javascript code in PHP [closed]
I would like to know what is the equivalent of the javascript code below in PHP: setTimeout ( "doSomething()", 5000 ); function doSomething ( ) { document.write('hello'); setTimeout ( ...
4
votes
1answer
117 views
What is the equivalence of python “type(<name>, <bases>, <dict>)” in c++?
Alright so, I'm embedding python 3.3 into a c++ application. I'm looking to dynamically create a python class on the c++ side exactly like if I was doing the following in python: my_type = ...
0
votes
2answers
123 views
Equivalence of Array types in Ada
While trying to make an ADA binding to a third party C/C++ library (SAPNWRFCSDK) I came to problems of type inference for array types: First problem: The Gnat-Binding-Generator from gcc (gcc ...
1
vote
2answers
90 views
Equivalence of java.util.ResourceBundle in C++
I have a Java class that uses more lines similar to the following ones private static final int PARAM_1 = ...
2
votes
2answers
69 views
Is there an equivalent in MS SQL Server to the <=> operator in MySQL?
I was just reading this question, about <=> in MySQL: What is this operator <=> in MySQL? Is there an equivalent to this for SQL Server?
1
vote
2answers
65 views
Testing equivalence of maps in Go with the same contents, but the test failed
Here is a word-count function in Go package wc import ( "regexp" "strings" ) type Histogram map[string]int func WordCount(input string) Histogram { histogram := make(map[string]int) ...
3
votes
1answer
65 views
Using an equivalence in the context to force reduction
The setting for this question is the same "merge of sorted lists" example from this earlier question. {-# OPTIONS --sized-types #-} open import Relation.Binary open import ...
1
vote
1answer
625 views
Testing - Equivalence partitioning / Boundary Value analysis on data which has variable boundaries
I have an input value I wish to test where the acceptable range is 1..n (n is variable but always positive). To give it some context, n is the quantity of a product in stock at any one time (which ...
5
votes
1answer
158 views
haskell check equality by function
In haskell I can use sortBy (comparing snd) to sort by the second value in a tuple. Is there an equivalent function for testing equivalency? I've come up with this but maybe there is something ...
0
votes
1answer
679 views
In Python, can you find a substring using a for loop and equivalence (==) ? No regex
Here is my problem: Write a program that takes two lines of input, we call the first needle and the second haystack. Print the number of times that needle occurs as a substring of haystack. I am ...
1
vote
3answers
94 views
Logical equivalence of a sequence of if else if else clauses
I am seriously under-slept and I need help in rewriting this small Python piece of logic for _ in range(100): if a: continue elif b: continue elif c and d: ...
-3
votes
7answers
74 views
Equivalance of two objects
Is there any library, given two objects of any java class would precisely say whether they are equal or not? (the class may not have hashCode defined) else is there any simple way to implement this?
1
vote
1answer
66 views
Why can't I check for string equivalence against stderr of Popen() in Python?
I'm running an ldaplist command from a Python script (not doing enough to warrant the ldap module): storage = Popen(["ldaplist", "-l", "passwd", "bob"], stdout=PIPE, stderr=PIPE) stdout, stderr = ...
1
vote
1answer
416 views
Comparing structure equality of lists
How can I check the structural equality of two lists in Scheme? For example, (a (b) (c d)) is equal to (a b (c d) (e f g)), and (a b) is equal to (a b c). The data content of the lists does not ...
3
votes
1answer
79 views
How to calculate the decomposition A=P[I_r,0;0,0]Q in Python?
Given matrix A, is it possible to conveniently get the invertible matrices P and Q that appear in the matrix equivalence and satisfy A=P[I_r,0;0,0]Q with numpy or scipy?
1
vote
1answer
56 views
Does Visual Basic use stucture or name type equivalence, or both?
Just having a hard time understanding if Visual Basic uses structure or name type equivalence (or both).
12
votes
2answers
4k views
Testing equivalence of maps (golang)
I have a table-driven test case like this one: func CountWords(s string) map[string]int func TestCountWords(t *testing.T) { var tests = []struct { input string want map[string]int }{ ...
0
votes
1answer
94 views
Is it more proper to use the equivalent operator or the equals() method to compare the contents of Strings? [duplicate]
I'm reading about the notion of interned strings: String s1 = "Hi"; String s2 = "Hi"; String s3 = new String("Hi"); System.out.println(s1 == s2); // true System.out.println(s1 == s3); // false ...
-2
votes
1answer
648 views
How to convert lattice-based graphics to ggplot2?
The attached script performs equivalence tests on sample variables x, y and z. equivalence.xyplot() is really handy, although the base lattice graphics are a pain to work with. How can I use ...
1
vote
1answer
327 views
Why is Matlab is not reading an empty cell while running an if statement?
I am using the loop below to isolate instances where data was recorded versus those with no data. The data set is very large (varying from 1000-6000 depending on the column) and of mixed data types, ...
0
votes
2answers
179 views
Vb.net equivalent of C#
What is the equivalent vb.net code of the corresponding MouseDown event shown below (C#)? How should I implement this event in vb.net? Thank you in advance, Goicox var model = new ...
2
votes
1answer
854 views
Transfer from Fortran 77 code(combination of common block and equivalence) to Fortran 90
In the Fortran 77 code , there is a combination use of common block and equivalence statement. For example, common /X/ a,b,c,d dimension arr(4) equivalent(arr(1),a) Can anybody provide ...
2
votes
1answer
593 views
Doesnt stl sort require a strict weak ordering to work?
From http://stdcxx.apache.org/doc/stdlibref/less-equal.html -- You can pass a less_equal object to any algorithm that requires a binary function. For example, the sort() algorithm can accept a ...
1
vote
1answer
61 views
WPF equivalent to Flex states
Flex has a very elegant concept of states which let you define what components should be displayed and what should they look like based on the parent component "state". For example, you could define ...
9
votes
2answers
328 views
Check if two “simple” 'if statements' in C are equivalent
I have 'if statements' from two different sources, which try to implement the same condition possibly in a different way. The 'if statements' are C. If at all possible I need a python script that can ...
0
votes
2answers
99 views
Unique hash with jQuery that can be reproduced in PHP [closed]
I am using a script in wich I need to create a unique Hash with jQuery that I would be able similar to the PHP function uniqid(). Any help ?
1
vote
2answers
642 views
How to implement equivalence class in Java?
What would be the simple way to implement equivalence class in Java? Is there any library for that purpose? The bothering part is how to write an efficient and non-naive "equal" operator. Let S = ...
9
votes
3answers
515 views
Why are vector's multi-argument constructors taking construction parameters not marked “explicit”?
I observed the following vector constructors in the Standard C++ library explicit vector(size_type n); vector(size_type n, const T& value, const Allocator& = Allocator()); Is there a reason ...
1
vote
4answers
222 views
C++ Stl Set Behavior
I was trying to run the below code. What I am finding is that there is difference in the output. I understand that there is an issue with ordering mechanism used in the Comparator functionality. What ...
1
vote
0answers
105 views
Morphism - Setoid on non-convertible terms in Coq
I have the following function in Coq. Now I want to define an instance as below. In my case, equivalence [==] on type [nat] is defined but not on [StringMap.t String.t]. Please if you solve the ...
1
vote
3answers
426 views
Compilation error with == operator
I've isolated the error to this line: string.getClass() == jojo.getClass() Shouldn't this line create two Class objects and then check if they (as in the two references) point to the same object? ...
2
votes
1answer
152 views
Primitives and Object Wrapper Equivalence in JavaScript
EDIT: Based on everyone's feedback, the original version of this question is more design-related, not standards-related. Making more SO-friendly. Original: Should a JS primitive be considered ...
|
{
"url": "http://stackoverflow.com/questions/tagged/equivalence",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-18",
"warc_metadata": {
"Content-Length": "179199",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UXNP2UUAYLMXTT6UDZLSQHDV7WO5NDJL",
"WARC-Concurrent-To": "<urn:uuid:5553cfaf-ee11-4f9e-bc89-2e86ae085c25>",
"WARC-Date": "2015-05-03T13:10:34Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:5HACUIIGJFBPMI7H62PS5QS2S6VOHYSL",
"WARC-Record-ID": "<urn:uuid:3585d183-cf77-4cf3-9aa5-e9ea92ab5e95>",
"WARC-Target-URI": "http://stackoverflow.com/questions/tagged/equivalence",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:14e20ca8-a499-4a9a-9e48-5f6a0c541e59>"
},
"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,
109,
110,
145,
146,
148,
153,
161,
170,
171,
247,
248,
446,
448,
454,
462,
471,
472,
530,
531,
734,
736,
742,
751,
760,
761,
834,
835,
1036,
1038,
1044,
1053,
1062,
1063,
1111,
1112,
1315,
1317,
1323,
1332,
1341,
1342,
1384,
1385,
1585,
1587,
1593,
1601,
1610,
1611,
1639,
1640,
1844,
1846,
1852,
1860,
1869,
1870,
1890,
1891,
2090,
2092,
2098,
2107,
2116,
2117,
2197,
2198,
2402,
2404,
2410,
2419,
2428,
2429,
2493,
2494,
2696,
2698,
2703,
2711,
2720,
2721,
2791,
2792,
2996,
2998,
3004,
3012,
3021,
3022,
3073,
3074,
3254,
3256,
3262,
3271,
3280,
3281,
3349,
3350,
3540,
3542,
3548,
3556,
3565,
3566,
3619,
3620,
3816,
3818,
3823,
3831,
3840,
3841,
3896,
3897,
4101,
4103,
4109,
4118,
4127,
4128,
4222,
4223,
4418,
4421,
4427,
4436,
4446,
4447,
4497,
4498,
4670,
4672,
4678,
4686,
4696,
4697,
4734,
4735,
4937,
4940,
4946,
4954,
4964,
4965,
5005,
5006,
5207,
5209,
5214,
5223,
5232,
5233,
5285,
5286,
5474,
5476,
5482,
5490,
5500,
5501,
5575,
5576,
5769,
5771,
5777,
5786,
5796,
5797,
5831,
5832,
6027,
6029,
6034,
6043,
6052,
6053,
6100,
6101,
6211,
6213,
6219,
6228,
6237,
6238,
6308,
6309,
6446,
6448,
6453,
6462,
6471,
6472,
6550,
6551,
6737,
6739,
6745,
6753,
6762,
6763,
6818,
6819,
6995,
6997,
7002,
7010,
7020,
7021,
7120,
7121,
7322,
7324,
7330,
7338,
7348,
7349,
7384,
7385,
7582,
7584,
7590,
7598,
7608,
7609,
7694,
7695,
7894,
7896,
7901,
7910,
7919,
7920,
7981,
7982,
8142,
8145,
8151,
8160,
8169,
8170,
8197,
8198,
8397,
8399,
8404,
8412,
8421,
8422,
8500,
8501,
8701,
8703,
8708,
8716,
8726,
8727,
8765,
8766,
8964,
8966,
8972,
8980,
8989,
8990,
9052,
9053,
9223,
9225,
9230,
9238,
9247,
9248,
9314,
9315,
9420,
9423,
9429,
9438,
9447,
9448,
9485,
9486,
9673,
9675,
9681,
9689,
9698,
9699,
9819,
9820,
10017,
10020,
10026,
10034,
10044,
10045,
10095,
10096,
10291,
10293,
10298,
10306,
10316,
10317,
10391,
10392,
10595,
10597,
10603,
10612,
10622,
10623,
10647,
10648,
10832,
10834,
10840,
10848,
10858,
10859,
10948,
10949,
11138,
11140,
11146,
11154,
11164,
11165,
11221,
11222,
11419,
11421,
11426,
11434,
11443,
11444,
11474,
11475,
11678,
11680,
11686,
11695,
11705,
11706,
11764,
11765,
11969,
11971,
11977,
11986,
11995,
11996,
12059,
12060,
12201,
12203,
12208,
12217,
12227,
12228,
12272,
12273,
12473,
12475,
12481,
12490,
12500,
12501,
12600,
12601,
12795,
12797,
12802,
12811,
12821,
12822,
12843,
12844,
13048,
13050,
13055,
13064,
13074,
13075,
13125,
13126,
13324,
13326,
13331,
13340,
13350,
13351,
13386,
13387,
13587,
13589,
13595,
13603,
13613,
13614,
13670,
13671
],
"line_end_idx": [
109,
110,
145,
146,
148,
153,
161,
170,
171,
247,
248,
446,
448,
454,
462,
471,
472,
530,
531,
734,
736,
742,
751,
760,
761,
834,
835,
1036,
1038,
1044,
1053,
1062,
1063,
1111,
1112,
1315,
1317,
1323,
1332,
1341,
1342,
1384,
1385,
1585,
1587,
1593,
1601,
1610,
1611,
1639,
1640,
1844,
1846,
1852,
1860,
1869,
1870,
1890,
1891,
2090,
2092,
2098,
2107,
2116,
2117,
2197,
2198,
2402,
2404,
2410,
2419,
2428,
2429,
2493,
2494,
2696,
2698,
2703,
2711,
2720,
2721,
2791,
2792,
2996,
2998,
3004,
3012,
3021,
3022,
3073,
3074,
3254,
3256,
3262,
3271,
3280,
3281,
3349,
3350,
3540,
3542,
3548,
3556,
3565,
3566,
3619,
3620,
3816,
3818,
3823,
3831,
3840,
3841,
3896,
3897,
4101,
4103,
4109,
4118,
4127,
4128,
4222,
4223,
4418,
4421,
4427,
4436,
4446,
4447,
4497,
4498,
4670,
4672,
4678,
4686,
4696,
4697,
4734,
4735,
4937,
4940,
4946,
4954,
4964,
4965,
5005,
5006,
5207,
5209,
5214,
5223,
5232,
5233,
5285,
5286,
5474,
5476,
5482,
5490,
5500,
5501,
5575,
5576,
5769,
5771,
5777,
5786,
5796,
5797,
5831,
5832,
6027,
6029,
6034,
6043,
6052,
6053,
6100,
6101,
6211,
6213,
6219,
6228,
6237,
6238,
6308,
6309,
6446,
6448,
6453,
6462,
6471,
6472,
6550,
6551,
6737,
6739,
6745,
6753,
6762,
6763,
6818,
6819,
6995,
6997,
7002,
7010,
7020,
7021,
7120,
7121,
7322,
7324,
7330,
7338,
7348,
7349,
7384,
7385,
7582,
7584,
7590,
7598,
7608,
7609,
7694,
7695,
7894,
7896,
7901,
7910,
7919,
7920,
7981,
7982,
8142,
8145,
8151,
8160,
8169,
8170,
8197,
8198,
8397,
8399,
8404,
8412,
8421,
8422,
8500,
8501,
8701,
8703,
8708,
8716,
8726,
8727,
8765,
8766,
8964,
8966,
8972,
8980,
8989,
8990,
9052,
9053,
9223,
9225,
9230,
9238,
9247,
9248,
9314,
9315,
9420,
9423,
9429,
9438,
9447,
9448,
9485,
9486,
9673,
9675,
9681,
9689,
9698,
9699,
9819,
9820,
10017,
10020,
10026,
10034,
10044,
10045,
10095,
10096,
10291,
10293,
10298,
10306,
10316,
10317,
10391,
10392,
10595,
10597,
10603,
10612,
10622,
10623,
10647,
10648,
10832,
10834,
10840,
10848,
10858,
10859,
10948,
10949,
11138,
11140,
11146,
11154,
11164,
11165,
11221,
11222,
11419,
11421,
11426,
11434,
11443,
11444,
11474,
11475,
11678,
11680,
11686,
11695,
11705,
11706,
11764,
11765,
11969,
11971,
11977,
11986,
11995,
11996,
12059,
12060,
12201,
12203,
12208,
12217,
12227,
12228,
12272,
12273,
12473,
12475,
12481,
12490,
12500,
12501,
12600,
12601,
12795,
12797,
12802,
12811,
12821,
12822,
12843,
12844,
13048,
13050,
13055,
13064,
13074,
13075,
13125,
13126,
13324,
13326,
13331,
13340,
13350,
13351,
13386,
13387,
13587,
13589,
13595,
13603,
13613,
13614,
13670,
13671,
13866
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 13866,
"ccnet_original_nlines": 403,
"rps_doc_curly_bracket": 0.0005769500276073813,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3298622667789459,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0483708381652832,
"rps_doc_frac_lines_end_with_ellipsis": 0.10643564164638519,
"rps_doc_frac_no_alph_words": 0.23110513389110565,
"rps_doc_frac_unique_words": 0.33231306076049805,
"rps_doc_mean_word_length": 4.629208564758301,
"rps_doc_num_sentences": 146,
"rps_doc_symbol_to_word_ratio": 0.016459520906209946,
"rps_doc_unigram_entropy": 5.748852729797363,
"rps_doc_word_count": 2287,
"rps_doc_frac_chars_dupe_10grams": 0.001889109960757196,
"rps_doc_frac_chars_dupe_5grams": 0.03759327158331871,
"rps_doc_frac_chars_dupe_6grams": 0.022480400279164314,
"rps_doc_frac_chars_dupe_7grams": 0.001889109960757196,
"rps_doc_frac_chars_dupe_8grams": 0.001889109960757196,
"rps_doc_frac_chars_dupe_9grams": 0.001889109960757196,
"rps_doc_frac_chars_top_2gram": 0.008028710260987282,
"rps_doc_frac_chars_top_3gram": 0.010201189666986465,
"rps_doc_frac_chars_top_4gram": 0.0023613900411874056,
"rps_doc_books_importance": -1233.1146240234375,
"rps_doc_books_importance_length_correction": -1233.1146240234375,
"rps_doc_openwebtext_importance": -716.2861938476562,
"rps_doc_openwebtext_importance_length_correction": -716.2861938476562,
"rps_doc_wikipedia_importance": -488.5173034667969,
"rps_doc_wikipedia_importance_length_correction": -488.5173034667969
},
"fasttext": {
"dclm": 0.5600741505622864,
"english": 0.8843412399291992,
"fineweb_edu_approx": 1.8981878757476807,
"eai_general_math": 0.3257596492767334,
"eai_open_web_math": 0.2499961256980896,
"eai_web_code": 0.07005084306001663
}
}
|
{
"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": "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": "5",
"label": "Social/Forum"
}
},
"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": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,330,220,180,966,170,000 |
MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:
Sign up
Here's how it works:
1. Anybody can ask a question
2. Anybody can answer
3. The best answers are voted up and rise to the top
Quite simply, I'd like to know what is the broadest or most natural context in which either (or both) of Mather's cube theorems hold. If you like, this may mean any of
• What properties of $Top$ or $Top^*$ are essential to the proofs?
• (where) are model/homotopical categories verifying Mather's theorems studied as such in the literature?
• Are there more examples known verifying Mather's theorems?
I ask because Mather's proof strikes me as fairly gritty and seems to rely on explicit cellular constructions.
For reference, the cube theorems concern a cubical diagram whose faces commute up to homotopy in a coherent way, and assert
1. If one pair of opposite faces are homotopy push-outs and the two remaining faces adjecent the source vertex are homotopy pull-backs, then the final two faces are also homotopy pull-backs
2. If two pairs of opposite faces are homotopy pull-backs, and the remaining face adjacent the target vertex is a homotopy push-out, then the remaining face is a homotopy push-out.
share|cite|improve this question
Let $\mathcal{X}$ be an $\infty$-category (i.e., a homotopy theory) which admits small homotopy colimits, a set of small generators, and has the property that homotopy colimits in $\mathcal{X}$ commute with homotopy pullback. Then $\mathcal{X}$ satisfies the Mather cube theorem if and only if $\mathcal{X}$ is an $\infty$-topos: that is, it can be described as a left exact localization of an $\infty$-category of presheaves of spaces. (I learned this from Charles Rezk). Such homotopy theories are studied extensively in my book "Higher Topos Theory" (see in particular Proposition 6.1.3.10 and the remark which follows it).
share|cite|improve this answer
Jacob, I'm guessing that such things also have the following more general property: If $F$ and $G$ are functors $I\to \mathcal X$ such that for every $i$-morphism $i\to j$ you get a homotopy pullback square $(F(i)\to G(i))\to (F(j)\to G(j))$ then for every $i$-object $i$ you get a homotopy pullback square $(F(i)\to G(i))\to (hocolim F\to hocolim G)$. (The case of this when $I$ is the poset $a\leftarrow b\to c$ is the (first) Mather cube theorem.) – Tom Goodwillie Mar 3 '12 at 21:14
Or, Jacob, I suppose by "the Mather cube theorem" you mean statement 2 in the question. As I mentioned in my edit to my answer, statement 1 fails for the category of sets. – Tom Goodwillie Mar 3 '12 at 21:35
1
Hi Tom; I meant statement 1 (the category of sets is an ordinary topos, rather than an $\infty$-topos). Statement 2 would be a special case of the blanket hypothesis "homotopy colimits in X commute with homotopy pullback". The more general property you describe also holds in any $\infty$-topos. – Jacob Lurie Mar 4 '12 at 1:03
Oh my goodness wow! I'll have to keep studying these things. – some guy on the street Apr 16 '12 at 23:33
You might be interested in the work of Jean-Paul Doeraene: http://math.univ-lille1.fr/~doeraene/
In particular, on pages 8 and 9 of the paper Homotopy pull backs, push outs, and joins, he gives several examples of model categories satisfying the Cube Axiom, and identifies the cube maps in several which do not.
The motivation of much of this is to define and study Lusternik-Schnirelmann type invariants in model categories other than $Top$.
share|cite|improve this answer
Thank you, that's nifty! – some guy on the street Mar 2 '12 at 15:02
Here's a sketch proof of 2, sort of in the same spirit as Jeff Strom's answer:
These statements have equivalent formulations involving strictly commutative squares.
Denote a typical square by $\mathcal X$, with last space $X$ and two spaces $X_1$ and $X_2$ mapping into $X$, and $X_{12}$ mapping into both. It's called a homotopy pushout square if the resulting map from the homotopy pushout of $X_1\leftarrow X_{12}\to X_2$ to $X$ is a weak equivalence, and likewise for pullback.
Use the fact that if $X$ is the union of open sets $X_1$ and $X_2$ with intersection $X_{12}$ then the resulting square is a homotopy pushout.
Also use this converse: Any homotopy pushout square admits an equivalence from such an "open triad square"--a map that is a weak equivalence in all four corners.
Now let $\mathcal X\to \mathcal Y$ be a cube, a map of squares. Suppose that $\mathcal Y$ is a homotopy pushout square and that the four side squares are homotopy pullback squares.
Wlog the map $X\to Y$ is a fibration and the side squares are pullback (not just homotopy pullback) squares. Make an open triad square $\mathcal Y'$ and an equivalence $\mathcal Y'\to \mathcal Y$. Pull back to get a new square $\mathcal X'$. This is now also of the open triad kind, so it's a homotopy pushout square. And its map to $\mathcal X$ is an equivalence, so the latter is also a homotopy pushout square.
The other theorem, 1, implies 2 (for Top) but I don't think you can go the other way. And when I try to prove 1 for Top I end up using quasifibrations.
EDIT: The first theorem really seems deeper than the second. In the category of sets (with equivalence=iso, holim=lim, hocolim=colim) the second is true and the first is false.
share|cite|improve this answer
The second cube theorem (if base and sides are ok, then so is the top) is a straightforward consequence of the formally crazy fact that if $p:E\to B$ is a fibration, $i:A\to B$ is a cofibration, and $p_A:E_A\to A$ is the pullback of $p$ along $i$, then $i:E_A\to E$ is also a cofibration.
share|cite|improve this answer
1
That's in the category of simplicial sets, or what? – Tom Goodwillie Mar 2 '12 at 14:29
ahah! This will bear some thinking about. Tom, it's at least in $Top$-like things, which is (again) one of the likenesses I'm trying to get at; in this case, it seems to be the fact that ordinary pull-backs are subspaces of products in a very clean way. – some guy on the street Mar 2 '12 at 15:07
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/90016/the-most-general-context-of-mathers-cube-theorems/90044",
"source_domain": "mathoverflow.net",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "82601",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2JYKXL6OWT6Q5AS54VEI7YCP3B4NU5U7",
"WARC-Concurrent-To": "<urn:uuid:abe680c4-b889-4c43-addb-08888f6884d3>",
"WARC-Date": "2016-07-26T06:45:41Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:MCVCZ76ATJESKWA5WX7PYA7ZQRF47NH7",
"WARC-Record-ID": "<urn:uuid:3b1c38d9-406e-4328-aa77-30a4be9c7b11>",
"WARC-Target-URI": "http://mathoverflow.net/questions/90016/the-most-general-context-of-mathers-cube-theorems/90044",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:130c4303-dbf0-4dff-8dee-d9f059a3d23c>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-27-174.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-30\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for July 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,
111,
112,
120,
141,
173,
197,
252,
253,
421,
422,
491,
599,
662,
663,
774,
775,
776,
900,
901,
1093,
1276,
1309,
1310,
1937,
1938,
1969,
1974,
2461,
2466,
2674,
2678,
3006,
3011,
3117,
3118,
3215,
3216,
3431,
3432,
3563,
3564,
3595,
3600,
3669,
3670,
3749,
3750,
3836,
3837,
4154,
4155,
4298,
4299,
4461,
4462,
4643,
4644,
5058,
5059,
5211,
5212,
5389,
5390,
5421,
5422,
5711,
5712,
5743,
5747,
5835,
5840,
6138,
6139,
6151,
6152,
6154,
6162,
6163,
6241,
6242
],
"line_end_idx": [
111,
112,
120,
141,
173,
197,
252,
253,
421,
422,
491,
599,
662,
663,
774,
775,
776,
900,
901,
1093,
1276,
1309,
1310,
1937,
1938,
1969,
1974,
2461,
2466,
2674,
2678,
3006,
3011,
3117,
3118,
3215,
3216,
3431,
3432,
3563,
3564,
3595,
3600,
3669,
3670,
3749,
3750,
3836,
3837,
4154,
4155,
4298,
4299,
4461,
4462,
4643,
4644,
5058,
5059,
5211,
5212,
5389,
5390,
5421,
5422,
5711,
5712,
5743,
5747,
5835,
5840,
6138,
6139,
6151,
6152,
6154,
6162,
6163,
6241,
6242,
6332
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6332,
"ccnet_original_nlines": 80,
"rps_doc_curly_bracket": 0.002210990060120821,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3569045960903168,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.042028021067380905,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2621747851371765,
"rps_doc_frac_unique_words": 0.3714821934700012,
"rps_doc_mean_word_length": 4.485928535461426,
"rps_doc_num_sentences": 59,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.325155735015869,
"rps_doc_word_count": 1066,
"rps_doc_frac_chars_dupe_10grams": 0.01129234954714775,
"rps_doc_frac_chars_dupe_5grams": 0.06127142906188965,
"rps_doc_frac_chars_dupe_6grams": 0.0399414487183094,
"rps_doc_frac_chars_dupe_7grams": 0.03596821054816246,
"rps_doc_frac_chars_dupe_8grams": 0.02676703967154026,
"rps_doc_frac_chars_dupe_9grams": 0.01129234954714775,
"rps_doc_frac_chars_top_2gram": 0.006900880020111799,
"rps_doc_frac_chars_top_3gram": 0.023421160876750946,
"rps_doc_frac_chars_top_4gram": 0.015056460164487362,
"rps_doc_books_importance": -692.8822021484375,
"rps_doc_books_importance_length_correction": -692.8822021484375,
"rps_doc_openwebtext_importance": -389.9789123535156,
"rps_doc_openwebtext_importance_length_correction": -389.9789123535156,
"rps_doc_wikipedia_importance": -321.85260009765625,
"rps_doc_wikipedia_importance_length_correction": -321.85260009765625
},
"fasttext": {
"dclm": 0.3819168210029602,
"english": 0.8984977602958679,
"fineweb_edu_approx": 1.6710261106491089,
"eai_general_math": 0.9462001919746399,
"eai_open_web_math": 0.8160164952278137,
"eai_web_code": 0.022422969341278076
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "514.24",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Trigonometry and Topology"
}
},
"secondary": {
"code": "512.64",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,257,872,888,152,037,000 |
Clojure-Art
It is an interesting idea to generate colorful images using or music. In both areas Clojure seems to be quite attractive. Not having explored the music side, I did find the idea of creating images fun and inspiring. It also shows us something about the functions we are working with, if we learn to read the images right, but that will come or not, depending on the circumstances. It is useful not to be too scared of some mathematics when reading this.
Now the challenge is to create an image on a two dimensional array of points, for example 1000×1000 pixel, with x- and y-coordinates ranging from 0 to 999. Each pixel needs to be colored. While it is very interesting to explore different color models, we can for simplicity assume that we need 3 numbers each ranging from 0 to 255 for the red, green and blue channels. This is how most displays work, more or less. Now the goal is to create something that looks good. And off course is reasonable to program, otherwise we could just color one million points individually using for example GIMP, but a million is a lot.
Now we can apply any function on x and y and play around with functions like exp, log, sqrt, sin, cos, tan, sec, csc, sinh, … and of course the basic operations +, -, * and /. It turns out that in most cases we do not get interesting images, but experience will show what is promising to explore. I tried to create pictures by keeping the three channels fairly independent, but this did not work so well. It seems that it is better to keep some connection. One approach that actually works quite well is to consider the pair (x,y) as a complex number z = x+iy and to apply just one complex function on it, again exp, log, sqrt, sin, …. are good building blocks. Now these complex functions have a tendency to grow to infinity somewhere. While real functions can avoid this issue by constraining themselves just to one strait line on the plane, complex functions almost have to go to infinity somewhere. By making the square small enough or by changing the scale we can avoid this, but it imposes quite severe constraints. The Riemann Sphere allows us to map any complex number to a point on the surface of a sphere. With some scaling we can already get to RGB-space and get coordinates that are using, but not exceeding the desired range. There are more ways to visualize complex numbers, but this is a possibility worth exploring.
Another way is to just use functions that calculate a real number and to apply a \sin to it. With some shifting and scaling the values will be between 0 and 255 only and there are nor abrupt changes in color, unless the function we calculated is very steep or very chaotic. Using phase shifts by \frac{2\pi}{3} and \frac{4\pi}{3} the three color channels can be served and we get nice rainbow-waves like the following:
Clojure Art: angle + log(r)
Clojure Art: angle + log(r)
Another experiment was to just assume the HSV-model and to calculate the colors from assuming the function is the H-part. But this ended up looking like plastic and I did not like it too much.
An important issue to observe is that functions may end up in exceptions. I wrapped the functions, so that they do not stop the calculation of the image half way through, but instead provide default values in cases where an exceptions occured.
It can also be fun to explore bitwise-functions like bitxor or even functions like the p-adic exponential function, which yields totally different kind of images.
I have put some of the code from my experiments into Github and licensed it with the GPL, so you can use it as a starting point. Others have worked with this as well, for example Clojure Art on Tumblr, Clojure Art Collective on github, another „clojure art“ on github or creative computing with clojure on O’Reilly’s blog.
Enjoy it and learn some Clojure. I sometimes use this when teaching Clojure.
Share Button
Schreibe einen Kommentar
Deine E-Mail-Adresse wird nicht veröffentlicht. Erforderliche Felder sind mit * markiert.
*
|
{
"url": "https://brodowsky.it-sky.net/2017/01/20/clojure-art/",
"source_domain": "brodowsky.it-sky.net",
"snapshot_id": "crawl=CC-MAIN-2017-09",
"warc_metadata": {
"Content-Length": "24160",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MORPIDFQZKBFMFYML3AHKV7HRYMS4K3H",
"WARC-Concurrent-To": "<urn:uuid:c5e5440c-4f32-4a46-8a02-7433f3b3854c>",
"WARC-Date": "2017-02-21T23:16:18Z",
"WARC-IP-Address": "85.13.145.172",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:S3DBVDQHDBEDYVNF4SWNIYSQB5SUQNC4",
"WARC-Record-ID": "<urn:uuid:10e7f4f5-d4a0-43b4-a3c5-d32d7918c195>",
"WARC-Target-URI": "https://brodowsky.it-sky.net/2017/01/20/clojure-art/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:da92fd2f-d8c1-45f3-9412-69d3ce092c00>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-10-108.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-09\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for February 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,
12,
13,
467,
468,
1087,
1088,
2420,
2421,
2840,
2841,
2869,
2870,
2898,
2899,
3092,
3093,
3337,
3338,
3501,
3502,
3825,
3826,
3903,
3904,
3917,
3918,
3943,
3944,
4034,
4035
],
"line_end_idx": [
12,
13,
467,
468,
1087,
1088,
2420,
2421,
2840,
2841,
2869,
2870,
2898,
2899,
3092,
3093,
3337,
3338,
3501,
3502,
3825,
3826,
3903,
3904,
3917,
3918,
3943,
3944,
4034,
4035,
4036
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4036,
"ccnet_original_nlines": 30,
"rps_doc_curly_bracket": 0.001982159912586212,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4591715931892395,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015384620055556297,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15976330637931824,
"rps_doc_frac_unique_words": 0.4572649598121643,
"rps_doc_mean_word_length": 4.545584201812744,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0.002366859931498766,
"rps_doc_unigram_entropy": 5.256931781768799,
"rps_doc_word_count": 702,
"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.005014100112020969,
"rps_doc_frac_chars_top_3gram": 0.0062676300294697285,
"rps_doc_frac_chars_top_4gram": 0.008774680085480213,
"rps_doc_books_importance": -412.51416015625,
"rps_doc_books_importance_length_correction": -412.51416015625,
"rps_doc_openwebtext_importance": -230.6203155517578,
"rps_doc_openwebtext_importance_length_correction": -230.6203155517578,
"rps_doc_wikipedia_importance": -185.92950439453125,
"rps_doc_wikipedia_importance_length_correction": -185.92950439453125
},
"fasttext": {
"dclm": 0.11510937660932541,
"english": 0.9180279970169067,
"fineweb_edu_approx": 2.6774473190307617,
"eai_general_math": 0.9907482266426086,
"eai_open_web_math": 0.4390608072280884,
"eai_web_code": 0.7229868769645691
}
}
|
{
"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": "701",
"labels": {
"level_1": "Arts",
"level_2": "",
"level_3": "Art — Philosophy"
}
}
},
"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": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,318,790,257,051,275,000 |
Inheritance in Java: Building on a Strong Foundation
Understanding Object-Oriented Programming
Before diving deeper into inheritance, it's crucial to have a solid grasp of Object-Oriented Programming (OOP). OOP is a programming paradigm based on the concept of "objects," which can contain data, in the form of fields (often known as attributes or properties), and code, in the form of procedures (often known as methods). OOP models real-world entities as software objects that have both state and behavior. This paradigm emphasizes modularity, code reusability, and flexibility through the mechanisms of encapsulation, polymorphism, abstraction, and inheritance.
Benefits of OOP
• Encapsulation: This principle bundles the data (attributes) and methods that operate on the data into a single unit known as an object. It also restricts direct access to some of an object's components, which is a key aspect of information hiding.
• Abstraction: Abstraction simplifies complex reality by modeling classes appropriate to the problem, and working at the most relevant level of inheritance.
• Polymorphism: This allows objects to be treated as instances of their parent class rather than their actual class. The methods of the parent class can be overridden within the child class to provide specific behavior.
• Inheritance: Discussed in detail in the article, it allows a class to use the properties and methods of another class as a foundation, promoting code reuse.
What is Inheritance?
Inheritance is a fundamental principle in object-oriented programming (OOP), a paradigm that Java fully supports and utilizes to its advantage. This concept permits the creation of new classes, known as subclasses, which can inherit attributes and methods from already existing classes, referred to as superclasses. By doing so, inheritance facilitates the reuse of code, significantly reduces redundancy, and aids in maintaining a clean and organized codebase.
Understanding Inheritance: A House Construction Analogy
Consider the process of building a house. Every house shares some basic components, such as the foundation, walls, and roof. These elements are universal to all houses, forming the core structure that provides stability and shelter. In the realm of programming, inheritance allows you to construct a generic "House" class that encapsulates these common features. This "House" class serves as a blueprint from which more specific types of houses can be derived.
For instance, you might want to create a "Bungalow" class or a "Two Story House" class. These subclasses would inherit the foundational elements from the "House" superclass, ensuring that they have all the essential characteristics of a house. However, they can also introduce additional properties or behaviors that are unique to their specific type. A "Bungalow" class might include attributes related to its single-story nature, while a "TwoStoryHouse" class could define properties that pertain to its multiple levels, such as the number of staircases or the design of the second floor.
This method of extending a base class to create more specialized classes enables developers to build complex systems efficiently. Instead of starting from scratch each time, developers can leverage the shared characteristics of superclasses and focus on implementing the unique features of each subclass. This not only speeds up the development process but also ensures that the code is easier to understand, maintain, and update. Inheritance, therefore, stands as a cornerstone of object-oriented programming, embodying the principles of code reuse and organization.
Exploring Inheritance in Java
This section would delve deeper into how inheritance is implemented in Java, using keywords such as extends for class inheritance. It would also cover the concept of method overriding and the use of the super keyword to access superclass methods and constructors.
Simple Example with the House Construction Analogy
In the first step towards illustrating inheritance, we begin by crafting the foundational class House. This class forms the bedrock of our example, embodying the basic structure of a house with attributes for its foundation, walls, and roof. Constructed within the org.example package, the House class is equipped with a constructor method that initializes these attributes. Additionally, it offers getter methods for each attribute and a displayHouseDetails method to output the house's foundational elements. This setup not only establishes our base class but also sets the stage for demonstrating how inheritance allows us to build upon this foundation in Java.
Note: you can use the toString method to print details about your class.
package org.example;
class House {
private String foundation;
private String walls;
private String roof;
// Constructor for House
public House(String foundation, String walls, String roof) {
this.foundation = foundation;
this.walls = walls;
this.roof = roof;
}
public String getFoundation() {
return foundation;
}
public String getWalls() {
return walls;
}
public String getRoof() {
return roof;
}
// Method to display the basic house structure
public void displayHouseDetails() {
System.out.println("Foundation: " + foundation);
System.out.println("Walls: " + walls);
System.out.println("Roof: " + roof);
}
}
Next, we define our Bungalow class. This demonstrates how you can leverage the House class to add new functionalities to a subclass. The Bungalow class in Java extends the House class, inheriting its properties and introducing a new attribute, hasGarden. It also overrides the displayHouseDetails method to incorporate garden information, showcasing how inheritance promotes code reuse and specialization.
package org.example;
class Bungalow extends House {
private boolean hasGarden;
// Constructor for Bungalow
public Bungalow(String foundation, String walls, String roof, boolean hasGarden) {
// Call the superclass constructor to set foundation, walls, and roof
super(foundation, walls, roof);
this.hasGarden = hasGarden;
}
public boolean hasGarden() {
return hasGarden;
}
// Overriding the displayHouseDetails method to include garden info
@Override
public void displayHouseDetails() {
super.displayHouseDetails(); // Call the superclass method
System.out.println("Has Garden: " + hasGarden);
}
}
The final step involves utilizing the Bungalow class. This step demonstrates how to access and display the inherited properties from the House class, along with the unique attributes added to the Bungalow class, effectively showcasing the concept of inheritance in action.
package org.example;
public class Main {
public static void main(String[] args) {
// Create a Bungalow instance
Bungalow myBungalow = new Bungalow("Concrete", "Brick", "Tile", true);
// Display the details of the Bungalow
myBungalow.displayHouseDetails();
}
}
Practical Applications of Inheritance
Inheritance in Java finds its utility in various real-world applications, simplifying complex software design by enabling code reuse and establishing hierarchical relationships. Here are some practical examples:
• Employee Management System: In an organization, employees can be categorized into different types, such as Manager, Engineer, and Technician. All these categories can inherit common properties (like name, ID, and salary) from a base Employee class, while also implementing their specific functionalities, such as manage(), developSoftware(), or repairMachinery() respectively.
• Vehicle Classification System: A vehicle management system might have a base Vehicle class with properties like make, model, and year. Specific types of vehicles, such as Car, Truck, and Motorcycle, can extend this class, adding features unique to each vehicle type, such as cargoCapacity for Trucks or sideCar for Motorcycles.
• Graphical User Interface (GUI) Components: In a GUI library, basic components like buttons, text fields, and checkboxes can all inherit from a generic Component class. This class provides common attributes and methods, such as size, location, and render(). Each specific component class can then add its unique features, like text for a button or checked state for a checkbox.
• Shapes Drawing Application: A simple drawing application might define a base Shape class with properties such as position, color, and draw() method. Specific shapes like Circle, Rectangle, and Triangle inherit from Shape and implement the draw() method differently to display themselves on the screen.
Best Practices for Using Inheritance
While inheritance is a powerful feature, it's essential to use it judiciously. This section would provide guidelines on when to use inheritance and when other OOP features might be more appropriate.
Best practices for using inheritance in Java include:
1. Use inheritance for an "is-a" relationship: Only use inheritance if the subclass can logically be considered a specific type of the superclass. For instance, a "Car" is a type of "Vehicle", so it makes sense for "Car" to inherit from "Vehicle".
2. Favor composition over inheritance: If a class needs to utilize functionality from another class but does not have an "is-a" relationship, consider using composition instead. Composition involves including an instance of another class as a field rather than extending the class.
3. Avoid deep inheritance hierarchies: Deeply nested inheritance can make the code difficult to understand and maintain. Try to limit inheritance to one or two levels.
4. Use method overriding carefully: When overriding methods, ensure that the overriding method adheres to the principle of substitutability. The overridden method in the subclass should work seamlessly when used via a reference of the superclass.
5. Leverage interfaces for shared capabilities across unrelated classes: If multiple classes share certain behaviors but do not share a logical "is-a" relationship, consider defining an interface and having these classes implement it.
6. Understand and respect the Liskov Substitution Principle (LSP): According to LSP, objects of a superclass should be replaceable with objects of a subclass without affecting the correctness of the program. This principle guides the safe and effective use of inheritance.
7. Keep superclass constructors simple and safe to call: Since a superclass constructor is called when a subclass is instantiated, ensure that these constructors do not invoke overridable methods or perform extensive initialization that might be dependent on subclass state.
Conclusion
In conclusion, inheritance in Java stands as a pivotal concept within the realm of object-oriented programming, offering a structured and efficient approach to software development. By enabling classes to inherit properties and methods from existing ones, it fosters code reuse, reduces redundancy, and enhances maintainability. Through practical examples and best practices, we've seen how inheritance not only streamlines the creation of complex systems but also promotes a logical, hierarchical organization of code. As developers, embracing inheritance and understanding its proper use can significantly elevate our programming expertise, allowing us to build more robust, scalable, and maintainable software solutions.
Did you find this article valuable?
Support Christian Lehnert by becoming a sponsor. Any amount is appreciated!
|
{
"url": "https://blog.christianlehnert.dev/inheritance-in-java-building-on-a-strong-foundation",
"source_domain": "blog.christianlehnert.dev",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "242225",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XZFF4TINV3VHFHIXN2EOBXZDK3PBD6HP",
"WARC-Concurrent-To": "<urn:uuid:94fafa87-7cf9-427c-9b5d-350c6c995d72>",
"WARC-Date": "2024-08-07T07:08:06Z",
"WARC-IP-Address": "76.76.21.21",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4GFSTZYD5XMKQOBVE523KSZRBEAGUN5A",
"WARC-Record-ID": "<urn:uuid:105d8366-4a23-49a7-8cf3-cdfac9a02d72>",
"WARC-Target-URI": "https://blog.christianlehnert.dev/inheritance-in-java-building-on-a-strong-foundation",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:dae6c8d4-48ab-457f-aa91-76f0190be1db>"
},
"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,
53,
54,
96,
97,
667,
668,
684,
685,
937,
938,
1097,
1098,
1320,
1321,
1482,
1483,
1504,
1505,
1967,
1968,
2024,
2025,
2486,
2487,
3078,
3079,
3647,
3648,
3678,
3679,
3943,
3944,
3995,
3996,
4661,
4662,
4735,
4736,
4757,
4758,
4772,
4803,
4829,
4854,
4855,
4884,
4949,
4987,
5015,
5041,
5047,
5048,
5084,
5111,
5117,
5118,
5149,
5171,
5177,
5178,
5208,
5229,
5235,
5236,
5287,
5327,
5384,
5431,
5476,
5482,
5484,
5485,
5891,
5892,
5913,
5914,
5945,
5976,
5977,
6009,
6096,
6174,
6214,
6250,
6256,
6257,
6290,
6316,
6322,
6323,
6395,
6409,
6449,
6516,
6572,
6578,
6580,
6581,
6854,
6855,
6876,
6877,
6897,
6942,
6980,
7059,
7060,
7107,
7149,
7155,
7157,
7158,
7196,
7197,
7409,
7410,
7791,
7792,
8124,
8125,
8506,
8507,
8813,
8814,
8851,
8852,
9051,
9052,
9106,
9107,
9357,
9358,
9642,
9643,
9813,
9814,
10063,
10064,
10301,
10302,
10577,
10578,
10855,
10856,
10867,
10868,
11592,
11593,
11629,
11630,
11706,
11707
],
"line_end_idx": [
53,
54,
96,
97,
667,
668,
684,
685,
937,
938,
1097,
1098,
1320,
1321,
1482,
1483,
1504,
1505,
1967,
1968,
2024,
2025,
2486,
2487,
3078,
3079,
3647,
3648,
3678,
3679,
3943,
3944,
3995,
3996,
4661,
4662,
4735,
4736,
4757,
4758,
4772,
4803,
4829,
4854,
4855,
4884,
4949,
4987,
5015,
5041,
5047,
5048,
5084,
5111,
5117,
5118,
5149,
5171,
5177,
5178,
5208,
5229,
5235,
5236,
5287,
5327,
5384,
5431,
5476,
5482,
5484,
5485,
5891,
5892,
5913,
5914,
5945,
5976,
5977,
6009,
6096,
6174,
6214,
6250,
6256,
6257,
6290,
6316,
6322,
6323,
6395,
6409,
6449,
6516,
6572,
6578,
6580,
6581,
6854,
6855,
6876,
6877,
6897,
6942,
6980,
7059,
7060,
7107,
7149,
7155,
7157,
7158,
7196,
7197,
7409,
7410,
7791,
7792,
8124,
8125,
8506,
8507,
8813,
8814,
8851,
8852,
9051,
9052,
9106,
9107,
9357,
9358,
9642,
9643,
9813,
9814,
10063,
10064,
10301,
10302,
10577,
10578,
10855,
10856,
10867,
10868,
11592,
11593,
11629,
11630,
11706,
11707,
11708
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 11708,
"ccnet_original_nlines": 152,
"rps_doc_curly_bracket": 0.002049880102276802,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31860578060150146,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00736377015709877,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19342170655727386,
"rps_doc_frac_unique_words": 0.3417956829071045,
"rps_doc_mean_word_length": 5.741176605224609,
"rps_doc_num_sentences": 97,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.5481085777282715,
"rps_doc_word_count": 1615,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.01725625991821289,
"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.005823989864438772,
"rps_doc_frac_chars_top_3gram": 0.009167389944195747,
"rps_doc_frac_chars_top_4gram": 0.007118210196495056,
"rps_doc_books_importance": -933.1737060546875,
"rps_doc_books_importance_length_correction": -933.1737060546875,
"rps_doc_openwebtext_importance": -542.0892333984375,
"rps_doc_openwebtext_importance_length_correction": -542.0892333984375,
"rps_doc_wikipedia_importance": -424.2592468261719,
"rps_doc_wikipedia_importance_length_correction": -424.2592468261719
},
"fasttext": {
"dclm": 0.9048815369606018,
"english": 0.8903849720954895,
"fineweb_edu_approx": 3.16326642036438,
"eai_general_math": 0.7104519009590149,
"eai_open_web_math": 0.18415522575378418,
"eai_web_code": 0.9400836825370789
}
}
|
{
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,077,504,607,093,209,000 |
Plain is headed towards 1.0! Subscribe for development updates →
Documentation
Source code and markdown docs, combined.
All of Plain's docs are written directly in the source code. You're encouraged to read the source — either on this site, the GitHub repo, or in your local virtual environment for the version of Plain you're using.
Core
By itself, this is the bare minimum to get a Python web app up and running. It can respond to HTTP requests and render templates, but doesn't include a database. You can think of this as an alternative to Flask.
Packages
These packages are separate and can be installed individually. They're often included in the starters.
|
{
"url": "https://plainframework.com/docs/",
"source_domain": "plainframework.com",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "38945",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UJFTYFF2QPMU7W5PEPDANMKWY6CJLISK",
"WARC-Concurrent-To": "<urn:uuid:12aab155-1c38-46d9-954d-0a412c206337>",
"WARC-Date": "2024-08-05T12:36:11Z",
"WARC-IP-Address": "172.67.217.31",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2YQ24HDJW3K3DJWVJEJTQBFPG7MLX545",
"WARC-Record-ID": "<urn:uuid:7440f1de-34ee-48cd-b912-b084bc180a1a>",
"WARC-Target-URI": "https://plainframework.com/docs/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:80b14732-0479-4bc2-83c5-e0252a39196f>"
},
"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-195\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,
65,
66,
80,
81,
122,
123,
337,
338,
343,
344,
556,
557,
566,
567
],
"line_end_idx": [
65,
66,
80,
81,
122,
123,
337,
338,
343,
344,
556,
557,
566,
567,
669
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 669,
"ccnet_original_nlines": 14,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.39855071902275085,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0072463802061975,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17391304671764374,
"rps_doc_frac_unique_words": 0.7321428656578064,
"rps_doc_mean_word_length": 4.7410712242126465,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.264956474304199,
"rps_doc_word_count": 112,
"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.03766477853059769,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -47.9862060546875,
"rps_doc_books_importance_length_correction": -54.921539306640625,
"rps_doc_openwebtext_importance": -30.06847381591797,
"rps_doc_openwebtext_importance_length_correction": -37.00381088256836,
"rps_doc_wikipedia_importance": -14.354387283325195,
"rps_doc_wikipedia_importance_length_correction": -21.289722442626953
},
"fasttext": {
"dclm": 0.20568525791168213,
"english": 0.9459249973297119,
"fineweb_edu_approx": 2.5234999656677246,
"eai_general_math": 0.7100978493690491,
"eai_open_web_math": 0.14977705478668213,
"eai_web_code": 0.7509480714797974
}
}
|
{
"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.01",
"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": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,732,380,124,184,392,000 |
Where is Digital Asset Management Used?
374 Views
Business to business (B2B) companies uses Digital Asset Management software to manage their digital assets, including images, videos, and documents. In a B2B transaction, the asset files are often part of a contract or agreement between businesses.
There is also an increasing trend in using DAM for storing and managing assets used by enterprise employees both internally and for sharing data with partners. DAM solutions store and handle commercial (stock) images, videos, presentations, reports, eBooks; you can learn more from this link www.encode.eu.
Digital Asset Management is suitable for managing assets in multiple departments that need central access to an asset library. It is beneficial for teams that collaborate on projects requiring the use of large numbers of files.
It is increasingly common for DAM software to be used in the Public Sector and by Governmental agencies which face the challenges of managing extensive image collections with compliance and security concerns.
digital asset management
These are some of the places where digital asset management is used:
1. By a creative professional who collaborates on a project.
2. An organization hosts a website with business content, such as a company directory, product information, and press releases.
3. In the graphic design industry, for managing image libraries used in print and web publishing projects.
4. In the Public Sector or by Government agencies.
5. By the Marketing Department of an organization, storing and managing commercial (stock) images, videos, presentations, reports, eBooks.
6. By Libraries and Academic institutions for managing image libraries used in print and web publishing projects; by Universities for sharing research data with other Universities via Scholarly Digital Asset Repositories.
7. In Non-Profit Organizations to manage image collections for fundraising and awareness campaigns.
What are DAM tools?
DAM tools can be stand-alone or integrated with other software. They can provide a comprehensive solution for all your Asset Management needs, from ingesting the files to delivery and further usage of your precious media items.
In DAM tools terms, an Asset is information that is stored together for a particular purpose. Assets are grouped into Collections. A Collection is a subset of the library that can be defined according to different criteria, such as use case. Assets are grouped within collections in folders on the file system.
Asset Management steps – manageable activities
There are three things you need to do with your digital assets:
1) Import them into the DAM tool catalog.
2) Manage them in the DAM tool using different metadata.
3) Deliver them to your audience.
The best DAM tool provides an intuitive user interface for managing your digital assets, so you can easily find what you are looking for. It should allow you to collect basic information about each asset, such as name, location on disk, creation date, and modification history.
It should also allow you to process your assets, for example, to rename, resize or crop them. Of course, the DAM tool must provide powerful search capabilities helping you find all assets matching specific criteria without any problems.
Final Thoughts
As you can see, Digital Asset Management is a broad subject. In this article, we have introduced it from the perspective of its application in various industries.In some cases, it helps to manage assets by teams working on shared projects, whereas in others, it provides a comprehensive solution for all your Asset Management needs.
You may also like...
Leave a Reply
Your email address will not be published. Required fields are marked *
|
{
"url": "https://www.infologico.com/where-is-digital-asset-management-used/",
"source_domain": "www.infologico.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "80848",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LF6SEMXYVEJ7EZQHXWKSAF2TSZNDJ4WX",
"WARC-Concurrent-To": "<urn:uuid:424fe6ce-b125-45ff-9cac-c5853db3bc93>",
"WARC-Date": "2023-09-24T16:05:29Z",
"WARC-IP-Address": "62.72.28.78",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4KLV65AAKCDLWGY62XWIT477A4VUKKH6",
"WARC-Record-ID": "<urn:uuid:cee5590f-294b-4014-a4db-12a636c27f7b>",
"WARC-Target-URI": "https://www.infologico.com/where-is-digital-asset-management-used/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fe7f6cb6-15d6-4009-af69-f051d4c930c8>"
},
"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-5\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,
40,
41,
51,
52,
301,
302,
609,
610,
838,
839,
1048,
1049,
1074,
1075,
1144,
1145,
1208,
1338,
1447,
1500,
1641,
1865,
1967,
1968,
1988,
1989,
2217,
2218,
2529,
2530,
2577,
2578,
2642,
2643,
2685,
2686,
2743,
2744,
2778,
2779,
3057,
3058,
3295,
3296,
3311,
3312,
3645,
3646,
3667,
3668,
3682,
3683
],
"line_end_idx": [
40,
41,
51,
52,
301,
302,
609,
610,
838,
839,
1048,
1049,
1074,
1075,
1144,
1145,
1208,
1338,
1447,
1500,
1641,
1865,
1967,
1968,
1988,
1989,
2217,
2218,
2529,
2530,
2577,
2578,
2642,
2643,
2685,
2686,
2743,
2744,
2778,
2779,
3057,
3058,
3295,
3296,
3311,
3312,
3645,
3646,
3667,
3668,
3682,
3683,
3753
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3753,
"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.3685756325721741,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01908957026898861,
"rps_doc_frac_lines_end_with_ellipsis": 0.018867919221520424,
"rps_doc_frac_no_alph_words": 0.15418502688407898,
"rps_doc_frac_unique_words": 0.4716981053352356,
"rps_doc_mean_word_length": 5.210977554321289,
"rps_doc_num_sentences": 44,
"rps_doc_symbol_to_word_ratio": 0.0014684300404042006,
"rps_doc_unigram_entropy": 5.161196231842041,
"rps_doc_word_count": 583,
"rps_doc_frac_chars_dupe_10grams": 0.0394996702671051,
"rps_doc_frac_chars_dupe_5grams": 0.10862409323453903,
"rps_doc_frac_chars_dupe_6grams": 0.10862409323453903,
"rps_doc_frac_chars_dupe_7grams": 0.10862409323453903,
"rps_doc_frac_chars_dupe_8grams": 0.07373271882534027,
"rps_doc_frac_chars_dupe_9grams": 0.07373271882534027,
"rps_doc_frac_chars_top_2gram": 0.04443712905049324,
"rps_doc_frac_chars_top_3gram": 0.04344964027404785,
"rps_doc_frac_chars_top_4gram": 0.023699799552559853,
"rps_doc_books_importance": -319.82220458984375,
"rps_doc_books_importance_length_correction": -319.82220458984375,
"rps_doc_openwebtext_importance": -183.0411834716797,
"rps_doc_openwebtext_importance_length_correction": -183.0411834716797,
"rps_doc_wikipedia_importance": -125.57357788085938,
"rps_doc_wikipedia_importance_length_correction": -125.57357788085938
},
"fasttext": {
"dclm": 0.04685401916503906,
"english": 0.9246271252632141,
"fineweb_edu_approx": 1.99100923538208,
"eai_general_math": 0.005431000143289566,
"eai_open_web_math": 0.04732536897063255,
"eai_web_code": 0.0023477699141949415
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.778",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.403",
"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": "-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": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"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": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-245,577,282,572,978,620 |
Как создать свой язык программирования: теория, инструменты и советы от практика
Обложка поста
Перевод статьи: «I wrote a programming language. Here’s how you can, too»
Рассказывает программист Вильям В. Вольд
На протяжении последних шести месяцев я работал над созданием языка программирования (ЯП) под названием Pinecone. Я не рискну назвать его законченным, но использовать его уже можно — он содержит для этого достаточно элементов, таких как переменные, функции и пользовательские структуры данных. Если хотите ознакомиться с ним перед прочтением, предлагаю посетить официальную страницу и репозиторий на GitHub.
Введение
Я не эксперт. Когда я начал работу над этим проектом, я понятия не имел, что делаю, и всё еще не имею. Я никогда целенаправленно не изучал принципы создания языка — только прочитал некоторые материалы в Сети и даже в них не нашёл для себя почти ничего полезного.
Тем не менее, я написал абсолютно новый язык. И он работает. Наверное, я что-то делаю правильно.
В этой статье я постараюсь показать, каким образом Pinecone (и другие языки программирования) превращают исходный код в то, что многие считают магией. Также я уделю внимание ситуациям, в которых мне приходилось искать компромиссы, и поясню, почему я принял те решения, которые принял.
Текст точно не претендует на звание полноценного руководства по созданию языка программирования, но для любознательных будет хорошей отправной точкой.
Первые шаги
«А с чего вообще начинать?» — вопрос, который другие разработчики часто задают, узнав, что я пишу свой язык. В этой части постараюсь подробно на него ответить.
Компилируемый или интерпретируемый?
Компилятор анализирует программу целиком, превращает её в машинный код и сохраняет для последующего выполнения. Интерпретатор же разбирает и выполняет программу построчно в режиме реального времени.
Технически любой язык можно как компилировать, так и интерпретировать. Но для каждого языка один из методов подходит больше, чем другой, и выбор парадигмы на ранних этапах определяет дальнейшее проектирование. В общем смысле интерпретация отличается гибкостью, а компиляция обеспечивает высокую производительность, но это лишь верхушка крайне сложной темы.
Я хотел создать простой и при этом производительный язык, каких немного, поэтому с самого начала решил сделать Pinecone компилируемым. Тем не менее, интерпретатор у Pinecone тоже есть — первое время запуск был возможен только с его помощью, позже объясню, почему.
Прим. перев. Кстати, у нас есть краткий обзор серии статей по созданию собственного интерпретатора — это отличное упражнение для тех, кто изучает Python.
Выбор языка
Своеобразный мета-шаг: язык программирования сам является программой, которую надо написать на каком-то языке. Я выбрал C++ из-за производительности, большого набора функциональных возможностей, и просто потому что он мне нравится.
Но в целом совет можно дать такой:
• интерпретируемый ЯП крайне рекомендуется писать на компилируемом ЯП (C, C++, Swift). Иначе потери производительности будут расти как снежный ком, пока мета-интерпретатор интерпретирует ваш интерпретатор;
• компилируемый ЯП можно писать на интерпретируемом ЯП (Python, JS). Возрастёт время компиляции, но не время выполнения программы.
Проектирование архитектуры
У структуры языка программирования есть несколько ступеней от исходного кода до исполняемого файла, на каждой из которых определенным образом происходит форматирование данных, а также функции для перехода между этими ступенями. Поговорим об этом подробнее.
Лексический анализатор / лексер
язык программирования
Строка исходного кода проходит через лексер и превращается в список токенов.
Первый шаг в большинстве ЯП — это лексический анализ. Говоря по-простому, он представляет собой разбиение текста на токены, то есть единицы языка: переменные, названия функций (идентификаторы), операторы, числа. Таким образом, подав лексеру на вход строку с исходным кодом, мы получим на выходе список всех токенов, которые в ней содержатся.
Обращения к исходному коду уже не будет происходить на следующих этапах, поэтому лексер должен выдать всю необходимую для них информацию.
Flex
При создании языка первым делом я написал лексер. Позже я изучил инструменты, которые могли бы сделать лексический анализ проще и уменьшить количество возникающих багов.
Одним из основных таких инструментов является Flex — генератор лексических анализаторов. Он принимает на вход файл с описанием грамматики языка, а потом создаёт программу на C, которая в свою очередь анализирует строку и выдаёт нужный результат.
Моё решение
Я решил оставить написанный мной анализатор. Особых преимуществ у Flex я в итоге не увидел, а его использование только создало бы дополнительные зависимости, усложняющие процесс сборки. К тому же, мой выбор обеспечивает больше гибкости — например, можно добавить к языку оператор без необходимости редактировать несколько файлов.
Синтаксический анализатор / парсер
язык программирования
Список токенов проходит через парсер и превращается в дерево.
Следующая стадия — парсер. Он преобразует исходный текст, то есть список токенов (с учётом скобок и порядка операций), в абстрактное синтаксическое дерево, которое позволяет структурно представить правила создаваемого языка. Сам по себе процесс можно назвать простым, но с увеличением количества языковых конструкций он сильно усложняется.
Bison
На этом шаге я также думал использовать стороннюю библиотеку, рассматривая Bison для генерации синтаксического анализатора. Он во многом похож на Flex — пользовательский файл с синтаксическими правилами структурируется с помощью программы на языке C. Но я снова отказался от средств автоматизации.
Преимущества кастомных программ
С лексером моё решение писать и использовать свой код (длиной около 200 строк) было довольно очевидным: я люблю задачки, а эта к тому же относительно тривиальная. С парсером другая история: сейчас длина кода для него — 750 строк, и это уже третья попытка (первые две были просто ужасны).
Тем не менее, я решил делать парсер сам. Вот основные причины:
В целесообразности решения меня убедило высказывание Уолтера Брайта (создателя языка D) в одной из его статей:
Я бы не советовал использовать генераторы лексических и синтаксических анализаторов, а также другие так называемые «компиляторы компиляторов». Написание лексера и парсера не займёт много времени, а использование генератора накрепко привяжет вас к нему в дальнейшей работе (что имеет значение при портировании компилятора на новую платформу). Кроме того, генераторы отличаются выдачей не релевантных сообщений об ошибках.
Абстрактный семантический граф
язык программирования
Переход от синтаксического дерева к семантическому графу
В этой части я реализовал структуру, по своей сути наиболее близкую к «промежуточному представлению» (intermediate representation) в LLVM. Существует небольшая, но важная разница между абстрактным синтаксическим деревом (АСД) и абстрактным семантическим графом (АСГ).
АСГ vs АСД
Грубо говоря, семантический граф — это синтаксическое дерево с контекстом. То есть, он содержит информацию наподобие какой тип возвращает функция или в каких местах используется одна и та же переменная. Из-за того, что графу нужно распознать и запомнить весь этот контекст, коду, который его генерирует, необходима поддержка в виде множества различных поясняющих таблиц.
Запуск
После того, как граф составлен, запуск программы становится довольно простой задачей. Каждый узел содержит реализацию функции, которая получает некоторые данные на вход, делает то, что запрограммировано (включая возможный вызов вспомогательных функций), и возвращает результат. Это — интерпретатор в действии.
Варианты компиляции
Вы, наверное, спросите, откуда взялся интерпретатор, если я изначально определил Pinecone как компилируемый язык. Дело в том, что компиляция гораздо сложнее, чем интерпретация — я уже упоминал ранее, что столкнулся с некоторыми проблемами на этом шаге.
Написать свой компилятор
Сначала мне понравилась эта мысль — я люблю делать вещи сам, к тому же давно хотел изучить язык ассемблера. Вот только создать с нуля кроссплатформенный компилятор — сложнее, чем написать машинный код для каждого элемента языка. Я счёл эту идею абсолютно не практичной и не стоящей затраченных ресурсов.
LLVM
LLVM — это коллекция инструментов для компиляции, которой пользуются, например, разработчики Swift, Rust и Clang. Я решил остановиться на этом варианте, но опять не рассчитал сложности задачи, которую перед собой поставил. Для меня проблемой оказалось не освоение ассемблера, а работа с огромной многосоставной библиотекой.
Транспайлинг
Мне всё же нужно было какое-то решение, поэтому я написал то, что точно будет работать: транспайлер (transpiler) из Pinecone в C++ — он производит компиляцию по типу «исходный код в исходный код», а также добавил возможность автоматической компиляции вывода с GCC. Такой способ не является ни масштабируемым, ни кроссплатформенным, но на данный момент хотя бы работает почти для всех программ на Pinecone, это уже хорошо.
Дальнейшие планы
Сейчас мне не достаёт необходимой практики, но в будущем я собираюсь от начала и до конца реализовать компилятор Pinecone с помощью LLVM — инструмент мне нравится и руководства к нему хорошие. Пока что интерпретатора хватает для примитивных программ, а транспайлер справляется с более сложными.
Заключение
Надеюсь, эта статья окажется кому-нибудь полезной. Я крайне рекомендую хотя бы попробовать написать свой язык, несмотря на то, что придётся разбираться во множестве деталей реализации — это обучающий, развивающий и просто интересный эксперимент.
Вот общие советы от меня (разумеется, довольно субъективные):
• если у вас нет предпочтений и вы сомневаетесь, компилируемый или интерпретируемый писать язык, выбирайте второе. Интерпретируемые языки обычно проще проектировать, собирать и учить;
• с лексерами и парсерами делайте, что хотите. Использование средств автоматизации зависит от вашего желания, опыта и конкретной ситуации;
• если вы не готовы / не хотите тратить время и силы (много времени и сил) на придумывание собственной стратегии разработки ЯП, следуйте цепочке действий, описанной в этой статье. Я вложил в неё много усилий и она работает;
• опять же, если не хватает времени / мотивации / опыта / желания или ещё чего-нибудь для написания классического ЯП, попробуйте написать эзотерический, типа Brainfuck. (Советуем помнить, что если язык написан развлечения ради, это не значит, что писать его — тоже сплошное развлечение. — прим. перев.)
Я делал довольно много ошибок по ходу разработки, но большую часть кода, на которую они могли повлиять, я уже переписал. Язык сейчас неплохо функционирует и будет развиваться (на момент написания статьи его можно было собрать на Linux и с переменным успехом на macOS, но не на Windows).
О том, что ввязался в историю с созданием Pinecone, ни в коем случае не жалею — это отличный эксперимент, и он только начался.
|
{
"url": "https://tproger.ru/translations/how-to-create-programming-language/",
"source_domain": "tproger.ru",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "90652",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YPKXZLKQQHHCE5JHCUQBIMTIXA4S57BS",
"WARC-Concurrent-To": "<urn:uuid:a6e0f182-ac76-4d7a-be02-e6b46ebd7088>",
"WARC-Date": "2020-10-28T21:09:12Z",
"WARC-IP-Address": "104.26.7.235",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QI663OHVDZLMLUR45WMQWLOU65FZSFIH",
"WARC-Record-ID": "<urn:uuid:dc3834a5-3d50-4f15-a88a-d48fa1bda4e4>",
"WARC-Target-URI": "https://tproger.ru/translations/how-to-create-programming-language/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:08e287ff-e14b-47c4-8399-ddd715d8c771>"
},
"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-241.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,
81,
82,
96,
97,
171,
172,
213,
214,
215,
623,
624,
633,
634,
897,
898,
995,
996,
1281,
1282,
1433,
1434,
1446,
1447,
1607,
1608,
1644,
1645,
1844,
1845,
2202,
2203,
2467,
2468,
2622,
2623,
2635,
2636,
2868,
2869,
2904,
2905,
3113,
3246,
3247,
3274,
3275,
3532,
3533,
3565,
3566,
3588,
3589,
3666,
3667,
4009,
4010,
4148,
4149,
4154,
4155,
4325,
4326,
4572,
4573,
4585,
4586,
4916,
4917,
4952,
4953,
4975,
4976,
5038,
5039,
5379,
5380,
5386,
5387,
5685,
5686,
5718,
5719,
6007,
6008,
6071,
6072,
6183,
6184,
6605,
6606,
6637,
6638,
6660,
6661,
6718,
6719,
6987,
6988,
6999,
7000,
7371,
7372,
7379,
7380,
7690,
7691,
7711,
7712,
7965,
7966,
7991,
7992,
8296,
8297,
8302,
8303,
8627,
8628,
8641,
8642,
9064,
9065,
9082,
9083,
9378,
9379,
9390,
9391,
9637,
9638,
9700,
9701,
9887,
10028,
10254,
10559,
10560,
10847,
10848
],
"line_end_idx": [
81,
82,
96,
97,
171,
172,
213,
214,
215,
623,
624,
633,
634,
897,
898,
995,
996,
1281,
1282,
1433,
1434,
1446,
1447,
1607,
1608,
1644,
1645,
1844,
1845,
2202,
2203,
2467,
2468,
2622,
2623,
2635,
2636,
2868,
2869,
2904,
2905,
3113,
3246,
3247,
3274,
3275,
3532,
3533,
3565,
3566,
3588,
3589,
3666,
3667,
4009,
4010,
4148,
4149,
4154,
4155,
4325,
4326,
4572,
4573,
4585,
4586,
4916,
4917,
4952,
4953,
4975,
4976,
5038,
5039,
5379,
5380,
5386,
5387,
5685,
5686,
5718,
5719,
6007,
6008,
6071,
6072,
6183,
6184,
6605,
6606,
6637,
6638,
6660,
6661,
6718,
6719,
6987,
6988,
6999,
7000,
7371,
7372,
7379,
7380,
7690,
7691,
7711,
7712,
7965,
7966,
7991,
7992,
8296,
8297,
8302,
8303,
8627,
8628,
8641,
8642,
9064,
9065,
9082,
9083,
9378,
9379,
9390,
9391,
9637,
9638,
9700,
9701,
9887,
10028,
10254,
10559,
10560,
10847,
10848,
10974
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10974,
"ccnet_original_nlines": 139,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.0037858299911022186,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027582479640841484,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.9707950353622437,
"rps_doc_frac_unique_words": 0.534326434135437,
"rps_doc_mean_word_length": 5.948834419250488,
"rps_doc_num_sentences": 92,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 6.2048821449279785,
"rps_doc_word_count": 1544,
"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.002612960059195757,
"rps_doc_frac_chars_top_3gram": 0.003266189945861697,
"rps_doc_frac_chars_top_4gram": 0.002395210089161992,
"rps_doc_books_importance": -685.2289428710938,
"rps_doc_books_importance_length_correction": -685.2289428710938,
"rps_doc_openwebtext_importance": -485.10076904296875,
"rps_doc_openwebtext_importance_length_correction": -485.10076904296875,
"rps_doc_wikipedia_importance": -437.4910888671875,
"rps_doc_wikipedia_importance_length_correction": -437.4910888671875
},
"fasttext": {
"dclm": 0.501379668712616,
"english": 0,
"fineweb_edu_approx": 2.564275026321411,
"eai_general_math": 0.0010539899813011289,
"eai_open_web_math": 0.34586793184280396,
"eai_web_code": 0.5208629369735718
}
}
|
{
"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": "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": "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": "23",
"label": "Tutorial"
}
},
"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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,624,744,949,465,704,000 |
Join also our Discord channel! Click here.
Setting NoeTexture Flags?
Coders and would-be coders alike, this is the place to talk about programming.
Post Reply
dgl
ultra-n00b
Posts: 4
Joined: Thu Mar 28, 2019 6:32 am
Has thanked: 3 times
Setting NoeTexture Flags?
Post by dgl » Thu Mar 28, 2019 6:38 am
I'm playing around with a file format that uses texture wrapping, specifically mirrored mapping (and the occasional y-flipping).
Can these values be set with noe texture? I noticed there are flags in the NoeTexture file type, but I can't figure out which values
for what flag or what they would do.
Code: Select all
#texture object
#for supported pixel types, look at constants exposed by noesis module, such as NOESISTEX_RGB24, NOESISTEX_RGBA32, NOESISTEX_DXT1, etc.
class NoeTexture:
def __init__(self, name, width, height, pixelData, pixelType = noesis.NOESISTEX_RGBA32):
self.name = name
self.width = width
self.height = height
self.pixelData = pixelData
self.pixelType = pixelType
self.flags = 0
self.mipCount = 0
def __repr__(self):
return "(NoeTexture:" + " w:" + repr(self.width) + " h:" + repr(self.height) + " p:" + repr(self.pixelType) + " f:" + repr(self.flags) + " n:" + repr(self.name) + ")"
def setFlags(self, flags):
self.flags = flags
def setMipCount(self, mipCount):
self.mipCount = mipCount
Edit:
Okay I'm an idiot. After looking around I found the following constants declared in ./plugins/python/__NPReadMe.txt
Code: Select all
PYNOECONSTN(NTEXFLAG_WRAP_REPEAT),
PYNOECONSTN(NTEXFLAG_ISNORMALMAP),
PYNOECONSTN(NTEXFLAG_SEGMENTED),
PYNOECONSTN(NTEXFLAG_STEREO),
PYNOECONSTN(NTEXFLAG_STEREO_SWAP),
PYNOECONSTN(NTEXFLAG_FILTER_NEAREST),
PYNOECONSTN(NTEXFLAG_WRAP_CLAMP),
PYNOECONSTN(NTEXFLAG_PREVIEWLOAD),
PYNOECONSTN(NTEXFLAG_CUBEMAP),
PYNOECONSTN(NTEXFLAG_ISLINEAR),
PYNOECONSTN(NTEXFLAG_HDRISLINEAR),
PYNOECONSTN(NTEXFLAG_WANTSEAMLESS),
PYNOECONSTN(NTEXFLAG_WRAP_MIRROR_REPEAT),
PYNOECONSTN(NTEXFLAG_WRAP_MIRROR_CLAMP),
Post Reply
|
{
"url": "https://forum.xentax.com/viewtopic.php?f=13&t=19879",
"source_domain": "forum.xentax.com",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "23712",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HQ65XXYAXXR7722R44XLQWWEYIFT2D66",
"WARC-Concurrent-To": "<urn:uuid:98b78fed-6d95-4087-8e00-ef2144f91a47>",
"WARC-Date": "2021-01-28T01:08:14Z",
"WARC-IP-Address": "185.104.29.38",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DEKEBXJ553RTYHQYNESNYRXYW6DLEDQ6",
"WARC-Record-ID": "<urn:uuid:17f34677-493b-4a00-9fe2-c2c11f1bf211>",
"WARC-Target-URI": "https://forum.xentax.com/viewtopic.php?f=13&t=19879",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4dca2cff-6d8e-4213-bdb9-e31b121056e5>"
},
"warc_info": "isPartOf: CC-MAIN-2021-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-32.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,
43,
44,
70,
71,
150,
161,
165,
176,
185,
218,
239,
240,
266,
267,
306,
307,
436,
569,
606,
607,
624,
625,
641,
777,
795,
888,
913,
940,
969,
1004,
1039,
1062,
1088,
1112,
1287,
1288,
1319,
1346,
1347,
1384,
1417,
1423,
1424,
1540,
1541,
1558,
1559,
1598,
1637,
1674,
1708,
1747,
1789,
1827,
1866,
1901,
1937,
1976,
2016,
2062,
2107,
2108
],
"line_end_idx": [
43,
44,
70,
71,
150,
161,
165,
176,
185,
218,
239,
240,
266,
267,
306,
307,
436,
569,
606,
607,
624,
625,
641,
777,
795,
888,
913,
940,
969,
1004,
1039,
1062,
1088,
1112,
1287,
1288,
1319,
1346,
1347,
1384,
1417,
1423,
1424,
1540,
1541,
1558,
1559,
1598,
1637,
1674,
1708,
1747,
1789,
1827,
1866,
1901,
1937,
1976,
2016,
2062,
2107,
2108,
2118
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2118,
"ccnet_original_nlines": 62,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.21144278347492218,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0920398011803627,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3905472457408905,
"rps_doc_frac_unique_words": 0.7511961460113525,
"rps_doc_mean_word_length": 7.220095634460449,
"rps_doc_num_sentences": 28,
"rps_doc_symbol_to_word_ratio": 0.004975120071321726,
"rps_doc_unigram_entropy": 4.952699661254883,
"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.022531479597091675,
"rps_doc_frac_chars_top_3gram": 0.02915837988257408,
"rps_doc_frac_chars_top_4gram": 0.015904569998383522,
"rps_doc_books_importance": -163.33917236328125,
"rps_doc_books_importance_length_correction": -163.33917236328125,
"rps_doc_openwebtext_importance": -113.15084075927734,
"rps_doc_openwebtext_importance_length_correction": -113.15084075927734,
"rps_doc_wikipedia_importance": -92.5563735961914,
"rps_doc_wikipedia_importance_length_correction": -92.5563735961914
},
"fasttext": {
"dclm": 0.6157431602478027,
"english": 0.6689520478248596,
"fineweb_edu_approx": 2.2129387855529785,
"eai_general_math": 0.34288477897644043,
"eai_open_web_math": 0.1099655032157898,
"eai_web_code": 0.04651784896850586
}
}
|
{
"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": "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": "2",
"label": "Click Here References"
}
},
"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": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
494,592,539,315,945,340 |
The JavaScript Object Notation (JSON) Data Interchange Format Textuality
[email protected]
Applications and Real-Time JSONbis JavaScript Object Notation (JSON) is a lightweight, text-based, language-independent data interchange format. It was derived from the ECMAScript Programming Language Standard. JSON defines a small set of formatting rules for the portable representation of structured data. This document removes inconsistencies with other specifications of JSON, repairs specification errors, and offers experience-based interoperability guidance.
JavaScript Object Notation (JSON) is a text format for the serialization of structured data. It is derived from the object literals of JavaScript, as defined in the ECMAScript Programming Language Standard, Third Edition . JSON can represent four primitive types (strings, numbers, booleans, and null) and two structured types (objects and arrays). A string is a sequence of zero or more Unicode characters . Note that this citation references the latest version of Unicode rather than a specific release. It is not expected that future changes in the UNICODE specification will impact the syntax of JSON. An object is an unordered collection of zero or more name/value pairs, where a name is a string and a value is a string, number, boolean, null, object, or array. An array is an ordered sequence of zero or more values. The terms "object" and "array" come from the conventions of JavaScript. JSON's design goals were for it to be minimal, portable, textual, and a subset of JavaScript.
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in . The grammatical rules in this document are to be interpreted as described in .
This document updates , which describes JSON and registers the media type "application/json". JSON is also described in . The reference to ECMA-404 in the previous sentence is normative, not with the usual meaning that implementors need to consult it in order to understand this document, but to emphasize that there are no inconsistencies in the definition of the term "JSON text" in any of its specifications. Note, however, that ECMA-404 allows several practices which this specification recommends avoiding in the interests of maximal interoperability. The intent is that the grammar is the same between the two documents, although different descriptions are used. If there a difference is found between them, ECMA and the IETF will work together to update both documents. If an error is found with either document, the other should be examined to see if it has a similar error, and fixed if possible. If either document is changed in the future, ECMA and the IETF will work together to ensure that the two documents stay aligned through the change.
In the years since the publication of RFC 4627, JSON has found very wide use. This experience has revealed certain patterns, which, while allowed by its specifications, have caused interoperability problems. Also, a small number of errata have been reported to RFC4627 (see RFC Errata IDs 607 and 3607 ) and to RFC7159 (see RFC Errata IDs , , and ). This document's goal is to apply the errata, remove inconsistencies with other specifications of JSON, and highlight practices that can lead to interoperability problems.
A JSON text is a sequence of tokens. The set of tokens includes six structural characters, strings, numbers, and three literal names. A JSON text is a serialized value. Note that certain previous specifications of JSON constrained a JSON text to be an object or an array. Implementations that generate only objects or arrays where a JSON text is called for will be interoperable in the sense that all implementations will accept these as conforming JSON texts.
JSON-text = ws value ws
These are the six structural characters:
begin-array = ws %x5B ws ; [ left square bracket begin-object = ws %x7B ws ; { left curly bracket end-array = ws %x5D ws ; ] right square bracket end-object = ws %x7D ws ; } right curly bracket name-separator = ws %x3A ws ; : colon value-separator = ws %x2C ws ; , comma
Insignificant whitespace is allowed before or after any of the six structural characters.
ws = *( %x20 / ; Space %x09 / ; Horizontal tab %x0A / ; Line feed or New line %x0D ) ; Carriage return
A JSON value MUST be an object, array, number, or string, or one of the following three literal names:
false null true
The literal names MUST be lowercase. No other literal names are allowed.
value = false / null / true / object / array / number / string false = %x66.61.6c.73.65 ; false null = %x6e.75.6c.6c ; null true = %x74.72.75.65 ; true
An object structure is represented as a pair of curly brackets surrounding zero or more name/value pairs (or members). A name is a string. A single colon comes after each name, separating the name from the value. A single comma separates a value from a following name. The names within an object SHOULD be unique.
object = begin-object [ member *( value-separator member ) ] end-object member = string name-separator value
An object whose names are all unique is interoperable in the sense that all software implementations receiving that object will agree on the name-value mappings. When the names within an object are not unique, the behavior of software that receives such an object is unpredictable. Many implementations report the last name/value pair only. Other implementations report an error or fail to parse the object, and some implementations report all of the name/value pairs, including duplicates. JSON parsing libraries have been observed to differ as to whether or not they make the ordering of object members visible to calling software. Implementations whose behavior does not depend on member ordering will be interoperable in the sense that they will not be affected by these differences.
An array structure is represented as square brackets surrounding zero or more values (or elements). Elements are separated by commas.
array = begin-array [ value *( value-separator value ) ] end-array
There is no requirement that the values in an array be of the same type.
The representation of numbers is similar to that used in most programming languages. A number is represented in base 10 using decimal digits. It contains an integer component that may be prefixed with an optional minus sign, which may be followed by a fraction part and/or an exponent part. Leading zeros are not allowed. A fraction part is a decimal point followed by one or more digits. An exponent part begins with the letter E in upper or lower case, which may be followed by a plus or minus sign. The E and optional sign are followed by one or more digits. Numeric values that cannot be represented in the grammar below (such as Infinity and NaN) are not permitted.
number = [ minus ] int [ frac ] [ exp ] decimal-point = %x2E ; . digit1-9 = %x31-39 ; 1-9 e = %x65 / %x45 ; e E exp = e [ minus / plus ] 1*DIGIT frac = decimal-point 1*DIGIT int = zero / ( digit1-9 *DIGIT ) minus = %x2D ; - plus = %x2B ; + zero = %x30 ; 0
This specification allows implementations to set limits on the range and precision of numbers accepted. Since software that implements IEEE 754-2008 binary64 (double precision) numbers is generally available and widely used, good interoperability can be achieved by implementations that expect no more precision or range than these provide, in the sense that implementations will approximate JSON numbers within the expected precision. A JSON number such as 1E400 or 3.141592653589793238462643383279 may indicate potential interoperability problems, since it suggests that the software that created it expects receiving software to have greater capabilities for numeric magnitude and precision than is widely available. Note that when such software is used, numbers that are integers and are in the range [-(2**53)+1, (2**53)-1] are interoperable in the sense that implementations will agree exactly on their numeric values.
The representation of strings is similar to conventions used in the C family of programming languages. A string begins and ends with quotation marks. All Unicode characters may be placed within the quotation marks, except for the characters that must be escaped: quotation mark, reverse solidus, and the control characters (U+0000 through U+001F). Any character may be escaped. If the character is in the Basic Multilingual Plane (U+0000 through U+FFFF), then it may be represented as a six-character sequence: a reverse solidus, followed by the lowercase letter u, followed by four hexadecimal digits that encode the character's code point. The hexadecimal letters A though F can be upper or lower case. So, for example, a string containing only a single reverse solidus character may be represented as "\u005C". Alternatively, there are two-character sequence escape representations of some popular characters. So, for example, a string containing only a single reverse solidus character may be represented more compactly as "\\". To escape an extended character that is not in the Basic Multilingual Plane, the character is represented as a 12-character sequence, encoding the UTF-16 surrogate pair. So, for example, a string containing only the G clef character (U+1D11E) may be represented as "\uD834\uDD1E".
string = quotation-mark *char quotation-mark char = unescaped / escape ( %x22 / ; " quotation mark U+0022 %x5C / ; \ reverse solidus U+005C %x2F / ; / solidus U+002F %x62 / ; b backspace U+0008 %x66 / ; f form feed U+000C %x6E / ; n line feed U+000A %x72 / ; r carriage return U+000D %x74 / ; t tab U+0009 %x75 4HEXDIG ) ; uXXXX U+XXXX escape = %x5C ; \ quotation-mark = %x22 ; " unescaped = %x20-21 / %x23-5B / %x5D-10FFFF
When transmitting over a network protocol, or as a payload of a network protocol intended to be interpreted as part of a protocol, JSON text MUST be encoded in UTF-8 (Section 3 of ). Previous specifications of JSON have not required the use of UTF-8 when transmitting JSON text. However, the vast majority of JSON-based software implementations have chosen to use the UTF-8 encoding, to the extent that it is the only encoding that achieves interoperability. Implementations MUST NOT add a byte order mark (U+FEFF) to the beginning of a networked-transmitted JSON text. In the interests of interoperability, implementations that parse JSON texts MAY ignore the presence of a byte order mark rather than treating it as an error.
When all the strings represented in a JSON text are composed entirely of Unicode characters (however escaped), then that JSON text is interoperable in the sense that all software implementations that parse it will agree on the contents of names and of string values in objects and arrays. However, the ABNF in this specification allows member names and string values to contain bit sequences that cannot encode Unicode characters; for example, "\uDEAD" (a single unpaired UTF-16 surrogate). Instances of this have been observed, for example, when a library truncates a UTF-16 string without checking whether the truncation split a surrogate pair. The behavior of software that receives JSON texts containing such values is unpredictable; for example, implementations might return different values for the length of a string value or even suffer fatal runtime exceptions.
Software implementations are typically required to test names of object members for equality. Implementations that transform the textual representation into sequences of Unicode code units and then perform the comparison numerically, code unit by code unit, are interoperable in the sense that implementations will agree in all cases on equality or inequality of two strings. For example, implementations that compare strings with escaped characters unconverted may incorrectly find that "a\\b" and "a\u005Cb" are not equal.
A JSON parser transforms a JSON text into another representation. A JSON parser MUST accept all texts that conform to the JSON grammar. A JSON parser MAY accept non-JSON forms or extensions. An implementation may set limits on the size of texts that it accepts. An implementation may set limits on the maximum depth of nesting. An implementation may set limits on the range and precision of numbers. An implementation may set limits on the length and character contents of strings.
A JSON generator produces JSON text. The resulting text MUST strictly conform to the JSON grammar.
The MIME media type for JSON text is application/json. applicationjsonn/an/abinarySee [THIS DOC], Section 12.Described in [THIS DOC][THIS DOC] JSON has been used to exchange data between applications written in all of these programming languages: ActionScript, C, C#, Clojure, ColdFusion, Common Lisp, E, Erlang, Go, Java, JavaScript, Lua, Objective CAML, Perl, PHP, Python, Rebol, Ruby, Scala, and Scheme. Magic number(s): n/a File extension(s): .json Macintosh file type code(s): TEXT IESG <[email protected]>COMMONnone Douglas Crockford <[email protected]> IESG <[email protected]>No "charset" parameter is defined for this registration. Adding one really has no effect on compliant recipients.
Generally, there are security issues with scripting languages. JSON is a subset of JavaScript but excludes assignment and invocation. Since JSON's syntax is borrowed from JavaScript, it is possible to use that language's "eval()" function to parse most JSON texts (but not all; certain characters such as U+2028 LINE SEPARATOR and U+2029 PARAGRAPH SEPARATOR are legal in JSON but not JavaScript). This generally constitutes an unacceptable security risk, since the text could contain executable code along with data declarations. The same consideration applies to the use of eval()-like functions in any other programming language in which JSON texts conform to that language's syntax.
This is a JSON object:
{ "Image": { "Width": 800, "Height": 600, "Title": "View from 15th Floor", "Thumbnail": { "Url": "http://www.example.com/image/481989943", "Height": 125, "Width": 100 }, "Animated" : false, "IDs": [116, 943, 234, 38793] } }
Its Image member is an object whose Thumbnail member is an object and whose IDs member is an array of numbers. This is a JSON array containing two objects:
[ { "precision": "zip", "Latitude": 37.7668, "Longitude": -122.3959, "Address": "", "City": "SAN FRANCISCO", "State": "CA", "Zip": "94107", "Country": "US" }, { "precision": "zip", "Latitude": 37.371991, "Longitude": -122.026020, "Address": "", "City": "SUNNYVALE", "State": "CA", "Zip": "94085", "Country": "US" } ]
Here are three small JSON texts containing only values:
"Hello world!" 42 true
RFC 4627 was written by Douglas Crockford. This document was constructed by making a relatively small number of changes to that document; thus, the vast majority of the text here is his.
IEEE Standard for Floating-Point ArithmeticIEEE
Key words for use in RFCs to Indicate Requirement LevelsIn many standards track documents several words are used to signify the requirements in the specification. These words are often capitalized. This document defines these words as they should be interpreted in IETF documents. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements. Augmented BNF for Syntax Specifications: ABNFInternet technical specifications often need to define a formal syntax. Over the years, a modified version of Backus-Naur Form (BNF), called Augmented BNF (ABNF), has been popular among many Internet specifications. The current specification documents ABNF. It balances compactness and simplicity with reasonable representational power. The differences between standard BNF and ABNF involve naming rules, repetition, alternatives, order-independence, and value ranges. This specification also supplies additional rule definitions and encoding for a core lexical analyzer of the type common to several Internet specifications. [STANDARDS-TRACK] The Unicode StandardThe Unicode Consortium
The JSON Data Interchange Format Ecma International
The application/json Media Type for JavaScript Object Notation (JSON)JavaScript Object Notation (JSON) is a lightweight, text-based, language-independent data interchange format. It was derived from the ECMAScript Programming Language Standard. JSON defines a small set of formatting rules for the portable representation of structured data. This memo provides information for the Internet community. ECMAScript Language Specification, Third Edition Ecma International
Errata ID 607RFC ErrataErrata ID 3607RFC ErrataErrata ID 7159RFC ErrataErrata ID 7159RFC ErrataErrata ID 7159RFC Errata
This section lists changes between this document and the text in RFC RFC7159. has been updated to reflect the removal of a JSON specification from ECMA-262, to make the reference to ECMA-404 normative, and to explain the particular meaning of "normative". has been updated to reflect errata filed against RFC7159, not RFC4627. was changed to require the use of UTF-8 when transmitted over a network. has been updated to increase the precision of the description of the security risk that follows from using the ECMAScript "eval()" function. Section 15.1 has been updated to include ECMA 404 as a normative reference. Section 15.2 has been updated to remove ECMA 404, update the version of ECMA-262, and refresh the errata list.
|
{
"url": "https://www.ietf.org/archive/id/draft-ietf-jsonbis-rfc7159bis-04.xml",
"source_domain": "www.ietf.org",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "31563",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AO62RNRW6YBYLNQOODFID4DI4NOU4LTI",
"WARC-Concurrent-To": "<urn:uuid:cb43dacf-b7d6-4255-a38a-758e8a04bf20>",
"WARC-Date": "2024-04-22T20:23:17Z",
"WARC-IP-Address": "104.16.44.99",
"WARC-Identified-Payload-Type": "application/xml",
"WARC-Payload-Digest": "sha1:QO3G6QG5TR3F2STO7CSTX7SG7SL7MCJ4",
"WARC-Record-ID": "<urn:uuid:245a5ddb-96bd-4b33-a237-8e7fb6317638>",
"WARC-Target-URI": "https://www.ietf.org/archive/id/draft-ietf-jsonbis-rfc7159bis-04.xml",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e716a883-2c3e-47fd-ae4d-9402969241e8>"
},
"warc_info": "isPartOf: CC-MAIN-2024-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-82\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,
73,
94,
560,
1550,
1815,
2869,
3390,
3851,
3875,
3916,
4187,
4277,
4380,
4483,
4499,
4572,
4724,
5038,
5147,
5935,
6069,
6136,
6209,
6880,
7136,
8061,
9375,
9799,
10527,
11398,
11923,
12405,
12504,
13198,
13884,
13907,
14131,
14287,
14604,
14660,
14683,
14870,
14918,
16076,
16128,
16597,
16717
],
"line_end_idx": [
73,
94,
560,
1550,
1815,
2869,
3390,
3851,
3875,
3916,
4187,
4277,
4380,
4483,
4499,
4572,
4724,
5038,
5147,
5935,
6069,
6136,
6209,
6880,
7136,
8061,
9375,
9799,
10527,
11398,
11923,
12405,
12504,
13198,
13884,
13907,
14131,
14287,
14604,
14660,
14683,
14870,
14918,
16076,
16128,
16597,
16717,
17444
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 17444,
"ccnet_original_nlines": 47,
"rps_doc_curly_bracket": 0.0006879200227558613,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31457144021987915,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06114286184310913,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.238571435213089,
"rps_doc_frac_unique_words": 0.3012279272079468,
"rps_doc_mean_word_length": 5.3104376792907715,
"rps_doc_num_sentences": 154,
"rps_doc_symbol_to_word_ratio": 0.0002857100043911487,
"rps_doc_unigram_entropy": 5.803213596343994,
"rps_doc_word_count": 2606,
"rps_doc_frac_chars_dupe_10grams": 0.05000361055135727,
"rps_doc_frac_chars_dupe_5grams": 0.15225088596343994,
"rps_doc_frac_chars_dupe_6grams": 0.11973407864570618,
"rps_doc_frac_chars_dupe_7grams": 0.09184189885854721,
"rps_doc_frac_chars_dupe_8grams": 0.07616157084703445,
"rps_doc_frac_chars_dupe_9grams": 0.07153695821762085,
"rps_doc_frac_chars_top_2gram": 0.008309849537909031,
"rps_doc_frac_chars_top_3gram": 0.0050581698305904865,
"rps_doc_frac_chars_top_4gram": 0.007081440184265375,
"rps_doc_books_importance": -1674.0316162109375,
"rps_doc_books_importance_length_correction": -1674.0316162109375,
"rps_doc_openwebtext_importance": -1078.2176513671875,
"rps_doc_openwebtext_importance_length_correction": -1078.2176513671875,
"rps_doc_wikipedia_importance": -758.24072265625,
"rps_doc_wikipedia_importance_length_correction": -758.24072265625
},
"fasttext": {
"dclm": 0.29758787155151367,
"english": 0.8552708029747009,
"fineweb_edu_approx": 3.0807793140411377,
"eai_general_math": 0.9264857769012451,
"eai_open_web_math": 0.4273718595504761,
"eai_web_code": 0.931535005569458
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.72",
"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": "-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": "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": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,266,253,295,122,553,000 |
tcpproxy
package module
Version: v0.0.0-...-b6bb9b5 Latest Latest
Warning
This package is not in the latest version of its module.
Go to latest
Published: Jan 25, 2020 License: Apache-2.0 Imports: 13 Imported by: 0
README
Documentation
Overview
Package tcpproxy lets users build TCP proxies, optionally making routing decisions based on HTTP/1 Host headers and the SNI hostname in TLS connections.
Typical usage:
var p tcpproxy.Proxy
p.AddHTTPHostRoute(":80", "foo.com", tcpproxy.To("10.0.0.1:8081"))
p.AddHTTPHostRoute(":80", "bar.com", tcpproxy.To("10.0.0.2:8082"))
p.AddRoute(":80", tcpproxy.To("10.0.0.1:8081")) // fallback
p.AddSNIRoute(":443", "foo.com", tcpproxy.To("10.0.0.1:4431"))
p.AddSNIRoute(":443", "bar.com", tcpproxy.To("10.0.0.2:4432"))
p.AddRoute(":443", tcpproxy.To("10.0.0.1:4431")) // fallback
log.Fatal(p.Run())
Calling Run (or Start) on a proxy also starts all the necessary listeners.
For each accepted connection, the rules for that ipPort are matched, in order. If one matches (currently HTTP Host, SNI, or always), then the connection is handed to the target.
The two predefined Target implementations are:
1) DialProxy, proxying to another address (use the To func to return a DialProxy value),
2) TargetListener, making the matched connection available via a net.Listener.Accept call.
But Target is an interface, so you can also write your own.
Note that tcpproxy does not do any TLS encryption or decryption. It only (via DialProxy) copies bytes around. The SNI hostname in the TLS header is unencrypted, for better or worse.
This package makes no API stability promises. If you depend on it, vendor it.
Index
Constants
This section is empty.
Variables
This section is empty.
Functions
func UnderlyingConn
func UnderlyingConn(c net.Conn) net.Conn
UnderlyingConn returns c.Conn if c of type *Conn, otherwise it returns c.
Types
type Conn
type Conn struct {
// HostName is the hostname field that was sent to the request router.
// In the case of TLS, this is the SNI header, in the case of HTTPHost
// route, it will be the host header. In the case of a fixed
// route, i.e. those created with AddRoute(), this will always be
// empty. This can be useful in the case where further routing decisions
// need to be made in the Target impementation.
HostName string
// Peeked are the bytes that have been read from Conn for the
// purposes of route matching, but have not yet been consumed
// by Read calls. It set to nil by Read when fully consumed.
Peeked []byte
// Conn is the underlying connection.
// It can be type asserted against *net.TCPConn or other types
// as needed. It should not be read from directly unless
// Peeked is nil.
net.Conn
}
Conn is an incoming connection that has had some bytes read from it to determine how to route the connection. The Read method stitches the peeked bytes and unread bytes back together.
func (*Conn) Read
func (c *Conn) Read(p []byte) (n int, err error)
type DialProxy
type DialProxy struct {
// Addr is the TCP address to proxy to.
Addr string
// KeepAlivePeriod sets the period between TCP keep alives.
// If zero, a default is used. To disable, use a negative number.
// The keep-alive is used for both the client connection and
KeepAlivePeriod time.Duration
// DialTimeout optionally specifies a dial timeout.
// If zero, a default is used.
// If negative, the timeout is disabled.
DialTimeout time.Duration
// DialContext optionally specifies an alternate dial function
// for TCP targets. If nil, the standard
// net.Dialer.DialContext method is used.
DialContext func(ctx context.Context, network, address string) (net.Conn, error)
// OnDialError optionally specifies an alternate way to handle errors dialing Addr.
// If nil, the error is logged and src is closed.
// If non-nil, src is not closed automatically.
OnDialError func(src net.Conn, dstDialErr error)
// ProxyProtocolVersion optionally specifies the version of
// HAProxy's PROXY protocol to use. The PROXY protocol provides
// connection metadata to the DialProxy target, via a header
// inserted ahead of the client's traffic. The DialProxy target
// must explicitly support and expect the PROXY header; there is
// no graceful downgrade.
// If zero, no PROXY header is sent. Currently, version 1 is supported.
ProxyProtocolVersion int
}
DialProxy implements Target by dialing a new connection to Addr and then proxying data back and forth.
The To func is a shorthand way of creating a DialProxy.
func To
func To(addr string) *DialProxy
To is shorthand way of writing &tlsproxy.DialProxy{Addr: addr}.
func (*DialProxy) HandleConn
func (dp *DialProxy) HandleConn(src net.Conn)
HandleConn implements the Target interface.
type Matcher
type Matcher func(ctx context.Context, hostname string) bool
Matcher reports whether hostname matches the Matcher's criteria.
type Proxy
type Proxy struct {
// ListenFunc optionally specifies an alternate listen
// function. If nil, net.Dial is used.
// The provided net is always "tcp".
ListenFunc func(net, laddr string) (net.Listener, error)
// contains filtered or unexported fields
}
Proxy is a proxy. Its zero value is a valid proxy that does nothing. Call methods to add routes before calling Start or Run.
The order that routes are added in matters; each is matched in the order registered.
func (*Proxy) AddHTTPHostMatchRoute
func (p *Proxy) AddHTTPHostMatchRoute(ipPort string, match Matcher, dest Target)
AddHTTPHostMatchRoute appends a route to the ipPort listener that routes to dest if the incoming HTTP/1.x Host header name is accepted by matcher. If it doesn't match, rule processing continues for any additional routes on ipPort.
The ipPort is any valid net.Listen TCP address.
func (*Proxy) AddHTTPHostRoute
func (p *Proxy) AddHTTPHostRoute(ipPort, httpHost string, dest Target)
AddHTTPHostRoute appends a route to the ipPort listener that routes to dest if the incoming HTTP/1.x Host header name is httpHost. If it doesn't match, rule processing continues for any additional routes on ipPort.
The ipPort is any valid net.Listen TCP address.
func (*Proxy) AddRoute
func (p *Proxy) AddRoute(ipPort string, dest Target)
AddRoute appends an always-matching route to the ipPort listener, directing any connection to dest.
This is generally used as either the only rule (for simple TCP proxies), or as the final fallback rule for an ipPort.
The ipPort is any valid net.Listen TCP address.
func (*Proxy) AddSNIMatchRoute
func (p *Proxy) AddSNIMatchRoute(ipPort string, matcher Matcher, dest Target)
AddSNIMatchRoute appends a route to the ipPort listener that routes to dest if the incoming TLS SNI server name is accepted by matcher. If it doesn't match, rule processing continues for any additional routes on ipPort.
By default, the proxy will route all ACME tls-sni-01 challenges received on ipPort to all SNI dests. You can disable ACME routing with AddStopACMESearch.
The ipPort is any valid net.Listen TCP address.
func (*Proxy) AddSNIRoute
func (p *Proxy) AddSNIRoute(ipPort, sni string, dest Target)
AddSNIRoute appends a route to the ipPort listener that routes to dest if the incoming TLS SNI server name is sni. If it doesn't match, rule processing continues for any additional routes on ipPort.
By default, the proxy will route all ACME tls-sni-01 challenges received on ipPort to all SNI dests. You can disable ACME routing with AddStopACMESearch.
The ipPort is any valid net.Listen TCP address.
func (*Proxy) AddStopACMESearch
func (p *Proxy) AddStopACMESearch(ipPort string)
AddStopACMESearch prevents ACME probing of subsequent SNI routes. Any ACME challenges on ipPort for SNI routes previously added before this call will still be proxied to all possible SNI backends.
func (*Proxy) Close
func (p *Proxy) Close() error
Close closes all the proxy's self-opened listeners.
func (*Proxy) Run
func (p *Proxy) Run() error
Run is calls Start, and then Wait.
It blocks until there's an error. The return value is always non-nil.
func (*Proxy) Start
func (p *Proxy) Start() error
Start creates a TCP listener for each unique ipPort from the previously created routes and starts the proxy. It returns any error from starting listeners.
If it returns a non-nil error, any successfully opened listeners are closed.
func (*Proxy) Wait
func (p *Proxy) Wait() error
Wait waits for the Proxy to finish running. Currently this can only happen if a Listener is closed, or Close is called on the proxy.
It is only valid to call Wait after a successful call to Start.
type Target
type Target interface {
// HandleConn is called when an incoming connection is
// matched. After the call to HandleConn, the tcpproxy
// package never touches the conn again. Implementations are
// responsible for closing the connection when needed.
//
// The concrete type of conn will be of type *Conn if any
// bytes have been consumed for the purposes of route
// matching.
HandleConn(net.Conn)
}
Target is what an incoming matched connection is sent to.
type TargetListener
type TargetListener struct {
Address string // Address is the string reported by TargetListener.Addr().String().
// contains filtered or unexported fields
}
TargetListener implements both net.Listener and Target. Matched Targets become accepted connections.
func (*TargetListener) Accept
func (tl *TargetListener) Accept() (net.Conn, error)
Accept implements the Accept method in the net.Listener interface.
func (*TargetListener) Addr
func (tl *TargetListener) Addr() net.Addr
Addr returns the listener's Address field as a net.Addr.
func (*TargetListener) Close
func (tl *TargetListener) Close() error
Close stops listening for new connections. All new connections routed to this listener will be closed. Already accepted connections are not closed.
func (*TargetListener) HandleConn
func (tl *TargetListener) HandleConn(c net.Conn)
HandleConn implements the Target interface. It blocks until tl is closed or another goroutine has called Accept and received c.
Directories
Path Synopsis
cmd
Jump to
Keyboard shortcuts
? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL
|
{
"url": "https://pkg.go.dev/github.com/bradfitz/tcpproxy?utm_source=godoc",
"source_domain": "pkg.go.dev",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "82835",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GHE4KHGNWGY7B4LAEL6TJTFECOUMGMSC",
"WARC-Concurrent-To": "<urn:uuid:3dcf7a64-3f0f-440d-afa9-0efdc4563e1a>",
"WARC-Date": "2022-12-04T23:15:59Z",
"WARC-IP-Address": "34.149.140.181",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OU6WX4Q73RZA5WP65BNNDJFW476PDHIV",
"WARC-Record-ID": "<urn:uuid:9a40d5cf-41ec-42b0-a0b5-542edb99d5d2>",
"WARC-Target-URI": "https://pkg.go.dev/github.com/bradfitz/tcpproxy?utm_source=godoc",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:94bc0d09-51a5-4364-9c89-220a9b5dbaeb>"
},
"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-11\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,
9,
10,
25,
67,
75,
76,
133,
134,
147,
218,
219,
226,
227,
241,
242,
251,
252,
405,
406,
421,
422,
443,
510,
577,
637,
700,
763,
824,
843,
844,
919,
920,
1098,
1099,
1146,
1147,
1236,
1237,
1328,
1329,
1389,
1390,
1572,
1573,
1651,
1652,
1658,
1659,
1669,
1670,
1693,
1694,
1704,
1705,
1728,
1729,
1739,
1740,
1760,
1761,
1802,
1803,
1877,
1878,
1884,
1885,
1895,
1896,
1915,
1987,
2059,
2122,
2189,
2263,
2312,
2329,
2330,
2393,
2456,
2518,
2533,
2534,
2573,
2637,
2695,
2714,
2724,
2726,
2727,
2911,
2912,
2930,
2931,
2980,
2981,
2996,
2997,
3021,
3062,
3075,
3076,
3137,
3204,
3266,
3297,
3298,
3351,
3383,
3425,
3452,
3453,
3517,
3559,
3602,
3684,
3685,
3770,
3821,
3870,
3920,
3921,
3982,
4047,
4109,
4174,
4240,
4267,
4340,
4366,
4368,
4369,
4472,
4473,
4529,
4530,
4538,
4539,
4571,
4572,
4636,
4637,
4666,
4667,
4713,
4714,
4758,
4759,
4772,
4773,
4834,
4835,
4900,
4901,
4912,
4913,
4933,
4934,
4990,
5030,
5068,
5126,
5169,
5171,
5172,
5297,
5298,
5383,
5384,
5420,
5421,
5502,
5503,
5734,
5735,
5783,
5784,
5815,
5816,
5887,
5888,
6103,
6104,
6152,
6153,
6176,
6177,
6230,
6231,
6331,
6332,
6450,
6451,
6499,
6500,
6531,
6532,
6610,
6611,
6831,
6832,
6986,
6987,
7035,
7036,
7062,
7063,
7124,
7125,
7324,
7325,
7479,
7480,
7528,
7529,
7561,
7562,
7611,
7612,
7809,
7810,
7830,
7831,
7861,
7862,
7914,
7915,
7933,
7934,
7962,
7963,
7998,
7999,
8069,
8070,
8090,
8091,
8121,
8122,
8277,
8278,
8355,
8356,
8375,
8376,
8405,
8406,
8539,
8540,
8604,
8605,
8617,
8618,
8642,
8698,
8754,
8816,
8872,
8876,
8935,
8990,
9004,
9026,
9028,
9029,
9087,
9088,
9108,
9109,
9138,
9223,
9266,
9268,
9269,
9370,
9371,
9401,
9402,
9455,
9456,
9523,
9524,
9552,
9553,
9595,
9596,
9653,
9654,
9683,
9684,
9724,
9725,
9873,
9874,
9908,
9909,
9958,
9959,
10087,
10088,
10100,
10101,
10115,
10119,
10120,
10128,
10129,
10148,
10149,
10163,
10179,
10196
],
"line_end_idx": [
9,
10,
25,
67,
75,
76,
133,
134,
147,
218,
219,
226,
227,
241,
242,
251,
252,
405,
406,
421,
422,
443,
510,
577,
637,
700,
763,
824,
843,
844,
919,
920,
1098,
1099,
1146,
1147,
1236,
1237,
1328,
1329,
1389,
1390,
1572,
1573,
1651,
1652,
1658,
1659,
1669,
1670,
1693,
1694,
1704,
1705,
1728,
1729,
1739,
1740,
1760,
1761,
1802,
1803,
1877,
1878,
1884,
1885,
1895,
1896,
1915,
1987,
2059,
2122,
2189,
2263,
2312,
2329,
2330,
2393,
2456,
2518,
2533,
2534,
2573,
2637,
2695,
2714,
2724,
2726,
2727,
2911,
2912,
2930,
2931,
2980,
2981,
2996,
2997,
3021,
3062,
3075,
3076,
3137,
3204,
3266,
3297,
3298,
3351,
3383,
3425,
3452,
3453,
3517,
3559,
3602,
3684,
3685,
3770,
3821,
3870,
3920,
3921,
3982,
4047,
4109,
4174,
4240,
4267,
4340,
4366,
4368,
4369,
4472,
4473,
4529,
4530,
4538,
4539,
4571,
4572,
4636,
4637,
4666,
4667,
4713,
4714,
4758,
4759,
4772,
4773,
4834,
4835,
4900,
4901,
4912,
4913,
4933,
4934,
4990,
5030,
5068,
5126,
5169,
5171,
5172,
5297,
5298,
5383,
5384,
5420,
5421,
5502,
5503,
5734,
5735,
5783,
5784,
5815,
5816,
5887,
5888,
6103,
6104,
6152,
6153,
6176,
6177,
6230,
6231,
6331,
6332,
6450,
6451,
6499,
6500,
6531,
6532,
6610,
6611,
6831,
6832,
6986,
6987,
7035,
7036,
7062,
7063,
7124,
7125,
7324,
7325,
7479,
7480,
7528,
7529,
7561,
7562,
7611,
7612,
7809,
7810,
7830,
7831,
7861,
7862,
7914,
7915,
7933,
7934,
7962,
7963,
7998,
7999,
8069,
8070,
8090,
8091,
8121,
8122,
8277,
8278,
8355,
8356,
8375,
8376,
8405,
8406,
8539,
8540,
8604,
8605,
8617,
8618,
8642,
8698,
8754,
8816,
8872,
8876,
8935,
8990,
9004,
9026,
9028,
9029,
9087,
9088,
9108,
9109,
9138,
9223,
9266,
9268,
9269,
9370,
9371,
9401,
9402,
9455,
9456,
9523,
9524,
9552,
9553,
9595,
9596,
9653,
9654,
9683,
9684,
9724,
9725,
9873,
9874,
9908,
9909,
9958,
9959,
10087,
10088,
10100,
10101,
10115,
10119,
10120,
10128,
10129,
10148,
10149,
10163,
10179,
10196,
10218
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10218,
"ccnet_original_nlines": 311,
"rps_doc_curly_bracket": 0.0011743999784812331,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2555190324783325,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022076090797781944,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2705495357513428,
"rps_doc_frac_unique_words": 0.2874659299850464,
"rps_doc_mean_word_length": 5.348092555999756,
"rps_doc_num_sentences": 181,
"rps_doc_symbol_to_word_ratio": 0.00046969999675638974,
"rps_doc_unigram_entropy": 5.331541061401367,
"rps_doc_word_count": 1468,
"rps_doc_frac_chars_dupe_10grams": 0.14278435707092285,
"rps_doc_frac_chars_dupe_5grams": 0.18277926743030548,
"rps_doc_frac_chars_dupe_6grams": 0.1667303442955017,
"rps_doc_frac_chars_dupe_7grams": 0.14278435707092285,
"rps_doc_frac_chars_dupe_8grams": 0.14278435707092285,
"rps_doc_frac_chars_dupe_9grams": 0.14278435707092285,
"rps_doc_frac_chars_top_2gram": 0.011463509872555733,
"rps_doc_frac_chars_top_3gram": 0.012737230397760868,
"rps_doc_frac_chars_top_4gram": 0.010189780034124851,
"rps_doc_books_importance": -869.0972900390625,
"rps_doc_books_importance_length_correction": -869.0972900390625,
"rps_doc_openwebtext_importance": -478.76611328125,
"rps_doc_openwebtext_importance_length_correction": -478.76611328125,
"rps_doc_wikipedia_importance": -382.387451171875,
"rps_doc_wikipedia_importance_length_correction": -382.387451171875
},
"fasttext": {
"dclm": 0.09593898057937622,
"english": 0.7226049304008484,
"fineweb_edu_approx": 1.9693835973739624,
"eai_general_math": 0.09966468811035156,
"eai_open_web_math": 0.04101091995835304,
"eai_web_code": 0.8145619630813599
}
}
|
{
"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": "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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,544,915,888,513,147,000 |
It is currently Fri Aug 28, 2015 6:27 am
All times are UTC - 8 hours
Post new topic Reply to topic [ 9 posts ]
Author Message
Post subject: [Does] adding ram cause heat ?
PostPosted: Thu Feb 21, 2013 8:26 am
Offline
Joined: Wed Dec 09, 2009 3:58 am
Posts: 70
Location: green
couldn't find a specific forum for this, hope it's o.k here.
I'm thinking of adding ram to my desktop.
it has Intel i3 530 2.93 GHz CPU, gigabyte h55m- usb3 mobo. Samsung 7200 rpm 32mb sata 2 1T H.D .
currently i have 2x2 GB ram. think to add more 2x4 gb .
i read in some places a controversial opinions that adding ram cause more heat in the p.c .
some people said that after doing it their temp went up for few cel. degrees .
the reason that i'm trying to know it in advance is because my p.c was build for max quietness and therefore as less possible working fans.( i have passive cooling on the cpu and my case is antec p-182 with upper fan disabled and others on minimum speed).
so if it really cause more heat it means more fans, more noise.
I'm still trying to check if, and how much ram i need and the combination of those 2 subjects will help me make decisions .
another question is if raising the ram speed , let say from 1333 to 1600 mhz (both are in my hardware spec range) will cause more heat?
Top
Profile
Post subject: Re: doe's adding ram cause heat ?
PostPosted: Thu Feb 21, 2013 8:40 am
Offline
Joined: Mon Mar 17, 2008 1:49 pm
Posts: 1320
Location: UK
RAM does use power but a small amount. 1-2W per stick perhaps depending upon voltage, frequency, number of sticks, there's a few parameters that could influence it.
Will this influence computer temperatures? Very marginal to the point of being scientifically unmeasurable. People who are reporting temperature changes of a couple of degrees are most likely seeing natural statistical variations or other factors coming into play. It's like people on some forums say "I did x and lowered my CPU temp by 1C! It must be better". That never makes sense when the accuracy of measurements is +/-1C and whatever temperatrue you compare that to is also +/-1C hence the combined accuracy is +/-2C.
_________________
Silverstone SG03B: E8200, Asus P5E-VM HDMI, 2Gb RAM, Leadtek 9600GT+S1 rev. 2, Samsung 500Gb, Seasonic X-400, 2x Akasa 120mm, Scythe Zipang 2 fanless
Top
Profile
Post subject: Re: doe's adding ram cause heat ?
PostPosted: Thu Feb 21, 2013 8:50 am
Offline
Joined: Wed Dec 09, 2009 3:58 am
Posts: 70
Location: green
someone else told me that:
"People who are reporting temperature changes of a couple of degrees are most likely seeing natural statistical variations or other factors coming into play."
what about raising ram mhz speed ?
and if i may, one more.
how do i know for sure if i really need more ram?
i think that my everyday applications are not so demanding, but when i open some game like the sims 3, it takes a lot of time until it is loaded ( it's not a very demanding game but it has o lot of content), during playing the game it looks like o.k.
and while the game is running on background, even without playing, every simple act on the pc is very, very slow.
also, when doing regular multitasking it slow the pc.
i aware of the fact that the hard drive can be also one of the reasons to that.
Top
Profile
Post subject: Re: doe's adding ram cause heat ?
PostPosted: Thu Feb 21, 2013 9:10 am
Offline
Joined: Mon Mar 17, 2008 1:49 pm
Posts: 1320
Location: UK
nimo11 wrote:
what about raising ram mhz speed ?
It's generally accepted that power consumption of components is proportional to frequency. Therefore if you overlock by 10%, you'd add 10% to the power consumption. If a RAM stick is 2W then you'd add 0.2W. These are tiny amounts. Changing voltage of RAM can make more of a difference but it is still only going to be a couple of Watts per stick which as a proportion of the total systems consumption, is minimal.
nimo11 wrote:
how do i know for sure if i really need more ram?
i think that my everyday applications are not so demanding, but when i open some game like the sims 3, it takes a lot of time until it is loaded ( it's not a very demanding game but it has o lot of content), during playing the game it looks like o.k.
and while the game is running on background, even without playing, every simple act on the pc is very, very slow.
So it sounds like you might have used up the RAM and be working in virtual memory. This is slower as you've seen.
Before adding more RAM I would instead look at how your system uses RAM (under Windows use the task manager to see how memory is used) and save as much as possible:
1. Remove/disable all hardware not required including unused devices on the motherboard. The drivers for each device use RAM.
2. Go through the services started by Windows and disable those not required:
http://www.jasonn.com/turning_off_unnec ... windows_xp
3. Look at applications that are running in the taskbar. Uninstall everything that you don't need. This is a common area for RAM to be wasted and it can add up to the hundreds of megabytes.
4. Diasable things in Windows that you don't need. Aero for example or Windows sounds for when you switch on/off your computer.
No point in wasting money on more RAM if you're already wasting RAM itself with things that you don't need.
Windows tends to be pretty bad at handling memory usage and it's something I notice as a Linux user whenever I use a Windows system. When gaming under Windows things run out of memory and then run slow whereas on Linux you tend to see it paging silently in the background preemptively so that you never get to the point of completely running out.
_________________
Silverstone SG03B: E8200, Asus P5E-VM HDMI, 2Gb RAM, Leadtek 9600GT+S1 rev. 2, Samsung 500Gb, Seasonic X-400, 2x Akasa 120mm, Scythe Zipang 2 fanless
Top
Profile
Post subject: Re: doe's adding ram cause heat ?
PostPosted: Thu Feb 21, 2013 11:54 am
Offline
Joined: Wed Dec 09, 2009 3:58 am
Posts: 70
Location: green
i did some checking with windows task manager performance.
looks like the sims 3 game is a big memory eater.
the cpu is most of the time on 5-20 % usage, depending what is running.
when running this game the memory usage is around 80 % , and after adding some more programs , like playing movie, Samsung allshare , browser , utorent , it comes to 95 %.
after closing the game the memory usage go down to 45% , without the movie to 40% and without allshare program to 34 % .
regarding other suggestions , most of them i already did , I'll try to do the rest but do you think it'll make such a big difference ? btw what do you mean by "unused devices on the motherboard" - shortcuts ?
looks like i don't understand something basic.
if the physical memory used almost fully ( although it happens only while using that game) and it start to use virtual memory, isn't it means that if I'll add ram, things will become better ?
Top
Profile
Post subject: Re: doe's adding ram cause heat ?
PostPosted: Thu Feb 21, 2013 12:37 pm
Offline
*Lifetime Patron*
Joined: Thu Feb 13, 2003 6:53 am
Posts: 1628
Location: Sweden
Getting a cheap SSD and run the OS and apps (and perhaps a favorite game or two) of that would speed up your computer experience more than adding more RAM. You already have 4GB and that's plenty for the stuff you use the computer for, unless you have lots of crapware installed.
If you decide to get more RAM, be aware that you may run into compatibility problems. Using four DIMMs, mixing capacity and perhaps manufacturer. Works just fine in most cases, but you could end up having to use only the two new sticks to avoid problems.
_________________
Main: ASRock B85M-ITX | i3-4330 | 16GB DDR3 | Intel 730 240GB | HDPLEX H1-S | picoPSU | No moving parts | Idle 13.9W
HTPC: ASRock H81M-ITX | Pentium G3420 | 4GB DDR3 | Intel 520 120GB | HDPLEX H1-S | picoPSU | No moving parts | Idle 11.2W
Gaming: Intel DH77EB | i5-3570K | GTX 750 Ti | 16GB DDR3 | Intel 520 120GB | TJ08-E | G-360 360W
Server: Intel DH77DF | i3-2100T | 4+3x3TB | picoPSU | Idle 24W
Top
Profile
Post subject: Re: doe's adding ram cause heat ?
PostPosted: Thu Feb 21, 2013 1:04 pm
Offline
Joined: Wed Dec 09, 2009 3:58 am
Posts: 70
Location: green
i agree with everything you said.
using ssd h.d will make a big deference. the thing is that installing os and all the tunings is something that someone else do for me and i'm considering to do it a bit latter.
my pc is relatively clean from crapware.
I'm a bit in dilemma about adding ram, because as you see on regular work the ram max usage is up to 50 %, and only when using that game it raise to 80-90 %.
regarding compatibility problems, i'm aware of this . i'll try to consult with g.skill, and worst case will be, as you said, that i'll work only with the new 2x 4gb sticks.
Top
Profile
Post subject: Re: doe's adding ram cause heat ?
PostPosted: Thu Feb 21, 2013 1:12 pm
Offline
Joined: Mon Mar 17, 2008 1:49 pm
Posts: 1320
Location: UK
nimo11 wrote:
btw what do you mean by "unused devices on the motherboard" - shortcuts ?
Let's say you have onboard graphics but also have a separate graphics card. Or onboard sound and also a separate sound card, or anything else duplicated for that matter. If these have drivers installed and running by windows then they will use a small amount of RAM. It's therefore best to disable everything that you don't need. This might also include things like a floppy disk controller when you have no floppy disk drive, or IDE controller when you only have SATA disks, or Firewire when you have no firewire devices. Just disable them in the BIOS so that they can't get in the way, it potentially can save a small amount of power in some cases too.
_________________
Silverstone SG03B: E8200, Asus P5E-VM HDMI, 2Gb RAM, Leadtek 9600GT+S1 rev. 2, Samsung 500Gb, Seasonic X-400, 2x Akasa 120mm, Scythe Zipang 2 fanless
Top
Profile
Post subject: Re: doe's adding ram cause heat ?
PostPosted: Thu Feb 21, 2013 2:07 pm
Offline
Joined: Wed Dec 09, 2009 3:58 am
Posts: 70
Location: green
edh wrote:
nimo11 wrote:
btw what do you mean by "unused devices on the motherboard" - shortcuts ?
Let's say you have onboard graphics but also have a separate graphics card. Or onboard sound and also a separate sound card, or anything else duplicated for that matter. If these have drivers installed and running by windows then they will use a small amount of RAM. It's therefore best to disable everything that you don't need. This might also include things like a floppy disk controller when you have no floppy disk drive, or IDE controller when you only have SATA disks, or Firewire when you have no firewire devices. Just disable them in the BIOS so that they can't get in the way, it potentially can save a small amount of power in some cases too.
a, o.k, i don't have any of those.
Top
Profile
Display posts from previous: Sort by
Post new topic Reply to topic [ 9 posts ]
All times are UTC - 8 hours
Who is online
Users browsing this forum: No registered users and 1 guest
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot post attachments in this forum
Search for:
Jump to:
Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group
|
{
"url": "http://www.silentpcreview.com/forums/viewtopic.php?p=572103",
"source_domain": "www.silentpcreview.com",
"snapshot_id": "crawl=CC-MAIN-2015-35",
"warc_metadata": {
"Content-Length": "49005",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2QVVFHKTZTSPR2NEOYMFSULNKJIN2R33",
"WARC-Concurrent-To": "<urn:uuid:f694e14f-c8c7-41c4-b30d-7d5579291998>",
"WARC-Date": "2015-08-28T14:27:27Z",
"WARC-IP-Address": "66.199.191.115",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:SQPK25XY4KGWEDGTCLZXBBQ6H5L64XXA",
"WARC-Record-ID": "<urn:uuid:e43b7fe1-1007-4bbe-8887-c3aa8c0b75f2>",
"WARC-Target-URI": "http://www.silentpcreview.com/forums/viewtopic.php?p=572103",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:45d0d5d1-aab8-41bc-8c8b-632e642d0700>"
},
"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,
41,
42,
70,
71,
72,
73,
74,
118,
133,
179,
217,
225,
226,
259,
269,
285,
346,
347,
389,
487,
543,
544,
636,
715,
971,
1035,
1036,
1160,
1161,
1297,
1298,
1299,
1303,
1314,
1316,
1365,
1403,
1411,
1412,
1445,
1457,
1470,
1635,
1636,
2160,
2161,
2179,
2329,
2330,
2331,
2335,
2346,
2348,
2397,
2435,
2443,
2444,
2477,
2487,
2503,
2530,
2689,
2690,
2691,
2692,
2727,
2728,
2752,
2802,
2803,
3054,
3168,
3222,
3302,
3303,
3304,
3308,
3319,
3321,
3370,
3408,
3416,
3417,
3450,
3462,
3475,
3489,
3524,
3525,
3939,
3940,
3954,
4004,
4005,
4256,
4370,
4371,
4372,
4486,
4487,
4652,
4778,
4856,
4911,
5101,
5229,
5230,
5338,
5339,
5686,
5687,
5705,
5855,
5856,
5857,
5861,
5872,
5874,
5923,
5962,
5970,
5971,
6004,
6014,
6030,
6089,
6139,
6211,
6383,
6504,
6505,
6714,
6715,
6762,
6954,
6955,
6956,
6960,
6971,
6973,
7022,
7061,
7069,
7087,
7088,
7121,
7133,
7150,
7429,
7684,
7685,
7703,
7820,
7942,
8039,
8102,
8103,
8104,
8108,
8119,
8121,
8170,
8208,
8216,
8217,
8250,
8260,
8276,
8310,
8487,
8528,
8529,
8687,
8688,
8861,
8862,
8863,
8867,
8878,
8880,
8929,
8967,
8975,
8976,
9009,
9021,
9034,
9048,
9122,
9123,
9778,
9779,
9797,
9947,
9948,
9949,
9953,
9964,
9966,
10015,
10053,
10061,
10062,
10095,
10105,
10121,
10132,
10146,
10220,
10221,
10876,
10877,
10878,
10913,
10914,
10915,
10919,
10930,
10932,
10972,
11016,
11017,
11045,
11046,
11047,
11061,
11062,
11121,
11122,
11123,
11164,
11205,
11246,
11289,
11331,
11332,
11344,
11355
],
"line_end_idx": [
41,
42,
70,
71,
72,
73,
74,
118,
133,
179,
217,
225,
226,
259,
269,
285,
346,
347,
389,
487,
543,
544,
636,
715,
971,
1035,
1036,
1160,
1161,
1297,
1298,
1299,
1303,
1314,
1316,
1365,
1403,
1411,
1412,
1445,
1457,
1470,
1635,
1636,
2160,
2161,
2179,
2329,
2330,
2331,
2335,
2346,
2348,
2397,
2435,
2443,
2444,
2477,
2487,
2503,
2530,
2689,
2690,
2691,
2692,
2727,
2728,
2752,
2802,
2803,
3054,
3168,
3222,
3302,
3303,
3304,
3308,
3319,
3321,
3370,
3408,
3416,
3417,
3450,
3462,
3475,
3489,
3524,
3525,
3939,
3940,
3954,
4004,
4005,
4256,
4370,
4371,
4372,
4486,
4487,
4652,
4778,
4856,
4911,
5101,
5229,
5230,
5338,
5339,
5686,
5687,
5705,
5855,
5856,
5857,
5861,
5872,
5874,
5923,
5962,
5970,
5971,
6004,
6014,
6030,
6089,
6139,
6211,
6383,
6504,
6505,
6714,
6715,
6762,
6954,
6955,
6956,
6960,
6971,
6973,
7022,
7061,
7069,
7087,
7088,
7121,
7133,
7150,
7429,
7684,
7685,
7703,
7820,
7942,
8039,
8102,
8103,
8104,
8108,
8119,
8121,
8170,
8208,
8216,
8217,
8250,
8260,
8276,
8310,
8487,
8528,
8529,
8687,
8688,
8861,
8862,
8863,
8867,
8878,
8880,
8929,
8967,
8975,
8976,
9009,
9021,
9034,
9048,
9122,
9123,
9778,
9779,
9797,
9947,
9948,
9949,
9953,
9964,
9966,
10015,
10053,
10061,
10062,
10095,
10105,
10121,
10132,
10146,
10220,
10221,
10876,
10877,
10878,
10913,
10914,
10915,
10919,
10930,
10932,
10972,
11016,
11017,
11045,
11046,
11047,
11061,
11062,
11121,
11122,
11123,
11164,
11205,
11246,
11289,
11331,
11332,
11344,
11355,
11408
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 11408,
"ccnet_original_nlines": 238,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3830534815788269,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04295197129249573,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23194065690040588,
"rps_doc_frac_unique_words": 0.3030454218387604,
"rps_doc_mean_word_length": 4.31752347946167,
"rps_doc_num_sentences": 120,
"rps_doc_symbol_to_word_ratio": 0.00039046999881975353,
"rps_doc_unigram_entropy": 5.806360721588135,
"rps_doc_word_count": 2003,
"rps_doc_frac_chars_dupe_10grams": 0.4027520716190338,
"rps_doc_frac_chars_dupe_5grams": 0.44761794805526733,
"rps_doc_frac_chars_dupe_6grams": 0.44426456093788147,
"rps_doc_frac_chars_dupe_7grams": 0.4240286946296692,
"rps_doc_frac_chars_dupe_8grams": 0.40969011187553406,
"rps_doc_frac_chars_dupe_9grams": 0.4027520716190338,
"rps_doc_frac_chars_top_2gram": 0.012488439679145813,
"rps_doc_frac_chars_top_3gram": 0.016188710927963257,
"rps_doc_frac_chars_top_4gram": 0.018732650205492973,
"rps_doc_books_importance": -1064.3515625,
"rps_doc_books_importance_length_correction": -1064.3515625,
"rps_doc_openwebtext_importance": -682.0213623046875,
"rps_doc_openwebtext_importance_length_correction": -682.0213623046875,
"rps_doc_wikipedia_importance": -476.00238037109375,
"rps_doc_wikipedia_importance_length_correction": -476.00238037109375
},
"fasttext": {
"dclm": 0.09001058340072632,
"english": 0.9244868755340576,
"fineweb_edu_approx": 1.6374799013137817,
"eai_general_math": 0.03063333034515381,
"eai_open_web_math": 0.23277324438095093,
"eai_web_code": 0.0010064200032502413
}
}
|
{
"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": "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": "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": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,951,059,150,447,648,000 |
Java-Gaming.org
Featured games (81)
games approved by the League of Dukes
Games in Showcase (489)
Games in Android Showcase (112)
games submitted by our members
Games in WIP (553)
games currently in development
News: Read the Java Gaming Resources, or peek at the official Java tutorials
Home Help Search Login Register
Pages: [1]
ignore | Print
Suggestions on optimizing render (Read 1605 times)
0 Members and 1 Guest are viewing this topic.
Offline 0gleth0rpe
Junior Newbie
« Posted 2008-08-11 11:44:39 »
Hello,
I've been getting to know JOGL over some time and has been putting together some reuseable components.
I am however not experiencing the performance that I would expect.
I this example, I am rendering a multitextured terrain (2 texture units) and some basic textures. This is crudely done per terrain tile and sprite through a helper class.
On this rather recent laptop I am achieving ~60 fps with around 500 tiles and 200 vegetation sprites.
I think I recall great optimization to be available through vertex arrays or something similar. Could someone please assist me with general pointers to how to reach more potential from openGL?
In my first example, 60 fps is stable
[DEBUG] 13:19:45 :: TestVegetation - ----- Frame -----
[DEBUG] 13:19:45 :: TestVegetation - LightSources took 0.1 ms
[DEBUG] 13:19:45 :: TestVegetation - Terrain: 468 tiles
[DEBUG] 13:19:45 :: TestVegetation - Terrain took 4 ms
[DEBUG] 13:19:45 :: TestVegetation - Vegetation: 155 items
[DEBUG] 13:19:45 :: TestVegetation - Vegetation took 0.9 ms
In my second example, I am not achieving 60 fps.
[DEBUG] 13:17:48 :: TestVegetation - ----- Frame -----
[DEBUG] 13:17:48 :: TestVegetation - LightSources took 0.1 ms
[DEBUG] 13:17:48 :: TestVegetation - Terrain: 468 tiles
[DEBUG] 13:17:48 :: TestVegetation - Terrain took 4 ms
[DEBUG] 13:17:48 :: TestVegetation - Vegetation: 1557 items
[DEBUG] 13:17:48 :: TestVegetation - Vegetation took 5 ms
Obviously vegetation is the cause here.
I have plenty of references here to custom stuff but hopefully it can be of assistance somehow.
I am not asking for a step to step guide or source code, just hints and ideas.. anything off the top of your heads Smiley
Known probably sources;
* I am using 24 bit transparent PNG which could perhaps be a problem (as compared to non-alpha channel ones)
* Turning on and off texturing units for each tile ?
* Low performance logic surrounding the render
Thank you for reading.
[size=12pt]Related code snippets[/size]
Rendering tiles:
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
for (int iy = vTileOffsetY; iy < vTileOffsetY + vScreenTileHeight + 2; iy++) {
for (int ix = vTileOffsetX; ix < vTileOffsetX + vScreenTileWidth
+ 2; ix++) {
// Fetch tile
TerrainTile tile = mTerrainMap.get(ix, iy);
if (tile == null) {
continue;
}
// Calculate window coordinates
float x = ((float) ix * sTILE_WIDTH - mScrollX) - sTILE_WIDTH
/ 2;
float y = ((float) iy * sTILE_HEIGHT - mScrollY) - sTILE_HEIGHT
/ 2;
// Calculate texture coordinates
float tx = ix * tw;
float ty = iy * th;
g.drawMultiTexture(x, y, sTILE_WIDTH, sTILE_HEIGHT, tile
.getTextureId1(), tile.getTextureId2(), tile
.isPrimary(), new float[] { tx, ty, tw, th },
new float[][] { mLightMap.get(ix - 1, iy - 1).getRGB(),
mLightMap.get(ix, iy - 1).getRGB(),
mLightMap.get(ix - 1, iy).getRGB(),
mLightMap.get(ix, iy).getRGB() });
}
}
Rendering Vegetation:
1
2
3
4
5
6
7
8
9
10
11
12
13
for (Vegetation v : mVegetation) {
float x = toScreenCoord(v.getX(), Orientation.HORIZONTAL);
float y = toScreenCoord(v.getY(), Orientation.VERTICAL);
if (!g.inView(x, y, sFRAME_LIGHTMAP_MARGIN)) {
continue;
}
RGB rgb = mLightMap.get((int) v.getX(), (int) v.getY());
g.drawFrames(x, y + 16, v.getFrames(), Alignment.LOWER_MIDDLE,
(float) v.getScale(), rgb.getRGB(), BlendMode.ALPHA);
}
Render multitextured tile
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
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
public void drawMultiTexture(float x, float y, float w, float h,
Long textureId1, Long textureId2, boolean[] isPrimary,
float textureOffset[], float[][] color) {
y = height - y;
/* Enable Multitexturing */
Texture tex1 = textureManager.getTexture(textureId1);
Texture tex2 = textureManager.getTexture(textureId2);
// Set up the first texture unit to interpolate using crossbar extension
gl.glActiveTexture(GL.GL_TEXTURE0);
gl.glEnable(GL.GL_TEXTURE_2D);
gl.glBindTexture(GL.GL_TEXTURE_2D, tex1.getTextureObject());
gl.glTexEnvi(GL.GL_TEXTURE_ENV, GL.GL_TEXTURE_ENV_MODE, GL.GL_COMBINE);
gl.glTexEnvi(GL.GL_TEXTURE_ENV, GL.GL_COMBINE_RGB, GL.GL_INTERPOLATE);
gl.glTexEnvi(GL.GL_TEXTURE_ENV, GL.GL_SOURCE0_RGB, GL.GL_TEXTURE1);
gl.glTexEnvi(GL.GL_TEXTURE_ENV, GL.GL_SOURCE1_RGB, GL.GL_TEXTURE0);
gl.glTexEnvi(GL.GL_TEXTURE_ENV, GL.GL_SOURCE2_RGB, GL.GL_PRIMARY_COLOR);
gl.glTexEnvi(GL.GL_TEXTURE_ENV, GL.GL_OPERAND2_RGB, GL.GL_SRC_ALPHA);
gl.glTexEnvi(GL.GL_TEXTURE_ENV, GL.GL_COMBINE_ALPHA, GL.GL_INTERPOLATE);
gl.glTexEnvi(GL.GL_TEXTURE_ENV, GL.GL_SOURCE0_ALPHA, GL.GL_TEXTURE1);
gl.glTexEnvi(GL.GL_TEXTURE_ENV, GL.GL_SOURCE1_ALPHA, GL.GL_TEXTURE0);
gl.glTexEnvi(GL.GL_TEXTURE_ENV, GL.GL_SOURCE2_ALPHA,
GL.GL_PRIMARY_COLOR);
gl.glTexEnvi(GL.GL_TEXTURE_ENV, GL.GL_OPERAND2_ALPHA, GL.GL_SRC_ALPHA);
// Set up the second texture unit for primary color tinting
gl.glActiveTexture(GL.GL_TEXTURE1);
gl.glEnable(GL.GL_TEXTURE_2D);
gl.glBindTexture(GL.GL_TEXTURE_2D, tex2.getTextureObject());
gl.glTexEnvi(GL.GL_TEXTURE_ENV, GL.GL_TEXTURE_ENV_MODE, GL.GL_COMBINE);
gl.glTexEnvi(GL.GL_TEXTURE_ENV, GL.GL_COMBINE_RGB, GL.GL_MODULATE);
gl.glTexEnvi(GL.GL_TEXTURE_ENV, GL.GL_SOURCE0_RGB, GL.GL_PRIMARY_COLOR);
float[] constant = { 1, 1, 1, 1 };
gl.glTexEnvfv(GL.GL_TEXTURE_ENV, GL.GL_TEXTURE_ENV_COLOR, constant, 0);
gl.glTexEnvi(GL.GL_TEXTURE_ENV, GL.GL_COMBINE_ALPHA, GL.GL_REPLACE);
gl.glTexEnvi(GL.GL_TEXTURE_ENV, GL.GL_SOURCE0_ALPHA, GL.GL_CONSTANT);
/*
* Triangle Fan Rendering
*
* Center, Lower Left, Upper Left, Upper Right, Lower Right
*/
float tx1 = textureOffset[0];
float tx2 = textureOffset[0] + textureOffset[2];
float ty1 = textureOffset[1];
float ty2 = textureOffset[1] + textureOffset[3];
// Calculate blending of the center vertex
float p = 0.0f;
for (int i = 0; i < isPrimary.length; i++) {
if (!isPrimary[i])
p += 0.25f;
}
// Calculate color of the center vertex
float midColor[] = new float[] {
(color[0][0] + color[1][0] + color[2][0] + color[3][0]) / 4,
(color[0][1] + color[1][1] + color[2][1] + color[3][1]) / 4,
(color[0][2] + color[1][2] + color[2][2] + color[3][2]) / 4 };
gl.glBegin(GL.GL_TRIANGLE_FAN);
{
gl.glColor4f(midColor[0], midColor[1], midColor[2], p);
gl.glMultiTexCoord2f(GL.GL_TEXTURE0, (tx2 + tx1) / 2,
(ty2 + ty1) / 2);
gl.glMultiTexCoord2f(GL.GL_TEXTURE1, (tx2 + tx1) / 2,
(ty2 + ty1) / 2);
gl.glVertex2f(x + w / 2, y - h / 2);
gl.glColor4f(color[2][0], color[2][1], color[2][2],
isPrimary[2] ? 0.0f : 1.0f);
gl.glMultiTexCoord2f(GL.GL_TEXTURE0, tx1, ty2);
gl.glMultiTexCoord2f(GL.GL_TEXTURE1, tx1, ty2);
gl.glVertex2f(x, y - h);
gl.glColor4f(color[0][0], color[0][1], color[0][2],
isPrimary[0] ? 0.0f : 1.0f);
gl.glMultiTexCoord2f(GL.GL_TEXTURE0, tx1, ty1);
gl.glMultiTexCoord2f(GL.GL_TEXTURE1, tx1, ty1);
gl.glVertex2f(x, y);
gl.glColor4f(color[1][0], color[1][1], color[1][2],
isPrimary[1] ? 0.0f : 1.0f);
gl.glMultiTexCoord2f(GL.GL_TEXTURE0, tx2, ty1);
gl.glMultiTexCoord2f(GL.GL_TEXTURE1, tx2, ty1);
gl.glVertex2f(x + w, y);
gl.glColor4f(color[3][0], color[3][1], color[3][2],
isPrimary[3] ? 0.0f : 1.0f);
gl.glMultiTexCoord2f(GL.GL_TEXTURE0, tx2, ty2);
gl.glMultiTexCoord2f(GL.GL_TEXTURE1, tx2, ty2);
gl.glVertex2f(x + w, y - h);
gl.glColor4f(color[2][0], color[2][1], color[2][2],
isPrimary[2] ? 0.0f : 1.0f);
gl.glMultiTexCoord2f(GL.GL_TEXTURE0, tx1, ty2);
gl.glMultiTexCoord2f(GL.GL_TEXTURE1, tx1, ty2);
gl.glVertex2f(x, y - h);
}
gl.glEnd();
// Turn the second multitexture pass off
gl.glActiveTexture(GL.GL_TEXTURE1);
gl.glDisable(GL.GL_TEXTURE_2D);
// Turn the first multitexture pass off
gl.glActiveTexture(GL.GL_TEXTURE0);
gl.glDisable(GL.GL_TEXTURE_2D);
gl.glTexEnvi(GL.GL_TEXTURE_ENV, GL.GL_TEXTURE_ENV_MODE, GL.GL_MODULATE);
}
Render sprite ("frame")
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
public void drawFrames(float x, float y, Frames frames, Alignment align,
float scale, float[] rgb, BlendMode mode) {
long textureId = frames.getNextFrame();
Texture tex = textureManager.getTexture(textureId);
float w = tex.getImageWidth() * scale;
float h = tex.getImageHeight() * scale;
x = applyHorizontalAlignment(x, w, align);
y = applyVerticalAlignment(y, h, align);
drawTexture(x, y, w, h, frames.getNextFrame(), mode, rgb);
}
Draw Texture (used in above)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
public void drawTexture(float x, float y, float w, float h, Long textureId,
BlendMode mode, float[] rgb) {
Texture tex = textureManager.getTexture(textureId);
tex.enable();
tex.bind();
y = height - y;
setBlendMode(mode);
gl.glBegin(GL.GL_POLYGON);
gl.glColor4f(rgb[0], rgb[1], rgb[2], rgb[3]);
gl.glTexCoord2f(0f, 0f);
gl.glVertex2f(x, y);
gl.glTexCoord2f(1f, 0f);
gl.glVertex2f(x + w, y);
gl.glTexCoord2f(1f, 1f);
gl.glVertex2f(x + w, y - h);
gl.glTexCoord2f(0f, 1f);
gl.glVertex2f(x, y - h);
gl.glEnd();
tex.disable();
}
Offline tom
« Reply #1 - Posted 2008-08-11 13:26:51 »
Binding a texture is expensive. Other state switching like glTexEnvi might also be expensive. You should look up state sorting. This involves grouping (or sorting) objects with the same state (texture id, blend modes, etc). Only set the state once for each group.
Offline 0gleth0rpe
Junior Newbie
« Reply #2 - Posted 2008-08-11 16:42:04 »
Thank you for that suggestion!
I did a quick test now with a refactoring of enable/disable multi-texturing and binding textures only when necessary and voila!
A sudden leap from 9 down to 3 ms Smiley
1
2
3
4
5
6
[DEBUG] 18:38:11 :: TestVegetation - ----- Frame -----
[DEBUG] 18:38:11 :: TestVegetation - LightSources took 0.6 ms
[DEBUG] 18:38:11 :: TestVegetation - Terrain: 468 tiles
[DEBUG] 18:38:11 :: TestVegetation - Terrain took 2 ms
[DEBUG] 18:38:11 :: TestVegetation - Vegetation: 1403 items
[DEBUG] 18:38:11 :: TestVegetation - Vegetation took 1 ms
Pages: [1]
ignore | Print
You cannot reply to this message, because it is very, very old.
Add your game by posting it in the WIP section,
or publish it in Showcase.
The first screenshot will be displayed as a thumbnail.
TehJavaDev (18 views)
2014-08-28 18:26:30
CopyableCougar4 (26 views)
2014-08-22 19:31:30
atombrot (39 views)
2014-08-19 09:29:53
Tekkerue (36 views)
2014-08-16 06:45:27
Tekkerue (33 views)
2014-08-16 06:22:17
Tekkerue (22 views)
2014-08-16 06:20:21
Tekkerue (33 views)
2014-08-16 06:12:11
Rayexar (70 views)
2014-08-11 02:49:23
BurntPizza (46 views)
2014-08-09 21:09:32
BurntPizza (37 views)
2014-08-08 02:01:56
List of Learning Resources
by Longor1996
2014-08-16 10:40:00
List of Learning Resources
by SilverTiger
2014-08-05 19:33:27
Resources for WIP games
by CogWheelz
2014-08-01 16:20:17
Resources for WIP games
by CogWheelz
2014-08-01 16:19:50
List of Learning Resources
by SilverTiger
2014-07-31 16:29:50
List of Learning Resources
by SilverTiger
2014-07-31 16:26:06
List of Learning Resources
by SilverTiger
2014-07-31 11:54:12
HotSpot Options
by dleskov
2014-07-08 01:59:08
java-gaming.org is not responsible for the content posted by its members, including references to external websites, and other references that may or may not have a relation with our primarily gaming and game production oriented community. inquiries and complaints can be sent via email to the info‑account of the company managing the website of java‑gaming.org
Powered by MySQL Powered by PHP Powered by SMF 1.1.18 | SMF © 2013, Simple Machines | Managed by Enhanced Four Valid XHTML 1.0! Valid CSS!
|
{
"url": "http://www.java-gaming.org/index.php?topic=19061.msg150216",
"source_domain": "www.java-gaming.org",
"snapshot_id": "crawl=CC-MAIN-2014-35",
"warc_metadata": {
"Content-Length": "129966",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GCXVF3NXRIPIH7EURKMX2JMBD37JEBP3",
"WARC-Concurrent-To": "<urn:uuid:cacdf375-5a10-469d-80a1-b096985bc8cb>",
"WARC-Date": "2014-08-31T04:24:28Z",
"WARC-IP-Address": "85.159.215.171",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:2W6JSBKGZBZ3IIMVAXWFTX2XFLUQ5TOV",
"WARC-Record-ID": "<urn:uuid:55af9d60-244b-4487-aa06-a03ad75894ee>",
"WARC-Target-URI": "http://www.java-gaming.org/index.php?topic=19061.msg150216",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e276f715-fc0a-430b-9da3-5012e46414b3>"
},
"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,
20,
40,
78,
102,
134,
165,
184,
215,
292,
294,
343,
354,
375,
429,
475,
494,
495,
509,
510,
511,
512,
513,
514,
545,
546,
553,
554,
657,
724,
725,
897,
898,
1000,
1001,
1194,
1195,
1233,
1234,
1235,
1236,
1291,
1353,
1409,
1464,
1523,
1583,
1584,
1633,
1634,
1635,
1636,
1691,
1753,
1809,
1864,
1924,
1982,
1983,
2023,
2024,
2120,
2242,
2243,
2267,
2376,
2429,
2476,
2477,
2500,
2501,
2541,
2542,
2559,
2563,
2567,
2571,
2575,
2579,
2583,
2587,
2591,
2595,
2600,
2605,
2610,
2615,
2620,
2625,
2630,
2635,
2640,
2645,
2650,
2655,
2660,
2665,
2670,
2675,
2680,
2685,
2690,
2695,
2700,
2705,
2710,
2789,
2857,
2879,
2899,
2900,
2950,
2951,
2977,
2996,
3004,
3005,
3043,
3044,
3112,
3129,
3199,
3216,
3217,
3256,
3257,
3283,
3309,
3310,
3373,
3430,
3488,
3556,
3610,
3664,
3717,
3722,
3724,
3725,
3726,
3748,
3752,
3756,
3760,
3764,
3768,
3772,
3776,
3780,
3784,
3789,
3794,
3799,
3804,
3839,
3901,
3961,
3962,
4012,
4028,
4033,
4034,
4094,
4095,
4161,
4224,
4226,
4227,
4228,
4254,
4258,
4262,
4266,
4270,
4274,
4278,
4282,
4286,
4290,
4295,
4300,
4305,
4310,
4315,
4320,
4325,
4330,
4335,
4340,
4345,
4350,
4355,
4360,
4365,
4370,
4375,
4380,
4385,
4390,
4395,
4400,
4405,
4410,
4415,
4420,
4425,
4430,
4435,
4440,
4445,
4450,
4455,
4460,
4465,
4470,
4475,
4480,
4485,
4490,
4495,
4500,
4505,
4510,
4515,
4520,
4525,
4530,
4535,
4540,
4545,
4550,
4555,
4560,
4565,
4570,
4575,
4580,
4585,
4590,
4595,
4600,
4605,
4610,
4615,
4620,
4625,
4630,
4635,
4640,
4645,
4650,
4655,
4660,
4665,
4670,
4675,
4680,
4685,
4690,
4695,
4700,
4705,
4710,
4715,
4720,
4725,
4730,
4735,
4740,
4746,
4752,
4758,
4764,
4770,
4776,
4782,
4788,
4794,
4800,
4806,
4812,
4818,
4824,
4830,
4836,
4842,
4848,
4854,
4860,
4925,
4986,
5034,
5035,
5054,
5055,
5086,
5087,
5144,
5201,
5202,
5278,
5279,
5318,
5352,
5416,
5491,
5565,
5636,
5707,
5783,
5856,
5932,
6005,
6078,
6134,
6165,
6240,
6241,
6304,
6342,
6376,
6440,
6515,
6586,
6662,
6700,
6775,
6847,
6920,
6921,
6927,
6956,
6962,
7025,
7032,
7033,
7034,
7067,
7119,
7152,
7204,
7205,
7251,
7252,
7271,
7272,
7320,
7345,
7366,
7371,
7372,
7415,
7416,
7452,
7522,
7592,
7664,
7665,
7700,
7705,
7767,
7827,
7857,
7917,
7947,
7990,
7991,
8049,
8090,
8144,
8198,
8229,
8230,
8288,
8329,
8383,
8437,
8464,
8465,
8523,
8564,
8618,
8672,
8703,
8704,
8762,
8803,
8857,
8911,
8946,
8947,
9005,
9046,
9100,
9154,
9185,
9190,
9205,
9206,
9250,
9288,
9323,
9324,
9367,
9405,
9440,
9441,
9517,
9519,
9520,
9521,
9545,
9549,
9553,
9557,
9561,
9565,
9569,
9573,
9577,
9581,
9586,
9591,
9596,
9601,
9606,
9611,
9616,
9689,
9739,
9782,
9783,
9838,
9839,
9881,
9882,
9925,
9926,
9972,
9973,
10017,
10018,
10080,
10082,
10083,
10084,
10113,
10117,
10121,
10125,
10129,
10133,
10137,
10141,
10145,
10149,
10154,
10159,
10164,
10169,
10174,
10179,
10184,
10189,
10194,
10199,
10204,
10209,
10214,
10219,
10295,
10329,
10384,
10401,
10416,
10417,
10436,
10437,
10460,
10490,
10539,
10567,
10591,
10619,
10647,
10675,
10707,
10735,
10763,
10778,
10779,
10797,
10799,
10811,
10853,
10854,
11118,
11119,
11138,
11139,
11153,
11154,
11155,
11156,
11157,
11158,
11200,
11201,
11232,
11233,
11361,
11402,
11403,
11407,
11411,
11415,
11419,
11423,
11427,
11482,
11544,
11600,
11655,
11715,
11773,
11784,
11805,
11807,
11809,
11873,
11874,
11876,
11877,
11925,
11952,
11953,
12008,
12009,
12031,
12051,
12052,
12079,
12099,
12100,
12120,
12140,
12141,
12161,
12181,
12182,
12202,
12222,
12223,
12243,
12263,
12264,
12284,
12304,
12305,
12324,
12344,
12345,
12367,
12387,
12388,
12410,
12430,
12457,
12471,
12491,
12492,
12519,
12534,
12554,
12555,
12579,
12592,
12612,
12613,
12637,
12650,
12670,
12671,
12698,
12713,
12733,
12734,
12761,
12776,
12796,
12797,
12824,
12839,
12859,
12860,
12876,
12887,
12907,
13269
],
"line_end_idx": [
20,
40,
78,
102,
134,
165,
184,
215,
292,
294,
343,
354,
375,
429,
475,
494,
495,
509,
510,
511,
512,
513,
514,
545,
546,
553,
554,
657,
724,
725,
897,
898,
1000,
1001,
1194,
1195,
1233,
1234,
1235,
1236,
1291,
1353,
1409,
1464,
1523,
1583,
1584,
1633,
1634,
1635,
1636,
1691,
1753,
1809,
1864,
1924,
1982,
1983,
2023,
2024,
2120,
2242,
2243,
2267,
2376,
2429,
2476,
2477,
2500,
2501,
2541,
2542,
2559,
2563,
2567,
2571,
2575,
2579,
2583,
2587,
2591,
2595,
2600,
2605,
2610,
2615,
2620,
2625,
2630,
2635,
2640,
2645,
2650,
2655,
2660,
2665,
2670,
2675,
2680,
2685,
2690,
2695,
2700,
2705,
2710,
2789,
2857,
2879,
2899,
2900,
2950,
2951,
2977,
2996,
3004,
3005,
3043,
3044,
3112,
3129,
3199,
3216,
3217,
3256,
3257,
3283,
3309,
3310,
3373,
3430,
3488,
3556,
3610,
3664,
3717,
3722,
3724,
3725,
3726,
3748,
3752,
3756,
3760,
3764,
3768,
3772,
3776,
3780,
3784,
3789,
3794,
3799,
3804,
3839,
3901,
3961,
3962,
4012,
4028,
4033,
4034,
4094,
4095,
4161,
4224,
4226,
4227,
4228,
4254,
4258,
4262,
4266,
4270,
4274,
4278,
4282,
4286,
4290,
4295,
4300,
4305,
4310,
4315,
4320,
4325,
4330,
4335,
4340,
4345,
4350,
4355,
4360,
4365,
4370,
4375,
4380,
4385,
4390,
4395,
4400,
4405,
4410,
4415,
4420,
4425,
4430,
4435,
4440,
4445,
4450,
4455,
4460,
4465,
4470,
4475,
4480,
4485,
4490,
4495,
4500,
4505,
4510,
4515,
4520,
4525,
4530,
4535,
4540,
4545,
4550,
4555,
4560,
4565,
4570,
4575,
4580,
4585,
4590,
4595,
4600,
4605,
4610,
4615,
4620,
4625,
4630,
4635,
4640,
4645,
4650,
4655,
4660,
4665,
4670,
4675,
4680,
4685,
4690,
4695,
4700,
4705,
4710,
4715,
4720,
4725,
4730,
4735,
4740,
4746,
4752,
4758,
4764,
4770,
4776,
4782,
4788,
4794,
4800,
4806,
4812,
4818,
4824,
4830,
4836,
4842,
4848,
4854,
4860,
4925,
4986,
5034,
5035,
5054,
5055,
5086,
5087,
5144,
5201,
5202,
5278,
5279,
5318,
5352,
5416,
5491,
5565,
5636,
5707,
5783,
5856,
5932,
6005,
6078,
6134,
6165,
6240,
6241,
6304,
6342,
6376,
6440,
6515,
6586,
6662,
6700,
6775,
6847,
6920,
6921,
6927,
6956,
6962,
7025,
7032,
7033,
7034,
7067,
7119,
7152,
7204,
7205,
7251,
7252,
7271,
7272,
7320,
7345,
7366,
7371,
7372,
7415,
7416,
7452,
7522,
7592,
7664,
7665,
7700,
7705,
7767,
7827,
7857,
7917,
7947,
7990,
7991,
8049,
8090,
8144,
8198,
8229,
8230,
8288,
8329,
8383,
8437,
8464,
8465,
8523,
8564,
8618,
8672,
8703,
8704,
8762,
8803,
8857,
8911,
8946,
8947,
9005,
9046,
9100,
9154,
9185,
9190,
9205,
9206,
9250,
9288,
9323,
9324,
9367,
9405,
9440,
9441,
9517,
9519,
9520,
9521,
9545,
9549,
9553,
9557,
9561,
9565,
9569,
9573,
9577,
9581,
9586,
9591,
9596,
9601,
9606,
9611,
9616,
9689,
9739,
9782,
9783,
9838,
9839,
9881,
9882,
9925,
9926,
9972,
9973,
10017,
10018,
10080,
10082,
10083,
10084,
10113,
10117,
10121,
10125,
10129,
10133,
10137,
10141,
10145,
10149,
10154,
10159,
10164,
10169,
10174,
10179,
10184,
10189,
10194,
10199,
10204,
10209,
10214,
10219,
10295,
10329,
10384,
10401,
10416,
10417,
10436,
10437,
10460,
10490,
10539,
10567,
10591,
10619,
10647,
10675,
10707,
10735,
10763,
10778,
10779,
10797,
10799,
10811,
10853,
10854,
11118,
11119,
11138,
11139,
11153,
11154,
11155,
11156,
11157,
11158,
11200,
11201,
11232,
11233,
11361,
11402,
11403,
11407,
11411,
11415,
11419,
11423,
11427,
11482,
11544,
11600,
11655,
11715,
11773,
11784,
11805,
11807,
11809,
11873,
11874,
11876,
11877,
11925,
11952,
11953,
12008,
12009,
12031,
12051,
12052,
12079,
12099,
12100,
12120,
12140,
12141,
12161,
12181,
12182,
12202,
12222,
12223,
12243,
12263,
12264,
12284,
12304,
12305,
12324,
12344,
12345,
12367,
12387,
12388,
12410,
12430,
12457,
12471,
12491,
12492,
12519,
12534,
12554,
12555,
12579,
12592,
12612,
12613,
12637,
12650,
12670,
12671,
12698,
12713,
12733,
12734,
12761,
12776,
12796,
12797,
12824,
12839,
12859,
12860,
12876,
12887,
12907,
13269,
13407
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 13407,
"ccnet_original_nlines": 598,
"rps_doc_curly_bracket": 0.0020884599070996046,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.11622737348079681,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06414735317230225,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5493807792663574,
"rps_doc_frac_unique_words": 0.4468371570110321,
"rps_doc_mean_word_length": 5.915881633758545,
"rps_doc_num_sentences": 239,
"rps_doc_symbol_to_word_ratio": 0.0006351200281642377,
"rps_doc_unigram_entropy": 6.037148952484131,
"rps_doc_word_count": 1486,
"rps_doc_frac_chars_dupe_10grams": 0.05243999883532524,
"rps_doc_frac_chars_dupe_5grams": 0.15333864092826843,
"rps_doc_frac_chars_dupe_6grams": 0.10590376704931259,
"rps_doc_frac_chars_dupe_7grams": 0.08156069368124008,
"rps_doc_frac_chars_dupe_8grams": 0.05767261981964111,
"rps_doc_frac_chars_dupe_9grams": 0.05243999883532524,
"rps_doc_frac_chars_top_2gram": 0.002047549933195114,
"rps_doc_frac_chars_top_3gram": 0.01706290990114212,
"rps_doc_frac_chars_top_4gram": 0.002730059903115034,
"rps_doc_books_importance": -1285.9949951171875,
"rps_doc_books_importance_length_correction": -1285.9949951171875,
"rps_doc_openwebtext_importance": -727.1821899414062,
"rps_doc_openwebtext_importance_length_correction": -727.1821899414062,
"rps_doc_wikipedia_importance": -314.5626220703125,
"rps_doc_wikipedia_importance_length_correction": -314.5626220703125
},
"fasttext": {
"dclm": 0.03342777118086815,
"english": 0.30125918984413147,
"fineweb_edu_approx": 1.8299992084503174,
"eai_general_math": 0.000011209999684069771,
"eai_open_web_math": 0.32002919912338257,
"eai_web_code": 0.6991509199142456
}
}
|
{
"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": "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": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,718,672,123,003,731,000 |
Main content
#content {
float: left;
width: 620px;
}
Both the main content and the sidebar are wrapped in a container div. The container's width is then fixed and centered.
The backgrounds of content, sidebar, or both are set the same as the background on the body. Here all three are transparent.
This gives the appearance that one or both stretches to the edge of the browser window creating a fluid look to the layout.
|
{
"url": "http://www.vanseodesign.com/blog/demo/hybrid-css-layout/fixed-content-fluid-background.php",
"source_domain": "www.vanseodesign.com",
"snapshot_id": "crawl=CC-MAIN-2014-15",
"warc_metadata": {
"Content-Length": "3821",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BURPVLI5GERB4QTRG6I6DZDOAUU6JLAV",
"WARC-Concurrent-To": "<urn:uuid:bfeb33d5-5159-446f-8495-e6b22c63293d>",
"WARC-Date": "2014-04-25T01:30:13Z",
"WARC-IP-Address": "67.43.4.139",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:ACYE3XDMCMO6LSLYAWFIUCKLFBDZJ7ZL",
"WARC-Record-ID": "<urn:uuid:7b92338a-ed6d-4268-8b8e-c19bb4bc1dce>",
"WARC-Target-URI": "http://www.vanseodesign.com/blog/demo/hybrid-css-layout/fixed-content-fluid-background.php",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e2366508-2d87-4b29-aa05-43235c1c03ac>"
},
"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,
13,
14,
25,
38,
52,
54,
55,
175,
176,
301,
302
],
"line_end_idx": [
13,
14,
25,
38,
52,
54,
55,
175,
176,
301,
302,
425
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 425,
"ccnet_original_nlines": 11,
"rps_doc_curly_bracket": 0.004705879837274551,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4157303273677826,
"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.16853933036327362,
"rps_doc_frac_unique_words": 0.6575342416763306,
"rps_doc_mean_word_length": 4.547945022583008,
"rps_doc_num_sentences": 5,
"rps_doc_symbol_to_word_ratio": 0.011235959827899933,
"rps_doc_unigram_entropy": 3.6109519004821777,
"rps_doc_word_count": 73,
"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.0662650614976883,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -31.00608253479004,
"rps_doc_books_importance_length_correction": -31.00697135925293,
"rps_doc_openwebtext_importance": -13.339774131774902,
"rps_doc_openwebtext_importance_length_correction": -13.340662956237793,
"rps_doc_wikipedia_importance": -15.90791130065918,
"rps_doc_wikipedia_importance_length_correction": -15.908799171447754
},
"fasttext": {
"dclm": 0.05493795871734619,
"english": 0.8348904252052307,
"fineweb_edu_approx": 1.4087451696395874,
"eai_general_math": 0.6841492056846619,
"eai_open_web_math": 0.21101778745651245,
"eai_web_code": 0.5354874730110168
}
}
|
{
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,856,261,127,062,381,000 |
This is a migrated thread and some comments may be shown as answers.
Report Web Preview Error
1 Answer 188 Views
General Discussions
This is a migrated thread and some comments may be shown as answers.
Sumit
Top achievements
Rank 1
Sumit asked on 11 Jul 2018, 08:38 AM
Hi Team,
I am developing a report in standalone report designer. I have added a table and a SQL server data source. When I configure the data source and provide a SQL query and click execute in the configure box, the query fetches the data. But when I publish the report to the server and web preview it gives below error-
"An error has occurred while processing Table 'table1':
A network-related or instance-specific error occurred while establishing a
connection to SQL Server. The server was not found or was not accessible.
Verify that the instance name is correct and that SQL Server is configured to
allow remote connections. (provider: TCP Provider, error: 0 - No such host is
known.)
------------- InnerException -------------
No such host is known"
Could you please help?
Regards,
Ashwini
1 Answer, 1 is accepted
Sort by
0
Silviya
Telerik team
answered on 16 Jul 2018, 06:38 AM
Hi Ashwini,
Since the error is occurring in the report viewer, it indicates the report finds its connection string and tries to use it. The error is generated on the attempt for creating a connection object through the connection string, selected ADO.NET data provider and the related ADO.NET classes.
You might check the following settings of the report to verify the connection information:
1. SqlDataSource component's ConnectionString - the string is the name of the connection string that will be searched in the web.config of the Reporting REST service's project;
2. SqlDataSource component's ProviderName - the string is the name of the .NET data provider which should be the same as the provderName attribute of the connection string stored under connectionStrings element.
Verify also:
3. The server address is correct;
4. The provided credentials to allow connection to the database;
5. For any security settings that may prevent connection to the database at the given port.
Most important, check the Reporting REST service's configuration file - it should contain a conectionStrings element with an entry having name attribute the same as the SqlDataSource.ConnectionString property. You will have to ensure the database accepts external connections and the connectionString attribute (in the web.config) provides valid information for connecting the database.
Check the deployed web.config file and test the connection string added in the deployed file. Test connecting to the database with MSSQL Management Studio and the connection string in the deployed configuration file.
If you are changing connection strings at run-time as in Changing the connection string dynamically according to runtime data, debug the code to get the used connection string.
Regards,
Silviya
Progress Telerik
Do you want to have your say when we set our development plans? Do you want to know when a feature you care about is added or when a bug fixed? Explore the Telerik Feedback Portal and vote to affect the priority of the items
Tags
General Discussions
Asked by
Sumit
Top achievements
Rank 1
Answers by
Silviya
Telerik team
Share this question
or
|
{
"url": "https://www.telerik.com/forums/report-web-preview-error",
"source_domain": "www.telerik.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "99883",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IULF7IWZPIARASIHY55TMIFE26ITSSMD",
"WARC-Concurrent-To": "<urn:uuid:4a9058b3-fcd9-47f0-8b4d-130b726ec0f4>",
"WARC-Date": "2022-11-26T19:50:39Z",
"WARC-IP-Address": "50.56.19.112",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UNDNOI5EQHX42ONI3FV2ONCMYX3TVOZM",
"WARC-Record-ID": "<urn:uuid:9b52606c-ee40-4508-98ed-e233b6e22e5c>",
"WARC-Target-URI": "https://www.telerik.com/forums/report-web-preview-error",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1adc1796-9962-4326-903c-5df18d27ea42>"
},
"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-193\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,
69,
70,
95,
96,
115,
135,
204,
210,
227,
234,
271,
280,
281,
595,
596,
652,
653,
729,
804,
883,
962,
970,
1013,
1036,
1037,
1060,
1061,
1070,
1071,
1079,
1080,
1104,
1105,
1113,
1115,
1123,
1136,
1170,
1182,
1183,
1473,
1564,
1741,
1953,
1954,
1967,
2001,
2066,
2158,
2159,
2546,
2547,
2764,
2765,
2942,
2943,
2952,
2960,
2977,
3202,
3207,
3227,
3236,
3242,
3259,
3266,
3277,
3285,
3298,
3318
],
"line_end_idx": [
69,
70,
95,
96,
115,
135,
204,
210,
227,
234,
271,
280,
281,
595,
596,
652,
653,
729,
804,
883,
962,
970,
1013,
1036,
1037,
1060,
1061,
1070,
1071,
1079,
1080,
1104,
1105,
1113,
1115,
1123,
1136,
1170,
1182,
1183,
1473,
1564,
1741,
1953,
1954,
1967,
2001,
2066,
2158,
2159,
2546,
2547,
2764,
2765,
2942,
2943,
2952,
2960,
2977,
3202,
3207,
3227,
3236,
3242,
3259,
3266,
3277,
3285,
3298,
3318,
3320
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3320,
"ccnet_original_nlines": 70,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3633440434932709,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03215434029698372,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15594854950904846,
"rps_doc_frac_unique_words": 0.4312617778778076,
"rps_doc_mean_word_length": 5.013182640075684,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.911191463470459,
"rps_doc_word_count": 531,
"rps_doc_frac_chars_dupe_10grams": 0.04132230952382088,
"rps_doc_frac_chars_dupe_5grams": 0.09015777707099915,
"rps_doc_frac_chars_dupe_6grams": 0.05860254913568497,
"rps_doc_frac_chars_dupe_7grams": 0.05860254913568497,
"rps_doc_frac_chars_dupe_8grams": 0.04132230952382088,
"rps_doc_frac_chars_dupe_9grams": 0.04132230952382088,
"rps_doc_frac_chars_top_2gram": 0.04808415099978447,
"rps_doc_frac_chars_top_3gram": 0.042824938893318176,
"rps_doc_frac_chars_top_4gram": 0.011269720271229744,
"rps_doc_books_importance": -308.28179931640625,
"rps_doc_books_importance_length_correction": -308.28179931640625,
"rps_doc_openwebtext_importance": -192.17701721191406,
"rps_doc_openwebtext_importance_length_correction": -192.17701721191406,
"rps_doc_wikipedia_importance": -128.0671844482422,
"rps_doc_wikipedia_importance_length_correction": -128.0671844482422
},
"fasttext": {
"dclm": 0.0548398494720459,
"english": 0.8538805842399597,
"fineweb_edu_approx": 1.770226240158081,
"eai_general_math": 0.08103054761886597,
"eai_open_web_math": 0.06157774105668068,
"eai_web_code": 0.10803675651550293
}
}
|
{
"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": "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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,675,802,448,470,895,000 |
1. Computing
Inserting a Table in Pages
By
If you're working on a business report or academic paper, you'll probably want to insert a table in your document. It is a handy way to display data in an organized, easy-to-read manner. Fortunately, you don't have to mess with tabs or margins. Apple's iWork Pages has a tool that will help you insert a table the easy way.
To insert a table in Apple's iWork Pages, follow these simple steps:
1. Hold the Option key
2. Click Table on the toolbar
3. Release the Option key
4. When the pointer turns to crosshairs, simply drag the pointer across the page to create the table you want
The number of rows and columns will change as you move the pointer. Fortunately, you can also control the number of rows and columns in your table:
1. Select your table by clicking a cell in the table
2. You'll see table handles appear
3. You can now use the Format bar to format your table
4. Specify the number of rows and columns in the appropriate boxes on the Format bar
1. About.com
2. Computing
3. Word Processing
4. Mac Software
5. Inserting a Table in Apple iWork Pages
©2014 About.com. All rights reserved.
|
{
"url": "http://wordprocessing.about.com/od/macsoftware/a/Inserting-A-Table-In-Pages.htm",
"source_domain": "wordprocessing.about.com",
"snapshot_id": "crawl=CC-MAIN-2014-15",
"warc_metadata": {
"Content-Length": "38560",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5LFATVRMH4I5SBWGUHNDPWLGK374GRZX",
"WARC-Concurrent-To": "<urn:uuid:80a95652-b39a-4326-b2ea-be951de673bf>",
"WARC-Date": "2014-04-24T08:24:15Z",
"WARC-IP-Address": "208.185.127.40",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:GBQBT2TATGX5GOXZGYZPUZP4NQPYLFBB",
"WARC-Record-ID": "<urn:uuid:b0bdcf8a-1b7f-4c08-b69d-9cdfbc886ee5>",
"WARC-Target-URI": "http://wordprocessing.about.com/od/macsoftware/a/Inserting-A-Table-In-Pages.htm",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:34464c4f-9f2a-46ec-956b-ec9c32c3fe94>"
},
"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,
15,
16,
43,
44,
47,
48,
372,
373,
442,
443,
466,
467,
497,
498,
524,
525,
635,
636,
784,
785,
838,
839,
874,
875,
930,
931,
1016,
1031,
1046,
1067,
1085,
1129,
1130
],
"line_end_idx": [
15,
16,
43,
44,
47,
48,
372,
373,
442,
443,
466,
467,
497,
498,
524,
525,
635,
636,
784,
785,
838,
839,
874,
875,
930,
931,
1016,
1031,
1046,
1067,
1085,
1129,
1130,
1167
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1167,
"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.35769230127334595,
"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.21153846383094788,
"rps_doc_frac_unique_words": 0.514285683631897,
"rps_doc_mean_word_length": 4.252380847930908,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.322161674499512,
"rps_doc_word_count": 210,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.12430010735988617,
"rps_doc_frac_chars_dupe_6grams": 0.0884658470749855,
"rps_doc_frac_chars_dupe_7grams": 0.06047032028436661,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.03359461948275566,
"rps_doc_frac_chars_top_3gram": 0.03583427146077156,
"rps_doc_frac_chars_top_4gram": 0.05039193853735924,
"rps_doc_books_importance": -78.85079193115234,
"rps_doc_books_importance_length_correction": -78.85079193115234,
"rps_doc_openwebtext_importance": -54.80375671386719,
"rps_doc_openwebtext_importance_length_correction": -54.01006317138672,
"rps_doc_wikipedia_importance": -7.206380367279053,
"rps_doc_wikipedia_importance_length_correction": -7.206380367279053
},
"fasttext": {
"dclm": 0.7414863705635071,
"english": 0.8194701671600342,
"fineweb_edu_approx": 1.9664716720581055,
"eai_general_math": 0.8123652935028076,
"eai_open_web_math": 0.15990257263183594,
"eai_web_code": 0.07700937986373901
}
}
|
{
"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.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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,163,733,849,694,618,000 |
Nocturnal Practitioners of Magic
vue-virtualized-table-booway
0.0.3 • Public • Published
Vue Virtualized Table
The second version of implementation of vue-virtual-table component, it was inspired from rc-table and ant-table, API design is 60%+ consistent. Or you could think I translated them from React to Vue and added virtualize scroll feature.
Features
1. Support customize render
2. Support virtualized scroll
3. Support expand/collapse
4. Support customize depth
Usage
Look the Demo or run this project example in Terminal with npm:
npm install
npm run serve
Code example:
import VirtualTable from 'vue-virtualized-table'
import 'vue-virtualized-table/src/table.css'
export default {
render() {
return (
<VirtualTable
row-key="id"
scroll={{ y: 200 }}
columns={columns}
data-source={dataSource}
/>
)
}
}
API
props
TableProps
{
rowClassName: {
type: [String, Function],
default: ''
},
// fixed when header/columns are fixed, or using column.ellipsis
tableLayout: {
type: String,
validator(val) {
return ['auto', 'fixed'].includes(val)
}
},
direction: {
type: String,
default: 'ltr',
validator(val) {
return ['ltr', 'rtl'].includes(val)
}
},
// Whether to show all table borders
bordered: Boolean,
// Columns of table: ColumnProps[]
columns: {
type: Array,
required: true
},
// Override default table elements
components: {
type: Object,
default: () => TableComponents
},
// Data record array to be displayed
dataSource: {
type: Array,
default: () => [],
required: true
},
// expandable
expandable: Object, // See it below
// Whether to use virtualize scroll behavior
useVirtual: Boolean,
// The row height number of per row in TableBody
rowHeight: Number,
// The row index to specify where the view scroll to
scrollToRow: { type: Number, default: 0 },
prefixCls: {
type: String,
default: 'ant-table'
},
// Table footer renderer
// Should it be slot?
title: {
type: [Function, Object]
},
// Table footer renderer
// Should it be slot?
footer: {
type: [Function, Object]
},
rowKey: {
type: [String, Function],
required: true
},
rowSelection: Object,
// { x: number | true, y: number }
// x: Set horizontal scrolling, can also be used to specify the width of the scroll area, could be number, percent value, true and 'max-content' number | true -
// y: Set vertical scrolling, can also be used to specify the height of the scroll area, could be number number -
scroll: {
type: Object,
default: () => ({})
},
showHeader: {
type: Boolean,
default: true
},
size: {
type: String,
default: 'default',
validator(val) {
return ['default', 'middle', 'small'].includes(val)
}
},
locale: {
type: Object,
default: () => DEFAULT_LOCALE
}
}
expandable
{
// The children's name
childrenColumnName: {
type: String,
default: 'children' // string
},
// Indent size in pixels of tree data
indentSize: {
type: Number,
default: 15 // must be Number
},
// Customize row expand Icon. Ref example
expandIcon: Function, // (h, { prefixCls: string, expanded: boolean, expandable: boolean, record: object, onExpand: Function }) => VNode,
// Customize row expand render.
expandedRowRender: Function, // (h, { record: object, index: number, index: number, expanded: boolean }) => VNode,
// Whether row can be expandable or not
rowExpandable: Function, // (h) => boolean,
// Current expanded row keys
expandedRowKeys: {
type: Array,
default: () => [] // RowKey[]
},
// Current expanded deep into which depth
expandedDepth: {
type: Number,
default: null // RowKey[]
},
// Expand all rows initially
defaultExpandAllRows: {
type: Boolean,
default: true // boolean
},
}
rowSelection
{
type: {
type: String,
default: 'radio',
validator(val) {
return ['radio', 'checkbox'].includes(val)
}
},
// Controlled selected row keys: string[]|number[]
selectedRowKeys: {
type: Array,
default: () => []
},
// Callback executed when selected rows change
onChange: {
type: Function,
default: (selectedRowKeys, selectedRows) => {}
},
// Callback executed when select/deselect one row
onSelect: {
type: Function,
default: (record, selected, selectedRows, nativeEvent) => {}
}
}
ColumnProps
{
label: STRING_REQUIRED_PROP,
prop: STRING_REQUIRED_PROP,
key: STRING_REQUIRED_PROP,
width: [String, Number],
colspan: [Number, Function],
rowspan: [Number, Function],
className: [String, Function],
fixed: {
type: [Boolean, String],
validator(val) {
return [true, false, LEFT, RIGHT].includes(val)
}
},
align: {
type: String,
validator(val) {
return [LEFT, CENTER, RIGHT].includes(val)
}
},
ellipsis: BOOLEAN_FALSE_PROP,
expandable: BOOLEAN_FALSE_PROP,
render: Function, // BodyRowCellRender: VNode|({ store: TableStore, row: RowModel, column: ColumnConfig }) => VNode
renderHeader: Function, // HeaderRowCellRender: VNode|({ store, row, column }) => VNode
// TODO
resizable: BOOLEAN_FALSE_PROP
}
TableStore
isRowExpanded: (rowKey: string|RowModel) => boolean, // Whether current row/rowKey is expanded or not
toggleRowExpansion: (rowKey: string|RowModel, state: boolean => void, // To toggle current expansion state
toggleExpandAll: (expand: boolean) => void,// To toggle all rows be expanded
toggleExpandDepth: (depth: number) => void, // To toggle rows be expanded by specified depth number
isRowSelected: (rowKey: string|RowModel) => boolean, // Whether current row/rowKey is selected or not
toggleRowSelection: (rowKey: string|RowModel) => // To toggle current row selection state
slots
name render
empty When no-data so show empty block
title The title panel slot
footer The footer panel slot
events
name parameters description
select-change (record: RowModel, selected: boolean, selectedRowKeys: string[], nativeEvent: Event) => void When selection changed
expand-change (record: RowModel, isExpanded: boolean, expandedRowKeys: string[], nativeEvent: Event) => void When trigger expand or collapse
license
MIT
Install
npm i vue-virtualized-table-booway
DownloadsWeekly Downloads
5
Version
0.0.3
License
MIT
Unpacked Size
107 kB
Total Files
29
Last publish
Collaborators
• liuxia
|
{
"url": "https://www.npmjs.com/package/vue-virtualized-table-booway",
"source_domain": "www.npmjs.com",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "79128",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SHP4BPYO5CUJLDBED5ISKSJ4JV422UYG",
"WARC-Concurrent-To": "<urn:uuid:1b037b4c-286d-423d-aed9-65ab1caf380e>",
"WARC-Date": "2022-07-01T02:39:04Z",
"WARC-IP-Address": "104.16.92.83",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YPWEOCLW7FGWC4VLZ4KSED7B2XDRXZTC",
"WARC-Record-ID": "<urn:uuid:85cf7cdc-fceb-4722-b77e-b46354dc532f>",
"WARC-Target-URI": "https://www.npmjs.com/package/vue-virtualized-table-booway",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4d011734-417c-4915-bc98-45cbb82fda58>"
},
"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-246\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,
37,
38,
71,
72,
103,
104,
130,
131,
372,
373,
386,
387,
419,
453,
484,
515,
516,
526,
527,
595,
596,
612,
630,
631,
649,
650,
703,
752,
757,
778,
795,
812,
836,
861,
893,
923,
960,
973,
983,
991,
997,
998,
1006,
1007,
1017,
1018,
1033,
1034,
1040,
1062,
1096,
1116,
1125,
1130,
1201,
1222,
1244,
1269,
1318,
1328,
1337,
1342,
1361,
1383,
1407,
1432,
1478,
1488,
1497,
1502,
1545,
1570,
1575,
1616,
1633,
1654,
1677,
1686,
1691,
1732,
1752,
1774,
1813,
1822,
1827,
1870,
1890,
1911,
1938,
1961,
1970,
1975,
1995,
2037,
2088,
2115,
2170,
2195,
2254,
2303,
2308,
2327,
2349,
2378,
2387,
2392,
2423,
2451,
2466,
2499,
2508,
2513,
2544,
2572,
2588,
2621,
2630,
2635,
2651,
2685,
2708,
2717,
2722,
2750,
2755,
2796,
2963,
3083,
3099,
3121,
3149,
3158,
3163,
3183,
3206,
3228,
3237,
3242,
3256,
3278,
3306,
3331,
3393,
3403,
3412,
3417,
3433,
3455,
3493,
3501,
3507,
3508,
3523,
3524,
3530,
3559,
3587,
3609,
3647,
3656,
3661,
3705,
3725,
3747,
3785,
3794,
3799,
3847,
3991,
3996,
4034,
4155,
4160,
4206,
4256,
4261,
4296,
4321,
4342,
4380,
4389,
4394,
4442,
4465,
4487,
4521,
4530,
4535,
4570,
4600,
4623,
4656,
4665,
4671,
4672,
4689,
4690,
4696,
4710,
4732,
4758,
4783,
4836,
4846,
4855,
4912,
4937,
4958,
4984,
4993,
5046,
5064,
5088,
5143,
5152,
5208,
5226,
5250,
5319,
5327,
5333,
5334,
5350,
5351,
5357,
5392,
5426,
5459,
5490,
5495,
5530,
5565,
5602,
5607,
5622,
5655,
5680,
5738,
5748,
5757,
5762,
5777,
5799,
5824,
5877,
5887,
5896,
5901,
5937,
5975,
5980,
6102,
6196,
6201,
6215,
6251,
6257,
6258,
6273,
6274,
6380,
6491,
6572,
6676,
6782,
6876,
6877,
6887,
6888,
6904,
6947,
6978,
7011,
7012,
7023,
7024,
7056,
7190,
7335,
7336,
7348,
7349,
7357,
7358,
7370,
7371,
7410,
7411,
7441,
7442,
7448,
7449,
7461,
7462,
7472,
7473,
7485,
7486,
7494,
7495,
7513,
7514,
7525,
7526,
7542,
7543,
7550,
7551,
7568,
7569,
7587,
7588
],
"line_end_idx": [
37,
38,
71,
72,
103,
104,
130,
131,
372,
373,
386,
387,
419,
453,
484,
515,
516,
526,
527,
595,
596,
612,
630,
631,
649,
650,
703,
752,
757,
778,
795,
812,
836,
861,
893,
923,
960,
973,
983,
991,
997,
998,
1006,
1007,
1017,
1018,
1033,
1034,
1040,
1062,
1096,
1116,
1125,
1130,
1201,
1222,
1244,
1269,
1318,
1328,
1337,
1342,
1361,
1383,
1407,
1432,
1478,
1488,
1497,
1502,
1545,
1570,
1575,
1616,
1633,
1654,
1677,
1686,
1691,
1732,
1752,
1774,
1813,
1822,
1827,
1870,
1890,
1911,
1938,
1961,
1970,
1975,
1995,
2037,
2088,
2115,
2170,
2195,
2254,
2303,
2308,
2327,
2349,
2378,
2387,
2392,
2423,
2451,
2466,
2499,
2508,
2513,
2544,
2572,
2588,
2621,
2630,
2635,
2651,
2685,
2708,
2717,
2722,
2750,
2755,
2796,
2963,
3083,
3099,
3121,
3149,
3158,
3163,
3183,
3206,
3228,
3237,
3242,
3256,
3278,
3306,
3331,
3393,
3403,
3412,
3417,
3433,
3455,
3493,
3501,
3507,
3508,
3523,
3524,
3530,
3559,
3587,
3609,
3647,
3656,
3661,
3705,
3725,
3747,
3785,
3794,
3799,
3847,
3991,
3996,
4034,
4155,
4160,
4206,
4256,
4261,
4296,
4321,
4342,
4380,
4389,
4394,
4442,
4465,
4487,
4521,
4530,
4535,
4570,
4600,
4623,
4656,
4665,
4671,
4672,
4689,
4690,
4696,
4710,
4732,
4758,
4783,
4836,
4846,
4855,
4912,
4937,
4958,
4984,
4993,
5046,
5064,
5088,
5143,
5152,
5208,
5226,
5250,
5319,
5327,
5333,
5334,
5350,
5351,
5357,
5392,
5426,
5459,
5490,
5495,
5530,
5565,
5602,
5607,
5622,
5655,
5680,
5738,
5748,
5757,
5762,
5777,
5799,
5824,
5877,
5887,
5896,
5901,
5937,
5975,
5980,
6102,
6196,
6201,
6215,
6251,
6257,
6258,
6273,
6274,
6380,
6491,
6572,
6676,
6782,
6876,
6877,
6887,
6888,
6904,
6947,
6978,
7011,
7012,
7023,
7024,
7056,
7190,
7335,
7336,
7348,
7349,
7357,
7358,
7370,
7371,
7410,
7411,
7441,
7442,
7448,
7449,
7461,
7462,
7472,
7473,
7485,
7486,
7494,
7495,
7513,
7514,
7525,
7526,
7542,
7543,
7550,
7551,
7568,
7569,
7587,
7588,
7600
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7600,
"ccnet_original_nlines": 312,
"rps_doc_curly_bracket": 0.013157890178263187,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08805512636899948,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013782540336251259,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.45099541544914246,
"rps_doc_frac_unique_words": 0.415680468082428,
"rps_doc_mean_word_length": 6.417159557342529,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.155304431915283,
"rps_doc_word_count": 676,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08160442858934402,
"rps_doc_frac_chars_dupe_6grams": 0.06777317076921463,
"rps_doc_frac_chars_dupe_7grams": 0.06777317076921463,
"rps_doc_frac_chars_dupe_8grams": 0.01567542925477028,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02074689045548439,
"rps_doc_frac_chars_top_3gram": 0.019594280049204826,
"rps_doc_frac_chars_top_4gram": 0.012909170240163803,
"rps_doc_books_importance": -684.1558837890625,
"rps_doc_books_importance_length_correction": -684.1558837890625,
"rps_doc_openwebtext_importance": -281.29168701171875,
"rps_doc_openwebtext_importance_length_correction": -281.29168701171875,
"rps_doc_wikipedia_importance": -230.10977172851562,
"rps_doc_wikipedia_importance_length_correction": -230.10977172851562
},
"fasttext": {
"dclm": 0.36697083711624146,
"english": 0.35274630784988403,
"fineweb_edu_approx": 1.8283865451812744,
"eai_general_math": 0.27394986152648926,
"eai_open_web_math": 0.12444627285003662,
"eai_web_code": 0.9951204657554626
}
}
|
{
"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": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,976,350,884,860,968,000 |
January 6, 2022
Take This Minecraft Server Take A Look At And You'll See Your Struggles. Actually
Assuming all three of the criteria are met you'll then be able to see your newly uploaded icon in-sport whenever you ping the server in the multiplayer server checklist. If you aren't seeing the picture show in your Minecraft server list you want to make certain you've restarted the server after importing in addition to refresh the server checklist in-sport. After getting a properly sized, named, and formatted image you'll have the ability to then add it to your server to let it begin displaying in the server listing. 4. When you see the picture attain 100% you'll be able to then go back to the main panel web page and start the server. Head back to the mods web page. The icy landscape you spawn stretches out fairly far, but there’s a landmass close by so you'll be able to harvest essential resources earlier than heading back out onto the ice sheets. It is lucky that there are lots of free download sources for these assets packs. However, if you're new to internet hosting video games and are unsure of what you need, a free package deal could also be more beneficial. Also, you can create up to 2 servers with a free account.
You possibly can test the image dimensions in your Pc normally by proper-clicking and selecting Properties. The picture is probably not displayed on account of it being too giant or too small. This can be as a consequence of multiple points. Once this window is open you'll be able to then head to the small print tab to see the image dimensions. 2. To the left of the sport panel, navigate the FTP File Entry tab. To begin with, you should access your router web page. You want Root privilege to obtain Java (happily, all of AIT’s VPS options include full root access). strongcraft This is very important as these are the mods you need for it to work correctly. Assuming you solely have one Change, here are the best multiplayer video games which are price enjoying with your loved ones, which we keep up to date as new titles seem. It’s greatest to obtain the latest really helpful replace to your version of Minecraft. Portals are a bit of problematic when exploring new realms in Minecraft. Why not begin exploring into customizing your server additional? 2. Stop the server. Stop your server. Head to your management panel.
The server crashing in the course of the startup course of will be frequent on Forge servers if they don't seem to be setup appropriately. Now you can pass your server address along with a number of pals and begin constructing. Or if you’re in search of Minecraft constructing ideas, we’ve obtained all of the inspiration you’ll ever want. Wooden, stone, concrete, water, sand, grass and other blocks are a singular building material. Typically in case you are renaming the file after it's already uploaded you might discover that it isn't correct. Since the file format, on this case .png, is included in the name on the panel you may neglect to include it when renaming the file server-icon. If the Save as Kind is already PNG simply set the name to server-icon. Simply download the correct model on your operating system, and set up and set it up. 1. Make it possible for your server is about to Forge beneath the jar dropdown. On Bedrock Version, once you have updated to 1.18 and go to load up an current world, you will be shown a prompt and asked should you want to make a backup copy of that world.
Simply put, Minecraft seeds are a string of numbers that dictate an exact Minecraft world for you to load into. Different titles, like World of Vehicles and LEGO Universe, came and went although each have been based on in style franchises. It's finally time that the rest of the world gets a chance to play it. If you have acquired been trying to play Minecraft with your totally different Apple Tv-proudly proudly owning gamer buddies, it's time to get excited. Make sure you select a server hosting site that permits you to alter your server location with out losing files or knowledge or an excessive amount of time. The reset button on "the workforce & class choice GUI" permits the player to vary class within a battle spherical. But they want to construct on making the participant need to invest in that setting. Many times when modifying the server, the server will should be confirmed before it'll fully start. As soon as you're linked to the devoted server, move on to installing Java. When operating a modded server, do not forget that it's worthwhile to have the mods downloaded on your Minecraft shopper. There are some altered log recordsdata stored in Dropbox accounts you will need to download, and I might hate to publish the commands right here, only to have the hyperlinks modified at a later day.
|
{
"url": "https://squareblogs.net/sliceclover72/take-this-minecraft-server-take-a-look-at-and-youll-see-your-struggles",
"source_domain": "squareblogs.net",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "8914",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:L2I4YA7B3EOKBTPTGV5JCCBXNPONEUDU",
"WARC-Concurrent-To": "<urn:uuid:687319e2-a24b-446b-af3b-00bec612912d>",
"WARC-Date": "2022-06-26T01:30:16Z",
"WARC-IP-Address": "104.21.32.175",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:XVSN6U5COOSZ27JREW3VVGS5SWFLLC5W",
"WARC-Record-ID": "<urn:uuid:2579bdfd-09bc-489d-9b68-dd09996836b3>",
"WARC-Target-URI": "https://squareblogs.net/sliceclover72/take-this-minecraft-server-take-a-look-at-and-youll-see-your-struggles",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9926cba6-888c-4cb2-8496-80fa5b4ecee7>"
},
"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-178\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,
99,
100,
1240,
1241,
2370,
2371,
3478,
3479
],
"line_end_idx": [
16,
17,
99,
100,
1240,
1241,
2370,
2371,
3478,
3479,
4795
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4795,
"ccnet_original_nlines": 10,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.44120603799819946,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008040199987590313,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1286432147026062,
"rps_doc_frac_unique_words": 0.4675324559211731,
"rps_doc_mean_word_length": 4.521842002868652,
"rps_doc_num_sentences": 52,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.339577674865723,
"rps_doc_word_count": 847,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.008877280168235302,
"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.02114883065223694,
"rps_doc_frac_chars_top_3gram": 0.008355090394616127,
"rps_doc_frac_chars_top_4gram": 0.01018276996910572,
"rps_doc_books_importance": -449.7608947753906,
"rps_doc_books_importance_length_correction": -449.7608947753906,
"rps_doc_openwebtext_importance": -205.89808654785156,
"rps_doc_openwebtext_importance_length_correction": -205.89808654785156,
"rps_doc_wikipedia_importance": -213.4202117919922,
"rps_doc_wikipedia_importance_length_correction": -213.4202117919922
},
"fasttext": {
"dclm": 0.02444327063858509,
"english": 0.9433539509773254,
"fineweb_edu_approx": 1.752114176750183,
"eai_general_math": 0.1399327516555786,
"eai_open_web_math": 0.161909282207489,
"eai_web_code": 0.0660352110862732
}
}
|
{
"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.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": "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": "2",
"label": "Click Here References"
}
},
"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": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,883,956,784,032,580,600 |
UnbelievableDreams
• UnbelievableDreams
Confusing math question
Mathematics
• Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
katieb
• katieb
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
UnbelievableDreams
• UnbelievableDreams
Find the exact value of s in the given circular function value. Do not use a calculator. [0, pi/2]; sin s = sqrt3/ 2 I will be offline for an hour because my grandfather needs me. Can you please show me how to do this? Thank you.
anonymous
• anonymous
Use the unit cirycle. The x-coordinates give cosines and the y-coordinates give sines. The part in brackets tells you that you're looking for angles between 0 and π/2 inclusive. That's the first quadrant. So you're looking for the angle in radians that has a y-coordinate of \(\frac{ \sqrt{3} }{ 2 }\). |dw:1437169225134:dw|
UnbelievableDreams
• UnbelievableDreams
I got it. But what about tan? I always get wrong answer.
Looking for something else?
Not the answer you are looking for? Search for more explanations.
More answers
anonymous
• anonymous
tan Θ = y/x, so if you wanted to find \(\tan \frac{\pi}{3}\) divide \(\frac{ \sqrt{3} }{ 2 }\) by ½. \[\tan \frac{ \pi }{ 3 }=\frac{ \sqrt{3} }{ 2 }\div \frac{ 1 }{ 2 }=\frac{ \sqrt{3} }{ 2 }\times \frac{ 2 }{ 1 }=\sqrt3\]
UnbelievableDreams
• UnbelievableDreams
I am still confused. :(
UnbelievableDreams
• UnbelievableDreams
I wonder how you get sqrt3 / 2 and 1/2
anonymous
• anonymous
They come from the circle. I just used π/3 as an example. At π/3, the (x,y) point is \((\frac{ 1 }{ 2 },\frac{ \sqrt3 }{ 2 })\). And then to find the tangent, divide the y coordinate by the x coordinate.
UnbelievableDreams
• UnbelievableDreams
I see. Like for example, tan s (sqrt 3) I can't find sqrt 3 so it is sqrt/3
anonymous
• anonymous
tan ratios are not on most circles explicitly, so you have a few options. IMO, the quickest is to memorize the tan values for the 1st quadrant and then relate them to the others. tan 30° = tan π/6 = 1/√3 = (√3)/3 tan 45° = tan π/4 = 1 tan 60° = tan π/3 = √3 You can also derive it with a right triangle. If tan Θ is 1 or -1, the triangle is 45-45-90 and is an odd multiple of π/4. If tan is ±√3 or ±(√3)/3 then it's a 30-60-90 triangle and you can use the values to figure out if the angle is 30° or 60°. |dw:1437186512607:dw|
UsukiDoll
• UsukiDoll
[0, pi/2] means that from 0 to 90 degrees we are in the first quadrant
UsukiDoll
• UsukiDoll
pi/2 x 180/pi = 180/2=90 degrees we use 180/pi to convert from radians to degrees we use pi/180 to convert from degrees to radians
UsukiDoll
• UsukiDoll
memorizing the 30,45,60 degree triangles work too.
UnbelievableDreams
• UnbelievableDreams
I see.
UsukiDoll
• UsukiDoll
|dw:1437187176412:dw|
Looking for something else?
Not the answer you are looking for? Search for more explanations.
|
{
"url": "http://openstudy.com/updates/55a96949e4b071e6530c379f",
"source_domain": "openstudy.com",
"snapshot_id": "crawl=CC-MAIN-2017-30",
"warc_metadata": {
"Content-Length": "154978",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KVSFISFDYMAL6GXRNVTKEFXV66RUHVHO",
"WARC-Concurrent-To": "<urn:uuid:109af660-c300-459b-b501-61fc44f272d9>",
"WARC-Date": "2017-07-22T11:16:28Z",
"WARC-IP-Address": "52.0.184.118",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IMPDWVIYD5DNMC6H7GQ36XEQGXPZVH3E",
"WARC-Record-ID": "<urn:uuid:f698025f-8314-4772-95be-f0154b08fff7>",
"WARC-Target-URI": "http://openstudy.com/updates/55a96949e4b071e6530c379f",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fbfbcafc-638c-4d72-8451-56cf62091586>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-178-21-170.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,
19,
42,
66,
78,
117,
203,
210,
902,
909,
920,
1021,
1040,
1063,
1293,
1303,
1317,
1642,
1661,
1684,
1741,
1742,
1770,
1771,
1837,
1838,
1851,
1852,
1862,
1876,
2099,
2118,
2141,
2165,
2184,
2207,
2246,
2256,
2270,
2474,
2493,
2516,
2592,
2602,
2616,
3143,
3153,
3167,
3238,
3248,
3262,
3393,
3403,
3417,
3468,
3487,
3510,
3517,
3527,
3541,
3563,
3564,
3592,
3593
],
"line_end_idx": [
19,
42,
66,
78,
117,
203,
210,
902,
909,
920,
1021,
1040,
1063,
1293,
1303,
1317,
1642,
1661,
1684,
1741,
1742,
1770,
1771,
1837,
1838,
1851,
1852,
1862,
1876,
2099,
2118,
2141,
2165,
2184,
2207,
2246,
2256,
2270,
2474,
2493,
2516,
2592,
2602,
2616,
3143,
3153,
3167,
3238,
3248,
3262,
3393,
3403,
3417,
3468,
3487,
3510,
3517,
3527,
3541,
3563,
3564,
3592,
3593,
3658
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3658,
"ccnet_original_nlines": 63,
"rps_doc_curly_bracket": 0.013121919706463814,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.27075812220573425,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016847170889377594,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3525872528553009,
"rps_doc_frac_unique_words": 0.49829933047294617,
"rps_doc_mean_word_length": 4.7108845710754395,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.222784042358398,
"rps_doc_word_count": 588,
"rps_doc_frac_chars_dupe_10grams": 0.05487364903092384,
"rps_doc_frac_chars_dupe_5grams": 0.0960288792848587,
"rps_doc_frac_chars_dupe_6grams": 0.06642598658800125,
"rps_doc_frac_chars_dupe_7grams": 0.05487364903092384,
"rps_doc_frac_chars_dupe_8grams": 0.05487364903092384,
"rps_doc_frac_chars_dupe_9grams": 0.05487364903092384,
"rps_doc_frac_chars_top_2gram": 0.04801443964242935,
"rps_doc_frac_chars_top_3gram": 0.09350181370973587,
"rps_doc_frac_chars_top_4gram": 0.06859205663204193,
"rps_doc_books_importance": -371.55084228515625,
"rps_doc_books_importance_length_correction": -371.55084228515625,
"rps_doc_openwebtext_importance": -249.50054931640625,
"rps_doc_openwebtext_importance_length_correction": -249.50054931640625,
"rps_doc_wikipedia_importance": -178.82940673828125,
"rps_doc_wikipedia_importance_length_correction": -178.82940673828125
},
"fasttext": {
"dclm": 0.19084477424621582,
"english": 0.6966984272003174,
"fineweb_edu_approx": 1.5658855438232422,
"eai_general_math": 0.7877654433250427,
"eai_open_web_math": 0.7201471328735352,
"eai_web_code": 0.011434730142354965
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "516.24",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
},
"secondary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"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": "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": "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": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,334,642,402,439,966,000 |
1. djjosh16511's Avatar
Hey everyone
The beta 4 is out and I'm loving the smoothness and few bug fixes I've noticed (or technically not noticed)
Anyway, Tethering finally works (With the carrier file that has leaked onto the web). Before on v3 with the carrier file, when Tethering was turned on absolutely nothing would happen anywhere, as if it were turned off. No blue "Internet Tethering" on the iPhone and the computer never recognized it either.
No MMS still, but tethering is now up and working with the carrier file and v4.
I was wondering after loading my yahoo email and a 5 minute AIM conversation how AT&T is charging for tethering right now. Is it safe to use? I don't need any more money to be charged to my bill for this.
Thanks for any help!
Last edited by djjosh16511; 04-30-2009 at 10:56 PM.
04-30-2009 10:50 PM
2. JustinHorn's Avatar
Just be careful, you never know if they will flag you for excessive use.
04-30-2009 11:02 PM
3. djjosh16511's Avatar
Just be careful, you never know if they will flag you for excessive use.
Is AT&T charging for using it? I have turned it off and was just thinking about going up to the AT&T store tomorrow and talking to a rep.
04-30-2009 11:10 PM
4. JustinHorn's Avatar
No, tethering is not available yet on the iPhone. All I'm saying is I'm pretty sure in there Terms of Service there is something there about excessive use. So technically they could flag your account and say you have a hacked phone and charge you some fee. If you are just playing around and going to a few websites you should be fine, but if you decided to download HD movie rentals over it that's a different story.
04-30-2009 11:14 PM
5. djjosh16511's Avatar
No, tethering is not available yet on the iPhone. All I'm saying is I'm pretty sure in there Terms of Service there is something there about excessive use. So technically they could flag your account and say you have a hacked phone and charge you some fee. If you are just playing around and going to a few websites you should be fine, but if you decided to download HD movie rentals over it that's a different story.
Ahh good point, seeing on how the carrier file the leaked online I'm pretty sure is modded and not officially AT&T's.
I'll play it safe and just use it in absolute emergencies, which I don't see something urgent enough worth risking this.
04-30-2009 11:28 PM
LINK TO POST COPIED TO CLIPBOARD
|
{
"url": "https://forums.imore.com/developers-lounge/171446-iphone-3-0-beta-v4-tethering-w-t.html",
"source_domain": "forums.imore.com",
"snapshot_id": "crawl=CC-MAIN-2018-13",
"warc_metadata": {
"Content-Length": "144912",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:K4SOWPALLPRAGQUWFBZVGIY6MQWUQCOW",
"WARC-Concurrent-To": "<urn:uuid:0e61ff5a-7a69-4cc1-8fe4-3f3410aeac56>",
"WARC-Date": "2018-03-23T01:54:13Z",
"WARC-IP-Address": "104.16.167.226",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:UH5MQTKTESYV6D2TCCXVAX4FA5THGKFU",
"WARC-Record-ID": "<urn:uuid:ac121dc7-2c45-4e6d-909f-d147047db930>",
"WARC-Target-URI": "https://forums.imore.com/developers-lounge/171446-iphone-3-0-beta-v4-tethering-w-t.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7196fd6b-7825-4ecf-9879-bc1cb8f58405>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-149-106-148.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,
26,
43,
44,
156,
157,
468,
469,
553,
554,
763,
764,
789,
845,
869,
894,
971,
995,
1021,
1098,
1240,
1264,
1289,
1711,
1735,
1761,
2183,
2305,
2306,
2431,
2455
],
"line_end_idx": [
26,
43,
44,
156,
157,
468,
469,
553,
554,
763,
764,
789,
845,
869,
894,
971,
995,
1021,
1098,
1240,
1264,
1289,
1711,
1735,
1761,
2183,
2305,
2306,
2431,
2455,
2487
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2487,
"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.4372759759426117,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06451612710952759,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22043010592460632,
"rps_doc_frac_unique_words": 0.43518519401550293,
"rps_doc_mean_word_length": 4.344907283782959,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.896421432495117,
"rps_doc_word_count": 432,
"rps_doc_frac_chars_dupe_10grams": 0.42621204257011414,
"rps_doc_frac_chars_dupe_5grams": 0.42621204257011414,
"rps_doc_frac_chars_dupe_6grams": 0.42621204257011414,
"rps_doc_frac_chars_dupe_7grams": 0.42621204257011414,
"rps_doc_frac_chars_dupe_8grams": 0.42621204257011414,
"rps_doc_frac_chars_dupe_9grams": 0.42621204257011414,
"rps_doc_frac_chars_top_2gram": 0.021310599520802498,
"rps_doc_frac_chars_top_3gram": 0.029834840446710587,
"rps_doc_frac_chars_top_4gram": 0.02876931056380272,
"rps_doc_books_importance": -281.8592834472656,
"rps_doc_books_importance_length_correction": -281.8592834472656,
"rps_doc_openwebtext_importance": -156.54763793945312,
"rps_doc_openwebtext_importance_length_correction": -156.54763793945312,
"rps_doc_wikipedia_importance": -125.88642883300781,
"rps_doc_wikipedia_importance_length_correction": -125.88642883300781
},
"fasttext": {
"dclm": 0.5660403370857239,
"english": 0.9618064165115356,
"fineweb_edu_approx": 0.7253337502479553,
"eai_general_math": 0.03255641087889671,
"eai_open_web_math": 0.18087494373321533,
"eai_web_code": 0.004559990018606186
}
}
|
{
"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": "384.5",
"labels": {
"level_1": "Social sciences",
"level_2": "Commerce and Communication and traffic",
"level_3": "Telecommunication"
}
}
},
"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": "-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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,577,139,402,084,660,000 |
Click here to Skip to main content
Click here to Skip to main content
A class to make it easy to enumerate folder contents
, 5 Apr 2004 CPOL
Rate this:
Please Sign up or sign in to vote.
Enumerating folder contents the reusable way
<!-- Download Links --> <!-- Add the rest of your HTML here -->
Introduction
Recently I've found myself writing a lot of directory enumeration code. You know the sort of thing. List all files in a directory and do something (or nothing) with a file depending on the file extension or perhaps some magic number at the start of the file. The code usually looks like this.
void EnumerateFolderContents(LPCTSTR szFolderName)
{
CString csTemp = szFolderName;
csTemp += _T("\\*.*");
CFileFind ff;
BOOL bWorking = ff.FindFile(csTemp);
while (bWorking)
{
bWorking = ff.FindNextFile();
if (ff.IsDirectory())
{
if (ff.IsDots())
continue;
// Recursively traverse this subdirectory
EnumerateFolderContents(ff.GetFilePath());
}
else
{
// Do something with a file...
}
}
}
We call EnumerateFolderContents() passing it a folder path. We append \*.* (or some more specific filename extension) to the path and enumerate the contents of that folder. If it finds a folder we check if the folder meets the IsDots() test (is it . (the current folder) or is it .. (the parent folder). If it's either we ignore it lest we go into an infinite loop. If not we enumerate that folder in turn. If the something returned to us isn't a folder then it must be a file so we apply our file processing code to that something.
This is a pretty simple piece of code to write. Like me, you've probably cribbed it straight out of the MSDN documentation for the CFileFind class, including the bWorking variable!
But after a while, if you need this kind of code in more than one place in your applications, you start to notice that you're repeating yourself. It's starting to look like a candidate for a class.
CEnumerateFolders
is a base class that encapsulates the guts of enumerating a folder. For each sub-folder it finds (excluding the 'dot' folders) it calls a virtual function and for each file it finds it calls another virtual function.
The class itself is very simple.
class CEnumerateFolders : public CObject
{
protected:
CEnumerateFolders();
public:
BOOL Execute(LPCTSTR szFolder,
BOOL bRecurse = TRUE,
DWORD dwCookie = 0,
LPCTSTR szFilter = _T("*.*"));
virtual BOOL OnFolder(LPCTSTR szFolder, DWORD dwCookie) const;
virtual BOOL OnFile(LPCTSTR szFilename, DWORD dwCookie) const;
};
The constructor is protected in order to force you to derive a class from this one. The reason is that the base class OnFolder() and OnFile() implementations do nothing. If you were to instantiate a CEnumerateFolders object directly it would go ahead and enumerate the folder you told it to and throw away all the results. Not quite the expected outcome!
On the other hand, I can hardly make either of the two virtual functions pure virtual. It's perfectly possible that you might want to use the base class implementation of one whilst overriding the do-nothing functionality of the other. And I certainly didn't want to force the definition of a dummy function
The Execute() method is where the work is done. It looks like this.
BOOL CEnumerateFolders::Execute(LPCTSTR szFolder, BOOL bRecurse,
DWORD dwCookie, LPCTSTR szFilter)
{
ASSERT(szFolder);
ASSERT(AfxIsValidString(szFolder));
CFileSpec fs(szFolder, szFilter);
CFileFind ff;
BOOL bWorking = ff.FindFile(fs.GetFullSpec());
while (bWorking)
{
bWorking = ff.FindNextFile();
if (ff.IsDirectory())
{
if (ff.IsDots())
continue;
if (OnFolder(ff.GetFilePath(), dwCookie) == FALSE)
return FALSE;
if (bRecurse &&
Execute(ff.GetFilePath() + _T("\\"), dwCookie, szFilter) == FALSE)
return FALSE;
}
else if (OnFile(ff.GetFilePath(), dwCookie) == FALSE)
return FALSE;
}
return TRUE;
}
It looks almost exactly like the opening code snippet, which is not by accident. All we've done is abstract the logic of dealing with the things found in the folder enumeration operation. Note that passing FALSE for bRecurse prevents recursion. My first draft of the class didn't call OnFolder() if recursion was turned off. In practice this turned out to be way too restrictive.
Your overrides should return TRUE if you want to continue enumerating.
Using the class
is as easy as creating your own class derived from CEnumerateFolders. For example, my application wants to find all image files in a particular folder and use them to populate an ImageList. My derived class looks like this.
class CPopulateThumbnailImageList : public CEnumerateFolders
{
public:
virtual BOOL OnFile(LPCTSTR szFilename, DWORD dwCookie) const;
};
where the only member is an override of OnFile(). My OnFile() looks like this.
BOOL CPopulateThumbnailImageList::OnFile(LPCTSTR szFilename, DWORD dwCookie) const
{
ASSERT(szFilename);
ASSERT(AfxIsValidString(szFilename));
CSelectImage *pDlg = (CSelectImage *) dwCookie;
ASSERT(pDlg);
ASSERT_KINDOF(CSelectImage, pDlg);
ASSERT(IsWindow(pDlg->GetSafeHwnd()));
CFileSpec fs(szFilename);
if (IsImageFile(szFilename))
pDlg->PostMessage(guiAdvise,
CSelectImage::adviseLoadImage,
LPARAM(new CString(fs.GetFullSpec()))
);
return TRUE;
}
which assumes that the dwCookie is in fact a pointer to my CSelectImage dialog. It checks the file name passed to it to see if it's an image file and if it passes that test it posts a message to my dialog class with the name of the file. Finally, in the OnInitDialog() handler in my dialog class I do this.
BOOL CSelectImage::OnInitDialog()
{
CDialog::OnInitDialog();
CBitmap bmp;
CPopulateThumbnailImageList ptil;
m_images.Create(80, 60, ILC_COLOR16, 1, 1);
m_list.SetImageList(&m_images, LVSIL_NORMAL);
m_list.ApproximateViewRect(CSize(80, 60), -1);
ptil.Execute(m_csImagePath + _T("\\"), FALSE, DWORD(this));
return TRUE;
}
which sets up the ImageList and does some other housekeeping and then calls Execute() on the derived class. Notice I've passed FALSE for the bRecurse parameter to ensure I'll only get images in the folder I specified (and not images in all sub-folders).
Other issues
It's tempting to think that the class can be derived from CFileFind, eliminating the need to declare an instance of CFileFind inside the Excecute() method. That works until you do recursion. Each level you recurse deeper into the folder structure will return the correct results. It's when you reach the bottom of the tree and want to come back up that you start losing results. The reason, of course, is that by reusing the base class methods you've destroyed the return stack of open FILEFIND handles.
Dependencies
As presented the class relies on my CFileSpec class which can be found here[^]. The download includes a copy of that class.
History
31 March 2004 - Initial version.
6 April 2004 - Updated to call OnFolder() even when not recursing.
License
This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)
Share
About the Author
Rob Manderson
United States United States
I've been programming for 35 years - started in machine language on the National Semiconductor SC/MP chip, moved via the 8080 to the Z80 - graduated through HP Rocky Mountain Basic and HPL - then to C and C++ and now C#.
I used (30 or so years ago when I worked for Hewlett Packard) to repair HP Oscilloscopes and Spectrum Analysers - for a while there I was the one repairing DC to daylight SpecAns in the Asia Pacific area.
Afterward I was the fourth team member added to the Australia Post EPOS project at Unisys Australia. We grew to become an A$400 million project. I wrote a few device drivers for the project under Microsoft OS/2 v 1.3 - did hardware qualification and was part of the rollout team dealing directly with the customer.
Born and bred in Melbourne Australia, now living in Scottsdale Arizona USA, became a US Citizen on September 29th, 2006.
I work for a medical insurance broker, learning how to create ASP.NET websites in VB.Net and C#. It's all good.
Oh, I'm also a Kentucky Colonel. http://www.kycolonels.org
Comments and Discussions
Generalreparse point issue PinmemberValerio13-Apr-04 20:52
GeneralRe: reparse point issue PinmemberBlake Miller14-Apr-04 6:17
GeneralGood Stuff PinmemberJack Rabbit6-Apr-04 14:51
GeneralRe: Good Stuff PineditorRob Manderson6-Apr-04 15:51
GeneralRe: Good Stuff PinmemberBlake Miller7-Apr-04 7:02
GeneralNice Job! Pinmemberbasementman1-Apr-04 5:26
GeneralRe: Nice Job! PineditorRob Manderson1-Apr-04 22:34
General General News News Suggestion Suggestion Question Question Bug Bug Answer Answer Joke Joke Rant Rant Admin Admin
Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.
| Advertise | Privacy | Terms of Use | Mobile
Web02 | 2.8.150331.1 | Last Updated 6 Apr 2004
Article Copyright 2004 by Rob Manderson
Everything else Copyright © CodeProject, 1999-2015
Layout: fixed | fluid
|
{
"url": "http://www.codeproject.com/Articles/6576/A-class-to-make-it-easy-to-enumerate-folder-conten",
"source_domain": "www.codeproject.com",
"snapshot_id": "crawl=CC-MAIN-2015-14",
"warc_metadata": {
"Content-Length": "98831",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XYLJJNFJENCBDQNNY32K77YZ2DP6E35S",
"WARC-Concurrent-To": "<urn:uuid:ce2f43ba-a40e-4d0c-b5d7-6dcce0d9e2b5>",
"WARC-Date": "2015-04-02T08:33:34Z",
"WARC-IP-Address": "65.39.148.34",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:HLRGXLV2SUBYSDUG4ZFT75PCWAVF3OLY",
"WARC-Record-ID": "<urn:uuid:ae6245ac-b784-447e-9aa5-15656cb88d06>",
"WARC-Target-URI": "http://www.codeproject.com/Articles/6576/A-class-to-make-it-easy-to-enumerate-folder-conten",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:76239ae6-f95d-4a39-8fce-3383beab2d95>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-168-14-71.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-14\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 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,
35,
70,
71,
124,
125,
143,
154,
189,
234,
298,
299,
312,
313,
606,
657,
659,
694,
695,
722,
723,
741,
787,
788,
809,
815,
853,
854,
884,
894,
923,
949,
950,
1005,
1060,
1070,
1083,
1093,
1136,
1146,
1152,
1154,
1687,
1688,
1869,
1870,
2068,
2069,
2087,
2088,
2305,
2306,
2339,
2340,
2381,
2383,
2394,
2439,
2447,
2497,
2551,
2604,
2667,
2668,
2742,
2816,
2819,
3174,
3175,
3483,
3484,
3552,
3553,
3619,
3685,
3687,
3709,
3749,
3750,
3788,
3789,
3807,
3863,
3864,
3885,
3891,
3929,
3930,
3960,
3970,
3999,
4025,
4026,
4089,
4107,
4124,
4153,
4236,
4270,
4280,
4342,
4368,
4374,
4375,
4392,
4394,
4774,
4775,
4846,
4847,
4863,
4864,
5088,
5149,
5151,
5159,
5233,
5236,
5315,
5398,
5400,
5424,
5466,
5467,
5519,
5520,
5538,
5577,
5620,
5621,
5651,
5656,
5689,
5727,
5785,
5849,
5856,
5857,
5874,
5876,
6183,
6217,
6219,
6248,
6249,
6286,
6324,
6325,
6373,
6423,
6474,
6475,
6539,
6556,
6558,
6812,
6813,
6826,
6827,
7331,
7332,
7345,
7346,
7470,
7471,
7479,
7480,
7513,
7514,
7581,
7582,
7590,
7591,
7709,
7710,
7716,
7717,
7734,
7735,
7749,
7750,
7778,
7999,
8000,
8205,
8206,
8521,
8522,
8643,
8644,
8756,
8757,
8816,
8817,
8842,
8843,
8845,
8905,
8973,
9027,
9087,
9145,
9197,
9256,
9257,
9404,
9405,
9516,
9517,
9563,
9610,
9650,
9701
],
"line_end_idx": [
35,
70,
71,
124,
125,
143,
154,
189,
234,
298,
299,
312,
313,
606,
657,
659,
694,
695,
722,
723,
741,
787,
788,
809,
815,
853,
854,
884,
894,
923,
949,
950,
1005,
1060,
1070,
1083,
1093,
1136,
1146,
1152,
1154,
1687,
1688,
1869,
1870,
2068,
2069,
2087,
2088,
2305,
2306,
2339,
2340,
2381,
2383,
2394,
2439,
2447,
2497,
2551,
2604,
2667,
2668,
2742,
2816,
2819,
3174,
3175,
3483,
3484,
3552,
3553,
3619,
3685,
3687,
3709,
3749,
3750,
3788,
3789,
3807,
3863,
3864,
3885,
3891,
3929,
3930,
3960,
3970,
3999,
4025,
4026,
4089,
4107,
4124,
4153,
4236,
4270,
4280,
4342,
4368,
4374,
4375,
4392,
4394,
4774,
4775,
4846,
4847,
4863,
4864,
5088,
5149,
5151,
5159,
5233,
5236,
5315,
5398,
5400,
5424,
5466,
5467,
5519,
5520,
5538,
5577,
5620,
5621,
5651,
5656,
5689,
5727,
5785,
5849,
5856,
5857,
5874,
5876,
6183,
6217,
6219,
6248,
6249,
6286,
6324,
6325,
6373,
6423,
6474,
6475,
6539,
6556,
6558,
6812,
6813,
6826,
6827,
7331,
7332,
7345,
7346,
7470,
7471,
7479,
7480,
7513,
7514,
7581,
7582,
7590,
7591,
7709,
7710,
7716,
7717,
7734,
7735,
7749,
7750,
7778,
7999,
8000,
8205,
8206,
8521,
8522,
8643,
8644,
8756,
8757,
8816,
8817,
8842,
8843,
8845,
8905,
8973,
9027,
9087,
9145,
9197,
9256,
9257,
9404,
9405,
9516,
9517,
9563,
9610,
9650,
9701,
9722
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9722,
"ccnet_original_nlines": 212,
"rps_doc_curly_bracket": 0.002262909896671772,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.29157549142837524,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05196937173604965,
"rps_doc_frac_lines_end_with_ellipsis": 0.0046948399394750595,
"rps_doc_frac_no_alph_words": 0.2554704546928406,
"rps_doc_frac_unique_words": 0.4407435953617096,
"rps_doc_mean_word_length": 5.409759998321533,
"rps_doc_num_sentences": 98,
"rps_doc_symbol_to_word_ratio": 0.0016411399701610208,
"rps_doc_unigram_entropy": 5.6905293464660645,
"rps_doc_word_count": 1291,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04238259047269821,
"rps_doc_frac_chars_dupe_6grams": 0.04238259047269821,
"rps_doc_frac_chars_dupe_7grams": 0.04238259047269821,
"rps_doc_frac_chars_dupe_8grams": 0.019473079591989517,
"rps_doc_frac_chars_dupe_9grams": 0.019473079591989517,
"rps_doc_frac_chars_top_2gram": 0.00572738004848361,
"rps_doc_frac_chars_top_3gram": 0.007445590104907751,
"rps_doc_frac_chars_top_4gram": 0.012027489952743053,
"rps_doc_books_importance": -799.3662109375,
"rps_doc_books_importance_length_correction": -799.3662109375,
"rps_doc_openwebtext_importance": -407.340087890625,
"rps_doc_openwebtext_importance_length_correction": -407.340087890625,
"rps_doc_wikipedia_importance": -419.01007080078125,
"rps_doc_wikipedia_importance_length_correction": -419.01007080078125
},
"fasttext": {
"dclm": 0.1120612621307373,
"english": 0.8097334504127502,
"fineweb_edu_approx": 1.7974292039871216,
"eai_general_math": 0.17695611715316772,
"eai_open_web_math": 0.228878915309906,
"eai_web_code": 0.01667064055800438
}
}
|
{
"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": "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": "4",
"label": "Missing Images or Figures"
}
},
"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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,082,552,017,987,485,000 |
glssry
TypeScript
TypeScript is a free and open-source high-level programming language developed by Microsoft that adds static typing with optional type annotations to JavaScript. It is designed for the development of large applications and transpiles to JavaScript. Because TypeScript is a superset of JavaScript, all JavaScript programs are syntactically valid TypeScript, but they can fail to type-check for safety reasons.
Abbreviation:
TS
Acronym:
TS
Initialism:
TS
Added by:
glssry-guy
File under: Programming
Tags: Computing
Version: 1
|
{
"url": "https://glssry.org/programming/typescript",
"source_domain": "glssry.org",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "22429",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:L2XDGYXRV4ML2O65WW3OM5E2GHNOHTMK",
"WARC-Concurrent-To": "<urn:uuid:f693dfa2-3904-415f-86b9-9d00311933c3>",
"WARC-Date": "2024-05-19T17:59:54Z",
"WARC-IP-Address": "76.76.21.21",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:A56DS34BPEPFJNLR6L6LFBUJLCU6I5J2",
"WARC-Record-ID": "<urn:uuid:2e505122-20ce-4d72-bb8d-38faf82db28a>",
"WARC-Target-URI": "https://glssry.org/programming/typescript",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c9026030-8877-41c2-8eb6-5a081991ab09>"
},
"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-21\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,
7,
8,
19,
20,
429,
430,
444,
447,
456,
459,
471,
474,
475,
485,
486,
497,
498,
522,
523,
539,
540
],
"line_end_idx": [
7,
8,
19,
20,
429,
430,
444,
447,
456,
459,
471,
474,
475,
485,
486,
497,
498,
522,
523,
539,
540,
550
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 550,
"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.2604166567325592,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03125,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1770833283662796,
"rps_doc_frac_unique_words": 0.7631579041481018,
"rps_doc_mean_word_length": 5.934210300445557,
"rps_doc_num_sentences": 4,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.9452645778656006,
"rps_doc_word_count": 76,
"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.05321507900953293,
"rps_doc_frac_chars_top_3gram": 0.05764966830611229,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -33.66361618041992,
"rps_doc_books_importance_length_correction": -47.463592529296875,
"rps_doc_openwebtext_importance": -25.79840850830078,
"rps_doc_openwebtext_importance_length_correction": -39.598384857177734,
"rps_doc_wikipedia_importance": -11.011244773864746,
"rps_doc_wikipedia_importance_length_correction": -24.811222076416016
},
"fasttext": {
"dclm": 0.02742457017302513,
"english": 0.814049482345581,
"fineweb_edu_approx": 2.646899461746216,
"eai_general_math": 0.06724631786346436,
"eai_open_web_math": 0.14048945903778076,
"eai_web_code": 0.3490385413169861
}
}
|
{
"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.1332",
"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": "1",
"label": "Remember"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "1",
"label": "Factual"
}
},
"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": "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": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,491,734,243,042,431,000 |
ENTITY IfcBooleanResult
(* SCHEMA IFC4; *)
ENTITY IfcBooleanResult
SUPERTYPE OF (ONEOF
(IfcBooleanClippingResult))
SUBTYPE OF (IfcGeometricRepresentationItem);
Operator : IfcBooleanOperator;
FirstOperand : IfcBooleanOperand;
SecondOperand : IfcBooleanOperand;
DERIVE
Dim : IfcDimensionCount := FirstOperand.Dim;
WHERE
SameDim : FirstOperand.Dim = SecondOperand.Dim;
END_ENTITY;
Explicit Attributes
Entity IfcBooleanResult has the following local and inherited explicit attributes:
AttributeTypeDefined By
OperatorIfcBooleanOperator (ENUM)IfcBooleanResult
FirstOperandIfcBooleanOperand (SELECT)IfcBooleanResult
SecondOperandIfcBooleanOperand (SELECT)IfcBooleanResult
Derived Attributes
Entity IfcBooleanResult has the following local and inherited derived attributes:
AttributeTypeDefined By
DimIfcDimensionCount (INTEGER)IfcBooleanResult
Inverse Attributes
Entity IfcBooleanResult has the following local and inherited inverse attributes:
AttributeTypeDefined By
LayerAssignmentSET OF IfcPresentationLayerAssignment (ENTITY)IfcRepresentationItem
StyledByItemSET OF IfcStyledItem (ENTITY)IfcRepresentationItem
Supertypes
Entity IfcBooleanResult inherits from the following supertypes:
IfcRepresentationItem
IfcGeometricRepresentationItem
Subtypes
Entity IfcBooleanResult has the following subtypes:
IfcBooleanClippingResult*
* - Immediate Subtypes
Referenced By
Entity IfcBooleanResult and its supertypes are referenced by the following definitions:
DefinitionTypeReferenced Entity
IfcAxis1Placement ENTITY IfcGeometricRepresentationItem
IfcAxis1Placement ENTITY IfcRepresentationItem
IfcBaseAxis FUNCTION IfcGeometricRepresentationItem
IfcBaseAxis FUNCTION IfcRepresentationItem
IfcBooleanOperand SELECT IfcBooleanResult
IfcBuild2Axes FUNCTION IfcGeometricRepresentationItem
IfcBuild2Axes FUNCTION IfcRepresentationItem
IfcBuildAxes FUNCTION IfcGeometricRepresentationItem
IfcBuildAxes FUNCTION IfcRepresentationItem
IfcConvertDirectionInto2D FUNCTION IfcGeometricRepresentationItem
IfcConvertDirectionInto2D FUNCTION IfcRepresentationItem
IfcCrossProduct FUNCTION IfcRepresentationItem
IfcCrossProduct FUNCTION IfcGeometricRepresentationItem
IfcCsgSelect SELECT IfcBooleanResult
IfcExtrudedAreaSolid ENTITY IfcGeometricRepresentationItem
IfcExtrudedAreaSolid ENTITY IfcRepresentationItem
IfcFirstProjAxis FUNCTION IfcRepresentationItem
IfcFirstProjAxis FUNCTION IfcGeometricRepresentationItem
IfcGeometricRepresentationItem ENTITY IfcBooleanResult
IfcLayeredItem SELECT IfcRepresentationItem
IfcMirroredProfileDef ENTITY IfcGeometricRepresentationItem
IfcMirroredProfileDef ENTITY IfcRepresentationItem
IfcNormalise FUNCTION IfcRepresentationItem
IfcNormalise FUNCTION IfcGeometricRepresentationItem
IfcOrthogonalComplement FUNCTION IfcGeometricRepresentationItem
IfcOrthogonalComplement FUNCTION IfcRepresentationItem
IfcRepresentation ENTITY IfcRepresentationItem
IfcRepresentationItem ENTITY IfcGeometricRepresentationItem
IfcRevolvedAreaSolid ENTITY IfcGeometricRepresentationItem
IfcRevolvedAreaSolid ENTITY IfcRepresentationItem
IfcScalarTimesVector FUNCTION IfcGeometricRepresentationItem
IfcScalarTimesVector FUNCTION IfcRepresentationItem
IfcSecondProjAxis FUNCTION IfcRepresentationItem
IfcSecondProjAxis FUNCTION IfcGeometricRepresentationItem
IfcShapeRepresentationTypes FUNCTION IfcRepresentationItem
IfcStyledItem ENTITY IfcRepresentationItem
IfcSurfaceOfLinearExtrusion ENTITY IfcRepresentationItem
IfcSurfaceOfLinearExtrusion ENTITY IfcGeometricRepresentationItem
IfcSurfaceOfRevolution ENTITY IfcRepresentationItem
IfcSurfaceOfRevolution ENTITY IfcGeometricRepresentationItem
IfcTopologyRepresentationTypes FUNCTION IfcRepresentationItem
IfcVectorDifference FUNCTION IfcGeometricRepresentationItem
IfcVectorDifference FUNCTION IfcRepresentationItem
IfcVectorSum FUNCTION IfcGeometricRepresentationItem
IfcVectorSum FUNCTION IfcRepresentationItem
[Top Level Definitions] [Exit]
Generated by STEP Tools® EXPRESS to HTML Converter
2016-06-01T11:21:40-04:00
|
{
"url": "http://www.steptools.com/stds/ifc/html/t_ifcbooleanresult.html",
"source_domain": "www.steptools.com",
"snapshot_id": "crawl=CC-MAIN-2018-47",
"warc_metadata": {
"Content-Length": "15284",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IESTAE2SJ64DFNKDVOGL4EWRIKLCF46V",
"WARC-Concurrent-To": "<urn:uuid:7bbce93a-ae3c-4715-9eb3-c19402109a54>",
"WARC-Date": "2018-11-14T12:10:01Z",
"WARC-IP-Address": "45.79.142.221",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NDRCD4GE2YPHGVO6JRVL3KGJ5BLMLG5A",
"WARC-Record-ID": "<urn:uuid:e3f4fbd1-7e5f-4b75-a274-f312318bb70e>",
"WARC-Target-URI": "http://www.steptools.com/stds/ifc/html/t_ifcbooleanresult.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:731ca10a-2f4b-44de-ae31-00d4baf88beb>"
},
"warc_info": "isPartOf: CC-MAIN-2018-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-225-196-75.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,
24,
25,
44,
68,
89,
121,
167,
199,
234,
270,
278,
324,
331,
380,
392,
393,
413,
414,
497,
521,
572,
628,
685,
686,
705,
706,
788,
812,
860,
861,
880,
881,
963,
987,
1071,
1135,
1136,
1147,
1148,
1212,
1236,
1271,
1272,
1281,
1282,
1334,
1364,
1387,
1388,
1402,
1403,
1491,
1523,
1580,
1628,
1681,
1725,
1768,
1823,
1869,
1923,
1968,
2035,
2093,
2141,
2198,
2236,
2296,
2347,
2396,
2454,
2510,
2555,
2616,
2668,
2713,
2767,
2832,
2888,
2936,
2997,
3057,
3108,
3170,
3223,
3273,
3332,
3392,
3436,
3494,
3561,
3614,
3676,
3739,
3800,
3852,
3906,
3951,
3952,
3953,
3984,
3985,
4036
],
"line_end_idx": [
24,
25,
44,
68,
89,
121,
167,
199,
234,
270,
278,
324,
331,
380,
392,
393,
413,
414,
497,
521,
572,
628,
685,
686,
705,
706,
788,
812,
860,
861,
880,
881,
963,
987,
1071,
1135,
1136,
1147,
1148,
1212,
1236,
1271,
1272,
1281,
1282,
1334,
1364,
1387,
1388,
1402,
1403,
1491,
1523,
1580,
1628,
1681,
1725,
1768,
1823,
1869,
1923,
1968,
2035,
2093,
2141,
2198,
2236,
2296,
2347,
2396,
2454,
2510,
2555,
2616,
2668,
2713,
2767,
2832,
2888,
2936,
2997,
3057,
3108,
3170,
3223,
3273,
3332,
3392,
3436,
3494,
3561,
3614,
3676,
3739,
3800,
3852,
3906,
3951,
3952,
3953,
3984,
3985,
4036,
4061
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4061,
"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.07647059112787247,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.2029411792755127,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1823529452085495,
"rps_doc_frac_unique_words": 0.34944239258766174,
"rps_doc_mean_word_length": 13.498141288757324,
"rps_doc_num_sentences": 4,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.8788788318634033,
"rps_doc_word_count": 269,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06306803226470947,
"rps_doc_frac_chars_dupe_6grams": 0.0528779998421669,
"rps_doc_frac_chars_dupe_7grams": 0.0528779998421669,
"rps_doc_frac_chars_dupe_8grams": 0.0528779998421669,
"rps_doc_frac_chars_dupe_9grams": 0.0528779998421669,
"rps_doc_frac_chars_top_2gram": 0.11181493103504181,
"rps_doc_frac_chars_top_3gram": 0.027540620416402817,
"rps_doc_frac_chars_top_4gram": 0.03084550052881241,
"rps_doc_books_importance": -181.22662353515625,
"rps_doc_books_importance_length_correction": -181.22662353515625,
"rps_doc_openwebtext_importance": -82.67943572998047,
"rps_doc_openwebtext_importance_length_correction": -82.67943572998047,
"rps_doc_wikipedia_importance": -51.29214096069336,
"rps_doc_wikipedia_importance_length_correction": -51.29214096069336
},
"fasttext": {
"dclm": 0.8732571005821228,
"english": 0.42207804322242737,
"fineweb_edu_approx": 1.919861078262329,
"eai_general_math": 0.34994328022003174,
"eai_open_web_math": 0.03673034906387329,
"eai_web_code": 0.17232400178909302
}
}
|
{
"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": "620.00151",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,295,254,061,392,953,000 |
Stack Overflow is a community of 4.7 million programmers, just like you, helping each other.
Join them; it only takes a minute:
Sign up
Join the Stack Overflow community to:
1. Ask programming questions
2. Answer and help your peers
3. Get recognized for your expertise
I am trying to call a PageMethod using jQuery like this:
[WebMethod]
public stataic string WebMethod(PostData data)
{
//DO WORK
return "a";
}
PostData class is as follows:
public class PostData
{
public string Guid{get;set;}
public string Action{get;set;}
public string Id{get;set;}
}
I'm calling method from jQuery like this:
$.ajax({
type="POST",
url: 'url',
data: JSON.stringify(b),
contentType: "application/json;charset=utf-8",
dataType: "json",
success: function (msg) {
var t = $(c).html();
$(c).html(t + "<br/>" + $.evalJSON(msg.d));
},
error: function (x, y) {
var t = $(c).html();
$(c).html(t + "<br/>" + $.evalJSON(x.responseText).Message);
}
});
where b is like: {"PostData":{"Guid":"b61dce32-690b-4409-b51a-a6012462e54e","Action":"Testing","Id":"3"}}
I'm getting this error:
Invalid web service call, missing value for parameter: 'data'.
If I don't call JSON.stringyfy then I get this error:
Invalid JSON primitive: PostData.
I have tried this also {"Guid":"b61dce32-690b-4409-b51a-a6012462e54e","Action":"Testing","Id":"3"} but still get either
Invalid JSON primitive 'Guid'
or
Invalid web service call, missing value for parameter: 'data'.
depending on if I call JSON.stringify or not.
I have also tried,
[WebMethod]
public static string WebMethod(string data)
but got no where.
share|improve this question
up vote 2 down vote accepted
The first layered object names in the JSON should be the same names as your webservice arguments names.
{"data": {"Guid":"b61dce32-690b-4409-b51a-a6012462e54e","Action":"Testing","Id":"3"} }
share|improve this answer
yep, I knew I'm doing something silly but was not able to nail it. Thanks @jerone. – TheVillageIdiot Feb 10 '11 at 8:22
Thank You! I can't tell you how long I hunted around to see why I was getting a "500" error on my jquery.post. I never even thought of having to name my WebMethod argument inside the JSON I was sending from the client. – dagilleland Jun 30 '12 at 1:05
Try this,
var params = {"PostData":{"Guid":"b61dce32-690b-4409-b51a-a6012462e54e","Action":"Testing","Id":"3"}};
var yourdata = jQuery.param(params);
pass
yourdata
as your data instead of JSON.stringify(b).
share|improve this answer
nope @Furqan jQuery.param converts it into encoded string. I actually needed data: as the object name. – TheVillageIdiot Feb 10 '11 at 8:45
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/4954628/pagemethods-jquery-and-json",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2016-07",
"warc_metadata": {
"Content-Length": "79659",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:S2LGQKZWH55FBXBIC5IDILOZLA4FKFHA",
"WARC-Concurrent-To": "<urn:uuid:ba9befb1-07f9-475b-8a55-f70785eaab1c>",
"WARC-Date": "2016-02-06T14:39:31Z",
"WARC-IP-Address": "104.16.37.249",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:CKD6VG4IAMEMYBGG4EBYLCZFX5KWVNGB",
"WARC-Record-ID": "<urn:uuid:f7f7d750-0809-469a-9343-1cde8e36498e>",
"WARC-Target-URI": "http://stackoverflow.com/questions/4954628/pagemethods-jquery-and-json",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d173d6fa-5bde-47f7-805e-ac0bca160bb9>"
},
"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,
93,
94,
129,
130,
138,
176,
207,
239,
278,
279,
336,
337,
349,
396,
398,
412,
428,
430,
431,
461,
462,
484,
486,
519,
554,
585,
587,
588,
630,
631,
640,
657,
673,
702,
753,
775,
805,
834,
886,
893,
922,
951,
1020,
1026,
1030,
1031,
1137,
1138,
1162,
1163,
1226,
1227,
1281,
1282,
1316,
1317,
1437,
1438,
1468,
1469,
1472,
1473,
1536,
1537,
1583,
1584,
1603,
1604,
1617,
1662,
1663,
1681,
1682,
1710,
1739,
1740,
1844,
1845,
1932,
1958,
1963,
2083,
2088,
2340,
2341,
2351,
2352,
2463,
2508,
2509,
2514,
2515,
2524,
2525,
2568,
2569,
2595,
2600,
2740,
2741,
2753,
2754,
2756,
2764,
2765,
2843,
2844
],
"line_end_idx": [
93,
94,
129,
130,
138,
176,
207,
239,
278,
279,
336,
337,
349,
396,
398,
412,
428,
430,
431,
461,
462,
484,
486,
519,
554,
585,
587,
588,
630,
631,
640,
657,
673,
702,
753,
775,
805,
834,
886,
893,
922,
951,
1020,
1026,
1030,
1031,
1137,
1138,
1162,
1163,
1226,
1227,
1281,
1282,
1316,
1317,
1437,
1438,
1468,
1469,
1472,
1473,
1536,
1537,
1583,
1584,
1603,
1604,
1617,
1662,
1663,
1681,
1682,
1710,
1739,
1740,
1844,
1845,
1932,
1958,
1963,
2083,
2088,
2340,
2341,
2351,
2352,
2463,
2508,
2509,
2514,
2515,
2524,
2525,
2568,
2569,
2595,
2600,
2740,
2741,
2753,
2754,
2756,
2764,
2765,
2843,
2844,
2934
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2934,
"ccnet_original_nlines": 107,
"rps_doc_curly_bracket": 0.010224949568510056,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24408283829689026,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03994083032011986,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3624260425567627,
"rps_doc_frac_unique_words": 0.546419084072113,
"rps_doc_mean_word_length": 5.46419095993042,
"rps_doc_num_sentences": 39,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.069934844970703,
"rps_doc_word_count": 377,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08834951370954514,
"rps_doc_frac_chars_dupe_6grams": 0.0718446597456932,
"rps_doc_frac_chars_dupe_7grams": 0.047572821378707886,
"rps_doc_frac_chars_dupe_8grams": 0.047572821378707886,
"rps_doc_frac_chars_dupe_9grams": 0.047572821378707886,
"rps_doc_frac_chars_top_2gram": 0.017475729808211327,
"rps_doc_frac_chars_top_3gram": 0.013592230156064034,
"rps_doc_frac_chars_top_4gram": 0.01456310972571373,
"rps_doc_books_importance": -247.65658569335938,
"rps_doc_books_importance_length_correction": -247.65658569335938,
"rps_doc_openwebtext_importance": -108.55705261230469,
"rps_doc_openwebtext_importance_length_correction": -108.55705261230469,
"rps_doc_wikipedia_importance": -102.78755950927734,
"rps_doc_wikipedia_importance_length_correction": -102.78755950927734
},
"fasttext": {
"dclm": 0.4904966950416565,
"english": 0.7455583810806274,
"fineweb_edu_approx": 1.4400110244750977,
"eai_general_math": 0.0002739999908953905,
"eai_open_web_math": 0.12228882312774658,
"eai_web_code": 0.0003385499876458198
}
}
|
{
"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": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,437,113,732,177,007,000 |
Method: organizations.endpointAttachments.get
Gets the endpoint attachment.
HTTP request
GET https://apigee.googleapis.com/v1/{name=organizations/*/endpointAttachments/*}
The URL uses gRPC Transcoding syntax.
Path parameters
Parameters
name
string
Required. Name of the endpoint attachment. Use the following structure in your request: organizations/{org}/endpointAttachments/{endpointAttachment}
Authorization requires the following IAM permission on the specified resource name:
• apigee.endpointattachments.get
Request body
The request body must be empty.
Response body
If successful, the response body contains an instance of EndpointAttachment.
Authorization Scopes
Requires the following OAuth scope:
• https://www.googleapis.com/auth/cloud-platform
|
{
"url": "https://cloud.google.com/apigee/docs/reference/apis/apigee/rest/v1/organizations.endpointAttachments/get",
"source_domain": "cloud.google.com",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "900104",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SNBDKMYAYT3EGD7T7NPQHJNKNBNYB2BJ",
"WARC-Concurrent-To": "<urn:uuid:b34a36b2-c84b-4170-86bd-07cb1cc7358e>",
"WARC-Date": "2022-08-13T16:36:23Z",
"WARC-IP-Address": "172.217.15.110",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VH3MOGOCJIQQTT6YXCJXQ4ACXC7LGLJI",
"WARC-Record-ID": "<urn:uuid:c4328358-3635-42b0-83fa-f20734ab3b4f>",
"WARC-Target-URI": "https://cloud.google.com/apigee/docs/reference/apis/apigee/rest/v1/organizations.endpointAttachments/get",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f946f309-84be-4481-901c-0ef63ee6270a>"
},
"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-65\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,
46,
47,
77,
78,
91,
92,
174,
175,
213,
214,
230,
231,
242,
247,
248,
255,
256,
405,
406,
490,
491,
526,
527,
540,
541,
573,
574,
588,
589,
666,
667,
688,
689,
725,
726
],
"line_end_idx": [
46,
47,
77,
78,
91,
92,
174,
175,
213,
214,
230,
231,
242,
247,
248,
255,
256,
405,
406,
490,
491,
526,
527,
540,
541,
573,
574,
588,
589,
666,
667,
688,
689,
725,
726,
776
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 776,
"ccnet_original_nlines": 35,
"rps_doc_curly_bracket": 0.007731960155069828,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2153846174478531,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03076923079788685,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26923078298568726,
"rps_doc_frac_unique_words": 0.6623376607894897,
"rps_doc_mean_word_length": 8.233766555786133,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.7133195400238037,
"rps_doc_word_count": 77,
"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.05678233131766319,
"rps_doc_frac_chars_top_3gram": 0.06624606251716614,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -62.899009704589844,
"rps_doc_books_importance_length_correction": -62.899009704589844,
"rps_doc_openwebtext_importance": -37.85927963256836,
"rps_doc_openwebtext_importance_length_correction": -37.859275817871094,
"rps_doc_wikipedia_importance": -31.807165145874023,
"rps_doc_wikipedia_importance_length_correction": -31.807165145874023
},
"fasttext": {
"dclm": 0.9049474596977234,
"english": 0.6151029467582703,
"fineweb_edu_approx": 3.3071436882019043,
"eai_general_math": 0.02410667948424816,
"eai_open_web_math": 0.056477610021829605,
"eai_web_code": 0.15033674240112305
}
}
|
{
"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": "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": "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": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,267,266,190,475,250,700 |
A collation is a set of rules that determine how data is sorted and compared for comparing characters in a character set.
learn more… | top users | synonyms
2
votes
1answer
214 views
How to create Postgres DB with case insensitive collation
I am using the postgres version 9.4.1 64-bit on windows 7 64-bit. I need to create DB with the setting "case sensitive = OFF" but couldn't make this work. I refereed already many question on SO and ...
2
votes
1answer
80 views
Should I use utf8_unicode_ci or utf8_slovak_ci?
I was using utf8_slovak_ci collation until now, but I read that utf8_unicode_ci sorts very wide range of languages. Does it mean, I do not need to use separate collation for every language and I can ...
0
votes
1answer
52 views
Removing per column and table collation and charset
I recently completed a transition of a database from CHARSET=utf8 COLLATE=latin1 to CHARSET=utf8mb4 COLLATE=utf8mb4_unicode_ci. During the process tables were migrated one at a time by altering their ...
0
votes
1answer
1k views
How to convert a MySQL database from utf8mb4 to utf8?
I would like to convert a MySQL database, which has utf8mb4 character set and utf8mb4_unicode_ci collation, to utf8 and utf8_unicode_ci. How to do that please? Thank you in advance for your ...
0
votes
1answer
81 views
How can I find duplicate key violations in a different collation?
I have a MySQL table that has the collation for one of its varchar columns in the primary key set to utf8_general_ci. I want to change the collation to utf8_unicode_ci so it stops treating "gmail.com" ...
0
votes
1answer
133 views
Implicitly (or proxy) convert to Nvarchar on incoming queries from legacy or 3rd party applications
We have a 3rd party application of which we don't have the source code. This application executes queries on our database without using the "N" prefix before literal strings. It does this in inserts ...
-1
votes
1answer
40 views
converting mysql datebase
I have a question about converting mysql databases, I doing now new site, and want to use my old database, which is in latin_swedish_1 colacolation I want to convert this old database into ...
5
votes
0answers
128 views
Why is my PostgreSQL ORDER BY case-insensitive?
I have Postgres 9.4.4 running on Debian and I get the following ORDER BY behavior: veure_test=# show LC_COLLATE; lc_collate ------------- en_US.UTF-8 (1 row) veure_test=# SELECT ...
3
votes
0answers
198 views
utf8mb4 in SQL Server Express
We have some web applications based on databases using utf8mb4 as character set and utf8mb4_Standard as collation. We saw that we can use any character we want with this setting. In SQL Server ...
2
votes
0answers
51 views
Performance Implications of Explicit Collation Conversions across Linked Servers
I locally host host databases from two vendors on two different SQL instances, but on the same network. These servers frequently communicate with each other (through joins and whatnot), so we have ...
2
votes
0answers
155 views
Avoiding Functions() in the Where clause
Okay, while analyzing queries against a SQL Server 2008 R2 database, I happened upon the following query: (@p__linq__0 nvarchar(4000)) SELECT TOP (1) [Extent1].[OrderSOId] AS [OrderSOId], [Extent1] ...
1
vote
0answers
75 views
SQL Server 2008 R2 SP2 Execution Plan not getting missing index suggestions
I have several SQL Server 2008 R2 SP2 that have server collation Latin1_General_BIN. These instances will not give me the missing index suggestion with performing an execution plan. I have other ...
1
vote
0answers
62 views
Speed up changing of collation?
I'm trying to change collation on all our databases, and doing it on one of the databases (~15gb) took me 42 minutes in testing even though I put it on SSD disc. Do anyone know any way to speed it up? ...
1
vote
0answers
198 views
mysql/mariadb: ifnull changes collation
It seems that 'ifnull' changes the default collation that is set to be used. I have tried on both mysql and mariadb: Server version: 5.5.34-MariaDB-1~precise-log mariadb.org binary distribution ...
1
vote
0answers
764 views
SQL Server: Collation of the resource database
I'm trying to use stopwords so that some words are skipped by the Full-Text Indexer. I can add those stopwords in the table sys.fulltext_stopwords. When trying to get a list of stopwords and ...
1
vote
0answers
121 views
What would make a MySQL database create tables in a different collation other than its default?
I am adding tables to a Wordpress database on my localhost and it is changing my collation from utf8_general_ci to latin1_swedish_ci. I'm kinda stumped because I'm not familiar with working directly ...
1
vote
0answers
470 views
Why not use SQL_Latin1_General_CI_AS for a global system?
What would be some really good reasons to not use the SQL_Latin1_General_CI_AS collation on a system which handles English, German, Japanese, and Chinese data? I'm having a really hard time finding ...
0
votes
0answers
11 views
Firebird 2.5 - difference between starting with and = (equal) string searches
Background I have DB that was created on Windows, FB 2.5.0 (long ago). It was subsequently upgraded, over the years, to 2.5.4. Yesterday I wanted to test it on Ubuntu, which has FB 2.5.2 maintained ...
0
votes
0answers
27 views
Where can I find exact rules of a collation?
Is there any documentation anywhere for the exact sorting/equality rules defined by a collation in Windows (SQL Server), for instance "Finnish_Swedish_CI_AS"? I know about CI/CS, AI/AS etc, but I'm ...
0
votes
0answers
20 views
mysql collation-server not respected
I've configured my server (5.5.41) with: character-set-server = utf8 collation-server = ...
|
{
"url": "http://dba.stackexchange.com/questions/tagged/collation?sort=unanswered&pagesize=15",
"source_domain": "dba.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2015-35",
"warc_metadata": {
"Content-Length": "96578",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MPENUF3UVNKJSQIEL6ODVL2UXRZFCRLH",
"WARC-Concurrent-To": "<urn:uuid:8ffb877c-28d8-4be1-8be2-07f8a71adda1>",
"WARC-Date": "2015-09-02T00:30:58Z",
"WARC-IP-Address": "104.16.13.128",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:F7A5SBUVR3Q5IXQ7FAMENSQF5PNDPI6V",
"WARC-Record-ID": "<urn:uuid:0b08dbe6-d32b-44ec-b592-68b4e9d57c5b>",
"WARC-Target-URI": "http://dba.stackexchange.com/questions/tagged/collation?sort=unanswered&pagesize=15",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3c61cbfa-369f-4be6-8b1a-149a05f28540>"
},
"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,
122,
123,
158,
159,
161,
167,
175,
185,
186,
244,
245,
447,
449,
455,
463,
472,
473,
521,
522,
725,
727,
733,
741,
750,
751,
803,
804,
1008,
1010,
1016,
1024,
1033,
1034,
1088,
1089,
1283,
1285,
1291,
1299,
1308,
1309,
1375,
1376,
1581,
1583,
1589,
1597,
1607,
1608,
1708,
1709,
1912,
1915,
1921,
1929,
1938,
1939,
1965,
1966,
2159,
2161,
2167,
2176,
2186,
2187,
2235,
2236,
2418,
2420,
2426,
2435,
2445,
2446,
2476,
2477,
2674,
2676,
2682,
2691,
2700,
2701,
2782,
2783,
2984,
2986,
2992,
3001,
3011,
3012,
3053,
3054,
3256,
3258,
3263,
3272,
3281,
3282,
3358,
3359,
3558,
3560,
3565,
3574,
3583,
3584,
3616,
3617,
3822,
3824,
3829,
3838,
3848,
3849,
3889,
3890,
4088,
4090,
4095,
4104,
4114,
4115,
4162,
4163,
4358,
4360,
4365,
4374,
4384,
4385,
4481,
4482,
4685,
4687,
4692,
4701,
4711,
4712,
4770,
4771,
4973,
4975,
4981,
4990,
4999,
5000,
5078,
5079,
5281,
5283,
5289,
5298,
5307,
5308,
5353,
5354,
5556,
5558,
5564,
5573,
5582,
5583,
5620,
5621
],
"line_end_idx": [
122,
123,
158,
159,
161,
167,
175,
185,
186,
244,
245,
447,
449,
455,
463,
472,
473,
521,
522,
725,
727,
733,
741,
750,
751,
803,
804,
1008,
1010,
1016,
1024,
1033,
1034,
1088,
1089,
1283,
1285,
1291,
1299,
1308,
1309,
1375,
1376,
1581,
1583,
1589,
1597,
1607,
1608,
1708,
1709,
1912,
1915,
1921,
1929,
1938,
1939,
1965,
1966,
2159,
2161,
2167,
2176,
2186,
2187,
2235,
2236,
2418,
2420,
2426,
2435,
2445,
2446,
2476,
2477,
2674,
2676,
2682,
2691,
2700,
2701,
2782,
2783,
2984,
2986,
2992,
3001,
3011,
3012,
3053,
3054,
3256,
3258,
3263,
3272,
3281,
3282,
3358,
3359,
3558,
3560,
3565,
3574,
3583,
3584,
3616,
3617,
3822,
3824,
3829,
3838,
3848,
3849,
3889,
3890,
4088,
4090,
4095,
4104,
4114,
4115,
4162,
4163,
4358,
4360,
4365,
4374,
4384,
4385,
4481,
4482,
4685,
4687,
4692,
4701,
4711,
4712,
4770,
4771,
4973,
4975,
4981,
4990,
4999,
5000,
5078,
5079,
5281,
5283,
5289,
5298,
5307,
5308,
5353,
5354,
5556,
5558,
5564,
5573,
5582,
5583,
5620,
5621,
5712
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5712,
"ccnet_original_nlines": 163,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3198238015174866,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06872247159481049,
"rps_doc_frac_lines_end_with_ellipsis": 0.12195122241973877,
"rps_doc_frac_no_alph_words": 0.22290748357772827,
"rps_doc_frac_unique_words": 0.4309392273426056,
"rps_doc_mean_word_length": 4.913812160491943,
"rps_doc_num_sentences": 72,
"rps_doc_symbol_to_word_ratio": 0.020264320075511932,
"rps_doc_unigram_entropy": 5.410335540771484,
"rps_doc_word_count": 905,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.01843939907848835,
"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.018889140337705612,
"rps_doc_frac_chars_top_3gram": 0.01753990910947323,
"rps_doc_frac_chars_top_4gram": 0.01011918019503355,
"rps_doc_books_importance": -537.1436767578125,
"rps_doc_books_importance_length_correction": -537.1436767578125,
"rps_doc_openwebtext_importance": -315.36578369140625,
"rps_doc_openwebtext_importance_length_correction": -315.36578369140625,
"rps_doc_wikipedia_importance": -221.1646728515625,
"rps_doc_wikipedia_importance_length_correction": -221.1646728515625
},
"fasttext": {
"dclm": 0.12048537284135818,
"english": 0.9067484736442566,
"fineweb_edu_approx": 1.2009215354919434,
"eai_general_math": 0.007048130035400391,
"eai_open_web_math": 0.22336673736572266,
"eai_web_code": 0.00462896004319191
}
}
|
{
"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": "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": "-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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,451,014,459,190,510,000 |
Solved
How to redeclare SELECT statement for not delaying in million records database
Posted on 2006-06-20
6
170 Views
Last Modified: 2011-10-03
Hi!
I have a 3 million records sql server table. I need to deduplicate based in a certain group of fields.
I've already made an application in vb to do so. The way I do it is:
1. Open a recordset with this statement:
SELECT TOP 1000 * FROM NACIMIENTO AS TABLA1 WHERE EXISTS (SELECT MUN_OFI, NOMBRE, PRIMER_AP, SEGUNDO_AP, NOMBRE_MADRE, PRIMER_AP_MADRE, SEGUNDO_AP_MADRE, NOMBRE_ABAM, PRIMER_AP_ABAM, SEGUNDO_AP_ABAM, COUNT(*) FROM NACIMIENTO AS TABLA2 WHERE [TABLA1].[MUN_OFI]=[TABLA2].[MUN_OFI] AND [TABLA1].[NOMBRE]=[TABLA2].[NOMBRE] AND [TABLA1].[PRIMER_AP]=[TABLA2].[PRIMER_AP] AND [TABLA1].[SEGUNDO_AP]=[TABLA2].[SEGUNDO_AP] AND [TABLA1].[NOMBRE_MADRE]=[TABLA2].[NOMBRE_MADRE] AND [TABLA1].[PRIMER_AP_MADRE]=[TABLA2].[PRIMER_AP_MADRE] AND [TABLA1].[SEGUNDO_AP_MADRE]=[TABLA2].[SEGUNDO_AP_MADRE] AND [TABLA1].[NOMBRE_ABAM]=[TABLA2].[NOMBRE_ABAM] AND [TABLA1].[PRIMER_AP_ABAM]=[TABLA2].[PRIMER_AP_ABAM] AND [TABLA1].[SEGUNDO_AP_ABAM]=[TABLA2].[SEGUNDO_AP_ABAM] GROUP BY MUN_OFI, NOMBRE, PRIMER_AP, SEGUNDO_AP, NOMBRE_MADRE, PRIMER_AP_MADRE, SEGUNDO_AP_MADRE, NOMBRE_ABAM, PRIMER_AP_ABAM, SEGUNDO_AP_ABAM HAVING COUNT(*) > 1) ORDER BY MUN_OFI, NOMBRE, PRIMER_AP, SEGUNDO_AP, NOMBRE_MADRE, PRIMER_AP_MADRE, SEGUNDO_AP_MADRE, NOMBRE_ABAM, PRIMER_AP_ABAM, SEGUNDO_AP_ABAM**
** I used the TOP clause in order to get it run, since when I didn't use it the application just hanged on... But it keeps on hanging! And I tried to run this query on query analyzer but it doesn't function
2. When I can get the recordset opened (with tables of less than 300K records) I then move between the records looking for the duplicates (there can be 2, 3 or more duplicated records for each one). I apply a certain group of criteria in order to select the record to be kept.
3. Then I create a DeletedTable table and copy the duplicated records.
4. When this has been done I make a DELETE FROM Table WHERE EXISTS (SELECT * FROM DELETEDTABLE WHERE DELETEDTABLE.KEY1 = TABLE.KEY1 ...) I have around 6 key fields but only one of this is usually used to deduplicate on.
The question is, is there any way to optimize the sql mentioned in 1)
Or some other way to detect duplicated records with this kind of data?
The fields I'm deduplicated on are all text fields.
Any help will be greatly appreciated
0
Comment
Question by:bethzycb
[X]
Welcome to Experts Exchange
Add your voice to the tech community where 5M+ people just like you are talking about what matters.
• Help others & share knowledge
• Earn cash & points
• Learn & ask questions
• 2
6 Comments
LVL 28
Expert Comment
by:imran_fast
ID: 16949113
/*
This is the best way to find duplicate records delete it
You don't need to put the records in temporary table to delete them */
delete from NACIMIENTO
where keyfield not in
(
select min(A.keyfield) from NACIMIENTO A
inner join
(SELECT MUN_OFI, NOMBRE, PRIMER_AP, SEGUNDO_AP,
NOMBRE_MADRE, PRIMER_AP_MADRE, SEGUNDO_AP_MADRE,
NOMBRE_ABAM, PRIMER_AP_ABAM, SEGUNDO_AP_ABAM, COUNT(*)
FROM NACIMIENTO
GROUP BY MUN_OFI, NOMBRE, PRIMER_AP, SEGUNDO_AP, NOMBRE_MADRE,
PRIMER_AP_MADRE, SEGUNDO_AP_MADRE, NOMBRE_ABAM, PRIMER_AP_ABAM,
SEGUNDO_AP_ABAM HAVING COUNT(*) > 1) B
ON
A.MUN_OFI=B.MUN_OFI AND
A.NOMBRE = B.NOMBRE AND
A.PRIMER_AP =B.PRIMER_AP AND
A.SEGUNDO_AP = B.SEGUNDO_AP AND
A.NOMBRE_MADRE = B.NOMBRE_MADRE AND
A.PRIMER_AP_MADRE = B.PRIMER_AP_MADRE AND
A.SEGUNDO_AP_MADRE = B.SEGUNDO_AP_MADRE AND
A.NOMBRE_ABAM = B.NOMBRE_ABAM AND
A.PRIMER_AP_ABAM = B.PRIMER_AP_ABAM AND
A.SEGUNDO_AP_ABAM =B.SEGUNDO_AP_ABAM
GROUP BY A.MUN_OFI, A.NOMBRE, A.PRIMER_AP, A.SEGUNDO_AP, A.NOMBRE_MADRE,
A.PRIMER_AP_MADRE, A.SEGUNDO_AP_MADRE, A.NOMBRE_ABAM, A.PRIMER_AP_ABAM,
A.SEGUNDO_AP_ABAM
)
0
Author Comment
by:bethzycb
ID: 16954609
The problem is I have to keep a copy of the deleted records.
And what happen to the recordset if while I'm looping it I delete some of the records? Does the absoluteposition of them modify?
0
LVL 28
Accepted Solution
by:
imran_fast earned 500 total points
ID: 16977591
>>what happen to the recordset if while I'm looping it I delete some of the records?
In the above there is no looping it is not a recordset it is direct delete stmt.
if you want to keep copy than you have to execute two statements
first to record duplicate rows
===================
select * Into YourbackupTable from NACIMIENTO
where keyfield not in
(
select min(A.keyfield) from NACIMIENTO A
inner join
(SELECT MUN_OFI, NOMBRE, PRIMER_AP, SEGUNDO_AP,
NOMBRE_MADRE, PRIMER_AP_MADRE, SEGUNDO_AP_MADRE,
NOMBRE_ABAM, PRIMER_AP_ABAM, SEGUNDO_AP_ABAM, COUNT(*)
FROM NACIMIENTO
GROUP BY MUN_OFI, NOMBRE, PRIMER_AP, SEGUNDO_AP, NOMBRE_MADRE,
PRIMER_AP_MADRE, SEGUNDO_AP_MADRE, NOMBRE_ABAM, PRIMER_AP_ABAM,
SEGUNDO_AP_ABAM HAVING COUNT(*) > 1) B
ON
A.MUN_OFI=B.MUN_OFI AND
A.NOMBRE = B.NOMBRE AND
A.PRIMER_AP =B.PRIMER_AP AND
A.SEGUNDO_AP = B.SEGUNDO_AP AND
A.NOMBRE_MADRE = B.NOMBRE_MADRE AND
A.PRIMER_AP_MADRE = B.PRIMER_AP_MADRE AND
A.SEGUNDO_AP_MADRE = B.SEGUNDO_AP_MADRE AND
A.NOMBRE_ABAM = B.NOMBRE_ABAM AND
A.PRIMER_AP_ABAM = B.PRIMER_AP_ABAM AND
A.SEGUNDO_AP_ABAM =B.SEGUNDO_AP_ABAM
GROUP BY A.MUN_OFI, A.NOMBRE, A.PRIMER_AP, A.SEGUNDO_AP, A.NOMBRE_MADRE,
A.PRIMER_AP_MADRE, A.SEGUNDO_AP_MADRE, A.NOMBRE_ABAM, A.PRIMER_AP_ABAM,
A.SEGUNDO_AP_ABAM
)
then to delete them
==============
delete from NACIMIENTO
where keyfield not in
(
select min(A.keyfield) from NACIMIENTO A
inner join
(SELECT MUN_OFI, NOMBRE, PRIMER_AP, SEGUNDO_AP,
NOMBRE_MADRE, PRIMER_AP_MADRE, SEGUNDO_AP_MADRE,
NOMBRE_ABAM, PRIMER_AP_ABAM, SEGUNDO_AP_ABAM, COUNT(*)
FROM NACIMIENTO
GROUP BY MUN_OFI, NOMBRE, PRIMER_AP, SEGUNDO_AP, NOMBRE_MADRE,
PRIMER_AP_MADRE, SEGUNDO_AP_MADRE, NOMBRE_ABAM, PRIMER_AP_ABAM,
SEGUNDO_AP_ABAM HAVING COUNT(*) > 1) B
ON
A.MUN_OFI=B.MUN_OFI AND
A.NOMBRE = B.NOMBRE AND
A.PRIMER_AP =B.PRIMER_AP AND
A.SEGUNDO_AP = B.SEGUNDO_AP AND
A.NOMBRE_MADRE = B.NOMBRE_MADRE AND
A.PRIMER_AP_MADRE = B.PRIMER_AP_MADRE AND
A.SEGUNDO_AP_MADRE = B.SEGUNDO_AP_MADRE AND
A.NOMBRE_ABAM = B.NOMBRE_ABAM AND
A.PRIMER_AP_ABAM = B.PRIMER_AP_ABAM AND
A.SEGUNDO_AP_ABAM =B.SEGUNDO_AP_ABAM
GROUP BY A.MUN_OFI, A.NOMBRE, A.PRIMER_AP, A.SEGUNDO_AP, A.NOMBRE_MADRE,
A.PRIMER_AP_MADRE, A.SEGUNDO_AP_MADRE, A.NOMBRE_ABAM, A.PRIMER_AP_ABAM,
A.SEGUNDO_AP_ABAM
)
0
Featured Post
Guide to Performance: Optimization & Monitoring
Nowadays, monitoring is a mixture of tools, systems, and codes—making it a very complex process. And with this complexity, comes variables for failure. Get DZone’s new Guide to Performance to learn how to proactively find these variables and solve them before a disruption occurs.
Question has a verified solution.
If you are experiencing a similar issue, please ask a related question
Suggested Solutions
Why is this different from all of the other step by step guides? Because I make a living as a DBA and not as a writer and I lived through this experience. Defining the name: When I talk to people they say different names on this subject stuff l…
This article explains how to reset the password of the sa account on a Microsoft SQL Server. The steps in this article work in SQL 2005, 2008, 2008 R2, 2012, 2014 and 2016.
This video shows, step by step, how to configure Oracle Heterogeneous Services via the Generic Gateway Agent in order to make a connection from an Oracle session and access a remote SQL Server database table.
Viewers will learn how to use the UPDATE and DELETE statements to change or remove existing data from their tables. Make a table: Update a specific column given a specific row using the UPDATE statement: Remove a set of values using the DELETE s…
730 members asked questions and received personalized solutions in the past 7 days.
Join the community of 500,000 technology professionals and ask your questions.
Join & Ask a Question
|
{
"url": "https://www.experts-exchange.com/questions/21892873/How-to-redeclare-SELECT-statement-for-not-delaying-in-million-records-database.html",
"source_domain": "www.experts-exchange.com",
"snapshot_id": "crawl=CC-MAIN-2017-17",
"warc_metadata": {
"Content-Length": "149629",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IMWMBLQWVDJNR6C2SX4RW3PIENPHRK3C",
"WARC-Concurrent-To": "<urn:uuid:d6bb3996-aae8-4032-ae22-72dd568acce1>",
"WARC-Date": "2017-04-30T15:27:16Z",
"WARC-IP-Address": "104.20.168.10",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:WYRAJAYUIMICIECJWORRW2YKGOBUJ6UC",
"WARC-Record-ID": "<urn:uuid:ef596db3-6885-4d66-851e-45ca1db58a5d>",
"WARC-Target-URI": "https://www.experts-exchange.com/questions/21892873/How-to-redeclare-SELECT-statement-for-not-delaying-in-million-records-database.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6d0dd83a-af5f-434a-af7b-acda1755eea5>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-145-167-34.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-17\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 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,
7,
8,
87,
88,
109,
111,
121,
147,
151,
152,
255,
256,
325,
326,
367,
368,
1425,
1426,
1634,
1635,
1912,
1913,
1984,
1985,
2205,
2206,
2276,
2277,
2348,
2349,
2401,
2402,
2439,
2441,
2449,
2470,
2474,
2502,
2503,
2603,
2604,
2638,
2661,
2687,
2693,
2704,
2706,
2713,
2714,
2729,
2730,
2744,
2757,
2760,
2818,
2891,
2892,
2915,
2937,
2939,
2980,
2991,
3039,
3088,
3143,
3159,
3222,
3286,
3325,
3328,
3352,
3376,
3405,
3437,
3473,
3515,
3559,
3593,
3633,
3672,
3745,
3817,
3835,
3837,
3839,
3841,
3842,
3857,
3858,
3870,
3883,
3945,
3946,
4075,
4077,
4079,
4086,
4087,
4105,
4106,
4110,
4145,
4158,
4243,
4324,
4325,
4390,
4391,
4392,
4423,
4443,
4489,
4511,
4513,
4554,
4565,
4613,
4662,
4717,
4733,
4796,
4860,
4899,
4902,
4926,
4950,
4979,
5011,
5047,
5089,
5133,
5167,
5207,
5246,
5319,
5391,
5409,
5411,
5412,
5413,
5433,
5448,
5471,
5493,
5495,
5536,
5547,
5595,
5644,
5699,
5715,
5778,
5842,
5881,
5884,
5908,
5932,
5961,
5993,
6029,
6071,
6115,
6149,
6189,
6228,
6301,
6373,
6391,
6393,
6395,
6396,
6410,
6411,
6459,
6460,
6741,
6742,
6776,
6777,
6848,
6849,
6869,
6870,
7117,
7291,
7500,
7747,
7748,
7832,
7833,
7912,
7913
],
"line_end_idx": [
7,
8,
87,
88,
109,
111,
121,
147,
151,
152,
255,
256,
325,
326,
367,
368,
1425,
1426,
1634,
1635,
1912,
1913,
1984,
1985,
2205,
2206,
2276,
2277,
2348,
2349,
2401,
2402,
2439,
2441,
2449,
2470,
2474,
2502,
2503,
2603,
2604,
2638,
2661,
2687,
2693,
2704,
2706,
2713,
2714,
2729,
2730,
2744,
2757,
2760,
2818,
2891,
2892,
2915,
2937,
2939,
2980,
2991,
3039,
3088,
3143,
3159,
3222,
3286,
3325,
3328,
3352,
3376,
3405,
3437,
3473,
3515,
3559,
3593,
3633,
3672,
3745,
3817,
3835,
3837,
3839,
3841,
3842,
3857,
3858,
3870,
3883,
3945,
3946,
4075,
4077,
4079,
4086,
4087,
4105,
4106,
4110,
4145,
4158,
4243,
4324,
4325,
4390,
4391,
4392,
4423,
4443,
4489,
4511,
4513,
4554,
4565,
4613,
4662,
4717,
4733,
4796,
4860,
4899,
4902,
4926,
4950,
4979,
5011,
5047,
5089,
5133,
5167,
5207,
5246,
5319,
5391,
5409,
5411,
5412,
5413,
5433,
5448,
5471,
5493,
5495,
5536,
5547,
5595,
5644,
5699,
5715,
5778,
5842,
5881,
5884,
5908,
5932,
5961,
5993,
6029,
6071,
6115,
6149,
6189,
6228,
6301,
6373,
6391,
6393,
6395,
6396,
6410,
6411,
6459,
6460,
6741,
6742,
6776,
6777,
6848,
6849,
6869,
6870,
7117,
7291,
7500,
7747,
7748,
7832,
7833,
7912,
7913,
7934
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7934,
"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.21191222965717316,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.29341691732406616,
"rps_doc_frac_lines_end_with_ellipsis": 0.010362690314650536,
"rps_doc_frac_no_alph_words": 0.29467085003852844,
"rps_doc_frac_unique_words": 0.36097562313079834,
"rps_doc_mean_word_length": 5.852683067321777,
"rps_doc_num_sentences": 151,
"rps_doc_symbol_to_word_ratio": 0.0025078400503844023,
"rps_doc_unigram_entropy": 5.320351600646973,
"rps_doc_word_count": 1025,
"rps_doc_frac_chars_dupe_10grams": 0.4342390298843384,
"rps_doc_frac_chars_dupe_5grams": 0.4342390298843384,
"rps_doc_frac_chars_dupe_6grams": 0.4342390298843384,
"rps_doc_frac_chars_dupe_7grams": 0.4342390298843384,
"rps_doc_frac_chars_dupe_8grams": 0.4342390298843384,
"rps_doc_frac_chars_dupe_9grams": 0.4342390298843384,
"rps_doc_frac_chars_top_2gram": 0.02567094936966896,
"rps_doc_frac_chars_top_3gram": 0.03000500053167343,
"rps_doc_frac_chars_top_4gram": 0.04350724816322327,
"rps_doc_books_importance": -600.3970336914062,
"rps_doc_books_importance_length_correction": -600.3970336914062,
"rps_doc_openwebtext_importance": -436.99566650390625,
"rps_doc_openwebtext_importance_length_correction": -436.99566650390625,
"rps_doc_wikipedia_importance": -338.38726806640625,
"rps_doc_wikipedia_importance_length_correction": -338.38726806640625
},
"fasttext": {
"dclm": 0.1877375841140747,
"english": 0.7125608325004578,
"fineweb_edu_approx": 1.5277595520019531,
"eai_general_math": 0.11225063353776932,
"eai_open_web_math": 0.12866544723510742,
"eai_web_code": 0.06773679703474045
}
}
|
{
"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": "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": "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": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,144,496,304,744,210,000 |
Documentation Home
MySQL Enterprise Backup 4.0 User's Guide
Related Documentation Download this Manual
PDF (US Ltr) - 1.2Mb
PDF (A4) - 1.2Mb
HTML Download (TGZ) - 181.0Kb
HTML Download (Zip) - 206.8Kb
MySQL Enterprise Backup 4.0 User's Guide / ... / Grant MySQL Privileges to Backup Administrator
4.1.2 Grant MySQL Privileges to Backup Administrator
For most backup operations, the mysqlbackup command connects to the MySQL server using the credentials supplied with the --user and --password options. The specified user needs certain privileges. You can either create a new user with a minimal set of privileges, or use an administrative account such as root.
The minimum privileges for the MySQL user with which mysqlbackup connects to the server are:
• RELOAD on all databases and tables.
• CREATE, INSERT, DROP, and UPDATE on the tables mysql.backup_progress and mysql.backup_history, and also SELECT on mysql.backup_history.
• SUPER, to enable and disable logging, and to optimize locking in order to minimize disruption to database processing.
• REPLICATION CLIENT, to retrieve the binary log position, which is stored with the backup.
• PROCESS, to process DDL statements with the ALGORITHM = INPLACE clause.
To create a MySQL user (mysqlbackup in this example) and set the above-mentioned privileges for the user to connect from localhost, issue statements like the following from the mysql client program:
CREATE USER 'mysqlbackup'@'localhost' IDENTIFIED BY 'password';
GRANT RELOAD ON *.* TO 'mysqlbackup'@'localhost';
GRANT CREATE, INSERT, DROP, UPDATE ON mysql.backup_progress TO 'mysqlbackup'@'localhost';
GRANT CREATE, INSERT, SELECT, DROP, UPDATE ON mysql.backup_history TO 'mysqlbackup'@'localhost';
GRANT REPLICATION CLIENT ON *.* TO 'mysqlbackup'@'localhost';
GRANT SUPER ON *.* TO 'mysqlbackup'@'localhost';
GRANT PROCESS ON *.* TO 'mysqlbackup'@'localhost';
The following additional privileges are required for using specific features of MySQL Enterprise Backup:
Set those additional privileges if you are using the features that require them. To set all of them, issue a statement like the following from the mysql client program:
GRANT LOCK TABLES, SELECT, CREATE, DROP, FILE ON *.* TO 'mysqlbackup'@'localhost';
GRANT CREATE, INSERT, DROP, UPDATE ON mysql.backup_sbt_history TO 'mysqlbackup'@'localhost';
|
{
"url": "https://dev.mysql.com/doc/mysql-enterprise-backup/4.0/en/mysqlbackup.privileges.html",
"source_domain": "dev.mysql.com",
"snapshot_id": "crawl=CC-MAIN-2020-05",
"warc_metadata": {
"Content-Length": "60113",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5SEN4MUESWCLKYLJNBSYHHE5AQUFKKHW",
"WARC-Concurrent-To": "<urn:uuid:70bae9b7-dc3f-419f-8cd1-6a1bbb7d91dd>",
"WARC-Date": "2020-01-26T00:55:13Z",
"WARC-IP-Address": "137.254.60.11",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MGAOVDZPGN3BMWUG7EGOAOWAP6X7TL6N",
"WARC-Record-ID": "<urn:uuid:4de5bb0e-cd11-40b2-8c25-e2eccd117fbe>",
"WARC-Target-URI": "https://dev.mysql.com/doc/mysql-enterprise-backup/4.0/en/mysqlbackup.privileges.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5c384307-45b3-4284-9ba8-2208bd47c102>"
},
"warc_info": "isPartOf: CC-MAIN-2020-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-48.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,
19,
60,
103,
124,
141,
171,
201,
202,
203,
303,
304,
357,
358,
669,
670,
763,
764,
804,
805,
945,
946,
1068,
1069,
1163,
1164,
1240,
1241,
1440,
1441,
1505,
1555,
1645,
1742,
1804,
1853,
1904,
1905,
2010,
2011,
2180,
2181,
2264
],
"line_end_idx": [
19,
60,
103,
124,
141,
171,
201,
202,
203,
303,
304,
357,
358,
669,
670,
763,
764,
804,
805,
945,
946,
1068,
1069,
1163,
1164,
1240,
1241,
1440,
1441,
1505,
1555,
1645,
1742,
1804,
1853,
1904,
1905,
2010,
2011,
2180,
2181,
2264,
2356
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2356,
"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.21929824352264404,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.15789474546909332,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2785087823867798,
"rps_doc_frac_unique_words": 0.407523512840271,
"rps_doc_mean_word_length": 5.758620738983154,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0.0021929799113422632,
"rps_doc_unigram_entropy": 4.42476749420166,
"rps_doc_word_count": 319,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.2041371762752533,
"rps_doc_frac_chars_dupe_6grams": 0.18290691077709198,
"rps_doc_frac_chars_dupe_7grams": 0.10234077274799347,
"rps_doc_frac_chars_dupe_8grams": 0.10234077274799347,
"rps_doc_frac_chars_dupe_9grams": 0.05770277976989746,
"rps_doc_frac_chars_top_2gram": 0.09580837935209274,
"rps_doc_frac_chars_top_3gram": 0.08818726241588593,
"rps_doc_frac_chars_top_4gram": 0.0631464272737503,
"rps_doc_books_importance": -177.3855438232422,
"rps_doc_books_importance_length_correction": -177.3855438232422,
"rps_doc_openwebtext_importance": -107.32337188720703,
"rps_doc_openwebtext_importance_length_correction": -107.32337188720703,
"rps_doc_wikipedia_importance": -59.83642578125,
"rps_doc_wikipedia_importance_length_correction": -59.83642578125
},
"fasttext": {
"dclm": 0.04110550880432129,
"english": 0.7087530493736267,
"fineweb_edu_approx": 1.4200983047485352,
"eai_general_math": 0.06902694702148438,
"eai_open_web_math": 0.20498889684677124,
"eai_web_code": 0.07604861259460449
}
}
|
{
"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": "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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,452,295,859,600,884,700 |
AIM Finally Bites The Dust
AIM ends its long run and believe it or not, there was a time when it was the most popular chat service. Sure, most of the users were bots and the Spam was insane at times. My only question is “What took so long?”
In March of 2012, AOL declared it was killing AIM and canning the 40 employees that worked on the project. So…it’s just been limping along with no updates for the last five years? Those 40 employees must be proud because no one really noticed about the zero updates.
It is clear that Facebook Messenger completely killed off any real reason to keep using AIM. Will there be anything that will be missed? Maybe a few things…
1. The “Away Message” was a thing of art back when modems were king of the connection. Once broadband came into play you were “always logged in” so an away message was a way to troll your friends when you weren’t there.
2. The “ASL” reference (Age, Sex, Location) as the person you were chatting with was usually a complete stranger. Oh, and almost everyone lied about their ASL.
3. The sheer simplicity of AIM is what made non-AOL users use it.
4. Instead of asking for a person’s number, you’d get their AIM screen name.
For those marketers out there, in order to purchase XRumer, a Russian-made software program, the only way to purchase it was through AIM during a 15 minute window. Since the software was known a “black hat” it had a certain spy element to it.
AIM Instant Messanger
AIM Messanger Online
|
{
"url": "https://www.businessandleadership.com/technology/item/aim-finally-bites-the-dust/",
"source_domain": "www.businessandleadership.com",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "33153",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2KMJOFJFKBZFKXBS3MR2RLR5EOS4VG5U",
"WARC-Concurrent-To": "<urn:uuid:8d860873-e870-4673-9537-b34208f1fe39>",
"WARC-Date": "2017-10-21T01:10:59Z",
"WARC-IP-Address": "67.225.168.253",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:M7YBSVHAZB3XXCME65HTWDZNTXUTC6ON",
"WARC-Record-ID": "<urn:uuid:edaf7a8f-7cbd-4b57-8f3e-d0fd9dd023c0>",
"WARC-Target-URI": "https://www.businessandleadership.com/technology/item/aim-finally-bites-the-dust/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:df685d79-7c79-4c98-873c-34f86f2fd7ec>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-37-188-157.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-43\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for October 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,
27,
28,
243,
244,
511,
512,
669,
670,
892,
1054,
1122,
1201,
1202,
1445,
1446,
1468
],
"line_end_idx": [
27,
28,
243,
244,
511,
512,
669,
670,
892,
1054,
1122,
1201,
1202,
1445,
1446,
1468,
1488
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1488,
"ccnet_original_nlines": 16,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4525993764400482,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03975535184144974,
"rps_doc_frac_lines_end_with_ellipsis": 0.05882352963089943,
"rps_doc_frac_no_alph_words": 0.17431193590164185,
"rps_doc_frac_unique_words": 0.6531365513801575,
"rps_doc_mean_word_length": 4.313652992248535,
"rps_doc_num_sentences": 21,
"rps_doc_symbol_to_word_ratio": 0.006116210017353296,
"rps_doc_unigram_entropy": 4.864134311676025,
"rps_doc_word_count": 271,
"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.01026517990976572,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -135.4796600341797,
"rps_doc_books_importance_length_correction": -127.54121398925781,
"rps_doc_openwebtext_importance": -93.79695129394531,
"rps_doc_openwebtext_importance_length_correction": -93.79695129394531,
"rps_doc_wikipedia_importance": -59.63658905029297,
"rps_doc_wikipedia_importance_length_correction": -48.43063735961914
},
"fasttext": {
"dclm": 0.7035555839538574,
"english": 0.9822152256965637,
"fineweb_edu_approx": 1.514919400215149,
"eai_general_math": 0.14316177368164062,
"eai_open_web_math": 0.20797878503799438,
"eai_web_code": 0.016923250630497932
}
}
|
{
"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": "302.22",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social psychology"
}
}
},
"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": "1",
"label": "News/Editorial"
},
"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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,371,778,574,564,414,500 |
Not a Member Yet,
Click here to Register
How do you like the new design?
ID: 114
Viewed: 7806
Added: Apr 08, 2002
Version:
Snippet uploaded by: snippet
Written By: snippet
Demo: Sorry, no demo
User Rated at: 0 Stars
Rate This:
Thank you for your vote. Please wait...
It appears you already voted for this snippet
It appears your vote value was empty
A basic cookie script that writes a cookie and deletes a cookie based on the user who logs in or out. It checks against a mysql database to ensure the user actually exist.
<!---Head--->
none
<!---Body--->
<?
$link = mysql_connect("localhost", "root", "*****");
mysql_select_db("dbname");
IF ($action == "logout"){
// actually deletes teh cookie if one is set.
setcookie("cookie_name", "", time() - 43200);
echo "Cookie has been deleted.";
exit;
}
IF ($action == "login")
{
//check username and password against a mysql database.
$result = mysql_query("SELECT * FROM Users WHERE name='$uname' AND pass='$upassword'");
$check = mysql_num_rows($result);
//if not row was found then write failed
IF (!$check){
echo "Failed to log in, sorry";
exit;
}
else{
//row was found so it writes the cookie and lets the user on.
setcookie ("cookie_name", "$u_name", time() + 43200);
echo "Welcome $u_name, you <br>";
echo "loggen in ok";
//redirects the user to another page once logged in.
echo"<META HTTP-EQUIV="Refresh" Content="1;URL=index.php">";
}
mysql_close($link);
}else{
?>
<html>
<head></head>
<body>
<form action="<?= $PHP_SELF ?>" method="post">
Name<input type=text name=u_name>
Pass<input type=password name=u_password>
<input type=hidden name=action value=login>
<input type=submit value="send">
</form>
<form action="<?= $PHP_SELF ?>" method="post">
<input type=hidden name=action value=logout>
<input type=submit value="Log Out">
</form>
</body>
</html>
<?
}
?>
No Comments to show
Please completely fill out the form below if you want to review this snippet. All reviews are subject to validation.
Replying to a Comment...
Adding your comment. Please wait...
Thanks for adding your comment!. After further review it will be added.
There was a problem adding your comment. Please try again.
Please complete all the fields in the form before sending.
© 2002 - 2018 snippetlibrary.com All Rights Reserved. Conditions
|
{
"url": "https://www.snippetlibrary.com/cview.php/114",
"source_domain": "www.snippetlibrary.com",
"snapshot_id": "crawl=CC-MAIN-2018-47",
"warc_metadata": {
"Content-Length": "43458",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BVUU4MJNSL5BTQRT4HX32PJOINOLXP2W",
"WARC-Concurrent-To": "<urn:uuid:2b9bdc17-55de-4879-81ad-fb417ff29dc6>",
"WARC-Date": "2018-11-18T18:10:38Z",
"WARC-IP-Address": "74.208.236.194",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LLY2UPOQRFUCR4XZOYU3CNZ66PAXWRPM",
"WARC-Record-ID": "<urn:uuid:c587840d-c490-4fae-b407-224b80bf420a>",
"WARC-Target-URI": "https://www.snippetlibrary.com/cview.php/114",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2526ebc3-c86b-4ac5-83b6-1859ed8a2800>"
},
"warc_info": "isPartOf: CC-MAIN-2018-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-168-131.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,
3,
4,
22,
45,
77,
78,
79,
80,
81,
82,
90,
103,
123,
132,
161,
181,
202,
203,
204,
205,
228,
239,
240,
280,
281,
327,
328,
365,
366,
538,
539,
553,
558,
559,
573,
574,
575,
579,
632,
659,
660,
686,
732,
778,
811,
817,
819,
843,
845,
901,
989,
1023,
1064,
1078,
1110,
1116,
1118,
1124,
1186,
1240,
1241,
1275,
1296,
1349,
1410,
1412,
1432,
1439,
1440,
1443,
1450,
1464,
1471,
1518,
1552,
1594,
1638,
1671,
1679,
1726,
1771,
1807,
1815,
1823,
1831,
1834,
1836,
1839,
1840,
1841,
1861,
1862,
1979,
1980,
1981,
2006,
2007,
2008,
2044,
2045,
2117,
2118,
2177,
2178,
2237,
2238
],
"line_end_idx": [
3,
4,
22,
45,
77,
78,
79,
80,
81,
82,
90,
103,
123,
132,
161,
181,
202,
203,
204,
205,
228,
239,
240,
280,
281,
327,
328,
365,
366,
538,
539,
553,
558,
559,
573,
574,
575,
579,
632,
659,
660,
686,
732,
778,
811,
817,
819,
843,
845,
901,
989,
1023,
1064,
1078,
1110,
1116,
1118,
1124,
1186,
1240,
1241,
1275,
1296,
1349,
1410,
1412,
1432,
1439,
1440,
1443,
1450,
1464,
1471,
1518,
1552,
1594,
1638,
1671,
1679,
1726,
1771,
1807,
1815,
1823,
1831,
1834,
1836,
1839,
1840,
1841,
1861,
1862,
1979,
1980,
1981,
2006,
2007,
2008,
2044,
2045,
2117,
2118,
2177,
2178,
2237,
2238,
2302
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2302,
"ccnet_original_nlines": 106,
"rps_doc_curly_bracket": 0.004344049841165543,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.20952381193637848,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02857143059372902,
"rps_doc_frac_lines_end_with_ellipsis": 0.028037380427122116,
"rps_doc_frac_no_alph_words": 0.3580952286720276,
"rps_doc_frac_unique_words": 0.584664523601532,
"rps_doc_mean_word_length": 5.188498497009277,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0.005714289844036102,
"rps_doc_unigram_entropy": 4.967552185058594,
"rps_doc_word_count": 313,
"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.03140394017100334,
"rps_doc_frac_chars_top_4gram": 0.0258620698004961,
"rps_doc_books_importance": -257.0778503417969,
"rps_doc_books_importance_length_correction": -257.0778503417969,
"rps_doc_openwebtext_importance": -143.2097930908203,
"rps_doc_openwebtext_importance_length_correction": -143.2097930908203,
"rps_doc_wikipedia_importance": -103.91365814208984,
"rps_doc_wikipedia_importance_length_correction": -103.91365814208984
},
"fasttext": {
"dclm": 0.031426068395376205,
"english": 0.8011588454246521,
"fineweb_edu_approx": 0.6669394969940186,
"eai_general_math": 0.0010200700489804149,
"eai_open_web_math": 0.0487479604780674,
"eai_web_code": 0.00023453999892808497
}
}
|
{
"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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"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": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "1",
"label": "Technically Flawed"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,514,940,645,148,737,000 |
Stolen Laptop
Discussion in 'Mac Basics and Help' started by insomniac321123, Dec 10, 2006.
1. insomniac321123 macrumors 6502
Joined:
Jan 23, 2006
Location:
Milwaukee, WI
#1
Not for sure if this is the right place for this, but here goes
My laptop got stolen last thursday. What can i do besides the police and my insurance company? Sould I call apple? ANy advice on the situation would be great.
2. Aperture macrumors 68000
Aperture
Joined:
Mar 19, 2006
Location:
PA
#2
Call Apple w/ your Serial # and they can flag it so if the computer is taken into service it will come up as stolen.
Sorry to hear about it. :(
Kevin
3. insomniac321123 thread starter macrumors 6502
Joined:
Jan 23, 2006
Location:
Milwaukee, WI
#3
Thanks. On the upside, I am getting a brand new 2.33 mbp and I had most of my data backed up.
4. Graeme A macrumors 6502
Graeme A
Joined:
Aug 6, 2003
Location:
Melbourne, Australia
#4
Not much you can do if you didn't keep a password on the login... That will sometimes stump them enough to avoid getting your personal data stolen.
When you buy a replacement from the insurance money, buy a copy of Lo-Jack. It should at least render the machine useless to the thief and report the IP address to authorities which might catch the git.
5. dmw007 macrumors G4
dmw007
Joined:
May 26, 2005
Location:
Working for MI-6
#5
Sorry to hear about you laptop being stolen insomniac321123. :(
Both are good things, way to focus on the positive. :)
6. Fleetwood Mac macrumors 65816
Fleetwood Mac
Joined:
Apr 27, 2006
Location:
Canada
#6
7. CanadaRAM macrumors G5
CanadaRAM
Joined:
Oct 11, 2004
Location:
On the Left Coast - Victoria BC Canada
#7
Assume that anything you have saved on the computer, including credit card accounts, email accounts, passwords, everything is accessible to the thieves. Anything you filled into online forms may be present on the drive.
Change all of your passwords, PINs, consider getting new charge cards just as if you had lost your wallet. Monitor your online accounts to see if they have been changed without your sayso.
Stealing one computer is one thing; the opportinity to hijack an eBay account and 'sell' tens of thousands of dollars worth is quite another, to a savvy thief. Or to drain a PayPal account and send off as much money as you linked charge card will stand.
8. coastertux macrumors regular
Joined:
Jul 17, 2006
#8
I run Undercover and have heard it recommended over LoJack.
9. phungy macrumors 68020
phungy
Joined:
Dec 5, 2006
Location:
FL/NY/TX
#9
Just read about it. Very neat! Bookmarked :). Thanks!
10. Neonguy macrumors 6502
Joined:
Sep 10, 2006
#10
Would smart thier would reformat the hard drive anyway. Sometime I get fews people try sell me stolen laptop, but too bad it isn't a Mac. I would Zero Format the data and re-install Windows.
But I'm curious how it got stolen? Was it left at a office or a work place and you went somewhere? Would be freaky to know if they actually go in your house and stole it.
11. insomniac321123 thread starter macrumors 6502
Joined:
Jan 23, 2006
Location:
Milwaukee, WI
#11
I am a college student. It was stolen at night while both I and my room mate were asleep in the room. The doors are easy enough to card open. So... The first thing i will buy for my new laptop is a security lock.
12. Macmaniac macrumors 68040
Macmaniac
#12
Do you have room insurance? It may cover it. My parents got it in case my **** gets stolen. Sucks that it happened, hope you can get it back, or at least get money!
13. insomniac321123 thread starter macrumors 6502
Joined:
Jan 23, 2006
Location:
Milwaukee, WI
#13
Yah, I Have insurance. Ill get $2500 from insurance for a new one.
14. Nym macrumors 6502a
Nym
Joined:
Oct 4, 2006
Location:
Porto, Portugal
#14
Phew... glad you're receiving money for it :)
At least you're getting paid back, just remember, put a new lock on the dorm room and some landmines in the hallway :) should be fine!
I personally would go Vigilante if someone stole my baby... especially in my case where probably everything I own was paid by my hard-earned money, I hate when people steal from other people in similar or even lower economical status, If you want to steal from someone go to Walmart or some crap and eat twinkies without paying... at least you're not hurting anyone :D eheh.
15. cardiac dave macrumors regular
cardiac dave
Joined:
Jun 23, 2005
Location:
iToronto
#15
I used obicules Undercover on both my last iBook and iMac, though I never had to use it.
By all counts, it looked like a solid piece of software, and the one-time fee was really appealing, instead of a yearly fee like others charge.
16. dmw007 macrumors G4
dmw007
Joined:
May 26, 2005
Location:
Working for MI-6
#16
A good thing to be sure. :D
I liked that too, I am more likely to be willing to a pay a one time, flat fee then have to pay for a service like that monthly.
17. cardiac dave macrumors regular
cardiac dave
Joined:
Jun 23, 2005
Location:
iToronto
#17
Smart User would follow Orbicule's recomendation to:
-do the firmware edit to password-protect the laptop and make it unbootable from the DVD drive.
-password protect your user account
-set up an 'other' account (non-admin) to allow the thief to use the laptop, while Undercover tracks them.
18. Neonguy macrumors 6502
Joined:
Sep 10, 2006
#18
In that case, swap out the Hard Driver for another one. hehe.
19. insomniac321123 thread starter macrumors 6502
Joined:
Jan 23, 2006
Location:
Milwaukee, WI
#19
How can I go about deauthorizing the computer for iTunes? I want to make this as difficult for them as possible.
20. Fleetwood Mac macrumors 65816
Fleetwood Mac
Joined:
Apr 27, 2006
Location:
Canada
#20
You can deauthorize all computers once a year.
http://www.apple.com/support/itunes/musicstore/authorization/
Scroll down to deauthorize all computers. You'll have to login to iTunes account on another computer.
Share This Page
|
{
"url": "http://forums.macrumors.com/threads/stolen-laptop.259594/",
"source_domain": "forums.macrumors.com",
"snapshot_id": "crawl=CC-MAIN-2016-44",
"warc_metadata": {
"Content-Length": "228866",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:26WEBA3AHPKLJBD7JKQTOLR27BTB6SXP",
"WARC-Concurrent-To": "<urn:uuid:104f55fc-fc28-406d-b367-7f96bba59912>",
"WARC-Date": "2016-10-26T05:48:50Z",
"WARC-IP-Address": "162.254.116.214",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:W27YKPVBDK37VIOEUQJF5GO6DDRK3NIU",
"WARC-Record-ID": "<urn:uuid:8eea7486-13e4-418f-9ca1-1b4702ffcb4c>",
"WARC-Target-URI": "http://forums.macrumors.com/threads/stolen-laptop.259594/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:47befb80-b2eb-4adb-aa88-444a308fb0a0>"
},
"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,
14,
15,
93,
94,
130,
131,
143,
160,
174,
192,
199,
267,
268,
431,
437,
467,
468,
481,
482,
494,
511,
525,
532,
539,
660,
661,
662,
693,
694,
704,
710,
761,
762,
774,
791,
805,
823,
830,
928,
934,
963,
964,
977,
978,
990,
1006,
1020,
1045,
1052,
1204,
1205,
1412,
1418,
1443,
1444,
1455,
1456,
1468,
1485,
1499,
1520,
1527,
1595,
1596,
1597,
1656,
1662,
1697,
1698,
1716,
1717,
1729,
1746,
1760,
1771,
1778,
1806,
1807,
1821,
1822,
1834,
1851,
1865,
1908,
1915,
2139,
2140,
2333,
2334,
2592,
2598,
2632,
2633,
2645,
2662,
2669,
2733,
2739,
2767,
2768,
2779,
2780,
2792,
2808,
2822,
2835,
2842,
2900,
2906,
2935,
2936,
2948,
2965,
2973,
3168,
3169,
3344,
3350,
3402,
3403,
3415,
3432,
3446,
3464,
3472,
3689,
3695,
3727,
3728,
3742,
3743,
3751,
3920,
3926,
3978,
3979,
3991,
4008,
4022,
4040,
4048,
4119,
4125,
4151,
4152,
4160,
4161,
4173,
4189,
4203,
4223,
4231,
4281,
4420,
4421,
4800,
4806,
4843,
4844,
4861,
4862,
4874,
4891,
4905,
4918,
4926,
4927,
5020,
5021,
5169,
5175,
5201,
5202,
5213,
5214,
5226,
5243,
5257,
5278,
5286,
5318,
5319,
5452,
5458,
5495,
5496,
5513,
5514,
5526,
5543,
5557,
5570,
5578,
5635,
5735,
5775,
5886,
5892,
5921,
5922,
5934,
5951,
5959,
5960,
6026,
6032,
6084,
6085,
6097,
6114,
6128,
6146,
6154,
6271,
6277,
6313,
6314,
6332,
6333,
6345,
6362,
6376,
6387,
6395,
6446,
6512,
6618,
6624,
6625
],
"line_end_idx": [
14,
15,
93,
94,
130,
131,
143,
160,
174,
192,
199,
267,
268,
431,
437,
467,
468,
481,
482,
494,
511,
525,
532,
539,
660,
661,
662,
693,
694,
704,
710,
761,
762,
774,
791,
805,
823,
830,
928,
934,
963,
964,
977,
978,
990,
1006,
1020,
1045,
1052,
1204,
1205,
1412,
1418,
1443,
1444,
1455,
1456,
1468,
1485,
1499,
1520,
1527,
1595,
1596,
1597,
1656,
1662,
1697,
1698,
1716,
1717,
1729,
1746,
1760,
1771,
1778,
1806,
1807,
1821,
1822,
1834,
1851,
1865,
1908,
1915,
2139,
2140,
2333,
2334,
2592,
2598,
2632,
2633,
2645,
2662,
2669,
2733,
2739,
2767,
2768,
2779,
2780,
2792,
2808,
2822,
2835,
2842,
2900,
2906,
2935,
2936,
2948,
2965,
2973,
3168,
3169,
3344,
3350,
3402,
3403,
3415,
3432,
3446,
3464,
3472,
3689,
3695,
3727,
3728,
3742,
3743,
3751,
3920,
3926,
3978,
3979,
3991,
4008,
4022,
4040,
4048,
4119,
4125,
4151,
4152,
4160,
4161,
4173,
4189,
4203,
4223,
4231,
4281,
4420,
4421,
4800,
4806,
4843,
4844,
4861,
4862,
4874,
4891,
4905,
4918,
4926,
4927,
5020,
5021,
5169,
5175,
5201,
5202,
5213,
5214,
5226,
5243,
5257,
5278,
5286,
5318,
5319,
5452,
5458,
5495,
5496,
5513,
5514,
5526,
5543,
5557,
5570,
5578,
5635,
5735,
5775,
5886,
5892,
5921,
5922,
5934,
5951,
5959,
5960,
6026,
6032,
6084,
6085,
6097,
6114,
6128,
6146,
6154,
6271,
6277,
6313,
6314,
6332,
6333,
6345,
6362,
6376,
6387,
6395,
6446,
6512,
6618,
6624,
6625,
6640
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6640,
"ccnet_original_nlines": 229,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3261205554008484,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03168470039963722,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26352396607398987,
"rps_doc_frac_unique_words": 0.4136585295200348,
"rps_doc_mean_word_length": 4.474146366119385,
"rps_doc_num_sentences": 85,
"rps_doc_symbol_to_word_ratio": 0.020092740654945374,
"rps_doc_unigram_entropy": 5.549568176269531,
"rps_doc_word_count": 1025,
"rps_doc_frac_chars_dupe_10grams": 0.15045791864395142,
"rps_doc_frac_chars_dupe_5grams": 0.17597034573554993,
"rps_doc_frac_chars_dupe_6grams": 0.17597034573554993,
"rps_doc_frac_chars_dupe_7grams": 0.17597034573554993,
"rps_doc_frac_chars_dupe_8grams": 0.1607065051794052,
"rps_doc_frac_chars_dupe_9grams": 0.1607065051794052,
"rps_doc_frac_chars_top_2gram": 0.026166589930653572,
"rps_doc_frac_chars_top_3gram": 0.029001310467720032,
"rps_doc_frac_chars_top_4gram": 0.02398603968322277,
"rps_doc_books_importance": -564.604736328125,
"rps_doc_books_importance_length_correction": -564.604736328125,
"rps_doc_openwebtext_importance": -314.241455078125,
"rps_doc_openwebtext_importance_length_correction": -314.241455078125,
"rps_doc_wikipedia_importance": -271.3995361328125,
"rps_doc_wikipedia_importance_length_correction": -271.3995361328125
},
"fasttext": {
"dclm": 0.02785062976181507,
"english": 0.9285579919815063,
"fineweb_edu_approx": 1.3274378776550293,
"eai_general_math": 0.012629450298845768,
"eai_open_web_math": 0.11837667226791382,
"eai_web_code": 0.00004780000017490238
}
}
|
{
"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": "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": "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": "21",
"label": "Customer Support"
}
},
"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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,826,500,618,612,373,000 |
Sei sulla pagina 1di 14
UNIVERSITA DEL SALENTO
CORSO DI LAUREA IN FISICA
(a.a. 2007/2008)
Corso di Laboratorio II
(Prof. Antonio DINNOCENZO)
ESERCITAZIONE DI STATISTICA1
Lo scopo di questa esercitazione quello di cominciare ad utilizzare il software MATLAB ad un livello di base per le applicazioni statistiche.2 Il package statistico di MATLAB si trova nella cartella \toolbox\stats; per avere una lista di tutte le funzioni disponibili basta digitare help stats.
Introduzione
Tipicamente MATLAB interpreta una matrice X di dati come una serie di colonne, dove ciascuna colonna corrisponde ad un esperimento, o gruppo, e le osservazioni fatte in ciascun esperimento sono riportate nella colonna. Il numero di esperimenti effettuati corrisponde al numero delle colonne. Il numero di osservazioni in ciascun esperimento il numero delle righe. Ad es., se misuro la lunghezza di 100 bulloni, campionandoli dalla stessa scatola in tre giorni distinti, ho 3 esperimenti ognuno con 100 osservazioni.
Statistica descrittiva
Le funzionalit di statistica descrittiva di nostro interesse riguardano: - misure di tendenza centrale: media, mediana, ..., - misure di dispersione: varianza, deviaz. standard, ..., - raggruppamento dei dati, - analisi e stima empirica della distribuzione dei dati:quantili e descrizione grafica
Indici di posizione
Le misure di localizzazione dei dati comprendono: geomean media geometrica harmmean media armonica mean media aritmetica median mediana trimmean media trimmed (ripulita)
1
La presente guida stata realizzata dal responsabile del corso con la collaborazione del Dott. F. Paladini del Dipartimento di Fisica dellUniversit del Salento. 2 Nella stesura dei vari punti trattati oltre alla possibilit di errori di trascrizione dei comandi possono comparire anche inesattezze nelle procedure della cui segnalazione anticipatamente il docente responsabile ringrazia.
La media aritmetica la stima pi utilizzata e semplice della "posizione" della distribuzione dei dati, ed la miglior stima della media se la distribuzione di origine gaussiana, ma errori di acquisizione, outliers o anomalie possono facilmente e irrimediabilmente alterare la stima del centro della distribuzione. Questo inconveniente riguarda anche la media geometica e armonica, che per sono utili quando la distribuzione lognormale o fortemente asimmetrica. La mediana e la media trimmed sono misure pi robuste nei confronti degli ouliers. La mediana (50esimo percentile) cambia solo di poco anche se viene aggiunta una grande perturbazione a un qualunque dato. La media trimmed ignora una piccola percentuale dei dati con valori massimi e minimi, rispetto al totale, per poi calcolare la media aritmetica dei dati rimasti.
Misure di dispersione
Le misure di dispersione indicano quanto i dati sono addensati o si discostano da una misura di posizione (e.g. media aritmetica). Le funzioni di MATLAB sono: iqr intervallo interquartile IQR, mad deviazione media assoluta MAD, range intervallo, std deviazione standard (std), var varianza. Il range la differenza tra il massimo ed il minimo valore del campione, la pi semplice misura di dispersione, ma anche la pi sensibile alla presenza di dati anomali. La deviazione standard e la varianza sono le misure pi popolari della dispersione, e sono ottimali quando i dati sono stati estratti da una distribuzione gaussiana, in particolare, la std la miglior stima del parametro sigma. N la std, n la varianza sono robuste nei confronti dei cosidetti "outliers": un dato separato dall'insieme del campione pu alterare entrambe le misure di una quantit arbitrariamente grande. La deviazione media assoluta, MAD, la media della differenza assoluta tra i dati e la media; essa sempre sensibile agli outliers, ma varia meno della std in presenza di dati "anomali". L'intervallo di interquartile, IQR, la differenza tra il 75esimo e il 25esimo percentile. Poich solo il 50% dei dati influenza la IQR (il primo e l'ultimo 25%), essa robusta rispetto agli outliers.
Distribuzioni di probabilit e funzioni di ripartizione
Le distribuzioni di probabilit servono per descrivere i risultati di esperimenti quando i risultati sono soggetti a variazioni casuali. La natura stessa dell'esperimento determina quale distribuzione pi appropriata per modellizzare i risultati random. La trattazione probabilistica non predice il risultato di un singolo esperimento, ma fornisce: -la probabilit di avere un particolare valore come risultato se i dati sono discreti - la probabilit che il risultato cada in un certo intervallo per dati continui. Le funzioni di distribuzione di probabilit (pdf) di MATLAB sono: Continue di dati Beta (betapdf) Esponenziale (exppdf) Gamma (gampdf) Continue statistiche Chi quadro (chi2pdf) Chi quadro non centrale (ncx2pdf) F (fpdf) Discrete Binomiale (binopdf) Uniforme discreta (unidpdf) Geometrica (geopdf) 2
Lognormal (lognpdf) Normale (normpdf) Rayleigh (raylpdf) Uniforme (unifpdf) Weibull (weibpdf)
F non centrale (ncfpdf) t di Student(tpdf) t di student non centrale (nctpdf)
Hypergeometrica (hygepdf) Binomiale negativa (nbinpdf) Poissoniana (poisspdf)
Se la distribuzione discreta la pdf la probabilit di osservare un particolare valore. Se la distribuzione continua la pdf rappresenta la densit di probabilit dei dati, e non la probabilit, che per ogni particolare singolo valore nulla. In questo caso si deve considerare la probabilit che il dato cada in un particolare intervallo, da calcolare come integrale della pdf sull'intervallo di interesse. Per ciascuna pdf MATLAB fornisce le seguenti funzioni:
Distribuzione della densit di probabilit (pdf) Distribuzione comulativa della densit di probabilit (cdf) Funzione inversa della cdf Generatore di numeri pseudocasuali Varianza e media parametriche
La distribuzione della densit di probabilit calcola la probabilit relativa a ciascun valore dei dati se questi sono discreti, e calcola la densit di probabilit se i dati variano con continuit (pdf_.m, le funzioni che calcolano le diverse pdf sono riportate tra parentesi nella tabella). La cdf di una pdf , definita per una v.a. continua come:
viene chiamata con i comandi normcdf, betacdf,... Con la funzione cdf si pu calcolare la probabilit associata a un qualunque intervallo dei dati. Le funzioni inverse delle cdf accettano come argomento in ingresso un valore di probabilit p, e forniscono in uscita il valore di x tale che la probabilit di osservare valori minori o uguali ad x proprio p, ovvero la x tale che l'integrale della pdf da -inf a x uguale a p. I comandi sono norminv, betainv... . Ciascuna pdf ha una forma funzionale nella quale compaiono i parametri che la caratterizzano. A partire dal campione, si pu effettuare una stima di massima verosimiglianza dei parametri (MLE Maximum likelihood estimation): si ipotizza che il set di dati segua una certa distribuzione (eg. gaussiana, esponenziale,...) e si ricavano i "migliori" valori dei parametri per descrivere i dati, unitamente al loro intervallo di confidenza. Vediamo ora come costruire il grafico di una funzione densit di probabilit. Prendiamo ad esempio la distribuzione t di Student, a cui corrisponde la funzione tpdf. Dall'help (help tpdf) apprendiamo che la funzione prende due argomenti: >>y = tpdf(x,nu) un vettore di ascisse x e i gradi di libert nu, e restituisce un vettore y che contiene i valori della pdf in corrispondenza delle ascisse. Dobbiamo quindi in primo luogo costruire un vettore di ascisse. Se vogliamo vedere il grafico della funzione di densit tra -5 e 5, il comando >>x=[-5:0.1:5]'; 3
produce una progressione aritmetica di ragione 0.1 che parte da -5 e termina a 5. I valori della pdf di una distribuzione t di Student con 3 gradi di libert si otterranno quindi digitando ad es.: >>clear all >>x=[-5:0.1:5]'; >>yt=tpdf(x,3); A questo punto possiamo costruire il grafico: >>plot(x,yt) Se si aggiungono ulteriori argomenti, si pu controllare l'aspetto del grafico: plot(x,yt,'r.') produce un grafico a punti di colore rosso. Una lista completa delle opzioni si pu ottenere digitando help plot. Un grafico a punti o a barre pu essere utile nel caso di distribuzioni discrete, visto che in questo caso la probabilit definita solo in corrispondenza di valori interi delle ascisse. Disegniamo ora, utilizzando la stessa griglia di ascisse, la funzione di densit di una distribuzione normale standardizzata: >>clear all >>x=[-5:0.1:5]'; >>yn=normpdf(x,0,1); >>plot(x,yn) Se si desidera visualizzare pi grafici sovrapposti, si utilizza il comando hold; ad esempio inserite le seguenti istruzioni: >>clear all >> x=[-5:0.1:5]'; >>hold on; >>yt=tpdf(x,3); >>yn=normpdf(x,0,1); >>plot(x,yn,'g'); >>plot(x,yt,'r'); >>hold off;
Numeri casuali
MATLAB possiede un generatore di numeri (matrici) pseudocasuali uniformi (rand) e normali standardizzati (randn); gli argomenti che questi generatori richiedono sono il numero di righe e colonne desiderati. Ad esempio, per avere un vettore colonna di dieci numeri casuali uniformi si digita rand(10,1). Il computer una macchina deterministica e non in grado di produrre numeri veramente" casuali. Nel package stats sono inoltre compresi ulteriori generatori. Se vogliamo un campione di 100 osservazioni da una distribuzione esponenziale con media 1.8, digitiamo: >>r=exprnd(1.8,100,1);
Se vogliamo un campione di 100 osservazioni da una distribuzione normale con media 0 e deviaz. standard 1, digitiamo: >>r=randn(100,1); Una analoga istruzione consente di ottenere il set di osservazioni richiesto: >>r=normrnd(0,1,100,1);
Istogramma e cdf empirica
Una volta generati dei numeri casuali r=, si pu visualizzare il risultato costruendone l'istogramma: hist(r). Se si desidera specificare il numero di intervalli che l'istogramma deve utilizzare, lo si pu inserire come secondo argomento:hist(r,20). Un secondo modo per visualizzare le propriet empiriche di un campione quello di disegnare la cdf empirica: cdfplot(r). >>clear all >> r=exprnd(1.8,100,1); >> hist(r) >> cdfplot(r)
Applicazioni
PREMESSA: Prima di iniziare a trattare le varie applicazioni che vengono di seguito proposte, un consiglio (o meglio un imperativo categorico) per tutti. Ogniqualvolta incontrate un nuovo comando, prima di procedere alla applicazione, digitate lhelp relativo al comando incontrato e impadronitevi delle varie opzioni che lo riguardano. Per ogni argomento trattato fate una stampa dei risultati dellapplicazione e degli eventuali grafici che vengono creati. Il tutto costituir il materiale della vostra esercitazione di statistica che presenterete al docente responsabile del corso una settimana prima dellesame. Le applicazioni contrassegnate dal simbolo # sono da considerare facoltative.
1) Variabili aleatorie
Cominciamo imparando ad usare MATLAB per calcolare le probabilit e le funzioni di ripartizione di v.a. discrete quali la binomiale e la poissoniana. Sia k una v.a. discreta con distribuzione di Poisson di parametro lambda= ultima cifra del vostro giorno di nascita. Calcolate: a) la probabilit P(k=3) b) P(k 3) c) P(1k<5) d) P(k15)
La probabilit della v.a. poissoniana k di parametro lambda viene valutata digitando il comando poisspdf(k,lambda) mentre la funzione di ripartizione il comando poisscdf(k,lambda). Pertanto per rispondere rispettivamente alle precedenti questioni digitate: >>clear all >>lambda=; >>Pa=poisspdf(3,lambda) >>Pb=1-poisscdf(2,lamda) >>Pc=posscdf(4,lambda)-poisscdf(0,lambda) >>Pd=1-poisscdf(14,lambda) Rispondete ora alle stesse domande nel caso in cui la v.a. discreta k segua una legge binomiale di parametri N e p. Fissate N=ultima cifra del vostro giorno di nascita (se questo numero minore o uguale a quattro aggiungetegli il numero 5) e p=numero (arrotondato a due cifre decimali) che si ottiene facendo il reciproco dellultima cifra del vostro giorno di nascita (se questo numero uguale ad uno aggiungetegli 2 prima di farne il reciproco) >>clear all >>N=....; % inserite il valore indicato >>p=..; % inserite il valore indicato >>Pa=binopdf(3,N,p) >>Pb=1-binocdf(2,N,p) >>Pc=binocdf(4,N,p)-binocdf((0,N,p) >>Pd=1-binocdf(14,N,p) Possiamo calcolare con unistruzione sintetica la media e la varianza per i dati delle nostre distribuzioni. Per la binomiale di parametri N e p possiamo digitare ad esempio: >>clear all >>N=..; % inserite il valore utilizzato in precedenza >>p=..; % inserite il valore utilizzato in precedenza >>[mu, var]=binostat(N,p) Possiamo calcolare simultaneamente le coppie (mu,var) al variare di N. Per esempio: con il comando N=linspace(10,100,10) viene generato un insieme di 10 valori da 10 a 100 egualmente spaziati. >>clear all >>p=.. >>N=linspace(10,100,10); >>[mu, var]=binostat(N,p) MATLAB fornisce in successione rispettivamente i valori attesi e le varianze per i vari casi. Per v.a. continue valgono analoghe istruzioni. Per la v.a. normale di parametri mu e sigma avremo ad es.: >>clear all >> x=[-5:0.1:5]'; >>mu= ultima cifra del vostro giorno di nascita;
>>sigma=numero (arrotondato ad una cifra decimale) che si ottiene facendo il reciproco dellultima cifra del vostro giorno di nascita (se questo numero uguale ad uno aggiungetegli 2 prima di farne il reciproco) >>p = normpdf(x,mu,sigma); %densit di probabilit >>F = normcdf(x,mu,sigma); %funzione di ripartizione >>alpha=0.25; >>q = norminv(alpha,mu,sigma) % (quantile di ordine alpha) Per l'esponenziale di parametro lambda: >>clear all >> x=[-5:0.1:5]'; >>lambda=.; % inserite il valore utilizzato precedentemente >>p = exppdf(x,1/lambda) %densit di probabilit >>F = expcdf(x,1/lambda) %funzione di ripartizione >>alpha=0.75 >>q = expinv(alpha,1/lambda) % (quantile di ordine alpha) Per la v.a. uniforme continua sull'intervallo (a,b): >>clear all >>a= ultima cifra del vostro giorno di nascita; >>b= ultima cifra del vostro giorno di nascita + 4; >>p= unifpdf(x,a,b) %densit di probabilit >>F= unifcdf(x,a,b) %funzione di ripartizione >>alpha=0.90 >>q= unifinv(alpha,a,b) % (quantile di ordine alpha)
2) Generazione di numeri casuali e visualizzazione dei dati
Creiamoci innanzitutto un insieme di dati sui quali lavorare usando il comando rand. U = rand(n,m) genera una matrice U(n*m) di variabili pseudoaleatorie indipendenti e uniformi in (0,1), mentre u = rand(n,1) fornisce un vettore colonna di lunghezza n. Primo passo: generate ad esempio un set di numeri random uniformemente distribuiti tra zero ed uno e al prompt di MATLAB nel Command Window date le seguenti istruzioni: >>clear all >>n=100seguito dallultima cifra del vostro giorno di nascita se questo numero pari, altrimenti gli aggiungete 1); >>data= rand(n,1); Secondo passo: Costruiamo due vettori di lunghezza n/2, il primo diciamo data1- costituito dagli elementi di data di posto dispari e il secondo diciamo data2- da quelli di posto pari: >>data1=data(1:2:n); >>data2=data(2:2:n); A questo punto plottiamo data1 in funzione di data2 col comando:
>>plot(data1,data2,'o')
Se i punti sono uniformemente distribuiti sul quadrato [0,1]*[0,1] allora possiamo pensare che non ci sia correlazione fra i vari elementi del vettore data. Generazione di altre variabili diverse dalla uniforme: come detto MATLAB le fornisce nella propria libreria statistica, tutte partono dal generare numeri indipendenti uniformi (0,1) poi trasformati. Ad es. binornd, unifrnd, normrnd, poissrnd...(vedere i rispettivi help per conoscere le modalit di generazione dei dati pseudocasuali). Digitate: >>clear all >>rand('state' ,sum(100*clock)) % predisponiamo il seme del generatore >>n=10seguito dallultima cifra del vostro giorno di nascita se questo numero pari, altrimenti gli aggiungete 1); >>data= normrnd(0,1,n,1); >>data1=u(1:2:n); >>data2=u(2:2:n); >>plot(data1,data2,'o') %Se vogliamo inserire una griglia sul grafico aggiungeremo il comando grid on. %Lo stesso tipo di grafico pu essere ottenuto col comando scatter: >>scatter(data1,data2, 'o') >>grid on Con n numeri pseudocasuali uniformemente distribuiti tra 0 ed 1 possiamo creare ad esempio un insieme di n numeri interi con valori compresi tra 0 e 9: >>clear all >>rand('state' ,sum(100*clock)) % predisponiamo il seme del generatore >>n=100seguito dallultima cifra del vostro giorno di nascita; >>data=rand(n,1); >>datint=fix(10*data); %Creiamo ora un vettore delle frequenze assolute e un vettore delle frequenze relative di ciascuna %cifra (da 0 a 9): >>fass=hist(datint); >>frel=fass/n; %Grafico della distribuzione delle frequenze assolute: >>interv=[min(datint):max(datint)]'; % si traspone(') perch fass un vettore colonna >>plot(interv,fass) % grafico >>bar(interv,fass) % diagramma a barre %Calcoliamo ora le frequenze cumulative e plottiamo il grafico: >>Fass(1)=fass(1) >>for i=2:length(interv) Fass(i)=Fass(i-1)+fass(i); end >>plot(interv,Fass) %Calcoliamo i valori di skewness e di curtosi della nostra distribuzione di dati: >>sk=skewness(datint) >>k=kurtosis(datint) %disegnare la densit cumulative empirica col comando: >>cdfplot(datint)
3) Verifica empirica della legge dei grandi numeri#
La legge (debole) dei grandi numeri dice che data una successione di variabili casuali xi a media finita, la media campionaria delle osservazioni converge in probabilit al valore della media teorica mu. Una verifica empirica di questa legge consiste nel generare n numeri pseudocasuali, calcolarne la media campionaria xmedio=(x1+x2+x3+..xn)/n e vedere con un plot come il valor medio campionario oscilla attorno a mu con le oscillazioni che diminuiscono al crescere di n. Generiamo una successione di variabili uniformemente distribuite tra 0 ed 1 e con valore atteso mu=1/2: >>clear all >>rand('state' ,sum(100*clock)); >>for i=1:100 xmedio(i)=sum(rand(i,1))/i; end >>plot(xmedio, '.') Provate anche con i=1000 e con i=10000 ma non andate oltre perch MATLAB con un gran numero di iterazioni diventa molto lento.
4) Teorema del limite centrale#
Verifichiamo sperimentalmente il teorema del limite centrale della statistica. Sommiamo inizialmente nv=50 variabili indipendenti con distribuzione uniforme ottenute per un numero np=10000 prove e confrontiamo la frequenza relativa della distribuzione della loro somma con la previsione teorica, vale a dire con una gaussiana di media e varianza note dalla teoria. Aumentiamo successivamente il numero di variabili portandolo a nv=100 e nv=500 e valutiamo graficamente il limite asintotico della distribuzione empirica alla gaussiana. >>clear all >>rand('state' ,sum(100*clock)) >> np=10000; >> nv=50; >> y=rand(nv,np); >> sy=sum(y); >> media=nv*.5; >> varianza=nv*1/12; >> x=[-5*sqrt(varianza):.5:5*sqrt(varianza)]+media; >> freq=hist(sy,x)/np/.5; >> dist=1/sqrt(2*pi*varianza)*exp(-(x-media).^2/(2*varianza)); >> figure >> hold on; >> bar(x,freq) >> plot(x,dist,'r') Ripetete la procedura ponendo nv=100 e successivamente nv=500.
5) Intervalli di confidenza per la media della popolazione
a) Intervallo di confidenza per la media di una popolazione con varianza nota: 9
>>clear all >>rand('state' ,sum(100*clock)) >>mu= 0; >>sigma=1; >>n = 1seguito dallultima cifra del vostro giorno di nascita); >>x = normrnd (mu, sigma, n, 1); >>intconf= 0.95; >>xmedio = mean (x) >>qn =norminv ((1+intconf)/2, 0, 1) >>deltan= qn*sigma/sqrt(n) >>intervallo = [xmedio-deltan xmedio+deltan] Riprovate la precedente procedura rispettivamente con n=10seguito dallultima cifra del vostro giorno di nascita e con=100seguito dallultima cifra del vostro giorno di nascita e notate come diminuisce l'ampiezza dell'intervallo al variare di n. b) Intervallo di confidenza per la media di una popolazione con varianza incognita: >>clear all >>rand('state' ,sum(100*clock)) >>mu= 0; >>sigma=1; >>n = 1seguito dallultima cifra del vostro giorno di nascita); >>x = normrnd (mu, sigma, n, 1); >>intconf= 0.95; >>xmedio = mean (x) >>s=std(x) >>qt =tinv ((1+intconf)/2, n-1) >>deltat= qt*s/sqrt(n) >>intervallo = [xmedio-deltat xmedio+deltat] Riprovate anche in questo caso la precedente procedura con n=10seguito dallultima cifra del vostro giorno di nascita) e con=100seguito dallultima cifra del vostro giorno di nascita) e notate come diminuisce l'ampiezza dell'intervallo al variare di n.
5) Test dipotesi sulla media con varianza nota
Considerate il seguente esempio: Una ditta sta commercializzando un nuovo prodotto ed e' interessata a conoscere l'altezza di tale manufatto. Si suppone che tale altezza sia normalmente distribuita con deviazione standard nota e pari a 20 mm. Disponendo dei seguenti dati (in mm) riguardo all'altezza di N=40 prodotti scelti a caso: 194 195 226 224 222 178 183 180 174 205 186 235 186 196 158 185 201 198 215 178 177 182 198 204 212 173 168 191 201 178 196 208 220 181 163 204 197 200 173 182 lazienda intende effettuare il seguente test di ipotesi sulla media: 10
H0 (ipotesi nulla):la media e' uguale a 188 mm. H1 (ipotesi alternativa):la media e' diversa da 180 mm. 1) Utilizzando soltanto i primi n(<=N) dati del campione e come statistica la media campionaria, trovare la regione di accettazione per l'ipotesi nulla ad un livello di significativita' del 5% e trarre una conclusione sull'ipotesi fatta 2) Confrontare i risultati al punto 1) con quelli ottenuti con un livello di significativita' dell'1% 3) Confrontare i risultati al punto 1) con quelli ottenuti utilizzando tutti gli N=40 dati del campione. Impostiamo il problema con MATLAB: Punto 1) >>clear all >>sigma = 20; >>Dati =[194 195 226 224 222 178 183 180 174 205 186 235 186 196 158 185 201 198 215 178 177 182 198 204 212 173 168 191 201 178 196 208 220 181 163 204 197 200 173 182]; >>mu = 188; % Ipotesi nulla >>n =2seguito dallultima cifra del vostro giorno di nascita; >>xmedio = mean(Dati(1:n)); >>alpha = 0.05; % alpha = P(di rigettare l'ipotesi nulla anche se vera) >>b= 1-alpha/2; >>qb= norminv(b,0,1); >>delta = qb * sigma / sqrt(n); >>mupiu = xmedio+ delta; >>mumeno = xmedio- delta; >>Test = mu > mumeno & mu < mupiu % Test = 1 ipotesi accettata, Test = 0 ipotesi rifiutata Punto 2) Per rispondere a questo punto occorre ripetere la successione di istruzioni precedente inserendo lopportuno valore di alpha. Punto 3) Si tratta anche in questo caso di ripetere la procedura del punto 1) ponendo n=40 ed alpha=0.05.
6) Unesercitazione un po pi laboriosa (ma non meno interessante)
Generate un campione di 360 numeri interi di una cifra estratti a caso da una distribuzione uniforme e disponeteli in 40 gruppi di 9 cifre . Per generare con MATLAB una tale tabella attenetevi alle seguenti istruzioni: >>n=360; >>rand('state' ,sum(100*clock)); >>N=fix(10*rand(n,1)); >>hist(N) % per avere una visione dinsieme della distribuzione del vostro campione di cifre 11
>>fprintf('%3.0f %3.0f %3.0f %3.0f %3.0f %3.0f %3.0f %3.0f %3.0f \n',N) %mantenete gli spazi vuoti indicati tra i gruppi di cifre da visualizzare sullo schermo). Dopo lultima istruzione apparir nella videata del Command Window di MATLAB una successione di numeri casuali interi di una cifra disposti in quaranta righe di 9 elementi spaziati opportunamente per lelaborazione successiva. Selezionate quindi col tasto destro del mouse nel Command Window di MATLAB la successione di cifre che compare sullo schermo e copiatela su un documento Word. Avrete cos la vostra tabella personalizzata sulla quale lavorare. Il valore atteso e la varianza di una variabile casuale n, che assume i 10 valori interi da zero a nove con equiprobabilit (p=1/10), sono rispettivamente: E[n] = ni / 10 = 4.5
i =1 10
= E[n E[ n]]2 = (ni E[n]) 2 / 10 = 8.5
2 i =1
10
Selezionate inizialmente dalla vostra tabella un sottoinsieme di K=90 numeri di una cifra. La cosa migliore prendere una successione di numeri consecutivi per evitare di influire sulla loro selezione. Dopo aver sistemato i dati in una tabella di frequenza del tipo:
Frequenza Cifra Freq. ass. Fi Freq. rel. fi
0 1 2 3 4 5 6 7 8 9
10
calcolate, utilizzando MATLAB, il valor medio campionario n =
n F
i =1 10 i
F
i =1
e la varianza campionaria
s2 =
F (n n )
i =1 i i
10
K 1
Per evitare di riportare singolarmente nella istruzione dati=[.] tutte le 90 cifre selezionate, ritornate con il cursore del Command Window di MATLAB sulla successione di 360 cifre e aggiungete manualmente alla fine di ogni riga (eccetto lultima) tre puntini () per indicare che listruzione continua al rigo successivo, dopodich selezionate tutte le righe interessate e inseritele
12
nelle parentesi dellistruzione dati=[.]. Per calcolare la media e la varianza utilizzate poi le opportune istruzioni MATLAB (mean(dati) e var(dati)). Non sarebbe sorprendente se per il vostro campione di dimensione limitata di elementi trovaste che la media e la varianza si discostano dai valori attesi. Ci aspettiamo tuttavia che laccordo migliori con campioni di K=180 e 360 elementi rispettivamente. Valutate la media e la varianza empiriche anche per questi campioni e confrontatele con i valori attesi. Considerate ora i gruppi di tre cifre della vostra tabella di 360 numeri interi e valutate qual la frequenza del numero m= ultima cifra del vostro giorno di nascita, in ciascun gruppo di tre cifre (gruppi in numero totale di 120). Cio quanti gruppi di tre cifre non contengono nessun m, quanti ne contengono uno, quanti ne contengono due, quanti ne contengono tre? La variabile casuale individuata dai quattro valori n=0,1,2,3 di frequenza considerati, descritta da una distribuzione teorica di tipo binomiale N PN , p (n) = p n (1 p ) N n con N=3 p=1/10 n e con parametri di posizione e di larghezza rispettivamente dati da: E[n] = N p = 3 1 = 0.3 10 1 9 27 = = 0.27 10 10 100
2 = E[n E[n]] 2 = N p (1 p) = 3
Dopo aver registrato le frequenze sperimentali in una tabella del tipo:
variabile n Frequenza assoluta relativa
valutate il valor medio e la varianza campionari della variabile n. Come si confrontano i valori di frequenza relativa con i valori di probabilit della distribuzione teorica? Utilizzate MATLAB per ricavare questi ultimi valori. Verificate lattendibilit dellipotesi sulle frequenze, applicando (eventualmente con luso di MATLAB) un test del chiquadro al livello di significativit del 5%. Prendete ora in considerazione i gruppi di nove cifre nella tabella di di 360 numeri a caso a vostra disposizione (40 gruppi in totale). Effettuate un calcolo della distribuzione delle frequenze della cifra m (usata in precedenza) nei gruppi di nove cifre, considerando solo i valori di n=0,1,2,3 e 4. Costruite una tabella simile alla precedente e confrontate anche in questo caso, applicando ancora un test del chiquadro al livello di significativit del 5%, i valori di frequenza relativa con i rispettivi valori di probabilit (valutati utilizzando MATLAB) della corrispondente distribuzione teorica binomiale (stavolta con N=9 e p=1/10) Considerate infine lapprossimazione di Poisson per la distribuzione di frequenza delle cifre nei gruppi di nove numeri estratti a caso. Si ha N=9 e p=1/10, per cui lambda = N p =0.9 13
Calcolate, utilizzando MATLAB, le probabilit per i valori di n=0,1,2,3 e 4 considerando una distribuzione poissoniana con parametro lambda=0.9. Naturalmente non ci si deve attendere un accordo troppo elevato tra frequenze relative e probabilit perch N=9 molto distante da N= e p=1/10 non un valore di probabilit troppo piccolo, ma comunque il confronto con la nostra distribuzione di frequenza campionaria resta interessante. Verificate con un test del chiquadro al livello di significativit del 5% lattendibilit delladattamento della poissoniana al vostro campione di frequenze.
14
|
{
"url": "https://it.scribd.com/document/86563620/Statistic-A",
"source_domain": "it.scribd.com",
"snapshot_id": "crawl=CC-MAIN-2019-43",
"warc_metadata": {
"Content-Length": "293507",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SVZZLZKQWVUD5HT7YXHVVEEIJJNC4635",
"WARC-Concurrent-To": "<urn:uuid:d28e4374-0fd6-4f39-812d-38394c7b7a62>",
"WARC-Date": "2019-10-24T00:23:53Z",
"WARC-IP-Address": "151.101.250.152",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:CSQZB5WPSX4AY4XPOPRZRVC7DAQTLRJZ",
"WARC-Record-ID": "<urn:uuid:b7d07aa1-f5e8-4a82-a44a-3bfa61f23dfd>",
"WARC-Target-URI": "https://it.scribd.com/document/86563620/Statistic-A",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:edf0f075-e763-409a-905c-84ff6b386f3d>"
},
"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-68.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,
24,
25,
48,
49,
75,
76,
77,
94,
95,
119,
146,
147,
176,
471,
472,
485,
1001,
1002,
1025,
1322,
1323,
1343,
1513,
1515,
1516,
1902,
1903,
2728,
2729,
2751,
4007,
4008,
4063,
4064,
4065,
4875,
4876,
4970,
4971,
5049,
5050,
5128,
5129,
5584,
5585,
5782,
5783,
6127,
6128,
7573,
7574,
8705,
8706,
8721,
9307,
9308,
9546,
9547,
9573,
9574,
9575,
10003,
10004,
10017,
10707,
10708,
10731,
11063,
11064,
12958,
12959,
13962,
13963,
14023,
14024,
14025,
14883,
14884,
14908,
14909,
16932,
16933,
16985,
16986,
16987,
17801,
17802,
17834,
17835,
17836,
18768,
18769,
18828,
18829,
18830,
18911,
18912,
20104,
20105,
20152,
20153,
20154,
20719,
20720,
22150,
22151,
22216,
22217,
22218,
22597,
22598,
23385,
23393,
23394,
23433,
23434,
23435,
23442,
23443,
23446,
23447,
23713,
23757,
23758,
23778,
23781,
23782,
23844,
23845,
23849,
23859,
23860,
23862,
23867,
23868,
23894,
23895,
23900,
23901,
23910,
23919,
23920,
23923,
23924,
23928,
23929,
24310,
24311,
24314,
24315,
25502,
25503,
25535,
25536,
25608,
25609,
25610,
25650,
25651,
26863,
26864,
27444,
27445
],
"line_end_idx": [
24,
25,
48,
49,
75,
76,
77,
94,
95,
119,
146,
147,
176,
471,
472,
485,
1001,
1002,
1025,
1322,
1323,
1343,
1513,
1515,
1516,
1902,
1903,
2728,
2729,
2751,
4007,
4008,
4063,
4064,
4065,
4875,
4876,
4970,
4971,
5049,
5050,
5128,
5129,
5584,
5585,
5782,
5783,
6127,
6128,
7573,
7574,
8705,
8706,
8721,
9307,
9308,
9546,
9547,
9573,
9574,
9575,
10003,
10004,
10017,
10707,
10708,
10731,
11063,
11064,
12958,
12959,
13962,
13963,
14023,
14024,
14025,
14883,
14884,
14908,
14909,
16932,
16933,
16985,
16986,
16987,
17801,
17802,
17834,
17835,
17836,
18768,
18769,
18828,
18829,
18830,
18911,
18912,
20104,
20105,
20152,
20153,
20154,
20719,
20720,
22150,
22151,
22216,
22217,
22218,
22597,
22598,
23385,
23393,
23394,
23433,
23434,
23435,
23442,
23443,
23446,
23447,
23713,
23757,
23758,
23778,
23781,
23782,
23844,
23845,
23849,
23859,
23860,
23862,
23867,
23868,
23894,
23895,
23900,
23901,
23910,
23919,
23920,
23923,
23924,
23928,
23929,
24310,
24311,
24314,
24315,
25502,
25503,
25535,
25536,
25608,
25609,
25610,
25650,
25651,
26863,
26864,
27444,
27445,
27447
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 27447,
"ccnet_original_nlines": 163,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.09886574745178223,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018791260197758675,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.31691214442253113,
"rps_doc_frac_unique_words": 0.29992446303367615,
"rps_doc_mean_word_length": 5.405439376831055,
"rps_doc_num_sentences": 195,
"rps_doc_symbol_to_word_ratio": 0.0016929099801927805,
"rps_doc_unigram_entropy": 6.118293285369873,
"rps_doc_word_count": 3971,
"rps_doc_frac_chars_dupe_10grams": 0.07495924085378647,
"rps_doc_frac_chars_dupe_5grams": 0.129280224442482,
"rps_doc_frac_chars_dupe_6grams": 0.11278825998306274,
"rps_doc_frac_chars_dupe_7grams": 0.1040298193693161,
"rps_doc_frac_chars_dupe_8grams": 0.0901467502117157,
"rps_doc_frac_chars_dupe_9grams": 0.08683904260396957,
"rps_doc_frac_chars_top_2gram": 0.0070813000202178955,
"rps_doc_frac_chars_top_3gram": 0.01174004003405571,
"rps_doc_frac_chars_top_4gram": 0.01677148975431919,
"rps_doc_books_importance": -3074.081298828125,
"rps_doc_books_importance_length_correction": -3074.081298828125,
"rps_doc_openwebtext_importance": -1655.484619140625,
"rps_doc_openwebtext_importance_length_correction": -1655.484619140625,
"rps_doc_wikipedia_importance": -1480.762939453125,
"rps_doc_wikipedia_importance_length_correction": -1480.762939453125
},
"fasttext": {
"dclm": 0.6377798914909363,
"english": 0.0038301299791783094,
"fineweb_edu_approx": 0.8488491177558899,
"eai_general_math": 0.00015341999824158847,
"eai_open_web_math": 0.7901594638824463,
"eai_web_code": 0.6366512179374695
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
},
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,038,539,664,967,358,000 |
Ask Ubuntu is a question and answer site for Ubuntu users and developers. It's 100% free.
Sign up
Here's how it works:
1. Anybody can ask a question
2. Anybody can answer
3. The best answers are voted up and rise to the top
Please provide:
• correct location to add my custom domain search option (preferably appending it to the DHCP list, instead of prepending)
• command to run to make the settings effective
Note: do not ask me to modify files that are auto-regenerated and overridden, like /etc/resolv.conf
share|improve this question
up vote 7 down vote accepted
You will need to edit this file with your favorite editor:
sudo vim /etc/dhcp/dhclient.conf
Once in file, you should see a commented line with the word supersede next to it:
#supersede domain-name "...."
Uncomment that line, substitute the name supersede for append, then add the domain names you wish to search (follow the example below and leave a space after the first "):
append domain-name " ubuntu.com ubuntu.net test.ubunut.com";
Save the file and close.
All you need to do is restart your network connection. You can do this by unplugging and plugging in the physical network connect OR disable and enable your network connect (see picture below). After that you should be good to go:
To verify:
sudo cat /etc/resolv.conf
Disconnect Network
enter image description here
Connect Network
enter image description here
share|improve this answer
Nice, but is the space before the first domain name necessary? – l0b0 Mar 26 '13 at 8:27
@l0b0: Yes, you better have that space, otherwise the last existing domain-name (in resolv.conf) and the first newly added domain will stick together is like: existing-one.comfirst-append.com instead of having existing-one.com first-append.com. Cheers!! – MacUsers Jun 10 '13 at 14:19
You can use the
→ nm-applet (right click) → Edit Connections → Choose connection → Edit → IPv4 Settings → Additional Search Domains
and enter your search domains there. After that, disconnect, connect and they'll be there.
share|improve this answer
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://askubuntu.com/questions/135629/how-to-add-some-additional-dns-search-domains-without-ignoring-the-ones-returned",
"source_domain": "askubuntu.com",
"snapshot_id": "crawl=CC-MAIN-2016-22",
"warc_metadata": {
"Content-Length": "76001",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RGJ4D5PUZYFIPNLBPRBH4XBSGWWPTWNV",
"WARC-Concurrent-To": "<urn:uuid:001d7c35-d0fc-4885-8857-d67551aa6efc>",
"WARC-Date": "2016-05-27T18:46:04Z",
"WARC-IP-Address": "104.16.109.188",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:5NV3ZCQFUGNZRNVX7QMNGVPCFJ2P7YUT",
"WARC-Record-ID": "<urn:uuid:451599d3-2ff4-4b5d-9343-74237b67382f>",
"WARC-Target-URI": "http://askubuntu.com/questions/135629/how-to-add-some-additional-dns-search-domains-without-ignoring-the-ones-returned",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:116e0a26-0552-4135-8d03-db2a94b36b09>"
},
"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,
90,
91,
99,
120,
152,
176,
231,
232,
248,
249,
374,
424,
425,
525,
526,
554,
583,
584,
643,
644,
677,
678,
760,
761,
791,
792,
964,
965,
1026,
1027,
1052,
1053,
1284,
1285,
1296,
1297,
1323,
1324,
1343,
1344,
1373,
1374,
1390,
1391,
1420,
1421,
1447,
1452,
1541,
1546,
1831,
1832,
1848,
1849,
1965,
1966,
2057,
2058,
2084,
2085,
2097,
2098,
2100,
2108,
2109,
2187,
2188
],
"line_end_idx": [
90,
91,
99,
120,
152,
176,
231,
232,
248,
249,
374,
424,
425,
525,
526,
554,
583,
584,
643,
644,
677,
678,
760,
761,
791,
792,
964,
965,
1026,
1027,
1052,
1053,
1284,
1285,
1296,
1297,
1323,
1324,
1343,
1344,
1373,
1374,
1390,
1391,
1420,
1421,
1447,
1452,
1541,
1546,
1831,
1832,
1848,
1849,
1965,
1966,
2057,
2058,
2084,
2085,
2097,
2098,
2100,
2108,
2109,
2187,
2188,
2278
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2278,
"ccnet_original_nlines": 67,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3595041334629059,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004132229834794998,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2334710657596588,
"rps_doc_frac_unique_words": 0.5388888716697693,
"rps_doc_mean_word_length": 4.905555725097656,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0.004132229834794998,
"rps_doc_unigram_entropy": 4.943273067474365,
"rps_doc_word_count": 360,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03624008968472481,
"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.00849376991391182,
"rps_doc_frac_chars_top_3gram": 0.01925254985690117,
"rps_doc_frac_chars_top_4gram": 0.03171008080244064,
"rps_doc_books_importance": -251.89393615722656,
"rps_doc_books_importance_length_correction": -251.89393615722656,
"rps_doc_openwebtext_importance": -162.82798767089844,
"rps_doc_openwebtext_importance_length_correction": -162.82798767089844,
"rps_doc_wikipedia_importance": -115.03899383544922,
"rps_doc_wikipedia_importance_length_correction": -115.03899383544922
},
"fasttext": {
"dclm": 0.056116338819265366,
"english": 0.8567197918891907,
"fineweb_edu_approx": 1.9677517414093018,
"eai_general_math": 0.00018459999409969896,
"eai_open_web_math": 0.17532950639724731,
"eai_web_code": -0.000007510000159527408
}
}
|
{
"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.462",
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,722,993,391,470,807,000 |
ListView is slow to load, any performance guidelines?
Hi I am using a basic Listview in forms with hard coded data in a list. When navigating to the page which contains the listview, it takes a nice 1-2 seconds to load. Any specific reason why this is happening?
Code:
protected override void OnAppearing ()
{
base.OnAppearing ();
//Get Menuitems for current menu
MenuListViewModel.MenuItems= Task.Run (async () => await UCommerceServices.GetMenuItemsForCategory(MenuListViewModel.ParentId)).Result;
foreach (var menuItem in MenuListViewModel.MenuItems) {
menuItems.Add (menuItem);
}
activityIndicator.IsVisible = false;
}
View:
<?xml version="1.0" encoding="UTF-8"?>
<ContentPage xmlns="http://xamarin.com/schemas/2014/forms" xmlns:x="http://schemas.microsoft.com/winfx/2009/xaml" x:Class="Pizza4U.MenuListPage">
<ContentPage.Content>
<Grid VerticalOptions="FillAndExpand" HorizontalOptions="FillAndExpand">
<ListView x:Name="listView">
<ListView.ItemTemplate>
<DataTemplate>
<ViewCell>
<StackLayout BackgroundColor="#eee" Orientation="Vertical">
<StackLayout Orientation="Horizontal">
<Image Source="{Binding ImageUrl}" />
<Label Text="{Binding Title}" TextColor="#f35e20" />
<Label Text="{Binding Description}" HorizontalOptions="EndAndExpand" TextColor="#503026" />
</StackLayout>
</StackLayout>
</ViewCell>
</DataTemplate>
</ListView.ItemTemplate>
</ListView>
<ActivityIndicator IsVisible="true" IsRunning="true"
VerticalOptions="FillAndExpand" HorizontalOptions="FillAndExpand" x:Name="activityIndicator" />
</Grid>
</ContentPage.Content>
</ContentPage>
Note that the GetMenuItemsForCategory is retrieving a list which is currently hardcoded.
Thanks for your assistance.
Shaun
Tagged:
Best Answer
Answers
• SpaceMonkeySpaceMonkey GBMember ✭✭✭
ListView is rubbish.
However, the new release could help:
Try using ListViewCachingStrategy.RecycleElement as explained somewhere here http://forums.xamarin.com/discussion/56040/xamarin-forms-2-0-0-released/p1
If that doesn't work, then use a custom renderer for the cells which is explained in the documentation. It explains how to write a custom renderer for the cells or for the whole ListView, it's better to write a renderer for the cells only.
When I had to do this, I couldn't even write a custom renderer for the cells because of some bugs in Xamarin which I reported and have no idea if it was fixed or not:
http://forums.xamarin.com/discussion/43051/strange-error-happens-when-saving-a-custom-renderer-object-to-a-java-object#latest
http://forums.xamarin.com/discussion/42728/android-bug-1-4-3-6358-pre2-oncellpropertychanged-not-called-for-the-first-visible-cells#latest
I really should have posted that to Bugzilla instead... But then, even that doesn't help sometimes like in the case of this horrible bug:
https://bugzilla.xamarin.com/show_bug.cgi?id=35657
which have been there for like 3 weeks now and no one gives a shit despite providing a sample project as requested.
So, in my case I had to write a custom renderer for the layout that's used by the cells.
Sorry for going off topic, I hope that helped.
• NMackayNMackay GBInsider, University mod
@ShaunGrech
If your don't mind paying for custom controls then Telerik's RadListview has good performance and a lot of nice features that would be real a headache in the free version. We've moved to that and seen much better performance.
• JulienRosenJulienRosen CAMember ✭✭✭✭
how many items are you showing?
• ShaunGrechShaunGrech USMember ✭✭
I am replicating the code from the XamarinCRM app which I consider to be the gold standard. The images loaded in the XamarinCRM app are quite big (1600X1333). My images are similar (maybe slightly bigger in size). I have implemented an independent loader for the images, but when I navigate away from the list and navigate back, the list takes a nice 2 seconds to re-appear (even though the images have now been loaded already).
I do not want to purchase external tools atm as I'm on a budget and I was under the impression that using a list is the recommended approach.
Thanks for the help guys.
Shaun
• JulienRosenJulienRosen CAMember ✭✭✭✭
The CRM app doesn't load more then a handful of items at a time. Again, how many items are you loading?
• ShaunGrechShaunGrech USMember ✭✭
At the moment I am loading around 6 items which is approximately the same as the CRM application. I realised that my images are slightly bigger than the CRM's. I also noticed that on Android I run into a memory exception stating that I am utilising too much memory.
• ShaunGrechShaunGrech USMember ✭✭
Is there a way how you can avoid running into a memory exception in Xamarin Forms? I am loading images from an API and sometimes the images might be a bit too big but it seems like I'm running into outofmemory exceptions way to often.
Thanks guys,
Shaun
• JulienRosenJulienRosen CAMember ✭✭✭✭
edited December 2015
You really need to investigate the image sizes and scale them down to a resolution that makes sense for mobile. You should also attempt just removing the images temporarily and see if the issue persists. I am loading hundreds of items in a listview with no memory issues, and I'm sure you can see that the CRM app does not suffer from anything like that.
• ShaunGrechShaunGrech USMember ✭✭
Yes in fact I noticed that the images used in the XamarinCRM app are slightly smaller than mine. I am also running into a number of memory exceptions on Android simply because I am using a background image. I will look into some Image resize tools as I am retrieving my images through an API.
Thanks for the help guys
Shaun
Sign In or Register to comment.
|
{
"url": "https://forums.xamarin.com/discussion/comment/168656",
"source_domain": "forums.xamarin.com",
"snapshot_id": "crawl=CC-MAIN-2019-22",
"warc_metadata": {
"Content-Length": "59741",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7JRRKEQQLSFOMGIL6ADFMAUZSOOAFROL",
"WARC-Concurrent-To": "<urn:uuid:607cbe8b-eea7-43fc-9f5c-f12f9727e12e>",
"WARC-Date": "2019-05-24T18:16:07Z",
"WARC-IP-Address": "162.159.138.78",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:35YXJ63GJ3U5FSMQZOI2GNI6AP67C3CA",
"WARC-Record-ID": "<urn:uuid:4d7648b8-f75f-404c-a935-9df5250872a6>",
"WARC-Target-URI": "https://forums.xamarin.com/discussion/comment/168656",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ef343f20-39b3-40a2-ad5f-15cd0a5020a7>"
},
"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-47-182-244.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,
54,
55,
264,
265,
271,
272,
311,
321,
354,
399,
547,
615,
657,
671,
720,
730,
731,
737,
738,
777,
923,
949,
1027,
1064,
1100,
1131,
1162,
1246,
1313,
1383,
1468,
1592,
1635,
1674,
1706,
1738,
1775,
1795,
1858,
1966,
1982,
2009,
2024,
2025,
2114,
2115,
2143,
2144,
2150,
2151,
2159,
2160,
2172,
2173,
2181,
2182,
2222,
2223,
2248,
2249,
2290,
2446,
2447,
2691,
2692,
2863,
2993,
3136,
3137,
3279,
3334,
3454,
3455,
3548,
3549,
3600,
3601,
3646,
3647,
3663,
3664,
3894,
3895,
3936,
3937,
3973,
3974,
4011,
4012,
4445,
4446,
4592,
4593,
4623,
4624,
4634,
4635,
4676,
4677,
4785,
4786,
4823,
4824,
5094,
5095,
5132,
5133,
5372,
5373,
5390,
5400,
5401,
5442,
5467,
5468,
5827,
5828,
5865,
5866,
6163,
6164,
6193,
6203,
6204
],
"line_end_idx": [
54,
55,
264,
265,
271,
272,
311,
321,
354,
399,
547,
615,
657,
671,
720,
730,
731,
737,
738,
777,
923,
949,
1027,
1064,
1100,
1131,
1162,
1246,
1313,
1383,
1468,
1592,
1635,
1674,
1706,
1738,
1775,
1795,
1858,
1966,
1982,
2009,
2024,
2025,
2114,
2115,
2143,
2144,
2150,
2151,
2159,
2160,
2172,
2173,
2181,
2182,
2222,
2223,
2248,
2249,
2290,
2446,
2447,
2691,
2692,
2863,
2993,
3136,
3137,
3279,
3334,
3454,
3455,
3548,
3549,
3600,
3601,
3646,
3647,
3663,
3664,
3894,
3895,
3936,
3937,
3973,
3974,
4011,
4012,
4445,
4446,
4592,
4593,
4623,
4624,
4634,
4635,
4676,
4677,
4785,
4786,
4823,
4824,
5094,
5095,
5132,
5133,
5372,
5373,
5390,
5400,
5401,
5442,
5467,
5468,
5827,
5828,
5865,
5866,
6163,
6164,
6193,
6203,
6204,
6235
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6235,
"ccnet_original_nlines": 124,
"rps_doc_curly_bracket": 0.0016038500471040606,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3232758641242981,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.031034480780363083,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26724138855934143,
"rps_doc_frac_unique_words": 0.4612352252006531,
"rps_doc_mean_word_length": 5.884362697601318,
"rps_doc_num_sentences": 67,
"rps_doc_symbol_to_word_ratio": 0.005172410048544407,
"rps_doc_unigram_entropy": 5.351564407348633,
"rps_doc_word_count": 761,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07257703691720963,
"rps_doc_frac_chars_dupe_6grams": 0.055158551782369614,
"rps_doc_frac_chars_dupe_7grams": 0.02054489031434059,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.0060294801369309425,
"rps_doc_frac_chars_top_3gram": 0.01563197933137417,
"rps_doc_frac_chars_top_4gram": 0.016078609973192215,
"rps_doc_books_importance": -505.31256103515625,
"rps_doc_books_importance_length_correction": -505.31256103515625,
"rps_doc_openwebtext_importance": -253.77688598632812,
"rps_doc_openwebtext_importance_length_correction": -253.77688598632812,
"rps_doc_wikipedia_importance": -189.98658752441406,
"rps_doc_wikipedia_importance_length_correction": -189.98658752441406
},
"fasttext": {
"dclm": 0.03562343120574951,
"english": 0.8510539531707764,
"fineweb_edu_approx": 1.1364740133285522,
"eai_general_math": 0.4203386902809143,
"eai_open_web_math": 0.08815144747495651,
"eai_web_code": 0.6820695400238037
}
}
|
{
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,755,555,415,013,521,000 |
View Single Post
Old 10-05-2012, 11:03 PM #109
st_albert
Fanatic
st_albert has a propeller beanie that spins backward.st_albert has a propeller beanie that spins backward.st_albert has a propeller beanie that spins backward.st_albert has a propeller beanie that spins backward.st_albert has a propeller beanie that spins backward.st_albert has a propeller beanie that spins backward.st_albert has a propeller beanie that spins backward.st_albert has a propeller beanie that spins backward.st_albert has a propeller beanie that spins backward.st_albert has a propeller beanie that spins backward.st_albert has a propeller beanie that spins backward.
Posts: 513
Karma: 61176
Join Date: Feb 2010
Device: none
ZOMG! clarification, please....
Quote:
Originally Posted by kiwidude View Post
And worst of all *if* the user does not have Tidy turned completely off, it *will* screw up your document in it's attempt to help. Pretty Print will "guess" where closing tags should be or what tags to remove. Tidy will make an even bigger mess of your HTML. You will lose content, users complain when they notice. Just because you didn't notice any issue with turning the check off, doesn't mean that (a) an issue didn't happen, or (b) that you just happened to get exceptionally lucky.
Hopefully what you mean is that, even if the user has "pretty print" enabled, the above will happen IF and ONLY IF THE USER clicks "fix automatically." If you click "fix manually" nothing much happens behind the scenes, but you are returned to the edit screen with at least a hint of what problem was detected.
In the former case, the user will reap what he has sown (perhaps there should be a warning... "Are you SURE you trust me to GUESS what you intended to do?") . In the latter case, no changes should be made, albiet the file must get fixed before another save can be made.
No time to fix it? That's why the Unix "gods" provide "xkill" and the Redmond "demi-gods" gave us the task manager. You will revert to your last saved file, but if that hurts, consider it an object lesson in learning when / when not to save files.
I kind of dislike autosave options because I like to experiment a lot with various coding before settling on an alternative. Now, if the program distinguished between autosaves and intentional saves (a la LibreOffice and many others) this would be a non-issue.
st_albert is offline
|
{
"url": "http://www.mobileread.com/forums/showpost.php?p=2250770&postcount=109",
"source_domain": "www.mobileread.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "11458",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZST3YTXIAKFCY36KPF7JG4CAZZW7LKHM",
"WARC-Concurrent-To": "<urn:uuid:50052563-edcf-4832-94f3-3a51b3bbd454>",
"WARC-Date": "2013-12-07T08:32:49Z",
"WARC-IP-Address": "67.205.70.12",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:N6RGZKRCQHUILEWSDO4E4XBGNZ5OA7YS",
"WARC-Record-ID": "<urn:uuid:b7f09f25-3ff8-40cd-9559-405634629d74>",
"WARC-Target-URI": "http://www.mobileread.com/forums/showpost.php?p=2250770&postcount=109",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0b31c5da-efbd-4a9a-bc5a-034ac7114a4d>"
},
"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,
17,
49,
59,
67,
651,
653,
664,
677,
697,
710,
742,
743,
744,
751,
791,
1279,
1590,
1591,
1861,
1862,
2110,
2111,
2372,
2395
],
"line_end_idx": [
17,
49,
59,
67,
651,
653,
664,
677,
697,
710,
742,
743,
744,
751,
791,
1279,
1590,
1591,
1861,
1862,
2110,
2111,
2372,
2395,
2396
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2396,
"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.3992016017436981,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023952100425958633,
"rps_doc_frac_lines_end_with_ellipsis": 0.03999999910593033,
"rps_doc_frac_no_alph_words": 0.1896207630634308,
"rps_doc_frac_unique_words": 0.5139240622520447,
"rps_doc_mean_word_length": 4.759493827819824,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0.005988019984215498,
"rps_doc_unigram_entropy": 4.845222473144531,
"rps_doc_word_count": 395,
"rps_doc_frac_chars_dupe_10grams": 0.24893617630004883,
"rps_doc_frac_chars_dupe_5grams": 0.24893617630004883,
"rps_doc_frac_chars_dupe_6grams": 0.24893617630004883,
"rps_doc_frac_chars_dupe_7grams": 0.24893617630004883,
"rps_doc_frac_chars_dupe_8grams": 0.24893617630004883,
"rps_doc_frac_chars_dupe_9grams": 0.24893617630004883,
"rps_doc_frac_chars_top_2gram": 0.023404259234666824,
"rps_doc_frac_chars_top_3gram": 0.07606382668018341,
"rps_doc_frac_chars_top_4gram": 0.1111702099442482,
"rps_doc_books_importance": -289.0487060546875,
"rps_doc_books_importance_length_correction": -289.0487060546875,
"rps_doc_openwebtext_importance": -150.295654296875,
"rps_doc_openwebtext_importance_length_correction": -150.295654296875,
"rps_doc_wikipedia_importance": -126.8963851928711,
"rps_doc_wikipedia_importance_length_correction": -126.8963851928711
},
"fasttext": {
"dclm": 0.07283961772918701,
"english": 0.9206984043121338,
"fineweb_edu_approx": 1.0641846656799316,
"eai_general_math": 0.7459719181060791,
"eai_open_web_math": 0.2733486294746399,
"eai_web_code": 0.28179931640625
}
}
|
{
"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": "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": "5",
"label": "Comment Section"
}
},
"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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,837,439,650,383,037,000 |
Go Down
Topic: ps2 barcode scanner using instantly (Read 4760 times) previous topic - next topic
PaulS
Quote
Without lcd and u8g libraly, everything goes well.
You then need to include the libraries, and create the instances, but don't use them. Does the code still work?
Add parts back in until the code quits working correctly. Then, let us know what specific line of code/function call causes the program to quit.
Have you checked how much free memory you have?
The art of getting good answers lies in asking good questions.
feveran
UKHeliBob
Quote
Does the capitalisation of the function name matter ?
Of course it does.
In my heart of hearts I knew that, but it would be less confusing if the tutorial on the function http://arduino.cc/en/Tutorial/SerialEvent was consistent as to what it called the function. Admittedly it is called serialEvent in the example programs but it is referred to as SerialEvent in several places in the text and comments, not least at the very start of the tutorial.
Quote
SerialEvent
Demonstrates use of the SerialEvent() function. SerialEvent() is called after a loop(), if there is serial data in the buffer.
Please do not send me PMs asking for help. Post in the forum then everyone will benefit from seeing the questions and answers.
PaulS
Post this issue in the Website and Forum section. Of late, madbob has been very good at fixing issues in the reference documentation.
The art of getting good answers lies in asking good questions.
UKHeliBob
Please do not send me PMs asking for help. Post in the forum then everyone will benefit from seeing the questions and answers.
Go Up
|
{
"url": "http://forum.arduino.cc/index.php?topic=148059.msg1115905",
"source_domain": "forum.arduino.cc",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "30548",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XVMTNSRT5VNYB5YFR5J4E6L7YVFCJV2Y",
"WARC-Concurrent-To": "<urn:uuid:defefad4-a398-49d5-9043-43c09a9bbb3f>",
"WARC-Date": "2017-10-16T22:23:41Z",
"WARC-IP-Address": "54.167.252.43",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:R3WUYFAWN7BE72XJB4P6D7ENCEYOGTQJ",
"WARC-Record-ID": "<urn:uuid:93b77770-d36a-4bd1-aa6a-8f49ccc787c1>",
"WARC-Target-URI": "http://forum.arduino.cc/index.php?topic=148059.msg1115905",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:840d2b9e-6daa-4e33-a092-81d53a4e0726>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-165-76-76.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-43\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for October 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,
8,
9,
98,
99,
105,
106,
112,
163,
164,
276,
277,
422,
423,
471,
534,
535,
543,
544,
545,
555,
556,
557,
563,
617,
618,
637,
638,
1015,
1016,
1022,
1034,
1161,
1289,
1290,
1296,
1297,
1431,
1494,
1495,
1505,
1506,
1634,
1635,
1641
],
"line_end_idx": [
8,
9,
98,
99,
105,
106,
112,
163,
164,
276,
277,
422,
423,
471,
534,
535,
543,
544,
545,
555,
556,
557,
563,
617,
618,
637,
638,
1015,
1016,
1022,
1034,
1161,
1289,
1290,
1296,
1297,
1431,
1494,
1495,
1505,
1506,
1634,
1635,
1641,
1642
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1642,
"ccnet_original_nlines": 44,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.43478262424468994,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0031055898871272802,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1304347813129425,
"rps_doc_frac_unique_words": 0.543795645236969,
"rps_doc_mean_word_length": 4.729927062988281,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.639886856079102,
"rps_doc_word_count": 274,
"rps_doc_frac_chars_dupe_10grams": 0.2361111044883728,
"rps_doc_frac_chars_dupe_5grams": 0.2361111044883728,
"rps_doc_frac_chars_dupe_6grams": 0.2361111044883728,
"rps_doc_frac_chars_dupe_7grams": 0.2361111044883728,
"rps_doc_frac_chars_dupe_8grams": 0.2361111044883728,
"rps_doc_frac_chars_dupe_9grams": 0.2361111044883728,
"rps_doc_frac_chars_top_2gram": 0.02700616978108883,
"rps_doc_frac_chars_top_3gram": 0.01234568003565073,
"rps_doc_frac_chars_top_4gram": 0.023148149251937866,
"rps_doc_books_importance": -134.07455444335938,
"rps_doc_books_importance_length_correction": -120.3675308227539,
"rps_doc_openwebtext_importance": -94.33817291259766,
"rps_doc_openwebtext_importance_length_correction": -94.33817291259766,
"rps_doc_wikipedia_importance": -60.71914291381836,
"rps_doc_wikipedia_importance_length_correction": -48.1812858581543
},
"fasttext": {
"dclm": 0.06623297929763794,
"english": 0.9148712754249573,
"fineweb_edu_approx": 2.3993372917175293,
"eai_general_math": 0.12410985678434372,
"eai_open_web_math": 0.12161487340927124,
"eai_web_code": 0.0012310700258240104
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02856",
"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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,751,222,563,869,502,000 |
Creating a Spring Controller
Introduction
Note: this sub-generator is much simpler than the entity sub-generator that creates full CRUD entities
This is sub-generator generates a Spring MVC REST Controller. It is also able to create simple REST methods.
In order to generate a “Foo” Spring MVC REST controller, just type:
jhipster spring-controller Foo
The sub-generator will ask you which method you want to generate: just answer the method name and the HTTP verb you want to use, and a simple method will be generated.
Can we document this Spring MVC REST Controller with Swagger?
Yes! In fact it’s already done! In dev mode, just use the Administration > API menu to access Swagger UI and start using the generated controller.
Can we add security to Spring MVC REST Controllers?
Yes! Just add Spring Security’s @Secured annotation on your class or on your methods, and use the provided AuthoritiesConstants class to restrict access to specific user authorities.
Can we monitor Spring MVC REST Controllers?
Yes! Just add Metrics’ @Timed annotations on the methods you want to monitor.
|
{
"url": "http://www.jhipster.tech/creating-a-spring-controller/",
"source_domain": "www.jhipster.tech",
"snapshot_id": "crawl=CC-MAIN-2017-47",
"warc_metadata": {
"Content-Length": "32488",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FHDHNYX4SGOUOVA466YZQTI3CFR4DPDC",
"WARC-Concurrent-To": "<urn:uuid:215cd4d9-fc09-4540-bc70-5410ad94a992>",
"WARC-Date": "2017-11-18T00:31:30Z",
"WARC-IP-Address": "151.101.33.147",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:M6WANWMCD2A3S5HLEOSHI7HU7DXJLZZT",
"WARC-Record-ID": "<urn:uuid:b4d924c2-de0f-4778-8bf1-17eb96f87f65>",
"WARC-Target-URI": "http://www.jhipster.tech/creating-a-spring-controller/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:15dff8e7-f88a-4bf8-8057-941c301da23c>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-144-140-14.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,
29,
30,
43,
44,
147,
148,
257,
258,
326,
327,
358,
359,
527,
528,
590,
591,
738,
739,
791,
792,
975,
976,
1020,
1021
],
"line_end_idx": [
29,
30,
43,
44,
147,
148,
257,
258,
326,
327,
358,
359,
527,
528,
590,
591,
738,
739,
791,
792,
975,
976,
1020,
1021,
1098
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1098,
"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.3395348787307739,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06976743787527084,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1534883677959442,
"rps_doc_frac_unique_words": 0.5199999809265137,
"rps_doc_mean_word_length": 5.045714378356934,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.247541904449463,
"rps_doc_word_count": 175,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07701019197702408,
"rps_doc_frac_chars_dupe_6grams": 0.07701019197702408,
"rps_doc_frac_chars_dupe_7grams": 0.07701019197702408,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.05096263065934181,
"rps_doc_frac_chars_top_3gram": 0.07361268252134323,
"rps_doc_frac_chars_top_4gram": 0.07814270257949829,
"rps_doc_books_importance": -96.438720703125,
"rps_doc_books_importance_length_correction": -96.438720703125,
"rps_doc_openwebtext_importance": -54.244651794433594,
"rps_doc_openwebtext_importance_length_correction": -45.22169494628906,
"rps_doc_wikipedia_importance": -34.896080017089844,
"rps_doc_wikipedia_importance_length_correction": -34.896080017089844
},
"fasttext": {
"dclm": 0.7548151016235352,
"english": 0.8436210751533508,
"fineweb_edu_approx": 2.0903513431549072,
"eai_general_math": 0.40655696392059326,
"eai_open_web_math": 0.18970322608947754,
"eai_web_code": 0.7829312682151794
}
}
|
{
"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.74",
"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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,789,813,847,556,727,000 |
• Configure replication using Unisphere
PDF
Configure replication using Unisphere
Configure protection and mobility interfaces
Before you begin
Protection and mobility (import) interfaces can be shared between replication and import. For import, only VDM imports require interfaces. Block imports do not require interfaces.
Protection and mobility (import) interfaces are configured to support VDM imports and must be created prior to creating an import connection. A mobility interface IP address is assigned to SPA and SPB on the target Unity system. Once the mobility interface is configured, you can create the import connection between the Unity system and the VNX system. Mobility interfaces are not used for block import sessions.
Ensure the following:
• The interface port is cabled and connected to a network switch.
• Both SPs are up and running.
Obtain the following information for each Storage Processor (SP):
• IP address associated with the interface (replication or import). Although you can specify an IPv4 or IPv6-based address, ensure that you specify the same type of address for both SPs.
• IP address mask or prefix length that identifies the associated subnet.
• Gateway IP address associated with the interface.
• If applicable, the VLAN ID (between 1 and 4095) you want to associate the interface with.
For the network to continue functioning properly, ensure that you set the VLAN ID only when you have configured the network switch port to support VLAN tagging of multiple VLAN IDs.
Procedure
1. Under Protection & Mobility, select Interfaces.
2. Perform one of the following actions:
• To create an interface, select the Add icon. On the Create Interface window, specify the relevant information:
• For asynchronous replication or import, from the Ethernet Port list, select an available Ethernet port.
• For synchronous replication, from the Ethernet Port list, select Sync Replication Management Port.
Do not use Sync Replication Management Port for asynchronous replication or import interfaces.
• To modify an interface, select the interface, and then select the Edit icon. On the Interface Properties window, specify the relevant information.
• To delete an interface, select the interface, and then select the Delete icon.
Before you delete an interface, ensure that the interface is not being used by any replication or import session.
Configure replication connections
Before you begin
Ensure that you have set up relevant replication interface pairs, one on each SP, on the source and destination systems. Obtain the following information:
• For remote replication, the IP address and associated user authentication credentials to connect to the remote system.
• For local replication, the password associated with your user account.
• The connection mode you want to use for the replication: Asynchronous, Synchronous, or Both.
If a replication connection already exists and you plan to add a different mode of file replication, do not attempt to create a new connection. Change the existing replication connection mode to Both. Also, ensure that you have the appropriate interface types configured to support both asynchronous replication (eth2, eth3) and synchronous replication (sync replication mgmt port).
Procedure
1. Under Protection & Mobility, select Replication > Connections.
2. Perform one of the following actions:
• To create a replication connection, Select the Add icon. On the Create Replication Connection window, specify the relevant information.
• To modify a replication connection, select the replication connection, and then select the Edit icon. On the Replication Connection Properties window, specify the relevant information.
• If new replication interfaces were added, or existing replication interfaces were deleted, the remote system connection may become outdated. Select the relevant replication, and then select Verify and Update to update the remote system connection to pick up the latest replication interface changes on the local and remote systems.
Create a replication session
Before you begin
Ensure that you have first created relevant replication interfaces and connections, and then determine the following:
• The replication mode you want. You can choose from the following options:
• Asynchronous
• Manual
• Synchronous
• The Recovery Point Objective (RPO) for the replication session.
• The system you want to assign as the replication destination system. This is based on the replication connections configured on the storage system.
• The name, pool, storage provisioning, and tiering policy you want to use for the destination storage resource. The system will automatically create a destination storage resource as part of this process.
You can convert a thin LUN to a non-thin (thick) LUN, or a thick LUN to a thin LUN with a LUN move operation. To enable data reduction on a thin LUN requires an All-Flash pool on the destination system. For thick file systems, the replication process matches the destination storage resource to the source. In this case, thin and data reduction cannot be selected for file systems. For thin file systems, the following rules apply for replication:
• If the source file system is thin, then the destination file system is also thin.
• If the source file system is thin and either the source or destination system does not support data reduction, then the destination file system is also thin.
• If both the source and destination systems support data reduction, then the source or destination can have either data reduction enabled or no data reduction enabled.
• However, if you change the source file system data reduction attribute, the change is not replicated to the destination system (retains the original setting) regardless of using asynchronous or synchronous replication.
• Replicate scheduled snapshots to the destination and to use the same retention policy or a different policy. Also, when a replication session is created some time after the resource was created, determine whether to select the one-time option to replicate all existing snapshots.
Snapshots that have been created and attached as well as read/write (share) snapshots (as opposed to read-only checkpoint snapshots) are not eligible for replication. Only unattached (read-only) snapshots are eligible for replication. For asynchronous replication, you can replicate existing snapshots and snapshots created from snapshot schedules. For synchronous file replication, you cannot replicate existing snapshots or snapshots created from snapshot schedules. You can only replicate those snapshots and snapshots created from snapshot schedules after you have established the synchronous replication session and it is Active. For synchronous block replication, you cannot replicate any snapshot.
Procedure
1. Under Storage, select the storage resource, and then select Edit.
For file storage, you must first configure replication on the NAS server.
2. On the Properties window, select the Replication tab.
3. Select Configure Replication.
4. In the Create a Session window, specify the relevant information.
Once you specify the necessary information for the destination storage resource or NAS server, the system will automatically create the storage resource or NAS server on the destination system.
On a NAS server that is protected by replication, you must create a replication session for each file system on it. Otherwise, file system related configurations like shares and exports may be lost after a NAS server replication session failover.
• When you use Unisphere to create replication for a NAS server, the system automatically creates a replication session for each file system on it.
• When you use Unisphere to create a new file system, Unisphere creates a replication by default.
Manage replication sessions
A replication session establishes an end-to-end path for a replication operation between a source and destination. The replication source and destination may be remote or local, so the session establishes the path that the data follows as it moves from source to destination.
If you want to set up a replication session, see Configure replication.
Procedure
1. Access the Replication Session Details screen in one of the following ways:
• If you know the name of the replication session, go to Protection & Mobility > Replication > Sessions.
• If you know the name of the storage resource or NAS server associated with the replication session, go to the Replication tab on the Properties window of the relevant storage resource or NAS server.
2. Perform one of the following actions:
On Unity systems running OE version 4.2, the following asynchronous replication actions affect both the NAS server and its associated file systems when run at the NAS server level:
• Failover
• Failover-with-sync
• Failback
• Pause
• Resume
On Unity systems running OE version 4.4, the following synchronous replication actions affect both the NAS server and its associated file systems when run at the NAS server level:
• Failover
• Failback
• Pause
• Resume
• Preserve
Those same replication actions towards a file system, with the exception of Preserve, remain at the file system level. The following asynchronous replication actions affect only the NAS server when run at the NAS server level or are still individual operations toward file system replication sessions:
• Create
• Sync (applicable to asynchronous replication only)
• Delete
• Modify
Action Description
Modify a session
Select the Edit icon to modify the name and synchronization settings of the session.
Delete a session
Select Delete. Deleting a replication session also deletes the internal snapshots used by the session. If the connection between the systems is healthy, the session on the destination system gets automatically deleted when you delete the session on the source system. You can individually delete replication sessions at the source and destination systems, however, this is not recommended unless the connection is down.
You cannot delete a replication when a synchronization is in progress.
Pause and resume a session
Select Pause or Resume. Pause stops a replication session without deleting the replication session. Resuming a session from the destination system after a failover or failover with sync reverses the direction of the replication. Resume is not available on the destination if the session is not failed over. Changes on the destination system are copied back to the source system at the next RPO interval after a connection is restored.
Pausing a replication session while a snapshot is being copied results in stopping the transfer. The destination resource is rolled back to the common base snapshot so that the destination is brought to a consistent state. Resuming a paused session restarts the previously stopped transfer. Replication restores the destination resource to the common base snapshot first, then restarts the snapshot copy by copying the differences between the common base snapshot and the snapshot to be transferred.
Manually synchronize a session (for asynchronous replication only)
Select Sync. Changes since the last sync are replicated to the destination system.
If an associated synchronous replication session exists between the source site and another destination site when performing this operation, the internal snapshots that are refreshed are replicated on the synchronous replication destination site.
Fail over a session in an unplanned emergency
Select Failover. For asynchronous replication, in response to an unplanned emergency scenario in which the source has become unavailable, failover should switch the status of the source and destination storage resources. After the failover operation, the destination object's status becomes read/write, however, the source and destination do not switch roles until a resume operation is run.
In this type of failover, any active data transfers are terminated, causing a potential loss of data. If the source site is still available when you perform a failover, the system attempts to change the source object from read/write to read-only.
For synchronous replication, in response to an emergency/unplanned synchronous replication failover when there is no network connectivity to the source system, use Failover from the destination system without switches, then Resume to restart the sessions on the destination system. This action also reverses the direction from destination to source. Or, instead of doing Resume, you could simply Failback to go back to the source. Also, if an associated asynchronous replication session exists between the source site and another destination site, perform the preserve async operation on the synchronous replication destination site.
Fail over a session in preparation for a planned downtime (for asynchronous replication only)
For asynchronous replication, select Failover with Sync. The destination synchronizes with the source storage resource, the replication session is stopped, and the status of the storage resources are switched. After the failover operation, the destination object's status becomes read/write and the source object's status is shown as Restricted Replication Access = Yes.
To perform this type of failover, both the source and destination objects of the session must be available.
For synchronous replication, use Failover from the source system, where sessions remain running and reversed back from the destination to the original source system. After the failover operation, the destination object's status becomes read/write and the source object's status is shown as Restricted Replication Access = Yes. To move back to the original configuration, run another Failover, this time from the destination system, to gracefully fail back to the original source system. A Resume is not required in this scenario because the sessions remain running.
Fail back a session
Select Failback. A failback operation switches the status of the storage resources following a failover operation. Once the destination synchronizes with the source again, the source storage resource's status returns to read/write and the destination storage resource's status is shown as Restricted Replication Access = Yes.
You can perform this action from the destination system only. Both the source and destination storage resources must be available to perform a successful failback operation.
Preserve an asynchronous replication session
Select Preserve. The preserve operation switches the asynchronous replication session related to the synchronous replication session to the active production site after the synchronous replication session (planned or unplanned) has been failed over or failed back.
Any modifications to the attributes of the source storage resource are not automatically synchronized over to the destination storage resource. When a failover occurs, ensure that you modify the attributes of the associated destination storage resource to match the attributes of the source storage resource.
Configure an override network address for file replication
If you have file replication configured with a destination site on a different physical network, to ensure minimal downtime during a failover, ensure that you modify the destination NAS server properties to include an override address for the network interface.
You may still need to manually fail over individual file systems associated with the NAS server.
If you have configured the source NAS server with LACP or FSN, or both, you must do one of the following:
• Configure the destination system with the same LACP or FSN configuration. When the LACP/FSN environment is mirrored on the destination system exactly, no further action is required and the destination NAS server will automatically select the LACP/FSN device as part of its configuration.
• Include an override address for the network interface after first creating the replication session.
After the replication session has been created and the source NAS server is using an LACP/FSN configuration, you must do the following:
1. Manually edit the Network settings in the Properties of the NAS server on the destination system.
2. Select Override address and an interface to use. If you do not do this, a DU after a failover from the source system to the destination system will occur.
To configure an override address on the destination NAS server:
Procedure
1. Under Storage, select File > NAS Servers.
2. On the Network tab, select the network interface, and click Edit.
3. On the Edit NAS Server Network Interface screen, select the Override address checkbox, and specify relevant address information.
|
{
"url": "https://www.delltechnologies.com/es-pe/documentation/unity-family/unity-p-replication-config/04-unity-rep-br-ui-config.htm",
"source_domain": "www.delltechnologies.com",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "110921",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2VJRI5NIFKUBPETZGDN6EMS6U7M4OT2L",
"WARC-Concurrent-To": "<urn:uuid:d216fea0-a51e-4773-96a4-22d473f073a5>",
"WARC-Date": "2021-01-20T10:21:52Z",
"WARC-IP-Address": "23.218.65.83",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FFJTDQZPTGEVFWGSRLQ7SOGDM3IIMM75",
"WARC-Record-ID": "<urn:uuid:fc562b1f-143a-4be3-9d7b-32b5de62b0ed>",
"WARC-Target-URI": "https://www.delltechnologies.com/es-pe/documentation/unity-family/unity-p-replication-config/04-unity-rep-br-ui-config.htm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8d8ccf01-6a11-4e9f-a92e-05d37487c842>"
},
"warc_info": "isPartOf: CC-MAIN-2021-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-59.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,
42,
43,
51,
52,
94,
95,
144,
145,
166,
167,
351,
352,
770,
771,
797,
798,
868,
903,
904,
974,
975,
1166,
1244,
1300,
1396,
1584,
1598,
1653,
1698,
1817,
1931,
2040,
2145,
2300,
2387,
2509,
2510,
2548,
2549,
2570,
2571,
2730,
2731,
2856,
2933,
3032,
3419,
3433,
3503,
3548,
3692,
3885,
4225,
4226,
4259,
4260,
4281,
4282,
4404,
4405,
4485,
4506,
4521,
4541,
4611,
4765,
4975,
5429,
5519,
5685,
5860,
6087,
6373,
7084,
7098,
7171,
7251,
7312,
7349,
7422,
7622,
7875,
8029,
8133,
8134,
8166,
8167,
8447,
8448,
8524,
8525,
8539,
8622,
8733,
8940,
8985,
9172,
9189,
9216,
9233,
9247,
9262,
9448,
9465,
9482,
9496,
9511,
9528,
9836,
9851,
9910,
9925,
9940,
9965,
9988,
10079,
10102,
10528,
10605,
10638,
11079,
11585,
11658,
11747,
12000,
12052,
12450,
12703,
13343,
13443,
13820,
13934,
14506,
14532,
14864,
15044,
15095,
15366,
15681,
15682,
15745,
15746,
16012,
16013,
16114,
16115,
16225,
16226,
16520,
16626,
16766,
16871,
17033,
17034,
17102,
17103,
17117,
17166,
17239
],
"line_end_idx": [
42,
43,
51,
52,
94,
95,
144,
145,
166,
167,
351,
352,
770,
771,
797,
798,
868,
903,
904,
974,
975,
1166,
1244,
1300,
1396,
1584,
1598,
1653,
1698,
1817,
1931,
2040,
2145,
2300,
2387,
2509,
2510,
2548,
2549,
2570,
2571,
2730,
2731,
2856,
2933,
3032,
3419,
3433,
3503,
3548,
3692,
3885,
4225,
4226,
4259,
4260,
4281,
4282,
4404,
4405,
4485,
4506,
4521,
4541,
4611,
4765,
4975,
5429,
5519,
5685,
5860,
6087,
6373,
7084,
7098,
7171,
7251,
7312,
7349,
7422,
7622,
7875,
8029,
8133,
8134,
8166,
8167,
8447,
8448,
8524,
8525,
8539,
8622,
8733,
8940,
8985,
9172,
9189,
9216,
9233,
9247,
9262,
9448,
9465,
9482,
9496,
9511,
9528,
9836,
9851,
9910,
9925,
9940,
9965,
9988,
10079,
10102,
10528,
10605,
10638,
11079,
11585,
11658,
11747,
12000,
12052,
12450,
12703,
13343,
13443,
13820,
13934,
14506,
14532,
14864,
15044,
15095,
15366,
15681,
15682,
15745,
15746,
16012,
16013,
16114,
16115,
16225,
16226,
16520,
16626,
16766,
16871,
17033,
17034,
17102,
17103,
17117,
17166,
17239,
17374
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 17374,
"ccnet_original_nlines": 159,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3551465570926666,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02283572033047676,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14417177438735962,
"rps_doc_frac_unique_words": 0.1708463877439499,
"rps_doc_mean_word_length": 5.390674114227295,
"rps_doc_num_sentences": 148,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.031640529632568,
"rps_doc_word_count": 2552,
"rps_doc_frac_chars_dupe_10grams": 0.07007341831922531,
"rps_doc_frac_chars_dupe_5grams": 0.2714254558086395,
"rps_doc_frac_chars_dupe_6grams": 0.19808098673820496,
"rps_doc_frac_chars_dupe_7grams": 0.14160063862800598,
"rps_doc_frac_chars_dupe_8grams": 0.1024932786822319,
"rps_doc_frac_chars_dupe_9grams": 0.08243075758218765,
"rps_doc_frac_chars_top_2gram": 0.03663589060306549,
"rps_doc_frac_chars_top_3gram": 0.021807080134749413,
"rps_doc_frac_chars_top_4gram": 0.01170312985777855,
"rps_doc_books_importance": -1544.362548828125,
"rps_doc_books_importance_length_correction": -1544.362548828125,
"rps_doc_openwebtext_importance": -749.8091430664062,
"rps_doc_openwebtext_importance_length_correction": -749.8091430664062,
"rps_doc_wikipedia_importance": -684.5469970703125,
"rps_doc_wikipedia_importance_length_correction": -684.5469970703125
},
"fasttext": {
"dclm": 0.03138523921370506,
"english": 0.8661131262779236,
"fineweb_edu_approx": 2.3536489009857178,
"eai_general_math": 0.5555795431137085,
"eai_open_web_math": 0.170446515083313,
"eai_web_code": 0.44343101978302
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.462",
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,631,426,907,362,290,000 |
Mediana
Mediana to tak zwana wartość środkowa, którą wyznaczamy z jakiegoś zbioru liczb. To co jest jednak niezwykle istotne to fakt, iż liczby w tym zbiorze muszą być uporządkowane od najmniejszej do największej (precyzyjniej rzecz ujmując: w kolejności niemalejącej). Dopiero w takim uporządkowanym zbiorze możemy wyznaczać medianę. Podczas wyznaczania mediany musimy rozpatrzeć dwa przypadki:
1. Gdy mamy nieparzystą liczbę wyrazów w zbiorze – wtedy mediana jest równa środkowej liczbie.
2. Gdy mamy parzystą liczbę wyrazów w zbiorze – wtedy mediana jest równa średniej arytmetycznej dwóch środkowych liczb.
Spójrzmy jak to wygląda na konkretnych przykładach:
Przykład 1. Oblicz medianę liczb: \(6,3,4,1,5\).
Na początek musimy ustawić te liczby w porządku niemalejącym, zatem:
$$1,3,4,5,6$$
W tym zbiorze mamy pięć liczb, zatem jest to nieparzysta ilość. To oznacza, że medianą jest środkowy wyraz, czyli w tym przypadku trzecia liczba, którą jest \(4\).
Przykład 2. Oblicz medianę liczb: \(-4,8,9,5,-12\).
Ustawiając liczby w porządku niemalejącym otrzymamy:
$$-12,-4,5,8,9$$
W tym zbiorze mamy także nieparzystą ilość liczb, zatem mediana jest równa środkowej liczbie, czyli w tym przypadku będzie to \(5\).
Przykład 3. Oblicz medianę liczb: \(3,2,6,8,9,12\).
Ustawiając liczby w porządku niemalejącym otrzymamy:
$$2,3,6,8,9,12$$
Tym razem mamy parzystą ilość wyrazów (dokładnie jest to sześć liczb). W związku z tym musimy wziąć dwa środkowe wyrazy i obliczyć z nich średnią arytmetyczną. W naszym przypadku środkowymi wyrazami są wyraz trzeci i czwarty, czyli \(6\) oraz \(8\):
$$\frac{6+8}{2}=\frac{14}{2}=7$$
To oznacza, że mediana jest równa \(7\).
W tym przykładzie zwróć uwagę na to, że mediana jest równa liczbie, która w ogóle w naszym zbiorze nie wystąpiła!
Przykład 4. Dany jest zbiór liczb: \(2,5,1,8,9,x\). Mediana jest równa \(6\). Oblicz wartość \(x\).
To chyba najtrudniejszy przykład zadań z medianą, bo trzeba po prostu dobrze przeanalizować sytuację. Na początku ustawmy znane nam liczby w porządku niemalejącym:
$$1,3,5,8,9$$
Do tego zbioru dojdzie nam jeszcze \(x\), czyli będziemy mieć parzystą liczbę wyrazów (mediana będzie zatem równa średniej arytmetycznej środkowych wyrazów). I tu pojawia się kluczowe pytanie – które to liczby będą tymi środkowymi? Przecież nie znamy wartości iksa, a to od niej teraz wszystko będzie zależeć. Przykładowo, gdy \(x=2\), to środkowymi wyrazami będą \(3\) oraz \(5\), ale kiedy np. \(x=100\) to środkowymi wyrazami będą \(5\) oraz \(8\). I właśnie w ten sposób powinniśmy zaobserwować, że nasz \(x\) musi brać udział w liczeniu średniej arytmetycznej, bo przecież kiedy środkowymi wyrazami będą \(3\) oraz \(5\), to mediana będzie równa \(\frac{3+5}{2}=4\), a kiedy środkowymi wyrazami będą \(5\) oraz \(8\), to mediana wyniesie \(\frac{5+8}{2}=6,5\). Możemy więc wywnioskować, że \(x\) będzie jedną z wartości środkowych, a jego wartość będzie równa:
$$\frac{5+x}{2}=6 \\
5+x=12 \\
x=7$$
Jest to jedyna możliwość aby mediana była równa \(6\), zatem \(x=7\).
0 komentarzy
Inline Feedbacks
View all comments
|
{
"url": "https://szaloneliczby.pl/mediana/",
"source_domain": "szaloneliczby.pl",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "72337",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IZYWX4EGSAQ6FX6CJBMQKUG6IN6G6SIM",
"WARC-Concurrent-To": "<urn:uuid:464a636a-e6ec-4bb7-98a7-71b06feaa27b>",
"WARC-Date": "2020-10-28T10:37:29Z",
"WARC-IP-Address": "77.79.244.87",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NIXRNIWBOUMVMCQZDYR4OM7PSK6KN4Z2",
"WARC-Record-ID": "<urn:uuid:b6c109ba-5050-499f-b682-a31927adee14>",
"WARC-Target-URI": "https://szaloneliczby.pl/mediana/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e9a04833-44fe-4664-873b-812dd9b44787>"
},
"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-44.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,
397,
398,
493,
613,
614,
666,
667,
716,
717,
786,
800,
801,
965,
966,
1018,
1019,
1072,
1089,
1090,
1223,
1224,
1276,
1277,
1330,
1347,
1348,
1598,
1631,
1632,
1673,
1674,
1788,
1789,
1889,
1890,
2054,
2068,
2069,
2935,
2956,
2966,
2972,
2973,
3043,
3044,
3057,
3074
],
"line_end_idx": [
8,
9,
397,
398,
493,
613,
614,
666,
667,
716,
717,
786,
800,
801,
965,
966,
1018,
1019,
1072,
1089,
1090,
1223,
1224,
1276,
1277,
1330,
1347,
1348,
1598,
1631,
1632,
1673,
1674,
1788,
1789,
1889,
1890,
2054,
2068,
2069,
2935,
2956,
2966,
2972,
2973,
3043,
3044,
3057,
3074,
3091
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3091,
"ccnet_original_nlines": 49,
"rps_doc_curly_bracket": 0.006470399908721447,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.07737226039171219,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01021897979080677,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.40437954664230347,
"rps_doc_frac_unique_words": 0.4840182662010193,
"rps_doc_mean_word_length": 5.689497947692871,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.953114986419678,
"rps_doc_word_count": 438,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.14646869897842407,
"rps_doc_frac_chars_dupe_6grams": 0.1260032057762146,
"rps_doc_frac_chars_dupe_7grams": 0.036918140947818756,
"rps_doc_frac_chars_dupe_8grams": 0.036918140947818756,
"rps_doc_frac_chars_dupe_9grams": 0.036918140947818756,
"rps_doc_frac_chars_top_2gram": 0.009630819782614708,
"rps_doc_frac_chars_top_3gram": 0.04093097895383835,
"rps_doc_frac_chars_top_4gram": 0.046548958867788315,
"rps_doc_books_importance": -296.52880859375,
"rps_doc_books_importance_length_correction": -296.52880859375,
"rps_doc_openwebtext_importance": -134.5669708251953,
"rps_doc_openwebtext_importance_length_correction": -134.5669708251953,
"rps_doc_wikipedia_importance": -131.16819763183594,
"rps_doc_wikipedia_importance_length_correction": -131.16819763183594
},
"fasttext": {
"dclm": 0.8896750211715698,
"english": 0.0002926599991042167,
"fineweb_edu_approx": 1.3745218515396118,
"eai_general_math": 0.00011419999646022916,
"eai_open_web_math": 0.9252166748046875,
"eai_web_code": 0.42548054456710815
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
},
"secondary": {
"code": "372.7",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Elementary and Kindergarten"
}
}
},
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-502,268,103,807,002,750 |
読者です 読者をやめる 読者になる 読者になる
tweeeetyのぶろぐ的めも
アウトプットが少なかったダメな自分をアウトプット<br>＼(＾o＾)／
ファイル名の一覧を表示する(find vs ls コマンド)
ファイル名の一覧ってたまーに欲しいときありますよね？
そう、今まさに欲しかったんだけど。。しかも絶対パスで。
lsとかfindのオプションなんだっけなーと思ってぐぐっては忘れるので
そんな自分のためにメモ。
ファイルの構成がこんな感じだったとします
/tmp─dirA┬dirB
│
└dirC┬sampleFile1.txt
├sampleFile2.txt
└sampleFile3.txt
lsでのファイル名一覧(パス無し）
ls -1(1行に1ファイルずつ表示)
#ls -1 /tmp/dirA
dirB
dirC
ls -R(ディレクトリ内容を再帰的に表示)
#ls -R /tmp/dirA
/tmp/dirA:
dirB dirC
/tmp/dirA/dirB:
/tmp/dirA/dirC:
sampleFile1.txt sampleFile2.txt sampleFile3.txt
ls -1R
#ls -1R /tmp/dirA
/tmp/dirA:
dirB
dirC
/tmp/dirA/dirB:
/tmp/dirA/dirC:
sampleFile1.txt
sampleFile2.txt
sampleFile3.txt
# cd /tmp/dirA/dirC ; ls -1R
.:
sampleFile1.txt
sampleFile2.txt
sampleFile3.txt
findでのファイル名一覧（絶対パス付)
find
#find /tmp/dirA
/tmp/dirA
/tmp/dirA/dirB
/tmp/dirA/dirC
/tmp/dirA/dirC/sampleFile3.txt
/tmp/dirA/dirC/sampleFile1.txt
/tmp/dirA/dirC/sampleFile2.txt
find -type f（ファイルのみ）
#find /tmp/dirA -type f
/tmp/dirA/dirC/sampleFile3.txt
/tmp/dirA/dirC/sampleFile1.txt
/tmp/dirA/dirC/sampleFile2.txt
#find /tmp/dirA -type f | sort
/tmp/dirA/dirC/sampleFile1.txt
/tmp/dirA/dirC/sampleFile2.txt
/tmp/dirA/dirC/sampleFile3.txt
ついでですが、lsのオプションで使えそうなのも追記メモ
ls -m（カンマ区切りで表示)
#cd /tmp/dirA/dirC ; ls -m
sampleFile1.txt, sampleFile2.txt, sampleFile3.txt
ls -s(ファイル名の左側に容量をキロ・バイト単位で表示)
#cd /tmp/dirA ; ls -s
合計 8
4 dirB 4 dirC
ls -sh(h:単位などを読みやすい形式で表示)
#cd /tmp/dirA ; ls -sh
合計 8.0K
4.0K dirB 4.0K dirC
ls -sh(h:単位などを読みやすい形式で表示)
#cd /tmp/dirA ; ls -sh
合計 8.0K
4.0K dirB 4.0K dirC
ls -I パターン(パターンにマッチするファイルは表示しない)
#cd /tmp/dirA/dirC ; ls -1
dirD
sampleFile1.txt
sampleFile2.txt
sampleFile3.txt
#cd /tmp/dirA/dirC ; ls -1 -I *3* (3がつくファイルを除く)
dirD
sampleFile1.txt
sampleFile2.txt
|
{
"url": "http://tweeeety.hateblo.jp/entry/20121128/1354096757",
"source_domain": "tweeeety.hateblo.jp",
"snapshot_id": "crawl=CC-MAIN-2017-17",
"warc_metadata": {
"Content-Length": "44113",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YBIJQDGOFGF3JYRUXH2LNQSUQPTWHS5Z",
"WARC-Concurrent-To": "<urn:uuid:12e3468d-a644-48e7-b2e3-67a993f409e7>",
"WARC-Date": "2017-04-28T00:33:01Z",
"WARC-IP-Address": "52.197.171.58",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:RYPO7VDRF4OQODLAPDGEYGXWDE2HIW7M",
"WARC-Record-ID": "<urn:uuid:f7586b9d-5546-4a2f-833c-eda6e7153725>",
"WARC-Target-URI": "http://tweeeety.hateblo.jp/entry/20121128/1354096757",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:07336589-a377-454f-a885-bd388034addb>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-145-167-34.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-17\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 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,
24,
25,
41,
42,
78,
79,
110,
111,
138,
166,
167,
203,
216,
217,
238,
239,
254,
266,
298,
331,
364,
365,
383,
384,
404,
421,
426,
431,
454,
471,
482,
493,
494,
510,
511,
527,
577,
584,
602,
613,
618,
623,
624,
640,
641,
657,
673,
689,
705,
706,
841,
844,
860,
876,
892,
893,
914,
915,
920,
936,
946,
961,
976,
1007,
1038,
1069,
1090,
1114,
1145,
1176,
1207,
1208,
1239,
1270,
1301,
1332,
1333,
1361,
1362,
1379,
1406,
1456,
1487,
1509,
1514,
1529,
1555,
1578,
1586,
1607,
1633,
1656,
1664,
1685,
1718,
1745,
1750,
1766,
1782,
1798,
1799,
1847,
1852,
1868
],
"line_end_idx": [
24,
25,
41,
42,
78,
79,
110,
111,
138,
166,
167,
203,
216,
217,
238,
239,
254,
266,
298,
331,
364,
365,
383,
384,
404,
421,
426,
431,
454,
471,
482,
493,
494,
510,
511,
527,
577,
584,
602,
613,
618,
623,
624,
640,
641,
657,
673,
689,
705,
706,
841,
844,
860,
876,
892,
893,
914,
915,
920,
936,
946,
961,
976,
1007,
1038,
1069,
1090,
1114,
1145,
1176,
1207,
1208,
1239,
1270,
1301,
1332,
1333,
1361,
1362,
1379,
1406,
1456,
1487,
1509,
1514,
1529,
1555,
1578,
1586,
1607,
1633,
1656,
1664,
1685,
1718,
1745,
1750,
1766,
1782,
1798,
1799,
1847,
1852,
1868,
1883
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1883,
"ccnet_original_nlines": 104,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.022267209365963936,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02631578966975212,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5404858589172363,
"rps_doc_frac_unique_words": 0.38461539149284363,
"rps_doc_mean_word_length": 8.775641441345215,
"rps_doc_num_sentences": 37,
"rps_doc_symbol_to_word_ratio": 0.02631578966975212,
"rps_doc_unigram_entropy": 3.6709790229797363,
"rps_doc_word_count": 156,
"rps_doc_frac_chars_dupe_10grams": 0.08327245712280273,
"rps_doc_frac_chars_dupe_5grams": 0.26150473952293396,
"rps_doc_frac_chars_dupe_6grams": 0.26150473952293396,
"rps_doc_frac_chars_dupe_7grams": 0.20891161262989044,
"rps_doc_frac_chars_dupe_8grams": 0.20891161262989044,
"rps_doc_frac_chars_dupe_9grams": 0.20891161262989044,
"rps_doc_frac_chars_top_2gram": 0.12271731346845627,
"rps_doc_frac_chars_top_3gram": 0.1533966362476349,
"rps_doc_frac_chars_top_4gram": 0.032140251249074936,
"rps_doc_books_importance": -233.05845642089844,
"rps_doc_books_importance_length_correction": -233.0554656982422,
"rps_doc_openwebtext_importance": -113.14007568359375,
"rps_doc_openwebtext_importance_length_correction": -113.14007568359375,
"rps_doc_wikipedia_importance": -78.87712097167969,
"rps_doc_wikipedia_importance_length_correction": -78.87712097167969
},
"fasttext": {
"dclm": 0.9306939244270325,
"english": 0.047284141182899475,
"fineweb_edu_approx": 1.1848349571228027,
"eai_general_math": 0.008012290112674236,
"eai_open_web_math": 0.005069550126791,
"eai_web_code": 0.914142370223999
}
}
|
{
"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": "005.442",
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,087,185,211,548,639,000 |
Question Types
text
Use for questions that require a text response. It can also be used with the numbers appearance to get integer responses that are longer than the 9 character limit of the integer type.
Type
text
Parameters:
• rows: Set the number of rows of text shown in the form
Appearances:
• numbers: Shows the numeric keyboard
• thousands-sep: Inserts a separator between thousands when “numbers” is also used
• url: Allows the user to open a URL. Specify the url in the default column
• hidden: Hide the widget in fieldTask
Availability:
• FieldTask: yes
• Webforms: yes
Example
Survey Worksheet
type name label parameters
text comment Any comments? rows=5
_images/widget-text.jpg
Text widget in fieldTask with 5 rows
_images/widget-text-webform.jpg
Text widget in webforms with 5 rows
Note
There is a limit of 4,000 characters on the amount of text that can be entered into a text question in webforms. However there is no corresponding limit in fieldTask.
note
Type
note
A read only note to the user.
Notes can be used to provide guidance to the user. This could some simple text that is specified in the survey template. For example:
The following questions are about health
However they can also be dynamically constructed to provide context sensitive help. To do this use the ${question_name} syntax within the label of the note. The question referred to can be a calculate that creates the text by combining answers from multiple questions.
Survey Worksheet
type name label calculation
text name What is your name?
calculate calculate_guidance concat(‘Tell ‘, ${name}, ‘ that they are doing well’)
note guidance ${calculate_guidance}
integer
Number questions that don’t allow a decimal point and are not longer than 9 digits.
Type
integer
Appearances:
• thousands-sep: Inserts a separator between thousands
• hidden: Hide the widget in fieldTask
Availability:
• FieldTask: yes
• Webforms: yes
Example
Survey Worksheet
type name label
integer age What is your age?
decimal
Number question with a decimal point. Decimal questions are limited to 14 digits plus the decimal point. You can use a text question with the numbers appearance if you need more.
Type
decimal
Appearances:
• thousands-sep: (Optional) Inserts a separator between thousands
Availability:
• FieldTask: yes
• Webforms: yes
Example
Survey Worksheet
type name label
decimal cost How much did it cost?
bearing
A bearing widget captures the compass reading and stores it as a decimal type.
Type
decimal
Required Appearance:
• bearing
Availability:
• FieldTask: yes
• Webforms: no
Example
Survey Worksheet
type name label appearance
decimal orientation Record the orientation bearing
_images/widget-bearing.jpg
Bearing
barcode
Type
barcode
Appearances:
• front: (Optional) Use the front facing camera
Reads a barcode using the camera.
The following barcode formats are supported:
• UPC-A
• UPC-E
• EAN-8
• EAN-13
• Code 39
• Code 93
• Code 128
• Codabar
• ITF
• RSS-14
• RSS-Expanded
• QR Code
• Data Matrix
• Aztec (beta)
• PDF 417 (beta)
• MaxiCode
The flash can be used as a light source when scanning barcodes in a poorly lit environment.
survey
type name label
barcode product Scan the products barcode
Recording a bar code using the rear facing camera
barcode
nfc
Type
barcode
Required Appearances: nfc
Reads the id on an NFC chip
survey
type name label appearance
barcode product Scan the products NFC chip nfc
Recording an nfc id
nfc
date, time and datetime
default date type
Type
date
Availability:
FieldTask: yes Webforms: yes
Example
Survey Worksheet
type name label
date birthdate When were you born?
_images/widget-date.jpg
Default date type
date widget with spinner input
A more compact date widget that makes it easy to select dates that are far from the current (or default) date.
Type
date
Appearance:
no-calendar
Survey Worksheet
type name label appearance
date birthdate When were you born? no-calendar
_images/widget-date-spinner.jpg
Default Date type
month and year only
Only records the month and the year.
Type
date
Appearance:
month-year
Survey Worksheet
type name label appearance
date birth_month What month were you born? month-year
year only
Only records the year.
Type
date
Appearance:
year
Survey Worksheet
type name label appearance
date birth_year What year were you born? year
date widgets with non-Gregorian calendars
Note
The non-Gregorian calendar is used only on input. The dates are then converted and stored as standard Gregorian dates
Availability:
• FieldTask: yes
• Webforms: no
Bikram Sambat calendar
Type
date
Appearance:
bikram-sambat
_images/widget-date-bikram.jpg
Coptic calendar
Type
date
Appearance:
coptic
_images/widget-date-coptic.jpg
Ethiopian calendar
Type
date
Appearance:
ethiopian
_images/widget-date-ethiopian.jpg
Islamic calendar
Type
date
Appearance:
islamic
_images/widget-date-islamic.jpg
Myanmar calendar
Type
date
Appearance:
myanmar
_images/widget-date-myanmar.jpg
Persian calendar
Type
date
Appearance:
persian
_images/widget-date-persian.jpg
time
Records the time of day.
Note
The time is stored along with the time zone. Hence a point in time is recorded. If you record a time of 10:00 am in London then the value is the same as 8pm in Sydney. If someone in Sydney generates a report using their local timezone then they will see the result as 8pm.
If you want to record a local time then you can use an integer type or decimal type or a select_one type that has a list of valid times. A question like “What time did the parcel arrive?” could be recorded with or without timezone depending on how you want to analyse the data.
Type
time
Survey Worksheet
type name label
time arrived What time did the parcel arrive?
datetime
Records the date and time
Type
dateTime
Appearance:
no-calendar: Shows a spinner rather than the full calendar
Survey Worksheet
type name label
dateTime started When did you start the project?
select
single select
Type
select_one
Appearance:
• minimal: Shows a modal dropdown that expands when selected by the user. Useful when showing multiple questions on one page.
• autoadvance: Immediately go to the next page after a choice is selected. Only use this appearance if it is immediately obvious to the user that the correct selection was made
• autocomplete: Adds a text box above the choices. If you type into this text box the choices are filtered. Use with large lists.
• likert: Show the choices in a likert scale
• compact: shows the choices in a compact grid. This is particularly useful when you have only images for the choices rather than text labels.
• compact-{x}: As per compact however replace {x} with the number of columns that you want.
• quickcompact: Combines compact and auto advance
• quickcompact-{x}: Combines compact with columns and auto advance
Parameters:
• randomize=true (Will randomly sort the choices each time the question is shown)
• seed={an integer} (Use this with random so that the same initially random order will be shown each time the question is shown in a given form)
Survey Worksheet
type name label
select_one countries country Select a country
Choices Worksheet
list_name name label
countries mali Mali
countries png Papua New Guinea
countries australia Australia
countries vanuatu Vanuatu
multi select
Allows the user to select multiple answers from a choice list.
Type
select
Appearance:
• minimal: Shows a modal dropdown that expands when selected by the user. Useful when showing multiple questions on one page.
• autocomplete: Adds a text box above the choices. If you type into this text box the choices are filtered. Use with large lists.
• compact: shows the choices in a compact grid. This is particularly useful when you have only images for the choices rather than text labels.
• compact-{x}: As per compact however replace {x} with the number of columns that you want.
Parameters:
• randomize=true (Will randomly sort the choices each time the question is shown)
• seed={an integer} (Use this with random so that the same initially random order will be shown each time the question is shown in a given form)
Survey Worksheet
type name label
select countries country Select some countries
Choices Worksheet
list_name name label
countries mali Mali
countries png Papua New Guinea
countries australia Australia
countries vanuatu Vanuatu
rank
This widget allows you to rank choices in order.
Type
rank
Parameters:
• randomize=true (Will randomly sort the choices each time the question is shown)
• seed={an integer} (Use this with random so that the same initially random order will be shown each time the question is shown in a given form)
Survey Worksheet
type name label
rank importance importance Rank the issues in order of importance
Choices Worksheet
list_name name label
importance food Food
importance shelter Shelter
importance water Water
importance security Security
The rank widget opened showing the choices that can be re-ordered
rank widget before re-ordering
The rank widget opened showing the choices after they have been re-ordered
rank widget after re-ordering
Viewing Recorded Rankings
When results are exported in the default spreadsheet format they will be shown in multiple columns. One for each choice. The column headings will be take from the question name with the addition of “1”, “2”, “3” etc. The first column will contain the choice that was ranked first and so on.
The chosen ranking shown in a report
Spreadsheet report of rankings
In other view of the collected data, such as in the console, the rankings will be shown in compressed format where they are all placed in a single column, in rank order, with a space between each value.
image
Taking a Picture
Type
image
Captures an image either using the camera or by selecting from the device gallery.
Survey Worksheet
type name label
image picture_of_tree Take a picture of the tree
image with annotation
Draw on an image after it has been captured. An additional button labelled “Markup Image” is shown that is enabled after the image is captured.
Type
image
Appearance:
annotate
Survey Worksheet
type name label
image damage Take a photo and circle the damage
An image after the user has annotated it by circling an item of interest
Annotate Type
image as a drawing
Type
image
Appearance:
draw
This is similar to annotate except the user draws on a blank canvas.
Survey Worksheet
type name label appearance
image draw_farm_layout Draw a plan of the farm
image as a signature
Type
image
Appearance:
signature
Allows the user to draw a signature of their name.
table
type name label appearance
image hh_signature Ask houeholder to sign the screen signature
Other Image appearances and parameters
Require a new image
The default behavour is to include a button that allows the user to select an existing image rather than taking a new one. However by adding the appearance “new” the user is requried to capture a new image.
Self portrait (selfie) image
The back camera on the phone is used by default (although the user can change this). However by setting the appearance “new-front” the front camera is used by default to capture a selfie.
Note
selfie can also be used as the appearance.
Reducing the size of images
The size can be reduced by specifying the maximum length of the longest side of the image using max-pixels. For example if the default picture size is 1,000 by 500 and you specify the max-pixels to be 200, then the image will be resized to 200 by 100 pixels.
In the parameters column add max-pixels= followed by the maximum length of the long edge in pixels.
Note
The proportions of the image are maintained and if the length of the longest side was less than max-pixels the image will not be changed.
Acknowledge / Trigger
Type
trigger or acknowledge
You can use a type of either trigger or acknowlwdge, they work the same way. A single checkbox is shwown which the user can “acknowledge” by checking it. If they do this then the answer stored for the question is “OK”.
You can use the above answer in relevance for following questions. For example:
${ack} = 'OK'
Commonly select_one questions with yes/no choices are used instead of Acknowledge
Survey Sheet
type name label relevance
acknowledge ack Select to confirm participation
text name What is your name? ${ack} = ‘OK’
The trigger widget shown in fieldTask after the checkbox has been selected
Acknowledge widget in fieldTask
In WebForms a radio button is used instead of a checkbox.
The trigger widget shown in WebForms after the checkbox has been selected
Acknowledge widget in WebForms
Printer widget
Type
text
Required appearance
printer:org.opendatakit.sensors.ZebraPrinter
Connects to an external label printer, and prints labels that can contain a barcode, a QR code, or text.
Survey Sheet
type name label appearance calculation
text printer_widget Printer widget printer:org.opendatakit.sensors.ZebraPrinter concat(‘123456789’,’<br>’,’QR CODE’,’<br>’,’Text’)
range
These widgets allow the user to select a numeric value within a range of numbers shown on a line.
Type
range
Parameters
start: The starting number end: The last number step: The increment between numbers
Range widget with integers
If all three parameter values are integers then input will also be stored as an integer.
Survey Worksheet
type name label parameters
range eggs number_of_eggs How many eggs are there? start=0;end=48;step=12
A range widget shown in fieldTask with a start point of 0, end of 48 and step of 12. 36 has been selected as the answer
Integer Range widget in fieldTask
A range widget shown in Webforms with a start point of 0, end of 48 and step of 12
Integer Range widget in WebForms
Range widget with decimals
If one or more of the 3 parameters (start, end, step) are decimal then the answer will also be recorded as a decimal value.
Vertical range widget
Appearance
vertical
A vertical range widget shown in fieldTask with a start point of 1, end of 10 and step of 1
Vertical Range widget in fieldTask
A vertical range widget shown in Webforms with a start point of 1, end of 10 and step of 1
Vertical Range widget in WebForms
Range widget with picker
Appearance
picker
Availability:
• FieldTask: yes
• Webforms: no
When picker is added as an appearance the answer can be selected from a spinner rather than by clicking at a point on a line.
A picker range widget with a start point of 1, end of 10 and step of 1
Vertical Range widget in WebForms
Range widget with rating
Appearance
rating
When rating is specified as the appearance then the range is shown as stars which the user can select. The number of stars is equal to the value of the end parameter. The start and step parameters are ignored. Hence the value set is equal to the number of the start selected counting from the left.
Survey Worksheet
type name label appearance parameters
range rating Rate your experience rating end=5
A rating range widget with a start showing 5 stars of which the 4th has been selected
Rating Range widget in fieldTask
Chart
Type
chart
Shows a chart in the survey. Chart settings are specified in the question parameters. More details are available in Charts
Availability:
• FieldTask: yes
• Webforms: no
Child Form / Parent Form
Type
child_form, parent_form
Launches another survey from within the current survey. The difference between these is in how the data from the two surveys are linked in the results database. If you don’t care about linking the data between the two surveys then either type will do. Detailed information on using these question types is available in Launch a Survey from inside a Survey.
Availability:
• FieldTask: yes
• Webforms: no
Locations
Location widgets capture one or more points as latitude, longitude, altitude in meters, and accuracy radius in meters. These data items are space separated. For example the following reading represents a lattitude of -18.27, a longitude of 27.32, an altitude of 25 meters and an accuracy of 5.6 meters: -18.27 27.32 25 5.6
Multiple points that form lines or shapes are separated by semicolons.
Availability:
• FieldTask: yes
• Webforms: yes
Multiple Locations in one Form
Prior to Smap server version 20.10 you could only put one location widget in each form of a survey. The reasoning behind this was that in GIS shape files the same restriction applies where each shape file consists of a single location and all the attributes associated with that location. Also the name of each location question was automatically set to “the_geom”. I’m afraid to say this was just done to make the coding easier!
In version 20.10 this restriction has been lifted:
• You can add multiple location questions in any form as well as the location preload in the top level form.
• Location questions keep the name that you give them.
• When you export a survey as a shape file you can select the location to use. All other questions are assumed to be attributes of that location.
• When viewing a map of a survey on the analysis page you can select the question to use as the location.
• When creating a task from existing data the location of the task is determined automatically. Firstly it tries to get the first geopoint question in the source survey. If that does not exist it tries to use the location preload that might have been collected automatically. If that is not set then it will use the first geotrace or geoshape question that it finds.
• The map in the console currently uses the first location it finds in the survey. This will be fixed in a later release.
Warning
You may have an existing survey that you created using a spreadsheet and perhaps you have a geopoint question in that survey which you called “pump_location”. Once your server is updated to 20.10 and you use the “replace” button to update the existing survey then a new column will be created in the database called “pump_location” to hold that location data. However any previously collected data will be stored in a column called “the_geom” and will no longer be accessible. You will see a warning in red if this happens when you do the replace.
In this circumstance, if you still need to access the old location data, then edit your survey in excel and change the name of the geopoint to “the_geom” Then replace the survey on you can redo the replace action.
geopoint
records a single point
Type
geopoint
survey
type name label
geopoint the_geom Record Location
Results presented after a geopoint button has been pressed showing location and accuracy
Results after requesting a geopoint
Geopoint with a background map
Type
geopoint
Appearance
maps
Geopoint with a user selected location
Type
geopoint
Appearance
placement-map
geotrace
Records a line
Type
geotrace
geoshape
Records a shape.
Type
geoshape
Matrix
The begin matrix type is a convenient way to show questions in a matrix structure using webforms.
_images/widget-matrix.jpg
Matrix Widget
To create the matrix, group the questions that will appear horizontally, however instead of using begin group/end group use begin matrix/end matrix. Because these questions are appearing horizontally there will be a limit to how many you can fit on the screen comfortably.
Then specify the rows of the matrix in a choice list in the choices worksheet. Put the name of the choice list used by the matrix in the “list name” column of the survey worsheet. As these choices create the rows of the matrix you can add as many as you like and the matrix will simply extend down the page.
Finally in the settings sheet, under “style” add “theme-grid”.
When you load the survey onto the server additional questions will be created in groups. One group for each of the choices and a group for the header. Hence the matrix type is not a real type as it is converted into multiple other questions on upload.
Type
begin matrix, end matrix
Example
Survey Sheet:
type name label list name
begin matrix nutrition items food_groups
select_one yn available Available
integer quantity Quantity
text comment Comment
end matrix
Choices Sheet:
list_name name label
food_groups vegetables Vegetables
food_groups protein Protein
food_groups fruit Fruit
food_groups dairy Dairy
food_groups sugar Fats and sugar
yn yes yes
yn no no
Example Form
Availability:
• FieldTask: no
• Webforms: yes
• XLSForm: yes
• Online Editor: no
Literacy Test
Type
select
Appearance:
• literacy
body::kb:flash
• Set to the interval between the Start button being pressed and the screen flashing to indicate that reading progress (word reached) should be recorded.
Availability:
• FieldTask: no
• Webforms: yes
• XLSForm: yes
• Online Editor: no
The literacy widget after the flash timer has gone off which results in a yellow background. Two words are marked as causing problems and are crossed out
Literacy widget after the flash and before the user marks progress made at point flash occured
1. When the widget is first shown it appears with a list of the words to be read and a Start button. It is assumed that the interviewee has a list of the words to be read as well and the enumerator will be recording their reading performance in webForms.
2. After the enumerator presses the Start button, the timer is started. This will cause the screen to flash after the specified number of seconds or 60 seconds if no number is specified in body::kb:flash. During this period the enumerator can select words that the reader finds difficult.
3. After the screen flashes the enumerator will be able to select the word that the reader had reached. They can then continue to select words that the reader is having trouble with.
4. After starting a Finish button is shown. When the enumerator presses Finish the timer stops. They can then record the final word read.
Viewing Literacy Results
When you view the output in the console it appears in its raw format. That is a number of values spearated by spaces including:
• The index of the word being read when the screen flashed
• The time in seconds elapsed before the Finish button is pressed
• The index of the word being read when the Finish button was pressed
• The text “null null null null null null null”
• A space separated list of the words that were marked as being wrong or difficult for the reader.
Support for literacy widgets has been added to the default Excel export from the analysis page. This formats the output to make it easier to analyse. Four additional columns are automatically added to the export for each literacy widget. These record:
• The total time elapsed between pressing Start and Finish
• The index of the word being read when the screen flashed
• The index of the word being read when the finish button was pressed
• The count of words that were marked as being difficult or in error
The recording of which words the reader had trouble with then behaves like any other select question. If you specify “Compress select multiples” for the export then they will be shown as a comma separated list of choice values. Otherwise a column in the export will be added for each word choice and the value will be set to “1” if the word was a problem or “0” if it was not. This allows you to easily add up the number of times each word was marked as a problem.
|
{
"url": "https://smap.com.au/docs/ref-question-types.html",
"source_domain": "smap.com.au",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "80799",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RTBBYN6LIEEEV7TMU4DDMBPJDV5N4EDZ",
"WARC-Concurrent-To": "<urn:uuid:addf4f04-b5da-47f5-b0f9-f4d11f0ced2f>",
"WARC-Date": "2021-01-25T11:46:02Z",
"WARC-IP-Address": "18.233.229.221",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QLZ4M6REFAEDD5OOU3OW5BDWHKAJVQTF",
"WARC-Record-ID": "<urn:uuid:c5acf213-8b3b-43d2-ad23-cbe4e656d3e5>",
"WARC-Target-URI": "https://smap.com.au/docs/ref-question-types.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:580e05cf-a784-4a41-8e63-584d1a20423f>"
},
"warc_info": "isPartOf: CC-MAIN-2021-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-12.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,
21,
22,
207,
208,
213,
218,
219,
231,
232,
291,
292,
305,
306,
346,
431,
509,
550,
551,
565,
566,
585,
603,
604,
612,
613,
630,
657,
691,
715,
716,
753,
754,
786,
787,
823,
824,
829,
830,
997,
998,
1003,
1004,
1009,
1014,
1015,
1045,
1046,
1180,
1181,
1222,
1223,
1492,
1493,
1510,
1538,
1569,
1654,
1692,
1693,
1701,
1702,
1786,
1787,
1792,
1800,
1801,
1814,
1815,
1872,
1913,
1914,
1928,
1929,
1948,
1966,
1967,
1975,
1976,
1993,
2009,
2039,
2040,
2048,
2049,
2228,
2229,
2234,
2242,
2243,
2256,
2257,
2325,
2326,
2340,
2341,
2360,
2378,
2379,
2387,
2388,
2405,
2421,
2456,
2457,
2465,
2466,
2545,
2546,
2551,
2559,
2560,
2581,
2582,
2594,
2595,
2609,
2610,
2629,
2646,
2647,
2655,
2656,
2673,
2700,
2751,
2778,
2779,
2787,
2788,
2796,
2797,
2802,
2810,
2811,
2824,
2825,
2875,
2876,
2910,
2911,
2956,
2957,
2967,
2977,
2987,
2998,
3010,
3022,
3035,
3047,
3055,
3066,
3083,
3095,
3111,
3128,
3147,
3160,
3161,
3253,
3254,
3261,
3277,
3319,
3369,
3370,
3378,
3379,
3383,
3384,
3389,
3397,
3398,
3424,
3425,
3453,
3454,
3461,
3488,
3535,
3555,
3556,
3560,
3561,
3585,
3586,
3604,
3605,
3610,
3615,
3629,
3658,
3659,
3667,
3668,
3685,
3701,
3736,
3760,
3761,
3779,
3780,
3811,
3812,
3923,
3924,
3929,
3934,
3946,
3958,
3975,
4002,
4049,
4081,
4082,
4100,
4101,
4121,
4122,
4159,
4160,
4165,
4170,
4182,
4193,
4210,
4237,
4291,
4292,
4302,
4303,
4326,
4327,
4332,
4337,
4349,
4354,
4371,
4398,
4444,
4445,
4487,
4488,
4493,
4494,
4612,
4613,
4627,
4628,
4647,
4664,
4665,
4688,
4689,
4694,
4699,
4711,
4725,
4756,
4757,
4773,
4774,
4779,
4784,
4796,
4803,
4834,
4835,
4854,
4855,
4860,
4865,
4877,
4887,
4921,
4922,
4939,
4940,
4945,
4950,
4962,
4970,
5002,
5003,
5020,
5021,
5026,
5031,
5043,
5051,
5083,
5084,
5101,
5102,
5107,
5112,
5124,
5132,
5164,
5165,
5170,
5171,
5196,
5197,
5202,
5203,
5476,
5477,
5755,
5756,
5761,
5766,
5783,
5799,
5845,
5846,
5855,
5856,
5882,
5883,
5888,
5897,
5909,
5968,
5985,
6001,
6050,
6051,
6058,
6059,
6073,
6074,
6079,
6090,
6091,
6103,
6104,
6232,
6411,
6543,
6590,
6735,
6829,
6881,
6950,
6951,
6963,
6964,
7048,
7195,
7212,
7228,
7274,
7292,
7313,
7333,
7364,
7394,
7420,
7421,
7434,
7435,
7498,
7499,
7504,
7511,
7512,
7524,
7525,
7653,
7785,
7930,
8024,
8025,
8037,
8038,
8122,
8269,
8286,
8302,
8349,
8367,
8388,
8408,
8439,
8469,
8495,
8496,
8501,
8502,
8551,
8552,
8557,
8562,
8563,
8575,
8576,
8660,
8807,
8824,
8840,
8906,
8924,
8945,
8966,
8993,
9016,
9045,
9111,
9112,
9143,
9144,
9219,
9220,
9250,
9251,
9277,
9278,
9569,
9570,
9607,
9608,
9639,
9640,
9843,
9844,
9850,
9851,
9868,
9869,
9874,
9880,
9881,
9964,
9965,
9982,
9998,
10047,
10048,
10070,
10071,
10215,
10216,
10221,
10227,
10239,
10248,
10265,
10281,
10329,
10402,
10403,
10417,
10418,
10437,
10438,
10443,
10449,
10461,
10466,
10467,
10536,
10537,
10554,
10581,
10630,
10631,
10652,
10653,
10658,
10664,
10676,
10686,
10687,
10738,
10739,
10745,
10772,
10835,
10836,
10875,
10876,
10896,
10897,
11104,
11105,
11134,
11135,
11323,
11324,
11329,
11330,
11373,
11374,
11402,
11403,
11662,
11663,
11763,
11764,
11769,
11770,
11908,
11909,
11931,
11932,
11937,
11960,
11961,
12180,
12181,
12261,
12262,
12276,
12277,
12359,
12360,
12373,
12399,
12449,
12492,
12567,
12568,
12600,
12601,
12659,
12660,
12734,
12735,
12766,
12767,
12782,
12783,
12788,
12793,
12813,
12858,
12859,
12964,
12965,
12978,
13017,
13148,
13149,
13155,
13156,
13254,
13255,
13260,
13266,
13267,
13278,
13279,
13363,
13364,
13391,
13392,
13481,
13482,
13499,
13528,
13602,
13722,
13723,
13757,
13758,
13841,
13842,
13875,
13876,
13903,
13904,
14028,
14029,
14051,
14052,
14063,
14072,
14164,
14165,
14200,
14201,
14292,
14293,
14327,
14328,
14353,
14354,
14365,
14372,
14373,
14387,
14388,
14407,
14424,
14425,
14551,
14552,
14623,
14624,
14658,
14659,
14684,
14685,
14696,
14703,
14704,
15003,
15004,
15021,
15059,
15106,
15192,
15193,
15226,
15227,
15233,
15234,
15239,
15245,
15246,
15369,
15370,
15384,
15385,
15404,
15421,
15422,
15447,
15448,
15453,
15477,
15478,
15835,
15836,
15850,
15851,
15870,
15887,
15888,
15898,
15899,
16222,
16223,
16294,
16295,
16309,
16310,
16329,
16347,
16348,
16379,
16380,
16810,
16811,
16862,
16863,
16974,
17031,
17179,
17287,
17656,
17780,
17781,
17789,
17790,
18338,
18339,
18553,
18554,
18563,
18564,
18587,
18588,
18593,
18602,
18609,
18625,
18659,
18748,
18749,
18785,
18786,
18817,
18818,
18823,
18832,
18843,
18848,
18849,
18888,
18889,
18894,
18903,
18914,
18928,
18929,
18938,
18939,
18954,
18955,
18960,
18969,
18970,
18979,
18980,
18997,
18998,
19003,
19012,
19013,
19020,
19021,
19119,
19120,
19146,
19147,
19161,
19162,
19435,
19436,
19744,
19745,
19808,
19809,
20061,
20062,
20067,
20092,
20093,
20101,
20102,
20116,
20142,
20183,
20219,
20247,
20270,
20287,
20302,
20323,
20357,
20385,
20409,
20433,
20466,
20472,
20483,
20492,
20493,
20506,
20507,
20521,
20522,
20540,
20558,
20575,
20597,
20598,
20612,
20613,
20618,
20625,
20626,
20638,
20639,
20652,
20653,
20668,
20669,
20825,
20826,
20840,
20841,
20859,
20877,
20894,
20916,
21070,
21071,
21166,
21167,
21424,
21715,
21900,
22040,
22041,
22066,
22067,
22195,
22196,
22257,
22325,
22397,
22447,
22548,
22549,
22801,
22802,
22863,
22924,
22996,
23067,
23068
],
"line_end_idx": [
15,
16,
21,
22,
207,
208,
213,
218,
219,
231,
232,
291,
292,
305,
306,
346,
431,
509,
550,
551,
565,
566,
585,
603,
604,
612,
613,
630,
657,
691,
715,
716,
753,
754,
786,
787,
823,
824,
829,
830,
997,
998,
1003,
1004,
1009,
1014,
1015,
1045,
1046,
1180,
1181,
1222,
1223,
1492,
1493,
1510,
1538,
1569,
1654,
1692,
1693,
1701,
1702,
1786,
1787,
1792,
1800,
1801,
1814,
1815,
1872,
1913,
1914,
1928,
1929,
1948,
1966,
1967,
1975,
1976,
1993,
2009,
2039,
2040,
2048,
2049,
2228,
2229,
2234,
2242,
2243,
2256,
2257,
2325,
2326,
2340,
2341,
2360,
2378,
2379,
2387,
2388,
2405,
2421,
2456,
2457,
2465,
2466,
2545,
2546,
2551,
2559,
2560,
2581,
2582,
2594,
2595,
2609,
2610,
2629,
2646,
2647,
2655,
2656,
2673,
2700,
2751,
2778,
2779,
2787,
2788,
2796,
2797,
2802,
2810,
2811,
2824,
2825,
2875,
2876,
2910,
2911,
2956,
2957,
2967,
2977,
2987,
2998,
3010,
3022,
3035,
3047,
3055,
3066,
3083,
3095,
3111,
3128,
3147,
3160,
3161,
3253,
3254,
3261,
3277,
3319,
3369,
3370,
3378,
3379,
3383,
3384,
3389,
3397,
3398,
3424,
3425,
3453,
3454,
3461,
3488,
3535,
3555,
3556,
3560,
3561,
3585,
3586,
3604,
3605,
3610,
3615,
3629,
3658,
3659,
3667,
3668,
3685,
3701,
3736,
3760,
3761,
3779,
3780,
3811,
3812,
3923,
3924,
3929,
3934,
3946,
3958,
3975,
4002,
4049,
4081,
4082,
4100,
4101,
4121,
4122,
4159,
4160,
4165,
4170,
4182,
4193,
4210,
4237,
4291,
4292,
4302,
4303,
4326,
4327,
4332,
4337,
4349,
4354,
4371,
4398,
4444,
4445,
4487,
4488,
4493,
4494,
4612,
4613,
4627,
4628,
4647,
4664,
4665,
4688,
4689,
4694,
4699,
4711,
4725,
4756,
4757,
4773,
4774,
4779,
4784,
4796,
4803,
4834,
4835,
4854,
4855,
4860,
4865,
4877,
4887,
4921,
4922,
4939,
4940,
4945,
4950,
4962,
4970,
5002,
5003,
5020,
5021,
5026,
5031,
5043,
5051,
5083,
5084,
5101,
5102,
5107,
5112,
5124,
5132,
5164,
5165,
5170,
5171,
5196,
5197,
5202,
5203,
5476,
5477,
5755,
5756,
5761,
5766,
5783,
5799,
5845,
5846,
5855,
5856,
5882,
5883,
5888,
5897,
5909,
5968,
5985,
6001,
6050,
6051,
6058,
6059,
6073,
6074,
6079,
6090,
6091,
6103,
6104,
6232,
6411,
6543,
6590,
6735,
6829,
6881,
6950,
6951,
6963,
6964,
7048,
7195,
7212,
7228,
7274,
7292,
7313,
7333,
7364,
7394,
7420,
7421,
7434,
7435,
7498,
7499,
7504,
7511,
7512,
7524,
7525,
7653,
7785,
7930,
8024,
8025,
8037,
8038,
8122,
8269,
8286,
8302,
8349,
8367,
8388,
8408,
8439,
8469,
8495,
8496,
8501,
8502,
8551,
8552,
8557,
8562,
8563,
8575,
8576,
8660,
8807,
8824,
8840,
8906,
8924,
8945,
8966,
8993,
9016,
9045,
9111,
9112,
9143,
9144,
9219,
9220,
9250,
9251,
9277,
9278,
9569,
9570,
9607,
9608,
9639,
9640,
9843,
9844,
9850,
9851,
9868,
9869,
9874,
9880,
9881,
9964,
9965,
9982,
9998,
10047,
10048,
10070,
10071,
10215,
10216,
10221,
10227,
10239,
10248,
10265,
10281,
10329,
10402,
10403,
10417,
10418,
10437,
10438,
10443,
10449,
10461,
10466,
10467,
10536,
10537,
10554,
10581,
10630,
10631,
10652,
10653,
10658,
10664,
10676,
10686,
10687,
10738,
10739,
10745,
10772,
10835,
10836,
10875,
10876,
10896,
10897,
11104,
11105,
11134,
11135,
11323,
11324,
11329,
11330,
11373,
11374,
11402,
11403,
11662,
11663,
11763,
11764,
11769,
11770,
11908,
11909,
11931,
11932,
11937,
11960,
11961,
12180,
12181,
12261,
12262,
12276,
12277,
12359,
12360,
12373,
12399,
12449,
12492,
12567,
12568,
12600,
12601,
12659,
12660,
12734,
12735,
12766,
12767,
12782,
12783,
12788,
12793,
12813,
12858,
12859,
12964,
12965,
12978,
13017,
13148,
13149,
13155,
13156,
13254,
13255,
13260,
13266,
13267,
13278,
13279,
13363,
13364,
13391,
13392,
13481,
13482,
13499,
13528,
13602,
13722,
13723,
13757,
13758,
13841,
13842,
13875,
13876,
13903,
13904,
14028,
14029,
14051,
14052,
14063,
14072,
14164,
14165,
14200,
14201,
14292,
14293,
14327,
14328,
14353,
14354,
14365,
14372,
14373,
14387,
14388,
14407,
14424,
14425,
14551,
14552,
14623,
14624,
14658,
14659,
14684,
14685,
14696,
14703,
14704,
15003,
15004,
15021,
15059,
15106,
15192,
15193,
15226,
15227,
15233,
15234,
15239,
15245,
15246,
15369,
15370,
15384,
15385,
15404,
15421,
15422,
15447,
15448,
15453,
15477,
15478,
15835,
15836,
15850,
15851,
15870,
15887,
15888,
15898,
15899,
16222,
16223,
16294,
16295,
16309,
16310,
16329,
16347,
16348,
16379,
16380,
16810,
16811,
16862,
16863,
16974,
17031,
17179,
17287,
17656,
17780,
17781,
17789,
17790,
18338,
18339,
18553,
18554,
18563,
18564,
18587,
18588,
18593,
18602,
18609,
18625,
18659,
18748,
18749,
18785,
18786,
18817,
18818,
18823,
18832,
18843,
18848,
18849,
18888,
18889,
18894,
18903,
18914,
18928,
18929,
18938,
18939,
18954,
18955,
18960,
18969,
18970,
18979,
18980,
18997,
18998,
19003,
19012,
19013,
19020,
19021,
19119,
19120,
19146,
19147,
19161,
19162,
19435,
19436,
19744,
19745,
19808,
19809,
20061,
20062,
20067,
20092,
20093,
20101,
20102,
20116,
20142,
20183,
20219,
20247,
20270,
20287,
20302,
20323,
20357,
20385,
20409,
20433,
20466,
20472,
20483,
20492,
20493,
20506,
20507,
20521,
20522,
20540,
20558,
20575,
20597,
20598,
20612,
20613,
20618,
20625,
20626,
20638,
20639,
20652,
20653,
20668,
20669,
20825,
20826,
20840,
20841,
20859,
20877,
20894,
20916,
21070,
21071,
21166,
21167,
21424,
21715,
21900,
22040,
22041,
22066,
22067,
22195,
22196,
22257,
22325,
22397,
22447,
22548,
22549,
22801,
22802,
22863,
22924,
22996,
23067,
23068,
23532
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 23532,
"ccnet_original_nlines": 806,
"rps_doc_curly_bracket": 0.0011048800079151988,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35513392090797424,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007589289918541908,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15156249701976776,
"rps_doc_frac_unique_words": 0.20718376338481903,
"rps_doc_mean_word_length": 4.856324672698975,
"rps_doc_num_sentences": 187,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.601075172424316,
"rps_doc_word_count": 3842,
"rps_doc_frac_chars_dupe_10grams": 0.1454067975282669,
"rps_doc_frac_chars_dupe_5grams": 0.24756136536598206,
"rps_doc_frac_chars_dupe_6grams": 0.20629221200942993,
"rps_doc_frac_chars_dupe_7grams": 0.18480008840560913,
"rps_doc_frac_chars_dupe_8grams": 0.1556972861289978,
"rps_doc_frac_chars_dupe_9grams": 0.15076643228530884,
"rps_doc_frac_chars_top_2gram": 0.01447100006043911,
"rps_doc_frac_chars_top_3gram": 0.01811555027961731,
"rps_doc_frac_chars_top_4gram": 0.02342158928513527,
"rps_doc_books_importance": -1819.53515625,
"rps_doc_books_importance_length_correction": -1819.53515625,
"rps_doc_openwebtext_importance": -1058.8328857421875,
"rps_doc_openwebtext_importance_length_correction": -1058.8328857421875,
"rps_doc_wikipedia_importance": -539.5631103515625,
"rps_doc_wikipedia_importance_length_correction": -539.5631103515625
},
"fasttext": {
"dclm": 0.021287139505147934,
"english": 0.8604527115821838,
"fineweb_edu_approx": 2.837324619293213,
"eai_general_math": 0.7993564009666443,
"eai_open_web_math": 0.18316835165023804,
"eai_web_code": 0.5854154825210571
}
}
|
{
"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": "025.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "Library science",
"level_3": "Library administration"
}
}
},
"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": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"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": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,967,687,070,913,732,000 |
Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
PerlMonks
Re^2: The default hash - accident, coincidence or conspiracy?
by jdporter (Canon)
on Jul 02, 2005 at 17:39 UTC ( #471943=note: print w/replies, xml ) Need Help??
in reply to Re: The default hash - accident, coincidence or conspiracy?
in thread The default hash - accident, coincidence or conspiracy?
It is free for the using, if not taking. The local keyword is there to facilitate multiple code chunks using the same global variable independently. It works well enough for $_ and @_, it will work just as well for %_. (That's not to say it's a panacea, though.)
I don't understand why people think it's asking for trouble. It is no more asking for trouble than using $_ — and I sure wouldn't counsel anyone to avoid using $_. Quite the opposite, in fact.
That being said, there isn't any really good reason to use %_. The situations in which it would be the most obvious, "natural" name for a variable must be rare indeed.
Replies are listed 'Best First'.
Re^3: The default hash - accident, coincidence or conspiracy?
by tlm (Prior) on Jul 02, 2005 at 18:32 UTC
I don't understand why people think it's asking for trouble.
IMO, using package variables in one's code, in general, is asking for trouble (though there may be situations in which one is willing to accept this trouble). Moreover, as I pointed out, some module authors have had the bright idea of using variables such as %_, so one can't be sure that these variables are completely available, and that the other code that uses it is being good about using local whenever it uses the same variables. IMO, having to even worry about these things falls into the category of "trouble." The fact that the docs specifically state that the variables the OP asked about are reserved for Perl's use makes it all the more troublesome to use them.
the lowliest monk
Sure, and some module authors have had the bright idea of using $_. If you use a module that uses $_ (or any other global) and they haven't properly localized, then maybe you should rethink using that module. For better or worse, that's the way it is in the perl world. It's true for $_, and it's just as true for %_.
You know, just because a module is out there doesn't mean people should use it. Would you use a module that didn't use strict and made all its variables global in %main:: ? I sure wouldn't.
The $_ example is misleading, because Perl provides a lot of extra built-in help (like implicit localization) that it doesn't provide for other such variables. (I can easily imagine perfectly well-behaved modules that make heavy use of $_ without ever using a single explicit localization of $_.) Without this extra help I think the use of $_, at least in modules, would become much less attractive. An even with all the extra help, the use of $_ is still fraught with trouble.
the lowliest monk
Log In?
Username:
Password:
What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://471943]
help
Chatterbox?
and all is quiet...
How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (5)
As of 2017-09-23 15:15 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
During the recent solar eclipse, I:
Results (272 votes). Check out past polls.
Notices?
|
{
"url": "http://www.perlmonks.org/index.pl?node_id=471943",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2017-39",
"warc_metadata": {
"Content-Length": "23660",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Q6AQCFBYHNUI2L5R2I3JXSEKE3PBKQOM",
"WARC-Concurrent-To": "<urn:uuid:84658616-594f-44d9-b066-91cb1a457f06>",
"WARC-Date": "2017-09-23T15:16:07Z",
"WARC-IP-Address": "209.197.123.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:D4OCDHXPYAJZMLGVHWKIXDLXH3VZXXJS",
"WARC-Record-ID": "<urn:uuid:163e9694-5535-4c0e-b13d-6319c6460618>",
"WARC-Target-URI": "http://www.perlmonks.org/index.pl?node_id=471943",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a30fb958-f0c5-49d2-ab09-fa026ef0dca8>"
},
"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,
63,
82,
84,
96,
97,
159,
160,
180,
260,
261,
262,
334,
400,
401,
664,
665,
858,
859,
1027,
1028,
1061,
1123,
1167,
1168,
1233,
1234,
1913,
1914,
1936,
1937,
2261,
2262,
2458,
2459,
2945,
2946,
2972,
2973,
2981,
2991,
3001,
3002,
3022,
3040,
3053,
3066,
3096,
3101,
3113,
3133,
3134,
3172,
3185,
3220,
3247,
3257,
3270,
3282,
3293,
3311,
3351,
3352,
3353,
3354,
3355,
3356,
3357,
3358,
3359,
3360,
3407,
3408
],
"line_end_idx": [
63,
82,
84,
96,
97,
159,
160,
180,
260,
261,
262,
334,
400,
401,
664,
665,
858,
859,
1027,
1028,
1061,
1123,
1167,
1168,
1233,
1234,
1913,
1914,
1936,
1937,
2261,
2262,
2458,
2459,
2945,
2946,
2972,
2973,
2981,
2991,
3001,
3002,
3022,
3040,
3053,
3066,
3096,
3101,
3113,
3133,
3134,
3172,
3185,
3220,
3247,
3257,
3270,
3282,
3293,
3311,
3351,
3352,
3353,
3354,
3355,
3356,
3357,
3358,
3359,
3360,
3407,
3408,
3420
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3420,
"ccnet_original_nlines": 72,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3997412621974945,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023285899311304092,
"rps_doc_frac_lines_end_with_ellipsis": 0.013698630034923553,
"rps_doc_frac_no_alph_words": 0.2587321996688843,
"rps_doc_frac_unique_words": 0.4848484694957733,
"rps_doc_mean_word_length": 4.556149959564209,
"rps_doc_num_sentences": 46,
"rps_doc_symbol_to_word_ratio": 0.002587320050224662,
"rps_doc_unigram_entropy": 5.172577857971191,
"rps_doc_word_count": 561,
"rps_doc_frac_chars_dupe_10grams": 0.07198747992515564,
"rps_doc_frac_chars_dupe_5grams": 0.16744914650917053,
"rps_doc_frac_chars_dupe_6grams": 0.14397495985031128,
"rps_doc_frac_chars_dupe_7grams": 0.14397495985031128,
"rps_doc_frac_chars_dupe_8grams": 0.108763687312603,
"rps_doc_frac_chars_dupe_9grams": 0.07198747992515564,
"rps_doc_frac_chars_top_2gram": 0.015649449080228806,
"rps_doc_frac_chars_top_3gram": 0.021909229457378387,
"rps_doc_frac_chars_top_4gram": 0.03442879021167755,
"rps_doc_books_importance": -399.9248352050781,
"rps_doc_books_importance_length_correction": -399.9248352050781,
"rps_doc_openwebtext_importance": -215.6924285888672,
"rps_doc_openwebtext_importance_length_correction": -215.6924285888672,
"rps_doc_wikipedia_importance": -133.6588897705078,
"rps_doc_wikipedia_importance_length_correction": -133.6588897705078
},
"fasttext": {
"dclm": 0.057699501514434814,
"english": 0.9445838928222656,
"fineweb_edu_approx": 2.151395797729492,
"eai_general_math": 0.4960373044013977,
"eai_open_web_math": 0.2572157382965088,
"eai_web_code": 0.07150554656982422
}
}
|
{
"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": "4",
"label": "Analyze"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,020,162,454,443,627,000 |
Release 3.1: Tcl API
The Berkeley DB Tcl API has been modified so that the -mpool option to the berkdb env command is now the default behavior. The Tcl API has also been modified so that the -txn option to the berkdb env command implies the -lock and -log options. Tcl scripts should be updated to remove the -mpool, -lock and -log options.
The Berkeley DB Tcl API has been modified to follow the Tcl standard rules for integer conversion, for example, if the first two characters of a record number are "0x", the record number is expected to be in hexadecimal form.
|
{
"url": "http://docs.oracle.com/cd/E17275_01/html/programmer_reference/upgrade_3_1_tcl.html",
"source_domain": "docs.oracle.com",
"snapshot_id": "crawl=CC-MAIN-2016-07",
"warc_metadata": {
"Content-Length": "3798",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IXWWZE6CICYPR5OXRTDSUXCMTGILVYKZ",
"WARC-Concurrent-To": "<urn:uuid:0ec8c2c0-3241-4c2d-8f8b-eec9a2930fac>",
"WARC-Date": "2016-02-10T18:56:31Z",
"WARC-IP-Address": "184.30.70.138",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:DOF3S4YY5BPWJEYIOHY5TDK7WEEZQLHG",
"WARC-Record-ID": "<urn:uuid:8f3713b4-8598-441e-a07b-27af351546df>",
"WARC-Target-URI": "http://docs.oracle.com/cd/E17275_01/html/programmer_reference/upgrade_3_1_tcl.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7f34ca04-36fa-4ae2-9014-4dcfcf2fbb54>"
},
"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,
342,
343
],
"line_end_idx": [
21,
22,
342,
343,
568
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 568,
"ccnet_original_nlines": 4,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3606557548046112,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04918032884597778,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16393442451953888,
"rps_doc_frac_unique_words": 0.5339806079864502,
"rps_doc_mean_word_length": 4.320388317108154,
"rps_doc_num_sentences": 5,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.736398220062256,
"rps_doc_word_count": 103,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.341573029756546,
"rps_doc_frac_chars_dupe_6grams": 0.2741572856903076,
"rps_doc_frac_chars_dupe_7grams": 0.1528089940547943,
"rps_doc_frac_chars_dupe_8grams": 0.1528089940547943,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.05393258109688759,
"rps_doc_frac_chars_top_3gram": 0.06067416071891785,
"rps_doc_frac_chars_top_4gram": 0.07191011309623718,
"rps_doc_books_importance": -51.555702209472656,
"rps_doc_books_importance_length_correction": -65.84481048583984,
"rps_doc_openwebtext_importance": -12.235750198364258,
"rps_doc_openwebtext_importance_length_correction": -26.524860382080078,
"rps_doc_wikipedia_importance": -14.217856407165527,
"rps_doc_wikipedia_importance_length_correction": -28.50696563720703
},
"fasttext": {
"dclm": 0.20834434032440186,
"english": 0.8521292805671692,
"fineweb_edu_approx": 2.12161922454834,
"eai_general_math": 0.8686981797218323,
"eai_open_web_math": 0.6200283169746399,
"eai_web_code": 0.9836899638175964
}
}
|
{
"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.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": "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": "13",
"label": "News (Org.)"
}
},
"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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,697,072,877,771,999,000 |
Markdown vertical
hello everyone, maybe I’m missing something; I can’t find how to vertically align the text in a Markdown.
There are many ways to do this, but something I just tested and I know works is to add
display: flex
and
align-items: center // or flex-end, flex-start, etc
to your Markdown component’s style object.
image
You can also add padding, margins, and whatever else you need to style the Markdown exactly how you want it.
thanks @YF129701 … but like that i loose the horizontal centering… i think i go crazy today … do you have other interesting “goodies”?
I add also “justifyContent” for centering also in horizontal …
Yes I was going to add that but you only asked for vertical alignment… Looks like you figured it out :+1:
|
{
"url": "https://forum.inductiveautomation.com/t/markdown-vertical/45598",
"source_domain": "forum.inductiveautomation.com",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "25425",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3VAZJAL3XCDMZG67D34F7J5KQP24NX65",
"WARC-Concurrent-To": "<urn:uuid:a2f82433-e11a-4cc8-90b6-a627fdb849d0>",
"WARC-Date": "2022-10-07T19:45:20Z",
"WARC-IP-Address": "64.71.144.209",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2ZLQVKYRORRMSVNXAW6DWHG73S3B27Q3",
"WARC-Record-ID": "<urn:uuid:55c0abf0-a527-40e7-91fd-bfe6d988c93b>",
"WARC-Target-URI": "https://forum.inductiveautomation.com/t/markdown-vertical/45598",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:34e12935-5d08-44fa-8d71-ab4521283d40>"
},
"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-72\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,
18,
19,
125,
126,
213,
214,
228,
229,
233,
234,
286,
287,
330,
331,
337,
338,
447,
448,
583,
584,
647,
648
],
"line_end_idx": [
18,
19,
125,
126,
213,
214,
228,
229,
233,
234,
286,
287,
330,
331,
337,
338,
447,
448,
583,
584,
647,
648,
753
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 753,
"ccnet_original_nlines": 22,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.45121949911117554,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04268293082714081,
"rps_doc_frac_lines_end_with_ellipsis": 0.043478261679410934,
"rps_doc_frac_no_alph_words": 0.19512194395065308,
"rps_doc_frac_unique_words": 0.6615384817123413,
"rps_doc_mean_word_length": 4.538461685180664,
"rps_doc_num_sentences": 5,
"rps_doc_symbol_to_word_ratio": 0.030487800016999245,
"rps_doc_unigram_entropy": 4.244800567626953,
"rps_doc_word_count": 130,
"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": -60.25495529174805,
"rps_doc_books_importance_length_correction": -60.25497055053711,
"rps_doc_openwebtext_importance": -30.556909561157227,
"rps_doc_openwebtext_importance_length_correction": -30.556928634643555,
"rps_doc_wikipedia_importance": -11.108630180358887,
"rps_doc_wikipedia_importance_length_correction": -11.108648300170898
},
"fasttext": {
"dclm": 0.022496340796351433,
"english": 0.9205865859985352,
"fineweb_edu_approx": 0.8899481892585754,
"eai_general_math": 0.921989381313324,
"eai_open_web_math": 0.5702622532844543,
"eai_web_code": 0.03268247842788696
}
}
|
{
"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": "-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": "4",
"label": "Missing Images or Figures"
}
},
"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": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,884,062,396,295,298,000 |
Fast, parallel restore from SQL dumps (mysqldump) for MySQL
I have used the technique that I am going to describe below on several occasions to restore from a SQL dump generated using mysqldump. In some cases, the regular restore that had taken 2 days and still could not finish successfully was completed in less than 12 hours using this simple technique. Please keep in mind that this is not a pure parallel method but I'd say it is almost parallel and have proven to be faster than regular single-threaded restore (depending on your hardware).
I am going to use 9 Innodb tables with millions of rows in some of them to show you an example of improved speed. The tables are very simple in my case, so you might see more improvement in your case. All tables have a maximum of four columns and are one of the following:
+--------+-------------------+------+-----+---------+----------------+
| Field | Type | Null | Key | Default | Extra |
+--------+-------------------+------+-----+---------+----------------+
| id | int(11) | NO | PRI | NULL | auto_increment |
| name | varchar(100) | YES | | NULL | |
| age | float(4,1) | YES | | NULL | |
| gender | enum('M','F','U') | YES | | NULL | |
+--------+-------------------+------+-----+---------+----------------+
4 rows in set (0.01 sec)
The approximate number of rows in each table are as follows:
+------------+------------+
| TABLE_NAME | TABLE_ROWS |
+------------+------------+
| t1 | 12583209 |
| t2 | 6291945 |
| t3 | 787046 |
| t4 | 19010057 |
| t5 | 6291981 |
| t6 | 393881 |
| t7 | 12583209 |
| t8 | 4000078 |
| t9 | 200589 |
+------------+------------+
10 rows in set (0.20 sec)
I created two separate dump files (i) with schema only and (ii) schema and data.
mysqldump -uroot --no-data test2 > test2_schema.sql
mysqldump -uroot -h127.0.0.1 -p test2 > test2.sql
I restored using the regular restore method below:
$ time mysql -uroot -h127.0.0.1 test3 < test2.sql
real 13m57.107s
user 0m50.160s
sys 0m3.106s
It took around 14 minutes for the backup to finish successfully. Now, I am going to explain the technique and show you the results running on the exact same hardware (basically, everything else remains the same).
First, I am to going to explain a few concepts and background:
• mysql CLI program has an option --force that allows you to continue restoring even if an SQL error occurs.
• I created a skeleton schema (test4) using the schema-only dump file.
mysql -uroot -h127.0.0.1 test4 < test2_schema.sql
• Also, using the table row counts (you can use table file size too) I divided the tables into three groups and created a separate user for each group (this is why I needed the tables created).
Group 1 contains t1, t2, t3
Group 2 contains t4, t5, t6
Group 3 contains t7, t8, t9
• I used the following GRANT commands to create three separate users, one for each group (see above) with INSERT privileges.
GRANT INSERT ON test4.t1 TO 'u1'@'127.0.0.1';
GRANT INSERT ON test4.t2 TO 'u1'@'127.0.0.1';
GRANT INSERT ON test4.t3 TO 'u1'@'127.0.0.1';
GRANT INSERT ON test4.t4 TO 'u2'@'127.0.0.1';
GRANT INSERT ON test4.t5 TO 'u2'@'127.0.0.1';
GRANT INSERT ON test4.t6 TO 'u2'@'127.0.0.1';
GRANT INSERT ON test4.t7 TO 'u3'@'127.0.0.1';
GRANT INSERT ON test4.t8 TO 'u3'@'127.0.0.1';
GRANT INSERT ON test4.t9 TO 'u3'@'127.0.0.1';
Now, create three (equal to the number of groups) separate OS sessions (or run them as background processes) to restore for each group of tables in parallel.
$ time mysql -uu1 -h127.0.0.1 --force test4 < test2.sql > /dev/null 2>&1
real 7m56.070s
user 0m50.687s
sys 0m3.995s
$ time mysql -uu2 -h127.0.0.1 --force test4 < test2.sql > /dev/null 2>&1
real 9m27.720s
user 0m50.594s
sys 0m4.035s
$ time mysql -uu3 -h127.0.0.1 --force test4 < test2.sql > /dev/null 2>&1
real 8m0.634s
user 0m50.734s
sys 0m5.031s
As these commands will run in parallel, so the maximum time taken by any session is the actual time for the whole restore process. In the example above, it is ~9.5 minutes, which is approx. 30% improvement.
I also ran another test with 10 tables and 5 groups. The regular restore took 16m and 50s, whereas the parallel restore took 11m and 9s.
The reason why this technique works is because MySQL keeps the access privilege or authentication data in memory, so it can quickly determine if the user is allowed to insert rows in a table or not. Since we are using --force option so the insert statements that throw errors are skipped. I am redirecting error and output streams to /dev/null in this example but you can log them to a log file. Also, you do not have to do all the work every time you restore, you can create users once with appropriate privileges and use restore commands to run them quickly.
I hope this will help people who are still dependent on SQL dumps for taking backups. Please keep in mind that you need multiple processors to run multiple processes.
Please feel free to use the comments form below if you have any questions or need more explanation on anything. I recommend thoroughy testing on a production-like test system first before moving to production. Use the icons below to share this tutorial with your friends.
tags cloud
mysql parallel restore cli fast mysqldump sql
popular searches
Comments (write a comment):
I wonder how that would compare to using sed to find the relevant rows for each group and piping that into mysql. Posted by: Scott Noyes on Jun 29, 2012
i'd use --no-beep option if on windows, since the beeping on errors slows it down! Posted by: sbester on Jun 29, 2012
Pretty intriguing, IMHO overcomplicated though. Why don't you just make separate dumps for each table and then restore them in as many threads as the number of tables/CPU cores/whatever? Also tools like http://www.mydumper.org/ will make your life easier. Posted by: Przemek on Jun 29, 2012
How do you manage foreign keys ?
As said above, mydumper can do the job Posted by: Cédric on Jun 29, 2012
I developed simple tools to dump and restore tables in parallel using GNU Parallel:
https://github.com/tart/SimpleMySQLParallelDumpRestore Posted by: Emre Hasegeli on Jun 30, 2012
@Przemek: what if you have to take a consistent snapshot of database using table locks or --single-transaction?
multiple dump files wont work in such cases. Posted by: Shahryar on Jan 06, 2013
@C©dric: for foreign keys, you can put the tables with dependencies first and then other dependent tables. Also, you can simply turn foreign key checks OFF while the restore(s) are running.
Read: http://dev.mysql.com/doc/refman/5.5/en/server-system-variables.html#sysvar_foreign_key_checks Posted by: Shahryar on Jan 06, 2013
leave a comment
|
{
"url": "http://www.geeksww.com/tutorials/database_management_systems/mysql/tips_and_tricks/fast_parallel_restore_from_sql_dumps_mysqldump_for_mysql.php",
"source_domain": "www.geeksww.com",
"snapshot_id": "crawl=CC-MAIN-2014-41",
"warc_metadata": {
"Content-Length": "29589",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QDU236TXAGGON2KWIUXTYEVILGTMRY6C",
"WARC-Concurrent-To": "<urn:uuid:4a096c8f-6d01-4033-813a-5dd4e46f3d09>",
"WARC-Date": "2014-10-01T16:15:14Z",
"WARC-IP-Address": "23.21.120.10",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:MRRJ4H36JCW7NWFD3EPM6IJREUC57VFY",
"WARC-Record-ID": "<urn:uuid:2aae08f5-ddd2-4a30-99fc-b3bc7e2b0ef9>",
"WARC-Target-URI": "http://www.geeksww.com/tutorials/database_management_systems/mysql/tips_and_tricks/fast_parallel_restore_from_sql_dumps_mysqldump_for_mysql.php",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7ec2f207-e39d-42e1-aa46-2f20914ed09e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-234-18-248.ec2.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,
60,
61,
548,
549,
822,
823,
894,
965,
1036,
1107,
1178,
1249,
1320,
1391,
1416,
1417,
1478,
1479,
1507,
1535,
1563,
1591,
1619,
1647,
1675,
1703,
1731,
1759,
1787,
1815,
1843,
1869,
1870,
1951,
1952,
2004,
2054,
2055,
2106,
2107,
2157,
2176,
2194,
2211,
2212,
2425,
2426,
2489,
2490,
2601,
2674,
2675,
2729,
2730,
2926,
2927,
2959,
2960,
2992,
2993,
3025,
3026,
3153,
3154,
3204,
3254,
3304,
3354,
3404,
3454,
3504,
3554,
3604,
3609,
3610,
3768,
3769,
3842,
3860,
3878,
3895,
3896,
3969,
3987,
4005,
4022,
4023,
4096,
4113,
4131,
4148,
4149,
4356,
4357,
4494,
4495,
5056,
5057,
5224,
5225,
5497,
5498,
5509,
5510,
5556,
5557,
5574,
5575,
5603,
5604,
5757,
5758,
5876,
5877,
6168,
6169,
6202,
6276,
6277,
6361,
6362,
6458,
6459,
6571,
6572,
6653,
6654,
6845,
6846,
6982,
6983,
6999,
7000
],
"line_end_idx": [
60,
61,
548,
549,
822,
823,
894,
965,
1036,
1107,
1178,
1249,
1320,
1391,
1416,
1417,
1478,
1479,
1507,
1535,
1563,
1591,
1619,
1647,
1675,
1703,
1731,
1759,
1787,
1815,
1843,
1869,
1870,
1951,
1952,
2004,
2054,
2055,
2106,
2107,
2157,
2176,
2194,
2211,
2212,
2425,
2426,
2489,
2490,
2601,
2674,
2675,
2729,
2730,
2926,
2927,
2959,
2960,
2992,
2993,
3025,
3026,
3153,
3154,
3204,
3254,
3304,
3354,
3404,
3454,
3504,
3554,
3604,
3609,
3610,
3768,
3769,
3842,
3860,
3878,
3895,
3896,
3969,
3987,
4005,
4022,
4023,
4096,
4113,
4131,
4148,
4149,
4356,
4357,
4494,
4495,
5056,
5057,
5224,
5225,
5497,
5498,
5509,
5510,
5556,
5557,
5574,
5575,
5603,
5604,
5757,
5758,
5876,
5877,
6168,
6169,
6202,
6276,
6277,
6361,
6362,
6458,
6459,
6571,
6572,
6653,
6654,
6845,
6846,
6982,
6983,
6999,
7000,
7001
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7001,
"ccnet_original_nlines": 133,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2697068452835083,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05342020094394684,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3218241035938263,
"rps_doc_frac_unique_words": 0.41118744015693665,
"rps_doc_mean_word_length": 4.7036309242248535,
"rps_doc_num_sentences": 121,
"rps_doc_symbol_to_word_ratio": 0.0006514699780382216,
"rps_doc_unigram_entropy": 5.527215957641602,
"rps_doc_word_count": 1019,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08178593963384628,
"rps_doc_frac_chars_dupe_6grams": 0.035051118582487106,
"rps_doc_frac_chars_dupe_7grams": 0.035051118582487106,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02065511979162693,
"rps_doc_frac_chars_top_3gram": 0.02441059984266758,
"rps_doc_frac_chars_top_4gram": 0.00918005034327507,
"rps_doc_books_importance": -814.6969604492188,
"rps_doc_books_importance_length_correction": -814.6969604492188,
"rps_doc_openwebtext_importance": -473.77691650390625,
"rps_doc_openwebtext_importance_length_correction": -473.77691650390625,
"rps_doc_wikipedia_importance": -316.1614990234375,
"rps_doc_wikipedia_importance_length_correction": -316.1614990234375
},
"fasttext": {
"dclm": 0.14024090766906738,
"english": 0.8107167482376099,
"fineweb_edu_approx": 1.6134815216064453,
"eai_general_math": 0.6386883854866028,
"eai_open_web_math": 0.2230827808380127,
"eai_web_code": 0.502993106842041
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.746",
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,248,331,588,911,889,200 |
FILE_STAT_LX_INFORMATION structure (ntifs.h)
FILE_STAT_LX_INFORMATION contains Linux metadata extended attributes present on the file. This is used and created by the Windows Subsystem for Linux (WSL).
Syntax
typedef struct _FILE_STAT_LX_INFORMATION {
LARGE_INTEGER FileId;
LARGE_INTEGER CreationTime;
LARGE_INTEGER LastAccessTime;
LARGE_INTEGER LastWriteTime;
LARGE_INTEGER ChangeTime;
LARGE_INTEGER AllocationSize;
LARGE_INTEGER EndOfFile;
ULONG FileAttributes;
ULONG ReparseTag;
ULONG NumberOfLinks;
ACCESS_MASK EffectiveAccess;
ULONG LxFlags;
ULONG LxUid;
ULONG LxGid;
ULONG LxMode;
ULONG LxDeviceIdMajor;
ULONG LxDeviceIdMinor;
} FILE_STAT_LX_INFORMATION, *PFILE_STAT_LX_INFORMATION;
Members
FileId
Specifies the id of a file.
CreationTime
Specifies the creation time of a file.
LastAccessTime
Specifies the last time a file was accessed.
LastWriteTime
Specifies the last time a file was written to.
ChangeTime
Specifies the last time a file was changed.
AllocationSize
File allocation size, in bytes. Usually this value is a multiple of the sector or cluster size of the underlying physical device.
EndOfFile
Absolute new end-of-file position as a byte offset from the start of the file. EndOfFile specifies the byte offset to the end of the file. Because this value is zero-based, it actually refers to the first free byte in the file. In other words, EndOfFile is the offset to the byte immediately following the last valid byte in the file.
FileAttributes
File attributes, which can be any valid combination of the following:
Attribute Value
FILE_ATTRIBUTE_READONLY 0x00000001
FILE_ATTRIBUTE_HIDDEN 0x00000002
FILE_ATTRIBUTE_SYSTEM 0x00000004
FILE_ATTRIBUTE_DIRECTORY 0x00000010
FILE_ATTRIBUTE_ARCHIVE 0x00000020
FILE_ATTRIBUTE_NORMAL 0x00000080
ReparseTag
Reparse point tag. See About reparse points for more information.
NumberOfLinks
Specifies the number of links to the file.
EffectiveAccess
Specifies the access rights of the file.
LxFlags
The flags associated with FILE_STAT_LX_INFORMATION that specify which metadata fields were present in the file.
Flag Value
LX_FILE_METADATA_HAS_UID x1
LX_FILE_METADATA_HAS_GID x2
LX_FILE_METADATA_HAS_MODE x4
LX_FILE_METADATA_HAS_DEVICE_ID x8
LX_FILE_CASE_SENSITIVE_DIR x10
LxUid
Specifies the User id of the file.
LxGid
Specifies the Group id of the file.
LxMode
Specifies the Linux file type and file system permissions. These values are defined in sys/stat.h in the Windows SDK.
• S_IFLNK
• S_IFSOCK
• S_IFBLK
Flag Description
_S_IFMT 0xF000 File type mask
_S_IFDIR 0x4000 Directory
_S_IFCHR 0x2000 Character special
_S_IFIFO 0x1000 Pipe
_S_IFREG 0x8000 Regular
_S_IREAD 0x0100 Read permission, owner
_S_IWRITE 0x0080 Write permission, owner
_S_IEXEC 0x0040 Execute/search permission, owner
LxDeviceIdMajor
For device files (_S_IFCHR or S_IFBLK), specifies the device major number. For other file types, this field is not used.
LxDeviceIdMinor
For device files (_S_IFCHR or S_IFBLK), specifies the device minor number. For other file types, this field is not used.
Remarks
NtQueryInformationByName and NtQueryInformationFile return information in a FILE_STAT_LX_INFORMATION structure when their FileInformationClass parameter is FileStatLxInformation.
For more information about absolute and relative symbolic links, see Creating Symbolic Links in the Microsoft Windows SDK documentation.
Requirements
Requirement Value
Header ntifs.h
See also
NtQueryInformationByName
NtQueryInformationFile
|
{
"url": "https://learn.microsoft.com/en-us/windows-hardware/drivers/ddi/ntifs/ns-ntifs-_file_stat_lx_information",
"source_domain": "learn.microsoft.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "52235",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SBWQSSYWZJWDZ3FCXX22AU3BMTGWWLAM",
"WARC-Concurrent-To": "<urn:uuid:d62395bb-24e8-4f35-a9d8-9183044a1cf9>",
"WARC-Date": "2024-04-12T12:54:42Z",
"WARC-IP-Address": "23.45.150.46",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BKDILBWR7LTYNA457MPCOSYX5BDWEQR2",
"WARC-Record-ID": "<urn:uuid:7fad12eb-821c-4099-857d-77361f0617e6>",
"WARC-Target-URI": "https://learn.microsoft.com/en-us/windows-hardware/drivers/ddi/ntifs/ns-ntifs-_file_stat_lx_information",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9be7788a-775d-4cf9-aef6-5f4de1235f5b>"
},
"warc_info": "isPartOf: CC-MAIN-2024-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-234\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,
45,
46,
203,
204,
211,
212,
255,
279,
309,
341,
372,
400,
432,
459,
491,
519,
550,
583,
608,
631,
654,
678,
711,
744,
800,
801,
809,
810,
817,
818,
846,
847,
860,
861,
900,
901,
916,
917,
962,
963,
977,
978,
1025,
1026,
1037,
1038,
1082,
1083,
1098,
1099,
1229,
1230,
1240,
1241,
1576,
1577,
1592,
1593,
1663,
1664,
1680,
1715,
1748,
1781,
1817,
1851,
1884,
1885,
1896,
1897,
1963,
1964,
1978,
1979,
2022,
2023,
2039,
2040,
2081,
2082,
2090,
2091,
2203,
2204,
2215,
2243,
2271,
2300,
2334,
2365,
2366,
2372,
2373,
2408,
2409,
2415,
2416,
2452,
2453,
2460,
2461,
2579,
2580,
2592,
2605,
2617,
2634,
2664,
2690,
2724,
2745,
2769,
2808,
2849,
2898,
2899,
2915,
2916,
3037,
3038,
3054,
3055,
3176,
3177,
3185,
3186,
3365,
3366,
3503,
3504,
3517,
3518,
3536,
3551,
3552,
3561,
3562,
3587,
3588
],
"line_end_idx": [
45,
46,
203,
204,
211,
212,
255,
279,
309,
341,
372,
400,
432,
459,
491,
519,
550,
583,
608,
631,
654,
678,
711,
744,
800,
801,
809,
810,
817,
818,
846,
847,
860,
861,
900,
901,
916,
917,
962,
963,
977,
978,
1025,
1026,
1037,
1038,
1082,
1083,
1098,
1099,
1229,
1230,
1240,
1241,
1576,
1577,
1592,
1593,
1663,
1664,
1680,
1715,
1748,
1781,
1817,
1851,
1884,
1885,
1896,
1897,
1963,
1964,
1978,
1979,
2022,
2023,
2039,
2040,
2081,
2082,
2090,
2091,
2203,
2204,
2215,
2243,
2271,
2300,
2334,
2365,
2366,
2372,
2373,
2408,
2409,
2415,
2416,
2452,
2453,
2460,
2461,
2579,
2580,
2592,
2605,
2617,
2634,
2664,
2690,
2724,
2745,
2769,
2808,
2849,
2898,
2899,
2915,
2916,
3037,
3038,
3054,
3055,
3176,
3177,
3185,
3186,
3365,
3366,
3503,
3504,
3517,
3518,
3536,
3551,
3552,
3561,
3562,
3587,
3588,
3610
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3610,
"ccnet_original_nlines": 139,
"rps_doc_curly_bracket": 0.0005540199927054346,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.26436781883239746,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.10153257101774216,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1513410061597824,
"rps_doc_frac_unique_words": 0.4726027548313141,
"rps_doc_mean_word_length": 6.486301422119141,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.843827724456787,
"rps_doc_word_count": 438,
"rps_doc_frac_chars_dupe_10grams": 0.028863079845905304,
"rps_doc_frac_chars_dupe_5grams": 0.09081309288740158,
"rps_doc_frac_chars_dupe_6grams": 0.09081309288740158,
"rps_doc_frac_chars_dupe_7grams": 0.09081309288740158,
"rps_doc_frac_chars_dupe_8grams": 0.06124604120850563,
"rps_doc_frac_chars_dupe_9grams": 0.06124604120850563,
"rps_doc_frac_chars_top_2gram": 0.054910238832235336,
"rps_doc_frac_chars_top_3gram": 0.015839489176869392,
"rps_doc_frac_chars_top_4gram": 0.021119320765137672,
"rps_doc_books_importance": -206.88111877441406,
"rps_doc_books_importance_length_correction": -206.88111877441406,
"rps_doc_openwebtext_importance": -127.21772766113281,
"rps_doc_openwebtext_importance_length_correction": -127.21772766113281,
"rps_doc_wikipedia_importance": -113.61531829833984,
"rps_doc_wikipedia_importance_length_correction": -113.61531829833984
},
"fasttext": {
"dclm": 0.024537209421396255,
"english": 0.5549865961074829,
"fineweb_edu_approx": 2.6780991554260254,
"eai_general_math": 0.22733283042907715,
"eai_open_web_math": 0.19447702169418335,
"eai_web_code": 0.6408852934837341
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.435",
"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": "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": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,803,943,489,928,690,000 |
Pleo HQ https://pleohq.com/ For IT Geeks and Hobbyists Thu, 29 Sep 2022 14:52:30 +0000 en-US hourly 1 https://wordpress.org/?v=6.0.2 Data Centers How Do They Work? https://pleohq.com/2022/09/29/data-centers-how-do-they-work/ https://pleohq.com/2022/09/29/data-centers-how-do-they-work/#respond Thu, 29 Sep 2022 14:52:19 +0000 https://pleohq.com/?p=408 Data centers are a significant backbone of the internet. They store data and make emails, videos, and photos possible. But how exactly do data center modules work? This video outlines the basics of data centers. A data center is a… Continue Reading…
The post Data Centers How Do They Work? appeared first on Pleo HQ.
]]>
Data centers are a significant backbone of the internet. They store data and make emails, videos, and photos possible. But how exactly do data center modules work? This video outlines the basics of data centers. A data center is a building that accommodates servers, telecommunications, and storage equipment.
Video Source
They are typically large buildings or rooms with rows and rows of racks, each containing multiple servers. The purpose of data center module racks is to keep servers cool, so they can continue working at capacity without overheating.
The data center is an entire ecosystem of complementary technologies and processes. They need a space to house the equipment necessary to run them, including electrical power sources, cooling systems, networking equipment, and more.
Servers are computers that store and process information in data centers. They are typically housed in racks arranged along walls or rows on raised platforms called mezzanines within the facility. Servers are connected using cables and network switches to form networks within each rack. These networks allow servers to communicate with clients through high-speed internet connections. Data center modules have several layers of security and redundancy built in so that if one component fails, others can take over immediately.
The post Data Centers How Do They Work? appeared first on Pleo HQ.
]]>
https://pleohq.com/2022/09/29/data-centers-how-do-they-work/feed/ 0
Reach a Bigger Audience Using SEO to Your Advantage https://pleohq.com/2022/08/10/reach-a-bigger-audience-using-seo-to-your-advantage/ https://pleohq.com/2022/08/10/reach-a-bigger-audience-using-seo-to-your-advantage/#respond Wed, 10 Aug 2022 21:21:14 +0000 https://pleohq.com/?p=404 If you are a businessman, you need to adapt to online marketing to be successful, regardless of the field of business that you are in. SEO is one of the most essential online marketing tools for survival in the cut-throat… Continue Reading…
The post Reach a Bigger Audience Using SEO to Your Advantage appeared first on Pleo HQ.
]]>
If you are a businessman, you need to adapt to online marketing to be successful, regardless of the field of business that you are in. SEO is one of the most essential online marketing tools for survival in the cut-throat business world. With SEO, you can make your website easily visible to customers and enhance your site’s overall performance. Here are a few ways to reach a bigger audience with SEO.
Video Source
A searcher’s location and history determine the website’s ranking and results. However, these factors change frequently. To stay ahead of the competition, you could use SEO to keep up with the search trends and improve the browsing experience of internet users. You could also use SEO to identify relevant keywords to your niche. SEO can help you get long-tail and short tail-keywords with high search rates.
One of the most incredible ways to use SEO to your advantage is to give customers a great experience using your website. You can increase customer experience by designing a website with an easy-to-use interface and decreasing the website’s loading time. You can also optimize your customer experiences using browser cache. Great experiences lead to return visits. Check out the link above for more tips.
The post Reach a Bigger Audience Using SEO to Your Advantage appeared first on Pleo HQ.
]]>
https://pleohq.com/2022/08/10/reach-a-bigger-audience-using-seo-to-your-advantage/feed/ 0
How to Setup Domain Names for Your Minecraft/Voice Server https://pleohq.com/2022/07/28/how-to-setup-domain-names-for-your-minecraft-voice-server/ https://pleohq.com/2022/07/28/how-to-setup-domain-names-for-your-minecraft-voice-server/#respond Thu, 28 Jul 2022 17:47:38 +0000 https://pleohq.com/?p=400 Minecraft is a video game where players build structures, mine resources, and craft items. As a result, they need to communicate with each other via a server. This video will show you how to set up domain names for your… Continue Reading…
The post How to Setup Domain Names for Your Minecraft/Voice Server appeared first on Pleo HQ.
]]>
Minecraft is a video game where players build structures, mine resources, and craft items. As a result, they need to communicate with each other via a server. This video will show you how to set up domain names for your Minecraft voice server.
The first step is to purchase a domain name on domain.
Video Source
com. Click on the “Domain Names” tab at the top of the page. Type the domain name you want into the search box and click “Search”. If the domain name is available, it will appear in a list below the search box, along with its price. To purchase the domain name, click the “Add to Cart” button and follow the instructions.
Next, create a CloudFlare account and add your domain name(s) to your CloudFlare account. Enter the Domains section of the CloudFlare control panel and click on Add Domain. You will need to configure the DNS records for your domain name(s). Save the settings selected and wait for a day for the changes to work.
You can now connect to your voice server through mc.contentrewards.com. People visiting your domain name will be automatically redirected to your Minecraft server.
The post How to Setup Domain Names for Your Minecraft/Voice Server appeared first on Pleo HQ.
]]>
https://pleohq.com/2022/07/28/how-to-setup-domain-names-for-your-minecraft-voice-server/feed/ 0
What Are the Benefits of Copier Rental Service? https://pleohq.com/2022/07/20/what-are-the-benefits-of-copier-rental-service/ https://pleohq.com/2022/07/20/what-are-the-benefits-of-copier-rental-service/#respond Wed, 20 Jul 2022 03:02:01 +0000 https://pleohq.com/?p=398 Copier rental services enable a business to benefit from new technology at a lower cost than outright purchase. That’s fantastic news for businesses with a tight budget or a dynamic workplace where printing requirements could fluctuate. When it comes to… Continue Reading…
The post What Are the Benefits of Copier Rental Service? appeared first on Pleo HQ.
]]>
Copier rental services enable a business to benefit from new technology at a lower cost than outright purchase. That’s fantastic news for businesses with a tight budget or a dynamic workplace where printing requirements could fluctuate.
When it comes to getting the technology they require to operate, businesses that are expanding or putting up new offices have a wide range of options that copier rental companies can provide. Depending on the situation, a business may find in a copier rental company an office copier to have a number of compelling benefits.
Any business makes a major investment when purchasing a printer or copier. These devices usually cost thousands of dollars, and on top of that, owning one has certain obligations. Owning a printer or copier may be very expensive for a business, between the initial purchase price and ongoing maintenance and consumables.
In contrast, many of these expenses are reduced if you get copier rental services. Even if a gadget is financed, many technology providers don’t demand a sizable down payment. For many businesses, this feature alone makes copier rentals appealing. Since they still own the equipment, some technology providers offer maintenance services for little or no cost. When looking around for a lease, keep this in mind.
The post What Are the Benefits of Copier Rental Service? appeared first on Pleo HQ.
]]>
https://pleohq.com/2022/07/20/what-are-the-benefits-of-copier-rental-service/feed/ 0
Process of Dock Leveler Maintenace https://pleohq.com/2022/04/15/process-of-dock-leveler-maintenace/ https://pleohq.com/2022/04/15/process-of-dock-leveler-maintenace/#respond Fri, 15 Apr 2022 15:40:55 +0000 https://pleohq.com/?p=390 If you spend any amount of time in a warehouse or manufacturing plant, you understand the importance of efficiency and safety. Loading docks are one of the busiest and most hazardous areas of your operations, especially when you are actively… Continue Reading…
The post Process of Dock Leveler Maintenace appeared first on Pleo HQ.
]]>
If you spend any amount of time in a warehouse or manufacturing plant, you understand the importance of efficiency and safety. Loading docks are one of the busiest and most hazardous areas of your operations, especially when you are actively seeking peak performance of day to day business. Dock levelers are vital pieces of equipment that prevent unexpected logistics breakdowns and help keep safety at the dock, front and center. Here is what happens during a dock leveler preventative maintenance inspection.
Video Source
They will start by cleaning the pit area; inspect all lip out mechanisms (pins, lip crank, links, chains and shackles) and replace any that look worn. Then they will lubricate the dock leveler with the proper lubricants in all appropriate locations. Make sure to inspect all weather seals (if installed) and replace if worn or damaged. Also, inspect dock bumpers. Four inches of bumper protection is required. Worn, torn, loose or missing bumpers must be replaced. They then check the condition of concrete, angles and welds. Repair or replace if necessary. Lastly, they will inspect the structure, hinge pins, clevis pins, and cotter pins for abnormal wear and tear.
.
The post Process of Dock Leveler Maintenace appeared first on Pleo HQ.
]]>
https://pleohq.com/2022/04/15/process-of-dock-leveler-maintenace/feed/ 0
Tips for Getting Your Family Dentist Practice Ready https://pleohq.com/2022/03/22/tips-for-getting-your-family-dentist-practice-ready/ https://pleohq.com/2022/03/22/tips-for-getting-your-family-dentist-practice-ready/#respond Tue, 22 Mar 2022 12:19:15 +0000 https://pleohq.com/?p=383 Updated 07/08/22 Starting your dental practice could be challenging. To successfully establish a family dental practice, you need a detailed business plan and the perfect location for business. Once you find an ideal location, look for dental staff within the… Continue Reading…
The post Tips for Getting Your Family Dentist Practice Ready appeared first on Pleo HQ.
]]>
Updated 07/08/22
Starting your dental practice could be challenging. To successfully establish a family dental practice, you need a detailed business plan and the perfect location for business. Once you find an ideal location, look for dental staff within the locality. Most people prefer a local dentist to an outside practitioner due to patient-specialist trust and confidence. Hence, employing staff from the locality will be an added advantage.
Are You Born With Your Permanent Teeth? All children are born with permanent teeth that remain hidden in the jaws until the primary teeth are shed off at the age of 6 or7 years.
Are You Meant To Lose Your Molars? All babies must shed the first set of molars by adolescence. However, some children’s primary teeth sometimes remain in the gums because the permanent teeth are missing. They may also fail to lose their molars if they experience dental infections that disrupt their dental development.
At What Age Does a Child Get Their Molars? The permanent molar teeth of a child begin to erupt at the age of 6 to 7 years. Most children experience gum irritation and discomfort with the back wisdom teeth coming through the gums.
Starting a family dental practice can be overwhelming. Many dentistry students seek employment at established health centers and clinics after college. The few who pursue setting up their dentist practice find it hard. However, the benefits of owning the practices justify the hassles.
Like any other business, starting and running a dentist’s practice requires skills not taught in medical school. To achieve your desired success, you’ll need to be patient, hardworking, and persistent. Opening the practice can take up to a year of planning and striving to meet your state’s licensure requirements.
The process involves looking for funding from financial institutions and using an advanced loan to purchase dentists’ medical supplies and other necessary equipment for operations in the dentist’s practice. Even though you may be running a sole proprietorship, you’ll need help from other staff to run the clinic effectively. Getting the right candidate for the job will ensure that you don’t undermine your efforts by using unqualified staff. Everyone at practice should know your dream and vision and work towards achieving it.
This article describes ten ways/ tips of getting your family dentist up and running. Also, it analyses the factors to consider at different stages of starting the practice.
1. Writing a Business Plan
A business plan is a road map to getting your family dentist clinic ready and running. It’s one of the most necessary tools for existing and budding entrepreneurs. In coming up with the plan, you can follow the steps below;
Stating Your Family Dentist Practice Goals Clearly
When writing the plan, outline the essential goals of your dentist’s practice. Set the required parameters for a successful business to achieve your vision. The key factors to consider include:
• Number of patients estimated to visit the dentist practice weekly
• Estimated weekly income
• The number of other support staff you’ll need to operate efficiently
Having Basic Financial Knowledge
As an entrepreneur, you’ll need to address the economic side of your dentist practice. Get answers to the following questions;
• How much will the dentist practice cost to be up and start running?
• What are the expenses as compared to projected income?
• What are the profit margins of the dentist’s practice?
If you can answer the questions confidently, then you’re in a better place to succeed in business.
Calculate other expenses like technology, office furniture, and dentist medical supplies to analyze future income. Also, calculate recurring/ongoing expenses, including salaries, software management, licensing costs, rent, and medical insurance.
Writing Executive Summary
Please include in the business plan a brief overview of critical points of dentist practice and its benefits to the local community. Provide an apparent advantage/reason for your business to patients. Does the business offer a solution to patients? Craft the company’s mission to align with the vital reason for opening the practice.
Outlining Findings from the Market Research
Market research will be based on patients’ demographics and all the services you’re planning to offer. Write about your ideal clientele and the different means you’ll use to get the target patients. Also, dentists’ medical supplies you’ll need to start the practice.
Analyzing Your Opportunities
The business plan will include existing opportunities for the dentist’s practice. List the services you’ll offer and outline the gap you’re planning to fill in the existing market.
Projections and Budgeting
Include your future revenue projections and expenses. If you’re planning to apply for a loan to cover your company’s starting capital, estimate three years’ revenues and expenses. If the plan shows an earning potential, you can start budgeting expenses like dentist medical center supplies and other equipment.
2. Looking for Funding
After writing a business plan, you can look for a bank or other financial institutions to fund your dentistry practice. Some of the factors to consider when choosing the right financing include;
Finding Specialists
Some banks have special divisions which solely deal with dental/medical loan applications. The officers in charge of these divisions have a vast knowledge of the medical sector and can advise you on the best available loan types for your business. Also, the officers understand revenue structures, expense models, and the risks of starting a dentist’s practice.
Different shopping banks
To increase your odds of getting business loans, submit your loan application documents to five to ten banks. Out of the applications, you’ll receive more than one offer with varying terms. Make an informed decision based on repayment period, loan amount, interest rates, and other key terms.
Applying a Conservative Approach
Stick to the business plan when buying dentists’ medical supplies and other equipment/ software used in dentists’ practice. You’ll be able to control expenses and remain within the budget estimates.
Using the Waiting Time Well
Financial institutions and banks usually take time before approving and advancing business loans. While waiting for funding, you can tackle other key steps like obtaining vital licensing, signing a lease, or applying for medical insurance. There is too much work to be done. Don’t just laze around.
3. Selecting Location
Choosing the location of your dentist’s practice is as important as other steps for getting ready. An appropriate location will ensure patients can access your office hassle-free. If you decide to rent, lease, or buy an office, the processes are lengthy and time-consuming. The factors to consider in selecting a suitable location include;
Population Demographics
Once you open a medical practice in the area, the chances are high that you’ll stay there with your family. Ensure you’re okay staying in the region.
The area’s population needs to be significant to support your dentist practice. A large population means a high number of clients.
Check the community’s average age, employers, and income levels. If the population consists of a few young people, they will not adequately support your business. The residents should fit your pricing structure. Large employers will reflect increased insurance coverage.
Competition
Analyze local competitors’ dentist practices offering similar services to you in the region. Look at their proximity to your preferred location. More established competitors will pose a significant challenge to your business. You can consider finding unexplored regions where attracting and maintaining clients will be easier.
Visibility of the Preferred Location
The visibility of the location determines if new clients will quickly locate your clinic or not. Efforts to improve visibility will help market your business immensely. Signage boards market your business to people on highways and main roads.
If you’re in secluded areas, optimize other marketing strategies to make sure you reach potential clients.
Aesthetics of Selected Building
The appearance of the building will serve as the first point of interaction with clients. Ensure all necessary repairs are done. Hire a flooring installer to repair floor problems. Commercial plumbing companies and a dumpster rental company will keep your clinic well maintained and free from water leakages. If you need professional tile cleaning services, get them. Make sure the building is clean throughout.
4. Selecting an Appropriate Legal Structure
The business structure selected should set you up for success while addressing crucial dentist practice needs. The options for structure include;
• Limited liability partnerships
• Professional limited liability companies
• Professional associations
The uniqueness of each structure depends on liabilities and tax obligations. You should select the structure which matches your dentist’s practice details, potential liability amounts, and tax obligations. You can consult a healthcare attorney to determine which structure fits your business perfectly.
5. Getting Practice Licenses
Dentists go through the licensing process at least once. The requirements for getting a license include;
Educational
All states require a D.M.D or D.D.S degree from a university-based dental program accredited by the Commission on Dental Accreditation(CODA).
Written Examination
Licensure candidates should pass parts 1 and 2 of the written national board dental examination.
Clinical Examination
Candidates for licensing are subject to clinical examination requirements. State boards rely on regional testing boards which administer the exams.
Once you’ve passed the examinations, you are licensed by your state to do dentistry. The licensing process can differ from one state to another.
6. Getting Insurance
You can’t underestimate the advantages of insuring family dentist practice. It’s necessary to understand mandatory insurance and optional insurance for your region. You can consult healthcare professionals like attorneys for advice. The standard insurance types are;
• Liability insurance
• Malpractice insurance
• Disability coverage insurance
• Umbrella policy
• Business interruption insurance
• Life, health, and disability insurance
Getting the right insurance will ensure that in cases of unexpected occurrences, your clients, staff, and yourself are covered and compensated.
7. Buying Dentist Medical Supplies
At this stage, you’ll need to put together vital software and equipment that will facilitate the day-to-day operations of your business. In purchasing dentist medical supplies, it’s essential to stick to your budget and get the most crucial equipment first.
Some of the software you might purchase include electronic health records systems, practice management systems, medical billing systems, and medical transcription systems. An IT service provider can sell and manage this software at a fee.
Dentist medical supplies are the ideal time to buy when you’re closing on opening your doors to patients. The medical supplies include;
• Examination tables
• Fax machines, computers, phones, and credit card processors
• Utilities and internet
• Needed building supplies like tiles, bulbs, and water pipes
• Chairs, desks, and other types of furniture
Make sure you buy the most critical equipment and stick to the budget.
8. Hiring Staff and Marketing
Like other businesses, you’ll be required to hire support staff and market your business to cement your presence. You hire staff who will help with bookkeeping, reception duties, and billing.
Marketing will enable clients to know about your dental practice’s existence, the services you provide, and the location of your health center or clinic.
Here are tips for building an effective marketing plan:
• Building a company website
• Claiming local listings
• Regularly sending newsletters to customers
• Starting an attractive client referral program
• Starting a blog
• Getting published in the region’s health journals
Many people fail to distinguish the difference between marketing and advertising. In general, advertising lies within the confines of good marketing strategies.
9. Partnering with Parents
The purpose of family dentist office locations is to keep everyone’s dental care in one medical health center. It saves them traveling costs in different towns. As an entrepreneur, strategize ways of partnering with parents to ensure their experiences are seamless and stress-free.
If you’re a pediatric dentist, you can detail numerous ways you’ll cater to your babies who are patients. Explain the preventive, cosmetic, and restorative dental services you’ll offer to different ages.
Also, you can add orthodontics services to save patients from looking for another specialist if the need arises. Note that clients will come back if you offer them quality services.
10. Offering Advanced Dentistry Services
To get an edge over your competitors, you can offer advanced dental care. A family dentist taking this approach gets more clients than one with a limited scope.
Some of the advanced services include; pediatric dentistry, periodontists, endodontics, or oral surgery. Patients asking for these advanced services will come to your family dentist’s office. As long as you can get dentist medical supplies required, don’t limit yourself.
Select two areas that interest you and find ways to expand your specialties. You can consider going back to college to add dental skills if necessary. Ultimately, your dental clinic will be valuable to patients who typically have varying dentistry needs.
To start and run a successful family dentist requires the following steps keenly to avoid cases of incompliances. Many dental specialists seek employment before thinking about starting their practice. No matter the number of years of experience, getting a dentist’s practice up and running requires persistence.
When buying dentist medical supplies, it’s essential to stick to your budget to avoid running out of cash before opening the clinic. Remember to keep your budgeted expenses below the financing amount. The unbudgeted money will help in times of emergencies and cover additional expenses.
The post Tips for Getting Your Family Dentist Practice Ready appeared first on Pleo HQ.
]]>
https://pleohq.com/2022/03/22/tips-for-getting-your-family-dentist-practice-ready/feed/ 0
Tips For The Best Minecraft Server Hosting https://pleohq.com/2022/02/17/tips-for-the-best-minecraft-server-hosting/ https://pleohq.com/2022/02/17/tips-for-the-best-minecraft-server-hosting/#respond Thu, 17 Feb 2022 20:16:02 +0000 https://pleohq.com/?p=379 According to some research, as of May 2020, there have been over 200 million copies of Minecraft sold. Minecraft private server hosting has become more popular over the years, and many gamers aspire to have more than just good Minecraft… Continue Reading…
The post Tips For The Best Minecraft Server Hosting appeared first on Pleo HQ.
]]>
According to some research, as of May 2020, there have been over 200 million copies of Minecraft sold. Minecraft private server hosting has become more popular over the years, and many gamers aspire to have more than just good Minecraft server hosting. Having a Minecraft server involves having a private sever, that uses web hosting services to allow anyone with access to enter your Minecraft world.
Video Source
Some of the best Minecraft server hosting package options are affordable, and support all different kinds of servers for more broad use. You can change the design of your launcher, and allow people to join your world through this launcher. There are data centers around the world that offer good Minecraft server hosting for your private usage. Many companies offer plans that are very focused to meet your needs for specialized Minecraft hosting, and should offer instant set up options for quick access. You may be interested in using a company that allows you to set up a private server in seconds, and only charges a small fee as you use it per month. You can prioritize the privacy and security of your data with a good Minecraft server hosting product from a reputable company.
.
According to some research, as of May 2020, there have been over 200 million copies of Minecraft sold. Minecraft private server hosting has become more popular over the years, and many gamers aspire to have more than just good Minecraft server hosting. Having a Minecraft server involves having a private sever, that uses web hosting services to allow anyone with access to enter your Minecraft world. Some of the best Minecraft server hosting package options are affordable, and support all different kinds of servers for more broad use. You can change the design of your launcher, and allow people to join your world through this launcher. There are data centers around the world that offer good Minecraft server hosting for your private usage. Many companies offer plans that are very focused to meet your needs for specialized Minecraft hosting, and should offer instant set up options for quick access. You may be interested in using a company that allows you to set up a private server in seconds, and only charges a small fee as you use it per month. You can prioritize the privacy and security of your data with a good Minecraft server hosting product from a reputable company.
The post Tips For The Best Minecraft Server Hosting appeared first on Pleo HQ.
]]>
https://pleohq.com/2022/02/17/tips-for-the-best-minecraft-server-hosting/feed/ 0
Tips For Buying Body Cameras For Security https://pleohq.com/2022/02/09/tips-for-buying-body-cameras-for-security/ https://pleohq.com/2022/02/09/tips-for-buying-body-cameras-for-security/#respond Wed, 09 Feb 2022 16:53:08 +0000 https://pleohq.com/?p=377 Body cameras for security purposes is great way to increase personal protection and awareness for safety. According to some research, the global dashboard camera market, was valued at US$ 1,458.2 Mn in 2013 and is predicted to have grown at… Continue Reading…
The post Tips For Buying Body Cameras For Security appeared first on Pleo HQ.
]]>
Body cameras for security purposes is great way to increase personal protection and awareness for safety. According to some research, the global dashboard camera market, was valued at US$ 1,458.2 Mn in 2013 and is predicted to have grown at an annual growth rate of 15.3% from 2014 to 2020. A body cam is a personal camera attached to the front of your garments securely in order to record footage for proof of a violation of your safety. Body cameras for civilians are good for security patrol, and dash cameras for car safety are an even better way to ensure your person is recorded incase of an incident. The differences in body camera cost depend on the storage available and the quality of the lens attached. Some in car camera systems can include simple operation with full HD recordings to store all your video captures while driving. Using body cameras for security is ideal for usage during your work shift, or even just in your daily life while traveling. Having body cameras for security with long lasting battery life, up to 9 hours of recording and night vision may be beneficial for your life.
The post Tips For Buying Body Cameras For Security appeared first on Pleo HQ.
]]>
https://pleohq.com/2022/02/09/tips-for-buying-body-cameras-for-security/feed/ 0
Different Services an Electrician Can Do in the Home and Office https://pleohq.com/2022/01/11/different-services-an-electrician-can-do-in-the-home-and-office/ https://pleohq.com/2022/01/11/different-services-an-electrician-can-do-in-the-home-and-office/#respond Tue, 11 Jan 2022 13:58:44 +0000 https://pleohq.com/?p=367 The electrical wiring system in your home or office is vital for your comfort and convenience. This system works in different ways; operating lights, providing heat, cooling the house, and charging various appliances. You’ll need to understand how this electrical… Continue Reading…
The post Different Services an Electrician Can Do in the Home and Office appeared first on Pleo HQ.
]]>
The electrical wiring system in your home or office is vital for your comfort and convenience. This system works in different ways; operating lights, providing heat, cooling the house, and charging various appliances. You’ll need to understand how this electrical system works to know when something is amiss. However, relying on a professional could be a better decision. Such will be the time to engage an electrician, who will provide the following services.
Residential Electrical Services
A residential electrician focuses on domestic electrical services, including wiring, installation, and repair. You can rely on this professional to complete your wiring system, maintain the electrical system, and install lights. They will also diagnose and fix the issues within your residential electrical system.
An excellent residential electrician will handle various residential appliances too. They will ensure that specialty appliances or machinery, including fridges, microwaves, and washing machines, are in excellent condition. You’ll hire them to undertake electrical panel install changes, enhance surge protection, and carry out various lighting maintenance, installation, or repair services.
Plumbing and electrical services are interdependent. As such, expect a residential electrician to work hand in hand with a plumber. They will ensure that various installations and fixtures do not affect each other, enhancing your safety in the long run. These two professionals will often work together during construction and when remodeling houses.
Commercial Electrical Services
You’ll need a commercial electrician if you want a job done on any commercial property. These professionals understand the various electrical service regulations, ensuring that your office or commercial property is compliant. Such compliance protects you against numerous lawsuits in the long run.
This professional will help enhance the electrical safety of your building. You’ll be sure of incredible service when handling inadequate circuits, whether repairing or replacing them. They will also install and maintain wiring, cushion the structure against significant fire hazards and even downtime.
Various specialty appliances in the office require an electrician. For instance, this professional will deal with the generators, security surveillance systems, and air conditioners within the building. Sometimes, they will help restore your printing services by fixing printers and computers alike.
Maintenance Electrical Services
Suppose you want your electrical wiring system to remain in top shape. In this case, it would be best to inspect them regularly, identify faults and address them. That means the electrician will guarantee various electrical systems are safe and that they work efficiently. These systems could be residential or commercial.
Maintenance involves various smaller tasks or projects. For instance, an electrician might need to handle the power grid in your building or fix heavy machinery in a factory. Each of the problems dealt with requires troubleshooting. This technician will conduct multiple tests and inspections, capturing all the issues at hand. This way, the project becomes more seamless in the long run.
A maintenance electrician comes in handy when taking care of your home appliances. This professional will recalibrate your temperature settings, avoid overloads, and clean refrigerator coils. They will address any noise caused in the device, ensuring that it functions quietly.
Powerhouse and Substation Services
Suppose you have a powerhouse, substation, or an electrical company, and you want to ascertain that the electrical current is safe. In this case, it will help if you hire a reliable electrician. This electrician will ensure that the electrical current is relayed safely and in the correct form.
This electrician will work in three main areas: the powerhouse, relays, and substations. Working in the powerhouse means that the electrician will need to deal with high-voltage Ac electricity, which is generated and transferred to substations. Here, the professional needs to lower the AC voltage at the substation, making the electricity safe for residential and commercial space use.
You could also rely on a professional to help maintain the relays. The technician will step the voltage up or down, ensuring that the electricity is safe for consumption in residential and commercial properties.
Security and Fire Alarm Installation Services
Proper installation of your security and fire alarm assures you of excellent monitoring and fire detection. These systems will often help improve your safety only when functioning correctly. Yet, proper functioning requires the professional services of an electrician.
You’ll need a technician specializing in security and fire alarm services. This expert will help install the devices correctly, assuring you with excellent surveillance abilities. Such proper installation implies that the devices will also last long, functioning accordingly.
At the same time, this electrical technician comes in handy in inspecting and maintaining the security and fire alarm devices. Regular inspection and maintenance allow the expert to troubleshoot and identify issues before they balloon. All you need is to hire an experienced professional. Such a professional must also understand the data recovering process.
Appliance Installation and Maintenance Services
Suppose you purchase a kitchen appliance today. In this case, you will need a professional to help you install it. Hiring an electrician specializing in the specific brand or device would be best. This way, you are confident of premium-quality services.
Various appliance companies have embraced different technologies, including Bluetooth and internet connectivity. For this reason, handling different brands becomes a challenge. This aspect has forced many companies to certify their electricians, ensuring that customers get the best service when necessary.
Always pick a professional that specializes in a specific brand. Extensive experience in a particular brand implies that the professional understands the ins and outs of the appliance at hand. Their knowledge allows for much better services, including minimal chances of further damage.
Electrical Inspectorate Services
An electrical inspector is a qualified professional who helps observe, repair, and maintain various electronic components. This expert plays a critical role in enhancing the safety of your lighting, electrical wiring, and appliances, including generators and motors. In addition, they confirm your compliance with multiple government regulations.
This professional often works in the construction industry. They ensure that the wiring and electrical systems in the building are per the set regulations. You’ll also expect them when doing your house renovations or remodeling. Usually, they are better placed to offer insightful information on maintaining the best wiring or electrical system.
An excellent electrical inspector will keep records, making it easier to keep track of problems within a building. Notably, this inspector can stop your workers from the job, mainly if your electrical system is not compliant.
Electrical Instrumentation Services
Each home and office comes with different building control systems. Whether you have an air conditioner, refrigerator, or heating system, you’ll need a professional to diagnose, test, repair, or commission it. Fortunately, this is where an electrician steps in.
A typical electrical instrumentation expert will help calibrate various measuring instruments. Calibration ensures that your appliances, especially those with thermostats, function correctly. In addition, this technician will install controlling devices and sensors on time.
Notably, this technician works with other specialized electricians. That means they are likely to engage other experts once they note a problem with your electrical wiring system. Electrical instrumentation services are necessary for different industries, including food processing plants, oil refineries, and manufacturing plants.
Automotive Electrical Services
Automotive electrical services are critical in ensuring that your vehicle, truck, or bus is functional. This service focuses on repairing, maintaining, inspecting, and replacing various vehicles’ electrical system components. It requires a specialized technician to troubleshoot the electrical system and solve the identified problems.
An automotive electrician could specialize in specific departments or be a general contractor. Some of the areas this professional can specialize in include ignition systems, air conditioning and heating systems, anti-lock braking system, fuel injection, transmissions, and anti-theft systems.
When hiring this technician, it would help if you chose a specialized one. Specialization allows the technician to perform thorough checks on your electrical wiring system, providing a more in-depth service. In addition, ensure that this professional is experienced enough to handle your car lest you suffer significant losses in the long run.
Electrical Machine Repair and Rewind Services
Your building has several devices, including fans, transformers, and compressors. All these machines need excellent electrical services from qualified personnel. Fortunately, that is what you get from an experienced electrical machine repairer and rewinder.
This electrician will dismantle and re-assemble different devices used in a home or office. They will ensure the electrotechnology components connect coils and wind coils. As such, your screen printing business will benefit from these business IT companies. That is because they will ensure that your printers are in great shape.
Electrotechnical Panel Building Services
Your HVAC system will hardly function without a reliable electronic panel. This electronic panel can only be installed and maintained by an electrotechnical panel technician. Notably, electronic panels are not limited to residential places only. Instead, you can find them in offices, industries, and manufacturing plants.
An electrotechnical panel builder relies on various programmable logic controls to help install and maintain this electronic panel. In addition, such a professional must be conversant with different information technologies, making the programming tasks much more effortless. What’s more, it becomes easier for them to read electrical schematics and panel layout blueprints comfortably.
Proper installation and maintenance of electrical control boxes ensure that your electrical system and appliances function correctly. However, you’ll need to regularly engage this professional to inspect and maintain the electronic panels. It will help avoid downtime in your business.
Wind Turbine and Solar Energy Electrical Services
Everyone is cautious of the environment. For this reason, many companies have invested in non-renewable energy, including solar and wind turbines. Maintaining these electrical systems will ensure that you get energy more efficiently.
An electrician will help install, assemble, and maintain your wind turbine and tower. This move ensures that electricity generation is smooth and effortless. Since most wind turbines are in high-altitude and remote regions, expect them in such areas.
This professional will need to feather the turbine blades. Feathering ensures that the turbine blades turn effortlessly, enhancing airflow and electricity generation. In turn, the turbines perform with maximum efficiency.
Suppose you need a professional to help maintain your solar energy system. In this case, you will require a professional who specializes in solar power. This expert will help you assemble, install, and maintain your solar energy system.
Telecommunications Line Installation
Your internet and phone connectivity will always depend on electrical services. A telecommunications line expert will come in handy to install and maintain telecommunications lines, assuring you better connectivity.
A telecommunications electrician will install, fix, and repair telephone, internet, and cable lines. These lines often run between towers, poles, or buildings. They will also help troubleshoot internet and telephone issues, addressing the problem soon.
You could also rely on them to replace or repair broken lines. They will also help diagnose the problems with these lines, ensuring optimal functionality.
Emergency Electrical Services
Some events are unexpected, for instance, floods, tree damage, and hurricanes. In such cases, various appliances could suffer water damage, compromising your safety. Your electrical systems could also get compromised at odd hours. That means you will need an electrician to help repair, replace, or install different fixtures, appliances, and electrical components. An emergency electrician will be at your disposal at any time to help avert further crises.
Outside Lineman Electrical Services
The electrical lines between commercial buildings and residential properties need constant attention. Fortunately, an electrician will help handle these lines, including repairing, installing, and maintaining them. You can also expect them to string new lines between poles and replace them when broken. Their goal is to ensure an efficient supply of electricity.
These professionals ensure that the line installation is as per the set regulations. This move will help increase the safety of the people living or working within the region. In addition, they can help troubleshoot and identify issues with faulty lines, restoring electricity within a relatively short period.
In conclusion, people depend on different electrical repair service. Yet, they might not understand which service provider specializes in. Understanding these specializations will help ensure that you hire the right professional to help handle your appliances and electrical systems. This will be an easy task in the long run with the information provided above.
The post Different Services an Electrician Can Do in the Home and Office appeared first on Pleo HQ.
]]>
https://pleohq.com/2022/01/11/different-services-an-electrician-can-do-in-the-home-and-office/feed/ 0
What Do Colleges Look For During the Admissions Process https://pleohq.com/2022/01/07/what-do-colleges-look-for-during-the-admissions-process/ https://pleohq.com/2022/01/07/what-do-colleges-look-for-during-the-admissions-process/#respond Fri, 07 Jan 2022 15:31:06 +0000 https://pleohq.com/?p=369 Getting into your college or university of choice is definitely not simple. The admissions process encompasses a lot of things and it can be quite stressful if you are not prepared enough. The actual process of documentation for college applications… Continue Reading…
The post What Do Colleges Look For During the Admissions Process appeared first on Pleo HQ.
]]>
Getting into your college or university of choice is definitely not simple. The admissions process encompasses a lot of things and it can be quite stressful if you are not prepared enough.
The actual process of documentation for college applications is not that complicated, especially now that colleges are into setting up efficient CRM for higher education admissions. College admission software now allows for a faster recruitment process and reviews of applicants who are dreaming to be a part of a certain university.
The use of higher education enrollment software for recruiting applicants now helps colleges get more organized results out of their numerous applications. College admission management software makes the process more efficient, giving better opportunities for admissions offices to really focus on the review and evaluation of applicants.
Other than academic performances, extracurricular activities are also being considered through a holistic approach to examination. Students who are also open to challenges and new adventures are given credit for their attitude towards learning and education. College admission processes have evolved a lot over the years, adapting to the challenges of the current generation.
Know more about what happens in the college admissions process by watching this video.
The post What Do Colleges Look For During the Admissions Process appeared first on Pleo HQ.
]]>
https://pleohq.com/2022/01/07/what-do-colleges-look-for-during-the-admissions-process/feed/ 0
|
{
"url": "https://pleohq.com/feed/",
"source_domain": "pleohq.com",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "65455",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FQK3AQRFDHCVVYG53PRN7GKGKTJTRTNP",
"WARC-Concurrent-To": "<urn:uuid:27bc0789-9758-4c83-9869-8ddc96328e69>",
"WARC-Date": "2022-10-05T01:43:48Z",
"WARC-IP-Address": "172.105.20.43",
"WARC-Identified-Payload-Type": "application/rss+xml",
"WARC-Payload-Digest": "sha1:5KHC4S4W2NVCJNC7IUVPYAZNEAH4REIF",
"WARC-Record-ID": "<urn:uuid:9f0242ba-9686-4938-9fbb-bba2a8cc4df2>",
"WARC-Target-URI": "https://pleohq.com/feed/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:529f0a11-474c-4069-94ac-e7e4453d3091>"
},
"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-116\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,
602,
603,
670,
671,
675,
985,
986,
987,
1000,
1001,
1235,
1236,
1469,
1470,
1998,
1999,
2066,
2067,
2071,
2139,
2664,
2665,
2753,
2754,
2758,
3162,
3163,
3164,
3177,
3178,
3587,
3588,
3992,
3993,
4081,
4082,
4086,
4176,
4717,
4718,
4812,
4813,
4817,
5061,
5116,
5117,
5118,
5131,
5132,
5454,
5766,
5930,
5931,
6025,
6026,
6030,
6126,
6669,
6670,
6754,
6755,
6759,
6996,
6997,
7322,
7323,
7644,
7645,
8057,
8058,
8142,
8143,
8147,
8232,
8726,
8727,
8798,
8799,
8803,
9315,
9316,
9317,
9330,
9331,
9999,
10001,
10002,
10073,
10074,
10078,
10151,
10714,
10715,
10803,
10804,
10808,
10825,
10826,
11258,
11259,
11437,
11438,
11759,
11760,
11990,
11991,
12277,
12278,
12593,
12594,
13124,
13125,
13298,
13299,
13326,
13327,
13551,
13552,
13603,
13604,
13798,
13799,
13869,
13897,
13970,
13971,
14004,
14005,
14132,
14133,
14205,
14264,
14323,
14324,
14423,
14424,
14670,
14671,
14697,
14698,
15032,
15033,
15077,
15078,
15345,
15346,
15375,
15376,
15557,
15558,
15584,
15585,
15896,
15897,
15920,
15921,
16116,
16117,
16137,
16138,
16500,
16501,
16526,
16527,
16820,
16821,
16854,
16855,
17054,
17055,
17083,
17084,
17383,
17384,
17406,
17407,
17747,
17748,
17772,
17773,
17923,
17924,
18055,
18056,
18327,
18328,
18340,
18341,
18668,
18669,
18706,
18707,
18950,
18951,
19058,
19059,
19091,
19092,
19504,
19505,
19549,
19550,
19696,
19697,
19732,
19777,
19807,
19808,
20111,
20112,
20141,
20142,
20247,
20248,
20260,
20261,
20403,
20404,
20424,
20425,
20522,
20523,
20544,
20545,
20693,
20694,
20839,
20840,
20861,
20862,
21129,
21130,
21154,
21180,
21214,
21234,
21270,
21313,
21314,
21458,
21459,
21494,
21495,
21753,
21754,
21993,
21994,
22130,
22131,
22154,
22218,
22245,
22309,
22357,
22358,
22429,
22430,
22460,
22461,
22653,
22654,
22808,
22809,
22865,
22866,
22897,
22925,
22972,
23023,
23043,
23097,
23098,
23259,
23260,
23287,
23288,
23570,
23571,
23775,
23776,
23958,
23959,
24000,
24001,
24162,
24163,
24435,
24436,
24691,
24692,
25004,
25005,
25292,
25293,
25381,
25382,
25386,
25476,
25989,
25990,
26069,
26070,
26074,
26476,
26477,
26478,
26491,
26492,
27276,
27277,
27279,
27280,
28466,
28467,
28546,
28547,
28551,
28632,
29146,
29147,
29225,
29226,
29230,
30338,
30339,
30417,
30418,
30422,
30502,
31105,
31106,
31206,
31207,
31211,
31673,
31674,
31706,
31707,
32022,
32023,
32414,
32415,
32766,
32767,
32798,
32799,
33097,
33098,
33401,
33402,
33702,
33703,
33735,
33736,
34059,
34060,
34449,
34450,
34728,
34729,
34764,
34765,
35060,
35061,
35448,
35449,
35661,
35662,
35708,
35709,
35978,
35979,
36255,
36256,
36615,
36616,
36664,
36665,
36919,
36920,
37227,
37228,
37515,
37516,
37549,
37550,
37897,
37898,
38244,
38245,
38471,
38472,
38508,
38509,
38771,
38772,
39047,
39048,
39380,
39381,
39412,
39413,
39749,
39750,
40044,
40045,
40389,
40390,
40436,
40437,
40695,
40696,
41026,
41027,
41068,
41069,
41392,
41393,
41780,
41781,
42067,
42068,
42118,
42119,
42353,
42354,
42605,
42606,
42828,
42829,
43066,
43067,
43104,
43105,
43321,
43322,
43575,
43576,
43731,
43732,
43762,
43763,
44221,
44222,
44258,
44259,
44623,
44624,
44935,
44936,
45299,
45300,
45400,
45401,
45405,
45507,
46072,
46073,
46165,
46166,
46170,
46359,
46360,
46694,
46695,
47034,
47035,
47411,
47412,
47499,
47500,
47592,
47593,
47597
],
"line_end_idx": [
602,
603,
670,
671,
675,
985,
986,
987,
1000,
1001,
1235,
1236,
1469,
1470,
1998,
1999,
2066,
2067,
2071,
2139,
2664,
2665,
2753,
2754,
2758,
3162,
3163,
3164,
3177,
3178,
3587,
3588,
3992,
3993,
4081,
4082,
4086,
4176,
4717,
4718,
4812,
4813,
4817,
5061,
5116,
5117,
5118,
5131,
5132,
5454,
5766,
5930,
5931,
6025,
6026,
6030,
6126,
6669,
6670,
6754,
6755,
6759,
6996,
6997,
7322,
7323,
7644,
7645,
8057,
8058,
8142,
8143,
8147,
8232,
8726,
8727,
8798,
8799,
8803,
9315,
9316,
9317,
9330,
9331,
9999,
10001,
10002,
10073,
10074,
10078,
10151,
10714,
10715,
10803,
10804,
10808,
10825,
10826,
11258,
11259,
11437,
11438,
11759,
11760,
11990,
11991,
12277,
12278,
12593,
12594,
13124,
13125,
13298,
13299,
13326,
13327,
13551,
13552,
13603,
13604,
13798,
13799,
13869,
13897,
13970,
13971,
14004,
14005,
14132,
14133,
14205,
14264,
14323,
14324,
14423,
14424,
14670,
14671,
14697,
14698,
15032,
15033,
15077,
15078,
15345,
15346,
15375,
15376,
15557,
15558,
15584,
15585,
15896,
15897,
15920,
15921,
16116,
16117,
16137,
16138,
16500,
16501,
16526,
16527,
16820,
16821,
16854,
16855,
17054,
17055,
17083,
17084,
17383,
17384,
17406,
17407,
17747,
17748,
17772,
17773,
17923,
17924,
18055,
18056,
18327,
18328,
18340,
18341,
18668,
18669,
18706,
18707,
18950,
18951,
19058,
19059,
19091,
19092,
19504,
19505,
19549,
19550,
19696,
19697,
19732,
19777,
19807,
19808,
20111,
20112,
20141,
20142,
20247,
20248,
20260,
20261,
20403,
20404,
20424,
20425,
20522,
20523,
20544,
20545,
20693,
20694,
20839,
20840,
20861,
20862,
21129,
21130,
21154,
21180,
21214,
21234,
21270,
21313,
21314,
21458,
21459,
21494,
21495,
21753,
21754,
21993,
21994,
22130,
22131,
22154,
22218,
22245,
22309,
22357,
22358,
22429,
22430,
22460,
22461,
22653,
22654,
22808,
22809,
22865,
22866,
22897,
22925,
22972,
23023,
23043,
23097,
23098,
23259,
23260,
23287,
23288,
23570,
23571,
23775,
23776,
23958,
23959,
24000,
24001,
24162,
24163,
24435,
24436,
24691,
24692,
25004,
25005,
25292,
25293,
25381,
25382,
25386,
25476,
25989,
25990,
26069,
26070,
26074,
26476,
26477,
26478,
26491,
26492,
27276,
27277,
27279,
27280,
28466,
28467,
28546,
28547,
28551,
28632,
29146,
29147,
29225,
29226,
29230,
30338,
30339,
30417,
30418,
30422,
30502,
31105,
31106,
31206,
31207,
31211,
31673,
31674,
31706,
31707,
32022,
32023,
32414,
32415,
32766,
32767,
32798,
32799,
33097,
33098,
33401,
33402,
33702,
33703,
33735,
33736,
34059,
34060,
34449,
34450,
34728,
34729,
34764,
34765,
35060,
35061,
35448,
35449,
35661,
35662,
35708,
35709,
35978,
35979,
36255,
36256,
36615,
36616,
36664,
36665,
36919,
36920,
37227,
37228,
37515,
37516,
37549,
37550,
37897,
37898,
38244,
38245,
38471,
38472,
38508,
38509,
38771,
38772,
39047,
39048,
39380,
39381,
39412,
39413,
39749,
39750,
40044,
40045,
40389,
40390,
40436,
40437,
40695,
40696,
41026,
41027,
41068,
41069,
41392,
41393,
41780,
41781,
42067,
42068,
42118,
42119,
42353,
42354,
42605,
42606,
42828,
42829,
43066,
43067,
43104,
43105,
43321,
43322,
43575,
43576,
43731,
43732,
43762,
43763,
44221,
44222,
44258,
44259,
44623,
44624,
44935,
44936,
45299,
45300,
45400,
45401,
45405,
45507,
46072,
46073,
46165,
46166,
46170,
46359,
46360,
46694,
46695,
47034,
47035,
47411,
47412,
47499,
47500,
47592,
47593,
47597,
47690
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 47690,
"ccnet_original_nlines": 474,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3355555534362793,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0068888901732862,
"rps_doc_frac_lines_end_with_ellipsis": 0.021052630618214607,
"rps_doc_frac_no_alph_words": 0.19077777862548828,
"rps_doc_frac_unique_words": 0.23734678328037262,
"rps_doc_mean_word_length": 5.61658239364624,
"rps_doc_num_sentences": 500,
"rps_doc_symbol_to_word_ratio": 0.0033333299215883017,
"rps_doc_unigram_entropy": 6.22948694229126,
"rps_doc_word_count": 6935,
"rps_doc_frac_chars_dupe_10grams": 0.1824086755514145,
"rps_doc_frac_chars_dupe_5grams": 0.20204873383045197,
"rps_doc_frac_chars_dupe_6grams": 0.19175374507904053,
"rps_doc_frac_chars_dupe_7grams": 0.18990527093410492,
"rps_doc_frac_chars_dupe_8grams": 0.18808245658874512,
"rps_doc_frac_chars_dupe_9grams": 0.1859515756368637,
"rps_doc_frac_chars_top_2gram": 0.004107729997485876,
"rps_doc_frac_chars_top_3gram": 0.007701979950070381,
"rps_doc_frac_chars_top_4gram": 0.009755849838256836,
"rps_doc_books_importance": -3847.206298828125,
"rps_doc_books_importance_length_correction": -3847.206298828125,
"rps_doc_openwebtext_importance": -2323.197998046875,
"rps_doc_openwebtext_importance_length_correction": -2323.197998046875,
"rps_doc_wikipedia_importance": -1332.46337890625,
"rps_doc_wikipedia_importance_length_correction": -1332.46337890625
},
"fasttext": {
"dclm": 0.02032715082168579,
"english": 0.9188429117202759,
"fineweb_edu_approx": 1.8317885398864746,
"eai_general_math": 0.006215570028871298,
"eai_open_web_math": 0.03640681877732277,
"eai_web_code": 0.0025762899313122034
}
}
|
{
"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": "658.8",
"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": "-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": "10",
"label": "Knowledge Article"
},
"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": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,779,465,400,208,771,000 |
Collections
WEBINAR: On-demand webcast
How to Boost Database Development Productivity on Linux, Docker, and Kubernetes with Microsoft SQL Server 2017 REGISTER >
Bruce Eckel's Thinking in Java Contents | Prev | Next
To summarize what we’ve seen so far, your first, most efficient choice to hold a group of objects should be an array, and you’re forced into this choice if you want to hold a group of primitives. In the remainder of the chapter we’ll look at the more general case, when you don’t know at the time you’re writing the program how many objects you’re going to need, or if you need a more sophisticated way to store your objects. Java provides four types of collection classes to solve this problem: Vector, BitSet, Stack, and Hashtable. Although compared to other languages that provide collections this is a fairly meager supply, you can nonetheless solve a surprising number of problems using these tools.
Disadvantage: unknown type
The “disadvantage” to using the Java collections is that you lose type information when you put an object into a collection. This happens because, when the collection was written, the programmer of that collection had no idea what specific type you wanted to put in the collection, and making the collection hold only your type would prevent it from being a general-purpose tool. So instead, the collection holds handles to objects of type Object, which is of course every object in Java, since it’s the root of all the classes. (Of course, this doesn’t include primitive types, since they aren’t inherited from anything.) This is a great solution, except for these reasons:
1. Since the type information is thrown away when you put an object handle into a collection, any type of object can be put into your collection, even if you mean it to hold only, say, cats. Someone could just as easily put a dog into the collection.
2. Since the type information is lost, the only thing the collection knows it holds is a handle to an Object. You must perform a cast to the correct type before you use it.
//: CatsAndDogs.java
// Simple collection example (Vector)
import java.util.*;
class Cat {
private int catNumber;
Cat(int i) {
catNumber = i;
}
void print() {
System.out.println("Cat #" + catNumber);
}
}
class Dog {
private int dogNumber;
Dog(int i) {
dogNumber = i;
}
void print() {
System.out.println("Dog #" + dogNumber);
}
}
public class CatsAndDogs {
public static void main(String[] args) {
Vector cats = new Vector();
for(int i = 0; i < 7; i++)
cats.addElement(new Cat(i));
// Not a problem to add a dog to cats:
cats.addElement(new Dog(7));
for(int i = 0; i < cats.size(); i++)
((Cat)cats.elementAt(i)).print();
// Dog is detected only at run-time
}
} ///:~
The classes Cat and Dog are distinct – they have nothing in common except that they are Objects. (If you don’t explicitly say what class you’re inheriting from, you automatically inherit from Object.) The Vector class, which comes from java.util, holds Objects, so not only can you put Cat objects into this collection using the Vector method addElement( ), but you can also add Dog objects without complaint at either compile-time or run-time. When you go to fetch out what you think are Cat objects using the Vector method elementAt( ), you get back a handle to an Object that you must cast to a Cat. Then you need to surround the entire expression with parentheses to force the evaluation of the cast before calling the print( ) method for Cat, otherwise you’ll get a syntax error. Then, at run-time, when you try to cast the Dog object to a Cat, you’ll get an exception.
Sometimes it works right anyway
//: WorksAnyway.java
// In special cases, things just seem
// to work correctly.
import java.util.*;
class Mouse {
private int mouseNumber;
Mouse(int i) {
mouseNumber = i;
}
// Magic method:
public String toString() {
return "This is Mouse #" + mouseNumber;
}
void print(String msg) {
if(msg != null) System.out.println(msg);
System.out.println(
"Mouse number " + mouseNumber);
}
}
class MouseTrap {
static void caughtYa(Object m) {
Mouse mouse = (Mouse)m; // Cast from Object
mouse.print("Caught one!");
}
}
public class WorksAnyway {
public static void main(String[] args) {
Vector mice = new Vector();
for(int i = 0; i < 3; i++)
mice.addElement(new Mouse(i));
for(int i = 0; i < mice.size(); i++) {
// No cast necessary, automatic call
// to Object.toString():
System.out.println(
"Free mouse: " + mice.elementAt(i));
MouseTrap.caughtYa(mice.elementAt(i));
}
}
} ///:~
You can see the redefinition of toString( ) in Mouse. In the second for loop in main( ) you find the statement:
System.out.println("Free mouse: " + mice.elementAt(i));
Making a type-conscious Vector
//: GopherVector.java
// A type-conscious Vector
import java.util.*;
class Gopher {
private int gopherNumber;
Gopher(int i) {
gopherNumber = i;
}
void print(String msg) {
if(msg != null) System.out.println(msg);
System.out.println(
"Gopher number " + gopherNumber);
}
}
class GopherTrap {
static void caughtYa(Gopher g) {
g.print("Caught one!");
}
}
class GopherVector {
private Vector v = new Vector();
public void addElement(Gopher m) {
v.addElement(m);
}
public Gopher elementAt(int index) {
return (Gopher)v.elementAt(index);
}
public int size() { return v.size(); }
public static void main(String[] args) {
GopherVector gophers = new GopherVector();
for(int i = 0; i < 3; i++)
gophers.addElement(new Gopher(i));
for(int i = 0; i < gophers.size(); i++)
GopherTrap.caughtYa(gophers.elementAt(i));
}
} ///:~
This is similar to the previous example, except that the new GopherVector class has a private member of type Vector (inheriting from Vector tends to be frustrating, for reasons you’ll see later), and methods just like Vector. However, it doesn’t accept and produce generic Objects, only Gopher objects.
Because a GopherVector will accept only a Gopher, if you were to say:
gophers.addElement(new Pigeon());
you would get an error message at compile time . This approach, while more tedious from a coding standpoint, will tell you immediately if you’re using a type improperly.
Note that no cast is necessary when using elementAt( ) – it’s always a Gopher.
Parameterized types
Comments
• There are no comments yet. Be the first to comment!
Leave a Comment
• Your email address will not be published. All fields are required.
Top White Papers and Webcasts
• As all sorts of data becomes available for storage, analysis and retrieval - so called 'Big Data' - there are potentially huge benefits, but equally huge challenges...
• The agile organization needs knowledge to act on, quickly and effectively. Though many organizations are clamouring for "Big Data", not nearly as many know what to do with it...
• Cloud-based integration solutions can be confusing. Adding to the confusion are the multiple ways IT departments can deliver such integration...
Most Popular Programming Stories
More for Developers
RSS Feeds
Thanks for your registration, follow us on our social networks to keep up-to-date
|
{
"url": "http://www.codeguru.com/java/tij/tij0088.shtml",
"source_domain": "www.codeguru.com",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "181966",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2UYBZGCCHBES6SICJZPWZWM55PFJNJC7",
"WARC-Concurrent-To": "<urn:uuid:f8d47f88-9a73-4c2c-a1a8-a708d346cf49>",
"WARC-Date": "2017-10-24T11:21:16Z",
"WARC-IP-Address": "23.219.88.41",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GBKHSOWVRU2OTWWVUJQQW6YLRIKLEYYN",
"WARC-Record-ID": "<urn:uuid:e79be373-43df-4f0b-bc3c-507609c40afb>",
"WARC-Target-URI": "http://www.codeguru.com/java/tij/tij0088.shtml",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2d329074-115f-44f3-9d58-d5d4e5ae7a36>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-137-158-248.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-43\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for October 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,
12,
13,
40,
41,
163,
164,
218,
219,
924,
925,
952,
953,
1628,
1629,
1882,
2057,
2078,
2116,
2136,
2138,
2150,
2175,
2190,
2209,
2213,
2230,
2275,
2279,
2281,
2283,
2295,
2320,
2335,
2354,
2358,
2375,
2420,
2424,
2426,
2428,
2455,
2498,
2530,
2564,
2599,
2642,
2675,
2719,
2759,
2799,
2803,
2812,
2813,
3688,
3689,
3721,
3742,
3780,
3802,
3822,
3824,
3838,
3865,
3882,
3903,
3907,
3926,
3955,
3999,
4003,
4030,
4075,
4099,
4137,
4141,
4143,
4145,
4163,
4198,
4246,
4278,
4282,
4284,
4286,
4313,
4356,
4388,
4422,
4459,
4505,
4548,
4579,
4605,
4650,
4695,
4701,
4705,
4714,
4715,
4827,
4828,
4884,
4885,
4916,
4917,
4939,
4966,
4986,
4988,
5003,
5031,
5049,
5071,
5075,
5102,
5147,
5171,
5211,
5215,
5217,
5219,
5238,
5273,
5301,
5305,
5307,
5309,
5330,
5365,
5402,
5423,
5427,
5466,
5505,
5509,
5550,
5593,
5640,
5674,
5715,
5762,
5811,
5815,
5824,
5825,
6128,
6129,
6199,
6200,
6234,
6235,
6405,
6406,
6485,
6486,
6506,
6507,
6508,
6517,
6518,
6574,
6575,
6591,
6662,
6663,
6693,
6694,
6866,
7048,
7197,
7198,
7231,
7232,
7252,
7253,
7263,
7264
],
"line_end_idx": [
12,
13,
40,
41,
163,
164,
218,
219,
924,
925,
952,
953,
1628,
1629,
1882,
2057,
2078,
2116,
2136,
2138,
2150,
2175,
2190,
2209,
2213,
2230,
2275,
2279,
2281,
2283,
2295,
2320,
2335,
2354,
2358,
2375,
2420,
2424,
2426,
2428,
2455,
2498,
2530,
2564,
2599,
2642,
2675,
2719,
2759,
2799,
2803,
2812,
2813,
3688,
3689,
3721,
3742,
3780,
3802,
3822,
3824,
3838,
3865,
3882,
3903,
3907,
3926,
3955,
3999,
4003,
4030,
4075,
4099,
4137,
4141,
4143,
4145,
4163,
4198,
4246,
4278,
4282,
4284,
4286,
4313,
4356,
4388,
4422,
4459,
4505,
4548,
4579,
4605,
4650,
4695,
4701,
4705,
4714,
4715,
4827,
4828,
4884,
4885,
4916,
4917,
4939,
4966,
4986,
4988,
5003,
5031,
5049,
5071,
5075,
5102,
5147,
5171,
5211,
5215,
5217,
5219,
5238,
5273,
5301,
5305,
5307,
5309,
5330,
5365,
5402,
5423,
5427,
5466,
5505,
5509,
5550,
5593,
5640,
5674,
5715,
5762,
5811,
5815,
5824,
5825,
6128,
6129,
6199,
6200,
6234,
6235,
6405,
6406,
6485,
6486,
6506,
6507,
6508,
6517,
6518,
6574,
6575,
6591,
6662,
6663,
6693,
6694,
6866,
7048,
7197,
7198,
7231,
7232,
7252,
7253,
7263,
7264,
7345
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7345,
"ccnet_original_nlines": 177,
"rps_doc_curly_bracket": 0.007351940032094717,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31347963213920593,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0037617599591612816,
"rps_doc_frac_lines_end_with_ellipsis": 0.016853930428624153,
"rps_doc_frac_no_alph_words": 0.29216301441192627,
"rps_doc_frac_unique_words": 0.41812863945961,
"rps_doc_mean_word_length": 5.182260990142822,
"rps_doc_num_sentences": 89,
"rps_doc_symbol_to_word_ratio": 0.0037617599591612816,
"rps_doc_unigram_entropy": 5.487329483032227,
"rps_doc_word_count": 1026,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08689109981060028,
"rps_doc_frac_chars_dupe_6grams": 0.0472070686519146,
"rps_doc_frac_chars_dupe_7grams": 0.033665601164102554,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.014669929631054401,
"rps_doc_frac_chars_top_3gram": 0.009027649648487568,
"rps_doc_frac_chars_top_4gram": 0.010156099684536457,
"rps_doc_books_importance": -691.1569213867188,
"rps_doc_books_importance_length_correction": -691.1569213867188,
"rps_doc_openwebtext_importance": -411.5285339355469,
"rps_doc_openwebtext_importance_length_correction": -411.5285339355469,
"rps_doc_wikipedia_importance": -198.3345184326172,
"rps_doc_wikipedia_importance_length_correction": -198.3345184326172
},
"fasttext": {
"dclm": 0.11808258295059204,
"english": 0.8106773495674133,
"fineweb_edu_approx": 2.10038161277771,
"eai_general_math": 0.21915537118911743,
"eai_open_web_math": 0.12212889641523361,
"eai_web_code": 0.09883368015289307
}
}
|
{
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,651,163,555,208,117,000 |
Unleash awesomeness. Private packages, team management tools, and powerful integrations. Get started with npm Orgs »
leaflet-engine
0.4.5 • Public • Published
Leaflet
Leaflet is a modern, lightweight open-source JavaScript library for mobile-friendly interactive maps, developed by Vladimir Agafonkin of CloudMade with a team of dedicated contributors. Weighting just about 25kb of gzipped JS code, it still has all the features most developers ever need for online maps, while providing a fast, pleasant user experience.
It is built from the ground up to work efficiently and smoothly on both desktop and mobile platforms like iOS and Android, taking advantage of HTML5 and CSS3 on modern browsers. The focus is on usability, performance, small size, A-grade browser support, flexibility and easy to use API with convention over configuration. The OOP-based code of the library is designed to be modular, extensible and very easy to understand.
Check out the website for more information: leaflet.cloudmade.com
Contributing to Leaflet
Let's make the best open-source library for maps that can possibly exist!
Contributing is simple: make the changes in your fork (preferably in a separate branch), make sure that Leaflet builds successfully (see below) and then create a pull request (without the built files, just the source changes) to Vladimir Agafonkin (Leaflet maintainer). Updates to Leaflet documentation and examples (located in the gh-pages branch for current stable release and gh-pages-master for the in-progress version) are really appreciated too.
Note that bugfixes and small improvements are higher priority than new features or substantial API changes, and will be reviewed and merged much faster than pulls with lots of new code. If your new feature is not expected to be widely used, consider making a plugin instead. Lets keep Leaflet slim, fast and simple!
Here's a list of the awesome people that joined us already. Looking forward to your contributions!
Building Leaflet
Leaflet build system is powered by the Node.js platform and Jake, JSHint and UglifyJS libraries, which install easily and work well across all major platforms. Here are the steps to install it:
1. Download and install Node
2. Run the following commands in the command line:
npm install -g jake
npm install jshint
npm install uglify-js
Now that you have everything installed, run jake inside the Leaflet directory. This will check Leaflet source files for JavaScript errors and inconsistencies, and then combine and compress it to the dist folder.
To make a custom build of the library with only the things you need, use the build helper (build/build.html) to choose the components (it figures out dependencies for you) and then run the command generated with it.
If you add any new files to the Leaflet source, make sure to also add them to build/deps.js so that the build system knows about them. Happy coding!
Keywords
none
install
npm i leaflet-engine
Downloadsweekly downloads
89
version
0.4.5
license
none
homepage
github.com
repository
Gitgithub
last publish
collaborators
• avatar
Report a vulnerability
|
{
"url": "https://www.npmjs.com/package/leaflet-engine",
"source_domain": "www.npmjs.com",
"snapshot_id": "crawl=CC-MAIN-2019-09",
"warc_metadata": {
"Content-Length": "43714",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6UZ6PIZRVR5TN5WC5D27NF4JWWTQ7SCB",
"WARC-Concurrent-To": "<urn:uuid:068ebc63-1a5f-439b-8f3e-663f1dcd8fbd>",
"WARC-Date": "2019-02-16T05:20:55Z",
"WARC-IP-Address": "104.16.93.83",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7RUSKHFEJQACSVN7DDYGSF3JZOIN33XN",
"WARC-Record-ID": "<urn:uuid:744f557a-87d0-4803-bb4a-0dee3b36dae0>",
"WARC-Target-URI": "https://www.npmjs.com/package/leaflet-engine",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1c416de1-4d75-4f1c-a079-f7fda5731eba>"
},
"warc_info": "isPartOf: CC-MAIN-2019-09\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-29-101-93.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,
117,
118,
133,
134,
161,
169,
170,
525,
526,
950,
951,
1017,
1018,
1042,
1043,
1117,
1118,
1570,
1571,
1887,
1888,
1987,
1988,
2005,
2006,
2200,
2201,
2232,
2285,
2305,
2324,
2346,
2347,
2559,
2560,
2776,
2777,
2926,
2927,
2936,
2937,
2942,
2943,
2951,
2952,
2973,
2974,
3000,
3001,
3004,
3005,
3013,
3014,
3020,
3021,
3029,
3030,
3035,
3036,
3045,
3046,
3057,
3058,
3069,
3070,
3080,
3081,
3094,
3095,
3109,
3110,
3121
],
"line_end_idx": [
117,
118,
133,
134,
161,
169,
170,
525,
526,
950,
951,
1017,
1018,
1042,
1043,
1117,
1118,
1570,
1571,
1887,
1888,
1987,
1988,
2005,
2006,
2200,
2201,
2232,
2285,
2305,
2324,
2346,
2347,
2559,
2560,
2776,
2777,
2926,
2927,
2936,
2937,
2942,
2943,
2951,
2952,
2973,
2974,
3000,
3001,
3004,
3005,
3013,
3014,
3020,
3021,
3029,
3030,
3035,
3036,
3045,
3046,
3057,
3058,
3069,
3070,
3080,
3081,
3094,
3095,
3109,
3110,
3121,
3143
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3143,
"ccnet_original_nlines": 72,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.351666659116745,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011666670441627502,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17166666686534882,
"rps_doc_frac_unique_words": 0.56611567735672,
"rps_doc_mean_word_length": 5.22520637512207,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.187142372131348,
"rps_doc_word_count": 484,
"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.005931199993938208,
"rps_doc_frac_chars_top_3gram": 0.009489919990301132,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -281.88555908203125,
"rps_doc_books_importance_length_correction": -281.88555908203125,
"rps_doc_openwebtext_importance": -179.15415954589844,
"rps_doc_openwebtext_importance_length_correction": -179.15415954589844,
"rps_doc_wikipedia_importance": -117.72343444824219,
"rps_doc_wikipedia_importance_length_correction": -117.72343444824219
},
"fasttext": {
"dclm": 0.03890914097428322,
"english": 0.898644208908081,
"fineweb_edu_approx": 1.5100374221801758,
"eai_general_math": 0.11829168349504471,
"eai_open_web_math": 0.10149133205413818,
"eai_web_code": 0.29660916328430176
}
}
|
{
"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.019",
"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": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,556,749,694,496,862,000 |
OpenSSL
Documents | openssl(1) | ssl(3) | crypto(3) | HOWTO | Wiki | FIPS140 | misc
Title
FAQ
About
News
Documents
Source
Contribution
Support
Related
BIO_push(3)
NAME
BIO_push, BIO_pop - add and remove BIOs from a chain.
SYNOPSIS
#include <openssl/bio.h>
BIO * BIO_push(BIO *b,BIO *append);
BIO * BIO_pop(BIO *b);
DESCRIPTION
The BIO_push() function appends the BIO append to b, it returns b.
BIO_pop() removes the BIO b from a chain and returns the next BIO in the chain, or NULL if there is no next BIO. The removed BIO then becomes a single BIO with no association with the original chain, it can thus be freed or attached to a different chain.
NOTES
The names of these functions are perhaps a little misleading. BIO_push() joins two BIO chains whereas BIO_pop() deletes a single BIO from a chain, the deleted BIO does not need to be at the end of a chain.
The process of calling BIO_push() and BIO_pop() on a BIO may have additional consequences (a control call is made to the affected BIOs) any effects will be noted in the descriptions of individual BIOs.
EXAMPLES
For these examples suppose md1 and md2 are digest BIOs, b64 is a base64 BIO and f is a file BIO.
If the call:
BIO_push(b64, f);
is made then the new chain will be b64-f. After making the calls
BIO_push(md2, b64);
BIO_push(md1, md2);
the new chain is md1-md2-b64-f. Data written to md1 will be digested by md1 and md2, base64 encoded and written to f.
It should be noted that reading causes data to pass in the reverse direction, that is data is read from f, base64 decoded and digested by md1 and md2. If the call:
BIO_pop(md2);
The call will return b64 and the new chain will be md1-b64-f data can be written to md1 as before.
RETURN VALUES
BIO_push() returns the end of the chain, b.
BIO_pop() returns the next BIO in the chain, or NULL if there is no next BIO.
SEE ALSO
TBA
|
{
"url": "http://www.openssl.org/docs/crypto/BIO_push.html",
"source_domain": "www.openssl.org",
"snapshot_id": "crawl=CC-MAIN-2014-42",
"warc_metadata": {
"Content-Length": "16111",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4Y25723O66VJAHFMAU6VW7RNBMWJW3XF",
"WARC-Concurrent-To": "<urn:uuid:984694e0-e34e-4496-9246-113fa1aba5e5>",
"WARC-Date": "2014-10-20T22:45:28Z",
"WARC-IP-Address": "185.9.166.106",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:2NE7BYBEVX7TJO2ZVXO5O22OAUD37K77",
"WARC-Record-ID": "<urn:uuid:087b462a-e35b-4803-abdb-bb0449566173>",
"WARC-Target-URI": "http://www.openssl.org/docs/crypto/BIO_push.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:376a5d42-3ca0-46f4-ab29-1cf27041f0ff>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-16-133-185.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-42\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for October 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,
12,
97,
99,
105,
109,
115,
120,
130,
137,
150,
158,
166,
167,
169,
170,
182,
183,
184,
185,
190,
191,
245,
246,
247,
256,
257,
283,
321,
346,
347,
348,
360,
361,
428,
429,
684,
685,
686,
692,
693,
899,
900,
1102,
1103,
1104,
1113,
1114,
1211,
1212,
1225,
1226,
1245,
1246,
1311,
1312,
1333,
1354,
1355,
1473,
1474,
1638,
1639,
1654,
1655,
1754,
1755,
1756,
1770,
1771,
1815,
1816,
1894,
1895,
1896,
1905,
1906,
1910,
1911,
1916,
1920
],
"line_end_idx": [
12,
97,
99,
105,
109,
115,
120,
130,
137,
150,
158,
166,
167,
169,
170,
182,
183,
184,
185,
190,
191,
245,
246,
247,
256,
257,
283,
321,
346,
347,
348,
360,
361,
428,
429,
684,
685,
686,
692,
693,
899,
900,
1102,
1103,
1104,
1113,
1114,
1211,
1212,
1225,
1226,
1245,
1246,
1311,
1312,
1333,
1354,
1355,
1473,
1474,
1638,
1639,
1654,
1655,
1754,
1755,
1756,
1770,
1771,
1815,
1816,
1894,
1895,
1896,
1905,
1906,
1910,
1911,
1916,
1920,
1921
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1921,
"ccnet_original_nlines": 80,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3528037369251251,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07943925261497498,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2102803736925125,
"rps_doc_frac_unique_words": 0.44891640543937683,
"rps_doc_mean_word_length": 4.331269264221191,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0.002336449921131134,
"rps_doc_unigram_entropy": 4.501175403594971,
"rps_doc_word_count": 323,
"rps_doc_frac_chars_dupe_10grams": 0.07290922105312347,
"rps_doc_frac_chars_dupe_5grams": 0.12437455356121063,
"rps_doc_frac_chars_dupe_6grams": 0.07290922105312347,
"rps_doc_frac_chars_dupe_7grams": 0.07290922105312347,
"rps_doc_frac_chars_dupe_8grams": 0.07290922105312347,
"rps_doc_frac_chars_dupe_9grams": 0.07290922105312347,
"rps_doc_frac_chars_top_2gram": 0.017155110836029053,
"rps_doc_frac_chars_top_3gram": 0.021443890407681465,
"rps_doc_frac_chars_top_4gram": 0.024303069338202477,
"rps_doc_books_importance": -224.22996520996094,
"rps_doc_books_importance_length_correction": -224.22996520996094,
"rps_doc_openwebtext_importance": -105.81175231933594,
"rps_doc_openwebtext_importance_length_correction": -105.81175231933594,
"rps_doc_wikipedia_importance": -80.02867126464844,
"rps_doc_wikipedia_importance_length_correction": -80.02867126464844
},
"fasttext": {
"dclm": 0.03532576933503151,
"english": 0.8037306070327759,
"fineweb_edu_approx": 2.022214412689209,
"eai_general_math": 0.23332875967025757,
"eai_open_web_math": 0.44672805070877075,
"eai_web_code": 0.010224279947578907
}
}
|
{
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
422,964,057,867,498,240 |
Docs
Introduction
Measure what matters.
Statsy is the easy way to measure your website traffic, performance, and carbon footprint.
Introduction to Statsy
Statsy is a cutting-edge web analytics tool designed to help you gain valuable insights into your users' behavior and optimize their experience on your website. Our primary focus is to provide you with actionable data while prioritizing user privacy.
We take privacy seriously. Statsy does not collect any private information about your users, and we strictly adhere to GDPR and other privacy laws. To ensure compliance, we do not use cookies or any other tracking technologies that may compromise the privacy of your users.
In these docs, you'll discover the powerful features Statsy offers and learn how to make the most of your web analytics while maintaining a privacy-conscious approach.
Quickstart
Kick off your Statsy experience by diving into our Get Started guide, which walks you through the initial steps of setting up and configuring your account. Learn how to create a site, install tracking scripts, and navigate the dashboard to start analyzing your website's data.
Features
Learn more about the core features of Statsy:
Support and Community
If you have any questions or need help, feel free to reach out to us at
|
{
"url": "https://statsy.com/docs",
"source_domain": "statsy.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "74993",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KNXO2IBYNCJMGZN2JDU6QLBDQCB5SH5F",
"WARC-Concurrent-To": "<urn:uuid:00cb01b8-8d05-4fb3-8d5d-48e0a1ba7157>",
"WARC-Date": "2024-03-02T01:04:02Z",
"WARC-IP-Address": "76.76.21.241",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AXMYEXVOT5I2L2CGXMFXMKDUC32GORMD",
"WARC-Record-ID": "<urn:uuid:8d0a7115-ebc9-4c17-a617-47065bb1f4f3>",
"WARC-Target-URI": "https://statsy.com/docs",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:98e3dd53-5166-4f43-ae3f-56941704499b>"
},
"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-229\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,
5,
18,
19,
41,
42,
133,
134,
157,
158,
409,
410,
684,
685,
853,
854,
865,
866,
1143,
1144,
1153,
1154,
1200,
1201,
1223,
1224
],
"line_end_idx": [
5,
18,
19,
41,
42,
133,
134,
157,
158,
409,
410,
684,
685,
853,
854,
865,
866,
1143,
1144,
1153,
1154,
1200,
1201,
1223,
1224,
1295
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1295,
"ccnet_original_nlines": 25,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4127659499645233,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004255319945514202,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10638298094272614,
"rps_doc_frac_unique_words": 0.6213592290878296,
"rps_doc_mean_word_length": 5.111650466918945,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.5769548416137695,
"rps_doc_word_count": 206,
"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.025641029700636864,
"rps_doc_frac_chars_top_3gram": 0.018993349745869637,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -67.53424835205078,
"rps_doc_books_importance_length_correction": -67.53424835205078,
"rps_doc_openwebtext_importance": -49.318233489990234,
"rps_doc_openwebtext_importance_length_correction": -49.318233489990234,
"rps_doc_wikipedia_importance": -44.07976531982422,
"rps_doc_wikipedia_importance_length_correction": -44.07976150512695
},
"fasttext": {
"dclm": 0.12312495708465576,
"english": 0.9037299752235413,
"fineweb_edu_approx": 1.3160032033920288,
"eai_general_math": 0.0006794899818487465,
"eai_open_web_math": 0.01276928000152111,
"eai_web_code": 0.10985773801803589
}
}
|
{
"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": "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": "-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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,771,109,583,444,053,500 |
YMANativeAdLoaderConfiguration Class Reference
Inherits from NSObject
Declared in YMANativeAdLoaderConfiguration.h
Overview
This class is responsible for configuring native ad loading.
1. blockID
2. imageSizes
3. shouldLoadImagesAutomatically
4. – initWithBlockID:loadImagesAutomatically:
5. – initWithBlockID:imageSizes:loadImagesAutomatically:
blockID
The Block ID is a unique identifier in the R-M-XXXXXX-Y format, which is assigned in the Partner interface.
@property (nonatomic, copy, readonly) NSString *blockID
imageSizes
A set of preferred image sizes.
@property (nonatomic, copy, readonly) NSArray *imageSizes
shouldLoadImagesAutomatically
Flag for automatic image loading. Acceptable values: YES – Load automatically; NO – Load manually.
@property (nonatomic, assign, readonly) BOOL shouldLoadImagesAutomatically
Discussion
Warning: If the app simultaneously stores links to a large number of ads, we recommend using manual image loading.
– initWithBlockID:loadImagesAutomatically:
Initializes a new object of the YMANativeAdLoaderConfiguration class, i.e., configuration for loading native ads.
- (instancetype)initWithBlockID:(NSString *)blockID
loadImagesAutomatically:(BOOL)shouldLoadImagesAutomatically
Parameters
blockID
The Block ID is a unique identifier in the R-M-XXXXXX-Y format, which is assigned in the Partner interface.
shouldLoadImagesAutomatically
Flag for automatic image loading.
Return Value
An object of the YMANativeAdLoaderConfiguration class, i.e., configuration for loading native ads.
– initWithBlockID:imageSizes:loadImagesAutomatically:
Initializes a new object of the YMANativeAdLoaderConfiguration class, i.e., configuration for native ads.
- (instancetype)initWithBlockID:(NSString *)blockID
imageSizes:(NSArray *)imageSizes
loadImagesAutomatically:(BOOL)shouldLoadImagesAutomatically
Parameters
blockID
The Block ID is a unique identifier in the R-M-XXXXXX-Y format, which is assigned in the Partner interface.
imageSizes
A set of preferred image sizes.
shouldLoadImagesAutomatically
Flag for automatic image loading.
Return Value
Object of the YMANativeAdLoaderConfiguration class, i.e., configuration for native ads.
Generated by appledoc 2.2.1 (build 1334).
|
{
"url": "https://tech.yandex.com/mobile-ads/doc/ios/ref/Classes/YMANativeAdLoaderConfiguration-docpage/",
"source_domain": "tech.yandex.com",
"snapshot_id": "crawl=CC-MAIN-2020-16",
"warc_metadata": {
"Content-Length": "118948",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MBSF254ICMI4AJOV7AJAE4ELMSAR3PEY",
"WARC-Concurrent-To": "<urn:uuid:50d3753f-09ac-47e3-95d6-ef25ff18066d>",
"WARC-Date": "2020-03-31T07:33:54Z",
"WARC-IP-Address": "87.250.250.218",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:J3OVKNBS7EZWFU5JNXPKFHIKU5WTT6SL",
"WARC-Record-ID": "<urn:uuid:2bb471cf-e2b9-403f-86e3-deca2239635d>",
"WARC-Target-URI": "https://tech.yandex.com/mobile-ads/doc/ios/ref/Classes/YMANativeAdLoaderConfiguration-docpage/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cfef9353-84fa-42eb-ac17-699d21511041>"
},
"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-117.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,
47,
48,
71,
116,
117,
126,
127,
188,
189,
202,
218,
253,
301,
360,
361,
369,
370,
478,
479,
535,
536,
547,
548,
580,
581,
639,
640,
670,
671,
770,
771,
846,
847,
858,
859,
974,
975,
1018,
1019,
1133,
1134,
1186,
1254,
1255,
1266,
1267,
1275,
1276,
1384,
1385,
1415,
1416,
1450,
1451,
1464,
1465,
1564,
1565,
1619,
1620,
1726,
1727,
1779,
1833,
1901,
1902,
1913,
1914,
1922,
1923,
2031,
2032,
2043,
2044,
2076,
2077,
2107,
2108,
2142,
2143,
2156,
2157,
2245,
2246,
2247
],
"line_end_idx": [
47,
48,
71,
116,
117,
126,
127,
188,
189,
202,
218,
253,
301,
360,
361,
369,
370,
478,
479,
535,
536,
547,
548,
580,
581,
639,
640,
670,
671,
770,
771,
846,
847,
858,
859,
974,
975,
1018,
1019,
1133,
1134,
1186,
1254,
1255,
1266,
1267,
1275,
1276,
1384,
1385,
1415,
1416,
1450,
1451,
1464,
1465,
1564,
1565,
1619,
1620,
1726,
1727,
1779,
1833,
1901,
1902,
1913,
1914,
1922,
1923,
2031,
2032,
2043,
2044,
2076,
2077,
2107,
2108,
2142,
2143,
2156,
2157,
2245,
2246,
2247,
2288
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2288,
"ccnet_original_nlines": 85,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.176630437374115,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05978260934352875,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.301630437374115,
"rps_doc_frac_unique_words": 0.39834025502204895,
"rps_doc_mean_word_length": 7.680498123168945,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.2553629875183105,
"rps_doc_word_count": 241,
"rps_doc_frac_chars_dupe_10grams": 0.4019448757171631,
"rps_doc_frac_chars_dupe_5grams": 0.5440302491188049,
"rps_doc_frac_chars_dupe_6grams": 0.5440302491188049,
"rps_doc_frac_chars_dupe_7grams": 0.5132361054420471,
"rps_doc_frac_chars_dupe_8grams": 0.47541868686676025,
"rps_doc_frac_chars_dupe_9grams": 0.4019448757171631,
"rps_doc_frac_chars_top_2gram": 0.016207460314035416,
"rps_doc_frac_chars_top_3gram": 0.023770930245518684,
"rps_doc_frac_chars_top_4gram": 0.0886007621884346,
"rps_doc_books_importance": -140.50755310058594,
"rps_doc_books_importance_length_correction": -140.50755310058594,
"rps_doc_openwebtext_importance": -86.90747833251953,
"rps_doc_openwebtext_importance_length_correction": -86.90747833251953,
"rps_doc_wikipedia_importance": -62.5314826965332,
"rps_doc_wikipedia_importance_length_correction": -62.5314826965332
},
"fasttext": {
"dclm": 0.047294680029153824,
"english": 0.6654222011566162,
"fineweb_edu_approx": 1.9539759159088135,
"eai_general_math": 0.03251266106963158,
"eai_open_web_math": 0.2838127017021179,
"eai_web_code": 0.5750564336776733
}
}
|
{
"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.85",
"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": "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": "4",
"label": "Missing Images or Figures"
}
},
"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": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,084,398,278,906,084,000 |
Menu Close
Producto de Fibonaccis consecutivos
Los números de Fibonacci son los números F(n) de la siguiente sucesión
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, ...
que comienza con 0 y 1 y los siguientes términos son las sumas de los dos anteriores.
Un número x es el producto de dos números de Fibonacci consecutivos si existe un n tal que
F(n) * F(n+1) = x
y su prueba es (F(n),F(n+1),True). Por ejemplo, 714 es el producto de dos números de Fibonacci consecutivos ya que
F(8) = 21, F(9) = 34 y 714 = 21 * 34.
Su prueba es (21, 34, True).
Un número x no es el producto de dos números de Fibonacci consecutivos si no existe un n tal que
F(n) * F(n+1) = x
y su prueba es (F(m),F(m+1),False) donde m es el menor número tal que
F(m) * F(m+1) > x
Por ejemplo, 800 no es el producto de dos números de Fibonacci consecutivos, ya que
F(8) = 21, F(9) = 34, F(10) = 55 y 21 * 34 < 800 < 34 * 55.
Su prueba es (34, 55, False),
Definir la función
productoFib :: Integer -> (Integer, Integer, Bool)
tal que (productoFib x) es la prueba de que es, o no es, el producto de dos números de Fibonacci consecutivos. Por ejemplo,
productoFib 714 == (21, 34, True)
productoFib 800 == (34, 55, False)
productoFib 4895 == (55, 89, True)
productoFib 5895 == (89, 144, False)
Soluciones
-- 1ª solución
-- ===========
productoFib :: Integer -> (Integer, Integer, Bool)
productoFib n
| c == n = (a,b,True)
| otherwise = (a,b,False)
where (a,b,c) = head (dropWhile (\(x,y,z) -> z < n) productos)
-- fibs es la sucesión de números de Fibonacci. Por ejemplo,
-- take 14 fibs == [0,1,1,2,3,5,8,13,21,34,55,89,144,233]
fibs :: [Integer]
fibs = 0 : 1 : zipWith (+) fibs (tail fibs)
-- productos es la lista de las ternas (a,b,c) tales que a y b son dos
-- números de Fibonacci consecutivos y c es su producto. Por ejemplo,
-- λ> take 7 productos
-- [(0,1,0),(1,1,1),(1,2,2),(2,3,6),(3,5,15),(5,8,40),(8,13,104)]
productos :: [(Integer,Integer,Integer)]
productos = [(x,y,x*y) | (x,y) <- zip fibs (tail fibs)]
-- 2ª solución
-- ===========
productoFib2 :: Integer -> (Integer, Integer, Bool)
productoFib2 n = aux 0 1 n
where
aux a b c
| a * b >= c = (a, b, a * b == c)
| otherwise = aux b (a + b) c
-- 3ª solución
-- ===========
productoFib3 :: Integer -> (Integer, Integer, Bool)
productoFib3 x = aux 0 1
where
aux a b | a * b >= x = (a, b, x == a * b)
| otherwise = aux b (a + b)
-- Comparación de eficiencia
-- =========================
-- La comparación es
-- λ> let (x,_,_) = productoFib (10^20000) in length (show x)
-- 10000
-- (1.15 secs, 323,396,360 bytes)
-- λ> let (x,_,_) = productoFib2 (10^20000) in length (show x)
-- 10000
-- (1.10 secs, 317,268,672 bytes)
-- λ> let (x,_,_) = productoFib3 (10^20000) in length (show x)
-- 10000
-- (1.08 secs, 314,972,440 bytes)
Otras soluciones
• Se pueden escribir otras soluciones en los comentarios.
• El código se debe escribir entre una línea con <pre lang="haskell"> y otra con </pre>
Pensamiento
“El placer que obtenemos de la música proviene de contar, pero contando inconscientemente. La música no es más que aritmética inconsciente.”
Gottfried Wilhelm Leibniz.
5 soluciones de “Producto de Fibonaccis consecutivos
1. melgonaco
productoFib :: Integer -> (Integer,Integer,Bool)
productoFib x
| fib n * fib (n+1) == x = (fib n,fib (n+1),True)
| otherwise = (fib n,fib (n+1),False)
where n = head [y | y <- [0..], fib y * fib (y+1) >= x]
fibs :: [Integer]
fibs = 0 : 1 : zipWith (+) fibs (tail fibs)
fib :: Integer -> Integer
fib n = head [a | (a,m) <- zip fibs [0..n], m == n]
2. pedperpal
productoFib :: Integer -> (Integer, Integer, Bool)
productoFib x = aux 0 1
where
aux a b | a * b >= x = (a, b, x == a * b)
| otherwise = aux b (a + b)
• pedperpal
En Python
def productoFib(x):
a, b = 0, 1
while x > a * b:
a, b = b, a + b
return [a, b, x == a * b]
• pedperpal
En Julia
function productoFib(x)
a, b = BigInt(0), BigInt(1)
while BigInt(x) > a * b
a, b = b, a + b
end
(a, b, x == a * b ? true : false)
end
• pedperpal
En Maxima
productoFib(x) := block ([a:0, b:1],
while (x > a * b) do
[a, b] : [b, a + b],
[a, b, is(x = a * b)])$
Leave a Reply
Este sitio usa Akismet para reducir el spam. Aprende cómo se procesan los datos de tus comentarios.
|
{
"url": "https://www.glc.us.es/~jalonso/exercitium/producto-de-fibonaccis-consecutivos/",
"source_domain": "www.glc.us.es",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "118697",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6GBYXLOPE2LUAKYVWDP46JW5DMVQE4ES",
"WARC-Concurrent-To": "<urn:uuid:2f083a20-54ef-4f21-8363-e7f90bd0e716>",
"WARC-Date": "2021-12-01T06:52:10Z",
"WARC-IP-Address": "150.214.140.130",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:43WRCXB5FF2DBYWEWFDJB4N3RRL6RWFP",
"WARC-Record-ID": "<urn:uuid:d93f1282-e908-4ed2-96b0-256a0e5d2d05>",
"WARC-Target-URI": "https://www.glc.us.es/~jalonso/exercitium/producto-de-fibonaccis-consecutivos/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3c4fe3fb-267e-417d-a411-870355550ac3>"
},
"warc_info": "isPartOf: CC-MAIN-2021-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-160\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,
48,
49,
120,
121,
179,
180,
266,
267,
358,
359,
380,
381,
496,
497,
535,
536,
565,
566,
663,
664,
685,
686,
756,
757,
778,
779,
863,
864,
925,
926,
956,
957,
976,
977,
1031,
1032,
1156,
1157,
1196,
1236,
1275,
1315,
1316,
1327,
1328,
1343,
1358,
1360,
1411,
1425,
1452,
1480,
1546,
1548,
1609,
1672,
1690,
1734,
1736,
1807,
1877,
1903,
1972,
2013,
2070,
2072,
2087,
2102,
2104,
2156,
2183,
2191,
2205,
2247,
2286,
2288,
2303,
2318,
2320,
2372,
2397,
2405,
2451,
2492,
2494,
2523,
2552,
2554,
2575,
2640,
2652,
2689,
2755,
2767,
2804,
2870,
2882,
2919,
2920,
2937,
2938,
2998,
3088,
3089,
3101,
3102,
3243,
3244,
3271,
3272,
3325,
3326,
3341,
3394,
3412,
3468,
3525,
3587,
3593,
3615,
3663,
3669,
3699,
3755,
3770,
3825,
3853,
3865,
3915,
3960,
3976,
3977,
3993,
3994,
4020,
4042,
4069,
4099,
4135,
4153,
4154,
4171,
4172,
4204,
4244,
4280,
4312,
4328,
4374,
4386,
4406,
4407,
4427,
4428,
4475,
4508,
4543,
4579,
4580,
4594,
4595
],
"line_end_idx": [
11,
12,
48,
49,
120,
121,
179,
180,
266,
267,
358,
359,
380,
381,
496,
497,
535,
536,
565,
566,
663,
664,
685,
686,
756,
757,
778,
779,
863,
864,
925,
926,
956,
957,
976,
977,
1031,
1032,
1156,
1157,
1196,
1236,
1275,
1315,
1316,
1327,
1328,
1343,
1358,
1360,
1411,
1425,
1452,
1480,
1546,
1548,
1609,
1672,
1690,
1734,
1736,
1807,
1877,
1903,
1972,
2013,
2070,
2072,
2087,
2102,
2104,
2156,
2183,
2191,
2205,
2247,
2286,
2288,
2303,
2318,
2320,
2372,
2397,
2405,
2451,
2492,
2494,
2523,
2552,
2554,
2575,
2640,
2652,
2689,
2755,
2767,
2804,
2870,
2882,
2919,
2920,
2937,
2938,
2998,
3088,
3089,
3101,
3102,
3243,
3244,
3271,
3272,
3325,
3326,
3341,
3394,
3412,
3468,
3525,
3587,
3593,
3615,
3663,
3669,
3699,
3755,
3770,
3825,
3853,
3865,
3915,
3960,
3976,
3977,
3993,
3994,
4020,
4042,
4069,
4099,
4135,
4153,
4154,
4171,
4172,
4204,
4244,
4280,
4312,
4328,
4374,
4386,
4406,
4407,
4427,
4428,
4475,
4508,
4543,
4579,
4580,
4594,
4595,
4694
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4694,
"ccnet_original_nlines": 163,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.16950464248657227,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0123838996514678,
"rps_doc_frac_lines_end_with_ellipsis": 0.006097559817135334,
"rps_doc_frac_no_alph_words": 0.5278638005256653,
"rps_doc_frac_unique_words": 0.30745813250541687,
"rps_doc_mean_word_length": 4.112633228302002,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0.000773990002926439,
"rps_doc_unigram_entropy": 4.687736511230469,
"rps_doc_word_count": 657,
"rps_doc_frac_chars_dupe_10grams": 0.15470021963119507,
"rps_doc_frac_chars_dupe_5grams": 0.29792746901512146,
"rps_doc_frac_chars_dupe_6grams": 0.2490747570991516,
"rps_doc_frac_chars_dupe_7grams": 0.1865285038948059,
"rps_doc_frac_chars_dupe_8grams": 0.18134714663028717,
"rps_doc_frac_chars_dupe_9grams": 0.18134714663028717,
"rps_doc_frac_chars_top_2gram": 0.023686159402132034,
"rps_doc_frac_chars_top_3gram": 0.013323459774255753,
"rps_doc_frac_chars_top_4gram": 0.04885270074009895,
"rps_doc_books_importance": -562.9285278320312,
"rps_doc_books_importance_length_correction": -562.9285278320312,
"rps_doc_openwebtext_importance": -294.183349609375,
"rps_doc_openwebtext_importance_length_correction": -294.183349609375,
"rps_doc_wikipedia_importance": -189.5079345703125,
"rps_doc_wikipedia_importance_length_correction": -189.5079345703125
},
"fasttext": {
"dclm": 0.7750649452209473,
"english": 0.05056210979819298,
"fineweb_edu_approx": 1.8018165826797485,
"eai_general_math": 0.2630940079689026,
"eai_open_web_math": 0.4102330803871155,
"eai_web_code": 0.5896021127700806
}
}
|
{
"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.7",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"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": "6",
"label": "Indeterminate"
}
},
"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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,249,613,722,077,908,500 |
Click or drag to resize
Bookmark Class
Represents the bookmark (pair of BookmarkStart and BookmarkEnd elements).
Inheritance Hierarchy
SystemObject
GemBox.DocumentBookmark
Namespace: GemBox.Document
Assembly: GemBox.Document (in GemBox.Document.dll) Version: 27.3.30.1007
Syntax
public sealed class Bookmark
The Bookmark type exposes the following members.
Properties
NameDescription
Public propertyEnd
Gets the BookmarkEnd element.
Public propertyName
Gets the bookmark name.
Public propertyStart
Gets the BookmarkStart element.
Top
Methods
NameDescription
Public methodGetContent
Gets the content of the current Bookmark.
Top
Remarks
A Bookmark object serves as a façade for BookmarkStart and BookmarkEnd elements.
Bookmark objects can be retrieved from DocumentModel.Bookmarks collection. DocumentModel.Bookmarks collection contains all bookmarks in the document. Use DocumentModel.Bookmarks collection to retrieve a Bookmark with a specified name, iterate over all bookmarks or remove a bookmark.
Bookmarks are usually used in a conjunction with Hyperlinks or Fields for navigating to a bookmarked part of the document or to render a page number (or some other information) of a bookmarked part of the document. For more information, see Bookmarks and Hyperlinks and Modify Bookmarks examples.
Examples
Following example shows how to insert a bookmarked content to a document, and later retrieve and delete it through DocumentModel.Bookmarks collection.
// Create a new empty document.
var doc = new DocumentModel();
// Insert a bookmarked text.
doc.Sections.Add(
new Section(doc,
new Paragraph(doc,
new BookmarkStart(doc, "MyBookmark"),
new Run(doc, "My bookmarked text"),
new BookmarkEnd(doc, "MyBookmark"))));
// Retrieve a bookmark.
var myBookmark = doc.Bookmarks["MyBookmark"];
// Delete a bookmark. Deletes BookmarkStart and BookmarkEnd elements. Content that was bookmarked will not be deleted!
doc.Bookmarks.Remove(myBookmark);
See Also
|
{
"url": "https://www.gemboxsoftware.com/document/help/html/T_GemBox_Document_Bookmark.htm",
"source_domain": "www.gemboxsoftware.com",
"snapshot_id": "crawl=CC-MAIN-2017-17",
"warc_metadata": {
"Content-Length": "17326",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CUZ5LFMBGMBQK6WKBBWWWY2DYDU53SM5",
"WARC-Concurrent-To": "<urn:uuid:d7cdf1f8-e72e-4670-999a-e6762d16c9d4>",
"WARC-Date": "2017-04-30T18:33:45Z",
"WARC-IP-Address": "137.117.248.178",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:N572ZASC6VCSQ5FGSDHYMM3VZUFTORRD",
"WARC-Record-ID": "<urn:uuid:4f50af65-0697-462c-b655-d76fb4d7a0c6>",
"WARC-Target-URI": "https://www.gemboxsoftware.com/document/help/html/T_GemBox_Document_Bookmark.htm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5398e5cc-c754-47f0-8de8-4d7f6859e990>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-145-167-34.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-17\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 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,
24,
39,
113,
135,
148,
174,
175,
203,
277,
284,
313,
314,
363,
364,
375,
393,
412,
442,
462,
486,
507,
539,
543,
551,
569,
593,
635,
639,
647,
648,
729,
730,
1014,
1015,
1312,
1313,
1322,
1323,
1474,
1475,
1507,
1538,
1539,
1568,
1586,
1608,
1636,
1687,
1736,
1787,
1788,
1789,
1813,
1859,
1860,
1979,
2013
],
"line_end_idx": [
24,
39,
113,
135,
148,
174,
175,
203,
277,
284,
313,
314,
363,
364,
375,
393,
412,
442,
462,
486,
507,
539,
543,
551,
569,
593,
635,
639,
647,
648,
729,
730,
1014,
1015,
1312,
1313,
1322,
1323,
1474,
1475,
1507,
1538,
1539,
1568,
1586,
1608,
1636,
1687,
1736,
1787,
1788,
1789,
1813,
1859,
1860,
1979,
2013,
2021
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2021,
"ccnet_original_nlines": 57,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2616279125213623,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0029069799929857254,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22965115308761597,
"rps_doc_frac_unique_words": 0.497959166765213,
"rps_doc_mean_word_length": 6.546938896179199,
"rps_doc_num_sentences": 37,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.441516399383545,
"rps_doc_word_count": 245,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03491272032260895,
"rps_doc_frac_chars_dupe_6grams": 0.03491272032260895,
"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.0280548594892025,
"rps_doc_frac_chars_top_3gram": 0.05049875006079674,
"rps_doc_frac_chars_top_4gram": 0.06546135246753693,
"rps_doc_books_importance": -97.0201416015625,
"rps_doc_books_importance_length_correction": -97.0201416015625,
"rps_doc_openwebtext_importance": -58.902992248535156,
"rps_doc_openwebtext_importance_length_correction": -58.902992248535156,
"rps_doc_wikipedia_importance": -21.959352493286133,
"rps_doc_wikipedia_importance_length_correction": -21.959352493286133
},
"fasttext": {
"dclm": 0.02379542961716652,
"english": 0.6249098777770996,
"fineweb_edu_approx": 2.3289294242858887,
"eai_general_math": 0.0208282507956028,
"eai_open_web_math": 0.4252995252609253,
"eai_web_code": 0.02457261085510254
}
}
|
{
"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": "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": "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": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,079,714,339,588,775,000 |
TechSpot
PS3 FAT32 to NTFSWIN
By Mamut0o1
Apr 3, 2013
Post New Reply
1. Good morning,
I have a 500GB that used to be in my PS3. From what I understand PS3 most have format the Drive in FAT32 that my windows is not able to read. I dont remember if I used a program to format the drive to fat32 or the ps3 system did it for me. The problem that I have is that I'd like to use this drive as an external drive but my WIN7 is not able to format the drive.
Is there a utility or a solution to format this drive so any PC can have access to the drive?
Any help is greatly appreciate it.
Thank You!
2. cliffordcooley
cliffordcooley TechSpot Paladin Posts: 6,399 +1,591
3. Mamut0o1
Mamut0o1 TS Rookie Topic Starter Posts: 79
I tried that yesterday and it did not work for me...anything else?
4. St1ckM4n
St1ckM4n TS Evangelist Posts: 3,479 +624
Those drives are SATA1 I believe, and would be pretty terrible to put into an external USB dock in my opinion.
5. SNGX1275
SNGX1275 TS Forces Special Posts: 12,690 +334
St1ckM4n - Maybe if you were putting it in a USB3 dock it would be terrible. But, even SATA 1 is going to be far faster than USB2.
cliffordcooley likes this.
6. St1ckM4n
St1ckM4n TS Evangelist Posts: 3,479 +624
This is true I suppose. It's just that USB3.0 is getting a lot more common now and the speed difference makes babies cry. In the end, it's up to OP's situation.!
7. SNGX1275
SNGX1275 TS Forces Special Posts: 12,690 +334
Yes, absolutely. I run pretty old hardware because I simply can't afford anything better. So I'm just on the lookout for us poor people. Soon, I hope to not be poor and once again grace the cpus and mobos forum.
Add New Comment
TechSpot Members
Login or sign up for free,
it takes about 30 seconds.
You may also...
Get complete access to the TechSpot community. Join thousands of technology enthusiasts that contribute and share knowledge in our forum. Get a private inbox, upload your own photo gallery and more.
|
{
"url": "http://www.techspot.com/community/topics/ps3-fat32-to-ntfswin.191214/",
"source_domain": "www.techspot.com",
"snapshot_id": "crawl=CC-MAIN-2014-52",
"warc_metadata": {
"Content-Length": "56173",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IKRAGGBBL6IVHOTGLIY7RDZHAAHGSMK5",
"WARC-Concurrent-To": "<urn:uuid:360cfef5-da29-43c9-8387-2234e0f102fe>",
"WARC-Date": "2014-12-19T10:53:52Z",
"WARC-IP-Address": "184.173.241.66",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:OSFBAX4IYYH722NWAGU6L364ZMXYY3JT",
"WARC-Record-ID": "<urn:uuid:b0e76f6c-442e-47a4-95bf-f5c8748d0cd8>",
"WARC-Target-URI": "http://www.techspot.com/community/topics/ps3-fat32-to-ntfswin.191214/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a09f17fd-2fff-4995-ba78-0f18ee4f3f0e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-231-17-201.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-52\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for December 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,
9,
10,
31,
32,
44,
56,
71,
90,
459,
557,
596,
597,
612,
618,
638,
639,
697,
698,
712,
713,
760,
761,
832,
838,
852,
853,
900,
901,
1016,
1022,
1036,
1037,
1089,
1090,
1225,
1231,
1262,
1276,
1277,
1324,
1325,
1491,
1497,
1511,
1512,
1564,
1565,
1781,
1787,
1788,
1789,
1805,
1806,
1823,
1850,
1877,
1893,
1894,
1895
],
"line_end_idx": [
9,
10,
31,
32,
44,
56,
71,
90,
459,
557,
596,
597,
612,
618,
638,
639,
697,
698,
712,
713,
760,
761,
832,
838,
852,
853,
900,
901,
1016,
1022,
1036,
1037,
1089,
1090,
1225,
1231,
1262,
1276,
1277,
1324,
1325,
1491,
1497,
1511,
1512,
1564,
1565,
1781,
1787,
1788,
1789,
1805,
1806,
1823,
1850,
1877,
1893,
1894,
1895,
2093
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2093,
"ccnet_original_nlines": 59,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3621867895126343,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08656036108732224,
"rps_doc_frac_lines_end_with_ellipsis": 0.01666666939854622,
"rps_doc_frac_no_alph_words": 0.2164009064435959,
"rps_doc_frac_unique_words": 0.5571030378341675,
"rps_doc_mean_word_length": 4.231197834014893,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0.004555809777230024,
"rps_doc_unigram_entropy": 4.9736409187316895,
"rps_doc_word_count": 359,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1105990782380104,
"rps_doc_frac_chars_dupe_6grams": 0.1105990782380104,
"rps_doc_frac_chars_dupe_7grams": 0.1105990782380104,
"rps_doc_frac_chars_dupe_8grams": 0.05793284997344017,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.021066490560770035,
"rps_doc_frac_chars_top_3gram": 0.0276497695595026,
"rps_doc_frac_chars_top_4gram": 0.014483209699392319,
"rps_doc_books_importance": -170.92721557617188,
"rps_doc_books_importance_length_correction": -170.92721557617188,
"rps_doc_openwebtext_importance": -106.10112762451172,
"rps_doc_openwebtext_importance_length_correction": -106.10112762451172,
"rps_doc_wikipedia_importance": -75.42680358886719,
"rps_doc_wikipedia_importance_length_correction": -75.42680358886719
},
"fasttext": {
"dclm": 0.15772271156311035,
"english": 0.931423544883728,
"fineweb_edu_approx": 1.0315548181533813,
"eai_general_math": 0.0043604401871562,
"eai_open_web_math": 0.17484945058822632,
"eai_web_code": 0.000027660000341711566
}
}
|
{
"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": "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": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,383,024,764,024,919,000 |
Reputation
804
Top tag
Next privilege 1,000 Rep.
See votes, expandable usercard
Badges
4 9
Newest
Yearling
Impact
~228k people reached
• 0 posts edited
• 2 helpful flags
• 7 votes cast
Aug
19
comment How do I find and kill a php loop (process)?
What you need to do to stop PHP depends on how your environment is set up. Since killing apache didn't help, I'd assume it's not running mod_php (which embed PHP's interpreter inside Apache). The other two popular options are php-fpm and php-cgi, so you may want to use ps ax | grep php- to find out which one is running and where. Incidentally, these may have start/stop scripts in init.d (php5-fpm for the former)
Jul
5
comment Syberia not running under Windows 7
Unfortunately, I never had much luck getting it to work and had to resort to buying the game again from Good Old Games (link omitted so it doesn't look like advertising). I think Steam may also sell Syberia and Syberia 2.
Apr
28
comment Expanding memory on an Aspire T180-OA7Z computer
DDR11? Wow, and here I thought DDR3 was the newest.
Mar
17
comment What technical reason did Microsoft give for no Internet Explorer 9 on Windows XP?
@BobbyAlexander: Or Vista, but IE9 is on Vista anyway.
Mar
16
comment Why does Internet Explorer 9 need to close (these) other programs during install and are any changes made to Firefox?
"if they have to why not update/replace files on reboot, and do i quietly." This is how Windows Update usually works, but IE tries to do it without a reboot.
Sep
2
comment Is buying a low powered graphics card with a larger amount of memory worth it?
A few months ago, I saw one brand that had 512MB GDDR5 cards and 1GB DDR3 cards for the same price. I bought the 512MB GDDR5 card.
Aug
26
comment Enhance Video Card
@Mario: Virtualization is used to simulate machines or components less powerful than the one that is doing the virtualization. GPUs in particular are optimized for doing parallel operations. The 9400M has 16 processors... 8 times the number your CPU does.
Aug
11
comment Install-free app to get mobo model + Windows version?
You could also write it to %USERPROFILE%\Desktop\Sysinfo.txt
Jul
16
comment Is it possible to determine which version of windows XP goes with a licence key?
MSDNAA is almost certainly Windows XP Professional.
Nov
25
comment How to fix Windows 7 jumpy display?
For future reference, My Computer (or is it just Computer in 7?) is on the Start Menu by default in Vista/7.
Oct
26
comment Copy and Paste from Virtual PC has stopped working
Sorry, forgot to mention that the host machine was Windows XP.
Oct
26
comment Copy and Paste from Virtual PC has stopped working
I've encountered a similar problem in VPC2007 with a Windows Server 2003 R2 install... it would only sometimes copy things from the VM clipboard to the host clipboard. This was after the Virtual Machine Additions were installed.
Oct
13
comment Now who's using my COM port?
I don't think you can. It only needs one more vote before it gets moved, though.
Oct
6
comment From Vista to XP and Ubuntu installation issue
I know this question is already solved, but was this a stock XP CD, or one with the service packs applied? Prior to XP SP1, there was an issue in XP where it didn't recognize HDDs larger than 137GB.
Oct
5
comment Can I upgrade Vista Systembuilder editions to Windows 7?
Windows X for System Builders (where X is the Windows version, such as XP Home) is the name MS has used for OEM copies for some time now.
Oct
2
comment 4 GB of RAM installed but only 2.97 GB usable. What gives?
I'm going to make the wild guess that BFree has a 1GB video card or two 512MB video cards.
Sep
30
comment Remote Desktop Manager for Windows XP
This is off topic, but I'm not surprised that a product that is almost an anagram of royalties to require payment. ;)
Sep
30
comment FAT32 External HDD formated with Mac OS not mountable on a Windows machine
Which version of Windows was this? I know there are issues before XP SP1 with drives over a specific size, regardless of which partition type it is.
Sep
28
comment Windows 7 Ultimate 32 bit to 64 bit
NFR? Not For Release, or does it stand for something else?
Sep
28
comment How to upgrade Windows 7 to Windows 7 Ultimate? Also what is the difference between OEM and Retail.
@Guard: Three's now a discount program for students at win741.com to get Home Premium or Professional for $30.
|
{
"url": "http://superuser.com/users/9255/powerlord?tab=activity&sort=comments",
"source_domain": "superuser.com",
"snapshot_id": "crawl=CC-MAIN-2016-18",
"warc_metadata": {
"Content-Length": "60001",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5N3BMFIJMHAQH7GRVPYBC3Y36OVLPZA7",
"WARC-Concurrent-To": "<urn:uuid:52c28e8d-e4a1-4c4c-9bec-5823982a6fa9>",
"WARC-Date": "2016-05-03T03:09:43Z",
"WARC-IP-Address": "104.16.127.192",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:K7IYBWAIB7MGUO4XQ4R722HTAHBA4QLT",
"WARC-Record-ID": "<urn:uuid:c272d994-c804-45c9-be57-805997e90b86>",
"WARC-Target-URI": "http://superuser.com/users/9255/powerlord?tab=activity&sort=comments",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8947bbbf-dde9-42a0-840f-b0a38e9361e2>"
},
"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,
11,
15,
23,
49,
80,
87,
91,
98,
108,
115,
136,
137,
156,
176,
193,
197,
200,
253,
669,
673,
675,
719,
941,
945,
948,
1005,
1057,
1061,
1064,
1155,
1210,
1214,
1217,
1343,
1501,
1505,
1507,
1594,
1725,
1729,
1732,
1759,
2015,
2019,
2022,
2084,
2145,
2149,
2152,
2241,
2293,
2297,
2300,
2344,
2453,
2457,
2460,
2519,
2582,
2586,
2589,
2648,
2877,
2881,
2884,
2921,
3002,
3006,
3008,
3063,
3262,
3266,
3268,
3333,
3471,
3475,
3477,
3544,
3635,
3639,
3642,
3688,
3806,
3810,
3813,
3896,
4045,
4049,
4052,
4096,
4155,
4159,
4162,
4270
],
"line_end_idx": [
11,
15,
23,
49,
80,
87,
91,
98,
108,
115,
136,
137,
156,
176,
193,
197,
200,
253,
669,
673,
675,
719,
941,
945,
948,
1005,
1057,
1061,
1064,
1155,
1210,
1214,
1217,
1343,
1501,
1505,
1507,
1594,
1725,
1729,
1732,
1759,
2015,
2019,
2022,
2084,
2145,
2149,
2152,
2241,
2293,
2297,
2300,
2344,
2453,
2457,
2460,
2519,
2582,
2586,
2589,
2648,
2877,
2881,
2884,
2921,
3002,
3006,
3008,
3063,
3262,
3266,
3268,
3333,
3471,
3475,
3477,
3544,
3635,
3639,
3642,
3688,
3806,
3810,
3813,
3896,
4045,
4049,
4052,
4096,
4155,
4159,
4162,
4270,
4380
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4380,
"ccnet_original_nlines": 94,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3529411852359772,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.072727270424366,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1828877031803131,
"rps_doc_frac_unique_words": 0.5114213228225708,
"rps_doc_mean_word_length": 4.378172397613525,
"rps_doc_num_sentences": 53,
"rps_doc_symbol_to_word_ratio": 0.0021390400361269712,
"rps_doc_unigram_entropy": 5.5342278480529785,
"rps_doc_word_count": 788,
"rps_doc_frac_chars_dupe_10grams": 0.03130434826016426,
"rps_doc_frac_chars_dupe_5grams": 0.03130434826016426,
"rps_doc_frac_chars_dupe_6grams": 0.03130434826016426,
"rps_doc_frac_chars_dupe_7grams": 0.03130434826016426,
"rps_doc_frac_chars_dupe_8grams": 0.03130434826016426,
"rps_doc_frac_chars_dupe_9grams": 0.03130434826016426,
"rps_doc_frac_chars_top_2gram": 0.013913040049374104,
"rps_doc_frac_chars_top_3gram": 0.009855070151388645,
"rps_doc_frac_chars_top_4gram": 0.012173909693956375,
"rps_doc_books_importance": -342.2715759277344,
"rps_doc_books_importance_length_correction": -342.2715759277344,
"rps_doc_openwebtext_importance": -235.951171875,
"rps_doc_openwebtext_importance_length_correction": -235.951171875,
"rps_doc_wikipedia_importance": -181.7940673828125,
"rps_doc_wikipedia_importance_length_correction": -181.7940673828125
},
"fasttext": {
"dclm": 0.03767526149749756,
"english": 0.9431062340736389,
"fineweb_edu_approx": 1.2360213994979858,
"eai_general_math": 0.30623728036880493,
"eai_open_web_math": 0.30461543798446655,
"eai_web_code": 0.040211621671915054
}
}
|
{
"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": "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": "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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,352,698,505,209,223,000 |
Microsoft Outlook - Internet Security Warning - The target principal name is incorrect
Discussion in 'Microsoft Outlook' started by popowich, May 17, 2015.
1. popowich
popowich EQ Forum Admin Staff Member
Joined:
Aug 12, 2008
Messages:
8,964
Likes Received:
118
Did you get the following error message from Microsoft Outlook?
Internet Security Warning - The server you are connected to is using a security certificate that cannot be verified
Microsoft Outlook Internet Security Warning.jpg
The most common reason for "The target principle name is incorrect" is due to the way many ISP's and hosting companies branded the email settings for their customers. Often in the past email services would create in DNS and then tell customers to use names such as imap pop3 and mail.customerDomain.com instead of imap pop3 or mail.ISP.com. As these customers update their settings to use SSL enabled ports switching pop3 from 110 to 995 and imap from 143 to 993 they're getting an error because the name on the certificate is the email service providers name and not their own. The fix is for these customers to use to the email services email settings such as mail.ISP.com instead of the branded settings using the names from within their own domain name.
It's also possible the error was caused by the email service provider updating to a new company name on the same IP address instead of using a new IP address for the new server names.
Want to reply or ask your own question?
It only takes a minute to sign up (and it's free!). Click the orange sign up button to choose a username and then you can ask your own questions on the forum.
Loading...
|
{
"url": "http://www.emailquestions.com/threads/microsoft-outlook-internet-security-warning-the-target-principal-name-is-incorrect.10827/",
"source_domain": "www.emailquestions.com",
"snapshot_id": "crawl=CC-MAIN-2016-44",
"warc_metadata": {
"Content-Length": "41745",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RMY5NPHTFKIQNQ6ZTS5RECTTRIH5DIDZ",
"WARC-Concurrent-To": "<urn:uuid:6c1506e1-f7da-4d4f-9e26-dc7824bec0fc>",
"WARC-Date": "2016-10-24T21:53:43Z",
"WARC-IP-Address": "52.202.217.244",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:QYACLGJIGYKKNQSBPKTLSFIYUNBSOTUR",
"WARC-Record-ID": "<urn:uuid:18d4f10c-5296-4cb5-8727-cfbfa98c59d2>",
"WARC-Target-URI": "http://www.emailquestions.com/threads/microsoft-outlook-internet-security-warning-the-target-principal-name-is-incorrect.10827/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f8ec4db1-ecb4-438c-a27c-8c93b7b27437>"
},
"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,
87,
88,
157,
158,
172,
173,
214,
215,
227,
244,
258,
268,
288,
296,
364,
365,
485,
486,
538,
539,
1301,
1302,
1490,
1496,
1497,
1498,
1538,
1539,
1698
],
"line_end_idx": [
87,
88,
157,
158,
172,
173,
214,
215,
227,
244,
258,
268,
288,
296,
364,
365,
485,
486,
538,
539,
1301,
1302,
1490,
1496,
1497,
1498,
1538,
1539,
1698,
1708
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1708,
"ccnet_original_nlines": 29,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4298780560493469,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024390239268541336,
"rps_doc_frac_lines_end_with_ellipsis": 0.03333333134651184,
"rps_doc_frac_no_alph_words": 0.15243901312351227,
"rps_doc_frac_unique_words": 0.5143885016441345,
"rps_doc_mean_word_length": 4.744604110717773,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0.003048779908567667,
"rps_doc_unigram_entropy": 4.629359722137451,
"rps_doc_word_count": 278,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0636846125125885,
"rps_doc_frac_chars_dupe_6grams": 0.0636846125125885,
"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.04852161183953285,
"rps_doc_frac_chars_top_3gram": 0.05458680912852287,
"rps_doc_frac_chars_top_4gram": 0.07278241217136383,
"rps_doc_books_importance": -152.90554809570312,
"rps_doc_books_importance_length_correction": -141.23028564453125,
"rps_doc_openwebtext_importance": -93.60130310058594,
"rps_doc_openwebtext_importance_length_correction": -93.60130310058594,
"rps_doc_wikipedia_importance": -65.29317474365234,
"rps_doc_wikipedia_importance_length_correction": -56.68850326538086
},
"fasttext": {
"dclm": 0.023135239258408546,
"english": 0.912020206451416,
"fineweb_edu_approx": 1.8667410612106323,
"eai_general_math": 0.005690569989383221,
"eai_open_web_math": 0.0492779016494751,
"eai_web_code": 0.00200617010705173
}
}
|
{
"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.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": "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": "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": "21",
"label": "Customer Support"
}
},
"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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,393,307,579,976,769,500 |
9. Find your Messages
Learn how to enable and find Messages in your app.
In the previous chapter
You learned how to find the Forms containing your guided questions for qualifying leads.
In this chapter
We will show you what Messages are, where they are located and how you subscribe to topics with Tags. Messages are notifications that will appear on your screen like other app notifications. Often, they are sent to you by a colleague in marketing to notify you e.g. about a new campaign or content update. They can contain links, and if they do you will be sent to a selected page in a publication when you click on the Message. You can see old Messages in your app, and you can choose to subscribe to specific topics in the app. These topics are called Tags. As a starting point, we recommend having all Tags turned on.
What to do
Log in to your Napp app and watch the video below to see where Messages and Tags are.
What is next now that you have finished the onboarding guide?
Hopefully, you feel well-informed and ready to start working with Napp in your everyday. If not, then you can always re-read this guide or some of the chapters in it. We have also put some additional step-by-step guides to Napp features here in our Help Center that might be helpful if you get stuck. Moreover, you are always welcome to text us in the chat in the lower right corner of the screen if you have a question.
Other than that, we are excited to kickstart your sales enablement journey towards boosted productivity and increased sales.
Go back to the chapter overview.
Can't find the answers you need? Tell us about it
|
{
"url": "https://napp.dk/en/help-center/9-find-your-messages",
"source_domain": "napp.dk",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "35003",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XXEMAP4MKNNWV76FGFOSHUNHFTZEBXWY",
"WARC-Concurrent-To": "<urn:uuid:1a52fcad-3940-4b7f-9bd5-675545e78ae8>",
"WARC-Date": "2021-03-08T08:44:28Z",
"WARC-IP-Address": "172.104.230.156",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JNP2KDPL3F5DVAOPJ4OKSWOU5QBCYL6C",
"WARC-Record-ID": "<urn:uuid:2f920ac4-5ec8-4381-b638-bb413bcdaeda>",
"WARC-Target-URI": "https://napp.dk/en/help-center/9-find-your-messages",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:af4367ac-acdc-405d-9cb9-1bdc51a35206>"
},
"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-147.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,
22,
23,
74,
75,
99,
188,
189,
190,
206,
827,
828,
839,
925,
926,
927,
989,
1410,
1411,
1536,
1537,
1570,
1571
],
"line_end_idx": [
22,
23,
74,
75,
99,
188,
189,
190,
206,
827,
828,
839,
925,
926,
927,
989,
1410,
1411,
1536,
1537,
1570,
1571,
1620
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1620,
"ccnet_original_nlines": 22,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.5194029808044434,
"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.10746268928050995,
"rps_doc_frac_unique_words": 0.5068027377128601,
"rps_doc_mean_word_length": 4.360544204711914,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.580689430236816,
"rps_doc_word_count": 294,
"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.015600619837641716,
"rps_doc_frac_chars_top_3gram": 0.02184087038040161,
"rps_doc_frac_chars_top_4gram": 0.02652106061577797,
"rps_doc_books_importance": -170.8568572998047,
"rps_doc_books_importance_length_correction": -157.05677795410156,
"rps_doc_openwebtext_importance": -84.4281997680664,
"rps_doc_openwebtext_importance_length_correction": -84.4281997680664,
"rps_doc_wikipedia_importance": -66.38754272460938,
"rps_doc_wikipedia_importance_length_correction": -53.12276840209961
},
"fasttext": {
"dclm": 0.022801760584115982,
"english": 0.9535562992095947,
"fineweb_edu_approx": 1.3149566650390625,
"eai_general_math": 0.1354084014892578,
"eai_open_web_math": 0.09890735149383545,
"eai_web_code": 0.03647720813751221
}
}
|
{
"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.401",
"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": "-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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,173,359,701,251,173,000 |
Monday
December 22, 2014
Homework Help: math
Posted by elijah on Tuesday, October 16, 2012 at 7:04pm.
6 thousand 38 hundreds =
Answer this Question
First Name:
School Subject:
Answer:
Related Questions
math - My son is working with grid paper, the question asks: tell if each is ...
math - when you do the subtraction 4126-2487, you regroup 1 thousand to 10 ...
math - When you do the subtraction shown on the right 4,126 - 2,487, you regroup...
math - my thousand digit is half my ones digit.my houndreds digit is odd and ...
math - I have 1 thousand, 12 tens, 2 hundreds, and 2 ones. What number am I?
math - round 7,596,459,456 hundreds thousand
math - round 7,596,459,456 to the place named ten thousands millions hundreds ...
math - A) Use numerals to write a ten digit number using the following ...
math - to estimate how many more people live in Atherton than Needles, which is ...
4th Grade Math - I have an 8 in the ten thousands place, My hundreds digit is ...
Search
Members
|
{
"url": "http://www.jiskha.com/display.cgi?id=1350428669",
"source_domain": "www.jiskha.com",
"snapshot_id": "crawl=CC-MAIN-2014-52",
"warc_metadata": {
"Content-Length": "7700",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AJ6XEU5NOU3AV3N4G6W3HKTKWPB7I5DC",
"WARC-Concurrent-To": "<urn:uuid:56782d10-fd24-493a-b275-da4de1240095>",
"WARC-Date": "2014-12-22T21:33:52Z",
"WARC-IP-Address": "69.16.226.94",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:RBOTO6MKPJUMBDOVORF3OPV4XCWYVAVS",
"WARC-Record-ID": "<urn:uuid:ffd6715e-90cf-4233-bd78-9b6770e9cf25>",
"WARC-Target-URI": "http://www.jiskha.com/display.cgi?id=1350428669",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4b72db29-8dc3-4e70-b175-4fef2abd4edc>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-231-17-201.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-52\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for December 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,
7,
25,
26,
46,
47,
104,
105,
130,
131,
152,
153,
165,
181,
189,
190,
208,
209,
290,
369,
453,
534,
611,
656,
738,
813,
897,
979,
980,
987
],
"line_end_idx": [
7,
25,
26,
46,
47,
104,
105,
130,
131,
152,
153,
165,
181,
189,
190,
208,
209,
290,
369,
453,
534,
611,
656,
738,
813,
897,
979,
980,
987,
994
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 994,
"ccnet_original_nlines": 29,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24336282908916473,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017699120566248894,
"rps_doc_frac_lines_end_with_ellipsis": 0.2666666805744171,
"rps_doc_frac_no_alph_words": 0.3495575189590454,
"rps_doc_frac_unique_words": 0.6097561120986938,
"rps_doc_mean_word_length": 4.493902206420898,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0.03539822995662689,
"rps_doc_unigram_entropy": 4.356237411499023,
"rps_doc_word_count": 164,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07327000796794891,
"rps_doc_frac_chars_dupe_6grams": 0.07327000796794891,
"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.028493890538811684,
"rps_doc_frac_chars_top_3gram": 0.029850749298930168,
"rps_doc_frac_chars_top_4gram": 0.03527814894914627,
"rps_doc_books_importance": -90.76236724853516,
"rps_doc_books_importance_length_correction": -90.76236724853516,
"rps_doc_openwebtext_importance": -71.3730239868164,
"rps_doc_openwebtext_importance_length_correction": -57.325992584228516,
"rps_doc_wikipedia_importance": -52.081180572509766,
"rps_doc_wikipedia_importance_length_correction": -52.081180572509766
},
"fasttext": {
"dclm": 0.08071911334991455,
"english": 0.8518294095993042,
"fineweb_edu_approx": 3.0800671577453613,
"eai_general_math": 0.033314939588308334,
"eai_open_web_math": 0.33648473024368286,
"eai_web_code": 0.00012635999883059412
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
},
"secondary": {
"code": "372.7",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Elementary and Kindergarten"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"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": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "1",
"label": "Truncated Snippets"
}
},
"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": "1",
"label": "No 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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,597,302,443,453,451,000 |
Understanding And Using Unicode
Computer engineer [Marco Cilloni] realized a lot of developers today still have trouble dealing with Unicode in their programs, especially in the C/C++ world. He wrote an excellent guide that summarizes many of the issues surrounding Unicode and its encoding called “Unicode is harder than you think“. He first presents a brief history of Unicode and how it came about, so you can understand the reasons for the frustrating edge cases you’re bound to encounter.
There have been a variety of Unicode encoding methods over the years, but modern programs dealing with strings will probably be using UTF-8 encoding — and you should too. This multibyte encoding scheme has the convenient property of not changing the original character values when dealing with 7-bit ASCII text. We were surprised to read that there is actually an EBCDIC version of UTF still officially on the books today:
UTF-EBCDIC, a variable-width encoding that uses 1-byte characters designed for IBM’s EBCDIC systems (note: I think it’s safe to argue that using EBCDIC in 2023 edges very close to being a felony)
Continue reading “Understanding And Using Unicode”
Laptop keyboard with strange characters on the keys
But Think Of The (World Wide) Users!
History is full of stories about technology that makes sense to the designer but doesn’t really fit the needs of the users. Take cake mixes. In 1929, a man named Duff realized that he could capitalize on surplus flour and molasses and created a cake mix. You simply added water to the dry mix and baked it to create a delicious cake. After World War II General Mills and Pillsbury also wanted to sell more flour so they started making cakes. But sales leveled out. A psychologist who was a pioneer in focus groups named Dichter had the answer: bakers didn’t feel like they were contributing to the creation of the cake. To get more emotional investment, the cake mixes would need to have real eggs added in. Actually, Duff had noticed the same thing in his 1933 patent.
It is easy to imagine a bunch of food… scientists? Engineers? Designers?… whatever a person inventing flour mixes in the 1930s was called… sitting around thinking that making a mix that only requires water is a great thing. But the bakers didn’t like it. How often do we fail to account for users?
From Cake Mix to Tech
Apple has made a business of this. Most of us don’t mind things like arcane commands and control key combinations, but the wider pool of global computer users don’t like those things. As the world continues to virtually shrink, we often find our users are people from different lands and cultures who speak different languages. It is, after all, the world wide web. This requires us to think even harder about our users and their particular likes, dislikes, and customs.
Continue reading “But Think Of The (World Wide) Users!”
|
{
"url": "https://hackaday.com/tag/i18n/",
"source_domain": "hackaday.com",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "73081",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HYDNAYJUFCYY264COCJ3NBUHMUADXH4O",
"WARC-Concurrent-To": "<urn:uuid:be1e79c3-8234-4504-9a42-359f957551af>",
"WARC-Date": "2024-08-06T16:56:31Z",
"WARC-IP-Address": "192.0.66.96",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:C52AU5HRQ5GPVPLHO4UJYIPVUBT2HKKZ",
"WARC-Record-ID": "<urn:uuid:8ffc88a1-e934-4bad-976a-265c78da076f>",
"WARC-Target-URI": "https://hackaday.com/tag/i18n/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cd79adfb-e6d2-490a-93db-99eb24dd3d60>"
},
"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-252\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,
32,
33,
495,
496,
919,
920,
1116,
1117,
1168,
1169,
1221,
1222,
1259,
1260,
2030,
2031,
2329,
2330,
2352,
2353,
2824,
2825
],
"line_end_idx": [
32,
33,
495,
496,
919,
920,
1116,
1117,
1168,
1169,
1221,
1222,
1259,
1260,
2030,
2031,
2329,
2330,
2352,
2353,
2824,
2825,
2880
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2880,
"ccnet_original_nlines": 22,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38153308629989624,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024390239268541336,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1376306563615799,
"rps_doc_frac_unique_words": 0.5655737519264221,
"rps_doc_mean_word_length": 4.7602458000183105,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0.005226479843258858,
"rps_doc_unigram_entropy": 5.209050178527832,
"rps_doc_word_count": 488,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.016358159482479095,
"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.01076195016503334,
"rps_doc_frac_chars_top_3gram": 0.015497200191020966,
"rps_doc_frac_chars_top_4gram": 0.012914329767227173,
"rps_doc_books_importance": -275.15447998046875,
"rps_doc_books_importance_length_correction": -275.15447998046875,
"rps_doc_openwebtext_importance": -140.8590850830078,
"rps_doc_openwebtext_importance_length_correction": -140.8590850830078,
"rps_doc_wikipedia_importance": -94.4913330078125,
"rps_doc_wikipedia_importance_length_correction": -94.4913330078125
},
"fasttext": {
"dclm": 0.19296634197235107,
"english": 0.9569595456123352,
"fineweb_edu_approx": 2.3894619941711426,
"eai_general_math": 0.12764549255371094,
"eai_open_web_math": 0.19110417366027832,
"eai_web_code": 0.023673830553889275
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.422",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.019",
"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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,189,517,747,544,084,000 |
Uploaded avatar of PercyGrunwald
Concurrency and Parallelism in Elixir
@PercyGrunwald
Reputation194
Over 3 years ago
This is the second part of Percy Grunwald's series on Elixir. Don't miss out on the first article on Unicode matching in Elixir.
Exercises on Exercism are small, synthetic, and often seemingly trivial. It’s easy to imagine that experienced practitioners would have nothing to learn from them. However, solving these synthetic problems can push you to learn and apply parts of your language that you may not have explored. This new learning can lead you to solve real-world problems more efficiently or more expressively.
Parallel Letter Frequency is a medium difficulty exercise on Exercism's Elixir Track that unpacks a surprising number of interesting lessons. To solve this problem successfully your solution should execute in parallel in multiple worker processes. Achieving true parallelism in Elixir is surprisingly easy compared to other languages, but if you've never written concurrent code in Elixir, it may seem a little daunting. One of the things you'll discover in solving this exercise is how easy Elixir makes it to write code that can execute concurrently or in parallel. Applying these skills to your code can have a significant impact on the performance of your applications.
This exercise requires you to implement a function, Frequency.frequency/2, that determines the letter frequency in a list of strings. The calculation should be carried out in several worker processes, set by the workers argument:
iex> Frequency.frequency(["Freude", "schöner", "Götterfunken"], workers)
%{
"c" => 1,
"d" => 1,
"e" => 5,
...
"ö" => 2
}
In this post, we'll explore concurrency in Elixir by making a working sequential solution to this exercise concurrent. However, before we jump into the code, let's take a moment to examine what "concurrency" and "parallelism" actually mean, and how to achieve both in Elixir vs. other languages.
Concurrency and parallelism
Concurrency and parallelism are related terms but don't mean precisely the same thing. A concurrent program is one where multiple tasks can be "in progress," but at any single point in time, only one task is executing on the CPU (e.g., executing one task while another is waiting for IO such as reading or writing to the disk or a network). On the other hand, a parallel program is capable of executing multiple tasks at the same time on multiple CPU cores.
Both concurrent and parallel execution can give significant speed increases, but the amount of speedup possible -- if any -- is dependent on many factors. There are cases in which concurrency or parallelism are not even possible; it may be that the task you're trying to complete doesn't lend itself to either concurrent or parallel execution, or that the runtime doesn't support them. If your case does allow for concurrent or parallel execution, the amount of speedup possible is largely dependent on whether the task is IO- or CPU-bound, and whether there is more than 1 CPU core available.
Despite the number of contributing factors, there are a few "rules of thumb" for determining whether concurrency or parallelism is possible and how much speedup to expect. Firstly, concurrent execution is possible on a single CPU core, but parallel execution is not. Secondly, parallelism and concurrency should give significant speedup to IO-bound tasks, and the speedup should be nominally the same for both. Finally, CPU-bound tasks should have the same (or slower) performance when executed concurrently and generally speed increases are only possible when executed in parallel across multiple CPU cores.
The letter frequency calculation in this exercise is an example of a CPU-bound task, so according to rules of thumb above, a speed increase should only be possible by doing the calculation in parallel on multiple CPU cores.
Concurrency and parallelism in Elixir vs. other languages
Many popular languages give you tools to write concurrent code, but achieving parallelism is usually much more complex and full of trade-offs.
For example, concurrency is a first class citizen in JavaScript running on the Node.js runtime, and the default versions of IO-related functions are almost always "asynchronous" (i.e., concurrent). For example, fs.ReadFile is a concurrent function and the standard way to read the contents of a file. This is great but also has its downsides in the form of callback hell, or the need for Promises. Also, since Node doesn't schedule CPU time equally across tasks, it's still possible to block execution with a single CPU-intensive task. Parallelizing execution in Node is possible, but certainly not easy. Given that Node is single threaded, the only way to achieve parallelism is to manually fork worker processes with the cluster module or run multiple instances of your program and manually implement communication between them.
Python, unlike Node, is not concurrent by default but does give you multiple tools for writing concurrent and parallel code. However, each option has trade-offs and choosing one is not necessarily straightforward. You could use the threading module and deal with the fact that the global interpreter lock (GIL) limits execution to a single thread at a time, making parallelism impossible. The other option is Python's multiprocessing module, which bypasses the GIL limitation by spawning OS processes (as opposed to threads). Using multiprocessing makes parallelism possible but has the trade-off that OS processes are slower to spawn and use more memory than threads.
Writing concurrent and parallel code in Elixir is much simpler since Elixir is concurrent at the runtime level. Elixir's reputation for massive scalability comes from the fact that it runs on the BEAM virtual machine, which executes all code inside extremely lightweight "processes" that all run concurrently within the VM. BEAM processes have negligible cost to spawn and use minute amounts of memory compared to the OS-level threads and processes spawned by Python's concurrency modules. Also, in contrast to Node's event loop, the BEAM VM has schedulers that allocate available CPU time to all processes, which ensures that a single CPU-intensive task can't block other processes from executing.
Because of this architecture, going from executing processes concurrently to executing in parallel is just a matter of adding more CPU cores. In fact, for many years now BEAM automatically activates Symmetric Multiprocessing (SMP) capabilities on multi-core systems, which allows the VM's schedulers to allocate CPU time from all cores to the running processes. In Elixir, not only is concurrency a first class citizen, but there is no distinction between concurrent and parallel code. All you need to do is write concurrent code and the VM will automatically and by default parallelize it if there is more than 1 CPU core available.
Writing concurrent Elixir code with the Task module
As mentioned above, in Elixir, concurrency is achieved by distributing operations to multiple BEAM processes. You can very easily spawn processes with functions like Kernel.spawn_link/1, but you're much better off using the awesomely powerful abstractions provided by the Task module:
The most common use case for [Task] is to convert sequential code into concurrent code by computing a value asynchronously.
The Task module lets you write unbelievably clean concurrent code in Elixir -- no callback hell and no need for Promises.
For this exercise, Task.async_stream/3 is a great option:
async_stream(enumerable, function, options \\ [])
Task.async_stream/3 returns a stream that runs the given function concurrently on each item in enumerable. By default, the number of processes spawned (workers) is equal to the number of items in enumerable. This gives us a straightforward way to control the level of parallelism with the workers argument (assuming we have enough CPU cores). All we need to do is split the list of letters into the correct number of chunks and use Task.async_stream/3 to process each chunk in a separate worker.
Making the sequential letter frequency function concurrent
Let's start with a working sequential implementation from my solution:
def frequency(texts, _workers) do
texts
|> get_all_graphemes()
|> count_letters()
end
defp get_all_graphemes(texts) do
texts
|> Enum.join()
|> String.graphemes()
end
defp count_letters(graphemes) do
Enum.reduce(graphemes, %{}, fn grapheme, acc ->
if String.match?(grapheme, ~r/^\p{L}$/u) do
downcased_letter = String.downcase(grapheme)
Map.update(acc, downcased_letter, 1, fn count -> count + 1 end)
else
acc
end
end)
end
We can make the implementation above concurrent by doing the following:
1. Split up the list of graphemes returned by get_all_graphemes/1 into a number of chunks equal to the number of workers
2. Process each chunk with count_letters/1 in a worker by using Task.async_stream/3
3. Merge the results from each worker into a single result
Here's a diagram of the steps above:
Making the letter frequency computation concurrent
We only need to implement 2 new helper functions to enable the concurrent logic: one to split the graphemes into chunks (split_into_chunks/2) and one to merge the stream of results from the workers (merge_results/1). Here's one way to implement those helpers:
defp split_into_chunks(all_graphemes, num_chunks) do
all_graphemes_count = Enum.count(all_graphemes)
graphemes_per_chunk = :erlang.ceil(all_graphemes_count / num_chunks)
Enum.chunk_every(all_graphemes, graphemes_per_chunk)
end
defp merge_results_stream(results_stream) do
Enum.reduce(results_stream, %{}, fn {:ok, worker_result}, acc ->
Map.merge(acc, worker_result, fn _key, acc_val, worker_val ->
acc_val + worker_val
end)
end)
end
With those 2 functions implemented, all that's left to do to make the frequency/2 function run concurrently is to add calls to the new helper functions and replace the direct call to count_letters/1 with Task.async_stream/3:
def frequency(texts, workers) do
texts
|> get_all_graphemes()
|> split_into_chunks(workers)
|> Task.async_stream(&count_letters/1)
|> merge_results_stream()
end
The function above is a fully working concurrent implementation and passes all the tests. Despite being concurrent, the code reads exactly like regular sequential code, which demonstrates the power of the abstractions provided in Task.
Is the concurrent version actually parallel?
As I mentioned earlier in the post, there is no distinction between concurrent and parallel code in Elixir. If we set workers to a number greater than 1, and we have more than 1 CPU core available, the BEAM VM automatically parallelizes the execution of the spawned processes.
By default, BEAM starts a scheduler for each (logical) CPU core available. You can check the number of schedulers that BEAM has started with :erlang.system_info/1:
iex> :erlang.system_info(:schedulers_online)
8
This represents the maximum number of VM processes that can be executing at the same time. Setting workers to a number greater than the number of schedulers does not increase parallelism and may hurt performance.
Conclusion
Converting the code from sequential to concurrent turns out to be much easier than expected using Elixir's Task module. The concurrent code adds some extra complexity in the splitting of the list of graphemes and combining the worker results, but the end result is surprisingly clean.
Before solving this Exercism problem I had heard about Task, but never used it. After applying it in my solution, I would now consider it an indispensable part of my Elixir toolbox.
You could use this new tool in many ways to try to optimize performance in your applications. Most web applications are IO-bound and would, therefore, benefit from concurrency even if there is only a single CPU core available. One fairly reliable way to speed up a web application is to make HTTP requests concurrently:
def call_apis_async() do
["https://api.example.com/users/123", ...]
|> Task.async_stream(&HTTPoison.get/1)
|> Enum.into([], fn {:ok, res} -> res end)
end
The code above applies Task.async_stream/3 to call all the URLs in the list concurrently, as opposed to waiting for each request to complete before initiating the next, which should give a significant speedup depending on the duration of each request.
3rd Apr 2019 · Found it useful?
|
{
"url": "https://exercism.org/blog/concurrency-parallelism-in-elixir",
"source_domain": "exercism.org",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "40564",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:65INQF5XJFPH5AVKYJBBISP2GDI45JGP",
"WARC-Concurrent-To": "<urn:uuid:8a7be064-88e3-4808-a92b-78417d7a7856>",
"WARC-Date": "2022-10-03T04:48:07Z",
"WARC-IP-Address": "13.32.208.94",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DIZTDZQER5AZ7IRENPSUZDLETIXAHJ4Y",
"WARC-Record-ID": "<urn:uuid:0f8c4fb9-5957-404c-b6d8-ee2ed88b39b4>",
"WARC-Target-URI": "https://exercism.org/blog/concurrency-parallelism-in-elixir",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c1dabbfc-ea86-4102-aa8c-a42a383ce2c5>"
},
"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-62\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,
33,
34,
72,
73,
88,
102,
119,
120,
249,
250,
642,
643,
1317,
1318,
1548,
1549,
1622,
1625,
1637,
1649,
1661,
1667,
1678,
1680,
1681,
1977,
1978,
2006,
2007,
2465,
2466,
3060,
3061,
3670,
3671,
3895,
3896,
3954,
3955,
4098,
4099,
4930,
4931,
5600,
5601,
6300,
6301,
6935,
6936,
6988,
6989,
7274,
7275,
7399,
7400,
7522,
7523,
7581,
7582,
7632,
7633,
8129,
8130,
8189,
8190,
8261,
8262,
8296,
8304,
8329,
8350,
8354,
8355,
8388,
8396,
8413,
8437,
8441,
8442,
8475,
8525,
8573,
8624,
8694,
8703,
8713,
8721,
8728,
8732,
8733,
8805,
8806,
8929,
9015,
9076,
9077,
9114,
9115,
9166,
9167,
9427,
9428,
9481,
9531,
9602,
9603,
9658,
9662,
9663,
9708,
9775,
9841,
9868,
9877,
9884,
9888,
9889,
10114,
10115,
10148,
10156,
10181,
10213,
10254,
10282,
10286,
10287,
10523,
10524,
10569,
10570,
10847,
10848,
11012,
11013,
11058,
11060,
11061,
11274,
11275,
11286,
11287,
11572,
11573,
11755,
11756,
12076,
12077,
12102,
12147,
12188,
12233,
12237,
12238,
12490,
12491
],
"line_end_idx": [
33,
34,
72,
73,
88,
102,
119,
120,
249,
250,
642,
643,
1317,
1318,
1548,
1549,
1622,
1625,
1637,
1649,
1661,
1667,
1678,
1680,
1681,
1977,
1978,
2006,
2007,
2465,
2466,
3060,
3061,
3670,
3671,
3895,
3896,
3954,
3955,
4098,
4099,
4930,
4931,
5600,
5601,
6300,
6301,
6935,
6936,
6988,
6989,
7274,
7275,
7399,
7400,
7522,
7523,
7581,
7582,
7632,
7633,
8129,
8130,
8189,
8190,
8261,
8262,
8296,
8304,
8329,
8350,
8354,
8355,
8388,
8396,
8413,
8437,
8441,
8442,
8475,
8525,
8573,
8624,
8694,
8703,
8713,
8721,
8728,
8732,
8733,
8805,
8806,
8929,
9015,
9076,
9077,
9114,
9115,
9166,
9167,
9427,
9428,
9481,
9531,
9602,
9603,
9658,
9662,
9663,
9708,
9775,
9841,
9868,
9877,
9884,
9888,
9889,
10114,
10115,
10148,
10156,
10181,
10213,
10254,
10282,
10286,
10287,
10523,
10524,
10569,
10570,
10847,
10848,
11012,
11013,
11058,
11060,
11061,
11274,
11275,
11286,
11287,
11572,
11573,
11755,
11756,
12076,
12077,
12102,
12147,
12188,
12233,
12237,
12238,
12490,
12491,
12522
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 12522,
"ccnet_original_nlines": 156,
"rps_doc_curly_bracket": 0.0009583099745213985,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3695469796657562,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021392619237303734,
"rps_doc_frac_lines_end_with_ellipsis": 0.006369430106133223,
"rps_doc_frac_no_alph_words": 0.1908556967973709,
"rps_doc_frac_unique_words": 0.3209076225757599,
"rps_doc_mean_word_length": 5.362506866455078,
"rps_doc_num_sentences": 111,
"rps_doc_symbol_to_word_ratio": 0.000838930020108819,
"rps_doc_unigram_entropy": 5.602674961090088,
"rps_doc_word_count": 1851,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06175699830055237,
"rps_doc_frac_chars_dupe_6grams": 0.038283299654722214,
"rps_doc_frac_chars_dupe_7grams": 0.016925249248743057,
"rps_doc_frac_chars_dupe_8grams": 0.016925249248743057,
"rps_doc_frac_chars_dupe_9grams": 0.010477529838681221,
"rps_doc_frac_chars_top_2gram": 0.009671569801867008,
"rps_doc_frac_chars_top_3gram": 0.006649199873209,
"rps_doc_frac_chars_top_4gram": 0.010074550285935402,
"rps_doc_books_importance": -898.2077026367188,
"rps_doc_books_importance_length_correction": -898.2077026367188,
"rps_doc_openwebtext_importance": -562.6527709960938,
"rps_doc_openwebtext_importance_length_correction": -562.6527709960938,
"rps_doc_wikipedia_importance": -432.90289306640625,
"rps_doc_wikipedia_importance_length_correction": -432.90289306640625
},
"fasttext": {
"dclm": 0.7255446314811707,
"english": 0.9119282364845276,
"fineweb_edu_approx": 2.668142318725586,
"eai_general_math": 0.9757720828056335,
"eai_open_web_math": 0.24831277132034302,
"eai_web_code": 0.9916408658027649
}
}
|
{
"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": "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": "23",
"label": "Tutorial"
},
"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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,580,825,344,926,244,400 |
Come contare il numero di volte che un singolo carattere è presente in ogni riga di un file
Supponiamo di avere un file di testo di nome "file.csv" e di voler contare per ogni riga il numero di volte che si presenta un carattere, ad esempio il carattere ",".
Supponiamo che il risultato sia l'output dello stesso file "file.csv" preceduto in ogni riga dal conteggio stesso.
(altro…)
Rinominare un gruppo di file in base ad una regexpr
Supponiamo di voler rinominare il nome di un gruppo di file che hanno il seguente template:
file1_tmp.sh
file2_tmp.sh
...
file99_tmp.sh
(altro…)
Stampare solo la linea 25 di un file
Supponiamo di voler stampare solamente una singola linea di un file, che per comodità indichiamo con la linea 25
perl -ne '$. == 25 && print && exit' file.txt
Naturalmente se vogliamo stampare anche le righe 31 e 57
(altro…)
Encode/decode un file o stringa in Mime Base64
Supponiamo aver una stringa "Prova encode" ed un file "prova.txt" da voler encodare in Mime base64. Per risolvere il problema possiamo semplicemente lanciare la riga di comando:
perl -MMIME::Base64 -e 'print encode_base64("Prova encode")'
perl -MMIME::Base64 -0777 -ne 'print encode_base64($_)' prova.txt
(altro…)
Numerare un file di testo
Supponiamo di avere un file di testo (prova.txt) che vogliamo numerare. Possiamo utilizzare:
perl -pe '$_ = "$. $_"' prova.txt
Se si vuole simulare l'output di cat -n prova.txt basta usare:
(altro…)
Aggiungere 1 a tutti i numeri presenti su una stringa
$str =~ s/(\d+)/$1+1/ge
Estrarre tutte le chiavi GPG pubbliche da un file
Supponiamo di avere un file di nome "file-con-chiavi-gpg" e di volerle estrarre eliminando ogni altra riga presente nel file.
perl -ne 'print if /-----BEGIN PGP PUBLIC KEY BLOCK-----/../-----END PGP PUBLIC KEY BLOCK-----/' file-con-chiavi-gpg
(altro…)
|
{
"url": "https://quoll.it/faq-category/perl/",
"source_domain": "quoll.it",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "128747",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7E6X5Z5JYQ63KOJ3VDN2O7P373NS5EAF",
"WARC-Concurrent-To": "<urn:uuid:5258ba0b-3412-4353-82c7-22174eb7b548>",
"WARC-Date": "2022-10-02T09:37:33Z",
"WARC-IP-Address": "185.53.129.202",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:57XLXCN55JETXP7OOBU3FCUVYLQ3PJG5",
"WARC-Record-ID": "<urn:uuid:0c975af8-9d32-4540-9a53-c604ba27e341>",
"WARC-Target-URI": "https://quoll.it/faq-category/perl/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e0682c03-fd3f-4ad7-a19e-e4225a101a74>"
},
"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-62\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,
92,
93,
260,
261,
376,
377,
386,
387,
439,
440,
532,
533,
546,
559,
563,
577,
586,
587,
624,
625,
738,
739,
785,
786,
843,
844,
853,
854,
901,
902,
1080,
1081,
1142,
1208,
1217,
1218,
1244,
1245,
1338,
1339,
1373,
1374,
1437,
1438,
1447,
1448,
1502,
1503,
1527,
1528,
1578,
1579,
1705,
1706,
1823
],
"line_end_idx": [
92,
93,
260,
261,
376,
377,
386,
387,
439,
440,
532,
533,
546,
559,
563,
577,
586,
587,
624,
625,
738,
739,
785,
786,
843,
844,
853,
854,
901,
902,
1080,
1081,
1142,
1208,
1217,
1218,
1244,
1245,
1338,
1339,
1373,
1374,
1437,
1438,
1447,
1448,
1502,
1503,
1527,
1528,
1578,
1579,
1705,
1706,
1823,
1831
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1831,
"ccnet_original_nlines": 55,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08478803187608719,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03241895139217377,
"rps_doc_frac_lines_end_with_ellipsis": 0.01785713993012905,
"rps_doc_frac_no_alph_words": 0.2643391489982605,
"rps_doc_frac_unique_words": 0.46570396423339844,
"rps_doc_mean_word_length": 4.94584846496582,
"rps_doc_num_sentences": 21,
"rps_doc_symbol_to_word_ratio": 0.017456360161304474,
"rps_doc_unigram_entropy": 4.458483695983887,
"rps_doc_word_count": 277,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.11313869059085846,
"rps_doc_frac_chars_dupe_6grams": 0.07080291956663132,
"rps_doc_frac_chars_dupe_7grams": 0.07080291956663132,
"rps_doc_frac_chars_dupe_8grams": 0.045255471020936966,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.043795619159936905,
"rps_doc_frac_chars_top_3gram": 0.023357659578323364,
"rps_doc_frac_chars_top_4gram": 0.03941605985164642,
"rps_doc_books_importance": -143.29214477539062,
"rps_doc_books_importance_length_correction": -141.86190795898438,
"rps_doc_openwebtext_importance": -89.57707214355469,
"rps_doc_openwebtext_importance_length_correction": -89.57707214355469,
"rps_doc_wikipedia_importance": -86.56745147705078,
"rps_doc_wikipedia_importance_length_correction": -86.56320190429688
},
"fasttext": {
"dclm": 0.8620448112487793,
"english": 0.002137230010703206,
"fineweb_edu_approx": 0.9298122525215149,
"eai_general_math": -0.000002029999905062141,
"eai_open_web_math": 0.6050385236740112,
"eai_web_code": 0.9220343828201294
}
}
|
{
"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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,364,885,677,485,907,000 |
Verify access token with cidaas.
The above steps are showing how to get access token from cidaas. now we will see about how to verify the given access token is valid or not with cidaas.
curl -X GET \
yourcidaasurl/oauth2-login/oauth2/checktoken \
-H 'access_token: youraccesstoken'
Response
This will give you true if the token is valid , other wise it will give false
Note
1. If you are using interceptors this steps will be taken care in each request.
2. If you using the Javascript SDK, you just need to add the callback function to cidaas SDK tokentimeout_callback , the SDK will ping every 60 seconds to the cidaas server and if the token expired it will call this callback.
cidaas.tokentimeout_callback = function(){
console.log("token expired");
// do your logout or request the refresh token from your server.
}
results matching ""
No results matching ""
|
{
"url": "https://pre-release-docs.cidaas.com/php/verify-token.html",
"source_domain": "pre-release-docs.cidaas.com",
"snapshot_id": "crawl=CC-MAIN-2021-39",
"warc_metadata": {
"Content-Length": "86791",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3SPGCJJVH6LY3LA236OHFP7N2TX3GETK",
"WARC-Concurrent-To": "<urn:uuid:5982ff3d-aed9-418e-ba2e-cf31aba9f8b7>",
"WARC-Date": "2021-09-24T18:06:10Z",
"WARC-IP-Address": "77.87.187.36",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FAJKBVXOWH7C24U3SUCCN5J3JPKC6X7U",
"WARC-Record-ID": "<urn:uuid:ec51b827-8eef-4556-8ba3-075c871af793>",
"WARC-Target-URI": "https://pre-release-docs.cidaas.com/php/verify-token.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:150daae6-3074-4e76-b0c4-31ff5867abc5>"
},
"warc_info": "isPartOf: CC-MAIN-2021-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-28\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,
33,
34,
187,
188,
202,
249,
284,
285,
294,
295,
373,
374,
379,
380,
462,
463,
691,
692,
735,
765,
766,
831,
833,
834,
835,
836,
856,
857
],
"line_end_idx": [
33,
34,
187,
188,
202,
249,
284,
285,
294,
295,
373,
374,
379,
380,
462,
463,
691,
692,
735,
765,
766,
831,
833,
834,
835,
836,
856,
857,
883
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 883,
"ccnet_original_nlines": 28,
"rps_doc_curly_bracket": 0.00226501002907753,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3620689809322357,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03448275849223137,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20114943385124207,
"rps_doc_frac_unique_words": 0.5629629492759705,
"rps_doc_mean_word_length": 5.007407188415527,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.1092705726623535,
"rps_doc_word_count": 135,
"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.04881656914949417,
"rps_doc_frac_chars_top_3gram": 0.03550295904278755,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -76.81063079833984,
"rps_doc_books_importance_length_correction": -76.81063079833984,
"rps_doc_openwebtext_importance": -50.601478576660156,
"rps_doc_openwebtext_importance_length_correction": -43.24183654785156,
"rps_doc_wikipedia_importance": -41.54264450073242,
"rps_doc_wikipedia_importance_length_correction": -41.54264450073242
},
"fasttext": {
"dclm": 0.20703619718551636,
"english": 0.5605108737945557,
"fineweb_edu_approx": 1.4097669124603271,
"eai_general_math": 0.6401189565658569,
"eai_open_web_math": 0.15971577167510986,
"eai_web_code": 0.46729403734207153
}
}
|
{
"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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-9,036,697,013,264,774,000 |
0
I am writing a web app that shows current info about bounties and child bounties. From what i understand if there is a bounty with a value of 5 DOT, I can create N child bounties which values sum up to 5 DOT (assuming curators fee 0). Now let's say that I create a child bounty of value 0.5 DOT and this child bounty was already paid to some beneficiary.
How can check how much DOTs is left to spend for next child bounties? (4.5 DOT in my example)
Thank you! :)
1 Answer 1
2
When a child bounty is created, the amount is already deducted for it from the parent bounty's balance. At any time, the parent bounty's balance would show only the remaining amount for any new child bounties. You only need to query the balance of the parent bounty account.
This would be different from the value of the parent bounty, just to be clear. The value is the initial amount, and the balance of the bounty account is the remaining amount.
Here is where we deduct the balance from parent bounty - https://github.com/paritytech/substrate/blob/master/frame/child-bounties/src/lib.rs#L282
And this is how we get the AccountId for a BountyIndex - https://github.com/paritytech/substrate/blob/master/frame/bounties/src/lib.rs#L806
You'll probably need to do this BountyIndex to AccountId conversion at the client side. And then just query the balance.
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "https://substrate.stackexchange.com/questions/3240/get-remaining-value-of-bounty-after-child-bounty/3300",
"source_domain": "substrate.stackexchange.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "121323",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:44YKEJ4SPXUHHEGUKHVPX2W3GLCVOU25",
"WARC-Concurrent-To": "<urn:uuid:2f07a5e4-7338-495f-9ff2-0a873b2f600e>",
"WARC-Date": "2024-04-17T22:46:10Z",
"WARC-IP-Address": "172.64.144.30",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HBVT4J6OKY6ZUOXJIQO65GN7RAFZCM5W",
"WARC-Record-ID": "<urn:uuid:ca1062b7-0ea3-4241-8e0d-da91c941da48>",
"WARC-Target-URI": "https://substrate.stackexchange.com/questions/3240/get-remaining-value-of-bounty-after-child-bounty/3300",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1cca1692-9364-4354-a4a9-0a4c6896e150>"
},
"warc_info": "isPartOf: CC-MAIN-2024-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-180\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,
2,
3,
358,
359,
453,
454,
468,
469,
480,
481,
483,
484,
759,
760,
935,
936,
1082,
1083,
1223,
1224,
1345,
1346,
1358,
1359,
1475,
1476
],
"line_end_idx": [
2,
3,
358,
359,
453,
454,
468,
469,
480,
481,
483,
484,
759,
760,
935,
936,
1082,
1083,
1223,
1224,
1345,
1346,
1358,
1359,
1475,
1476,
1566
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1566,
"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.37931033968925476,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.028735630214214325,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20402298867702484,
"rps_doc_frac_unique_words": 0.51171875,
"rps_doc_mean_word_length": 4.8046875,
"rps_doc_num_sentences": 21,
"rps_doc_symbol_to_word_ratio": 0.005747130140662193,
"rps_doc_unigram_entropy": 4.522128105163574,
"rps_doc_word_count": 256,
"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.04227641969919205,
"rps_doc_frac_chars_top_3gram": 0.019512200728058815,
"rps_doc_frac_chars_top_4gram": 0.03739837184548378,
"rps_doc_books_importance": -102.75322723388672,
"rps_doc_books_importance_length_correction": -89.99952697753906,
"rps_doc_openwebtext_importance": -69.65940856933594,
"rps_doc_openwebtext_importance_length_correction": -69.65940856933594,
"rps_doc_wikipedia_importance": -65.57115173339844,
"rps_doc_wikipedia_importance_length_correction": -51.79692077636719
},
"fasttext": {
"dclm": 0.6129748821258545,
"english": 0.9060086607933044,
"fineweb_edu_approx": 1.6432477235794067,
"eai_general_math": 0.00045729000703431666,
"eai_open_web_math": 0.04301052913069725,
"eai_web_code": 0.0002413400070508942
}
}
|
{
"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": "332.87",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Finance"
}
}
},
"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": "-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": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,821,771,883,503,560,000 |
Best Agile Jira Dashboard Examples for 2023
• July 5th, 2021
agile jira dashboards - featured image
Jira Software is primarily used for Project Management, Bug Tracking, and Issue Tracking. A Jira dashboard consists of various useful features and functions which simplify the process of handling issues. With Jira, you can organize, plan, track, and manage all your Agile software development projects in a single place. Trusted by over 36,000 websites worldwide, Jira is used to offer better prioritization, visibility, and increased productivity for project managers and teams.
Jira differentiates itself from other dashboarding tools by allowing its users to tweak and combine numerous intuitive features, and customize their dashboards on the go. This blog talks about a small number of Jira Dashboard Examples that can help you increase efficiency in your workplace. It starts with a brief introduction to Jira, its features, and benefits before moving on to the methodology to create a dashboard in Jira. It then talks about the different components of a Jira dashboard called Gadgets.
Table of Contents
Introduction to Jira
Jira Logo
Image Source
Jira offers numerous products and deployment options that are purpose-built for IT, Business, Ops teams, and Software. The Jira Service Management, Jira Software, and Jira Work Management are built on top of the Jira platform. Jira Align is a platform that allows you to connect work and scale it up easily.
Jira Service Management, Jira Software, and Jira Work Management come with built-in project templates for various use cases. Since these products can seamlessly integrate for a diverse set of business use cases, teams across organizations can collaborate to improve their efficiency.
Here are a few key features of the Jira platform that makes it an indispensable tool in today’s marketplace:
• Kanban Boards: Kanban Boards are designed to help teams increase efficiency and continuously improve cycle time. With Kanban Boards, you can show your team the most relevant information for each task, issue, or bug. Kanban Boards can be used to visually depict work at the various stages of production. Teams can use it to define and configure workflows that can be simple or complex as needed.
• Scrum Boards: Scrum framework enables Software teams to manage complex projects by inculcating a culture of collaboration. The Jira Scrum Board is a handy tool that can unite teams around a single goal and promote incremental, iterative delivery. Since Scrum Boards can be accessed by any team member at any time, everyone clearly understands their role. This helps people quickly identify any blockers and improve productivity. Scrum Boards ensure transparency by slicing the work into stages and utilizing Velocity Reports and Burndown.
• Roadmaps: Jira Roadmaps allows you to stay up-to-date in real-time as these are always in sync with the work your teams are tracking in Jira software. It also provides smart filters that ensure that you can always share the right view of your roadmap for every stakeholder.
• Agile Reporting: Jira Reports help you deliver value to customers faster with real-time insights at your fingertips. These reports offer critical insight into Kanban, Scrum, and any agile methodology in between. You can organize projects and track achievements in a single view with dashboards in Jira Software as well.
Download the Guide on How to Set Up a Data Analytics Stack
Download the Guide on How to Set Up a Data Analytics Stack
Download the Guide on How to Set Up a Data Analytics Stack
Learn how to build a self-service data analytics stack for your use case.
Setting up Jira Dashboards
The Jira Dashboard greets you when you first log in to Jira. Jira gives you the option of creating different dashboards for various projects or multiple dashboards for one massive overview of your entire workload. Here are the steps you can follow to create a new dashboard in Jira software:
1. Creating the Dashboard
• In Jira Cloud, first, go to Dashboards > Create dashboard.
Create Jira Dashboard
Image Source
• Next, in Jira Server and Data Center, click Dashboards > Manage Dashboards. Click on Create New Dashboard located in the top right of the page.
Manage Jira Dashboards
Image Source
• Finally, give your dashboard a name and description so your team knows when to utilize it. Fill in the remaining fields, and click Save.
2. Choosing a Jira Dashboard Layout
• Click Edit Layout to choose a layout to display your gadgets. There are five options to choose from. Once you decide on a layout, the width of each gadget is fixed while the height may vary.
Creating a Layout
Image Source
3. Adding Gadgets to Jira Dashboard
• You now have an empty dashboard on your hands. Jira Dashboards are fully customizable, with each Gadget being a modular window. There are numerous Gadgets to choose from and more on the Atlassian Marketplace. Click Add Gadget and choose from the various available Gadgets to populate your dashboard. Custom dashboards aren’t limited to one dashboard page.
Adding Gadgets Window
Image Source
• It can take a few seconds for all of the available Gadgets to appear on the dashboard. You can click on Load All Gadgets to ensure the full list is loaded.
Load All Gadgets Window
Image Source
• The most commonly used Gadgets should be visible as soon as the dashboard loads in an ideal situation. You can experiment with different layout options to see which works best for which use case based on the type of reports being displayed. It is suggested to go with no more than 6 Gadgets on a single dashboard.
Simplify your Data Analysis with Hevo’s No-code Data Pipeline
A fully managed No-code Data Pipeline platform like Hevo helps you integrate and load data from 100+ different sources like Jira to a destination of your choice in real-time in an effortless manner. Hevo with its minimal learning curve can be set up in just a few minutes allowing the users to load data without having to compromise performance. Its strong integration with umpteenth sources allows users to bring in data of different kinds in a smooth fashion without having to code a single line.
Get Started with Hevo for Free
Check out some of the cool features of Hevo:
• Completely Automated: The Hevo platform can be set up in just a few minutes and requires minimal maintenance.
• Transformations: Hevo provides preload transformations through Python code. It also allows you to run transformation code for each event in the pipelines you set up. You need to edit the event object’s properties received in the transform method as a parameter to carry out the transformation. Hevo also offers drag and drop transformations like Date and Control Functions, JSON, and Event Manipulation to name a few. These can be configured and tested before putting them to use.
• Connectors: Hevo supports 100+ integrations to SaaS platforms, files, databases, analytics, and BI tools. It supports various destinations including Google BigQuery, Amazon Redshift, Snowflake Data Warehouses; Amazon S3 Data Lakes; and MySQL, SQL Server, TokuDB, DynamoDB, PostgreSQL databases to name a few.
• Real-Time Data Transfer: Hevo provides real-time data migration, so you can have analysis-ready data always.
• 100% Complete & Accurate Data Transfer: Hevo’s robust infrastructure ensures reliable data transfer with zero data loss.
• Scalable Infrastructure: Hevo has in-built integrations for 100+ sources, that can help you scale your data infrastructure as required.
• 24/7 Live Support: The Hevo team is available round the clock to extend exceptional support to you through chat, email, and support calls.
• Schema Management: Hevo takes away the tedious task of schema management & automatically detects the schema of incoming data and maps it to the destination schema.
• Live Monitoring: Hevo allows you to monitor the data flow so you can check where your data is at a particular point in time.
Sign up here for a 14-Day Free Trial!
Best Jira Dashboard Examples
As mentioned before, Jira Dashboards are made up of Jira Gadgets. Jira Gadgets can display numerous reports, summaries of team progress, and other data from Jira Projects. All these together make up a dashboard. These Gadgets can be customized to show projects and provide details relevant to specific users.
Here is a list of a few Jira Dashboard Examples (gadgets) that can come in handy for your use case:
Jira Dashboard Examples: High Priority Issues
Jira Dashboard Examples: High Priority Issues
Image Source
It is suggested to place a list of your team’s high-priority issues in the upper right-hand corner for best results. A JQL statement can be used to find any issues with the flagged field selected or if it is considered a blocker.
Flagging an issue points to an obstacle that needs to be overcome before moving forward. For instance, if an issue is marked “Priority = Blocker”, it means that it’s globally essential to the project’s health.
Despite being different reasons, both issues are of grave concern to the team. This is what your JQL statement should look like:
sprint in (openSprints(), futureSprints()) AND project in (TIS) AND (Flagged is not EMPTY OR priority = Blocker)
Jira Dashboard Examples: Sprint Health
Jira Dashboard Examples: Sprint Health
Image Source
This Jira Dashboard example summarizes the important metrics in a Sprint. It’s best to place Sprint Health in the upper left so that everyone who’s working in the Sprint is aware of the progress. It can also give people an immediate sense of any challenge or trouble.
The overall Sprint Progress Bar has three colors: blue, yellow, and green to display different issues across different statuses. These colors match the blue, yellow, and green columns in the column configuration for your board, where each column has different statuses mapped to it.
The Scope Change field in the Spring Health dashboard shows the addition or the removal of an issue from a Sprint. The percentage can be calculated using the statistic configured for the board (refer to Configuration Estimation and Tracking). For instance, if you started a Sprint with 50 story points and then added an issue with 5 story points, the Spring Health Gadget would reflect a 10% scope change.
If you add or remove issues that don’t have estimates, the scope change will not be altered.
Jira Dashboard Examples: Sprint Burndown
The Sprint Burndown dashboard displays the amount of work remaining to achieve the goal of a Sprint. You can also use it to project the likelihood of achieving the set Sprint goal. This allows a team to monitor its progress and respond to trends accordingly.
For example, if the Burndown Chart shows that the team may not reach the Sprint goal, they can take timely action to stay on track. The Sprint’s start is shown on the left of the dashboard while the Sprint’s end is on the right.
You can configure the Sprint Burndown so that it automatically displays the current Sprint as opposed to reconfiguring it every time you start a new Sprint. The gadget uses a series of line graphs as follows:
Jira Dashboard Examples: Sprint Burndown
Image Source
Jira Dashboard Examples: Continuous Integration
The most successful Agile teams pay attention to continuous integration. By consistently investing in automated testing strategies, your team can become more Agile. You can use Atlassian Bamboo to stay ahead of build breakages. It can also be used to ensure that automated tests are continuously running.
If you wish to create a Jira Continuous Integration Dashboard Gadget, you can ask your Jira admin to configure the Bamboo plugin for Jira which makes the Bamboo Plans Gadget available.
Jira Dashboard Examples: Continuous Integration
Image Source
Jira Dashboard Examples: Two-Dimensional Filter Statistics
The Two-Dimensional Filter Statistics dashboard can be used to break down a set of data making it easier to find critical areas of concern. This Jira Dashboard example tells you two things: the relative priorities of work distributed throughout the team and how much each team member has on their plate.
Jira Dashboard Examples: Two Dimensional Filter Statistics By Status
Image Source
You can set up your base filter by considering your current work. Next, you can use the following JQL statement to show the work in the current sprint as well as future scheduled work:
sprint in (openSprints(), futureSprints()) AND project in (TIS)
Jira Dashboard Examples: Two Dimensional Filter Statistics by Priority
Image Source
Jira Dashboard Examples: Progress Tracking
Jira Dashboard Examples: Progress Tracking
Image Source
The purpose of a team dashboard is to serve your team’s interest and kindle their drive. This Jira Dashboard example includes Gadgets that help measure progress for projects.
• The Activity Stream Gadget helps you keep track of what’s happening in your project.
• The Jira Road Map Gadget is known for simplifying the progress toward milestones. It lets you know which versions are due and the progress on issue resolution for each one.
• The Resolution Time Gadget shows the average time between an issue’s creation and resolution over a specified period.
• You can use the Created vs Resolved Gadget to display the frequency of issues fixed and logged. The higher the resolution count, the fewer the problems logged, the more stable the Sprint and the project.
• You can also use the Two Dimensional Filter Statistics Gadget to track different metrics namely bugs resolved by your team members.
Jira Dashboard Examples: Different Team Tracker
Jira Dashboard Examples: Different Team Tracking
Image Source
You can use multiple examples of the same gadget to track the progress for different projects and teams, as depicted with the Sprint Health Gadget above.
Jira Dashboard Examples: Level Up
Jira Dashboard Examples: Level Up
Image Source
You can extend your dashboard to incorporate data from multiple streams. You can track numerous scrum teams together by using examples of the Agile Sprint Burndown Gadget and the Sprint Health Gadget. This will help you get an overview of your teams’ progression towards a common goal.
You can use Gadgets to track the progress of a Sprint and display resolution statistics. You can try these in your dashboard:
• Select the Filter Results Gadget, and pick the custom JQL filter Sprint in:
(openSprints()) AND project in (PRAC) AND (Flagged is not EMPTY OR priority = Medium)
This can be set to cover the range of issue priorities and Sprints you want.
• Similarly, Sprint Health Gadget can track the progress of issues designated to each team member and the Sprint Burndown Gadget to display team performance through the Sprint. For the Sprint Burndown Gadget, you can set your estimation at the beginning of the Sprint which is tracked by the grayline. The red Remaining Values line tracks the closed and added issues. These issues would ideally fall below the Guideline.
Conclusion
This blog talks about Jira Dashboard Examples in great detail after a brief introduction to Jira along with its features and benefits. It also talks about the steps you can follow to create a dashboard in Jira. Extracting complex data from a diverse set of data sources can be a challenging task and this is where Hevo saves the day!
Visit our Website to Explore Hevo
Hevo Data provides its users with a simpler platform for integrating data from 100+ sources for Analysis such as Jira. It is a No-code Data Pipeline that can help you combine data from multiple sources. You can use it to transfer data from multiple data sources into your Data Warehouses/Databases, or a destination of your choice. It provides you with a consistent and reliable solution to managing data in real-time, ensuring that you always have Analysis-ready data in your desired destination.
Want to take Hevo for a spin? Sign Up for a 14-day free trial and experience the feature-rich Hevo suite first hand. You can also have a look at our unbeatable pricing that will help you choose the right plan for your business needs!
Share your experience of learning about the Jira Dashboard Examples! Let us know in the comments section below!
No-code Data Pipeline For Jira
|
{
"url": "https://hevodata.com/learn/jira-dashboard-examples/",
"source_domain": "hevodata.com",
"snapshot_id": "CC-MAIN-2023-23",
"warc_metadata": {
"Content-Length": "121046",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4F3VUWSBZEC4STMUPZ2XZLHBRUDJV7I4",
"WARC-Concurrent-To": "<urn:uuid:eec20212-ce07-4fbc-83b3-14988f4df18b>",
"WARC-Date": "2023-05-30T03:50:56Z",
"WARC-IP-Address": "18.142.141.54",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WJBN42M2XBG3WTQMIBMLUO4J3IP3VCWW",
"WARC-Record-ID": "<urn:uuid:4c79987e-277d-47ca-bd01-efe0afcfb62f>",
"WARC-Target-URI": "https://hevodata.com/learn/jira-dashboard-examples/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7c976245-b934-41f7-8d52-7432d0f29016>"
},
"warc_info": "isPartOf: CC-MAIN-2023-23\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-34\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,
44,
45,
62,
63,
102,
103,
583,
584,
1096,
1097,
1115,
1116,
1137,
1138,
1148,
1161,
1162,
1470,
1471,
1755,
1756,
1865,
1866,
2265,
2811,
3090,
3417,
3476,
3535,
3594,
3668,
3669,
3696,
3697,
3989,
3990,
4016,
4017,
4080,
4102,
4115,
4263,
4286,
4287,
4300,
4301,
4442,
4443,
4479,
4480,
4675,
4693,
4707,
4708,
4744,
4745,
5105,
5127,
5141,
5305,
5329,
5343,
5662,
5663,
5725,
5726,
6226,
6227,
6258,
6259,
6304,
6305,
6419,
6904,
7219,
7332,
7457,
7597,
7740,
7908,
8037,
8075,
8076,
8105,
8106,
8418,
8419,
8519,
8520,
8566,
8567,
8613,
8626,
8627,
8857,
8858,
9068,
9069,
9198,
9199,
9312,
9313,
9352,
9353,
9392,
9405,
9406,
9674,
9675,
9958,
9959,
10365,
10366,
10460,
10461,
10502,
10503,
10762,
10763,
10994,
10995,
11204,
11205,
11246,
11259,
11260,
11308,
11309,
11614,
11615,
11800,
11801,
11849,
11864,
11865,
11924,
11925,
12229,
12230,
12299,
12312,
12313,
12498,
12499,
12564,
12635,
12648,
12649,
12692,
12693,
12736,
12749,
12750,
12925,
12926,
13015,
13192,
13314,
13522,
13662,
13663,
13711,
13712,
13761,
13774,
13775,
13929,
13930,
13964,
13965,
13999,
14012,
14013,
14299,
14300,
14426,
14427,
14507,
14593,
14594,
14671,
14672,
15096,
15097,
15108,
15109,
15443,
15444,
15478,
15479,
15977,
15978,
16212,
16213,
16325,
16326
],
"line_end_idx": [
44,
45,
62,
63,
102,
103,
583,
584,
1096,
1097,
1115,
1116,
1137,
1138,
1148,
1161,
1162,
1470,
1471,
1755,
1756,
1865,
1866,
2265,
2811,
3090,
3417,
3476,
3535,
3594,
3668,
3669,
3696,
3697,
3989,
3990,
4016,
4017,
4080,
4102,
4115,
4263,
4286,
4287,
4300,
4301,
4442,
4443,
4479,
4480,
4675,
4693,
4707,
4708,
4744,
4745,
5105,
5127,
5141,
5305,
5329,
5343,
5662,
5663,
5725,
5726,
6226,
6227,
6258,
6259,
6304,
6305,
6419,
6904,
7219,
7332,
7457,
7597,
7740,
7908,
8037,
8075,
8076,
8105,
8106,
8418,
8419,
8519,
8520,
8566,
8567,
8613,
8626,
8627,
8857,
8858,
9068,
9069,
9198,
9199,
9312,
9313,
9352,
9353,
9392,
9405,
9406,
9674,
9675,
9958,
9959,
10365,
10366,
10460,
10461,
10502,
10503,
10762,
10763,
10994,
10995,
11204,
11205,
11246,
11259,
11260,
11308,
11309,
11614,
11615,
11800,
11801,
11849,
11864,
11865,
11924,
11925,
12229,
12230,
12299,
12312,
12313,
12498,
12499,
12564,
12635,
12648,
12649,
12692,
12693,
12736,
12749,
12750,
12925,
12926,
13015,
13192,
13314,
13522,
13662,
13663,
13711,
13712,
13761,
13774,
13775,
13929,
13930,
13964,
13965,
13999,
14012,
14013,
14299,
14300,
14426,
14427,
14507,
14593,
14594,
14671,
14672,
15096,
15097,
15108,
15109,
15443,
15444,
15478,
15479,
15977,
15978,
16212,
16213,
16325,
16326,
16356
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 16356,
"ccnet_original_nlines": 196,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36952945590019226,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007897330448031425,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12602829933166504,
"rps_doc_frac_unique_words": 0.28646618127822876,
"rps_doc_mean_word_length": 4.962029933929443,
"rps_doc_num_sentences": 133,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.6134819984436035,
"rps_doc_word_count": 2660,
"rps_doc_frac_chars_dupe_10grams": 0.010682630352675915,
"rps_doc_frac_chars_dupe_5grams": 0.10546254366636276,
"rps_doc_frac_chars_dupe_6grams": 0.055913329124450684,
"rps_doc_frac_chars_dupe_7grams": 0.04704901948571205,
"rps_doc_frac_chars_dupe_8grams": 0.04250321909785271,
"rps_doc_frac_chars_dupe_9grams": 0.022956280037760735,
"rps_doc_frac_chars_top_2gram": 0.03151753917336464,
"rps_doc_frac_chars_top_3gram": 0.03659367933869362,
"rps_doc_frac_chars_top_4gram": 0.00818243995308876,
"rps_doc_books_importance": -1589.5159912109375,
"rps_doc_books_importance_length_correction": -1589.5159912109375,
"rps_doc_openwebtext_importance": -1042.288818359375,
"rps_doc_openwebtext_importance_length_correction": -1042.288818359375,
"rps_doc_wikipedia_importance": -736.1047973632812,
"rps_doc_wikipedia_importance_length_correction": -736.1047973632812
},
"fasttext": {
"dclm": 0.02257627062499523,
"english": 0.8992710113525391,
"fineweb_edu_approx": 1.7080403566360474,
"eai_general_math": 0.05320250988006592,
"eai_open_web_math": 0.18795478343963623,
"eai_web_code": 0.2151498794555664
}
}
|
{
"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": "658.403",
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,468,267,887,639,903,000 |
Jump to content
• Log In with Google Sign In
• Create Account
Screen to world fault
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
No replies to this topic
#1 Members
100
Like
0Likes
Like
Posted 24 March 2012 - 01:45 AM
Hello. Im trying to get world coordinates from screen, using ray picking. I have tryed lots of realisation: D3DXVec3Unproject and Picking sample in SDK. All of ways giving a slight offset from truth.
SCREEN_WIDTH = 800;
SCREEN_HEIGHT = 600;
void PickingRay()
{
D3DXMATRIX MatrixWorld;
D3DXMATRIX MatrixView;
D3DXMATRIX MatrixProjection;
d3ddev->GetTransform(D3DTS_VIEW,&MatrixView);
d3ddev->GetTransform(D3DTS_PROJECTION,&MatrixProjection);
d3ddev->GetTransform(D3DTS_WORLD,&MatrixWorld);
d3ddev->GetViewport(&ViewPort);
D3DXVECTOR3 vPickRayDir;
D3DXVECTOR3 vPickRayOrig;
POINT ptCursor;
GetCursorPos( &ptCursor );
ScreenToClient( hWndMain, &ptCursor );
// Compute the vector of the pick ray in screen space
D3DXVECTOR3 v;
v.x = ( ( ( 2.0f * ptCursor.x ) / SCREEN_WIDTH) - 1 ) / MatrixProjection._11;
v.y = -( ( ( 2.0f * ptCursor.y ) / SCREEN_HEIGHT ) - 1 ) / MatrixProjection._22;
v.z = 1.0f;
// Get the inverse view matrix
const D3DXMATRIX matView = MatrixView;
const D3DXMATRIX matWorld = MatrixWorld;
D3DXMATRIX mWorldView = matWorld * matView;
D3DXMATRIX m;
D3DXMatrixInverse( &m, NULL, &mWorldView );
// Transform the screen space pick ray into 3D space
vPickRayDir.x = v.x * m._11 + v.y * m._21 + v.z * m._31;
vPickRayDir.y = v.x * m._12 + v.y * m._22 + v.z * m._32;
vPickRayDir.z = v.x * m._13 + v.y * m._23 + v.z * m._33;
vPickRayOrig.x = m._41;
vPickRayOrig.y = m._42;
vPickRayOrig.z = m._43;
float Z = 0;
float a = (Z-vPickRayOrig.z)/vPickRayDir.z;
float X = vPickRayOrig.x+a*vPickRayDir.x;
float Y = vPickRayOrig.y+a*vPickRayDir.y;
}
I have tryed to use D3DXVec3Project to draw pixel and got it with this offset too. I have runned my app in full screen and got offset too. This offset isnt constant it raise to border, so in center it is the smallest. GetTransform gets matrices, its constant. The render loop:
void render_frame(void)
{
ViewPort.X = 0;
ViewPort.Y = 0;
ViewPort.Width = SCREEN_WIDTH;
ViewPort.Height = SCREEN_HEIGHT;
ViewPort.MinZ = 0.0f;
ViewPort.MaxZ = 1.0f;
d3ddev->SetViewport(&ViewPort);
d3ddev->Clear(0, NULL, D3DCLEAR_TARGET, D3DCOLOR_XRGB(0, 0, 0), 1.0f, 0);
d3ddev->Clear(0, NULL, D3DCLEAR_ZBUFFER, D3DCOLOR_XRGB(0, 0, 0), 1.0f, 0);
d3ddev->BeginScene();
// select which vertex format we are using
d3ddev->SetFVF(CUSTOMFVF);
// set the view transform
D3DXMATRIX matView; // the view transform matrix
D3DXMatrixLookAtLH(&matView,
&D3DXVECTOR3 (0.0f, 0.0f, 60.0f), // the camera position
&D3DXVECTOR3 (0.0f, 0.0f, 0.0f), // the look-at position
&D3DXVECTOR3 (0.0f, 1.0f, 0.0f)); // the up direction
d3ddev->SetTransform(D3DTS_VIEW, &matView); // set the view transform to matView
// set the projection transform
D3DXMATRIX matProjection; // the projection transform matrix
D3DXMatrixPerspectiveFovLH(&matProjection,
D3DXToRadian(60), // the horizontal field of view
(FLOAT)SCREEN_WIDTH / (FLOAT)SCREEN_HEIGHT, // aspect ratio
1.0f, // the near view-plane
1000.0f); // the far view-plane
d3ddev->SetTransform(D3DTS_PROJECTION, &matProjection); // set the projection
// select the vertex buffer to display
D3DXMATRIX matTranslateA; // a matrix to store the translation for triangle A
D3DXMatrixIdentity(&matTranslateA);
d3ddev->SetTransform(D3DTS_WORLD,&matTranslateA);
d3ddev->SetStreamSource(0, v_buffer, 0, sizeof(CUSTOMVERTEX));
d3ddev->DrawPrimitive(D3DPT_TRIANGLELIST, 0, 1);
d3ddev->DrawPrimitive(D3DPT_TRIANGLELIST, 2, 1);
d3ddev->EndScene();
d3ddev->Present(NULL, NULL, NULL, NULL);
PickingRay();
}
Posted Image
Im sorry, but you need to zoom this picture to see dots, that are effect of D3DXVec3Project from square vertices.
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.
|
{
"url": "http://www.gamedev.net/topic/622329-screen-to-world-fault/#entry4924842",
"source_domain": "www.gamedev.net",
"snapshot_id": "crawl=CC-MAIN-2016-50",
"warc_metadata": {
"Content-Length": "101139",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UKDEJWT4NVHZZYN6RWJWUFBIHTHEUWQT",
"WARC-Concurrent-To": "<urn:uuid:f4a10877-3c52-4918-95fe-1d3d9b80cf74>",
"WARC-Date": "2016-12-08T10:05:50Z",
"WARC-IP-Address": "64.91.255.13",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:RPRKG7QVLF5CR4QTRD3RWETFVKPQNEEA",
"WARC-Record-ID": "<urn:uuid:a4f53ddd-734d-4df5-9853-716266958bda>",
"WARC-Target-URI": "http://www.gamedev.net/topic/622329-screen-to-world-fault/#entry4924842",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bd2a00b1-61bb-438f-a36b-097c9c07fe16>"
},
"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,
16,
17,
56,
75,
76,
98,
99,
100,
111,
112,
279,
280,
281,
316,
341,
342,
358,
359,
363,
368,
375,
380,
381,
413,
414,
614,
615,
635,
656,
657,
658,
659,
677,
679,
703,
726,
755,
756,
802,
860,
908,
940,
941,
966,
992,
993,
1009,
1036,
1075,
1076,
1130,
1145,
1223,
1304,
1316,
1317,
1348,
1387,
1428,
1472,
1486,
1530,
1531,
1584,
1641,
1698,
1755,
1779,
1803,
1827,
1840,
1884,
1885,
1927,
1969,
1971,
1972,
1973,
2250,
2251,
2252,
2276,
2278,
2294,
2310,
2341,
2374,
2396,
2418,
2450,
2524,
2599,
2600,
2622,
2623,
2666,
2693,
2694,
2720,
2769,
2798,
2855,
2912,
2966,
3047,
3048,
3080,
3141,
3184,
3234,
3294,
3323,
3355,
3433,
3434,
3435,
3474,
3475,
3553,
3589,
3639,
3702,
3751,
3800,
3801,
3821,
3822,
3863,
3877,
3879,
3880,
3881,
3894,
3895,
3896,
4010,
4011,
4012,
4013,
4014,
4025,
4026
],
"line_end_idx": [
16,
17,
56,
75,
76,
98,
99,
100,
111,
112,
279,
280,
281,
316,
341,
342,
358,
359,
363,
368,
375,
380,
381,
413,
414,
614,
615,
635,
656,
657,
658,
659,
677,
679,
703,
726,
755,
756,
802,
860,
908,
940,
941,
966,
992,
993,
1009,
1036,
1075,
1076,
1130,
1145,
1223,
1304,
1316,
1317,
1348,
1387,
1428,
1472,
1486,
1530,
1531,
1584,
1641,
1698,
1755,
1779,
1803,
1827,
1840,
1884,
1885,
1927,
1969,
1971,
1972,
1973,
2250,
2251,
2252,
2276,
2278,
2294,
2310,
2341,
2374,
2396,
2418,
2450,
2524,
2599,
2600,
2622,
2623,
2666,
2693,
2694,
2720,
2769,
2798,
2855,
2912,
2966,
3047,
3048,
3080,
3141,
3184,
3234,
3294,
3323,
3355,
3433,
3434,
3435,
3474,
3475,
3553,
3589,
3639,
3702,
3751,
3800,
3801,
3821,
3822,
3863,
3877,
3879,
3880,
3881,
3894,
3895,
3896,
4010,
4011,
4012,
4013,
4014,
4025,
4026,
4192
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4192,
"ccnet_original_nlines": 142,
"rps_doc_curly_bracket": 0.0009541999897919595,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.19833852350711823,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06334371864795685,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4340602159500122,
"rps_doc_frac_unique_words": 0.5040650367736816,
"rps_doc_mean_word_length": 6.264227867126465,
"rps_doc_num_sentences": 79,
"rps_doc_symbol_to_word_ratio": 0.0010384200140833855,
"rps_doc_unigram_entropy": 5.138138771057129,
"rps_doc_word_count": 492,
"rps_doc_frac_chars_dupe_10grams": 0.08955223858356476,
"rps_doc_frac_chars_dupe_5grams": 0.10188189148902893,
"rps_doc_frac_chars_dupe_6grams": 0.08955223858356476,
"rps_doc_frac_chars_dupe_7grams": 0.08955223858356476,
"rps_doc_frac_chars_dupe_8grams": 0.08955223858356476,
"rps_doc_frac_chars_dupe_9grams": 0.08955223858356476,
"rps_doc_frac_chars_top_2gram": 0.017521090805530548,
"rps_doc_frac_chars_top_3gram": 0.015574299730360508,
"rps_doc_frac_chars_top_4gram": 0.010382870212197304,
"rps_doc_books_importance": -501.59808349609375,
"rps_doc_books_importance_length_correction": -501.59808349609375,
"rps_doc_openwebtext_importance": -294.07122802734375,
"rps_doc_openwebtext_importance_length_correction": -294.07122802734375,
"rps_doc_wikipedia_importance": -214.32290649414062,
"rps_doc_wikipedia_importance_length_correction": -214.32290649414062
},
"fasttext": {
"dclm": 0.07449567317962646,
"english": 0.539211094379425,
"fineweb_edu_approx": 1.608246922492981,
"eai_general_math": 0.6346965432167053,
"eai_open_web_math": 0.04965120926499367,
"eai_web_code": 0.10614532232284546
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0151",
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-45,818,878,171,504,500 |
Sign up ×
Super User is a question and answer site for computer enthusiasts and power users. It's 100% free, no registration required.
Update
This is not working in my office pc. When i specificy the current month day as only 2. This is an data which it throws:-
How many Days this month: 2 The Month is (Blank) The Day is (Blank) The Year is (Blank) the Month is 2 days long C:\Documents and Settings\Desktop\hi\act\01--.xls C:\Documents and Settings\Desktop\hi\act\2--.xls C:\Documents and Settings\Desktop\hi\act\Master File.xls 1 file(s) copied. C:\Documents and Settings\Desktop\hi\act\01--.xls C:\Documents and Settings\Desktop\hi\act\06-Mar-2012.xls C:\Documents and Settings\Desktop\hi\act\2--.xls C:\Documents and Settings\Desktop\hi\act\Master File.xls 1 file(s) copied. C:\Documents and Settings\Desktop\hi\act\01--.xls C:\Documents and Settings\Desktop\hi\act\06-Mar-2012.xls C:\Documents and Settings\Desktop\hi\act\Master File.xls 1 file(s) copied
.
Original Question Below
There is an excel file for each day of the month. I need to create the Excel file for each day as per the date.
For example: There are 31 days in month of January, so the Excel files in each month's folder will be
01-01-12.xls
02-01-12.xls
03-01-12.xls
...
31-01-12.xls
Is it possible?
I tried this in a .bat file but I don't know how to construct the loop:
@For /F "tokens=1,2,3 delims=/" %%A in ('Date /t') do @(
Set Day=%%A
Set Month=%%B
Set Year=%%C
Set All=%%A%%B%%C
)
@For %%a in ("*.xls") do copy %%a "import\%All%.xls"
share|improve this question
@Uday because your accounts aren't associated because you used two different email addresses, so I can't help associate your accounts. Either way, please keep using the account you used to edit this question – Ivo Flipse Mar 6 '12 at 10:02
What do you mean "There is an excel file for each day of the month" What are the names currently, of your excel files, prior to running anything? – barlop Mar 6 '12 at 15:30
I missed your last comment. Do you have enough rep to join the discussion now? – barlop Mar 9 '12 at 1:10
@barlop now i can come for discussion as I have got 21 rep now. Please tell me when to come to chat. – Uday Mar 9 '12 at 3:00
the chat is not live, so just go in now and type what you want and when i'm online i'll type what I want, then you come in later and type what you want etc. we don't have to be in there at the same time. – barlop Mar 9 '12 at 9:04
2 Answers 2
Here is oneliner that will create today's file.
echo "" > { echo (gettime()+".xls") }
This is in biterscripting. Put this in a file x.txt file, then schedule this command to run every day thru task scheduler.
C:/biterscripting/biterscripting.exe x.txt
share|improve this answer
@echo off
set /P max=How many Days this month:
for /f "tokens=1-3 delims=- " %%a in ('date /T') do @(
set y=%%c
set m=%%b
set d=%%a
)
echo The Month is %m%
echo The Day is %d%
echo The Year is %y%
echo the Month is %max% days long
set d=01
Set /a max=%max%+1
:loop
SET adate=%d%-%m%-%y%
if not exist "C:\Documents and Settings\NGLD7640\Desktop\hi\act\%adate%.xls" copy "C:\Documents and Settings\NGLD7640\Desktop\hi\act\Master File.xls" "C:\Documents and Settings\NGLD7640\Desktop\hi\act\%adate%.xls"
set /a d=%d%+1
if not %d%==%Max% goto loop
Code adjusted and customized based on this discussion with @barlop.
share|improve this answer
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://superuser.com/questions/396126/batch-file-for-creating-files-according-to-the-days-in-a-month?answertab=active",
"source_domain": "superuser.com",
"snapshot_id": "crawl=CC-MAIN-2015-48",
"warc_metadata": {
"Content-Length": "84020",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UVJSP3WWHXB4OGP6ZPR4HHRLOJM2J3AI",
"WARC-Concurrent-To": "<urn:uuid:d45d794d-7f6c-4b55-91d0-7a4692870524>",
"WARC-Date": "2015-11-26T00:37:17Z",
"WARC-IP-Address": "104.16.125.192",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:NWZKXYYYT7B5MUACFIT2TM64Q2MHB7MF",
"WARC-Record-ID": "<urn:uuid:0eb179ee-a96a-4e3b-94ed-af2f958c95e2>",
"WARC-Target-URI": "http://superuser.com/questions/396126/batch-file-for-creating-files-according-to-the-days-in-a-month?answertab=active",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a848064a-2ed4-4587-8a83-14ddc5a676e7>"
},
"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,
135,
136,
143,
144,
265,
266,
965,
966,
968,
969,
993,
994,
1106,
1107,
1209,
1210,
1223,
1236,
1249,
1253,
1266,
1267,
1283,
1284,
1285,
1357,
1358,
1416,
1428,
1442,
1455,
1473,
1475,
1476,
1529,
1557,
1562,
1802,
1807,
1981,
1986,
2092,
2097,
2223,
2228,
2459,
2460,
2472,
2473,
2521,
2522,
2560,
2561,
2684,
2685,
2728,
2754,
2764,
2803,
2804,
2859,
2873,
2887,
2901,
2902,
2904,
2905,
2927,
2947,
2968,
3002,
3011,
3030,
3031,
3037,
3038,
3060,
3061,
3275,
3276,
3291,
3292,
3320,
3321,
3389,
3390,
3416,
3417,
3429,
3430,
3432,
3440,
3441,
3519,
3520
],
"line_end_idx": [
10,
135,
136,
143,
144,
265,
266,
965,
966,
968,
969,
993,
994,
1106,
1107,
1209,
1210,
1223,
1236,
1249,
1253,
1266,
1267,
1283,
1284,
1285,
1357,
1358,
1416,
1428,
1442,
1455,
1473,
1475,
1476,
1529,
1557,
1562,
1802,
1807,
1981,
1986,
2092,
2097,
2223,
2228,
2459,
2460,
2472,
2473,
2521,
2522,
2560,
2561,
2684,
2685,
2728,
2754,
2764,
2803,
2804,
2859,
2873,
2887,
2901,
2902,
2904,
2905,
2927,
2947,
2968,
3002,
3011,
3030,
3031,
3037,
3038,
3060,
3061,
3275,
3276,
3291,
3292,
3320,
3321,
3389,
3390,
3416,
3417,
3429,
3430,
3432,
3440,
3441,
3519,
3520,
3610
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3610,
"ccnet_original_nlines": 96,
"rps_doc_curly_bracket": 0.0005540199927054346,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28776979446411133,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03597122058272362,
"rps_doc_frac_lines_end_with_ellipsis": 0.010309279896318913,
"rps_doc_frac_no_alph_words": 0.34224048256874084,
"rps_doc_frac_unique_words": 0.43525180220603943,
"rps_doc_mean_word_length": 4.7104315757751465,
"rps_doc_num_sentences": 50,
"rps_doc_symbol_to_word_ratio": 0.0010277499677613378,
"rps_doc_unigram_entropy": 5.010347843170166,
"rps_doc_word_count": 556,
"rps_doc_frac_chars_dupe_10grams": 0.1699121743440628,
"rps_doc_frac_chars_dupe_5grams": 0.24856816232204437,
"rps_doc_frac_chars_dupe_6grams": 0.21305842697620392,
"rps_doc_frac_chars_dupe_7grams": 0.20160366594791412,
"rps_doc_frac_chars_dupe_8grams": 0.1699121743440628,
"rps_doc_frac_chars_dupe_9grams": 0.1699121743440628,
"rps_doc_frac_chars_top_2gram": 0.0645284503698349,
"rps_doc_frac_chars_top_3gram": 0.015273000113666058,
"rps_doc_frac_chars_top_4gram": 0.05498281866312027,
"rps_doc_books_importance": -363.5497741699219,
"rps_doc_books_importance_length_correction": -363.5497741699219,
"rps_doc_openwebtext_importance": -203.40577697753906,
"rps_doc_openwebtext_importance_length_correction": -203.40577697753906,
"rps_doc_wikipedia_importance": -104.71663665771484,
"rps_doc_wikipedia_importance_length_correction": -104.71663665771484
},
"fasttext": {
"dclm": 0.034607648849487305,
"english": 0.8065574169158936,
"fineweb_edu_approx": 1.4335713386535645,
"eai_general_math": 0.0012561699841171503,
"eai_open_web_math": 0.2619207501411438,
"eai_web_code": 0.00006366000161506236
}
}
|
{
"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.656",
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,034,955,663,110,922,500 |
Tell me more ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.
I'd seen some ancient code that simplifed Unix paths for comparison by doing something like the following pseudocode:
• strip off the last path component to get a directory only part: /foo/bar -> /foo
• getcwd and remember original path
• chdir /foo
• getcwd and remember to return to caller
• chdir old original path
Is there a standard Unix system function that does all this without the thread unsafe current directory manipulation?
A mutex could make that code sequence less thread unsafe, but isn't really ideal (you'd have to know that all other code using getcwd or other functions dependent on the process cwd including system and vendor code protects with this same mutex).
share|improve this question
add comment
4 Answers
up vote 2 down vote accepted
What about realpath(3)?
Since it returns its result in a buffer you supply, thread-safety should not be an issue.
share|improve this answer
cool, didn't know about this library function – eruciform Jul 22 '10 at 16:57
I once knew about realpath() and had forgotten it. The reason that it is not useful (and thus not memorable) is that it too is also not threadsafe on some platforms (basically using the busted chdir'ing mechanism described). – Peeter Joot Jul 22 '10 at 17:47
Hmm. I do see a call to that function now in our code. Maybe it is now thread safe on all the platforms we care about (this was definitely not the case a few years ago, but I don't remember the specifics). – Peeter Joot Jul 22 '10 at 17:55
add comment
Try realpath() or canonicalize_file_name()
If your system supports it (and it probably does), I suggest calling realpath(pathname, NULL); this will malloc the buffer for the canonicalized filename and pass it back as the return value. You'd have to be sure to free() the pointer. The alternative, passing in an output buffer, runs the risk of buffer overruns.
canonicalize_file_name() is a Gnu extension that is equivalent to realpath(pathname, NULL).
share|improve this answer
1
Note that passing in an output buffer only runs the risk of buffer overruns on systems where PATH_MAX is either too large to malloc() or completely unbounded. – caf Jul 23 '10 at 0:59
add comment
There is no "canonical" path in a Unix directory. It may be possible for a file/directory to have multiple hard links/mount points.
The closest thing to the identity of a file/directory is its inode.
share|improve this answer
add comment
Oh dear, doing the action you mention couldn't possibly be thread safe, because it actually chdir's, which is going to confuse any other threads. I'll have to look up the string-manipulation portion of what you want, but it can't possibly also strip softlinks or do anything else that requires asking the operating system for file information without being a little thread-unsafe.
Related posts:
Try this to convert relative file paths, then compare them as strings:
#include<stdio.h>
#include<dirent.h>
#include<fcntl.h>
#include<sys/param.h>
int main( int argc, char **argv )
{
char buffer[MAXPATHLEN+1];
if( argc <= 1 ) return 0;
DIR*d = opendir( argv[1] );
if( !d ) return 0;
int dfd = dirfd(d);
if( !dfd ) return 0;
int result = fcntl( dfd, F_GETPATH, buffer );
if( result == -1 ) return 0;
fprintf( stdout, "path='%s'\n", buffer );
return 0;
}
share|improve this answer
I know it is not thread safe. If such a function exists I'm sure it would have to be a system call that can do the lookup in a more direct sane way. – Peeter Joot Jul 22 '10 at 16:39
looks like someone else posted a shortcut for this, but i suspect it does this under the hood :-) – eruciform Jul 22 '10 at 16:57
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/3311138/thread-safe-path-comparison-or-canonicalization-function-for-unix",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "63657",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TYGYYIORZLNAB4OV4J6HS76XQTLBCJ3X",
"WARC-Concurrent-To": "<urn:uuid:78e64d7f-6e99-4d45-9075-06e2aab78fc5>",
"WARC-Date": "2013-12-09T15:14:50Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:23I43U6UQHMZDXUKKYJXIHM7ZEQCAHGH",
"WARC-Record-ID": "<urn:uuid:222cc5e9-df0a-4baf-afb8-849ae659bf2a>",
"WARC-Target-URI": "http://stackoverflow.com/questions/3311138/thread-safe-path-comparison-or-canonicalization-function-for-unix",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8771f77e-4ec5-4fde-a5b9-482596f588b4>"
},
"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,
15,
147,
148,
266,
267,
352,
390,
405,
449,
477,
478,
596,
597,
844,
845,
873,
885,
886,
896,
897,
926,
927,
951,
952,
1042,
1043,
1069,
1071,
1150,
1152,
1412,
1414,
1655,
1667,
1668,
1711,
1712,
2029,
2030,
2122,
2123,
2149,
2153,
2338,
2350,
2351,
2483,
2484,
2552,
2553,
2579,
2591,
2592,
2973,
2974,
2989,
2990,
3061,
3062,
3080,
3099,
3117,
3139,
3173,
3175,
3204,
3232,
3262,
3283,
3305,
3328,
3376,
3407,
3451,
3463,
3465,
3491,
3493,
3677,
3679,
3810,
3822,
3823,
3835,
3836,
3838,
3846,
3847,
3925,
3926
],
"line_end_idx": [
15,
147,
148,
266,
267,
352,
390,
405,
449,
477,
478,
596,
597,
844,
845,
873,
885,
886,
896,
897,
926,
927,
951,
952,
1042,
1043,
1069,
1071,
1150,
1152,
1412,
1414,
1655,
1667,
1668,
1711,
1712,
2029,
2030,
2122,
2123,
2149,
2153,
2338,
2350,
2351,
2483,
2484,
2552,
2553,
2579,
2591,
2592,
2973,
2974,
2989,
2990,
3061,
3062,
3080,
3099,
3117,
3139,
3173,
3175,
3204,
3232,
3262,
3283,
3305,
3328,
3376,
3407,
3451,
3463,
3465,
3491,
3493,
3677,
3679,
3810,
3822,
3823,
3835,
3836,
3838,
3846,
3847,
3925,
3926,
4016
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4016,
"ccnet_original_nlines": 90,
"rps_doc_curly_bracket": 0.000498010020237416,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3567383885383606,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01698753982782364,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25368061661720276,
"rps_doc_frac_unique_words": 0.48632219433784485,
"rps_doc_mean_word_length": 4.6489362716674805,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0.004530009813606739,
"rps_doc_unigram_entropy": 5.351342678070068,
"rps_doc_word_count": 658,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08107224851846695,
"rps_doc_frac_chars_dupe_6grams": 0.052304670214653015,
"rps_doc_frac_chars_dupe_7grams": 0.034651849418878555,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.007845699787139893,
"rps_doc_frac_chars_top_3gram": 0.011441649869084358,
"rps_doc_frac_chars_top_4gram": 0.014710689894855022,
"rps_doc_books_importance": -336.26904296875,
"rps_doc_books_importance_length_correction": -336.26904296875,
"rps_doc_openwebtext_importance": -200.837890625,
"rps_doc_openwebtext_importance_length_correction": -200.837890625,
"rps_doc_wikipedia_importance": -161.0579376220703,
"rps_doc_wikipedia_importance_length_correction": -161.0579376220703
},
"fasttext": {
"dclm": 0.1263183355331421,
"english": 0.8991290330886841,
"fineweb_edu_approx": 1.6249055862426758,
"eai_general_math": 0.031715329736471176,
"eai_open_web_math": 0.3079158067703247,
"eai_web_code": 0.0028936900198459625
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.455",
"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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,651,861,017,475,699,000 |
294
How can I display lineendings (CR,LF) in Visual Studio Code (not in Visual Studio)?
At the moment there is only the little statusbar menu which display/change the line ending if the actual file. But sometimes it would be great to see the line endings directly in every line especially when there are mixed line endings (not good, but this happens from time to time).
I use the following settings, but none of them show the line endings.
"editor.renderWhitespace": true,
"editor.renderControlCharacters": true,
"editor.renderIndentGuides": true
Is there a setting for lineendings?
I've opened a issue on GitHub: Possibility to display line endings in text area #12223
Soham Kamani made an extensions for this: code-eol
5
• 24
I've made an extensions for this in case you still need it : marketplace.visualstudio.com/… Feb 17 '18 at 11:47
• @SohamKamani Your comment should be the accepted answer to the question. Jul 11 '18 at 9:40
• That extension is useless: it doesn't actually display whether characters are carriage returns or line feeds, it just makes glyphs at the end of the lines which match what vscode says the file is. It doesn't help pinpoint files with mixed end-of-line styles. (That or vscode is automatically normalizing the files' EOLs, thus making any extension to this effect useless.)
– Tustin2121
Oct 26 '18 at 16:32
• 3
This has changed: "editor.renderWhitespace": true, true is not accepted anymore.
– Timo
Jan 1 '21 at 15:43
• 1
For "editor.renderWhitespace" valid values: "none", "boundary", "selection", "trailing", "all" as string.
– mdiiorio
Feb 1 '21 at 8:03
419
AFAIK there is no way to visually see line endings in the editor space, but in the bottom-right corner of the window there is an indicator that says "CLRF" or "LF" which will let you set the line endings for a particular file. Clicking on the text will allow you to change the line endings as well.
enter image description here
8
• 28
Can you change the default value for this? Right now every time I open a File I have to manually click on this. Oct 26 '16 at 11:31
• 23
@DavidMartinez Yes. In user or workspace settings: // The default end of line character. "files.eol": "\r\n",
– Llewey
Oct 26 '16 at 13:43
• 5
@Llewey But this is a global change right? Can I set it somehow only for .sh files ? Jun 7 '18 at 8:24
• @KostasDemiris I haven't tested this but you could try doing "[sh]": { "files.eol": "\n" }. Not all settings can be set for a specific language and I'm not sure if this is one that can but it's worth a try. Jun 18 '20 at 17:26
• 8
Doesn't answer question, which is about displaying the line endings
– G Huxley
Aug 10 '20 at 2:12
124
If you want to set it to LF as default, you can paste this line in your editor settings (F1 menu; > Preferences: Open Settings (JSON))
"files.eol": "\n"
Example:
{
"git.confirmSync": false,
"window.zoomLevel": -1,
"workbench.activityBar.visible": true,
"editor.wordWrap": true,
"workbench.iconTheme": "vscode-icons",
"window.menuBarVisibility": "default",
"vsicons.projectDetection.autoReload": true,
"files.eol": "\n"
}
Please note that this will change the default line ending for new files only. This will not edit your files.
10
• 23
I've done this, but every time I open a file it still opens with CRLF and I have to manually change it.
– pixelwiz
Aug 14 '17 at 18:02
• 1
@pixelwiz if you save the file does it change to LF? github.com/Microsoft/vscode/issues/26626 github.com/Microsoft/vscode/issues/2957 I changed to mac, so I do not have this issue anymore when developing on my own projects. So I cant verify, sorry. Sep 8 '17 at 17:12
• 9
Same for me on Windows - setting files.eol user settings to "\n" but files are still reported as CLRF
– Marko
Nov 29 '17 at 8:54
• 2
I've just tested this successfully with Win 10 and VS Code 1.20.1. New file got created with LF line break!
– iaforek
Mar 5 '18 at 10:42
• 1
On creating new files, they VSCode opens with LF settings. But same as @pixelwiz and for when I open existing files from a project. Ideas how to open existing files with LF as well?
– ZenVentzi
Mar 7 '20 at 19:24
29
Render Line Endings is a Visual Studio Code extension that is still actively maintained (as of September 2021):
https://marketplace.visualstudio.com/items?itemName=medo64.render-crlf
https://github.com/medo64/render-crlf/
It can be configured like this:
{
"editor.renderWhitespace": "all",
"code-eol.newlineCharacter": "¬",
"code-eol.returnCharacter" : "¤",
"code-eol.crlfCharacter" : "¤¬",
}
and looks like this:
Enter image description here
1
• What is it supposed to do? Can you add it to your answer (but without "Edit:", "Update:", or similar - the answer should appear as if it was written today). )? What is it that "renders"? May 17 '21 at 16:32
22
You can install an extension to show line endings.
There are several available at the VS Marketplace.
Or if their search moves, try this relevant Google search
In the original answer, I had provided a link to a specific extension by Johnny Härtell After two years, this extension and the author are mysteriously missing from the VS Marketplace.
To provide a better experience and hopefully future proof this answer, I've updated it with search results that should keep us pretty close to a relevant extension.
7
• 4
At present, this extension doesn't do what it purports to. In a file of mixed line endings, it shows line endings as if they were all consistent, based on what VS Code claims the file is following. Jun 17 '19 at 12:40
• @AndrewArnott thanks for the update, we'll have to watch the issue you've submitted... github.com/jhartell/vscode-line-endings/issues/1
– Shanimal
Jun 17 '19 at 19:23
• @AndrewArnott could you tell why it does not work for you?, for me it works perfect, just the icons are small Jul 9 '19 at 5:21
• @JohnBalvinArias The issue I filed that Shanimal linked to describes the problem: It doesn't actually reveal mixed line endings. It always shows them as if they were consistently whatever VS Code's preference is set to. Jul 10 '19 at 12:49
• 5
@AndrewArnott This is because VSCode itself does not support mixed line endings. github.com/Microsoft/vscode/issues/127
– Chev
Jul 31 '19 at 19:27
1
Another way to set the default end of line value in Visual Studio Code:
1. Navigate to the Visual Studio Code settings tab (e.g., by Ctrl + , (comma))
2. Search for end of line in the search bar
3. Set the desired value in the Files: Eol dropdown menu
Screenshot:
Enter image description here
1
• 2
The question was how to display the current line ending, not how to change it. May 17 '21 at 16:35
0
Having the opposite problem? How to hide line endings:
Oddly I have the opposite problem! I just ended up with the following highlighting of each newline - which I've never seen before. In all open files and without a selection. Assumed I'd hit a shortcut by mistake, which is how I ended up on this question. Given that the feature doesn't seem to actually exist I resorted to closing and reopening and they went away!
enter image description here
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/39525417/visual-studio-code-how-to-show-line-endings",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "220796",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5XS66HK2CPXIYCIEDVWVCQW6RIKMDAM7",
"WARC-Concurrent-To": "<urn:uuid:b5ca36ca-3e54-4c1b-9817-2827b4f4a9b6>",
"WARC-Date": "2022-01-16T11:43:23Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DT5WLGV2KUNVEYABSHSW7JXWNKG5CU3T",
"WARC-Record-ID": "<urn:uuid:0c4ad8e0-74bb-4f72-b1ba-8def8789720c>",
"WARC-Target-URI": "https://stackoverflow.com/questions/39525417/visual-studio-code-how-to-show-line-endings",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6cecdbae-0913-47e3-9f7a-1141f97b8362>"
},
"warc_info": "isPartOf: CC-MAIN-2022-05\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-21\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,
4,
5,
89,
90,
373,
374,
444,
445,
478,
518,
552,
553,
589,
590,
591,
678,
679,
730,
731,
733,
740,
856,
952,
1328,
1345,
1369,
1375,
1460,
1471,
1494,
1500,
1610,
1625,
1647,
1651,
1652,
1951,
1952,
1981,
1982,
1984,
1991,
2127,
2134,
2248,
2261,
2285,
2291,
2398,
2629,
2635,
2707,
2722,
2745,
2749,
2750,
2885,
2886,
2904,
2905,
2914,
2915,
2917,
2947,
2975,
3018,
3047,
3090,
3133,
3182,
3204,
3206,
3207,
3316,
3317,
3320,
3327,
3435,
3450,
3474,
3480,
3752,
3758,
3864,
3876,
3899,
3905,
4017,
4031,
4054,
4060,
4246,
4262,
4285,
4288,
4289,
4401,
4402,
4473,
4474,
4513,
4514,
4546,
4547,
4549,
4587,
4625,
4663,
4702,
4704,
4705,
4726,
4727,
4756,
4757,
4759,
4970,
4973,
4974,
5025,
5026,
5077,
5078,
5136,
5137,
5138,
5323,
5324,
5489,
5490,
5492,
5498,
5720,
5860,
5875,
5899,
6031,
6275,
6281,
6405,
6416,
6440,
6442,
6443,
6515,
6516,
6597,
6643,
6702,
6703,
6715,
6716,
6745,
6746,
6748,
6754,
6857,
6859,
6860,
6915,
6916,
7281,
7282,
7311,
7312,
7324,
7325,
7425,
7426
],
"line_end_idx": [
4,
5,
89,
90,
373,
374,
444,
445,
478,
518,
552,
553,
589,
590,
591,
678,
679,
730,
731,
733,
740,
856,
952,
1328,
1345,
1369,
1375,
1460,
1471,
1494,
1500,
1610,
1625,
1647,
1651,
1652,
1951,
1952,
1981,
1982,
1984,
1991,
2127,
2134,
2248,
2261,
2285,
2291,
2398,
2629,
2635,
2707,
2722,
2745,
2749,
2750,
2885,
2886,
2904,
2905,
2914,
2915,
2917,
2947,
2975,
3018,
3047,
3090,
3133,
3182,
3204,
3206,
3207,
3316,
3317,
3320,
3327,
3435,
3450,
3474,
3480,
3752,
3758,
3864,
3876,
3899,
3905,
4017,
4031,
4054,
4060,
4246,
4262,
4285,
4288,
4289,
4401,
4402,
4473,
4474,
4513,
4514,
4546,
4547,
4549,
4587,
4625,
4663,
4702,
4704,
4705,
4726,
4727,
4756,
4757,
4759,
4970,
4973,
4974,
5025,
5026,
5077,
5078,
5136,
5137,
5138,
5323,
5324,
5489,
5490,
5492,
5498,
5720,
5860,
5875,
5899,
6031,
6275,
6281,
6405,
6416,
6440,
6442,
6443,
6515,
6516,
6597,
6643,
6702,
6703,
6715,
6716,
6745,
6746,
6748,
6754,
6857,
6859,
6860,
6915,
6916,
7281,
7282,
7311,
7312,
7324,
7325,
7425,
7426,
7516
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7516,
"ccnet_original_nlines": 169,
"rps_doc_curly_bracket": 0.0007983000250533223,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.30985915660858154,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.026995310559868813,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.31396713852882385,
"rps_doc_frac_unique_words": 0.3806398808956146,
"rps_doc_mean_word_length": 4.557834148406982,
"rps_doc_num_sentences": 97,
"rps_doc_symbol_to_word_ratio": 0.0017605599714443088,
"rps_doc_unigram_entropy": 5.516018867492676,
"rps_doc_word_count": 1219,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03167746961116791,
"rps_doc_frac_chars_dupe_6grams": 0.016558680683374405,
"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.029697619378566742,
"rps_doc_frac_chars_top_3gram": 0.012598990462720394,
"rps_doc_frac_chars_top_4gram": 0.017998559400439262,
"rps_doc_books_importance": -718.5305786132812,
"rps_doc_books_importance_length_correction": -718.5305786132812,
"rps_doc_openwebtext_importance": -410.9668273925781,
"rps_doc_openwebtext_importance_length_correction": -410.9668273925781,
"rps_doc_wikipedia_importance": -348.81109619140625,
"rps_doc_wikipedia_importance_length_correction": -348.81109619140625
},
"fasttext": {
"dclm": 0.0221556406468153,
"english": 0.9007531404495239,
"fineweb_edu_approx": 1.2328736782073975,
"eai_general_math": 0.6648037433624268,
"eai_open_web_math": 0.3274424076080322,
"eai_web_code": 0.03083723969757557
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.435",
"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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,032,962,863,539,972,000 |
Java Top
I just announced the new Spring Boot 2 material, coming in REST With Spring:
>> CHECK OUT THE COURSE
1. Introduction
In this tutorial, we’re going to take an in-depth look at the Process API.
For a shallower look into how to use Process to execute a shell command, we can refer to our previous tutorial here.
The process that it refers to is an executing application. The Process class provides methods for interacting with these processes including extracting output, performing input, monitoring the lifecycle, checking the exit status, and destroying (killing) it.
2. Using Process Class For Compiling and Running Java Program
Let’s see an example to compile and run another Java program with the help of Process API:
@Test
public void whenExecutedFromAnotherProgram_thenSourceProgramOutput3() throws IOException {
Process process = Runtime.getRuntime()
.exec("javac -cp src src\\main\\java\\com\\baeldung\\java9\\process\\OutputStreamExample.java");
process = Runtime.getRuntime()
.exec("java -cp src/main/java com.baeldung.java9.process.OutputStreamExample");
BufferedReader output = new BufferedReader(new InputStreamReader(process.getInputStream()));
int value = Integer.parseInt(output.readLine());
assertEquals(3, value);
}
Thus, the applications of executing Java code within an existing Java code is virtually limitless.
3. Creating Process
Our Java application can call upon any application which is running within our computer system subjective to Operating System restrictions.
Therefore we can execute applications. Let’s see what the different use cases we can run by utilizing the Process API are.
The ProcessBuilder class allows us to create subprocesses within our application.
Let’s see a demo of opening Windows-based Notepad application:
ProcessBuilder builder = new ProcessBuilder("notepad.exe");
Process process = builder.start();
4. Destroying Process
Process also provides us with methods to destroy sub-processes or process. Although, how the application is killed is platform-dependent.
Let’s see different use cases by which are possible.
4.1. Destroying a Process by Reference
Let’s say we’re using Windows OS and want to spawn the Notepad application and destroy it.
As before, we can create an instance of Notepad application by using the ProcessBuilder class and the start() method.
Then we can call the destroy() method on our Process object.
4.2. Destroying a Process by ID
We can also kill processes which are running within our Operating System that might not be created by our application.
Caution should be advised while doing this, as we can unknowingly destroy a critical process which might make the operating system unstable.
We first need to find out the process ID of the current running process by checking the task manager and find out the pid.
Let’s see an example:
Optional<ProcessHandle> optionalProcessHandle = ProcessHandle.of(5232);
optionalProcessHandle.ifPresent(processHandle -> processHandle.destroy());
4.3. Destroying a Process by Force
On the execution of the destroy() method, the subprocess will get killed as we saw earlier in the article.
In the case when destroy() doesn’t work, we have the option of destroyForcibly().
We should always start with destroy() method first. After that, we can perform a quick check on the sub-process whether by executing isAlive().
If it returns true then execute destroyForcibly():
ProcessBuilder builder = new ProcessBuilder("notepad.exe");
Process process = builder.start();
process.destroy();
if (process.isAlive()) {
process.destroyForcibly();
}
5. Waiting for a Process to Complete
We also have two overloaded methods, through which we can ensure we can wait for completion of a process.
5.1. waitfor()
When this method is executed, then it will place the current execution process thread in a blocking-wait state unless the sub-process gets terminated.
Let’s take a look at the example:
ProcessBuilder builder = new ProcessBuilder("notepad.exe");
Process process = builder.start();
assertThat(process.waitFor() >= 0);
We can see from the above example for the current thread to continue execution it will keep on waiting for the subprocess thread to end. Once the subprocess ends, the current thread will continue its execution.
5.2. waitfor(long timeOut, TimeUnit time)
When this method is executed, then it will place the current execution process thread in the blocking-wait state unless the sub-process gets terminated or runs out of time.
Let’s take a look at the example:
ProcessBuilder builder = new ProcessBuilder("notepad.exe");
Process process = builder.start();
assertFalse(process.waitFor(1, TimeUnit.SECONDS));
We can see from the above example for the current thread to continue execution it will keep on waiting for the subprocess thread to end or if the specified time interval has elapsed.
When this method is executed, then it will return a boolean value of true if the subprocess has exited or a boolean value false if the wait time had elapsed before the subprocess exited.
6. exitValue()
When this method is run then the current thread won’t wait for the sub-process to get terminated or destroyed, however, it will throw an IllegalThreadStateException if the subprocess isn’t terminated.
Another way around if the subprocess has been successfully terminated then it will result in an exit value of the process.
It can be any possible positive integer number.
Let’s look at an example when the exitValue() method returns a positive integer when the subprocess has been terminated successfully:
@Test
public void
givenSubProcess_whenCurrentThreadWillNotWaitIndefinitelyforSubProcessToEnd_thenProcessExitValueReturnsGrt0()
throws IOException {
ProcessBuilder builder = new ProcessBuilder("notepad.exe");
Process process = builder.start();
assertThat(process.exitValue() >= 0);
}
7. isAlive()
When we’d like to perform business processing which is subjective whether the process is alive or not.
We can perform a quick check to find whether the process is alive or not which returns a boolean value.
Let’s see a quick example of it:
ProcessBuilder builder = new ProcessBuilder("notepad.exe");
Process process = builder.start();
Thread.sleep(10000);
process.destroy();
assertTrue(process.isAlive());
8. Handling Process Streams
By default, the created subprocess does not have its terminal or console. All its standard I/O (i.e., stdin, stdout, stderr) operations will be sent to the parent process. Thereby the parent process can use these streams to feed input to and get output from the subprocess.
Consequently, this gives us a huge amount of flexibility as it gives us control over the input/output of our sub-process.
8.1. getErrorStream()
Interestingly we can fetch the errors generated from the subprocess and thereon perform business processing.
After that, we can execute specific business processing checks based on our requirements.
Let’s see an example:
@Test
public void givenSubProcess_whenEncounterError_thenErrorStreamNotNull() throws IOException {
Process process = Runtime.getRuntime().exec(
"javac -cp src src\\main\\java\\com\\baeldung\\java9\\process\\ProcessCompilationError.java");
BufferedReader error = new BufferedReader(new InputStreamReader(process.getErrorStream()));
String errorString = error.readLine();
assertNotNull(errorString);
}
8.2. getInputStream()
We can also fetch the output generated by a subprocess and consume within the parent process thus allowing share information between the processes:
@Test
public void givenSourceProgram_whenReadingInputStream_thenFirstLineEquals3() throws IOException {
Process process = Runtime.getRuntime().exec(
"javac -cp src src\\main\\java\\com\\baeldung\\java9\\process\\OutputStreamExample.java");
process = Runtime.getRuntime()
.exec("java -cp src/main/java com.baeldung.java9.process.OutputStreamExample");
BufferedReader output = new BufferedReader(new InputStreamReader(process.getInputStream()));
int value = Integer.parseInt(output.readLine());
assertEquals(3, value);
}
8.3. getOutputStream()
We can send input to a subprocess from a parent process:
Writer w = new OutputStreamWriter(process.getOutputStream(), "UTF-8");
w.write("send to child\n");
8.4. Filter Process Streams
It’s a perfectly valid use-case to interact with selective running processes.
Process provides us the facility to selectively filter running processes based on a certain predicate.
After that we can perform business operations on this selective process set:
@Test
public void givenRunningProcesses_whenFilterOnProcessIdRange_thenGetSelectedProcessPid() {
assertThat(((int) ProcessHandle.allProcesses()
.filter(ph -> (ph.pid() > 10000 && ph.pid() < 50000))
.count()) > 0);
}
9. Conclusion
Process is a powerful class for Operating System level interaction. Triggering terminal commands as well as launching, monitoring and killing applications.
For more reading on the Java 9 Process API, take a look at our article here.
As always, you’ll find the sources over on Github.
Java bottom
I just announced the new Spring Boot 2 material, coming in REST With Spring:
>> CHECK OUT THE LESSONS
|
{
"url": "https://www.baeldung.com/java-process-api",
"source_domain": "www.baeldung.com",
"snapshot_id": "crawl=CC-MAIN-2019-04",
"warc_metadata": {
"Content-Length": "57511",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NIRR55XYIA3JUGSAGOGMHEIZ5BDLEEXZ",
"WARC-Concurrent-To": "<urn:uuid:d910b8e0-88a1-45c8-b617-22b9e6671082>",
"WARC-Date": "2019-01-18T12:54:27Z",
"WARC-IP-Address": "104.27.137.56",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:S4UFWLXD354RBH742H55DV6EMM755X36",
"WARC-Record-ID": "<urn:uuid:17416746-9750-4ca7-88e7-7289034702ec>",
"WARC-Target-URI": "https://www.baeldung.com/java-process-api",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:05b841eb-84ae-4b1a-9a4b-bbc4f3cce916>"
},
"warc_info": "isPartOf: CC-MAIN-2019-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-146-180-207.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,
9,
10,
87,
88,
112,
113,
129,
130,
205,
206,
323,
324,
583,
584,
646,
647,
738,
739,
745,
836,
838,
881,
984,
1020,
1106,
1203,
1256,
1258,
1286,
1288,
1289,
1388,
1389,
1409,
1410,
1550,
1551,
1674,
1675,
1757,
1758,
1821,
1822,
1882,
1917,
1918,
1940,
1941,
2079,
2080,
2133,
2134,
2173,
2174,
2265,
2266,
2384,
2385,
2446,
2447,
2479,
2480,
2599,
2600,
2741,
2742,
2865,
2866,
2888,
2889,
2961,
3036,
3037,
3072,
3073,
3180,
3181,
3263,
3264,
3408,
3409,
3460,
3461,
3521,
3556,
3575,
3600,
3631,
3633,
3634,
3671,
3672,
3778,
3779,
3794,
3795,
3946,
3947,
3981,
3982,
4042,
4077,
4113,
4114,
4325,
4326,
4368,
4369,
4542,
4543,
4577,
4578,
4638,
4673,
4724,
4725,
4908,
4909,
5096,
5097,
5112,
5113,
5314,
5315,
5438,
5439,
5487,
5488,
5622,
5623,
5629,
5642,
5754,
5777,
5841,
5880,
5922,
5924,
5925,
5938,
5939,
6042,
6043,
6147,
6148,
6181,
6182,
6242,
6277,
6298,
6317,
6348,
6349,
6377,
6378,
6652,
6653,
6775,
6776,
6798,
6799,
6908,
6909,
6999,
7000,
7022,
7023,
7029,
7122,
7171,
7272,
7368,
7411,
7443,
7445,
7446,
7468,
7469,
7617,
7618,
7624,
7722,
7771,
7868,
7903,
7990,
8087,
8140,
8142,
8170,
8172,
8173,
8196,
8197,
8254,
8255,
8326,
8354,
8355,
8383,
8384,
8462,
8463,
8566,
8567,
8644,
8645,
8651,
8742,
8793,
8853,
8875,
8877,
8878,
8892,
8893,
9049,
9050,
9127,
9128,
9179,
9180,
9192,
9193,
9270,
9271
],
"line_end_idx": [
9,
10,
87,
88,
112,
113,
129,
130,
205,
206,
323,
324,
583,
584,
646,
647,
738,
739,
745,
836,
838,
881,
984,
1020,
1106,
1203,
1256,
1258,
1286,
1288,
1289,
1388,
1389,
1409,
1410,
1550,
1551,
1674,
1675,
1757,
1758,
1821,
1822,
1882,
1917,
1918,
1940,
1941,
2079,
2080,
2133,
2134,
2173,
2174,
2265,
2266,
2384,
2385,
2446,
2447,
2479,
2480,
2599,
2600,
2741,
2742,
2865,
2866,
2888,
2889,
2961,
3036,
3037,
3072,
3073,
3180,
3181,
3263,
3264,
3408,
3409,
3460,
3461,
3521,
3556,
3575,
3600,
3631,
3633,
3634,
3671,
3672,
3778,
3779,
3794,
3795,
3946,
3947,
3981,
3982,
4042,
4077,
4113,
4114,
4325,
4326,
4368,
4369,
4542,
4543,
4577,
4578,
4638,
4673,
4724,
4725,
4908,
4909,
5096,
5097,
5112,
5113,
5314,
5315,
5438,
5439,
5487,
5488,
5622,
5623,
5629,
5642,
5754,
5777,
5841,
5880,
5922,
5924,
5925,
5938,
5939,
6042,
6043,
6147,
6148,
6181,
6182,
6242,
6277,
6298,
6317,
6348,
6349,
6377,
6378,
6652,
6653,
6775,
6776,
6798,
6799,
6908,
6909,
6999,
7000,
7022,
7023,
7029,
7122,
7171,
7272,
7368,
7411,
7443,
7445,
7446,
7468,
7469,
7617,
7618,
7624,
7722,
7771,
7868,
7903,
7990,
8087,
8140,
8142,
8170,
8172,
8173,
8196,
8197,
8254,
8255,
8326,
8354,
8355,
8383,
8384,
8462,
8463,
8566,
8567,
8644,
8645,
8651,
8742,
8793,
8853,
8875,
8877,
8878,
8892,
8893,
9049,
9050,
9127,
9128,
9179,
9180,
9192,
9193,
9270,
9271,
9295
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9295,
"ccnet_original_nlines": 226,
"rps_doc_curly_bracket": 0.0012910199584439397,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3101085126399994,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013135350309312344,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26156482100486755,
"rps_doc_frac_unique_words": 0.3356047570705414,
"rps_doc_mean_word_length": 6.207836627960205,
"rps_doc_num_sentences": 137,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.326757431030273,
"rps_doc_word_count": 1174,
"rps_doc_frac_chars_dupe_10grams": 0.17508232593536377,
"rps_doc_frac_chars_dupe_5grams": 0.26879802346229553,
"rps_doc_frac_chars_dupe_6grams": 0.2646816670894623,
"rps_doc_frac_chars_dupe_7grams": 0.25836992263793945,
"rps_doc_frac_chars_dupe_8grams": 0.19607573747634888,
"rps_doc_frac_chars_dupe_9grams": 0.17508232593536377,
"rps_doc_frac_chars_top_2gram": 0.01234907004982233,
"rps_doc_frac_chars_top_3gram": 0.01975850947201252,
"rps_doc_frac_chars_top_4gram": 0.03951701149344444,
"rps_doc_books_importance": -867.708251953125,
"rps_doc_books_importance_length_correction": -867.708251953125,
"rps_doc_openwebtext_importance": -526.5364990234375,
"rps_doc_openwebtext_importance_length_correction": -526.5364990234375,
"rps_doc_wikipedia_importance": -396.6687316894531,
"rps_doc_wikipedia_importance_length_correction": -396.6687316894531
},
"fasttext": {
"dclm": 0.03998411074280739,
"english": 0.773505687713623,
"fineweb_edu_approx": 2.566941976547241,
"eai_general_math": 0.6567005515098572,
"eai_open_web_math": 0.0877830982208252,
"eai_web_code": 0.8721680641174316
}
}
|
{
"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.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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,879,629,964,293,330,000 |
Programming Challenge -PKU- 2686 Traveling by Stagecoach
※上記の広告は60日以上更新のないWIKIに表示されています。更新することで広告が下部へ移動します。
2686 Traveling by Stagecoach
解答例
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
while(true){
int n = sc.nextInt();
int m = sc.nextInt();
int p = sc.nextInt();
int a = sc.nextInt()-1;
int b = sc.nextInt()-1;
if(n==0 && m==0 && p==0) break;
int[] t = new int[n];
for(int i=0;i<n;i++) t[i] = sc.nextInt();
double[][] path = new double[m][m];
for(int i=0;i<m;i++) Arrays.fill(path[i], Double.MAX_VALUE);
for(int i=0;i<p;i++){
int x = sc.nextInt()-1;
int y = sc.nextInt()-1;
double z = sc.nextDouble();
path[x][y] = z;
path[y][x] = z;
}
Solver sol = new Solver(n, m, a, b, t, path);
double ans = sol.solve();
if(ans==Double.MAX_VALUE) System.out.println("Impossible");
else System.out.printf("%.3f\r\n", sol.solve());
}
}
}
class Solver{
int n;
int m;
int a;
int b;
int[] t;
double[][] path;
public Solver(int n, int m, int a, int b, int[] t, double[][] path) {
this.n = n;
this.m = m;
this.a = a;
this.b = b;
this.t = t;
this.path = path;
}
public double solve(){
boolean searched[][] = new boolean[m][1<<n];
double x[][] = new double[m][1<<n];
for(int i=0;i<m;i++) Arrays.fill(searched[i], false);
for(int i=0;i<m;i++) Arrays.fill(x[i], Double.MAX_VALUE);
x[a][(1<<n)-1] = 0;
PriorityQueue<State> q = new PriorityQueue<State>();
q.add(new State(a, (1<<n)-1, 0.0));
while(!q.isEmpty()){
State s = q.poll();
if(searched[s.city][s.ticketcode]) continue;
searched[s.city][s.ticketcode] = true;
// end
if(s.city==b){
return s.x;
}
// next
TICKET: for(int i=0;i<n;i++){
if(!hasTicket(s.ticketcode, i)) continue TICKET;
int newcode = useTicket(s.ticketcode, i);
CITY: for(int j=0;j<m;j++){
if(path[s.city][j]==Double.MAX_VALUE) continue CITY;
if(searched[j][newcode]) continue CITY;
if(s.x + path[s.city][j]/t[i] < x[j][newcode]){
x[j][newcode] = s.x + path[s.city][j]/t[i];
q.add(new State(j, newcode, x[j][newcode]));
}
}
}
}
return Double.MAX_VALUE;
}
private static boolean hasTicket(int ticketcode, int i){
return (ticketcode>>i)%2==1;
}
private int useTicket(int ticketcode, int i){
return ticketcode - (1<<i);
}
}
class State implements Comparable<State>{
int city;
int ticketcode;
double x;
public State(int city, int ticketcode, double x) {
this.city = city;
this.ticketcode = ticketcode;
this.x = x;
}
public int compareTo(State s){
if(x>s.x) return 1;
else if(x<s.x) return -1;
else return 0;
}
}
|
{
"url": "https://www11.atwiki.jp/azounoman/pages/94.html",
"source_domain": "www11.atwiki.jp",
"snapshot_id": "crawl=CC-MAIN-2017-34",
"warc_metadata": {
"Content-Length": "38461",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TY6ZGRTFQ4K26EIOBYL6VZ3WYTT5NMWV",
"WARC-Concurrent-To": "<urn:uuid:343c2b9e-4766-4d9c-988a-0337398d8574>",
"WARC-Date": "2017-08-17T11:37:34Z",
"WARC-IP-Address": "52.85.90.71",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:XRHTDLBJEHEJABZRXDEMLP3W6JH7ZJHY",
"WARC-Record-ID": "<urn:uuid:5f86e680-8102-4384-b97b-2ee1b33844b6>",
"WARC-Target-URI": "https://www11.atwiki.jp/azounoman/pages/94.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9344915c-5608-4b00-be6c-4af1066b5d2a>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-178-20-5.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-34\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for August 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,
57,
58,
109,
110,
139,
140,
144,
145,
165,
166,
186,
231,
276,
297,
331,
365,
399,
435,
471,
515,
549,
603,
651,
724,
758,
798,
838,
882,
914,
946,
960,
973,
1031,
1069,
1141,
1202,
1212,
1218,
1220,
1221,
1235,
1246,
1257,
1268,
1279,
1292,
1313,
1387,
1407,
1427,
1447,
1467,
1487,
1513,
1519,
1554,
1607,
1651,
1660,
1722,
1788,
1816,
1825,
1886,
1930,
1959,
1991,
2048,
2099,
2112,
2131,
2158,
2186,
2200,
2213,
2233,
2275,
2340,
2398,
2442,
2515,
2575,
2576,
2644,
2712,
2805,
2827,
2845,
2859,
2869,
2902,
2908,
2969,
3006,
3012,
3062,
3098,
3104,
3106,
3107,
3149,
3163,
3183,
3197,
3252,
3278,
3316,
3336,
3342,
3377,
3405,
3439,
3462,
3468
],
"line_end_idx": [
57,
58,
109,
110,
139,
140,
144,
145,
165,
166,
186,
231,
276,
297,
331,
365,
399,
435,
471,
515,
549,
603,
651,
724,
758,
798,
838,
882,
914,
946,
960,
973,
1031,
1069,
1141,
1202,
1212,
1218,
1220,
1221,
1235,
1246,
1257,
1268,
1279,
1292,
1313,
1387,
1407,
1427,
1447,
1467,
1487,
1513,
1519,
1554,
1607,
1651,
1660,
1722,
1788,
1816,
1825,
1886,
1930,
1959,
1991,
2048,
2099,
2112,
2131,
2158,
2186,
2200,
2213,
2233,
2275,
2340,
2398,
2442,
2515,
2575,
2576,
2644,
2712,
2805,
2827,
2845,
2859,
2869,
2902,
2908,
2969,
3006,
3012,
3062,
3098,
3104,
3106,
3107,
3149,
3163,
3183,
3197,
3252,
3278,
3316,
3336,
3342,
3377,
3405,
3439,
3462,
3468,
3469
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3469,
"ccnet_original_nlines": 114,
"rps_doc_curly_bracket": 0.009801100008189678,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.22976189851760864,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014285709708929062,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5035714507102966,
"rps_doc_frac_unique_words": 0.4790874421596527,
"rps_doc_mean_word_length": 6.12927770614624,
"rps_doc_num_sentences": 59,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.438089847564697,
"rps_doc_word_count": 263,
"rps_doc_frac_chars_dupe_10grams": 0.03349876031279564,
"rps_doc_frac_chars_dupe_5grams": 0.06327542662620544,
"rps_doc_frac_chars_dupe_6grams": 0.03349876031279564,
"rps_doc_frac_chars_dupe_7grams": 0.03349876031279564,
"rps_doc_frac_chars_dupe_8grams": 0.03349876031279564,
"rps_doc_frac_chars_dupe_9grams": 0.03349876031279564,
"rps_doc_frac_chars_top_2gram": 0.022332509979605675,
"rps_doc_frac_chars_top_3gram": 0.01861041970551014,
"rps_doc_frac_chars_top_4gram": 0.031017370522022247,
"rps_doc_books_importance": -363.9894714355469,
"rps_doc_books_importance_length_correction": -363.9894714355469,
"rps_doc_openwebtext_importance": -164.5186004638672,
"rps_doc_openwebtext_importance_length_correction": -164.5186004638672,
"rps_doc_wikipedia_importance": -137.8986053466797,
"rps_doc_wikipedia_importance_length_correction": -137.8986053466797
},
"fasttext": {
"dclm": 0.9668205380439758,
"english": 0.2944045960903168,
"fineweb_edu_approx": 3.4948019981384277,
"eai_general_math": 0.6497662663459778,
"eai_open_web_math": 0.07280927896499634,
"eai_web_code": 0.8904772996902466
}
}
|
{
"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": "511.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Arithmetic"
}
}
},
"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": "-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": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,450,371,701,219,601,000 |
1
I've noticed that in my CartoDB info windows, if a given column does not have a value for a point, that lack of value shows up as a blank in the hover window, but it shows up as a null in the click window. Is CartoDB set up so that this intentionally happens? Is there a way to change this setting?
Edit: I also am working on a project with over a dozen columns, any of which could potentially be blank at a given time, so to go in and change the HTML for each one of them, although doable, is rather tedious.
2
• 1
This was answered in the following QA: gis.stackexchange.com/questions/151743/… Oct 21 '15 at 0:12
• I had seen that QA before, and it was definitely very helpful to me. It just seemed odd to me that the default was null for the click and blank for the hover, so I wanted to see if there was an answer from that perspective. Thanks!
– H.G.
Oct 21 '15 at 13:36
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Browse other questions tagged or ask your own question.
|
{
"url": "https://gis.stackexchange.com/questions/167050/null-vs-blank-in-click-vs-hover-info-window-in-cartodb?noredirect=1",
"source_domain": "gis.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "127952",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:W2RHWJ7CECYUWQBMUILDSGFUEHSV3SNA",
"WARC-Concurrent-To": "<urn:uuid:7d9ae746-3dfa-48aa-8cdd-84c6e40173bc>",
"WARC-Date": "2021-12-08T18:55:41Z",
"WARC-IP-Address": "151.101.1.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LZZ4NIJCXGFFNL64SEY723SPGAAMWDGG",
"WARC-Record-ID": "<urn:uuid:60be759d-b29d-45de-94ae-a572e924ca77>",
"WARC-Target-URI": "https://gis.stackexchange.com/questions/167050/null-vs-blank-in-click-vs-hover-info-window-in-cartodb?noredirect=1",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:308f5bcf-b94c-48f0-b02e-8e863c30dd78>"
},
"warc_info": "isPartOf: CC-MAIN-2021-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-99\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,
2,
3,
302,
303,
514,
515,
517,
523,
626,
862,
873,
897,
898,
910,
911,
1011,
1012
],
"line_end_idx": [
2,
3,
302,
303,
514,
515,
517,
523,
626,
862,
873,
897,
898,
910,
911,
1011,
1012,
1067
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1067,
"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.4734693765640259,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.036734689027071,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20000000298023224,
"rps_doc_frac_unique_words": 0.610837459564209,
"rps_doc_mean_word_length": 3.990147829055786,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0.004081630147993565,
"rps_doc_unigram_entropy": 4.6043381690979,
"rps_doc_word_count": 203,
"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.018518520519137383,
"rps_doc_frac_chars_top_3gram": 0.02222222089767456,
"rps_doc_frac_chars_top_4gram": 0.02469136007130146,
"rps_doc_books_importance": -100.43781280517578,
"rps_doc_books_importance_length_correction": -100.43781280517578,
"rps_doc_openwebtext_importance": -48.440093994140625,
"rps_doc_openwebtext_importance_length_correction": -36.84514617919922,
"rps_doc_wikipedia_importance": -34.52248001098633,
"rps_doc_wikipedia_importance_length_correction": -34.52248001098633
},
"fasttext": {
"dclm": 0.06962853670120239,
"english": 0.966831386089325,
"fineweb_edu_approx": 1.263569951057434,
"eai_general_math": 0.01740754023194313,
"eai_open_web_math": 0.3979946970939636,
"eai_web_code": 0.000011799999811046291
}
}
|
{
"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.028",
"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": "-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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,904,127,797,904,824,000 |
source: rtems/cpukit/libmisc/monitor/mon-prmisc.c @ d063e7b3
5
Last change on this file since d063e7b3 was d063e7b3, checked in by Sebastian Huber <sebastian.huber@…>, on 01/11/17 at 07:42:04
score: Replace STATES_DELAYING
Replace STATES_DELAYING with STATES_WAITING_FOR_TIME.
There is no need for separate timeout thread states. The
Thread_Control::Timer::header and Watchdog_Control::cpu members can be
used to figure out the kind of timeout.
• Property mode set to 100644
File size: 5.5 KB
Line
1/*
2 * Print misc stuff for the monitor dump routines
3 * Each routine returns the number of characters it output.
4 *
5 * TODO:
6 */
7
8#ifdef HAVE_CONFIG_H
9#include "config.h"
10#endif
11
12#include <rtems.h>
13#include <rtems/monitor.h>
14#include <rtems/assoc.h>
15#include <rtems/score/statesimpl.h>
16
17#include <stdio.h>
18#include <ctype.h>
19#include <inttypes.h>
20
21void
22rtems_monitor_separator(void)
23{
24 fprintf(stdout,"------------------------------------------------------------------------------\n");
25}
26
27uint32_t
28rtems_monitor_pad(
29 uint32_t destination_column,
30 uint32_t current_column
31)
32{
33 int pad_length;
34
35 if (destination_column <= current_column)
36 pad_length = 1;
37 else
38 pad_length = destination_column - current_column;
39
40 return fprintf(stdout,"%*s", pad_length, "");
41}
42
43int
44rtems_monitor_dump_decimal(uint32_t num)
45{
46 return fprintf(stdout,"%4" PRId32, num);
47}
48
49int
50rtems_monitor_dump_addr(const void *addr)
51{
52 return fprintf(stdout,"%08" PRIxPTR, (intptr_t) addr);
53}
54
55int
56rtems_monitor_dump_hex(uint32_t num)
57{
58 return fprintf(stdout,"0x%" PRIx32, num);
59}
60
61static int
62rtems_monitor_dump_assoc_bitfield(
63 const rtems_assoc_t *ap,
64 const char *separator,
65 uint32_t value
66 )
67{
68 uint32_t b;
69 uint32_t length = 0;
70 const char *name;
71
72 for (b = 1; b; b <<= 1)
73 if (b & value)
74 {
75 if (length)
76 length += fprintf(stdout,"%s", separator);
77
78 name = rtems_assoc_name_by_local(ap, b);
79
80 if (name)
81 length += fprintf(stdout,"%s", name);
82 else
83 length += fprintf(stdout,"0x%" PRIx32, b);
84 }
85
86 return length;
87}
88
89int
90rtems_monitor_dump_id(rtems_id id)
91{
92#if defined(RTEMS_USE_16_BIT_OBJECT)
93 return fprintf(stdout,"%08" PRIx16, id);
94#else
95 return fprintf(stdout,"%08" PRIx32, id);
96#endif
97}
98
99int
100rtems_monitor_dump_name(rtems_id id)
101{
102 char name_buffer[18] = "????";
103
104 rtems_object_get_name( id, sizeof(name_buffer), name_buffer );
105
106 return fprintf(stdout, "%s", name_buffer);
107}
108
109int
110rtems_monitor_dump_priority(rtems_task_priority priority)
111{
112 return fprintf(stdout,"%3" PRId32, priority);
113}
114
115#define WITH_ID(state) (STATES_THREAD_QUEUE_WITH_IDENTIFIER | state)
116
117static const rtems_assoc_t rtems_monitor_state_assoc[] = {
118 { "DORM", STATES_DORMANT, 0 },
119 { "LIFE", STATES_LIFE_IS_CHANGING, 0 },
120 { "SUSP", STATES_SUSPENDED, 0 },
121 { "Wbar", WITH_ID(STATES_WAITING_FOR_BARRIER), 0 },
122 { "Wcvar", WITH_ID(STATES_WAITING_FOR_CONDITION_VARIABLE), 0 },
123 { "Wevnt", STATES_WAITING_FOR_EVENT, 0 },
124 { "Wisig", STATES_INTERRUPTIBLE_BY_SIGNAL, 0 },
125 { "Wjatx", STATES_WAITING_FOR_JOIN_AT_EXIT, 0 },
126 { "Wjoin", STATES_WAITING_FOR_JOIN, 0 },
127 { "Wmsg" , WITH_ID(STATES_WAITING_FOR_MESSAGE), 0 },
128 { "Wmutex", WITH_ID(STATES_WAITING_FOR_MUTEX), 0 },
129 { "WRATE", STATES_WAITING_FOR_PERIOD, 0 },
130 { "Wrpc", STATES_WAITING_FOR_RPC_REPLY, 0 },
131 { "Wrwlk", WITH_ID(STATES_WAITING_FOR_RWLOCK), 0 },
132 { "Wseg", STATES_WAITING_FOR_SEGMENT, 0 },
133 { "Wsem", WITH_ID(STATES_WAITING_FOR_SEMAPHORE), 0 },
134 { "Wsig", STATES_WAITING_FOR_SIGNAL, 0 },
135 { "Wcvar", STATES_WAITING_FOR_CONDITION_VARIABLE, 0 },
136 { "Wfutex", STATES_WAITING_FOR_FUTEX, 0 },
137 { "Wmutex", STATES_WAITING_FOR_MUTEX, 0 },
138 { "Wsem", STATES_WAITING_FOR_SEMAPHORE, 0 },
139 { "Wsysev", STATES_WAITING_FOR_SYSTEM_EVENT, 0 },
140 { "Wtime", STATES_WAITING_FOR_TIME, 0 },
141 { "Wwkup", STATES_WAITING_FOR_BSD_WAKEUP, 0 },
142 { "ZOMBI", STATES_ZOMBIE, 0 },
143 { 0, 0, 0 },
144};
145
146int
147rtems_monitor_dump_state(States_Control state)
148{
149 int length = 0;
150
151 if (state == STATES_READY) /* assoc doesn't deal with this as it is 0 */
152 length += fprintf(stdout,"READY");
153
154 length += rtems_monitor_dump_assoc_bitfield(rtems_monitor_state_assoc,
155 ":",
156 state);
157 return length;
158}
159
160static const rtems_assoc_t rtems_monitor_attribute_assoc[] = {
161 { "GL", RTEMS_GLOBAL, 0 },
162 { "PR", RTEMS_PRIORITY, 0 },
163 { "FL", RTEMS_FLOATING_POINT, 0 },
164 { "BI", RTEMS_BINARY_SEMAPHORE, 0 },
165 { "SB", RTEMS_SIMPLE_BINARY_SEMAPHORE, 0 },
166 { "IN", RTEMS_INHERIT_PRIORITY, 0 },
167 { "CE", RTEMS_PRIORITY_CEILING, 0 },
168 { "AR", RTEMS_BARRIER_AUTOMATIC_RELEASE, 0 },
169 { "ST", RTEMS_SYSTEM_TASK, 0 },
170 { 0, 0, 0 },
171};
172
173int
174rtems_monitor_dump_attributes(rtems_attribute attributes)
175{
176 int length = 0;
177
178 if (attributes == RTEMS_DEFAULT_ATTRIBUTES) /* value is 0 */
179 length += fprintf(stdout,"DEFAULT");
180
181 length += rtems_monitor_dump_assoc_bitfield(rtems_monitor_attribute_assoc,
182 ":",
183 attributes);
184 return length;
185}
186
187static const rtems_assoc_t rtems_monitor_modes_assoc[] = {
188 { "nP", RTEMS_NO_PREEMPT, 0 },
189 { "T", RTEMS_TIMESLICE, 0 },
190 { "nA", RTEMS_NO_ASR, 0 },
191 { 0, 0, 0 },
192};
193
194int
195rtems_monitor_dump_modes(rtems_mode modes)
196{
197 uint32_t length = 0;
198
199 if (modes == RTEMS_DEFAULT_MODES) /* value is 0 */
200 length += fprintf(stdout,"P:T:nA");
201
202 length += rtems_monitor_dump_assoc_bitfield(rtems_monitor_modes_assoc,
203 ":",
204 modes);
205 return length;
206}
207
208int
209rtems_monitor_dump_events(rtems_event_set events)
210{
211 if (events == 0)
212 return fprintf(stdout," NONE ");
213
214 return fprintf(stdout,"%08" PRIx32, events);
215}
Note: See TracBrowser for help on using the repository browser.
|
{
"url": "https://devel.rtems.org/browser/rtems/cpukit/libmisc/monitor/mon-prmisc.c?rev=d063e7b3d8733f5d1829f5b19c99be81f567fecf",
"source_domain": "devel.rtems.org",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "35904",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:55QROEJWLEBSBFQBMXQDE7CNQTQ7J5LL",
"WARC-Concurrent-To": "<urn:uuid:ba6ebfcb-ad5a-44ac-97f8-9ea70eb9ecd9>",
"WARC-Date": "2022-05-20T23:43:26Z",
"WARC-IP-Address": "140.211.10.146",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:U7HWCXDHW4ASAIB5B2SKVLVYT7EXJJRY",
"WARC-Record-ID": "<urn:uuid:eab438a7-566d-40f9-bbef-f93e62464fed>",
"WARC-Target-URI": "https://devel.rtems.org/browser/rtems/cpukit/libmisc/monitor/mon-prmisc.c?rev=d063e7b3d8733f5d1829f5b19c99be81f567fecf",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6c55e349-52a0-4ad0-9f1c-5d163fc0903f>"
},
"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-28\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,
61,
62,
64,
193,
194,
225,
226,
280,
281,
338,
409,
449,
450,
482,
500,
506,
510,
561,
622,
626,
636,
641,
643,
665,
686,
695,
698,
719,
748,
775,
813,
816,
837,
858,
882,
885,
892,
924,
928,
1034,
1038,
1041,
1052,
1073,
1111,
1144,
1148,
1152,
1174,
1177,
1225,
1251,
1262,
1322,
1325,
1377,
1381,
1384,
1390,
1435,
1439,
1486,
1490,
1493,
1499,
1543,
1547,
1608,
1612,
1615,
1621,
1662,
1666,
1714,
1718,
1721,
1734,
1771,
1802,
1840,
1873,
1879,
1883,
1903,
1932,
1956,
1959,
1989,
2014,
2026,
2052,
2113,
2116,
2171,
2174,
2198,
2254,
2273,
2334,
2346,
2349,
2370,
2374,
2377,
2383,
2420,
2424,
2463,
2510,
2518,
2565,
2574,
2578,
2581,
2587,
2627,
2632,
2670,
2674,
2744,
2748,
2798,
2803,
2807,
2814,
2875,
2880,
2933,
2938,
2942,
3014,
3018,
3080,
3120,
3169,
3211,
3272,
3344,
3394,
3450,
3507,
3556,
3617,
3676,
3727,
3781,
3841,
3893,
3956,
4007,
4070,
4120,
4170,
4224,
4281,
4330,
4385,
4424,
4444,
4450,
4454,
4461,
4511,
4516,
4541,
4545,
4626,
4672,
4676,
4754,
4810,
4869,
4891,
4896,
4900,
4966,
5001,
5038,
5081,
5126,
5178,
5223,
5268,
5322,
5362,
5382,
5388,
5392,
5399,
5460,
5465,
5490,
5494,
5563,
5611,
5615,
5697,
5753,
5817,
5839,
5844,
5848,
5910,
5952,
5993,
6031,
6051,
6057,
6061,
6068,
6114,
6119,
6149,
6153,
6212,
6259,
6263,
6341,
6397,
6456,
6478,
6483,
6487,
6494,
6547,
6552,
6576,
6622,
6626,
6678,
6683
],
"line_end_idx": [
61,
62,
64,
193,
194,
225,
226,
280,
281,
338,
409,
449,
450,
482,
500,
506,
510,
561,
622,
626,
636,
641,
643,
665,
686,
695,
698,
719,
748,
775,
813,
816,
837,
858,
882,
885,
892,
924,
928,
1034,
1038,
1041,
1052,
1073,
1111,
1144,
1148,
1152,
1174,
1177,
1225,
1251,
1262,
1322,
1325,
1377,
1381,
1384,
1390,
1435,
1439,
1486,
1490,
1493,
1499,
1543,
1547,
1608,
1612,
1615,
1621,
1662,
1666,
1714,
1718,
1721,
1734,
1771,
1802,
1840,
1873,
1879,
1883,
1903,
1932,
1956,
1959,
1989,
2014,
2026,
2052,
2113,
2116,
2171,
2174,
2198,
2254,
2273,
2334,
2346,
2349,
2370,
2374,
2377,
2383,
2420,
2424,
2463,
2510,
2518,
2565,
2574,
2578,
2581,
2587,
2627,
2632,
2670,
2674,
2744,
2748,
2798,
2803,
2807,
2814,
2875,
2880,
2933,
2938,
2942,
3014,
3018,
3080,
3120,
3169,
3211,
3272,
3344,
3394,
3450,
3507,
3556,
3617,
3676,
3727,
3781,
3841,
3893,
3956,
4007,
4070,
4120,
4170,
4224,
4281,
4330,
4385,
4424,
4444,
4450,
4454,
4461,
4511,
4516,
4541,
4545,
4626,
4672,
4676,
4754,
4810,
4869,
4891,
4896,
4900,
4966,
5001,
5038,
5081,
5126,
5178,
5223,
5268,
5322,
5362,
5382,
5388,
5392,
5399,
5460,
5465,
5490,
5494,
5563,
5611,
5615,
5697,
5753,
5817,
5839,
5844,
5848,
5910,
5952,
5993,
6031,
6051,
6057,
6061,
6068,
6114,
6119,
6149,
6153,
6212,
6259,
6263,
6341,
6397,
6456,
6478,
6483,
6487,
6494,
6547,
6552,
6576,
6622,
6626,
6678,
6683,
6746
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6746,
"ccnet_original_nlines": 231,
"rps_doc_curly_bracket": 0.016898900270462036,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.06544294208288193,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.059856340289115906,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6288906335830688,
"rps_doc_frac_unique_words": 0.6944000124931335,
"rps_doc_mean_word_length": 6.665599822998047,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0.011971269734203815,
"rps_doc_unigram_entropy": 5.6372389793396,
"rps_doc_word_count": 625,
"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.0028804598841816187,
"rps_doc_frac_chars_top_3gram": 0.0021603500936180353,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -602.0701904296875,
"rps_doc_books_importance_length_correction": -602.0701904296875,
"rps_doc_openwebtext_importance": -291.8955383300781,
"rps_doc_openwebtext_importance_length_correction": -291.8955383300781,
"rps_doc_wikipedia_importance": -212.60130310058594,
"rps_doc_wikipedia_importance_length_correction": -212.60130310058594
},
"fasttext": {
"dclm": 0.14480805397033691,
"english": 0.1068001464009285,
"fineweb_edu_approx": 2.3654274940490723,
"eai_general_math": -0.000010009999641624745,
"eai_open_web_math": 0.5510165095329285,
"eai_web_code": 0.999648928642273
}
}
|
{
"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": "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": "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": "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"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.