id
int64 | text
string | metadata
dict | line_start_n_end_idx
dict | quality_signals
dict | eai_taxonomy
dict | pid
string |
|---|---|---|---|---|---|---|
1,070,468,236,061,238,100 |
Dedekind group
From Wikipedia, the free encyclopedia
Jump to: navigation, search
In group theory, a Dedekind group is a group G such that every subgroup of G is normal. All abelian groups are Dedekind groups. A non-abelian Dedekind group is called a Hamiltonian group.[1]
The most familiar (and smallest) example of a Hamiltonian group is the quaternion group of order 8, denoted by Q8. Dedekind and Baer have shown (in the finite and respectively infinite order case) that every Hamiltonian group is a direct product of the form G = Q8 × B × D, where B is an elementary abelian 2-group, and D is a periodic abelian group with all elements of odd order.
Dedekind groups are named after Richard Dedekind, who investigated them in (Dedekind 1897), proving a form of the above structure theorem (for finite groups). He named the non-abelian ones after William Rowan Hamilton, the discoverer of quaternions.
In 1898 George Miller delineated the structure of a Hamiltonian group in terms of its order and that of its subgroups. For instance, he shows "a Hamilton group of order 2a has 22a − 6 quaternion groups as subgroups". In 2005 Horvat et al[2] used this structure to count the number of Hamiltonian groups of any order n = 2eo where o is an odd integer. When e < 3 then there are no Hamiltonian groups of order n, otherwise there are the same number as there are Abelian groups of order o.
Notes[edit]
1. ^ Hall (1999). The theory of groups. p. 190.
2. ^ Horvat, Boris; Jaklič, Gašper; Pisanski, Tomaž (2005-03-09). "On the Number of Hamiltonian Groups". arXiv:math/0503183.
References[edit]
|
{
"url": "https://en.wikipedia.org/wiki/Dedekind_group",
"source_domain": "en.wikipedia.org",
"snapshot_id": "crawl=CC-MAIN-2017-17",
"warc_metadata": {
"Content-Length": "34960",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LKUV4RWAVCNP5JLL6D4LMWLBQSFP4LYZ",
"WARC-Concurrent-To": "<urn:uuid:eaccd35b-464b-4cbe-9fe1-1afa7ea03bd5>",
"WARC-Date": "2017-04-24T13:49:11Z",
"WARC-IP-Address": "208.80.153.224",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:UMVCNPJQGNJ6PWDQQZ42LV6KF72BY5KG",
"WARC-Record-ID": "<urn:uuid:e28ccb13-ba25-484e-a23e-0497cfa20824>",
"WARC-Target-URI": "https://en.wikipedia.org/wiki/Dedekind_group",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:898c8daa-7190-42bb-b083-329bbd2df4c6>"
},
"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,
15,
16,
54,
82,
83,
274,
275,
657,
658,
908,
909,
1396,
1397,
1409,
1410,
1461,
1589,
1590
],
"line_end_idx": [
15,
16,
54,
82,
83,
274,
275,
657,
658,
908,
909,
1396,
1397,
1409,
1410,
1461,
1589,
1590,
1606
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1606,
"ccnet_original_nlines": 18,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31594201922416687,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.028985509648919106,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2492753565311432,
"rps_doc_frac_unique_words": 0.4962686598300934,
"rps_doc_mean_word_length": 4.66417932510376,
"rps_doc_num_sentences": 21,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.462709426879883,
"rps_doc_word_count": 268,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04479999840259552,
"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.02239999920129776,
"rps_doc_frac_chars_top_3gram": 0.024000000208616257,
"rps_doc_frac_chars_top_4gram": 0.030400000512599945,
"rps_doc_books_importance": -124.34921264648438,
"rps_doc_books_importance_length_correction": -110.64517211914062,
"rps_doc_openwebtext_importance": -68.2599105834961,
"rps_doc_openwebtext_importance_length_correction": -68.2599105834961,
"rps_doc_wikipedia_importance": -41.249168395996094,
"rps_doc_wikipedia_importance_length_correction": -27.67706871032715
},
"fasttext": {
"dclm": 0.88414067029953,
"english": 0.8483472466468811,
"fineweb_edu_approx": 2.8326351642608643,
"eai_general_math": 0.9983855485916138,
"eai_open_web_math": 0.832338273525238,
"eai_web_code": 0.057625290006399155
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "512",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "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,715,394,123,828,352,000 |
Please take a minute to review and accept our Terms of Use.
Welcome to the PLECS User Forum, where you can ask questions and receive answers from other members of the community.
Many technical questions regarding PLECS are answered on the Technical Solutions page of our website. Tutorial videos, specific application examples, and pre-recorded webinars are available on our YouTube page. Please follow us on LinkedIn for the latest Plexim news.
Add component to Library Plecs Blockset
+1 vote
50 views
I'm trying to add a reusable component like in this tutorial: https://www.plexim.com/de/support/videos/custom-component-part-2
I accomplished that in Plecs Standalone but I cannot get it to work in the Blockset version. Can somebody explain how that works with the Simulink integration?
Regards
Julian
asked Jan 24 by juledev (16 points)
1 Answer
+1 vote
Best answer
Hello Julian,
Have you reviewed the process in our User Manual? Here is the description below:
Creating a New Library in PLECS Blockset
To create a new component library, open the PLECS Extras library (in the Simulink library navigator) and copy the PLECS Library block into a Simulink model or library. The Simulink model must be named (i.e. saved) before you can copy components from the component library.
To add the new library to the library browser it has to be added to the list of user libraries in the PLECS Preferences window, which is accessed from the File menu when inside the PLECS Circuit block.
You will also need to create a MATLAB path link to the folder containing this library model file.
Please let us know if you are successful or have specific questions.
Thank you,
Kris
answered Jan 29 by Kris Eberle (391 points)
selected Feb 4 by Kris Eberle
Hello,
i have create a new library name "custom" in plecs library, now the problem is:
how can i add my model to that library, so that when i need it i can just drag one from library?
like i show in the picture.
thanks!
Hello,
You have placed your custom components in a standard PLECS Circuit block. But you need to use the PLECS Library Block in the PLECS Extras category, as shown in the attached image. Place this block into a Simulink model, add your custom components, and save it. Then link to this model in the PLECS Preferences and it should appear in your library browser so that you can then drag it into any other model. Let me know if you get this to work, thanks!
Kris
Hello Kris,
i do it exactly in the way you said. and it's work.
but the only problem is, when i closed the model, the library disappear from the plecs library window. and it says: "one or more libraries were unloaded, click here to refresh browser".
why is that, do you know?
fig_01: when i open the model, the library appear.
fig_02: when i close the model, the library disappear.
fig_03: when i close the model, the message on the plecs library.
Shaofei
I believe the problem is that you don't have a reference to the path directory containing your library model saved in MATLAB. You can either place the library model in the same folder as your current model and navigate to this as your present working directory in MATLAB, or save this path in the MATLAB list so there is a permanent link. The message is normal if you haven't done this step and you just need to click on the library when that happens. But it won't happen if you save the path permanently to the folder with your library model.
Hello Kris,
i've done exatly what you said and the problem has been solved !
Thank you a lot !
...
|
{
"url": "https://forum.plexim.com/683/add-component-to-library-plecs-blockset",
"source_domain": "forum.plexim.com",
"snapshot_id": "crawl=CC-MAIN-2019-09",
"warc_metadata": {
"Content-Length": "31512",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CWGWVPXREWPXM76KEZVILBAEAQ3YJK3T",
"WARC-Concurrent-To": "<urn:uuid:cdd33900-0dd8-4513-b066-739e5246f58c>",
"WARC-Date": "2019-02-17T08:02:18Z",
"WARC-IP-Address": "134.119.163.36",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SWJ5FXLHL7U7RBV4BCA7FJRD35HOOS4Z",
"WARC-Record-ID": "<urn:uuid:8cd962e8-3a57-4bbd-8cea-c9d5a5042ea4>",
"WARC-Target-URI": "https://forum.plexim.com/683/add-component-to-library-plecs-blockset",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:39ec76b6-b476-49fd-b729-4fe8a664a359>"
},
"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-166-118-163.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,
60,
178,
179,
447,
448,
488,
489,
497,
506,
633,
634,
794,
795,
797,
798,
806,
807,
814,
850,
851,
860,
861,
869,
871,
883,
897,
898,
979,
980,
1021,
1294,
1496,
1497,
1595,
1596,
1665,
1666,
1677,
1678,
1683,
1727,
1757,
1764,
1765,
1846,
1847,
1944,
1945,
1973,
1974,
1982,
1989,
1990,
2441,
2442,
2447,
2459,
2460,
2512,
2513,
2699,
2700,
2726,
2727,
2779,
2780,
2836,
2837,
2903,
2905,
2906,
2914,
3458,
3470,
3471,
3536,
3537,
3555
],
"line_end_idx": [
60,
178,
179,
447,
448,
488,
489,
497,
506,
633,
634,
794,
795,
797,
798,
806,
807,
814,
850,
851,
860,
861,
869,
871,
883,
897,
898,
979,
980,
1021,
1294,
1496,
1497,
1595,
1596,
1665,
1666,
1677,
1678,
1683,
1727,
1757,
1764,
1765,
1846,
1847,
1944,
1945,
1973,
1974,
1982,
1989,
1990,
2441,
2442,
2447,
2459,
2460,
2512,
2513,
2699,
2700,
2726,
2727,
2779,
2780,
2836,
2837,
2903,
2905,
2906,
2914,
3458,
3470,
3471,
3536,
3537,
3555,
3558
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3558,
"ccnet_original_nlines": 78,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4397834837436676,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025710420683026314,
"rps_doc_frac_lines_end_with_ellipsis": 0.012658230029046535,
"rps_doc_frac_no_alph_words": 0.14884980022907257,
"rps_doc_frac_unique_words": 0.3719806671142578,
"rps_doc_mean_word_length": 4.489532947540283,
"rps_doc_num_sentences": 39,
"rps_doc_symbol_to_word_ratio": 0.0013531800359487534,
"rps_doc_unigram_entropy": 4.837052822113037,
"rps_doc_word_count": 621,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04698709025979042,
"rps_doc_frac_chars_dupe_6grams": 0.015064559876918793,
"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.028694400563836098,
"rps_doc_frac_chars_top_3gram": 0.02152080088853836,
"rps_doc_frac_chars_top_4gram": 0.019368719309568405,
"rps_doc_books_importance": -340.1353759765625,
"rps_doc_books_importance_length_correction": -340.1353759765625,
"rps_doc_openwebtext_importance": -165.7067413330078,
"rps_doc_openwebtext_importance_length_correction": -165.7067413330078,
"rps_doc_wikipedia_importance": -148.59873962402344,
"rps_doc_wikipedia_importance_length_correction": -148.59873962402344
},
"fasttext": {
"dclm": 0.02738964930176735,
"english": 0.9196150898933411,
"fineweb_edu_approx": 1.3097481727600098,
"eai_general_math": 0.7708646059036255,
"eai_open_web_math": 0.2664257287979126,
"eai_web_code": 0.21916818618774414
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "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,938,345,222,200,835,000 |
generate qr code with c# A Look at the Button1_Click Procedure in visual C#.net
Encoding QRCode in visual C#.net A Look at the Button1_Click Procedure
10
using character jdk to receive barcodes in asp.net web,windows application
BusinessRefinery.com/barcode
using barcode creator for ireport control to generate, create bar code image in ireport applications. import
BusinessRefinery.com/ barcodes
SQL Server maintains a set of tables that store information about all the objects, data types, constraints, con guration options, and resources available to SQL Server. In SQL Server 2008, these tables are called the system base tables. Some of the system base tables exist only in the master database and contain system-wide information, and others exist in every database (including master) and contain information about the objects and resources belonging to that particular database. Beginning with SQL Server 2005, the system base tables are not always visible by default, in master or any other database. You won t see them when you expand the tables node in the Object Explorer in SQL Server Management Studio, and unless you are a system administrator, you won t see them when you execute the sp_help system procedure. If you log in as a system administrator and select from the catalog view (discussed shortly) called sys.objects, you can see the names of all the system tables. For example, the following query returns 58 rows of output on my SQL Server 2008 instance:
download native barcode generator for crystal reports
using assign .net vs 2010 crystal report to make bar code with asp.net web,windows application
BusinessRefinery.com/ barcodes
using barcode integration for jasper control to generate, create barcodes image in jasper applications. core
BusinessRefinery.com/ barcodes
The HyperLink, Image, Button, LinkButton, and ImageButton Controls
using barcode encoder for .net for windows forms control to generate, create barcode image in .net for windows forms applications. office
BusinessRefinery.com/ barcodes
how to generate barcode in c# asp.net
use .net vs 2010 bar code printer to embed barcodes for c#.net console
BusinessRefinery.com/ bar code
What Can You Back Up with Windows Easy Transfer
using barcode generator for office excel control to generate, create qr-code image in office excel applications. line
BusinessRefinery.com/qr bidimensional barcode
to insert qr and qr barcode data, size, image with c# barcode sdk max
BusinessRefinery.com/QR Code JIS X 0510
Once the table is populated, you can select only the columns of interest, as follows:
to draw qr code iso/iec18004 and qr data, size, image with .net barcode sdk bit
BusinessRefinery.com/QR-Code
using barcode encoding for aspx.cs page control to generate, create qrcode image in aspx.cs page applications. coder
BusinessRefinery.com/QR Code ISO/IEC18004
Part III
to use qr-code and denso qr bar code data, size, image with word document barcode sdk display
BusinessRefinery.com/QR Code JIS X 0510
qr-codes size solomon with .net
BusinessRefinery.com/qr codes
In the previous section, you read about resource allocation, discovered what causes overallocation, and resolved an overallocation manually. Resource leveling is the process of delaying or splitting a resource s work on a task to resolve an overallocation. The options in the Level Resources dialog box enable you to set parameters concerning
using barcode integrating for microsoft excel control to generate, create ecc200 image in microsoft excel applications. scanners
BusinessRefinery.com/Data Matrix 2d barcode
crystal reports pdf 417
use .net vs 2010 pdf 417 implement to render pdf417 2d barcode in .net position
BusinessRefinery.com/PDF-417 2d barcode
Foundations of PKI
winforms code 39
generate, create code 3 of 9 feature none on .net projects
BusinessRefinery.com/Code39
data matrix reader .net
Using Barcode reader for security .net framework Control to read, scan read, scan image in .net framework applications.
BusinessRefinery.com/Data Matrix barcode
Figure 19-1. If you install the Web Part Templates for Visual Studio .NET on a machine not running Windows SharePoint Services, you ll need to supply a local copy of Microsoft.SharePoint.dll and provide its location on this wizard page.
use excel code 128 code set c implement to print code 128 code set b on excel configure
BusinessRefinery.com/code128b
c# barcode code 39
use .net barcode 3/9 drawer to render barcode 3/9 for visual c# package
BusinessRefinery.com/Code 39
m essage box r est art s t he t im er for anot her t hree elapsed t im er ev ent s. When t he user clicks Yes in t he m essage box , t he t im er rem ains st alled. Private Sub Button1_Click(ByVal sender As System.Object, _ ByVal e As System.EventArgs) Handles Button1.Click This procedure and the next one require an Imports System.Timer statement and a module-level declaration for the Server timer. Initialize TextBox1 to 0, if text box has default name. If TextBox1.Text = TextBox1 Then TextBox1.Text = 0" End If Declare handler (MyTimer_Elapsed) for the elapsed event for MyTimer. AddHandler MyTimer.Elapsed, AddressOf MyTimer_Elapsed Enable MyTimer to fire an elapsed event every 3 milliseconds. MyTimer.SynchronizingObject = Nothing MyTimer.Enabled = True MyTimer.Interval = 3 End Sub Sub MyTimer_Elapsed(ByVal source As Object, _ ByVal e As ElapsedEventArgs) Specify what should happen when MyTimer fires its Elapsed event. Start incrementing quantity in TextBox1. TextBox1.Text = (CInt(TextBox1.Text) + 1).ToString After adding three units, check whether to stop MyTimer permanently; initial stop is to suspend incrementing while waiting for user input. If (CInt(TextBox1.Text) Mod 3 = 0) Then MyTimer.Stop() If MsgBoxResult.No = MsgBox( Want to stop ", _ MsgBoxStyle.YesNo) Then MyTimer.Start() End If End If End Sub I f t he user click s t he Open Form 1 but t on, t he pr ocedur e shows Form 1 and closes Form 3. The code for t his Click ev ent follows t he sam e pat t ern of ear lier sam ples. Private Sub Button2_Click(ByVal sender As System.Object, _ ByVal e As System.EventArgs) Handles Button2.Click Close current form and open Form1. Dim frmForm1 As New Form1() frmForm1.Show() Me.Close() End Sub
using number word document to insert datamatrix 2d barcode on asp.net web,windows application
BusinessRefinery.com/barcode data matrix
ssrs data matrix
using lowercase sql server reporting services to develop datamatrix 2d barcode on asp.net web,windows application
BusinessRefinery.com/2d Data Matrix barcode
Real World How Do I Move Logins
Performance counters and alerts (just like in previous versions of Windows) Event trace data showing detailed debugging information Registry settings showing system and application configuration
4
This behavior differs from that of Visual Basic 6, in which a property implemented as either a Public field or a pair of property procedures is never modified if passed to a ByRef argument. Visual Basic .NET property syntax is the same whether the property returns a simple value or an object. After all, everything is an object in the .NET Framework. Therefore, you don t have to worry about the many syntax variations that exist under Visual Basic 6, for which a Variant property can map to three distinct Property procedures. For example, the following Spouse property can return a Person object that represents the wife or husband of the current Person object:
Abbrev. Title Abbrev. Title 5
3: Creating Your First Application
Each entity contains a collection of attributes corresponding to the collection of columns in the related table as well as special attributes not found in the data source view, such as expressions or aggregations. For each numeric attribute in the model, the Report Model Wizard creates Total, Avg, Min, and Max numeric aggregations. In addition, year, quarter, month, and day variations, as well as a first and last aggregation, are created for date attributes. These additional attributes add flexibility to the report model and reduce the amount of work required to produce the desired results in a report. A symbol in front of each attribute indicates its data type, as described in the following list:
Copyright © Businessrefinery.com . All rights reserved.
|
{
"url": "http://www.businessrefinery.com/yc2/354/20/",
"source_domain": "www.businessrefinery.com",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "23282",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HGX4PARSITCRUTNOR3XZYNPZQLUP7G4C",
"WARC-Concurrent-To": "<urn:uuid:424fa7d3-b853-44ca-abd4-982900db26de>",
"WARC-Date": "2022-09-28T20:10:02Z",
"WARC-IP-Address": "47.90.248.28",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:LBSQX2XGULGM2VA6FCAHPKOBECR22OCZ",
"WARC-Record-ID": "<urn:uuid:f7a7cb6e-3098-4010-98f8-8ec981d1854f>",
"WARC-Target-URI": "http://www.businessrefinery.com/yc2/354/20/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c0e18b98-cc66-4e36-9175-2596b3fc7bc3>"
},
"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-142\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,
80,
81,
152,
153,
156,
231,
260,
369,
400,
1479,
1533,
1628,
1659,
1768,
1799,
1866,
2004,
2035,
2073,
2144,
2175,
2223,
2341,
2387,
2457,
2497,
2583,
2663,
2692,
2809,
2851,
2860,
2954,
2994,
3026,
3056,
3399,
3528,
3572,
3596,
3676,
3716,
3735,
3752,
3811,
3839,
3863,
3983,
4024,
4261,
4349,
4379,
4398,
4470,
4499,
6215,
6309,
6350,
6367,
6481,
6525,
6557,
6752,
6754,
7419,
7449,
7484,
8191
],
"line_end_idx": [
80,
81,
152,
153,
156,
231,
260,
369,
400,
1479,
1533,
1628,
1659,
1768,
1799,
1866,
2004,
2035,
2073,
2144,
2175,
2223,
2341,
2387,
2457,
2497,
2583,
2663,
2692,
2809,
2851,
2860,
2954,
2994,
3026,
3056,
3399,
3528,
3572,
3596,
3676,
3716,
3735,
3752,
3811,
3839,
3863,
3983,
4024,
4261,
4349,
4379,
4398,
4470,
4499,
6215,
6309,
6350,
6367,
6481,
6525,
6557,
6752,
6754,
7419,
7449,
7484,
8191,
8246
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8246,
"ccnet_original_nlines": 68,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2680667042732239,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01791228912770748,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19024088978767395,
"rps_doc_frac_unique_words": 0.40714284777641296,
"rps_doc_mean_word_length": 5.30555534362793,
"rps_doc_num_sentences": 114,
"rps_doc_symbol_to_word_ratio": 0.004941320046782494,
"rps_doc_unigram_entropy": 5.660147666931152,
"rps_doc_word_count": 1260,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07284966111183167,
"rps_doc_frac_chars_dupe_6grams": 0.05564697086811066,
"rps_doc_frac_chars_dupe_7grams": 0.04637248069047928,
"rps_doc_frac_chars_dupe_8grams": 0.014958860352635384,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.006731490138918161,
"rps_doc_frac_chars_top_3gram": 0.01525804027915001,
"rps_doc_frac_chars_top_4gram": 0.02064323052763939,
"rps_doc_books_importance": -752.2044677734375,
"rps_doc_books_importance_length_correction": -752.2044677734375,
"rps_doc_openwebtext_importance": -514.7568969726562,
"rps_doc_openwebtext_importance_length_correction": -514.7568969726562,
"rps_doc_wikipedia_importance": -310.7492370605469,
"rps_doc_wikipedia_importance_length_correction": -310.7492370605469
},
"fasttext": {
"dclm": 0.04151672124862671,
"english": 0.738624095916748,
"fineweb_edu_approx": 2.4504425525665283,
"eai_general_math": 0.6668901443481445,
"eai_open_web_math": 0.07058454304933548,
"eai_web_code": 0.572422981262207
}
}
|
{
"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": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "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
|
-5,926,535,855,830,101,000 |
pprint — Pretty-Print di Python 3
Ditulis oleh Lobot Hijau, dipublikasi pada 27 Mar 2018 dalam kategori Tutorial
pprint — Pretty-Print di Python 3 - CodePolitan.com
Modul pprint dipakai untuk mencetak struktur data agar lebih mudah untuk dibaca. Ia bisa memformat struktur data yang bisa di baca dengan benar oleh interpreter, namun juga mudah bagi manusia untuk membacanya. Pesan keluarannya akan dicetak dalam satu baris jika memungkinkan, atau di indentasi ke beberapa baris jika tidak.
Semua contoh di bawah akan menggunakan konten dari file pprint_data.py berikut ini (letakkan satu folder dengan file lain):
# pprint_data.py
data = [
(1, {'a': 'A', 'b': 'B', 'c': 'C', 'd': 'D'}),
(2, {'e': 'E', 'f': 'F', 'g': 'G', 'h': 'H',
'i': 'I', 'j': 'J', 'k': 'K', 'l': 'L'}),
(3, ['m', 'n']),
(4, ['o', 'p', 'q']),
(5, ['r', 's', 't''u', 'v', 'x', 'y', 'z']),
]
Menggunakan pprint
Cara termudah untuk menggunakan modul ini ialah dengan memanggil fungsi pprint().
# pprint_pprint.py
from pprint import pprint
from pprint_data import data
print('PRINT:')
print(data)
print()
print('PPRINT:')
pprint(data)
Fungsi pprint() akan memformat sebuah objek data yang dikirimkan sebagai argumen dan menuliskannya kembali ke sys.stdout (layar/terminal).
$ python3 pprint_pprint.py
PRINT:
[(1, {'a': 'A', 'b': 'B', 'c': 'C', 'd': 'D'}), (2, {'e': 'E', 'f':
'F', 'g': 'G', 'h': 'H', 'i': 'I', 'j': 'J', 'k': 'K', 'l': 'L'}), (
3, ['m', 'n']), (4, ['o', 'p', 'q']), (5, ['r', 's', 'tu', 'v', 'x',
'y', 'z'])]
PPRINT:
[(1, {'a': 'A', 'b': 'B', 'c': 'C', 'd': 'D'}),
(2,
{'e': 'E',
'f': 'F',
'g': 'G',
'h': 'H',
'i': 'I',
'j': 'J',
'k': 'K',
'l': 'L'}),
(3, ['m', 'n']),
(4, ['o', 'p', 'q']),
(5, ['r', 's', 'tu', 'v', 'x', 'y', 'z'])]
Mengatur Format pprint
Jika ingin memformat suatu data tanpa menampilkannya secara langsung (misalnya untuk logging), gunakan pformat() untuk membuatkan representasi string-nya.
# pprint_pformat.py
import logging
from pprint import pformat
from pprint_data import data
logging.basicConfig(
level=logging.DEBUG,
format='%(levelname)-8s %(message)s',
)
logging.debug('Logging pformatted data')
formatted = pformat(data)
for line in formatted.splitlines():
logging.debug(line.rstrip())
String yang diformat lalu bisa dicetak atau di log.
$ python3 pprint_pformat.py
DEBUG Logging pformatted data
DEBUG [(1, {'a': 'A', 'b': 'B', 'c': 'C', 'd': 'D'}),
DEBUG (2,
DEBUG {'e': 'E',
DEBUG 'f': 'F',
DEBUG 'g': 'G',
DEBUG 'h': 'H',
DEBUG 'i': 'I',
DEBUG 'j': 'J',
DEBUG 'k': 'K',
DEBUG 'l': 'L'}),
DEBUG (3, ['m', 'n']),
DEBUG (4, ['o', 'p', 'q']),
DEBUG (5, ['r', 's', 'tu', 'v', 'x', 'y', 'z'])]
Custom Class
Kelas PrettyPrinter yang dipakai oleh pprint() bisa juga bekerja dengan custom class, jika memiliki method __repr__().
pprint_arbitrary_object.py
from pprint import pprint
class node:
def __init__(self, name, contents=[]):
self.name = name
self.contents = contents[:]
def __repr__(self):
return (
'node(' + repr(self.name) + ', ' +
repr(self.contents) + ')'
)
trees = [
node('node-1'),
node('node-2', [node('node-2-1')]),
node('node-3', [node('node-3-1')]),
]
pprint(trees)
Berikut ini representasi string dari tiga objek bersarang yang dicetak dengan pprint:
$ python3 pprint_arbitrary_object.py
[node('node-1', []),
node('node-2', [node('node-2-1', [])]),
node('node-3', [node('node-3-1', [])])]
Recursion
Struktur data rekursif bisa ditampilkan dengan mereferensikan sumber data asli dengan format <Recursion on typename with id=number>.
#pprint_recursion.py
from pprint import pprint
local_data = ['a', 'b', 1, 2]
local_data.append(local_data)
print('id(local_data) =>', id(local_data))
pprint(local_data)
Pada contoh ini, list local_data ditambahkan kepada dirinya sendiri sehingga membuat sebuah proses rekursif.
$ python3 pprint_recursion.py
id(local_data) => 4358913288
['a', 'b', 1, 2, <Recursion on list with id=4358913288>]
Membatasi Nested Output
Untuk struktur data yang dalam, mungkin kita tidak perlu untuk menampilkan seluruh datanya. Jika kita tampilkan seluruhnya, data tersebut bisa tidak terformat dengan baik, teks yang terformat terlalu besar, atau beberapa data bisa terlihat tidak berhubungan.
#pprint_depth.py
from pprint import pprint
from pprint_data import data
pprint(data, depth=1)
pprint(data, depth=2)
Gunakan argumen depth untuk mengontrol seberapa jauh kita ingin mencetak struktur data tersebut. TIngkat kedalaman yang tidak termasuk kebagian yang ditampilkan akan dicetak dengan ....
$ python3 pprint_depth.py
[(...), (...), (...), (...), (...)]
[(1, {...}), (2, {...}), (3, [...]), (4, [...]), (5, [...])]
Mengontrol Lebar Output
Lebar string yang dicetak oleh pprint adalah 80 karakter. Untuk mengatur lebarnya, bisa mengirimkan argumen width ke pprint().
# pprint_width.py
from pprint import pprint
from pprint_data import data
for width in [80, 5]:
print('WIDTH =', width)
pprint(data, width=width)
print()
Saat lebar terlalu kecil, pprint akan menambah lebarnya seminimal mungkin agar sintaks yang dicetak tetap valid.
$ python3 pprint_width.py
WIDTH = 80
[(1, {'a': 'A', 'b': 'B', 'c': 'C', 'd': 'D'}),
(2,
{'e': 'E',
'f': 'F',
'g': 'G',
'h': 'H',
'i': 'I',
'j': 'J',
'k': 'K',
'l': 'L'}),
(3, ['m', 'n']),
(4, ['o', 'p', 'q']),
(5, ['r', 's', 'tu', 'v', 'x', 'y', 'z'])]
WIDTH = 5
[(1,
{'a': 'A',
'b': 'B',
'c': 'C',
'd': 'D'}),
(2,
{'e': 'E',
'f': 'F',
'g': 'G',
'h': 'H',
'i': 'I',
'j': 'J',
'k': 'K',
'l': 'L'}),
(3,
['m',
'n']),
(4,
['o',
'p',
'q']),
(5,
['r',
's',
'tu',
'v',
'x',
'y',
'z'])]
Argumen compact memeberitahu pprint() untuk mencoba memaksimalkan data yang dicetak di satu baris dari pada menecetak data baru di baris yang baru.
# pprint_compact.py
from pprint import pprint
from pprint_data import data
print('DEFAULT:')
pprint(data, compact=False)
print('\nCOMPACT:')
pprint(data, compact=True)
Contoh di bawah memperlihatkan, apabila data tidak muat dicetak di satu baris maka mereka akan dicetak di baris berbeda (lihat data kedua). Jika lebih dari satu data muat untuk ditampilkan di baris yang sama, maka cetak kedua data tersebut bersama.
$ python3 pprint_compact.py
DEFAULT:
[(1, {'a': 'A', 'b': 'B', 'c': 'C', 'd': 'D'}),
(2,
{'e': 'E',
'f': 'F',
'g': 'G',
'h': 'H',
'i': 'I',
'j': 'J',
'k': 'K',
'l': 'L'}),
(3, ['m', 'n']),
(4, ['o', 'p', 'q']),
(5, ['r', 's', 'tu', 'v', 'x', 'y', 'z'])]
COMPACT:
[(1, {'a': 'A', 'b': 'B', 'c': 'C', 'd': 'D'}),
(2,
{'e': 'E',
'f': 'F',
'g': 'G',
'h': 'H',
'i': 'I',
'j': 'J',
'k': 'K',
'l': 'L'}),
(3, ['m', 'n']), (4, ['o', 'p', 'q']),
(5, ['r', 's', 'tu', 'v', 'x', 'y', 'z'])]
Diterjemahkan dari Python 3 Module of the Week karya Dough Hellman.
Berlangganan Informasi CodePolitan Melalui Email
Jangan sampai kamu melewatkan informasi penting tentang pemrograman dan teknologi! Kamu bisa berlangganan Newsletter CodePolitan dengan cara mengisi formulir di samping.
|
{
"url": "https://www.codepolitan.com/pprint-pretty-print-di-python-3-5aba009403579",
"source_domain": "www.codepolitan.com",
"snapshot_id": "crawl=CC-MAIN-2018-39",
"warc_metadata": {
"Content-Length": "38616",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YGZPEJRMFDG2X2W7I5OD4O7I3BRUEVJK",
"WARC-Concurrent-To": "<urn:uuid:87d2f262-3407-443b-807d-2e7e9b78ec8a>",
"WARC-Date": "2019-08-20T03:19:58Z",
"WARC-IP-Address": "104.27.183.231",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RZK4JXJZTQNFXSCAA2T4HMN23MEXUA3I",
"WARC-Record-ID": "<urn:uuid:f4f8dba1-e52d-4f03-8baa-7011b8e83729>",
"WARC-Target-URI": "https://www.codepolitan.com/pprint-pretty-print-di-python-3-5aba009403579",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7dcc90ef-01a8-474f-bc7d-a69ecacad655>"
},
"warc_info": "isPartOf: CC-MAIN-2019-35\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-246.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
34,
35,
114,
166,
167,
492,
493,
617,
618,
635,
636,
645,
696,
745,
796,
817,
843,
892,
894,
895,
914,
915,
997,
998,
1017,
1043,
1044,
1073,
1074,
1090,
1102,
1110,
1127,
1140,
1141,
1280,
1281,
1308,
1309,
1316,
1384,
1453,
1522,
1535,
1536,
1544,
1592,
1597,
1610,
1623,
1636,
1649,
1662,
1675,
1688,
1703,
1721,
1744,
1788,
1789,
1812,
1813,
1968,
1969,
1989,
1990,
2005,
2032,
2061,
2062,
2083,
2108,
2150,
2152,
2153,
2194,
2220,
2256,
2289,
2290,
2342,
2343,
2371,
2372,
2405,
2462,
2476,
2498,
2520,
2542,
2564,
2586,
2608,
2630,
2654,
2681,
2713,
2766,
2767,
2780,
2781,
2900,
2901,
2928,
2954,
2955,
2967,
2968,
3011,
3036,
3072,
3073,
3097,
3114,
3161,
3199,
3209,
3210,
3220,
3240,
3280,
3320,
3322,
3336,
3337,
3423,
3424,
3461,
3462,
3483,
3524,
3565,
3566,
3576,
3577,
3710,
3711,
3732,
3733,
3759,
3760,
3790,
3820,
3821,
3864,
3883,
3884,
3993,
3994,
4024,
4025,
4054,
4115,
4116,
4140,
4141,
4400,
4401,
4418,
4419,
4445,
4446,
4475,
4476,
4498,
4520,
4521,
4707,
4708,
4734,
4735,
4771,
4832,
4833,
4857,
4858,
4985,
4986,
5004,
5005,
5031,
5032,
5061,
5062,
5084,
5112,
5142,
5154,
5155,
5268,
5269,
5295,
5296,
5307,
5355,
5360,
5373,
5386,
5399,
5412,
5425,
5438,
5451,
5466,
5484,
5507,
5551,
5552,
5562,
5567,
5580,
5593,
5606,
5621,
5626,
5639,
5652,
5665,
5678,
5691,
5704,
5717,
5732,
5737,
5745,
5755,
5760,
5768,
5776,
5786,
5791,
5799,
5807,
5816,
5824,
5832,
5840,
5850,
5851,
5999,
6000,
6020,
6021,
6047,
6048,
6077,
6078,
6096,
6124,
6144,
6171,
6172,
6421,
6422,
6450,
6451,
6460,
6508,
6513,
6526,
6539,
6552,
6565,
6578,
6591,
6604,
6619,
6637,
6660,
6704,
6705,
6714,
6762,
6767,
6780,
6793,
6806,
6819,
6832,
6845,
6858,
6873,
6913,
6957,
6958,
7026,
7027,
7028,
7029,
7078,
7079
],
"line_end_idx": [
34,
35,
114,
166,
167,
492,
493,
617,
618,
635,
636,
645,
696,
745,
796,
817,
843,
892,
894,
895,
914,
915,
997,
998,
1017,
1043,
1044,
1073,
1074,
1090,
1102,
1110,
1127,
1140,
1141,
1280,
1281,
1308,
1309,
1316,
1384,
1453,
1522,
1535,
1536,
1544,
1592,
1597,
1610,
1623,
1636,
1649,
1662,
1675,
1688,
1703,
1721,
1744,
1788,
1789,
1812,
1813,
1968,
1969,
1989,
1990,
2005,
2032,
2061,
2062,
2083,
2108,
2150,
2152,
2153,
2194,
2220,
2256,
2289,
2290,
2342,
2343,
2371,
2372,
2405,
2462,
2476,
2498,
2520,
2542,
2564,
2586,
2608,
2630,
2654,
2681,
2713,
2766,
2767,
2780,
2781,
2900,
2901,
2928,
2954,
2955,
2967,
2968,
3011,
3036,
3072,
3073,
3097,
3114,
3161,
3199,
3209,
3210,
3220,
3240,
3280,
3320,
3322,
3336,
3337,
3423,
3424,
3461,
3462,
3483,
3524,
3565,
3566,
3576,
3577,
3710,
3711,
3732,
3733,
3759,
3760,
3790,
3820,
3821,
3864,
3883,
3884,
3993,
3994,
4024,
4025,
4054,
4115,
4116,
4140,
4141,
4400,
4401,
4418,
4419,
4445,
4446,
4475,
4476,
4498,
4520,
4521,
4707,
4708,
4734,
4735,
4771,
4832,
4833,
4857,
4858,
4985,
4986,
5004,
5005,
5031,
5032,
5061,
5062,
5084,
5112,
5142,
5154,
5155,
5268,
5269,
5295,
5296,
5307,
5355,
5360,
5373,
5386,
5399,
5412,
5425,
5438,
5451,
5466,
5484,
5507,
5551,
5552,
5562,
5567,
5580,
5593,
5606,
5621,
5626,
5639,
5652,
5665,
5678,
5691,
5704,
5717,
5732,
5737,
5745,
5755,
5760,
5768,
5776,
5786,
5791,
5799,
5807,
5816,
5824,
5832,
5840,
5850,
5851,
5999,
6000,
6020,
6021,
6047,
6048,
6077,
6078,
6096,
6124,
6144,
6171,
6172,
6421,
6422,
6450,
6451,
6460,
6508,
6513,
6526,
6539,
6552,
6565,
6578,
6591,
6604,
6619,
6637,
6660,
6704,
6705,
6714,
6762,
6767,
6780,
6793,
6806,
6819,
6832,
6845,
6858,
6873,
6913,
6957,
6958,
7026,
7027,
7028,
7029,
7078,
7079,
7248
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7248,
"ccnet_original_nlines": 291,
"rps_doc_curly_bracket": 0.004966889973729849,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1138790026307106,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.061514999717473984,
"rps_doc_frac_lines_end_with_ellipsis": 0.0034246600698679686,
"rps_doc_frac_no_alph_words": 0.5185561776161194,
"rps_doc_frac_unique_words": 0.3265306055545807,
"rps_doc_mean_word_length": 4.551020622253418,
"rps_doc_num_sentences": 58,
"rps_doc_symbol_to_word_ratio": 0.009150990284979343,
"rps_doc_unigram_entropy": 5.128857135772705,
"rps_doc_word_count": 931,
"rps_doc_frac_chars_dupe_10grams": 0.06938871741294861,
"rps_doc_frac_chars_dupe_5grams": 0.15199433267116547,
"rps_doc_frac_chars_dupe_6grams": 0.12980882823467255,
"rps_doc_frac_chars_dupe_7grams": 0.1170639619231224,
"rps_doc_frac_chars_dupe_8grams": 0.1170639619231224,
"rps_doc_frac_chars_dupe_9grams": 0.0715128630399704,
"rps_doc_frac_chars_top_2gram": 0.004720319993793964,
"rps_doc_frac_chars_top_3gram": 0.005664390046149492,
"rps_doc_frac_chars_top_4gram": 0.007552510127425194,
"rps_doc_books_importance": -712.4654541015625,
"rps_doc_books_importance_length_correction": -712.4654541015625,
"rps_doc_openwebtext_importance": -328.1575927734375,
"rps_doc_openwebtext_importance_length_correction": -328.1575927734375,
"rps_doc_wikipedia_importance": -496.3399353027344,
"rps_doc_wikipedia_importance_length_correction": -496.3399353027344
},
"fasttext": {
"dclm": 0.7316681146621704,
"english": 0.04226242005825043,
"fineweb_edu_approx": 2.1896989345550537,
"eai_general_math": 0.00393116008490324,
"eai_open_web_math": 0.26163023710250854,
"eai_web_code": 0.6780385971069336
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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
|
6,215,872,895,239,379,000 |
TechSpot
Dell Dimension 3000 network drivers
By genekle
May 11, 2010
1. when I reformated my daughters dell dimension 3000 desktop it did not reinstall the net work drivers. so I can not get on line to reinstall all the drivers. does anyone know where I can get the drivers (to download and save ) to transfer to my daughters computer.
THANKS for the help in advance.
2. Ididmyc600
Ididmyc600 TechSpot Chancellor Posts: 2,251
3. genekle
genekle TS Rookie Topic Starter Posts: 44
done that it will not let me save the file
4. Ididmyc600
Ididmyc600 TechSpot Chancellor Posts: 2,251
Whhat do you mean
5. genekle
genekle TS Rookie Topic Starter Posts: 44
I need to down load and save the files . So that I can put them on another computer. Also I think what i realy need is the modem driver so I can connect to the internet.
6. LookinAround
LookinAround TechSpot Chancellor Posts: 8,398 +169
Hi genekle
1) Using a different computer, you should be able to download and save the drivers (using the link from Ididmyc600). So what did you mean when you said it won't let you? As i also don't understand what might be stopping you from doing that
2) I assume your Dimension 3000 has a LAN network adapter (e.g. you connect it using an ethernet cable?) as then you would need Intel - Driver PRO/100 VE Network
7. genekle
genekle TS Rookie Topic Starter Posts: 44
no, it does not have a lan net work adaptor either, it was wiped and the back up disk did not back up the files. The link will only let me down load the drives as a install.
8. LookinAround
LookinAround TechSpot Chancellor Posts: 8,398 +169
Do you mean the network adapter isn't working (because there's no driver?) or do you mean there's no network adapter hardware on the computer??? As you need SOME type of network connection support (how do you connect?) by Ethernet cable? or Wireless? or dial-up phone connection???
That's odd. You mean it only gives you the option to Run and not Save? Which browser are you using for the download??
9. genekle
genekle TS Rookie Topic Starter Posts: 44
it will not work because there are no drivers. I did get the lan drivers saved. windows xp pro
10. slh28
slh28 TechSpot Paladin Posts: 1,925 +170
From another computer, download the driver from the link provided above, copy the file(s) you downloaded from the Dell website onto a USB stick, then copy and install it on your Dell 3000.
I can't understand how any part of that process wouldn't work... Or failing that you could use the recovery disks if you have them.
Topic Status:
Not open for further replies.
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/dell-dimension-3000-network-drivers.147004/",
"source_domain": "www.techspot.com",
"snapshot_id": "crawl=CC-MAIN-2014-52",
"warc_metadata": {
"Content-Length": "64436",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WLLYDKVC7W4XCCLTO3RFU7XYJRWBDSWL",
"WARC-Concurrent-To": "<urn:uuid:dfc374a1-2e52-45d7-844f-02e793b619e6>",
"WARC-Date": "2014-12-21T03:29:53Z",
"WARC-IP-Address": "184.173.241.66",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:ZBQC7BBIR3CE7ZBN2PO3HTVD6V7A6QOR",
"WARC-Record-ID": "<urn:uuid:9f8e6f7c-5377-4456-9aa3-c0c437b95ebc>",
"WARC-Target-URI": "http://www.techspot.com/community/topics/dell-dimension-3000-network-drivers.147004/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:841a8121-36e7-412f-9467-8300566c4955>"
},
"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,
46,
47,
58,
71,
340,
341,
377,
383,
399,
400,
448,
449,
462,
463,
509,
510,
557,
563,
579,
580,
628,
629,
651,
657,
670,
671,
717,
718,
892,
898,
916,
917,
974,
975,
990,
991,
1235,
1236,
1402,
1408,
1421,
1422,
1468,
1469,
1647,
1653,
1671,
1672,
1729,
1730,
2016,
2017,
2139,
2145,
2158,
2159,
2205,
2206,
2305,
2311,
2323,
2324,
2371,
2372,
2565,
2566,
2702,
2708,
2722,
2752,
2753,
2754,
2770,
2771,
2788,
2815,
2842,
2858,
2859,
2860
],
"line_end_idx": [
9,
10,
46,
47,
58,
71,
340,
341,
377,
383,
399,
400,
448,
449,
462,
463,
509,
510,
557,
563,
579,
580,
628,
629,
651,
657,
670,
671,
717,
718,
892,
898,
916,
917,
974,
975,
990,
991,
1235,
1236,
1402,
1408,
1421,
1422,
1468,
1469,
1647,
1653,
1671,
1672,
1729,
1730,
2016,
2017,
2139,
2145,
2158,
2159,
2205,
2206,
2305,
2311,
2323,
2324,
2371,
2372,
2565,
2566,
2702,
2708,
2722,
2752,
2753,
2754,
2770,
2771,
2788,
2815,
2842,
2858,
2859,
2860,
3058
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3058,
"ccnet_original_nlines": 82,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38699185848236084,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03252033144235611,
"rps_doc_frac_lines_end_with_ellipsis": 0.012048190459609032,
"rps_doc_frac_no_alph_words": 0.20975610613822937,
"rps_doc_frac_unique_words": 0.4367588758468628,
"rps_doc_mean_word_length": 4.440711498260498,
"rps_doc_num_sentences": 44,
"rps_doc_symbol_to_word_ratio": 0.0032520298846066,
"rps_doc_unigram_entropy": 5.001617908477783,
"rps_doc_word_count": 506,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.16288384795188904,
"rps_doc_frac_chars_dupe_6grams": 0.16288384795188904,
"rps_doc_frac_chars_dupe_7grams": 0.12105029076337814,
"rps_doc_frac_chars_dupe_8grams": 0.07298620045185089,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.015576319769024849,
"rps_doc_frac_chars_top_3gram": 0.04094348102807999,
"rps_doc_frac_chars_top_4gram": 0.03916332870721817,
"rps_doc_books_importance": -238.92042541503906,
"rps_doc_books_importance_length_correction": -238.92042541503906,
"rps_doc_openwebtext_importance": -136.26602172851562,
"rps_doc_openwebtext_importance_length_correction": -136.26602172851562,
"rps_doc_wikipedia_importance": -94.02983856201172,
"rps_doc_wikipedia_importance_length_correction": -94.02983856201172
},
"fasttext": {
"dclm": 0.041556891053915024,
"english": 0.9068635702133179,
"fineweb_edu_approx": 1.1591603755950928,
"eai_general_math": 0.024392010644078255,
"eai_open_web_math": 0.31658291816711426,
"eai_web_code": 0.00010764999751700088
}
}
|
{
"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": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,438,334,926,184,082,400 |
Log In
E-mail or User ID
Password
Keep me signed in
Recover Password
Create an Account
Solaris
Solve problems - It's Free
Create your account in seconds
Email address
Username
Between 5 and 30 characters. No spaces please
Password
Notify me of new activity in this group:
Keep me informed of the latest:
By clicking "Join Now", you agree to Toolbox for Technology terms of use, and have read and understand our privacy policy.
The Internet connecting Problem!
Hi Guys,
If you remember, I had this problem a couple of weeks
ago, but I couldn't fix it so far!
I checked out with three different Network Card
(Linksys, D-Link and Rhine-II) and 3 new cables, the
same problem, no response from Router(192.168.0.1).
I have Win2003 Server and Linux Fedora Core 4 on the
same computer, both work properly with these three
NICs but in Solaris9, I have problem! the
configuration( /etc/defaultrouter, /etc/nsswitch.conf,
/etc/hosts, /etc/resolv.conf, /etc/hostname.???0)
looks like ok! but I don't know where is the problem!
Any help!
appreciate in advance!
Mastaneh.
Looking for the perfect gift? Give the gift of Flickr!
http://www.flickr.com/gift/
27 Replies
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
Solaris_Guy replied Mar 17, 2008
Hi Mahi,
From your description, this sounds like a netmask problem. Please run
ifconfig <interface> and post
the results. that will make it easier to analyze the problem.
HTH
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
ecastillo replied Mar 17, 2008
The problem could be the router not accepting you solaris box? Are you using
the same IP address as in the case it works?
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
Robert Sullivan replied Mar 17, 2008
Hi Mastaneh,
What is ifconfig showing? You will also want to run traceroute to see
where you are getting to. I'm guessing you are having problems when
doing an nslookup.
Robert
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
Nigel Barker replied Mar 17, 2008
Would be good to list out the ip's of the Win and Redhat boxes, and the
Solaris box, as someone else pointed out also what is in the /etc/netmasks
file.
No response means it tried to send a packet, and didn't get a reply.
Need to work out where it tried to send the packet (routes from netstat -r)
and then consider what routes the router has to route stuff back to the Sun
box.
With something like this, you need to be systematic and thorough, publish
here what you find, and we can help pick holes :-)
Nige
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
Merlin5x5 replied Mar 17, 2008
Is this Host box connected to more than 1 network?
You have to give a little more basic info on your box
and what you have tried to do to diagnose it. Have
you tried to ping the interface? Turn the box off and
ping the IP to see if another box is assigned that IP.
How is the IP address being assigned? Any network or
interface being defined by DHCP? Remember, a secondary
interface using DHCP will wipe out all references to the
internet connections on what you intended to be the
primary. Any DHCP interface assumes it's the primary.
Lastly, the interface itself can be checked with a cross-
over cable and a laptop, or another close box. Assign a
manual IP to both and see if you can ping it.
Merlin5x5
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
Mastaneh Bamdad replied Mar 17, 2008
Ok, Thanks!
#ifconfig vfe0
vfe0:
flags=1000843<UP,BROADCAST, RUNNING, MLTICAST, IPV4>
mtu 1500 index 2 inet 192.168.0.109 netmask ffffff00 broadcast 192.168.0.255 ether 0:50:ba:6d:56:9e
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
Mastaneh Bamdad replied Mar 17, 2008
Hi Merlin5x5,
I have one network card (D-Link) in my computer, I assigened on static IP Address, 192.168.0.109, the defaultrouter is 192.168.0.1.
I can ping to 192.168.0.109 and 127.0.0.1 but cannot ping to 192.168.0.1 and the other winxp computer connected to the router!
I have a D-link router!
I specify the defuault router manually, and the system cannot recognize it when I set the system finds it at boot time!
I connot set the DHCP because the router is not recognized by the system.
Thanx for any help!
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
Mastaneh Bamdad replied Mar 17, 2008
Hi Robert,
Thank you for your ideas!
This is ifconfig result!
#ifconfig vfe0
vfe0:
flags=1000843<UP,BROADCAST, RUNNING, MLTICAST, IPV4>
mtu 1500 index 2 inet 192.168.0.109 netmask ffffff00 broadcast 192.168.0.255 ether 0:50:ba:6d:56:9e
# traceroute 192.168.0.1
traceroute to 192.168.0.1 (192.168.0.1), 30 hops max 40 byte packets
1
* * *
2 * * *
.
.
.
30 * * *
#
#nslookup -debug
;; res_nmkquery(QUERY, 1.0.168.192.in-addr.arpa, IN, PTR)
timeout
*** Can't find server name for address 192.168.0.1: No response from server.
#cat /etc/resolv.conf
nameserver
192.168.0.1
#cat /etc/defaultrouter
192.168.0.1
#cat /etc/hosts
127.0.0.1
localhost
192.168.0.109
solserv
loghost
I have given static IP address to the NIC!
And at the /etc/nsswitch.conf I have:
hosts:
files
dns
and the rest set to files.
#ping 192.168.0.109
192.168.0.109 is alive
#ping solserv
solserv is alive
#ping 192.168.0.1
no answer from 192.168.0.1
# route -fn
default
192.168.0.1
done
Thanx again for any help!
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
Mastaneh Bamdad replied Mar 17, 2008
Hi Nigelbarker,
Thank you in advance for you ideas!
The win2003 Server is on another HDD on the same computer , use the DHCP for getting IP Address, the Linux is on the same HDD which the Soalris is, dual boot for Soalris and Linux, Linux server use static IP Address 192.168.0.108.
Both work properly and don't have any problem to connect the router(192.168.0.1) or Internet!
One Operating System is up at a time! Win2003 or Linux or Solaris!
I didn't do any more config on linux, just /etc/resolv.conf: 192.168.0.1
and I don't install the driver, the Win2003 and the Linux automatically recognize the driver for any cards that I installed (D-link or Linksys) but for Solaris I downloaded the driver from Internet!
At first, I thought, maybe the problem is the driver, but I have the same problem with three different cards!
Thank you for any help!
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
Mastaneh Bamdad replied Mar 17, 2008
Hi Eusebio.castill
Thank ou for your response!
I have used static IP address for NIC 192.168.0.109 and the Router address is 192.168.0.1 but I got no response from the router!
Thanks for any help!
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
Merlin5x5 replied Mar 18, 2008
Being unable to ping the network router address at 192.168.0.1 is very odd.
Specially so, if you are able to get to the internet.
Can you ping 192.168.1.1? Some brands of router use that third hex as the
number 1, and the Dlink may have been setup that way just to be compatible.
You must investigate your router. See what address it is actually set at.
Can you access it's web management interface with a browser?
Investigate it's setup and parameters, many routers are sold and then repack-
aged at the store when they are returned. Never assume they are setup as
they are documented on the package.
Use the computer that can access the internet. Ping the router address(s).
in linux, use the route -n command to find the default router address.
It may have been assigned in different ways, but here is typical output.
Kernel IP routing tableDestination
Gateway
Genmask
Flags Metric Ref
Use Iface192.168.1.0
0.0.0.0
255.255.255.0
U
0
0
0 ra00.0.0.0
192.168.1.1
0.0.0.0
UG
0
0
This is for a typical router that uses 1 as the third hex. A Dlink should be
reporting 192.168.0.1.
Good luck.
Merlin5x5
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
Mastaneh Bamdad replied Mar 18, 2008
Dear Merlin5x5,
I have access to my wireless D-link router via a web page, actually I type the http://192.168.0.1 and can setup it, it doesn't have any difficult configuration! I checked it out and have asked from D-link Technichal Support for any extra configuration for Solaris, they said if I don't have any problem with Linux so the router doesn't have any more config for Solaris too!
It looks like the cable is down and there is no connection to the router via Solaris, but I have connection with this cable, Network card, router and computer via windows and Linux to the Internet but no way from Solaris!
Lots of appreciate for any help!
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
Merlin5x5 replied Mar 18, 2008
post the output of route -n
Merlin5x5
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
manafac replied Mar 18, 2008
You may want to check the arp cache on the router. The router may have bound the MAC address to the Linux IP address. I'm not sure Solaris sends a gratuitous arp when it starts up.
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
Solaris_Guy replied Mar 18, 2008
Hi Manafac,
Solaris always sends a gratuitous arp upon boot. This allows it to see if
there is a duplicate IP
address on the local network.
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
Solaris_Guy replied Mar 19, 2008
Okay. The netmask looks good. Are you able to ping any other hosts on the
local network? Have
you tried changing the cable to another switch port? Are you using VLANs?
Please send output of
netstat -pn, netstat -rn, ping -sR 192.168.0.109.
HTH
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
Solaris_Guy replied Mar 19, 2008
The fact you can ping your host's IP address and the loopback IP address
does not really mean
anything.
This is why: all packets, before leaving their appropriate network
interface, go into the IP output
function. The Ethernet driver logic then looks at the packet's destination
IP address. If the destination
IP address is a broadcast or multicast address, the packet goes to the IP
input queue on the
loopback driver, which sends the packet back to the IP input function and
sends it back up the stack.
The packet never hits the network interface or hardware layers.
If the destination IP address is the host's IP address or the loopback IP
address, this packet also
goes to the IP input queue on the loopback driver, which again sends the
packet back to the IP input
function and again sends it back up the stack. This packet also never hits
the network interface or
hardware layers.
If neither condition above exists, the Ethernet driver logic sends an ARP
request to get the
destination MAC, and upon receiving that, completes the Ethernet
frame/packet and sends it out the
interface and over the wire.
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
Kumaran Babugnanasundaram replied Mar 19, 2008
Have you checked the speed/duplex that the NIC is connecting at the moment. Given that the NIC cannot ping the default router which is on the same subnet indicates a problem on the NIC and has nothing do with resolv.conf,defaultrouter etc etc...
To confirm do a
#arp -a
you should see 192.168.0.1 & its MAC
Do a
#kstat | grep link_mode
#kstat | grep link_speed
Now this should show what speed your solaris has settled for. I assume ur Router does a autonegotiate (default on most) and chances are that you are forcing the speed/duplex from the startup scripts. When this happens there is a speed/duplex mismatch and effectively leaving your NIC unable to connect.
Check your /etc/system file if you are forcing the speed or doing an autoneg... I would suggest autoneg and check if that helps.
Also, do a
# grep ndd /etc/rc2.d/*
This should show if there is a startup script that forces the speed/duplex on the NIC.
Good Luck!!!
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
hyattdj replied Mar 20, 2008
I am having similiar issues, I have a 4200
The quad is marked net0-3
The software interface is like
1000g0
1000g1
ge0
ge1
My default route is 172.77.4.254
my ip is 172.77.4.16
(monkeyed the ips a little for security)
I can ping the ip address with or without a cable
I cannot ping the router, or anything else on the subnet
I can ping the router from other machines on the subnet
The netmask is 255.255.255.0
Stumped first level Sun Support
How can I isolate it from a Software, hardware, network issue?
It used to be if you did not have a cable
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
Mastaneh Bamdad replied Mar 20, 2008
Kumaran Babugnanasundaram via solaris-l <email@removed wrote:
Hi dear Rbkumaran,
Thank you for your guides, really were wonderful!
About the result of # arp -a I got vfe0, my NIC device name instead of nameserver but the IP Addess, Mask and Mac address is for my router! actually are as below:
Device
IP Address
Mask
Flags
Phys Addr
----------
---------------------
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
Mastaneh Bamdad replied Mar 20, 2008
Hi there,
I have tried with three different NIC cards, different cables and ports!
Those work properly with Win2003 and Linux on the same computer.
#netstat -pn
Net to Media Table: IPv4
Device
IP Address
Mask
Flags
Phys Addr
----------
---------------------
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
Mastaneh Bamdad replied Mar 20, 2008
Hi dear Kumaran,
Thank you for your guides, really were wonderful!
About the result of # arp -a I got vfe0, my NIC device name instead of nameserver but the IP Addess, Mask and Mac address is for my router! actually are as below:
Device
IP Address
Mask
Flags
Phys Addr
----------
---------------------
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
Mastaneh Bamdad replied Mar 20, 2008
Kumaran Babugnanasundaram via solaris-l <email@removed wrote:
Have you checked the speed/duplex that the NIC is connecting at the moment. Given that the NIC cannot ping the default router which is on the same subnet indicates a problem on the NIC and has nothing do with resolv.conf,defaultrouter etc etc...
To confirm do a
#arp -a
you should see 192.168.0.1 & its MAC
Do a
#kstat | grep link_mode
#kstat | grep link_speed
Now this should show what speed your solaris has settled for. I assume ur Router does a autonegotiate (default on most) and chances are that you are forcing the speed/duplex from the startup scripts. When this happens there is a speed/duplex mismatch and effectively leaving your NIC unable to connect.
Check your /etc/system file if you are forcing the speed or doing an autoneg... I would suggest autoneg and check if that helps.
Also, do a
# grep ndd /etc/rc2.d/*
This should show if there is a startup script that forces the speed/duplex on the NIC.
Good Luck!!!
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
Kumaran Babugnanasundaram replied Mar 21, 2008
Thanks
Ok, from ur message I assume, ur system arp -a output does show the routers IP addres and MAC. If so thats promising.
How about the speed / Duplex tests? any outputs would prove helpful
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
Solaris_Guy replied Mar 22, 2008
Can you ping any other hosts on your local network?
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
Mastaneh Bamdad replied Mar 23, 2008
Hi there,
No I cannot ping to any computer in my network!
Thanx.
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
Solaris_Guy replied Mar 23, 2008
Given that you have 2Xe1000gX interfaces and 2XgeX interfaces, this is an
X4200 M2.
You can always ping your IP address with or without a cable.
What does your ifconfig -a output display?
To which interface i your cable connected? IIRC, 0 and 1 are the geX ports
and 2 and 3 are the e1000gX ports.
I am having similiar issues, I have a 4200
The quad is marked net0-3
The software interface is like
1000g0
1000g1
ge0
ge1
My default route is 172.77.4.254
my ip is 172.77.4.16
(monkeyed the ips a little for security)
I can ping the ip address with or without a cable
I cannot ping the router, or anything else on the subnet
I can ping the router from other machines on the subnet
The netmask is 255.255.255.0
Stumped first level Sun Support
How can I isolate it from a Software, hardware, network issue?
It used to be if you did not have a cable in it, you could not ping the
interface.
This thread has been closed due to inactivity.
Start a new thread here
X
Get Answers - It's Free
If you're looking for Solaris help, sign up and take advantage of 11,206 UNIX professionals who are here to help you.
PCMag Digital Group
TRUSTe Privacy Certification
|
{
"url": "http://unix.ittoolbox.com/groups/technical-functional/solaris-l/the-internet-connecting-problem-1967796",
"source_domain": "unix.ittoolbox.com",
"snapshot_id": "crawl=CC-MAIN-2015-48",
"warc_metadata": {
"Content-Length": "277212",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ISEGDWJLV2DJJZA5A7S23YRSAERSLVAD",
"WARC-Concurrent-To": "<urn:uuid:0927a828-c701-4785-b62d-6538939534de>",
"WARC-Date": "2015-11-25T14:21:27Z",
"WARC-IP-Address": "23.3.13.217",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:LR4LJAXYJLTXP3WCDVOH6CNPCLRSI6BL",
"WARC-Record-ID": "<urn:uuid:4c19eadb-084f-4b84-84f5-3f54c5c086db>",
"WARC-Target-URI": "http://unix.ittoolbox.com/groups/technical-functional/solaris-l/the-internet-connecting-problem-1967796",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:55711c47-aae8-47e3-93dc-909399c117c2>"
},
"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,
7,
25,
34,
54,
71,
89,
97,
98,
125,
126,
157,
171,
180,
181,
227,
236,
277,
309,
432,
433,
466,
467,
476,
530,
565,
613,
666,
718,
771,
822,
864,
919,
969,
1023,
1033,
1056,
1066,
1067,
1122,
1150,
1161,
1163,
1199,
1241,
1252,
1285,
1294,
1364,
1394,
1456,
1460,
1462,
1498,
1540,
1551,
1582,
1659,
1704,
1706,
1742,
1784,
1795,
1832,
1845,
1846,
1916,
1984,
2003,
2004,
2011,
2013,
2049,
2091,
2102,
2136,
2208,
2283,
2289,
2358,
2434,
2510,
2515,
2589,
2640,
2645,
2647,
2683,
2725,
2736,
2767,
2818,
2872,
2923,
2977,
3032,
3033,
3086,
3141,
3198,
3250,
3304,
3305,
3363,
3419,
3465,
3466,
3476,
3478,
3514,
3556,
3567,
3604,
3616,
3617,
3632,
3633,
3639,
3640,
3693,
3694,
3794,
3796,
3832,
3874,
3885,
3922,
3936,
3937,
4069,
4070,
4197,
4198,
4222,
4223,
4343,
4344,
4418,
4419,
4439,
4441,
4477,
4519,
4530,
4567,
4578,
4579,
4605,
4606,
4631,
4632,
4647,
4648,
4654,
4655,
4708,
4709,
4809,
4810,
4835,
4836,
4905,
4906,
4908,
4909,
4915,
4916,
4924,
4925,
4927,
4928,
4930,
4931,
4933,
4934,
4943,
4944,
4946,
4947,
4964,
4965,
5023,
5024,
5032,
5033,
5110,
5111,
5133,
5134,
5145,
5146,
5158,
5159,
5183,
5184,
5196,
5197,
5213,
5214,
5224,
5225,
5235,
5236,
5250,
5251,
5259,
5260,
5268,
5269,
5312,
5313,
5351,
5352,
5359,
5360,
5366,
5367,
5371,
5372,
5399,
5400,
5420,
5421,
5444,
5445,
5459,
5460,
5477,
5478,
5496,
5497,
5524,
5525,
5537,
5538,
5546,
5547,
5559,
5560,
5565,
5566,
5592,
5594,
5630,
5672,
5683,
5720,
5736,
5737,
5773,
5774,
6005,
6006,
6100,
6101,
6168,
6169,
6242,
6243,
6442,
6443,
6553,
6554,
6578,
6580,
6616,
6658,
6669,
6706,
6725,
6726,
6754,
6755,
6884,
6885,
6906,
6908,
6944,
6986,
6997,
7028,
7104,
7158,
7159,
7233,
7309,
7310,
7384,
7445,
7446,
7524,
7597,
7633,
7634,
7709,
7710,
7781,
7782,
7855,
7856,
7891,
7892,
7900,
7901,
7909,
7910,
7927,
7928,
7949,
7950,
7958,
7959,
7973,
7974,
7976,
7977,
7979,
7980,
7982,
7983,
7996,
7997,
8009,
8010,
8018,
8019,
8022,
8023,
8025,
8026,
8028,
8029,
8106,
8129,
8130,
8141,
8142,
8152,
8154,
8190,
8232,
8243,
8280,
8296,
8297,
8671,
8672,
8894,
8895,
8928,
8930,
8966,
9008,
9019,
9050,
9078,
9079,
9089,
9091,
9127,
9169,
9180,
9209,
9390,
9392,
9428,
9470,
9481,
9514,
9526,
9600,
9624,
9654,
9656,
9692,
9734,
9745,
9778,
9852,
9872,
9946,
9968,
10018,
10022,
10024,
10060,
10102,
10113,
10146,
10219,
10240,
10250,
10317,
10350,
10425,
10456,
10530,
10549,
10623,
10651,
10715,
10789,
10815,
10888,
10916,
10991,
11016,
11033,
11107,
11126,
11191,
11225,
11254,
11256,
11292,
11334,
11345,
11392,
11638,
11654,
11662,
11699,
11704,
11728,
11753,
12056,
12185,
12196,
12220,
12307,
12320,
12322,
12358,
12400,
12411,
12440,
12483,
12509,
12540,
12547,
12554,
12558,
12562,
12595,
12616,
12657,
12707,
12764,
12820,
12849,
12881,
12944,
12986,
12988,
13024,
13066,
13077,
13114,
13176,
13177,
13196,
13197,
13247,
13248,
13411,
13412,
13419,
13420,
13431,
13432,
13437,
13438,
13444,
13445,
13455,
13456,
13467,
13468,
13490,
13492,
13528,
13570,
13581,
13618,
13628,
13629,
13702,
13703,
13768,
13769,
13782,
13783,
13808,
13809,
13816,
13817,
13828,
13829,
13834,
13835,
13841,
13842,
13852,
13853,
13864,
13865,
13887,
13889,
13925,
13967,
13978,
14015,
14032,
14033,
14083,
14084,
14247,
14248,
14255,
14256,
14267,
14268,
14273,
14274,
14280,
14281,
14291,
14292,
14303,
14304,
14326,
14328,
14364,
14406,
14417,
14454,
14516,
14517,
14763,
14779,
14787,
14824,
14829,
14853,
14878,
15181,
15310,
15321,
15345,
15432,
15445,
15447,
15483,
15525,
15536,
15583,
15590,
15708,
15776,
15778,
15814,
15856,
15867,
15900,
15952,
15954,
15990,
16032,
16043,
16080,
16090,
16091,
16139,
16140,
16147,
16149,
16185,
16227,
16238,
16271,
16345,
16355,
16416,
16459,
16534,
16569,
16612,
16638,
16669,
16676,
16683,
16687,
16691,
16724,
16745,
16786,
16836,
16893,
16949,
16978,
17010,
17073,
17145,
17156,
17203,
17227,
17229,
17253,
17371,
17372,
17392,
17393
],
"line_end_idx": [
7,
25,
34,
54,
71,
89,
97,
98,
125,
126,
157,
171,
180,
181,
227,
236,
277,
309,
432,
433,
466,
467,
476,
530,
565,
613,
666,
718,
771,
822,
864,
919,
969,
1023,
1033,
1056,
1066,
1067,
1122,
1150,
1161,
1163,
1199,
1241,
1252,
1285,
1294,
1364,
1394,
1456,
1460,
1462,
1498,
1540,
1551,
1582,
1659,
1704,
1706,
1742,
1784,
1795,
1832,
1845,
1846,
1916,
1984,
2003,
2004,
2011,
2013,
2049,
2091,
2102,
2136,
2208,
2283,
2289,
2358,
2434,
2510,
2515,
2589,
2640,
2645,
2647,
2683,
2725,
2736,
2767,
2818,
2872,
2923,
2977,
3032,
3033,
3086,
3141,
3198,
3250,
3304,
3305,
3363,
3419,
3465,
3466,
3476,
3478,
3514,
3556,
3567,
3604,
3616,
3617,
3632,
3633,
3639,
3640,
3693,
3694,
3794,
3796,
3832,
3874,
3885,
3922,
3936,
3937,
4069,
4070,
4197,
4198,
4222,
4223,
4343,
4344,
4418,
4419,
4439,
4441,
4477,
4519,
4530,
4567,
4578,
4579,
4605,
4606,
4631,
4632,
4647,
4648,
4654,
4655,
4708,
4709,
4809,
4810,
4835,
4836,
4905,
4906,
4908,
4909,
4915,
4916,
4924,
4925,
4927,
4928,
4930,
4931,
4933,
4934,
4943,
4944,
4946,
4947,
4964,
4965,
5023,
5024,
5032,
5033,
5110,
5111,
5133,
5134,
5145,
5146,
5158,
5159,
5183,
5184,
5196,
5197,
5213,
5214,
5224,
5225,
5235,
5236,
5250,
5251,
5259,
5260,
5268,
5269,
5312,
5313,
5351,
5352,
5359,
5360,
5366,
5367,
5371,
5372,
5399,
5400,
5420,
5421,
5444,
5445,
5459,
5460,
5477,
5478,
5496,
5497,
5524,
5525,
5537,
5538,
5546,
5547,
5559,
5560,
5565,
5566,
5592,
5594,
5630,
5672,
5683,
5720,
5736,
5737,
5773,
5774,
6005,
6006,
6100,
6101,
6168,
6169,
6242,
6243,
6442,
6443,
6553,
6554,
6578,
6580,
6616,
6658,
6669,
6706,
6725,
6726,
6754,
6755,
6884,
6885,
6906,
6908,
6944,
6986,
6997,
7028,
7104,
7158,
7159,
7233,
7309,
7310,
7384,
7445,
7446,
7524,
7597,
7633,
7634,
7709,
7710,
7781,
7782,
7855,
7856,
7891,
7892,
7900,
7901,
7909,
7910,
7927,
7928,
7949,
7950,
7958,
7959,
7973,
7974,
7976,
7977,
7979,
7980,
7982,
7983,
7996,
7997,
8009,
8010,
8018,
8019,
8022,
8023,
8025,
8026,
8028,
8029,
8106,
8129,
8130,
8141,
8142,
8152,
8154,
8190,
8232,
8243,
8280,
8296,
8297,
8671,
8672,
8894,
8895,
8928,
8930,
8966,
9008,
9019,
9050,
9078,
9079,
9089,
9091,
9127,
9169,
9180,
9209,
9390,
9392,
9428,
9470,
9481,
9514,
9526,
9600,
9624,
9654,
9656,
9692,
9734,
9745,
9778,
9852,
9872,
9946,
9968,
10018,
10022,
10024,
10060,
10102,
10113,
10146,
10219,
10240,
10250,
10317,
10350,
10425,
10456,
10530,
10549,
10623,
10651,
10715,
10789,
10815,
10888,
10916,
10991,
11016,
11033,
11107,
11126,
11191,
11225,
11254,
11256,
11292,
11334,
11345,
11392,
11638,
11654,
11662,
11699,
11704,
11728,
11753,
12056,
12185,
12196,
12220,
12307,
12320,
12322,
12358,
12400,
12411,
12440,
12483,
12509,
12540,
12547,
12554,
12558,
12562,
12595,
12616,
12657,
12707,
12764,
12820,
12849,
12881,
12944,
12986,
12988,
13024,
13066,
13077,
13114,
13176,
13177,
13196,
13197,
13247,
13248,
13411,
13412,
13419,
13420,
13431,
13432,
13437,
13438,
13444,
13445,
13455,
13456,
13467,
13468,
13490,
13492,
13528,
13570,
13581,
13618,
13628,
13629,
13702,
13703,
13768,
13769,
13782,
13783,
13808,
13809,
13816,
13817,
13828,
13829,
13834,
13835,
13841,
13842,
13852,
13853,
13864,
13865,
13887,
13889,
13925,
13967,
13978,
14015,
14032,
14033,
14083,
14084,
14247,
14248,
14255,
14256,
14267,
14268,
14273,
14274,
14280,
14281,
14291,
14292,
14303,
14304,
14326,
14328,
14364,
14406,
14417,
14454,
14516,
14517,
14763,
14779,
14787,
14824,
14829,
14853,
14878,
15181,
15310,
15321,
15345,
15432,
15445,
15447,
15483,
15525,
15536,
15583,
15590,
15708,
15776,
15778,
15814,
15856,
15867,
15900,
15952,
15954,
15990,
16032,
16043,
16080,
16090,
16091,
16139,
16140,
16147,
16149,
16185,
16227,
16238,
16271,
16345,
16355,
16416,
16459,
16534,
16569,
16612,
16638,
16669,
16676,
16683,
16687,
16691,
16724,
16745,
16786,
16836,
16893,
16949,
16978,
17010,
17073,
17145,
17156,
17203,
17227,
17229,
17253,
17371,
17372,
17392,
17393,
17421
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 17421,
"ccnet_original_nlines": 611,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3363117277622223,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.035492680966854095,
"rps_doc_frac_lines_end_with_ellipsis": 0.003267969936132431,
"rps_doc_frac_no_alph_words": 0.27748820185661316,
"rps_doc_frac_unique_words": 0.21152542531490326,
"rps_doc_mean_word_length": 4.499321937561035,
"rps_doc_num_sentences": 325,
"rps_doc_symbol_to_word_ratio": 0.006701409816741943,
"rps_doc_unigram_entropy": 5.499934196472168,
"rps_doc_word_count": 2950,
"rps_doc_frac_chars_dupe_10grams": 0.4333609640598297,
"rps_doc_frac_chars_dupe_5grams": 0.4543057382106781,
"rps_doc_frac_chars_dupe_6grams": 0.4494839012622833,
"rps_doc_frac_chars_dupe_7grams": 0.44240185618400574,
"rps_doc_frac_chars_dupe_8grams": 0.4402923285961151,
"rps_doc_frac_chars_dupe_9grams": 0.4402923285961151,
"rps_doc_frac_chars_top_2gram": 0.010924429632723331,
"rps_doc_frac_chars_top_3gram": 0.018307840451598167,
"rps_doc_frac_chars_top_4gram": 0.028478870168328285,
"rps_doc_books_importance": -1809.79541015625,
"rps_doc_books_importance_length_correction": -1809.79541015625,
"rps_doc_openwebtext_importance": -888.5895385742188,
"rps_doc_openwebtext_importance_length_correction": -888.5895385742188,
"rps_doc_wikipedia_importance": -794.0850830078125,
"rps_doc_wikipedia_importance_length_correction": -794.0850830078125
},
"fasttext": {
"dclm": 0.022105159237980843,
"english": 0.902910590171814,
"fineweb_edu_approx": 1.0929336547851562,
"eai_general_math": 0.024389149621129036,
"eai_open_web_math": 0.16125547885894775,
"eai_web_code": 0.006079440005123615
}
}
|
{
"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": "005.458",
"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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
1,274,718,176,503,675,600 |
Deleting a public queue doesn’t stop MSMQ sending messages
Public queues, as opposed to private queues, don't delete as quickly as you'd expect. Sometimes it can take a full quarter of an hour before the queue you've just deleted finally disappears.
Looking at:
Message Queuing (MSMQ): Directory Service Change Notification Protocol Specification
and scrolling down to page 37 you will find Note #25 which says:
"<25> Section 3.1.4.4: On Windows NT and Windows 2000, queue managers process notification messages as soon as they arrive. In contrast, on Windows XP, Windows Server 2003, and Windows Vista, queue managers process notification messages as soon as they arrive for messages from directory services and schedule notification messages to be processed at specific time intervals for messages from queue managers. Notification messages from queue managers are processed at a maximum rate of once per 15 minutes to prevent denial of service attacks."
To explain this further, I'll use an example.
• Machine HOST runs MSMQ and has a queue called STOCK
• Machine ADMIN runs MSMQ and "Active Directory: Users and Computers".
• Machine OURDC is the Active Directory domain controller.
The steps are as follows:
1. An administrator sitting at ADMIN uses "AD:Users and Computers" to delete the STOCK public queue.
2. The corresponding queue object is deleted from Active Directory.
3. The MSMQ queue manager on ADMIN sends an internal notification message (containing the object GUID of the queue to be deleted) to the private queue called notify_queue$ on HOST. Being an internal queue, you won't be able to see this message except in a Network Monitor trace.
4. The MSMQ queue manager on HOST receives and processes the message.
5. If HOST has not received any other notifications recently then it's queue manager will contact OURDC immediately to determine the status of the queue olther it will wait 15 minutes.
6. After querying OURDC over LDAP, the STOCK queue is deleted.
So how can you delete a queue and get messages to stop being delivered at the same time?
This really depends on how many machines are sending messages. 10? 100? 1,000?
Here are a few examples:
• If there are only a few senders then you could pause the appropriate outgoing queue. There would have to be some signalling mechanism to enable this, such as a thread watching an admin queue for pause requests from the application that needs to delete the public queue.
• The destination's MSMQ service could be taken off-line but that would affect all the other hosted queues too.
• Use private instead of public queues (although that does eliminate some functionality, such as authentication and encryption).
Comments (0)
Skip to main content
|
{
"url": "https://blogs.msdn.microsoft.com/johnbreakwell/2008/05/12/deleting-a-public-queue-doesnt-stop-msmq-sending-messages/",
"source_domain": "blogs.msdn.microsoft.com",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "49717",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WVMLYTCC2Y7VOOKHQNDXNKVRH7NU7EN7",
"WARC-Concurrent-To": "<urn:uuid:903eb262-c1d4-4733-8a9c-75b660396502>",
"WARC-Date": "2017-10-23T00:59:00Z",
"WARC-IP-Address": "23.49.183.10",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IUSWWPK2BN4LVFMKLI7BIDGJL37NHEOE",
"WARC-Record-ID": "<urn:uuid:bacc9eb5-abfa-4fec-a6c2-18e266e2950e>",
"WARC-Target-URI": "https://blogs.msdn.microsoft.com/johnbreakwell/2008/05/12/deleting-a-public-queue-doesnt-stop-msmq-sending-messages/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:041d830c-e95e-4c25-b08e-e7bf790ca9f5>"
},
"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,
59,
60,
61,
252,
253,
254,
266,
267,
268,
353,
354,
355,
422,
423,
424,
425,
970,
971,
972,
1018,
1019,
1020,
1021,
1077,
1078,
1151,
1152,
1213,
1214,
1240,
1241,
1242,
1243,
1244,
1347,
1348,
1349,
1419,
1420,
1421,
1702,
1703,
1704,
1776,
1777,
1778,
1965,
1966,
1967,
2032,
2033,
2122,
2123,
2124,
2203,
2204,
2205,
2230,
2231,
2232,
2233,
2507,
2508,
2622,
2623,
2754,
2755,
2768,
2769
],
"line_end_idx": [
59,
60,
61,
252,
253,
254,
266,
267,
268,
353,
354,
355,
422,
423,
424,
425,
970,
971,
972,
1018,
1019,
1020,
1021,
1077,
1078,
1151,
1152,
1213,
1214,
1240,
1241,
1242,
1243,
1244,
1347,
1348,
1349,
1419,
1420,
1421,
1702,
1703,
1704,
1776,
1777,
1778,
1965,
1966,
1967,
2032,
2033,
2122,
2123,
2124,
2203,
2204,
2205,
2230,
2231,
2232,
2233,
2507,
2508,
2622,
2623,
2754,
2755,
2768,
2769,
2789
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2789,
"ccnet_original_nlines": 69,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3519553244113922,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04841712862253189,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19366852939128876,
"rps_doc_frac_unique_words": 0.48769575357437134,
"rps_doc_mean_word_length": 4.901566028594971,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0.0018621999770402908,
"rps_doc_unigram_entropy": 4.963775157928467,
"rps_doc_word_count": 447,
"rps_doc_frac_chars_dupe_10grams": 0.05294385924935341,
"rps_doc_frac_chars_dupe_5grams": 0.07211319357156754,
"rps_doc_frac_chars_dupe_6grams": 0.05294385924935341,
"rps_doc_frac_chars_dupe_7grams": 0.05294385924935341,
"rps_doc_frac_chars_dupe_8grams": 0.05294385924935341,
"rps_doc_frac_chars_dupe_9grams": 0.05294385924935341,
"rps_doc_frac_chars_top_2gram": 0.023733459413051605,
"rps_doc_frac_chars_top_3gram": 0.018256500363349915,
"rps_doc_frac_chars_top_4gram": 0.02921040914952755,
"rps_doc_books_importance": -196.1807403564453,
"rps_doc_books_importance_length_correction": -196.1807403564453,
"rps_doc_openwebtext_importance": -96.93987274169922,
"rps_doc_openwebtext_importance_length_correction": -96.93987274169922,
"rps_doc_wikipedia_importance": -84.1171646118164,
"rps_doc_wikipedia_importance_length_correction": -84.1171646118164
},
"fasttext": {
"dclm": 0.17894667387008667,
"english": 0.9275684356689453,
"fineweb_edu_approx": 1.538823127746582,
"eai_general_math": 0.5723209381103516,
"eai_open_web_math": 0.07701641321182251,
"eai_web_code": 0.6148484349250793
}
}
|
{
"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": "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": "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
|
8,481,164,860,285,643,000 |
What Is Encryption in Computer Security?
Encryption is a crucial component of laptop security, protecting files in storage or perhaps while transferring data. This changes readable text to unreadable code (ciphertext), and only people who possess the security key or cipher can access it. There are two primary types of encryption – symmetric and asymmetric – and several algorithms to aid along the way.
For centuries, people have used strategy codes to conceal details and help to make it difficult to intercept or comprehend messages. The study of methods for covering or hiding information is named cryptography, and modern encryption is based on these types of bigtechinfo.com/ historic techniques.
Contemporary encryption uses mathematical methods to scramble digital facts, making it almost unattainable for someone with no proper key to read or decode it. For example , people and zeros that make up a digital document encoded with 128-bit Advanced Encryption Typical would have to become rearranged much more than ten trillion times with no right essential for the file being deciphered.
Whilst encryption can certainly help protect a business’s data from cyber-terrorist, it’s not a foolproof measure against cybercrimes. Actually targeted ransomware attacks sometimes focus on taking an organization’s encryption keys.
It’s also important to understand that actually encrypted data is insecure, and that it’s a good idea practice to back up any information kept on a machine that has been configured with encryption tools. This way, in the event that an encrypted disc becomes damaged or falls flat, the user is going to still have the backup to restore the system and recover the lost data.
Leave a Reply
Your email address will not be published. Required fields are marked *
|
{
"url": "https://aproximit.com/index.php/2023/07/17/what-is-encryption-in-computer-security/",
"source_domain": "aproximit.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "58045",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5E56BIQKHMN7WLO2NALFJOP5VYNEFVF2",
"WARC-Concurrent-To": "<urn:uuid:4982288b-6ca2-480e-afcd-0085843ff06b>",
"WARC-Date": "2024-03-04T21:18:44Z",
"WARC-IP-Address": "172.67.209.86",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2HTATCCATEYGPGC6SGRUKRE6ZZLEGQFL",
"WARC-Record-ID": "<urn:uuid:2254c772-92e5-4c39-8050-0c1f5bc8d0f9>",
"WARC-Target-URI": "https://aproximit.com/index.php/2023/07/17/what-is-encryption-in-computer-security/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:dc79261f-75d3-4d4e-99bd-28f6d7b74b7f>"
},
"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-239\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,
41,
42,
43,
407,
408,
707,
708,
1101,
1102,
1335,
1336,
1709,
1710,
1711,
1725,
1726
],
"line_end_idx": [
41,
42,
43,
407,
408,
707,
708,
1101,
1102,
1335,
1336,
1709,
1710,
1711,
1725,
1726,
1796
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1796,
"ccnet_original_nlines": 16,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4192546606063843,
"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.11490683257579803,
"rps_doc_frac_unique_words": 0.6428571343421936,
"rps_doc_mean_word_length": 5.27142858505249,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.905752658843994,
"rps_doc_word_count": 280,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.016260160133242607,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -158.32933044433594,
"rps_doc_books_importance_length_correction": -153.3069610595703,
"rps_doc_openwebtext_importance": -83.71192932128906,
"rps_doc_openwebtext_importance_length_correction": -83.71192932128906,
"rps_doc_wikipedia_importance": -59.801048278808594,
"rps_doc_wikipedia_importance_length_correction": -59.36015701293945
},
"fasttext": {
"dclm": 0.33477526903152466,
"english": 0.9484931230545044,
"fineweb_edu_approx": 2.9115617275238037,
"eai_general_math": 0.00086957000894472,
"eai_open_web_math": 0.16863662004470825,
"eai_web_code": 0.00009143000352196395
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-891,791,826,718,094,700 |
Take the 2-minute tour ×
Super User is a question and answer site for computer enthusiasts and power users. It's 100% free, no registration required.
I have a Dell Latitude E5400 laptop running Windows 7.
Everything runs fine on it for days then I suddenly notice the enter/return key is no longer working e.g. I could be writing an email, press enter for a new line but it doesn’t ‘register’ – so no new line. I thought it might be some dirt under the key perhaps so I tried running the Windows onscreen keyboard but the Enter key on that doesn’t work either.
A reboot always fixes the problem but it’s a pain. Any ideas a) how to fix it and b) out of interest, is there some other key combination that I can use as an alternative to using the Enter key when I need to?
UPDATE: Thanks to CarlF's suggestion, I tried exiting running programmes and found it seems to be a problem with PhraseExpress.
share|improve this question
You could always launch the on-screen keyboard as a backup. Start -> All Programs -> Accessories -> Ease of Access – Shinrai Jan 14 '11 at 17:42
Huh? As I said, the enter key on the onscreen keyboard doesn't work either. – andygrunt Jan 14 '11 at 18:20
Whoops! Missed that, it sort of vanished into that paragraph there. – Shinrai Jan 17 '11 at 15:28
I had a possibly related problem on my HP Probook 4530s while running Linux. Working at the command line, all of a sudden my enter key didn't result in a return, but rather printed '^M'. In any case, restarting my computer got rid of the problem, at least for now. – Bepetersn Apr 23 at 16:56
3 Answers 3
up vote 11 down vote accepted
This happens after days, right? Try killing the running programs one by one. It's possible that one piece of software has a memory leak and gets increasingly bloated over days until it starts doing weird stuff. Use the Task Manager to be sure their are no applications running, then check whether Enter is still locked out.
The other thing that occurs to me is a keyboard shortcut being assigned to Enter. I don't know that this could happen spontaneously, though.
Finally, in most programs Ctrl+M substituted for Enter, but many Windows programs now don't allow this.
share|improve this answer
I do turn my laptop off at night so it's not like it's running for several days at a time. Yes, killing the programs and checking is a good thought but I only usually have email and a word processor running - I'll check next time it happens though. Thanks for the idea. – andygrunt Jan 14 '11 at 20:17
3
Looks like it's a (known) problem with PhraseExpress. If I exit it, Return works as normal. Thanks again for the suggestion CarlF. – andygrunt Jan 15 '11 at 18:30
This is a known problem with Phrase Express. Had to hard kill it too since quit wasn't shutting it down.
Apparently you can stop it from registering enter in expert options as described in this Stack Overflow answer
In PhraseExpress, please disable the expert option "Route TAB and ENTER through PhraseExpress" if you experience problems those keys.
Screenshot:
enter image description here
Please also note that using multipe Text Expander simultaneously may introduce interferences as you experienced. Unfortunately, there is no way to get around this limitation for us vendors.
Michael Schmidt PhraseExpress Team
share|improve this answer
I had this problem on my old laptop and it turned out that it was just that the keys that were not registering was just shorting out and the whole thing needed to be replaced. You might want to try to do a Windows Update and see if there are any other programs that need to be updated to rule out that issue first since it's so extreme.
share|improve this answer
1
But as the Enter key on the onscreen keyboard doesn't work either, that suggests it's not something physical with the keyboard. – andygrunt Jan 14 '11 at 18:21
protected by Community Feb 25 '13 at 6:05
Thank you for your interest in this question. Because it has attracted low-quality answers, posting an answer now requires 10 reputation on this site.
Would you like to answer one of these unanswered questions instead?
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://superuser.com/questions/233325/enter-return-key-stops-working",
"source_domain": "superuser.com",
"snapshot_id": "crawl=CC-MAIN-2014-35",
"warc_metadata": {
"Content-Length": "76615",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LZZTTOMYWQQ7JRWX4K7K42SYIEVDLOMB",
"WARC-Concurrent-To": "<urn:uuid:6ac7ac4c-28f8-41d5-a95c-4ddf8fb86a5b>",
"WARC-Date": "2014-08-27T17:39:45Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:ARDTKFFLMBGWXBHUDD5DF7XJ6CUYNPC6",
"WARC-Record-ID": "<urn:uuid:5b752291-247c-4317-8cdb-b1abb1a80225>",
"WARC-Target-URI": "http://superuser.com/questions/233325/enter-return-key-stops-working",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3aba9d51-97c7-4f82-a6d2-235798f3c70f>"
},
"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,
25,
150,
151,
206,
207,
563,
564,
774,
775,
903,
904,
932,
937,
1083,
1088,
1197,
1202,
1301,
1306,
1600,
1601,
1613,
1614,
1644,
1645,
1969,
1970,
2111,
2112,
2216,
2217,
2243,
2248,
2551,
2555,
2719,
2720,
2825,
2826,
2937,
2938,
3072,
3073,
3085,
3086,
3115,
3116,
3306,
3307,
3342,
3343,
3369,
3370,
3707,
3708,
3734,
3738,
3899,
3900,
3942,
3943,
4094,
4095,
4163,
4164
],
"line_end_idx": [
25,
150,
151,
206,
207,
563,
564,
774,
775,
903,
904,
932,
937,
1083,
1088,
1197,
1202,
1301,
1306,
1600,
1601,
1613,
1614,
1644,
1645,
1969,
1970,
2111,
2112,
2216,
2217,
2243,
2248,
2551,
2555,
2719,
2720,
2825,
2826,
2937,
2938,
3072,
3073,
3085,
3086,
3115,
3116,
3306,
3307,
3342,
3343,
3369,
3370,
3707,
3708,
3734,
3738,
3899,
3900,
3942,
3943,
4094,
4095,
4163,
4164,
4254
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4254,
"ccnet_original_nlines": 65,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41906875371932983,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.026607539504766464,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19179600477218628,
"rps_doc_frac_unique_words": 0.47233468294143677,
"rps_doc_mean_word_length": 4.487179279327393,
"rps_doc_num_sentences": 44,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.381921768188477,
"rps_doc_word_count": 741,
"rps_doc_frac_chars_dupe_10grams": 0.028872180730104446,
"rps_doc_frac_chars_dupe_5grams": 0.04601503908634186,
"rps_doc_frac_chars_dupe_6grams": 0.04601503908634186,
"rps_doc_frac_chars_dupe_7grams": 0.028872180730104446,
"rps_doc_frac_chars_dupe_8grams": 0.028872180730104446,
"rps_doc_frac_chars_dupe_9grams": 0.028872180730104446,
"rps_doc_frac_chars_top_2gram": 0.007218049839138985,
"rps_doc_frac_chars_top_3gram": 0.013233079575002193,
"rps_doc_frac_chars_top_4gram": 0.010827070102095604,
"rps_doc_books_importance": -396.68963623046875,
"rps_doc_books_importance_length_correction": -396.68963623046875,
"rps_doc_openwebtext_importance": -179.26028442382812,
"rps_doc_openwebtext_importance_length_correction": -179.26028442382812,
"rps_doc_wikipedia_importance": -159.945068359375,
"rps_doc_wikipedia_importance_length_correction": -159.945068359375
},
"fasttext": {
"dclm": 0.027639690786600113,
"english": 0.9480288028717041,
"fineweb_edu_approx": 1.141104817390442,
"eai_general_math": 0.060941871255636215,
"eai_open_web_math": 0.23483490943908691,
"eai_web_code": 0.000783030001912266
}
}
|
{
"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": "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": "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": "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
|
-6,213,649,623,489,614,000 |
Verified Commit b4aa7ec0 authored by Camil Staps's avatar Camil Staps
Browse files
Fix translation of descriptor of unboxed arrays in copy_from_string_with_names
parent f6abbff0
......@@ -754,7 +754,7 @@ replace_desc_numbers_by_descs i s symbol_a symbol_offset array_desc
= replace_desc_numbers_by_descs (i+(IF_INT_64_OR_32 24 12)) s symbol_a symbol_offset array_desc;
# d = symbol_a.[d-1];
# d = d+symbol_offset;
# s=store_int_in_string s (i+IF_INT_64_OR_32 16 8) array_desc;
# s=store_int_in_string s (i+IF_INT_64_OR_32 16 8) (d-array_desc);
#! l = get_D_from_string s (i+IF_INT_64_OR_32 8 4);
| is_Int_D d
# l = l << IF_INT_64_OR_32 3 2;
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment
|
{
"url": "https://gitlab.science.ru.nl/clean-and-itasks/clean-graph-copy/-/commit/b4aa7ec0ec3c9ee08ff5e88352ed0a8f9390c396",
"source_domain": "gitlab.science.ru.nl",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "115212",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UVH4AYPMLNNKZK5A5EAO254K5FRWQYL7",
"WARC-Concurrent-To": "<urn:uuid:4732c9e3-a620-4ade-b1f4-ffc0b81a4ede>",
"WARC-Date": "2021-07-30T14:33:02Z",
"WARC-IP-Address": "131.174.16.187",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KBNPC3MCTUJ7XY5OZ6TYZIQOZKYXR7FW",
"WARC-Record-ID": "<urn:uuid:8d7f484d-06ea-4fb3-ab39-e8987e5567e7>",
"WARC-Target-URI": "https://gitlab.science.ru.nl/clean-and-itasks/clean-graph-copy/-/commit/b4aa7ec0ec3c9ee08ff5e88352ed0a8f9390c396",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:490748de-e68e-4b49-838e-8679a1c17fbc>"
},
"warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-148.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,
70,
83,
84,
163,
164,
180,
274,
371,
393,
416,
479,
546,
598,
611,
643,
650,
672,
680,
751,
786
],
"line_end_idx": [
70,
83,
84,
163,
164,
180,
274,
371,
393,
416,
479,
546,
598,
611,
643,
650,
672,
680,
751,
786,
815
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 815,
"ccnet_original_nlines": 20,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23749999701976776,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03125,
"rps_doc_frac_lines_end_with_ellipsis": 0.0476190485060215,
"rps_doc_frac_no_alph_words": 0.42500001192092896,
"rps_doc_frac_unique_words": 0.71875,
"rps_doc_mean_word_length": 6,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0.0625,
"rps_doc_unigram_entropy": 4.106697082519531,
"rps_doc_word_count": 96,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1145833283662796,
"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.0677083283662796,
"rps_doc_frac_chars_top_3gram": 0.069444440305233,
"rps_doc_frac_chars_top_4gram": 0.100694440305233,
"rps_doc_books_importance": -87.18762969970703,
"rps_doc_books_importance_length_correction": -87.18762969970703,
"rps_doc_openwebtext_importance": -46.95827865600586,
"rps_doc_openwebtext_importance_length_correction": -46.92934036254883,
"rps_doc_wikipedia_importance": -38.48451232910156,
"rps_doc_wikipedia_importance_length_correction": -38.48451232910156
},
"fasttext": {
"dclm": 0.13855290412902832,
"english": 0.6092820763587952,
"fineweb_edu_approx": 0.7661303877830505,
"eai_general_math": 0.0017643600003793836,
"eai_open_web_math": 0.4275386929512024,
"eai_web_code": -0.000009780000254977494
}
}
|
{
"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": "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": "1",
"label": "Truncated Snippets"
},
"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": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,737,031,101,020,888,300 |
Creating a remote access SSL VPN
We want to configure and deploy a connection to enable remote users to access a local network. The VPN establishes an encrypted tunnel to provide secure access to company resources through TCP on port 443.
Objectives
When you complete this unit, you’ll know how to do the following:
• Specify an address range for SSL VPN clients.
• Create a user group for SSL VPN clients and add a user.
• Define a local subnet and remote SSL VPN range.
• Add an SSL VPN remote access policy.
• Add a firewall rule.
• Download the SSL VPN client software from the client and connect to the internal network.
• Check connectivity.
Specify VPN settings
We specify an IP address range for SSL clients. This is a private address range. When SSL clients log on, they are assigned an address from the range.
1. Go to VPN and click Show VPN settings.
2. Specify a lease range.
3. Click Apply.
Create a user group and add a user
We create a user group for the remote SSL VPN and add a user. The group specifies a surfing quota and access time. Users in the group are allowed unlimited access.
1. Go to Authentication > Groups and click Add.
2. Specify settings.
OptionDescription
Name Remote SSL VPN group
Surfing quota Unlimited internet access
Access time Allowed all the time
3. Click Save.
4. Go to Authentication > Users and click Add.
5. Specify settings.
OptionDescription
User name john.smith
Name John Smith
Group Remote SSL VPN group
6. Click Save.
Define a local subnet and remote SSL VPN range
We create hosts for the local subnet and the remote SSL VPN range. The local subnet defines the network resources that remote clients will be able to access.
1. Go to Hosts and services > IP host and click Add.
2. Type a name and IP address for the local subnet.
3. Click Save.
4. Click Add.
5. Type a name and IP address for the remote subnet.
6. Click Save.
Add an SSL VPN remote access policy
We create a policy that allows clients in the “Remote SSL VPN group” to connect. These users are allowed to access resources on the local subnet.
1. Go to VPN > SSL VPN (remote access) and click Add.
2. Type a name and specify policy members and permitted network resources.
3. Click Apply.
Check authentication services
We use local authentication for firewall authentication methods and SSL VPN authentication methods.
1. Go to Authentication > Services.
2. Check that the authentication server is set to Local.
3. Scroll to SSL VPN authentication methods.
4. Check that the authentication server is set to Local.
Check device access settings
To be able to deploy the connection and to ensure that users have access to the connection, device access for SSL VPN and the user portal must be enabled.
1. Go to Administration > Device access.
2. Check access to SSL VPN and the user portal.
3. Click Apply.
Add a firewall rule
1. Go to Firewall and click + Add firewall rule > User/Network rule.
2. Specify settings.
3. Click Save.
Deploy the connection
Install an authentication client and connect to the internal network using the VPN connection.
The following steps take place on the client computer.
1. Log on to the user portal.
Warning We don't recommend enabling the web admin console on external facing (WAN) interfaces. This could allow hackers to easily identify the firewall vendor and type, and launch a targeted attack. If the user portal is not being used, we also recommend deactivating this service on WAN interfaces.
To restrict XG Firewall user portal and web admin console to local interfaces, go to Administration > Device Access, then deselect User Portal and HTTPS from the WAN zone.
If you enable the user portal on WAN interfaces, we recommend you set up two-factor authentication. See Configuring two-factor authentication.
2. Download the SSL VPN client.
3. Double-click the client installer file and follow the prompts to finish the installation.
4. Start the client and log on using the username and password.
Check connectivity
We check the connectivity from the client and on the firewall.
• From the client, check that you have been assigned an IP address from the SSL VPN range configured earlier in the firewall.
On Windows, start a command prompt and type ipconfig. You should see an address in the range 10.81.234.5 – 10.81.234.55.
• On the firewall, click Firewall and view traffic.
|
{
"url": "https://docs.sophos.com/nsg/sophos-firewall/17.5/Help/en-us/webhelp/onlinehelp/nsg/sfos/learningContents/CreatingRemoteAccessSSLVPN.html",
"source_domain": "docs.sophos.com",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "87056",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LA3FCT4USFBUQML245OR3IAV27W72RV2",
"WARC-Concurrent-To": "<urn:uuid:54687f0e-e64f-4635-a7e0-66dfb7690643>",
"WARC-Date": "2021-03-01T22:57:05Z",
"WARC-IP-Address": "23.193.34.16",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:COQZ3GEYKUSZ3PN6R5ERN5FXPNQCVKRE",
"WARC-Record-ID": "<urn:uuid:e8c4ee11-ee04-45ab-9726-41b796db65c5>",
"WARC-Target-URI": "https://docs.sophos.com/nsg/sophos-firewall/17.5/Help/en-us/webhelp/onlinehelp/nsg/sfos/learningContents/CreatingRemoteAccessSSLVPN.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3330cfa4-f90d-4181-a31b-09042e916175>"
},
"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-165.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,
33,
34,
240,
241,
252,
253,
319,
369,
429,
481,
522,
547,
641,
665,
666,
687,
688,
839,
840,
884,
912,
930,
931,
966,
967,
1131,
1132,
1182,
1205,
1227,
1257,
1301,
1338,
1355,
1404,
1427,
1449,
1474,
1494,
1525,
1542,
1543,
1590,
1591,
1749,
1750,
1805,
1859,
1876,
1892,
1947,
1964,
1965,
2001,
2002,
2148,
2149,
2205,
2282,
2300,
2301,
2331,
2332,
2432,
2433,
2471,
2530,
2577,
2636,
2637,
2666,
2667,
2822,
2823,
2866,
2916,
2934,
2935,
2955,
2956,
3027,
3050,
3067,
3068,
3090,
3091,
3186,
3187,
3242,
3243,
3275,
3579,
3580,
3756,
3757,
3904,
3905,
3939,
4034,
4100,
4101,
4120,
4121,
4184,
4185,
4313,
4438
],
"line_end_idx": [
33,
34,
240,
241,
252,
253,
319,
369,
429,
481,
522,
547,
641,
665,
666,
687,
688,
839,
840,
884,
912,
930,
931,
966,
967,
1131,
1132,
1182,
1205,
1227,
1257,
1301,
1338,
1355,
1404,
1427,
1449,
1474,
1494,
1525,
1542,
1543,
1590,
1591,
1749,
1750,
1805,
1859,
1876,
1892,
1947,
1964,
1965,
2001,
2002,
2148,
2149,
2205,
2282,
2300,
2301,
2331,
2332,
2432,
2433,
2471,
2530,
2577,
2636,
2637,
2666,
2667,
2822,
2823,
2866,
2916,
2934,
2935,
2955,
2956,
3027,
3050,
3067,
3068,
3090,
3091,
3186,
3187,
3242,
3243,
3275,
3579,
3580,
3756,
3757,
3904,
3905,
3939,
4034,
4100,
4101,
4120,
4121,
4184,
4185,
4313,
4438,
4491
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4491,
"ccnet_original_nlines": 107,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.262806236743927,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06681513786315918,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21046771109104156,
"rps_doc_frac_unique_words": 0.2610441744327545,
"rps_doc_mean_word_length": 4.602409839630127,
"rps_doc_num_sentences": 105,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.592761993408203,
"rps_doc_word_count": 747,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1663758009672165,
"rps_doc_frac_chars_dupe_6grams": 0.12449097633361816,
"rps_doc_frac_chars_dupe_7grams": 0.11169283837080002,
"rps_doc_frac_chars_dupe_8grams": 0.0738801583647728,
"rps_doc_frac_chars_dupe_9grams": 0.04770214855670929,
"rps_doc_frac_chars_top_2gram": 0.034904010593891144,
"rps_doc_frac_chars_top_3gram": 0.010180340148508549,
"rps_doc_frac_chars_top_4gram": 0.01396161038428545,
"rps_doc_books_importance": -308.15057373046875,
"rps_doc_books_importance_length_correction": -308.15057373046875,
"rps_doc_openwebtext_importance": -186.124267578125,
"rps_doc_openwebtext_importance_length_correction": -186.124267578125,
"rps_doc_wikipedia_importance": -109.66614532470703,
"rps_doc_wikipedia_importance_length_correction": -109.66614532470703
},
"fasttext": {
"dclm": 0.03270697966217995,
"english": 0.8207538723945618,
"fineweb_edu_approx": 1.3133262395858765,
"eai_general_math": 0.03333485126495361,
"eai_open_web_math": 0.034764230251312256,
"eai_web_code": 0.09646732360124588
}
}
|
{
"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.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": "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
|
583,107,368,926,157,000 |
Anon Anon - 8 months ago 34
C# Question
How do I redisplay an array after a mergesort algorithm so that each step is shown?
This is my mergesort method for sorting an array, it displays the sorted array fine, but how would I show each partially solved step?
public void mergeSort(string[] sortArray, int lower, int upper)
{
int middle;
if (upper == lower)
{
return;
}
else
{
middle = (lower + upper) / 2;
mergeSort(sortArray, lower, middle);
mergeSort(sortArray, middle + 1, upper);
Merge(sortArray, lower, middle + 1, upper);
}
}
I was thinking of adding
foreach (string a in sortArray)
{
txtOutput.Text += a + "\t";
}
To the end of the array, but then when I display the sorted method, all the partial solutions display together. Into something like
Sorted array:
1 8 7 3 1 7 3 8 1 3 7 8 1 3 7 8
I want to display it as
Partially sorted array:
1 8 7 3
1 7 3 8
1 3 7 8
Sorted array:
1 3 7 8
Answer
After the foreach loop append a newline('\n') to your output string.
if(lower == 0 && upper == sortArray.Length-1)
output +="Sorted Array:\n"
foreach(var a in sortedArray)
{
//Display Logic
}
|
{
"url": "https://codedump.io/share/4hJEW42rdDpY/1/how-do-i-redisplay-an-array-after-a-mergesort-algorithm-so-that-each-step-is-shown",
"source_domain": "codedump.io",
"snapshot_id": "crawl=CC-MAIN-2017-17",
"warc_metadata": {
"Content-Length": "26652",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KKFXEEJN4P3GJFJ5BXW7WZ7JHMGDTEO3",
"WARC-Concurrent-To": "<urn:uuid:d2e265a1-b815-4a34-be15-66b14fdc439e>",
"WARC-Date": "2017-04-30T14:58:11Z",
"WARC-IP-Address": "84.22.103.185",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:GRQQ27A3CUWKJ2HT2LYNJIS7T6MDM57H",
"WARC-Record-ID": "<urn:uuid:304ec97e-5ef1-432a-b648-f73118ccc46d>",
"WARC-Target-URI": "https://codedump.io/share/4hJEW42rdDpY/1/how-do-i-redisplay-an-array-after-a-mergesort-algorithm-so-that-each-step-is-shown",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b332677c-1f98-408f-9e0c-19967c18a93c>"
},
"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,
28,
40,
41,
125,
126,
260,
261,
262,
263,
327,
329,
341,
361,
363,
371,
373,
378,
380,
410,
447,
488,
532,
534,
535,
537,
538,
539,
540,
541,
542,
567,
568,
600,
602,
630,
632,
633,
765,
766,
780,
812,
813,
837,
838,
862,
863,
871,
872,
880,
881,
889,
890,
904,
905,
913,
914,
921,
922,
991,
992,
1038,
1068,
1069,
1099,
1101,
1117
],
"line_end_idx": [
28,
40,
41,
125,
126,
260,
261,
262,
263,
327,
329,
341,
361,
363,
371,
373,
378,
380,
410,
447,
488,
532,
534,
535,
537,
538,
539,
540,
541,
542,
567,
568,
600,
602,
630,
632,
633,
765,
766,
780,
812,
813,
837,
838,
862,
863,
871,
872,
880,
881,
889,
890,
904,
905,
913,
914,
921,
922,
991,
992,
1038,
1068,
1069,
1099,
1101,
1117,
1118
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1118,
"ccnet_original_nlines": 66,
"rps_doc_curly_bracket": 0.008944540284574032,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1875,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022058820351958275,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4227941334247589,
"rps_doc_frac_unique_words": 0.49189189076423645,
"rps_doc_mean_word_length": 4.270270347595215,
"rps_doc_num_sentences": 7,
"rps_doc_symbol_to_word_ratio": 0.0036764699034392834,
"rps_doc_unigram_entropy": 4.179219722747803,
"rps_doc_word_count": 185,
"rps_doc_frac_chars_dupe_10grams": 0.05822784826159477,
"rps_doc_frac_chars_dupe_5grams": 0.06329113990068436,
"rps_doc_frac_chars_dupe_6grams": 0.05822784826159477,
"rps_doc_frac_chars_dupe_7grams": 0.05822784826159477,
"rps_doc_frac_chars_dupe_8grams": 0.05822784826159477,
"rps_doc_frac_chars_dupe_9grams": 0.05822784826159477,
"rps_doc_frac_chars_top_2gram": 0.05569620057940483,
"rps_doc_frac_chars_top_3gram": 0.01518987026065588,
"rps_doc_frac_chars_top_4gram": 0.02025315910577774,
"rps_doc_books_importance": -131.32566833496094,
"rps_doc_books_importance_length_correction": -131.32566833496094,
"rps_doc_openwebtext_importance": -68.71009826660156,
"rps_doc_openwebtext_importance_length_correction": -61.81153869628906,
"rps_doc_wikipedia_importance": -65.18618774414062,
"rps_doc_wikipedia_importance_length_correction": -65.18618774414062
},
"fasttext": {
"dclm": 0.9908183217048645,
"english": 0.6010708212852478,
"fineweb_edu_approx": 1.2296947240829468,
"eai_general_math": 0.7453643679618835,
"eai_open_web_math": 0.08595871925354004,
"eai_web_code": 0.7210987210273743
}
}
|
{
"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.35",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Arithmetic"
}
}
},
"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": "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
|
2,179,678,622,047,058,400 |
Piwik configuration (Nginx and Apache with mod_php) on Centos 6.7
(Michael Alexander) #1
I have a problem with setting up Piwik with Nginx and Apache mod_php. I’ve tried with the non-piwik Nginx and end up like this
After that I have followed the piwik-nginx configuration, but I think I’m not configured it properly, I have several servers and divide them to this:
1. 192.168.10.171 with Nginx as Load Balancer
2. 192.168.10.163, 192.168.10.176 as Web-Server with Apache mod_php
3. 192,168.10.175 as Database Server
Suppose I have abc.blabla.com as a domain assigned to Piwik.
1. I’ve changed all stats.example.com with abc.blabla.com, changed root path according to the website directory on web server in sites-available/stats.example.com.conf.
2. Added web server in upstream_phpapache.conf like this
upstream phpapache {
ip_hash;
server 192.168.10.163 weight=1;
server 192.168.10.176 weight=1;
}
3. Commented out the include upstream_phpcgi.conf; line in nginx.conf. and uncomment the lines:
include reverse_proxy.conf;
include upstream_phpapache.conf;
4. Create the /var/cache/nginx/proxycache directory owned by the unpriveleged ‘nginx’ user commented out include fastcgi_cache_zone.conf; and uncommented the line include proxy_cache_zone.conf; on nginx.conf
5. Create the /etc/nginx/sites-enabled directory but how do I enable a virtual host? There are no methods described in piwik-nginx configuration.
And finally ends up the webpage isn’t available (ERR_CONNECTION_REFUSED) :frowning:
Is there anything that I missed?
|
{
"url": "https://forum.matomo.org/t/piwik-configuration-nginx-and-apache-with-mod-php-on-centos-6-7/17808",
"source_domain": "forum.matomo.org",
"snapshot_id": "crawl=CC-MAIN-2018-47",
"warc_metadata": {
"Content-Length": "18194",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WHVONRX7RO276RKIUI6RD2OHWIZMEB5I",
"WARC-Concurrent-To": "<urn:uuid:e9f6f190-85d3-411c-857c-986cee00c126>",
"WARC-Date": "2018-11-16T09:12:01Z",
"WARC-IP-Address": "46.165.219.48",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MLUZTUPPCEMQCW6AK4JF6AUTXC5EHEE5",
"WARC-Record-ID": "<urn:uuid:993c4148-4eeb-4f83-906e-b66d904e9a4e>",
"WARC-Target-URI": "https://forum.matomo.org/t/piwik-configuration-nginx-and-apache-with-mod-php-on-centos-6-7/17808",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:44487cbe-8110-403a-818a-3f13e008b4e1>"
},
"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-144-188-218.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,
66,
67,
68,
91,
92,
219,
220,
370,
371,
419,
489,
528,
529,
590,
591,
762,
821,
846,
859,
895,
931,
937,
1035,
1067,
1104,
1314,
1462,
1463,
1547,
1548
],
"line_end_idx": [
66,
67,
68,
91,
92,
219,
220,
370,
371,
419,
489,
528,
529,
590,
591,
762,
821,
846,
859,
895,
931,
937,
1035,
1067,
1104,
1314,
1462,
1463,
1547,
1548,
1580
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1580,
"ccnet_original_nlines": 30,
"rps_doc_curly_bracket": 0.0012658199993893504,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24301676452159882,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03072625957429409,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.37709498405456543,
"rps_doc_frac_unique_words": 0.5679611563682556,
"rps_doc_mean_word_length": 5.8932037353515625,
"rps_doc_num_sentences": 50,
"rps_doc_symbol_to_word_ratio": 0.0027932999655604362,
"rps_doc_unigram_entropy": 4.521346569061279,
"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.016474459320306778,
"rps_doc_frac_chars_top_3gram": 0.023064250126481056,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -206.53692626953125,
"rps_doc_books_importance_length_correction": -193.3357391357422,
"rps_doc_openwebtext_importance": -104.10694885253906,
"rps_doc_openwebtext_importance_length_correction": -104.10694885253906,
"rps_doc_wikipedia_importance": -82.0863037109375,
"rps_doc_wikipedia_importance_length_correction": -68.26795196533203
},
"fasttext": {
"dclm": 0.750726580619812,
"english": 0.8368632793426514,
"fineweb_edu_approx": 1.2469948530197144,
"eai_general_math": 0.5827667117118835,
"eai_open_web_math": 0.2158636450767517,
"eai_web_code": 0.3454456925392151
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-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": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,744,846,045,783,527,400 |
Tell me more ×
Super User is a question and answer site for computer enthusiasts and power users. It's 100% free, no registration required.
I'm on Windows 7 and accidentally downloaded a virus. It's not that bad, but it gives alerts that Windows has crashed. Nothing still happens.
APPCRASH - Application: win32-DOS.exe.exe
That's the report, so I suggest that that file causes the problem. When I right-click it in Task Manager and click "File location", it takes me to folder (C:\Windows\System32\Win32-DOS) with two files: logs.dat and plugin.dat.
How can I delete this? I googled but didn't success in the only instructions I could found.
Any suggestions?
share|improve this question
3 Answers
up vote 0 down vote accepted
Well, try using an antimalware program might get rid of it. Try the free version of Malwarebytes, for instance.
You also might be able to delete the Win32-DOS folder from within Windows or from a Linux LiveCD (Puppy Linux is small), but if it was me I'd want to scan around with an antimalware program and make pretty sure that it was all gone even if I tried to get rid of it that way.
share|improve this answer
Malwarebytes worked like a charm. Thank you very much! – Martti Laine Feb 13 '10 at 19:37
I've been using Hitman Pro to clean infected machines lately, it's really good for already-infected machines.
It scans in like 3-5 minutes, and uses 5 or 6 different AV engines to do it.
It's kind of a scan-for-free, pay-to-clean utility, but they currently give you a free 30 day cleaning trial. Which is plenty fair and useful when you're already infected. :)
share|improve this answer
Try booting into safe mode (Make sure to select the "Administrator" account, not your own - I believe it should be visible in safe mode), navigate there, and hit the delete key ;) You may also want to run some sort of antivirus while you're 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://superuser.com/questions/108491/oops-downloaded-a-virus-win32-dos",
"source_domain": "superuser.com",
"snapshot_id": "crawl=CC-MAIN-2013-20",
"warc_metadata": {
"Content-Length": "47792",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2VLZNCVIEQFT3PALNGNVHGVGY4QE3QBI",
"WARC-Concurrent-To": "<urn:uuid:95c34391-2aa0-402c-9981-e15ab00546f2>",
"WARC-Date": "2013-05-21T13:34:44Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:SX7NZ2YWZETZU2SI5YCNF3BQ3UJSQPQH",
"WARC-Record-ID": "<urn:uuid:84f6abff-b245-4d35-a002-d88d1cef7be5>",
"WARC-Target-URI": "http://superuser.com/questions/108491/oops-downloaded-a-virus-win32-dos",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:44583310-b82d-479a-8570-024f1cfba92e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-60-113-184.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-20\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Spring 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,
140,
141,
283,
284,
326,
327,
554,
555,
647,
648,
665,
666,
694,
695,
705,
706,
735,
736,
848,
849,
1124,
1125,
1151,
1241,
1242,
1352,
1353,
1430,
1431,
1606,
1607,
1633,
1634,
1882,
1883,
1909,
1910,
1922,
1923,
1925,
1933,
1934,
2012,
2013
],
"line_end_idx": [
15,
140,
141,
283,
284,
326,
327,
554,
555,
647,
648,
665,
666,
694,
695,
705,
706,
735,
736,
848,
849,
1124,
1125,
1151,
1241,
1242,
1352,
1353,
1430,
1431,
1606,
1607,
1633,
1634,
1882,
1883,
1909,
1910,
1922,
1923,
1925,
1933,
1934,
2012,
2013,
2103
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2103,
"ccnet_original_nlines": 45,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38947367668151855,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03368420898914337,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21473683416843414,
"rps_doc_frac_unique_words": 0.6158192157745361,
"rps_doc_mean_word_length": 4.604519844055176,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.1133012771606445,
"rps_doc_word_count": 354,
"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.03926379978656769,
"rps_doc_frac_chars_top_3gram": 0.04049079865217209,
"rps_doc_frac_chars_top_4gram": 0.012269940227270126,
"rps_doc_books_importance": -204.4292755126953,
"rps_doc_books_importance_length_correction": -204.4292755126953,
"rps_doc_openwebtext_importance": -124.268310546875,
"rps_doc_openwebtext_importance_length_correction": -124.268310546875,
"rps_doc_wikipedia_importance": -115.8664779663086,
"rps_doc_wikipedia_importance_length_correction": -115.8664779663086
},
"fasttext": {
"dclm": 0.6829239726066589,
"english": 0.9469581842422485,
"fineweb_edu_approx": 1.2465811967849731,
"eai_general_math": 0.00031602001399733126,
"eai_open_web_math": 0.07947791367769241,
"eai_web_code": 0.00010669000039342791
}
}
|
{
"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.164",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,629,657,103,446,873,000 |
DisplayIntegerScaling
Demonstrates how to obtain the display integer scaling when programming with ADLX and perform related operations.
Command Prompts
Command Prompt Description
1 Display integer scaling support.
2 Get integer scaling state.
3 Set current Integer scaling to disabled.
4 Set current Integer scaling to enabled.
M/m Display the command prompt menu.
Q/q Terminate the application.
Sample Path
/Samples/C/Display/DisplayIntegerScaling
Code
//
// Copyright (c) 2021 - 2022 Advanced Micro Devices, Inc. All rights reserved.
//
//-------------------------------------------------------------------------------------------------
#include "SDK/ADLXHelper/Windows/C/ADLXHelper.h"
#include "SDK/Include/IDisplaySettings.h"
#include "SDK/Include/IDisplays.h"
// Display displayIntegerScaling support
void ShowDisplayIntegerScalingSupport(IADLXDisplayServices* pDisplayService, IADLXDisplay* pDisplay);
// Display current displayIntegerScaling state
void GetIntegerScalingState(IADLXDisplayServices* pDisplayService, IADLXDisplay* pDisplay);
// Set displayIntegerScaling
void SetIntegerScalingState(IADLXDisplayServices* pDisplayService, IADLXDisplay* pDisplay, const int key);
// Main menu
void MainMenu();
// Menu action control
void MenuControl(IADLXDisplayServices* pDisplayService, IADLXDisplay* pDisplay);
// Wait for exit with error message
int WaitAndExit(const char* msg, const int retCode);
int main()
{
// Define return code
ADLX_RESULT res = ADLX_FAIL ;
// Initialize ADLX
res = ADLXHelper_Initialize();
if (ADLX_SUCCEEDED (res))
{
// Get system services
IADLXSystem* sys = ADLXHelper_GetSystemServices();
// Get display service
IADLXDisplayServices* displayService = NULL;
res = sys->pVtbl->GetDisplaysServices(sys, &displayService);
if (ADLX_SUCCEEDED (res))
{
// Get display list
IADLXDisplayList* displayList = NULL;
res = displayService->pVtbl->GetDisplays(displayService, &displayList);
if (ADLX_SUCCEEDED (res))
{
// Inspect for the first display in the list
adlx_uint it = 0;
IADLXDisplay* display = NULL;
res = displayList->pVtbl->At_DisplayList(displayList, it, &display);
if (ADLX_SUCCEEDED (res))
{
// Show a menu with options to chose from
MainMenu();
// Get and excute the selection
MenuControl(displayService, display);
}
// Release the display interface
if (NULL != display)
{
display->pVtbl->Release(display);
display = NULL;
}
}
// Release the displayList interface
if (NULL != displayList)
{
displayList->pVtbl->Release(displayList);
displayList = NULL;
}
}
// Release the displayService interface
if (NULL != displayService)
{
displayService->pVtbl->Release(displayService);
displayService = NULL;
}
}
else
{
return WaitAndExit("ADLX initialization failed", 0);
}
// Destroy ADLX
res = ADLXHelper_Terminate();
printf("Destroy ADLX res: %d\n", res);
// Pause to see the print out
system("pause");
return 0;
}
void ShowDisplayIntegerScalingSupport(IADLXDisplayServices* pDisplayService, IADLXDisplay* pDisplay)
{
IADLXDisplayIntegerScaling* pDisplayIntegerScaling = NULL;
ADLX_RESULT res = pDisplayService->pVtbl->GetIntegerScaling(pDisplayService, pDisplay, &pDisplayIntegerScaling);
if (ADLX_SUCCEEDED (res))
{
printf(" === Get IntegerScaling supported ===\n");
adlx_bool supported = false;
res = pDisplayIntegerScaling->pVtbl->IsSupported(pDisplayIntegerScaling, &supported);
printf("\tIsSupported, res %d, supported: %s\n", res, supported ? "true" : "false");
pDisplayIntegerScaling->pVtbl->Release(pDisplayIntegerScaling);
}
}
void GetIntegerScalingState(IADLXDisplayServices* pDisplayService, IADLXDisplay* pDisplay)
{
IADLXDisplayIntegerScaling* pDisplayIntegerScaling = NULL;
ADLX_RESULT res = pDisplayService->pVtbl->GetIntegerScaling(pDisplayService, pDisplay, &pDisplayIntegerScaling);
if (ADLX_SUCCEEDED (res))
{
printf(" === Get IntegerScaling enabled ===\n");
adlx_bool enabled = false;
res = pDisplayIntegerScaling->pVtbl->IsEnabled(pDisplayIntegerScaling, &enabled);
printf("\tIsEnabled, res: %d, enabled: %s\n", res, enabled ? "true" : "false");
pDisplayIntegerScaling->pVtbl->Release(pDisplayIntegerScaling);
}
}
void SetIntegerScalingState(IADLXDisplayServices* pDisplayService, IADLXDisplay* pDisplay, const int key)
{
IADLXDisplayIntegerScaling* pDisplayIntegerScaling = NULL;
ADLX_RESULT res = pDisplayService->pVtbl->GetIntegerScaling(pDisplayService, pDisplay, &pDisplayIntegerScaling);
if (ADLX_SUCCEEDED (res))
{
ADLX_RESULT res = ADLX_FAIL ;
switch (key)
{
// Set IntegerScaling disabled
case 0:
printf(" === Set IntegerScaling enabled to false;\n");
res = pDisplayIntegerScaling->pVtbl->SetEnabled(pDisplayIntegerScaling, false);
break;
// Set IntegerScaling enabled
case 1:
printf(" === Set IntegerScaling enabled to true;\n");
res = pDisplayIntegerScaling->pVtbl->SetEnabled(pDisplayIntegerScaling, true);
break;
default:
break;
}
printf("\treturn code is: %d (0 means Success)\n", res);
pDisplayIntegerScaling->pVtbl->Release(pDisplayIntegerScaling);
}
}
void MainMenu()
{
printf("\tChoose from following options\n");
printf("\t->Press 1 to display integer scaling support\n");
printf("\t->Press 2 to get integer scaling state\n");
printf("\t->Press 3 to set current Integer Scaling to disabled\n");
printf("\t->Press 4 to set current Integer Scaling to enabled\n");
printf("\t->Press Q/q to terminate the application\n");
printf("\t->Press M/m to display main menu options\n");
}
// Menu action control
void MenuControl(IADLXDisplayServices* pDisplayService, IADLXDisplay* pDisplay)
{
int num = 0;
while ((num = getchar()) != 'q' && num != 'Q')
{
switch (num)
{
// Display displayIntegerScaling support
case '1':
ShowDisplayIntegerScalingSupport(pDisplayService, pDisplay);
break;
// Display current displayIntegerScaling state
case '2':
GetIntegerScalingState(pDisplayService, pDisplay);
break;
// Set displayIntegerScaling
case '3':
case '4':
SetIntegerScalingState(pDisplayService, pDisplay, num - '3');
break;
// Display main menu options
case 'm':
case 'M':
MainMenu();
break;
default:
break;
}
}
}
// Wait for exit with error message
int WaitAndExit(const char* msg, const int retCode)
{
// Printout the message and pause to see it before returning the desired code
if (NULL != msg)
printf("%s\n", msg);
system("pause");
return retCode;
}
|
{
"url": "https://gpuopen.com/manuals/adlx/adlx-c_display__integer_scaling/",
"source_domain": "gpuopen.com",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "746446",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O5UHGJJ6J6SENVMT7ODULUIOQLKK54IM",
"WARC-Concurrent-To": "<urn:uuid:dbcfe199-1518-4e65-a19c-7c9b9f191817>",
"WARC-Date": "2023-02-05T07:53:19Z",
"WARC-IP-Address": "23.220.128.89",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:EGRFDFUVZ34YSJ6WUQMIRFPSHTW3JQ7V",
"WARC-Record-ID": "<urn:uuid:7b789f86-fc7e-4e92-8799-3fbf02774493>",
"WARC-Target-URI": "https://gpuopen.com/manuals/adlx/adlx-c_display__integer_scaling/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:38a82766-adf6-4cf3-973b-59e49dd310af>"
},
"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-163\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,
23,
24,
138,
139,
155,
156,
183,
218,
247,
290,
332,
369,
400,
401,
413,
414,
455,
456,
462,
463,
466,
545,
548,
648,
649,
650,
699,
741,
776,
777,
818,
920,
921,
968,
1060,
1061,
1090,
1197,
1198,
1211,
1228,
1229,
1252,
1333,
1334,
1370,
1423,
1424,
1435,
1437,
1463,
1498,
1499,
1522,
1557,
1587,
1593,
1624,
1683,
1684,
1715,
1768,
1837,
1871,
1881,
1913,
1963,
2047,
2085,
2099,
2160,
2194,
2240,
2325,
2367,
2385,
2447,
2479,
2531,
2589,
2607,
2608,
2657,
2694,
2712,
2766,
2802,
2820,
2834,
2835,
2884,
2921,
2935,
2993,
3029,
3043,
3053,
3054,
3102,
3138,
3148,
3208,
3243,
3253,
3259,
3268,
3274,
3335,
3341,
3342,
3362,
3396,
3439,
3440,
3474,
3495,
3496,
3510,
3512,
3513,
3614,
3616,
3679,
3797,
3827,
3833,
3893,
3930,
4024,
4117,
4189,
4195,
4197,
4198,
4289,
4291,
4354,
4472,
4502,
4508,
4566,
4601,
4691,
4779,
4851,
4857,
4859,
4860,
4966,
4968,
5031,
5149,
5179,
5185,
5224,
5245,
5255,
5298,
5314,
5382,
5474,
5493,
5535,
5551,
5618,
5709,
5728,
5745,
5764,
5774,
5839,
5911,
5917,
5919,
5920,
5936,
5938,
5987,
5988,
6052,
6053,
6111,
6112,
6184,
6255,
6256,
6316,
6376,
6378,
6379,
6402,
6482,
6484,
6501,
6552,
6558,
6579,
6589,
6642,
6660,
6733,
6752,
6753,
6812,
6830,
6893,
6912,
6913,
6954,
6972,
6990,
7064,
7083,
7084,
7125,
7143,
7161,
7185,
7204,
7221,
7240,
7250,
7256,
7258,
7259,
7295,
7347,
7349,
7431,
7452,
7481,
7482,
7503,
7523
],
"line_end_idx": [
23,
24,
138,
139,
155,
156,
183,
218,
247,
290,
332,
369,
400,
401,
413,
414,
455,
456,
462,
463,
466,
545,
548,
648,
649,
650,
699,
741,
776,
777,
818,
920,
921,
968,
1060,
1061,
1090,
1197,
1198,
1211,
1228,
1229,
1252,
1333,
1334,
1370,
1423,
1424,
1435,
1437,
1463,
1498,
1499,
1522,
1557,
1587,
1593,
1624,
1683,
1684,
1715,
1768,
1837,
1871,
1881,
1913,
1963,
2047,
2085,
2099,
2160,
2194,
2240,
2325,
2367,
2385,
2447,
2479,
2531,
2589,
2607,
2608,
2657,
2694,
2712,
2766,
2802,
2820,
2834,
2835,
2884,
2921,
2935,
2993,
3029,
3043,
3053,
3054,
3102,
3138,
3148,
3208,
3243,
3253,
3259,
3268,
3274,
3335,
3341,
3342,
3362,
3396,
3439,
3440,
3474,
3495,
3496,
3510,
3512,
3513,
3614,
3616,
3679,
3797,
3827,
3833,
3893,
3930,
4024,
4117,
4189,
4195,
4197,
4198,
4289,
4291,
4354,
4472,
4502,
4508,
4566,
4601,
4691,
4779,
4851,
4857,
4859,
4860,
4966,
4968,
5031,
5149,
5179,
5185,
5224,
5245,
5255,
5298,
5314,
5382,
5474,
5493,
5535,
5551,
5618,
5709,
5728,
5745,
5764,
5774,
5839,
5911,
5917,
5919,
5920,
5936,
5938,
5987,
5988,
6052,
6053,
6111,
6112,
6184,
6255,
6256,
6316,
6376,
6378,
6379,
6402,
6482,
6484,
6501,
6552,
6558,
6579,
6589,
6642,
6660,
6733,
6752,
6753,
6812,
6830,
6893,
6912,
6913,
6954,
6972,
6990,
7064,
7083,
7084,
7125,
7143,
7161,
7185,
7204,
7221,
7240,
7250,
7256,
7258,
7259,
7295,
7347,
7349,
7431,
7452,
7481,
7482,
7503,
7523,
7524
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7524,
"ccnet_original_nlines": 234,
"rps_doc_curly_bracket": 0.005582139827311039,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.09326425194740295,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03713298961520195,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.44645941257476807,
"rps_doc_frac_unique_words": 0.3394160568714142,
"rps_doc_mean_word_length": 8.591240882873535,
"rps_doc_num_sentences": 21,
"rps_doc_symbol_to_word_ratio": 0.0025906700175255537,
"rps_doc_unigram_entropy": 4.7682671546936035,
"rps_doc_word_count": 548,
"rps_doc_frac_chars_dupe_10grams": 0.15866610407829285,
"rps_doc_frac_chars_dupe_5grams": 0.329439252614975,
"rps_doc_frac_chars_dupe_6grams": 0.24660153687000275,
"rps_doc_frac_chars_dupe_7grams": 0.23470687866210938,
"rps_doc_frac_chars_dupe_8grams": 0.23470687866210938,
"rps_doc_frac_chars_dupe_9grams": 0.15866610407829285,
"rps_doc_frac_chars_top_2gram": 0.026762960478663445,
"rps_doc_frac_chars_top_3gram": 0.05947323888540268,
"rps_doc_frac_chars_top_4gram": 0.020390819758176804,
"rps_doc_books_importance": -342.1047668457031,
"rps_doc_books_importance_length_correction": -342.1047668457031,
"rps_doc_openwebtext_importance": -215.7912139892578,
"rps_doc_openwebtext_importance_length_correction": -215.7912139892578,
"rps_doc_wikipedia_importance": -75.51332092285156,
"rps_doc_wikipedia_importance_length_correction": -75.51332092285156
},
"fasttext": {
"dclm": 0.2714957594871521,
"english": 0.2551417052745819,
"fineweb_edu_approx": 1.4097157716751099,
"eai_general_math": 0.5120061039924622,
"eai_open_web_math": 0.02132594957947731,
"eai_web_code": 0.8197944164276123
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "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
|
5,419,689,688,547,906,000 |
Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.
Why is this code not working? I need it to get the latest tweets for the search tag dog and then submit a status update with a reply to the user who sent the tweet with the search tag dog. I am using Abraham's twitteroauth found here: https://github.com/abraham/twitteroauth/downloads
<?php
require_once('twitteroauth.php');
define('CONSUMER_KEY', 'CONSUMERKEYHERE');
define('CONSUMER_SECRET', 'SECRET HERE');
define('ACCESS_TOKEN', 'TOKENHERE');
define('ACCESS_TOKEN_SECRET', 'TOKENSECRETHERE');
$twitter = new TwitterOAuth(CONSUMER_KEY, CONSUMER_SECRET, ACCESS_TOKEN, ACCESS_TOKEN_SECRET);
$twitter->host = "http://search.twitter.com/";
$search = $twitter->get('search', array('q' => 'dog', 'rpp' => 5));
$twitter->host = "https://api.twitter.com/1/";
foreach($search->results as $tweet) {
$status = '@$tweet->from_user Here my reply would go';
$twitter->post('statuses/update', array('status' => $status));
}
?>
I have entered my consumer key, secret and tokens but removed them here.
Thanks!
share|improve this question
Sorry to be half-useless here as I haven't worked with TwitterOAuth in a while, but IIRC if you print out the $twitter variable it should have a field that tells you the last error received from twitter.com – bcoughlan Aug 5 '11 at 20:42
That gives me the error: Object of class TwitterOAuth could not be converted to string – GoneInsane Aug 5 '11 at 20:45
try var_dump($twitter) – Chris Carson Aug 5 '11 at 21:13
It gives me errors and shows connection timeout with the api.twitter.com/1 This: object(TwitterOAuth)#1 (13) { ["http_code"]=> NULL ["url"]=> NULL ["host"]=> string(26) "api.twitter.com/1/"; ["timeout"]=> int(30) ["connecttimeout"]=> int(30) ["ssl_verifypeer"]=> bool(false) ["format"]=> string(4) "json" ["decode_json"]=> bool(true) ["http_info"]=> NULL ["useragent"]=> string(25) "TwitterOAuth v0.2.0-beta2" ["sha1_method"]=> object(OAuthSignatureMethod_HMAC_SHA1)#2 (0) { } ["consumer"]=> object(OAuthConsumer)#3 (3) { ["key"]=> string(22) – GoneInsane Aug 5 '11 at 21:46
And then it shows all the consumer key etc. – GoneInsane Aug 5 '11 at 21:47
1 Answer 1
The Twitter search API is separate from the REST API and doesn't require authentication. So using OAuth probably won't work.
share|improve this answer
It returns the search results fine, so that's working as I can echo them. The only thing that isn't working is the posting of the status update. – GoneInsane Aug 5 '11 at 20:50
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/6962362/twitter-oauth-send-status-update-not-working?answertab=oldest",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2014-52",
"warc_metadata": {
"Content-Length": "75296",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:C2GPOR5LYMTGBUR2C4T3YCMA4SYM45JR",
"WARC-Concurrent-To": "<urn:uuid:8f9347fd-0832-46d6-bc4f-75048d69c3d1>",
"WARC-Date": "2014-12-26T00:45:54Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:AFN44M4LDWHHXF33HBCTGPJLKSKEXOSY",
"WARC-Record-ID": "<urn:uuid:a2cc825f-7200-4c75-bdaf-7ded09a9cb90>",
"WARC-Target-URI": "http://stackoverflow.com/questions/6962362/twitter-oauth-send-status-update-not-working?answertab=oldest",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6d1c6f08-7b11-4e98-a846-34a00b061a8e>"
},
"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,
443,
444,
453,
487,
488,
531,
573,
610,
660,
661,
756,
803,
871,
872,
919,
957,
1016,
1083,
1085,
1088,
1089,
1162,
1163,
1171,
1172,
1200,
1205,
1444,
1449,
1569,
1574,
1632,
1637,
2213,
2218,
2295,
2296,
2307,
2308,
2433,
2434,
2460,
2465,
2643,
2644,
2656,
2657,
2659,
2667,
2668,
2746,
2747
],
"line_end_idx": [
25,
157,
158,
443,
444,
453,
487,
488,
531,
573,
610,
660,
661,
756,
803,
871,
872,
919,
957,
1016,
1083,
1085,
1088,
1089,
1162,
1163,
1171,
1172,
1200,
1205,
1444,
1449,
1569,
1574,
1632,
1637,
2213,
2218,
2295,
2296,
2307,
2308,
2433,
2434,
2460,
2465,
2643,
2644,
2656,
2657,
2659,
2667,
2668,
2746,
2747,
2837
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2837,
"ccnet_original_nlines": 55,
"rps_doc_curly_bracket": 0.0021149099338799715,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2169230729341507,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03846153989434242,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4046153724193573,
"rps_doc_frac_unique_words": 0.5846994519233704,
"rps_doc_mean_word_length": 5.598360538482666,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0.004615379963070154,
"rps_doc_unigram_entropy": 5.072869300842285,
"rps_doc_word_count": 366,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03709125891327858,
"rps_doc_frac_chars_dupe_6grams": 0.03709125891327858,
"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.011713029816746712,
"rps_doc_frac_chars_top_3gram": 0.01756954938173294,
"rps_doc_frac_chars_top_4gram": 0.023426059633493423,
"rps_doc_books_importance": -272.2893371582031,
"rps_doc_books_importance_length_correction": -272.2893371582031,
"rps_doc_openwebtext_importance": -161.14491271972656,
"rps_doc_openwebtext_importance_length_correction": -161.14491271972656,
"rps_doc_wikipedia_importance": -98.4443130493164,
"rps_doc_wikipedia_importance_length_correction": -98.4443130493164
},
"fasttext": {
"dclm": 0.07356917858123779,
"english": 0.6790096759796143,
"fineweb_edu_approx": 1.0750105381011963,
"eai_general_math": 0.00002587000017229002,
"eai_open_web_math": 0.12051255255937576,
"eai_web_code": -0.000009420000424142927
}
}
|
{
"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": "302.22",
"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": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,980,872,760,729,466,000 |
cssAudio - Activefile-genericCSS - ActiveGeneric - ActiveHTML - ActiveImage - ActiveJS - ActiveSVG - ActiveText - Activefile-genericVideo - Activehtmlicon-personicon-teamoctocatpop-outspinnerstartv
Pen Settings
CSS Base
Vendor Prefixing
Add External CSS
These stylesheets will be added in this order and before the code you write in the CSS editor. You can also add another Pen here, and it will pull the CSS from it. Try typing "font" or "ribbon" below.
Quick-add: + add another resource
Add External JavaScript
These scripts will run in this order and before the code in the JavaScript editor. You can also link to another Pen here, and it will run the JavaScript from it. Also try typing the name of any popular library.
Quick-add: + add another resource
Code Indentation
Save Automatically?
If active, Pens will autosave every 30 seconds after being saved once.
Auto-Updating Preview
If enabled, the preview panel updates automatically as you code. If disabled, use the "Run" button to update.
<pre>
.box {
transition: transform 200ms,
background-color 200ms 1s;
}
.box:hover {
background: #46a9eb;
transform: scale(1.3);
}
</pre>
<p class="box">Box</p>
<p class="css-mine">
<small>
(<a href="http://www.cssmine.com/css3-transitions" target="_blank">CSS3 Transitions</a> at CSS Mine)
</small>
</p>
!
.box {
transition: transform 200ms,
background-color 200ms 1s;
display: inline-block;
padding: 1em;
margin: 0;
background: #b3e888;
font-size: 2em;
}
.box:hover,
.box:active {
background: #46a9eb;
transform: scale(1.3);
}
.css-mine {
margin-top: 2em;
clear: both;
}
body {
margin: 1.5em;
}
!
999px
Close
Asset uploading is a PRO feature.
As a PRO member, you can drag-and-drop upload files here to use as resources. Images, Libraries, JSON data... anything you want. You can even edit them anytime, like any other code on CodePen.
Go PRO
Loading ..................
Console
|
{
"url": "https://codepen.io/machal/pen/vIGAk",
"source_domain": "codepen.io",
"snapshot_id": "crawl=CC-MAIN-2017-26",
"warc_metadata": {
"Content-Length": "97159",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GBXC5TE2STTO5ZCGB3YGX2BMXIERBT5M",
"WARC-Concurrent-To": "<urn:uuid:a936752b-c0c0-4d34-bb05-aca0f5828b4b>",
"WARC-Date": "2017-06-26T00:15:24Z",
"WARC-IP-Address": "104.25.14.31",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OLN6H4FBTSPMWSZIEGT7YI35ZRVXIZMK",
"WARC-Record-ID": "<urn:uuid:133b4014-5782-4696-8d79-a9d8c9b1e690>",
"WARC-Target-URI": "https://codepen.io/machal/pen/vIGAk",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:67ac8a7e-26fb-4bc8-949f-93497b223be3>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-145-147-112.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,
198,
199,
212,
213,
222,
223,
240,
241,
258,
259,
460,
461,
495,
496,
520,
521,
732,
733,
767,
768,
785,
786,
792,
793,
813,
814,
885,
886,
908,
909,
1019,
1020,
1033,
1053,
1060,
1092,
1123,
1127,
1128,
1141,
1164,
1189,
1191,
1198,
1199,
1222,
1223,
1244,
1254,
1357,
1368,
1375,
1376,
1377,
1390,
1401,
1403,
1416,
1437,
1469,
1500,
1525,
1541,
1554,
1577,
1596,
1600,
1601,
1613,
1627,
1650,
1675,
1677,
1678,
1690,
1709,
1724,
1726,
1727,
1734,
1751,
1753,
1766,
1777,
1779,
1785,
1791,
1792,
1826,
1827,
2020,
2021,
2028,
2029,
2056,
2057
],
"line_end_idx": [
198,
199,
212,
213,
222,
223,
240,
241,
258,
259,
460,
461,
495,
496,
520,
521,
732,
733,
767,
768,
785,
786,
792,
793,
813,
814,
885,
886,
908,
909,
1019,
1020,
1033,
1053,
1060,
1092,
1123,
1127,
1128,
1141,
1164,
1189,
1191,
1198,
1199,
1222,
1223,
1244,
1254,
1357,
1368,
1375,
1376,
1377,
1390,
1401,
1403,
1416,
1437,
1469,
1500,
1525,
1541,
1554,
1577,
1596,
1600,
1601,
1613,
1627,
1650,
1675,
1677,
1678,
1690,
1709,
1724,
1726,
1727,
1734,
1751,
1753,
1766,
1777,
1779,
1785,
1791,
1792,
1826,
1827,
2020,
2021,
2028,
2029,
2056,
2057,
2064
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2064,
"ccnet_original_nlines": 96,
"rps_doc_curly_bracket": 0.005813950207084417,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.19954648613929749,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022675739601254463,
"rps_doc_frac_lines_end_with_ellipsis": 0.010309279896318913,
"rps_doc_frac_no_alph_words": 0.3650793731212616,
"rps_doc_frac_unique_words": 0.5943775177001953,
"rps_doc_mean_word_length": 5.666666507720947,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0.022675739601254463,
"rps_doc_unigram_entropy": 4.794580936431885,
"rps_doc_word_count": 249,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.14032600820064545,
"rps_doc_frac_chars_dupe_6grams": 0.14032600820064545,
"rps_doc_frac_chars_dupe_7grams": 0.10772501677274704,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.017009209841489792,
"rps_doc_frac_chars_top_3gram": 0.015591779723763466,
"rps_doc_frac_chars_top_4gram": 0.01984407939016819,
"rps_doc_books_importance": -218.34104919433594,
"rps_doc_books_importance_length_correction": -218.34104919433594,
"rps_doc_openwebtext_importance": -119.64250946044922,
"rps_doc_openwebtext_importance_length_correction": -119.64250946044922,
"rps_doc_wikipedia_importance": -116.93312072753906,
"rps_doc_wikipedia_importance_length_correction": -116.93312072753906
},
"fasttext": {
"dclm": 0.0929531529545784,
"english": 0.6436179876327515,
"fineweb_edu_approx": 1.58505380153656,
"eai_general_math": 0.009525779634714127,
"eai_open_web_math": 0.2623646855354309,
"eai_web_code": 0.0016012199921533465
}
}
|
{
"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": "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": "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
|
-8,106,812,629,966,806,000 |
Advanced C and C++ Compiling
Book Description:
Learning how to write C/C++ code is only the first step. To be a serious programmer, you need to understand the structure and purpose of the binary files produced by the compiler: object files, static libraries, shared libraries, and, of course, executables.
Advanced C and C++ Compiling explains the build process in detail and shows how to integrate code from other developers in the form of deployed libraries as well as how to resolve issues and potential mismatches between your own and external code trees.
|
{
"url": "http://www.allitebooks.org/advanced-c-and-c-compiling/",
"source_domain": "www.allitebooks.org",
"snapshot_id": "crawl=CC-MAIN-2019-30",
"warc_metadata": {
"Content-Length": "33017",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KMCFGAJWOLBJ3FYRTCRGMSOJDBYLCNKN",
"WARC-Concurrent-To": "<urn:uuid:86889bf6-3f7c-476e-bd86-e812efe77b82>",
"WARC-Date": "2019-07-24T09:22:08Z",
"WARC-IP-Address": "104.18.48.137",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HVMDOHT4AFCFYOYFDCSSENUE6NW6K7G2",
"WARC-Record-ID": "<urn:uuid:59231148-9a0e-4f4a-8e03-6c17507c1b38>",
"WARC-Target-URI": "http://www.allitebooks.org/advanced-c-and-c-compiling/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d76275f7-cebd-4d63-aa38-90a303cf978f>"
},
"warc_info": "isPartOf: CC-MAIN-2019-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-157-146-93.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,
29,
30,
48,
49,
308,
309
],
"line_end_idx": [
29,
30,
48,
49,
308,
309,
562
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 562,
"ccnet_original_nlines": 6,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.39814814925193787,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.055555559694767,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1388888955116272,
"rps_doc_frac_unique_words": 0.6630434989929199,
"rps_doc_mean_word_length": 4.8913044929504395,
"rps_doc_num_sentences": 3,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.890493869781494,
"rps_doc_word_count": 92,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09777777642011642,
"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.03333333134651184,
"rps_doc_frac_chars_top_3gram": 0.053333330899477005,
"rps_doc_frac_chars_top_4gram": 0.057777781039476395,
"rps_doc_books_importance": -40.13866424560547,
"rps_doc_books_importance_length_correction": -54.32896041870117,
"rps_doc_openwebtext_importance": -19.154193878173828,
"rps_doc_openwebtext_importance_length_correction": -33.34449005126953,
"rps_doc_wikipedia_importance": -16.67723274230957,
"rps_doc_wikipedia_importance_length_correction": -30.867528915405273
},
"fasttext": {
"dclm": 0.018633009865880013,
"english": 0.9201509952545166,
"fineweb_edu_approx": 3.167654037475586,
"eai_general_math": 0.9556412100791931,
"eai_open_web_math": 0.34093528985977173,
"eai_web_code": 0.6510466933250427
}
}
|
{
"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.132",
"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": "-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": "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
|
-1,922,004,191,568,574,200 |
WordPress.org
Ready to get started?Download WordPress
Forums
My Theme "LaMoon" doesn't work with 3.7.1 (4 posts)
1. dchapple
Member
Posted 8 months ago #
Q: Can i downgrade to 3.6?
I just created a site and downloaded a theme "laMoon" and was asked to install wordpress at the time of install. WordPress 3.7 was installed and the theme is only able to run on WP 3.6. The theme assets are not loading as a result and the theme author is not writing back.
How do i downgrade to 3.6 to see if I can get this to work?
Anyone else running laMoon on 3.7?
2. WPyogi
Volunteer Moderator
Posted 8 months ago #
You should check with the developer of the theme about this:
http://themeforest.net/item/lamoon-responsive-wordpress-theme/3064132
Commercial themes aren't supported on these forums - as we don't have access to them.
3. Messanger
Member
Posted 8 months ago #
How do we get the answer to her question, I would also like to downgrade to 3.6 because of the same problem.
4. WPyogi
Volunteer Moderator
Posted 8 months ago #
We don't recommend downgrading - it's a major security risk.
Reply
You must log in to post.
About this Topic
|
{
"url": "http://wordpress.org/support/topic/my-theme-lamoon-doesnt-work-with-371",
"source_domain": "wordpress.org",
"snapshot_id": "crawl=CC-MAIN-2014-23",
"warc_metadata": {
"Content-Length": "17318",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:M5DDIBE2OOLZGRVOCKY6EYLEP3PC75WW",
"WARC-Concurrent-To": "<urn:uuid:0734129e-3a67-4879-9f04-495646dceb03>",
"WARC-Date": "2014-07-12T01:50:56Z",
"WARC-IP-Address": "66.155.40.250",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:RVEFIRFCCS7PPROQVJXCZK4K6XKOKEHZ",
"WARC-Record-ID": "<urn:uuid:8ea1cf86-9f92-4b46-81cc-603588a2e050>",
"WARC-Target-URI": "http://wordpress.org/support/topic/my-theme-lamoon-doesnt-work-with-371",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c77da3a7-0667-4ed2-b174-13646fe1a8eb>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-212-248.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-23\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for July 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,
14,
15,
55,
56,
63,
64,
116,
117,
131,
142,
168,
169,
200,
201,
478,
479,
543,
582,
583,
595,
619,
645,
646,
711,
712,
786,
787,
877,
878,
893,
904,
930,
931,
1044,
1045,
1057,
1081,
1107,
1108,
1173,
1174,
1180,
1181,
1206,
1207
],
"line_end_idx": [
14,
15,
55,
56,
63,
64,
116,
117,
131,
142,
168,
169,
200,
201,
478,
479,
543,
582,
583,
595,
619,
645,
646,
711,
712,
786,
787,
877,
878,
893,
904,
930,
931,
1044,
1045,
1057,
1081,
1107,
1108,
1173,
1174,
1180,
1181,
1206,
1207,
1223
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1223,
"ccnet_original_nlines": 45,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.30970150232315063,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018656719475984573,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.28731343150138855,
"rps_doc_frac_unique_words": 0.5647668242454529,
"rps_doc_mean_word_length": 4.544041633605957,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0.014925369992852211,
"rps_doc_unigram_entropy": 4.443203449249268,
"rps_doc_word_count": 193,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1413911134004593,
"rps_doc_frac_chars_dupe_6grams": 0.09122007340192795,
"rps_doc_frac_chars_dupe_7grams": 0.09122007340192795,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.031927019357681274,
"rps_doc_frac_chars_top_3gram": 0.05929303914308548,
"rps_doc_frac_chars_top_4gram": 0.07297605276107788,
"rps_doc_books_importance": -113.51734924316406,
"rps_doc_books_importance_length_correction": -113.51734924316406,
"rps_doc_openwebtext_importance": -62.6896858215332,
"rps_doc_openwebtext_importance_length_correction": -62.689640045166016,
"rps_doc_wikipedia_importance": -36.81254577636719,
"rps_doc_wikipedia_importance_length_correction": -36.81254577636719
},
"fasttext": {
"dclm": 0.10253720730543137,
"english": 0.9542366862297058,
"fineweb_edu_approx": 1.0047695636749268,
"eai_general_math": 0.056087370961904526,
"eai_open_web_math": 0.01244283001869917,
"eai_web_code": 0.000009540000064589549
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.138",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
567,672,712,328,319,600 |
Convert to
1 circle 1-foot diameter (∅ 1 ft) = 0.000000073 square kilometers (km2 , sq km)
Filed under: Main menusurface area menu∅ 1-foot circles conversion
Advertisements
Specific circle 1-foot diameter to square kilometer Conversion Results
Enter a New circle 1-foot diameter Amount to Convert From
* Whole number, decimal or fraction ie: 6, 5.33, 17 3/8
* Precision is how many digits after decimal point 1 - 9
Enter Amount :
Decimal Precision :
Advertisements
Convert circle 1-foot diameter (∅ 1 ft) versus square kilometers (km2 , sq km)
in swapped opposite direction
from square kilometers to ∅ 1-foot circles
Or use utilized converter page with the
area surface multi-units converter
conversion result for two
surface area units:
From unit
Symbol
Equals ResultTo unit
Symbol
1 circle 1-foot diameter ∅ 1 ft = 0.000000073 square kilometers km2 , sq km
surface area converter
What is the international acronym for each of these two surface area units?
Prefix or symbol for circle 1-foot diameter is: ∅ 1 ft
Prefix or symbol for square kilometer is: km2 , sq km
Technical units conversion tool for surface area measures. Exchange reading in ∅ 1-foot circles unit ∅ 1 ft into square kilometers unit km2 , sq km as in an equivalent measurement result (two different units but the same identical physical total value, which is also equal to their proportional parts when divided or multiplied).
One circle 1-foot diameter converted into square kilometer equals = 0.000000073 km2 , sq km
1 ∅ 1 ft = 0.000000073 km2 , sq km
Find pages on convert to with online Google Custom Search
How many square kilometers are contained in one circle 1-foot diameter? To link to this surface area - circle 1-foot diameter to square kilometers units converter, only cut and paste the following code into your html.
The link will appear on your page as: on the web units converter from circle 1-foot diameter (∅ 1 ft) to square kilometers (km2 , sq km)
Online ∅ 1-foot circles to square kilometers conversion calculator | convert-to.com units converters © Privacy Policy
|
{
"url": "http://convert-to.com/conversion/area-surface/convert-circle-1ft-diam-to-square-kilometers-km2.html",
"source_domain": "convert-to.com",
"snapshot_id": "crawl=CC-MAIN-2016-40",
"warc_metadata": {
"Content-Length": "27306",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UQ3LDY2G4DBMOVQOWW6GLWOTKKFWNWN7",
"WARC-Concurrent-To": "<urn:uuid:e9f348e0-f7eb-47df-a660-9b848aa1a1b9>",
"WARC-Date": "2016-09-25T12:16:16Z",
"WARC-IP-Address": "192.185.234.72",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:HF3HTV2SWCKUGGLGQF2UF2NNADBWP64F",
"WARC-Record-ID": "<urn:uuid:131b5630-8f1a-47e7-9743-d443d37e4f6f>",
"WARC-Target-URI": "http://convert-to.com/conversion/area-surface/convert-circle-1ft-diam-to-square-kilometers-km2.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2e3c9c13-f21b-4a5c-8ee1-365c52bee852>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-143-35-109.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-40\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for September 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
11,
12,
92,
93,
160,
161,
176,
177,
248,
249,
307,
308,
364,
421,
422,
437,
457,
472,
473,
552,
553,
583,
584,
627,
628,
668,
669,
704,
705,
731,
751,
761,
768,
789,
796,
872,
873,
896,
897,
973,
974,
1029,
1030,
1084,
1085,
1415,
1416,
1508,
1509,
1544,
1545,
1603,
1604,
1822,
1959,
1960
],
"line_end_idx": [
11,
12,
92,
93,
160,
161,
176,
177,
248,
249,
307,
308,
364,
421,
422,
437,
457,
472,
473,
552,
553,
583,
584,
627,
628,
668,
669,
704,
705,
731,
751,
761,
768,
789,
796,
872,
873,
896,
897,
973,
974,
1029,
1030,
1084,
1085,
1415,
1416,
1508,
1509,
1544,
1545,
1603,
1604,
1822,
1959,
1960,
2077
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2077,
"ccnet_original_nlines": 56,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.190476194024086,
"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.2857142984867096,
"rps_doc_frac_unique_words": 0.4054878056049347,
"rps_doc_mean_word_length": 4.987804889678955,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.4565629959106445,
"rps_doc_word_count": 328,
"rps_doc_frac_chars_dupe_10grams": 0.06968215107917786,
"rps_doc_frac_chars_dupe_5grams": 0.15892420709133148,
"rps_doc_frac_chars_dupe_6grams": 0.09779950976371765,
"rps_doc_frac_chars_dupe_7grams": 0.06968215107917786,
"rps_doc_frac_chars_dupe_8grams": 0.06968215107917786,
"rps_doc_frac_chars_dupe_9grams": 0.06968215107917786,
"rps_doc_frac_chars_top_2gram": 0.06723716109991074,
"rps_doc_frac_chars_top_3gram": 0.11613692343235016,
"rps_doc_frac_chars_top_4gram": 0.048899758607149124,
"rps_doc_books_importance": -176.62091064453125,
"rps_doc_books_importance_length_correction": -176.62091064453125,
"rps_doc_openwebtext_importance": -97.83726501464844,
"rps_doc_openwebtext_importance_length_correction": -97.83726501464844,
"rps_doc_wikipedia_importance": -62.05720520019531,
"rps_doc_wikipedia_importance_length_correction": -62.05720520019531
},
"fasttext": {
"dclm": 0.10212045907974243,
"english": 0.7009660601615906,
"fineweb_edu_approx": 3.2586960792541504,
"eai_general_math": 0.6928933262825012,
"eai_open_web_math": 0.7713413834571838,
"eai_web_code": 0.005479100160300732
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "516.1",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
},
"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": "1",
"label": "Factual"
},
"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": "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
|
-5,295,042,668,195,158,000 |
Sunday
January 25, 2015
Homework Help: math
Posted by michele on Thursday, April 8, 2010 at 2:59pm.
a 46 5/16 lb bag of nuts is packaged in 1 3/4 lb containers. the remaining nuts are given to the person packing the nuts. how much does the person get? justify your answer
Answer this Question
First Name:
School Subject:
Answer:
Related Questions
maths - Simon had 5/6kg of nuts. He repacked them into containers containing 1/...
Math grd 12 - The number of nuts in a package of Nutty's premium cashews is ...
Math 10 - cashew nuts sell for $21.00/kg. Brazil nuts sell for $15.00/k. A ...
math - cashew nuts sell for $21.00/kg. Brazil nuts sell for $15.00/k. A ...
MATH - 4. 8 bolts and 6 nuts weigh 138 grams. 3 bolts and 5 nuts weigh 71 grams...
math2 - If you have a line plot with a bag of nuts(in pounds) and there is 1/8 ...
Chemistry - Assume that you had 15 nuts (N) and 10 bolts (B). How many N2B ...
math - A store sells snacks by weight. A six ounce bag of mixed nuts costs $3.60...
math - wendy is making two different recipes for nut bread. One recipe call for ...
math - If you were buying nuts, would you rather pay $9/kg or $4/ 500g of nuts?
Members
|
{
"url": "http://www.jiskha.com/display.cgi?id=1270753140",
"source_domain": "www.jiskha.com",
"snapshot_id": "crawl=CC-MAIN-2015-06",
"warc_metadata": {
"Content-Length": "8462",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MZWURHIY6NR6MTT77Z3EHBW6UUJQU5BH",
"WARC-Concurrent-To": "<urn:uuid:5ce2a7b8-4f3c-481a-8878-f3b878060065>",
"WARC-Date": "2015-01-25T18:37:16Z",
"WARC-IP-Address": "69.16.226.94",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:DX33QHHLVBY4OWRHDKBWQHEVIGRIODEA",
"WARC-Record-ID": "<urn:uuid:2bfe0716-fdfc-4f53-b365-f5457fd1fa95>",
"WARC-Target-URI": "http://www.jiskha.com/display.cgi?id=1270753140",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9a37dff8-8859-423e-8f69-afb765976504>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-212-252.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-06\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for January 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
7,
24,
25,
45,
46,
102,
103,
275,
276,
297,
298,
310,
326,
334,
335,
353,
354,
437,
517,
596,
672,
755,
838,
917,
1001,
1085,
1165,
1166
],
"line_end_idx": [
7,
24,
25,
45,
46,
102,
103,
275,
276,
297,
298,
310,
326,
334,
335,
353,
354,
437,
517,
596,
672,
755,
838,
917,
1001,
1085,
1165,
1166,
1173
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1173,
"ccnet_original_nlines": 28,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23076923191547394,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02675585076212883,
"rps_doc_frac_lines_end_with_ellipsis": 0.3103448152542114,
"rps_doc_frac_no_alph_words": 0.3645485043525696,
"rps_doc_frac_unique_words": 0.6255924105644226,
"rps_doc_mean_word_length": 4.018957138061523,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0.030100330710411072,
"rps_doc_unigram_entropy": 4.577770709991455,
"rps_doc_word_count": 211,
"rps_doc_frac_chars_dupe_10grams": 0.1179245263338089,
"rps_doc_frac_chars_dupe_5grams": 0.1179245263338089,
"rps_doc_frac_chars_dupe_6grams": 0.1179245263338089,
"rps_doc_frac_chars_dupe_7grams": 0.1179245263338089,
"rps_doc_frac_chars_dupe_8grams": 0.1179245263338089,
"rps_doc_frac_chars_dupe_9grams": 0.1179245263338089,
"rps_doc_frac_chars_top_2gram": 0.028301889076828957,
"rps_doc_frac_chars_top_3gram": 0.05188678950071335,
"rps_doc_frac_chars_top_4gram": 0.04009433835744858,
"rps_doc_books_importance": -142.40628051757812,
"rps_doc_books_importance_length_correction": -142.40628051757812,
"rps_doc_openwebtext_importance": -76.1833267211914,
"rps_doc_openwebtext_importance_length_correction": -75.80355834960938,
"rps_doc_wikipedia_importance": -67.05670928955078,
"rps_doc_wikipedia_importance_length_correction": -67.05670928955078
},
"fasttext": {
"dclm": 0.15737998485565186,
"english": 0.9419127702713013,
"fineweb_edu_approx": 2.576580047607422,
"eai_general_math": 0.01352280005812645,
"eai_open_web_math": 0.16502082347869873,
"eai_web_code": 0.00014913000632077456
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
},
"secondary": {
"code": "641.3",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Home economics",
"level_3": "Cooking and Gastronomy"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,995,365,051,431,513,600 |
Missing signature verification of JWT
Description
Failing to verify the signature of JSON Web Tokens (JWTs) compromises the security of an application. Signature verification is crucial for confirming the authenticity and integrity of JWTs. Without this verification, your application is open to token forgery and replay attacks, where attackers can manipulate or reuse tokens to gain unauthorized access.
Remediations
• Do not use the parse() method for handling JWTs, as it does not verify the token's signature, leaving a significant security gap.
Jwts.parser().setSigningKey(JWT_PASSWORD).parse(accessToken); // unsafe
• Do use the parseClaimsJws() method when working with JWTs. This method ensures that the signature is verified, safeguarding against the manipulation of token data.
Jwts.parser().setSigningKey(JWT_PASSWORD).parseClaimsJws(accessToken);
References
Associated CWE
OWASP Top 10
Configuration
To skip this rule during a scan, use the following flag
bearer scan /path/to/your-project/ --skip-rule=java_lang_jwt_verification_bypass
To run only this rule during a scan, use the following flag
bearer scan /path/to/your-project/ --only-rule=java_lang_jwt_verification_bypass
|
{
"url": "https://docs.bearer.com/reference/rules/java_lang_jwt_verification_bypass/",
"source_domain": "docs.bearer.com",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "43994",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Q5H2JG5H75KZROZFDXWPFFDJX5LFXPJ4",
"WARC-Concurrent-To": "<urn:uuid:c472c9eb-63ae-4954-bf97-d7ca3ae6c70b>",
"WARC-Date": "2024-07-13T03:09:01Z",
"WARC-IP-Address": "185.199.111.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FKRTR3TAA6E7I5NEQZKBSZUVJBOD24C5",
"WARC-Record-ID": "<urn:uuid:e4efa8f7-fcaf-4cac-9a0f-1749373936d6>",
"WARC-Target-URI": "https://docs.bearer.com/reference/rules/java_lang_jwt_verification_bypass/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fd0aea3e-fc99-4fb9-b5fc-8dc7b7aa634a>"
},
"warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-196\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
38,
39,
51,
52,
408,
409,
422,
423,
557,
633,
801,
876,
877,
888,
889,
904,
905,
918,
919,
933,
934,
990,
991,
1072,
1073,
1133,
1134
],
"line_end_idx": [
38,
39,
51,
52,
408,
409,
422,
423,
557,
633,
801,
876,
877,
888,
889,
904,
905,
918,
919,
933,
934,
990,
991,
1072,
1073,
1133,
1134,
1214
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1214,
"ccnet_original_nlines": 27,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2777777910232544,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0277777798473835,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23148147761821747,
"rps_doc_frac_unique_words": 0.6081081032752991,
"rps_doc_mean_word_length": 6.567567348480225,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.276795387268066,
"rps_doc_word_count": 148,
"rps_doc_frac_chars_dupe_10grams": 0.13374486565589905,
"rps_doc_frac_chars_dupe_5grams": 0.13374486565589905,
"rps_doc_frac_chars_dupe_6grams": 0.13374486565589905,
"rps_doc_frac_chars_dupe_7grams": 0.13374486565589905,
"rps_doc_frac_chars_dupe_8grams": 0.13374486565589905,
"rps_doc_frac_chars_dupe_9grams": 0.13374486565589905,
"rps_doc_frac_chars_top_2gram": 0.02469136007130146,
"rps_doc_frac_chars_top_3gram": 0.02880658023059368,
"rps_doc_frac_chars_top_4gram": 0.030864199623465538,
"rps_doc_books_importance": -89.32318878173828,
"rps_doc_books_importance_length_correction": -89.32318878173828,
"rps_doc_openwebtext_importance": -52.04952621459961,
"rps_doc_openwebtext_importance_length_correction": -52.04924392700195,
"rps_doc_wikipedia_importance": -44.74528121948242,
"rps_doc_wikipedia_importance_length_correction": -44.74528121948242
},
"fasttext": {
"dclm": 0.2437678575515747,
"english": 0.748854398727417,
"fineweb_edu_approx": 2.304248094558716,
"eai_general_math": 0.25897079706192017,
"eai_open_web_math": 0.23765885829925537,
"eai_web_code": 0.29517877101898193
}
}
|
{
"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": "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
|
-6,285,093,359,942,724,000 |
1. Are you ready for the Galaxy S20? Here is everything we know so far!
NO Hulu for Android
Discussion in 'Android Lounge' started by ssummer, May 18, 2010.
1. ssummer
ssummer Newbie
Thread Starter
If I had any doubt before, this article just removed it. Hulu has made it abundantly clear in the past (and now) that they do NOT want their content on mobile devices (a perfect example is the Skyfire situation). I never could figure out why that was the case, but now it seems that the major networks don't want to just give away their content on mobile devices (even with ad revenue) but prefer a subscription model (i.e. PrimeTime2Go). Even if Hulu wants to enter the mobile space, their content providers probably have restricted them from doing so.
When Flash 10.1 comes to Android, everyone thinks that Hulu is going to be a given. I think not. If Hulu is actively blocking Skyfire on Android, you seriously think that they won't just as quickly block the Android browser (or any other mobile browser for that matter)? Simple user agent spoofing (i.e. the browser pretending to be a desktop version) probably won't do the trick either (that's how Skyfire tried to circumvent the block), Hulu is smarter than that.
Anyone eagerly anticipating Hulu on their Android device with the release of Flash 10.1 better get ready for a long and drawn out game of cat-and-mouse involving some serious hackery, bootleg apps, and frequent outages.
And to those that say we don't need Hulu because we can just go to the individual network's site to watch a show, needs to actually look at all the non-network TV content Hulu offers.
1. Download the Forums for Android™ app!
Download
2. caustic
caustic Guest
I've seen a few websites that have a mobile version designed specifically so people can't view the content (one that I remember the mobile version talking about a subscription so that you could). I can look at these sites in their regular mode on my Droid, circumventing this. Obviously Hulu is putting more work into ensuring things don't work on mobile.
What I think it comes down to is, will Hulu be able to tell. Running in Desktop mode, those other websites were not able to distinguish me between a mobile and a desktop. Do the mobile browsers tell websites "hey this is Android, but we want to see non mobile" or does it, from a coding standpoint, not differ at all? The same thing about Flash 10.1. If it carries the info that you're coming from an Android device, Hulu will block it.
Loading...
Share This Page
Loading...
|
{
"url": "https://androidforums.com/threads/no-hulu-for-android.80933/",
"source_domain": "androidforums.com",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "107722",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IHJNNR4CYWQRSG6TLHK54BM7CBCR7TNL",
"WARC-Concurrent-To": "<urn:uuid:9c005e57-8018-4ec2-8a23-b2e88a0ec230>",
"WARC-Date": "2022-05-16T21:00:58Z",
"WARC-IP-Address": "157.230.209.131",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:77IZYLB3XTDFTKCWBMH32FITNT7WF4T7",
"WARC-Record-ID": "<urn:uuid:73b059d0-0639-4107-a433-3e285f62e0f9>",
"WARC-Target-URI": "https://androidforums.com/threads/no-hulu-for-android.80933/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:aba90363-bab3-4c00-8ae6-5a4879b3db9c>"
},
"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-36\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,
74,
75,
95,
96,
161,
162,
175,
176,
195,
214,
215,
773,
774,
1244,
1245,
1469,
1470,
1658,
1664,
1665,
1666,
1667,
1712,
1713,
1714,
1729,
1730,
1738,
1751,
1752,
1770,
1771,
2131,
2132,
2573,
2579,
2590,
2591,
2607,
2608
],
"line_end_idx": [
74,
75,
95,
96,
161,
162,
175,
176,
195,
214,
215,
773,
774,
1244,
1245,
1469,
1470,
1658,
1664,
1665,
1666,
1667,
1712,
1713,
1714,
1729,
1730,
1738,
1751,
1752,
1770,
1771,
2131,
2132,
2573,
2579,
2590,
2591,
2607,
2608,
2618
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2618,
"ccnet_original_nlines": 40,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4540441334247589,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.020220590755343437,
"rps_doc_frac_lines_end_with_ellipsis": 0.04878048971295357,
"rps_doc_frac_no_alph_words": 0.17279411852359772,
"rps_doc_frac_unique_words": 0.5247747898101807,
"rps_doc_mean_word_length": 4.490991115570068,
"rps_doc_num_sentences": 35,
"rps_doc_symbol_to_word_ratio": 0.0036764699034392834,
"rps_doc_unigram_entropy": 5.075237274169922,
"rps_doc_word_count": 444,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.027081239968538284,
"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.012036110274493694,
"rps_doc_frac_chars_top_3gram": 0.01404212974011898,
"rps_doc_frac_chars_top_4gram": 0.020060179755091667,
"rps_doc_books_importance": -210.90426635742188,
"rps_doc_books_importance_length_correction": -210.90426635742188,
"rps_doc_openwebtext_importance": -90.88933563232422,
"rps_doc_openwebtext_importance_length_correction": -90.88933563232422,
"rps_doc_wikipedia_importance": -61.15353012084961,
"rps_doc_wikipedia_importance_length_correction": -61.15353012084961
},
"fasttext": {
"dclm": 0.34516847133636475,
"english": 0.9599425792694092,
"fineweb_edu_approx": 0.987838625907898,
"eai_general_math": 0.028537029400467873,
"eai_open_web_math": 0.26198309659957886,
"eai_web_code": 0.026764750480651855
}
}
|
{
"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": "384.3",
"labels": {
"level_1": "Social sciences",
"level_2": "Commerce and Communication and traffic",
"level_3": "Telecommunication"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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
|
8,210,079,210,208,127,000 |
#include <stdio.h>
#include <stdint.h>
#include <string.h>
#include "main.h"
#include<math.h>
ADC_HandleTypeDef hadc1;
void floatToString2(float number) {
int integerPart = (int)number;
int decimalPart = (int)((number - integerPart) * 100); // Assuming 2 decimal places
if (number < 0) {
decimalPart*=-1;
}
printf("Lux: %d.%02d\n", integerPart, decimalPart);
}
UART_HandleTypeDef huart2;
void SystemClock_Config(void);
static void MX_GPIO_Init(void);
static void MX_ADC1_Init(void);
static void MX_USART2_UART_Init(void);
int main(void)
{
HAL_Init();
SystemClock_Config();
MX_GPIO_Init();
MX_ADC1_Init();
MX_USART2_UART_Init();
HAL_ADCEx_Calibration_Start(&hadc1);
while (1)
{
HAL_ADC_Start(&hadc1);
HAL_ADC_PollForConversion(&hadc1, 100);
uint32_t adc = HAL_ADC_GetValue(&hadc1);
float voltage = adc / 4095.0 * 5.0; // Điện áp tối đa của STM32 là 3.3V, điều chỉnh nếu cần
float resistance = 2000.0 * voltage / (1.0 - voltage / 5.0); // Giá trị của Resistor kết nối với cảm biến ánh sáng
float lux = pow(50 * 1e3 * pow(10, 0.7) / resistance, (1.0 / 0.7)); // Công thức tính toán Lux, điều chỉnh nếu cần
HAL_ADC_Stop(&hadc1);
floatToString2(lux);
if(adc==400)
{
HAL_GPIO_WritePin(GPIOA, GPIO_PIN_0, GPIO_PIN_SET);
}
else
{
HAL_GPIO_WritePin(GPIOA, GPIO_PIN_0, GPIO_PIN_RESET);
}
HAL_Delay(2000);
}
}
/**
* @brief System Clock Configuration
* @retval None
*/
void SystemClock_Config(void)
{
RCC_OscInitTypeDef RCC_OscInitStruct = {0};
RCC_ClkInitTypeDef RCC_ClkInitStruct = {0};
/** Initializes the RCC Oscillators according to the specified parameters
* in the RCC_OscInitTypeDef structure.
*/
RCC_OscInitStruct.OscillatorType = RCC_OSCILLATORTYPE_HSI;
RCC_OscInitStruct.HSIState = RCC_HSI_ON;
RCC_OscInitStruct.HSIDiv = RCC_HSI_DIV1;
RCC_OscInitStruct.HSICalibrationValue = RCC_HSICALIBRATION_DEFAULT;
if (HAL_RCC_OscConfig(&RCC_OscInitStruct) != HAL_OK)
{
Error_Handler();
}
/** Initializes the CPU, AHB and APB buses clocks
*/
RCC_ClkInitStruct.ClockType = RCC_CLOCKTYPE_HCLK|RCC_CLOCKTYPE_SYSCLK
|RCC_CLOCKTYPE_PCLK1;
RCC_ClkInitStruct.SYSCLKSource = RCC_SYSCLKSOURCE_HSI;
RCC_ClkInitStruct.SYSCLKDivider = RCC_SYSCLK_DIV1;
RCC_ClkInitStruct.AHBCLKDivider = RCC_HCLK_DIV1;
RCC_ClkInitStruct.APB1CLKDivider = RCC_APB1_DIV1;
if (HAL_RCC_ClockConfig(&RCC_ClkInitStruct, FLASH_LATENCY_1) != HAL_OK)
{
Error_Handler();
}
}
/**
* @brief ADC1 Initialization Function
* @param None
* @retval None
*/
static void MX_ADC1_Init(void)
{
ADC_ChannelConfTypeDef sConfig = {0};
hadc1.Instance = ADC1;
hadc1.Init.ClockPrescaler = ADC_CLOCK_SYNC_PCLK_DIV2;
hadc1.Init.Resolution = ADC_RESOLUTION_12B;
hadc1.Init.DataAlign = ADC_DATAALIGN_RIGHT;
hadc1.Init.ScanConvMode = ADC_SCAN_DISABLE;
hadc1.Init.EOCSelection = ADC_EOC_SINGLE_CONV;
hadc1.Init.LowPowerAutoWait = DISABLE;
hadc1.Init.LowPowerAutoPowerOff = DISABLE;
hadc1.Init.ContinuousConvMode = DISABLE;
hadc1.Init.NbrOfConversion = 1;
hadc1.Init.DiscontinuousConvMode = DISABLE;
hadc1.Init.ExternalTrigConv = ADC_SOFTWARE_START;
hadc1.Init.ExternalTrigConvEdge = ADC_EXTERNALTRIGCONVEDGE_NONE;
hadc1.Init.DMAContinuousRequests = DISABLE;
hadc1.Init.Overrun = ADC_OVR_DATA_PRESERVED;hadc1.Init.SamplingTimeCommon1 = ADC_SAMPLETIME_1CYCLE_5;
hadc1.Init.SamplingTimeCommon2 = ADC_SAMPLETIME_1CYCLE_5;
hadc1.Init.OversamplingMode = DISABLE;
hadc1.Init.TriggerFrequencyMode = ADC_TRIGGER_FREQ_HIGH;
if (HAL_ADC_Init(&hadc1) != HAL_OK)
{
Error_Handler();
}
/** Configure Regular Channel
*/
sConfig.Channel = ADC_CHANNEL_7;
sConfig.Rank = ADC_REGULAR_RANK_1;
sConfig.SamplingTime = ADC_SAMPLINGTIME_COMMON_1;
if (HAL_ADC_ConfigChannel(&hadc1, &sConfig) != HAL_OK)
{
Error_Handler();
}
}
/**
* @brief USART2 Initialization Function
* @param None
* @retval None
*/
static void MX_USART2_UART_Init(void)
{
GPIO_InitTypeDef GPIO_InitStruct = {0};
__HAL_RCC_USART2_CLK_ENABLE();
__HAL_RCC_GPIOA_CLK_ENABLE();
/**USART2 GPIO Configuration
PA2 ------> USART2_TX
PA3 ------> USART2_RX
*/
GPIO_InitStruct.Pin = GPIO_PIN_2|GPIO_PIN_3;
GPIO_InitStruct.Mode = GPIO_MODE_AF_PP;
GPIO_InitStruct.Pull = GPIO_NOPULL;
GPIO_InitStruct.Speed = GPIO_SPEED_FREQ_LOW;
GPIO_InitStruct.Alternate = GPIO_AF1_USART2;
HAL_GPIO_Init(GPIOA, &GPIO_InitStruct);
huart2.Instance = USART2;
huart2.Init.BaudRate = 115200;
huart2.Init.WordLength = UART_WORDLENGTH_8B;
huart2.Init.StopBits = UART_STOPBITS_1;
huart2.Init.Parity = UART_PARITY_NONE;
huart2.Init.Mode = UART_MODE_TX_RX;
huart2.Init.HwFlowCtl = UART_HWCONTROL_NONE;
huart2.Init.OverSampling = UART_OVERSAMPLING_16;
huart2.Init.OneBitSampling = UART_ONE_BIT_SAMPLE_DISABLE;
huart2.Init.ClockPrescaler = UART_PRESCALER_DIV1;
huart2.AdvancedInit.AdvFeatureInit = UART_ADVFEATURE_NO_INIT;
if (HAL_UART_Init(&huart2) != HAL_OK)
{
Error_Handler();
}
/* USER CODE BEGIN USART2_Init 2 */
/* USER CODE END USART2_Init 2 */
}
/**
* @brief GPIO Initialization Function
* @param None
* @retval None
*/
static void MX_GPIO_Init(void)
{
GPIO_InitTypeDef GPIO_InitStruct = {0};
/* USER CODE BEGIN MX_GPIO_Init_1 */
/* USER CODE END MX_GPIO_Init_1 */
/* GPIO Ports Clock Enable */
__HAL_RCC_GPIOC_CLK_ENABLE();
__HAL_RCC_GPIOF_CLK_ENABLE();
__HAL_RCC_GPIOA_CLK_ENABLE();
__HAL_RCC_GPIOB_CLK_ENABLE();
/*Configure GPIO pin : PA0 */
GPIO_InitStruct.Pin = GPIO_PIN_0;
GPIO_InitStruct.Mode = GPIO_MODE_OUTPUT_PP;
GPIO_InitStruct.Pull = GPIO_NOPULL;
HAL_GPIO_Init(GPIOA, &GPIO_InitStruct);
/*Configure GPIO pins : PB8 PB9 */
GPIO_InitStruct.Pin = GPIO_PIN_8|GPIO_PIN_9;
GPIO_InitStruct.Mode = GPIO_MODE_AF_OD;
GPIO_InitStruct.Pull = GPIO_NOPULL;
GPIO_InitStruct.Speed = GPIO_SPEED_FREQ_LOW;
GPIO_InitStruct.Alternate = GPIO_AF6_I2C1;
HAL_GPIO_Init(GPIOB, &GPIO_InitStruct);
/* USER CODE BEGIN MX_GPIO_Init_2 */
/* USER CODE END MX_GPIO_Init_2 */
}
/* USER CODE BEGIN 4 */
/* USER CODE END 4 */
/**
* @brief This function is executed in case of error occurrence.
* @retval None
*/
void Error_Handler(void)
{
/* USER CODE BEGIN Error_Handler_Debug */
/* User can add his own implementation to report the HAL error return state */
__disable_irq();
while (1)
{
}
/* USER CODE END Error_Handler_Debug */
}
#ifdef USE_FULL_ASSERT
/**
* @brief Reports the name of the source file and the source line number
* where the assert_param error has occurred.
* @param file: pointer to the source file name
* @param line: assert_param error line source number
* @retval None
*/
void assert_failed(uint8_t *file, uint32_t line)
{
/* USER CODE BEGIN 6 */
/* User can add his own implementation to report the file name and line number,
ex: printf("Wrong parameters value: file %s on line %d\r\n", file, line) */
/* USER CODE END 6 */
}
#endif /* USE_FULL_ASSERT */
#define STDOUT_FILENO 1
#define STDERR_FILENO 2
int _write(int file, uint8_t *ptr, int len)
{
switch (file)
{
case STDOUT_FILENO:
HAL_UART_Transmit(&huart2, ptr, len, HAL_MAX_DELAY);
break;
case STDERR_FILENO:
HAL_UART_Transmit(&huart2, ptr, len, HAL_MAX_DELAY);
break;
default:
return -1;
}
return len;
}
Loading
st-nucleo-c031c6
|
{
"url": "https://wokwi.com/projects/381901559921888257",
"source_domain": "wokwi.com",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "65716",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UY7OAUAYTNL37URXNP5J467VMTCQYE3P",
"WARC-Concurrent-To": "<urn:uuid:ac2b0ddd-a1cf-4899-a972-46686378cede>",
"WARC-Date": "2023-12-06T11:29:47Z",
"WARC-IP-Address": "104.26.13.166",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AQMHBVXJLQBC3W2YVDFRTJD44EQC7Y3W",
"WARC-Record-ID": "<urn:uuid:3521f20d-8773-40fd-bda8-c4d4856aa4cd>",
"WARC-Target-URI": "https://wokwi.com/projects/381901559921888257",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d5cc6d91-1b09-4b33-8cb8-5e5c1fce9734>"
},
"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-94\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,
19,
39,
59,
77,
94,
119,
120,
156,
191,
279,
280,
302,
328,
334,
390,
392,
393,
420,
451,
483,
515,
554,
569,
571,
585,
586,
610,
611,
629,
647,
672,
711,
727,
735,
766,
814,
863,
963,
1086,
1209,
1216,
1246,
1275,
1284,
1285,
1307,
1318,
1380,
1391,
1405,
1416,
1480,
1491,
1492,
1514,
1522,
1523,
1525,
1526,
1530,
1568,
1585,
1590,
1620,
1622,
1668,
1714,
1715,
1791,
1832,
1837,
1898,
1941,
1984,
2054,
2109,
2113,
2134,
2138,
2139,
2191,
2196,
2268,
2320,
2377,
2430,
2481,
2533,
2534,
2608,
2612,
2633,
2637,
2639,
2640,
2644,
2684,
2700,
2717,
2722,
2753,
2755,
2793,
2816,
2870,
2914,
2958,
3002,
3049,
3088,
3131,
3172,
3204,
3248,
3298,
3363,
3407,
3509,
3567,
3606,
3663,
3699,
3701,
3718,
3720,
3750,
3753,
3786,
3821,
3871,
3926,
3928,
3945,
3947,
3949,
3953,
3995,
4011,
4028,
4033,
4071,
4073,
4116,
4150,
4151,
4184,
4216,
4245,
4274,
4280,
4328,
4371,
4410,
4458,
4506,
4549,
4550,
4578,
4611,
4658,
4700,
4741,
4779,
4826,
4877,
4937,
4989,
5053,
5093,
5097,
5118,
5122,
5160,
5161,
5197,
5198,
5200,
5201,
5205,
5245,
5261,
5278,
5283,
5314,
5316,
5358,
5395,
5430,
5431,
5463,
5495,
5527,
5559,
5591,
5592,
5624,
5660,
5706,
5744,
5786,
5787,
5824,
5871,
5913,
5951,
5998,
6043,
6085,
6086,
6123,
6158,
6160,
6161,
6185,
6186,
6208,
6209,
6213,
6280,
6297,
6302,
6327,
6329,
6373,
6454,
6473,
6485,
6489,
6490,
6491,
6496,
6500,
6542,
6544,
6545,
6569,
6573,
6648,
6703,
6753,
6809,
6826,
6831,
6880,
6882,
6908,
6990,
7071,
7095,
7097,
7126,
7152,
7178,
7179,
7223,
7225,
7241,
7245,
7269,
7328,
7341,
7342,
7366,
7425,
7438,
7439,
7452,
7469,
7473,
7474,
7488,
7490,
7498
],
"line_end_idx": [
19,
39,
59,
77,
94,
119,
120,
156,
191,
279,
280,
302,
328,
334,
390,
392,
393,
420,
451,
483,
515,
554,
569,
571,
585,
586,
610,
611,
629,
647,
672,
711,
727,
735,
766,
814,
863,
963,
1086,
1209,
1216,
1246,
1275,
1284,
1285,
1307,
1318,
1380,
1391,
1405,
1416,
1480,
1491,
1492,
1514,
1522,
1523,
1525,
1526,
1530,
1568,
1585,
1590,
1620,
1622,
1668,
1714,
1715,
1791,
1832,
1837,
1898,
1941,
1984,
2054,
2109,
2113,
2134,
2138,
2139,
2191,
2196,
2268,
2320,
2377,
2430,
2481,
2533,
2534,
2608,
2612,
2633,
2637,
2639,
2640,
2644,
2684,
2700,
2717,
2722,
2753,
2755,
2793,
2816,
2870,
2914,
2958,
3002,
3049,
3088,
3131,
3172,
3204,
3248,
3298,
3363,
3407,
3509,
3567,
3606,
3663,
3699,
3701,
3718,
3720,
3750,
3753,
3786,
3821,
3871,
3926,
3928,
3945,
3947,
3949,
3953,
3995,
4011,
4028,
4033,
4071,
4073,
4116,
4150,
4151,
4184,
4216,
4245,
4274,
4280,
4328,
4371,
4410,
4458,
4506,
4549,
4550,
4578,
4611,
4658,
4700,
4741,
4779,
4826,
4877,
4937,
4989,
5053,
5093,
5097,
5118,
5122,
5160,
5161,
5197,
5198,
5200,
5201,
5205,
5245,
5261,
5278,
5283,
5314,
5316,
5358,
5395,
5430,
5431,
5463,
5495,
5527,
5559,
5591,
5592,
5624,
5660,
5706,
5744,
5786,
5787,
5824,
5871,
5913,
5951,
5998,
6043,
6085,
6086,
6123,
6158,
6160,
6161,
6185,
6186,
6208,
6209,
6213,
6280,
6297,
6302,
6327,
6329,
6373,
6454,
6473,
6485,
6489,
6490,
6491,
6496,
6500,
6542,
6544,
6545,
6569,
6573,
6648,
6703,
6753,
6809,
6826,
6831,
6880,
6882,
6908,
6990,
7071,
7095,
7097,
7126,
7152,
7178,
7179,
7223,
7225,
7241,
7245,
7269,
7328,
7341,
7342,
7366,
7425,
7438,
7439,
7452,
7469,
7473,
7474,
7488,
7490,
7498,
7514
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7514,
"ccnet_original_nlines": 273,
"rps_doc_curly_bracket": 0.006654249969869852,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.05076922848820686,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.11076922714710236,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.49076923727989197,
"rps_doc_frac_unique_words": 0.5547576546669006,
"rps_doc_mean_word_length": 9.192100524902344,
"rps_doc_num_sentences": 107,
"rps_doc_symbol_to_word_ratio": 0.006923079956322908,
"rps_doc_unigram_entropy": 5.436315536499023,
"rps_doc_word_count": 557,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09628906100988388,
"rps_doc_frac_chars_dupe_6grams": 0.0458984412252903,
"rps_doc_frac_chars_dupe_7grams": 0.0458984412252903,
"rps_doc_frac_chars_dupe_8grams": 0.0458984412252903,
"rps_doc_frac_chars_dupe_9grams": 0.01601562090218067,
"rps_doc_frac_chars_top_2gram": 0.01875000074505806,
"rps_doc_frac_chars_top_3gram": 0.015234369784593582,
"rps_doc_frac_chars_top_4gram": 0.01816405914723873,
"rps_doc_books_importance": -548.9459838867188,
"rps_doc_books_importance_length_correction": -548.9459838867188,
"rps_doc_openwebtext_importance": -292.78839111328125,
"rps_doc_openwebtext_importance_length_correction": -292.78839111328125,
"rps_doc_wikipedia_importance": -158.79331970214844,
"rps_doc_wikipedia_importance_length_correction": -158.79331970214844
},
"fasttext": {
"dclm": 0.9969205260276794,
"english": 0.3358347713947296,
"fineweb_edu_approx": 3.582282066345215,
"eai_general_math": 0.7163660526275635,
"eai_open_web_math": 0.8197100758552551,
"eai_web_code": 0.6349219083786011
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "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
|
6,820,901,417,627,491,000 |
SQLServerCentral.com / SQL Server 2008 / T-SQL (SS2K8) / Recursion with a Twist / Latest PostsInstantForum.NET v2.9.0SQLServerCentral.comhttp://www.sqlservercentral.com/Forums/[email protected], 28 May 2016 22:32:22 GMT20RE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspx[quote][b]mister.magoo (12/2/2012)[/b][hr]I think there is a problem with duplicates...although this test data may not be valid.[/quote]I found another issue with the recursive CTE solution, so I have removed it for the time being.Sun, 02 Dec 2012 19:51:18 GMTPaul WhiteRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspxAs is becoming a habit, I would like to offer up my Identity Hack - rCTE replacement... It performs quite nicely and doesn't suffer from the dupes problem I have seen in some others - I think...[code="sql"]---- Create a temp table to hold the results---- include an identity column to keep track of the recursion---- include a computed column to keep track of whether we are---- looking for InvoiceId or BookingId, which flips every other ---- loop, so first we look for BookingId, then InvoiceIdIF OBJECT_ID('tempdb..#idhack') IS NULLBEGIN CREATE TABLE #idhack( Depth INT IDENTITY(1,1) NOT NULL, InvoiceId INT NOT NULL, BookingId INT NOT NULL, InvOrBook AS (Depth & 1) PERSISTED -- Flips every other row. ); CREATE UNIQUE CLUSTERED INDEX ix_bid ON #idhack(BookingId,InvoiceId); CREATE UNIQUE INDEX ix_invid ON #idhack(InvoiceId,BookingId) include (InvOrBook);ENDDECLARE @InvoiceID INTEGER = 3;-- Enable identity insert so we can insert our own values and have duplicates.SET IDENTITY_INSERT #idhack ON;-- put the first invoice into the resultsINSERT #idhack(Depth, InvoiceId, BookingId)SELECT 1, ids.InvoiceId, ids.BookingIdFROM #IDS AS idsWHERE ids.InvoiceId = @InvoiceID;-- recurse down looking for more invoices / bookings-- use SCOPE_IDENTITY to tell us which level we are on.WHILE @@ROWCOUNT>0 INSERT #idhack(Depth, InvoiceId, BookingId) SELECT idh.Depth+1, ids.InvoiceId, ids.BookingId FROM #IDS AS ids JOIN #idhack idh ON (InvOrBook = 1 AND ids.BookingId = idh.BookingId) OR (InvOrBook = 0 AND ids.InvoiceId = idh.InvoiceId) WHERE idh.Depth = SCOPE_IDENTITY() AND NOT EXISTS ( SELECT 1 FROM #idhack idh2 WHERE idh2.InvoiceId = ids.InvoiceId AND idh2.BookingId = ids.BookingId );-- turn off identity insertSET IDENTITY_INSERT #idhack OFF; -- and select the results SELECT InvoiceId, BookingIdFROM #idhack;[/code]Sun, 02 Dec 2012 18:50:52 GMTmister.magooRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspx[quote][b]SQL Kiwi (12/1/2012)[/b][hr]The set-based iteration (WHILE loop) solution may well be best here, but the following is a recursive CTE solution that appears to work correctly:[/quote]Hi Paul, I think there is a problem with duplicates...although this test data may not be valid.Try it with this sample data:[code="sql"]INSERT INTO #IDs( InvoiceId, BookingId) VALUES (1,1), (1,2), (2,1), (2,2);[/code]You get this:[img]http://www.sqlservercentral.com/Forums/Attachment12785.aspx[/img]Sun, 02 Dec 2012 17:51:00 GMTmister.magooRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspx[quote][b]SQL Kiwi (12/1/2012)[/b][hr]The set-based iteration (WHILE loop) solution may well be best here, but the following is a recursive CTE solution that appears to work correctly:[/quote]All "seeks", too! Nicely done.Sun, 02 Dec 2012 07:23:13 GMTJeff ModenRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspx-- removed --Sat, 01 Dec 2012 21:53:13 GMTPaul WhiteRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspx[quote][b]Evil Kraig F (11/28/2012)[/b][hr]This is NOT pretty, but it IS functional.[code="sql"]--am trying to write a query against a table of invoices, returning all relevant rows for a particular InvoiceId. Heres some sample data:--Create temp table to hold the dummy dataif object_id('tempdb..#IDs') is not nulldrop table #IDsif object_id('tempdb..#TempStore') is not nulldrop table #TempStorecreate table #IDs (InvoiceId int not null,BookingId int not null) on [PRIMARY]goalter table #IDs add constraint PK_IDs primary key clustered ( InvoiceId ,BookingId ) with ( STATISTICS_NORECOMPUTE = off ,IGNORE_DUP_KEY = off ,ALLOW_ROW_LOCKS = on ,ALLOW_PAGE_LOCKS = on ) on [PRIMARY]goinsert #IDs ( InvoiceId, BookingId) select * from (values (1,9), (1,10), (1,11), (2,11), (3,11), (3,12), (3,13), (4,14), (5,14)) data(InvoiceId,BookingId)select * from #IDsDECLARE @InvoiceID INT, @Rowcount INTSELECT @InvoiceID = 1, @Rowcount = 1CREATE TABLE #TempStore (InvoiceID INT, BookingID INT)INSERT INTO #TempStoreSELECT InvoiceID, BookingIDFROM #IDsWHERE InvoiceID = @InvoiceID-- Set this here, might as well not hit the loop if no records to work from.SELECT @Rowcount = @@ROWCOUNTWHILE @Rowcount <> 0BEGIN INSERT INTO #TempStore SELECT ids2.InvoiceID, ids2.BookingID FROM #IDs JOIN (SELECT DISTINCT BookingID FROM #TempStore) AS drv ON #IDs.BookingID = drv.BookingID JOIN #IDs AS ids2 ON #IDs.InvoiceID = ids2.InvoiceID WHERE #IDs.InvoiceID NOT IN (SELECT DISTINCT InvoiceID FROM #TempStore) SET @Rowcount = @@ROWCOUNTENDSELECT * FROM #TempStore[/code][/quote]It might not be pretty but it appears to be the fastest... and I can't beat it. Nicely done, Craig!Sat, 01 Dec 2012 19:45:01 GMTJeff ModenRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspxLooking at the data that you've included, Craig, I'm thinking that maybe I didn't have it working at all when it comes to "disconnected" data like you did with the 2,12 entry. Thanks for the test. Back to the drawing board. :blush:Sat, 01 Dec 2012 13:18:54 GMTJeff ModenRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspxHeh... dammit. I had it working and made a final tweek to the code. Now I have to go back and figure out what the heck I changed. Sorry for the mistake. I'll fix it (I think) and will repost it. I took down my original post because it was wrong.Sat, 01 Dec 2012 12:57:13 GMTJeff ModenRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspx*wipes away a tear from his eye* Damn, Jeff... that's... that's just beautiful. *sniff*I couldn't for the life of me figure out how to get out of the IN (SELECT InvoiceID From rCTE) situation. Only one problem.It doesn't recurse past the first series of booking IDs. Check this out:[code="sql"]if object_id('tempdb..#IDs') is not nulldrop table #IDscreate table #IDs (InvoiceId int not null,BookingId int not null) on [PRIMARY]goalter table #IDs add constraint PK_IDs primary key clustered ( InvoiceId ,BookingId ) with ( STATISTICS_NORECOMPUTE = off ,IGNORE_DUP_KEY = off ,ALLOW_ROW_LOCKS = on ,ALLOW_PAGE_LOCKS = on ) on [PRIMARY]goINSERT #IDs VALUES (1,9)INSERT #IDs VALUES (1,10)INSERT #IDs VALUES (1,11)INSERT #IDs VALUES (2,11)INSERT #IDs VALUES (2,12)INSERT #IDs VALUES (3,12)INSERT #IDs VALUES (3,13)INSERT #IDs VALUES (4,14)INSERT #IDs VALUES (5,14)GO--insert #IDs ( InvoiceId, BookingId) --select * from (values (1,9), (1,10), (1,11), (2,11), (3,11), (3,12), (3,13), (4,14), (5,14)) data(InvoiceId,BookingId)select * from #IDs--=================================================================================-- Solve the problem using some "standard" "Traveling Salesman" or "Airline-- Flight Schedule" code. I believe you'll be absolutely amazed as the-- performance of this code.-- This code could easily be turned into an iTVF to be used in CROSS APPLY as-- if it were a parameterized view.--=================================================================================--===== Start a timer because I don't trust SET STATISTICS any more (1). -- Ref (1): http://www.sqlservercentral.com/articles/T-SQL/91724/DECLARE @StartTime DATETIME; SELECT @StartTime = GETDATE();--===== Declare a variable for the original InvoiceID that we want to find and -- stack the others against. This is like identifying the "Start City" -- in a "Traveling Salesman" problem.DECLARE @StartInvoiceID INT; SELECT @StartInvoiceID = 1; --<<< Change this to do other tests. --<<< Any number from 1 to 300,000 will do.--===== Solve the problem as if it were a "Traveling Salesman" problem. The key -- to this is to leave "breadcrumbs" as to where we've been by using a -- "Materialized Hierarchical Path" (the "BeenThere" column).WITHcteBuildPath AS( --=== Find the "top" ID as we would in any hierarchy or net. SELECT a.InvoiceId, a.BookingID, BeenThere = CAST(QUOTENAME(a.InvoiceID,'"') AS VARCHAR(8000)) FROM #IDs AS a --as in "anchor" WHERE InvoiceID = @StartInvoiceID UNION ALL --==== "Loop" through all of the possibilities with some "stop code" to prevent -- the inevitable cycles that will appear because it's not a "DAG". SELECT b.InvoiceID, b.BookingID, BeenThere = r.BeenThere + CAST(QUOTENAME(b.InvoiceID,'"') AS VARCHAR(8000)) FROM #IDs b --as in "base table" JOIN cteBuildPath r --as in "recursive part" ON r.BookingID = b.BookingId WHERE r.BeenThere NOT LIKE '%'+QUOTENAME(b.InvoiceId,'"')+'%') SELECT * FROM cteBuildPath------=== Find the full data for the InvoiceID's that we've touched at least once.-- -- Note that the WHERE IN acts as if it were a DISTINCT so no need to explicity-- -- use the word DISTINCT. -- SELECT o.*-- FROM #IDs o --as in "original" -- WHERE o.InvoiceID IN (SELECT InvoiceId FROM cteBuildPath)-- ORDER BY o.InvoiceID, o.BookingID--;--===== Let's see how long that took. PRINT 'Total Duration = ' + CONVERT(CHAR(12),GETDATE()-@StartTime,114)GO[/code]The result set stops at InvoiceID 2, and doesn't chain to 3 after picking up the BookingIDs for Invoice 2. Sorry for the horrible INSERT statement but I've only got 2k5 at the house.Sat, 01 Dec 2012 12:48:47 GMTEvil Kraig FRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspxPost withdrawn. I made a mistake in the code somewhere. I'll post it as a new post if I can figure out what the heck I did wrong and fix it.Sat, 01 Dec 2012 12:27:41 GMTJeff ModenRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspx[quote][b]Alan.B (11/28/2012)[/b][hr][quote][b]Evil Kraig F (11/28/2012)[/b][hr]This is NOT pretty, but it IS functional.[/quote]I am trying to understand why went with a loop vs a set-based approach. I posted a more set based method earlier that gets the same results notably faster. I am not trying to be confrontational, I'm just trying to understand your approach or what I did wrong.[/quote]If the problem requires that, no matter which InvoiceID you pick, all associated rows for all associated InvoiceIDs will be returned, then it actually can't be done in what most folks consider to be a "set based" manner. There needs to be some form of recursion either as a WHILE loop or as an rCTE (Recursive CTE).I will say that the WHILE loop and the rCTE method can more closely come to "set based" in that sets of rows can be returned for each iteration but it can't be done in a single itermation (what most folks think of as "set based") without giving up on the trait of "unknown depth" as some of the set based solutions on this thread have.Sat, 01 Dec 2012 09:43:43 GMTJeff ModenRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspxOK, sorry. I only read the first few posts and made some faulty assumptions. After considering the last few comments I can see that it really is more complicated than it first appeared. Mea culpa. Fri, 30 Nov 2012 20:51:18 GMTSteven WillisRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspx[quote][b]Steven Willis (11/30/2012)[/b][hr]No loops, no cursors, no cte[/quote]You've answered the data, not the problem, with this. You cannot recurse in both directions, you cannot deal with more than 2 layers of heirarchy. You need to be able to traverse bi-directionally across bookingIDs and InvoiceIDs as well as deal with multiple invoice-booking-invoice-booking-invoice chains.Fri, 30 Nov 2012 20:28:08 GMTEvil Kraig FRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspx[quote][b]capnhector (11/30/2012)[/b]so far an extension of my adjacency list by searching up and down (not the fastest thanks Mickey T. by the way) and [b]dwains loop solution [/b]are the only ones that seem to work fully on the set of data we have.[/quote]Erm, that was mine, as well. Dwain's is basically a variation. I still need a chance to check performance between the two.Fri, 30 Nov 2012 20:25:41 GMTEvil Kraig FRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspx[quote][b]Steven Willis (11/30/2012)[/b][hr]No loops, no cursors, no cte[code="sql"]IF OBJECT_ID('tempdb..#TempTable') IS NOT NULL DROP TABLE #TempTableCREATE TABLE #TempTable ( InvoiceId INT NOT NULL ,BookingId INT NOT NULL ,PRIMARY KEY (InvoiceId,BookingId) )INSERT #TempTable ( InvoiceId ,BookingId ) SELECT * FROM ( VALUES ( 1, 9), ( 1, 10), ( 1, 11), ( 2, 11), ( 3, 11), ( 3, 12), ( 3, 13), ( 4, 14), ( 5, 14) ) data (InvoiceId,BookingId) SELECT DISTINCT t2.InvoiceId ,t2.BookingIdFROM ( SELECT MAX(BookingId) AS BookingId FROM #TempTable GROUP BY BookingId ) AS Sub1INNER JOIN #TempTable AS t1 ON Sub1.BookingId = t1.BookingIdINNER JOIN #TempTable AS t2 ON t1.BookingId = t2.BookingId + 1[/code][/quote]The problem with your code is that if the value (3,14) is present it does not get picked up and neither does (4,14) or (5,14)[code="sql"]IF OBJECT_ID('tempdb..#TempTable') IS NOT NULL DROP TABLE #TempTableCREATE TABLE #TempTable ( InvoiceId INT NOT NULL ,BookingId INT NOT NULL ,PRIMARY KEY (InvoiceId,BookingId) )INSERT #TempTable ( InvoiceId ,BookingId ) SELECT * FROM ( VALUES ( 1, 9), ( 1, 10), ( 1, 11), ( 2, 11), ( 3, 11), ( 3, 12), ( 3, 13), (3,14), ( 4, 14), ( 5, 14) ) data (InvoiceId,BookingId)[/code]so far an extension of my adjacency list by searching up and down (not the fastest thanks Mickey T. by the way) and dwains loop solution are the only ones that seem to work fully on the set of data we have.Fri, 30 Nov 2012 15:42:56 GMTCapnHectorRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspxNo loops, no cursors, no cte[code="sql"]IF OBJECT_ID('tempdb..#TempTable') IS NOT NULL DROP TABLE #TempTableCREATE TABLE #TempTable ( InvoiceId INT NOT NULL ,BookingId INT NOT NULL ,PRIMARY KEY (InvoiceId,BookingId) )INSERT #TempTable ( InvoiceId ,BookingId ) SELECT * FROM ( VALUES ( 1, 9), ( 1, 10), ( 1, 11), ( 2, 11), ( 3, 11), ( 3, 12), ( 3, 13), ( 4, 14), ( 5, 14) ) data (InvoiceId,BookingId) SELECT DISTINCT t2.InvoiceId ,t2.BookingIdFROM ( SELECT MAX(BookingId) AS BookingId FROM #TempTable GROUP BY BookingId ) AS Sub1INNER JOIN #TempTable AS t1 ON Sub1.BookingId = t1.BookingIdINNER JOIN #TempTable AS t2 ON t1.BookingId = t2.BookingId + 1[/code]Fri, 30 Nov 2012 15:32:21 GMTSteven WillisRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspxPost deleted - SSC hung and posted this one to the wrong thread.Thu, 29 Nov 2012 23:27:31 GMTdwain.cRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspxHi Phil - allow me to propose something for you.[code="sql"]DECLARE @RowCount INTDECLARE @IDs TABLE (InvoiceId int not null ,BookingId int not null)INSERT INTO @IDsSELECT InvoiceID, BookingIDFROM #IDsWHERE InvoiceID = 1SET @RowCount = @@ROWCOUNTWHILE @RowCount <> 0BEGIN INSERT INTO @IDs SELECT a.InvoiceID, a.BookingID FROM #IDs a INNER JOIN @IDs b ON a.BookingID = b.BookingID UNION ALL SELECT a.InvoiceID, a.BookingID FROM #IDs a INNER JOIN @IDs b ON a.InvoiceID = b.InvoiceID EXCEPT SELECT a.InvoiceID, a.BookingID FROM @IDs a SET @RowCount = @@ROWCOUNT ENDSELECT * FROM @IDs[/code]I think this resolves the original and the alternate data setup (from Kraig?) properly. As it turns out, I recently solved an problem quite similar to this and this solution has its basis in that.Not to disappoint you Alan (as this uses a loop), it is at least a set-based loop and in the similar problem I solved any attempt at a recursive solution did not perform nearly as well. I have not done that testing here so I can't say for sure whether it will be faster or not.The other advantage to this approach is that it eliminates feedback loops which will completely disintegrate any effort to use a rCTE.Let me know of any cases it doesn't resolve. It is possible that another UNION ALL amidst the loop will take care of it.Thu, 29 Nov 2012 23:25:24 GMTdwain.cRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspx[quote][b]mickyT (11/29/2012)[/b][hr][quote][b]dwain.c (11/29/2012)[/b][hr]To all who participated in this thread:You may wish to review this new article:[url]http://www.sqlservercentral.com/articles/String+Manipulation/94365/[/url]It provides a good utility function for solving this case and many other similar ones. Thanks to the OP for being the inspiration for the article![/quote]Thanks DwainI've already had a look at it and I am going to have a really good read through it soon. Even though I haven't had a chance to dig into the functionality and digest it properly I was impressed with the methods you came up with. Great article:-)[/quote]Thanks for noticing and reading it, and the praise!By all means leave some comments in the discussion thread and don't forget to rate the article!Thu, 29 Nov 2012 23:23:23 GMTdwain.cRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspxHiThe following recursive option might work. It walks up and down from the queried invoice and joins the results.[code="sql"]DECLARE @invoiceID int = 3;with rListUp as ( select a.invoiceid invoiceid, a.invoiceid currentid, a.bookingid, b.invoiceid nextinvoiceid from #IDs a CROSS APPLY (SELECT invoiceid, bookingid FROM #IDs m WHERE m.bookingid = a.bookingid ) b where b.invoiceid > a.invoiceid union all select a.invoiceid, a.nextinvoiceid, a.bookingid, c.invoiceid from rListUp a CROSS APPLY (SELECT l.invoiceid, l.bookingid FROM #IDs l WHERE l.invoiceID = a.nextinvoiceid) b CROSS APPLY (SELECT m.invoiceid, m.bookingid FROM #IDs m WHERE m.bookingid = b.bookingid and m.invoiceid > a.nextinvoiceid ) c ), rListDown as ( select a.invoiceid invoiceid, a.invoiceid currentid, a.bookingid, b.invoiceid nextinvoiceid from #IDs a CROSS APPLY (SELECT invoiceid, bookingid FROM #IDs m WHERE m.bookingid = a.bookingid ) b where b.invoiceid < a.invoiceid union all select a.invoiceid, a.nextinvoiceid, a.bookingid, c.invoiceid from rListDown a CROSS APPLY (SELECT l.invoiceid, l.bookingid FROM #IDs l WHERE l.invoiceID = a.nextinvoiceid) b CROSS APPLY (SELECT m.invoiceid, m.bookingid FROM #IDs m WHERE m.bookingid = b.bookingid and m.invoiceid < a.nextinvoiceid ) c ), rList AS ( SELECT invoiceid, nextinvoiceid FROM rListUp UNION SELECT invoiceid, nextinvoiceid FROM rListDown )select invoiceid, bookingidfrom #IDs where invoiceid in ( select nextinvoiceid from rlist where invoiceID = @InvoiceID union select @InvoiceID )[/code]It could probably be prettied up a bit more and there is still a chance that recursion limits will get hit if there is a long change of invoice/bookingsThu, 29 Nov 2012 18:58:50 GMTmickyTRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspx[quote][b]Phil Parkin (11/29/2012)[/b][hr]I wrote the above response before trying Craig's solution, which certainly does the business - thanks! Maybe this is one instance where a loop is the best solution. I'll leave it a while longer (no pun intended) before I implement it, to see whether anyone comes up with a set-based solution.[/quote]I poked at it a bit more yesterday and while I can make that process look cleaner (it's a bit disorganized) it's the best solution I have available without digging into indexes and possible shortcuts for some of the sub-data, like the BookingID list. The killer is in the self-referencing bookingIDs and the bi-directional hierarchy, where you're going both 'up and down' the chain simultaneously.Glad to help, though. :-)Thu, 29 Nov 2012 11:48:57 GMTEvil Kraig FRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspxI wrote the above response before trying Craig's solution, which certainly does the business - thanks! Maybe this is one instance where a loop is the best solution. I'll leave it a while longer (no pun intended) before I implement it, to see whether anyone comes up with a set-based solution.Thu, 29 Nov 2012 02:02:41 GMTPhil ParkinRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspxFirst of all, thanks to everyone who has taken the time to think about this problem and contribute. I spent over an hour blowing recursion limits left, right and centre yesterday without getting anywhere close, so I appreciate the input.I was excited to see Alan's solution working perfectly with my data, only to test it out using Craig's alternative (and valid) data and see it not work quite so well ...It remains a problem for us here, which for the moment we are dealing with by hard-coding multiple recursion levels. But we have examples where the actual number of recursions needed to scrape all the details together is greater than what we have coded. So any further input is most welcome.ThanksPhilThu, 29 Nov 2012 01:56:02 GMTPhil ParkinRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspx[quote][b]thava (11/29/2012)[/b][hr]how about this one [/quote]It can't go backwards from 3 to get back to 1 because of the limitor to reduce duplication and endless recursion. It's similar to the issue above in the hierarchy model. You need to be able to go after either InvoiceID 3 or InvoiceID 1 and get the same result list.Thu, 29 Nov 2012 01:16:28 GMTEvil Kraig FRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspxhow about this one [code]SET @InvoiceID = 1;WITH rCTE AS( SELECT InvoiceID, BookingID, 1 AS HierarchyLevel FROM #IDs WHERE InvoiceID = @InvoiceID UNION ALLSELECT IDs.InvoiceID, ids2.BookingID, rCTE.HierarchyLevel + 1 AS HierarchyLevel FROM rCTE JOIN #IDs ids ON IDs.BookingID = rCTE.BookingID AND ids.InvoiceId <> rcte.InvoiceID INNER JOIN #IDs ids2 ON ids2.InvoiceId = ids.InvoiceID WHERE rCTE.InvoiceID<ids2.InvoiceId)select * from Rcte[/code]Thu, 29 Nov 2012 00:12:29 GMTthavaRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspx[quote][b]Alan.B (11/28/2012)[/b][hr][quote][b]Evil Kraig F (11/28/2012)[/b][hr]This is NOT pretty, but it IS functional.[/quote]I am trying to understand why went with a loop vs a set-based approach. I posted a more set based method earlier that gets the same results notably faster. I am not trying to be confrontational, I'm just trying to understand your approach or what I did wrong.[/quote][strike]@Alan.b If i look at your method correctly it misses InvoiceID 3.[/strike]@Kraig your right about the issues with my method that you cant go both directions up the tree which i had forgotten about. (dont work with hierarchies much)EDIT: i sat to long to hit the post button so struck what was said before the post.Wed, 28 Nov 2012 15:27:27 GMTCapnHectorRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspx[quote][b]Evil Kraig F (11/28/2012)[/b][hr][quote][b]Alan.B (11/28/2012)[/b][hr][quote][b]Evil Kraig F (11/28/2012)[/b][hr]This is NOT pretty, but it IS functional.[/quote]I am trying to understand why went with a loop vs a set-based approach. I posted a more set based method earlier that gets the same results notably faster. I am not trying to be confrontational, I'm just trying to understand your approach or what I did wrong.[/quote]Whoops, my apologies Alan. I didn't realize you were code complete. This comment:[quote][b]Alan.B (11/28/2012)[/b][hr]This is a bit tricky and I am still working on this. Here's what I have thusfar...[/quote]Misled me to believe you were still working on your solution and I breezed over it before going back to trying to force the rCTE to work.However, you will miss recursive chains. For example, I've adjusted the inclusion set here:[code="sql"]INSERT #IDs VALUES (1,9), (1,10), (1,11), (2,11), (2,12), (3,12), (3,13), (4,14), (5,14)GO[/code]You'll notice that your code will no longer pick up Invoice 3 because You need to go from 1->2 via Booking 11, then 2->3 via Booking 12.[/quote]Ahhhh.... Now I see what I was doing wrong; I knew I was missing something. Thanks & nice work.Wed, 28 Nov 2012 15:20:06 GMTAlan.BRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspx[quote][b]Alan.B (11/28/2012)[/b][hr][quote][b]Evil Kraig F (11/28/2012)[/b][hr]This is NOT pretty, but it IS functional.[/quote]I am trying to understand why went with a loop vs a set-based approach. I posted a more set based method earlier that gets the same results notably faster. I am not trying to be confrontational, I'm just trying to understand your approach or what I did wrong.[/quote]Whoops, my apologies Alan. I didn't realize you were code complete. This comment:[quote][b]Alan.B (11/28/2012)[/b][hr]This is a bit tricky and I am still working on this. Here's what I have thusfar...[/quote]Misled me to believe you were still working on your solution and I breezed over it before going back to trying to force the rCTE to work.However, you will miss recursive chains. For example, I've adjusted the inclusion set here:[code="sql"]INSERT #IDs VALUES (1,9), (1,10), (1,11), (2,11), (2,12), (3,12), (3,13), (4,14), (5,14)GO[/code]You'll notice that your code will no longer pick up Invoice 3 because You need to go from 1->2 via Booking 11, then 2->3 via Booking 12.Wed, 28 Nov 2012 15:06:44 GMTEvil Kraig FRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspx[quote][b]Evil Kraig F (11/28/2012)[/b][hr]This is NOT pretty, but it IS functional.[/quote]I am trying to understand why went with a loop vs a set-based approach. I posted a more set based method earlier that gets the same results notably faster. I am not trying to be confrontational, I'm just trying to understand your approach or what I did wrong.Wed, 28 Nov 2012 15:00:19 GMTAlan.BRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspxThis is NOT pretty, but it IS functional.[code="sql"]--am trying to write a query against a table of invoices, returning all relevant rows for a particular InvoiceId. Heres some sample data:--Create temp table to hold the dummy dataif object_id('tempdb..#IDs') is not nulldrop table #IDsif object_id('tempdb..#TempStore') is not nulldrop table #TempStorecreate table #IDs (InvoiceId int not null,BookingId int not null) on [PRIMARY]goalter table #IDs add constraint PK_IDs primary key clustered ( InvoiceId ,BookingId ) with ( STATISTICS_NORECOMPUTE = off ,IGNORE_DUP_KEY = off ,ALLOW_ROW_LOCKS = on ,ALLOW_PAGE_LOCKS = on ) on [PRIMARY]goinsert #IDs ( InvoiceId, BookingId) select * from (values (1,9), (1,10), (1,11), (2,11), (3,11), (3,12), (3,13), (4,14), (5,14)) data(InvoiceId,BookingId)select * from #IDsDECLARE @InvoiceID INT, @Rowcount INTSELECT @InvoiceID = 1, @Rowcount = 1CREATE TABLE #TempStore (InvoiceID INT, BookingID INT)INSERT INTO #TempStoreSELECT InvoiceID, BookingIDFROM #IDsWHERE InvoiceID = @InvoiceID-- Set this here, might as well not hit the loop if no records to work from.SELECT @Rowcount = @@ROWCOUNTWHILE @Rowcount <> 0BEGIN INSERT INTO #TempStore SELECT ids2.InvoiceID, ids2.BookingID FROM #IDs JOIN (SELECT DISTINCT BookingID FROM #TempStore) AS drv ON #IDs.BookingID = drv.BookingID JOIN #IDs AS ids2 ON #IDs.InvoiceID = ids2.InvoiceID WHERE #IDs.InvoiceID NOT IN (SELECT DISTINCT InvoiceID FROM #TempStore) SET @Rowcount = @@ROWCOUNTENDSELECT * FROM #TempStore[/code]Wed, 28 Nov 2012 14:35:35 GMTEvil Kraig FRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspx[quote][b]capnhector (11/28/2012)[/b][hr]What i came up with was to turn it into an adjacency list hierarchy and then we can recourse through that. of course i could be completly off base here but here is the code to turn it into the adjacency list[/code][/quote]The only problem I have with that solution method is that you can't traverse in both directions. IE: Pulling Invoice 3 won't get you back to 1 (or vice versa) depending on the parenting.The biggest problem with this recursion is that it's self-joining. For those curious:[code="sql"]--am trying to write a query against a table of invoices, returning all relevant rows for a particular InvoiceId. Heres some sample data:--Create temp table to hold the dummy dataif object_id('tempdb..#IDs') is not nulldrop table #IDscreate table #IDs (InvoiceId int not null,BookingId int not null) on [PRIMARY]goalter table #IDs add constraint PK_IDs primary key clustered ( InvoiceId ,BookingId ) with ( STATISTICS_NORECOMPUTE = off ,IGNORE_DUP_KEY = off ,ALLOW_ROW_LOCKS = on ,ALLOW_PAGE_LOCKS = on ) on [PRIMARY]goinsert #IDs ( InvoiceId, BookingId) select * from (values (1,9), (1,10), (1,11), (2,11), (3,11), (3,12), (3,13), (4,14), (5,14)) data(InvoiceId,BookingId)select * from #IDsDECLARE @InvoiceID INTSET @InvoiceID = 1;WITH rCTE AS(SELECT InvoiceID, BookingID, 1 AS HierarchyLevelFROM #IDsWHERE InvoiceID = @InvoiceIDUNION ALL SELECT #IDs.InvoiceID, ids2.BookingID, rCTE.HierarchyLevel + 1 AS HierarchyLevel FROM rCTE JOIN #IDs ON #IDs.BookingID = rCTE.BookingID JOIN #IDs AS ids2 ON #IDs.InvoiceID = ids2.InvoiceIDWHERE rCTE.HierarchyLevel + 1 )SELECT * FROM rCTE[/code]I'm trying to work out a way to exclude previously included invoices from the detection list but you can't double-reference the CTE in the recursion, so NOT IN (SELECT) clauses and the like are out. I'm actually thinking this may need to be looped as a baseline and then worked on from there.Wed, 28 Nov 2012 14:27:39 GMTEvil Kraig FRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspxWhat i came up with was to turn it into an adjacency list hierarchy and then we can recourse through that. of course i could be completly off base here but here is the code to turn it into the adjacency list[code="sql"]CREATE TABLE #IDsParents (InvoiceId int not null,BookingId int not null,ParentInvoiceID INT)insert #IDsParents ( InvoiceId, BookingId) select * from (values (1,9), (1,10), (1,11), (2,11), (3,11), (3,12), (3,13), (4,14), (5,14)) data(InvoiceId,BookingId);WITH Parent AS(SELECT a.InvoiceId, b.InvoiceId AS Parent FROM #IDsParents a LEFT JOIN #IDsParents b ON a.BookingId = b.BookingId AND a.InvoiceId > b.InvoiceIdWHERE b.InvoiceId IS NOT NULL)UPDATE b SET ParentInvoiceID = a.Parent FROM Parent a RIGHT JOIN #IDsParents b ON a.InvoiceId = b.InvoiceIdSELECT * FROM #IDsParents[/code]Wed, 28 Nov 2012 14:15:55 GMTCapnHectorRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspxThis is a bit tricky and I am still working on this. Here's what I have thusfar...[code="sql"]--Create temp table to hold the dummy dataif object_id('tempdb..#IDs') is not null drop table #IDsCREATE TABLE #IDs ( InvoiceId int not null, BookingId int not null, primary key clustered (InvoiceId, BookingId));INSERT #IDs VALUES (1,9), (1,10), (1,11), (2,11), (3,11), (3,12), (3,13), (4,14), (5,14)GODECLARE @val int = 1;WITH x AS( SELECT i.InvoiceId, i.BookingId from ( SELECT InvoiceId, BookingId from #IDs WHERE InvoiceId = @val ) a JOIN #IDs i ON a.BookingId = i.BookingId)SELECT DISTINCT i.* FROM xRIGHT JOIN #IDs i ON x.InvoiceId = i.InvoiceIdWHERE x.InvoiceId IS NOT NULL[/code]Wed, 28 Nov 2012 14:11:40 GMTAlan.BRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspxCorrect.Wed, 28 Nov 2012 13:24:04 GMTPhil ParkinRE: Recursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspxIf there is a row (3,14) would all your sample data then be returned because of (4,14) and (5,14)? from your description i think that is correct. just trying to wrap my head around it.Wed, 28 Nov 2012 13:21:09 GMTCapnHectorRecursion with a Twisthttp://www.sqlservercentral.com/Forums/Topic1390030-392-1.aspxHi - can't seem to get my head around this one, so any assistance is welcome. I am trying to write a query against a table of invoices, returning all relevant rows for a particular InvoiceId. Here's some sample data:[code="sql"]--Create temp table to hold the dummy dataif object_id('tempdb..#IDs') is not nulldrop table #IDscreate table #IDs (InvoiceId int not null,BookingId int not null) on [PRIMARY]goalter table #IDs add constraint PK_IDs primary key clustered ( InvoiceId ,BookingId ) with ( STATISTICS_NORECOMPUTE = off ,IGNORE_DUP_KEY = off ,ALLOW_ROW_LOCKS = on ,ALLOW_PAGE_LOCKS = on ) on [PRIMARY]goinsert #IDs ( InvoiceId, BookingId) select * from (values (1,9), (1,10), (1,11), (2,11), (3,11), (3,12), (3,13), (4,14), (5,14)) data(InvoiceId,BookingId)select * from #IDs[/code]Now, imagine that we're interested in returning data for InvoiceId 1.What I would like to return is this:[code="sql"]SELECT *FROM (VALUES(1,9),(1,10),(1,11),(2,11),(3,11),(3,12),(3,13)) x([InvoiceId],[BookingId])[/code]The 'twist' should now be obvious: InvoiceId 1 has BookingIds which relate to other invoices, which in turn may have BookingIds which relate to other invoices. I want to return all related rows.Wed, 28 Nov 2012 11:54:50 GMTPhil Parkin
|
{
"url": "http://www.sqlservercentral.com/Forums/RssFeed392-1390030-0-2.aspx",
"source_domain": "www.sqlservercentral.com",
"snapshot_id": "crawl=CC-MAIN-2016-22",
"warc_metadata": {
"Content-Length": "39159",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:C74ULY7DDCWTBL7HLLVAQ4CLHITVCPBH",
"WARC-Concurrent-To": "<urn:uuid:c6221e7f-89c1-4a3a-aca4-cc6a388e43f7>",
"WARC-Date": "2016-05-29T04:32:31Z",
"WARC-IP-Address": "162.13.37.189",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:MCMWZ2HSL266RX5ZFKECOTAYPSBAP2IZ",
"WARC-Record-ID": "<urn:uuid:4159fe24-d2bf-4fd1-8509-7e9e5d2ea031>",
"WARC-Target-URI": "http://www.sqlservercentral.com/Forums/RssFeed392-1390030-0-2.aspx",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a062c0bd-8335-4fb8-9ada-d515e0db85a3>"
},
"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
],
"line_end_idx": [
33637
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 33637,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24022752046585083,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07696962356567383,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3912622630596161,
"rps_doc_frac_unique_words": 0.2350407987833023,
"rps_doc_mean_word_length": 5.778785228729248,
"rps_doc_num_sentences": 469,
"rps_doc_symbol_to_word_ratio": 0.018274230882525444,
"rps_doc_unigram_entropy": 5.94716215133667,
"rps_doc_word_count": 4412,
"rps_doc_frac_chars_dupe_10grams": 0.4096721112728119,
"rps_doc_frac_chars_dupe_5grams": 0.47313302755355835,
"rps_doc_frac_chars_dupe_6grams": 0.4488547146320343,
"rps_doc_frac_chars_dupe_7grams": 0.4300674498081207,
"rps_doc_frac_chars_dupe_8grams": 0.417947918176651,
"rps_doc_frac_chars_dupe_9grams": 0.41645747423171997,
"rps_doc_frac_chars_top_2gram": 0.008628799580037594,
"rps_doc_frac_chars_top_3gram": 0.01976780965924263,
"rps_doc_frac_chars_top_4gram": 0.009883900173008442,
"rps_doc_books_importance": -3211.639892578125,
"rps_doc_books_importance_length_correction": -3211.639892578125,
"rps_doc_openwebtext_importance": -1867.9207763671875,
"rps_doc_openwebtext_importance_length_correction": -1867.9207763671875,
"rps_doc_wikipedia_importance": -1580.560302734375,
"rps_doc_wikipedia_importance_length_correction": -1580.560302734375
},
"fasttext": {
"dclm": 0.1228826567530632,
"english": 0.8300504088401794,
"fineweb_edu_approx": 1.1118965148925781,
"eai_general_math": 0.4089178442955017,
"eai_open_web_math": 0.3650115728378296,
"eai_web_code": 0.7474616765975952
}
}
|
{
"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": "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": "1",
"label": "Leftover HTML"
}
},
"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": "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
|
8,921,467,548,457,717,000 |
如何实现拖拽上传、上传进度条，以及取消上传？
如何实现拖拽上传、上传进度条，以及取消上传？
本文已参与「掘力星计划」，赢取创作大礼包，挑战创作激励金。
文件上传是最常见的一种业务需求，上传功能可简单，可复杂，简单就是把文件传上去就行，复杂就是涉及大文件断点续传、控制并发等，不知道大家对上传都了解多少。今天要给大家分享的是上传需求中最为常见的一些场景，话不多说，开干：
拖拽上传
拖拽上传涉及到样式交互、文件信息获取，那么，我们首先了解一下拖拽相关的几个事件：
1. dragover - 被拖动的对象进入目标容器时触发
2. dragleave - 被拖动的对象离开目标容器时触发
3. drop - 被拖动的对象进入目标容器，释放鼠标键时触发
了解了这几个事件，再实现拖拽上传就相当容易了。先上效果图：
效果展示
image.png image.png 当被拖动的对象进入目标容器时，容器边框变红。当拖出目标容器，或者释放鼠标键时，容器边框置灰。当释放鼠标键时，获取拖动对象的文件信息。
代码实现
<template>
<div ref="drag" class="drag">
<div class="drag-icon-box">
<!-- 采用的是 element-ui 的图标 -->
<i class="el-icon-upload"></i>
</div>
<div class="drag-message">
<span class="drag-message-title">将文件拖动到此处，或</span>
<label for="file" class="drag-message-label">
<input
class="drag-message-input"
type="file"
id="file"
name="file"
@change="handleFileChange"
/>
<span class="drag-message-manual">点击上传</span>
</label>
</div>
</div>
</template>
<script>
export default {
data() {
return {
file: null
}
},
async mounted() {
// 给容器绑定相关的拖拽事件
this.bindEvents()
},
methods: {
bindEvents() {
const drag = this.$refs.drag
// 被拖动的对象进入目标容器
drag.addEventListener('dragover', e => {
e.preventDefault()
drag.style.borderColor = 'red'
})
// 被拖动的对象离开目标容器
drag.addEventListener('dragleave', e => {
e.preventDefault()
drag.style.borderColor = '#eee'
})
// 被拖动的对象进入目标容器，释放鼠标键
drag.addEventListener('drop', e => {
e.preventDefault()
drag.style.borderColor = '#eee'
const fileList = e.dataTransfer.files
this.file = fileList[0]
this.uploadFile()
})
},
async uploadFile() {
const form = new FormData()
form.append('name', 'file')
form.append('file', this.file)
const res = await axios.post('/upload', form)
},
handleFileChange(e) {
const file = e.target.files[0]
if (!file) return
this.file = file
this.uploadFile()
}
}
}
</script>
<style lang="scss" scoped>
.drag {
width: 660px;
height: 300px;
border: 2px dashed;
border-color: #a3a3a3;
border-radius: 5px;
margin: 0 auto;
display: flex;
flex-direction: column;
justify-content: center;
align-items: center;
flex-wrap: wrap;
.drag-icon-box {
width: 100%;
height: 60px;
text-align: center;
font-size: 50px;
line-height: 60px;
color: #606266;
}
.drag-message {
width: 100%;
height: 50px;
line-height: 50px;
text-align: center;
.drag-message-title {
font-size: 14px;
color: #606266;
}
.drag-message-label {
width: 120px;
height: 50px;
height: auto;
position: relative;
overflow: hidden;
.drag-message-input {
position: absolute;
left: -100px;
top: -100px;
z-index: -1;
display: none;
}
.drag-message-manual {
font-size: 14px;
color: #4b87ff;
cursor: pointer;
}
}
}
}
</style>
复制代码
上传进度条
进度条可以说是最普遍的一种需求，特别是大文件上传的时候。实现方法也比较简单，利用 axios 的 onUploadProgress 方法就可以了。
效果展示
image.png
代码实现
<div>
<!-- 采用的是 element-ui 的进度条组件 -->
<el-progress
:stroke-width="20"
:text-inside="true"
:percentage="uploadProgress"
></el-progress>
</div>
<script>
export default {
data() {
return {
file: null,
uploadProgress: 0
}
},
methods: {
async uploadFile() {
const form = new FormData()
form.append('name', 'file')
form.append('file', this.file)
const res = await axios.post('/uploadfile', form, {
onUploadProgress: progress => {
this.uploadProgress = Number(
((progress.loaded / progress.total) * 100).toFixed(2)
)
}
})
},
handleFileChange(e) {
const file = e.target.files[0]
if (!file) return
this.file = file
this.uploadFile()
}
}
}
</script>
复制代码
取消上传
当上传很慢等的捉急时，或者手一抖，上传了一个不该上传的视频（你懂的），在上传未完成的情况下，能否进行取消呢？答案当然是可以的。
效果展示
image.png 其实取消上传就是取消 ajax 请求，可以利用 axioscancel token 进行取消。
方法一：使用 CancelToken.source 工厂方法创建 cancel token
const CancelToken = axios.CancelToken;
const source = CancelToken.source();
axios.post('/upload', form, {
cancelToken: source.token
})
source.cancel();
复制代码
方法二：通过传递一个 executor 函数到 CancelToken 的构造函数来创建 cancel token
const CancelToken = axios.CancelToken;
let cancel;
axios.post('/upload', form, {
cancelToken: new CancelToken(function executor(c) {
cancel = c;
})
});
cancel();
复制代码
有兴趣的同学可以试一试，将以上方法融入到自己的项目中。
总结
ok，以上就是上传需求中最常见的一些场景，无论是拖拽上传还是粘贴上传，最主要的是通过相应的事件拿到文件信息。而进度条和取消上传则是利用 axiosapi 进行实现，axios 还有众多实用的配置选项，大家可以自己研究一哈。
欢迎在评论区留言，掘金官方将在掘力星计划活动结束后，在评论区抽送100份掘金周边。如果文章对你有所帮助，不要忘了点个赞呦~
听说喜欢点赞的人运气都不差，相信今年的你一定逢考必过，逢奖必中😘
分类：
前端
|
{
"url": "https://juejin.cn/post/7024657484409208863",
"source_domain": "juejin.cn",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "442893",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3H4VF2GEKQI3VV6JW6RPLP5YLHMRUAHS",
"WARC-Concurrent-To": "<urn:uuid:5af9bb50-9d8f-4291-a3ca-e06d7f2f5350>",
"WARC-Date": "2023-03-27T00:12:51Z",
"WARC-IP-Address": "163.181.66.233",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OYEUUKSEL2WOXVP2KMJKFNCVSACIRLPM",
"WARC-Record-ID": "<urn:uuid:2a196ff4-12ac-45b8-ada5-36de21701811>",
"WARC-Target-URI": "https://juejin.cn/post/7024657484409208863",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:620f36f7-5b61-4c26-af41-ad79e9a8a0b2>"
},
"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-126\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,
23,
24,
47,
48,
78,
79,
188,
189,
194,
195,
236,
237,
269,
302,
336,
337,
367,
368,
373,
374,
461,
462,
467,
468,
479,
511,
543,
578,
616,
627,
658,
715,
767,
782,
819,
841,
861,
883,
920,
931,
985,
1000,
1011,
1020,
1032,
1033,
1042,
1059,
1070,
1083,
1100,
1106,
1111,
1131,
1151,
1173,
1178,
1191,
1210,
1245,
1267,
1314,
1341,
1380,
1389,
1411,
1459,
1486,
1526,
1535,
1563,
1606,
1633,
1673,
1719,
1751,
1777,
1786,
1793,
1818,
1852,
1886,
1923,
1975,
1982,
2008,
2045,
2069,
2092,
2116,
2122,
2126,
2128,
2138,
2139,
2166,
2174,
2190,
2207,
2229,
2254,
2276,
2294,
2311,
2337,
2364,
2387,
2406,
2425,
2442,
2460,
2484,
2505,
2528,
2548,
2552,
2570,
2587,
2605,
2628,
2652,
2678,
2701,
2723,
2729,
2755,
2775,
2795,
2815,
2841,
2865,
2893,
2921,
2943,
2964,
2985,
3008,
3016,
3045,
3070,
3094,
3119,
3127,
3133,
3137,
3139,
3148,
3153,
3154,
3160,
3161,
3235,
3236,
3241,
3242,
3252,
3253,
3258,
3259,
3265,
3299,
3314,
3337,
3361,
3394,
3412,
3419,
3420,
3429,
3446,
3457,
3470,
3488,
3512,
3518,
3523,
3536,
3561,
3595,
3629,
3666,
3724,
3764,
3804,
3870,
3882,
3892,
3901,
3908,
3934,
3971,
3995,
4018,
4042,
4048,
4052,
4054,
4064,
4069,
4070,
4075,
4076,
4140,
4141,
4146,
4147,
4205,
4206,
4252,
4253,
4292,
4329,
4330,
4360,
4388,
4391,
4392,
4409,
4414,
4415,
4473,
4474,
4513,
4525,
4526,
4556,
4610,
4626,
4631,
4635,
4636,
4646,
4651,
4652,
4680,
4681,
4684,
4685,
4797,
4798,
4860,
4861,
4894,
4895,
4899
],
"line_end_idx": [
23,
24,
47,
48,
78,
79,
188,
189,
194,
195,
236,
237,
269,
302,
336,
337,
367,
368,
373,
374,
461,
462,
467,
468,
479,
511,
543,
578,
616,
627,
658,
715,
767,
782,
819,
841,
861,
883,
920,
931,
985,
1000,
1011,
1020,
1032,
1033,
1042,
1059,
1070,
1083,
1100,
1106,
1111,
1131,
1151,
1173,
1178,
1191,
1210,
1245,
1267,
1314,
1341,
1380,
1389,
1411,
1459,
1486,
1526,
1535,
1563,
1606,
1633,
1673,
1719,
1751,
1777,
1786,
1793,
1818,
1852,
1886,
1923,
1975,
1982,
2008,
2045,
2069,
2092,
2116,
2122,
2126,
2128,
2138,
2139,
2166,
2174,
2190,
2207,
2229,
2254,
2276,
2294,
2311,
2337,
2364,
2387,
2406,
2425,
2442,
2460,
2484,
2505,
2528,
2548,
2552,
2570,
2587,
2605,
2628,
2652,
2678,
2701,
2723,
2729,
2755,
2775,
2795,
2815,
2841,
2865,
2893,
2921,
2943,
2964,
2985,
3008,
3016,
3045,
3070,
3094,
3119,
3127,
3133,
3137,
3139,
3148,
3153,
3154,
3160,
3161,
3235,
3236,
3241,
3242,
3252,
3253,
3258,
3259,
3265,
3299,
3314,
3337,
3361,
3394,
3412,
3419,
3420,
3429,
3446,
3457,
3470,
3488,
3512,
3518,
3523,
3536,
3561,
3595,
3629,
3666,
3724,
3764,
3804,
3870,
3882,
3892,
3901,
3908,
3934,
3971,
3995,
4018,
4042,
4048,
4052,
4054,
4064,
4069,
4070,
4075,
4076,
4140,
4141,
4146,
4147,
4205,
4206,
4252,
4253,
4292,
4329,
4330,
4360,
4388,
4391,
4392,
4409,
4414,
4415,
4473,
4474,
4513,
4525,
4526,
4556,
4610,
4626,
4631,
4635,
4636,
4646,
4651,
4652,
4680,
4681,
4684,
4685,
4797,
4798,
4860,
4861,
4894,
4895,
4899,
4901
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4901,
"ccnet_original_nlines": 245,
"rps_doc_curly_bracket": 0.011834319680929184,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.03739213943481445,
"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.6203259825706482,
"rps_doc_frac_unique_words": 0.6012269854545593,
"rps_doc_mean_word_length": 9.496932983398438,
"rps_doc_num_sentences": 66,
"rps_doc_symbol_to_word_ratio": 0.0057526398450136185,
"rps_doc_unigram_entropy": 5.0522356033325195,
"rps_doc_word_count": 326,
"rps_doc_frac_chars_dupe_10grams": 0.11046511679887772,
"rps_doc_frac_chars_dupe_5grams": 0.1621447056531906,
"rps_doc_frac_chars_dupe_6grams": 0.1343669295310974,
"rps_doc_frac_chars_dupe_7grams": 0.1343669295310974,
"rps_doc_frac_chars_dupe_8grams": 0.11046511679887772,
"rps_doc_frac_chars_dupe_9grams": 0.11046511679887772,
"rps_doc_frac_chars_top_2gram": 0.01162790972739458,
"rps_doc_frac_chars_top_3gram": 0.03488371893763542,
"rps_doc_frac_chars_top_4gram": 0.014857879839837551,
"rps_doc_books_importance": -467.48114013671875,
"rps_doc_books_importance_length_correction": -467.48114013671875,
"rps_doc_openwebtext_importance": -297.51007080078125,
"rps_doc_openwebtext_importance_length_correction": -297.51007080078125,
"rps_doc_wikipedia_importance": -270.48455810546875,
"rps_doc_wikipedia_importance_length_correction": -270.48455810546875
},
"fasttext": {
"dclm": 0.9996830224990845,
"english": 0.06411205977201462,
"fineweb_edu_approx": 3.3277804851531982,
"eai_general_math": 0.13857316970825195,
"eai_open_web_math": 0.026342149823904037,
"eai_web_code": 0.906772255897522
}
}
|
{
"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": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,313,019,651,825,503,000 |
4 Replies Latest reply: Jul 17, 2012 6:42 AM by Rui Albuquerque RSS
RichFaces no graphical ui
Rui Albuquerque Newbie
Hi.
So, after: https://community.jboss.org/thread/202334 i followed the guide on the last answer, on how to create a nonmavem project: https://community.jboss.org/wiki/HowToAddRichFaces4xToProjectsNotBasedOnMaven. I added all the dependencies and ran the app on the server (jboss as7).
The app was a simple PanelMenu. The thing is, the only thing that appeared in the browser was a list of the names of the groups and items.
like this:
Group1
Item1
Item2
Group2
Item1
Group3
.
.
.
And so on. And none of the items or groups are clickable, their just text.
Anyone know's what might be my problem?
Thanks in advance
Rui
|
{
"url": "https://community.jboss.org/message/748409",
"source_domain": "community.jboss.org",
"snapshot_id": "crawl=CC-MAIN-2015-27",
"warc_metadata": {
"Content-Length": "95465",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:W52CQ3XX3VQHRLDCQI7ZICHQUPQGDF4P",
"WARC-Concurrent-To": "<urn:uuid:8bfe815c-dafd-4b7f-9908-ca4c72288cea>",
"WARC-Date": "2015-07-05T19:26:42Z",
"WARC-IP-Address": "209.132.182.76",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:54U3L6ELD6NNAEZADJQCGPPMCQ2Q36LT",
"WARC-Record-ID": "<urn:uuid:4b7f7f41-ece4-4d71-8621-1ac8cc444920>",
"WARC-Target-URI": "https://community.jboss.org/message/748409",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:be89784e-2e39-4e85-9f43-90eedf375d23>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-179-60-89.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-27\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for June 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
72,
73,
103,
104,
131,
132,
142,
143,
151,
152,
440,
441,
449,
450,
595,
596,
604,
605,
622,
623,
631,
632,
645,
646,
658,
659,
671,
672,
685,
686,
698,
699,
712,
713,
721,
722,
730,
731,
739,
740,
823,
824,
832,
833,
879,
880,
888,
889,
913,
914
],
"line_end_idx": [
72,
73,
103,
104,
131,
132,
142,
143,
151,
152,
440,
441,
449,
450,
595,
596,
604,
605,
622,
623,
631,
632,
645,
646,
658,
659,
671,
672,
685,
686,
698,
699,
712,
713,
721,
722,
730,
731,
739,
740,
823,
824,
832,
833,
879,
880,
888,
889,
913,
914,
923
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 923,
"ccnet_original_nlines": 50,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3229813575744629,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018633540719747543,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24223601818084717,
"rps_doc_frac_unique_words": 0.7155172228813171,
"rps_doc_mean_word_length": 4.982758522033691,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.196178913116455,
"rps_doc_word_count": 116,
"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.025951560586690903,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -50.97590255737305,
"rps_doc_books_importance_length_correction": -50.97590255737305,
"rps_doc_openwebtext_importance": -39.21094512939453,
"rps_doc_openwebtext_importance_length_correction": -27.920299530029297,
"rps_doc_wikipedia_importance": -28.669540405273438,
"rps_doc_wikipedia_importance_length_correction": -28.669540405273438
},
"fasttext": {
"dclm": 0.019037779420614243,
"english": 0.7946807146072388,
"fineweb_edu_approx": 1.5531435012817383,
"eai_general_math": 0.0013346699997782707,
"eai_open_web_math": 0.14173030853271484,
"eai_web_code": 0.0008589599747210741
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.452",
"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": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,567,003,137,167,318,000 |
Adding Particle Libraries - Lumberyard User Guide
Adding Particle Libraries
Particle effect data is stored in an XML-based library file.
To add a particle library
1. In the Particle Editor, do one of the following:
• Choose Create new library.
• Choose File, Add library.
• Choose the drop-down arrow in the Libraries panel, and choose Add library.
• Choose the Particle Editor library icon to the right of the search bar.
Create libraries in the
Particle Editor.
2. In Libraries, where the default name is highlighted, enter a name for the library.
3. Choose Add Particle or Add Folder and then enter a name for the new particle or folder.
|
{
"url": "https://docs.aws.amazon.com/lumberyard/latest/userguide/particle-creating-library.html",
"source_domain": "docs.aws.amazon.com",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "15619",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AWSJCTNPO7TWOYUN72G6ZNXEF4WFEQVX",
"WARC-Concurrent-To": "<urn:uuid:030184fe-cd08-413a-b650-58194c167d34>",
"WARC-Date": "2021-12-08T05:06:54Z",
"WARC-IP-Address": "176.32.98.189",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:WVKNGKFYGXJKJR4PACFXOFB3K2ZFWCNC",
"WARC-Record-ID": "<urn:uuid:d34b65a0-093e-49f5-a7d4-dec35c8df143>",
"WARC-Target-URI": "https://docs.aws.amazon.com/lumberyard/latest/userguide/particle-creating-library.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:43ee10e1-c4f8-49ae-b554-25445f116eab>"
},
"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,
50,
51,
77,
78,
139,
140,
166,
167,
221,
222,
255,
256,
288,
289,
370,
371,
449,
450,
458,
459,
464,
512,
557,
645,
646
],
"line_end_idx": [
50,
51,
77,
78,
139,
140,
166,
167,
221,
222,
255,
256,
288,
289,
370,
371,
449,
450,
458,
459,
464,
512,
557,
645,
646,
738
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 738,
"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.31060606241226196,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007575760129839182,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20454545319080353,
"rps_doc_frac_unique_words": 0.4363636374473572,
"rps_doc_mean_word_length": 4.636363506317139,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.548356771469116,
"rps_doc_word_count": 110,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1411764770746231,
"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.054901961237192154,
"rps_doc_frac_chars_top_3gram": 0.10000000149011612,
"rps_doc_frac_chars_top_4gram": 0.07450979948043823,
"rps_doc_books_importance": -44.32820510864258,
"rps_doc_books_importance_length_correction": -44.3291015625,
"rps_doc_openwebtext_importance": -24.921918869018555,
"rps_doc_openwebtext_importance_length_correction": -24.922813415527344,
"rps_doc_wikipedia_importance": -20.411041259765625,
"rps_doc_wikipedia_importance_length_correction": -20.411935806274414
},
"fasttext": {
"dclm": 0.9553844332695007,
"english": 0.7413554787635803,
"fineweb_edu_approx": 2.2230567932128906,
"eai_general_math": 0.054562270641326904,
"eai_open_web_math": 0.415794312953949,
"eai_web_code": 0.0038920599035918713
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
654,297,838,770,206,000 |
emacs-devel
[Top][All Lists]
Advanced
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Bad moves with xref-find-definitions
From: Dmitry Gutov
Subject: Re: Bad moves with xref-find-definitions
Date: Sun, 26 Apr 2015 18:20:13 +0300
User-agent: Mozilla/5.0 (X11; Linux x86_64; rv:36.0) Gecko/20100101 Thunderbird/36.0
On 04/26/2015 02:31 PM, Vitalie Spinu wrote:
What do you currently do if there are multiple matching definitions of
the "thing-at-point"? Prompt?
Show them all in the xref buffer. But if the backend is smart enough, it will include the disambiguating context information as text properties on the "thing-at-point" string.
That kind of string (probably) can't be present in the completion table, though.
All I was trying to say is that tags are commonly useful alongside
dynamic backends. Blindly replacing tags with an even very good backend
is not the right direction IMW. Expecting from end users to solve this
problem with add-function :before is unacceptable if there are way to
fix it at Emacs level.
It doesn't have to come down to users. Completion packages could take care of it as well.
As to prompting, if you try to accommodate multiple backends, then
merging completion candidates from multiple backends is a simple task
when you prompt.
Not if you want to avoid duplicates. Currently, file opening and nagivation to the exact positions is being done lazily (which improves overall performance quite a bit). So you can simply call `delete-dups' on the xref elements when they come from different backends.
If you try instead to "bypass the minibuffer" it's
likely to be a much more difficult task.
How does it make any difference?
reply via email to
[Prev in Thread] Current Thread [Next in Thread]
|
{
"url": "https://lists.gnu.org/archive/html/emacs-devel/2015-04/msg01227.html",
"source_domain": "lists.gnu.org",
"snapshot_id": "crawl=CC-MAIN-2020-40",
"warc_metadata": {
"Content-Length": "9864",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GWE4Z5X3SCRLVB2VRZ6RS3OTI4MEWPLG",
"WARC-Concurrent-To": "<urn:uuid:29621b58-fb61-4317-87bb-6b2bdd246b92>",
"WARC-Date": "2020-09-29T07:22:02Z",
"WARC-IP-Address": "209.51.188.17",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2KKRDNHY7K56SMCVKQ5VFHIDPSW6XBOL",
"WARC-Record-ID": "<urn:uuid:686ea889-7000-454a-9013-4f4df130e006>",
"WARC-Target-URI": "https://lists.gnu.org/archive/html/emacs-devel/2015-04/msg01227.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a6accb50-c205-469f-a590-21c5d5f65f39>"
},
"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-150.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,
12,
29,
38,
39,
114,
115,
156,
157,
158,
177,
227,
265,
350,
351,
396,
397,
468,
498,
499,
675,
676,
757,
758,
825,
897,
968,
1038,
1061,
1062,
1152,
1153,
1220,
1290,
1307,
1308,
1576,
1577,
1628,
1669,
1670,
1703,
1704,
1705,
1706,
1725,
1726
],
"line_end_idx": [
12,
29,
38,
39,
114,
115,
156,
157,
158,
177,
227,
265,
350,
351,
396,
397,
468,
498,
499,
675,
676,
757,
758,
825,
897,
968,
1038,
1061,
1062,
1152,
1153,
1220,
1290,
1307,
1308,
1576,
1577,
1628,
1669,
1670,
1703,
1704,
1705,
1706,
1725,
1726,
1774
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1774,
"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.3291139304637909,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01012657955288887,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26582276821136475,
"rps_doc_frac_unique_words": 0.6727272868156433,
"rps_doc_mean_word_length": 5.039999961853027,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.985586643218994,
"rps_doc_word_count": 275,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0476190485060215,
"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.010822510346770287,
"rps_doc_frac_chars_top_3gram": 0.014430009759962559,
"rps_doc_frac_chars_top_4gram": 0.020202020183205605,
"rps_doc_books_importance": -186.94287109375,
"rps_doc_books_importance_length_correction": -179.84881591796875,
"rps_doc_openwebtext_importance": -113.07103729248047,
"rps_doc_openwebtext_importance_length_correction": -113.07103729248047,
"rps_doc_wikipedia_importance": -89.48089599609375,
"rps_doc_wikipedia_importance_length_correction": -87.24674224853516
},
"fasttext": {
"dclm": 0.28973060846328735,
"english": 0.9125639796257019,
"fineweb_edu_approx": 1.3338490724563599,
"eai_general_math": 0.31622153520584106,
"eai_open_web_math": 0.3354499936103821,
"eai_web_code": 0.0022093700245022774
}
}
|
{
"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": "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": "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": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,757,703,821,490,860,000 |
Is the order of iterating through std::map known (and guaranteed by the standard)?
What I mean is – we know that the std::map‘s elements are sorted according to the keys. So, let’s say the keys are integers. If I iterate from std::map::begin() to std::map::end() using a for, does the standard guarantee that I’ll iterate consequently through the elements with keys, sorted in ascending order? Example: std::map<int, int> map_; … Read more
How is the default submit button on an HTML form determined?
If a form is submitted but not by any specific button, such as by pressing Enter using HTMLFormElement.submit() in JS how is a browser supposed to determine which of multiple submit buttons, if any, to use as the one pressed? This is significant on two levels: calling an onclick event handler attached to a submit … Read more
Are iframes considered ‘bad practice’? [closed]
Closed. This question is opinion-based. It is not currently accepting answers. Want to improve this question? Update the question so it can be answered with facts and citations by editing this post. Closed 8 years ago. Improve this question Somewhere along the line I picked up the notion that using iframes is ‘bad practice’. Is … Read more
|
{
"url": "https://itnursery.com/tag/standards/",
"source_domain": "itnursery.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "117658",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FJTWN5752RUDOJMVVQJCVMV474LK6UGQ",
"WARC-Concurrent-To": "<urn:uuid:964013ef-100c-442a-88b6-fa5d4ed03b73>",
"WARC-Date": "2024-05-21T23:05:27Z",
"WARC-IP-Address": "172.67.214.249",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:APLRYXUP3ZQSMEMMCOYAENBS7VGF5PCJ",
"WARC-Record-ID": "<urn:uuid:e2158abc-3367-4c82-a3ad-f27a11d0564e>",
"WARC-Target-URI": "https://itnursery.com/tag/standards/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f3855fdd-3529-43b6-9104-d4bec86fc2ab>"
},
"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-96\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,
83,
84,
441,
442,
503,
504,
831,
832,
880,
881
],
"line_end_idx": [
83,
84,
441,
442,
503,
504,
831,
832,
880,
881,
1222
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1222,
"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.3650190234184265,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022813690826296806,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19391635060310364,
"rps_doc_frac_unique_words": 0.5882353186607361,
"rps_doc_mean_word_length": 4.710784435272217,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0.011406839825212955,
"rps_doc_unigram_entropy": 4.544574737548828,
"rps_doc_word_count": 204,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.015608740039169788,
"rps_doc_frac_chars_top_3gram": 0.028095729649066925,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -107.24225616455078,
"rps_doc_books_importance_length_correction": -107.24225616455078,
"rps_doc_openwebtext_importance": -69.31340026855469,
"rps_doc_openwebtext_importance_length_correction": -69.31334686279297,
"rps_doc_wikipedia_importance": -45.660213470458984,
"rps_doc_wikipedia_importance_length_correction": -45.660213470458984
},
"fasttext": {
"dclm": 0.3629939556121826,
"english": 0.9242966175079346,
"fineweb_edu_approx": 2.184717893600464,
"eai_general_math": 0.8940624594688416,
"eai_open_web_math": 0.16788440942764282,
"eai_web_code": 0.46783483028411865
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.7",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "1",
"label": "Truncated Snippets"
},
"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
|
1,821,704,007,816,123,400 |
Contenu | Rechercher | Menus
Annonce
Si vous rencontrez des soucis à rester connecté sur le forum (ou si vous avez perdu votre mot de passe) déconnectez-vous et reconnectez-vous depuis cette page, en cochant la case "Me connecter automatiquement lors de mes prochaines visites".
#76 Le 28/02/2009, à 19:57
wxpwgkwct
Re : [résolu] Intallation Ubuntu 7.10 sur HP m8079.fr tatoué + Vista
QKVJ2G <a href="http://htncdenhsojx.com/">htncdenhsojx</a>, ihdochgnqkrg, [link=http://jfetgsalooqf.com/]jfetgsalooqf[/link], http://bjfjyxqnrcwz.com/
#77 Le 28/02/2009, à 21:27
andso
Re : [résolu] Intallation Ubuntu 7.10 sur HP m8079.fr tatoué + Vista
wxpwgkwct
ça t' apporte quoi?
IMPORTANT: Booster votre (X)ubuntu:
http://forum.ubuntu-fr.org/viewtopic.php?id=241092 (pfou!...)
à essayer
et... demain debian? http://fr.wikipedia.org/wiki/Demain_les_chiens
Hors ligne
#78 Le 24/04/2009, à 22:35
Edmund
Re : [résolu] Intallation Ubuntu 7.10 sur HP m8079.fr tatoué + Vista
Si quelqu'un voulait abuser de la gentillesse de Canigou, il lui demanderait: "ça serait pas possible de mettre à jour le tuto avec la dernière version disponible d'Ubuntu?".:rolleyes:
HP Pavillon Slimline s3828fr - AMD A64X2 5000+
Hors ligne
#79 Le 19/05/2009, à 14:43
ubuubu1
Re : [résolu] Intallation Ubuntu 7.10 sur HP m8079.fr tatoué + Vista
Merci pour tes explications extrêmement claires pour ce dual boot vista ubuntu !
Je suis passé sur Ubuntu déjà depuis 3 ans et ne le regrette pas. Aucun problème pour l'installer avec Windows XP, mais je vais devoir le faire sur l'ordi de mon épouse qui a été vendu avec Vista !!! Donc ton tutoriel me sera précieux.
Encore merci et toutes mes félicitations pour ta contribution.
#80 Le 27/05/2009, à 12:50
steffle
Re : [résolu] Intallation Ubuntu 7.10 sur HP m8079.fr tatoué + Vista
juste une question pratique.
parce avec le partitionneur windows on peut pas trop faire ce qu'on veut..
moi je voulais deux partition petites pour les système d'exploitation et une grosse pour les données, mais ca c'est pas faisable.. alors la question est comment je gere les données..
en gros est ce que si j'ai par exemple deux partition de 100gigas, une pour windows vista et une pour ubuntu, mes données seront accessible sur les deux partition quelque soit le système d'exploitation que j'utilise..
en fait je vais quasiment toujours utiliser ubuntu dc je serais peu etre amené à stocker des données sur la partition vista..
merci pour vos réponse et merci pour ce tuto tres tres clair!
steffle
Hors ligne
#81 Le 28/05/2009, à 17:11
andso
Re : [résolu] Intallation Ubuntu 7.10 sur HP m8079.fr tatoué + Vista
bonjour,
ubuubu1
http://forum.ubuntu-fr.org/viewtopic.php?id=277078&p=31
steffle
A condition de bien défrag vista, en utilisant gparted tu as + de souplesse;
pour les données communes, une partition fat32 (ou ntfs), car win ne lit pas le ext3 (ou 4, ou 2),
mais gnux lira/écrira des données win
IMPORTANT: Booster votre (X)ubuntu:
http://forum.ubuntu-fr.org/viewtopic.php?id=241092 (pfou!...)
à essayer
et... demain debian? http://fr.wikipedia.org/wiki/Demain_les_chiens
Hors ligne
#82 Le 09/09/2009, à 09:02
kaunis
Re : [résolu] Intallation Ubuntu 7.10 sur HP m8079.fr tatoué + Vista
@canigou66
Bonjour et tout d'abord bravo pour ta procédure d'installation d'Ubuntu.
Une question de novice me travaille !
Avant l'installation d'Ubuntu les partitions étaient :
----------------------------
Le menu GParted/Devices me permet de sélectionner mon disque "/dev/sda" qui me donne :
Partition : Non alloué Système : rien Taille : 1 Mio Marqueurs :
Partition : /dev/sda1 Système : ntfs Taille : 291.89 Gio Marqueurs : boot
Partition : /dev/sda2 Système : ntfs Taille : 6,20 Gi Marqueurs :
-----------------------------
Après cela donne :
-----------------------------
Partition : non alloué, Système de fichiers : rien, Taille : 1Mio, marqueurs : rien
Partition : sda1, Système de fichiers : ntfs, Taille : 199.42Gio, marqueurs : boot
Partition : non alloué, Système de fichiers : rien, Taille : 2,20Mio, marqueurs : rien
Partition : sda3, Système de fichiers : ext3, Taille : 8,00Gio, marqueurs : rien
Partition : sda4, Système de fichiers : extended, Taille : 84,47Gio, marqueurs : rien
Partition : sda5, Système de fichiers : ext3, Taille : 3,00Gio, marqueurs : rien
Partition : sda6, Système de fichiers : linux-swap, Taille : 1,00Gio, marqueurs : rien
Partition : sda7, Système de fichiers : ntfs, Taille : 10,00Gio, marqueurs : rien
Partition : non alloué, Système de fichiers : rien, Taille : 70,47Gio, marqueurs : rien
Partition : sda2, Système de fichiers : ntfs, Taille : 6,20Gio, marqueurs : rien
-----------------------------
Pourquoi conserver une partition non allouée de 70 Go ? Sinon comment sont-ils utilisés ?
Merci pour tes informations.
Kaunis
Hors ligne
#83 Le 18/09/2009, à 17:07
Canigou 66
Re : [résolu] Intallation Ubuntu 7.10 sur HP m8079.fr tatoué + Vista
Bonjour kaunis,
Avec mes excuses pour cette réponse tardive.
Pourquoi conserver une partition non allouée de 70 Go ? Sinon comment sont-ils utilisés ?
Je suis très satisfait de ce choix ; je m'explique :
J'ai découpé cet espace en :
- 3 partitions /, /home et swap, pour la dernière version de Ubuntu (actuellement la 9.04)
- 1 partition ext3 qui me permet de faire des sauvegardes de partitions
Sur Ubuntu 9.04 je sauvegarde avec le logiciel Partimage mon système Ubuntu 8.04 LTS en quelques minutes, et la restauration de la partition est encore plus rapide.
Pour conclure :
- Ubuntu 8.04 LTS mon système de travail
- Ubuntu 9.04 et bientôt 9.10 dès que la Béta sortira (1er octobre 2009) pour voir les nouveautés et tester sans risque toutes sortes de programmes dans un environnement d'essai.
Je ne peux que t'encourager à suivre mon choix pour la sécurité de ton système de travail, et d'un autre côté la découverte des dernières nouveautés d'Ubuntu sans risque.
Mon arrivée chez vous :
http://forum.ubuntu-fr.org/viewtopic.php?id=194103
Ma première documentation réalisée pour vous : http://doc.ubuntu-fr.org/clonezilla
Ce logiciel, qui sauvegarde vos partitions, est une merveille, je vous explique tout...
Hors ligne
#84 Le 07/05/2010, à 08:31
jazzyphilou
Re : [résolu] Intallation Ubuntu 7.10 sur HP m8079.fr tatoué + Vista
Bonjour à tous
Tout d'abord un grand merci à Canigou 66 pour ce super tuto
Ca serait super si je n'avais pas un souci que je vous expose
Tout va bien jusqu'au redemarrage apres l'instal (fin de l'etape 11)
"Le micro redémarre avec Vista, mais cela est tout à fait normal puisque je n'ai pas touché au MBR."
moi j'ai directement grub avec tout les choix mais impossible de lancer vista
alors qu'ubuntu se lance sans souci
Je faits un coller de fdisk si ca peut aider à trouver ou j'ai fait une erreur
jazzyphilou@jazzy-buntu:~$ sudo fdisk -l
Disque /dev/sda: 320.1 Go, 320072933376 octets
255 têtes, 63 secteurs/piste, 38913 cylindres
Unités = cylindres de 16065 * 512 = 8225280 octets
Identifiant de disque : 0x97646c29
Périphérique Amorce Début Fin Blocs Id Système
/dev/sda1 1 1530 12289693+ 1c Cachée W95 FAT32 (LBA) // Partition recovery
/dev/sda2 * 1531 13338 94844924 7 HPFS/NTFS // Vista home premium oem (pas de dvd pour reinstal)
/dev/sda3 13339 15966 21109410 83 Linux // Ubuntu 9.10
/dev/sda4 15967 38913 184321777+ 5 Etendue
/dev/sda5 15967 17241 10241406 83 Linux // Dossier /home
/dev/sda6 17242 17878 5116671 82 Linux swap / Solaris
/dev/sda7 17879 38913 168963606 7 HPFS/NTFS // espace en commun linux windows
jazzyphilou@jazzy-buntu:~$
J'ai un asus n90sv/intel core2 duo P8400 2.26ghz/4gb memoire/vista premium 32bits/nviia gforce gt 130m/
Merci d'avance pour votre aide car là ca fait 3 jours que je galere
Jazzyphilou
Hors ligne
#85 Le 07/05/2010, à 08:49
malbo
Re : [résolu] Intallation Ubuntu 7.10 sur HP m8079.fr tatoué + Vista
jazzyphilou,
Je te suggère de créer une nouvelle discussion pour ton problème, mais pas dans la présente section "Questions et informations avant l'installation" mais dans la section "Installation d'Ubuntu" puisque tu as un Pb d'installation. Dans le premier post de cette nouvelle discussion, si tu pouvais coller le résultat de bootinfoscript , on aurait un panoramique complet de ton install pour mieux te conseiller :
http://forum.ubuntu-fr.org/viewtopic.php?pid=3226641#p3226641
Remarque : pas la peine de recoller tout ton baratin, tu as juste à dire au début du post futur que tu as fait un post précédent ici :
http://forum.ubuntu-fr.org/viewtopic.php?pid=3457434#p3457434
Dernière modification par malbo (Le 07/05/2010, à 08:52)
MedionPC MT5 MED MT 162 / pentium IV / RAM 1Go / Radeon HD 3450 AGP / XP et Ubuntu 13.04
Acer Aspire M5100-5F7N / Phenom Quad Core 9500 / ATI HD 2600 pro / RAM 4 Go / Win8, XP et Ubuntu 13.10
Hors ligne
#86 Le 07/05/2010, à 08:53
rpj
Re : [résolu] Intallation Ubuntu 7.10 sur HP m8079.fr tatoué + Vista
Ce sujet à été traité cent fois, lire la doc en haut à droite de cette page "Documentation".
Dual boot vista-ubuntu
La dernière version est la 10.04 avec un fs ext4 en tenir compte.
La ligne de commande UNIX devrait être obligatoire dès la maternelle ! :-)
Debian,Ubuntu, Mint, Voyager, Gnome, Chromium, FF, .
www.fuerteventura-losaloes-apartamentos.com
Hors ligne
Haut de page ↑
|
{
"url": "http://forum.ubuntu-fr.org/viewtopic.php?pid=2687400",
"source_domain": "forum.ubuntu-fr.org",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "33369",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:X5JHGAZZ2KO3DJD6I6YDKVEZBC5RQOJA",
"WARC-Concurrent-To": "<urn:uuid:e49576d1-15da-4fc9-8928-26d558eca8d2>",
"WARC-Date": "2013-12-13T14:38:13Z",
"WARC-IP-Address": "193.52.104.60",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:3EJPBRJ5Y4T5REGSYNKKRWK2JCZBHVTP",
"WARC-Record-ID": "<urn:uuid:5d0fc9af-15c6-4b26-8b87-a9101d1d29db>",
"WARC-Target-URI": "http://forum.ubuntu-fr.org/viewtopic.php?pid=2687400",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:65d13f26-824e-420c-a7d7-2dcac99881aa>"
},
"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,
29,
30,
38,
39,
281,
282,
309,
310,
320,
321,
390,
391,
543,
544,
571,
572,
578,
579,
648,
649,
659,
679,
680,
681,
717,
779,
789,
857,
858,
869,
870,
897,
898,
905,
906,
975,
976,
1161,
1162,
1163,
1210,
1211,
1222,
1223,
1250,
1251,
1259,
1260,
1329,
1330,
1411,
1412,
1648,
1649,
1712,
1713,
1740,
1741,
1749,
1750,
1819,
1820,
1849,
1850,
1925,
2108,
2109,
2327,
2453,
2454,
2516,
2517,
2525,
2526,
2537,
2538,
2565,
2566,
2572,
2573,
2642,
2643,
2652,
2660,
2716,
2717,
2725,
2802,
2901,
2939,
2940,
2941,
2977,
3039,
3049,
3117,
3118,
3129,
3130,
3157,
3158,
3165,
3166,
3235,
3236,
3247,
3248,
3321,
3359,
3360,
3415,
3444,
3531,
3644,
3750,
3849,
3879,
3880,
3899,
3929,
3930,
4038,
4145,
4256,
4361,
4470,
4575,
4686,
4792,
4895,
5000,
5001,
5031,
5032,
5122,
5123,
5152,
5153,
5160,
5161,
5172,
5173,
5200,
5201,
5212,
5213,
5282,
5283,
5299,
5300,
5345,
5346,
5436,
5437,
5490,
5491,
5520,
5611,
5683,
5684,
5849,
5850,
5866,
5907,
6086,
6087,
6258,
6259,
6260,
6284,
6335,
6418,
6506,
6507,
6518,
6519,
6546,
6547,
6559,
6560,
6629,
6630,
6645,
6646,
6706,
6707,
6769,
6770,
6839,
6940,
6941,
7019,
7055,
7056,
7135,
7136,
7177,
7224,
7270,
7321,
7356,
7421,
7522,
7654,
7748,
7812,
7908,
7985,
8098,
8099,
8126,
8127,
8128,
8232,
8233,
8301,
8302,
8314,
8315,
8326,
8327,
8354,
8355,
8361,
8362,
8431,
8432,
8445,
8854,
8916,
8917,
9052,
9114,
9115,
9172,
9173,
9174,
9263,
9366,
9367,
9378,
9379,
9406,
9407,
9411,
9412,
9481,
9482,
9575,
9598,
9664,
9665,
9666,
9741,
9794,
9838,
9839,
9850,
9851
],
"line_end_idx": [
29,
30,
38,
39,
281,
282,
309,
310,
320,
321,
390,
391,
543,
544,
571,
572,
578,
579,
648,
649,
659,
679,
680,
681,
717,
779,
789,
857,
858,
869,
870,
897,
898,
905,
906,
975,
976,
1161,
1162,
1163,
1210,
1211,
1222,
1223,
1250,
1251,
1259,
1260,
1329,
1330,
1411,
1412,
1648,
1649,
1712,
1713,
1740,
1741,
1749,
1750,
1819,
1820,
1849,
1850,
1925,
2108,
2109,
2327,
2453,
2454,
2516,
2517,
2525,
2526,
2537,
2538,
2565,
2566,
2572,
2573,
2642,
2643,
2652,
2660,
2716,
2717,
2725,
2802,
2901,
2939,
2940,
2941,
2977,
3039,
3049,
3117,
3118,
3129,
3130,
3157,
3158,
3165,
3166,
3235,
3236,
3247,
3248,
3321,
3359,
3360,
3415,
3444,
3531,
3644,
3750,
3849,
3879,
3880,
3899,
3929,
3930,
4038,
4145,
4256,
4361,
4470,
4575,
4686,
4792,
4895,
5000,
5001,
5031,
5032,
5122,
5123,
5152,
5153,
5160,
5161,
5172,
5173,
5200,
5201,
5212,
5213,
5282,
5283,
5299,
5300,
5345,
5346,
5436,
5437,
5490,
5491,
5520,
5611,
5683,
5684,
5849,
5850,
5866,
5907,
6086,
6087,
6258,
6259,
6260,
6284,
6335,
6418,
6506,
6507,
6518,
6519,
6546,
6547,
6559,
6560,
6629,
6630,
6645,
6646,
6706,
6707,
6769,
6770,
6839,
6940,
6941,
7019,
7055,
7056,
7135,
7136,
7177,
7224,
7270,
7321,
7356,
7421,
7522,
7654,
7748,
7812,
7908,
7985,
8098,
8099,
8126,
8127,
8128,
8232,
8233,
8301,
8302,
8314,
8315,
8326,
8327,
8354,
8355,
8361,
8362,
8431,
8432,
8445,
8854,
8916,
8917,
9052,
9114,
9115,
9172,
9173,
9174,
9263,
9366,
9367,
9378,
9379,
9406,
9407,
9411,
9412,
9481,
9482,
9575,
9598,
9664,
9665,
9666,
9741,
9794,
9838,
9839,
9850,
9851,
9865
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9865,
"ccnet_original_nlines": 259,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.04390934854745865,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023607179522514343,
"rps_doc_frac_lines_end_with_ellipsis": 0.003846149891614914,
"rps_doc_frac_no_alph_words": 0.3692162334918976,
"rps_doc_frac_unique_words": 0.4396355450153351,
"rps_doc_mean_word_length": 5.4123005867004395,
"rps_doc_num_sentences": 111,
"rps_doc_symbol_to_word_ratio": 0.008498580195009708,
"rps_doc_unigram_entropy": 5.764842987060547,
"rps_doc_word_count": 1317,
"rps_doc_frac_chars_dupe_10grams": 0.14646464586257935,
"rps_doc_frac_chars_dupe_5grams": 0.19107744097709656,
"rps_doc_frac_chars_dupe_6grams": 0.16624578833580017,
"rps_doc_frac_chars_dupe_7grams": 0.16624578833580017,
"rps_doc_frac_chars_dupe_8grams": 0.16624578833580017,
"rps_doc_frac_chars_dupe_9grams": 0.14646464586257935,
"rps_doc_frac_chars_top_2gram": 0.01683502085506916,
"rps_doc_frac_chars_top_3gram": 0.030864199623465538,
"rps_doc_frac_chars_top_4gram": 0.040123458951711655,
"rps_doc_books_importance": -892.616943359375,
"rps_doc_books_importance_length_correction": -892.616943359375,
"rps_doc_openwebtext_importance": -496.3880615234375,
"rps_doc_openwebtext_importance_length_correction": -496.3880615234375,
"rps_doc_wikipedia_importance": -269.2165832519531,
"rps_doc_wikipedia_importance_length_correction": -269.2165832519531
},
"fasttext": {
"dclm": 0.09264218807220459,
"english": 0.0037739600520581007,
"fineweb_edu_approx": 1.2151014804840088,
"eai_general_math": 4.799999828719592e-7,
"eai_open_web_math": 0.46804279088974,
"eai_web_code": 0.6576118469238281
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0285636",
"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": "Leftover HTML"
}
},
"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": "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
|
5,209,380,330,549,254,000 |
Thank you for purchasing through links and ads on this site.
OWC / MacSales.com...
diglloyd Deal Finder...
Buy other stuff at Amazon.com...
Up to 1527MB/s sustained performance
SoftRAID RAID-4 / RAID-5 Performance with Heavy CPU load
Last updated 2015-11-18 - Send Feedback
Related: RAID, storage, Thunderbolt, video
RAID-4 and RAID-5 offer fault tolerance against a drive failure. This fault tolerance derives from the use of parity data, which must be computed when disk writes are done. This parity calculation is performed by the CPU and so if the CPU is heavily loaded, things slow down for writes (parity is not computed for reads by SoftRAID).
SoftRAID will use one CPU core for every drive that is part of the RAID-4/RAID-5, hence a dual-core machine (or even 4 core) might not run as fast even if idle, and under load will definitely see degradation (for writes).
The important point is that most workloads neither utilize all CPUs nor does the workload involve a lot of writing. But some workloads might, so a RAID-0 stripe may be more appropriate (e.g., processing a video stream to a new format). Still, few workloads will write a gigabyte a second, so specifics are what matter.
Performance with RAID-4, idle machine vs heavy CPU load
8-core 3.3 GHz 2013 Mac Pro, 64GB memory,
7-drive RAID-4
Machine mostly idle
Iteration Write MiB/sec Read MiB/sec
1 1014 1071
2 1054 1077
3 1020 1079
4 1002 1104
5 1031 1103
6 1013 1068
7 952 1098
8 967 1122
9 971 1114
10 953 1114
Slowest 952 1068
Fastest 1054 1122
Average 998 1095
Median 1008 1101
Range 102 54.4
StdDev 35.0 19.9
Machine heavily loaded: mt stress -t 8 -m 512M
Iteration Write MiB/sec Read MiB/sec
1 487 1140
2 486 1100
3 480 1077
4 468 1118
5 447 1110
6 439 1031
7 431 1098
8 438 1057
9 424 1109
10 424 1102
Slowest 424 1031
Fastest 487 1140
Average 453 1094
Median 443 1101 <=== 56% REDUCTION in WRITE SPEED
Range 63.3 109
StdDev 25.6 31.5
Deals Updated Daily at B&H Photo
View BEST Deals Right Now
Performance with RAID-0, idle machine vs heavy CPU load
RAID-0 striping has very low CPU overhead (no parity to compute) and thus is all but unaffected by a heavy CPU load.
8-core 3.3 GHz 2013 Mac Pro, 64GB memory,
8 drive RAID-0
Machine mostly idle Iteration Write MiB/sec Read MiB/sec
1 1332 1357
2 1316 1351
3 1301 1315
4 1321 1314
5 1340 1320
6 1324 1346
7 1305 1348
8 1274 1329
9 1277 1358
10 1314 1293
Slowest 1274 1293
Fastest 1340 1358
Average 1310 1333
Median 1315 1338
Range 66.6 65.3
StdDev 21.8 22.3 Machine heavily loaded: mt stress -t 8 -m 512M Iteration Write MiB/sec Read MiB/sec
1 1312 1353
2 1261 1306
3 1257 1341
4 1322 1332
5 1289 1286
6 1327 1346
7 1328 1325
8 1276 1348
9 1291 1290
10 1285 1348
Slowest 1257 1286
Fastest 1328 1353
Average 1295 1328
Median 1290 1337
Range 71.2 67.3
StdDev 26.3 25.1
Durable and fast, up to 1800MB/s
B&H Deal ZoneDeals by Brand/Category/Savings
Deals expire in 19 hours unless noted. Certain deals may last longer.
$1299 SAVE $400 = 23.0% $19 FREE ITEMS Canon 18x50 IS Image Stabilized Binocular in All Other Categories
$1049 SAVE $450 = 30.0% $20 FREE ITEMS Canon EOS 77D DSLR with 18-135mm USM in Cameras: DSLR
$2197 SAVE $900 = 29.0% Nikon D750 DSLR with 24-120mm in Cameras: DSLR
$898 SAVE $100 = 10.0% Sony DSC-RX100 V in Cameras: Point and Shoot
diglloyd.com | Terms of Use | PRIVACY POLICY
Contact | About Lloyd Chambers | Consulting | Photo Tours
Mailing Lists | RSS Feeds | Twitter
Copyright © 2008-2017 diglloyd Inc, all rights reserved.
Display info: __RETINA_INFO_STATUS__
|
{
"url": "https://macperformanceguide.com/SoftwareRAID-performance-RAID4-5-CPU_load.html",
"source_domain": "macperformanceguide.com",
"snapshot_id": "crawl=CC-MAIN-2018-34",
"warc_metadata": {
"Content-Length": "44812",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XNZVD55HJRQIEEXTDZJ4SY6PTXU7EELK",
"WARC-Concurrent-To": "<urn:uuid:0ee73f28-8bb0-4c94-aee0-c7faf3bdf741>",
"WARC-Date": "2018-08-16T08:15:41Z",
"WARC-IP-Address": "192.169.20.186",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:A3WFJFF76AJKAORRFNZIIHWHUTSM3MYZ",
"WARC-Record-ID": "<urn:uuid:735f6404-972d-4492-aff6-d14ea27d053b>",
"WARC-Target-URI": "https://macperformanceguide.com/SoftwareRAID-performance-RAID4-5-CPU_load.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e74e1fff-f7ff-44e2-8961-07986386d1f0>"
},
"warc_info": "isPartOf: CC-MAIN-2018-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-113-243-226.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,
61,
83,
107,
140,
177,
178,
235,
236,
276,
319,
320,
654,
655,
877,
878,
1197,
1198,
1254,
1255,
1297,
1312,
1332,
1370,
1403,
1436,
1469,
1502,
1535,
1568,
1601,
1634,
1667,
1698,
1735,
1772,
1809,
1845,
1881,
1917,
1964,
2002,
2035,
2068,
2101,
2134,
2167,
2200,
2233,
2266,
2299,
2333,
2370,
2407,
2444,
2513,
2549,
2585,
2618,
2644,
2645,
2701,
2702,
2819,
2820,
2862,
2877,
2935,
2947,
2959,
2971,
2983,
2995,
3007,
3019,
3031,
3043,
3056,
3057,
3075,
3093,
3111,
3128,
3144,
3245,
3257,
3269,
3281,
3293,
3305,
3317,
3329,
3341,
3353,
3366,
3367,
3385,
3403,
3421,
3438,
3454,
3471,
3504,
3549,
3619,
3724,
3817,
3888,
3956,
3957,
4002,
4060,
4096,
4153
],
"line_end_idx": [
61,
83,
107,
140,
177,
178,
235,
236,
276,
319,
320,
654,
655,
877,
878,
1197,
1198,
1254,
1255,
1297,
1312,
1332,
1370,
1403,
1436,
1469,
1502,
1535,
1568,
1601,
1634,
1667,
1698,
1735,
1772,
1809,
1845,
1881,
1917,
1964,
2002,
2035,
2068,
2101,
2134,
2167,
2200,
2233,
2266,
2299,
2333,
2370,
2407,
2444,
2513,
2549,
2585,
2618,
2644,
2645,
2701,
2702,
2819,
2820,
2862,
2877,
2935,
2947,
2959,
2971,
2983,
2995,
3007,
3019,
3031,
3043,
3056,
3057,
3075,
3093,
3111,
3128,
3144,
3245,
3257,
3269,
3281,
3293,
3305,
3317,
3329,
3341,
3353,
3366,
3367,
3385,
3403,
3421,
3438,
3454,
3471,
3504,
3549,
3619,
3724,
3817,
3888,
3956,
3957,
4002,
4060,
4096,
4153,
4189
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4189,
"ccnet_original_nlines": 113,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.16747573018074036,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07281553000211716,
"rps_doc_frac_lines_end_with_ellipsis": 0.02631578966975212,
"rps_doc_frac_no_alph_words": 0.458737850189209,
"rps_doc_frac_unique_words": 0.5758064389228821,
"rps_doc_mean_word_length": 4.369354724884033,
"rps_doc_num_sentences": 41,
"rps_doc_symbol_to_word_ratio": 0.0036407799925655127,
"rps_doc_unigram_entropy": 5.657155513763428,
"rps_doc_word_count": 620,
"rps_doc_frac_chars_dupe_10grams": 0.07973422110080719,
"rps_doc_frac_chars_dupe_5grams": 0.12919896841049194,
"rps_doc_frac_chars_dupe_6grams": 0.12919896841049194,
"rps_doc_frac_chars_dupe_7grams": 0.1151716485619545,
"rps_doc_frac_chars_dupe_8grams": 0.1151716485619545,
"rps_doc_frac_chars_dupe_9grams": 0.1151716485619545,
"rps_doc_frac_chars_top_2gram": 0.011812480166554451,
"rps_doc_frac_chars_top_3gram": 0.017718719318509102,
"rps_doc_frac_chars_top_4gram": 0.03543743118643761,
"rps_doc_books_importance": -387.43316650390625,
"rps_doc_books_importance_length_correction": -387.43316650390625,
"rps_doc_openwebtext_importance": -224.56736755371094,
"rps_doc_openwebtext_importance_length_correction": -224.56736755371094,
"rps_doc_wikipedia_importance": -168.26617431640625,
"rps_doc_wikipedia_importance_length_correction": -168.26617431640625
},
"fasttext": {
"dclm": 0.053209900856018066,
"english": 0.6995408535003662,
"fineweb_edu_approx": 1.391020655632019,
"eai_general_math": 0.004999219905585051,
"eai_open_web_math": 0.16384440660476685,
"eai_web_code": 0.01325428020209074
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.62",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.72",
"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": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
969,308,804,488,184,300 |
ALERT
[WEBINAR] Design the Next-Generation of Applications
Interactive Television (ITV)
Definition - What does Interactive Television (ITV) mean?
Interactive television (iTV) is the integration of traditional television technology and data services. It is a two-way cable system that allows users to interact with it via commands and feedback information. A set-top box is an integral part of an interactive television system. It can be used by the viewer to select the shows that they want to watch, view show schedules and give advanced options like ordering products shown in ads, as well as accessing email and Internet.
Interactive television is also known simply as interactive TV.
Techopedia explains Interactive Television (ITV)
Interactive television refers to technology where traditional TV services are combined with data services. The major aim of interactive TV is to provide an engaging experience to the viewer.
Interactive TV allows various forms of interaction, such as:
• Interacting with the TV set
• Interacting with the program content
• Interacting with TV-related content
• Interactive TV services
• Closed-circuit interactive television
Interactive TV is similar to converged TV services, but should not be confused with it. Interactive TV is delivered through pay-TV set-top boxes, whereas converged TV services are delivered using Internet connectivity and Web-based services with the help of over-the-top boxes like Roku or gaming consoles.
Interactive TV increases engagement levels by allowing user participation and feedback. It can also become part of a connected living room and be controlled using devices other than the remote control, like mobile phones and tablets.
The return path is the channel that is used by viewers to send informationback to the broadcaster. This path can be established using a cable, telephone lines or any data communications technology. The most commonly used return path is a broadband IP connection.
However, when iTV is delivered through a terrestrial aerial, there is no return path, and hence data cannot be sent back to the broadcaster. But in this case, interactivity can be made possible with the help of appropriate application downloaded onto the set-top box.
Share this:
|
{
"url": "https://www.techopedia.com/definition/11699/interactive-television-itv",
"source_domain": "www.techopedia.com",
"snapshot_id": "crawl=CC-MAIN-2017-51",
"warc_metadata": {
"Content-Length": "142780",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O3BHIETLTXS4EC6F2SUWKSFP7AB6WTJL",
"WARC-Concurrent-To": "<urn:uuid:5901414a-1a22-4ea9-b4fa-b0f26d95b494>",
"WARC-Date": "2017-12-11T13:06:51Z",
"WARC-IP-Address": "54.187.215.138",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DEJJDPWLHZWEV6EEALYG6FKUI6J26JWE",
"WARC-Record-ID": "<urn:uuid:f43aa5cf-ba14-4ca6-828e-88b13f1db889>",
"WARC-Target-URI": "https://www.techopedia.com/definition/11699/interactive-television-itv",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1dfe63d0-38ae-4b87-b519-ac474cbdb4bc>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-151-110-145.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-51\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for December 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
6,
7,
60,
61,
90,
91,
149,
150,
629,
630,
693,
694,
743,
744,
935,
936,
997,
998,
1030,
1071,
1111,
1139,
1181,
1182,
1489,
1490,
1724,
1725,
1988,
1989,
2257,
2258
],
"line_end_idx": [
6,
7,
60,
61,
90,
91,
149,
150,
629,
630,
693,
694,
743,
744,
935,
936,
997,
998,
1030,
1071,
1111,
1139,
1181,
1182,
1489,
1490,
1724,
1725,
1988,
1989,
2257,
2258,
2269
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2269,
"ccnet_original_nlines": 32,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3636363744735718,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04914005100727081,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14004914462566376,
"rps_doc_frac_unique_words": 0.49418604373931885,
"rps_doc_mean_word_length": 5.375,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.708232402801514,
"rps_doc_word_count": 344,
"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.09085991978645325,
"rps_doc_frac_chars_top_3gram": 0.05191995948553085,
"rps_doc_frac_chars_top_4gram": 0.02055164985358715,
"rps_doc_books_importance": -183.6004638671875,
"rps_doc_books_importance_length_correction": -183.6004638671875,
"rps_doc_openwebtext_importance": -84.47265625,
"rps_doc_openwebtext_importance_length_correction": -84.47265625,
"rps_doc_wikipedia_importance": -79.82460021972656,
"rps_doc_wikipedia_importance_length_correction": -79.82460021972656
},
"fasttext": {
"dclm": 0.05964142084121704,
"english": 0.9297735095024109,
"fineweb_edu_approx": 2.227700710296631,
"eai_general_math": 0.11763591319322586,
"eai_open_web_math": 0.1648850440979004,
"eai_web_code": 0.06040745973587036
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0194",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.384",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,630,852,718,562,166,000 |
1
I need to merge two calendars in macOS Sierra Calendar App. I found instructions on the web that describe how to do this with previous versions of OS X, however these are not relevant for macOS Sierra. The answer to this question provides the same steps, which does not solve my problem.
Basically, the problem is if you export the calendar, then import the calendar, it will simply import back into the original calendar, giving you no choice to where you want it imported. There is never an option to select a target calendar as described in the previously mentioned steps.
Is it no longer possible to merge two calendars in macOS Sierra Calendar App? Are there any other ways to do this?
3
Actually, there's an even easier way with Sierra. Toggle the Calendar Sidebar if not already showing. From the Sidebar, select the Calendar you wish to merge into another. Select "Merge Calendar" from under the edit menu. Select the calendar you want to merge the Sidebar selected calendar into.
One additional note: If the calendar is "Shared," then merge is not available.
1
I just performed the following experiment:
1. created a new calendar, Test, and created one event.
2. selected Test and selected File > Export > Export… and saved Test.ics the Desktop.
3. Deleted the Test calendar
4. From the desktop, dragged and dropped Test.ics to my existing Personal calendar.
The event was imported into that calendar. It did not recreate the Test calendar.
Note I did not choose File > Import…
I think this is what you are trying to accomplish. Try it and see?
I also tried another variation: I clicked File > Import… and selected the file on the desktop. Calendar asked me which Calendar to use when importing my event. I chose the one I wanted and it performed as desired.
2
• Thanks. What OS are you using? – Swisher Sweet Nov 29 '16 at 23:58
• i'm using sierra, but i did this on several versions for myself and for clients. This is a feature that's been around for dog's ears and hasn't changed much. I'm sure I've used it on 10.11, 10.10, and maybe even 10.9 – Zonker.in.Geneva Nov 30 '16 at 23:33
1
I was just trying this and discovered that it's now even easier (maybe it's been updated in the last few months?). I made a test calendar with an event, exported it, went to delete the test calendar (Edit > Delete) and it asked me if I wanted to merge it or delete it. If you say merge it just brings up the list of your other calendars so you can choose which to merge it with.
You must log in to answer this question.
Not the answer you're looking for? Browse other questions tagged .
|
{
"url": "https://apple.stackexchange.com/questions/262874/merging-two-calendars-in-macos-sierra/291488",
"source_domain": "apple.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "150910",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WB5XL3QTEXQPJMETZ6OUWIRFRJ6S3Q3H",
"WARC-Concurrent-To": "<urn:uuid:47a83f72-c997-47d9-911d-2e59a4272fa9>",
"WARC-Date": "2021-03-02T21:07:52Z",
"WARC-IP-Address": "151.101.129.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WV24YZAS4MDHX2EPTDG34QK5GTBS64S4",
"WARC-Record-ID": "<urn:uuid:f49414c9-e336-4daa-8e73-ddec4cc5d4bf>",
"WARC-Target-URI": "https://apple.stackexchange.com/questions/262874/merging-two-calendars-in-macos-sierra/291488",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e2788d21-2515-4305-bfe1-ab16968ca6b8>"
},
"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-59.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,
291,
292,
580,
581,
696,
697,
699,
700,
996,
997,
1076,
1077,
1079,
1080,
1123,
1124,
1182,
1270,
1301,
1387,
1388,
1470,
1471,
1508,
1509,
1576,
1577,
1791,
1792,
1794,
1865,
2125,
2127,
2128,
2507,
2508,
2549,
2550
],
"line_end_idx": [
2,
3,
291,
292,
580,
581,
696,
697,
699,
700,
996,
997,
1076,
1077,
1079,
1080,
1123,
1124,
1182,
1270,
1301,
1387,
1388,
1470,
1471,
1508,
1509,
1576,
1577,
1791,
1792,
1794,
1865,
2125,
2127,
2128,
2507,
2508,
2549,
2550,
2616
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2616,
"ccnet_original_nlines": 40,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42807626724243164,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.029462739825248718,
"rps_doc_frac_lines_end_with_ellipsis": 0.024390239268541336,
"rps_doc_frac_no_alph_words": 0.20623916387557983,
"rps_doc_frac_unique_words": 0.44206008315086365,
"rps_doc_mean_word_length": 4.343347549438477,
"rps_doc_num_sentences": 44,
"rps_doc_symbol_to_word_ratio": 0.005199309904128313,
"rps_doc_unigram_entropy": 4.8632707595825195,
"rps_doc_word_count": 466,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.042490120977163315,
"rps_doc_frac_chars_dupe_6grams": 0.042490120977163315,
"rps_doc_frac_chars_dupe_7grams": 0.042490120977163315,
"rps_doc_frac_chars_dupe_8grams": 0.042490120977163315,
"rps_doc_frac_chars_dupe_9grams": 0.042490120977163315,
"rps_doc_frac_chars_top_2gram": 0.020750990137457848,
"rps_doc_frac_chars_top_3gram": 0.022233199328184128,
"rps_doc_frac_chars_top_4gram": 0.018774699419736862,
"rps_doc_books_importance": -266.39080810546875,
"rps_doc_books_importance_length_correction": -266.39080810546875,
"rps_doc_openwebtext_importance": -136.0988311767578,
"rps_doc_openwebtext_importance_length_correction": -136.0988311767578,
"rps_doc_wikipedia_importance": -100.1954116821289,
"rps_doc_wikipedia_importance_length_correction": -100.1954116821289
},
"fasttext": {
"dclm": 0.052669111639261246,
"english": 0.9542003273963928,
"fineweb_edu_approx": 1.0827046632766724,
"eai_general_math": 0.6459780335426331,
"eai_open_web_math": 0.11883848905563354,
"eai_web_code": 0.22845590114593506
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.432",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,238,369,561,999,093,000 |
Doctor V64 questions...
Discussion in 'Other Consoles & Oldies' started by Harsky, Dec 25, 2006.
1. Harsky
OP
Harsky Madmin
Member
6
Aug 2, 2004
Not sure if many GBAtempers have this device but it can't hurt to ask. I bought a Doctor V64 off ebay as a present for myself. I only managed to get round to testing it today since the N64 console was in another place. Anyways, I burned 3 N64 roms to a CD and tested it. Some of the games refuse to load while others loaded.... then went black and another gave me an error message. Granted the N64 rom pack I downloaded had 5 different versions for one rom. Is it normal to not expect 100% emulation or is there something I'm doing wrong?
2. Tomobobo
Tomobobo Champion.
Member
4
Nov 26, 2005
United States
If I remember correctly, a few games will not work due to their size and the amount of ram on the device. 512 Mbit roms will not work, or so I remember. This means Zelda and a couple others.
BTW, how much did you dish out for that beast?
Also in a rom pack, if it's a goodset, many of the roms are beta versions and were never actually meant to be played on a end user console. (!) at the end of the rom name means that's the best version to use.
3. Ridefreak
Ridefreak Member
Newcomer
1
Sep 4, 2004
Gambia, The
4. Harsky
OP
Harsky Madmin
Member
6
Aug 2, 2004
I chose to burn to a CD had the (!) at the end. There was also a bunch of other symbols like
or or something. What do they mean? BTW, it cost £80 for a 256mb version. Is there a full list of the roms with the size?
5. Harsky
OP
Harsky Madmin
Member
6
Aug 2, 2004
Goddammit. I hate how it takes AGGGEEES to load up one game image.... and then discovering it doesn't work. WTF at byte swapping part?
6. TheStump
TheStump Got Wood?
Member
2
May 8, 2006
[!] Verified GOOD dump
[A] Alternative Dump
[T] Trained Dump
BAD dump
[O] Over-Dump
Hope that helps
7. Harsky
OP
Harsky Madmin
Member
6
Aug 2, 2004
Nice. Damn, I placed 7 roms into a disc as a test. Only 1 rom out of them worked. I'm sure there's something wrong with the image but since there's 10 roms for super smash bros. I can't be bothered testing them all. I realise that my chipped Xbox can play N64 emulator but it's like a combination game trying to guess the right plugins.
8. xiaNaix
xiaNaix GBAtemp Fan
Member
3
Nov 14, 2002
United States
X HQ
I was into the SNES backup scene myself but the N64 stuff tends to pop up on the same sites. There's a difference between the roms you find on the internet today and the roms in use back in the day of the SNES & N64 backup units. The good news, though, is that you can convert them to the right format Here's some sites you're going to want to look at...
http://n64.icequake.net/
http://www.64scener.com/n64/index.htm
http://dextrose.com/_forum/forumdisplay.php?f=1
Here's the best tool on the face of the Earth...
http://ucon64.sourceforge.net/index.php
9. Harsky
OP
Harsky Madmin
Member
6
Aug 2, 2004
Awesome
10. yee
yee DOTA 4EVER
Member
3
Jul 9, 2006
Canada
Vancouver
Most of the images on my CDs when my Doctor V64 worked were in Z64 or V64 format if I remember correctly.
11. Harsky
OP
Harsky Madmin
Member
6
Aug 2, 2004
I just used the Ucon program and choosing to get rid of the byte swapping thing that the v64 thing does. But some of the games refuses to load.
12. Harsky
OP
Harsky Madmin
Member
6
Aug 2, 2004
Bumping again. I realise that a lot of the games just flat out refuse to load. While some games require a certain cart to be inserted into the N64 for some roms to load. Really, I never expected so much bother... unless theres a proper answer.
13. legendofphil
legendofphil Phil no Densetsu
Member
2
Nov 19, 2002
What size games don't work? I did read that the standard V64 only has 128Mbit RAM upgradable to 256Mbit. This could be the problem.
14. Harsky
OP
Harsky Madmin
Member
6
Aug 2, 2004
Well the device is upgraded to run 256mb
15. Edster
Edster GBAtemp Regular
Member
2
Aug 1, 2006
United States
I bought a V64 many many years ago. At the time is was around $400. Yikes. But it did work. I have 5 discs full of games. Make sure all the games are not byte swapped and used in V64 mode not Z64. This need byte swapping. Once you convet the Rom they shoudl all work. If I remember correctly only 3 games do not work. Conker bad Fur Day, Carmageddon (never was released) and one other that escapes me. Zelda does work on a 256MB. I have the mult-eprom save cart and the SRAM save modules. These come in handy. Pain in the but but it does work. Planning on swapping the CD for a DVD drive one day and put all the Roms on one disc.
16. Harsky
OP
Harsky Madmin
Member
6
Aug 2, 2004
Yeah.... about that. I used Ucon64 to convert them to be byte swapped because I was tired of waiting for the rom to load up and then waiting longer for the byte swapping. What do you mean by v64 mode and was I meant to convert them? When I bought the V64, it came with a DS1 Doctor Save card but I'm guessing I'm using it wrong because it didn't save the one game that worked.
PS. The CD drive that the v64 came with was oooold so I decided to replace it with an old CD drive I had that can read DVDs. Sadly, it won't read the DVDS. Just thought I might mention that.
17. Harsky
OP
Harsky Madmin
Member
6
Aug 2, 2004
Oh wow, after all that trouble, I can only manage to get Kirby 64 to run.... and it doesn't even save.
18. spotfek
spotfek Member
Newcomer
3
Oct 16, 2006
I believe with a v64 you might need a ds1 to save as obviously u cannot write to the cd of a v64!!! also you do realise that quite a few of the games need to be cracked? check out www.dextrose.com for most of em.
personally i have a z64 so cannot really give much help with v64
19. Harsky
OP
Harsky Madmin
Member
6
Aug 2, 2004
Yeah, I put a cart on top of the DS1 and then into the N64. But somehow, it's still not saving. Button combination? Broken DS1? I'm starting to take rom running in the 21st century for granted now....
20. Harsky
OP
Harsky Madmin
Member
6
Aug 2, 2004
You know the feeling you get when you anticipate for AGES over something you wanted and thought was cool... then when you finally get it, it totally fails to live up to your expectations. Yeah, this is the feeling I'm getting. It's really, really fussy over the rom it wants to load up and then it needs specific boot carts to make it work. I guess this is one to sell back on ebay.
1. This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.
Dismiss Notice
|
{
"url": "https://gbatemp.net/threads/doctor-v64-questions.41095/",
"source_domain": "gbatemp.net",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "143957",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6UTMALS5UJAR5H7J37IRFBDEIBZJWDGQ",
"WARC-Concurrent-To": "<urn:uuid:0a3ace8c-7ce1-425a-aa77-08dccaf3efe8>",
"WARC-Date": "2018-06-23T16:41:10Z",
"WARC-IP-Address": "62.210.180.159",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7AESB4RXOLCWLBROEKXGOLATWYSZEYDP",
"WARC-Record-ID": "<urn:uuid:15835cf0-afc5-4f35-8b05-2fc989ec1ea9>",
"WARC-Target-URI": "https://gbatemp.net/threads/doctor-v64-questions.41095/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2ad36ae7-99f0-419d-a760-63192507a563>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-167-231-208.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 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,
24,
25,
98,
99,
111,
118,
119,
137,
138,
149,
155,
171,
714,
720,
734,
735,
758,
759,
770,
776,
793,
811,
1006,
1007,
1058,
1059,
1272,
1278,
1293,
1294,
1315,
1316,
1329,
1335,
1351,
1367,
1379,
1386,
1387,
1405,
1406,
1417,
1423,
1439,
1536,
1662,
1668,
1680,
1687,
1688,
1706,
1707,
1718,
1724,
1740,
1879,
1885,
1899,
1900,
1923,
1924,
1935,
1941,
1957,
1984,
2009,
2030,
2043,
2061,
2062,
2082,
2088,
2100,
2107,
2108,
2126,
2127,
2138,
2144,
2160,
2161,
2502,
2508,
2521,
2522,
2546,
2547,
2558,
2564,
2581,
2599,
2608,
2967,
2968,
2997,
3039,
3091,
3092,
3145,
3189,
3195,
3207,
3214,
3215,
3233,
3234,
3245,
3251,
3267,
3279,
3285,
3295,
3296,
3315,
3316,
3327,
3333,
3349,
3360,
3374,
3484,
3490,
3503,
3510,
3511,
3529,
3530,
3541,
3547,
3563,
3711,
3717,
3730,
3737,
3738,
3756,
3757,
3768,
3774,
3790,
4038,
4044,
4063,
4064,
4098,
4099,
4110,
4116,
4133,
4269,
4275,
4288,
4295,
4296,
4314,
4315,
4326,
4332,
4348,
4393,
4399,
4412,
4413,
4440,
4441,
4452,
4458,
4474,
4492,
5126,
5132,
5145,
5152,
5153,
5171,
5172,
5183,
5189,
5205,
5586,
5587,
5782,
5788,
5801,
5808,
5809,
5827,
5828,
5839,
5845,
5861,
5968,
5974,
5988,
5989,
6008,
6009,
6022,
6028,
6045,
6262,
6263,
6332,
6338,
6351,
6358,
6359,
6377,
6378,
6389,
6395,
6411,
6616,
6622,
6635,
6642,
6643,
6661,
6662,
6673,
6679,
6695,
7082,
7088,
7211,
7289
],
"line_end_idx": [
24,
25,
98,
99,
111,
118,
119,
137,
138,
149,
155,
171,
714,
720,
734,
735,
758,
759,
770,
776,
793,
811,
1006,
1007,
1058,
1059,
1272,
1278,
1293,
1294,
1315,
1316,
1329,
1335,
1351,
1367,
1379,
1386,
1387,
1405,
1406,
1417,
1423,
1439,
1536,
1662,
1668,
1680,
1687,
1688,
1706,
1707,
1718,
1724,
1740,
1879,
1885,
1899,
1900,
1923,
1924,
1935,
1941,
1957,
1984,
2009,
2030,
2043,
2061,
2062,
2082,
2088,
2100,
2107,
2108,
2126,
2127,
2138,
2144,
2160,
2161,
2502,
2508,
2521,
2522,
2546,
2547,
2558,
2564,
2581,
2599,
2608,
2967,
2968,
2997,
3039,
3091,
3092,
3145,
3189,
3195,
3207,
3214,
3215,
3233,
3234,
3245,
3251,
3267,
3279,
3285,
3295,
3296,
3315,
3316,
3327,
3333,
3349,
3360,
3374,
3484,
3490,
3503,
3510,
3511,
3529,
3530,
3541,
3547,
3563,
3711,
3717,
3730,
3737,
3738,
3756,
3757,
3768,
3774,
3790,
4038,
4044,
4063,
4064,
4098,
4099,
4110,
4116,
4133,
4269,
4275,
4288,
4295,
4296,
4314,
4315,
4326,
4332,
4348,
4393,
4399,
4412,
4413,
4440,
4441,
4452,
4458,
4474,
4492,
5126,
5132,
5145,
5152,
5153,
5171,
5172,
5183,
5189,
5205,
5586,
5587,
5782,
5788,
5801,
5808,
5809,
5827,
5828,
5839,
5845,
5861,
5968,
5974,
5988,
5989,
6008,
6009,
6022,
6028,
6045,
6262,
6263,
6332,
6338,
6351,
6358,
6359,
6377,
6378,
6389,
6395,
6411,
6616,
6622,
6635,
6642,
6643,
6661,
6662,
6673,
6679,
6695,
7082,
7088,
7211,
7289,
7307
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7307,
"ccnet_original_nlines": 226,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3711676597595215,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06392694264650345,
"rps_doc_frac_lines_end_with_ellipsis": 0.017621150240302086,
"rps_doc_frac_no_alph_words": 0.20874102413654327,
"rps_doc_frac_unique_words": 0.36269840598106384,
"rps_doc_mean_word_length": 3.9936506748199463,
"rps_doc_num_sentences": 126,
"rps_doc_symbol_to_word_ratio": 0.006523159798234701,
"rps_doc_unigram_entropy": 5.462508201599121,
"rps_doc_word_count": 1260,
"rps_doc_frac_chars_dupe_10grams": 0.029809219762682915,
"rps_doc_frac_chars_dupe_5grams": 0.09141494333744049,
"rps_doc_frac_chars_dupe_6grams": 0.085453100502491,
"rps_doc_frac_chars_dupe_7grams": 0.085453100502491,
"rps_doc_frac_chars_dupe_8grams": 0.085453100502491,
"rps_doc_frac_chars_dupe_9grams": 0.085453100502491,
"rps_doc_frac_chars_top_2gram": 0.019077900797128677,
"rps_doc_frac_chars_top_3gram": 0.03338633105158806,
"rps_doc_frac_chars_top_4gram": 0.047694750130176544,
"rps_doc_books_importance": -493.5659484863281,
"rps_doc_books_importance_length_correction": -493.5659484863281,
"rps_doc_openwebtext_importance": -319.6579284667969,
"rps_doc_openwebtext_importance_length_correction": -319.6579284667969,
"rps_doc_wikipedia_importance": -275.126220703125,
"rps_doc_wikipedia_importance_length_correction": -275.126220703125
},
"fasttext": {
"dclm": 0.058743059635162354,
"english": 0.9470332860946655,
"fineweb_edu_approx": 0.9811995029449463,
"eai_general_math": 0.09449548274278641,
"eai_open_web_math": 0.19752389192581177,
"eai_web_code": 0.006666719913482666
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.17",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "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
|
-1,379,913,084,869,761,500 |
Documentation for: ASP.NET Ajax Version 1.0
This documentation is for a previous version. For the current released version, see the ASP.NET Ajax documentation on MSDN.
System.Web.Script.Serialization.TypeResolver Sample
cs/Default.aspx
<%@ Page Language="C#" %>
<%@ Import Namespace="System.Web.Script.Serialization" %>
<%@ Import Namespace="System.Web.Script.Serialization.TypeResolver.CS" %>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<script runat="server">
protected void RadioButtonList1_SelectedIndexChanged(object sender, EventArgs e)
{
ColorType customObject = new ColorType();
JavaScriptSerializer serializer;
switch(((RadioButtonList)sender).SelectedIndex)
{
case 0:
serializer = new JavaScriptSerializer();
Label1.Text = serializer.Serialize(customObject);
break;
case 1:
serializer = new JavaScriptSerializer(new SimpleTypeResolver());
Label1.Text = serializer.Serialize(customObject);
break;
case 2:
serializer = new JavaScriptSerializer(new CustomTypeResolver());
Label1.Text = serializer.Serialize(customObject);
break;
}
}
</script>
<html xmlns="http://www.w3.org/1999/xhtml" >
<head runat="server">
<title>Type Resolvers</title>
<style type="text/css">
body { font: 10pt Trebuchet MS;
font-color: #000000;
}
.text { font: 8pt Trebuchet MS }
</style>
</head>
<body>
<form id="form1" runat="server">
<div>
Select one of the following serialization types:
<asp:RadioButtonList ID="RadioButtonList1" runat="server" OnSelectedIndexChanged="RadioButtonList1_SelectedIndexChanged" AutoPostBack="True">
<asp:ListItem Value="0">Serialization with no type resolver</asp:ListItem>
<asp:ListItem Value="1">Serialization with the SimpleTypeResolver class</asp:ListItem>
<asp:ListItem Value="2">Serialization with a custom type resolver</asp:ListItem>
</asp:RadioButtonList>
<br />
Note the different resulting serialized strings. The ones that use type resolvers have an extra __type tag.
<hr />
Results:
<table border="0" cellpadding="0" cellspacing="0" width="100%">
<tr>
<td>
<asp:Label ID="Label1" runat="server" ></asp:Label><br />
</td>
</tr>
</table>
<br />
</div>
</form>
</body>
</html>
|
{
"url": "http://www.asp.net/ajax/documentation/live/ViewSample.aspx?sref=System.Web.Script.Serialization.TypeResolver",
"source_domain": "www.asp.net",
"snapshot_id": "crawl=CC-MAIN-2014-49",
"warc_metadata": {
"Content-Length": "10006",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ISOR7BJXCEAQZWHZHDWLQGRUGE34EWRG",
"WARC-Concurrent-To": "<urn:uuid:4adbe614-55e4-4ee2-8ff9-ff3b5597146d>",
"WARC-Date": "2014-11-28T13:25:50Z",
"WARC-IP-Address": "168.62.43.5",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:FXL4444MQGYADCXARWDAJJTIRAQPQKIL",
"WARC-Record-ID": "<urn:uuid:80b776aa-77b9-4a93-8605-1a8a337e1925>",
"WARC-Target-URI": "http://www.asp.net/ajax/documentation/live/ViewSample.aspx?sref=System.Web.Script.Serialization.TypeResolver",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3389c169-84c1-4220-b282-bdb52d4e6419>"
},
"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,
44,
45,
169,
170,
172,
173,
175,
176,
178,
179,
181,
182,
184,
185,
187,
188,
190,
191,
243,
244,
260,
261,
287,
345,
419,
420,
542,
543,
567,
572,
657,
663,
664,
722,
763,
772,
828,
838,
858,
915,
981,
1004,
1024,
1105,
1171,
1194,
1214,
1295,
1361,
1384,
1394,
1400,
1410,
1411,
1456,
1478,
1512,
1540,
1581,
1618,
1633,
1634,
1675,
1688,
1696,
1703,
1740,
1750,
1807,
1957,
2044,
2143,
2236,
2267,
2282,
2398,
2413,
2430,
2502,
2519,
2540,
2618,
2640,
2658,
2683,
2698,
2719,
2731,
2739
],
"line_end_idx": [
44,
45,
169,
170,
172,
173,
175,
176,
178,
179,
181,
182,
184,
185,
187,
188,
190,
191,
243,
244,
260,
261,
287,
345,
419,
420,
542,
543,
567,
572,
657,
663,
664,
722,
763,
772,
828,
838,
858,
915,
981,
1004,
1024,
1105,
1171,
1194,
1214,
1295,
1361,
1384,
1394,
1400,
1410,
1411,
1456,
1478,
1512,
1540,
1581,
1618,
1633,
1634,
1675,
1688,
1696,
1703,
1740,
1750,
1807,
1957,
2044,
2143,
2236,
2267,
2282,
2398,
2413,
2430,
2502,
2519,
2540,
2618,
2640,
2658,
2683,
2698,
2719,
2731,
2739,
2746
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2746,
"ccnet_original_nlines": 89,
"rps_doc_curly_bracket": 0.0029133299831300974,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.06400000303983688,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03799999877810478,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4819999933242798,
"rps_doc_frac_unique_words": 0.6593406796455383,
"rps_doc_mean_word_length": 9.09890079498291,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0.004000000189989805,
"rps_doc_unigram_entropy": 4.642545223236084,
"rps_doc_word_count": 182,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.023550720885396004,
"rps_doc_frac_chars_top_3gram": 0.0833333283662796,
"rps_doc_frac_chars_top_4gram": 0.06038647145032883,
"rps_doc_books_importance": -272.60577392578125,
"rps_doc_books_importance_length_correction": -272.60577392578125,
"rps_doc_openwebtext_importance": -154.840087890625,
"rps_doc_openwebtext_importance_length_correction": -154.840087890625,
"rps_doc_wikipedia_importance": -92.80870056152344,
"rps_doc_wikipedia_importance_length_correction": -92.80870056152344
},
"fasttext": {
"dclm": 0.794634997844696,
"english": 0.3574749827384949,
"fineweb_edu_approx": 2.1023833751678467,
"eai_general_math": 0.018471600487828255,
"eai_open_web_math": 0.2753247618675232,
"eai_web_code": 0.9859338998794556
}
}
|
{
"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": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,241,190,975,658,065,000 |
Please help contribute to the Reddit categorization project here
InternetIsBeautiful
12,115,927 readers
297 users here now
New to reddit? Click here!
What to post:
• Single purpose websites.
• Top-level domains.
• Web Tools.
• Minimal or beautifully designed websites.
• Awesome websites that offer a unique service.
What NOT to post (detailed explanations can be found here):
Sites that are not unique.
• Aggregators/ collections.
• Something everyone on the internet already knows about (e.g., Netflix, Khan Academy, etc.)
• Something not unique (includes generators, blogs, tumblrs, etc.)
• Web games. Post to /r/webgames instead.
• Articles or videos.
• Static images, gifs, animations that serve the same purpose of gifs or collections of either.
• Sites that serve a political agenda or otherwise induce drama
• Online stores, paid services, or sites which serve only to sell a specific product. Try /r/shutupandtakemymoney instead.
Sites that pose a potential security risk.
• Websites that require a login or email address. Includes Facebook, Google+, or otherwise.
• Websites that require a webcam.
• Extensions, software, or other content which requires a download to use.
Comments
• We enforce a standard of common decency and civility here. Personal attacks, bigotry, fighting words and otherwise shitty behavior will be removed and may result in a ban.
Moderator Discretion
• Beauty is in the eye of the beholder, but we have beheld a lot! This subreddit is highly curated and the moderators frequently must use their discretion and judgement as a team when enforcing our rules.
Click here for our traffic stats.
Something different? Try /r/InternetIsUgly. If you exhibit a similar addictive lust for information as you do for internet, we highly recommend you go give /r/dataisbeautiful a sub too.
If this subreddit for whatever reason fails to provide the interactivity you need, we also highly recommend a look at /r/interactivewebsites for a less diluted dosage of interactivity.
Was your post removed from here? Found a cool site that's not particularly unique or beautiful? Head on over to /r/InternetIsInteresting.
Make it mobile: /r/AndroidIsBeautiful/
Waste even more time: /r/InternetIsUseless
/r/AndroidIsBeautiful
a community for
all 707 comments
Want to say thanks to %(recipient)s for this comment? Give them a month of reddit gold.
Please select a payment method.
[–] jorkk 2638 points ago
Its like when a 10 year old tries to explain something.
[–] kempff 624 points ago
I see what you did there.
[–] BoomChocolateLatkes 451 points ago
I don't. ELI5.
[–] Piroshkpx 711 points ago
He used an analogy to explain the dictionary that describes terms by using analogies.
[–] VoiceofLou 248 points ago * (lasted edited 2 months ago)
Woah.
Edit: man, what the fuck is wrong with you people?
[–] MongrelGilgamesh 216 points ago * (lasted edited 2 months ago)
M E T A E T A
(Did I do it right Reddit?)
[–] ApparentlyPants 122 points ago
No, but that's cool. It's all good. We need to chill out a bit more anyhow.
[–] qrseek 41 points ago * (lasted edited 2 months ago)
tbh i like it better this way
edit: i meant the meme, y'all, not reddit being super anal.
[–] Mewcancraft 33 points ago
Meh, the spacing in the horizontal one could've been better, but it also could've been worse.
Solid 5/7.
[–] JKPanda831 71 points ago
M E T A
E T
T E
A T E M
There. Better?
[–] TheMarimbaGuy 52 points ago
I'm So Meta Even This Acronym
[–] Lunarage 26 points ago
[–] allsey87 5 points ago
Wow! A perfect score!
[–] MongrelGilgamesh 3 points ago
There. Maybe it's now a 10/13?
[–] arlenreyb 23 points ago
But it works. Like, I think I'm a pretty tech savvy guy, but for some reason I just could not understand what the fuck an "API" was until I saw the explanation on this website. And now I absolutely get it.
Also; hah, you're clever.
[–] madzgo 4188 points ago
Best one is for Virus
It’s like an STD. Apologies for the comparison, but a virus is what happens when your computer gets intimate with the internet without taking precautions
[–] romulusnr 590 points ago
Q: What's a virus?
A: It's like a virus.
Q: ohok
[–] uberOptimizer 88 points ago
That really cleared it up
Confusion not the virus
Maybe not confusion either.
[–] Kusibu 607 points ago
Or when the Internet gets intimate with you. Most likely from Russia or China.
[–] Scruffmygruff 569 points ago
If it's a legitimate hack, the cpu has ways to shut the whole thing down
[–] Great_White_Buffalo 183 points ago
If you just close your browsers, they can't get in.
[–] braintrustinc 220 points ago
Caught with my browsers around my ankles again
[–] Lukeskyrunner19 39 points ago
Ugh I hate it when my vag drops down to my ankles
[–] Saul_Firehand 23 points ago
/u/Lukeskyrunner19 you may want to see a doctor.
[–] matpandazz 15 points ago
No you close windows.
[–] mm365886 69 points ago * (lasted edited 2 months ago)
You idiot. Use the incognito mode to hide your computer from everything, from NSA to viruses. They cant trace you if you use it.
[–] __N-S-A__ 20 points ago
Hmmmmmmm.......
[–] NikPs36 67 points ago
I know this a joke and all, but dead serious it doesn't, don't take this as advice and move on. Just sayin'
[–] TheBroJoey 26 points ago
Nice try, NSA.
[–] HannasAnarion 8 points ago
yeah, I'm a little nervous about laughing at this joke, because it's just plausible enough that people who don't know tech might think it's true, and that would be very bad.
[–] mirbachur 23 points ago
The real LPT is in the comments
[–] Iliadius 9 points ago
Nice try, NSA
[–] sblahful 58 points ago
Oh God...this made me laugh way too hard
[–] mooserider2 15 points ago
I mean did you hear what operating system it was running? Windows! You could see everything! Practically begging for it.
[–] Kusibu 31 points ago
Unless the hacker is using CPU-level methods (see Intel's Management Engine).
[–] [deleted] 64 points ago
[deleted]
[–] Kusibu 39 points ago
Well, it's not an inaccurate statement. There are CPU-level protections that guard against well known, "legitimate" exploits.
[–] RockwoodJ 82 points ago
It was meant as a joke about the politician that said raped women could shut down their system or some shit like that. Hence the whoosh.
[–] dalerian 21 points ago
From memory it was meant as a rebuttal to the rape-related arguments for abortion. The guy's claim was that women's bodies shut down things while being raped, so they can't get pregnant. (Scientifically crap, but when has that ever stopped a politician?)
[–] ReubenZWeiner 7 points ago
Like the time when climate change was threatening to tip over Guam.
[–] dalerian 9 points ago
How does something tip over an island? (Assuming you mean tip over like a boat that capsizes.)
[–] Kusibu 5 points ago
That guy played way too much Club Penguin.
[–] Kusibu 115 points ago
Ah. Politics. Fuck politics.
[–] RockwoodJ 48 points ago
That's the spirit!
[–] C-TownBC 35 points ago
That's fine, it has a way of shutting the whole thing down
[–] summonern0x 32 points ago
Yeah, I mean, look at Congress. Obama was barely even starting foreplay and they shut down altogether!
[–] Hit-Enter-Too-Soon 9 points ago
In Russia, internet gets intimate with you!
[–] SQUID_FUCKER 175 points ago
I feel like in 10 years parents are going to be going the other way with the analogy when teaching their kids about sex.
"So Timmy, a condom is like anti-virus software for your computer but for your penis."
[–] Igotfivecats 74 points ago
There's probably some parent out there now talking to their 12 year old kid like this....
[–] gaZthme 38 points ago
Sexed AND internet safety combined. Not bad at all!
[–] diogenes08 22 points ago
I would gladly be sexed while learning Internet safety.
Or learning anything else.
Or doing anything else.
Honestly, I just wish I was sexed.
[–] Dooskinson 19 points ago
So..like..a virus? Huh.
[–] Innitmarvellous 11 points ago
Like a viiiiruuuuus, infecting for the very first tiiiiime
[–] Gothyck 39 points ago
How's that the best one? It's literally in the name. A computer virus is called a virus because it behaves like an actual virus. duh
[–] Just_Dance_Ok 5 points ago
Now that's a way to explain "computer virus" that even my grandmother can understand! That's pretty cool.
[–] Minstral_Meadows 3 points ago
Without protection would have been better imo.
[–] bitter_cynical_angry 3 points ago
Practice safe computer sex: use a firewall.
[–] crylicylon 750 points ago
I feel like this has a lot of potential. Reminds me of a 'clean' Urban Dictionary.
[–] Minstral_Meadows 1187 points ago
Maybe it should be the Suburban Dictionary then.
[–] Juswantedtono 310 points ago
That sounds like a satirical site owned by the Onion. Actually now I'm disappointed that it's not.
[–] alegxab 144 points ago
Suburbandictionary.com redirects to Urban dictionary
[–] twilightassassin 109 points ago
Same with ruraldictionary.com
[–] _breadpool_ 90 points ago
Farmersonly.com
[–] StellarBlitz 61 points ago
City folks just don't get it.
[–] fullmetal_deathnote 60 points ago
wot in tarnation
[–] KayBee10 20 points ago
Reddit needs to come together and make this a thing!
[–] Yorkeworshipper 34 points ago
Wow, I just realized that suburban is sub-urban.
[–] SheepLeaningCurve 21 points ago
Keith Urbans son
[–] Too_Many_Mind_ 14 points ago
Or when there's a big country concert, but Garth Brooks can't make it and backs out last minute, so they sub Urban.
[–] ashesarise 248 points ago
Not a dictionary at all. It is a list of like 30 computing terms with analogies...
[–] jocap 79 points ago
Yeah, none of the terms I entered existed. House, ocean, ghost, even Facebook. Only "river" gave an answer, but the wrong one, explaining what "big data" means. I don't know how they got "big data" from "river".
Edit: heh, I didn't see the list of entries below the search bar. Still not too useful.
[–] bad_luck_charm 66 points ago
It's strictly about technology. It's not a generalized dictionary.
[–] jocap 82 points ago
Yeah, I realized that when I read the "About" section, but the way OP presented it is seemed like a general dictionary.
[–] BoomChocolateLatkes 25 points ago
Maybe they need to do an analogy for user experience.
[–] mattreyu 875 points ago
Shaka, when the walls fell
[–] witofnit 364 points ago
Darmok on Jalad in the ocean.
[–] purple_kushy_pillow 199 points ago
Zima at Anzo! Zima and Bakor!!
[–] SirHerald 115 points ago
Brian, when his luck was bad.
[–] Scruffmygruff 111 points ago
Harambe with the toddler
[–] ishkariot 77 points ago
Reddit, with their dicks out
[–] Ashrod63 40 points ago
Barry Allen with the timeline.
[–] theSchmoozer 14 points ago
Rick Astley, on the ocean of upvotes.
[–] FourthBridge 24 points ago
Harambe, his eyes closed.
[–] DoctorSteve 9 points ago
This is such a great analogy idea but what would it be used for? Someone being killed because they were presumed to be out of control?
[–] Bricka_Bracka 11 points ago
Williams, with Kiko.
[–] gett-itt 29 points ago
You all are awesome! I was like why do I know this? It took me a second at first then it hit me. Thank you for the nostalgia! 🤓😎
[–] spoiler-walterdies 10 points ago
What's going on?
[–] heard_enough_crap 60 points ago
Picard when face palmed.
[–] spoiler-walterdies 16 points ago
I'm /r/OutOfTheLoop ing so hard right now.
[–] [deleted] 85 points ago
[deleted]
[–] WhoNeedsVirgins 9 points ago
I feel like we are close to being that race here on the web.
For some months, I'm contemplating the idea of making a set of flashcards with the current celebrities before I fall completely out of touch with modern culture.
Soon, postmodernism will completely take over.
[–] CatpainTpyos 28 points ago
It's a reference to a specific episode of Star Trek: The Next Generation, called "Darmok." The episode centers around the Enterprise crew making contact with a species of alien that communicates exclusively via folk tales and "memes." The universal translator successfully turns their words into English, but none of it makes any sense to Captain Picard (nor to the audience) because it's all based on metaphors and retelling stories which there's no context for.
This xkcd comic is a parody of the episode, in which Picard and Troi are genre savvy.
[–] xkcd_transcriber 8 points ago
Image
Mobile
Title: Darmok and Jalad
Title-text: I wonder how often Patrick Stewart has Darmok flashbacks when talking to Star Trek fans.
Comic Explanation
Stats: This comic has been referenced 42 times, representing 0.0275% of referenced xkcds.
xkcd.com | xkcd sub | Problems/Bugs? | Statistics | Stop Replying | Delete
[–] MayHaker 6 points ago
In star trek they have universal translators but there was a species that communicated heavily in cultural references, analogies and memes basically
[–] TactfullyAwkward 22 points ago
Kiteo, his eyes closed.
[–] master_jeb 61 points ago
Kinky.
But seriously,
Darmok and Jalad on the ocean.
I'm slightly embarrassed about making that correction, but I am a man of special conscience.
[–] witofnit 22 points ago
Autocorrect or intentional? master_jeb, his eyes closed.
[–] master_jeb 31 points ago
master_jeb, his eyes uncovered. Temba, his arms wide, /r/greatestgen.
[–] JitGoinHam 23 points ago
You really Shaka-when-the-walls-fell'd that quote, buddy.
[–] SrslyCmmon 9 points ago
On the ocean. They sailed away not drowned.
[–] DHC2099 6 points ago
Temba, his arms wide!
[–] pimp_skitters 4 points ago
His arms wide!
[–] Maccaisgod 46 points ago
That episode is what makes star trek TNG so brilliant. It's amazing
[–] P-01S 21 points ago
It's a bit of a mess from a linguistics standpoint, but it's also kind of awesome from a linguistics standpoint?
[–] [deleted] 22 points ago * (lasted edited a month ago)
[deleted]
[–] P-01S 10 points ago
Important rule of Star Trek: Ignore the technobabble.
[–] random_fucktuation 17 points ago
Nonsense. I've built a career on making sure I ALWAYS double, triple and quadruple check the polarity of the gravimetric field distortion compensator. When one takes into account that solving for the Heisenberg constant usually involves some or other references to either the work of Cochrane or Zhukov or both, then it's easy to admit defeat. Ultimately, if in doubt, just emit an inverse tachyon pulse from the deflector and you're probably good to go. At least, from the perspective of the field of contemporary engineering ethics (G. La Forge, Engineering ethics: was I right or was I wrong; a retrospective. , University of San Francisco Press, 2397, p47) it was certainly always acceptable to use a more obtuse solution than either an economical or conservative one.
Bottom line: Eject the warp core.
[–] jedimaster4007 33 points ago
Tamok! The river Tamok. In winter!
[–] Eventually_Shredded 21 points ago
Temba! His arms wide!
[–] hawkfalcon 33 points ago
For those who haven't seen it, this is a reference to a Star Trek The Next Generation episode where they encounter a race of beings whose language is solely based upon analogies.
[–] WhoNeedsVirgins 20 points ago
a race of beings whose language is solely based upon analogies
Aka memesters, on reddit.
[–] ScienceShawn 7 points ago
Moms spaghetti at the swamps of degobah.
[–] PepsiColaRapist 3 points ago
Can you explain this again but in nothing but analogies?
[–] KaiserTom 18 points ago
Actually, what the aliens used in that episode were a series of metaphors, of literal memes. An analogy (ha!) would be like saying to another "Bad Luck Brian" when a crappy situation occurs to someone. Or saying "MacBeth" in a situation of betrayal. Those things are gibberish to an outside culture unless they know the actual story behind either.
Darmok and Jaled at Tanagra is a story about someone named Darmok and someone named Jaled at a place called Tanagra, which obviously doesn't mean anything to us unless we first know the underlying story behind it.
[–] pizzahedron 222 points ago * (lasted edited 2 months ago)
does this use flash? i'm just seeing white.
edit: or perhaps doesn't work on touchscreens? works on my desktop, which has basically the same settings as my laptop, but no touchscreen.
[–] allywilson 99 points ago
I got it working by disabling uBlock Origin in Chrome. Well, I got it working right up until I tried to make a suggestion for a definition, then it went back to nothing.
[–] donttellmybossmyname 26 points ago
Can confirm, had to disable origin before the page loaded. Might have something to do with where the host is coming from.
Either way, site is ad-free (for now)
[–] war_is_terrible_mkay 10 points ago
Can confirm, disabling uBlock Origin on Firefox also makes it work. Might also be some tracking element maybe?
[–] Azzu 11 points ago
The developer of the site requires Google Analytics inside his own code without checking if it even exists.
If you use uBlock, Google Analytics will be blocked.
Here is a userscript to mock Google Analytics so the site works even without turning uBlock off.(Source)
[–] crylicylon 14 points ago
Thanks, I've personally been noticing a lot of false positives with uBlock Origin in Chrome lately.
[–] Azzu 7 points ago
It's not a false-positive, though. The site uses Google Analytics and uBlock blocks that.
The problem is the developer of the site who for some reason uses Google Analytics in his own code, without checking if it has been loaded. The missing dependency raises an exception which aborts execution and causes the whole site to not load.
[–] thevoiceofzeke 20 points ago
Ad-blockers block the google analytics scripts and whoever made the site apparently didn't do much testing lol.
[–] justajunior 14 points ago
Either that, or the dev is ingenious in figuring out how to make the site non-functional for people with ad block.
[–] pizzahedron 3 points ago
that's curious, it works just fine with chrome and ABP on right now.
[–] thevoiceofzeke 6 points ago
I should have specified: uBlock blocks GA scripts. I don't know about ABP.
[–] billwoo 7 points ago
Same, on Chrome. I see "Sideways Dictonary" in the bottom left, and "Login About" in bottom right and that is it.
[–] daddyfinger61 23 points ago
It's like going to a party, and it looks like no one's there, because your sunglasses block UV and for some reason all the lights are blacklights.
[–] sonic_tower 4 points ago
Me too, it seems to be broken.
[–] Azzu 3 points ago * (lasted edited 2 months ago)
The developer of the site requires Google Analytics inside his own code without checking if it even exists.
If you use uBlock, Google Analytics will be blocked.
Here is a userscript to mock Google Analytics so the site works even without turning uBlock off.(Source)
[–] boringusername7 63 points ago
it is a nice idea but currently lacking enough definitions to be truly useful. Hopefully with this marketing on Reddit it will get more people creating accounts and adding analogies.
[–] peteslespaul 23 points ago
It seems like all of the entries are tech related
[–] bad_luck_charm 47 points ago
Sideways dictionary — it's like a dictionary, but using analogies instead of definitions. Use it as a tool for finding and sharing helpful analogies to explain technology. Because if everyone understands technology better, we can make technology work better for everyone.
They Are.
[–] war_is_terrible_mkay 5 points ago
I would like if it had more freedom in it (like Wikipedia), not for some company using community's collective labor for whatever. The other day i felt very grateful for having some freedom-nuts start Wiki-projects. Compare WP to this (ads on or off).
[–] [deleted] 117 points ago
[deleted]
[–] joev714 51 points ago
And Jigsaw which is an Alphabet (read: Google) subsidiary
[–] thirdegree 24 points ago
Is it really? TIL.
[–] joev714 27 points ago
Yup! It's a big reason why most of the definitions are technology-related
[–] searchcandy 62 points ago
Wow, that really iPods my printer drivers.
[–] joev714 20 points ago
Not using Zunes in 2017
[–] elementgermanium 7 points ago
I.e. Everyone
[–] i_had_an_apostrophe 4 points ago
I'm not sure whether that answers my question. Do you mean to say that The Washington Post will create all of the entries themselves? Or will they open it up to wiki-style editing?
[–] joev714 7 points ago
You submit an analogy for a term, and it gets voted on
[–] thirdegree 3 points ago
I'm not sure either tbh!
[–] covabishop 312 points ago * (lasted edited 2 months ago)
I really like the idea, but it comes down to people's illustrative ability. Making good analogies and illustrations, especially for some technical concepts, can be difficult. Look at the first listed definition for Tor:
It’s like an onion. Tor stands for The Onion Router because it uses layer upon layer of protection to maximize anonymity. And trying to hack into it makes you cry.
I'd argue this is an okay high level understanding of Tor, but anything beyond that is kind of poor. I get this project is supposed to be a high level sort of thing, but depending on the subject and the way it's explained, it can actually confuse the true definition for anyone that wants to explore further.
But maybe once the best definitions are voted to the top, it'll be better - who knows? Still a really neat idea
Edit: for Tor, I'd personally compare it to a privacy curtain.
[–] draculamilktoast 111 points ago * (lasted edited 2 months ago)
It's more like sending an envelope to somebody and when they open it there's another envelope inside that they send onwards. That envelope also contains an envelope and so on until a certain amount of envelopes have been passed around. This is why it's like an onion that you peel to get to more of the envelopes. Also the adresses are scrambled so that only the current recipient is even able to read the adress. The final envelope has the content which is also scrabled. This makes it very hard to know who sent the original letter unless you control many of the people passing the letters around.
[–] IAMA_Draconequus-AMA 27 points ago
HPMOR had a method of literally passing messages like this. It was probably inspired by Tor.
[–] covabishop 12 points ago
Right, but it's the passing around and multiple sends that provides the "onion"-like behavior of Tor; the point I'm getting at is it isn't so much multiple layers of protection so much as it is multiple layers of indirection
[–] drewgolas 6 points ago
Oh that's much better than the onion one
edited for clarity
[–] MongrelGilgamesh 60 points ago
Congratulations Reddit: we crashed a web application. Again.
[–] chbay 13 points ago
Yeah it don't work no more
[–] cliopoopsalot 21 points ago
The site was down due to capacity issues. The perfect analogy for making the front page on reddit.
[–] BrainPulper2 19 points ago
Way to go Reddit, the website just threw me a 403 server capacity error. We killed it.
[–] Existential_Fluff 67 points ago
I think we hugged it to hard again...
[–] jwbartel6 11 points ago
Am I the only one who can't access this site?
[–] irlfriendsknowoldacc 15 points ago
We hugged it.
[–] AetherMcLoud 11 points ago
Sideways Dictionary: Like a thesaurus, but wordier.
[–] TernaryEmotion 11 points ago
Dang, hugged to death.
[–] Ardub23 32 points ago
Big Data — "It’s like mapping a new world. At ground level, as you hack your way through the undergrowth and scramble across ravines, you might struggle to build up a clear picture. But with the right tool (a hot air balloon), you can see the whole landscape and identify patterns, like the contours of a mountain or meandering flow of a river."
This tells me nothing whatsoever. Like, there's no information on how big data relates to any of this. There's not even any hint of it. You might as well say "You know how when you're driving downtown and your car starts making a funny noise? You need to stop the car and take a look at the engine to find out what's causing it. And while you're doing that, it might start raining, and you'll be late for work for the second time this week, and you still haven't gotten around to getting the radio fixed. That's how cellular automata work."
[–] rbcornhole 14 points ago * (lasted edited 2 months ago)
This obviously isn't intended for complex, in-depth explanations.
And the one you quoted works fairly well. It's just saying "sometimes when you look at specific things it's hard to see what they mean, but when you take a step back and look at the whole picture you can see how it all fits together"
While your example is just pure nonsense.
[–] Ardub23 5 points ago
Complex, in-depth explanations are one thing. The one I quoted gave no explanation at all. So unless you already know what big data is, it makes as much sense as the one I made up.
[–] AnosmiaStinks_ithink 9 points ago
Reddit Hug of Death takes yet another victim
[–] etcetera_etcetera 8 points ago
And yep, Reddit hugged it to death
[–] wendyjreichert 8 points ago
Aaaaand now the site is down. Congratulations Reddit, we broke it!
[–] MegaZeus101 19 points ago
Reddit hugged
[–] Nihilisticky 7 points ago
Did we DDOS it? wont load.
[–] Matthew_BpBuds 7 points ago
It doesn't load anymore.
WE DID IT REDDIT!
[–] mac2861 8 points ago
Andddddd the site got its reddit hug.
[–] Lliam_Bubbleguts 7 points ago
Reddit crashed this poor site
[–] Papitoooo 7 points ago
Hugged
[–] peteostler 8 points ago
We broke it...
[–] CrazybyRX 7 points ago
This site has been given the reddit hug of death... RIP in pieces.
[–] Erythroy 5 points ago
Hugged it to death.
[–] Raven2002 5 points ago
Yet another victim of the infamous reddit hug of death
[–] likeomgitznich 5 points ago
Some of the analogies make no sense
[–] Xeypax 5 points ago
Did we crash it? It's very slow.
[–] hooooooooyeah 5 points ago
It's just a plain white screen with the name in the bottom. Is it down?
[–] Cakefleet 5 points ago
RIP Reddit hug of death.
[–] SwagikarpUsedSplash 4 points ago
And of course, it crashes when it gets posted to reddit
[–] WheatlyFTW 4 points ago
Well we crashed it.
[–] ribrocks 4 points ago
We Riddit!
[–] robophile-ta 3 points ago
Hugged to death.
[–] 4huggies 4 points ago
Did we crash the website?
[–] f0xtrawt 7 points ago
This website wasn't ready for reddit.
[–] RayKam 5 points ago
I think we destroyed the link
[–] Jman88s 4 points ago
The site is down, because of high capacity.
/r/wediditreddit
[–] OxD15EA5E 4 points ago
Good guy Reddit, taking sites down on a daily basis.
[–] Rojo424 3 points ago
I think the server got reddit hugged too hard. It's down for me, lol.
[–] dapa4 7 points ago
I saw a lot of similes and no analogies. 1/10.
[–] SatchBoogie1 7 points ago
Service Temporarily Unavailable
[–] eqleriq 6 points ago
some of these are AWFUL ... a white hat is like a bounty hunter? No.
[–] Titaniumspyborgbear 6 points ago
Great job guys, we crashed the site.
[–] DarkBlaze99 3 points ago
Sneaky title, op.
[–] fantzpantz 3 points ago
we broke it
|
{
"url": "https://js4.red/r/InternetIsBeautiful/comments/60hqi7/sideways_dictionary_like_a_dictionary_but_using/",
"source_domain": "js4.red",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "699415",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2CZF5ZN7THE5MDZRIMOUD7LGC7TCBBFP",
"WARC-Concurrent-To": "<urn:uuid:3189de37-1c19-4a4d-b951-f01575eb8b1e>",
"WARC-Date": "2017-05-29T09:24:28Z",
"WARC-IP-Address": "104.28.17.167",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Z6WLEFBPPUHSVDCCGKQ6473LHCMNDN5V",
"WARC-Record-ID": "<urn:uuid:9c672430-73e0-4a95-b40f-eb57077ac112>",
"WARC-Target-URI": "https://js4.red/r/InternetIsBeautiful/comments/60hqi7/sideways_dictionary_like_a_dictionary_but_using/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a3ddf4f2-89b6-4117-982c-1bf5843f45d2>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-224-210.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-22\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for May 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
69,
70,
94,
95,
118,
119,
142,
143,
174,
175,
193,
194,
225,
226,
251,
252,
269,
270,
318,
319,
371,
372,
373,
437,
438,
469,
470,
502,
503,
600,
601,
672,
673,
719,
720,
746,
747,
847,
848,
916,
917,
1044,
1045,
1092,
1093,
1189,
1190,
1228,
1229,
1308,
1309,
1310,
1323,
1324,
1502,
1503,
1528,
1529,
1738,
1739,
1777,
1778,
1779,
1969,
1970,
2159,
2160,
2302,
2303,
2346,
2347,
2394,
2395,
2396,
2422,
2442,
2463,
2464,
2556,
2557,
2593,
2594,
2624,
2625,
2685,
2686,
2716,
2717,
2747,
2748,
2791,
2792,
2811,
2812,
2845,
2846,
2936,
2937,
3002,
3003,
3013,
3014,
3069,
3070,
3141,
3142,
3160,
3161,
3193,
3194,
3233,
3234,
3314,
3315,
3375,
3376,
3410,
3411,
3475,
3476,
3510,
3511,
3609,
3610,
3625,
3626,
3659,
3660,
3672,
3673,
3681,
3682,
3690,
3691,
3703,
3704,
3723,
3724,
3760,
3761,
3795,
3796,
3827,
3828,
3858,
3859,
3885,
3886,
3924,
3925,
3960,
3961,
3993,
3994,
4204,
4205,
4235,
4236,
4267,
4268,
4294,
4295,
4453,
4454,
4487,
4488,
4511,
4512,
4538,
4539,
4551,
4552,
4588,
4589,
4619,
4620,
4648,
4649,
4681,
4682,
4712,
4713,
4796,
4797,
4834,
4835,
4912,
4913,
4956,
4957,
5013,
5014,
5051,
5052,
5103,
5104,
5142,
5143,
5197,
5198,
5234,
5235,
5288,
5289,
5322,
5323,
5349,
5350,
5412,
5413,
5546,
5547,
5579,
5580,
5600,
5601,
5631,
5632,
5744,
5745,
5778,
5779,
5798,
5799,
5834,
5835,
6013,
6014,
6046,
6047,
6083,
6084,
6114,
6115,
6133,
6134,
6165,
6166,
6211,
6212,
6246,
6247,
6372,
6373,
6402,
6403,
6485,
6486,
6518,
6519,
6533,
6534,
6563,
6564,
6694,
6695,
6727,
6728,
6869,
6870,
6901,
6902,
7161,
7162,
7197,
7198,
7270,
7271,
7301,
7302,
7401,
7402,
7430,
7431,
7478,
7479,
7509,
7510,
7543,
7544,
7576,
7577,
7600,
7601,
7632,
7633,
7696,
7697,
7731,
7732,
7839,
7840,
7880,
7881,
7929,
7930,
7966,
7967,
8092,
8093,
8184,
8185,
8220,
8221,
8315,
8316,
8346,
8347,
8403,
8404,
8437,
8438,
8498,
8499,
8530,
8531,
8559,
8560,
8599,
8600,
8633,
8634,
8662,
8663,
8701,
8702,
8765,
8766,
8796,
8797,
8934,
8935,
8970,
8971,
9081,
9082,
9120,
9121,
9172,
9173,
9215,
9216,
9264,
9265,
9299,
9300,
9387,
9388,
9429,
9430,
9483,
9484,
9521,
9522,
9625,
9626,
9657,
9658,
9715,
9716,
9756,
9757,
9791,
9792,
9826,
9827,
9847,
9848,
9883,
9884,
9918,
9919,
9961,
9962,
9983,
9984,
10015,
10016,
10073,
10074,
10112,
10113,
10166,
10167,
10207,
10208,
10229,
10230,
10267,
10268,
10388,
10389,
10423,
10424,
10511,
10512,
10540,
10541,
10757,
10758,
10850,
10851,
10888,
10889,
10960,
10961,
10989,
10990,
11114,
11115,
11157,
11158,
11216,
11217,
11249,
11250,
11281,
11282,
11314,
11315,
11349,
11350,
11393,
11394,
11429,
11430,
11463,
11464,
11498,
11499,
11536,
11537,
11566,
11567,
11599,
11600,
11633,
11634,
11665,
11666,
11701,
11702,
11737,
11738,
11780,
11781,
11816,
11817,
11847,
11848,
11881,
11882,
12021,
12022,
12058,
12059,
12084,
12085,
12116,
12117,
12250,
12251,
12292,
12293,
12314,
12315,
12355,
12356,
12385,
12386,
12427,
12428,
12475,
12476,
12508,
12509,
12523,
12524,
12561,
12562,
12627,
12628,
12794,
12795,
12846,
12847,
12882,
12883,
13351,
13352,
13442,
13443,
13481,
13482,
13492,
13493,
13504,
13505,
13533,
13534,
13639,
13640,
13662,
13663,
13757,
13758,
13759,
13838,
13839,
13869,
13870,
14023,
14024,
14063,
14064,
14092,
14093,
14126,
14127,
14138,
14139,
14158,
14159,
14194,
14195,
14292,
14293,
14324,
14325,
14386,
14387,
14420,
14421,
14495,
14496,
14529,
14530,
14592,
14593,
14625,
14626,
14674,
14675,
14704,
14705,
14731,
14732,
14767,
14768,
14787,
14788,
14821,
14822,
14894,
14895,
14923,
14924,
15041,
15042,
15104,
15105,
15119,
15120,
15148,
15149,
15207,
15208,
15249,
15250,
16027,
16028,
16066,
16067,
16104,
16105,
16144,
16145,
16187,
16188,
16214,
16215,
16248,
16249,
16432,
16433,
16471,
16472,
16539,
16540,
16570,
16571,
16605,
16606,
16651,
16652,
16689,
16690,
16751,
16752,
16784,
16785,
17137,
17138,
17356,
17357,
17423,
17424,
17472,
17473,
17617,
17618,
17651,
17652,
17826,
17827,
17870,
17871,
17997,
17998,
18040,
18041,
18084,
18085,
18200,
18201,
18228,
18229,
18341,
18342,
18399,
18400,
18509,
18510,
18543,
18544,
18648,
18649,
18675,
18676,
18770,
18771,
19020,
19021,
19058,
19059,
19175,
19176,
19210,
19211,
19330,
19331,
19364,
19365,
19438,
19439,
19475,
19476,
19555,
19556,
19585,
19586,
19704,
19705,
19741,
19742,
19893,
19894,
19927,
19928,
19963,
19964,
20021,
20022,
20134,
20135,
20192,
20193,
20302,
20303,
20341,
20342,
20529,
20530,
20565,
20566,
20620,
20621,
20658,
20659,
20935,
20936,
20950,
20951,
20993,
20994,
21249,
21250,
21283,
21284,
21298,
21299,
21329,
21330,
21392,
21393,
21426,
21427,
21450,
21451,
21481,
21482,
21560,
21561,
21595,
21596,
21643,
21644,
21674,
21675,
21703,
21704,
21742,
21743,
21761,
21762,
21803,
21804,
21989,
21990,
22019,
22020,
22079,
22080,
22112,
22113,
22142,
22143,
22208,
22209,
22433,
22434,
22602,
22603,
22916,
22917,
23033,
23034,
23101,
23102,
23173,
23174,
23778,
23779,
23822,
23823,
23920,
23921,
23954,
23955,
24185,
24186,
24217,
24218,
24263,
24264,
24287,
24288,
24327,
24328,
24393,
24394,
24422,
24423,
24454,
24455,
24491,
24492,
24595,
24596,
24631,
24632,
24723,
24724,
24764,
24765,
24807,
24808,
24840,
24841,
24891,
24892,
24935,
24936,
24954,
24955,
24990,
24991,
25047,
25048,
25085,
25086,
25113,
25114,
25144,
25145,
25495,
25496,
26041,
26042,
26106,
26107,
26177,
26178,
26416,
26417,
26463,
26464,
26493,
26494,
26679,
26680,
26722,
26723,
26772,
26773,
26812,
26813,
26852,
26853,
26889,
26890,
26961,
26962,
26996,
26997,
27015,
27016,
27050,
27051,
27082,
27083,
27119,
27120,
27149,
27171,
27172,
27201,
27202,
27244,
27245,
27283,
27284,
27318,
27319,
27350,
27351,
27362,
27363,
27395,
27396,
27415,
27416,
27447,
27448,
27519,
27520,
27550,
27551,
27575,
27576,
27607,
27608,
27667,
27668,
27704,
27705,
27745,
27746,
27774,
27775,
27812,
27813,
27848,
27849,
27925,
27926,
27957,
27958,
27987,
27988,
28029,
28030,
28090,
28091,
28123,
28124,
28148,
28149,
28179,
28180,
28195,
28196,
28230,
28231,
28252,
28253,
28283,
28284,
28314,
28315,
28345,
28346,
28388,
28389,
28417,
28418,
28452,
28453,
28482,
28483,
28531,
28532,
28553,
28554,
28585,
28586,
28643,
28644,
28673,
28674,
28748,
28749,
28776,
28777,
28828,
28829,
28863,
28864,
28900,
28901,
28930,
28931,
29004,
29005,
29046,
29047,
29088,
29089,
29122,
29123,
29145,
29146,
29178,
29179
],
"line_end_idx": [
69,
70,
94,
95,
118,
119,
142,
143,
174,
175,
193,
194,
225,
226,
251,
252,
269,
270,
318,
319,
371,
372,
373,
437,
438,
469,
470,
502,
503,
600,
601,
672,
673,
719,
720,
746,
747,
847,
848,
916,
917,
1044,
1045,
1092,
1093,
1189,
1190,
1228,
1229,
1308,
1309,
1310,
1323,
1324,
1502,
1503,
1528,
1529,
1738,
1739,
1777,
1778,
1779,
1969,
1970,
2159,
2160,
2302,
2303,
2346,
2347,
2394,
2395,
2396,
2422,
2442,
2463,
2464,
2556,
2557,
2593,
2594,
2624,
2625,
2685,
2686,
2716,
2717,
2747,
2748,
2791,
2792,
2811,
2812,
2845,
2846,
2936,
2937,
3002,
3003,
3013,
3014,
3069,
3070,
3141,
3142,
3160,
3161,
3193,
3194,
3233,
3234,
3314,
3315,
3375,
3376,
3410,
3411,
3475,
3476,
3510,
3511,
3609,
3610,
3625,
3626,
3659,
3660,
3672,
3673,
3681,
3682,
3690,
3691,
3703,
3704,
3723,
3724,
3760,
3761,
3795,
3796,
3827,
3828,
3858,
3859,
3885,
3886,
3924,
3925,
3960,
3961,
3993,
3994,
4204,
4205,
4235,
4236,
4267,
4268,
4294,
4295,
4453,
4454,
4487,
4488,
4511,
4512,
4538,
4539,
4551,
4552,
4588,
4589,
4619,
4620,
4648,
4649,
4681,
4682,
4712,
4713,
4796,
4797,
4834,
4835,
4912,
4913,
4956,
4957,
5013,
5014,
5051,
5052,
5103,
5104,
5142,
5143,
5197,
5198,
5234,
5235,
5288,
5289,
5322,
5323,
5349,
5350,
5412,
5413,
5546,
5547,
5579,
5580,
5600,
5601,
5631,
5632,
5744,
5745,
5778,
5779,
5798,
5799,
5834,
5835,
6013,
6014,
6046,
6047,
6083,
6084,
6114,
6115,
6133,
6134,
6165,
6166,
6211,
6212,
6246,
6247,
6372,
6373,
6402,
6403,
6485,
6486,
6518,
6519,
6533,
6534,
6563,
6564,
6694,
6695,
6727,
6728,
6869,
6870,
6901,
6902,
7161,
7162,
7197,
7198,
7270,
7271,
7301,
7302,
7401,
7402,
7430,
7431,
7478,
7479,
7509,
7510,
7543,
7544,
7576,
7577,
7600,
7601,
7632,
7633,
7696,
7697,
7731,
7732,
7839,
7840,
7880,
7881,
7929,
7930,
7966,
7967,
8092,
8093,
8184,
8185,
8220,
8221,
8315,
8316,
8346,
8347,
8403,
8404,
8437,
8438,
8498,
8499,
8530,
8531,
8559,
8560,
8599,
8600,
8633,
8634,
8662,
8663,
8701,
8702,
8765,
8766,
8796,
8797,
8934,
8935,
8970,
8971,
9081,
9082,
9120,
9121,
9172,
9173,
9215,
9216,
9264,
9265,
9299,
9300,
9387,
9388,
9429,
9430,
9483,
9484,
9521,
9522,
9625,
9626,
9657,
9658,
9715,
9716,
9756,
9757,
9791,
9792,
9826,
9827,
9847,
9848,
9883,
9884,
9918,
9919,
9961,
9962,
9983,
9984,
10015,
10016,
10073,
10074,
10112,
10113,
10166,
10167,
10207,
10208,
10229,
10230,
10267,
10268,
10388,
10389,
10423,
10424,
10511,
10512,
10540,
10541,
10757,
10758,
10850,
10851,
10888,
10889,
10960,
10961,
10989,
10990,
11114,
11115,
11157,
11158,
11216,
11217,
11249,
11250,
11281,
11282,
11314,
11315,
11349,
11350,
11393,
11394,
11429,
11430,
11463,
11464,
11498,
11499,
11536,
11537,
11566,
11567,
11599,
11600,
11633,
11634,
11665,
11666,
11701,
11702,
11737,
11738,
11780,
11781,
11816,
11817,
11847,
11848,
11881,
11882,
12021,
12022,
12058,
12059,
12084,
12085,
12116,
12117,
12250,
12251,
12292,
12293,
12314,
12315,
12355,
12356,
12385,
12386,
12427,
12428,
12475,
12476,
12508,
12509,
12523,
12524,
12561,
12562,
12627,
12628,
12794,
12795,
12846,
12847,
12882,
12883,
13351,
13352,
13442,
13443,
13481,
13482,
13492,
13493,
13504,
13505,
13533,
13534,
13639,
13640,
13662,
13663,
13757,
13758,
13759,
13838,
13839,
13869,
13870,
14023,
14024,
14063,
14064,
14092,
14093,
14126,
14127,
14138,
14139,
14158,
14159,
14194,
14195,
14292,
14293,
14324,
14325,
14386,
14387,
14420,
14421,
14495,
14496,
14529,
14530,
14592,
14593,
14625,
14626,
14674,
14675,
14704,
14705,
14731,
14732,
14767,
14768,
14787,
14788,
14821,
14822,
14894,
14895,
14923,
14924,
15041,
15042,
15104,
15105,
15119,
15120,
15148,
15149,
15207,
15208,
15249,
15250,
16027,
16028,
16066,
16067,
16104,
16105,
16144,
16145,
16187,
16188,
16214,
16215,
16248,
16249,
16432,
16433,
16471,
16472,
16539,
16540,
16570,
16571,
16605,
16606,
16651,
16652,
16689,
16690,
16751,
16752,
16784,
16785,
17137,
17138,
17356,
17357,
17423,
17424,
17472,
17473,
17617,
17618,
17651,
17652,
17826,
17827,
17870,
17871,
17997,
17998,
18040,
18041,
18084,
18085,
18200,
18201,
18228,
18229,
18341,
18342,
18399,
18400,
18509,
18510,
18543,
18544,
18648,
18649,
18675,
18676,
18770,
18771,
19020,
19021,
19058,
19059,
19175,
19176,
19210,
19211,
19330,
19331,
19364,
19365,
19438,
19439,
19475,
19476,
19555,
19556,
19585,
19586,
19704,
19705,
19741,
19742,
19893,
19894,
19927,
19928,
19963,
19964,
20021,
20022,
20134,
20135,
20192,
20193,
20302,
20303,
20341,
20342,
20529,
20530,
20565,
20566,
20620,
20621,
20658,
20659,
20935,
20936,
20950,
20951,
20993,
20994,
21249,
21250,
21283,
21284,
21298,
21299,
21329,
21330,
21392,
21393,
21426,
21427,
21450,
21451,
21481,
21482,
21560,
21561,
21595,
21596,
21643,
21644,
21674,
21675,
21703,
21704,
21742,
21743,
21761,
21762,
21803,
21804,
21989,
21990,
22019,
22020,
22079,
22080,
22112,
22113,
22142,
22143,
22208,
22209,
22433,
22434,
22602,
22603,
22916,
22917,
23033,
23034,
23101,
23102,
23173,
23174,
23778,
23779,
23822,
23823,
23920,
23921,
23954,
23955,
24185,
24186,
24217,
24218,
24263,
24264,
24287,
24288,
24327,
24328,
24393,
24394,
24422,
24423,
24454,
24455,
24491,
24492,
24595,
24596,
24631,
24632,
24723,
24724,
24764,
24765,
24807,
24808,
24840,
24841,
24891,
24892,
24935,
24936,
24954,
24955,
24990,
24991,
25047,
25048,
25085,
25086,
25113,
25114,
25144,
25145,
25495,
25496,
26041,
26042,
26106,
26107,
26177,
26178,
26416,
26417,
26463,
26464,
26493,
26494,
26679,
26680,
26722,
26723,
26772,
26773,
26812,
26813,
26852,
26853,
26889,
26890,
26961,
26962,
26996,
26997,
27015,
27016,
27050,
27051,
27082,
27083,
27119,
27120,
27149,
27171,
27172,
27201,
27202,
27244,
27245,
27283,
27284,
27318,
27319,
27350,
27351,
27362,
27363,
27395,
27396,
27415,
27416,
27447,
27448,
27519,
27520,
27550,
27551,
27575,
27576,
27607,
27608,
27667,
27668,
27704,
27705,
27745,
27746,
27774,
27775,
27812,
27813,
27848,
27849,
27925,
27926,
27957,
27958,
27987,
27988,
28029,
28030,
28090,
28091,
28123,
28124,
28148,
28149,
28179,
28180,
28195,
28196,
28230,
28231,
28252,
28253,
28283,
28284,
28314,
28315,
28345,
28346,
28388,
28389,
28417,
28418,
28452,
28453,
28482,
28483,
28531,
28532,
28553,
28554,
28585,
28586,
28643,
28644,
28673,
28674,
28748,
28749,
28776,
28777,
28828,
28829,
28863,
28864,
28900,
28901,
28930,
28931,
29004,
29005,
29046,
29047,
29088,
29089,
29122,
29123,
29145,
29146,
29178,
29179,
29194
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 29194,
"ccnet_original_nlines": 954,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 10,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3399641513824463,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02275986038148403,
"rps_doc_frac_lines_end_with_ellipsis": 0.00523559981957078,
"rps_doc_frac_no_alph_words": 0.22293907403945923,
"rps_doc_frac_unique_words": 0.31145402789115906,
"rps_doc_mean_word_length": 4.542707920074463,
"rps_doc_num_sentences": 341,
"rps_doc_symbol_to_word_ratio": 0.0016129000578075647,
"rps_doc_unigram_entropy": 6.0731201171875,
"rps_doc_word_count": 4601,
"rps_doc_frac_chars_dupe_10grams": 0.026027459651231766,
"rps_doc_frac_chars_dupe_5grams": 0.07152768224477768,
"rps_doc_frac_chars_dupe_6grams": 0.04573943838477135,
"rps_doc_frac_chars_dupe_7grams": 0.043825648725032806,
"rps_doc_frac_chars_dupe_8grams": 0.026027459651231766,
"rps_doc_frac_chars_dupe_9grams": 0.026027459651231766,
"rps_doc_frac_chars_top_2gram": 0.08310607075691223,
"rps_doc_frac_chars_top_3gram": 0.007176689803600311,
"rps_doc_frac_chars_top_4gram": 0.01004736963659525,
"rps_doc_books_importance": -1846.7830810546875,
"rps_doc_books_importance_length_correction": -1846.7830810546875,
"rps_doc_openwebtext_importance": -1381.1605224609375,
"rps_doc_openwebtext_importance_length_correction": -1381.1605224609375,
"rps_doc_wikipedia_importance": -1147.0562744140625,
"rps_doc_wikipedia_importance_length_correction": -1147.0562744140625
},
"fasttext": {
"dclm": 0.12247086316347122,
"english": 0.9239482283592224,
"fineweb_edu_approx": 1.0911366939544678,
"eai_general_math": 0.4969956874847412,
"eai_open_web_math": 0.15226656198501587,
"eai_web_code": 0.0015209299745038152
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.01",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "302.22",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social psychology"
}
}
},
"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": "5",
"label": "Comment Section"
},
"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": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,638,203,329,447,369,000 |
Some test text!
Loading...
Guides
Read & write a PDF file from/to memory buffer in Ruby
More languages
More languages
Java (Android)
C++
C#
C# (.NET Core)
Go
Java
Kotlin
Obj-C
JS (Node.js)
PHP
Python
Ruby
Swift
C# (UWP)
VB
C# (Xamarin)
Sample Ruby code for using PDFTron SDK to read/write a PDF document from/to memory buffer. This is useful for applications that work with dynamic PDFdocuments that don't need to be saved/read from a disk. Learn more about our Ruby PDF Library.
Get Started Samples Download
To run this sample, get started with a free trial of PDFTron SDK.
#---------------------------------------------------------------------------------------
# Copyright (c) 2001-2021 by PDFTron Systems Inc. All Rights Reserved.
# Consult LICENSE.txt regarding license information.
#---------------------------------------------------------------------------------------
require '../../../PDFNetC/Lib/PDFNetRuby'
include PDFNetRuby
require '../../LicenseKey/RUBY/LicenseKey'
$stdout.sync = true
# The following sample illustrates how to read/write a PDF document from/to
# a memory buffer. This is useful for applications that work with dynamic PDF
# documents that don't need to be saved/read from a disk.
PDFNet.Initialize(PDFTronLicense.Key)
# Relative path to the folder containing the test files.
input_path = "../../TestFiles/"
output_path = "../../TestFiles/Output/"
# Read a PDF document in a memory buffer.
file = MappedFile.new((input_path + "tiger.pdf"))
file_sz = file.FileSize
file_reader = FilterReader.new(file)
mem = file_reader.Read(file_sz)
doc = PDFDoc.new(mem, file_sz)
doc.InitSecurityHandler
num_pages = doc.GetPageCount
writer = ElementWriter.new
reader = ElementReader.new
element = Element.new
# Create a duplicate of every page but copy only path objects
i = 1
while i <= num_pages do
itr = doc.GetPageIterator(2*i - 1)
reader.Begin(itr.Current)
new_page = doc.PageCreate(itr.Current.GetMediaBox)
next_page = itr
next_page.Next
doc.PageInsert(next_page, new_page)
writer.Begin(new_page)
element = reader.Next
while !element.nil? do # Read page contents
#if element.GetType == Element::E_path
writer.WriteElement(element)
#end
element = reader.Next
end
writer.End
reader.End
i = i + 1
end
doc.Save(output_path + "doc_memory_edit.pdf", SDFDoc::E_remove_unused)
# Save the document to a memory buffer
buffer = doc.Save(SDFDoc::E_remove_unused)
# Write the contents of the buffer to the disk
File.open(output_path + "doc_memory_edit.txt", 'w') { |file| file.write(buffer) }
# Read some data from the file stored in memory
reader.Begin(doc.GetPage(1))
element = reader.Next
while !element.nil? do
if element.GetType == Element::E_path
print "Path, "
end
element = reader.Next
end
reader.End
PDFNet.Terminate
puts "\n\nDone. Result saved in doc_memory_edit.pdf and doc_memory_edit.txt ..."
|
{
"url": "https://www.pdftron.com/documentation/samples/rb/PDFDocMemoryTest/",
"source_domain": "www.pdftron.com",
"snapshot_id": "crawl=CC-MAIN-2021-39",
"warc_metadata": {
"Content-Length": "274533",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2MHVKC73H4QM74FWMUQ6PHPPJGP6FKJH",
"WARC-Concurrent-To": "<urn:uuid:15344540-4b1b-4dfc-9912-3c55c595a1dc>",
"WARC-Date": "2021-09-17T03:10:16Z",
"WARC-IP-Address": "18.236.14.6",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QRYZVV4QILVMCUSZXOSUUHUAA7OFZ2SQ",
"WARC-Record-ID": "<urn:uuid:8e40acf0-5c6a-4947-8d33-ab365ed2d508>",
"WARC-Target-URI": "https://www.pdftron.com/documentation/samples/rb/PDFDocMemoryTest/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e8bdfcf8-bf69-4f91-9f31-574daca6c6d8>"
},
"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-248\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,
16,
17,
28,
35,
36,
90,
91,
106,
107,
122,
137,
141,
144,
159,
162,
167,
174,
180,
193,
197,
204,
209,
215,
224,
227,
240,
241,
485,
486,
515,
516,
582,
583,
672,
743,
796,
885,
886,
928,
947,
990,
991,
1011,
1012,
1089,
1168,
1226,
1227,
1266,
1268,
1326,
1359,
1400,
1402,
1445,
1496,
1521,
1523,
1561,
1563,
1596,
1628,
1653,
1683,
1685,
1713,
1741,
1764,
1766,
1829,
1831,
1838,
1863,
1900,
1903,
1931,
1984,
2002,
2019,
2057,
2060,
2085,
2109,
2155,
2197,
2238,
2246,
2271,
2277,
2290,
2308,
2320,
2325,
2327,
2399,
2401,
2441,
2485,
2487,
2535,
2621,
2623,
2672,
2702,
2725,
2749,
2789,
2807,
2813,
2837,
2842,
2854,
2872
],
"line_end_idx": [
16,
17,
28,
35,
36,
90,
91,
106,
107,
122,
137,
141,
144,
159,
162,
167,
174,
180,
193,
197,
204,
209,
215,
224,
227,
240,
241,
485,
486,
515,
516,
582,
583,
672,
743,
796,
885,
886,
928,
947,
990,
991,
1011,
1012,
1089,
1168,
1226,
1227,
1266,
1268,
1326,
1359,
1400,
1402,
1445,
1496,
1521,
1523,
1561,
1563,
1596,
1628,
1653,
1683,
1685,
1713,
1741,
1764,
1766,
1829,
1831,
1838,
1863,
1900,
1903,
1931,
1984,
2002,
2019,
2057,
2060,
2085,
2109,
2155,
2197,
2238,
2246,
2271,
2277,
2290,
2308,
2320,
2325,
2327,
2399,
2401,
2441,
2485,
2487,
2535,
2621,
2623,
2672,
2702,
2725,
2749,
2789,
2807,
2813,
2837,
2842,
2854,
2872,
2953
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2953,
"ccnet_original_nlines": 113,
"rps_doc_curly_bracket": 0.0006772800115868449,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1625615805387497,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03448275849223137,
"rps_doc_frac_lines_end_with_ellipsis": 0.008771929889917374,
"rps_doc_frac_no_alph_words": 0.35960590839385986,
"rps_doc_frac_unique_words": 0.5580645203590393,
"rps_doc_mean_word_length": 6.412903308868408,
"rps_doc_num_sentences": 72,
"rps_doc_symbol_to_word_ratio": 0.03612478822469711,
"rps_doc_unigram_entropy": 4.909217834472656,
"rps_doc_word_count": 310,
"rps_doc_frac_chars_dupe_10grams": 0.0583501011133194,
"rps_doc_frac_chars_dupe_5grams": 0.1559356153011322,
"rps_doc_frac_chars_dupe_6grams": 0.12173037976026535,
"rps_doc_frac_chars_dupe_7grams": 0.09255532920360565,
"rps_doc_frac_chars_dupe_8grams": 0.09255532920360565,
"rps_doc_frac_chars_dupe_9grams": 0.09255532920360565,
"rps_doc_frac_chars_top_2gram": 0.03018108941614628,
"rps_doc_frac_chars_top_3gram": 0.01810864917933941,
"rps_doc_frac_chars_top_4gram": 0.015090540051460266,
"rps_doc_books_importance": -243.8897705078125,
"rps_doc_books_importance_length_correction": -243.8897705078125,
"rps_doc_openwebtext_importance": -155.10472106933594,
"rps_doc_openwebtext_importance_length_correction": -155.10472106933594,
"rps_doc_wikipedia_importance": -152.0657196044922,
"rps_doc_wikipedia_importance_length_correction": -152.0657196044922
},
"fasttext": {
"dclm": 0.6270118355751038,
"english": 0.5513976216316223,
"fineweb_edu_approx": 3.1884405612945557,
"eai_general_math": 0.8984224200248718,
"eai_open_web_math": 0.22904956340789795,
"eai_web_code": 0.8290570378303528
}
}
|
{
"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.05",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,269,539,473,646,356,500 |
{{announcement.body}}
{{announcement.title}}
Hibernate Example
DZone 's Guide to
Hibernate Example
In this oldie-but-goodie tutorial, you will see how to persist Java objects using the Hibernate Object/Relational Mapping (ORM) framework.
· Database Zone ·
Free Resource
In this tutorial, you will see how to persist the Java objects using the Hibernate Object/Relational Mapping (ORM) framework. Hibernate automates ORM and considerably reduces the number of lines of code needed to persist the object in the database. This example demonstrates how to automatically generate code from the object/relational mapping file, thus saving the developers time. This helps the developers focus on the business problem rather than doing repetitive coding work.
Hibernate uses an XML document or the properties file to define the object/relational mapping. The object/relational mapping file contains the mapping between the Java object and the corresponding database table. This example illustrates how to create the ORM using the XML document.
First, let's set up the environment. I am using
• Eclipse IDE 3.4
• Hibernate Core 3.3
• Hibernate Tools 3.2
• HSQLDB 1.8
You can download the Hibernate Core and Hibernate Tools here. HyperSQL DataBase is a 100% lightweight Java SQL Database Engine. You can download HSQLDB from this site http://hsqldb.org/.
To install the Hibernate Tools, extract the HibernateTools-3.X.zip file and move all the files inside the features folder into the features folder of the eclipse installation directory and move all the files inside the plugins folder into the plugins folder of the eclipse installation directory. Restart the eclipse.
First, create a new Java project. Add the following lib files on the java build path.
antlr-2.7.6
commons-collections-3.1
dom4j-1.6.1
hibernate3
hsqldb
javassist-3.4.GA
jta-1.1
slf4j-api-1.5.6
slf4j-simple-1.5.6
The hibernate3.jar contains all the core hibernate files. The hsqldb.jar is used to connect with the HSQL database. If you are using some other database, then you need to include that jar file instead of this. The slf4j-api-1.5.6 jar file is used for logging the information. You can also use other alternatives like log4j, to do that include that jar file instead of slf4j-simple-1.5.6 jar file to your classpath.
Once you have installed the hibernate tools, you will have the option to change to Hibernate prespective. Go to Window -> Open Prespective -> Other, the following dialog box appears, select Hibernate and click the Ok button.
Now let's see how to define the object/relational mapping using the XML document. This document has an hbm.xml extension. We will now create the object/relational mapping for the simple class that holds course-related details. To do that, create a package com.vaannila.course in the src directory. The Hibernate XML mapping file will be created in this directory. To create the mapping file, switch to Hibernate prespective, right-click the project folder, and select New -> Hibernate XML Mapping File(hbm.xml)
In the pop-up window, select the course folder, enter the file name as Course.hbm.xml, and click Next. In the next window, click Finish.
Add the following code to the Course.hbm.xml file.
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE hibernate-configuration PUBLIC
"-//Hibernate/Hibernate Configuration DTD 3.0//EN"
"http://hibernate.sourceforge.net/ hibernate-configuration-3.0.dtd">
<hibernate-configuration>
<session-factory>
<property name="hibernate.connection.driver_class"> org.hsqldb.jdbcDriver</property>
<property name="hibernate.connection.url"> jdbc:hsqldb:hsql://localhost</property>
<property name="hibernate.connection.username">sa</property>
<property name="connection.password"></property>
<property name="connection.pool_size">1</property>
<property name="hibernate.dialect"> org.hibernate.dialect.HSQLDialect</property>
<property name="show_sql">true</property>
<property name="hbm2ddl.auto">create</property>
<mapping resource="com/vaannila/course/Course.hbm.xml"/>
</session-factory>
</hibernate-configuration>
The hibernate-mapping element is the root element. The class element is used to map the Java class with the database table. The Java class name is specified using the name attribute of the class element and the database table name is specified using the table attribute of the class element. The meta element is used to create the class description. The id element is used to create the primary key. The name attribute of the id element refers to the property in the Course class and the column attribute refers to the column in the COURSES table.
The type attribute holds the hibernate mapping type, and this mapping type will convert from Java to SQL data type and vice versa. The generator element within the id element is used to automatically generate the primary key values. When the class attribute of the generator element is set to native, hibernate picks either identity, sequence, or hilo algorithm depending upon the capabilities of the underlying database. The property element is used to link a property in the Java class to a column in the database table.
The next step is to create the Hibernate configuration file. On startup, Hibernate looks for a file called hibernate.cfg.xml in the root of the classpath. To create the Hibernate Configuration File, right-click the project and select New -> Hibernate Configuration File (cfg.xml)
By default, the file name will be hibernate.cfg.xml. Select the src directory and click Next.
Select the database dialect as HSQL. This property indicates the particular SQL variant that Hibernate generates. Select the "org.hsqldb.jdbcDriver" option for the driver class. Enter the connection URL "jdbc:hsqldb:hsql://localhost". Enter the user name as "sa" and click Finish. These properties specify the necessary configuration for the JDBC connection.
The show_sql option, if set to true, will display all the executed SQL queries on the console.
The property hbm2ddl.auto, if set to create, will drop and re-create the database schema on startup.
In the end, we add the Course.hbm.xml file to the configuration. The implementation of the hibernate.cfg.xml file is shown below.
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE hibernate-configuration PUBLIC
"-//Hibernate/Hibernate Configuration DTD 3.0//EN"
"http://hibernate.sourceforge.net/ hibernate-configuration-3.0.dtd">
<hibernate-configuration>
<session-factory>
<property name="hibernate.connection.driver_class"> org.hsqldb.jdbcDriver</property>
<property name="hibernate.connection.url"> jdbc:hsqldb:hsql://localhost</property>
<property name="hibernate.connection.username">sa</property>
<property name="connection.password"></property>
<property name="connection.pool_size">1</property>
<property name="hibernate.dialect"> org.hibernate.dialect.HSQLDialect</property>
<property name="show_sql">true</property>
<property name="hbm2ddl.auto">create</property>
<mapping resource="com/vaannila/course/Course.hbm.xml"/>
</session-factory>
</hibernate-configuration>
Once the Hibernate configuration file is created, we need to create a Hibernate console configuration. To do this, right-click the project folder and select New -> Hibernate Console Configuration.
The Hibernate Console configuration wizard appears.
By default, the wizard will load the Hibernate configuration file information. Just click the Finish button to create the Hibernate console configuration.
Once the Hibernate console configuration is created, you can generate code by selecting the Hibernate Code Generation Configurations option form the toolbar.
The Hibernate Code Generation wizard will be displayed. Now select the output directory as the src directory.
In the Exporters tag, select the "Use Java 5 Syntax" option and "Domain Code(.java)" option.
In the Refresh tab, select the options as shown below and click the Run button to generate the code.
The following Course.java class will be generated from the Course.hbm.xml mapping file.
package com.vaannila.course;
// Generated May 30, 2009 6:49:31 AM by Hibernate Tools 3.2.4.GA
/**
* This class contains the course details.
*
*/
public class Course implements java.io.Serializable {
private long courseId;
private String courseName;
public Course() {
}
public Course(String courseName) {
this.courseName = courseName;
}
public long getCourseId() {
return this.courseId;
}
public void setCourseId(long courseId) {
this.courseId = courseId;
}
public String getCourseName() {
return this.courseName;
}
public void setCourseName(String courseName) {
this.courseName = courseName;
}
}
Now create the HibernateUtil class. The HibernateUtil class helps in creating the SessionFactory from the Hibernate configuration file. The SessionFactory is threadsafe, so it is not necessary to obtain one for each thread. Here the static singleton pattern is used to instantiate the SessionFactory. The implementation of the HibernateUtil class is shown below.
package com.vaannila.util;
import org.hibernate.SessionFactory;
import org.hibernate.cfg.Configuration;
public class HibernateUtil {
private static final SessionFactory sessionFactory;
static {
try {
sessionFactory = new Configuration().configure()
.buildSessionFactory();
} catch (Throwable ex) {
System.err.println("Initial SessionFactory creation failed." + ex);
throw new ExceptionInInitializerError(ex);
}
}
public static SessionFactory getSessionFactory() {
return sessionFactory;
}
}
Now we will create a class with the main() method to run the application.
package com.vaannila.course;
import java.util.List;
import java.util.Iterator;
import org.hibernate.HibernateException;
import org.hibernate.Session;
import org.hibernate.Transaction;
import com.vaannila.util.HibernateUtil;
public class Main {
public static void main(String[] args) {
Main obj = new Main();
Long courseId1 = obj.saveCourse("Physics");
Long courseId2 = obj.saveCourse("Chemistry");
Long courseId3 = obj.saveCourse("Maths");
obj.listCourse();
obj.updateCourse(courseId3, "Mathematics");
obj.deleteCourse(courseId2);
obj.listCourse();
}
public Long saveCourse(String courseName)
{
Session session = HibernateUtil.getSessionFactory().openSession();
Transaction transaction = null;
Long courseId = null;
try {
transaction = session.beginTransaction();
Course course = new Course();
course.setCourseName(courseName);
courseId = (Long) session.save(course);
transaction.commit();
} catch (HibernateException e) {
transaction.rollback();
e.printStackTrace();
} finally {
session.close();
}
return courseId;
}
public void listCourse()
{
Session session = HibernateUtil.getSessionFactory().openSession();
Transaction transaction = null;
try {
transaction = session.beginTransaction();
List courses = session.createQuery("from Course").list();
for (Iterator iterator = courses.iterator(); iterator.hasNext();)
{
Course course = (Course) iterator.next();
System.out.println(course.getCourseName());
}
transaction.commit();
} catch (HibernateException e) {
transaction.rollback();
e.printStackTrace();
} finally {
session.close();
}
}
public void updateCourse(Long courseId, String courseName)
{
Session session = HibernateUtil.getSessionFactory().openSession();
Transaction transaction = null;
try {
transaction = session.beginTransaction();
Course course = (Course) session.get(Course.class, courseId);
course.setCourseName(courseName);
transaction.commit();
} catch (HibernateException e) {
transaction.rollback();
e.printStackTrace();
} finally {
session.close();
}
}
public void deleteCourse(Long courseId)
{
Session session = HibernateUtil.getSessionFactory().openSession();
Transaction transaction = null;
try {
transaction = session.beginTransaction();
Course course = (Course) session.get(Course.class, courseId);
session.delete(course);
transaction.commit();
} catch (HibernateException e) {
transaction.rollback();
e.printStackTrace();
} finally {
session.close();
}
}
}
The first call to the openSession() method begins the session. The session.beginTransaction() method is used to start a new transaction. Here, we have four different methods to perform CRUD operations.
The saveCourse() method is used to save a new Course object to the database. In the saveCourse() method, a new object of the Course class is created and the courseName value is set. The courseId value is auto-generated so the value needn't be set here. The session.save() method is used to persist the value in the database, and once the value is saved, the id value (Primary key) is returned. Here, the courseId value is of type long, so we typecast the returned value to Long. Once the object is saved, the transaction is committed. If any exception occurs, then the transaction is rolledback. The transaction ends either through commit or rollback action. Once the transaction ends, the session is closed.
The listCourse() method is used to list all the courses. The session.createQuery() method is used to create a query object, which helps in retrieving the persistent objects. Here, we use Hibernate Query Language (HQL). "from Course" returns a list of all the courses in the COURSES table. Note that in the HQL, we only specify the Java class names and not the table names. Later, using the for loop, we iterate the list of courses and display them on the console.
The updateCourse() method is used to update the course name. It takes the courseId and the new courseName as input parameters. The courseId is used to retrieve the actual course object using the session.get() method. The session.get() method takes the class name and the id value as the input parameter and returns the corresponding Object.
Here, we set the new course name to the Course object and commit the transaction. We need not explicitly call the session.save() method to persist the object. Hibernate will automatically update the database when the state of the persistant object is modified inside a transaction. This feature of Hibernate is called automatic dirty checking.
The deleteCourse() method is used to delete a Course object. This method is similar to the updateCourse() method. Here, instead of updating the object, we call the session.delete() method to delete a persistent object.
The figure below shows the final directory structure of the example.
To run the example, first start the HSQLDB server. To start the HSQLDB server, run the command prompt, go to the hsqldb directory, and execute the following command.
java -cp ./lib/hsqldb.jar org.hsqldb.Server
After starting the server, run the Main class. Upon startup, the database schema will be created and the following actions will happen.
public static void main(String[] args) {
Main obj = new Main();
Long courseId1 = obj.saveCourse("Physics");
Long courseId2 = obj.saveCourse("Chemistry");
Long courseId3 = obj.saveCourse("Maths");
obj.listCourse();
obj.updateCourse(courseId3, "Mathematics");
obj.deleteCourse(courseId2);
obj.listCourse();
}
Each time on startup, the database schema will be dropped and recreated. If you want to use the existing one, change the value of hbm2ddl.auto option to update.
The SQL statement generated gets displayed on the console. This is set using the show_sql option in the hibernate configuration file.
Hibernate: insert into COURSES (COURSE_ID, COURSE_NAME) values (null, ?)
Hibernate: call identity()
Hibernate: insert into COURSES (COURSE_ID, COURSE_NAME) values (null, ?)
Hibernate: call identity()
Hibernate: insert into COURSES (COURSE_ID, COURSE_NAME) values (null, ?)
Hibernate: call identity()
Hibernate: select course0_.COURSE_ID as COURSE1_0_, course0_.COURSE_NAME as COURSE2_0_ from COURSES course0_
Physics
Chemistry
Maths
Hibernate: select course0_.COURSE_ID as COURSE1_0_0_, course0_.COURSE_NAME as COURSE2_0_0_ from COURSES course0_ where course0_.COURSE_ID=?
Hibernate: update COURSES set COURSE_NAME=? where COURSE_ID=?
Hibernate: select course0_.COURSE_ID as COURSE1_0_0_, course0_.COURSE_NAME as COURSE2_0_0_ from COURSES course0_ where course0_.COURSE_ID=?
Hibernate: delete from COURSES where COURSE_ID=?
Hibernate: select course0_.COURSE_ID as COURSE1_0_, course0_.COURSE_NAME as COURSE2_0_ from COURSES course0_
Physics
Mathematics
Now let's check whether the database schema is created and the data is inserted into the COURSES table or not. Open a new command prompt, go to the hsqldb installed directory, and type the following command.
java -cp ./lib/hsqldb.jar org.hsqldb.util.DatabaseManager
The following dialog box pops up. Select the Type as "HSQL Database Engine Server" and click Ok.
The HSQL Database Manager window opens. Here, you can enter the following SQL statement and see that the data is successfully stored in the COURSES table.
To shut down the HSQLDB properly, enter "shutdown" and click the Execute button. Alternatively, you can also shut down programmatically by closing the SessionFactory using HibernateUtil.getSessionFactory().close() method.
Originally published on 6/14/12
Topics:
sql ,hibernate ,ant ,database ,tutorial ,orm framework ,hibernate tutorial
Opinions expressed by DZone contributors are their own.
{{ parent.title || parent.header.title}}
{{ parent.tldr }}
{{ parent.urlSource.name }}
|
{
"url": "https://dzone.com/tutorials/hibernate-tutorial-java?fromrel=true",
"source_domain": "dzone.com",
"snapshot_id": "crawl=CC-MAIN-2020-16",
"warc_metadata": {
"Content-Length": "169354",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OK3OO2MDU6T5TMFMJ7GRPJCZIX7GF4SB",
"WARC-Concurrent-To": "<urn:uuid:f36602d8-598b-4ebd-857a-318cd7853298>",
"WARC-Date": "2020-04-07T15:14:18Z",
"WARC-IP-Address": "34.227.232.230",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WZHPPM3K7XXGBIB4RSMNRPGLP6ULAZ7N",
"WARC-Record-ID": "<urn:uuid:e991ca3b-27b5-4a45-810f-424f7c521065>",
"WARC-Target-URI": "https://dzone.com/tutorials/hibernate-tutorial-java?fromrel=true",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:929a0f9a-d131-472d-9211-d6e3b413c0cf>"
},
"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-154.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,
22,
45,
46,
64,
65,
83,
84,
102,
103,
242,
243,
261,
275,
276,
758,
759,
1043,
1044,
1092,
1093,
1113,
1136,
1160,
1175,
1176,
1363,
1364,
1682,
1683,
1769,
1770,
1782,
1806,
1818,
1829,
1836,
1853,
1861,
1877,
1896,
1897,
2312,
2313,
2538,
2539,
3050,
3051,
3188,
3189,
3240,
3241,
3280,
3321,
3372,
3441,
3467,
3489,
3582,
3673,
3742,
3799,
3858,
3947,
3997,
4053,
4118,
4141,
4168,
4169,
4717,
4718,
5241,
5242,
5522,
5523,
5617,
5618,
5977,
5978,
6073,
6074,
6175,
6176,
6306,
6307,
6346,
6387,
6438,
6507,
6533,
6555,
6648,
6739,
6808,
6865,
6924,
7013,
7063,
7119,
7184,
7207,
7234,
7235,
7432,
7433,
7485,
7486,
7641,
7642,
7800,
7801,
7911,
7912,
8005,
8006,
8107,
8108,
8196,
8197,
8226,
8227,
8292,
8293,
8297,
8339,
8342,
8345,
8399,
8400,
8427,
8458,
8459,
8481,
8487,
8488,
8527,
8561,
8567,
8568,
8600,
8626,
8632,
8633,
8678,
8712,
8718,
8719,
8755,
8787,
8793,
8794,
8845,
8883,
8889,
8890,
8892,
8893,
9256,
9257,
9284,
9285,
9322,
9362,
9363,
9392,
9444,
9453,
9459,
9508,
9532,
9557,
9625,
9668,
9670,
9672,
9673,
9724,
9747,
9749,
9751,
9752,
9826,
9827,
9856,
9857,
9880,
9907,
9908,
9949,
9979,
10013,
10014,
10054,
10055,
10075,
10076,
10117,
10140,
10184,
10230,
10272,
10290,
10334,
10363,
10381,
10383,
10384,
10426,
10428,
10495,
10527,
10549,
10555,
10597,
10627,
10661,
10701,
10723,
10756,
10780,
10801,
10813,
10830,
10832,
10849,
10851,
10852,
10877,
10879,
10946,
10978,
10984,
11026,
11084,
11150,
11152,
11194,
11238,
11240,
11262,
11295,
11319,
11340,
11352,
11369,
11371,
11373,
11374,
11433,
11435,
11502,
11534,
11540,
11582,
11644,
11678,
11700,
11733,
11757,
11778,
11790,
11807,
11809,
11811,
11812,
11852,
11854,
11921,
11953,
11959,
12001,
12063,
12087,
12109,
12142,
12166,
12187,
12199,
12216,
12218,
12220,
12222,
12223,
12425,
12426,
13135,
13136,
13600,
13601,
13942,
13943,
14287,
14288,
14507,
14508,
14577,
14578,
14744,
14745,
14789,
14790,
14926,
14927,
14968,
14995,
15043,
15093,
15139,
15161,
15209,
15242,
15264,
15266,
15267,
15428,
15429,
15563,
15564,
15637,
15664,
15737,
15764,
15837,
15864,
15973,
15981,
15991,
15997,
16137,
16199,
16339,
16388,
16497,
16505,
16517,
16518,
16726,
16727,
16785,
16786,
16883,
16884,
17039,
17040,
17262,
17263,
17295,
17296,
17304,
17379,
17380,
17436,
17437,
17478,
17479,
17497,
17498
],
"line_end_idx": [
22,
45,
46,
64,
65,
83,
84,
102,
103,
242,
243,
261,
275,
276,
758,
759,
1043,
1044,
1092,
1093,
1113,
1136,
1160,
1175,
1176,
1363,
1364,
1682,
1683,
1769,
1770,
1782,
1806,
1818,
1829,
1836,
1853,
1861,
1877,
1896,
1897,
2312,
2313,
2538,
2539,
3050,
3051,
3188,
3189,
3240,
3241,
3280,
3321,
3372,
3441,
3467,
3489,
3582,
3673,
3742,
3799,
3858,
3947,
3997,
4053,
4118,
4141,
4168,
4169,
4717,
4718,
5241,
5242,
5522,
5523,
5617,
5618,
5977,
5978,
6073,
6074,
6175,
6176,
6306,
6307,
6346,
6387,
6438,
6507,
6533,
6555,
6648,
6739,
6808,
6865,
6924,
7013,
7063,
7119,
7184,
7207,
7234,
7235,
7432,
7433,
7485,
7486,
7641,
7642,
7800,
7801,
7911,
7912,
8005,
8006,
8107,
8108,
8196,
8197,
8226,
8227,
8292,
8293,
8297,
8339,
8342,
8345,
8399,
8400,
8427,
8458,
8459,
8481,
8487,
8488,
8527,
8561,
8567,
8568,
8600,
8626,
8632,
8633,
8678,
8712,
8718,
8719,
8755,
8787,
8793,
8794,
8845,
8883,
8889,
8890,
8892,
8893,
9256,
9257,
9284,
9285,
9322,
9362,
9363,
9392,
9444,
9453,
9459,
9508,
9532,
9557,
9625,
9668,
9670,
9672,
9673,
9724,
9747,
9749,
9751,
9752,
9826,
9827,
9856,
9857,
9880,
9907,
9908,
9949,
9979,
10013,
10014,
10054,
10055,
10075,
10076,
10117,
10140,
10184,
10230,
10272,
10290,
10334,
10363,
10381,
10383,
10384,
10426,
10428,
10495,
10527,
10549,
10555,
10597,
10627,
10661,
10701,
10723,
10756,
10780,
10801,
10813,
10830,
10832,
10849,
10851,
10852,
10877,
10879,
10946,
10978,
10984,
11026,
11084,
11150,
11152,
11194,
11238,
11240,
11262,
11295,
11319,
11340,
11352,
11369,
11371,
11373,
11374,
11433,
11435,
11502,
11534,
11540,
11582,
11644,
11678,
11700,
11733,
11757,
11778,
11790,
11807,
11809,
11811,
11812,
11852,
11854,
11921,
11953,
11959,
12001,
12063,
12087,
12109,
12142,
12166,
12187,
12199,
12216,
12218,
12220,
12222,
12223,
12425,
12426,
13135,
13136,
13600,
13601,
13942,
13943,
14287,
14288,
14507,
14508,
14577,
14578,
14744,
14745,
14789,
14790,
14926,
14927,
14968,
14995,
15043,
15093,
15139,
15161,
15209,
15242,
15264,
15266,
15267,
15428,
15429,
15563,
15564,
15637,
15664,
15737,
15764,
15837,
15864,
15973,
15981,
15991,
15997,
16137,
16199,
16339,
16388,
16497,
16505,
16517,
16518,
16726,
16727,
16785,
16786,
16883,
16884,
17039,
17040,
17262,
17263,
17295,
17296,
17304,
17379,
17380,
17436,
17437,
17478,
17479,
17497,
17498,
17525
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 17525,
"ccnet_original_nlines": 357,
"rps_doc_curly_bracket": 0.004793149884790182,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.22915469110012054,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024439329281449318,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.30247268080711365,
"rps_doc_frac_unique_words": 0.2611163556575775,
"rps_doc_mean_word_length": 6.429990768432617,
"rps_doc_num_sentences": 360,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.355106830596924,
"rps_doc_word_count": 2114,
"rps_doc_frac_chars_dupe_10grams": 0.21768556535243988,
"rps_doc_frac_chars_dupe_5grams": 0.3264180123806,
"rps_doc_frac_chars_dupe_6grams": 0.31236666440963745,
"rps_doc_frac_chars_dupe_7grams": 0.27234604954719543,
"rps_doc_frac_chars_dupe_8grams": 0.2565290927886963,
"rps_doc_frac_chars_dupe_9grams": 0.23563599586486816,
"rps_doc_frac_chars_top_2gram": 0.01589052937924862,
"rps_doc_frac_chars_top_3gram": 0.008828070014715195,
"rps_doc_frac_chars_top_4gram": 0.007209590170532465,
"rps_doc_books_importance": -1336.92822265625,
"rps_doc_books_importance_length_correction": -1336.92822265625,
"rps_doc_openwebtext_importance": -895.8892211914062,
"rps_doc_openwebtext_importance_length_correction": -895.8892211914062,
"rps_doc_wikipedia_importance": -719.0457153320312,
"rps_doc_wikipedia_importance_length_correction": -719.0457153320312
},
"fasttext": {
"dclm": 0.4408280849456787,
"english": 0.6437287330627441,
"fineweb_edu_approx": 3.1472413539886475,
"eai_general_math": 0.8248806595802307,
"eai_open_web_math": 0.10717087984085083,
"eai_web_code": 0.9487902522087097
}
}
|
{
"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.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": "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
|
-6,628,027,750,308,603,000 |
How to compare 3 numbers in pascal?
by noemi_sporer , in category: Other , 2 years ago
How to compare 3 numbers in pascal?
Facebook Twitter LinkedIn Telegram Whatsapp
2 answers
Member
by consuelo , a year ago
@noemi_sporer
To compare 3 numbers in Pascal, you can use the following steps:
1. Declare the 3 variables to store the numbers.For example:var a, b, c: Integer;
2. Read the values of the numbers from the user.For example:Write('Enter the first number: '); Readln(a); Write('Enter the second number: '); Readln(b); Write('Enter the third number: '); Readln(c);
3. Compare the numbers using the "if" statement and the comparison operators (<, >, =, <=, >=, <>).For example:if (a > b) and (a > c) then Write(a, ' is the largest number.') else if (b > a) and (b > c) then Write(b, ' is the largest number.') else if (c > a) and (c > b) then Write(c, ' is the largest number.') else Write('The numbers are equal.');
4. You can modify the comparison logic as per your requirements.For example, if you want to find the smallest number, you can change the if condition to use the less than operator (<) instead of the greater than operator (>).if (a < b) and (a < c) then Write(a, ' is the smallest number.') else if (b < a) and (b < c) then Write(b, ' is the smallest number.') else if (c < a) and (c < b) then Write(c, ' is the smallest number.') else Write('The numbers are equal.');
by lina.brakus , 9 months ago
@noemi_sporer
Here is an example code that compares three numbers in Pascal:
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
program CompareNumbers;
var
a, b, c: Integer;
begin
Write('Enter the first number: ');
Readln(a);
Write('Enter the second number: ');
Readln(b);
Write('Enter the third number: ');
Readln(c);
if (a > b) and (a > c) then
Write(a, ' is the largest number.')
else if (b > a) and (b > c) then
Write(b, ' is the largest number.')
else if (c > a) and (c > b) then
Write(c, ' is the largest number.')
else
Write('The numbers are equal.');
WriteLn(); // Add a line break
if (a < b) and (a < c) then
Write(a, ' is the smallest number.')
else if (b < a) and (b < c) then
Write(b, ' is the smallest number.')
else if (c < a) and (c < b) then
Write(c, ' is the smallest number.')
else
Write('The numbers are equal.');
ReadLn(); // Wait for user input before closing the program
end.
In the above code, we first declare three variables a, b, and c to store the numbers. We then read the values of these numbers from the user.
Next, we use the if statement with the comparison operators to compare the numbers and determine the largest and smallest numbers. If a number is greater than both the other numbers, it is considered the largest number. If a number is smaller than both the other numbers, it is considered the smallest number.
Finally, we display the results using the Write procedure. Note that we also added line breaks (WriteLn) for better readability.
You can run the above code and enter three numbers to see the comparison results.
|
{
"url": "https://devhubby.com/thread/how-to-compare-3-numbers-in-pascal",
"source_domain": "devhubby.com",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "131818",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LQYKTSHLEPKEZEE7URVAEJP67QF77PUT",
"WARC-Concurrent-To": "<urn:uuid:9f8b8763-ddd5-4ee0-9132-4da31f5b405d>",
"WARC-Date": "2024-09-18T19:23:28Z",
"WARC-IP-Address": "104.26.12.222",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2Z6LZEFRALOE6CUOI6RWYLQVB74BLVPM",
"WARC-Record-ID": "<urn:uuid:ed3446bc-f4cc-4c92-8203-0c8547a9659f>",
"WARC-Target-URI": "https://devhubby.com/thread/how-to-compare-3-numbers-in-pascal",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ee1b63a3-b93b-4327-8c15-46aa77bc277c>"
},
"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,
36,
37,
88,
89,
125,
126,
170,
171,
181,
182,
189,
190,
215,
216,
233,
234,
299,
300,
384,
585,
938,
1408,
1409,
1439,
1440,
1457,
1458,
1521,
1522,
1525,
1528,
1531,
1534,
1537,
1540,
1543,
1546,
1549,
1552,
1555,
1558,
1561,
1564,
1567,
1570,
1573,
1576,
1579,
1582,
1585,
1588,
1591,
1594,
1597,
1600,
1603,
1606,
1609,
1612,
1615,
1618,
1621,
1624,
1627,
1651,
1655,
1675,
1681,
1718,
1731,
1732,
1770,
1783,
1784,
1821,
1834,
1835,
1865,
1905,
1940,
1980,
2015,
2055,
2062,
2099,
2100,
2134,
2135,
2165,
2206,
2241,
2282,
2317,
2358,
2365,
2402,
2403,
2466,
2471,
2472,
2473,
2615,
2616,
2617,
2927,
2928,
2929,
3058,
3059,
3060
],
"line_end_idx": [
36,
37,
88,
89,
125,
126,
170,
171,
181,
182,
189,
190,
215,
216,
233,
234,
299,
300,
384,
585,
938,
1408,
1409,
1439,
1440,
1457,
1458,
1521,
1522,
1525,
1528,
1531,
1534,
1537,
1540,
1543,
1546,
1549,
1552,
1555,
1558,
1561,
1564,
1567,
1570,
1573,
1576,
1579,
1582,
1585,
1588,
1591,
1594,
1597,
1600,
1603,
1606,
1609,
1612,
1615,
1618,
1621,
1624,
1627,
1651,
1655,
1675,
1681,
1718,
1731,
1732,
1770,
1783,
1784,
1821,
1834,
1835,
1865,
1905,
1940,
1980,
2015,
2055,
2062,
2099,
2100,
2134,
2135,
2165,
2206,
2241,
2282,
2317,
2358,
2365,
2402,
2403,
2466,
2471,
2472,
2473,
2615,
2616,
2617,
2927,
2928,
2929,
3058,
3059,
3060,
3141
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3141,
"ccnet_original_nlines": 110,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3719433844089508,
"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.35006433725357056,
"rps_doc_frac_unique_words": 0.32625484466552734,
"rps_doc_mean_word_length": 4.140926837921143,
"rps_doc_num_sentences": 37,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.415397644042969,
"rps_doc_word_count": 518,
"rps_doc_frac_chars_dupe_10grams": 0.3524475395679474,
"rps_doc_frac_chars_dupe_5grams": 0.42750582098960876,
"rps_doc_frac_chars_dupe_6grams": 0.42750582098960876,
"rps_doc_frac_chars_dupe_7grams": 0.41585081815719604,
"rps_doc_frac_chars_dupe_8grams": 0.3897435963153839,
"rps_doc_frac_chars_dupe_9grams": 0.3897435963153839,
"rps_doc_frac_chars_top_2gram": 0.027972029522061348,
"rps_doc_frac_chars_top_3gram": 0.0447552390396595,
"rps_doc_frac_chars_top_4gram": 0.0503496490418911,
"rps_doc_books_importance": -459.052734375,
"rps_doc_books_importance_length_correction": -459.052734375,
"rps_doc_openwebtext_importance": -223.63540649414062,
"rps_doc_openwebtext_importance_length_correction": -223.63540649414062,
"rps_doc_wikipedia_importance": -140.58901977539062,
"rps_doc_wikipedia_importance_length_correction": -140.58901977539062
},
"fasttext": {
"dclm": 0.9356070756912231,
"english": 0.746589720249176,
"fineweb_edu_approx": 2.8351259231567383,
"eai_general_math": 0.9977900385856628,
"eai_open_web_math": 0.365558922290802,
"eai_web_code": 0.6674209237098694
}
}
|
{
"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": "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": "18",
"label": "Q&A Forum"
}
},
"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
|
918,365,943,753,701,600 |
Standard Deviation Calculator
Standard Deviation Calculator
Enter Data:
x - x̄:
(x - x̄)2:
Z-Scores:
FINAL RESULTS
Rows: 1 Mean: 0 ∑(x - x̄)2: 0 Variance S2: 0 Standard Deviation: 0 Alert: None
The fast and accurate standard deviation calculator for any statistics problem, probability solution, and easily compute other essential mathematical numerical.
This free and online tool calculates the standard deviation and as well the Mean, ∑(x – x̄)2 and Variance for a given data set of real numbers. It generates two primary results, the 1st is single results that calculate x – x̄, (x – x̄)2 and Z-score for every separate data set. The 2nd is the final results that calculate Mean, ∑(x – x̄)2, Variance S2, and Standard Deviation.
How to Use STD Deviation Calculator
1. Add rows according to your required data set by using the button.
2. Use the “Delete” button to removing any extra or unnecessary row.
3. The “Calculate” button is simply using for the calculation of your input data set.
4. The final Results “Box” provides the overall result containing Mean, ∑(x – x̄)2, Variance S2, and standard deviation.
5. Single results shows (x – x̄), (x – x̄)2, and Z-score value for every separate data input.
Features & Functions
1. Provide 7 separate results.
2. 100% tested and accurate results.
3. Unlimited data set inputs.
4. Adding and deleting function.
5. A user-friendly interface.
Standard Deviation
In statistical terminology, it is the measurement of the dispersion of the data set. It is donated by Greek letter σ. The higher standard deviation tells that the values of a data set are spread out very much while the lower indicates that the data set is very near to the mean. Many times it is used for the measurement of statistical results such as error margins and due to this, it is also known as the standard means error.
High and Low
The high standard deviation shows that data are more spread out, and low means data are clustered around the mean. Close to zero SD show data point are near to mean, while high or low SD indicates data points are above or below the mean.
Formula
The following formula is used for standard deviation.
Formula: S = 1/N-1 ni=1(xi-x̄)2
Where: S = Sample Deviation,
N = Numer of data points,
= Sum,
xi = Individual value,
= Sample mean
Equation
The equation of standard deviation is below.
Equation: σ = ∑(xi-μ)2/N
Where: σ = Population Standard Deviation,
N = The Size of the Population,
xi = Each Value From the Population,
μ = The Population Mean
Units
To make it easier and compared to the variance, the SD always uses a similar unit of measurement as the variable in an observation or question.
Example
1. We have 3 observations of heights in inches 60, 64, 63.
2. The mean of observed values is –
3. mean = (60 + 64 + 63)/3 = 62.33 inches.
4. The variance of observed values is –
5. variance = (60 – 62.33)^2 + (64 – 62.33)^2 + (63 – 62.33)^2/3 = 2.88 square inches.
6. Convert it into the same unit as the observed values, take the square root of it for Standard deviation.
7. S.D = 2.88 = 1.69 inches.
Applications
The standard deviation is mainly used for the industrial configuration to test models of real-world data like to take control of the quality of the products.
• It is used to find out the maximum and minimum time percentage values of products.
• It is also used for the climatic and weather prediction of different regions.
• Another important application is in the finance field, it provides the estimated values about the return of investment.
Examples
Some examples with the different conditions help you to understand the value of data.
• A teacher found the mean score was 85% after the class test, after calculating the standard deviation of other tests the result values found very small which indicate that most students take marks very close to 85%.
• A financial researcher takes a survey to find out how a large of people might answer the same question. So after the survey, the lower standard deviation will indicate the answer is very efficient for peoples.
• A reporter is analyzing the high temperature for different regions for different dates versus the real high temperature recorded on every date. so the lower standard deviation will show the forecast reliability.
Population Standard Deviation
In statistics, the population standard deviation is the square root of the variance of a data set and also the definition of σ. It is used when we need to measure the standard deviation of the entire population. So after the calculation just note down the value of Variance (S2) as the answer of the population for your required problem.
Formula
The below formula is using for the manual calculation of the entire population of standard deviation.
Formula: σ = √1/N ni=1(xi-μ)2
Where: xi = Individual value,
μ = Mean value,
N = Total number,
= Sum
Symbol
The symbol for Population SD is:
σ = ∑(xi-μ)2/N
Where: σ = Population Standard Deviation
Example
The following problem is the best example of an entire population.
Example: μ = (1+2+4+6+8)/4 = 5.25
Solution: σ = [(1-5.25)2 + (2-5.25)2+…+(8-5.25)2)]/5
σ = (18.06+10.56+1.56+0.56+7.56)/5
σ = 7.66 (answer)
Sample Standard Deviation
Making every member sample in the population is not possible. So it is used to determine the large population of the sample data set, such as x1….xN. shows the mean of the sample data set, and N shows the size of the sample data point. The sample standard deviation is the common estimator for σ and denoted by S. Just like the sample mean, the sample standard deviation also has no single estimator and that is unbiased, enough and has maximum similarity.
Symbol
In mathematical texts and equations, it is commonly represented by the lower case Greek letter sigma σ and may be abbreviated SD.
Sample Size Calculator
In statistics, the sample size is the amount of error that will be tolerated. If the 10% result is NO and 90% resulted as YES shows that an enormous amount of error will be tolerated. The uncertain amount of tolerance is confidence level, and for a larger sample size, a higher confidence level required.
Example
In 20,000 peoples, 50% of people drink milk in the morning. If we repeat this survey for 377 people, then 95% of the time, our survey would get YES answer for between 45% and 55% of people.
Mean
In standard deviation, the sample mean is the average and the sum of all observed outcomes and by dividing the total number of events. In mathematical terms, the sample mean is denoted by x̄ and used for many purposes.
Formula
The formula of the mean is given below.
Formula: x̄ = 1/N ni=1x
Where: = Mean,
N = Total number of values,
= Sum,
x = Observed valued,
n = Sample size
Combined Mean
A mean of two or more different and separate data set points is known as a combined mean. While combined SD also calculated for data set like means.
Formula
The formula for combined mean as:
Formula: xc = m.xa + n.xb / m+n
Where: xc = Combined Mean
m = Number of Items in the First Set
xa = Mean of the First Set
n = Number of Items in the Second Set
xb = Mean of the Second Set
Standard Error
The standard error of the estimate of the mean is the sampling distribution and the variance between the mean of different samples. These errors are strictly dependent on the sample size, and when the sample size increases, the standard error falls more. So it is clear that if a sample is bigger, the closer the sample means to the population’s mean and close to the actual value.
Equation
The equation or formula for standard error as follows.
Equation: SE = σ/√n
Where: σ = Standard Deviation
n = Sample Size
Probability Distribution Calculator
The mathematical function like probability distribution gives probabilities of different outcomes for a calculation or experiment. In terms of sample space and the probabilities of events, it is the mathematical description of a random phenomenon.
Example
If X is used as the outcome of a coin toss, then the probability distribution of X would take the value of 0.5 for X=Heads, and 0.5 for X=Tails that assuming the coin is fair.
Variance
The variance and standard deviation are the mathematics basic concept and are mostly used for the measurement of spread while the variance is denoted by S2. The variance is the measure that how a data set is spread out. It is considered as the average squared deviation of a data set from the mean of each value. Write down the S2 values as the answer to your requires problem.
Formula
This is the formula of variance that will solve your problem through manual calculation by putting your given values in it.
Formula: S2 = ∑(xi-x̄)2/n-1
Where: S2 = Variance,
= Sum,
xi = Data set term,
= Sample mean,
n = Sample size
Range Variance
The range of standard deviation is the difference between the highest and the smallest values of the data set. In other words, we can say that it is the representation of a single number of a data set. It is very easy to find out the range by this calculator because it shows a separate and single result for every input data.
Relative Standard Deviation
It is the special form of standard deviation and its shorts form is (RSD). By comparing to the mean of a specific data set, it indicates whether the regular standard deviation is higher or smaller from the mean, It also tells how the data are closely rounded from the mean.
Formula
Below is the given formula for RSD.
RSD = S x 100 / x̄
Where: RSD = Relative SD,
S = STD,
= Mean
RSD Calculator
RSD calculatore let you quickly find out and solve the problem and give you an accurect result and answer. You can use the above free online calculator for Relative SD.
Example
Problem: If STD = 0.2, Mean = 5.4, Find the RSD
Solution: RSD = 0.2 x 100 / 5.4
RSD = 3.70 (answer)
Average
The average deviation is the measurement of variability but its calculation is exactly the same as the standard deviation. Also, it is using positive values instead of negative values. In statistics, we can say that it is the absolute value difference between the data point and their means. Follow the steps to calculate the average deviation.
Steps
1. Do the operation of subtraction between all data points and each data value.
2. Add them and average the positive differences values.
Difference
The STD is mostly used for creating different marketing, financial, and investment strategies because it predicts the performance trends. While the average deviation is used in later phases means that in the more complex and inner calculation.
FAQs - Standard Deviation Calculator
There are two main reasons that standard deviation is preferred over the variance that is below.
1. It has the same units as the original statics.
2. It can estimate the percentage of items in any section of the population.
This is a tricky question but standard deviation can not be negative as it is the measurement of dispersion that how much your data distanced from the mean so in this way the distance can never be negative. Its calculation is based on the square of the difference which makes it positive not what difference is.
A normal distribution with a standard deviation of 1 and a mean of 0 is called the standard normal distribution. In normal cases, the STD of 1 would be 1 standard deviation from the mean. For instance, a Z of -2.5 represents a value 2.5 standard deviations below the mean.
The standard deviation formula may look confusing, but it will make sense after we break it down.
1. Find the mean.
2. For each data point, find the square of its distance to the mean.
3. Sum the values from Step 2.
4. Divide by the number of data points.
5. Take the square root.
Done
It is very simple just use the Excel Formula =STDEV( ) and select the range of values that contain the data and you will get your answer.
Because of its reliable scientific properties, 68 percent of the qualities in any informational collection exist in one standard deviation of the mean, and 95 percent exist in two standard deviations of the mean.
A high standard deviation shows that the data is spread (not better), and a low standard deviation indicates that the data are closely around from the mean (yes better).
4.5/5 (4 Reviews)
|
{
"url": "https://standarddeviationcalculator.info/",
"source_domain": "standarddeviationcalculator.info",
"snapshot_id": "crawl=CC-MAIN-2021-21",
"warc_metadata": {
"Content-Length": "95057",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:A5P5WNROMRZIUKPJ5IQB3F4HJC65TXMR",
"WARC-Concurrent-To": "<urn:uuid:c9b52ec5-1828-404a-8c28-0187bf921f5f>",
"WARC-Date": "2021-05-13T18:09:37Z",
"WARC-IP-Address": "162.0.232.231",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:D2B4UZAHWD7756ZVG65VOEGEUQTMLYEV",
"WARC-Record-ID": "<urn:uuid:ec4cad28-af7d-4014-86c1-da6c0f857274>",
"WARC-Target-URI": "https://standarddeviationcalculator.info/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0db8df86-8da0-47e1-8a3a-c434422050c7>"
},
"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-101.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,
30,
31,
61,
62,
74,
75,
76,
84,
85,
96,
97,
107,
108,
122,
123,
202,
203,
364,
365,
742,
743,
779,
780,
851,
922,
1010,
1133,
1229,
1230,
1251,
1252,
1285,
1324,
1356,
1391,
1423,
1424,
1443,
1444,
1873,
1874,
1887,
1888,
2126,
2127,
2135,
2136,
2190,
2191,
2223,
2224,
2253,
2254,
2280,
2281,
2288,
2289,
2312,
2313,
2327,
2328,
2337,
2338,
2383,
2384,
2409,
2410,
2452,
2453,
2485,
2486,
2523,
2524,
2548,
2549,
2555,
2556,
2700,
2701,
2709,
2710,
2771,
2809,
2854,
2896,
2985,
3095,
3126,
3127,
3140,
3141,
3299,
3300,
3387,
3469,
3593,
3594,
3603,
3604,
3690,
3691,
3911,
4125,
4341,
4342,
4372,
4373,
4713,
4714,
4722,
4723,
4825,
4826,
4856,
4857,
4887,
4888,
4904,
4905,
4923,
4924,
4930,
4931,
4938,
4939,
4972,
4973,
4988,
4989,
5030,
5031,
5039,
5040,
5107,
5108,
5142,
5143,
5196,
5197,
5232,
5233,
5251,
5252,
5278,
5279,
5736,
5737,
5744,
5745,
5875,
5876,
5899,
5900,
6205,
6206,
6214,
6215,
6405,
6406,
6411,
6412,
6631,
6632,
6640,
6641,
6681,
6682,
6706,
6707,
6722,
6723,
6751,
6752,
6759,
6760,
6781,
6782,
6798,
6799,
6813,
6814,
6963,
6964,
6972,
6973,
7007,
7008,
7040,
7041,
7067,
7068,
7105,
7106,
7133,
7134,
7172,
7173,
7201,
7202,
7217,
7218,
7600,
7601,
7610,
7611,
7666,
7667,
7687,
7688,
7718,
7719,
7735,
7736,
7772,
7773,
8021,
8022,
8030,
8031,
8207,
8208,
8217,
8218,
8596,
8597,
8605,
8606,
8730,
8731,
8759,
8760,
8782,
8783,
8790,
8791,
8811,
8812,
8828,
8829,
8845,
8846,
8861,
8862,
9189,
9190,
9218,
9219,
9493,
9494,
9502,
9503,
9539,
9540,
9559,
9560,
9586,
9587,
9596,
9597,
9604,
9605,
9620,
9621,
9791,
9792,
9800,
9801,
9849,
9850,
9882,
9883,
9903,
9904,
9906,
9907,
9915,
9916,
10261,
10262,
10268,
10269,
10351,
10410,
10411,
10422,
10423,
10667,
10668,
10705,
10706,
10803,
10804,
10856,
10935,
10936,
11248,
11249,
11522,
11523,
11621,
11622,
11642,
11713,
11746,
11788,
11815,
11816,
11821,
11822,
11960,
11961,
12174,
12175,
12345,
12346
],
"line_end_idx": [
30,
31,
61,
62,
74,
75,
76,
84,
85,
96,
97,
107,
108,
122,
123,
202,
203,
364,
365,
742,
743,
779,
780,
851,
922,
1010,
1133,
1229,
1230,
1251,
1252,
1285,
1324,
1356,
1391,
1423,
1424,
1443,
1444,
1873,
1874,
1887,
1888,
2126,
2127,
2135,
2136,
2190,
2191,
2223,
2224,
2253,
2254,
2280,
2281,
2288,
2289,
2312,
2313,
2327,
2328,
2337,
2338,
2383,
2384,
2409,
2410,
2452,
2453,
2485,
2486,
2523,
2524,
2548,
2549,
2555,
2556,
2700,
2701,
2709,
2710,
2771,
2809,
2854,
2896,
2985,
3095,
3126,
3127,
3140,
3141,
3299,
3300,
3387,
3469,
3593,
3594,
3603,
3604,
3690,
3691,
3911,
4125,
4341,
4342,
4372,
4373,
4713,
4714,
4722,
4723,
4825,
4826,
4856,
4857,
4887,
4888,
4904,
4905,
4923,
4924,
4930,
4931,
4938,
4939,
4972,
4973,
4988,
4989,
5030,
5031,
5039,
5040,
5107,
5108,
5142,
5143,
5196,
5197,
5232,
5233,
5251,
5252,
5278,
5279,
5736,
5737,
5744,
5745,
5875,
5876,
5899,
5900,
6205,
6206,
6214,
6215,
6405,
6406,
6411,
6412,
6631,
6632,
6640,
6641,
6681,
6682,
6706,
6707,
6722,
6723,
6751,
6752,
6759,
6760,
6781,
6782,
6798,
6799,
6813,
6814,
6963,
6964,
6972,
6973,
7007,
7008,
7040,
7041,
7067,
7068,
7105,
7106,
7133,
7134,
7172,
7173,
7201,
7202,
7217,
7218,
7600,
7601,
7610,
7611,
7666,
7667,
7687,
7688,
7718,
7719,
7735,
7736,
7772,
7773,
8021,
8022,
8030,
8031,
8207,
8208,
8217,
8218,
8596,
8597,
8605,
8606,
8730,
8731,
8759,
8760,
8782,
8783,
8790,
8791,
8811,
8812,
8828,
8829,
8845,
8846,
8861,
8862,
9189,
9190,
9218,
9219,
9493,
9494,
9502,
9503,
9539,
9540,
9559,
9560,
9586,
9587,
9596,
9597,
9604,
9605,
9620,
9621,
9791,
9792,
9800,
9801,
9849,
9850,
9882,
9883,
9903,
9904,
9906,
9907,
9915,
9916,
10261,
10262,
10268,
10269,
10351,
10410,
10411,
10422,
10423,
10667,
10668,
10705,
10706,
10803,
10804,
10856,
10935,
10936,
11248,
11249,
11522,
11523,
11621,
11622,
11642,
11713,
11746,
11788,
11815,
11816,
11821,
11822,
11960,
11961,
12174,
12175,
12345,
12346,
12363
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 12363,
"ccnet_original_nlines": 315,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3514437675476074,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.026215810328722,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24962006509304047,
"rps_doc_frac_unique_words": 0.2540983557701111,
"rps_doc_mean_word_length": 4.596914291381836,
"rps_doc_num_sentences": 162,
"rps_doc_symbol_to_word_ratio": 0.0007598800002597272,
"rps_doc_unigram_entropy": 5.206453323364258,
"rps_doc_word_count": 2074,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05747849866747856,
"rps_doc_frac_chars_dupe_6grams": 0.02454373985528946,
"rps_doc_frac_chars_dupe_7grams": 0.02454373985528946,
"rps_doc_frac_chars_dupe_8grams": 0.012166979722678661,
"rps_doc_frac_chars_dupe_9grams": 0.008391019888222218,
"rps_doc_frac_chars_top_2gram": 0.07667295634746552,
"rps_doc_frac_chars_top_3gram": 0.01395007036626339,
"rps_doc_frac_chars_top_4gram": 0.004195509944111109,
"rps_doc_books_importance": -1202.3289794921875,
"rps_doc_books_importance_length_correction": -1202.3289794921875,
"rps_doc_openwebtext_importance": -658.9375,
"rps_doc_openwebtext_importance_length_correction": -658.9375,
"rps_doc_wikipedia_importance": -609.2139282226562,
"rps_doc_wikipedia_importance_length_correction": -609.2139282226562
},
"fasttext": {
"dclm": 0.8455728888511658,
"english": 0.9099589586257935,
"fineweb_edu_approx": 3.317521572113037,
"eai_general_math": 0.9995518922805786,
"eai_open_web_math": 0.7988240122795105,
"eai_web_code": 0.8476606011390686
}
}
|
{
"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": "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": "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,669,585,155,453,481,000 |
One of the first things I've learned about Java EE development is that I shouldn't spawn my own threads inside a Java EE container. But when I come to think about it, I don't know the reason.
Can you clearly explain why it is discouraged?
I am sure most enterprise applications need some kind of asynchronous jobs like mail daemons, idle sessions, cleanup jobs etc.
So, if indeed one shouldn't spawn threads, what is the correct way to do it when needed?
• 4
Asynchronous tasks are usually done using JMS messaging and MDBs. – Ken Liu May 27 '10 at 2:14
• 5
This issue should soon be a thing of the past once JSR 236 is implemented in the containers. – letmaik Aug 4 '13 at 16:17
• 4
It was discouraged because any second threads should be created and managed by the container, so that the thread will have access to the other enterprise resources. With Java EE7, there is a standard, and correct way to create threads in an enterprise environment. By using Concurrency Utils, you ensure that your new thread is created, and managed by the container, guaranteeing that all EE services are available. Example here – Chris Ritchie Oct 22 '13 at 8:21
• Several correct ways in JSF/EJB perspective can be found here: stackoverflow.com/q/6149919 – BalusC Mar 23 '16 at 10:33
up vote 81 down vote accepted
It is discouraged because all resources within the environment are meant to be managed, and potentially monitored, by the server. Also, much of the context in which a thread is being used is typically attached to the thread of execution itself. If you simply start your own thread (which I believe some servers will not even allow), it cannot access other resources. What this means, is that you cannot get an InitialContext and do JNDI lookups to access other system resources such as JMS Connection Factories and Datasources.
There are ways to do this "correctly", but it is dependent on the platform being used.
The commonj WorkManager is common for WebSphere and WebLogic as well as others
More info here
And here
Also somewhat duplicates this one from this morning
UPDATE: Please note that this question and answer relate to the state of Java EE in 2009, things have improved since then!
• 1
you cannot get an InitialContext and do JNDI lookups to access other system resources such as JMS Connection Factories and Datasources. I have an app that works around this by injecting the datasource when starting the threads, but I might have to rethink this approach... – rjohnston Jul 5 '12 at 12:53
• 6
There is now a standard, and correct way to create threads with the core Java EE API. By using Concurrency Utils, you ensure that your new thread is created, and managed by the container, guaranteeing that all EE services are available. Examples here and here – Chris Ritchie Oct 16 '13 at 13:15
• @ChrisRitchie thanks for the tip. if only JBoss AS/IBM WAS supported Java EE 7... :-( – asgs Oct 23 '14 at 4:50
• 1
@asgs WildFly 8 (new name for JBoss AS) does support Java EE 7. IBM is only Java EE 6 certified certification – Chris Ritchie Oct 23 '14 at 11:24
For EJBs, it's not only discouraged, it's expressly forbidden by the specification:
An enterprise bean must not use thread synchronization primitives to synchronize execution of multiple instances.
and
The enterprise bean must not attempt to manage threads. The enterprise bean must not attempt to start, stop, suspend, or resume a thread, or to change a thread’s priority or name. The enterprise bean must not attempt to manage thread groups.
The reason is that EJBs are meant to operate in a distributed environment. An EJB might be moved from one machine in a cluster to another. Threads (and sockets and other restricted facilities) are a significant barrier to this portability.
• 3
Java EE7 Concurrency Utils provide a correct way to create threads in an enterprise environment. Examples here and here – Chris Ritchie Oct 16 '13 at 13:17
• 1
@Dan Can you explain to me why a Thread would be significant barrier to the portability of moving an EJB from one machine in a custer to another? – Geek Jun 2 '14 at 11:44
The reason that you shouldn't spawn your own threads is that these won't be managed by the container. The container takes care of a lot of things that a novice developer can find hard to imagine. For example things like thread pooling, clustering, crash recoveries are performed by the container. When you start a thread you may lose some of those. Also the container lets you restart your application without affecting the JVM it runs on. How this would be possible if there are threads out of the container's control?
This the reason that from J2EE 1.4 timer services were introduced. See this article for details.
Concurrency Utilities for Java EE
There is now a standard, and correct way to create threads with the core Java EE API:
By using Concurrency Utils, you ensure that your new thread is created, and managed by the container, guaranteeing that all EE services are available.
Examples here
You can always tell the container to start stuff as part of your deployment descriptors. These can then do whatever maintainance tasks you need to do.
Follow the rules. You will be glad some day you did :)
Threads are prohibited in Java EE containers according to the blueprints. Please refer to the blueprints for more information.
There is no real reason not to do so. I used Quarz with Spring in a webapp without problems. Also the concurrency framework java.util.concurrent may be used. If you implement your own thread handling, set the theads to deamon or use a own deamon thread group for them so the container may unload your webapp any time.
But be careful, the bean scopes session and request do not work in threads spawned! Also other code beased on ThreadLocal does not work out of the box, you need to transfer the values to the spawned threads by yourself.
I've never read that it's discouraged, except from the fact that it's not easy to do correctly.
It is fairly low-level programming, and like other low-level techniques you ought to have a good reason. Most concurrency problems can be resolved far more effectively using built-in constructs like thread pools.
One reason I have found if you spawn some threads in you EJB and then you try to have the container unload or update your EJB you are going to run into problems. There is almost always another way to do something where you don't need a Thread so just say NO.
protected by Community Dec 14 '14 at 4:47
Thank you for your interest in this question. Because it has attracted low-quality or spam answers that had to be removed, posting an answer now requires 10 reputation on this site (the association bonus does not count).
Would you like to answer one of these unanswered questions instead?
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "https://stackoverflow.com/questions/533783/why-is-spawning-threads-in-java-ee-container-discouraged",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2018-34",
"warc_metadata": {
"Content-Length": "159795",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:33BX7FADA5Z7OBYQOX3BGWZ5UIADBLZG",
"WARC-Concurrent-To": "<urn:uuid:576340b2-4c55-4a62-a543-ba8c51b00938>",
"WARC-Date": "2018-08-14T23:07:00Z",
"WARC-IP-Address": "151.101.1.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CKUBKVOQTJPLCUJILONHFXMBC5XSWAVX",
"WARC-Record-ID": "<urn:uuid:ffab526c-4fd2-452a-8f3d-3c2d43e702fc>",
"WARC-Target-URI": "https://stackoverflow.com/questions/533783/why-is-spawning-threads-in-java-ee-container-discouraged",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a2630b95-cb98-4c4e-9d70-a22dec0ac441>"
},
"warc_info": "isPartOf: CC-MAIN-2018-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-159-181-253.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,
192,
193,
240,
241,
368,
369,
458,
459,
465,
564,
570,
696,
702,
1170,
1294,
1324,
1325,
1853,
1854,
1941,
1942,
2021,
2022,
2037,
2038,
2047,
2048,
2100,
2101,
2224,
2225,
2231,
2539,
2545,
2845,
2961,
2967,
3117,
3118,
3202,
3203,
3317,
3318,
3322,
3323,
3565,
3566,
3806,
3807,
3813,
3973,
3979,
4155,
4156,
4676,
4677,
4774,
4775,
4809,
4810,
4896,
4897,
5048,
5049,
5063,
5064,
5215,
5216,
5271,
5272,
5399,
5400,
5718,
5719,
5939,
5940,
6036,
6037,
6250,
6251,
6510,
6511,
6553,
6554,
6775,
6776,
6844,
6845
],
"line_end_idx": [
192,
193,
240,
241,
368,
369,
458,
459,
465,
564,
570,
696,
702,
1170,
1294,
1324,
1325,
1853,
1854,
1941,
1942,
2021,
2022,
2037,
2038,
2047,
2048,
2100,
2101,
2224,
2225,
2231,
2539,
2545,
2845,
2961,
2967,
3117,
3118,
3202,
3203,
3317,
3318,
3322,
3323,
3565,
3566,
3806,
3807,
3813,
3973,
3979,
4155,
4156,
4676,
4677,
4774,
4775,
4809,
4810,
4896,
4897,
5048,
5049,
5063,
5064,
5215,
5216,
5271,
5272,
5399,
5400,
5718,
5719,
5939,
5940,
6036,
6037,
6250,
6251,
6510,
6511,
6553,
6554,
6775,
6776,
6844,
6845,
6935
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6935,
"ccnet_original_nlines": 88,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42897728085517883,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.034801140427589417,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17826704680919647,
"rps_doc_frac_unique_words": 0.36605656147003174,
"rps_doc_mean_word_length": 4.548253059387207,
"rps_doc_num_sentences": 66,
"rps_doc_symbol_to_word_ratio": 0.0014204500475898385,
"rps_doc_unigram_entropy": 5.455682277679443,
"rps_doc_word_count": 1202,
"rps_doc_frac_chars_dupe_10grams": 0.15090543031692505,
"rps_doc_frac_chars_dupe_5grams": 0.20724345743656158,
"rps_doc_frac_chars_dupe_6grams": 0.19736601412296295,
"rps_doc_frac_chars_dupe_7grams": 0.19169563055038452,
"rps_doc_frac_chars_dupe_8grams": 0.18565940856933594,
"rps_doc_frac_chars_dupe_9grams": 0.1691969931125641,
"rps_doc_frac_chars_top_2gram": 0.024144869297742844,
"rps_doc_frac_chars_top_3gram": 0.015364919789135456,
"rps_doc_frac_chars_top_4gram": 0.019206149503588676,
"rps_doc_books_importance": -582.9719848632812,
"rps_doc_books_importance_length_correction": -582.9719848632812,
"rps_doc_openwebtext_importance": -328.4232177734375,
"rps_doc_openwebtext_importance_length_correction": -328.4232177734375,
"rps_doc_wikipedia_importance": -235.07052612304688,
"rps_doc_wikipedia_importance_length_correction": -235.07052612304688
},
"fasttext": {
"dclm": 0.17210716009140015,
"english": 0.9368829131126404,
"fineweb_edu_approx": 2.092733144760132,
"eai_general_math": 0.29358911514282227,
"eai_open_web_math": 0.16934162378311157,
"eai_web_code": 0.3466964364051819
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-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": "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
|
-1,276,245,753,720,176,400 |
Restoring OS X server using Time Machine may take additional steps
If you back up an OS X server that has a separate data store drive, then restoring this with Time Machine may require use of the Terminal.
by Topher Kessler
Apple’s Time Machine is a convenient option for backing up files in OS X, and for most people running the standard “client” version of OS X, the use of Time Machine is fairly straightforward. However, Apple offers a Server variant of OS X that can be used for running work groups, classrooms, and other business applications, which, depending on your setup, might take some extra steps when managing via Time Machine.
If you run into a problem with the configuration for a single service in your server, then restoring components is usually fairly straightforward. In most cases besides the executable files, services are composed of a configuration and a data store, so if you are familiar with the locations of these files in your server then you can use Time Machine to target and restore backups of them, making the recovery of configuration problems or data loss rather painless in some situations.
For instance, if you administer an SQL database and erroneously corrupt the database or delete items in it, while you can try using the server administration tools to attempt reimporting of a database backup, this requires that you had made a backup just prior to the problem occurring, and often such manual backups might be missing a fair number of entries. Other times, re-importing can result in odd configuration errors that need to be contended with before the restored database will function properly.
As an alternative to such approaches, if you have a Time Machine backup of the database data store, then you can locate all the files that the SQL service uses (configurations and data store), and restoring all of them using Time Machine to revert the service’s configuration to as it was before the problem occurred. This can often be done without needing to shut down the server, and only requires you stop the service, locate the configuration files on disk, restore older versions from Time Machine, and restart the service. The one caveat is that you need to understand the service in question well enough to know what files the service uses, but in many cases this is relatively easy to do if you are familiar with server administration and the nuances of your server setup.
The one area with restoring an OS X server using Time Machine that might be a bit tricky is if you need to restore the entire installation. Time Machine is built primarily to recover the OS boot volume and visible files contained on a single disk, so if you have a server set up on one boot volume then you can easily follow standard Time Machine recovery procedures to restore the system; however, if you have your server set up on multiple disks (such as having a data store on a separate drive — a common setup for server systems), then restoring with Time Machine will take a few extra steps.
While Time Machine should back up all the files from your data store volume just fine, in a recent Knowledgebase article, Apple outlines that if you need to restore this volume to a new or formatted drive, you will need to ensure that a few setup requirements are met. First be sure the volume name is the same as the previous one, since services will access their data using the full path of /Volumes/<volume name>, and secondly you will need to use the Time Machine command line utility in the following manner to restore the data, instead of using the Time Machine interface:
1. Go to the desired backup location on the Time Machine disk by navigating to Time Machine Disk > Backups.backupdb > computername in the Finder.
2. Open the Terminal utility and type “/usr/bin/tmutil restore -v” followed by a single space.
3. Locate the desired backup instance (the “Latest” folder is the most recent one, but others should be listed by date and time), and open it to find the folder for the data drive.
4. Drag the data drive folder it to the Terminal window, followed by deleting the trailing space and typing “/*” to complete the path and reference everything within the folder.
5. Finally press the Space bar once and drag the newly formatted data drive to the Terminal window. When you are done, the command should look similar to the following (note that file paths and disk names will be unique to your setup):
/usr/bin/tmutil restore -v <path to desired backup>/DataStore/* /Volumes/DataStore
When executed, this command will restore the entire contents of the Time Machine backup for the data store drive to the newly formatted partition you have designated to be your new data store. Once completed, your restored services and OS installation should continue to function and reference the files and configurations on the data store disk as they did before the restoration was needed.
Source
0 Comments
Leave a reply
Your email address will not be published. Required fields are marked *
*
Copyright © 2022 xcluesiv.com All rights reserved
Log in with your credentials
Forgot your details?
|
{
"url": "http://xcluesiv.com/restoring-os-x-server-using-time-machine-may-take-additional-steps/",
"source_domain": "xcluesiv.com",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "381358",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:T5Z7ET5GMGZHHQ5G6ZFDAEAAD37SWUZZ",
"WARC-Concurrent-To": "<urn:uuid:9cf60937-a693-450f-8165-4610ec07bdc2>",
"WARC-Date": "2022-05-17T05:31:31Z",
"WARC-IP-Address": "172.67.184.95",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:A65UOLOBGQGO7XGX4OWHUFV4DQ6WZD2A",
"WARC-Record-ID": "<urn:uuid:c0ce9412-7708-4b82-bf17-c2dc6e81d935>",
"WARC-Target-URI": "http://xcluesiv.com/restoring-os-x-server-using-time-machine-may-take-additional-steps/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9c4d04d7-cfb8-4fc7-8fe1-2fa2b5b7ecc6>"
},
"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-36\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,
67,
68,
207,
208,
226,
227,
645,
646,
1132,
1133,
1642,
1643,
2424,
2425,
3022,
3023,
3602,
3603,
3751,
3848,
4031,
4211,
4449,
4450,
4533,
4534,
4927,
4928,
4935,
4936,
4947,
4948,
4962,
4963,
5034,
5035,
5037,
5038,
5088,
5089,
5118,
5119
],
"line_end_idx": [
67,
68,
207,
208,
226,
227,
645,
646,
1132,
1133,
1642,
1643,
2424,
2425,
3022,
3023,
3602,
3603,
3751,
3848,
4031,
4211,
4449,
4450,
4533,
4534,
4927,
4928,
4935,
4936,
4947,
4948,
4962,
4963,
5034,
5035,
5037,
5038,
5088,
5089,
5118,
5119,
5139
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5139,
"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.44399595260620117,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016145309433341026,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11503531783819199,
"rps_doc_frac_unique_words": 0.36571428179740906,
"rps_doc_mean_word_length": 4.714285850524902,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.085922718048096,
"rps_doc_word_count": 875,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.030545450747013092,
"rps_doc_frac_chars_dupe_6grams": 0.012121209874749184,
"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.05066667124629021,
"rps_doc_frac_chars_top_3gram": 0.013575759716331959,
"rps_doc_frac_chars_top_4gram": 0.006787879858165979,
"rps_doc_books_importance": -406.5987548828125,
"rps_doc_books_importance_length_correction": -406.5987548828125,
"rps_doc_openwebtext_importance": -171.67874145507812,
"rps_doc_openwebtext_importance_length_correction": -171.67874145507812,
"rps_doc_wikipedia_importance": -149.03843688964844,
"rps_doc_wikipedia_importance_length_correction": -149.03843688964844
},
"fasttext": {
"dclm": 0.03755998983979225,
"english": 0.912793755531311,
"fineweb_edu_approx": 1.9889189004898071,
"eai_general_math": 0.5353726744651794,
"eai_open_web_math": 0.2682218551635742,
"eai_web_code": 0.3459852933883667
}
}
|
{
"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": "-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
|
298,886,139,698,456,770 |
What Can Someone Do With Your IP Address? 1,563 Views
Can They Hack Me Using My IP?
Hacking someone through their public IP address is very difficult. That is because internet service providers and routers have firewalls. However, hackers who obtain your IP address can get ahold of some very valuable information about you, including your city, state, and ZIP code. With this location data, hackers can find out other personal information about you.
What Can Someone Do With Your IP Address?
How Can Hackers Get My IP?
Each IP address is associated with ports, which act as doorways. Your IP address is a unique signature for your device, and ports are the doorways which allow applications and other devices to send information to you. If you are connected to the internet and running multiple programs, your device could have ports open that might allow hackers to access your connection and learn your IP.
What Can They Do With My PC Remotely?
If a hacker gains access to your PC remotely, such as through the use of malware or a trojan, they could be able to access all of the files on your computer, along with your internet history. The files you have could be accessed and manipulated and your internet passwords, financial information, and social media could all be at risk.
What Should I Do To Be Safe?
To keep yourself safe online, it is recommended that you hide your true IP address. This can be done through setting up a virtual private network, or VPN. A VPN provides you with a temporary IP address so that your ISP, government actors, and hackers don’t know who or where you are when you surf the web.
Don’t Let Hackers Use Your IP
Avoid hackers and keep your location data safe by using a VPN.
Published : Tue 06 Mar 2018
Updated : Thu 26 Mar 2020
Add Comment
We will be very pleased to hear your feedback about the article or the service we reviewed.
reload, if the code cannot be seen
0 Comments
HomePage Reviews Articles Coupons Register Share on Share on Share on Linked-In Logo SVG
|
{
"url": "https://www.golden-reviews.com/articles/vpn-and-security/98-what-can-someone-do-with-your-ip-address.html",
"source_domain": "www.golden-reviews.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "33193",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:J52PZDCEVQCANFZZKOKDFFR46DVLTUZI",
"WARC-Concurrent-To": "<urn:uuid:69891ef0-bada-4bfe-a16b-9043bc8f67b1>",
"WARC-Date": "2022-12-01T16:23:27Z",
"WARC-IP-Address": "184.154.190.82",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:K42ID3D4FY6S4U63FZNPJPWSWLZ57YW2",
"WARC-Record-ID": "<urn:uuid:1ea42ff5-d184-4d28-8a9d-a60bb73b2d70>",
"WARC-Target-URI": "https://www.golden-reviews.com/articles/vpn-and-security/98-what-can-someone-do-with-your-ip-address.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:47591684-ddd8-4533-95c8-689559278aa6>"
},
"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-196\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,
54,
55,
85,
86,
453,
495,
496,
523,
524,
914,
915,
953,
954,
1290,
1291,
1320,
1321,
1627,
1628,
1658,
1721,
1722,
1750,
1776,
1777,
1778,
1790,
1791,
1883,
1884,
1919,
1920,
1931,
1932
],
"line_end_idx": [
54,
55,
85,
86,
453,
495,
496,
523,
524,
914,
915,
953,
954,
1290,
1291,
1320,
1321,
1627,
1628,
1658,
1721,
1722,
1750,
1776,
1777,
1778,
1790,
1791,
1883,
1884,
1919,
1920,
1931,
1932,
2020
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2020,
"ccnet_original_nlines": 34,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37871286273002625,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05445545166730881,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12623761594295502,
"rps_doc_frac_unique_words": 0.4915730357170105,
"rps_doc_mean_word_length": 4.508427143096924,
"rps_doc_num_sentences": 21,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.782135963439941,
"rps_doc_word_count": 356,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.041121501475572586,
"rps_doc_frac_chars_dupe_6grams": 0.041121501475572586,
"rps_doc_frac_chars_dupe_7grams": 0.041121501475572586,
"rps_doc_frac_chars_dupe_8grams": 0.041121501475572586,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.044859811663627625,
"rps_doc_frac_chars_top_3gram": 0.03239874914288521,
"rps_doc_frac_chars_top_4gram": 0.01993769034743309,
"rps_doc_books_importance": -224.53988647460938,
"rps_doc_books_importance_length_correction": -224.53988647460938,
"rps_doc_openwebtext_importance": -117.53900909423828,
"rps_doc_openwebtext_importance_length_correction": -117.53900909423828,
"rps_doc_wikipedia_importance": -72.28539276123047,
"rps_doc_wikipedia_importance_length_correction": -72.28539276123047
},
"fasttext": {
"dclm": 0.10084552317857742,
"english": 0.948122501373291,
"fineweb_edu_approx": 2.0929808616638184,
"eai_general_math": 0.0004929300048388541,
"eai_open_web_math": 0.05618166923522949,
"eai_web_code": 0.00014699000166729093
}
}
|
{
"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": "363.12",
"labels": {
"level_1": "Social sciences",
"level_2": "Social service and Societies",
"level_3": "Political activists"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "9",
"label": "FAQ"
}
},
"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
|
6,161,291,337,679,547,000 |
Facebook login promise rejection on iOS
Please provide the following:
1. SDK Version: ^33.0.0
2. Platforms(Android/iOS/web/all): iOS
I integrated Facebook auth into my react-native app two weeks ago. Everything was working fine until today. Today when I tried to login, it thrown an promise rejection error on iOS device but works fine on android.
[Unhandled promise rejection: Error: Tried to perform Facebook login, but no Facebook app id was provided. Specify Facebook app id in Info.plist.]
Here is my login function :
async handleFacebookButton() {
const { type, token } = await Facebook.logInWithReadPermissionsAsync(
FACEBOOK_APP_ID,
{
permissions: ["public_profile", "email"]
}
);
if (type === "success") {
this.props.navigation.navigate("Browse");
//Firebase credential is created with the Facebook access token.
const credential = firebase.auth.FacebookAuthProvider.credential(token);
const response = await fetch(
`https://graph.facebook.com/me?access_token=${token}`
);
alert("Hello " + (await response.json()).name);
auth.signInWithCredential(credential).catch(error => {
this.setState({ errorMessage: error.message });
});
}
}
FACEBOOK_APP_ID is imported from another file.
2 Likes
I have the same exact issue in the same environment.
The same code properly logs in on Android devices, but always return “Cancel”.
1 Like
Uh oh! . So for you it doesn’t work on android too? am I right? :frowning:
For me it works perfectly on android, on iOS it returns a promise rejection error.
Exactly… It keeps saying I need to provide App ID even when it’s given, and I’ve tried different versions of expo-facebook with no luck.
I did quite some digging and my best guess is that Facebook-ios SDK had some underlying changes that affected this API call :frowning: I’ve been struggling to fix this the past two days and it’s so nice to see I’m not the only one experiencing this!
1 Like
Five minutes ago, I tried from my colleague’s iPhone and to my surprise it worked perfectly. Did you try with another iPhone? I am sure it will work. :slight_smile:
Unfortunately, I dont have a different iPhone to try on, and so the results are the same for me :frowning:
1 Like
Oh wow you are correct, I tried running on my physical phone and it works perfectly… OMG, but why is it not running on simulator? Maybe it’s an iOS version issue.
1 Like
I am glad it worked! . I think so too. What is your iOS version?
Ahh sorry, just kidding, I logged out of my application on my phone and tried to log back in… same issue, the Login API doesnt work :frowning:
Really? I am confused. Were you joking about it earlier or did it work on your phone?
No, I was not joking, the app was functioning properly earlier probably due to previous active session. I then logged out of the app and tried logging back in, then encountered the same error.
Oh, I see. I don’t know what going wrong here. It worked on my colleague’s iPhone and another android phone. Its really annoying.
+1 this same exact error is happening to me as well despite specifying the facebookScheme, facebookAppId, and facebookDisplayName in app.json.
I am also facing this issue on iOS using SDK 33 and I have an educated guess from where this bug might be coming from.
According to Expo SDK 36 release post, the facebook module now has to be initialized with initializeAsync() BEFORE calling logInWithReadPermissionsAsync().
Of course that this should be applicable only to apps using version 36 of expo SDK, but since I am using expo-app on simulator on version 2.13.x and there it works fine, but using expo-app on 2.14.x on real iOS device (which got updated automatically overnight) I am getting the issue, maybe the latest expo-cli (3.11.x) and latest expo-app (2.14.x) both have issues specific to iOS that prevent them from realizing the legacy behaviour on facebook module of previous SDKs, thus producing the error.
Again, just a guess and huge thanks for making expo such a great tool/lib!
Same problem here :frowning:
I think what you said makes sense to me now. It happened overnight :frowning:
I initialized the Facebook module before calling loginWithReadPermissionsAsync() . This is the error I get in my console now.
Facebook.initializeAsync is not a function
I just bumped my Expo SDK version from 33.0.0 to 36.0.0 and guess what, Facebook login works on my iOS phone now. :slight_smile: :slight_smile:
2 Likes
Yeap, it also happened overnight for me (due to my physical phone having automatic app updates set to on) and after finding out about the new SDK release and how it changed the Facebook module, I tried the same (bumping to SDK 36) and it worked as well, hence why I did the guessing here for expo team. The thing is that my app isn’t yet ready for that bump to be in production. We have to adjust for all react lifecycle method deprecations and more… So we could really use a fix for expo-app and expo-cli that restores the legacy behaviour of facebook module, if that is possible.
1 Like
What was your fix? I am having this problem as well. The only thing I updated was the expo-cli. How do I bump up to SDK 36?
Is your current version 33.0.0 ? To update SDK run expo update 36.0.0 .
|
{
"url": "https://forums.expo.dev/t/facebook-login-promise-rejection-on-ios/30969",
"source_domain": "forums.expo.dev",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "65621",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O5UYGJPC2USMJFOYMO4UNATS3PON7ERZ",
"WARC-Concurrent-To": "<urn:uuid:ea4efb77-abcf-49c5-8b95-2a246bbfb322>",
"WARC-Date": "2022-07-06T06:11:04Z",
"WARC-IP-Address": "64.71.144.205",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:X4BOGNNBHFLBRUZ324FXTSDABCIGLSHT",
"WARC-Record-ID": "<urn:uuid:bfbb73ff-aac5-46b9-b011-5658a400f5ef>",
"WARC-Target-URI": "https://forums.expo.dev/t/facebook-login-promise-rejection-on-ios/30969",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:711739f7-c267-4370-b4e3-461ae1064968>"
},
"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-111\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,
40,
41,
71,
72,
98,
139,
140,
355,
356,
503,
504,
532,
533,
564,
638,
661,
669,
718,
726,
733,
763,
811,
812,
883,
962,
998,
1060,
1069,
1123,
1184,
1240,
1250,
1256,
1260,
1261,
1308,
1309,
1317,
1318,
1371,
1450,
1451,
1458,
1459,
1534,
1535,
1618,
1619,
1756,
1757,
2007,
2008,
2015,
2016,
2181,
2182,
2289,
2290,
2297,
2298,
2461,
2462,
2469,
2470,
2535,
2536,
2679,
2680,
2766,
2767,
2960,
2961,
3091,
3092,
3235,
3236,
3355,
3356,
3512,
3513,
4013,
4014,
4089,
4090,
4119,
4120,
4198,
4199,
4325,
4326,
4369,
4370,
4514,
4515,
4523,
4524,
5106,
5107,
5114,
5115,
5239,
5240
],
"line_end_idx": [
40,
41,
71,
72,
98,
139,
140,
355,
356,
503,
504,
532,
533,
564,
638,
661,
669,
718,
726,
733,
763,
811,
812,
883,
962,
998,
1060,
1069,
1123,
1184,
1240,
1250,
1256,
1260,
1261,
1308,
1309,
1317,
1318,
1371,
1450,
1451,
1458,
1459,
1534,
1535,
1618,
1619,
1756,
1757,
2007,
2008,
2015,
2016,
2181,
2182,
2289,
2290,
2297,
2298,
2461,
2462,
2469,
2470,
2535,
2536,
2679,
2680,
2766,
2767,
2960,
2961,
3091,
3092,
3235,
3236,
3355,
3356,
3512,
3513,
4013,
4014,
4089,
4090,
4119,
4120,
4198,
4199,
4325,
4326,
4369,
4370,
4514,
4515,
4523,
4524,
5106,
5107,
5114,
5115,
5239,
5240,
5311
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5311,
"ccnet_original_nlines": 102,
"rps_doc_curly_bracket": 0.0026360400952398777,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.349040150642395,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0445026196539402,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24345549941062927,
"rps_doc_frac_unique_words": 0.39808154106140137,
"rps_doc_mean_word_length": 4.829736232757568,
"rps_doc_num_sentences": 89,
"rps_doc_symbol_to_word_ratio": 0.0034904000349342823,
"rps_doc_unigram_entropy": 5.289534091949463,
"rps_doc_word_count": 834,
"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.005213509779423475,
"rps_doc_frac_chars_top_3gram": 0.015640519559383392,
"rps_doc_frac_chars_top_4gram": 0.010923540219664574,
"rps_doc_books_importance": -448.1861267089844,
"rps_doc_books_importance_length_correction": -448.1861267089844,
"rps_doc_openwebtext_importance": -297.9029846191406,
"rps_doc_openwebtext_importance_length_correction": -297.9029846191406,
"rps_doc_wikipedia_importance": -261.6715087890625,
"rps_doc_wikipedia_importance_length_correction": -261.6715087890625
},
"fasttext": {
"dclm": 0.033761560916900635,
"english": 0.898114025592804,
"fineweb_edu_approx": 0.9095633029937744,
"eai_general_math": 0.08212006092071533,
"eai_open_web_math": 0.08854597806930542,
"eai_web_code": 0.1513039469718933
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,321,048,821,531,331,000 |
Tech
Software engineers are tech’s rising stars, according to Pathrise. Can you get in on the growth?
“The tech industry desperately needs software engineers,” says Kevin Wu, co-founder and CEO of career accelerator Pathrise. “Companies may struggle to find software engineers to meet the rising demand.” Data curves seem to smile on software engineers. By 2028, software employment is projected to grow 21%. That’s quadruple the national average. Software engineering remains one of the most rewarding and well-rewarded roles in the tech industry–the future seems almost alarmingly bright.
According to Glassdoor, the average salary for software engineers is $92k. The average software engineer salary on AngelList is $91k, which includes startup jobs. While software engineers usually hold a bachelor’s degree or higher, 27% have no degree at all! Google Jobs, Indeed, and Linkedin all host thousands of software engineering job listings from top tech companies like Google, Facebook, Apple, and more. The lesser-known job board feature on Github and Stack Overflow can also be a great place to find software engineering positions. Smaller startups also hire on AngelList and VentureLoop. For aspiring software engineers seeking remote jobs, We Work Remotely hosts virtual work opportunities.
Want to hack the software engineering job search? Get a referral. Referred candidates are almost 15 times more likely to land a software engineering job. Nearly 80% of recruiters reported that referrals were their number one source of hires. One way job seekers get referrals is by asking alumni from their college or bootcamp. Alumni databases often list graduates’ employers, making research even easier. Networking with current employees via LinkedIn can sometimes work, but warm leads like alumni will be more likely to say yes.
Referral or no referral, without a strong resume, candidates won’t get an interview. The best resumes explain experiences in “story” format with quantified results rather than a simple list. For example, “Accomplished X by implementing Y which led to Z” sounds so much more driven than “Implemented Y”. Recruiters spend less than 30 seconds on each resume. Application tracking systems (ATS) spend milliseconds. Resumes that include keywords from the job listing stand a better chance at avoiding the slush pile. Finally, candidates should showcase 2-4 portfolio projects, prioritizing projects completed outside of classes.
Candidates should prepare for two types of interviews: behavioral and technical. To ace behavioral interviews, aspiring software engineers should research the company. Study their product, values, and history. Like the skill section of a resume, candidates who present themselves in line with specific phrases from a company’s values will stand out.
The first step to acing technical interviews is to master a single programming language. Companies care about software, not the language used for the code. Mastering a single language is infinitely more useful than being shaky on many. Successful candidates often choose a straightforward language with pre-built convenient functions, like Python or Java. Complex languages like C may make things more difficult than they need be. While candidates can learn whatever language they want, technical interview question topics will definitely require knowledge of the following: hash tables, linked lists, breadth-first search, depth-first search, quicksort, merge sort, binary search, 2D arrays, dynamic arrays, binary search trees, dynamic programming, and Big-O analysis.
Interviewers want to see how candidates think. Get comfortable debugging and explaining thoughts aloud, so interviews can follow along. Solutions with explanations get more points. Even wrong answers with thoughtful explanations get more points than awkward silence.
The job search doesn’t end with an offer letter. After a pat on the back and a sigh of relief, aspiring software engineers move on to the final phase: negotiation. They compare the proposed salary to salaries at similar companies and then negotiate based on what’s standard. For offer letters from startups or small companies, salaries start lower, so aspiring software engineers should negotiate salary unless the offer explicitly forbids it. If the offer came from a top tech company and already offers a competitive salary, asking for equity changes or signing bonuses will be the best bet.
Tags:
Leave a Reply
|
{
"url": "https://www.lifestylemirror.com/software-engineers-are-techs-rising-stars-according-to-pathrise-can-you-get-in-on-the-growth/",
"source_domain": "www.lifestylemirror.com",
"snapshot_id": "crawl=CC-MAIN-2021-39",
"warc_metadata": {
"Content-Length": "78934",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MSXTVKJDRQBDNVQHZMYWW6UHOEYCR3AA",
"WARC-Concurrent-To": "<urn:uuid:2ebfa4e3-c1d0-4461-8c26-16247b0d0635>",
"WARC-Date": "2021-09-19T00:55:43Z",
"WARC-IP-Address": "72.167.124.165",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ETRE3AX6UJRJMGXNL6AYT4YMLHXWMKVC",
"WARC-Record-ID": "<urn:uuid:2b173044-686d-404a-8e04-505a829f2781>",
"WARC-Target-URI": "https://www.lifestylemirror.com/software-engineers-are-techs-rising-stars-according-to-pathrise-can-you-get-in-on-the-growth/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:320b1762-96e2-46ef-9a9f-e0c6460aa050>"
},
"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-43\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,
5,
6,
103,
104,
594,
595,
1300,
1301,
1834,
1835,
2460,
2461,
2811,
2812,
3583,
3584,
3851,
3852,
4446,
4447,
4453,
4454
],
"line_end_idx": [
5,
6,
103,
104,
594,
595,
1300,
1301,
1834,
1835,
2460,
2461,
2811,
2812,
3583,
3584,
3851,
3852,
4446,
4447,
4453,
4454,
4467
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4467,
"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.32595324516296387,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011070109903812408,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1635916382074356,
"rps_doc_frac_unique_words": 0.5595238208770752,
"rps_doc_mean_word_length": 5.465773582458496,
"rps_doc_num_sentences": 49,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.510162830352783,
"rps_doc_word_count": 672,
"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.041655320674180984,
"rps_doc_frac_chars_top_3gram": 0.02722569927573204,
"rps_doc_frac_chars_top_4gram": 0.01687992922961712,
"rps_doc_books_importance": -371.0508728027344,
"rps_doc_books_importance_length_correction": -371.0508728027344,
"rps_doc_openwebtext_importance": -214.37464904785156,
"rps_doc_openwebtext_importance_length_correction": -214.37464904785156,
"rps_doc_wikipedia_importance": -141.78431701660156,
"rps_doc_wikipedia_importance_length_correction": -141.78431701660156
},
"fasttext": {
"dclm": 0.10972338914871216,
"english": 0.9272803068161011,
"fineweb_edu_approx": 2.029327154159546,
"eai_general_math": 0.0709943175315857,
"eai_open_web_math": 0.05337398871779442,
"eai_web_code": 0.08255398273468018
}
}
|
{
"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.3",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,091,269,986,820,764,700 |
\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 5.0.1 - 2D and 3D Linear Geometry Kernel
Kernel::AreOrderedAlongLine_3 Concept Reference
Definition
Operations
A model of this concept must provide:
bool operator() (const Kernel::Point_3 &p, const Kernel::Point_3 &q, const Kernel::Point_3 &r)
returns true, iff the three points are collinear and q lies between p and r. More...
Member Function Documentation
◆ operator()()
bool Kernel::AreOrderedAlongLine_3::operator() ( const Kernel::Point_3 p,
const Kernel::Point_3 q,
const Kernel::Point_3 r
)
returns true, iff the three points are collinear and q lies between p and r.
Note that true is returned, if q==p or q==r.
|
{
"url": "https://doc.cgal.org/latest/Kernel_23/classKernel_1_1AreOrderedAlongLine__3.html",
"source_domain": "doc.cgal.org",
"snapshot_id": "crawl=CC-MAIN-2020-05",
"warc_metadata": {
"Content-Length": "11347",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EFAHMS2AUU65VT242WSLU7E6ZPZ356DL",
"WARC-Concurrent-To": "<urn:uuid:349fe868-873d-49c9-a61b-d767a5071e64>",
"WARC-Date": "2020-01-28T07:23:49Z",
"WARC-IP-Address": "213.186.33.40",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:YW5LDPKGWZPJ5N625G34VIHEL3UF3VS2",
"WARC-Record-ID": "<urn:uuid:22a4c6ae-4432-4c1e-8b78-e71584761f27>",
"WARC-Target-URI": "https://doc.cgal.org/latest/Kernel_23/classKernel_1_1AreOrderedAlongLine__3.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bdb7725a-5272-4578-854c-50d80c086d90>"
},
"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-43.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,
290,
336,
384,
385,
396,
397,
408,
409,
447,
448,
543,
629,
631,
632,
662,
663,
678,
679,
753,
778,
803,
805,
806,
883,
884
],
"line_end_idx": [
290,
336,
384,
385,
396,
397,
408,
409,
447,
448,
543,
629,
631,
632,
662,
663,
678,
679,
753,
778,
803,
805,
806,
883,
884,
928
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 928,
"ccnet_original_nlines": 25,
"rps_doc_curly_bracket": 0.056034479290246964,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.14693878591060638,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06530611962080002,
"rps_doc_frac_lines_end_with_ellipsis": 0.03846153989434242,
"rps_doc_frac_no_alph_words": 0.48571428656578064,
"rps_doc_frac_unique_words": 0.6060606241226196,
"rps_doc_mean_word_length": 6.232323169708252,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0.05306122079491615,
"rps_doc_unigram_entropy": 3.8992836475372314,
"rps_doc_word_count": 99,
"rps_doc_frac_chars_dupe_10grams": 0.36952999234199524,
"rps_doc_frac_chars_dupe_5grams": 0.36952999234199524,
"rps_doc_frac_chars_dupe_6grams": 0.36952999234199524,
"rps_doc_frac_chars_dupe_7grams": 0.36952999234199524,
"rps_doc_frac_chars_dupe_8grams": 0.36952999234199524,
"rps_doc_frac_chars_dupe_9grams": 0.36952999234199524,
"rps_doc_frac_chars_top_2gram": 0.16531604528427124,
"rps_doc_frac_chars_top_3gram": 0.05834684148430824,
"rps_doc_frac_chars_top_4gram": 0.07455428689718246,
"rps_doc_books_importance": -117.07791900634766,
"rps_doc_books_importance_length_correction": -117.07791900634766,
"rps_doc_openwebtext_importance": -64.02522277832031,
"rps_doc_openwebtext_importance_length_correction": -52.366519927978516,
"rps_doc_wikipedia_importance": -38.12078857421875,
"rps_doc_wikipedia_importance_length_correction": -38.12078857421875
},
"fasttext": {
"dclm": 0.11210756748914719,
"english": 0.4803377091884613,
"fineweb_edu_approx": 2.721036434173584,
"eai_general_math": 0.4348474144935608,
"eai_open_web_math": 0.3542678952217102,
"eai_web_code": 0.0027943800669163465
}
}
|
{
"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": "516.3",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
}
},
"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": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "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": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-620,945,029,164,768,800 |
AnswerBun.com
C++ Arraylist Implementation
Code Review Asked by SirTrashyton on January 2, 2022
I am a new C++ developer who, coming from Java, am having issues in understanding some of C++’s key memory management features. Below is my attempt at an ArrayList implementation and I would really love criticism and ways to improve.
Problems I noticed:
Can not create an ArrayList object
Questions:
In expandArray(), is delete[] required since the data is set in the next line?
In my functions such as add(T &d) I figured the parameter should be a reference. Is this necessary? Would the program still work with the variable as a reference?
There is no null value in C++ (besides with pointers), so in my function get(int index) I just use return; for a value it could not find.
ArrayList.h:
#pragma once
template <class T> class ArrayList {
public:
// Constructor to initialize the list.
ArrayList();
// Destructor to clean up the list.
~ArrayList();
// Finds a specifies element of the array list based on the index. Returns null if nothing.
T get(int index);
//Finds the index of the given element.
int indexOf(T &d);
// Inserts an element at the end of the list.
void add(T &d);
// Inserts an element at a specified position in the array list.
void add(T &d, int position );
// Deletes the element at the given index.
//TRUE if successful
bool remove(int index);
//TRUE if this array contains the given data
bool contains(T &d);
// Empties/clears out the array list structure.
void clear( );
// Tests to see if the array list structure is empty.
bool isEmpty( );
// Returns the size of the array.
inline int listSize() { return size; }
private:
int arraySize;// Size of the array.
int size; // Number of elements in the array.
T *data = nullptr;// Pointer to the array.
// Checks if the array is full of elements.
bool needsExpansion();
//makes space in the array by doubling the arraySize
void expandArray();
//returns TRUE if the given index is in range (0 -> size)
bool isValidIndex(int index);
};
ArrayList.cpp:
#include "ArrayList.h"
using namespace std;
//constructor
//set array size, size and data
template<class T>
ArrayList<T>::ArrayList() {
arraySize = 2;
size = 0;
data = new T[arraySize];
}
//deconstructor
//cleanup objects
template <class T> ArrayList<T> :: ~ArrayList() {
// delete arraySize;
// delete size;
delete []data;
};
//takes in and index and returns the object associated with it
//return NULL or nothing if index is outta range
template <class T> T ArrayList<T> :: get(int index) {
if (!isValidIndex(index)) return 0;
return data[index];
}
//returns the index of the given obj
//or -1 if not found
template <class T> int ArrayList<T> :: indexOf(T &d) {
for (int i = 0; i < size; i++) {
if (data[i] == *d) return i;
}
return -1;
}
//adds the given data to the end of the list
//expands the list if neccisary
template <class T> void ArrayList<T> :: add(T &d) {
if (needsExpansion()) expandArray();
data[size++] = d;
}
//adds the given data to the given index
//expands the list if necessary
template <class T> void ArrayList<T> :: add(T &d, int index) {
if (needsExpansion()) expandArray();
//accept index at size
if (!(index >= 0 && index <= size)) return;
//move all obj's at >= index up 1
for (int i = size() - 1; i >= 0; i--) {
if (i >= index) {
data[i + 1] = data[i];
}
}
data[index] = d;
size++;
}
//removes the element at the given index
template <class T> bool ArrayList<T> :: remove(int index) {
if (!isValidIndex(index)) return false;
//shift elements down
for (int i = index + 1; i < size(); i++) {
data[i - 1] = data[i];
}
//remove last element
data[size--] = nullptr;
return true;
}
//TRUE if the element exists in the array
//FALSE otherwise.
template <class T> bool ArrayList<T> ::contains(T &d) {
return indexOf(d) >= 0;
}
//clears out the data that this arraylist holds
template <class T> void ArrayList<T> :: clear() {
size = 0;
arraySize = 2;
delete []data;
*data = new T[arraySize];
}
//TRUE if this array list has no elements.
template <class T> bool ArrayList<T> :: isEmpty() {
return size == 0;
}
//TRUE if this array needs to be expanded.
//needs expansion if it is full.
template<class T> bool ArrayList<T> :: needsExpansion() {
return size >= arraySize;
}
//expands the array by twice the given size
template<class T> void ArrayList<T> :: expandArray() {
arraySize *= 2;
T *newData = new T[arraySize];
for (int i = 0; i < size; i++) {
newData[i] = data[i];
}
delete []data;
data = newData;
}
//check if the index is valid
template<class T>
bool ArrayList<T>::isValidIndex(int index) {
return index >= 0 && index < size;
}
It compiles after adding #pragma once.
2 Answers
Do not use 0 or NULL to represent the null pointer
Instead use nullptr which is type safe. Why?
Well, there's quite the problem when you return the type T because objects in C++ (not confuse with pointers) have't on its range of possible values the nullptr value. It forces you to decide if there is a default value which in the case of objects is fine because you may define a non-argument constructor and say "that's my default object" but when dealing with primitive types is where the problem appears.
You may consider declaring your array as:
private:
int arraySize;// Size of the array.
int size; // Number of elements in the array.
T **array;// Pointer to the array. (initialize in constructors)
but it leads to another problem, you could say why don't I return pointers but if you wrongly delete some of the pointers that have been retrieved from the ArrayList you are likely to cause a segfault or UB in the future. Why? because the address of the returned type is being shared and so when you delete but not set the pointer in the ArrayList to nullptr (which is a good practice instead of using NULL) at the moment to compare it with nullptr which is the default value it will be false and if you are trying to access said pointer then segfault.
How could I solve such trouble? You may create a new pointer passing the data of the accessed type and that would unlink the pointer in ArrayList from the pointer you are receiving when calling operator[] in example.
//takes in and index and returns the object associated with it
//return NULL or nothing if index is outta range
template <class T>
T *ArrayList<T>::get(int index) {
if (!isValidIndex(index)) return nullptr;
T *with_new_address = new T; // if T is an object must have a default constructor
*with_new_address = *(data[index]); // data[index] now returns a *T type
return with_new_address;
}
I hope it helped you. Even at this time (1 year latter)
Answered by sɪʒɪhɪŋ βɪstɦa kxɐll on January 2, 2022
Some small structure feedback:
1. The template keyword should be above the function definition
Templated functions is usually written like you have written your constructor with the template keyword ontop of the function definition. Like this:
template<class T>
T ArrayList<T>::get(int index)
{
//Implementation here
}
It is easier to understand at a glance this way.
2. Don't use using namespace std;
It's bad practice, and the earlier you stop using it the easier it is.
If you don't know what it does, it removes the need to write std:: before functions in the standard namespace. Example: cout << instead of std::cout <<.
It might seem handy in the beginning but it will possibly cause problems in the future so it's better to just get used to it.
3. Templated classes should be implemented in the header
.cpp files should not be used when dealing with templates. See this for more information.
If you want to separate the definition from the implementation you can use a .inl file. Like this:
ArrayList.h:
#pragma once
template <class T>
class ArrayList
{
public:
ArrayList();
// Rest of your functions here.
};
//Notice this:
#include "ArrayList.inl"
ArrayList.inl:
//Notice: No #include here
template<class T>
ArrayList<T>::ArrayList()
{
//Implementation here
}
Answered by Oscar on January 2, 2022
Add your own answers!
Related Questions
Print a christmas tree
3 Asked on December 24, 2021
Circular Array – OOP
1 Asked on December 22, 2021
Rock, Paper, Scissor – Game
1 Asked on December 22, 2021 by ltcd2cv
Online Reader System Object Oriented System
2 Asked on December 22, 2021 by neslihan-bozer
Super Compact Bresenham’s Line Algorithm Variant
1 Asked on December 22, 2021 by fatalsleep
ArrayList implementation in C
2 Asked on December 21, 2021 by parvinder-singh-saini
x64 NASM Assembler: Binary Search
1 Asked on December 19, 2021 by christian_schmidt
Iteratively Exporting PDF Reports with Excel
0 Asked on December 19, 2021 by potterfan
Sort an array of 0s, 1s and 2s in Java
5 Asked on December 17, 2021 by anirudh-thatipelli
Proper way to unit test MD5 Hashing of Zip Files from URL using JUnit 5?
1 Asked on December 17, 2021 by pacificnw_lover
Parsing HTTP request for webserver implementation
0 Asked on December 17, 2021 by campos-ilya
C date information program
3 Asked on December 15, 2021
Ask a Question
Get help from others!
© 2023 AnswerBun.com. All rights reserved. Sites we Love: PCI Database, MenuIva, UKBizDB, Menu Kuliner, Sharing RPP, SolveDir
|
{
"url": "https://answerbun.com/code-review/c-arraylist-implementation/",
"source_domain": "answerbun.com",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "76933",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:G5CNIBZGRIAPW2MF3ARRR7VPZY3CQIOT",
"WARC-Concurrent-To": "<urn:uuid:75b4380e-366e-44cd-bd96-22466f7590ca>",
"WARC-Date": "2023-01-28T23:02:40Z",
"WARC-IP-Address": "104.21.9.223",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DQZKEN2QA4HXOP6SHOLHBZ2RUPT2UMNR",
"WARC-Record-ID": "<urn:uuid:3298f470-c328-47d0-8b90-12febe50c611>",
"WARC-Target-URI": "https://answerbun.com/code-review/c-arraylist-implementation/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:540acb62-28d7-4ecd-9d3c-efb81af95f91>"
},
"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-138\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,
14,
15,
44,
45,
98,
99,
333,
334,
354,
389,
390,
401,
480,
643,
781,
782,
795,
796,
809,
846,
847,
855,
898,
915,
916,
956,
974,
975,
1071,
1093,
1094,
1138,
1161,
1162,
1212,
1232,
1233,
1302,
1337,
1338,
1385,
1410,
1438,
1439,
1488,
1513,
1514,
1566,
1585,
1586,
1644,
1665,
1666,
1704,
1747,
1748,
1757,
1758,
1798,
1848,
1895,
1896,
1944,
1971,
1972,
2029,
2053,
2054,
2116,
2150,
2153,
2154,
2169,
2170,
2193,
2194,
2215,
2216,
2230,
2262,
2280,
2308,
2327,
2341,
2370,
2372,
2373,
2389,
2407,
2457,
2481,
2500,
2519,
2522,
2523,
2586,
2635,
2689,
2729,
2753,
2755,
2756,
2793,
2814,
2869,
2906,
2943,
2949,
2964,
2966,
2967,
3012,
3044,
3096,
3137,
3159,
3161,
3162,
3203,
3235,
3298,
3339,
3366,
3414,
3452,
3496,
3522,
3557,
3567,
3573,
3594,
3606,
3608,
3609,
3650,
3710,
3754,
3780,
3827,
3858,
3864,
3890,
3918,
3935,
3937,
3938,
3980,
3999,
4055,
4083,
4085,
4086,
4134,
4184,
4198,
4217,
4236,
4266,
4268,
4269,
4312,
4364,
4386,
4388,
4389,
4432,
4465,
4523,
4553,
4555,
4556,
4600,
4655,
4675,
4710,
4747,
4777,
4783,
4802,
4822,
4824,
4825,
4855,
4873,
4918,
4957,
4959,
4960,
4999,
5000,
5010,
5011,
5062,
5063,
5108,
5109,
5519,
5520,
5562,
5563,
5572,
5612,
5662,
5730,
5731,
6284,
6285,
6502,
6503,
6566,
6615,
6634,
6668,
6714,
6800,
6877,
6906,
6908,
6909,
6965,
6966,
7018,
7019,
7050,
7051,
7115,
7116,
7265,
7266,
7285,
7316,
7318,
7346,
7348,
7349,
7398,
7399,
7433,
7434,
7505,
7506,
7659,
7660,
7786,
7787,
7844,
7845,
7935,
7936,
8035,
8036,
8049,
8050,
8063,
8064,
8084,
8101,
8103,
8111,
8129,
8130,
8167,
8170,
8171,
8186,
8211,
8212,
8227,
8228,
8255,
8256,
8274,
8300,
8302,
8330,
8332,
8333,
8370,
8371,
8393,
8394,
8412,
8413,
8436,
8437,
8467,
8468,
8472,
8473,
8494,
8495,
8525,
8526,
8530,
8531,
8559,
8560,
8601,
8602,
8610,
8611,
8655,
8656,
8704,
8705,
8709,
8710,
8759,
8760,
8804,
8805,
8813,
8814,
8844,
8845,
8900,
8901,
8903,
8904,
8938,
8939,
8990,
8991,
8999,
9000,
9045,
9046,
9089,
9090,
9094,
9095,
9134,
9135,
9187,
9188,
9198,
9199,
9272,
9273,
9322,
9323,
9327,
9328,
9378,
9379,
9424,
9425,
9431,
9432,
9459,
9460,
9490,
9491,
9499,
9500,
9515,
9516,
9538,
9539
],
"line_end_idx": [
14,
15,
44,
45,
98,
99,
333,
334,
354,
389,
390,
401,
480,
643,
781,
782,
795,
796,
809,
846,
847,
855,
898,
915,
916,
956,
974,
975,
1071,
1093,
1094,
1138,
1161,
1162,
1212,
1232,
1233,
1302,
1337,
1338,
1385,
1410,
1438,
1439,
1488,
1513,
1514,
1566,
1585,
1586,
1644,
1665,
1666,
1704,
1747,
1748,
1757,
1758,
1798,
1848,
1895,
1896,
1944,
1971,
1972,
2029,
2053,
2054,
2116,
2150,
2153,
2154,
2169,
2170,
2193,
2194,
2215,
2216,
2230,
2262,
2280,
2308,
2327,
2341,
2370,
2372,
2373,
2389,
2407,
2457,
2481,
2500,
2519,
2522,
2523,
2586,
2635,
2689,
2729,
2753,
2755,
2756,
2793,
2814,
2869,
2906,
2943,
2949,
2964,
2966,
2967,
3012,
3044,
3096,
3137,
3159,
3161,
3162,
3203,
3235,
3298,
3339,
3366,
3414,
3452,
3496,
3522,
3557,
3567,
3573,
3594,
3606,
3608,
3609,
3650,
3710,
3754,
3780,
3827,
3858,
3864,
3890,
3918,
3935,
3937,
3938,
3980,
3999,
4055,
4083,
4085,
4086,
4134,
4184,
4198,
4217,
4236,
4266,
4268,
4269,
4312,
4364,
4386,
4388,
4389,
4432,
4465,
4523,
4553,
4555,
4556,
4600,
4655,
4675,
4710,
4747,
4777,
4783,
4802,
4822,
4824,
4825,
4855,
4873,
4918,
4957,
4959,
4960,
4999,
5000,
5010,
5011,
5062,
5063,
5108,
5109,
5519,
5520,
5562,
5563,
5572,
5612,
5662,
5730,
5731,
6284,
6285,
6502,
6503,
6566,
6615,
6634,
6668,
6714,
6800,
6877,
6906,
6908,
6909,
6965,
6966,
7018,
7019,
7050,
7051,
7115,
7116,
7265,
7266,
7285,
7316,
7318,
7346,
7348,
7349,
7398,
7399,
7433,
7434,
7505,
7506,
7659,
7660,
7786,
7787,
7844,
7845,
7935,
7936,
8035,
8036,
8049,
8050,
8063,
8064,
8084,
8101,
8103,
8111,
8129,
8130,
8167,
8170,
8171,
8186,
8211,
8212,
8227,
8228,
8255,
8256,
8274,
8300,
8302,
8330,
8332,
8333,
8370,
8371,
8393,
8394,
8412,
8413,
8436,
8437,
8467,
8468,
8472,
8473,
8494,
8495,
8525,
8526,
8530,
8531,
8559,
8560,
8601,
8602,
8610,
8611,
8655,
8656,
8704,
8705,
8709,
8710,
8759,
8760,
8804,
8805,
8813,
8814,
8844,
8845,
8900,
8901,
8903,
8904,
8938,
8939,
8990,
8991,
8999,
9000,
9045,
9046,
9089,
9090,
9094,
9095,
9134,
9135,
9187,
9188,
9198,
9199,
9272,
9273,
9322,
9323,
9327,
9328,
9378,
9379,
9424,
9425,
9431,
9432,
9459,
9460,
9490,
9491,
9499,
9500,
9515,
9516,
9538,
9539,
9664
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9664,
"ccnet_original_nlines": 359,
"rps_doc_curly_bracket": 0.004966889973729849,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28544244170188904,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04424358159303665,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.31255945563316345,
"rps_doc_frac_unique_words": 0.30974072217941284,
"rps_doc_mean_word_length": 4.724596977233887,
"rps_doc_num_sentences": 73,
"rps_doc_symbol_to_word_ratio": 0.00285442010499537,
"rps_doc_unigram_entropy": 5.358523368835449,
"rps_doc_word_count": 1427,
"rps_doc_frac_chars_dupe_10grams": 0.050430141389369965,
"rps_doc_frac_chars_dupe_5grams": 0.1564817577600479,
"rps_doc_frac_chars_dupe_6grams": 0.12488876283168793,
"rps_doc_frac_chars_dupe_7grams": 0.08751112222671509,
"rps_doc_frac_chars_dupe_8grams": 0.0664491206407547,
"rps_doc_frac_chars_dupe_9grams": 0.0664491206407547,
"rps_doc_frac_chars_top_2gram": 0.01779887080192566,
"rps_doc_frac_chars_top_3gram": 0.024918420240283012,
"rps_doc_frac_chars_top_4gram": 0.011865920387208462,
"rps_doc_books_importance": -886.3197021484375,
"rps_doc_books_importance_length_correction": -886.3197021484375,
"rps_doc_openwebtext_importance": -491.3930969238281,
"rps_doc_openwebtext_importance_length_correction": -491.3930969238281,
"rps_doc_wikipedia_importance": -356.536865234375,
"rps_doc_wikipedia_importance_length_correction": -356.536865234375
},
"fasttext": {
"dclm": 0.12430667877197266,
"english": 0.6945827603340149,
"fineweb_edu_approx": 1.8097890615463257,
"eai_general_math": 0.5815337300300598,
"eai_open_web_math": 0.053934041410684586,
"eai_web_code": 0.7681488394737244
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "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": "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
|
6,068,399,493,348,328,000 |
XRControl.GetEffectiveTextAlignment() Method
Returns the text alignment actually used as the control's text alignment.
Namespace: DevExpress.XtraReports.UI
Assembly: DevExpress.XtraReports.v20.2.dll
Declaration
public virtual TextAlignment GetEffectiveTextAlignment()
Public Overridable Function GetEffectiveTextAlignment As TextAlignment
Returns
Type Description
TextAlignment
A TextAlignment enumeration value representing the effective text alignment.
Remarks
The GetEffectiveTextAlignment method returns the real text alignment, according to the control's XRControl.TextAlignment property value, the StylePriority.UseTextAlignment property value of the control's XRControl.StylePriority (if any styles are assigned to the control's XRControl.Styles collection); and the value returned by the GetEffectiveTextAlignment method of the control's parent.
See Also
|
{
"url": "https://docs.devexpress.com/XtraReports/DevExpress.XtraReports.UI.XRControl.GetEffectiveTextAlignment",
"source_domain": "docs.devexpress.com",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "207214",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:A7YQJ73XWEFJHBXIIUYV4734R4QIB5FQ",
"WARC-Concurrent-To": "<urn:uuid:6df08f12-c7fa-4e15-a69d-7aba4811f9f2>",
"WARC-Date": "2021-01-25T20:10:27Z",
"WARC-IP-Address": "52.175.254.10",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OUF7AQCH7HZCRKG3F6RF4K3WI45OUM6N",
"WARC-Record-ID": "<urn:uuid:2308464c-378b-4b3a-8d4b-4eddef4c0bfd>",
"WARC-Target-URI": "https://docs.devexpress.com/XtraReports/DevExpress.XtraReports.UI.XRControl.GetEffectiveTextAlignment",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e1e47cb6-0e86-49ce-b461-fe5bcf133aee>"
},
"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-172.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,
45,
46,
120,
121,
158,
159,
202,
203,
215,
216,
273,
344,
345,
353,
354,
371,
385,
386,
463,
464,
472,
473,
864,
865
],
"line_end_idx": [
45,
46,
120,
121,
158,
159,
202,
203,
215,
216,
273,
344,
345,
353,
354,
371,
385,
386,
463,
464,
472,
473,
864,
865,
873
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 873,
"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.25,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015151520259678364,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21212120354175568,
"rps_doc_frac_unique_words": 0.5617977380752563,
"rps_doc_mean_word_length": 8.359550476074219,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.5997025966644287,
"rps_doc_word_count": 89,
"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.0739247277379036,
"rps_doc_frac_chars_top_3gram": 0.04301074892282486,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -60.49856948852539,
"rps_doc_books_importance_length_correction": -60.49856948852539,
"rps_doc_openwebtext_importance": -35.45622253417969,
"rps_doc_openwebtext_importance_length_correction": -29.357717514038086,
"rps_doc_wikipedia_importance": -21.380878448486328,
"rps_doc_wikipedia_importance_length_correction": -21.380878448486328
},
"fasttext": {
"dclm": 0.026105230674147606,
"english": 0.6585277318954468,
"fineweb_edu_approx": 2.9744930267333984,
"eai_general_math": 0.018053000792860985,
"eai_open_web_math": 0.29257863759994507,
"eai_web_code": 0.02558279037475586
}
}
|
{
"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": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "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
|
-6,323,741,251,355,981,000 |
Object Oriented Programming With JavaScript - Part 2 🚀
Ali Samir
Feb 19
3 min read
post_comment0 Comments
post_like5 Likes
In the field of software development, Object-Oriented Programming (OOP) is a crucial paradigm that provides a structured way to create complex systems.
In Part 1, we covered the basics of OOP, including Objects and Inheritance.
In Part 2, we will delve deeper into these fundamental concepts, exploring Encapsulation, Abstraction, and Polymorphism.
#🔰 Encapsulation
Encapsulation encompasses the consolidation of data (properties) and methods (functions) within a singular unit, known as an object. Through this principle, an object gains autonomy over its state while concealing internal workings from external entities.
This encapsulation mechanism relies on closures, scope management, and access control, though it's noteworthy that in JavaScript, conventional access modifiers such as private or public are absent.
#Using Closures for Encapsulation 💯
In JavaScript, closures facilitate the establishment of private variables and methods, confining their accessibility within the object's scope and preventing external access.
function createCounter() { let count = 0; // Private variable return { increment: function() { count++; }, getCount: function() { return count; } }; } let counter = createCounter(); counter.increment(); console.log(counter.getCount()); // Output: 1 console.log(counter.count); // Output: undefined (count is private)
Here, count is encapsulated within the createCounter function, and the returned object provides controlled access to its state through increment and getCount methods.
#🔰 Abstraction
Abstraction simplifies intricate realities by constructing classes or objects tailored to the problem at hand. This process enables developers to concentrate on the core characteristics of an object, shielding irrelevant complexities.
Achieving abstraction entails leveraging tools such as classes, interfaces, and abstract methods. These mechanisms streamline the representation of concepts, fostering clearer and more efficient software design.
Example of Abstraction with Classes
class Shape { constructor(color) { this.color = color; } // Abstract method calculateArea() { throw new Error('Method must be implemented'); } } class Circle extends Shape { constructor(radius, color) { super(color); this.radius = radius; } calculateArea() { return Math.PI * this.radius ** 2; } } let myCircle = new Circle(5, 'red'); console.log(myCircle.calculateArea()); // Output: ~78.54
#📌Benefits of Encapsulation and Abstraction
• Security:Encapsulation shields sensitive data, revealing only essential functionality to prevent unauthorized access or alteration of internal states.
• Modularity:Encapsulation fosters the development of independent objects, enhancing modularity and facilitating simpler maintenance procedures.
• Simplicity:Abstraction streamlines intricate systems by emphasizing core features, and enhancing code clarity and manageability.
#🔰 Polymorphism
Polymorphism, a fundamental principle within Object-Oriented Programming (OOP), enables objects of various classes to be treated as instances of a shared superclass.
In JavaScript, this capability is realized through method overriding. Subclasses possess the ability to redefine methods inherited from their parent classes, thereby offering distinct implementations while preserving the method's original signature.
// Creating a superclass class Animal { makeSound() { return 'Some generic sound'; } } // Creating a subclass class Dog extends Animal { makeSound() { return 'Woof!'; } } // Creating instances let genericAnimal = new Animal(); let dog = new Dog(); console.log(genericAnimal.makeSound()); // Output: Some generic sound console.log(dog.makeSound()); // Output: Woof!
#Conclusion ❤️
JavaScript's incorporation of OOP enables the crafting of adaptable, reusable, and easily maintainable code through the utilization of objects, prototypes, inheritance, encapsulation, abstraction, and polymorphism. Proficiency in these fundamental principles equips developers to architect scalable and streamlined applications within the JavaScript ecosystem, fostering enhanced efficiency and robustness.
Happy Coding!🔥
|
{
"url": "https://mentoor.io/posts/662739864/object-oriented-programming-with-javascript-part-2?bot=true",
"source_domain": "mentoor.io",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "65127",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WLRZ3DCK2CU5KBIYCARLM5R5CXE2QUXY",
"WARC-Concurrent-To": "<urn:uuid:8b2ea9b7-e21f-42dd-a92c-a40143d3de22>",
"WARC-Date": "2024-07-23T07:39:42Z",
"WARC-IP-Address": "146.59.111.28",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HSY2OTLZGUZWPAAWT4QTBVTR7CZKEWRE",
"WARC-Record-ID": "<urn:uuid:98919b8a-a3a2-40db-9a8b-958339b98851>",
"WARC-Target-URI": "https://mentoor.io/posts/662739864/object-oriented-programming-with-javascript-part-2?bot=true",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1e024a4e-61c1-4978-92b4-57505baa8209>"
},
"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-168\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,
55,
56,
66,
73,
84,
107,
124,
125,
277,
278,
354,
355,
476,
477,
478,
495,
496,
752,
753,
951,
952,
953,
989,
990,
1165,
1166,
1483,
1484,
1651,
1652,
1653,
1654,
1669,
1670,
1905,
1906,
2118,
2119,
2155,
2156,
2548,
2549,
2593,
2594,
2749,
2750,
2897,
2898,
3031,
3032,
3033,
3034,
3050,
3051,
3217,
3218,
3468,
3469,
3834,
3835,
3836,
3851,
3852,
4259,
4260,
4261
],
"line_end_idx": [
55,
56,
66,
73,
84,
107,
124,
125,
277,
278,
354,
355,
476,
477,
478,
495,
496,
752,
753,
951,
952,
953,
989,
990,
1165,
1166,
1483,
1484,
1651,
1652,
1653,
1654,
1669,
1670,
1905,
1906,
2118,
2119,
2155,
2156,
2548,
2549,
2593,
2594,
2749,
2750,
2897,
2898,
3031,
3032,
3033,
3034,
3050,
3051,
3217,
3218,
3468,
3469,
3834,
3835,
3836,
3851,
3852,
4259,
4260,
4261,
4275
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4275,
"ccnet_original_nlines": 66,
"rps_doc_curly_bracket": 0.006549709942191839,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1975642740726471,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006765900179743767,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2909336984157562,
"rps_doc_frac_unique_words": 0.5461689829826355,
"rps_doc_mean_word_length": 6.728879928588867,
"rps_doc_num_sentences": 39,
"rps_doc_symbol_to_word_ratio": 0.00811908021569252,
"rps_doc_unigram_entropy": 5.30118989944458,
"rps_doc_word_count": 509,
"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.007007299922406673,
"rps_doc_frac_chars_top_3gram": 0.016350360587239265,
"rps_doc_frac_chars_top_4gram": 0.02277372032403946,
"rps_doc_books_importance": -296.5159912109375,
"rps_doc_books_importance_length_correction": -296.5159912109375,
"rps_doc_openwebtext_importance": -170.8248748779297,
"rps_doc_openwebtext_importance_length_correction": -170.8248748779297,
"rps_doc_wikipedia_importance": -104.35478210449219,
"rps_doc_wikipedia_importance_length_correction": -104.35478210449219
},
"fasttext": {
"dclm": 0.5376763343811035,
"english": 0.7840017080307007,
"fineweb_edu_approx": 3.0610103607177734,
"eai_general_math": 0.6013637185096741,
"eai_open_web_math": 0.12842440605163574,
"eai_web_code": 0.8940889239311218
}
}
|
{
"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": "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": "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,853,603,944,285,963,000 |
blob: 12f182fd69cda1a3e419b5c619155a5dd43cd4f6 [file] [log] [blame]
// Copyright 2022, The Android Open Source Project
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
use std::collections::VecDeque;
use std::sync::{Arc, Mutex};
use tokio::sync::Notify;
use tokio::time::{timeout, Duration};
use crate::params::{DeviceState, ReasonCode, SessionId, SessionState};
use crate::service::uwb_service::UwbServiceCallback;
use crate::uci::SessionRangeData;
#[derive(Clone, Default)]
pub(crate) struct MockUwbServiceCallback {
expected_calls: Arc<Mutex<VecDeque<ExpectedCall>>>,
expect_call_consumed: Arc<Notify>,
}
impl MockUwbServiceCallback {
pub fn new() -> Self {
Default::default()
}
pub fn expect_on_service_reset(&mut self, success: bool) {
self.push_expected_call(ExpectedCall::ServiceReset { success });
}
pub fn expect_on_uci_device_status_changed(&mut self, state: DeviceState) {
self.push_expected_call(ExpectedCall::UciDeviceStatus { state });
}
pub fn expect_on_session_state_changed(
&mut self,
session_id: SessionId,
session_state: SessionState,
reason_code: ReasonCode,
) {
self.push_expected_call(ExpectedCall::SessionState {
session_id,
session_state,
reason_code,
});
}
pub fn expect_on_range_data_received(
&mut self,
session_id: SessionId,
range_data: SessionRangeData,
) {
self.push_expected_call(ExpectedCall::RangeData { session_id, range_data });
}
pub fn expect_on_vendor_notification_received(&mut self, gid: u32, oid: u32, payload: Vec<u8>) {
self.push_expected_call(ExpectedCall::VendorNotification { gid, oid, payload });
}
pub async fn wait_expected_calls_done(&mut self) -> bool {
while !self.expected_calls.lock().unwrap().is_empty() {
if timeout(Duration::from_secs(1), self.expect_call_consumed.notified()).await.is_err()
{
return false;
}
}
true
}
fn push_expected_call(&mut self, call: ExpectedCall) {
self.expected_calls.lock().unwrap().push_back(call);
}
fn pop_expected_call(&mut self) -> ExpectedCall {
let call = self.expected_calls.lock().unwrap().pop_front().unwrap();
self.expect_call_consumed.notify_one();
call
}
}
impl UwbServiceCallback for MockUwbServiceCallback {
fn on_service_reset(&mut self, success: bool) {
assert_eq!(self.pop_expected_call(), ExpectedCall::ServiceReset { success });
}
fn on_uci_device_status_changed(&mut self, state: DeviceState) {
assert_eq!(self.pop_expected_call(), ExpectedCall::UciDeviceStatus { state });
}
fn on_session_state_changed(
&mut self,
session_id: SessionId,
session_state: SessionState,
reason_code: ReasonCode,
) {
assert_eq!(
self.pop_expected_call(),
ExpectedCall::SessionState { session_id, session_state, reason_code }
);
}
fn on_range_data_received(&mut self, session_id: SessionId, range_data: SessionRangeData) {
assert_eq!(self.pop_expected_call(), ExpectedCall::RangeData { session_id, range_data });
}
fn on_vendor_notification_received(&mut self, gid: u32, oid: u32, payload: Vec<u8>) {
assert_eq!(
self.pop_expected_call(),
ExpectedCall::VendorNotification { gid, oid, payload }
);
}
}
#[derive(PartialEq, Debug)]
pub(crate) enum ExpectedCall {
ServiceReset { success: bool },
UciDeviceStatus { state: DeviceState },
SessionState { session_id: SessionId, session_state: SessionState, reason_code: ReasonCode },
RangeData { session_id: SessionId, range_data: SessionRangeData },
VendorNotification { gid: u32, oid: u32, payload: Vec<u8> },
}
|
{
"url": "https://chromium.googlesource.com/aosp/platform/external/uwb/+/6b2f19073a669ad88106660ca40e18e1a5f764ce/src/rust/uwb_core/src/service/mock_uwb_service_callback.rs",
"source_domain": "chromium.googlesource.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "52410",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:M2DFAR5M6JLTPLKDJA6G2LHXXNCFPSQL",
"WARC-Concurrent-To": "<urn:uuid:f6abb357-5fb7-4651-a42b-25cdab0adcb7>",
"WARC-Date": "2024-03-01T19:04:13Z",
"WARC-IP-Address": "142.251.163.82",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QOEAMGEOKSGWBRV6PWU7UTPCOKUVZQHF",
"WARC-Record-ID": "<urn:uuid:1f1a7bbe-3f97-451c-b279-4cf12bf09f15>",
"WARC-Target-URI": "https://chromium.googlesource.com/aosp/platform/external/uwb/+/6b2f19073a669ad88106660ca40e18e1a5f764ce/src/rust/uwb_core/src/service/mock_uwb_service_callback.rs",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:81361e43-c5e5-4efc-affa-19d61e1a8e1c>"
},
"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-144\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,
68,
119,
122,
189,
257,
300,
303,
349,
352,
423,
492,
568,
639,
673,
705,
734,
759,
797,
868,
921,
955,
981,
1024,
1076,
1111,
1113,
1143,
1166,
1185,
1187,
1246,
1311,
1313,
1389,
1455,
1457,
1497,
1508,
1531,
1560,
1585,
1589,
1642,
1654,
1669,
1682,
1686,
1688,
1726,
1737,
1760,
1790,
1794,
1871,
1873,
1970,
2051,
2053,
2112,
2168,
2256,
2258,
2272,
2274,
2276,
2281,
2283,
2338,
2391,
2393,
2443,
2512,
2552,
2557,
2559,
2561,
2614,
2662,
2740,
2742,
2807,
2886,
2888,
2917,
2928,
2951,
2980,
3005,
3009,
3021,
3047,
3117,
3120,
3122,
3214,
3304,
3306,
3392,
3404,
3430,
3485,
3488,
3490,
3492,
3520,
3551,
3583,
3623,
3717,
3784,
3845
],
"line_end_idx": [
68,
119,
122,
189,
257,
300,
303,
349,
352,
423,
492,
568,
639,
673,
705,
734,
759,
797,
868,
921,
955,
981,
1024,
1076,
1111,
1113,
1143,
1166,
1185,
1187,
1246,
1311,
1313,
1389,
1455,
1457,
1497,
1508,
1531,
1560,
1585,
1589,
1642,
1654,
1669,
1682,
1686,
1688,
1726,
1737,
1760,
1790,
1794,
1871,
1873,
1970,
2051,
2053,
2112,
2168,
2256,
2258,
2272,
2274,
2276,
2281,
2283,
2338,
2391,
2393,
2443,
2512,
2552,
2557,
2559,
2561,
2614,
2662,
2740,
2742,
2807,
2886,
2888,
2917,
2928,
2951,
2980,
3005,
3009,
3021,
3047,
3117,
3120,
3122,
3214,
3304,
3306,
3392,
3404,
3430,
3485,
3488,
3490,
3492,
3520,
3551,
3583,
3623,
3717,
3784,
3845,
3846
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3846,
"ccnet_original_nlines": 111,
"rps_doc_curly_bracket": 0.01976078934967518,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10054347664117813,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014945649541914463,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.46603262424468994,
"rps_doc_frac_unique_words": 0.5016501545906067,
"rps_doc_mean_word_length": 9.465346336364746,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0.0027173899579793215,
"rps_doc_unigram_entropy": 4.573836803436279,
"rps_doc_word_count": 303,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.13040445744991302,
"rps_doc_frac_chars_dupe_6grams": 0.09762901067733765,
"rps_doc_frac_chars_dupe_7grams": 0.06764295697212219,
"rps_doc_frac_chars_dupe_8grams": 0.048117149621248245,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02092050015926361,
"rps_doc_frac_chars_top_3gram": 0.030683400109410286,
"rps_doc_frac_chars_top_4gram": 0.02615063078701496,
"rps_doc_books_importance": -265.9946594238281,
"rps_doc_books_importance_length_correction": -265.9946594238281,
"rps_doc_openwebtext_importance": -164.51187133789062,
"rps_doc_openwebtext_importance_length_correction": -164.51187133789062,
"rps_doc_wikipedia_importance": -137.154296875,
"rps_doc_wikipedia_importance_length_correction": -137.154296875
},
"fasttext": {
"dclm": 0.9604459404945374,
"english": 0.4173145294189453,
"fineweb_edu_approx": 1.451979160308838,
"eai_general_math": 0.3799758553504944,
"eai_open_web_math": 0.007591430097818375,
"eai_web_code": 0.9922976493835449
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "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": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,728,069,525,256,383,500 |
I have my local dev setting up using MAMP on port 8888
'mydomain.dev:8888' => array(
// ...
'environmentVariables' => array(
'basePath' => '/Users/mypath/SiteCode/mydomain/dev/',
'baseUrl' => '//mydomain.dev:8888/',
'logDumpMethod' => 'print_r'
),
'logDumpMethod' => 'print_r',
'devMode' => true,
'useCompressedJs' => true,
'siteUrl' => array(
'en' => 'http://mydomain.dev:8888/en/',
'ar' => 'http://mydomain.dev:8888/ar/',
'zh' => 'http://mydomain.dev:8888/zh/',
'fil' => 'http://mydomain.dev:8888/fil/',
'fr' => 'http://mydomain.dev:8888/fr/',
'hi' => 'http://mydomain.dev:8888/hi/',
'id' => 'http://mydomain.dev:8888/id/',
'ru' => 'http://mydomain.dev:8888/ru/',
'es' => 'http://mydomain.dev:8888/es/',
'tr' => 'http://mydomain.dev:8888/tr/',
'uk' => 'http://mydomain.dev:8888/uk/',
'ur' => 'http://mydomain.dev:8888/ur/'
),
),
In the admin general settings I am using {siteUrl} for siteUrl settings. This gets read from the local dev config array as above.
However the admin link on the site in the control panel top left gets the url wrong. Instead of http://mydomain.dev:8888 it shows http://mydomain.dev:8888/admin/%7BsiteUrl%7D/
I have other local craft sites setup with port number 8888 O.K. The only difference here is that the siteUrl is specified in a multilingual array.
Is this a bug or am I missing something?
Pretty sure the issue is that a port number won't work as part of the key in a multi-environment config. Because unless you explicitly set CRAFT_ENVIRONMENT to use it, Craft is just going to use $_SERVER['SERVER_NAME'], which doesn't include the :port (that's at $_SERVER['SERVER_PORT']).
There's another thread here with some solutions/workarounds.
Your Answer
By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "https://craftcms.stackexchange.com/questions/15095/multilingual-mamp-port-number-siteurl-issue",
"source_domain": "craftcms.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2018-47",
"warc_metadata": {
"Content-Length": "121024",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Y36AOGZTW4DXLQSX2ZVCU4UKNF2N2HWQ",
"WARC-Concurrent-To": "<urn:uuid:947951b3-fb11-4d1c-9d31-9b5cca2f8c13>",
"WARC-Date": "2018-11-18T19:40:15Z",
"WARC-IP-Address": "151.101.1.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AEBHPFBTWFAT3642C26F45RFKGKKR3HS",
"WARC-Record-ID": "<urn:uuid:cf80b6fe-747f-4ed2-a6fb-1031e90b226d>",
"WARC-Target-URI": "https://craftcms.stackexchange.com/questions/15095/multilingual-mamp-port-number-siteurl-issue",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0680eb6a-d51a-4b8d-bfe3-a384ee340e39>"
},
"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-141-253-120.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,
55,
56,
88,
99,
136,
198,
244,
281,
288,
322,
345,
376,
400,
449,
498,
547,
597,
646,
695,
744,
793,
842,
891,
940,
988,
995,
996,
999,
1000,
1130,
1131,
1307,
1308,
1455,
1456,
1497,
1498,
1787,
1788,
1849,
1850,
1862,
1863,
1865,
1866,
2070,
2071
],
"line_end_idx": [
55,
56,
88,
99,
136,
198,
244,
281,
288,
322,
345,
376,
400,
449,
498,
547,
597,
646,
695,
744,
793,
842,
891,
940,
988,
995,
996,
999,
1000,
1130,
1131,
1307,
1308,
1455,
1456,
1497,
1498,
1787,
1788,
1849,
1850,
1862,
1863,
1865,
1866,
2070,
2071,
2161
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2161,
"ccnet_original_nlines": 47,
"rps_doc_curly_bracket": 0.0009255000040866435,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.19342359900474548,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025145070627331734,
"rps_doc_frac_lines_end_with_ellipsis": 0.02083333022892475,
"rps_doc_frac_no_alph_words": 0.43133461475372314,
"rps_doc_frac_unique_words": 0.649789035320282,
"rps_doc_mean_word_length": 5.95780611038208,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0.0019342399900779128,
"rps_doc_unigram_entropy": 4.825350284576416,
"rps_doc_word_count": 237,
"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.007082149852067232,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -213.6961669921875,
"rps_doc_books_importance_length_correction": -213.6961669921875,
"rps_doc_openwebtext_importance": -109.6618881225586,
"rps_doc_openwebtext_importance_length_correction": -109.6618881225586,
"rps_doc_wikipedia_importance": -26.64934539794922,
"rps_doc_wikipedia_importance_length_correction": -26.64934539794922
},
"fasttext": {
"dclm": 0.15506339073181152,
"english": 0.6959794163703918,
"fineweb_edu_approx": 1.048535704612732,
"eai_general_math": 0.00022835000709164888,
"eai_open_web_math": 0.0742490291595459,
"eai_web_code": 0.0019240999827161431
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
-1,552,186,364,141,624,300 |
mIRC PR Sorgulama
on *:text:*:#: if ($1 == !pr) && $2 { set %:kanal # | var %:ipr $r(100,9999) | sockopen $+(ifpr,%:ipr) www.ircforumlari.net 80 | sockmark $+(ifpr,%:ipr) $remove($2,www.,http://) }
on *:input:#: if ($1 == !pr) && $2 { set %:kanal # | var %:ipr $r(100,9999) | sockopen $+(ifpr,%:ipr) www.ircforumlari.net 80 | sockmark $+(ifpr,%:ipr) $remove($2,www.,http://) }
alias htmlfree { if ($len($1-) < = 900) { var %x, %i = $regsub($1,/(^[^<]*>|< [^>]*>|< [^>]*$)/g,$null,%x), %x = $remove(%x, ,$chr(9)) | return %x } }
on *:sockopen:ifpr*:{
var %:ifpr $+(doFormPostback=7f32992aa3803a49e8176a67da202d44&url=http%3A%2F%2Fwww.,$sock($sockname).mark)
sockwrite -nt $sockname POST /webanaliz/tool.php?id=estimate-pagerank HTTP/1.1
sockwrite -nt $sockname Host: www.ircforumlari.net
sockwrite -nt $sockname User-Agent: Mozilla/5.0 (Windows NT 6.1; rv:33.0) Gecko/20100101 Firefox/33.0
sockwrite -nt $sockname Accept: text/html,application/xhtml+xml,application/xml;q=0.9,*/*;q=0.8
sockwrite -nt $sockname Accept-Language: tr-TR,tr;q=0.8,en-US;q=0.5,en;q=0.3
sockwrite -nt $sockname Referer: http://www.ircforumlari.net/webanaliz/tool.php?id=estimate-pagerank
sockwrite -nt $sockname Connection: keep-alive
sockwrite -nt $sockname Content-Type: application/x-www-form-urlencoded
sockwrite -nt $sockname Content-Length: $len(%:ifpr)
sockwrite -nt $sockname
sockwrite -nt $sockname %:ifpr
}
on *:sockread:ifpr*:{
var %:pr | sockread %:pr | tokenize 32 %:pr
if (*
* iswm %:pr) { set %:ifpr oke! }
else if (%:ifpr) {
msg %:kanal 12G4o7o12g3l4e 12P4a12g4e7R4a3n12k URL= $+(http://www.,$sock($sockname).mark) - PR= $htmlfree(%:pr)
sockclose $sockname | unset %:ifpr
}
}
Kullanımı : !pr siteadı
ALINTIDIR.
Bir cevap yazın
E-posta hesabınız yayımlanmayacak. Gerekli alanlar * ile işaretlenmişlerdir
|
{
"url": "https://www.turkirc.com/mirc-pr-sorgulama/",
"source_domain": "www.turkirc.com",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "82250",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TSTLTCBHN46MJTPDP7JSRNDODCHTQAIU",
"WARC-Concurrent-To": "<urn:uuid:e148ddc3-0e87-4cbd-a089-2f5c91a37aec>",
"WARC-Date": "2024-09-10T00:08:36Z",
"WARC-IP-Address": "104.21.19.72",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SDIVCOLL3C4BALO2PLJCI2CKWA7IADG6",
"WARC-Record-ID": "<urn:uuid:35519e5b-faf3-4da8-bab9-3de0f81d6d47>",
"WARC-Target-URI": "https://www.turkirc.com/mirc-pr-sorgulama/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b040538c-f315-4f4f-930a-7b78a5c2e790>"
},
"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-248\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,
18,
19,
199,
378,
379,
530,
552,
659,
738,
789,
891,
987,
1064,
1165,
1212,
1284,
1337,
1361,
1392,
1394,
1416,
1460,
1466,
1467,
1500,
1519,
1631,
1666,
1668,
1670,
1671,
1672,
1696,
1707,
1708,
1724,
1725
],
"line_end_idx": [
18,
19,
199,
378,
379,
530,
552,
659,
738,
789,
891,
987,
1064,
1165,
1212,
1284,
1337,
1361,
1392,
1394,
1416,
1460,
1466,
1467,
1500,
1519,
1631,
1666,
1668,
1670,
1671,
1672,
1696,
1707,
1708,
1724,
1725,
1800
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1800,
"ccnet_original_nlines": 37,
"rps_doc_curly_bracket": 0.008888890035450459,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.049904029816389084,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02303262986242771,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5642994046211243,
"rps_doc_frac_unique_words": 0.5432098507881165,
"rps_doc_mean_word_length": 7.512345790863037,
"rps_doc_num_sentences": 35,
"rps_doc_symbol_to_word_ratio": 0.007677540183067322,
"rps_doc_unigram_entropy": 4.06725549697876,
"rps_doc_word_count": 162,
"rps_doc_frac_chars_dupe_10grams": 0.15119144320487976,
"rps_doc_frac_chars_dupe_5grams": 0.15119144320487976,
"rps_doc_frac_chars_dupe_6grams": 0.15119144320487976,
"rps_doc_frac_chars_dupe_7grams": 0.15119144320487976,
"rps_doc_frac_chars_dupe_8grams": 0.15119144320487976,
"rps_doc_frac_chars_dupe_9grams": 0.15119144320487976,
"rps_doc_frac_chars_top_2gram": 0.0994248166680336,
"rps_doc_frac_chars_top_3gram": 0.1717337667942047,
"rps_doc_frac_chars_top_4gram": 0.009860309772193432,
"rps_doc_books_importance": -266.8700866699219,
"rps_doc_books_importance_length_correction": -262.25115966796875,
"rps_doc_openwebtext_importance": -131.1271209716797,
"rps_doc_openwebtext_importance_length_correction": -131.1271209716797,
"rps_doc_wikipedia_importance": -96.87406158447266,
"rps_doc_wikipedia_importance_length_correction": -96.58981323242188
},
"fasttext": {
"dclm": 0.9546326398849487,
"english": 0.1876140683889389,
"fineweb_edu_approx": 1.8250435590744019,
"eai_general_math": 0.035137951374053955,
"eai_open_web_math": 0.2028403878211975,
"eai_web_code": 0.4017927050590515
}
}
|
{
"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": "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
|
8,780,751,102,524,983,000 |
Serverless Jenkinsfile: Serverless Secrets In Jenkinsfile Pipelines
Using Serverless Secrets in Jenkinsfile Pipelines
In this tutorial, I’ll explain how to use Serverless secrets in Jenkinsfile pipelines. In particular, I’ll explain how to use secrets as environment variables in Serverless applications, store those credentials in Jenkins, and have a Jenkinsfile pipeline deploy a serverless application using Docker that references those newly defined variables.
The example application used to explain these concepts will be the serverless-slack-app1 by John Agan on GitHub. This blog assumes introductory level knowledge of Git, Docker, Serverless, Jenkins, and Jenkinsfile pipelines.
To summarize, here are the goals of this Serverless secrets in Jenkinsfile pipelines tutorial:
1. Create a basic Jenkinsfile with Docker agents that deploys a Serverless application.
2. Convert custom variables in serverless.yml to reference environment variables.
3. Store Serverless secrets in Jenkinfile pipelines.
Step 1: Serverless Jenkinsfile Using Docker
Example Application
If you want to DIY as opposed to just reading, feel free to start with the example application. Keep in mind you’ll need a Jenkins instance with Docker available and an Amazon Web Services account that may incur charges for deploying the serverless application. If you want to spin up a Jenkins container that has Docker and Jenkinsfile pipelines already configured, feel free to use Liatrio’s Alpine-Jenkins image.
$ npm install -g serverless
$ serverless install --url https://github.com/johnagan/serverless-slack-app
$ cd serverless-slack-app/
Agent
For this Serverless application, we’re just going to use one Docker image as the agent. Since we want to keep it lightweight, we’re going with the Alpine version of Node, which comes in at roughly 71.1MB. (If you aren’t using Docker with Jenkins you can refer to the example on the Jenkins CI GitHub wiki that doesn’t use Docker.)
We’re also going to need to be running as root in the container to properly run Serverless commands, so we’ll specify running as root in the arguments.
Since we’re only using one image throughout the whole pipeline, we can define it just once in the beginning of the pipeline.
agent {
docker {
image 'node:alpine'
args '-u 0:0'
}
}
Environment
For the environment of the pipeline, we’re going to reference AWS credentials from Jenkins. For details on how to add credentials to Jenkins, refer to the Adding Docker Hub Credentials to Jenkins section from Building with Docker in Jenkins Pipelines. You can also refer to the official documentation.
environment {
AWS_ACCESS_KEY_ID = credentials('aws-secret-key-id')
AWS_SECRET_ACCESS_KEY = credentials('aws-secret-access-key')
}
These environment variables will be referenced automatically when the Serverless application is deployed. However, they will only be referenced automatically if a profile is not defined in serverless.yml. So, go ahead and delete this line in the example application’s serverless.yml file.
profile: serverless
With this line removed, the Serverless deployment will search for the default AWS profile, which is what we have defined in the Jenkinsfile.
Simple Serverless Jenkinsfile Using Docker
To keep things simple, we’re only going to define a Build stage and a Deploy stage for the Jenkinsfile. However, a Test stage could easily be added that ran an npm test command. Here’s the resulting Jenkinsfile that will successfully build and deploy our example application.
pipeline {
agent {
docker {
image 'node:alpine'
args '-u 0:0'
}
}
environment {
AWS_ACCESS_KEY_ID = credentials('aws-secret-key-id')
AWS_SECRET_ACCESS_KEY = credentials('aws-secret-access-key')
}
stages {
stage('Build') {
steps {
sh 'npm install'
}
}
stage('Deploy') {
steps {
sh 'npm install -g serverless'
sh 'serverless deploy'
}
}
}
}
This deploys our Serverless application! However, this works only if the Slack secrets are defined as text in the serverless.yml file. Let’s fix that.
Step 2: Set Custom Serverless Variables
Reference Environment Variables in Serverless Configuration
As it stands, our example application has required Slack variables defined as custom variables in serverless.yml. We need to change that so the variables are obtained from the environment. Luckily, the Serverless framework has a way to do that outlined in their official docs.
Before, we had something like this where the x’s represented secrets.
slack_verification_token: "xxxxxxxxxxxxx"
...
slack_client_id: "xxxxxxxxxx.xxxxxxxxxxxx"
slack_client_secret: "xxxxxxxxxxxxxxxxxx"
We can convert these into environment variable references.
slack_verification_token: ${env:SLACK_VERIFICATION_TOKEN}
...
slack_client_id: ${env:SLACK_CLIENT_ID}
slack_client_secret: ${env:SLACK_CLIENT_SECRET}
Great! Now our secrets are never defined in code.
Add Credentials to Jenkins
We need to add the SLACK_VERIFICATION_TOKEN, SLACK_CLIENT_ID, and SLACK_CLIENT_SECRET variables as secret text variables in Jenkins so that we can reference them in our Jenkinsfile. If you’re unsure how to do this, refer to the Environment section above.
Step 3: Finish Creating the Environment for Serverless Secrets in Jenkinsfile Pipelines
Now we need to add the newly defined credentials to our Jenkinsfile pipeline environment. We can do this the same way we defined our AWS credentials.
environment {
SLACK_VERIFICATION_TOKEN = credentials('slack-verification-token')
SLACK_CLIENT_ID = credentials('slack-client-id')
SLACK_CLIENT_SECRET = credentials('slack-client-secret')
AWS_ACCESS_KEY_ID = credentials('aws-secret-key-id')
AWS_SECRET_ACCESS_KEY = credentials('aws-secret-access-key')
}
Serverless Secrets in Jenkinsfile Pipelines
We’ve successfully created a Jenkinsfile that automatically deploys a Serverless application using custom secrets stored in Jenkins. If you want to see all of the code implemented in this Serverless secrets in Jenkinsfile pipelines tutorial (including the complete serverless.yml and Jenkinsfile), please check out the GitHub repository.
If you run into any issues, leave a comment below or tweet us @liatrio.
About Liatrio
Liatrio is an Enterprise Delivery Acceleration consulting firm that helps enterprises transform into world-class technology delivery organizations through successful adoption of DevOps collaboration and Lean software delivery practices. We work as “boots on the ground change agents,” uniting enterprise technology organizations by uplifting culture, tools, and processes.
Want to learn more? Let’s have a conversation.
Liatrio is also hiring! To learn more about our hiring process, check out recent posts on hiring tipsour interview processour hiring process, and hiring success the Liatrio Way. If you want to be a part of a team that solves challenges around software delivery automation, deployment pipelines and large-scale transformations, reach out!
1LICENSE
Leave a Reply
Your email address will not be published. Required fields are marked *
|
{
"url": "https://liatrio.com/serverless-secrets-in-jenkinsfile-pipelines/",
"source_domain": "liatrio.com",
"snapshot_id": "crawl=CC-MAIN-2018-51",
"warc_metadata": {
"Content-Length": "45039",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HM4F47GGONUEQNW27MJUYTVJ6AQEZRLI",
"WARC-Concurrent-To": "<urn:uuid:7d0d851b-2d74-4922-a753-3e028ea6efee>",
"WARC-Date": "2018-12-12T15:59:16Z",
"WARC-IP-Address": "143.95.40.24",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QX6ILHYTEQJM2Z5ZNG7QWZ2SE5F2NLUP",
"WARC-Record-ID": "<urn:uuid:6fc50e78-47a7-4a16-a5e1-496df0955595>",
"WARC-Target-URI": "https://liatrio.com/serverless-secrets-in-jenkinsfile-pipelines/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a42b1a45-08de-4d7b-a973-b4a621540ee0>"
},
"warc_info": "isPartOf: CC-MAIN-2018-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-137-134-86.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,
68,
69,
119,
120,
467,
468,
692,
693,
788,
789,
879,
963,
1018,
1019,
1063,
1064,
1084,
1085,
1501,
1502,
1530,
1606,
1633,
1634,
1640,
1641,
1972,
1973,
2125,
2126,
2251,
2252,
2262,
2275,
2301,
2321,
2327,
2331,
2332,
2344,
2345,
2647,
2648,
2662,
2717,
2780,
2782,
2783,
3072,
3073,
3093,
3094,
3235,
3236,
3279,
3280,
3556,
3557,
3568,
3578,
3591,
3617,
3637,
3643,
3647,
3663,
3720,
3785,
3789,
3800,
3821,
3835,
3860,
3868,
3874,
3896,
3910,
3949,
3980,
3988,
3994,
3998,
4000,
4001,
4152,
4153,
4193,
4194,
4254,
4255,
4532,
4533,
4603,
4604,
4648,
4655,
4701,
4745,
4746,
4805,
4806,
4865,
4870,
4911,
4960,
4961,
5011,
5012,
5039,
5040,
5295,
5296,
5384,
5385,
5535,
5536,
5550,
5619,
5670,
5729,
5784,
5847,
5850,
5851,
5895,
5896,
6234,
6235,
6307,
6308,
6322,
6323,
6696,
6697,
6744,
6745,
7083,
7084,
7093,
7094,
7108,
7109
],
"line_end_idx": [
68,
69,
119,
120,
467,
468,
692,
693,
788,
789,
879,
963,
1018,
1019,
1063,
1064,
1084,
1085,
1501,
1502,
1530,
1606,
1633,
1634,
1640,
1641,
1972,
1973,
2125,
2126,
2251,
2252,
2262,
2275,
2301,
2321,
2327,
2331,
2332,
2344,
2345,
2647,
2648,
2662,
2717,
2780,
2782,
2783,
3072,
3073,
3093,
3094,
3235,
3236,
3279,
3280,
3556,
3557,
3568,
3578,
3591,
3617,
3637,
3643,
3647,
3663,
3720,
3785,
3789,
3800,
3821,
3835,
3860,
3868,
3874,
3896,
3910,
3949,
3980,
3988,
3994,
3998,
4000,
4001,
4152,
4153,
4193,
4194,
4254,
4255,
4532,
4533,
4603,
4604,
4648,
4655,
4701,
4745,
4746,
4805,
4806,
4865,
4870,
4911,
4960,
4961,
5011,
5012,
5039,
5040,
5295,
5296,
5384,
5385,
5535,
5536,
5550,
5619,
5670,
5729,
5784,
5847,
5850,
5851,
5895,
5896,
6234,
6235,
6307,
6308,
6322,
6323,
6696,
6697,
6744,
6745,
7083,
7084,
7093,
7094,
7108,
7109,
7179
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7179,
"ccnet_original_nlines": 142,
"rps_doc_curly_bracket": 0.00445745000615716,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.30531996488571167,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01850423961877823,
"rps_doc_frac_lines_end_with_ellipsis": 0.013986010104417801,
"rps_doc_frac_no_alph_words": 0.21973785758018494,
"rps_doc_frac_unique_words": 0.3585106432437897,
"rps_doc_mean_word_length": 6.012765884399414,
"rps_doc_num_sentences": 65,
"rps_doc_symbol_to_word_ratio": 0.0015420200070366263,
"rps_doc_unigram_entropy": 5.203324317932129,
"rps_doc_word_count": 940,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.12986552715301514,
"rps_doc_frac_chars_dupe_6grams": 0.05095541104674339,
"rps_doc_frac_chars_dupe_7grams": 0.036447279155254364,
"rps_doc_frac_chars_dupe_8grams": 0.01840057037770748,
"rps_doc_frac_chars_dupe_9grams": 0.01840057037770748,
"rps_doc_frac_chars_top_2gram": 0.03184713050723076,
"rps_doc_frac_chars_top_3gram": 0.026893140748143196,
"rps_doc_frac_chars_top_4gram": 0.037154991179704666,
"rps_doc_books_importance": -513.9995727539062,
"rps_doc_books_importance_length_correction": -513.9995727539062,
"rps_doc_openwebtext_importance": -345.04638671875,
"rps_doc_openwebtext_importance_length_correction": -345.04638671875,
"rps_doc_wikipedia_importance": -235.11102294921875,
"rps_doc_wikipedia_importance_length_correction": -235.11102294921875
},
"fasttext": {
"dclm": 0.034126460552215576,
"english": 0.7871332764625549,
"fineweb_edu_approx": 2.01405668258667,
"eai_general_math": 0.354442834854126,
"eai_open_web_math": 0.21753138303756714,
"eai_web_code": 0.27786803245544434
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.452",
"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": "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": "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
|
1,170,535,241,596,363,000 |
Click Element In Uipath
To get started in RPA, it's important to master a broad base of business and technical skills. Variable Selector. Contribute to cbladd/UiPath development by creating an account on GitHub. Resources. New Uipath jobs added daily. We have chosen to have our own simplified syntax instead. 01） UiPathStudio 画面の日本語訳(v2018. For a complete selector reference, visit the Selectors documentation on api. Indicate what application you want the automation to check. UIPATH VARIABLES In UiPath Studio, variables are used to store multiples type of data. Coming from a lean process improvement background, I can appreciate this being implemented in a software application. SyForms - UiPath Forms Designer. 15:48 In the Notepad app, we want to click on the 4th element in the font list. UiPath使用图表、流程图和拖放选项来定义自动化活动。 它可以方便地管理基于规则的任务，并允许在不同的项目和团队之间共享和重用组件。. This is like Desktop Recording but only for Citrix environment. Start studying UIPath-Input Methods. Enjoy Over 80 Design Elements. Step 3 − Next, click the Ui element from which you want to extract information, in our example we are clicking on the PDF document. and UiPath SRL for the UiPath RPA Platform KDDI to provide RPA support from introduction to operation, contributing to the productivity of corporations in Europe and North America October 11, 2018. Click on "indicate on screen" and click on the desired element to set the selector. Develop Wireframing Tool & Elements with HTML/CSS/JS Ended. Customer clicks links, download the app and purchase a product. From the Design menu click on the Web Scraping option. Unfortunately, your browser is outdated and doesn. In the UiPath Robotic Enterprise Framework template, in the Main workflow, what is the default type of the TransactionItem variable? QueueItem. If you want to enable the image and text-based process automation, you will have to see that the uipath has some features that will simulate the keyboard or mouse input, like hovering, clicking, text recognition, OCR activities etc that helps for identifying by UI elements by screen scraping. By default, the left mouse button is selected. Creating a custom log file. 15:39 Its main use is to tell UiPath to pick the first, second, or Nth element in a container. keys import Keys driver. Top 10 UiPath interview questions and answers. 5 years working experience in C#, JAVA, Javascript for web application development. A web scraping wizard will be popped open. Click on the message box element and type the variable in on the required field, once you start to variable name, UiPath suggests the available variable names. When automations are developed in UiPath Studio and then put into a queue they can be assigned priority levels and/or hard completion deadlines. Join today and explore the hands on experience on UiPath Training with Iteanz. It is if you want very similar to the notion of locating an element into an XML document using an xpath query. 3 (36 ratings) Course Ratings are calculated from individual students' ratings and a variety of other signals, like age of rating and reliability, to ensure that they reflect course quality fairly and accurately. When you click one element for first time, it will ask the second region to scrap. 30 seconds 10 seconds. Creating a custom log file. Can only be used inside a Monitor Events activity. Few important questions were as below, which triggered me to write this blog. To open the UI Explorer window, click the button in the Selectors section, in the Design tab. and finally i have applied some delay before the click of an element. Creates a new ActionChains. UiPath Orchestrator is a web application that manages, controls and monitors UiPath Robots that run repetitive business processes. and UiPath SRL for the UiPath RPA Platform KDDI to provide RPA support from introduction to operation, contributing to the productivity of corporations in Europe and North America October 11, 2018. The function gets an event argument that. Robots can labour without human management in any setting, be it virtual or otherwise. You can then check if the clicked element has the selector you care about. How to click an element specified by an user In this scenario we are trying to click the menu items in Notepad depending on the input we provide. We can't see this happen with the naked eye, but it's as awesome as it sounds. UiPath studio provides us the option to add a time delay before or after the action. Orchestrator lets you manage the creation, monitoring, and deployment of resources in your environment. After you click yes the page with the table re-displays and the table no longer contains the deleted row. To click UI elements on the screen. These are displayed as properties in all activities that deal with UI automation. Fig 1: Snapshot of Manage Packages – UiPath PDF Data Extraction. We use the most advanced technology in order to offer the fastest and best experience. New Uipath jobs added daily. UiPath features an innovative technique for extracting text from running apps, even if they are hidden or covered by another app. As said in my previous post, please refer the training materials and guides for the information. UiPath Orchestrator: It is a web application used to manage, monitor,and to schedule multiple deployed robots and processes. Service Delivery Automation Market Competitive Analysis 2016-2022 and Key Players – Ibm Corporation, Uipath Srl, Ipsoft, Blueprism, Xerox Corporation, Nice Systems. 15:39 Its main use is to tell UiPath to pick the first, second, or Nth element in a container. ) or using keyboard shortcuts. Activities 2. Ideally the image should include branded elements or photos showcasing of your company's standard look & feel. Click on the message box element and type the variable in on the required field, once you start to variable name, UiPath suggests the available variable names. Refer below. SyForms - UiPath Forms Designer. What method can be used instead (when applicable) to have safer actions? Ans. Simply point to the element of your choice and UiPath will generate the 'Get text' action and its output variable, displaying it in a message box. If the element is outside the viewport, an element not interactable error is returned. UiExplorer is a tool for inspecting applications' UI hierarchy, for obtaining or improving selectors that UiPath identifies UiElementswith. Step 3: Now, choose the Click option from the above toolbar and in the menu again choose the Click option. SyForms - UiPath Forms Designer. Edit this Doc Click. 6) If you want to record a Click activity on an ephemeral element that appears only after focusing on a text-box relative to it, can that be done? Yes, press F2 and in the 3 second pause put the focus on the text-box. Double click up here to close the ribbon as usual and in my activities panel I'll look up sequence and click to drag and drop one into the center of the canvas here. Then observe the selectors, it will be in below static format To pass the date dynamically , lets read that date from keyboard using input dialog box activity in uipath lets take that value in to name variable. I need to click\sendKeys a web element, which is totally a dynamic element. kth smallest element is the minimum possible n such that there are at least k elements in the array <= n. Refer to the snapshot below. Also the salaries in Uipath is very impressive (Indeed. let contents = myElement. Find Element Answer: a Single choice. Step 3: Choose the Data Scraping option from the Ribbon and select the element you want to choose. This class represents the provided WPF framework-level implementation that is built on the WPF core-level APIs that are defined by. And ChromeDriver always tries to click the middle of the element. Setting focus on a reliable element and then navigating around the app using keyboard (up/down arrows, tab, etc. UiExplorer is a tool for inspecting applications' UI hierarchy, for obtaining or improving selectors that UiPath identifies UiElementswith. This blog was originally posted on May 22, 2014 and was last. Suddenly, an image click stopped working. A web scraping wizard will be popped open. UiPath looks for application with the file name, title, class and other attributes and if any of these do not match the element will not be found and throw an exception "Selector Not Found". Now create a constructor method to add the values you want in your custom log file. Besant Technologies Provides UiPath RPA training in chennai, the India's Best UiPath training platform for RPA aspirants to become certified RPA UiPath professional and take the lead in your field. and UiPath SRL for the UiPath RPA Platform KDDI to provide RPA support from introduction to operation, contributing to the productivity of corporations in Europe and North America October 11, 2018. Contribute to cbladd/UiPath development by creating an account on GitHub. This categorization helps you better understand which actions to use in different scenarios, when to use them, and the technology behind them. click on that. ✓UiPath recorded VLR Training provides UiPath online training and classroom training anywhere with real-time scenarios and best practice sessions. - [Instructor] Let's take a look at why UiPath is so attractive for robotic process automation. Tutorial on how to use dynamic selectors in UiPath. Our Uipath Training course is a job oriented course ie at the end of the course you can easily clear interviews or onboard into an ongoing RPA Uipath project. To open the UI Explorer window, click the button in the Selectors section, in the Design tab. Step 3 − Next, click the Ui element from which you want to extract information, in our example we are clicking on the PDF document. Enroll today for Training videos. UiPath is using Eventbrite to organize 4 upcoming events. Click on the message box element and type the variable in on the required field, once you start to variable name, UiPath suggests the available variable names. Then we need to select any date ,to do this I am using click activity in uipath. 1: Hover the mouse over a data source field and then click on the data source field. UIpath is an unconventional tool that allows you to plan automation progressions visually, using diagrams. Our experts providing UiPath interview questions & Answers/Faqs can develop your carrier & knowledge to find the right job in a good MNC's, doesn't matter what kind of company you're hired. Native Citrix Recording. In the UiPath Robotic Enterprise Framework template, in the Main workflow, what is the default type of the TransactionItem variable? QueueItem. Click Image and Click Text are not 100% reliable in Citrix environments. UiExplorer is a tool for inspecting applications' UI hierarchy, for obtaining or improving selectors that UiPath identifies UiElementswith. Also the salaries in Uipath is very impressive (Indeed. ) or using keyboard shortcuts. In this video, we will discuss: 1. When automations are developed in UiPath Studio and then put into a queue they can be assigned priority levels and/or hard completion deadlines. Element Exists b. What method can be used instead (when applicable) to have safer actions? Ans. By placing the Click activity inside a Try/Catch block. 4) Array and List elements can be accessed by Index. A web scraping wizard will be popped open. The software can be deployed either as a front office or back office process, running quite happily on a standard desktop in the front office or on any scale of systems for back office processing. UiPath looks for application with the file name, title, class and other attributes and if any of these do not match the element will not be found and throw an exception "Selector Not Found". From the Design menu click on the Web Scraping option. The UI in this lesson may seem different if you've enables the Style Panel Beta! This content will be updated soon!. 1,000+Results for "Uipath in United States"(48 new). The resulting string is returned. Keep the part of the title that describe the action (Click, Type Into, Element exists etc) • Except for Main, all workflow names should contain the verb describing what the workflow does, e. Most often, the selectors you are working with will have been composed automatically. On the other hand, you can modify them via Orchestrator. Orchestrator lets you manage the creation, monitoring, and deployment of resources in your environment. Setting focus on a reliable element and then navigating around the app using keyboard (up/down arrows, tab, etc) or using keyboard. click on that. This happens when the element is loaded into the DOM, but the position is not fixed on the UI. Should you choose not to provide a Company Profile Banner then UiPath will use a default one. UiPath Robot: This component is the UiPath executor can interact with a large number of applications at the same time. The secure element plays an important role in securing mobile computing. Click on the message box element and type the variable in on the required field, once you start to variable name, UiPath suggests the available variable names. move_to_element(menu) actions. Step 2: Now, open UiPath Studio and create a Black Project. -UIPath Selectors used can be customized accordingly by modifying the attribute values. UIPath studio is the best RPA Product tool. Execute Excel related operations using the Open Office XML format (XLSX) or Excel. 4) Array and List elements can be accessed by Index. The UiPath Robot is driven by advanced computer vision to perform exceptionally rapid and precise automation for SAP, Citrix, and Mainframe processes. For example, you can use this option if you want to retrieve just text from a web page or click a particular button, without having to wait for all UI elements to load. It is responsible for the orchestration of both Attended and Unattended Robot resources, and provides centralized Robot logs, remote execution, monitoring, scheduling, and work queues. workflow - UiPath. UiPath Studio - Installs Studio. This categorization helps you better understand which actions to use in different scenarios, when to use them, and the technology behind them. While WordCaptureX has been designed to address the need of a general lookup tool that works with words, lines and paragraphs on the screen and require user. Web scraping is a premier feature of the screen-scraping landscape. Then we need to select any date ,to do this I am using click activity in uipath. 15:48 In the Notepad app, we want to click on the 4th element in the font list. UiPath studio provides us the option to add a time delay before or after the action or between key strokes. I tried the code below but didn't work. 1) 【フリーランス・副業向け】RPA（UiPath含む）のお仕事一覧. In other words, if the array A was sorted, then A[k - 1] ( k is 1 based, while the arrays are 0 based ). " jQuery supports most CSS3 selectors, as well as some non-standard selectors. The most basic concept of jQuery is to "select some elements and do something with them. Develop Wireframing Tool & Elements with HTML/CSS/JS Ended. I've recreated the image click several times, but it doesn't work. It is possible to create automations with UI elements from most applications, including Universal Windows Platform apps. Reading innerHTML causes the user agent to serialize the HTML or XML fragment comprised of the elment's descendants. Uipath is a standout among est other Robotic Process Automation instruments which is an entire software arrangement which serves to computerize an association by decreasing human pressure and sparing time. Click Image and Click Text are not 100% reliable in Citrix environments. I'm trying to add an onclick of a link and, in the handler function, get a reference to the clicked element. Third party assessments of the overall capability of two major players in the industry of Robotic Process Automation rate UIPATH and BLUE PRISM, just about equally powerful and competitive, still both are significantly different solutions. Resources. EhP7 System Information: I am. Setting the Accuracy property of the Click Image activity to 1. Args : driver: The WebDriver instance which performs user actions. More than 1 year has passed since last update. The UiPath will scrape the data when a particular region is clicked. Answer: c Single choice 2) If you need to know if a UI Element is available on the screen or not, what activity should you use? a. There are multiple approaches to implement clicking elements based on particular input: Text Automation; Variable Selector; FlowSwitch Activity; 1. Provides a WPF framework-level set of properties, events, and methods for Windows Presentation Foundation (WPF) elements. Explains how to use variables in UiPath selectors. Simulates a double click on an UI element. Well… In my point of view UiPath is a Windows desktop (RPA) Software designed to empower business analysts to automate business processes within their companies. Symprio specialize in implementing UiPath on Oracle R12 and Cloud ERP and have spent significant time to resolve the different challenges when attempting to execute RPA using Oracle Java. -UIPath has a unique way of identifying elements. Uipath is a chief robotic process automation vendor and helps the organizations in successfully automating their business processes. The components consist of the UiPath Studio, which is an integrated development environment for developers, then there's the UiPath Orchestrator which is a web application that provides centralized bot management, triggering, logging and even queues and. Note : This questions and answers are only for the reference purpose. 15:46 Let's see a quick example. This automation process are simple or complex activity but uipath is comfortable to automate the process. let contents = myElement. Looking for developing a simple workflow in RPA Tool UiPath Ended. UiPath Robot - Installs the Robot on the local hard drive with the chosen options: Register as Windows Service - Specifies how to install the Robot. 4) Array and List elements can be accessed by Index. For example, you can use this option if you want to retrieve just text from a web page or click a particular button, without having to wait for all UI elements to load. What method can be used instead (when applicable) to have safer actions? Setting the Accuracy property of the Click Image activity to 1. When you click one element for first time, it will ask the second region to scrap. Find jobs, benefits and insider info about UiPath, a Information Technology, Machine Learning, Robotics, Software company in New York. Most used activities: Click Image - action you can use to click on mostly anything (as long as the image you choose is unique): buttons, menus, text, or even somewhere relative to such an element. Third party assessments of the overall capability of two major players in the industry of Robotic Process Automation rate UIPATH and BLUE PRISM, just about equally powerful and competitive, still both are significantly different solutions. How can a developer make the elements of a chart clickable using NVD3 in an Angular application? There are lots of ways to incorporate and use NVD3 in your The anonymous function we have added is executed when the user clicks on a bar in the bar chart. By placing the Click activity inside a Try/Catch block. Join today and explore the hands on experience on UiPath Training with Iteanz. Advantages and disadvantages of selectors compare to. Variable Selector. Hi Everyone , I had the same issue on a click of UIElement after finding an element. Service Delivery Automation Market Competitive Analysis 2016-2022 and Key Players - Ibm Corporation, Uipath Srl, Ipsoft, Blueprism, Xerox Corporation, Nice Systems. The secure element plays an important role in securing mobile computing. Here, "test" is input. The latest Tweets from UiPath (@UiPath). Let's talk. Then observe the selectors, it will be in below static format To pass the date dynamically , lets read that date from keyboard using input dialog box activity in uipath lets take that value in to name variable. All interactions with the UI can be split into input and output. move_to_element(menu) actions. As said in my previous post, please refer the training materials and guides for the information. UiPathを利用するための動作環境（v2018. It is available only if the UiPath. I'm trying to add an onclick of a link and, in the handler function, get a reference to the clicked element. 1: Hover the mouse over a data source field and then click on the data source field. By using a full selector b). Execute Excel related operations using the Open Office XML format (XLSX) or Excel. How does UiPath recognize elements on screen?a). It seems like the mouse is way too low to hit the image. Once you chosen the package, click on Save and the package will start getting installed. UIPATH EXPLORER -UIPath Explorer is a tool used to recognize the elements of the active applications. Explains how to use variables in UiPath selectors. How can a developer make the elements of a chart clickable using NVD3 in an Angular application? There are lots of ways to incorporate and use NVD3 in your The anonymous function we have added is executed when the user clicks on a bar in the bar chart. If enabled, it is installed as a Windows service - the default option. There are a lot of opportunities available for the people who learn UiPath. Orchestrator lets you manage the creation, monitoring, and deployment of resources in your environment. When a computer is in Locked Screen the Windows operating system does not create the UI of the applications that are still running underneath. class='header'>. We have already discussed how to interact with the hidden elements in the webpage in this blog. This will send the clicked element to my function, so I can get a hold of it and manipulate it using JS. The UiPath will scrape the data when a particular region is clicked. UiPath offers the possibility of executing an artifact even if the computer screen is locked. 30 seconds 10 seconds. What is the Attach Window activity used for?a). I thought this code should work, and work across browsers: function getit(e) {. Click the Button and open Image Gallery. We will create a simple number guessing game application with Flowchart. 2) You can add any number of elements to an array. I've recreated the image click several times, but it doesn't work. Step 2: Now, in the UiPath Studio choose the Web Recorder and then you will see the following toolbar. Setting the Accuracy property of the Click Image activity to 1. Well, this is the process to create a sample script in UiPath tool. If you've done any automated testing with Chromedriver, you'll likely have come across the following classic error at some stage: WebDriverException: Message: unknown error: Element is not clickable at point (x, y). From the Design menu click on the Web Scraping option. Edit this Doc Click. Please click on the below link to register in the UiPath academy site to complete the certification. If the element is outside the viewport, an element not interactable error is returned. 01） UiPathStudio 画面の日本語訳(v2018. We can't see this happen with the naked eye, but it's as awesome as it sounds. Click on the message box element and type the variable in on the required field, once you start to variable name, UiPath suggests the available variable names. UiPath Studio is the leading automation software that is used for administrative tasks, IT tasks UiPath Studio is best known for its user-friendly interface. This particular Warning message is ignored (click Ok) and UiPath proceeds with the entry. Using attributes of the UI elements 216. Then we need to select any date ,to do this I am using click activity in uipath. Click element at its center point. 1: Hover the mouse over a data source field and then click on the data source field. From the Design menu click on the Web Scraping option. How can UiPath identify an UI element on the screen?a). How the selectors work with different UI hierarchies and frameworks 2. Service Delivery Automation Market Competitive Analysis 2016-2022 and Key Players – Ibm Corporation, Uipath Srl, Ipsoft, Blueprism, Xerox Corporation, Nice Systems. This happens when the element is loaded into the DOM, but the position is not fixed on the UI. The latest Tweets from UiPath (@UiPath). 4) Array and List elements can be accessed by Index. Join today and explore the hands on experience on UiPath Training with Iteanz. click on that. Learn vocabulary, terms, and more with flashcards, games, and other study tools. I received many questions from readers for RPA blogs published before. UiPath RPA Developer Foundation Training - Final Test. RPA is not only about the Robot but also the User. UIPath is very easy to learn and use it for automating the human process. 7)In a SAP application, you would like the robot to click on a specific folder in a folder hierarchy. Simplilearn's Robotic Process Automation Practitioner (RPA) with UiPath training course will build your RPA expertise from the ground up using the advanced UiPath RPA platform. Uipath is a chief robotic process automation vendor and helps the organizations in successfully automating their business processes. By using an Element Exists activity and then a Click activity. Setting focus on a reliable element and then navigating around the app using keyboard (up/down arrows, tab, etc) or using keyboard shortcuts. There are work around that worked to resolve the issue. UiPathを利用するための動作環境（v2018. The tool offers a lot of other advanced features which will help to create complex repetitive actions. I have already explained the basics about UiPath in my previous articles. Creates a new ActionChains. How selectors are being generated 3. After verifying selectors i had found no change on the selector. To open the UI Explorer window, click the button in the Selectors section, in the Design tab. UiPath Certification - Sample Questions and Answers - Lesson 7 Image and Text Automation Here is the sample question and answers from the Lesson 7 from the UI Path 1) Click Image and Click Text are not 100% reliable in Citrix environments. ) or using keyboard shortcuts. How does UiPath recognize elements on screen? Using screen coordinates Using the position of the UI Element Using attributes of the UI Element and their parents; How should an RPA developer address runtime exception in the workflow? By logging any exception events By using try/catch blocks when invoking external workflow files. New York, USA. What method can be used instead (when applicable) to have safer actions? Setting the Accuracy property of the Click Image activity to 1. RPA is not only about the Robot but also the User. How the selectors work with different UI hierarchies and frameworks 2. 6) If you want to record a Click activity on an ephemeral element that appears only after focusing on a text-box relative to it, can that be done? Yes, press F2 and in the 3 second pause put the focus on the text-box. We have chosen to have our own simplified syntax instead. In our Java ODM API project let’s create a global variable to define the output file. -UIPath has a unique way of identifying elements. 1) You can iterate through a List using a For Each loop activity. Answer: c Single choice 2) If you need to know if a UI Element is available on the screen or not, what activity should you use? a. We will discuss about the Flowcharts in UiPath and how to control the application flow. Type Into − As the name suggests, it is automatically generated when we type in a text field or any editable UI element. Other element would receive the click:. I am following the video SAP Automation with UiPath to automate login as a user with valid credentials within an SAP Server. Wait Element Vanish c. UiPath Studio is a total software solution that enables you to automate your back office repetitive tasks. What method can be used instead (when applicable) to have safer actions? Setting the Accuracy property of the Click Image activity to 1. Create a mouse click or tap trigger using one element—which upon clicking shows and hides a different element. NOTE You are not allowed to modify the array ( The array is read only ). When debugging UiPath's ability to slow down its execution speed, visually identify UI elements it's interacting with while simultaneously showing the activity line it is working on is priceless. Even when I create a new click image, the message box is usually in the center of the area to the right of the first scraped area. Few important questions were as below, which triggered me to write this blog. Using attributes of the UI elements 216. UiPath features an innovative technique for extracting text from running apps, even if they are hidden or covered by another app. Using the Exists Activity. The properties of elements in groups are similar in some respects to each other. Simulates a double click on an UI element. This class represents the provided WPF framework-level implementation that is built on the WPF core-level APIs that are defined by. When a computer is in Locked Screen the Windows operating system does not create the UI of the applications that are still running underneath. By using a full selector b). UIPATH VARIABLES In UiPath Studio, variables are used to store multiples type of data. This makes automation much more reliable and independent of screen-size and resolution. Setting the Accuracy property of the Click Image activity to 1. Setting focus on a reliable element and then navigating around the app using keyboard (up/down arrows, tab, etc. By placing the Click activity inside a Try/Catch block. This book is the perfect start to your automation journey, with a special focus on one of the most popular RPA tools: UiPath. UiPath offers the possibility of executing an artifact even if the computer screen is locked. New York, USA. 01） UiPathStudio 画面の日本語訳(v2018. In a new window of Debug Information click on tab Data Container, you will find the UI path as Component Name, in below sceen UI path is highlighted. 日本FAQカテゴリーにようこそ。ここではよくあるご質問と答えをUiPath Japanメンバーが掲載していきます。. Now create a constructor method to add the values you want in your custom log file. The UiPath training academy consists of different lessons where a user can learn each lesson, to be a proficient with the tool and to clear the certification. About UI Elements Suggest Edits UI elements refer to all graphical user interface pieces that construct an application, be they windows, check boxes, text fields or drop-down lists, and so on. UIPath is very easy to learn and use it for automating the human process. The RPA UiPath free practice test aims to prepare you for the RPA certification exam. How can UiPath identify an UI element on the screen?a). If enabled, it is installed as a Windows service - the default option.
|
{
"url": "http://bgrandesenior.sch.id/w3cs/sif.php?dd=click-element-in-uipath",
"source_domain": "bgrandesenior.sch.id",
"snapshot_id": "crawl=CC-MAIN-2019-43",
"warc_metadata": {
"Content-Length": "33777",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CSKT6JWCSEZE6VQSB67WH2K4O3V4NX65",
"WARC-Concurrent-To": "<urn:uuid:b9cd14fd-ced2-43cc-b7c3-4d74f90083ba>",
"WARC-Date": "2019-10-14T13:31:13Z",
"WARC-IP-Address": "156.67.210.45",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QK4OVZKLZ5CKG42TZYJNKNZHNTK5DXJX",
"WARC-Record-ID": "<urn:uuid:25b6f9f8-3343-48b3-9bf3-b5de2651043e>",
"WARC-Target-URI": "http://bgrandesenior.sch.id/w3cs/sif.php?dd=click-element-in-uipath",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:be16e67d-c2e9-4f9e-8f6a-71a7b33eb6ec>"
},
"warc_info": "isPartOf: CC-MAIN-2019-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-97.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
24,
25,
26,
27
],
"line_end_idx": [
24,
25,
26,
27,
30954
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 30954,
"ccnet_original_nlines": 4,
"rps_doc_curly_bracket": 0.000032309999369317666,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3766838610172272,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02594378963112831,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15316814184188843,
"rps_doc_frac_unique_words": 0.22237488627433777,
"rps_doc_mean_word_length": 4.905789852142334,
"rps_doc_num_sentences": 363,
"rps_doc_symbol_to_word_ratio": 0.00033261001226492226,
"rps_doc_unigram_entropy": 5.8762359619140625,
"rps_doc_word_count": 5095,
"rps_doc_frac_chars_dupe_10grams": 0.4635727107524872,
"rps_doc_frac_chars_dupe_5grams": 0.5053010582923889,
"rps_doc_frac_chars_dupe_6grams": 0.49913981556892395,
"rps_doc_frac_chars_dupe_7grams": 0.49241846799850464,
"rps_doc_frac_chars_dupe_8grams": 0.4859371781349182,
"rps_doc_frac_chars_dupe_9grams": 0.47257450222969055,
"rps_doc_frac_chars_top_2gram": 0.007801560219377279,
"rps_doc_frac_chars_top_3gram": 0.00640127994120121,
"rps_doc_frac_chars_top_4gram": 0.006241249851882458,
"rps_doc_books_importance": -3151.780029296875,
"rps_doc_books_importance_length_correction": -3151.780029296875,
"rps_doc_openwebtext_importance": -1669.73876953125,
"rps_doc_openwebtext_importance_length_correction": -1669.73876953125,
"rps_doc_wikipedia_importance": -1293.293701171875,
"rps_doc_wikipedia_importance_length_correction": -1293.293701171875
},
"fasttext": {
"dclm": 0.05280148983001709,
"english": 0.8824791312217712,
"fineweb_edu_approx": 2.2943549156188965,
"eai_general_math": 0.3253823518753052,
"eai_open_web_math": 0.12898969650268555,
"eai_web_code": 0.3527548909187317
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.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": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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,079,175,084,901,120,000 |
Building on Cygwin platform
From Octave
Revision as of 18:52, 18 December 2013 by CdeMills (talk | contribs)
Jump to navigation Jump to search
Octave can be built on cygwin too !
Pre-requisites
Setup your system the same way as described on the page Octave for Debian systems. The next step, required to generate the documentation, is to tweak a bit the texlive configuration file: (remember cygwin has no sudo command)
vi /usr/share/texmf-dist/web2c
Change
TEXMFLOCAL = $TEXMFROOT/texmf-site
into
TEXMFLOCAL = $TEXMFROOT/texmf-site:$TEXMFROOT/texmf
Then run
mktexlsr
Configure
Proceed the same way as on a Unix platform. In this case, the procedure requires a kind of bootstrapping, so it is better to put Octave outside the main directory tree; like f.i.
./bootstrap
mkdir compile; cd compile
../configure --prefix=${HOME}/usr
This configuration supposes ${HOME}/usr/bin exists and is in your $PATH.
Build
The procedure is a bit more tricky. Start the build as usual:
make -j 2
It will fail after a looong time, while trying to launch ./run-octave. This is a well-known problem, partly caused by issues with the fork() call under Windows platforms. At this time, change run-octave to something simpler:
#! /bin/sh
octave_executable="${PREFIX}/usr/bin/octave"
"$octave_executable" "$@"
Where ${PREFIX} matches the form previously used during the configure stage. In fact, we will use the new Octave, which is not yet operationnal. But never mind. Restart the process as follows:
make install
This way:
1. The Octave libs and binaries have been generated, they will be copied into their final destination directory.
2. the doc has still to be built. With the modified "run-octave", the executable which will be called is the version just installed during the previous step. Now the doc generation will succeed, and so will its installation.
Enjoy!
|
{
"url": "https://wiki.octave.org/wiki/index.php?title=Building_on_Cygwin_platform&direction=prev&oldid=11725",
"source_domain": "wiki.octave.org",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "20039",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:K3F56T7G6BTLMQZQUXJI7UVG56XVEKYN",
"WARC-Concurrent-To": "<urn:uuid:580aa9d0-5ae4-4c0f-a314-a1d5336f489a>",
"WARC-Date": "2022-06-28T00:24:30Z",
"WARC-IP-Address": "23.237.137.44",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PWKHXUYVGOPSWYO2KFYFPSJD5YNDHMCJ",
"WARC-Record-ID": "<urn:uuid:6a6f7e09-2140-430e-a516-6bd995fdc676>",
"WARC-Target-URI": "https://wiki.octave.org/wiki/index.php?title=Building_on_Cygwin_platform&direction=prev&oldid=11725",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3e22145a-a762-437f-a23f-ecd9265c5c96>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-49\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
28,
29,
41,
110,
144,
145,
181,
182,
197,
198,
424,
425,
459,
463,
464,
471,
472,
510,
511,
516,
517,
572,
573,
582,
583,
595,
600,
601,
611,
612,
791,
792,
807,
836,
873,
874,
947,
948,
954,
955,
1017,
1018,
1032,
1033,
1258,
1259,
1273,
1321,
1350,
1351,
1544,
1545,
1561,
1562,
1572,
1573,
1688,
1915,
1916
],
"line_end_idx": [
28,
29,
41,
110,
144,
145,
181,
182,
197,
198,
424,
425,
459,
463,
464,
471,
472,
510,
511,
516,
517,
572,
573,
582,
583,
595,
600,
601,
611,
612,
791,
792,
807,
836,
873,
874,
947,
948,
954,
955,
1017,
1018,
1032,
1033,
1258,
1259,
1273,
1321,
1350,
1351,
1544,
1545,
1561,
1562,
1572,
1573,
1688,
1915,
1916,
1922
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1922,
"ccnet_original_nlines": 59,
"rps_doc_curly_bracket": 0.0041623301804065704,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31060606241226196,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025252530351281166,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24747474491596222,
"rps_doc_frac_unique_words": 0.6344085931777954,
"rps_doc_mean_word_length": 5.186379909515381,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0.0025252499617636204,
"rps_doc_unigram_entropy": 4.86095666885376,
"rps_doc_word_count": 279,
"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.011057360097765923,
"rps_doc_frac_chars_top_3gram": 0.013821699656546116,
"rps_doc_frac_chars_top_4gram": 0.01658603921532631,
"rps_doc_books_importance": -172.71981811523438,
"rps_doc_books_importance_length_correction": -172.7198028564453,
"rps_doc_openwebtext_importance": -94.66091918945312,
"rps_doc_openwebtext_importance_length_correction": -94.66091918945312,
"rps_doc_wikipedia_importance": -66.7703628540039,
"rps_doc_wikipedia_importance_length_correction": -66.7703628540039
},
"fasttext": {
"dclm": 0.0842856764793396,
"english": 0.9033441543579102,
"fineweb_edu_approx": 1.6246157884597778,
"eai_general_math": 0.7955942153930664,
"eai_open_web_math": 0.6573151350021362,
"eai_web_code": 0.08285201340913773
}
}
|
{
"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": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-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": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,554,293,341,835,312,000 |
How fast is BT Broadband?
Published 13/07/2005 16:33 | Updated 01/10/2009 15:57
How fast is BT Broadband?
A speed of around 3 megabits per second (Mbps) is available for most users living in cities and large towns who wish to connect to broadband. A 3Mb broadband connection is about 50 times faster than a dial-up connection.
Speeds of 1Mb and up to 7.6Mb are also available. Whether you are able to receive higher speeds depends on the quality of your phone line and the distance from your house to the local telephone exchange.
BT Broadband has rolled out Up to 24Mb download speeds, offering faster connection speeds, improved stability and better reliability to more people in more places than ever before.
24Mb broadband (24Mbits/s) is approximately 480 times faster than standard dial-up Internet (0.05Mbit/s), and three times faster than our current fastest broadband service (7.6Mbit/s).
1024kbps? 3Mb? What do the numbers mean? What speed do I need?
When we're talking about Internet connection speeds, things can be really confusing! For a start, Internet transfer speeds are measured in kilobits per second and megabits per second, and those are not the same as the kilobytes and megabytes we use when we're talking about hard disks and files.
Let's not worry about the numbers. What matters is how they apply to the kinds of things you'll do on the Internet. Here's a table to make it simple:
Internet Connection Speed Time to load a typical web page
(assuming 100 kilobytes of data)
Time to download a typical 4 minute song (assuming a 4 megabyte MP3 file) Streaming Video Quality
56K dial-up modem 14 seconds 10 minutes
1Mb broadband 0.8 seconds 38 seconds
2Mb broadband 0.4 seconds 20 seconds Medium Quality
3Mb broadband 0.2 sec 12.5 seconds
6Mb broadband Instantaneous 6 seconds
24Mb broadband Instantaneous Instantaneous TV Quality
Note: all figures are approximate and represent best-case download speeds. Actually speeds will generally be lower.
So you can see that an entry level 1Mb broadband Internet connection is around twenty times faster than a 56K dial-up Internet connection, allowing you to view web pages with barely any noticeable delay, whereas with an 24Mb broadband connection, you could watch TV quality video over the web!
Any of the broadband speeds will be perfectly good for viewing the majority of web pages - having to wait a second or two for a page to load is perfectly acceptable. But the Internet is so much more than just pages of text and a few images: what about music, video, animations, games and all the other stuff that makes the Internet so much fun?
Consider the download time for a typical 4 minute pop song - around 40 seconds with a 1Mb connection. The time it takes to download is less than the time it takes the song to play. What this means in practice is that your computer will be able to play the song while it downloads. We call this streaming - the sound 'streams' to your computer fast enough that it can be played as it arrives, without all that waiting around.
Streaming also applies to video. You'll find that many web sites allow you to watch video, even live video, without having to wait around for more than a few seconds for it to start. In many cases video is offered in two or more different sizes or at different qualities - so that you can choose the one that plays best with your connection speed. Having a faster connection means you can watch the video at a larger size and better quality.
And what about gaming? Well, it depends on the type of game. For those of us who want to play a little backgammon or a card game on a wet afternoon, any kind of broadband connection will work fine.
If however you're one of those people who want to take on the world at Halo 3 or Call of Duty 4, or connect your XBox 360 or PS3 to the Internet, you may want to consider going for the fastest connection you can practically afford: playing first-person shooters is one of the most demanding ways to use a broadband Internet connection. But don't worry too much - you to upgrade to a faster connection at any time (you'll just pay a higher monthly charge).
See also: Understanding the BT Broadband monthly data download allowance
Please tell us how we can make this answer more useful.
Print
|
{
"url": "http://btireland.custhelp.com/app/answers/detail/a_id/837",
"source_domain": "btireland.custhelp.com",
"snapshot_id": "crawl=CC-MAIN-2018-30",
"warc_metadata": {
"Content-Length": "32715",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:K4CCDVA7NJYTCNOS3JT6HT46MZWQBR6U",
"WARC-Concurrent-To": "<urn:uuid:37154f6a-566a-49ae-935c-58898d1aa9cb>",
"WARC-Date": "2018-07-20T08:54:25Z",
"WARC-IP-Address": "74.117.207.64",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:ESTC3KUQSFSZCCISOAZTMTQ43IIENQD2",
"WARC-Record-ID": "<urn:uuid:df1d5b09-b259-430b-bf96-f93e4bee840c>",
"WARC-Target-URI": "http://btireland.custhelp.com/app/answers/detail/a_id/837",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b44eb27b-c6c2-4f01-8383-81f50771f7d5>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-47-163.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-30\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for July 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
26,
27,
86,
112,
113,
334,
335,
337,
338,
542,
543,
545,
546,
727,
728,
730,
731,
916,
917,
919,
920,
921,
923,
924,
987,
988,
990,
991,
1287,
1288,
1290,
1291,
1441,
1442,
1443,
1501,
1534,
1632,
1672,
1709,
1761,
1796,
1834,
1888,
2004,
2005,
2007,
2008,
2302,
2303,
2305,
2306,
2651,
2652,
2654,
2655,
3080,
3081,
3083,
3084,
3526,
3527,
3529,
3530,
3728,
3729,
3731,
3732,
4188,
4189,
4191,
4192,
4265,
4266,
4268,
4269,
4325,
4326
],
"line_end_idx": [
26,
27,
86,
112,
113,
334,
335,
337,
338,
542,
543,
545,
546,
727,
728,
730,
731,
916,
917,
919,
920,
921,
923,
924,
987,
988,
990,
991,
1287,
1288,
1290,
1291,
1441,
1442,
1443,
1501,
1534,
1632,
1672,
1709,
1761,
1796,
1834,
1888,
2004,
2005,
2007,
2008,
2302,
2303,
2305,
2306,
2651,
2652,
2654,
2655,
3080,
3081,
3083,
3084,
3526,
3527,
3529,
3530,
3728,
3729,
3731,
3732,
4188,
4189,
4191,
4192,
4265,
4266,
4268,
4269,
4325,
4326,
4331
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4331,
"ccnet_original_nlines": 78,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4106939733028412,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014789530076086521,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16609783470630646,
"rps_doc_frac_unique_words": 0.41407307982444763,
"rps_doc_mean_word_length": 4.607577800750732,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.209649562835693,
"rps_doc_word_count": 739,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.011747430078685284,
"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.026431720703840256,
"rps_doc_frac_chars_top_3gram": 0.017621150240302086,
"rps_doc_frac_chars_top_4gram": 0.006461089942604303,
"rps_doc_books_importance": -413.7325744628906,
"rps_doc_books_importance_length_correction": -413.7325744628906,
"rps_doc_openwebtext_importance": -220.7830047607422,
"rps_doc_openwebtext_importance_length_correction": -220.7830047607422,
"rps_doc_wikipedia_importance": -185.6048126220703,
"rps_doc_wikipedia_importance_length_correction": -185.6048126220703
},
"fasttext": {
"dclm": 0.24009519815444946,
"english": 0.921134889125824,
"fineweb_edu_approx": 1.7198549509048462,
"eai_general_math": 0.011350040324032307,
"eai_open_web_math": 0.17779958248138428,
"eai_web_code": 0.0048154001124203205
}
}
|
{
"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": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-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": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,248,626,753,475,708,000 |
IPv6 Extension Headers in the Real World
Fernando Gont fernando at gont.com.ar
Tue Sep 30 06:53:14 CEST 2014
Folks,
Earlier in September we published a revision of our I-D "IPv6 Extension
Headers in the Real World"
(<https://tools.ietf.org/html/draft-gont-v6ops-ipv6-ehs-in-real-world>).
At this point in time, we're interested in knowing whether our I-D is of
value for the IPv6 ops community, such that we can decide whether to
continue working/improving it. Additionally, if there's anything you
think we've missed in the document, we'd like to hear from you.
Overall, our I-D is meant to provide a reality-check with respect to the
issues surrounding IPv6 Extension Headers and their use on the public
Internet. More specifically, its goals are:
1) Provide data regarding support of IPv6 EHs in the real world.
This is interesting data to refer people to (e.g., folks
developing protocols) regarding the extent to which IPv6 EHs
are usable on the public Internet (at least with web, mail, and
name servers).
2) Summarize the issues associated with IPv6 EHs (performance, security,
etc.)
This is of use for folks concerned with the issues surrounding
IPv6 EHs, and covers practical issues.
3) Summarizes the implications of the aforementioned filtering.
For example, if you're designing a protocol that is meant to
work on the public Internet, you may want to provide some fall-back
mechanism that does not employ IPv6 EHs.
Yet another of the implications is the security issue that has
been discussed on-list: if e.g. IPv6 fragments are dropped and you
can be tricked into generating them, you may be subject to a DoS
attack.
4) Flag possible further work
Here we try to flag areas where the further work may be needed,
such as adding fall-back mechanisms to some existing protocols,
or avoiding the use of IPv6 EHs where possible.
Thanks!
Best regards,
--
Fernando Gont
e-mail: fernando at gont.com.ar || fgont at si6networks.com
PGP Fingerprint: 7809 84F5 322E 45C7 F1C9 3945 96EE A9EF D076 FFF1
More information about the ipv6-ops mailing list
|
{
"url": "http://lists.cluenet.de/pipermail/ipv6-ops/2014-September/010161.html",
"source_domain": "lists.cluenet.de",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "4538",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ULE3OCHLY36YCCZGIVBG7JIKDE62RGBE",
"WARC-Concurrent-To": "<urn:uuid:9111f13a-f5f9-441e-8c1a-2cd06d4b3942>",
"WARC-Date": "2022-01-24T13:32:54Z",
"WARC-IP-Address": "195.20.121.96",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SICXT5X5MKS2KH7YO7CMZJVG3TGSTTFT",
"WARC-Record-ID": "<urn:uuid:fd7aefae-b41c-4a08-bb42-01acd591257b>",
"WARC-Target-URI": "http://lists.cluenet.de/pipermail/ipv6-ops/2014-September/010161.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3fe23381-42a3-463c-a233-e9e931c77d6a>"
},
"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-95\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,
41,
42,
80,
110,
111,
112,
119,
120,
192,
219,
292,
293,
366,
435,
504,
568,
569,
642,
712,
756,
757,
822,
823,
884,
949,
1017,
1036,
1037,
1038,
1111,
1117,
1118,
1185,
1228,
1229,
1230,
1294,
1295,
1360,
1432,
1477,
1478,
1545,
1616,
1685,
1697,
1698,
1699,
1729,
1730,
1797,
1864,
1915,
1916,
1917,
1925,
1926,
1940,
1944,
1958,
2018,
2085,
2086,
2087,
2088,
2089,
2090
],
"line_end_idx": [
41,
42,
80,
110,
111,
112,
119,
120,
192,
219,
292,
293,
366,
435,
504,
568,
569,
642,
712,
756,
757,
822,
823,
884,
949,
1017,
1036,
1037,
1038,
1111,
1117,
1118,
1185,
1228,
1229,
1230,
1294,
1295,
1360,
1432,
1477,
1478,
1545,
1616,
1685,
1697,
1698,
1699,
1729,
1730,
1797,
1864,
1915,
1916,
1917,
1925,
1926,
1940,
1944,
1958,
2018,
2085,
2086,
2087,
2088,
2089,
2090,
2138
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2138,
"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.36666667461395264,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.035555560141801834,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2155555635690689,
"rps_doc_frac_unique_words": 0.5518292784690857,
"rps_doc_mean_word_length": 4.954268455505371,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.866513729095459,
"rps_doc_word_count": 328,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.041846148669719696,
"rps_doc_frac_chars_dupe_6grams": 0.041846148669719696,
"rps_doc_frac_chars_dupe_7grams": 0.041846148669719696,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.025846149772405624,
"rps_doc_frac_chars_top_3gram": 0.03692308068275452,
"rps_doc_frac_chars_top_4gram": 0.025846149772405624,
"rps_doc_books_importance": -221.6156768798828,
"rps_doc_books_importance_length_correction": -221.6156768798828,
"rps_doc_openwebtext_importance": -139.1157684326172,
"rps_doc_openwebtext_importance_length_correction": -139.1157684326172,
"rps_doc_wikipedia_importance": -74.68489837646484,
"rps_doc_wikipedia_importance_length_correction": -74.68489837646484
},
"fasttext": {
"dclm": 0.019419850781559944,
"english": 0.8991865515708923,
"fineweb_edu_approx": 1.615446925163269,
"eai_general_math": 0.4934806823730469,
"eai_open_web_math": 0.4984428882598877,
"eai_web_code": 0.20788568258285522
}
}
|
{
"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": "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": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "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": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,288,535,614,589,241,000 |
Perspektif Çizimi - Matematik Canavarı
12 Temmuz 2013 Cuma
Perspektif Çizimi
Perspektif Çizimi
Geometrik cisimlerin herkes tarafından kolayca anlaşılabilmesi için genel olarak üç yüzünü birden gösteren perspektif çizimler yapılır.Perspektifte, cisimler bizden uzaklaştıkça küçülmüş ve renkleri solmuş gibi görünür.
Zeminin bittiği yerde, gökyüzüyle birleşen çizgiye ufuk çizgisi denir.Gözümüzden uzaklaştıkça birleşiyormuş gibi görünen çizgilere kaybolunan doğrular denir.Kaybolunan doğruların birleşiyormuş gibi göründüğü noktaya kaybolunan nokta denir.
Tren yolu raylarını kesişiyormuş gibi görürüz.Tren yolu rayları kaybolunan doğrular, rayların kesişiyormuş gibi göründükleri nokta ise kaybolunan noktadır.
Prizma modelinin ön yüzü, resmin yani çizimin düzlemine paralel olarak yapılıyorsa bu perspektif çizim tipine bir nokta perspektifi denir.Kaybolunan nokta, prizmaya sağdan bakıldığında ufuk çizgisi üzerinde ve prizmanın sağında; soldan bakıldığında ise solundadır.Bu durum prizmaya alttan ve üstten bakıldığında da değişmez.
Prizma modelinin ön yüzü yani sağ ve sol yüzlerinin kesiştiği dikey ayrıt, çizimin düzlemine paralel değilse perspektif çiziminde iki kaybolunan nokta vardır.Bu tekniğe iki nokta perspektifi denir.
Faydalı Semboller:
÷ × ½ √ ∞ = ≠ ≤ ≥ ≅ ≈ ~ ⇒ ± ∈ Δ θ ∴ ∑ ∫ • π -¹ ² ³ ° ( ) [ ] a b ∠ ∟ ´ ´´ || Δ |x-y{ } ∩ ∪ ⊆ ⊂ ⊄ ⊇ ⊃ ⊅ ⊖ |A| Ø 1
|
{
"url": "http://www.matematikcanavari.net/2013/07/perspektif-cizimi.html",
"source_domain": "www.matematikcanavari.net",
"snapshot_id": "crawl=CC-MAIN-2018-09",
"warc_metadata": {
"Content-Length": "248876",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UQFH455Z7OE6QNSAAJ42Q6M423Q4E7C2",
"WARC-Concurrent-To": "<urn:uuid:7b1d3cae-2e02-495d-8801-609384bc3b93>",
"WARC-Date": "2018-02-24T22:06:45Z",
"WARC-IP-Address": "172.217.12.243",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:LT3FPB5DWFAORGWZ64YYBNAB4ZX5E2NT",
"WARC-Record-ID": "<urn:uuid:22f6a154-e954-4398-881a-58225faa60b5>",
"WARC-Target-URI": "http://www.matematikcanavari.net/2013/07/perspektif-cizimi.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7bc95a73-b669-481b-a852-8d5e6d051e96>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-147-3-28.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-09\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for February 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
39,
40,
41,
61,
62,
80,
81,
99,
100,
327,
328,
576,
577,
740,
741,
1073,
1074,
1277,
1278,
1279,
1299
],
"line_end_idx": [
39,
40,
41,
61,
62,
80,
81,
99,
100,
327,
328,
576,
577,
740,
741,
1073,
1074,
1277,
1278,
1279,
1299,
1424
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1424,
"ccnet_original_nlines": 21,
"rps_doc_curly_bracket": 0.001404489972628653,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.016877640038728714,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016877640038728714,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3291139304637909,
"rps_doc_frac_unique_words": 0.7474226951599121,
"rps_doc_mean_word_length": 6.278350353240967,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.840005397796631,
"rps_doc_word_count": 194,
"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.041871920228004456,
"rps_doc_frac_chars_top_3gram": 0.029556650668382645,
"rps_doc_frac_chars_top_4gram": 0.03940887004137039,
"rps_doc_books_importance": -98.87995147705078,
"rps_doc_books_importance_length_correction": -97.60842895507812,
"rps_doc_openwebtext_importance": -53.738059997558594,
"rps_doc_openwebtext_importance_length_correction": -53.738059997558594,
"rps_doc_wikipedia_importance": -32.53538513183594,
"rps_doc_wikipedia_importance_length_correction": -26.4787654876709
},
"fasttext": {
"dclm": 0.06227517127990723,
"english": 0.0009238300262950361,
"fineweb_edu_approx": 2.109983444213867,
"eai_general_math": 0.00004243999865138903,
"eai_open_web_math": 0.84598708152771,
"eai_web_code": 0.6664491295814514
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "516.0",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
},
"secondary": {
"code": "510.0",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"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": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,624,027,917,261,417,000 |
MacBook Pro trackpad not working? Here’s how to fix it
774.0K views
7 min read
Trackpad not working on your Mac? It’s frustrating, particularly when you can’t bring a spare mouse along.
Yet, fixing a failed Mac trackpad can be simple, depending on its causes. Sometimes, resetting your Mac can make the trackpad operational again. But often, you’ll need to try other methods before you can start moving the mouse pointer again.
Why isn’t my trackpad working?
Apple’s trackpad has advanced touch-sensing and haptic technologies, but it can still fail for several reasons.
• Dirt and grime building up on the trackpad can cause it to behave erratically.
• Buggy macOS version preventing the trackpad from functioning correctly.
• A malware infection that stops the trackpad from sensing taps and clicks.
• Compatibility issues with other apps and devices may interfere with the trackpad’s operation.
• The trackpad’s electronic parts degrade, fail, or suffer from damage.
The thing is, you wouldn’t know the exact cause of your MacBook trackpad problems. But it’s possible to get it running again without sending your machine for repair.
How to fix the trackpad on your MacBook
Know that you’re not alone in facing trackpad issues. Many Mac users have faced the same problem, and they’ve tried various ways to fix it. From updating macOS to resetting the memory chip that the Mac trackpad uses, one of the methods below might prove helpful for you, as they did for others.
1. Check System Settings
If you’ve misconfigured your Mac trackpad, it isn’t surprising that it stopped working. Do a quick check of your Mac’s System Settings. This way, you can rule out your careless.
Click the Apple Menu > System Settings > Trackpad to access the trackpad’s settings. Make sure that Point & Click, Scroll & Zoom, and More Gestures are configured precisely to your preference. For example, if you are more comfortable with tapping to trigger a mouse click, enable Tap To Click.
Sometimes, you can move the pointer with the trackpad but have difficulties clicking. To solve this problem, try adjusting the click sensitivity towards Light. This way, you don’t need to apply much force to register a tap as a click.
2. Disable Force Click
While you’re in the Trackpad settings, you’ll notice that Force Click is turned on by default. Force Click lets you press and apply more pressure on the trackpad to trigger a click. It’s Apple’s ingenious way to let you preview information or access information in certain apps.
As useful as it is, Force Click might cause problems with the trackpad. Also, some users might accidentally apply enough pressure to launch features associated with Force Click. So, turn off Force Click if you find it hinders rather than helps.
disable force click
3. Reset Trackpad
Still facing problems after readjusting the trackpad’s configuration? Perform a complete Macbook Pro trackpad reset. Sounds intimidating, but worry not. Resetting a Mac’s trackpad simply means restoring the device’s configuration to the factory defaults.
Depending on your Mac version, resetting the trackpad works differently. Here’s how to reset the trackpad on a Mac with an M2 chip.
1. Click Go on the desktop’s menu.
2. Select Libray > Preferences.
3. Search for these files
• com.apple.preference.track.plist
• com.apple.AppleMultitouchTrackpad.plist
• Delete both files.
• Restart your MacBook.
• delete trackpad property list
What you’ve done is removing the trackpad’s property files that might have been corrupted. Upon restarting, your Mac will replace them with new files.
If your Mac runs on an Apple chip, follow these steps to restore the trackpad’s configuration to default.
1. Go to Apple > System Settings > Trackpad.
2. Select the Point & Click tab and uncheck Tap to Click.
3. Select the Zoom & Scrolling Tab and check Natural Scrolling.
Your trackpad is now configured to its original settings and, hopefully, is functional again.
4. Reset NVRAM or PRAM
Despite restoring the trackpad’s settings, it might still fail to function correctly. If that’s the case, you can try resetting your Mac’s NVRAM and PRAM. Both are temporary memory storage that the trackpad uses to operate. If the underlying data is corrupted, the trackpad cannot function.
Here’s how to reset NVRAM and PRAM on a MacBook with an Intel chip.
1. Power off your MacBook.
2. Turn the MacBook on and immediately press Option + Command + P + R for 20 seconds.
3. Release the keys after hearing a startup sound or the Apple logo appears.
That’s the sign that your Mac has reset the NVRAM and PRAM.
However, this method is limited to older MacBooks. The newer Apple chip-powered Mac automatically refreshes both memory chips when restarting.
5. Reset the SMC
Another way to resolve the MacBook trackpad not working issue is to reset your Mac’s System Management Controller. Older Macs use the SMC for power management and battery charging. Somehow, the SMC can affect the trackpad’s function.
Resetting the SMC on an Intel-powered Mac.
1. Turn off your MacBook.
2. Press and hold the Control + Option + Shift buttons on the left side of the keyboard.
3. Then, press the power button.
4. Hold all buttons for 10 seconds.
5. Release all buttons. Then, power up your Mac.
Resetting the SMC on a Mac with a T2 security chip.
1. Power down your Mac.
2. Press and hold the right Shift and the left Control + Option keys.
3. Hold all keys for 7 seconds.
4. Your Mac might power up but don’t release those keys until it automatically powers down again.
5. Then, release all keys and restart your Mac.
You can’t reset the SMC if you’re using newer Macs powered by M1 or M2 chip because they don’t have one.
6. Run Apple Diagnostics
Your trackpad can fail because of underlying hardware issues. If that’s the case, you need to run Apple Diagnostics to discover the root causes.
Here’s how to run Apple Diagnostics on an Intel-based MacBook.
1. Turn off your Mac and remove all connected devices.
2. Power on the machine and hold the D key (or Option + D if the previous one doesn’t work).
3. Release the key after seeing the progress bar or when prompted to select a language.
On an Apple chip-powered Mac, follow these steps.
1. Shut down your Mac computer and disconnect all devices.
2. Press and hold the power button.
3. Release the power button when you see the startup options.
4. Press and hold Command + D to start the diagnostic.
If your trackpad has failed because of hardware issues, the diagnostic results will reflect that. Jot down the reference code so you can communicate the issue when you send your Mac for repair.
Apple Diagnostic works well in identifying hardware failure, but what if your trackpad is infected by malware?
Remove them with CleanMyMac X, which has a built-in malware scanner. CleanMyMac X can also boost Mac performance by removing unnecessary files.
Here’s how.
1. Install and launch CleanMyMac.
2. Select Smart Scan from the left panel.
3. Click Run.
Wait for the scan to complete. Then review the results and delete junk files.
cleanmymac x smart scan
7. Update your MacBook
Forgetting to update your Mac’s operating system can invite all sorts of troubles, including Mac trackpad not clicking. To be sure, check if you’re using the latest macOS. Go to Menu > System Settings > Software Update.
If you see the Update Now button, it means your Mac’s OS is not up to date. Click the button and install the latest update. Then, restart your Mac and test if your trackpad is working.
8. Run Maintenance Scripts
A failing trackpad is also a sign that your Mac is littered with junk files and unnecessary apps. Freeing your Mac from files that affect Mac performance may also get your trackpad to work again.
To do that, run the maintenance scripts with CleanMyMac X to restore your Mac to tip-top condition. Here’s how to do it.
1. Install and open CleanMyMac X.
2. Select Maintenance on the left panel.
3. Click Run Maintainance Scripts.
4. Click Run.
Wait for CleanMyMac X to complete the maintenance task. Then, try your trackpad again.
cleanmymac x maintenance scripts
9. Check for software updates
If you suspect some apps are causing odd behaviors on your trackpad, try updating them. Click the Apple icon > App Store. You’ll find a list of apps that require an update. Then update every outdated app.
Alternatively, go to Apple icon > System Settings > General > Software Update. Your Mac will automatically check for updates your apps require and apply them. Both steps require manual updating or navigating through several system settings.
If you want an easier way to update your apps, try CleanMyMac X. Here’s how it works.
1. Install and open CleanMyMac X.
2. Click Updater on the left panel.
3. Select one or several apps that require updating.
4. Click Update.
Wait for all apps to be updated.
cleanmymac x software updates
10. Disconnect peripherals
As innocent as they are, peripherals like a mouse, Bluetooth headphones, and mics sometimes take the blame when your MacBook trackpad is not clicking. Thankfully, the solution is simple. Just disconnect all devices, wired or wireless, and you can use the trackpad again.
Bonus tips for your Mac
A problematic trackpad often points to other deep-rooted problems with your Mac. Don’t wait for problems to fester. Rather, it’s better to monitor your Mac thoroughly with iStat Menus. I like how the app runs silently in the background and provides critical real-time indicators, including CPU/GPU usage, disk usage, and machine temperature.
istat menus cpu usage
Also, I make it a habit to back up all my work and personal files. Because if a trackpad could fail, what’s stopping your Mac’s hard drive from falling apart? As a precaution, I backed up my most important files with Get Backup Pro on an external drive. Unlike the built-in Time Machine, I don't have to back up my entire Mac or dig deep (really deep!) into the preferences to change this setup.
Here’s how to back up your files with Get Backup Pro:
1. Connect a secondary drive to your Mac, such as an SD card.
2. Download and launch Get Backup Pro.
3. Choose Backup at the left panel.
4. Click the File+ button. Then, select the files you want to backup.
5. Click the blue button with the triangle icon to start the backup.
6. Wait for the backup to complete.
You can also use Get Backup Pro to archive selected folders or clone the entire system. The app lets you schedule the backups so you can automatically make copies of important files.
get backup pro automatic backup
Finding a fix to the MacBook Pro trackpad not working problem
The truth is — it might take several tries before you can get your Mac’s trackpad functioning again. As you can see, MacBook gives little hint of what causes your trackpad to fail. So, you’ll have some investigation and problem-fixing to do.
Using apps like CleanMyMac X and iStat Menus can make your task simpler. Instead of grasping in the dark, these apps give you a better idea of how your Mac is behaving. Also, don’t wait for the worst to happen. Remember to back up your files with Get Backup Pro so you can recover them anytime.
You can get the apps I mentioned on Setapp, along with other productivity apps. Before committing to Setapp’s subscription, you can try them for 7 days at no cost.
250+ apps for $9.99
per month
Sign up to Setapp and try them for free.
Security-tested
|
{
"url": "https://setapp.com/how-to/how-to-fix-macbook-trackpad-not-working",
"source_domain": "setapp.com",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "106859",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MU374Q7Q5OTY4ER6VPNK6GWZDSLFKWOH",
"WARC-Concurrent-To": "<urn:uuid:d919d204-4c33-4b2e-8c51-dcb476da1b75>",
"WARC-Date": "2024-07-24T06:29:19Z",
"WARC-IP-Address": "104.18.40.4",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2QCW3JGCYPTR2QKQJU7ZNHHTXVZWOOS4",
"WARC-Record-ID": "<urn:uuid:1110eccb-9fda-48ca-92d3-c5f5593bc5a4>",
"WARC-Target-URI": "https://setapp.com/how-to/how-to-fix-macbook-trackpad-not-working",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:33b39497-ee8c-43be-9448-a5f03f8604e1>"
},
"warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-196\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
55,
56,
69,
80,
81,
189,
190,
433,
434,
466,
467,
580,
581,
664,
740,
818,
917,
992,
993,
1160,
1161,
1202,
1203,
1500,
1501,
1527,
1528,
1706,
1707,
2001,
2002,
2240,
2241,
2264,
2265,
2545,
2546,
2792,
2793,
2813,
2814,
2832,
2833,
3089,
3090,
3223,
3224,
3261,
3295,
3324,
3362,
3406,
3430,
3456,
3490,
3491,
3646,
3647,
3758,
3759,
3808,
3870,
3939,
3940,
4039,
4040,
4067,
4068,
4363,
4364,
4436,
4437,
4468,
4558,
4639,
4640,
4705,
4706,
4854,
4855,
4876,
4877,
5115,
5116,
5163,
5164,
5194,
5288,
5325,
5365,
5419,
5420,
5477,
5478,
5506,
5581,
5617,
5720,
5772,
5773,
5883,
5884,
5913,
5914,
6064,
6065,
6132,
6133,
6192,
6289,
6381,
6382,
6437,
6438,
6501,
6541,
6607,
6667,
6668,
6866,
6867,
6982,
6983,
7131,
7132,
7148,
7149,
7187,
7233,
7251,
7252,
7335,
7336,
7364,
7365,
7392,
7393,
7618,
7619,
7809,
7810,
7841,
7842,
8042,
8043,
8168,
8169,
8208,
8253,
8293,
8312,
8313,
8405,
8406,
8443,
8444,
8478,
8479,
8689,
8690,
8936,
8937,
9027,
9028,
9067,
9107,
9164,
9185,
9186,
9224,
9225,
9259,
9260,
9291,
9292,
9569,
9570,
9598,
9599,
9945,
9946,
9972,
9973,
10373,
10374,
10432,
10433,
10500,
10543,
10583,
10657,
10731,
10771,
10772,
10960,
10961,
10997,
10998,
11064,
11065,
11311,
11312,
11611,
11612,
11781,
11782,
11806,
11820,
11821,
11866,
11867
],
"line_end_idx": [
55,
56,
69,
80,
81,
189,
190,
433,
434,
466,
467,
580,
581,
664,
740,
818,
917,
992,
993,
1160,
1161,
1202,
1203,
1500,
1501,
1527,
1528,
1706,
1707,
2001,
2002,
2240,
2241,
2264,
2265,
2545,
2546,
2792,
2793,
2813,
2814,
2832,
2833,
3089,
3090,
3223,
3224,
3261,
3295,
3324,
3362,
3406,
3430,
3456,
3490,
3491,
3646,
3647,
3758,
3759,
3808,
3870,
3939,
3940,
4039,
4040,
4067,
4068,
4363,
4364,
4436,
4437,
4468,
4558,
4639,
4640,
4705,
4706,
4854,
4855,
4876,
4877,
5115,
5116,
5163,
5164,
5194,
5288,
5325,
5365,
5419,
5420,
5477,
5478,
5506,
5581,
5617,
5720,
5772,
5773,
5883,
5884,
5913,
5914,
6064,
6065,
6132,
6133,
6192,
6289,
6381,
6382,
6437,
6438,
6501,
6541,
6607,
6667,
6668,
6866,
6867,
6982,
6983,
7131,
7132,
7148,
7149,
7187,
7233,
7251,
7252,
7335,
7336,
7364,
7365,
7392,
7393,
7618,
7619,
7809,
7810,
7841,
7842,
8042,
8043,
8168,
8169,
8208,
8253,
8293,
8312,
8313,
8405,
8406,
8443,
8444,
8478,
8479,
8689,
8690,
8936,
8937,
9027,
9028,
9067,
9107,
9164,
9185,
9186,
9224,
9225,
9259,
9260,
9291,
9292,
9569,
9570,
9598,
9599,
9945,
9946,
9972,
9973,
10373,
10374,
10432,
10433,
10500,
10543,
10583,
10657,
10731,
10771,
10772,
10960,
10961,
10997,
10998,
11064,
11065,
11311,
11312,
11611,
11612,
11781,
11782,
11806,
11820,
11821,
11866,
11867,
11886
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 11886,
"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.35313668847084045,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018280019983649254,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1965101808309555,
"rps_doc_frac_unique_words": 0.29870128631591797,
"rps_doc_mean_word_length": 4.705454349517822,
"rps_doc_num_sentences": 224,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.555047035217285,
"rps_doc_word_count": 1925,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.037535879760980606,
"rps_doc_frac_chars_dupe_6grams": 0.017884740605950356,
"rps_doc_frac_chars_dupe_7grams": 0.0132479602470994,
"rps_doc_frac_chars_dupe_8grams": 0.007286380045115948,
"rps_doc_frac_chars_dupe_9grams": 0.007286380045115948,
"rps_doc_frac_chars_top_2gram": 0.018547140061855316,
"rps_doc_frac_chars_top_3gram": 0.007286380045115948,
"rps_doc_frac_chars_top_4gram": 0.004305589944124222,
"rps_doc_books_importance": -929.2566528320312,
"rps_doc_books_importance_length_correction": -929.2566528320312,
"rps_doc_openwebtext_importance": -638.5931396484375,
"rps_doc_openwebtext_importance_length_correction": -638.5931396484375,
"rps_doc_wikipedia_importance": -488.5073547363281,
"rps_doc_wikipedia_importance_length_correction": -488.5073547363281
},
"fasttext": {
"dclm": 0.034436941146850586,
"english": 0.838050365447998,
"fineweb_edu_approx": 1.4469478130340576,
"eai_general_math": 0.07165669649839401,
"eai_open_web_math": 0.2163025140762329,
"eai_web_code": 0.04785991087555885
}
}
|
{
"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": "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": "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,059,398,503,707,177,700 |
C语言Win/Linux IP地址段整理
选择打赏方式
说明:只写了C段D段例:172.16.0.0 172.16.255.255
编译:gcc ip.c -o ip
#include <stdio.h>
int main()
{
int i,ii,iii,i1,i2,ch;
int n=0;
char w3[36];
FILE *fp;
FILE *fp1;
//检测行数
fp=fopen("ip.txt","r");
while((ch = fgetc(fp)) != EOF)
{if(ch == '\n'){n++;}}
fclose(fp);
//逐行读取
fp=fopen("ip.txt","r+");
for(i=1;i<=n;i++){
fgets(w3,100,fp);
int da0,da1,da2,da3,da4,da5,da6,da7;
sscanf(w3,"%d.%d.%d.%d %d.%d.%d.%d",&da0,&da1,&da2,&da3,&da4,&da5,&da6,&da7);
for(i2 = da0; i2 <= da4; i2++){
for(i1 = da1; i1 <= da5; i1++){
for(ii = da2; ii <= da6; ii++){
if (ii==da2){
for(iii = da3; iii <= 255; iii++)
{
printf("%d.%d.%d.%d\n",i2,i1,ii,iii);
}
ii++;
}
if(ii<da6){
//ii++;
for(iii = 0; iii <= 255; iii++)
{
printf("%d.%d.%d.%d\n",i2,i1,ii,iii);
}
}
else {
for(iii = 0; iii <= da7; iii++)
{
fp1=fopen("ips.txt","a+");
fprintf(fp1,"%d.%d.%d.%d\n",i2,i1,ii,iii);
fclose(fp1);
}
}
}}}
//for结束
}
fclose(fp);
return 0;
}
版权声明：若无特殊注明，本文皆为《 CM部落 》原创，转载请保留文章出处。
本文链接：C语言Win/Linux IP地址段整理 https://itkz.cn/note/93.html
正文到此结束
热门推荐
发表吐槽
你肿么看？
你还可以输入 250 / 250 个字
嘻嘻 大笑 可怜 吃惊 害羞 调皮 鄙视 示爱 大哭 开心 偷笑 嘘 奸笑 委屈 抱抱 愤怒 思考 日了狗 胜利 不高兴 阴险 乖 酷 滑稽
评论信息框
吃奶的力气提交吐槽中...
既然没有吐槽，那就赶紧抢沙发吧！
|
{
"url": "https://itkz.cn/note/93.html",
"source_domain": "itkz.cn",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "38569",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QLMY3U2XL4PENBP3IITE5EF7JOTDKGMH",
"WARC-Concurrent-To": "<urn:uuid:949fb066-977f-4429-b80c-a151f8269a8f>",
"WARC-Date": "2022-12-01T11:00:37Z",
"WARC-IP-Address": "119.23.33.118",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:N4CRBLJOYHEZDXPUTS6CI6YADLTAQVG4",
"WARC-Record-ID": "<urn:uuid:4fa27b74-d363-465e-87a0-8c0267534652>",
"WARC-Target-URI": "https://itkz.cn/note/93.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:aba4a882-9ac5-4268-aa4e-169d7fa84d4c>"
},
"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-73\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,
21,
22,
33,
34,
72,
90,
109,
120,
122,
145,
154,
167,
177,
188,
195,
219,
252,
277,
289,
296,
321,
340,
358,
395,
473,
505,
537,
569,
591,
637,
651,
715,
729,
747,
757,
777,
798,
838,
852,
917,
932,
942,
957,
1001,
1015,
1058,
1117,
1151,
1168,
1178,
1182,
1190,
1192,
1207,
1221,
1223,
1261,
1316,
1323,
1324,
1329,
1330,
1335,
1336,
1342,
1343,
1363,
1364,
1436,
1437,
1443,
1444,
1458,
1459,
1460
],
"line_end_idx": [
21,
22,
33,
34,
72,
90,
109,
120,
122,
145,
154,
167,
177,
188,
195,
219,
252,
277,
289,
296,
321,
340,
358,
395,
473,
505,
537,
569,
591,
637,
651,
715,
729,
747,
757,
777,
798,
838,
852,
917,
932,
942,
957,
1001,
1015,
1058,
1117,
1151,
1168,
1178,
1182,
1190,
1192,
1207,
1221,
1223,
1261,
1316,
1323,
1324,
1329,
1330,
1335,
1336,
1342,
1343,
1363,
1364,
1436,
1437,
1443,
1444,
1458,
1459,
1460,
1476
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1476,
"ccnet_original_nlines": 75,
"rps_doc_curly_bracket": 0.0176151804625988,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10769230872392654,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015384620055556297,
"rps_doc_frac_lines_end_with_ellipsis": 0.013157890178263187,
"rps_doc_frac_no_alph_words": 0.6109890341758728,
"rps_doc_frac_unique_words": 0.8080000281333923,
"rps_doc_mean_word_length": 5.535999774932861,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0.004395599942654371,
"rps_doc_unigram_entropy": 4.501039981842041,
"rps_doc_word_count": 125,
"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.017341040074825287,
"rps_doc_frac_chars_top_3gram": 0.02601156011223793,
"rps_doc_frac_chars_top_4gram": 0.08381503075361252,
"rps_doc_books_importance": -215.10498046875,
"rps_doc_books_importance_length_correction": -208.26425170898438,
"rps_doc_openwebtext_importance": -137.9577178955078,
"rps_doc_openwebtext_importance_length_correction": -137.9577178955078,
"rps_doc_wikipedia_importance": -105.5519790649414,
"rps_doc_wikipedia_importance_length_correction": -95.09869384765625
},
"fasttext": {
"dclm": 0.9996147751808167,
"english": 0.09863351285457611,
"fineweb_edu_approx": 3.267185926437378,
"eai_general_math": 0.20594990253448486,
"eai_open_web_math": 0.012431499548256397,
"eai_web_code": 0.5993307828903198
}
}
|
{
"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": "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": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,698,614,571,470,777,000 |
SAT Math : How to find the area of an equilateral triangle
Study concepts, example questions & explanations for SAT Math
varsity tutors app store varsity tutors android store varsity tutors amazon store varsity tutors ibooks store
Example Questions
Example Question #2 : How To Find The Area Of An Equilateral Triangle
The area of square ABCD is 50% greater than the perimeter of the equilateral triangle EFG. If the area of square ABCD is equal to 45, then what is the area of EFG?
Possible Answers:
25√3
50
50√3
30
25
Correct answer:
25√3
Explanation:
If the area of ABCD is equal to 45, then the perimeter of EFG is equal to x * 1.5 = 45. 45 / 1.5 = 30, so the perimeter of EFG is equal to 30. This means that each side is equal to 10.
The height of the equilateral triangle EFG creates two 30-60-90 triangles, each with a hypotenuse of 10 and a short side equal to 5. We know that the long side of 30-60-90 triangle (here the height of EFG) is equal to √3 times the short side, or 5√3.
We then apply the formula for the area of a triangle, which is 1/2 * b * h. We get 1/2 * 10 * 5√3 = 5 * 5√3 = 25√3.
In general, the height of an equilateral triangle is equal to √3 / 2 times a side of the equilateral triangle. The area of an equilateral triangle is equal to 1/2 * √3s/ 2 * s = √3s2/4.
Example Question #1 : How To Find The Area Of An Equilateral Triangle
What is the area of an equilateral triangle with sides 12 cm?
Possible Answers:
18√3
12√2
54√2
36√3
72√3
Correct answer:
36√3
Explanation:
An equilateral triangle has three congruent sides and results in three congruent angles. This figure results in two special right triangles back to back: 30° – 60° – 90° giving sides of x - x √3 – 2x in general. The height of the triangle is the x √3 side. So Atriangle = 1/2 bh = 1/2 * 12 * 6√3 = 36√3 cm2.
Example Question #1 : How To Find The Area Of An Equilateral Triangle
A regular hexagon and an equilateral triangle have equal perimeters. If the hexagon has side lengths of 5, what is the area of the triangle?
Possible Answers:
Correct answer:
Explanation:
Perimeter of hexagon = = perimeter of triangle
= side of the triangle
Example Question #1 : How To Find The Area Of An Equilateral Triangle
An equilateral triangle has a perimeter of 18. What is its area?
Possible Answers:
Correct answer:
Explanation:
Recall that an equilateral triangle also obeys the rules of isosceles triangles. That means that our triangle can be represented as having a height that bisects both the opposite side and the angle from which the height is "dropped." For our triangle, this can be represented as:
6-equilateral
Now, although we do not yet know the height, we do know from our 30-60-90 regular triangle that the side opposite the 60° angle is √3 times the length of the side across from the 30° angle. Therefore, we know that the height is 3√3.
Now, the area of a triangle is (1/2)bh. If the height is 3√3 and the base is 6, then the area is (1/2) * 6 * 3√3 = 3 * 3√3 = 9√(3).
Learning Tools by Varsity Tutors
|
{
"url": "https://www.varsitytutors.com/sat_math-help/how-to-find-the-area-of-an-equilateral-triangle",
"source_domain": "www.varsitytutors.com",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "158681",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6VBSUO4YNKYIXLXTYPOKUMKQVMCP5DDI",
"WARC-Concurrent-To": "<urn:uuid:2964cd9f-5bd1-4f84-9587-0d3666163662>",
"WARC-Date": "2017-10-22T04:52:04Z",
"WARC-IP-Address": "54.191.221.25",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:QCOW5DUAJGW7QHUW4DM2RASNPRPVBXBD",
"WARC-Record-ID": "<urn:uuid:273310a7-c0e4-4d24-81bc-24560da56d87>",
"WARC-Target-URI": "https://www.varsitytutors.com/sat_math-help/how-to-find-the-area-of-an-equilateral-triangle",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b866d557-4647-483a-b1de-d16e04561a60>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-178-236-198.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,
59,
60,
122,
123,
233,
234,
252,
253,
323,
324,
488,
489,
507,
508,
513,
514,
517,
518,
523,
524,
527,
528,
531,
532,
548,
549,
554,
555,
568,
569,
754,
755,
1006,
1007,
1123,
1124,
1310,
1311,
1381,
1382,
1444,
1445,
1463,
1464,
1469,
1470,
1475,
1476,
1481,
1482,
1487,
1488,
1493,
1494,
1510,
1511,
1516,
1517,
1530,
1531,
1840,
1841,
1911,
1912,
2054,
2055,
2073,
2074,
2090,
2091,
2104,
2105,
2153,
2154,
2178,
2179,
2249,
2250,
2315,
2316,
2334,
2335,
2351,
2352,
2365,
2366,
2649,
2650,
2664,
2665,
2898,
2899,
3031,
3032
],
"line_end_idx": [
59,
60,
122,
123,
233,
234,
252,
253,
323,
324,
488,
489,
507,
508,
513,
514,
517,
518,
523,
524,
527,
528,
531,
532,
548,
549,
554,
555,
568,
569,
754,
755,
1006,
1007,
1123,
1124,
1310,
1311,
1381,
1382,
1444,
1445,
1463,
1464,
1469,
1470,
1475,
1476,
1481,
1482,
1487,
1488,
1493,
1494,
1510,
1511,
1516,
1517,
1530,
1531,
1840,
1841,
1911,
1912,
2054,
2055,
2073,
2074,
2090,
2091,
2104,
2105,
2153,
2154,
2178,
2179,
2249,
2250,
2315,
2316,
2334,
2335,
2351,
2352,
2365,
2366,
2649,
2650,
2664,
2665,
2898,
2899,
3031,
3032,
3064
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3064,
"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.2657534182071686,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016438359394669533,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3589041233062744,
"rps_doc_frac_unique_words": 0.2907407283782959,
"rps_doc_mean_word_length": 4.2833333015441895,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0.0054794498719275,
"rps_doc_unigram_entropy": 4.451050281524658,
"rps_doc_word_count": 540,
"rps_doc_frac_chars_dupe_10grams": 0.07133592665195465,
"rps_doc_frac_chars_dupe_5grams": 0.32209253311157227,
"rps_doc_frac_chars_dupe_6grams": 0.20319931209087372,
"rps_doc_frac_chars_dupe_7grams": 0.15520967543125153,
"rps_doc_frac_chars_dupe_8grams": 0.10505837202072144,
"rps_doc_frac_chars_dupe_9grams": 0.10505837202072144,
"rps_doc_frac_chars_top_2gram": 0.045395590364933014,
"rps_doc_frac_chars_top_3gram": 0.054474711418151855,
"rps_doc_frac_chars_top_4gram": 0.0795503705739975,
"rps_doc_books_importance": -314.9811096191406,
"rps_doc_books_importance_length_correction": -314.9811096191406,
"rps_doc_openwebtext_importance": -147.1593780517578,
"rps_doc_openwebtext_importance_length_correction": -147.1593780517578,
"rps_doc_wikipedia_importance": -108.59414672851562,
"rps_doc_wikipedia_importance_length_correction": -108.59414672851562
},
"fasttext": {
"dclm": 0.983941376209259,
"english": 0.8179032802581787,
"fineweb_edu_approx": 3.0709898471832275,
"eai_general_math": 0.9990291595458984,
"eai_open_web_math": 0.6276601552963257,
"eai_web_code": 0.01678955927491188
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "516.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
},
"secondary": {
"code": "378.16",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Higher and Universities and colleges"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "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
|
-949,637,571,687,353,600 |
how do i put a texture on a uneven object?
well the title pretty much explains it. but i want to know how to do it. with out the texture mutiplying when u apply it.
Uneven object? I don’t follow… got a picture? UV mapping?
afa texture multiplication I can only guess you don’t want the tex to scale with the object… you could place add and empty that tracks the location/rotation (not scale!) of your object then set your object’s material mapping to the empty object.
no lol, but i want the texture to be placed on the object and if it doesnt fit it just adds anouter one next to it with out changing size.
Answer the question - UVMapping or Material Image Texture?
%<
im doing uvmaping so it will apear in the a game.
|
{
"url": "https://blenderartists.org/t/how-do-i-put-a-texture-on-a-uneven-object/373024",
"source_domain": "blenderartists.org",
"snapshot_id": "crawl=CC-MAIN-2020-10",
"warc_metadata": {
"Content-Length": "19650",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WKUDSZIJL24ZC6SRGAQM3RKAM7OSBSNH",
"WARC-Concurrent-To": "<urn:uuid:44b87be2-c903-4597-ae35-2994a5bf2e07>",
"WARC-Date": "2020-02-19T10:08:08Z",
"WARC-IP-Address": "104.27.177.179",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KYRWZEXMJKB5PHPVGMYOXNDU3WMWPGON",
"WARC-Record-ID": "<urn:uuid:141b17dc-4640-4d9f-9165-14f64bfb0ccc>",
"WARC-Target-URI": "https://blenderartists.org/t/how-do-i-put-a-texture-on-a-uneven-object/373024",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e1c0ad83-8cfe-4f64-8154-dc699dd62f52>"
},
"warc_info": "isPartOf: CC-MAIN-2020-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-10.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,
43,
44,
166,
167,
225,
226,
472,
473,
612,
613,
672,
673,
676,
677,
678,
679
],
"line_end_idx": [
43,
44,
166,
167,
225,
226,
472,
473,
612,
613,
672,
673,
676,
677,
678,
679,
728
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 728,
"ccnet_original_nlines": 16,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4938271641731262,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018518520519137383,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1358024626970291,
"rps_doc_frac_unique_words": 0.6102941036224365,
"rps_doc_mean_word_length": 4.139705657958984,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0.01234568003565073,
"rps_doc_unigram_entropy": 4.154682159423828,
"rps_doc_word_count": 136,
"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.04262876883149147,
"rps_doc_frac_chars_top_3gram": 0.02841917984187603,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -60.893978118896484,
"rps_doc_books_importance_length_correction": -60.90416717529297,
"rps_doc_openwebtext_importance": -41.71074295043945,
"rps_doc_openwebtext_importance_length_correction": -41.7209358215332,
"rps_doc_wikipedia_importance": -32.426231384277344,
"rps_doc_wikipedia_importance_length_correction": -32.43642044067383
},
"fasttext": {
"dclm": 0.04631173983216286,
"english": 0.895721971988678,
"fineweb_edu_approx": 1.1291009187698364,
"eai_general_math": 0.7379416823387146,
"eai_open_web_math": 0.15943235158920288,
"eai_web_code": 0.691982090473175
}
}
|
{
"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": "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": "-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": "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": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,435,849,129,082,760,000 |
Retrieving Elements from Collection in Java- EnumerationIterator
Java 8Server Side ProgrammingProgramming
EnumerationIterator doesn’t have the option of eliminating elements from the collection, whereas an iterator has this facility. An additional disadvantage of using EnumerationIterator is that the name of methods associated with EnumerationIterator is difficult to remember.
Example
Following is an example −
Live Demo
import java.util.Vector;
import java.util.Enumeration;
public class Demo {
public static void main(String args[]) {
Vector day_name = new Vector();
day_name.add("Tuesday");
day_name.add("Thursday");
day_name.add("Saturday");
day_name.add("Sunday");
Enumeration my_days = day_name.elements();
System.out.println("The values are ");
while (my_days.hasMoreElements())
System.out.println(my_days.nextElement());
}
}
Output
The values are
Tuesday
Thursday
Saturday
Sunday
A class named Demo contains the main function, where a Vector instance is defined. Elements are added to the vector with the help of the ‘add’ function. Now, an Enumeration instance is created, and the vector is accessed and the function ‘elements’ is called on it. The output is printed on the screen by iterating over every element and checking if there are any more values in the vector.
raja
Published on 14-Sep-2020 13:11:53
Advertisements
|
{
"url": "https://www.tutorialspoint.com/retrieving-elements-from-collection-in-java-enumerationiterator",
"source_domain": "www.tutorialspoint.com",
"snapshot_id": "crawl=CC-MAIN-2021-17",
"warc_metadata": {
"Content-Length": "28447",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZKJYFB6UZ5MLIYWW7DMEW4WZ2CALJKO3",
"WARC-Concurrent-To": "<urn:uuid:d6df50e2-cd46-4775-a231-83b696db5619>",
"WARC-Date": "2021-04-14T13:54:50Z",
"WARC-IP-Address": "72.21.91.42",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JHZSZON3XRCM63C7O5B52BDUZAYWELX3",
"WARC-Record-ID": "<urn:uuid:940bdbcc-350f-4b92-bc52-9f0ddcee754d>",
"WARC-Target-URI": "https://www.tutorialspoint.com/retrieving-elements-from-collection-in-java-enumerationiterator",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4f1da4ee-1f0b-4804-9653-dc14667a5334>"
},
"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-247.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,
65,
66,
107,
108,
382,
383,
391,
392,
418,
419,
430,
431,
456,
486,
506,
550,
588,
619,
651,
683,
713,
762,
807,
847,
896,
901,
903,
904,
911,
912,
927,
935,
944,
953,
960,
961,
1352,
1353,
1358,
1392
],
"line_end_idx": [
65,
66,
107,
108,
382,
383,
391,
392,
418,
419,
430,
431,
456,
486,
506,
550,
588,
619,
651,
683,
713,
762,
807,
847,
896,
901,
903,
904,
911,
912,
927,
935,
944,
953,
960,
961,
1352,
1353,
1358,
1392,
1406
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1406,
"ccnet_original_nlines": 40,
"rps_doc_curly_bracket": 0.0028449499513953924,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2745097875595093,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.003921569790691137,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26274511218070984,
"rps_doc_frac_unique_words": 0.628742516040802,
"rps_doc_mean_word_length": 6.413173675537109,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.386890411376953,
"rps_doc_word_count": 167,
"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.025210080668330193,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -106.24378967285156,
"rps_doc_books_importance_length_correction": -106.04914855957031,
"rps_doc_openwebtext_importance": -61.58148193359375,
"rps_doc_openwebtext_importance_length_correction": -61.58148193359375,
"rps_doc_wikipedia_importance": -51.08224105834961,
"rps_doc_wikipedia_importance_length_correction": -46.97294998168945
},
"fasttext": {
"dclm": 0.07036805152893066,
"english": 0.7298168540000916,
"fineweb_edu_approx": 2.452852964401245,
"eai_general_math": 0.06972849369049072,
"eai_open_web_math": 0.38799571990966797,
"eai_web_code": 0.9998680353164673
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-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
|
8,136,006,510,916,988,000 |
Jump to content
Internet Explorer Vulnerability Exploited Again
Stryder
Recommended Posts
Again, this isn't an issue that is totally Microsoft's fault. As is recommended in the article:Microsoft also recommended that users protect themselves against the newer exploits by changing Internet Explorer's security zone settings to prompt before running ActiveX controls, and although the original patch doesn't cover all the bases, install that fix nonetheless.By default, the security settings in the Internet zone don't allow automatic downloading of Active-x controls and other things. You need to review and tune these. Your protection is up to you!As an aside, it is mentioned that other browsers don't have these problems. Why not? Don't they use or allow Active-X controls? If not, what happens when you encounter a site that wants to use Active-x controls?
Link to comment
Share on other sites
Mozilla can't run Active X so the site doesn't work correctly. For example if you try to run Trend Micro's online virus scan, an active X program, you get redirected to this http://housecall.trendmicro.com/housecall/install.html.
Well that stinks! Is Firebird the same? If so, I would have no use for these implementations. There are simply too many sites that I visit that require Active-x.
Link to comment
Share on other sites
nlinecomputers
Really I use Moz as my main browser and except for Microsoft sites I rearly have trouble with it. I find more Java websites then Active X.
Link to comment
Share on other sites
Yes FB is the same... and I'm with Nathan. The only sites I run into where I need ActiveX are MS sites, and the only one I use semi-frequently is Windows update. Everything else now is Java or Flash (what I use anyway).
Link to comment
Share on other sites
Guest LilBambi
Same here Ryan and Nathan ...MS sites are about the only ones where I absolutely will only use IE and I have had scripting set to prompt me for a long time now just to be on the safe side because of these types of things.I have no problems with Flash or Java sites, CSS or javascripting, php or most anything else in Firebird 6.1 ... as a matter of fact, it handles the alpha channel css sites much better than IE.I still like IE better for forums though ... it handles then a little better with adding codes throughout a message after you have already typed it, but that is a personal preference only. Firebird handles forums well overall.
Link to comment
Share on other sites
it handles then a little better with adding codes throughout a message after you have already typed it
I've only ever used Firebird or Moz since I joined the forums, so I've never seen what they look like in I.E. I'm not sure what the above means, since I don't do much with programming. Could you explain it for the clueless? :lol:
Link to comment
Share on other sites
Jeber,What she's saying is that when you use any of the buttons in a message post (bold, img, smileys, etc) IE will put the code wherever the cursor is at in the message. For some reason, FB/Moz will only put the code at the end of the message... This is a known problem with Moz/FB, but they have yet to figure out what it'll take to fix it.Fran,I agree with your point, and it is somewhat annoying, but I've just gotten used to typing out the code instead of using the buttons... Don't like having to take the hands off the keyboard. :lol:
Link to comment
Share on other sites
Shows how stupid one can be without all the facts. I assumed that was a board problem...never suspected my browser. I've gotten so used to either hand coding them or cut/paste that it's second nature to me now. Maybe I should spend a day here in I.E. just to see the difference. I haven't used Opera here for months, either. Time for some test drives.Thanks, Ryan.
Link to comment
Share on other sites
Calm down...just a day, I said. Not to upset our I.E. users, but I just can't stand it as a browser anymore. Too fat a tool bar, limited options, slow, ugly, a security risk...better stop before the fire breaks out. But I am curious now that you've enlightened me. See...it's all your fault! :rolleyes:Of course, I'm usually here on Linux, which could slow me down a bit with I.E. :lol:
Link to comment
Share on other sites
Guest LilBambi
LOL! Never fear Ryan ... Jack'll be right back in Linux :)Thanks for the great explanation Ryan ... that's exactly what I was referring to.
Link to comment
Share on other sites
i'm in the "Firebird" crowd, and when i come across some sites that need ActiveX, i use IE. actually, there's just a couple, but i need them for work only. You can view a design part from a library in 3D and download what you need right into the design software. oh well, no big deal. personally i'd perfer to see ActiveX be made extinct but until that day comes, i'll just stick to Firebird and HTML and CSS and other codes that can't infect my computer by simply visiting a website. :lol:
Link to comment
Share on other sites
The only sites I run into where I need ActiveX are MS sites,
I agree. I use Netscape constantly and rarely encounter sites that requires ActiveX. Windows Update is indeed one but it auto-starts IE anyways.
Shows how stupid one can be without all the facts. I assumed that was a board problem...never suspected my browser. I've gotten so used to either hand coding them or cut/paste that it's second nature to me now.
You're not alone. I have the same problem with Netscape and assumed the same thing. I also do the hand coding and sometimes use cut&paste also.Course it is common for website programmers to blame their coding shortcomings on the client's browser. So it could still be a board's problem. :lol:
Link to comment
Share on other sites
personally i'd perfer to see ActiveX be made extinct but until that day comes, i'll just stick to Firebird and HTML and CSS and other codes that can't infect my computer by simply visiting a website. :D
Um ... .NET Framework, anyone? Ximian's Mono Project is an Open Source development hoping to bring a Linux version of Microsoft's .NET Development Framework to the UNIX/Linux software developer community. Basically, since .NET is supposed to allow the creation of applications that run on any operating system/hardware (think ActiveX on steroids) some bright lights in the GPL community decided to development a Linux version of .NET. Since I'm not a programmer, that's the best interpretation of .NET I can explain. :lol:
Link to comment
Share on other sites
I guess you guys don't do enough surfing <g>. I encounter Active-x controls all the time. I know this because I get a prompt whenever a site wants to use one. Not only MS, but a lot of corporate sites use AX. OTOH, a lot of advertisers also use AX, particularly MSNBC and the NY TImes. I always have to click no to them on the prompt and then backup twice or three times to bypass them and return to where I was (even with my ad blocker running)...
Link to comment
Share on other sites
Guest LilBambi
Actually, there are many sites that use the browser identification to direct you to the page that corresponds to your browser.It might have ActiveX if you use IE, but if you are not using IE, they recognize you have a different browser, and they deliver a page that does not have what is not supported for your browser.
Link to comment
Share on other sites
Actually, there are many sites that use the browser identification to direct you to the page that corresponds to your browser.
I agree. I visit NY Times and MSNBC sites with Netscape 7.x and have no problems viewing or navigating them and no alerts that I need ActiveX to view or access something.
Link to comment
Share on other sites
A vulnerability that occurs because Internet Explorer does not properly determine an object type returned from a Web server in a popup window. It could be possible for an attacker who exploited this vulnerability to run arbitrary code on a user's system. If a user visited an attacker's Web site, it could be possible for the attacker to exploit this vulnerability without any other user action. An attacker could also craft an HTML–based e-mail that would attempt to exploit this vulnerability. A vulnerability that occurs because Internet Explorer does not properly determine an object type returned from a Web server during XML data binding. It could be possible for an attacker who exploited this vulnerability to run arbitrary code on a user's system. If a user visited an attacker's Web site, it could be possible for the attacker to exploit this vulnerability without any other user action. An attacker could also craft an HTML–based e-mail that would attempt to exploit this vulnerability.Since I don't allow HTML based email messages... not a problem. Since I don't surf random sites what are my chances of hitting a trusted site with malicous code?
Link to comment
Share on other sites
Join the conversation
You can post now and register later. If you have an account, sign in now to post with your account.
Guest
Reply to this topic...
× Pasted as rich text. Paste as plain text instead
Only 75 emoji are allowed.
× Your link has been automatically embedded. Display as a link instead
× Your previous content has been restored. Clear editor
× You cannot paste images directly. Upload or insert images from URL.
×
×
• Create New...
|
{
"url": "https://forums.scotsnewsletter.com/index.php?/topic/3213-internet-explorer-vulnerability-exploited-again/",
"source_domain": "forums.scotsnewsletter.com",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "345355",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WVXVZCSPUITEFUFKNAH3FL4FWQT7RCBA",
"WARC-Concurrent-To": "<urn:uuid:47ebce70-e0b3-460c-a085-61be03f4123f>",
"WARC-Date": "2023-12-10T13:16:50Z",
"WARC-IP-Address": "137.184.151.145",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DN5XHEPMGCTFEFWNYLDR6REZ6L4EYEBH",
"WARC-Record-ID": "<urn:uuid:363964e0-e409-445d-9f8d-79920eecddd9>",
"WARC-Target-URI": "https://forums.scotsnewsletter.com/index.php?/topic/3213-internet-explorer-vulnerability-exploited-again/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a242a3d5-c40f-429d-a22a-79160b8c9b27>"
},
"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-27\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,
16,
17,
65,
66,
67,
75,
76,
94,
95,
866,
867,
883,
904,
905,
1136,
1298,
1314,
1335,
1336,
1351,
1352,
1491,
1492,
1508,
1529,
1530,
1750,
1751,
1767,
1788,
1789,
1804,
1805,
2446,
2447,
2463,
2484,
2485,
2588,
2818,
2834,
2855,
2856,
3398,
3399,
3415,
3436,
3437,
3802,
3803,
3819,
3840,
3841,
4228,
4229,
4245,
4266,
4267,
4282,
4283,
4423,
4424,
4440,
4461,
4462,
4953,
4954,
4970,
4991,
4992,
5053,
5198,
5409,
5702,
5718,
5739,
5740,
5944,
6467,
6483,
6504,
6505,
6954,
6955,
6971,
6992,
6993,
7008,
7009,
7329,
7330,
7346,
7367,
7368,
7495,
7666,
7682,
7703,
7704,
8867,
8868,
8884,
8905,
8906,
8928,
8929,
9029,
9030,
9036,
9059,
9060,
9115,
9116,
9145,
9146,
9221,
9222,
9282,
9283,
9355,
9356,
9358,
9360
],
"line_end_idx": [
16,
17,
65,
66,
67,
75,
76,
94,
95,
866,
867,
883,
904,
905,
1136,
1298,
1314,
1335,
1336,
1351,
1352,
1491,
1492,
1508,
1529,
1530,
1750,
1751,
1767,
1788,
1789,
1804,
1805,
2446,
2447,
2463,
2484,
2485,
2588,
2818,
2834,
2855,
2856,
3398,
3399,
3415,
3436,
3437,
3802,
3803,
3819,
3840,
3841,
4228,
4229,
4245,
4266,
4267,
4282,
4283,
4423,
4424,
4440,
4461,
4462,
4953,
4954,
4970,
4991,
4992,
5053,
5198,
5409,
5702,
5718,
5739,
5740,
5944,
6467,
6483,
6504,
6505,
6954,
6955,
6971,
6992,
6993,
7008,
7009,
7329,
7330,
7346,
7367,
7368,
7495,
7666,
7682,
7703,
7704,
8867,
8868,
8884,
8905,
8906,
8928,
8929,
9029,
9030,
9036,
9059,
9060,
9115,
9116,
9145,
9146,
9221,
9222,
9282,
9283,
9355,
9356,
9358,
9360,
9377
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9377,
"ccnet_original_nlines": 123,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4445544481277466,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05198020115494728,
"rps_doc_frac_lines_end_with_ellipsis": 0.024193549528717995,
"rps_doc_frac_no_alph_words": 0.14603960514068604,
"rps_doc_frac_unique_words": 0.32946211099624634,
"rps_doc_mean_word_length": 4.492053985595703,
"rps_doc_num_sentences": 127,
"rps_doc_symbol_to_word_ratio": 0.008910889737308025,
"rps_doc_unigram_entropy": 5.559817790985107,
"rps_doc_word_count": 1636,
"rps_doc_frac_chars_dupe_10grams": 0.25445640087127686,
"rps_doc_frac_chars_dupe_5grams": 0.33160972595214844,
"rps_doc_frac_chars_dupe_6grams": 0.33160972595214844,
"rps_doc_frac_chars_dupe_7grams": 0.33160972595214844,
"rps_doc_frac_chars_dupe_8grams": 0.2948700487613678,
"rps_doc_frac_chars_dupe_9grams": 0.27200978994369507,
"rps_doc_frac_chars_top_2gram": 0.013879439793527126,
"rps_doc_frac_chars_top_3gram": 0.03007211908698082,
"rps_doc_frac_chars_top_4gram": 0.041638318449258804,
"rps_doc_books_importance": -845.1627807617188,
"rps_doc_books_importance_length_correction": -845.1627807617188,
"rps_doc_openwebtext_importance": -463.8611755371094,
"rps_doc_openwebtext_importance_length_correction": -463.8611755371094,
"rps_doc_wikipedia_importance": -314.345947265625,
"rps_doc_wikipedia_importance_length_correction": -314.345947265625
},
"fasttext": {
"dclm": 0.02539294958114624,
"english": 0.9396399855613708,
"fineweb_edu_approx": 1.0408425331115723,
"eai_general_math": 0.5081796646118164,
"eai_open_web_math": 0.1854032278060913,
"eai_web_code": 0.010465799830853939
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "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": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
51,942,130,223,455,990 |
Talk To Us
Get Appointment
• [email protected]
• 1300 852 340
What is a Canonical Tag? HTML’s Boon to SEO Specialists
canonical tag
What is a Canonical Tag? HTML’s Boon to SEO Specialists
Did you know that duplicate content will confuse search engines and prevent them from returning the right page to the search users? The best way to make it easy for the search engines to focus on the correct page would be to make use of the canonical tag through proper canonicalization.
By properly using canonical tags for your web pages, you will be able to have a robust website that follows best practices of search engine optimization.
Specifying the canonical tag is the most step in basic search engine optimization.
This is the best way to avoid duplicate content, even when the same content is present on different URLs.
Today, let us see what is a canonical tag (URL changer or canonical URL tag), canonical link function, URL canonicalization, best practices for canonical URL as well as how to insert rel canonical.
What is Canonical Tag?
A canonical tag – also known as the rel canonical – is the technique of guiding the search engines about a specific URL and explain that this particular URL represents the actual master copy of a web page.
This process is referred to as URL canonicalization.
Using a canonical tag helps to forgo the problems that are created by the duplicate or the identical content that appears on different URLs.
Practically, the canonical tag is the one that tells a search engine like Google, which is the URL version that you would want to show up in the search results.
Basically, canonical tag is the element that specifies the original web content page or the source URL of the given web page to search engines like Google.
A canonical tag is used to decide which particular web page is the original source and refer the duplicate pages back to the originating/source page.
Search engines leverage canonical tags to fight issues associated with duplicate content and also assign the search rankings for those pages based on their “source” URL.
So, this answers what is a canonical tag, what is canonicalization and how to insert rel canonical.
meta tags
What Do Canonical Tags Do?
Canonical tags are the ones that specify original content page or the URL source of the web page under question to the search engines.
So, rel canonical examples or canonical tag is used by the search engines to assign the ranking values to web pages and helps them to identify the original page and then return it to the search users.
For example, let us say that you have offer a specific service, which is present at two different locations:
http://www.sampleservice.com/
But, the same service will also be accessible at:
http://sampleservice.com/
Now, Google and other search engines consider these two as totally different pages.
This becomes a big problem because the search engines might not be able to identify which web page is the better one to return to a particular search query.
Where Should You Add the Canonical Tag?
In general, a canonical tag should be added to as many web pages as possible.
This is because there could be instances of identical or similar web content, which you might just not know.
Basically, every path that can be crawled and that contains duplicate content can potentially pose threats.
Implementing canonical tags to eliminate issues associated with duplicate content is usually very simple and might also have a broader impact on your overall SEO efforts.
When the canonical tags are appropriately implemented, you will be able to combat the duplicate content issues to a great extent, effectively pass the link authority between web pages and also enable search engines to crawl across your website more effectively.
This ultimately leads to improved rankings.
Furthermore, it is also important to be aware of the fact that incorrectly implemented canonical tags often lead to major issues.
If you are planning to implement canonical tags on your website, then you should make sure that it is correct before you deploy it.
Why is Canonicalization Important?
The concept of duplicate content is certainly complicated, but it gets more complicates and may lead to multiple issues when search engines will crawl over multiple URLs having very similar or identical content.
First of all, when search crawlers are made to scrawl over too much of duplicate content, then the chances are that they might end up missing some of the most unique content as well.
Next, duplication on a larger scale might only dilute your overall ranking ability.
Ultimately, even when your content gets ranked, search engines might just end up picking up the incorrect URL as the actual/original source.
So, canonical tags will help you to keep a check on the duplicate content.
Problems Associated with URLs
Most of you might now be wondering why would somebody duplicate a web page.
Besides, many people also assume that URL canonicalization is not something that they should be worrying about.
But this is a wrong assumption.
The main challenge here is, as humans, we often tend to consider a web page as a specific concept, for instance your home page.
Now, when it comes to search engines, they consider every different URL as a new page.
Following are some of the ways in which search crawlers might end up landing on your website’s home page:
• http://www.sample.com
• https://www.sample.com
• http://sample.com
• http://sample.com/index.php
• http://sample.com/index.php?r.
Hope you notice the http vs https and the other URL variations here.
As humans, to us all these URLs tend to look similar and ultimately just represent a web page.
However, this is not the case when it comes to a search crawler.
Each one of the above mentioned URLs will be different for the search crawlers.
Even if we consider the above example – which is very limited – we will still be able to see that there are 5 different versions of a website’s homepage that is up and live.
However, in reality, this is just a very small example of the copies that you might come across in real time.
Modern code driven and dynamic websites and the content management systems today tend to worsen the existing problem.
Most of the websites automatically add the tags, enable numerous different URLs and paths to the same web content and also implement URL parameters for currency options,searches, sorts etc.
End of the day, you might be having multiple duplicate URLs and might be totally unaware of it.
Best Practices for Implementing Canonical Tags
Problems associated with the duplicate content are often very tricky.
But, here are some of the most important aspects to be considered while implementing a canonical tag.
1. Self-Referential Canonical Tags
It is certainly normal when your canonical tag points back to your current URL.
In simple words, let us say the URLs A, B and C are the duplicates, while A is the canonical version.
In such case, it is acceptable to add a tag that points back to A on the URL A.
Although this sounds very obvious, it is one of the most common points that lead to confusion.
2. Canonicalizing Your Homepage Proactively
Today, the instances of homepage duplicates are extremely common and there is nothing new about it.
This makes people to link back to your homepage in many different ways, which is generally beyond your control.
So, a wise decision would be to add a canonical tag to the homepage template of your website.
This helps to troubleshoot unforeseen problems.
3. Dynamic Canonical Tags Should Be Spot Checked
At times, a bad code will make the website to write a separate canonical tag for each of the URL versions that is present there.
While doing this, the whole concept of the canonical tag might get missed out.
So, the best option is to spot check each and every URL, particularly the ones on the CMS driven and e-commerce websites.
4. Avoid Passing Mixed Signals
Search engines often tend to completely avoid canonical tags or might wrongly interpret it when they are presented with mixed signals.
Simply put, we would recommend you to not canonicalize Page X to Page Y and then from Page Y to Page X.
Similarly, it is also a bad idea to canonicalize Page X to Page Y and later make Page Y 301 redirect to Page X.
Furthermore, in general, it is definitely not a great option to chain the canonical tags that is W to X, X to Y, Y to Z. So, try and avoid this.
The best way to prevent search engines from making bad choices is to send out clear signals.
5. Cautiously Canonicalize “Near Duplicates”
When it comes to canonicalization, most of the people are just aware of “exact duplicates”.
Well, the fact is that canonical tags can also be used on “near duplicates”.
These are the pages that have extremely similar content and you should be very cautious while proceeding with this.
While there is the longest possible debate on this particular topic, it is normally “okay” to use the canonical tags for the web pages with similar content.
These include the product/services web pages, which differ only by small attributes and features, currency or location.
In such cases you should be knowing that the canonical versions of that web page are not eligible for ranking.
Also, if the web pages are very different, then search engines tend to overlook the tag.
6. Cross-Domain Duplicates Canonicalization
If two different websites are under your control, then you can leverage canonical tags across different domains.
Let us assume that you are a company that republishes content, which ends up publishing the same write ups across multiple websites.
Using canonical tags here will help you to focus the ranking power on one particular website.
However, canonicalization might stop the non-canonical websites from being ranked.
So, it is important to ensure that it matches the business case.
301 Redirects Versus Canonical Tags
The most common SEO query on canonical tags is that whether they pass the link equity (such as Authority, PageRank etc.) or not like how the 301 redirects do.
While they seem to pass in most of the cases, this still remains a very tricky question.
However, it is important to note that both these solutions are known to create two totally different results for the site visitors and site crawlers.
So, when you 301 redirect Page X to Page Y, then the chances are that the search visitors will be automatically directed to Page B, without having a chance to see the Page A.
When you rel-canonical Page X to Page Y then Page Y gets identified as the canonical by the search engines and the search users will be visiting both the URLs.
However, just ensure that the solution matches your desired outcome.
Summing Up
Incorrect implementation of the canonical tags will lead to major SEO issues.
So, just ensure that your canonical tag is correct before you go ahead and implement it.
Found the post interesting?
Leave your comments in the section below. We look forward to hear from you.
LEAVE A REPLY
Your email address will not be published. Required fields are marked *
|
{
"url": "https://trafficradius.com.au/what-is-a-canonical-tag-htmls-boon-to-seo-specialists/",
"source_domain": "trafficradius.com.au",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "75458",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:H7OTOPJ6D4YTTE3VFRKID76KN5LS6V4W",
"WARC-Concurrent-To": "<urn:uuid:a08474d2-68a5-404f-8034-3127c95c5446>",
"WARC-Date": "2020-11-28T08:31:02Z",
"WARC-IP-Address": "3.24.107.55",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NQKSBNUK7UM24PCHFFYPBENL34JYO6MY",
"WARC-Record-ID": "<urn:uuid:f70fbbcc-de91-4246-8b44-81fb715c4f71>",
"WARC-Target-URI": "https://trafficradius.com.au/what-is-a-canonical-tag-htmls-boon-to-seo-specialists/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9f64c384-97b3-40c1-9584-1190e72966b0>"
},
"warc_info": "isPartOf: CC-MAIN-2020-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-96.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,
11,
12,
28,
29,
59,
76,
77,
133,
134,
148,
149,
205,
206,
494,
495,
649,
650,
733,
734,
840,
841,
1039,
1040,
1063,
1064,
1270,
1271,
1324,
1325,
1466,
1467,
1628,
1629,
1785,
1786,
1936,
1937,
2107,
2108,
2208,
2209,
2219,
2220,
2247,
2248,
2383,
2384,
2585,
2586,
2695,
2696,
2726,
2727,
2777,
2778,
2804,
2805,
2889,
2890,
3047,
3048,
3088,
3089,
3167,
3168,
3277,
3278,
3386,
3387,
3558,
3559,
3821,
3822,
3866,
3867,
3997,
3998,
4130,
4131,
4166,
4167,
4379,
4380,
4563,
4564,
4648,
4649,
4790,
4791,
4866,
4867,
4897,
4898,
4974,
4975,
5087,
5088,
5120,
5121,
5249,
5250,
5337,
5338,
5444,
5445,
5471,
5498,
5520,
5552,
5587,
5588,
5657,
5658,
5753,
5754,
5819,
5820,
5900,
5901,
6075,
6076,
6186,
6187,
6305,
6306,
6496,
6497,
6593,
6594,
6641,
6642,
6712,
6713,
6815,
6816,
6851,
6852,
6932,
6933,
7035,
7036,
7116,
7117,
7212,
7213,
7257,
7258,
7358,
7359,
7471,
7472,
7566,
7567,
7615,
7616,
7665,
7666,
7795,
7796,
7875,
7876,
7998,
7999,
8030,
8031,
8166,
8167,
8271,
8272,
8384,
8385,
8530,
8531,
8624,
8625,
8670,
8671,
8763,
8764,
8841,
8842,
8958,
8959,
9116,
9117,
9237,
9238,
9349,
9350,
9439,
9440,
9484,
9485,
9598,
9599,
9732,
9733,
9827,
9828,
9911,
9912,
9977,
9978,
10014,
10015,
10174,
10175,
10264,
10265,
10415,
10416,
10591,
10592,
10752,
10753,
10822,
10823,
10834,
10835,
10913,
10914,
11003,
11004,
11032,
11033,
11109,
11110,
11124,
11125
],
"line_end_idx": [
11,
12,
28,
29,
59,
76,
77,
133,
134,
148,
149,
205,
206,
494,
495,
649,
650,
733,
734,
840,
841,
1039,
1040,
1063,
1064,
1270,
1271,
1324,
1325,
1466,
1467,
1628,
1629,
1785,
1786,
1936,
1937,
2107,
2108,
2208,
2209,
2219,
2220,
2247,
2248,
2383,
2384,
2585,
2586,
2695,
2696,
2726,
2727,
2777,
2778,
2804,
2805,
2889,
2890,
3047,
3048,
3088,
3089,
3167,
3168,
3277,
3278,
3386,
3387,
3558,
3559,
3821,
3822,
3866,
3867,
3997,
3998,
4130,
4131,
4166,
4167,
4379,
4380,
4563,
4564,
4648,
4649,
4790,
4791,
4866,
4867,
4897,
4898,
4974,
4975,
5087,
5088,
5120,
5121,
5249,
5250,
5337,
5338,
5444,
5445,
5471,
5498,
5520,
5552,
5587,
5588,
5657,
5658,
5753,
5754,
5819,
5820,
5900,
5901,
6075,
6076,
6186,
6187,
6305,
6306,
6496,
6497,
6593,
6594,
6641,
6642,
6712,
6713,
6815,
6816,
6851,
6852,
6932,
6933,
7035,
7036,
7116,
7117,
7212,
7213,
7257,
7258,
7358,
7359,
7471,
7472,
7566,
7567,
7615,
7616,
7665,
7666,
7795,
7796,
7875,
7876,
7998,
7999,
8030,
8031,
8166,
8167,
8271,
8272,
8384,
8385,
8530,
8531,
8624,
8625,
8670,
8671,
8763,
8764,
8841,
8842,
8958,
8959,
9116,
9117,
9237,
9238,
9349,
9350,
9439,
9440,
9484,
9485,
9598,
9599,
9732,
9733,
9827,
9828,
9911,
9912,
9977,
9978,
10014,
10015,
10174,
10175,
10264,
10265,
10415,
10416,
10591,
10592,
10752,
10753,
10822,
10823,
10834,
10835,
10913,
10914,
11003,
11004,
11032,
11033,
11109,
11110,
11124,
11125,
11195
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 11195,
"ccnet_original_nlines": 229,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.44007402658462524,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02776492014527321,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12170291692018509,
"rps_doc_frac_unique_words": 0.2716180384159088,
"rps_doc_mean_word_length": 4.743766784667969,
"rps_doc_num_sentences": 118,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.326122283935547,
"rps_doc_word_count": 1885,
"rps_doc_frac_chars_dupe_10grams": 0.010064859874546528,
"rps_doc_frac_chars_dupe_5grams": 0.04920598864555359,
"rps_doc_frac_chars_dupe_6grams": 0.019682399928569794,
"rps_doc_frac_chars_dupe_7grams": 0.016103779897093773,
"rps_doc_frac_chars_dupe_8grams": 0.010064859874546528,
"rps_doc_frac_chars_dupe_9grams": 0.010064859874546528,
"rps_doc_frac_chars_top_2gram": 0.02952359989285469,
"rps_doc_frac_chars_top_3gram": 0.014538129791617393,
"rps_doc_frac_chars_top_4gram": 0.007157240062952042,
"rps_doc_books_importance": -943.9247436523438,
"rps_doc_books_importance_length_correction": -943.9247436523438,
"rps_doc_openwebtext_importance": -551.43310546875,
"rps_doc_openwebtext_importance_length_correction": -551.43310546875,
"rps_doc_wikipedia_importance": -414.59759521484375,
"rps_doc_wikipedia_importance_length_correction": -414.59759521484375
},
"fasttext": {
"dclm": 0.1081123873591423,
"english": 0.9211238026618958,
"fineweb_edu_approx": 2.313979387283325,
"eai_general_math": 0.3288571834564209,
"eai_open_web_math": 0.20130860805511475,
"eai_web_code": 0.2235121726989746
}
}
|
{
"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": "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": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
8,927,211,104,312,797,000 |
Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.
Patents
1. Advanced Patent Search
Publication numberUS5872777 A
Publication typeGrant
Application numberUS 08/940,300
Publication dateFeb 16, 1999
Filing dateSep 30, 1997
Priority dateSep 30, 1997
Fee statusPaid
Also published asCN1192538C, CN1272270A, DE69825610D1, DE69825610T2, EP1020048A1, EP1020048A4, EP1020048B1, WO1999017489A1
Publication number08940300, 940300, US 5872777 A, US 5872777A, US-A-5872777, US5872777 A, US5872777A
InventorsKaren A. Brailean, Robert F. Boxall
Original AssigneeMotorola, Inc.
Export CitationBiBTeX, EndNote, RefMan
External Links: USPTO, USPTO Assignment, Espacenet
Method and apparatus for conveying data packets in a packet data communication system
US 5872777 A
Abstract
A packet data communication system (100) employs a method and apparatus for conveying data packets in the packet data communication system. A first communication device (101) transmits, at a first time, a first group of data packets and, at a second time prior to receiving an acknowledgment of receipt of the first group, a second group of data packets to a second communication device (105). Each data packet of the two groups includes a respective packet sequence number and the second group includes at least some data packets of the first group. The first communication device stores in memory the packet sequence numbers of the data packets in each group together with a group identifier for their respective group. Upon receiving the first group, the second group, or both, the second communication device transmits an acknowledgment of receipt of at least one of the groups, wherein the acknowledgment includes at least a receive tracking number. Upon receiving the acknowledgment, the first communication device determines which group of data packets the received acknowledgment corresponds to based at least on the receive tracking number. The first communication device then transmits a third group of data packets to the second communication device based on which group the acknowledgment corresponds to.
Images(3)
Previous page
Next page
Claims(12)
We claim:
1. A method for a first communication device to convey data packets to a second communication device in a packet data communication system, the method comprising the steps of:
transmitting a first group of data packets, wherein each data packet in the first group includes a respective packet sequence number;
storing the respective packet sequence number of each data packet in the first group together with a group identifier for the first group;
transmitting, prior to receiving an acknowledgment of the first group from the second communication device, a second group of data packets, wherein the second group includes at least some data packets of the first group and wherein each data packet in the second group includes a respective packet sequence number;
storing the respective packet sequence number of each data packet in the second group together with a group identifier for the second group;
receiving an acknowledgment of receipt of at least one of the first group and the second group to produce a received acknowledgment, wherein the acknowledgment includes at least a receive tracking number and wherein the receive tracking number indicates a packet sequence number of a data packet of a respective one of the first group and the second group that is earliest in sequence in the respective group and that was not completely received by the second communication device;
determining which group of data packets of the first group and the second group that the received acknowledgment corresponds to based at least on the receive tracking number to produce a determined group; and
transmitting a third group of data packets based on the determined group, wherein the third group includes at least a portion of a data packet of the determined group that is earliest in sequence in the determined group and that was not completely received by the second communication device.
2. The method of claim 1, wherein the step of transmitting the third group comprises the steps of:
when the determined group is the first group, storing the received acknowledgment; and
when an acknowledgment of the second group is not received within a predetermined time after transmission of the second group, transmitting the third group, wherein the third group includes at least a portion of the data packet of the first group that is earliest in sequence in the first group and that was not completely received by the second communication device.
3. The method of claim 2, wherein the step of transmitting the third group further comprises the steps of:
when an acknowledgment of the second group is received within a predetermined time after transmission of the second group,
deleting the acknowledgment of the first group; and
transmitting the third group, wherein the third group includes at least a portion of the data packet of the second group that is earliest in sequence in the second group and that was not completely received by the second communication device.
4. The method of claim 1, wherein the step of transmitting the third group comprises the steps of:
when the determined group is the second group, transmitting the third group, wherein the third group includes at least a portion of the data packet of the second group that is earliest in sequence in the second group and that was not completely received by the second communication device; and
upon receiving an acknowledgment of the first group, deleting the acknowledgment of the first group.
5. The method of claim 1, wherein the received acknowledgment further comprises a packet sequence number of each data packet that was not completely received by the second communication device.
6. The method of claim 5, wherein the step of transmitting the third group comprises the step of transmitting at least a portion of each data packet in the determined group that was not completely received by the second communication device.
7. The method of claim 6, wherein the step of transmitting the third group further comprises the step of transmitting at least one data packet not previously transmitted in the determined group.
8. The method of claim 1, wherein the receive tracking number comprises the packet sequence number of the data packet of the determined group that is earliest in sequence and that was not completely received by the second communication device.
9. A communication device in a packet data communication system, the communication device comprising:
a transmitter that, at a first time, transmits a first group of data packets to a target communication device and, at a second time, transmits a second group of data packets to the target communication device, wherein each data packet of the first group and each data packet of the second group includes a respective packet sequence number and wherein the second group includes at least some data packets of the first group;
a receiver that receives an acknowledgment of receipt of at least one of the first group and the second group to produce a received acknowledgment, wherein the acknowledgment includes at least a receive tracking number and wherein the receive tracking number indicates a packet sequence number of a data packet of a respective one of the first group and the second group that is earliest in sequence in the respective group and that was not completely received by the target communication device; and
a computer readable memory device, coupled to the transmitter and the receiver, that has stored therein a computer program that, when executed, performs the following functions:
stores in a database the respective packet sequence number of each data packet in the first group together with a group identifier for the first group and the respective packet sequence number of each data packet in the second group together with a group identifier for the second group;
determined which group of data packets of the first group and the second group that the received acknowledgment corresponds to based at least on the receive tracking number to produce a determined group;
generates a third group of data packets based on the determined group, wherein the third group includes at least a portion of a data packet of the determined group that is earliest in sequence in the determined group and that was not completely received by the second communication device; and
instructs the transmitter to transmit the third group of data packets to the target communication device.
10. The communication device of claim 9, wherein the communication device comprises a base station.
11. The communication device of claim 10, wherein the communication device further comprises a data controller.
12. The communication device of claim 9, wherein the communication device comprises a mobile or portable two-way radio device.
Description
CROSS-REFERENCE TO RELATED APPLICATIONS
This application is related to U.S. patent application Ser. No. 08/940,299 entitled "Method and Apparatus For Tracking Data Packets In A Packet Data Communication System", filed on an even date herewith, and assigned to the assignee of the instant invention.
FIELD OF THE INVENTION
The present invention relates generally to communication systems and, in particular, to conveying groups of data packets between communication devices in a packet data communication system.
BACKGROUND OF THE INVENTION
Packet data communication systems are known in both the wireless and wireline environments. In the wireless environment, a packet data system includes packet data routers, data controllers, base stations, and wireless communication units (e.g., mobile radios, portable radios, radiotelephones, or wireless data terminals). In the wireline environment, a packet data system includes switches and wireline communication devices (e.g., personal computers, computer servers, mainframes, laptop computers, personal communication devices, or custom data terminals). Packet data communications are also known to exist between wireless and wireline systems.
Packet data systems typically provide for transmission of data packets either individually or in groups otherwise known as "bundles." In systems that provide for individual packet transmission, such as transport control protocol (TCP) systems, the sending device transmits one packet at a time and receives a corresponding acknowledgment for each packet from the receiving device. Each data packet includes a packet sequence number that allows the receiving device to determine which packet it has received. Knowing the packet sequence number of the received packet, the receiving device transmits an acknowledgment indicating the packet sequence number of the packet that was received. In systems that provide for the use of selective automatic repeat request (SARQ) protocols, the data packet is typically subdivided into data blocks, wherein each data block has an associated data block number. In such SARQ systems, the acknowledgment typically includes the packet sequence number and the data block numbers of the data blocks that were not completely received by the receiving device. Thus, in SARQ systems, the sending device need only retransmit the unreceived data blocks instead of the entire data packet.
In systems that provide for group packet transmissions, the sending device transmits a group of data packets and receives a single acknowledgment for the group of data packets. As in single packet transmission systems, each data packet includes a packet sequence number. However, in group transmission systems, the acknowledgment includes the packet sequence number of each data packet in the group that was not completely received by the receiving device and, when an SARQ protocol is used, the data block numbers of the data blocks in each packet that were not completely received by the receiving device. To distinguish between acknowledgments for groups of data packets, the sending device typically identifies the lowest-valued packet sequence number of the group being acknowledged and compares it to the packet sequence numbers stored in a database that associates packet sequence numbers with group numbers. For example, when the sending device transmits Group 1 having packet sequence numbers 1-5, it stores the group number (1 in this case) and the packet sequence numbers (1-5 in this case) in a database. If, before receiving an acknowledgment of 1, the sending device also transmits Group 2, consisting of packet sequence numbers 6-10, and then receives the acknowledgment, the sending device examines the acknowledgment to determine which data packets are being acknowledged. Thus, if the acknowledgment indicated that data blocks 2 and 3 of the data packet having packet sequence number 4 were not received, the sending device would determine that the acknowledgment was an acknowledgment of Group 1 because packet sequence number 4 was transmitted in Group 1.
In both single packet and group packet transmission systems, acknowledgment timers are employed to set retransmission times. When an acknowledgment to a particular transmission is not received within the predetermined time of the corresponding acknowledgment timer, the sending device presumes the transmission was not received and retransmits the packet or group of packets, respectively. However, when an acknowledgment is received subsequent to the retransmission, the sending device does not know which transmission the acknowledgment actually corresponds to and presumes that the acknowledgment corresponds to the retransmission. Such a presumption may be in error due to inherent delays in the packet data system. For example, in integrated voice and data systems, voice calls typically have priority over data calls. Thus, a situation may arise whereby a receiving device receives a packet data transmission, but, before the receiving device can respond with an acknowledgment, the system preempts the device's request for allocation of a channel over which to transmit the acknowledgment due to high levels of voice traffic. As a consequence of the delay in transmitting the acknowledgment, the sending device's acknowledgment timer expires and a retransmission occurs.
By not knowing which transmission the acknowledgment actually corresponds to, the sending device, in response to the acknowledgment, might retransmit data that was already received by the receiving device (e.g., when the acknowledgment is an acknowledgment of the original transmission and indicates fewer completely received packets than were received in the retransmission). By retransmitting data that was already received, the sending device is inefficiently using a communication channel that could otherwise be used to transmit new or otherwise unreceived data.
One approach that could be used to eliminate the uncertainty in acknowledgments is to include a group identifier in each transmission and corresponding acknowledgment. By incrementing the group identifier with each transmission and retransmission, the receiving device can easily determine which group it is acknowledging. By including the group identifier in each acknowledgment, the sending device can easily determine which group is being acknowledged. However, although including a group identifier solves the aforementioned acknowledgment identification problem, it does so at the cost of reduced data throughput. Since communication channels have fixed bandwidths, adding bits to identify the transmission group would result in correspondingly fewer bits of data in each transmission, thereby reducing throughput.
Therefore, a need exists for a method and apparatus of conveying data packets in a packet data communication system that solves the acknowledgment identification problem, without reducing data throughput.
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 illustrates a block diagram depiction of a packet data communication system in accordance with the present invention.
FIG. 2 illustrates an exemplary group of data packets in accordance with the present invention.
FIG. 3 illustrates an exemplary acknowledgment data packet in accordance with the present invention.
FIG. 4 illustrates an exemplary storage area of a database of a sending communication device in accordance with the present invention.
FIG. 5 illustrates a logic flow diagram of steps executed by a communication device to convey data packets in accordance with the present invention.
DESCRIPTION OF A PREFERRED EMBODIMENT
Generally, the present invention encompasses a method and apparatus for conveying data packets in a packet data communication system. At a first time, a first communication device transmits a first group of data packets to a second communication device, wherein each data packet of the first group includes a respective packet sequence number. The first communication device also stores the respective packet sequence number of each data packet in the first group together with a group identifier for the first group in memory. At a second time, prior to receiving an acknowledgment of receipt of the first group from the second communication device, the first communication device transmits a second group of data packets to the second communication device, wherein the second group includes at least some data packets of the first group and wherein each data packet of the second group includes a respective packet sequence number. The first communication device also stores the respective packet sequence number of each data packet in the second group together with a group identifier for the second group in memory.
Subsequent to receiving the first group, the second group, or both, the second communication device transmits an acknowledgment of receipt of at least one of the groups, wherein the acknowledgment includes at least a receive tracking number. The receive tracking number indicates the packet sequence number of a data packet of the respective group being acknowledged that is earliest in sequence in the respective group and that was not completely received by the second communication device. Upon receiving the acknowledgment, the first communication device determines which group of data packets the received acknowledgment corresponds to based at least on the receive tracking number. The first communication device then transmits a third group of data packets to the second communication device based on which group the acknowledgment corresponds to, wherein the third group includes at least a portion of a data packet of the group that the acknowledgment corresponds to that is earliest in sequence in the group and that was not completely received by the second communication device.
By conveying data packets in this manner, the present invention permits data packets to be conveyed reliably and efficiently in the presence of lengthy delays within the system, without having to include group identifiers in the group transmission and the acknowledgment to indicate which group of packets were transmitted and are being acknowledged. By eliminating the need for group identifiers in the packet transmission and the acknowledgment, the present invention improves channel throughput since additional bits otherwise used for the group identifiers can be used to convey user data.
The present invention can be more fully understood with reference to FIGS. 1-5. FIG. 1 illustrates a block diagram depiction of a packet data communication system 100 in accordance with the present invention. The communication system 100 preferably includes a base station 101, a data controller 103, and a mobile or portable communication unit 105. The base station preferably includes a transmitter 107 and a receiver 109, and preferably comprises an "iDEN" Base Repeater (BR) manufactured by Motorola, Inc. The data controller 103 preferably includes a computer readable memory device 111 and a database 113, and preferably comprises an "iDEN" "MOTOROLA" Data Gateway (MDG), which will be commercially available from Motorola, Inc. on or about Mar. 1, 1998. The communication unit 105 includes a transmitter (TX) 115, a receiver (RX) 117, a computer readable memory device 119, and a database 121. The communication unit 105 preferably comprises a mobile or portable two-way radio or radiotelephone device, such as an "iDEN" mobile or portable radio.
The transmitters 107, 115 and receivers 109, 117 of the base station 101 and the communication unit 105 are well-known; thus, no further discussion of them will be provided. The computer readable memory devices 111, 119 of the data controller 103 and the communication unit 105 each preferably comprise a read only memory (ROM) for storing a computer program and a microprocessor to execute the stored computer program. However, in an alternative embodiment, each memory device 111, 119 might comprise another computer-readable storage medium, such as a random access memory (RAM), a programmable read only memory (PROM), a diskette, a hard disk, a PCMCIA memory card, a logic circuit, a mass storage medium, an optical disk, a CD-ROM, a magnetic disk, or a digital versatile disk (DVD). As described below, the computer programs stored in and executed by the memory devices 111, 119 perform most of the steps executed by the data controller 103 and the communication unit 105 in accordance with the present invention.
Operation of the packet data communication system 100 occurs substantially as follows in accordance with the present invention. When a sending communication device (such as the combination of the base station 101 and the data controller 103) desires to transmit one or more groups of data packets to a receiving communication device (such as communication unit 105), the sending device requests and receives a radio communication channel 123 in accordance with known channel allocation techniques. In a preferred embodiment, the radio communication channel 123 comprises one or more outbound (base station-to-communication unit) time slots of an assigned outbound carrier frequency in a time division multiple access (TDMA) communication system, such as Motorola's iDEN telecommunication system. However, in an alternative embodiment, the communication channel 123 might comprise an outbound carrier frequency in a frequency division multiple access (FDMA) communication system or an orthogonal code (whether by direct sequence or via frequency hopping) in a code division multiple access (CDMA) communication system.
Upon receiving the channel grant, the data controller 103 configures a group of data packets, conveys the group of data packets to the base station 101, and stores a group identifier (ID) together with the packet sequence numbers of the data packets in the group in the database 113. An exemplary group of data packets 201-203 is depicted in FIG. 2. As shown, the group consists of N data packets. Each data packet in the group includes a respective packet sequence number 217-219 and corresponding data 220-222. That is, the first data packet 201 includes packet sequence number 217 (N(S)) and data 220. Similarly, the second data packet 202 includes packet sequence number 218 (N(S+1)) and data 221. Likewise, the Nth data packet 203 includes packet sequence number 219 (N(S+N)) and data 222. As also shown in FIG. 2, each data packet 217-219 is preferably partitioned into a plurality of data blocks 205-207, 209-211, 213-215 to permit use of one of several known selective automatic repeat request (SARQ) protocols. In the preferred embodiment, each packet sequence number 217-219 is included as the first portion (e.g., the first seven bits of the second byte) of the first data block 205, 209, 213 in its respective data packet 201-203. However, in an alternative embodiment, the packet sequence numbers 217-219 may be placed in any data block of their respective data packets 201-203, provided that such placement is known to both the sending and receiving communication devices.
An exemplary storage area 400 of the database 113 is depicted in FIG. 4. The storage area 400 includes the group ID) 401 for transmitted groups of data packets and the corresponding packet sequence numbers 403 of the data packets in the respective groups. The data controller's use of the storage area 400 in accordance with the present invention is provided in more detail below.
After the group of data packets 201-203 is received from the data controller 103, the base station 101 employs its transmitter 107 to encode the group of data packets 201-203 and transmit the encoded group of data packets to the communication unit 105 via the allocated communication channel 123. Once the group of data packets 201-203 is transmitted, the base station 101 sends a transmission confirmation message to the data controller 103. In response to the confirmation message, the data controller 103 starts an acknowledgment timer within its memory device 119, and increases a transmit tracking number stored in the database 113 to indicate the packet sequence number of the next packet in sequence to be transmitted. For example, after the base station 101 confirms the transmission of the group of data packets 201-203 having packet sequence numbers one through three (i.e., N(S)=1, N(S+1)=2, and N(S+N)=3), the data controller 103 starts an acknowledgment timer for the group and increments the transmit tracking number to four to indicate that the data packet having packet sequence number four is next in sequence to be transmitted. The acknowledgment timer prevents the data controller 103 from waiting indefinitely for an acknowledgment before it determines to retransmit a group of data packets. In the preferred embodiment, the acknowledgment timer is set to expire within five seconds after transmission of the respective group of data packets 201-203. In an alternative embodiment, the expiration time of the acknowledgment timer might be set to some other fixed time or might be variable and depend upon time of day, system loading, channel loading, channel quality, or other system parameters.
When the transmitted data packets 201-203 arrive at the communication unit 105, the communication unit 105 employs its receiver 117 to receive and decode the data packets 201-203. The communication unit 105 extracts the packet sequence numbers 217-219 from the data packets 201-203 and compares the lowest-valued packet sequence number (e.g., 217) to the present value of a receive tracking number maintained in the communication unit's database 121. The receive tracking number indicates the packet sequence number of the data packet that the communication unit 105 next expects to receive.
Upon receiving the data packets 201-203 and comparing the packet sequence numbers to the receive tracking number, the communication unit 105 employs its memory device 119 to generate an acknowledgment data packet 301. An exemplary acknowledgment packet 301 is depicted in FIG. 3. The acknowledgment packet 301 comprises one or more data blocks and preferably includes an updated receive tracking number 303, packet sequence numbers 305, 309 of data packets that have not been completely received, data block numbers or indicators 307, 311 of data blocks that have not been completely received, and a data integrity indicator (such as a known cyclic redundancy check (CRC) 313). The preferred acknowledgment packet includes data block indicators (e.g., bits) to facilitate the use of known SARQ protocols. Data block numbers or indicators 307, 311 are preferential only and do not form a necessary part of the present invention. The acknowledgment 301 depicted in FIG. 3 is in one-block form. In the alternative, a multiple block acknowledgment might be used, and may further include user data to be conveyed to the sending device and a known frame check sequence to be used to verify the integrity of the entire multiple block acknowledgment.
The updated receive tracking number 303 indicates the packet sequence number of a data packet in the group of data packets 201-203 that is earliest in sequence (i.e., of lowest value) and that was not completely received by the communication unit 105. For example, if the communication unit received all data blocks 205-207 of the data packet 201 having N(S)=1 in the above example, data blocks 209 and 211 of the data packet 202 having N(S)=2, and data block 213 of the data packet 203 having N(S)=3, the updated receive tracking number 303 would be N(R)=2 because data packet 202 had not been completely received (i.e., one data block 210 of data packet 202 had not been received). In this example, the acknowledgment packet 301 would include a receive tracking number 303 having a value of N(R)=2, a packet sequence number 305 (e.g., 2) indicating data packet 202, a data block number 307 indicating data block 210 (e.g., the number 2 would be used because data block 210 is the second data block of data packet 202), a packet sequence number 309 (e.g., 3) indicating data packet 203, and data block numbers 311 indicating data blocks 214 and 215 (e.g., the numbers 2 and 3 would be used because data blocks 214 and 215 are the second and third data blocks, respectively, of data packet 203).
Once the acknowledgment packet 301 is configured, the communication unit transmits a request for, and receives a grant of, a radio communication channel 125. The type of radio communication channel requested and allocated (e.g., time slot, frequency carrier, or orthogonal code) preferably corresponds to the type of radio channel 123 allocated to the base station 101 for transmission of the data packets 201-203. Upon receiving the channel grant, the communication unit 105 employs its transmitter 115 to encode the acknowledgment 301 and transmit the encoded acknowledgment to the base station 101 via the radio communication channel 125.
When, for some circumstance, the acknowledgment 301 does not reach the data controller 103 before the expiration time of the acknowledgment timer (e.g., when the packet data system 100 comprises an integrated voice and data system and receipt of the channel grant for communication channel 125 is delayed due to heavy prioritized voice traffic), the data controller 103 configures a group of data packets that includes at least one of the data packets of the unacknowledged group and conveys the new group of data packets to the base station 101 for transmission. The data controller 103 also stores a group ID together with the packet sequence numbers of the data packets in the new group in the database 113.
For example, referring to FIG. 4, assume the data controller 103 and base station 101 transmit a group of data packets consisting of data packets having sequence numbers 4-6. The data controller 103 stores the group ID (in this example, three to identify Group 3) and the packet sequence numbers (i.e., 4-6) in the storage area 400. When expiration of the Group 3 acknowledgment timer occurs prior to reception of an acknowledgment for Group 3, the data controller 103 configures a new group of data packets (e.g., Group 7) that at least includes data packets having packet sequence numbers 4-6. A description of how the data controller 103 determines which group a received acknowledgment corresponds to is provided below. As shown in FIG. 4, Group 7 consists of data packets having packet sequence numbers 4-6 and 17. The new group (Group 7) may be larger or smaller than the earlier transmitted group (Group 3) if, for example, more or less channel bandwidth, respectively, is available for transmission at the time the new group is configured or a higher or lower modulation rate, respectively, is selected for use in transmitting the data packets in the group. In addition, since a period of time has elapsed since transmission of the original group (Group 3), other groups of data packets may have been transmitted.
Thus, in some cases, data packets added to the new group (Group 7) that were not previously transmitted in the original group will have packet sequence numbers that do not immediately follow the highest packet sequence number of the original group. Upon configuring the new group, the data controller 103 stores the group ID and packet sequence numbers in the storage area 400 of the data base 113 and sends the new group of data packets to the base station 101 for transmission. Upon receiving confirmation of the transmission of the new group from the base station 101, the data controller starts the new group's (Group 7) acknowledgment timer.
When an acknowledgment 301 eventually arrives at the base station 101, the base station 101 employs its receiver 109 to receive and decode the acknowledgment 301. In the preferred embodiment, the base station 101 provides the acknowledgment 301 to the data controller 103. Upon receiving the acknowledgment 301, the data controller 103 employs its memory device 111 to determine which group of transmitted data packets the acknowledgment 301 corresponds to. The memory device 111 determines which group the acknowledgment corresponds to by examining, at a minimum, the receive tracking number 303 and, at a maximum, all the packet sequence numbers 305, 309 contained in the acknowledgment 301. The memory device 111 first compares the receive tracking number 303 with the stored packet sequence number of a data packet in the new group that was not in the original group (Group 3). In the above example, the memory device 111 compares the receive tracking number 303 with packet sequence number 17, which corresponds to the stored packet sequence number of a data packet that was originally transmitted in the new group (Group 7).
When the receive tracking number 303 equals the stored packet sequence number of a data packet that was originally transmitted in the new group, the memory device 111 determines that the acknowledgment 301 corresponds to the new group and examines the remainder of the acknowledgment (i.e., the packet sequence numbers 305, 309 and, when an SARQ protocol is used, the data block numbers 307, 311) to determine which packets were not completely received by the communication unit 105. Upon determining which data packets 305, 309 were not completely received, the memory device 111 generates a group of data packets that include the unreceived data blocks 307, 311 of the data packets 305, 309 identified in the acknowledgment 301 and, when the unreceived data blocks 307, 311 do not fully occupy an available amount of channel bandwidth, one or more additional, previously untransmitted data packets. The data controller 103 then provides the generated group to the base station 101 with instructions to transmit the group to the communication unit 105. If, at some time after receiving the acknowledgment 301 of the new group, the data controller 103 receives an acknowledgment that contains a receive tracking number corresponding to a stored packet sequence number that is common to both the new group (Group 7) and the original group (Group 3), the data controller 103 simply deletes such an acknowledgment because the data controller 103 knows that it has already responded to an acknowledgment for the more recent of the two groups (i.e., Group 7).
When the receive tracking number 303 of the acknowledgment 301 equals a packet sequence number (e.g., packet sequence number 5) that is common to the new group (i.e., Group 7) and the original group (i.e., Group 3), the memory device 111 cannot conclusively determine which group the acknowledgment 301 corresponds to. Thus, the memory device 111 presumes that the acknowledgment 301 corresponds to the original group and stores the acknowledgment in the database 113. The memory device 111 then waits to see if another acknowledgment corresponding to either the new group alone (e.g., when the receive tracking number equals the stored packet sequence number of a data packet originally transmitted in the new group) or both the new and the original groups (e.g., when the receive tracking number equals a stored packet sequence number that is common to both the new group and the original group) arrives prior to expiration of the acknowledgment timer of the new group. If an acknowledgment that meets the above criteria arrives prior to expiration of the new group's acknowledgment timer, the memory device 111 deletes the former acknowledgment and generates a group of data packets based on the latter acknowledgment. The data controller 103 then provides the generated group to the base station 101 with instructions to transmit the group to the communication unit 105.
In an alternative embodiment, the acknowledgment 301 may be arranged such that it does not include a separate receive tracking number 303 as depicted in FIG. 3. In such a case, the data controller 103 may use the packet sequence number 305 in the acknowledgment 301 that is lowest in value (i.e., was earliest in sequence of the group being acknowledged) as the effective receive tracking number for all the determinations above that were based on receive tracking number.
It should be noted that the techniques described above also occur in reverse--i.e., when the sending communication device is the communication unit 105 and the receiving communication device is the combination of the base station 101 and the data controller. In this case, the computer readable memory device 119 and the database 121 function in manners respectively similar to the computer readable memory device 111 and the database 113. It should further be noted that, in an alternative embodiment, the computer readable memory device 111 and the database 113 might be positioned within the base station 101 as memory device 127 and database 129. In this case, the base station 101 alone would perform the tasks executed by both the base station 101 and the data controller 103 in the above discussion. Consequently, the use of the term communication device herein is intended to encompass any device (e.g., base station 101 or communication unit 105) or combination of devices (e.g., base station 101 and data controller 103) that include a transmitter, a receiver, a computer readable memory device, and a database arranged, constructed, and programmed to perform the techniques described herein.
Moreover, although the method of the present invention was discussed above in the context of conveying data packets between infrastructure components (base station 101 and data controller 103) and mobile components (communication unit 105) of the system 100, the techniques of the present invention can also be applied to conveying data packets between two or more mobile communication devices or between two or more stationary communication devices coupled together via a wireless or wireline communication channel.
As described above, the present invention provides for the conveyance of groups of data packets during a packet data communication. In particular, the present invention permits reliable, yet resource efficient, transmission of data packets. By determining which of a plurality of transmitted groups of overlapping data packets a particular acknowledgment corresponds to, the present invention ensures that the correct data packets are re-transmitted by the sending communication device in response to the acknowledgment most recently transmitted (or at least transmitted within a desired acknowledgment time period) by the receiving communication device. In addition, by utilizing existing data in the acknowledgment to determine which of the groups the acknowledgment corresponds to, the present invention eliminates the need to include a group identifier in each acknowledgment and group transmission, thereby permitting higher data throughput in the system than if each acknowledgment and group transmission included a group identifier. By not including a group identifier, the present invention allows the bits that would be used in each acknowledgment and group transmission to identify the acknowledged group to be used to transmit user data, thereby allowing more efficient use of system channel resources.
FIG. 5 illustrates a logic flow diagram 500 of steps executed by a communication device to convey data packets in accordance with the present invention. The logic flow begins 501 when the communication device transmits (503) a first group of data packets to a target communication device at a first time and stores, in a memory, a group ID for the first group together with the packet sequence numbers of the data packets in the first group. Prior to receiving an acknowledgment of receipt of the first group from the target device, the communication device transmits (505) a second group of data packets to the target device at a second time, wherein the second group includes at least some data packets of the first group, and stores, in memory, a group ID for the second group together with the packet sequence numbers of the data packets in the second group. In a preferred embodiment, the communication device transmits the second group when an acknowledgment of the first group has not been received within a predetermined time (e.g., five seconds) after transmission of the first group. Thus, in the preferred embodiment, the second time is at least five seconds after transmission of the first group. In addition, in the preferred embodiment, the second group includes all the data packets of the first group and, when the communication channel bandwidth allows, additional, previously untransmitted data packets. However, in certain circumstances, the second group may not include all the data packets of the first group. For example, when the modulation rate of the system is decreased (e.g., due to a high detected error rate) such that fewer packets can be transmitted in the communication channel bandwidth, the second group of packets will likely include fewer data packets than the first group.
At some time subsequent to transmitting both the first and second groups of data packets (and possibly as well as other unique groups of data packets), the communication device receives (507) an acknowledgment and determines (509) which group the acknowledgment corresponds to. As discussed above, this determination comprises comparing the receive tracking number of the acknowledgment with the packet sequence numbers stored for each group. When the receive tracking number equals the stored packet sequence number of a data packet originally transmitted in the second group, the communication device determines that the acknowledgment corresponds to the second group and generates a third group of data packets that preferably includes the data blocks of the data packets in the second group that were not completely received by the target device as indicated in the acknowledgment. In addition, depending upon the available communication channel bandwidth, the third group of data packets may be generated to further include previously, untransmitted data packets. Upon generating the third group, the communication device transmits (521) the third group of data packets to the target device. Subsequent to transmission of the third group, the communication device, upon receiving acknowledgments, determines (523) whether any received acknowledgment corresponds to the first group. When such an acknowledgment does correspond to the first group (e.g., when the acknowledgment acknowledges a data packet that was already acknowledged in the acknowledgment received at block 507), the communication device deletes (525) the acknowledgment and the logic flow ends (517).
Referring back to decision block 509, when the communication device determines that the receive tracking number equals a packet sequence number stored for both the first and the second groups, the communication device determines that the acknowledgment corresponds to the first group and stores (511) the acknowledgment. This determination is a presumption because, although the acknowledgment in this case might correspond equally to both groups, the acknowledgment of the first group is more likely to be transmitted before the acknowledgment of the second group. Upon storing the acknowledgment, the communication device determines (513) whether an acknowledgment of the second group has been received within a predetermined time after transmission of the second group. That is, the communication device determines whether an acknowledgment identifying one or more data packets of the second group (e.g., when not all data packets of the second group were completely received) or including a receive tracking number that indicates the packet sequence number of a data packet that is next in sequence after the highest-valued sequence number of a data packet in the second group (e.g., when all data packets of the second group were completely received) has been received prior to expiration of an acknowledgment timer for the second group.
When an acknowledgment of the second group is received within the predetermined time, the communication device deletes (515) the stored acknowledgment of the first group and transmits the aforementioned third group of data packets, thereby ending (517) the logic flow. However, when an acknowledgment of the second group is not received within the predetermined time, the communication device generates and transmits (519) a third group of data packets that preferably includes at least the data blocks of the data packets in the first group that were not completely received by the target device as indicated in the acknowledgment, thereby ending (517) the logic flow.
In a preferred embodiment, steps 509, 511, 513, 523, and 525 and portions of steps 503, 505 (e.g., storage of data packet sequence numbers together with group IDs and maintenance of acknowledgment timers), 515 (deletion of stored first group acknowledgment and generation of third group of data packets), 519, and 521 (e.g., generation of third group of data packets) of the above logic flow diagram 500 are performed by a computer program that is stored in a computer-readable memory of the communication device.
The present invention encompasses a method and apparatus for conveying data packets in a packet data communication system. With this invention, groups of data packets can be transmitted reliably, while substantially reducing retransmissions and, therefore, providing more efficient use of communication channel resources. By utilizing existing data in an acknowledgment packet to determine which of a plurality of transmitted groups of data packets the acknowledgment corresponds to, the present invention ensures that the correct data packets are retransmitted by a sending communication device in response to the acknowledgment without requiring a group identifier in each acknowledgment. By not including a group identifier, the present invention permits higher data throughput in the system than if each acknowledgment required such a group identifier. In addition, by selectively responding to acknowledgments (e.g., responding to an acknowledgment corresponding to a later-transmitted group and deleting an acknowledgment presumed to correspond to an earlier-transmitted group), the present invention reduces the number of retransmissions of data packets, thereby permitting more efficient use of communication channel resources, without jeopardizing reliability.
While the present invention has been particularly shown and described with reference to particular embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the present invention.
Patent Citations
Cited PatentFiling datePublication dateApplicantTitle
US4905234 *Jun 3, 1987Feb 27, 1990General Electric CompanyApparatus and method for transmitting digital data over a radio communications channel
US5245616 *May 20, 1992Sep 14, 1993Rosemount Inc.Technique for acknowledging packets
US5440545 *Aug 2, 1993Aug 8, 1995Motorola, Inc.Packet delivery system
US5487068 *Jul 29, 1994Jan 23, 1996Motorola, Inc.Method for providing error correction using selective automatic repeat requests in a packet-switched communication system
US5570376 *Oct 5, 1994Oct 29, 1996Sun Microsystems, Inc.Method and apparatus for identifying faults within a system
US5754754 *Jul 26, 1995May 19, 1998International Business Machines CorporationTransmission order based selective repeat data transmission error recovery system and method
Referenced by
Citing PatentFiling datePublication dateApplicantTitle
US6047194 *Sep 23, 1997Apr 4, 2000Telefonaktiebolaget L M Ericsson (Publ)Method, and associated apparatus, for selectively permitting transmission of packet data to a mobile terminal
US6154454 *Dec 4, 1998Nov 28, 2000Oki Electric Industry Co., LtdRadio communication device and mobile communication system
US6338092 *Sep 24, 1998Jan 8, 2002International Business Machines CorporationMethod, system and computer program for replicating data in a distributed computed environment
US6515982 *Nov 18, 1999Feb 4, 2003Matsushita Electric Industrial Co., Ltd.Device and method for time-division multiple access radio communication
US6529960Jun 29, 2001Mar 4, 2003International Business Machines CorporationMethod and system for replicating data in a distributed computer environment
US6542931Nov 5, 1999Apr 1, 2003Nokia CorporationUsing sparse feedback to increase bandwidth efficiency in high delay, low bandwidth environment
US6611535 *Dec 21, 2001Aug 26, 2003Teracom AbMethod for flow control
US6640248Jul 9, 1999Oct 28, 2003Malibu Networks, Inc.Application-aware, quality of service (QoS) sensitive, media access control (MAC) layer
US6643276 *Nov 30, 1998Nov 4, 2003Motorola, Inc.Data gateway and method for conveying data to a base site in a communication system
US6680922Jul 9, 1999Jan 20, 2004Malibu Networks, Inc.Method for the recognition and operation of virtual private networks (VPNs) over a wireless point to multi-point (PtMP) transmission system
US6701372 *Aug 20, 1998Mar 2, 2004Canon Kabushiki KaishaData communication apparatus and method
US6711128 *Dec 15, 1998Mar 23, 2004At&T Corp.System and method for improving transport protocol performance in communication networks having lossy links
US6744765 *Aug 24, 2000Jun 1, 2004Sun Microsystems, Inc.Mechanism for completing messages in memory
US6754197 *Sep 15, 2000Jun 22, 2004Atheros, Inc.Method and system for transmit data blocking in a wireless communications network
US6760588 *Dec 27, 2000Jul 6, 2004Ntt Docomo, Inc.Method and apparatus for stabilizing communication in mobile communication system
US6775707Oct 15, 1999Aug 10, 2004Fisher-Rosemount Systems, Inc.Deferred acknowledgment communications and alarm management
US6816478 *Nov 3, 2000Nov 9, 2004Lucent Technologies Inc.Apparatus and method for use in effecting automatic repeat requests in wireless multiple access communications systems
US6954450 *Nov 26, 2003Oct 11, 2005Cisco Technology, Inc.Method and apparatus to provide data streaming over a network connection in a wireless MAC processor
US6970446 *Mar 31, 2004Nov 29, 2005Cisco Technology, Inc.Method and apparatus to provide inline encryption and decryption for a wireless station via data streaming over a fast network
US6983334Nov 7, 2001Jan 3, 2006International Business Machines CorporationMethod and system of tracking missing packets in a multicast TFTP environment
US7020113Jan 22, 2001Mar 28, 2006Utstarcom, Inc.Method for allocating dedicated channel for transmitting packet in CDMA media access control (MAC) layer control unit
US7062541 *Apr 27, 2000Jun 13, 2006International Business Machines CorporationSystem and method for transferring related data objects in a distributed data storage environment
US7103637 *Mar 18, 2002Sep 5, 2006Emc CorporationNetwork file sharing method and system
US7111070Jul 26, 2004Sep 19, 2006Fisher-Rosemount Systems, Inc.Deferred acknowledgment communications and alarm management
US7154905Nov 7, 2001Dec 26, 2006Silicon ImageMethod and system for nesting of communications packets
US7251218Oct 24, 2002Jul 31, 2007Van Drebbel Mariner LlcMethod and computer program product for internet protocol (IP)-flow classification in a wireless point to multi-point (PtMP) transmission system
US7349978 *Jan 15, 2004Mar 25, 2008Microsoft CorporationSpurious timeout detection in TCP based networks
US7352702Dec 3, 2001Apr 1, 2008Mitsubishi Denki Kabushiki KaishaMethod for transmitting data between at least one transmitter and at least one receiver, transmitter, receiver, and transmission system thereof
US7359971Aug 10, 2006Apr 15, 2008Van Drebbel Mariner LlcUse of priority-based scheduling for the optimization of latency and jitter sensitive IP flows in a wireless point to multi-point transmission system
US7359972Aug 10, 2006Apr 15, 2008Van Drebbel Mariner LlcTime division multiple access/time division duplex (TDMA/TDD) transmission media access control (MAC) air frame
US7409450Feb 28, 2005Aug 5, 2008Van Drebbel Mariner LlcTransmission control protocol/internet protocol (TCP/IP) packet-centric wireless point to multi-point (PtMP) transmission system architecture
US7412517Aug 10, 2006Aug 12, 2008Van Drebbel Mariner LlcMethod for providing dynamic bandwidth allocation based on IP-flow characteristics in a wireless point to multi-point (PtMP) transmission system
US7450587Feb 14, 2001Nov 11, 2008Siemens AktiengesellschaftMethod for transmitting packet information in a radio communication system
US7489705Feb 26, 2003Feb 10, 2009Telefonaktiebolaget L M Ericsson (Publ)Transmission control method in an ARQ system
US7496674Aug 10, 2006Feb 24, 2009Van Drebbel Mariner LlcSystem, method, and base station using different security protocols on wired and wireless portions of network
US7515593 *Jul 3, 2003Apr 7, 2009Cisco Technology, Inc.Method and system for efficient flow control for client data frames over GFP across a SONET/SDH transport path
US7548532Aug 5, 2005Jun 16, 2009Cisco Technology, Inc.Method and apparatus to provide inline encryption and decryption for a wireless station via data streaming over a fast network
US7574531Sep 11, 2006Aug 11, 2009Fisher-Rosemount Systems, Inc.Deferred acknowledgment communications and alarm management
US7667643Mar 14, 2007Feb 23, 2010Comtech Mobile Datacom CorporationMiniaturized satellite transceiver
US7773546Mar 13, 2007Aug 10, 2010Broadcom CorporationSystem and method for a software-based TCP/IP offload engine for digital media renderers
US7822415 *Nov 2, 2006Oct 26, 2010Comtech Mobile Datacom CorporationIn-flight transceiver and locator system
US7826354 *Sep 23, 2005Nov 2, 2010Tellabs OyMethod preserving delay properties and an apparatus for scheduling transmission link capacity between packet switched telecommunications flows
US7835371Sep 1, 2005Nov 16, 2010Cisco Technology, Inc.Method and apparatus to provide data streaming over a network connection in a wireless MAC processor
US7844681 *Jun 21, 2006Nov 30, 2010Emc CorporationNetwork file sharing method and system
US7882412Sep 27, 2005Feb 1, 2011Sanjiv NandaEnhanced block acknowledgement
US7885264 *Sep 16, 2004Feb 8, 2011Nomura Research Institute Co., Ltd.Communications system, communications device, and data retransmission control method
US7889709 *Aug 23, 2005Feb 15, 2011Sony CorporationDistinguishing between data packets sent over the same set of channels
US7908624Jun 18, 2007Mar 15, 2011Broadcom CorporationSystem and method for just in time streaming of digital programs for network recording and relaying over internet protocol network
US8121128 *Feb 25, 2009Feb 21, 2012Qualcomm IncorporatedMethod and apparatus for link control in a wireless communication system
US8149796Jul 29, 2005Apr 3, 2012Symbol Technologies, Inc.Voice and data wireless communications network and method
US8170023 *Feb 20, 2007May 1, 2012Broadcom CorporationSystem and method for a software-based TCP/IP offload engine for implementing efficient digital media streaming over internet protocol networks
US8189542Jul 29, 2005May 29, 2012Symbol Technologies, Inc.Voice and data wireless communications network and method
US8249048Jan 4, 2011Aug 21, 2012Sony CorporationDistinguishing between data packets sent over the same set of channels
US8275080Nov 7, 2007Sep 25, 2012Comtech Mobile Datacom CorporationSelf-supporting simplex packets
US8284749Mar 2, 2009Oct 9, 2012Comtech Mobile Datacom CorporationTime slot synchronized, flexible bandwidth communication system
US8386667 *Aug 26, 2008Feb 26, 2013Sun Management, LlcTechniques for managing the transmission and reception of data fragments
US8494443Nov 18, 2004Jul 23, 2013Comtech Mobile Datacom CorporationLow-cost satellite communication system
US8498569Mar 16, 2012Jul 30, 2013Comtech Mobile Datacom CorporationLow-cost satellite communication system
US8548107Jan 25, 2010Oct 1, 2013Comtech Mobile Datacom CorporationAdvanced multi-user detector
US8578230Dec 22, 2010Nov 5, 2013Qualcomm IncorporatedEnhanced block acknowledgement
US8593339Sep 1, 2009Nov 26, 2013Comtech Mobile Datacom CorporationMobile satellite communications
US8594153Apr 24, 2007Nov 26, 2013Comtech Mobile Datacom CorporationSpread-spectrum receiver with progressive fourier transform
US8656242 *Apr 6, 2011Feb 18, 2014Intel Mobile Communications GmbHData receiving devices and methods for receiving data
US8660061Dec 27, 2001Feb 25, 2014Symbol Technologies, Inc.Voice and data wireless communications network and method
US8670707Mar 16, 2012Mar 11, 2014Orbcomm Sens, LlcLow-cost satellite communication system
US8675711Sep 24, 2010Mar 18, 2014Comtech Mobile Datacom CorporationSystem and methods for dynamic spread spectrum usage
US8792403 *Feb 6, 2008Jul 29, 2014Clipsal Australia Pty LtdWireless network communications system
US8842528Oct 2, 2012Sep 23, 2014At&T Intellectual Property Ii, LpSystem and method for improving transport protocol performance in communication networks having lossy links
US8874767Apr 3, 2012Oct 28, 2014Intel CorporationEnqueuing received network packets based, at least in part, on at least one programmable mask
US8909824 *Feb 25, 2013Dec 9, 2014Sun Management, LlcTechniques for processing data fragments in communication devices
US8982928Sep 30, 2013Mar 17, 2015Comtech Mobile Datacom CorporationAdvanced multi-user detector
US9106364Jan 25, 2010Aug 11, 2015Comtech Mobile Datacom CorporationSignal processing of a high capacity waveform
US9172654Jul 3, 2013Oct 27, 2015Fujitsu LimitedTransfer device and transfer method
US9195619 *Aug 20, 2012Nov 24, 2015Kabushiki Kaisha ToshibaSemiconductor memory device
US9225473Aug 22, 2014Dec 29, 2015At&T Intellectual Property Ii, LpSystem and method for improving transport protocol performance in communication networks having lossy links
US9356763 *Dec 9, 2014May 31, 2016Sun Management, LlcTimer management in wireless communication
US9521233 *Sep 17, 2010Dec 13, 2016Zte CorporationMethod and device for recording data of terminal
US9621325 *May 30, 2016Apr 11, 2017Stoic Ventures, LLCMethod and apparatus for reliable data transmission and reception
US20010010687 *Jan 22, 2001Aug 2, 2001Hyundai Electronics Industries Co., Ltd.Method for allocating dedicated channel for transmitting packet in CDMA media access control (MAC) layer control unit
US20010018346 *Dec 27, 2000Aug 30, 2001Ntt Docomo, Inc.Method and apparatus for stabilizing communication in mobile communication system
US20020054574 *Dec 27, 2001May 9, 2002Symbol Technologies, Inc.Voice and data wireless communications network and method
US20020154633 *Nov 7, 2001Oct 24, 2002Yeshik ShinCommunications architecture for storage-based devices
US20030067903 *Oct 24, 2002Apr 10, 2003Jorgensen Jacob W.Method and computer program product for internet protocol (IP)-flow classification in a wireless point to multi-point (PTMP)
US20030088667 *Nov 7, 2001May 8, 2003International Business Machines CorporationMethod and system of tracking missing packets in a multicast TFTP environment
US20030135575 *Jun 27, 2002Jul 17, 2003Richard MarejkaSelf-monitoring and trending service system with cascaded pipeline linking numerous client systems
US20040004975 *Nov 7, 2001Jan 8, 2004Yeshik ShinMethod and system for nesting of communications packets
US20040148546 *May 23, 2002Jul 29, 2004Michael MeyerMethod and receiver for improved data packet transfer in a transmission protocol with repeat requests
US20050002338 *Jul 3, 2003Jan 6, 2005Cisco Technology, Inc.Method and system for efficient flow control for client data frames over GFP across a SONET/SDH transport path
US20050021832 *Jul 26, 2004Jan 27, 2005Bennett William E.Deferred acknowledgment communications and alarm management
US20050090199 *Nov 18, 2004Apr 28, 2005Fleeter Richard D.Low-cost satellite communication system
US20050111471 *Nov 26, 2003May 26, 2005Mark KrischerMethod and apparatus to provide data streaming over a network connection in a wireless MAC processor
US20050198350 *Jan 15, 2004Sep 8, 2005Microsoft CorporationSpurios timeout detection in TCP based networks
US20050232193 *Feb 28, 2005Oct 20, 2005Jorgensen Jacob WTransmission control protocol/internet protocol (TCP/IP) packet-centric wireless point to multi-point (PtMP) transmission system architecture
US20050281252 *Jul 29, 2005Dec 22, 2005Beach Robert EVoice and data wireless communications network and method
US20060002378 *Jul 29, 2005Jan 5, 2006Beach Robert EVoice and data wireless communications network and method
US20060014522 *Aug 5, 2005Jan 19, 2006Mark KrischerMethod and apparatus to provide inline encryption and decryption for a wireless station via data streaming over a fast network
US20060023685 *Sep 1, 2005Feb 2, 2006Mark KrischerMethod and apparatus to provide data streaming over a network connection in a wireless MAC processor
US20060072568 *Sep 23, 2005Apr 6, 2006Tellabs OyMethod preserving delay properties and an apparatus for scheduling transmission link capacity between packet switched telecommunications flows
US20060159079 *Feb 26, 2003Jul 20, 2006Joachim SachsTransmission control method in an arq system
US20060224769 *Feb 9, 2004Oct 5, 2006Benny MoonenMethod and transmitter for transmitting data packets
US20060242264 *Jun 21, 2006Oct 26, 2006Emc CorporationNetwork file sharing method and system
US20070027821 *Jul 11, 2006Feb 1, 2007Mitsubishi Denki Kabushiki KaishaMethod for controlling the delivery of a flow of items to at least a client of an item provider
US20070038736 *Aug 10, 2006Feb 15, 2007Van Drebbel Mariner LlcTime division multiple access/time division duplex (TDMA/TDD) transmission media access control (MAC) air frame
US20070038750 *Aug 10, 2006Feb 15, 2007Van Drebbel Mariner LlcMethod for providing for Quality of Service (QoS) - based handling of IP-flows in a wireless point to multi-point transmission system
US20070038751 *Aug 10, 2006Feb 15, 2007Van Drebbel Mariner LlcUse of priority-based scheduling for the optimization of latency and jitter sensitive IP flows in a wireless point to multi-point transmission system
US20070038752 *Aug 10, 2006Feb 15, 2007Van Drebbel Mariner LlcQuality of Service (QoS) - aware wireless Point to Multi-Point (PtMP) transmission system architecture
US20070038753 *Aug 10, 2006Feb 15, 2007Van Drebbel Mariner LlcTransmission Control Protocol/Internet Protocol (TCP/IP) - centric "Quality of Service(QoS)" aware Media Access Control (MAC) Layer in a wireless Point to Multi-Point (PtMP) transmission system
US20070047513 *Aug 23, 2005Mar 1, 2007Ipwireless, Inc.Data packet type recognition system
US20070050492 *Aug 10, 2006Mar 1, 2007Van Drebbel Mariner LlcMethod of operation for the integration of differentiated services (Diff-Serv) marked IP-flows into a quality of service (QoS) priorities in a wireless point to multi-point (PtMP) transmission system
US20070064705 *Sep 16, 2004Mar 22, 2007Shuji TatenoCommunications system, communications device, and data retransmission control method
US20070073822 *Sep 11, 2006Mar 29, 2007Fisher-Rosemount Systems, Inc.Deferred acknowledgment communications and alarm management
US20070298786 *Nov 2, 2006Dec 27, 2007Comtech Mobile Datacom CorporationIn-flight transceiver and locator system
US20080117911 *Mar 13, 2007May 22, 2008Yasantha RajakarunanayakeSystem and method for a software-based TCP/IP offload engine for digital media renderers
US20080117952 *Nov 7, 2007May 22, 2008Jordan Luis GSelf-supporting simplex packets
US20080198781 *Feb 20, 2007Aug 21, 2008Yasantha RajakarunanayakeSystem and method for a software-based TCP/IP offload engine for implementing efficient digital media streaming over Internet protocol networks
US20080313687 *Jun 18, 2007Dec 18, 2008Yasantha Nirmal RajakarunanayakeSystem and method for just in time streaming of digital programs for network recording and relaying over internet protocol network
US20090069041 *Sep 10, 2008Mar 12, 2009Qualcomm IncoporatedScheduling information transfer
US20090122758 *Nov 12, 2008May 14, 2009Jack SmithMethod and Apparatus for Transmitting HARQ Sub-Packets in a Wireless Communication System
US20090168708 *Oct 27, 2008Jul 2, 2009Motorola, Inc.Techniques for maintaining quality of service for connections in wireless communication systems
US20090213729 *Feb 25, 2009Aug 27, 2009Qualcomm IncorporatedMethod and apparatus for link control in a wireless communication system
US20090257422 *Mar 2, 2009Oct 15, 2009Smith R ClaytonTime slot synchronized, flexible bandwidth communication system
US20100058102 *Aug 26, 2008Mar 4, 2010Apacewave Technologies CorporationMethods for Managing the Transmission and Reception of Data Fragments
US20100060515 *Sep 1, 2009Mar 11, 2010Comtech Mobile Datacom CorporationMobile satellite communications
US20100118986 *Nov 10, 2009May 13, 2010Electronics And Telecommunications Research InstituteAcknowledgement method and apparatus of aggregated frame in wideband high frequency wireless system
US20100226266 *Feb 6, 2008Sep 9, 2010Clipsal Australia Pty LtdWireless network communications system
US20110154144 *Dec 22, 2010Jun 23, 2011Qualcomm IncorporatedEnhanced block acknowledgement
US20110170459 *Jan 4, 2011Jul 14, 2011Sony CorporationDistinguishing between data packets sent over the same set of channels
US20120257517 *Apr 6, 2011Oct 11, 2012Intel Mobile Communications GmbHData receiving devices and methods for receiving data
US20120297045 *Sep 17, 2010Nov 22, 2012Zte CorporationMethod and device for recording data of terminal
US20130170430 *Dec 28, 2011Jul 4, 2013Qualcomm IncorporatedMethod and apparatus for acknowledgement including a group identifier
US20130179628 *Aug 20, 2012Jul 11, 2013Masahiro SekiyaSemiconductor memory device
US20150092725 *Dec 9, 2014Apr 2, 2015Sun Management, LlcTimer Management in Wireless Communication
US20160188390 *Dec 14, 2015Jun 30, 2016Vmware, Inc.High-performace virtual machine networking
USRE46206Nov 10, 2010Nov 15, 2016Intellectual Ventures I LlcMethod and computer program product for internet protocol (IP)—flow classification in a wireless point to multi-point (PTMP) transmission system
CN100550714CFeb 26, 2003Oct 14, 2009艾利森电话股份有限公司Transmission control method in an ARQ system
CN101682476BFeb 6, 2008May 14, 2014澳大利亚克林普斯有限公司Wireless network communications system
DE10007602A1 *Feb 18, 2000Aug 30, 2001Siemens AgTransferring packet data information in radio communications system - involves transmitting identification information separated from associated data packet over same or specially dedicated channel
DE10116984A1 *Apr 5, 2001Oct 10, 2002Rainer MartinVoice, audio signal transmission involves dividing parameters into several packets so packet to be transmitted can also contain parameters of current and preceding or subsequent frames
DE102012102995B4 *Apr 5, 2012Mar 12, 2015Intel Mobile Communications GmbHDatenempfangsvorrichtungen und Verfahren zum Empfangen von Daten
EP1152351A2 *Apr 20, 2001Nov 7, 2001International Business Machines CorporationTransferring related data objects in a distributed data storage environment
EP1152351A3 *Apr 20, 2001Jul 30, 2003International Business Machines CorporationTransferring related data objects in a distributed data storage environment
EP1217778A1 *Dec 20, 2001Jun 26, 2002Mitsubishi Electric ITEData communication method and apparatus using automatic repeat request
EP1263159A1 *Jun 1, 2001Dec 4, 2002Telefonaktiebolaget Lm EricssonMethod and receiver for improved data packet transfer in a transmission protocol with repeat requests
EP1667395A1 *Sep 16, 2004Jun 7, 2006Nomura Research Institute Co., Ltd.Communication system, communication device, and data retransmission control method
EP1753197A1 *Jul 27, 2005Feb 14, 2007Mitsubishi Electric Information Technology Centre Europe B.V.Method for controlling the delivery of a flow of data to at least a client of a data provider
EP2194669A1Oct 4, 2005Jun 9, 2010Qualcom IncorporatedEnhanced block acknowledgement
EP2706698A3 *Jul 1, 2013Apr 16, 2014Fujitsu LimitedTransfer device and transfer method using ARQ with Packet ID and several ARQ phases
WO2001035568A1 *Oct 30, 2000May 17, 2001Nokia CorporationSparse feedback in high delay-low bandwidth wireless systems
WO2002100029A1 *May 23, 2002Dec 12, 2002Telefonaktiebolaget Lm Ericsson (Publ)Method and receiver for improved data packet transfer in a transmission protocol with repeat requests
WO2004077736A1 *Feb 26, 2003Sep 10, 2004Telefonaktiebolaget Lm Ericsson (Publ)Transmission control method in an arq system
Classifications
U.S. Classification370/349, 370/437
International ClassificationH04L29/08, H04L1/16, H04L1/18, H04L29/06
Cooperative ClassificationH04L69/324, H04L29/06, H04L1/1809, H04L1/1621
European ClassificationH04L1/16F3, H04L1/18C, H04L29/06
Legal Events
DateCodeEventDescription
Sep 30, 1997ASAssignment
Owner name: MOTOROLA, INC., ILLINOIS
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:BRAILEAN, KAREN A.;BOXALL, ROBERT F.;REEL/FRAME:008834/0004
Effective date: 19970930
Sep 7, 1999CCCertificate of correction
Jul 26, 2002FPAYFee payment
Year of fee payment: 4
Jun 22, 2006FPAYFee payment
Year of fee payment: 8
Jul 2, 2010FPAYFee payment
Year of fee payment: 12
Dec 13, 2010ASAssignment
Owner name: MOTOROLA MOBILITY, INC, ILLINOIS
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MOTOROLA, INC;REEL/FRAME:025673/0558
Effective date: 20100731
Oct 2, 2012ASAssignment
Owner name: MOTOROLA MOBILITY LLC, ILLINOIS
Free format text: CHANGE OF NAME;ASSIGNOR:MOTOROLA MOBILITY, INC.;REEL/FRAME:029216/0282
Effective date: 20120622
Nov 21, 2014ASAssignment
Owner name: GOOGLE TECHNOLOGY HOLDINGS LLC, CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:MOTOROLA MOBILITY LLC;REEL/FRAME:034413/0001
Effective date: 20141028
|
{
"url": "http://www.google.com/patents/US5872777?dq=%22robert+sheehan%22",
"source_domain": "www.google.com",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "158934",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NPRU7U27T63EC3JOQZCVFUBYTQRPJJY4",
"WARC-Concurrent-To": "<urn:uuid:1af63d10-26e0-4010-a78e-5a4d567e6ae6>",
"WARC-Date": "2017-05-28T15:55:30Z",
"WARC-IP-Address": "172.217.7.164",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UYHW2S67YOSYAIE5QWUMTQQZBM24NACV",
"WARC-Record-ID": "<urn:uuid:6e29966a-c2e0-4c86-bb9c-b55bf60f0b48>",
"WARC-Target-URI": "http://www.google.com/patents/US5872777?dq=%22robert+sheehan%22",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:283773e0-721d-4d49-bb4f-d8c0dd6c6378>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-224-210.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-22\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for May 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
56,
64,
205,
206,
214,
215,
243,
273,
295,
327,
356,
380,
406,
421,
544,
645,
690,
722,
761,
812,
898,
911,
920,
2237,
2247,
2261,
2271,
2282,
2292,
2468,
2602,
2741,
3056,
3197,
3679,
3888,
4181,
4280,
4367,
4735,
4842,
4965,
5017,
5260,
5359,
5653,
5754,
5948,
6190,
6385,
6629,
6731,
7156,
7657,
7835,
8123,
8327,
8621,
8727,
8827,
8939,
9066,
9078,
9118,
9119,
9378,
9379,
9402,
9403,
9593,
9594,
9622,
9623,
10273,
10274,
11489,
11490,
13166,
13167,
14445,
14446,
15014,
15015,
15835,
15836,
16041,
16042,
16076,
16077,
16202,
16203,
16299,
16300,
16401,
16402,
16537,
16538,
16687,
16688,
16726,
16727,
17847,
17848,
18939,
18940,
19534,
19535,
20589,
20590,
21609,
21610,
22728,
22729,
24216,
24217,
24598,
24599,
26314,
26315,
26907,
26908,
28151,
28152,
29448,
29449,
30091,
30092,
30803,
30804,
32126,
32127,
32774,
32775,
33906,
33907,
35462,
35463,
36838,
36839,
37312,
37313,
38516,
38517,
39034,
39035,
40349,
40350,
42160,
42161,
43834,
43835,
45178,
45179,
45849,
45850,
46364,
46365,
47635,
47636,
47937,
47938,
47955,
48009,
48154,
48239,
48309,
48480,
48596,
48767,
48781,
48836,
49019,
49142,
49314,
49460,
49612,
49756,
49825,
49966,
50098,
50291,
50387,
50540,
50640,
50770,
50902,
51025,
51201,
51359,
51543,
51695,
51861,
52037,
52125,
52248,
52349,
52550,
52655,
52863,
53069,
53237,
53434,
53635,
53769,
53886,
54052,
54218,
54399,
54522,
54624,
54766,
54875,
55062,
55217,
55306,
55381,
55535,
55657,
55841,
55970,
56085,
56283,
56399,
56518,
56616,
56745,
56872,
56979,
57086,
57181,
57265,
57363,
57490,
57610,
57726,
57816,
57936,
58034,
58207,
58350,
58469,
58565,
58678,
58761,
58848,
59022,
59118,
59217,
59337,
59533,
59670,
59791,
59894,
60076,
60234,
60387,
60491,
60645,
60815,
60932,
61029,
61182,
61289,
61487,
61598,
61708,
61886,
62037,
62228,
62325,
62427,
62520,
62687,
62861,
63057,
63269,
63434,
63690,
63780,
64041,
64177,
64306,
64419,
64572,
64655,
64863,
65065,
65156,
65295,
65443,
65576,
65693,
65835,
65939,
66131,
66232,
66323,
66448,
66572,
66675,
66804,
66886,
66985,
67079,
67284,
67376,
67462,
67708,
67943,
68081,
68236,
68392,
68523,
68691,
68845,
69037,
69121,
69256,
69374,
69554,
69677,
69693,
69729,
69798,
69870,
69926,
69939,
69964,
69989,
70026,
70147,
70172,
70211,
70239,
70262,
70290,
70313,
70340,
70364,
70389,
70434,
70531,
70556,
70580,
70624,
70713,
70738,
70763,
70818,
70923
],
"line_end_idx": [
56,
64,
205,
206,
214,
215,
243,
273,
295,
327,
356,
380,
406,
421,
544,
645,
690,
722,
761,
812,
898,
911,
920,
2237,
2247,
2261,
2271,
2282,
2292,
2468,
2602,
2741,
3056,
3197,
3679,
3888,
4181,
4280,
4367,
4735,
4842,
4965,
5017,
5260,
5359,
5653,
5754,
5948,
6190,
6385,
6629,
6731,
7156,
7657,
7835,
8123,
8327,
8621,
8727,
8827,
8939,
9066,
9078,
9118,
9119,
9378,
9379,
9402,
9403,
9593,
9594,
9622,
9623,
10273,
10274,
11489,
11490,
13166,
13167,
14445,
14446,
15014,
15015,
15835,
15836,
16041,
16042,
16076,
16077,
16202,
16203,
16299,
16300,
16401,
16402,
16537,
16538,
16687,
16688,
16726,
16727,
17847,
17848,
18939,
18940,
19534,
19535,
20589,
20590,
21609,
21610,
22728,
22729,
24216,
24217,
24598,
24599,
26314,
26315,
26907,
26908,
28151,
28152,
29448,
29449,
30091,
30092,
30803,
30804,
32126,
32127,
32774,
32775,
33906,
33907,
35462,
35463,
36838,
36839,
37312,
37313,
38516,
38517,
39034,
39035,
40349,
40350,
42160,
42161,
43834,
43835,
45178,
45179,
45849,
45850,
46364,
46365,
47635,
47636,
47937,
47938,
47955,
48009,
48154,
48239,
48309,
48480,
48596,
48767,
48781,
48836,
49019,
49142,
49314,
49460,
49612,
49756,
49825,
49966,
50098,
50291,
50387,
50540,
50640,
50770,
50902,
51025,
51201,
51359,
51543,
51695,
51861,
52037,
52125,
52248,
52349,
52550,
52655,
52863,
53069,
53237,
53434,
53635,
53769,
53886,
54052,
54218,
54399,
54522,
54624,
54766,
54875,
55062,
55217,
55306,
55381,
55535,
55657,
55841,
55970,
56085,
56283,
56399,
56518,
56616,
56745,
56872,
56979,
57086,
57181,
57265,
57363,
57490,
57610,
57726,
57816,
57936,
58034,
58207,
58350,
58469,
58565,
58678,
58761,
58848,
59022,
59118,
59217,
59337,
59533,
59670,
59791,
59894,
60076,
60234,
60387,
60491,
60645,
60815,
60932,
61029,
61182,
61289,
61487,
61598,
61708,
61886,
62037,
62228,
62325,
62427,
62520,
62687,
62861,
63057,
63269,
63434,
63690,
63780,
64041,
64177,
64306,
64419,
64572,
64655,
64863,
65065,
65156,
65295,
65443,
65576,
65693,
65835,
65939,
66131,
66232,
66323,
66448,
66572,
66675,
66804,
66886,
66985,
67079,
67284,
67376,
67462,
67708,
67943,
68081,
68236,
68392,
68523,
68691,
68845,
69037,
69121,
69256,
69374,
69554,
69677,
69693,
69729,
69798,
69870,
69926,
69939,
69964,
69989,
70026,
70147,
70172,
70211,
70239,
70262,
70290,
70313,
70340,
70364,
70389,
70434,
70531,
70556,
70580,
70624,
70713,
70738,
70763,
70818,
70923,
70947
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 70947,
"ccnet_original_nlines": 350,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3051700294017792,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03019234910607338,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2019316554069519,
"rps_doc_frac_unique_words": 0.15652510523796082,
"rps_doc_mean_word_length": 5.684337615966797,
"rps_doc_num_sentences": 353,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.7085795402526855,
"rps_doc_word_count": 10337,
"rps_doc_frac_chars_dupe_10grams": 0.23812521994113922,
"rps_doc_frac_chars_dupe_5grams": 0.4704130291938782,
"rps_doc_frac_chars_dupe_6grams": 0.4145577847957611,
"rps_doc_frac_chars_dupe_7grams": 0.3561326861381531,
"rps_doc_frac_chars_dupe_8grams": 0.3056723177433014,
"rps_doc_frac_chars_dupe_9grams": 0.27124354243278503,
"rps_doc_frac_chars_top_2gram": 0.01097704004496336,
"rps_doc_frac_chars_top_3gram": 0.013938290067017078,
"rps_doc_frac_chars_top_4gram": 0.014397789724171162,
"rps_doc_books_importance": -5451.30908203125,
"rps_doc_books_importance_length_correction": -5451.30908203125,
"rps_doc_openwebtext_importance": -2967.1435546875,
"rps_doc_openwebtext_importance_length_correction": -2967.1435546875,
"rps_doc_wikipedia_importance": -2629.80712890625,
"rps_doc_wikipedia_importance_length_correction": -2629.80712890625
},
"fasttext": {
"dclm": 0.3414081335067749,
"english": 0.8856886029243469,
"fineweb_edu_approx": 2.5859744548797607,
"eai_general_math": 0.42589902877807617,
"eai_open_web_math": 0.05987691879272461,
"eai_web_code": 0.33850669860839844
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.384",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "11",
"label": "Legal/Regulatory"
},
"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": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-460,577,779,732,740,200 |
Computer lags when playing game..HELP!
Discussion in 'OT Technology' started by GSteg, Mar 15, 2004.
1. GSteg
GSteg Member
Joined:
Dec 28, 2001
Messages:
793
Likes Received:
0
I have the following:
1.3Ghz processor
192MB Ram memory
80GS HD w/7200RPM and 8MB cache
16MB video memory?
etc
Whenever I play need for speed hot pursuit II, the computer lags. The picture does not go smoothly at all. the fps is pretty weak. When I upgraded my HD to the 7200RPM HD, it was a bit better, but still not smooth. What can I do to make it smoother?
Graphic accelerator?
more Ram memory (possibly 256MB more)?
help! :wtc:
2. silver75
silver75 Guest
sounds like your video card is holding you back.
3. What kind of video card do you have or is it onboard?
4. TechMo
TechMo New Member
Joined:
Feb 17, 2004
Messages:
1,477
Likes Received:
0
Location:
Miami FL
dude you need more ram..192 ram is not going to cut it...
5. TechMo
TechMo New Member
Joined:
Feb 17, 2004
Messages:
1,477
Likes Received:
0
Location:
Miami FL
you need atleast 512 ram
6. GSteg
GSteg Member
Joined:
Dec 28, 2001
Messages:
793
Likes Received:
0
i'm not even sure what video card i have. It has the original card. lol. So is it RAM or the video card?
7. I would recommend getting at least one 128Mb stick of RAM and a graphics card with at least 128Mb onboard RAM
8. Wolf68k
Wolf68k Active Member OT Supporter
Joined:
Dec 18, 2003
Messages:
4,861
Likes Received:
1
Location:
Houston, Texas
16megs of video ram isn't going to cut it either
AIDA32 - Personal System Information get this and run it and it'll tell you everything you need to know about your system.
It sounds like an on-board video card, maybe a SiS Pro Savage S3 which suck to high heaven.
9. zero xeal
zero xeal Guest
try updating all the drivers on your computer
10. Up All Night
Up All Night I might sleep all day
Joined:
Jan 23, 2004
Messages:
2,104
Likes Received:
0
16mb of video sounds like an onboard graphics card, shared mem from system ram. Thats a piece of shit. Buy a new graphics card
If its not an onboard card, 16mb signifies its still too old/slow to cope with todays games. Buy a new card
Share This Page
|
{
"url": "https://www.offtopic.com/threads/computer-lags-when-playing-game-help.1034751/",
"source_domain": "www.offtopic.com",
"snapshot_id": "crawl=CC-MAIN-2016-44",
"warc_metadata": {
"Content-Length": "45150",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2V4QCJDQO7YHIAJRVAFDJJQ3ZZ3QY75G",
"WARC-Concurrent-To": "<urn:uuid:5cfdc501-ebbc-4766-88ac-508a94d5fc1c>",
"WARC-Date": "2016-10-25T14:01:25Z",
"WARC-IP-Address": "104.25.238.28",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:KSCOAW7NHBLRVJFSXGOE7CNMKOFNNOWZ",
"WARC-Record-ID": "<urn:uuid:445773a2-e3d9-441a-a6dd-bbed10f66fe7>",
"WARC-Target-URI": "https://www.offtopic.com/threads/computer-lags-when-playing-game-help.1034751/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:85c8275d-4096-47ab-8861-70ac8b5ee5bb>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-6-4.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-44\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for October 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
39,
40,
102,
103,
114,
115,
132,
133,
145,
162,
176,
184,
204,
210,
236,
237,
258,
279,
315,
338,
346,
347,
601,
602,
627,
670,
671,
687,
693,
707,
708,
727,
728,
781,
787,
846,
852,
864,
865,
887,
888,
900,
917,
931,
941,
961,
967,
981,
994,
1056,
1062,
1074,
1075,
1097,
1098,
1110,
1127,
1141,
1151,
1171,
1177,
1191,
1204,
1233,
1239,
1250,
1251,
1268,
1269,
1281,
1298,
1312,
1320,
1340,
1346,
1455,
1461,
1576,
1582,
1595,
1596,
1635,
1636,
1648,
1665,
1679,
1689,
1709,
1715,
1729,
1748,
1801,
1802,
1929,
2025,
2031,
2046,
2047,
2067,
2068,
2118,
2124,
2143,
2144,
2183,
2184,
2196,
2213,
2227,
2237,
2257,
2263,
2394,
2395,
2507,
2513,
2514
],
"line_end_idx": [
39,
40,
102,
103,
114,
115,
132,
133,
145,
162,
176,
184,
204,
210,
236,
237,
258,
279,
315,
338,
346,
347,
601,
602,
627,
670,
671,
687,
693,
707,
708,
727,
728,
781,
787,
846,
852,
864,
865,
887,
888,
900,
917,
931,
941,
961,
967,
981,
994,
1056,
1062,
1074,
1075,
1097,
1098,
1110,
1127,
1141,
1151,
1171,
1177,
1191,
1204,
1233,
1239,
1250,
1251,
1268,
1269,
1281,
1298,
1312,
1320,
1340,
1346,
1455,
1461,
1576,
1582,
1595,
1596,
1635,
1636,
1648,
1665,
1679,
1689,
1709,
1715,
1729,
1748,
1801,
1802,
1929,
2025,
2031,
2046,
2047,
2067,
2068,
2118,
2124,
2143,
2144,
2183,
2184,
2196,
2213,
2227,
2237,
2257,
2263,
2394,
2395,
2507,
2513,
2514,
2529
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2529,
"ccnet_original_nlines": 117,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 3,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2782258093357086,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05443548038601875,
"rps_doc_frac_lines_end_with_ellipsis": 0.008474580012261868,
"rps_doc_frac_no_alph_words": 0.2661290168762207,
"rps_doc_frac_unique_words": 0.5152284502983093,
"rps_doc_mean_word_length": 4.203045845031738,
"rps_doc_num_sentences": 37,
"rps_doc_symbol_to_word_ratio": 0.0020161299034953117,
"rps_doc_unigram_entropy": 5.01855993270874,
"rps_doc_word_count": 394,
"rps_doc_frac_chars_dupe_10grams": 0.16062802076339722,
"rps_doc_frac_chars_dupe_5grams": 0.16062802076339722,
"rps_doc_frac_chars_dupe_6grams": 0.16062802076339722,
"rps_doc_frac_chars_dupe_7grams": 0.16062802076339722,
"rps_doc_frac_chars_dupe_8grams": 0.16062802076339722,
"rps_doc_frac_chars_dupe_9grams": 0.16062802076339722,
"rps_doc_frac_chars_top_2gram": 0.047101449221372604,
"rps_doc_frac_chars_top_3gram": 0.04227053001523018,
"rps_doc_frac_chars_top_4gram": 0.026570050045847893,
"rps_doc_books_importance": -194.72784423828125,
"rps_doc_books_importance_length_correction": -194.72784423828125,
"rps_doc_openwebtext_importance": -123.68022918701172,
"rps_doc_openwebtext_importance_length_correction": -123.68022918701172,
"rps_doc_wikipedia_importance": -52.091495513916016,
"rps_doc_wikipedia_importance_length_correction": -52.091495513916016
},
"fasttext": {
"dclm": 0.025294899940490723,
"english": 0.9297482967376709,
"fineweb_edu_approx": 1.167924165725708,
"eai_general_math": 0.000037549998523900285,
"eai_open_web_math": 0.056119561195373535,
"eai_web_code": -0.000009299999874201603
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,983,936,534,753,975,000 |
Win a copy of Murach's Python Programming this week in the Jython/Python forum!
• Post Reply Bookmark Topic Watch Topic
• New Topic
Assigning random numbers to an array RSS feed
Andy Joness
Greenhorn
Posts: 24
• Mark post as helpful
• send pies
• Quote
• Report post to moderator
Hey all, first post here.
I'm reading through a book and have come across something I really can't get my head around.
(this is within a loop btw)
Now I understand what it does, but I don't know how it does it. For example, how does it make sure the same number isn't assigned in the array twice?
Cheers
John de Michele
Rancher
Posts: 600
• Mark post as helpful
• send pies
• Quote
• Report post to moderator
Andy:
Welcome to JavaRanch!
Actually, there is no guarantee that you won't get the same number in the array twice. Math.random() uses an object of the class java.util.Random, which is a pseudo-random number generator. See the Javadoc for java.util.Random.
John.
Henry Wong
author
Sheriff
Posts: 22840
119
C++ Chrome Eclipse IDE Firefox Browser Java jQuery Linux VI Editor Windows
• Mark post as helpful
• send pies
• Quote
• Report post to moderator
(this is within a loop btw)
Yeah, it may have been a good idea to show the array. And the init of the nums array. As it is not that clear what the code does.
Now I understand what it does, but I don't know how it does it. For example, how does it make sure the same number isn't assigned in the array twice?
Assuming that the loop is just a simple loop that indexes through the array, it doesn't matter if the same random number appears twice. Take a look at the code again -- it is not assigning the random number to the array. The random number is used as an index to determine which array index will be swapped, with the current index.
Think of it as shuffling a deck of cards. It doesn't matter if the same index appears twice. At the end, the cards will still be unique. Bad random numbers just means that the cards may not be well shuffled -- not that you will get duplicate cards.
Henry
Andy Joness
Greenhorn
Posts: 24
• Mark post as helpful
• send pies
• Quote
• Report post to moderator
Ohhh! That's cleared it up nicely, now I understand it, thanks! Can't believe I never thought of it like that...
See at the moment it's not the learning of the syntax which is proving to be difficult to learn, I'm understanding it quite well and memorising a lot of it. It's actually using the syntax to make clever algorithms that do stuff like this (i.e structuring it all in a way which creates an efficient program).
Is it because I'm not some mathematics whizz that's great with numbers, or simply lack of experience? Will I be better at thinking up how to create clever algorithms as I continue to read and get deeper in to Java?
With a little knowledge, a cast iron skillet is non-stick and lasts a lifetime.
• Post Reply Bookmark Topic Watch Topic
• New Topic
Boost this thread!
|
{
"url": "https://coderanch.com/t/464364/java/Assigning-random-numbers-array",
"source_domain": "coderanch.com",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "26225",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BZXDMNQOSAK5VM5NLP77LJOZGD6IFO6Y",
"WARC-Concurrent-To": "<urn:uuid:8350a1c6-9c2a-45a1-99a4-3ef6088f76d2>",
"WARC-Date": "2017-05-25T00:29:21Z",
"WARC-IP-Address": "204.144.184.130",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QUYHAAU4S46HK3JJM4D2UMHAMV5BGJRW",
"WARC-Record-ID": "<urn:uuid:9771e821-798a-40a4-804d-aff67604f4d8>",
"WARC-Target-URI": "https://coderanch.com/t/464364/java/Assigning-random-numbers-array",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a092a0f1-9410-4b7e-a024-21ff4e22c190>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-224-210.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-22\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for May 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
80,
122,
136,
137,
184,
185,
187,
199,
209,
219,
244,
258,
268,
297,
323,
324,
417,
418,
419,
420,
448,
449,
599,
600,
607,
609,
625,
633,
644,
669,
683,
693,
722,
728,
729,
751,
752,
980,
981,
987,
989,
1000,
1007,
1015,
1028,
1032,
1107,
1132,
1146,
1156,
1185,
1213,
1214,
1215,
1216,
1346,
1347,
1348,
1498,
1499,
1500,
1831,
1832,
2081,
2082,
2088,
2090,
2102,
2112,
2122,
2147,
2161,
2171,
2200,
2313,
2314,
2622,
2623,
2838,
2840,
2920,
2962,
2976
],
"line_end_idx": [
80,
122,
136,
137,
184,
185,
187,
199,
209,
219,
244,
258,
268,
297,
323,
324,
417,
418,
419,
420,
448,
449,
599,
600,
607,
609,
625,
633,
644,
669,
683,
693,
722,
728,
729,
751,
752,
980,
981,
987,
989,
1000,
1007,
1015,
1028,
1032,
1107,
1132,
1146,
1156,
1185,
1213,
1214,
1215,
1216,
1346,
1347,
1348,
1498,
1499,
1500,
1831,
1832,
2081,
2082,
2088,
2090,
2102,
2112,
2122,
2147,
2161,
2171,
2200,
2313,
2314,
2622,
2623,
2838,
2840,
2920,
2962,
2976,
2994
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2994,
"ccnet_original_nlines": 83,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4061068594455719,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02442747913300991,
"rps_doc_frac_lines_end_with_ellipsis": 0.011904760263860226,
"rps_doc_frac_no_alph_words": 0.17099237442016602,
"rps_doc_frac_unique_words": 0.41697415709495544,
"rps_doc_mean_word_length": 4.214022159576416,
"rps_doc_num_sentences": 37,
"rps_doc_symbol_to_word_ratio": 0.0015267200069501996,
"rps_doc_unigram_entropy": 4.933200836181641,
"rps_doc_word_count": 542,
"rps_doc_frac_chars_dupe_10grams": 0.2556917667388916,
"rps_doc_frac_chars_dupe_5grams": 0.29334500432014465,
"rps_doc_frac_chars_dupe_6grams": 0.29334500432014465,
"rps_doc_frac_chars_dupe_7grams": 0.2556917667388916,
"rps_doc_frac_chars_dupe_8grams": 0.2556917667388916,
"rps_doc_frac_chars_dupe_9grams": 0.2556917667388916,
"rps_doc_frac_chars_top_2gram": 0.02101575955748558,
"rps_doc_frac_chars_top_3gram": 0.01576182059943676,
"rps_doc_frac_chars_top_4gram": 0.019264450296759605,
"rps_doc_books_importance": -300.9443054199219,
"rps_doc_books_importance_length_correction": -300.9443054199219,
"rps_doc_openwebtext_importance": -188.5732421875,
"rps_doc_openwebtext_importance_length_correction": -188.5732421875,
"rps_doc_wikipedia_importance": -120.02124786376953,
"rps_doc_wikipedia_importance_length_correction": -120.02124786376953
},
"fasttext": {
"dclm": 0.15675389766693115,
"english": 0.9243350028991699,
"fineweb_edu_approx": 1.7749561071395874,
"eai_general_math": 0.05514616146683693,
"eai_open_web_math": 0.35795050859451294,
"eai_web_code": 0.0010039199842140079
}
}
|
{
"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": "519.2",
"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": "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": "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
|
974,478,154,343,446,500 |
The Stopwatch node measures provides two modalities to determine how it should start counting time which are specified by the Trigger policy property:
• Switch The Stopwatch starts counting time when the Input connector value goes to 1, it pauses when the Input value goes to 0. Whenever the node pauses, it sends the time the Input value has been 1 to the Partial time connector and the total counted time to the Total time connector.
• Toggle The Stopwatch starts counting when it receives the first rising edge on the Input connector, all the other times it receives a rising edge it sends the time passed between the current rising edge and the previous one to the Partial time connector, and the total counted time to the Total time connector.
When the Reset connector value is 1, the node stops counting the time and sends 0 to both Partial time and Total time, it will start counting again only after the Reset value goes to 0.
Behaviour of Stopwatch with Trigger policy //Switch//
Behaviour of Stopwatch with Trigger policy Switch
Behaviour of Stopwatch with Trigger policy //Toggle//
Behaviour of Stopwatch with Trigger policy Toggle
|
{
"url": "http://www.thinknx.com/wiki/doku.php?id=lm_timer_stopwatch&do=",
"source_domain": "www.thinknx.com",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "19893",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4YJI4VJTHTLLIGG5UR5S3LK6I3W2XP4W",
"WARC-Concurrent-To": "<urn:uuid:f0a7fabd-fedb-48e2-bed3-1dc7137e580b>",
"WARC-Date": "2020-07-07T08:05:04Z",
"WARC-IP-Address": "62.149.142.71",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:WS7EMAK6TKO23SW4IC36JLNLSFAURB6X",
"WARC-Record-ID": "<urn:uuid:0a71956b-5fb7-4319-afa3-5940fb3d8b49>",
"WARC-Target-URI": "http://www.thinknx.com/wiki/doku.php?id=lm_timer_stopwatch&do=",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1337ae3c-b69e-4598-9ec4-0576e7e30891>"
},
"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-218.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,
151,
152,
439,
754,
755,
941,
942,
997,
998,
1048,
1049,
1104,
1105
],
"line_end_idx": [
151,
152,
439,
754,
755,
941,
942,
997,
998,
1048,
1049,
1104,
1105,
1154
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1154,
"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.4047619104385376,
"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.10952381044626236,
"rps_doc_frac_unique_words": 0.34358975291252136,
"rps_doc_mean_word_length": 4.764102458953857,
"rps_doc_num_sentences": 5,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.769785165786743,
"rps_doc_word_count": 195,
"rps_doc_frac_chars_dupe_10grams": 0.28310009837150574,
"rps_doc_frac_chars_dupe_5grams": 0.3358449935913086,
"rps_doc_frac_chars_dupe_6grams": 0.3358449935913086,
"rps_doc_frac_chars_dupe_7grams": 0.3358449935913086,
"rps_doc_frac_chars_dupe_8grams": 0.28310009837150574,
"rps_doc_frac_chars_dupe_9grams": 0.28310009837150574,
"rps_doc_frac_chars_top_2gram": 0.06996770948171616,
"rps_doc_frac_chars_top_3gram": 0.08611410111188889,
"rps_doc_frac_chars_top_4gram": 0.10333692282438278,
"rps_doc_books_importance": -96.22080993652344,
"rps_doc_books_importance_length_correction": -96.22080993652344,
"rps_doc_openwebtext_importance": -63.012474060058594,
"rps_doc_openwebtext_importance_length_correction": -60.7298583984375,
"rps_doc_wikipedia_importance": -54.42817306518555,
"rps_doc_wikipedia_importance_length_correction": -54.42817306518555
},
"fasttext": {
"dclm": 0.42999982833862305,
"english": 0.8616524934768677,
"fineweb_edu_approx": 2.2789101600646973,
"eai_general_math": 0.8543784618377686,
"eai_open_web_math": 0.2644258141517639,
"eai_web_code": 0.835594892501831
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-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": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,747,423,235,915,760,000 |
How To View Pages With Flash In Chrome
How to view pages with Flash in Chrome
We are going to explain how to view pages with Flash in Chrome. Google’s browser, like many others, began to block Flash content from websites a few years ago, an insecure technology that Adobe itself has confirmed will end up killing. Thus, it is increasingly common for websites to resort to HTML5 and browsers to block Flash.
However, despite the blocking, you can still run the Flash pages you see blocked, and you can even configure the browser so that in certain of them, it never asks you if you want to use it again and starts doing it directly. Of course, then you can also manage these permissions.
How to view blocked Flash pages
To see a page that appears blocked for not being able to use Flash, the method to follow is simple. First, click on the page itself (1), which will bring up a dialog telling you if you want to enable Flash. In it, press the Allow button (2), and you will have permission to access the website in question.
Configure the Flash viewing of a website.
Configure the Flash viewing of a website
There is also a second way to configure any website to be able to use Flash or directly to automatically prevent it from doing so without asking you. To do this, press the lock icon next to the address bar. Doing so will bring up a menu with various options on the web.
In this pop-up menu, click on the options box next to Flash (1), and it will ask you if you want Chrome to ask you if you want to use this technology, to allow it to be used automatically, or to block it. To enable Flash on the web, click on the Allow option (2), and you will configure that page so that it can use Flash.
Manage page settings with Flash.
With the previous step, you can add pages to a kind of white list that Flash allows or to a black one when you choose the block option. These decisions can also be managed later. To do this, press the three-point Chrome button (1) at the top right, and when the menu opens, choose the Settings option (2).
Once on the Chrome Settings page, scroll down to the bottom and click the Advanced Settings option to display more options.
When the advanced settings open, find and click on the Content settings option since it is the one that controls the information that web pages can use or the content that can be displayed.
When you are in this Content Configuration menu, you simply have to click on the Flash option that will appear between JavaScript and Images.
You will enter a page where you can reconfigure if you want Chrome to ask before showing Flash. In addition, you will have two Block and Allow lists where the websites you have blocked or allowed Flash with the previous steps will be added. To the right of each web, you have the icon of a garbage can to remove it from the web, so you will have to reconfigure the permissions.
|
{
"url": "https://techsmartest.com/how-to-view-pages-with-flash-in-chrome/",
"source_domain": "techsmartest.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "130374",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5DTUIPYHWMDHIKDBDKAYUFJ3BRPFGEDP",
"WARC-Concurrent-To": "<urn:uuid:5565aa54-4913-4239-94a9-10ed9f043cd3>",
"WARC-Date": "2023-09-26T00:19:05Z",
"WARC-IP-Address": "172.67.223.123",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NYG4LXW6LA5BJKALIS5QYK5LLAFJSOZM",
"WARC-Record-ID": "<urn:uuid:db344ae3-9305-4e98-9fae-283c49c9f07a>",
"WARC-Target-URI": "https://techsmartest.com/how-to-view-pages-with-flash-in-chrome/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3d5a158b-1132-4ed8-8c69-f5514f834bdc>"
},
"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-159\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
39,
40,
79,
80,
409,
410,
690,
691,
723,
724,
1030,
1031,
1073,
1074,
1115,
1116,
1386,
1387,
1710,
1711,
1744,
1745,
2051,
2052,
2176,
2177,
2367,
2368,
2510,
2511
],
"line_end_idx": [
39,
40,
79,
80,
409,
410,
690,
691,
723,
724,
1030,
1031,
1073,
1074,
1115,
1116,
1386,
1387,
1710,
1711,
1744,
1745,
2051,
2052,
2176,
2177,
2367,
2368,
2510,
2511,
2888
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2888,
"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.5066006779670715,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0016501699574291706,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11716172099113464,
"rps_doc_frac_unique_words": 0.34386616945266724,
"rps_doc_mean_word_length": 4.213754653930664,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.589728355407715,
"rps_doc_word_count": 538,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1265990287065506,
"rps_doc_frac_chars_dupe_6grams": 0.10366123169660568,
"rps_doc_frac_chars_dupe_7grams": 0.07101897150278091,
"rps_doc_frac_chars_dupe_8grams": 0.0410233810544014,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.017644459381699562,
"rps_doc_frac_chars_top_3gram": 0.019850019365549088,
"rps_doc_frac_chars_top_4gram": 0.02117335982620716,
"rps_doc_books_importance": -267.8902282714844,
"rps_doc_books_importance_length_correction": -267.8902282714844,
"rps_doc_openwebtext_importance": -128.1702423095703,
"rps_doc_openwebtext_importance_length_correction": -128.1702423095703,
"rps_doc_wikipedia_importance": -120.50743865966797,
"rps_doc_wikipedia_importance_length_correction": -120.50743865966797
},
"fasttext": {
"dclm": 0.022761229425668716,
"english": 0.8764172196388245,
"fineweb_edu_approx": 1.9045809507369995,
"eai_general_math": 0.1832100749015808,
"eai_open_web_math": 0.27859336137771606,
"eai_web_code": 0.22095322608947754
}
}
|
{
"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": "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
|
7,489,622,723,383,603,000 |
Should I create a game or use inline buttons? Use Python-telegram-bot? Telethon? Pyrogram? aiogram? Chatterbot? I want to build a Chatbot to collaboratively build content. I’m a bit overwhelmed with the plethora of APIs, frameworks, and wrappers.
Should I create a game or use inline buttons? Use Python-telegram-bot? Telethon? Pyrogram? aiogram? Chatterbot? I want to build a Chatbot to collaboratively build content. I'm a bit overwhelmed with the plethora of APIs, frameworks, and wrappers.
I want to create a bot to collect some recordings in a collaborative workflow; each user fills out something according to their assigned role in the group. But I’m not really concerned about any of that. Let’s say that all the different media files for some item are collected. User taps on its entry in the listview, what can a bot send?
The media group is structured like ::
• Title
• Animation
• Contributor recording (video or audio) from users with contributor role.
• 1st recording
• 2nd recording
• 3rd recording
• Response recording videos from users with reviewer role
• Unlimited.
This is just a mockup, I don’t care about it being pretty for now. Back to my question, what could a bot send? Ideally, I’d want one continuous playback for:
1. Animation
2. Sequentially play Contributor Recordings (all 3 or whatever is available)
3. front camera opens prompting user for a recording.
4. All those elements on the screen are buttons. << this is the question
Viewer
Placeholder
From what I understand, inline buttons won’t play videos, audio, or open GIF animations, or maybe that was true for one of the APIs, I don’t know. Instead, the user would have to tap on the media file itself to play or view it. That would be too many steps for what I’m trying to build.
Another thing, I want to change the default behavior of the video and audio recording buttons. It should play the audio as soon as the recording button is released. I think I remember that’s how WhatsApp really works. To change this, do I have to build another Telegram client? What would I use then?
Any help appreciated, thanks
submitted by /u/somenick
[link] [comments]
|
{
"url": "https://storevep.eksido.io/2021/11/01/should-i-create-a-game-or-use-inline-buttons-use-python-telegram-bot-telethon-pyrogram-aiogram-chatterbot-i-want-to-build-a-chatbot-to-collaboratively-build-content-im-a-bit-overwhelmed-with-t/",
"source_domain": "storevep.eksido.io",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "44731",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:URBU6HAZOVGW6HC77LVSBOBJWAIT3VZU",
"WARC-Concurrent-To": "<urn:uuid:84109f67-f932-4adf-8fe0-f66a08229f0e>",
"WARC-Date": "2021-12-05T17:27:10Z",
"WARC-IP-Address": "18.185.94.63",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5NLUVRVVRUBOPJPWA4FPZFJA5JWLIMU5",
"WARC-Record-ID": "<urn:uuid:3d8b73c7-b202-451a-9bdb-40486704c7ec>",
"WARC-Target-URI": "https://storevep.eksido.io/2021/11/01/should-i-create-a-game-or-use-inline-buttons-use-python-telegram-bot-telethon-pyrogram-aiogram-chatterbot-i-want-to-build-a-chatbot-to-collaboratively-build-content-im-a-bit-overwhelmed-with-t/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4fc65f3c-fea0-4870-bb7b-2a67dec9da04>"
},
"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-12\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,
247,
248,
495,
496,
835,
836,
874,
875,
885,
899,
976,
996,
1016,
1036,
1096,
1113,
1114,
1272,
1273,
1288,
1367,
1423,
1498,
1499,
1506,
1507,
1519,
1520,
1807,
1808,
2109,
2110,
2139,
2140,
2165
],
"line_end_idx": [
247,
248,
495,
496,
835,
836,
874,
875,
885,
899,
976,
996,
1016,
1036,
1096,
1113,
1114,
1272,
1273,
1288,
1367,
1423,
1498,
1499,
1506,
1507,
1519,
1520,
1807,
1808,
2109,
2110,
2139,
2140,
2165,
2182
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2182,
"ccnet_original_nlines": 35,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.35791757702827454,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.041214749217033386,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20824295282363892,
"rps_doc_frac_unique_words": 0.4848484694957733,
"rps_doc_mean_word_length": 4.677685737609863,
"rps_doc_num_sentences": 39,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.8247151374816895,
"rps_doc_word_count": 363,
"rps_doc_frac_chars_dupe_10grams": 0.22968198359012604,
"rps_doc_frac_chars_dupe_5grams": 0.22968198359012604,
"rps_doc_frac_chars_dupe_6grams": 0.22968198359012604,
"rps_doc_frac_chars_dupe_7grams": 0.22968198359012604,
"rps_doc_frac_chars_dupe_8grams": 0.22968198359012604,
"rps_doc_frac_chars_dupe_9grams": 0.22968198359012604,
"rps_doc_frac_chars_top_2gram": 0.011778559535741806,
"rps_doc_frac_chars_top_3gram": 0.016489990055561066,
"rps_doc_frac_chars_top_4gram": 0.016489990055561066,
"rps_doc_books_importance": -216.26351928710938,
"rps_doc_books_importance_length_correction": -216.26351928710938,
"rps_doc_openwebtext_importance": -112.02941131591797,
"rps_doc_openwebtext_importance_length_correction": -112.02941131591797,
"rps_doc_wikipedia_importance": -103.48487091064453,
"rps_doc_wikipedia_importance_length_correction": -103.48487091064453
},
"fasttext": {
"dclm": 0.024514079093933105,
"english": 0.9272511005401611,
"fineweb_edu_approx": 1.0747697353363037,
"eai_general_math": 0.10803121328353882,
"eai_open_web_math": 0.07277780771255493,
"eai_web_code": 0.11858444660902023
}
}
|
{
"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": "006.3",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Cognitive science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "4",
"label": "Missing Images or Figures"
},
"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": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,412,858,006,491,237,000 |
TiviMatest Forum for https://tivimates.com
redjon
New member
Offline
i have just unlocked and all channels have stopped working in all my apps im getting error code 401 what does that mean
avery
Member
Offline
please can you dm me
If you have an old password try that I went on mine earlier it wasn’t working so I figured I’d try I don’t know why the old password that I still had put the old password inAnd the service started working but I was not getting any code mine is on a smart TV android
Coach
New member
Offline
Is there a particular settings or EPG playlist that would keep the tv guide updated. I use to see the information for the channels but I haven't in a few days. Any suggestions?
Last edited:
Rodger
Active member
Offline
Old post , but never answered ... So ... There are several choices in the settings on how often it updates .
RobM073
Member
Offline
Hi, is there an issue with tivimate? I’m in the UK and GSE on my iPad is working but tivimate is not on the firestick. Any ideas?
husham
Doctor, PHD
Staff member
Offline
Hi, is there an issue with tivimate? I’m in the UK and GSE on my iPad is working but tivimate is not on the firestick. Any ideas?
What error are you getting.
I'm using tivimate and everything working
Also make sure the playlist updated form the setting
husham
Doctor, PHD
Staff member
Offline
awesome darth maul GIF
beatle169
Member
Offline
i have just unlocked and all channels have stopped working in all my apps im getting error code 401 what does that mean
The 401 Unauthorized error is an HTTP status code that means the page you were trying to access cannot be loaded until you first log in with a valid user ID and password. If you have just logged in and received the 401 Unauthorized error, it means that the credentials you entered were invalid for some reason.
Pierre
New member
Offline
Hi. I can’t pay peminum with google pay, can I use another payment??
beatle169
Member
Offline
You need to pay for the premium service from TiviMate Companion, a stand alone app on google play, to unlock Premium functionality of TiviMate IPTV.
Pierre
New member
Offline
You need to pay for the premium service from TiviMate Companion, a stand alone app on google play, to unlock Premium functionality of TiviMate IPTV.
Ok, but Tivimate tell me to go to google pay and pay it there, and that’s not working. So, it’s that the only payment method you have? Sorry for my bad English.
༺Crystal༻
Husham’s Helper
Staff member
Offline
Ok, but Tivimate tell me to go to google pay and pay it there, and that’s not working. So, it’s that the only payment method you have? Sorry for my bad English.
It depends on what device you are using. If you are using an Amazon device..you MUST purchase it thru TiviMate Companion. If you are using a device other than Amazon’s..you can purchase it thru the Google Play Store. You must have an account with Google Play Store with a valid payment option registered to purchase it there.
Last edited:
Payam
New member
Offline
Hi
1. I can not find Tivimate companion on my Smart TV google play. Where can I install it on my tv to get premium? The only android device is my sony TV
2. in tivimate app I cann‘t type the ,@‚ in username field. So I can never do login.
can anybodey help me!!!
beatle169
Member
Offline
I had the same problem and signed up on my phone. If your phone is android, you can access the google play store, sign in using your gmail name & Password and search for it there.
husham
Doctor, PHD
Staff member
Offline
I had the same problem and signed up on my phone. If your phone is android, you can access the google play store, sign in using your gmail name & Password and search for it there.
Talk to him , he has iphone unfortuntley
beatle169
Member
Offline
Talk to him , he has iphone unfortuntley
I had to sign up on my iPhone. Trying to remember how I did it. I think I went to google chrome and googled “google play store”. When they came up, I searched for TiviMate Companion and signed up for premium. I hope that works for you you.
Top Bottom
|
{
"url": "https://forum.husham.com/threads/tivimatest-forum-for-https-tivimates-com.2151/",
"source_domain": "forum.husham.com",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "116935",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NH22OTMWKNH6W4DZUS5NX3VWNPUIAVQU",
"WARC-Concurrent-To": "<urn:uuid:dc9d5492-34d8-48a8-bce8-84e58fa2ee28>",
"WARC-Date": "2023-03-21T21:57:42Z",
"WARC-IP-Address": "172.67.69.239",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2P4SQE3IMROJT4ULTXLYEBIESJ2G76A5",
"WARC-Record-ID": "<urn:uuid:fcd47d99-30d6-4f59-a57b-98b4bdc04de3>",
"WARC-Target-URI": "https://forum.husham.com/threads/tivimatest-forum-for-https-tivimates-com.2151/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fc4b420b-b0c3-4f12-8a5a-379c18e8ee4a>"
},
"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-159\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,
43,
44,
51,
52,
63,
71,
191,
193,
194,
200,
201,
208,
216,
237,
503,
505,
506,
512,
513,
524,
532,
709,
711,
724,
725,
732,
733,
747,
755,
864,
866,
867,
875,
876,
883,
891,
1021,
1023,
1024,
1031,
1032,
1044,
1057,
1065,
1195,
1223,
1265,
1266,
1267,
1320,
1322,
1323,
1330,
1331,
1343,
1356,
1364,
1387,
1389,
1390,
1400,
1401,
1408,
1416,
1536,
1847,
1849,
1850,
1857,
1858,
1869,
1877,
1946,
1948,
1949,
1959,
1960,
1967,
1975,
2124,
2126,
2127,
2134,
2135,
2146,
2154,
2303,
2464,
2466,
2467,
2477,
2478,
2494,
2507,
2515,
2676,
3002,
3004,
3017,
3018,
3024,
3025,
3036,
3044,
3047,
3198,
3283,
3307,
3309,
3310,
3320,
3321,
3328,
3336,
3516,
3518,
3519,
3526,
3527,
3539,
3552,
3560,
3740,
3781,
3783,
3784,
3794,
3795,
3802,
3810,
3851,
4091,
4093
],
"line_end_idx": [
43,
44,
51,
52,
63,
71,
191,
193,
194,
200,
201,
208,
216,
237,
503,
505,
506,
512,
513,
524,
532,
709,
711,
724,
725,
732,
733,
747,
755,
864,
866,
867,
875,
876,
883,
891,
1021,
1023,
1024,
1031,
1032,
1044,
1057,
1065,
1195,
1223,
1265,
1266,
1267,
1320,
1322,
1323,
1330,
1331,
1343,
1356,
1364,
1387,
1389,
1390,
1400,
1401,
1408,
1416,
1536,
1847,
1849,
1850,
1857,
1858,
1869,
1877,
1946,
1948,
1949,
1959,
1960,
1967,
1975,
2124,
2126,
2127,
2134,
2135,
2146,
2154,
2303,
2464,
2466,
2467,
2477,
2478,
2494,
2507,
2515,
2676,
3002,
3004,
3017,
3018,
3024,
3025,
3036,
3044,
3047,
3198,
3283,
3307,
3309,
3310,
3320,
3321,
3328,
3336,
3516,
3518,
3519,
3526,
3527,
3539,
3552,
3560,
3740,
3781,
3783,
3784,
3794,
3795,
3802,
3810,
3851,
4091,
4093,
4103
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4103,
"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.4285714328289032,
"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.12060890346765518,
"rps_doc_frac_unique_words": 0.33152908086776733,
"rps_doc_mean_word_length": 4.327469348907471,
"rps_doc_num_sentences": 49,
"rps_doc_symbol_to_word_ratio": 0.002341920044273138,
"rps_doc_unigram_entropy": 4.995841979980469,
"rps_doc_word_count": 739,
"rps_doc_frac_chars_dupe_10grams": 0.3946216404438019,
"rps_doc_frac_chars_dupe_5grams": 0.43746089935302734,
"rps_doc_frac_chars_dupe_6grams": 0.43746089935302734,
"rps_doc_frac_chars_dupe_7grams": 0.4146341383457184,
"rps_doc_frac_chars_dupe_8grams": 0.3946216404438019,
"rps_doc_frac_chars_dupe_9grams": 0.3946216404438019,
"rps_doc_frac_chars_top_2gram": 0.06504064798355103,
"rps_doc_frac_chars_top_3gram": 0.025015629827976227,
"rps_doc_frac_chars_top_4gram": 0.018761729821562767,
"rps_doc_books_importance": -372.6394348144531,
"rps_doc_books_importance_length_correction": -372.6394348144531,
"rps_doc_openwebtext_importance": -208.17221069335938,
"rps_doc_openwebtext_importance_length_correction": -208.17221069335938,
"rps_doc_wikipedia_importance": -248.86428833007812,
"rps_doc_wikipedia_importance_length_correction": -248.86428833007812
},
"fasttext": {
"dclm": 0.029649080708622932,
"english": 0.9581828713417053,
"fineweb_edu_approx": 0.8541296124458313,
"eai_general_math": 0.0017290699761360884,
"eai_open_web_math": 0.040880318731069565,
"eai_web_code": 0.00016635999782010913
}
}
|
{
"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": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-582,524,976,875,482,800 |
OpenStack Cloud Automation using Node-Red
Introduction OpenStack is a private cloud computing (or public), that allows customers known as tenants, to provision cloud instances, volumes, and design networks based on tenant needs. During OpenStack operations that are performed by cloud administrators, and due to known limitations in OpenStack development, Automation is not an option anymore for any cloud provider. And being used by one form or another (e.g. scripts)in order to achieve cloud operation excellence. Node-Red Node-Red is a...
Continue reading...
Query Postgres database with RESTful API
Have you been in a situation that needs to access your Postgres data using API or automating your queries? Posting data to your database requires scripting friendly and robust method. Performing your query using only REST API URL and no SQL language involvement or experience needed, or building a workflow that quickly and professionally queries and posts to the database. in summary the main reasons that make you use API...
Continue reading...
Build Website in Synology NAS, Using DDNS and Port Forwarding
Recently I bought Synology NAS as a home network storage, and since then, I have been amazed by the possibilities of using my NAS. Other than data storage for files, media, system backups, I found services that provide the functionality to your networks like Router, DHCP, DNS., and other services for productivity like Dev tools, Web, Virtual Machines, Docker, and more. This is where it came to my mind the...
Continue reading...
Best Alfred Workflows
Alfred is a productivity application for macOS, which boosts your efficiency with hotkeys, keywords, and text expansion. Alfred community has developed thousands of workflows to help users to become more productive and shorten task time.Below is my favorite recommendation of Alfred workflows that I have been using almost every day. is saves a lot of time with other Alfred build-in functions like clipboard management. I have tested the below workflows,...
Continue reading...
|
{
"url": "https://creativecloudblog.info/",
"source_domain": "creativecloudblog.info",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "40974",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XTMJ3ELFQUWBYUVX7NRL3OHJITFDMVL7",
"WARC-Concurrent-To": "<urn:uuid:78600b01-9edc-45be-bf70-02208aef5cc4>",
"WARC-Date": "2022-07-05T00:11:52Z",
"WARC-IP-Address": "31.167.167.130",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:M7RIONWRXHMPJNYVNK2LRTTUURTKGYZR",
"WARC-Record-ID": "<urn:uuid:66df2c35-6f53-47b8-9eaf-7d42a2177e62>",
"WARC-Target-URI": "https://creativecloudblog.info/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ddc2bb5e-0c8f-4504-b14c-22fa8295f3ae>"
},
"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-185\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,
42,
43,
543,
544,
564,
565,
606,
607,
1034,
1035,
1055,
1056,
1118,
1119,
1531,
1532,
1552,
1553,
1575,
1576,
2035,
2036
],
"line_end_idx": [
42,
43,
543,
544,
564,
565,
606,
607,
1034,
1035,
1055,
1056,
1118,
1119,
1531,
1532,
1552,
1553,
1575,
1576,
2035,
2036,
2055
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2055,
"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.36533331871032715,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04800000041723251,
"rps_doc_frac_lines_end_with_ellipsis": 0.3478260934352875,
"rps_doc_frac_no_alph_words": 0.13866667449474335,
"rps_doc_frac_unique_words": 0.5822784900665283,
"rps_doc_mean_word_length": 5.246835231781006,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0.021333329379558563,
"rps_doc_unigram_entropy": 4.911909103393555,
"rps_doc_word_count": 316,
"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.03618818148970604,
"rps_doc_frac_chars_top_3gram": 0.010856449604034424,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -124.46204376220703,
"rps_doc_books_importance_length_correction": -124.46204376220703,
"rps_doc_openwebtext_importance": -79.57670593261719,
"rps_doc_openwebtext_importance_length_correction": -79.57670593261719,
"rps_doc_wikipedia_importance": -65.00973510742188,
"rps_doc_wikipedia_importance_length_correction": -65.00973510742188
},
"fasttext": {
"dclm": 0.02168196067214012,
"english": 0.9187067151069641,
"fineweb_edu_approx": 1.7143328189849854,
"eai_general_math": 0.018588239327073097,
"eai_open_web_math": 0.12496005743741989,
"eai_web_code": 0.1232573390007019
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
407,564,582,841,127,230 |
Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free.
I am working on python plugins.I used PyQt4 Designer. I want to list query result into QTreeWidget. My code is as follows:
c = self.db.con.cursor()
self.db._exec_sql(c, "select est from bio")
for row in c.fetchall():
item_value=unicode(row[0])
top_node1 = QTreeWidgetItem(item_value)
self.treeWidget.insertTopLevelItem(0, top_node1)
The query returns the values as:
enter image description here
But when i list these values into QTreeWidget using above code,it is shown as below :
enter image description here
Only first character is shown.If i change '0' to some other number in self.treeWidget.insertTopLevelItem(0, top_node1) ,nothing appears in QTreeWidget.
How do i do it???? thanx.
share|improve this question
2 Answers 2
up vote 2 down vote accepted
If you take a look at the documentation for a QTreeWidgetItem, you will see there are a number of possible constructors for creating an instance. Though none of which it seems you are using in a way that is going to give you desirable results. The closest match to the signature you are providing is:
QTreeWidgetItem ( const QStringList & strings, int type = Type )
What this is probably doing is taking your string (I am assuming row[0] is a string because I don't know which drivers you are using) and applying it as a sequence, which would fullfill the requiremets of QStringList. Thus what you are getting is populating multiple columns of your item with each letter of your string value. If this is what you wanted, then you would n eed to tell your widget to show more columns: self.treeWidget.setColumnCount(10). But this isn't what you are looking for I am sure.
More likely what you should be trying is to create a new item, then add the value to the desired column:
item = QTreeWidgetItem()
item.setText(0, unicode(row[0]))
self.treeWidget.insertTopLevelItem(0, item)
You can use the default constructor with no arguments, set the text value of the first column to your database record field value, and then add that item to the tree. You could also build up a list of the items and add them at once:
items = []
for row in c.fetchall():
item = QTreeWidgetItem()
item.setText(0, unicode(row[0]))
items.append(item)
self.treeWidget.insertTopLevelItems(0, items)
share|improve this answer
Thanx..:)..How do i make one item as parent of tree...??? I tried valestimate=QTreeWidgetItem(sel_estimate) self.treeWidget.__init__ (self,valestimate,items, type = QTreeWidgetItem.Type)...but it gives error. – poonam Jul 9 '12 at 6:22
1
Are you trying to call the init method on the tree? Dont do that. The only time that init method should be used directly is when you subclass the treewidget to make a custom one. QTreeWidgetItem has its own methods for adding children. Just create a new item with no args. Set it up. Then do parentItem.addChild(childItem). And very importand: read the docs riverbankcomputing.co.uk/static/Docs/PyQt4/html/… – jdi Jul 9 '12 at 14:57
Your first aproach could be corrected just add a list to the widgetitem not a string like this:
top_node1 = QTreeWidgetItem([item_value])
share|improve this answer
for top level items use: self.treeWidget.addTopLevelItems(items) – Macbeth Aug 3 '12 at 22:40
Welcome to Stack Overflow! Please have a look at how you can format your code and what other options you have to format your posts. Note that you can edit your own posts to add information that you forgot. I recommend you skim through this list of FAQs, and read some of them. Especially about answering and asking questions. – phant0m Aug 4 '12 at 14:37
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/11357783/python-query-result-in-qtreewidget",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-32",
"warc_metadata": {
"Content-Length": "80773",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:F2WA6LFKHYR53O27DTTF3AIICHDIWL2W",
"WARC-Concurrent-To": "<urn:uuid:5db3f2c3-deaa-4b8a-b4d8-aaf3d5e5bae4>",
"WARC-Date": "2015-08-04T22:27:27Z",
"WARC-IP-Address": "104.16.104.85",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:ARQW6WAC3POJQGBYHVFWHLDKWW6SV2QH",
"WARC-Record-ID": "<urn:uuid:b5657f5f-d1ff-4e64-be6e-609758b6a216>",
"WARC-Target-URI": "http://stackoverflow.com/questions/11357783/python-query-result-in-qtreewidget",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2e301faf-57d2-4b40-933b-d378de84dedd>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-236-191-2.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-32\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,
25,
131,
132,
255,
256,
281,
325,
350,
381,
425,
478,
479,
512,
513,
542,
543,
629,
630,
659,
660,
812,
813,
839,
840,
868,
869,
881,
882,
911,
912,
1213,
1214,
1279,
1280,
1785,
1786,
1891,
1892,
1917,
1950,
1994,
1995,
2228,
2229,
2240,
2265,
2294,
2331,
2354,
2400,
2426,
2431,
2668,
2672,
3106,
3107,
3203,
3204,
3246,
3247,
3273,
3278,
3373,
3378,
3736,
3737,
3749,
3750,
3752,
3760,
3761,
3839,
3840
],
"line_end_idx": [
25,
131,
132,
255,
256,
281,
325,
350,
381,
425,
478,
479,
512,
513,
542,
543,
629,
630,
659,
660,
812,
813,
839,
840,
868,
869,
881,
882,
911,
912,
1213,
1214,
1279,
1280,
1785,
1786,
1891,
1892,
1917,
1950,
1994,
1995,
2228,
2229,
2240,
2265,
2294,
2331,
2354,
2400,
2426,
2431,
2668,
2672,
3106,
3107,
3203,
3204,
3246,
3247,
3273,
3278,
3373,
3378,
3736,
3737,
3749,
3750,
3752,
3760,
3761,
3839,
3840,
3930
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3930,
"ccnet_original_nlines": 73,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37706854939460754,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00945626012980938,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2541371285915375,
"rps_doc_frac_unique_words": 0.47651007771492004,
"rps_doc_mean_word_length": 5.077181339263916,
"rps_doc_num_sentences": 63,
"rps_doc_symbol_to_word_ratio": 0.0035461001098155975,
"rps_doc_unigram_entropy": 5.2155537605285645,
"rps_doc_word_count": 596,
"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.009914079681038857,
"rps_doc_frac_chars_top_3gram": 0.005287509877234697,
"rps_doc_frac_chars_top_4gram": 0.011235959827899933,
"rps_doc_books_importance": -337.53875732421875,
"rps_doc_books_importance_length_correction": -337.53875732421875,
"rps_doc_openwebtext_importance": -211.01705932617188,
"rps_doc_openwebtext_importance_length_correction": -211.01705932617188,
"rps_doc_wikipedia_importance": -170.27871704101562,
"rps_doc_wikipedia_importance_length_correction": -170.27871704101562
},
"fasttext": {
"dclm": 0.09930682182312012,
"english": 0.7996472120285034,
"fineweb_edu_approx": 1.657214641571045,
"eai_general_math": 0.012025480158627033,
"eai_open_web_math": 0.07650256156921387,
"eai_web_code": 0.005588000174611807
}
}
|
{
"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": "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": "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
|
-864,995,235,170,308,200 |
Column: Media asset management evolution in broadcast production
By Straker Coniglio
Featured Column
View more columns from NewscastStudio contributors
Media asset management (MAM) systems have evolved from their roots as basic archive management systems through monolithic, large repositories to agile production and workflow orchestration tools that control and manage all media in a broadcast operation. While different systems embraced different operating systems and even different virtualization, they all have one thing in common: they are typically on-premises solutions where workflows are physically constrained by the location of media and the bandwidth in and out of the facility.
In recent years, media delivery has expanded into a networked array of distribution options, remote production hubs, off-site disaster recovery sites, and far-flung users. The tools and the workflows have struggled to keep pace with this pressure to evolve.
The cloud will set you free?
Cloud-based solutions seemed to be the holy grail to solve all workflow and connectivity challenges, but they created a whole new set of challenges. I break these down into three categories: Practical, Technical, and Financial.
Practical: Most media organizations have lots of legacy content, in a variety of different formats. Moving that into the cloud can be a monumental undertaking—for some organizations it is more than 50 years of content. In addition, they need to migrate from the on-premises system to the cloud system, including workflows, metadata, etc. There are numerous integrations with existing equipment – such as playout servers, newsroom systems, traffic and billing systems – that also need new interfaces to the MAM.
Technical: While the cloud is great for some tasks, there are limitations around bandwidth, latency, connectivity, and quality of service.
Advertisement
Financial: Many cloud providers use a business model where it is easy and cheap to get your content in, but expensive to get it out. There are hidden costs, as each transaction that happens in the cloud leaves the meter running. Every time a user clicks “play” or “transcode” or “restore from archive,” those transactions are added to the monthly bill. Shocked customers have reported seven-digit quarterly bills from their cloud provider.
The hybrid way
Another approach is to start with a system that is designed to support media workflows in both worlds. This hybrid approach gives media enterprises the best of both worlds. It provides a high-performance, cost-effective on-premises MAM system that can deliver the value and performance that is needed today. At the same time, it can move individual parts of the system to the cloud that makes the most sense.
Perhaps you want to start archiving new content to the cloud while keeping your legacy archive in house. Hybrid MAM can support this. For deliveries to external OTT sites, web delivery or social media, it makes sense to transcode and deliver that through a cloud-based service driven by a hybrid MAM system.
The key is that it is a single system able to ingest, manage, process, and deliver content regardless of the media’s physical location or the MAM system’s physical location. Hybrid MAM allows media enterprises to optimize their current workflows, cost models, and delivery capabilities without constraints. In that way, they can move those relevant services to the cloud when the practical, technical, and financial constraints align with their organization’s goals.
First step toward hybrid MAM
The first thing to do when considering a hybrid MAM is to find the right partner. At the broadcast level, this begins with finding the correct manufacturer. A solutions provider that has proven its work in the broadcast space—and in turn understands the needs of empowering broadcasters to manage their content—is a staunch ally as you seek to modernize and improve your workflow.
And, of course, ensure it is a manufacturer interested in a long-term partnership. One that will provide long-term support and surrounding technologies that can further improve your operations.
By evolving media asset management, and building the correct network of support, you set your organization up on a long term path to craft more stories, better told.
About
Straker Coniglio
Growing up in California and Hawaii, Straker Coniglio’s career trajectory started in elementary school when his father brought home an early ‘beta’ video camera. This early passion would ultimately lead to 2 Emmy Awards and help shape the roadmaps of some of the industry’s most recognized software products. The world’s first all-digital newsroom was constructed at KHNL where Straker was recruited to become chief editor. His work would air internationally on CNN, “The Today Show”, ESPN, and other international outlets. When a position opened up in Vizrt’s Media Asset Management APAC team, Straker jumped at it and now leads Vizrt’s global product management team responsible for Vizrt’s and NewTek’s product portfolios.
|
{
"url": "https://www.newscaststudio.com/2020/02/28/column-media-asset-management-evolution/",
"source_domain": "www.newscaststudio.com",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "259974",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4R6VLN52EIVLBIPQ35FWK3TLM56EMMOV",
"WARC-Concurrent-To": "<urn:uuid:15a5196f-e10b-421e-868f-5a14cbae2ac6>",
"WARC-Date": "2023-11-29T06:27:31Z",
"WARC-IP-Address": "162.159.135.42",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2Y3ZAMPKI2IXN346NCWKYMESULYWE6S3",
"WARC-Record-ID": "<urn:uuid:1ccab8f2-a2e6-4c85-8455-b52f9c6677d6>",
"WARC-Target-URI": "https://www.newscaststudio.com/2020/02/28/column-media-asset-management-evolution/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:99a26d74-9c42-46b9-968f-0dbdb21e1dd5>"
},
"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-154\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,
65,
66,
86,
87,
103,
104,
155,
156,
697,
698,
956,
957,
986,
987,
1215,
1216,
1727,
1728,
1867,
1868,
1882,
1883,
2323,
2324,
2339,
2340,
2749,
2750,
3058,
3059,
3526,
3527,
3556,
3557,
3938,
3939,
4133,
4134,
4300,
4301,
4307,
4324
],
"line_end_idx": [
65,
66,
86,
87,
103,
104,
155,
156,
697,
698,
956,
957,
986,
987,
1215,
1216,
1727,
1728,
1867,
1868,
1882,
1883,
2323,
2324,
2339,
2340,
2749,
2750,
3058,
3059,
3526,
3527,
3556,
3557,
3938,
3939,
4133,
4134,
4300,
4301,
4307,
4324,
5049
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5049,
"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.3776823878288269,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017167380079627037,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1384120136499405,
"rps_doc_frac_unique_words": 0.48655569553375244,
"rps_doc_mean_word_length": 5.307298183441162,
"rps_doc_num_sentences": 37,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.4037346839904785,
"rps_doc_word_count": 781,
"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.015440289862453938,
"rps_doc_frac_chars_top_3gram": 0.01930036023259163,
"rps_doc_frac_chars_top_4gram": 0.014475270174443722,
"rps_doc_books_importance": -388.64752197265625,
"rps_doc_books_importance_length_correction": -388.64752197265625,
"rps_doc_openwebtext_importance": -209.01107788085938,
"rps_doc_openwebtext_importance_length_correction": -209.01107788085938,
"rps_doc_wikipedia_importance": -148.72726440429688,
"rps_doc_wikipedia_importance_length_correction": -148.72726440429688
},
"fasttext": {
"dclm": 0.022219959646463394,
"english": 0.9446378350257874,
"fineweb_edu_approx": 1.7683483362197876,
"eai_general_math": 0.053702350705862045,
"eai_open_web_math": 0.13399511575698853,
"eai_web_code": 0.06122767925262451
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "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": "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": "15",
"label": "Nonfiction Writing"
}
},
"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
|
1,116,386,472,113,654,100 |
wood burning stoves 2.0
The moose likes Beginning Java and the fly likes do while help Big Moose Saloon
Search | Java FAQ | Recent Topics | Flagged Topics | Hot Topics | Zero Replies
Register / Login
JavaRanch » Java Forums » Java » Beginning Java
Bookmark "do while help" Watch "do while help" New topic
Author
do while help
hyderman
Greenhorn
Joined: Jun 03, 2004
Posts: 3
hi
i have a problem with do while in this code
public int find (int value)
{
int counter = 0;
Node tempNode = root;
do {
counter++;
if (value == tempNode.getValue() )
{
this.current = tempNode;
return counter;
}
else if (value < tempNode.getValue() )
{
tempNode = tempNode.getLeft();
//this.current = tempNode;
}
else
{
tempNode = tempNode.getRight();
//this.current = tempNode;
}
}
//current = null;
return -1 * counter;
} while (tempNode != null);
its not running and i am confused where is the problem here.
thanx
Igor Ko
Ranch Hand
Joined: Jun 24, 2002
Posts: 90
It is not do while problem...
In such case to check some logical process, see it in debuger,
or add printing (likes System.out.println("go to left..."))
for each logical brach, and then you easy can see how it is working...
Jeff Pavlocak
Greenhorn
Joined: Apr 26, 2004
Posts: 16
Can you print out the value of tempNode before you enter the do loop? This way you can see if it really is a null and not a problem with the logic in your loop.
Emmy Rauch
Greenhorn
Joined: Jul 07, 2004
Posts: 12
You seem to have an misplaced bracket first of all, I don't see how this could compile like that.
Assuming that bracket is removed, if the value is in the tree but not the node the code will return -1 every time because you have the return statement inside the do-while loop. If you fix these and still have a problem, post again.
Btw, you should indent and use the code tags when you post
Ernest Friedman-Hill
author and iconoclast
Marshal
Joined: Jul 08, 2003
Posts: 24189
34
I see various logical problems, but I'm not sure whether you're showing the whole method here, or whether part is cut off at the bottom, so I'm not exactly sure what to recommend.
It's hard to tell because of the lack of formatting, but there's an extra close bracket before the two lines
//current = null;
return -1 * counter;
and that extra bracket is going to keep this code from compiling.
A good programmer's editor or IDE can help you to find this kind of problem as you type. There are several excellent free Java IDEs (Eclipse, NetBeans) and editors like Emacs that would let you know about mistakes like this as soon as it happened. it's worth the small investment in time to learn to use one of these tools.
Finally, note that I've already pointed you to our naming policy once, and asked you to go here and update your display name. Please do so now, before posting again, or I'll have to close your account.
[Jess in Action][AskingGoodQuestions]
I agree. Here's the link: http://aspose.com/file-tools
subject: do while help
It's not a secret anymore!
|
{
"url": "http://www.coderanch.com/t/396802/java/java/",
"source_domain": "www.coderanch.com",
"snapshot_id": "crawl=CC-MAIN-2015-32",
"warc_metadata": {
"Content-Length": "32464",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:URBINFX7UK3MN4GHFSTVBYXT7VYRH3XR",
"WARC-Concurrent-To": "<urn:uuid:37b7330c-07af-44bd-8a88-75e34bb7e87c>",
"WARC-Date": "2015-08-02T22:50:25Z",
"WARC-IP-Address": "204.144.184.130",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:NMN7AMUKAJCS572DATBI5K2QH7UZWECU",
"WARC-Record-ID": "<urn:uuid:20050072-f142-4493-81c0-39bab97e3e25>",
"WARC-Target-URI": "http://www.coderanch.com/t/396802/java/java/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cbf373c0-dd8f-4819-b84b-a64ec8d2e5e0>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-236-191-2.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-32\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,
24,
104,
185,
202,
250,
307,
314,
315,
329,
330,
339,
349,
350,
371,
380,
383,
427,
428,
429,
457,
459,
460,
477,
499,
500,
505,
506,
517,
552,
554,
579,
595,
597,
636,
638,
669,
696,
698,
703,
705,
737,
764,
766,
768,
786,
807,
835,
836,
897,
898,
904,
912,
923,
924,
945,
955,
985,
986,
1049,
1109,
1180,
1194,
1204,
1205,
1226,
1236,
1397,
1408,
1418,
1419,
1440,
1450,
1451,
1549,
1782,
1841,
1862,
1884,
1892,
1893,
1914,
1927,
1932,
1937,
1938,
2118,
2119,
2228,
2229,
2247,
2268,
2269,
2335,
2336,
2660,
2661,
2863,
2864,
2865,
2903,
2905,
2960,
2962,
2985,
2987
],
"line_end_idx": [
24,
104,
185,
202,
250,
307,
314,
315,
329,
330,
339,
349,
350,
371,
380,
383,
427,
428,
429,
457,
459,
460,
477,
499,
500,
505,
506,
517,
552,
554,
579,
595,
597,
636,
638,
669,
696,
698,
703,
705,
737,
764,
766,
768,
786,
807,
835,
836,
897,
898,
904,
912,
923,
924,
945,
955,
985,
986,
1049,
1109,
1180,
1194,
1204,
1205,
1226,
1236,
1397,
1408,
1418,
1419,
1440,
1450,
1451,
1549,
1782,
1841,
1862,
1884,
1892,
1893,
1914,
1927,
1932,
1937,
1938,
2118,
2119,
2228,
2229,
2247,
2268,
2269,
2335,
2336,
2660,
2661,
2863,
2864,
2865,
2903,
2905,
2960,
2962,
2985,
2987,
3013
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3013,
"ccnet_original_nlines": 105,
"rps_doc_curly_bracket": 0.003318950068205595,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38067349791526794,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014641289599239826,
"rps_doc_frac_lines_end_with_ellipsis": 0.018867919221520424,
"rps_doc_frac_no_alph_words": 0.25622254610061646,
"rps_doc_frac_unique_words": 0.5168986320495605,
"rps_doc_mean_word_length": 4.497017860412598,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0.004392390139400959,
"rps_doc_unigram_entropy": 5.180935382843018,
"rps_doc_word_count": 503,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.022104330360889435,
"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.02166225016117096,
"rps_doc_frac_chars_top_3gram": 0.024314770475029945,
"rps_doc_frac_chars_top_4gram": 0.015915120020508766,
"rps_doc_books_importance": -312.98992919921875,
"rps_doc_books_importance_length_correction": -312.98992919921875,
"rps_doc_openwebtext_importance": -134.8134307861328,
"rps_doc_openwebtext_importance_length_correction": -134.8134307861328,
"rps_doc_wikipedia_importance": -117.17938232421875,
"rps_doc_wikipedia_importance_length_correction": -117.17938232421875
},
"fasttext": {
"dclm": 0.04510742053389549,
"english": 0.8850672841072083,
"fineweb_edu_approx": 1.7616106271743774,
"eai_general_math": 0.1519155502319336,
"eai_open_web_math": 0.2895299792289734,
"eai_web_code": 0.001595200039446354
}
}
|
{
"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": "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": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "3",
"label": "Incoherent Flow"
}
},
"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": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,545,023,684,552,112,000 |
Incompatibility of UiPath GUI framework with Borland Delphi 7
Hi,
I am trying to automate a process using a custom tool developed with Borland Delphi 7. Unfortunately, the GUI elements are not recognized by UiPath, although all other applications are.
Is there any way to check the compatibility between a tool developed with Borland Delphi 7 and UiPath? If not, can the Ui detection framework be changed and/or is there a way to make this application compatible with UiPath without re-coding it?
I will not be able to share the application for legal reasons.
Regards,
Nicolas
@NikRPA
May be the application is a JAVA based application. Just try installing JAVA extension available in the studio and check.Just a trial :slight_smile:
Hi. It is not a Java based application, hence this solution unfortunately doesn’t work :(.
@NikRPA:did you get any solution to automate the Delphi Applications if yes , Please let me know how can automate the Delphi based applications.
Regards
karthik
Please let me know if UIpath compatibility with Delphi
|
{
"url": "https://forum.uipath.com/t/incompatibility-of-uipath-gui-framework-with-borland-delphi-7/148184",
"source_domain": "forum.uipath.com",
"snapshot_id": "crawl=CC-MAIN-2020-40",
"warc_metadata": {
"Content-Length": "26416",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YUHMPO37M7TSUH2OOPIAFWFPHDU272Q6",
"WARC-Concurrent-To": "<urn:uuid:834a0876-6d5c-4bd2-bd45-69e361b8009b>",
"WARC-Date": "2020-09-29T13:52:30Z",
"WARC-IP-Address": "65.19.128.97",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:S6QJBEGL4KXTUEL43LEPE5SXERV5CQWP",
"WARC-Record-ID": "<urn:uuid:37d6bea9-17e8-4b4a-ae2c-0479c76cd73d>",
"WARC-Target-URI": "https://forum.uipath.com/t/incompatibility-of-uipath-gui-framework-with-borland-delphi-7/148184",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b682f05e-b220-4203-b717-95ebf547d476>"
},
"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-11.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,
62,
63,
67,
68,
254,
255,
500,
501,
564,
565,
574,
582,
583,
591,
592,
741,
742,
833,
834,
979,
980,
988,
996,
997
],
"line_end_idx": [
62,
63,
67,
68,
254,
255,
500,
501,
564,
565,
574,
582,
583,
591,
592,
741,
742,
833,
834,
979,
980,
988,
996,
997,
1051
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1051,
"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.4292929172515869,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.030303029343485832,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14141413569450378,
"rps_doc_frac_unique_words": 0.5357142686843872,
"rps_doc_mean_word_length": 5.023809432983398,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.2837748527526855,
"rps_doc_word_count": 168,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07345972210168839,
"rps_doc_frac_chars_dupe_6grams": 0.07345972210168839,
"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.03909952938556671,
"rps_doc_frac_chars_top_3gram": 0.06042654067277908,
"rps_doc_frac_chars_top_4gram": 0.06398104131221771,
"rps_doc_books_importance": -71.526123046875,
"rps_doc_books_importance_length_correction": -71.526123046875,
"rps_doc_openwebtext_importance": -42.772666931152344,
"rps_doc_openwebtext_importance_length_correction": -30.2008056640625,
"rps_doc_wikipedia_importance": -29.857826232910156,
"rps_doc_wikipedia_importance_length_correction": -29.857826232910156
},
"fasttext": {
"dclm": 0.024442609399557114,
"english": 0.8880258798599243,
"fineweb_edu_approx": 1.1381551027297974,
"eai_general_math": 0.5585053563117981,
"eai_open_web_math": 0.454434335231781,
"eai_web_code": 0.08159869909286499
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,066,818,990,877,274,000 |
7
I am installing new Sitecore9 on our dev server.
Our DBA team is concerned about why Sitecore DBs should have contained users?
From my understanding, it is just for using SIF framework.
We also got "DB has to be Contained" error while restoring Sitecore 9 DBs in another server.
Can we use SQL users after installation? We have our SQL on Amazon RDS. Appreciate if anyone can help me on this.
Thanks
12
The use of the "Contained Database User model" was introduced for very good reasons, and could be considered useful outside the realm of Sitecore.
You can read the article here and here published by Microsoft on it.
Traditional Login and User Model
The important principal is that both the login (in the master database) and the user (in the user database) must exist and be related to each other. This means that the connection to the user database has a dependency upon the login in the master database, and this limits the ability of the database to be moved to a different hosting SQL Server or Azure SQL Database server.
Contained Database User Model
In the contained database user model, the login in the master database is not present. Instead, the authentication process occurs at the user database, and the database user in the user database does not have an associated login in the master database....To connect as a contained database user, the connection string must always contain a parameter for the user database so that the Database Engine knows which database is responsible for managing the authentication process.
By reducing the ties to the instance of SQL Server, partially contained databases can be useful during failover when you use Always On availability groups.
Creating contained users enables the user to connect directly to the contained database. This is a very significant feature in high availability and disaster recovery scenarios such as in an Always On solution. If the users are contained users, in case of failover, people would be able to connect to the secondary without creating logins on the instance hosting the secondary. This provides an immediate benefit.
Conclusion
So if I understand this correctly, Sitecore made a good decision to do this since it simplifies the way they distribute the databases for on-premise and Azure instances. Given that this is a feature promoted by Microsoft, I recommend you help provide articles/documentation to the Database Administrators. I don't imagine Sitecore will provide an alternative approach so education will be your best stategy.
1
Can we use SQL users after installation?
I have outlined some ways to NOT use Contained Authentication in this other question on SSE:
Sitecore 9 installation using SQL active directory user
Why contained database users?
You should note, based on the details from that question, that Contained is an absolute requirement when using Azure. If you plan on going to Azure SQL, you will need to use contained database users. This is one of the reasons it has been introduced so that we can move towards practices that are current and "cloud-ready".
"DB has to be contained" error
Regarding your restore issue, you likely were restoring databases that already had contained users in them, which is why you would receive that error.
0
Amazon RDS supports contained databases. You will have to enable it in the parameter group instead of the sp_configure stored proc. See below screenshot: enter image description here
• 1
RDS is not supported by Sitecore support. – Brett Larson Oct 29 '18 at 22:12
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://sitecore.stackexchange.com/questions/13859/why-do-we-require-contained-database-for-sitecore-9/13860",
"source_domain": "sitecore.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2019-47",
"warc_metadata": {
"Content-Length": "152983",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HVEPHICOMMUHN7RKSMYBLYHA4IEE3KLF",
"WARC-Concurrent-To": "<urn:uuid:b29f2abf-a576-4fdb-9f65-7225f41453cc>",
"WARC-Date": "2019-11-20T22:45:46Z",
"WARC-IP-Address": "151.101.1.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LRANACH7VMGMVOPQZQHTCOHASVPNLFZX",
"WARC-Record-ID": "<urn:uuid:ef5fae69-1af9-4021-b242-91fd763ea441>",
"WARC-Target-URI": "https://sitecore.stackexchange.com/questions/13859/why-do-we-require-contained-database-for-sitecore-9/13860",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9e96b59b-b04b-4e01-837d-3cc3a1a48cf4>"
},
"warc_info": "isPartOf: CC-MAIN-2019-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-27.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
3,
52,
53,
131,
132,
191,
192,
285,
286,
400,
401,
408,
409,
412,
413,
560,
561,
630,
631,
664,
665,
1042,
1043,
1073,
1074,
1551,
1552,
1708,
1709,
2123,
2124,
2135,
2136,
2544,
2545,
2547,
2548,
2589,
2590,
2683,
2684,
2740,
2741,
2771,
2772,
3096,
3097,
3128,
3129,
3280,
3281,
3283,
3284,
3467,
3468,
3474,
3555,
3556,
3568,
3569,
3669,
3670
],
"line_end_idx": [
2,
3,
52,
53,
131,
132,
191,
192,
285,
286,
400,
401,
408,
409,
412,
413,
560,
561,
630,
631,
664,
665,
1042,
1043,
1073,
1074,
1551,
1552,
1708,
1709,
2123,
2124,
2135,
2136,
2544,
2545,
2547,
2548,
2589,
2590,
2683,
2684,
2740,
2741,
2771,
2772,
3096,
3097,
3128,
3129,
3280,
3281,
3283,
3284,
3467,
3468,
3474,
3555,
3556,
3568,
3569,
3669,
3670,
3760
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3760,
"ccnet_original_nlines": 63,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4265335202217102,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03138374164700508,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1226818785071373,
"rps_doc_frac_unique_words": 0.42028987407684326,
"rps_doc_mean_word_length": 4.872786045074463,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0.001426529954187572,
"rps_doc_unigram_entropy": 4.993172645568848,
"rps_doc_word_count": 621,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09881030768156052,
"rps_doc_frac_chars_dupe_6grams": 0.06576337665319443,
"rps_doc_frac_chars_dupe_7grams": 0.04163913056254387,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.013218769803643227,
"rps_doc_frac_chars_top_3gram": 0.02478519082069397,
"rps_doc_frac_chars_top_4gram": 0.021150030195713043,
"rps_doc_books_importance": -414.3805236816406,
"rps_doc_books_importance_length_correction": -414.3805236816406,
"rps_doc_openwebtext_importance": -219.2610626220703,
"rps_doc_openwebtext_importance_length_correction": -219.2610626220703,
"rps_doc_wikipedia_importance": -126.61861419677734,
"rps_doc_wikipedia_importance_length_correction": -126.61861419677734
},
"fasttext": {
"dclm": 0.23843514919281006,
"english": 0.9242033362388611,
"fineweb_edu_approx": 2.1480696201324463,
"eai_general_math": 0.03655964136123657,
"eai_open_web_math": 0.12313734740018845,
"eai_web_code": 0.036777619272470474
}
}
|
{
"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": "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": "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": "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
|
-4,105,663,793,670,562,000 |
他のゲーム
ゲームDL
閲覧数 4718 l 推奨数 41 l 2018.03.21 11:19
[Guide] Game Usage Policy [0]
Natara Lv. 2
• 5/100
Have a good day!
https://bs.visualshower.com/forum_en/572557
?
ショートカットキー
Prev前へ 書き込み
Next次へ 書き込み
大きく 小さく 上へ 下へ コメントに行く 印刷
?
ショートカットキー
Prev前へ 書き込み
Next次へ 書き込み
大きく 小さく 上へ 下へ コメントに行く 印刷
Hello, it's Natara.
We would like to inform you the general usage policy for Blustone.
1. Policies for Abnormal Use
<Basic Policy>
Acts that gain an
unfair advantage through bugs in the game or acts that directly damage the developers or indirectly damage other users are sanctioned.
<Specification of Sanctions>
1st: First warning, no access for one week, withdrawal of unfair goods
2nd: Permanent prohibition of account access (no separate announcement)
*Will take immediate restriction action if the act was excessive and several abusive exploits have been confirmed or circumstances have led the other user to take action.
2. Bluestone Community Terms of Use Violation
<Basic Policy>
Blustone aims to create a free community environment.
However, in order to maintain order in the community and to create a healthy atmosphere, sanctions may be imposed on those who violate the rules of use.
<Sanction Targets>
- Advertising adultery, harmful, hacking, and other illegal websites
- Posting an article on the Blustone homepage with an external URL link (that has no direct relation to the game)
- Posting an article on the Blustone homepage promoting or advertising materials with unknown sources
- Creating adult material, adult ads, and other sexually suggestive posts
- Will delete posts if we receive a removal request from another organization
- Disseminate false facts
- Spamming posts
- Slandering about someone or using abusive or inappropriate language
- Releasing personal information about
others or yourself
- Encouraging certain politicians or racist feelings
- GM Impersonation (e.g. including GM in nicknames)
- Attempting to make cash transactions or spot payments in exchange for
accounts or items
- Sharing virus or illegal data (illegal
apk files, sharing hacking or cracking methods, sharing music or films that have intellectual property rights)
- Causing inconvenience to other user’s communal activities (judged by management)
- Posting content that interrupts business activities such as denigrating or slandering the company or service
- Having an inappropriate profile picture, nickname or status message (will be deleted without notice)
<Specification of Sanctions>
- 1st warning: Individual warning
- 2nd warning: A week suspension from the community homepage (7 days)
- 3rd warning: A week suspension of your Blustone account (7 days)
- 4th warning: A month suspension of your Blustone account (30 days)
* However, if the violation is severe and the matter is judged to be serious, account restrictions will be applied immediately after the first warning.
* Terms of use may be added, modified, deleted depending on cases.
* In addition to the violations mentioned, other acts of sabotage are prohibited.
Thank you for reading.
List of Articles
番号 タイトル コメント数 投稿者 日付 閲覧数
お知らせ [Notice] Blustone 2 Wallpaper Part 21! "Clara, the Mail Administrator" Giveaway! [2] file 2 Natara 2020.03.31 76
お知らせ [Notice] Blustone 2 Wallpaper – Background Collection [3] 3 Natara 2020.01.23 276
お知らせ [Notice] Blustone Social Media Channel [0] file 0 Natara 2019.07.25 1387
» [Guide] Game Usage Policy [0] 0 Natara 2018.03.21 4718
3069 Ancient Outfits [3] 3 Uvo 2019.10.23 101
3068 Prawn’s Request (I have some work to do) [9] file 9 AIpha 2019.10.23 132
3067 Trancendence with a trancendence [5] 5 Kleivkas 2019.10.22 116
3066 Spoiler of mission if you dont want spoiler dont enter [5] file 5 USER2D1B29 2019.10.22 140
3065 Two Dinos is so bull [5] 5 Giveitortakeit 2019.10.21 125
3064 Misunderstanding [4] 4 빈신 2019.10.21 100
3063 Bouquet Tickets (???) [4] file 4 Miroslava 2019.10.21 110
3062 Why does FC do this to me [3] file 3 N4kZ 2019.10.20 109
3061 Help with Guild icon!!! [2] 2 QuantumSoda 2019.10.20 133
3060 Sheer luck, Hail to RNG. [0] file 0 Ehter 2019.10.19 95
3059 Cheater [11] 11 KYDERYDE 2019.10.18 195
3058 This can’t be correct somebody correct me [4] file 4 AIpha 2019.10.18 136
3057 [Notice] Blustone 2 Wallpaper Part 11! "Halloween Limited Hunter & Ancient Outfit" Giveaway! [4] file 4 Natara 2019.10.18 281
3056 My own limitation. [1] file 1 Nazure 2019.10.17 118
3055 The more the better [0] file 0 Average-Joe 2019.10.17 84
3054 Guild War team changes [0] 0 Audi4 2019.10.17 137
3053 Thank you Generous friends and newcomers! [0] file 0 AIpha 2019.10.16 130
3052 Who to choose [4] 4 빈신 2019.10.15 229
3051 Fan art bibi a little more dressed up [9] file 9 articwolf19 2019.10.15 145
3050 Trade Market? [1] 1 _Hasaky_ 2019.10.15 79
Board Pagination 1 ... 5 6 7 8 9 10 11 12 13 14 ... 163
/ 163
XE Login
|
{
"url": "https://bs.visualshower.com/index.php?mid=forum_en&l=jp&sort_index=regdate&order_type=desc&page=10&document_srl=572557",
"source_domain": "bs.visualshower.com",
"snapshot_id": "crawl=CC-MAIN-2020-16",
"warc_metadata": {
"Content-Length": "76261",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SLXEJ4JI6MPMBQTGCYRQ7XRPJRW4G67Q",
"WARC-Concurrent-To": "<urn:uuid:9e55714a-8441-48b9-8769-48733f808213>",
"WARC-Date": "2020-04-10T19:44:46Z",
"WARC-IP-Address": "52.68.119.4",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KNVRZB3FSWIO5GZFS3OMUPDTZWREX3WV",
"WARC-Record-ID": "<urn:uuid:2b88c0e0-8741-45d1-953e-88bb1a5aca9a>",
"WARC-Target-URI": "https://bs.visualshower.com/index.php?mid=forum_en&l=jp&sort_index=regdate&order_type=desc&page=10&document_srl=572557",
"WARC-Truncated": "disconnect",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:75205c86-ecbb-46ec-9285-384601a2e46d>"
},
"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-236.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,
6,
7,
13,
14,
57,
58,
90,
91,
108,
120,
141,
189,
195,
196,
210,
211,
227,
228,
244,
245,
274,
280,
281,
295,
296,
312,
313,
329,
330,
359,
360,
384,
390,
461,
462,
463,
496,
497,
503,
504,
523,
546,
685,
686,
687,
720,
795,
872,
1047,
1048,
1049,
1099,
1100,
1101,
1120,
1178,
1335,
1336,
1337,
1360,
1433,
1551,
1657,
1735,
1817,
1847,
1868,
1942,
1985,
2009,
2066,
2122,
2198,
2221,
2267,
2383,
2470,
2585,
2586,
2693,
2694,
2695,
2728,
2766,
2840,
2911,
2984,
2985,
2986,
3142,
3213,
3299,
3300,
3301,
3328,
3329,
3330,
3351,
3380,
3504,
3598,
3682,
3746,
3799,
3883,
3958,
4061,
4130,
4183,
4252,
4320,
4389,
4456,
4508,
4593,
4730,
4793,
4861,
4923,
5008,
5058,
5145,
5200,
5260,
5270
],
"line_end_idx": [
6,
7,
13,
14,
57,
58,
90,
91,
108,
120,
141,
189,
195,
196,
210,
211,
227,
228,
244,
245,
274,
280,
281,
295,
296,
312,
313,
329,
330,
359,
360,
384,
390,
461,
462,
463,
496,
497,
503,
504,
523,
546,
685,
686,
687,
720,
795,
872,
1047,
1048,
1049,
1099,
1100,
1101,
1120,
1178,
1335,
1336,
1337,
1360,
1433,
1551,
1657,
1735,
1817,
1847,
1868,
1942,
1985,
2009,
2066,
2122,
2198,
2221,
2267,
2383,
2470,
2585,
2586,
2693,
2694,
2695,
2728,
2766,
2840,
2911,
2984,
2985,
2986,
3142,
3213,
3299,
3300,
3301,
3328,
3329,
3330,
3351,
3380,
3504,
3598,
3682,
3746,
3799,
3883,
3958,
4061,
4130,
4183,
4252,
4320,
4389,
4456,
4508,
4593,
4730,
4793,
4861,
4923,
5008,
5058,
5145,
5200,
5260,
5270,
5282
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5282,
"ccnet_original_nlines": 125,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1866791695356369,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012195119634270668,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4446529150009155,
"rps_doc_frac_unique_words": 0.5648754835128784,
"rps_doc_mean_word_length": 4.960681438446045,
"rps_doc_num_sentences": 83,
"rps_doc_symbol_to_word_ratio": 0.0018761700484901667,
"rps_doc_unigram_entropy": 5.716203689575195,
"rps_doc_word_count": 763,
"rps_doc_frac_chars_dupe_10grams": 0.02536327950656414,
"rps_doc_frac_chars_dupe_5grams": 0.09564068913459778,
"rps_doc_frac_chars_dupe_6grams": 0.0449141301214695,
"rps_doc_frac_chars_dupe_7grams": 0.0449141301214695,
"rps_doc_frac_chars_dupe_8grams": 0.02536327950656414,
"rps_doc_frac_chars_dupe_9grams": 0.02536327950656414,
"rps_doc_frac_chars_top_2gram": 0.014795240014791489,
"rps_doc_frac_chars_top_3gram": 0.006340819876641035,
"rps_doc_frac_chars_top_4gram": 0.019022459164261818,
"rps_doc_books_importance": -418.3436279296875,
"rps_doc_books_importance_length_correction": -418.3436279296875,
"rps_doc_openwebtext_importance": -295.4790344238281,
"rps_doc_openwebtext_importance_length_correction": -295.4790344238281,
"rps_doc_wikipedia_importance": -151.355712890625,
"rps_doc_wikipedia_importance_length_correction": -151.355712890625
},
"fasttext": {
"dclm": 0.01940643973648548,
"english": 0.6408414840698242,
"fineweb_edu_approx": 1.4930373430252075,
"eai_general_math": 0.0025219900999218225,
"eai_open_web_math": 0.0685422420501709,
"eai_web_code": 0.012020230293273926
}
}
|
{
"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": "343.73",
"labels": {
"level_1": "Social sciences",
"level_2": "Law",
"level_3": "Criminal law"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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": "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
|
2,282,365,959,735,325,700 |
135
The Phase #2 of the burnination process described here, is completed and it has been decided that the tag should NOT be removed from the system, but instead the tag needs to be cleaned up and disambiguated. The tag is in the process of being curated. Please see the progress answer to keep track of progress.
I just discovered that we have a . This seems like a fairly useless meta tag to me, as it's generally used to indicate that the OP wants to have or remove an underscore from their output, and as such is no different from (for example).
1. Does it describe the contents of the questions to which it is applied? and is it unambiguous?
It seems like a fairly obvious meta tag to me. The entire wiki for the tag page is as follows.
The underscore, Unicode Character 'LOW LINE' (U+005F) shift + - on a keyboard.
2. Is the concept described even on-topic for the site?
In the loosest possible sense of the word, yes, apart from that No.
3. Does the tag add any meaningful information to the post?
I certainly can't find any information it could possibly add. I doubt there are many people who are subject matter experts in the matters of the underscore.
The only post that comes close to needing the tag is the top rated question for the tag that asks about the usage of __ (dunderscore) functions in Python, but even there it's mostly superfluous.
There are 2 followers and 149 questions.
4. Does it mean the same thing in all common contexts?
It could easily be confused with .
15
• 9
Thanks for posting this request and allowing the community to weigh in! Please note that burninating a tag is the process of carefully moderating a specific piece of Stack Overflow (please think twice before doing tag-only mass edits, as they can be counter-productive); once the community reaches a consensus, burnination can proceed. For more info, see What is the process for burninating tags?. – rene Aug 23 '16 at 19:58
• 9
double underscore seems equally redundant. Just a bunch of questions asking "why double underscores are used in situation X in language Y". The tag doesn't add anything. – dave Aug 24 '16 at 1:14
• 12
"...experts in the matters of the underscore" I use it regularly and know it fairly well. I can even find it with closed eyes. Is this sufficient to be an expert on it? – Trilarion Aug 24 '16 at 7:13
• 6
Apparently one can't search for _, so for questions like “what does the underscore mean in this context?” typing it literally won't help. But I think using the word instead of the symbol, as I did phrasing the question, would be more appropriate. And people who'd otherwise be using the tag might want to make sure that the word underscore occurs in their post. That aspect might be worth considering when removing occurrences of this tag. – MvG Aug 25 '16 at 11:57
• 1
Well, of course a Python developer doesn't care about underscore.js :P. I would say it might not be a bad idea to synonymize underscore with underscore.js and call it a day. – Heretic Monkey Aug 25 '16 at 14:49
• 5
@MikeMcCaughan Except that pretty much none of the answers currently using it are talking about underscore.js – 4castle Aug 26 '16 at 6:37
• 2
Yeah, obviously my reading skills need work because the OP is actually talking about underscores, with an s... – Heretic Monkey Aug 26 '16 at 13:34
• 2
This is not a meta tag. A meta tag describes the question itself -- for example [burninate-request] -- not the subject of the question. "underscore" would be a meta tag only if someone were to use it to indicate that the post should be emphasized somehow. – jscs Feb 18 '19 at 19:31
• Stats at the start of featuring: Q: +69/-3. A1 (neutral?!): +69/-1 – Bhargav Rao Feb 18 '19 at 20:02
• @BhargavRao: I am looking at this tag. Is there another tag for reserved name classes, because this seems to be what the tag is about. Hint: identifiers starting with one or more underscores are where reserved names live. – Joshua Feb 19 '19 at 4:17
• Actually I am also not so sure @Joshua. I am fine with having a tag for that. Also the dunder methods which the OP mentions is called magic methods, which has it's own tag, and is quite on topic... I guess a disambiguation is enough here, rather than a burn, but I am not able to find other valid usages of the underscore tag.. Feel free to add an answer with your views. (I probably will be adding an answer sometime later after reading up a bit and researching more). – Bhargav Rao Feb 19 '19 at 4:30
• 2
If one underscore isn't enough, you can always use double-underscores. – 1201ProgramAlarm Feb 19 '19 at 5:56
• 1
It looks like undersocres is also the name of a WordPress theme that already has its own tag. – Kara Feb 19 '19 at 17:06
• The tag wiki isn't even true for all keyboards. On French keyboards, the underscore is Shift+8. If the tag isn't burninated, it should be edited to say "on some keyboards" or something similar (or that part could be removed). – Donald Duck Feb 21 '19 at 13:36
• Stats at the end of featuring: Q: +145/-12. A1 (neutral?!): +102/-4 (deleted). A2 (asking to cleanup): +41/-17. A3 (Yes): +8/-12. A4 (asking to rename): +15/-4. A5 (asking to disambiguate): +28/-2. The community has voted against burninating the tag. However there is no clear consensus on what should be done. Given the top two answers are asking for cleanup/disambiguate, the middle path is to do both. The request as such is declined. If new evidence later warrants re-evaluation of this decision, a new proposal can be started. – Bhargav Rao Feb 22 '19 at 3:25
29
I agree with the answers of Joshua and Machavity that the tag requires just a disambiguation and a clean up. Some other tags which can be used instead of are:
and finally whatever we agree for the underscore character that is used to mention private methods. That will also be used for the sunder methods (single underscore).
There are a couple of usages of underscore, which I am not sure which tag is needed, or whether a tag is even needed:
• The usage of _ as in order to access the last value in the Python interpreter (I feel that it does not really require the tag).
• The usage of _ in order to separate literals in Python 3.6.
• For the wildcard variable _, which is used to ignore the value sent into it.
4
• 1
I think the use of _ in identifier names instead of Pascal or camel case falls into identifier and maybe coding-convention – Ben Voigt Feb 21 '19 at 5:03
• @Ben, I think using naming-conventions would be a better idea here. – Bhargav Rao Feb 21 '19 at 5:49
• That sounds good too. I just don't see the value in (1) separating case from other naming choices and (2) having made that separation, somehow throwing a punctuation choice into the case bucket – Ben Voigt Feb 21 '19 at 5:50
• 1
Hmm, that makes sense @BenVoigt. Now that I recheck the 6 questions in casing-conventions, that probably should be a synonym of naming-conventions as well. – Bhargav Rao Feb 21 '19 at 5:55
24
I say we save this tag. Sure, it looks like a rather lot of mess, but if you look closer you find some sanity to it.
This tag has a lot of meaning. Barring a few cases where the question is asking about collation, sorting, or codepoints, the good questions have a common theme. They're asking about special use of _ as a language form or convention in a particular language. The tag is meaningless without taking the language tag into account.
Partial summary:
C/C++: Leading _ symbols are reserved for internal globals, and __ is reserved for name mangling. As a consequence, _ can be safely be used for private members in almost all cases, but I don't see that much.
C#: _ appearing as a variable name for an out parameter means disregard; otherwise it's asking about coding conventions for which it occasionally borrows from C++ or uses leading _ to mean private member. It's also used as a comma surrogate in numeric literals.
Visual Basic: _ to mean private member is a well-regarded convention
Scala: some kind of scoped type hint
Python: hint for member "private" by convention
And on and on and on...
There are not too many questions, and we can actually clean this thing up really quickly where somebody tagged underscores while asking about the character as just another literal can have the tag removed and the rest remain. Of course the tag wiki needs to be updated. I propose:
This tag is for asking about the meaning or well-established convention of use of the underscore character in a language. Always include the language tag. For JavaScript, you probably mean for the library. For sort order, etc. you want .
Here we note that in making the questions involving syntactic punctuation (and indeed it's less than half naming conventions) discoverable is advantageous. Since someone who doesn't know the answer has only the syntax to go on, using a tag for the symbol name and the language name is a good idea.
17
• 4
I somewhat agree with this. I did check the questions and half of the _ stuff is related to private scope, which makes it unambiguous. However, _ is also used in relation to the underscore symbol, which is why your suggestion of a cleanup makes sense. Probably, underscore needs to be renamed as underscore-methods, and then syn'd to private-members, in order to prevent this misuse? – Bhargav Rao Feb 19 '19 at 4:38
• @BhargavRao: I'm not going to get into a debate this late at night; but that only covers half the scope and well I'd rather the tag be discoverable to someone who is asking the question. – Joshua Feb 19 '19 at 4:43
• Yeah, that's fine. There's no need to lose sleep over burns. – Bhargav Rao Feb 19 '19 at 5:17
• 3
@Joshua This is what a synonym is for. Type in underscore and find the new tag. The problem is the tag is too ambiguous as-is. If I want a regex to find the underscore character, my use is as valid as any you've mentioned here, while not really being the same thing. Relying on the excerpt is expecting people to self-police, a tactic that has not proven successful in the past ([seo] and [carbon] come to mind) – Machavity Feb 19 '19 at 13:45
• @Machavity: Bad questions have bad tags, but do good questions? – Joshua Feb 19 '19 at 14:34
• 2
@Joshua I think tags should be as intuitive as possible. While not all bad Qs are the result of tags, a confusing tag can lead to posting vague Qs (i.e. why [car] is now [r-car]). But you make a good point about usage, so straight burn is out. I've posted an answer that I think splits the difference, keeping the useful part of the tag while not encouraging people to post vague questions – Machavity Feb 19 '19 at 15:01
• 2
A small nitpick, but in Python the double-underscore triggers name mangling to avoid naming conflicts in subclasses also a single underscore in the interactive Python interpreter represents the result of the last executed statement. – iLoveTux Feb 19 '19 at 17:53
• 1
The tag is meaningless w/o taking the language tag into account. Doesn't that make it a meta-tag? – jpyams Feb 20 '19 at 23:32
• @jpyams: No. The meaning is reliably defined. – Joshua Feb 20 '19 at 23:39
• 1
From your examples here, it seems the two usages of underscores are either name mangling, or code conventions. So.. in the cases of name mangling, we should tag it as such. For cases of code conventions, the questions are likely to be off topic - and if not, don't need the underscore tag. – Rob Feb 21 '19 at 0:02
• 1
Unless things have changed since I last looked (which was 5+ years ago), a solo underscore is conventionally used for a value that will be ignored in Go (Go Language— golang.org). Whether it is sensible to tag a Go question with the underscores tag too is something I'd not want to pontificate on. – Jonathan Leffler Feb 21 '19 at 0:59
• In Visual Basic, _ is also the line-continuation character. – Peter Mortensen Feb 21 '19 at 2:28
• @PeterMortensen: Some of us are starting to see my point. There are so many more uses besides just naming conventions. – Joshua Feb 21 '19 at 2:38
• In kotlin _ is used to indicate an unused lambda parameter – Lino Feb 21 '19 at 11:54
• Thinking of a middle ground here. I think disambiguating the tag by retagging all the other usages of the tag which do not relate to the underscored-methods at first, and then deciding later what to do with the remaining questions (based on whether more than 75% of questions remain), would be the best way out here. – Bhargav Rao Feb 21 '19 at 19:02
12
I would suggest we do a cleanup and then rename the tag to [underscore-operator] (Bhargav's [underscore-methods] would seem to exclude special variable names). This helps to solve the root problem here, which is that there's two basic uses of the current tag
1. Questions where _ is an operator or signifier in a programming language. These are similar enough to warrant a tag
2. Questions where _ is part of a string. While these may be on-topic, we don't need a tag related to finding or using a specific character (where #1 doesn't apply). A clearer tag name would avoid this ambiguity
1
• 5
I am not sure about the renaming, because they are not usually "opeators" in the language (exc. Scala/Haskell/etc), they are usually syntacticly meaningful entities or conventions but without an "operation" meaning: e.g., referring to the _ in a C# 1_000_000 number as an operator would not be intuitive or meaningful, IMHO. – ssice Feb 20 '19 at 10:31
2
Progress:
The tag is in the process of being cleaned and disambiguated. You can help out by reviewing the questions with this tag, and retagging using the following observations:
• - for the dunder methods, like __str__, which are "magically" called when str is called.
• - For the _ method in .
• - for the Underscore.js related questions.
• - for the Underscores theme in WordPress.
• - for the usage of underscore in variable names and snake case, if warranted. In many cases, the can just be dropped.
• Leave the tag on the question if the question is related to the underscored methods (private members).
• Remove the tag in the other scenarios. (If you feel that a particular usage is prominent enough to require a separate tag, please leave a comment on this post).
Unsalvageable questions should just be flagged/closed.
If the question is not appropriate for this site, then don't worry about retagging;just flag/close the question it is attached to.
Ask for help if you need it.
If you have any questions about specific questions you come across, or the process in general, please feel free to leave a comment on this post. You can also drop into the SOCVR chat room for real-time advice and discussion.
-4
The only reason I can think of that it would be useful is, perhaps, helping people who search Google for underscore-related questions. It's hard to search for a literal _. But, people who would go to the trouble to use the underscore tag could just as easily type the word "underscore" in the question title or body to get visibility on Google.
You must log in to answer this question.
Not the answer you're looking for? Browse other questions tagged .
|
{
"url": "https://meta.stackoverflow.com/questions/333037/the-underscores-tag-is-in-the-process-of-being-cleaned?noredirect=1",
"source_domain": "meta.stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "206506",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QHOJ2WL72VIOH7X37ASEJX72EODCATNV",
"WARC-Concurrent-To": "<urn:uuid:3a34bfce-3696-4e8d-8cf1-714797ca94ab>",
"WARC-Date": "2021-02-25T06:07:03Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DJALTG27AOBKPUCWHXJHHUTUCKPSY43F",
"WARC-Record-ID": "<urn:uuid:d3683cd9-3e44-4001-bd03-ce3ca49a1ef7>",
"WARC-Target-URI": "https://meta.stackoverflow.com/questions/333037/the-underscores-tag-is-in-the-process-of-being-cleaned?noredirect=1",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f1c8fb4b-9ed4-4d68-a873-8c21a2b15038>"
},
"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-244.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,
4,
5,
314,
315,
316,
552,
553,
652,
653,
752,
753,
836,
837,
895,
896,
968,
969,
1031,
1032,
1193,
1194,
1393,
1394,
1439,
1440,
1497,
1498,
1537,
1538,
1541,
1547,
1976,
1982,
2182,
2189,
2393,
2399,
2869,
2875,
3090,
3096,
3239,
3245,
3397,
3403,
3690,
3795,
4049,
4556,
4562,
4675,
4681,
4806,
5070,
5639,
5642,
5643,
5802,
5803,
5970,
5971,
6089,
6090,
6222,
6286,
6367,
6369,
6375,
6533,
6638,
6867,
6873,
7066,
7069,
7070,
7187,
7188,
7515,
7516,
7533,
7534,
7742,
7743,
8005,
8006,
8075,
8076,
8113,
8114,
8162,
8163,
8187,
8188,
8469,
8470,
8708,
8709,
9007,
9008,
9011,
9017,
9438,
9657,
9755,
9761,
10209,
10306,
10312,
10738,
10744,
11012,
11018,
11149,
11228,
11234,
11553,
11559,
11899,
12000,
12151,
12241,
12596,
12599,
12600,
12859,
12860,
12980,
13194,
13196,
13202,
13559,
13561,
13562,
13572,
13573,
13742,
13743,
13836,
13864,
13911,
13957,
14079,
14186,
14351,
14352,
14407,
14408,
14539,
14540,
14569,
14570,
14795,
14796,
14799,
14800,
15145,
15146,
15187,
15188
],
"line_end_idx": [
4,
5,
314,
315,
316,
552,
553,
652,
653,
752,
753,
836,
837,
895,
896,
968,
969,
1031,
1032,
1193,
1194,
1393,
1394,
1439,
1440,
1497,
1498,
1537,
1538,
1541,
1547,
1976,
1982,
2182,
2189,
2393,
2399,
2869,
2875,
3090,
3096,
3239,
3245,
3397,
3403,
3690,
3795,
4049,
4556,
4562,
4675,
4681,
4806,
5070,
5639,
5642,
5643,
5802,
5803,
5970,
5971,
6089,
6090,
6222,
6286,
6367,
6369,
6375,
6533,
6638,
6867,
6873,
7066,
7069,
7070,
7187,
7188,
7515,
7516,
7533,
7534,
7742,
7743,
8005,
8006,
8075,
8076,
8113,
8114,
8162,
8163,
8187,
8188,
8469,
8470,
8708,
8709,
9007,
9008,
9011,
9017,
9438,
9657,
9755,
9761,
10209,
10306,
10312,
10738,
10744,
11012,
11018,
11149,
11228,
11234,
11553,
11559,
11899,
12000,
12151,
12241,
12596,
12599,
12600,
12859,
12860,
12980,
13194,
13196,
13202,
13559,
13561,
13562,
13572,
13573,
13742,
13743,
13836,
13864,
13911,
13957,
14079,
14186,
14351,
14352,
14407,
14408,
14539,
14540,
14569,
14570,
14795,
14796,
14799,
14800,
15145,
15146,
15187,
15188,
15254
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 15254,
"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.4087289869785309,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019758179783821106,
"rps_doc_frac_lines_end_with_ellipsis": 0.0062500000931322575,
"rps_doc_frac_no_alph_words": 0.25007373094558716,
"rps_doc_frac_unique_words": 0.29390019178390503,
"rps_doc_mean_word_length": 4.3005547523498535,
"rps_doc_num_sentences": 172,
"rps_doc_symbol_to_word_ratio": 0.00235919002443552,
"rps_doc_unigram_entropy": 5.67755651473999,
"rps_doc_word_count": 2705,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.041261930018663406,
"rps_doc_frac_chars_dupe_6grams": 0.041261930018663406,
"rps_doc_frac_chars_dupe_7grams": 0.02458523027598858,
"rps_doc_frac_chars_dupe_8grams": 0.00876815989613533,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.014441669918596745,
"rps_doc_frac_chars_top_3gram": 0.006619099993258715,
"rps_doc_frac_chars_top_4gram": 0.008510270155966282,
"rps_doc_books_importance": -1444.6807861328125,
"rps_doc_books_importance_length_correction": -1444.6807861328125,
"rps_doc_openwebtext_importance": -919.996826171875,
"rps_doc_openwebtext_importance_length_correction": -919.996826171875,
"rps_doc_wikipedia_importance": -589.452880859375,
"rps_doc_wikipedia_importance_length_correction": -589.452880859375
},
"fasttext": {
"dclm": 0.048371199518442154,
"english": 0.9443488717079163,
"fineweb_edu_approx": 1.610440969467163,
"eai_general_math": 0.9357585906982422,
"eai_open_web_math": 0.32368648052215576,
"eai_web_code": 0.4209650754928589
}
}
|
{
"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.04",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "Library science",
"level_3": "Library administration"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,722,863,769,752,300,000 |
blob: 0d35d8595dcc0f41a8bf5647081a9c4ac2670871 [file] [log] [blame]
module tapi-topology {
namespace "urn:onf:otcc:yang:tapi-topology";
prefix tapi-topology;
import tapi-common {
prefix tapi-common;
}
organization "ONF OTCC (Open Transport Configuration & Control) Project";
contact "
Project Web: <https://wiki.opennetworking.org/display/OTCC/TAPI>
Project List: <mailto:[email protected]>
Editor: Karthik Sethuraman
<mailto:[email protected]>";
description "
This module contains TAPI Topology Model definitions.
Source: TapiTopology.uml
- The TAPI YANG models included in this TAPI release are a *normative* part of the TAPI SDK.
- The YANG specifications have been generated from the corresponding UML model using the [ONF EAGLE UML2YANG mapping tool]
<https://github.com/OpenNetworkingFoundation/EagleUmlYang>
and further edited manually to comply with the [ONF IISOMI UML2YANG mapping guidelines]
<https://wiki.opennetworking.org/display/OIMT/UML+-+YANG+Guidelines>
- Status of YANG model artifacts can be determined by referring to the corresponding UML artifacts.
As described in the UML models, some artifacts are considered *experimental*, and thus the corresponding YANG artifacts.
- The ONF TAPI release process does not guarantee backward compatibility of YANG models across major versions of TAPI releases.
The YANG model backward compatibility criteria are outlined in section 11 of <https://tools.ietf.org/html/rfc7950>.
YANG models included in this release may not be backward compatible with previous TAPI releases.
Copyright (c) 2018 Open Networking Foundation (ONF). All rights reserved.
License: This module is distributed under the Apache License 2.0";
revision 2018-12-10 {
description "ONF Transport API version 2.1.1.
Changes included in this TAPI release (v2.1.1) are listed in
<https://github.com/OpenNetworkingFoundation/TAPI/blob/develop/CHANGE_LOG/change-log.2.1.1.md>";
reference "ONF-TR-527, ONF-TR-512, ONF-TR-531, RFC 7950, RFC 6087 and ONF TAPI UML model
<https://github.com/OpenNetworkingFoundation/TAPI/tree/v2.1.0/UML>";
}
revision 2018-10-16 {
description "ONF Transport API version 2.1.0.
Changes included in this TAPI release (v2.1.0) are listed in
<https://github.com/OpenNetworkingFoundation/TAPI/blob/develop/CHANGE_LOG/change-log.2.1.0.md>";
reference "ONF-TR-527, ONF-TR-512, ONF-TR-531, RFC 7950, RFC 6087 and ONF TAPI UML model
<https://github.com/OpenNetworkingFoundation/TAPI/tree/v2.1.0/UML>";
}
revision 2018-03-07 {
description "ONF Transport API version 2.0.2
This YANG module has been generated from the TAPI UML Model using the IISOMI-Eagle xmi2yang mapping tool.
Changes in this revision: <https://github.com/OpenNetworkingFoundation/TAPI/blob/develop/CHANGE_LOG/change-log.2.0.2.md>";
reference "ONF-TR-527, ONF-TR-512, ONF-TR-531, RFC 6020, RFC 6087 and ONF TAPI UML model
<https://github.com/OpenNetworkingFoundation/TAPI/tree/v2.0.2/UML>";
}
revision 2018-02-16 {
description "ONF Transport API version 2.0.1
This YANG module has been generated from the TAPI UML Model using the IISOMI-Eagle xmi2yang mapping tool.
Changes in this revision: <https://github.com/OpenNetworkingFoundation/TAPI/blob/develop/CHANGE_LOG/change-log.2.0.1.md>";
reference "ONF-TR-527, ONF-TR-512, ONF-TR-531, RFC 6020, RFC 6087 and ONF TAPI UML model
<https://github.com/OpenNetworkingFoundation/TAPI/tree/v2.0.1/UML>";
}
revision 2018-01-02 {
description "ONF Transport API version 2.0.0
This YANG module has been generated from the TAPI UML Model using the IISOMI-Eagle xmi2yang mapping tool.
Changes in this revision: <https://github.com/OpenNetworkingFoundation/TAPI/blob/develop/CHANGE_LOG/change-log.2.0.0.md>";
reference "ONF-TR-527, ONF-TR-512, ONF-TR-531, RFC 6020, RFC 6087 and ONF TAPI UML model
<https://github.com/OpenNetworkingFoundation/TAPI/tree/v2.0.0/UML>";
}
augment "/tapi-common:context" {
container topology-context {
uses topology-context;
description "Augments the base TAPI Context with TopologyService information";
}
description "Augments the base TAPI Context with TopologyService information";
}
/**************************
* definitions of refrences
**************************/
grouping topology-ref {
leaf topology-uuid {
type leafref {
path '/tapi-common:context/tapi-topology:topology-context/tapi-topology:topology/tapi-topology:uuid';
}
description "none";
}
description "none";
}
grouping link-ref {
uses topology-ref;
leaf link-uuid {
type leafref {
path '/tapi-common:context/tapi-topology:topology-context/tapi-topology:topology/tapi-topology:link/tapi-topology:uuid';
}
description "none";
}
description "none";
}
grouping node-ref {
uses topology-ref;
leaf node-uuid {
type leafref {
path '/tapi-common:context/tapi-topology:topology-context/tapi-topology:topology/tapi-topology:node/tapi-topology:uuid';
}
description "none";
}
description "none";
}
grouping node-edge-point-ref {
uses node-ref;
leaf node-edge-point-uuid {
type leafref {
path '/tapi-common:context/tapi-topology:topology-context/tapi-topology:topology/tapi-topology:node/tapi-topology:owned-node-edge-point/tapi-topology:uuid';
}
description "none";
}
description "none";
}
grouping node-rule-group-ref {
uses node-ref;
leaf node-rule-group-uuid {
type leafref {
path '/tapi-common:context/tapi-topology:topology-context/tapi-topology:topology/tapi-topology:node/tapi-topology:node-rule-group/tapi-topology:uuid';
}
description "none";
}
description "none";
}
/**************************
* package object-classes
**************************/
grouping link {
list node-edge-point {
uses node-edge-point-ref;
key 'topology-uuid node-uuid node-edge-point-uuid';
config false;
min-elements 2;
description "none";
}
leaf-list layer-protocol-name {
type tapi-common:layer-protocol-name;
config false;
min-elements 1;
description "none";
}
leaf direction {
type tapi-common:forwarding-direction;
config false;
description "The directionality of the Link.
Is applicable to simple Links where all LinkEnds are BIDIRECTIONAL (the Link will be BIDIRECTIONAL) or UNIDIRECTIONAL (the Link will be UNIDIRECTIONAL).
Is not present in more complex cases.";
}
container resilience-type {
uses resilience-type;
description "none";
}
uses tapi-common:resource-spec;
uses tapi-common:admin-state-pac;
uses tapi-common:capacity-pac;
uses transfer-cost-pac;
uses transfer-integrity-pac;
uses transfer-timing-pac;
uses risk-parameter-pac;
uses validation-pac;
uses layer-protocol-transition-pac;
description "The Link object class models effective adjacency between two or more ForwardingDomains (FD). ";
}
grouping node {
list owned-node-edge-point {
key 'uuid';
config false;
uses node-edge-point;
description "none";
}
list aggregated-node-edge-point {
uses node-edge-point-ref;
key 'topology-uuid node-uuid node-edge-point-uuid';
config false;
description "none";
}
list node-rule-group {
key 'uuid';
uses node-rule-group;
description "none";
}
container encap-topology {
uses topology-ref;
config false;
description "none";
}
leaf-list layer-protocol-name {
type tapi-common:layer-protocol-name;
config false;
min-elements 1;
description "none";
}
uses tapi-common:resource-spec;
uses tapi-common:admin-state-pac;
uses tapi-common:capacity-pac;
uses transfer-cost-pac;
uses transfer-integrity-pac;
uses transfer-timing-pac;
description "The ForwardingDomain (FD) object class models the ForwardingDomain topological component which is used to effect forwarding of transport characteristic information and offers the potential to enable forwarding.
At the lowest level of recursion, an FD (within a network element (NE)) represents a switch matrix (i.e., a fabric). Note that an NE can encompass multiple switch matrices (FDs). ";
}
grouping topology {
list node {
key 'uuid';
config false;
uses node;
description "none";
}
list link {
key 'uuid';
config false;
uses link;
description "none";
}
leaf-list layer-protocol-name {
type tapi-common:layer-protocol-name;
config false;
min-elements 1;
description "none";
}
uses tapi-common:resource-spec;
description "The ForwardingDomain (FD) object class models the ForwardingDomain topological component which is used to effect forwarding of transport characteristic information and offers the potential to enable forwarding.
At the lowest level of recursion, an FD (within a network element (NE)) represents a switch matrix (i.e., a fabric). Note that an NE can encompass multiple switch matrices (FDs). ";
}
grouping layer-protocol-transition-pac {
leaf-list transitioned-layer-protocol-name {
type string;
min-elements 2;
description "Provides the ordered structure of layer protocol transitions encapsulated in the TopologicalEntity. The ordering relates to the LinkPort role.";
}
description "Relevant for a Link that is formed by abstracting one or more LTPs (in a stack) to focus on the flow and deemphasize the protocol transformation.
This abstraction is relevant when considering multi-layer routing.
The layer protocols of the LTP and the order of their application to the signal is still relevant and need to be accounted for. This is derived from the LTP spec details.
This Pac provides the relevant abstractions of the LTPs and provides the necessary association to the LTPs involved.
Links that included details in this Pac are often referred to as Transitional Links.";
}
grouping node-edge-point {
leaf layer-protocol-name {
type tapi-common:layer-protocol-name;
config false;
description "none";
}
leaf-list supported-cep-layer-protocol-qualifier {
type tapi-common:layer-protocol-qualifier;
min-elements 1;
description "none";
}
list aggregated-node-edge-point {
uses node-edge-point-ref;
key 'topology-uuid node-uuid node-edge-point-uuid';
config false;
description "none";
}
list mapped-service-interface-point {
uses tapi-common:service-interface-point-ref;
key 'service-interface-point-uuid';
config false;
description "NodeEdgePoint mapped to more than ServiceInterfacePoint (slicing/virtualizing) or a ServiceInterfacePoint mapped to more than one NodeEdgePoint (load balancing/Resilience) should be considered experimental";
}
leaf link-port-direction {
type tapi-common:port-direction;
config false;
description "The orientation of defined flow at the LinkEnd.";
}
leaf link-port-role {
type tapi-common:port-role;
config false;
description "Each LinkEnd of the Link has a role (e.g., symmetric, hub, spoke, leaf, root) in the context of the Link with respect to the Link function. ";
}
uses tapi-common:resource-spec;
uses tapi-common:admin-state-pac;
uses tapi-common:termination-pac;
uses tapi-common:capacity-pac;
description "The LogicalTerminationPoint (LTP) object class encapsulates the termination and adaptation functions of one or more transport layers.
The structure of LTP supports all transport protocols including circuit and packet forms.";
}
grouping risk-parameter-pac {
list risk-characteristic {
key 'risk-characteristic-name';
config false;
min-elements 1;
uses risk-characteristic;
description "A list of risk characteristics for consideration in an analysis of shared risk. Each element of the list represents a specific risk consideration.";
}
description "The risk characteristics of a TopologicalEntity come directly from the underlying physical realization.
The risk characteristics propagate from the physical realization to the client and from the server layer to the client layer, this propagation may be modified by protection.
A TopologicalEntity may suffer degradation or failure as a result of a problem in a part of the underlying realization.
The realization can be partitioned into segments which have some relevant common failure modes.
There is a risk of failure/degradation of each segment of the underlying realization.
Each segment is a part of a larger physical/geographical unit that behaves as one with respect to failure (i.e. a failure will have a high probability of impacting the whole unit (e.g. all cables in the same duct).
Disruptions to that larger physical/geographical unit will impact (cause failure/errors to) all TopologicalEntities that use any part of that larger physical/geographical entity.
Any TopologicalEntity that uses any part of that larger physical/geographical unit will suffer impact and hence each TopologicalEntity shares risk.
The identifier of each physical/geographical unit that is involved in the realization of each segment of a Topological entity can be listed in the RiskParameter_Pac of that TopologicalEntity.
A segment has one or more risk characteristic.
Shared risk between two TopologicalEntities compromises the integrity of any solution that use one of those TopologicalEntity as a backup for the other.
Where two TopologicalEntities have a common risk characteristic they have an elevated probability of failing simultaneously compared to two TopologicalEntities that do not share risk characteristics.";
}
grouping transfer-cost-pac {
list cost-characteristic {
key 'cost-name';
config false;
min-elements 1;
uses cost-characteristic;
description "The list of costs where each cost relates to some aspect of the TopologicalEntity.";
}
description "The cost characteristics of a TopologicalEntity not necessarily correlated to the cost of the underlying physical realization.
They may be quite specific to the individual TopologicalEntity e.g. opportunity cost. Relates to layer capacity
There may be many perspectives from which cost may be considered for a particular TopologicalEntity and hence many specific costs and potentially cost algorithms.
Using an entity will incur a cost. ";
}
grouping transfer-integrity-pac {
leaf error-characteristic {
type string;
config false;
description "Describes the degree to which the signal propagated can be errored.
Applies to TDM systems as the errored signal will be propagated and not packet as errored packets will be discarded.";
}
leaf loss-characteristic {
type string;
config false;
description "Describes the acceptable characteristic of lost packets where loss may result from discard due to errors or overflow.
Applies to packet systems and not TDM (as for TDM errored signals are propagated unless grossly errored and overflow/underflow turns into timing slips).";
}
leaf repeat-delivery-characteristic {
type string;
config false;
description "Primarily applies to packet systems where a packet may be delivered more than once (in fault recovery for example).
It can also apply to TDM where several frames may be received twice due to switching in a system with a large differential propagation delay.";
}
leaf delivery-order-characteristic {
type string;
config false;
description "Describes the degree to which packets will be delivered out of sequence.
Does not apply to TDM as the TDM protocols maintain strict order.";
}
leaf unavailable-time-characteristic {
type string;
config false;
description "Describes the duration for which there may be no valid signal propagated.";
}
leaf server-integrity-process-characteristic {
type string;
config false;
description "Describes the effect of any server integrity enhancement process on the characteristics of the TopologicalEntity.";
}
description "Transfer intergrity characteristic covers expected/specified/acceptable characteristic of degradation of the transfered signal.
It includes all aspects of possible degradation of signal content as well as any damage of any form to the total TopologicalEntity and to the carried signals.
Note that the statement is of total impact to the TopologicalEntity so any partial usage of the TopologicalEntity (e.g. a signal that does not use full capacity) will only suffer its portion of the impact.";
}
grouping transfer-timing-pac {
list latency-characteristic {
key 'traffic-property-name';
config false;
min-elements 1;
uses latency-characteristic;
description "The effect on the latency of a queuing process. This only has significant effect for packet based systems and has a complex characteristic.";
}
description "A TopologicalEntity will suffer effects from the underlying physical realization related to the timing of the information passed by the TopologicalEntity.";
}
grouping validation-pac {
list validation-mechanism {
key 'validation-mechanism';
config false;
min-elements 1;
uses validation-mechanism;
description "Provides details of the specific validation mechanism(s) used to confirm the presence of an intended topologicalEntity.";
}
description "Validation covers the various adjacenct discovery and reachability verification protocols. Also may cover Information source and degree of integrity.";
}
grouping network-topology-service {
list topology {
uses topology-ref;
key 'topology-uuid';
config false;
description "none";
}
uses tapi-common:service-spec;
description "none";
}
grouping topology-context {
container nw-topology-service {
config false;
uses network-topology-service;
description "none";
}
list topology {
key 'uuid';
config false;
uses topology;
description "none";
}
description "none";
}
grouping inter-rule-group {
list rule {
key 'local-id';
min-elements 1;
uses rule;
description "none";
}
list associated-node-rule-group {
uses node-rule-group-ref;
key 'topology-uuid node-uuid node-rule-group-uuid';
min-elements 2;
description "none";
}
uses tapi-common:resource-spec;
uses tapi-common:capacity-pac;
uses transfer-cost-pac;
uses transfer-timing-pac;
uses risk-parameter-pac;
description "none";
}
grouping node-rule-group {
list rule {
key 'local-id';
min-elements 1;
uses rule;
description "none";
}
list node-edge-point {
uses node-edge-point-ref;
key 'topology-uuid node-uuid node-edge-point-uuid';
min-elements 1;
description "none";
}
list composed-rule-group {
uses node-rule-group-ref;
key 'topology-uuid node-uuid node-rule-group-uuid';
description "none";
}
list inter-rule-group {
key 'uuid';
uses inter-rule-group;
description "none";
}
uses tapi-common:resource-spec;
uses tapi-common:capacity-pac;
uses transfer-cost-pac;
uses transfer-timing-pac;
uses risk-parameter-pac;
description "none";
}
grouping rule {
leaf rule-type {
type rule-type;
description "none";
}
leaf forwarding-rule {
type forwarding-rule;
description "none";
}
leaf override-priority {
type uint64;
description "none";
}
uses tapi-common:local-class;
description "none";
}
/**************************
* package type-definitions
**************************/
grouping cost-characteristic {
leaf cost-name {
type string;
description "The cost characteristic will related to some aspect of the TopologicalEntity (e.g. $ cost, routing weight). This aspect will be conveyed by the costName.";
}
leaf cost-value {
type string;
description "The specific cost.";
}
leaf cost-algorithm {
type string;
description "The cost may vary based upon some properties of the TopologicalEntity. The rules for the variation are conveyed by the costAlgorithm.";
}
description "The information for a particular cost characteristic.";
}
grouping latency-characteristic {
leaf traffic-property-name {
type string;
description "The identifier of the specific traffic property to which the queuing latency applies.";
}
leaf fixed-latency-characteristic {
type string;
config false;
description "A TopologicalEntity suffers delay caused by the realization of the servers (e.g. distance related; FEC encoding etc.) along with some client specific processing. This is the total average latency effect of the TopologicalEntity";
}
leaf queing-latency-characteristic {
type string;
description "The specific queuing latency for the traffic property.";
}
leaf jitter-characteristic {
type string;
config false;
description "High frequency deviation from true periodicity of a signal and therefore a small high rate of change of transfer latency.
Applies to TDM systems (and not packet).";
}
leaf wander-characteristic {
type string;
config false;
description "Low frequency deviation from true periodicity of a signal and therefore a small low rate of change of transfer latency.
Applies to TDM systems (and not packet).";
}
description "Provides information on latency characteristic for a particular stated trafficProperty.";
}
grouping risk-characteristic {
leaf risk-characteristic-name {
type string;
description "The name of the risk characteristic. The characteristic may be related to a specific degree of closeness.
For example a particular characteristic may apply to failures that are localized (e.g. to one side of a road) where as another characteristic may relate to failures that have a broader impact (e.g. both sides of a road that crosses a bridge).
Depending upon the importance of the traffic being routed different risk characteristics will be evaluated.";
}
leaf-list risk-identifier-list {
type string;
min-elements 1;
description "A list of the identifiers of each physical/geographic unit (with the specific risk characteristic) that is related to a segment of the TopologicalEntity.";
}
description "The information for a particular risk characteristic where there is a list of risk identifiers related to that characteristic.";
}
grouping validation-mechanism {
leaf validation-mechanism {
type string;
description "Name of mechanism used to validate adjacency";
}
leaf layer-protocol-adjacency-validated {
type string;
description "State of validatiion";
}
leaf validation-robustness {
type string;
description "Quality of validation (i.e. how likely is the stated validation to be invalid)";
}
description "Identifies the validation mechanism and describes the characteristics of that mechanism";
}
typedef forwarding-rule {
type enumeration {
enum MAY_FORWARD_ACROSS_GROUP {
description "none";
}
enum MUST_FORWARD_ACROSS_GROUP {
description "none";
}
enum CANNOT_FORWARD_ACROSS_GROUP {
description "none";
}
enum NO_STATEMENT_ON_FORWARDING {
description "none";
}
}
description "none";
}
typedef rule-type {
type enumeration {
enum FORWARDING {
description "none";
}
enum CAPACITY {
description "none";
}
enum COST {
description "none";
}
enum TIMING {
description "none";
}
enum RISK {
description "none";
}
enum GROUPING {
description "none";
}
}
description "none";
}
grouping resilience-type {
leaf restoration-policy {
type restoration-policy;
description "none";
}
leaf protection-type {
type protection-type;
description "none";
}
description "none";
}
typedef restoration-policy {
type enumeration {
enum PER_DOMAIN_RESTORATION {
description "none";
}
enum END_TO_END_RESTORATION {
description "none";
}
enum NA {
description "none";
}
}
description "none";
}
typedef protection-type {
type enumeration {
enum NO_PROTECTON {
description "none";
}
enum ONE_PLUS_ONE_PROTECTION {
description "none";
}
enum ONE_PLUS_ONE_PROTECTION_WITH_DYNAMIC_RESTORATION {
description "none";
}
enum PERMANENT_ONE_PLUS_ONE_PROTECTION {
description "none";
}
enum ONE_FOR_ONE_PROTECTION {
description "none";
}
enum DYNAMIC_RESTORATION {
description "none";
}
enum PRE_COMPUTED_RESTORATION {
description "none";
}
}
description "none";
}
/**************************
* package interfaces
**************************/
rpc get-topology-details {
description "none";
input {
leaf topology-id-or-name {
type string;
description "none";
}
}
output {
container topology {
uses topology;
description "none";
}
}
}
rpc get-node-details {
description "none";
input {
leaf topology-id-or-name {
type string;
description "none";
}
leaf node-id-or-name {
type string;
description "none";
}
}
output {
container node {
uses node;
description "none";
}
}
}
rpc get-node-edge-point-details {
description "none";
input {
leaf topology-id-or-name {
type string;
description "none";
}
leaf node-id-or-name {
type string;
description "none";
}
leaf ep-id-or-name {
type string;
description "none";
}
}
output {
container node-edge-point {
uses node-edge-point;
description "none";
}
}
}
rpc get-link-details {
description "none";
input {
leaf topology-id-or-name {
type string;
description "none";
}
leaf link-id-or-name {
type string;
description "none";
}
}
output {
container link {
uses link;
description "none";
}
}
}
rpc get-topology-list {
description "none";
output {
list topology {
key 'uuid';
uses topology;
description "none";
}
}
}
}
|
{
"url": "https://gerrit.onosproject.org/plugins/gitiles/onos/+/e1b8cb8f10d68a192ae4a0ea23f44b84efd869fa/models/tapi/src/main/yang/tapi-topology%402018-12-10.yang",
"source_domain": "gerrit.onosproject.org",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "273495",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MAVY3L7ZYWWAXLP4BPVYRXLGAVMVXC6K",
"WARC-Concurrent-To": "<urn:uuid:ebf07cce-5ce2-4b61-96d7-86a51b2b0cdc>",
"WARC-Date": "2023-02-07T15:37:11Z",
"WARC-IP-Address": "52.36.190.103",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7QHSYWT65PDX64U2DJBSSAUYQTN553YW",
"WARC-Record-ID": "<urn:uuid:e96d2f5e-fbc3-4068-99ae-a273497ba3f0>",
"WARC-Target-URI": "https://gerrit.onosproject.org/plugins/gitiles/onos/+/e1b8cb8f10d68a192ae4a0ea23f44b84efd869fa/models/tapi/src/main/yang/tapi-topology%402018-12-10.yang",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:10ece623-6287-4096-85dc-57aef907635b>"
},
"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-56\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,
68,
91,
136,
158,
179,
199,
201,
275,
285,
350,
406,
433,
473,
487,
541,
566,
659,
782,
841,
929,
998,
1098,
1219,
1347,
1463,
1560,
1634,
1701,
1723,
1769,
1830,
1927,
2016,
2085,
2087,
2109,
2155,
2216,
2313,
2402,
2471,
2473,
2495,
2540,
2646,
2769,
2858,
2927,
2929,
2951,
2996,
3102,
3225,
3314,
3383,
3385,
3407,
3452,
3558,
3681,
3770,
3839,
3841,
3874,
3903,
3926,
4005,
4007,
4086,
4088,
4116,
4143,
4171,
4195,
4216,
4231,
4333,
4335,
4355,
4357,
4377,
4379,
4399,
4418,
4435,
4450,
4571,
4573,
4593,
4595,
4615,
4617,
4637,
4656,
4673,
4688,
4809,
4811,
4831,
4833,
4853,
4855,
4886,
4901,
4929,
4944,
5101,
5103,
5123,
5125,
5145,
5147,
5178,
5193,
5221,
5236,
5387,
5389,
5409,
5411,
5431,
5433,
5461,
5486,
5514,
5530,
5553,
5579,
5631,
5645,
5661,
5681,
5683,
5715,
5753,
5767,
5783,
5803,
5805,
5822,
5861,
5875,
5920,
6073,
6113,
6115,
6143,
6165,
6185,
6187,
6219,
6253,
6284,
6308,
6337,
6363,
6388,
6409,
6445,
6554,
6556,
6572,
6601,
6613,
6627,
6649,
6669,
6671,
6705,
6731,
6783,
6797,
6817,
6819,
6842,
6854,
6876,
6896,
6898,
6925,
6944,
6958,
6978,
6980,
7012,
7050,
7064,
7080,
7100,
7102,
7134,
7168,
7199,
7223,
7252,
7278,
7502,
7684,
7686,
7706,
7718,
7730,
7744,
7755,
7775,
7777,
7789,
7801,
7815,
7826,
7846,
7848,
7880,
7918,
7932,
7948,
7968,
7970,
8002,
8226,
8408,
8410,
8451,
8496,
8509,
8525,
8683,
8685,
8844,
8911,
9082,
9199,
9286,
9288,
9315,
9342,
9380,
9394,
9414,
9416,
9467,
9510,
9526,
9546,
9548,
9582,
9608,
9660,
9674,
9694,
9696,
9734,
9780,
9816,
9830,
10051,
10053,
10080,
10113,
10127,
10190,
10192,
10214,
10242,
10256,
10412,
10414,
10446,
10480,
10514,
10545,
10692,
10784,
10786,
10816,
10843,
10875,
10889,
10905,
10931,
11093,
11095,
11212,
11386,
11506,
11602,
11688,
11903,
12082,
12230,
12422,
12469,
12622,
12824,
12826,
12855,
12882,
12899,
12913,
12929,
12955,
13053,
13055,
13195,
13307,
13470,
13508,
13510,
13544,
13572,
13585,
13599,
13680,
13799,
13801,
13828,
13841,
13855,
13986,
14141,
14143,
14181,
14194,
14208,
14337,
14481,
14483,
14520,
14533,
14547,
14633,
14701,
14703,
14742,
14755,
14769,
14858,
14860,
14907,
14920,
14934,
15063,
15065,
15206,
15365,
15573,
15575,
15606,
15636,
15665,
15679,
15695,
15724,
15879,
15881,
16051,
16053,
16079,
16107,
16135,
16149,
16165,
16192,
16327,
16329,
16494,
16496,
16532,
16548,
16567,
16588,
16602,
16622,
16624,
16655,
16675,
16677,
16705,
16737,
16751,
16782,
16802,
16804,
16820,
16832,
16846,
16861,
16881,
16883,
16903,
16905,
16933,
16945,
16961,
16977,
16988,
17008,
17010,
17044,
17070,
17122,
17138,
17158,
17160,
17192,
17223,
17247,
17273,
17298,
17318,
17320,
17347,
17359,
17375,
17391,
17402,
17422,
17424,
17447,
17473,
17525,
17541,
17561,
17563,
17590,
17616,
17668,
17688,
17690,
17714,
17726,
17749,
17769,
17771,
17803,
17834,
17858,
17884,
17909,
17929,
17931,
17947,
17964,
17980,
18000,
18002,
18025,
18047,
18067,
18069,
18094,
18107,
18127,
18129,
18159,
18179,
18181,
18209,
18236,
18264,
18295,
18312,
18325,
18494,
18496,
18514,
18527,
18561,
18563,
18585,
18598,
18747,
18749,
18818,
18820,
18854,
18883,
18896,
18997,
18999,
19035,
19048,
19062,
19305,
19307,
19344,
19357,
19427,
19429,
19458,
19471,
19485,
19620,
19663,
19665,
19694,
19707,
19721,
19854,
19897,
19899,
20002,
20004,
20035,
20067,
20080,
20199,
20442,
20552,
20554,
20587,
20600,
20616,
20785,
20787,
20929,
20931,
20963,
20991,
21004,
21064,
21066,
21108,
21121,
21157,
21159,
21188,
21201,
21295,
21297,
21400,
21402,
21428,
21447,
21479,
21499,
21501,
21534,
21554,
21556,
21591,
21611,
21613,
21647,
21667,
21669,
21671,
21691,
21693,
21713,
21732,
21750,
21770,
21772,
21788,
21808,
21810,
21822,
21842,
21844,
21858,
21878,
21880,
21892,
21912,
21914,
21930,
21950,
21952,
21954,
21974,
21976,
22003,
22029,
22054,
22074,
22076,
22099,
22121,
22141,
22143,
22163,
22165,
22194,
22213,
22243,
22263,
22265,
22295,
22315,
22317,
22327,
22347,
22349,
22351,
22371,
22373,
22399,
22418,
22438,
22458,
22460,
22491,
22511,
22513,
22569,
22589,
22591,
22632,
22652,
22654,
22684,
22704,
22706,
22733,
22753,
22755,
22787,
22807,
22809,
22811,
22831,
22833,
22861,
22882,
22910,
22937,
22957,
22965,
22992,
23005,
23025,
23027,
23029,
23038,
23059,
23074,
23094,
23096,
23098,
23100,
23123,
23143,
23151,
23178,
23191,
23211,
23213,
23236,
23249,
23269,
23271,
23273,
23282,
23299,
23310,
23330,
23332,
23334,
23336,
23370,
23390,
23398,
23425,
23438,
23458,
23460,
23483,
23496,
23516,
23518,
23539,
23552,
23572,
23574,
23576,
23585,
23613,
23635,
23655,
23657,
23659,
23661,
23684,
23704,
23712,
23739,
23752,
23772,
23774,
23797,
23810,
23830,
23832,
23834,
23843,
23860,
23871,
23891,
23893,
23895,
23897,
23921,
23941,
23950,
23966,
23978,
23993,
24013,
24015,
24017,
24019
],
"line_end_idx": [
68,
91,
136,
158,
179,
199,
201,
275,
285,
350,
406,
433,
473,
487,
541,
566,
659,
782,
841,
929,
998,
1098,
1219,
1347,
1463,
1560,
1634,
1701,
1723,
1769,
1830,
1927,
2016,
2085,
2087,
2109,
2155,
2216,
2313,
2402,
2471,
2473,
2495,
2540,
2646,
2769,
2858,
2927,
2929,
2951,
2996,
3102,
3225,
3314,
3383,
3385,
3407,
3452,
3558,
3681,
3770,
3839,
3841,
3874,
3903,
3926,
4005,
4007,
4086,
4088,
4116,
4143,
4171,
4195,
4216,
4231,
4333,
4335,
4355,
4357,
4377,
4379,
4399,
4418,
4435,
4450,
4571,
4573,
4593,
4595,
4615,
4617,
4637,
4656,
4673,
4688,
4809,
4811,
4831,
4833,
4853,
4855,
4886,
4901,
4929,
4944,
5101,
5103,
5123,
5125,
5145,
5147,
5178,
5193,
5221,
5236,
5387,
5389,
5409,
5411,
5431,
5433,
5461,
5486,
5514,
5530,
5553,
5579,
5631,
5645,
5661,
5681,
5683,
5715,
5753,
5767,
5783,
5803,
5805,
5822,
5861,
5875,
5920,
6073,
6113,
6115,
6143,
6165,
6185,
6187,
6219,
6253,
6284,
6308,
6337,
6363,
6388,
6409,
6445,
6554,
6556,
6572,
6601,
6613,
6627,
6649,
6669,
6671,
6705,
6731,
6783,
6797,
6817,
6819,
6842,
6854,
6876,
6896,
6898,
6925,
6944,
6958,
6978,
6980,
7012,
7050,
7064,
7080,
7100,
7102,
7134,
7168,
7199,
7223,
7252,
7278,
7502,
7684,
7686,
7706,
7718,
7730,
7744,
7755,
7775,
7777,
7789,
7801,
7815,
7826,
7846,
7848,
7880,
7918,
7932,
7948,
7968,
7970,
8002,
8226,
8408,
8410,
8451,
8496,
8509,
8525,
8683,
8685,
8844,
8911,
9082,
9199,
9286,
9288,
9315,
9342,
9380,
9394,
9414,
9416,
9467,
9510,
9526,
9546,
9548,
9582,
9608,
9660,
9674,
9694,
9696,
9734,
9780,
9816,
9830,
10051,
10053,
10080,
10113,
10127,
10190,
10192,
10214,
10242,
10256,
10412,
10414,
10446,
10480,
10514,
10545,
10692,
10784,
10786,
10816,
10843,
10875,
10889,
10905,
10931,
11093,
11095,
11212,
11386,
11506,
11602,
11688,
11903,
12082,
12230,
12422,
12469,
12622,
12824,
12826,
12855,
12882,
12899,
12913,
12929,
12955,
13053,
13055,
13195,
13307,
13470,
13508,
13510,
13544,
13572,
13585,
13599,
13680,
13799,
13801,
13828,
13841,
13855,
13986,
14141,
14143,
14181,
14194,
14208,
14337,
14481,
14483,
14520,
14533,
14547,
14633,
14701,
14703,
14742,
14755,
14769,
14858,
14860,
14907,
14920,
14934,
15063,
15065,
15206,
15365,
15573,
15575,
15606,
15636,
15665,
15679,
15695,
15724,
15879,
15881,
16051,
16053,
16079,
16107,
16135,
16149,
16165,
16192,
16327,
16329,
16494,
16496,
16532,
16548,
16567,
16588,
16602,
16622,
16624,
16655,
16675,
16677,
16705,
16737,
16751,
16782,
16802,
16804,
16820,
16832,
16846,
16861,
16881,
16883,
16903,
16905,
16933,
16945,
16961,
16977,
16988,
17008,
17010,
17044,
17070,
17122,
17138,
17158,
17160,
17192,
17223,
17247,
17273,
17298,
17318,
17320,
17347,
17359,
17375,
17391,
17402,
17422,
17424,
17447,
17473,
17525,
17541,
17561,
17563,
17590,
17616,
17668,
17688,
17690,
17714,
17726,
17749,
17769,
17771,
17803,
17834,
17858,
17884,
17909,
17929,
17931,
17947,
17964,
17980,
18000,
18002,
18025,
18047,
18067,
18069,
18094,
18107,
18127,
18129,
18159,
18179,
18181,
18209,
18236,
18264,
18295,
18312,
18325,
18494,
18496,
18514,
18527,
18561,
18563,
18585,
18598,
18747,
18749,
18818,
18820,
18854,
18883,
18896,
18997,
18999,
19035,
19048,
19062,
19305,
19307,
19344,
19357,
19427,
19429,
19458,
19471,
19485,
19620,
19663,
19665,
19694,
19707,
19721,
19854,
19897,
19899,
20002,
20004,
20035,
20067,
20080,
20199,
20442,
20552,
20554,
20587,
20600,
20616,
20785,
20787,
20929,
20931,
20963,
20991,
21004,
21064,
21066,
21108,
21121,
21157,
21159,
21188,
21201,
21295,
21297,
21400,
21402,
21428,
21447,
21479,
21499,
21501,
21534,
21554,
21556,
21591,
21611,
21613,
21647,
21667,
21669,
21671,
21691,
21693,
21713,
21732,
21750,
21770,
21772,
21788,
21808,
21810,
21822,
21842,
21844,
21858,
21878,
21880,
21892,
21912,
21914,
21930,
21950,
21952,
21954,
21974,
21976,
22003,
22029,
22054,
22074,
22076,
22099,
22121,
22141,
22143,
22163,
22165,
22194,
22213,
22243,
22263,
22265,
22295,
22315,
22317,
22327,
22347,
22349,
22351,
22371,
22373,
22399,
22418,
22438,
22458,
22460,
22491,
22511,
22513,
22569,
22589,
22591,
22632,
22652,
22654,
22684,
22704,
22706,
22733,
22753,
22755,
22787,
22807,
22809,
22811,
22831,
22833,
22861,
22882,
22910,
22937,
22957,
22965,
22992,
23005,
23025,
23027,
23029,
23038,
23059,
23074,
23094,
23096,
23098,
23100,
23123,
23143,
23151,
23178,
23191,
23211,
23213,
23236,
23249,
23269,
23271,
23273,
23282,
23299,
23310,
23330,
23332,
23334,
23336,
23370,
23390,
23398,
23425,
23438,
23458,
23460,
23483,
23496,
23516,
23518,
23539,
23552,
23572,
23574,
23576,
23585,
23613,
23635,
23655,
23657,
23659,
23661,
23684,
23704,
23712,
23739,
23752,
23772,
23774,
23797,
23810,
23830,
23832,
23834,
23843,
23860,
23871,
23891,
23893,
23895,
23897,
23921,
23941,
23950,
23966,
23978,
23993,
24013,
24015,
24017,
24019,
24020
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 24020,
"ccnet_original_nlines": 712,
"rps_doc_curly_bracket": 0.012905909679830074,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.18394845724105835,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03632102906703949,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3622339367866516,
"rps_doc_frac_unique_words": 0.24867725372314453,
"rps_doc_mean_word_length": 7.092214584350586,
"rps_doc_num_sentences": 186,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.4798903465271,
"rps_doc_word_count": 2646,
"rps_doc_frac_chars_dupe_10grams": 0.1818181872367859,
"rps_doc_frac_chars_dupe_5grams": 0.31194713711738586,
"rps_doc_frac_chars_dupe_6grams": 0.23563891649246216,
"rps_doc_frac_chars_dupe_7grams": 0.20803581178188324,
"rps_doc_frac_chars_dupe_8grams": 0.20100180804729462,
"rps_doc_frac_chars_dupe_9grams": 0.19242246448993683,
"rps_doc_frac_chars_top_2gram": 0.0687413364648819,
"rps_doc_frac_chars_top_3gram": 0.021101990714669228,
"rps_doc_frac_chars_top_4gram": 0.017584990710020065,
"rps_doc_books_importance": -1755.6514892578125,
"rps_doc_books_importance_length_correction": -1755.6514892578125,
"rps_doc_openwebtext_importance": -952.5574340820312,
"rps_doc_openwebtext_importance_length_correction": -952.5574340820312,
"rps_doc_wikipedia_importance": -1083.8870849609375,
"rps_doc_wikipedia_importance_length_correction": -1083.8870849609375
},
"fasttext": {
"dclm": 0.9889519214630127,
"english": 0.6925379037857056,
"fineweb_edu_approx": 3.023024559020996,
"eai_general_math": 0.5819482207298279,
"eai_open_web_math": 0.28872567415237427,
"eai_web_code": 0.8993386030197144
}
}
|
{
"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": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,473,217,851,521,847,000 |
Beefy Boxes and Bandwidth Generously Provided by pair Networks
Problems? Is your data what you think it is?
PerlMonks
Comment on
( #3333=superdoc: print w/ replies, xml ) Need Help??
What you want is to explicitly fork() then exec(). That's the tried-and-true traditional way to launch another process on Unixy systems, and fork() returns the child's PID in the parent (and 0 in the child, or undef if the fork() failed).
This code is simple, but it shows the concept.
if ( my $pid = fork() ) { my $pid_of_child_that_finished = wait(); my $status_code_of_child = $?; # or $CHILD_ERROR_NATIVE } elsif ( defined $pid ) { exec( '/bin/ls' ); } else { warn "Something broke: can't fork()!\n"; } # continue processing in the parent after child is done
In reply to Re: Launch process, get PID by mr_mischief
in thread Launch process, get PID by rvosa
Title:
Use: <p> text here (a paragraph) </p>
and: <code> code here </code>
to format your post; it's "PerlMonks-approved HTML":
• Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
• Read Where should I post X? if you're not absolutely sure you're posting in the right place.
• Please read these before you post! —
• Posts may use any of the Perl Monks Approved HTML tags:
a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
• You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
For: Use:
& &
< <
> >
[ [
] ]
• Link using PerlMonks shortcuts! What shortcuts can I use for linking?
• See Writeup Formatting Tips and other pages linked from there for more info.
• Log In?
Username:
Password:
What's my password?
Create A New User
Chatterbox?
and the web crawler heard nothing...
How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (9)
As of 2015-10-13 13:16 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
Does Humor Belong in Programming?
Results (307 votes), past polls
|
{
"url": "http://www.perlmonks.org/?parent=671064;node_id=3333",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2015-40",
"warc_metadata": {
"Content-Length": "20151",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TRNERLPVCBGKCIIATBGEVGVIZDFF6CS2",
"WARC-Concurrent-To": "<urn:uuid:a86ac988-f9a9-411a-8a2a-b63c46d06b6d>",
"WARC-Date": "2015-10-13T13:17:16Z",
"WARC-IP-Address": "66.39.54.27",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:2PLXDQDIRCGSZRUIGJOHQ3FXO4O75XWZ",
"WARC-Record-ID": "<urn:uuid:11690b7d-1bb5-4024-a378-4f9f6b76eba7>",
"WARC-Target-URI": "http://www.perlmonks.org/?parent=671064;node_id=3333",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:90f8c8ae-284d-4279-a3f3-eac03e5a6bba>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-137-6-227.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-40\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for September 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
63,
108,
110,
122,
123,
134,
135,
189,
428,
429,
476,
477,
754,
755,
810,
853,
854,
861,
900,
931,
984,
985,
986,
987,
1110,
1207,
1248,
1308,
1574,
1709,
1735,
1747,
1758,
1769,
1781,
1793,
1867,
1948,
1960,
1974,
1988,
1989,
2013,
2035,
2051,
2092,
2093,
2135,
2152,
2234,
2265,
2279,
2296,
2312,
2327,
2347,
2348,
2388,
2389,
2390,
2391,
2392
],
"line_end_idx": [
63,
108,
110,
122,
123,
134,
135,
189,
428,
429,
476,
477,
754,
755,
810,
853,
854,
861,
900,
931,
984,
985,
986,
987,
1110,
1207,
1248,
1308,
1574,
1709,
1735,
1747,
1758,
1769,
1781,
1793,
1867,
1948,
1960,
1974,
1988,
1989,
2013,
2035,
2051,
2092,
2093,
2135,
2152,
2234,
2265,
2279,
2296,
2312,
2327,
2347,
2348,
2388,
2389,
2390,
2391,
2392,
2429
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2429,
"ccnet_original_nlines": 62,
"rps_doc_curly_bracket": 0.002470149891451001,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23883162438869476,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024054979905486107,
"rps_doc_frac_lines_end_with_ellipsis": 0.015873020514845848,
"rps_doc_frac_no_alph_words": 0.3659793734550476,
"rps_doc_frac_unique_words": 0.6621983647346497,
"rps_doc_mean_word_length": 4.4182305335998535,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0.010309279896318913,
"rps_doc_unigram_entropy": 5.259787559509277,
"rps_doc_word_count": 373,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.025485439226031303,
"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.012135920114815235,
"rps_doc_frac_chars_top_3gram": 0.013349509797990322,
"rps_doc_frac_chars_top_4gram": 0.023058250546455383,
"rps_doc_books_importance": -281.9039306640625,
"rps_doc_books_importance_length_correction": -281.9039306640625,
"rps_doc_openwebtext_importance": -178.04367065429688,
"rps_doc_openwebtext_importance_length_correction": -178.04367065429688,
"rps_doc_wikipedia_importance": -123.72747802734375,
"rps_doc_wikipedia_importance_length_correction": -123.72747802734375
},
"fasttext": {
"dclm": 0.031528290361166,
"english": 0.8079110383987427,
"fineweb_edu_approx": 2.1670949459075928,
"eai_general_math": 0.0017868300201371312,
"eai_open_web_math": 0.3691079020500183,
"eai_web_code": 0.00002015000063693151
}
}
|
{
"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.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": "4",
"label": "Code/Software"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"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": "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
|
-9,143,460,378,391,952,000 |
AWS::WAF::IPSet - AWS CloudFormation
AWS::WAF::IPSet
Note
This is AWS WAF Classic documentation. For more information, see AWS WAF Classic in the developer guide.
For the latest version of AWS WAF , use the AWS WAFV2 API and see the AWS WAF Developer Guide. With the latest version, AWS WAF has a single set of endpoints for regional and global use.
Contains one or more IP addresses or blocks of IP addresses specified in Classless Inter-Domain Routing (CIDR) notation. AWS WAF supports IPv4 address ranges: /8 and any range between /16 through /32. AWS WAF supports IPv6 address ranges: /24, /32, /48, /56, /64, and /128.
To specify an individual IP address, you specify the four-part IP address followed by a /32, for example, 192.0.2.0/32. To block a range of IP addresses, you can specify /8 or any range between /16 through /32 (for IPv4) or /24, /32, /48, /56, /64, or /128 (for IPv6). For more information about CIDR notation, see the Wikipedia entry Classless Inter-Domain Routing.
Syntax
To declare this entity in your AWS CloudFormation template, use the following syntax:
JSON
{ "Type" : "AWS::WAF::IPSet", "Properties" : { "IPSetDescriptors" : [ IPSetDescriptor, ... ], "Name" : String } }
YAML
Type: AWS::WAF::IPSet Properties: IPSetDescriptors: - IPSetDescriptor Name: String
Properties
IPSetDescriptors
The IP address type (IPV4 or IPV6) and the IP address range (in CIDR notation) that web requests originate from. If the WebACL is associated with an Amazon CloudFront distribution and the viewer did not use an HTTP proxy or a load balancer to send the request, this is the value of the c-ip field in the CloudFront access logs.
Required: No
Type: Array of IPSetDescriptor
Update requires: No interruption
Name
The name of the IPSet. You can't change the name of an IPSet after you create it.
Required: Yes
Type: String
Pattern: .*\S.*
Minimum: 1
Maximum: 128
Update requires: Replacement
Return values
Ref
When you pass the logical ID of this resource to the intrinsic Ref function, Ref returns the resource physical ID, such as 1234a1a-a1b1-12a1-abcd-a123b123456.
For more information about using the Ref function, see Ref.
Fn::GetAtt
Examples
Define IP Addresses
The following example defines a set of IP addresses for a web access control list (ACL) rule.
JSON
"MyIPSetDenylist": { "Type": "AWS::WAF::IPSet", "Properties": { "Name": "IPSet for deny listed IP addresses", "IPSetDescriptors": [ { "Type" : "IPV4", "Value" : "192.0.2.44/32" }, { "Type" : "IPV4", "Value" : "192.0.7.0/24" } ] } }
YAML
MyIPSetDenylist: Type: "AWS::WAF::IPSet" Properties: Name: "IPSet for deny listed IP addresses" IPSetDescriptors: - Type: "IPV4" Value: "192.0.2.44/32" - Type: "IPV4" Value: "192.0.7.0/24"
Associate an IPSet with a Web ACL Rule
The following example associates the MyIPSetDenylist IP Set with a web ACL rule.
JSON
"MyIPSetRule" : { "Type": "AWS::WAF::Rule", "Properties": { "Name": "MyIPSetRule", "MetricName" : "MyIPSetRule", "Predicates": [ { "DataId" : { "Ref" : "MyIPSetDenylist" }, "Negated" : false, "Type" : "IPMatch" } ] } }
YAML
MyIPSetRule: Type: "AWS::WAF::Rule" Properties: Name: "MyIPSetRule" MetricName: "MyIPSetRule" Predicates: - DataId: Ref: "MyIPSetDenylist" Negated: false Type: "IPMatch"
Create a Web ACL
The following example associates the MyIPSetRule rule with a web ACL. The web ACL allows requests that originate from all IP addresses except for addresses that are defined in the MyIPSetRule.
JSON
"MyWebACL": { "Type": "AWS::WAF::WebACL", "Properties": { "Name": "WebACL to block IP addresses", "DefaultAction": { "Type": "ALLOW" }, "MetricName" : "MyWebACL", "Rules": [ { "Action" : { "Type" : "BLOCK" }, "Priority" : 1, "RuleId" : { "Ref" : "MyIPSetRule" } } ] } }
YAML
MyWebACL: Type: "AWS::WAF::WebACL" Properties: Name: "WebACL to block IP addresses" DefaultAction: Type: "ALLOW" MetricName: "MyWebACL" Rules: - Action: Type: "BLOCK" Priority: 1 RuleId: Ref: "MyIPSetRule"
|
{
"url": "https://docs.aws.amazon.com/AWSCloudFormation/latest/UserGuide/aws-resource-waf-ipset.html",
"source_domain": "docs.aws.amazon.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "23599",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KQQOCCOT33DLKNE4ZWPGXRLR2V3T6YIO",
"WARC-Concurrent-To": "<urn:uuid:361c6d65-8bde-49f4-91bd-67633b527691>",
"WARC-Date": "2024-02-24T06:59:23Z",
"WARC-IP-Address": "99.84.108.99",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:EEGJYNB6QF43IISOCTRNESNXUFZRLHLM",
"WARC-Record-ID": "<urn:uuid:a5d90fc4-3c8e-4ec4-9fb3-fa126a18f45e>",
"WARC-Target-URI": "https://docs.aws.amazon.com/AWSCloudFormation/latest/UserGuide/aws-resource-waf-ipset.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a5bcc601-8163-45fd-86f6-aabc90a6d08e>"
},
"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-169\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
37,
38,
54,
55,
60,
61,
166,
167,
354,
355,
629,
630,
997,
998,
1005,
1006,
1092,
1093,
1098,
1099,
1213,
1214,
1219,
1220,
1303,
1304,
1315,
1316,
1333,
1334,
1662,
1663,
1676,
1677,
1708,
1709,
1742,
1743,
1748,
1749,
1831,
1832,
1846,
1847,
1860,
1861,
1877,
1878,
1889,
1890,
1903,
1904,
1933,
1934,
1948,
1949,
1953,
1954,
2113,
2114,
2174,
2175,
2186,
2187,
2196,
2197,
2217,
2218,
2312,
2313,
2318,
2319,
2551,
2552,
2557,
2558,
2747,
2748,
2787,
2788,
2869,
2870,
2875,
2876,
3095,
3096,
3101,
3102,
3272,
3273,
3290,
3291,
3484,
3485,
3490,
3491,
3761,
3762,
3767,
3768
],
"line_end_idx": [
37,
38,
54,
55,
60,
61,
166,
167,
354,
355,
629,
630,
997,
998,
1005,
1006,
1092,
1093,
1098,
1099,
1213,
1214,
1219,
1220,
1303,
1304,
1315,
1316,
1333,
1334,
1662,
1663,
1676,
1677,
1708,
1709,
1742,
1743,
1748,
1749,
1831,
1832,
1846,
1847,
1860,
1861,
1877,
1878,
1889,
1890,
1903,
1904,
1933,
1934,
1948,
1949,
1953,
1954,
2113,
2114,
2174,
2175,
2186,
2187,
2196,
2197,
2217,
2218,
2312,
2313,
2318,
2319,
2551,
2552,
2557,
2558,
2747,
2748,
2787,
2788,
2869,
2870,
2875,
2876,
3095,
3096,
3101,
3102,
3272,
3273,
3290,
3291,
3484,
3485,
3490,
3491,
3761,
3762,
3767,
3768,
3973
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3973,
"ccnet_original_nlines": 100,
"rps_doc_curly_bracket": 0.008054370060563087,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.16032887995243073,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08735868334770203,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.44501543045043945,
"rps_doc_frac_unique_words": 0.3457249104976654,
"rps_doc_mean_word_length": 5.342007637023926,
"rps_doc_num_sentences": 39,
"rps_doc_symbol_to_word_ratio": 0.0010277499677613378,
"rps_doc_unigram_entropy": 4.804654598236084,
"rps_doc_word_count": 538,
"rps_doc_frac_chars_dupe_10grams": 0.28601253032684326,
"rps_doc_frac_chars_dupe_5grams": 0.3897007703781128,
"rps_doc_frac_chars_dupe_6grams": 0.35003480315208435,
"rps_doc_frac_chars_dupe_7grams": 0.33194154500961304,
"rps_doc_frac_chars_dupe_8grams": 0.28601253032684326,
"rps_doc_frac_chars_dupe_9grams": 0.28601253032684326,
"rps_doc_frac_chars_top_2gram": 0.03827418014407158,
"rps_doc_frac_chars_top_3gram": 0.03479471057653427,
"rps_doc_frac_chars_top_4gram": 0.011482249945402145,
"rps_doc_books_importance": -396.2514953613281,
"rps_doc_books_importance_length_correction": -396.2514953613281,
"rps_doc_openwebtext_importance": -270.1465759277344,
"rps_doc_openwebtext_importance_length_correction": -270.1465759277344,
"rps_doc_wikipedia_importance": -173.5872344970703,
"rps_doc_wikipedia_importance_length_correction": -173.5872344970703
},
"fasttext": {
"dclm": 0.1835629940032959,
"english": 0.7140381932258606,
"fineweb_edu_approx": 1.9847207069396973,
"eai_general_math": 0.049254000186920166,
"eai_open_web_math": 0.2659403681755066,
"eai_web_code": 0.633285641670227
}
}
|
{
"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": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,008,686,225,638,223,000 |
Aktivierungsreihenfolge
Im Dialog Aktivierungsreihenfolge können Sie festlegen, in welcher Reihenfolge die Steuerelemente bei Betätigung der Tabulatortaste den Fokus erhalten.
So greifen Sie auf diesen Befehl zu:
Klicken Sie in der Symbolleiste Formular-Entwurf auf
Icon Activation Order
Aktivierungsreihenfolge
Die Reihenfolge, in welcher die Tabulatortaste die Steuerelemente eines Formulars auswählt, wird beim Einfügen von Formularelementen in ein Dokument automatisch von LibreOffice festgelegt. Jedes neu hinzugefügte Steuerelement wird automatisch an das Ende der Folge gesetzt. Der Dialog Aktivierungsreihenfolge bietet Ihnen die Möglichkeit, diese Reihenfolge beliebig anzupassen.
Sie können den Index eines Steuerelements auch über seine spezifischen Eigenschaften definieren, indem Sie einen Wert in das Feld Reihenfolge im Dialog Eigenschaften des Steuerelements eingeben.
Optionsfelder können nur dann mit der Tabulatortaste erreicht werden, wenn ein Optionsfeld ausgewählt ist. In einer Gruppierung von Optionsfeldern, in der keines der Felder ausgewählt ist, kann mit der Tastatur weder auf die Gruppierung noch auf die einzelnen Optionsfelder zugegriffen werden.
Steuerelemente
Hier sind alle Steuerelemente des Formulars aufgeführt. Diese Steuerelemente lassen sich in einer bestimmten Reihenfolge von oben nach unten mit der Tabulatortaste auswählen. Um die Position eines Steuerelements in der Aktivierungsreihenfolge zu ändern, wählen Sie es unter Steuerelemente aus.
Nach oben
Um das ausgewählte Steuerelement in der Aktivierungsreihenfolge um eine Position nach vorne zu verschieben, klicken Sie auf die Schaltfläche Index kleiner.
Nach unten
Um das ausgewählte Steuerelement in der Aktivierungsreihenfolge um eine Position nach hinten zu verschieben, klicken Sie auf die Schaltfläche Index größer.
Auto Sortierung
Klicken Sie auf die Schaltfläche Auto Sortierung, um die Steuerelemente gemäß ihrer Position im Dokument automatisch anordnen zu lassen.
Bitte unterstützen Sie uns!
|
{
"url": "https://help.libreoffice.org/latest/de/text/shared/02/01170300.html",
"source_domain": "help.libreoffice.org",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "10314",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UFAVHLU7OGNKPS6J5KOJGBQGGSCMSACN",
"WARC-Concurrent-To": "<urn:uuid:ace64423-f3dd-4691-aece-972b6ed2fc5d>",
"WARC-Date": "2021-02-27T13:41:00Z",
"WARC-IP-Address": "89.238.68.190",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PVRLVSI7MLLBGWOY4DUCZOC2WUGTE6JG",
"WARC-Record-ID": "<urn:uuid:aa704805-45b6-4d17-b5ba-96ac5dabe6a8>",
"WARC-Target-URI": "https://help.libreoffice.org/latest/de/text/shared/02/01170300.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:54a558b1-3595-47cb-a648-39e89b67c0d8>"
},
"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-39.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,
24,
25,
177,
178,
215,
216,
269,
270,
292,
293,
317,
318,
319,
697,
698,
893,
894,
1188,
1189,
1204,
1205,
1499,
1500,
1510,
1511,
1667,
1668,
1679,
1680,
1836,
1837,
1853,
1854,
1991,
1992
],
"line_end_idx": [
24,
25,
177,
178,
215,
216,
269,
270,
292,
293,
317,
318,
319,
697,
698,
893,
894,
1188,
1189,
1204,
1205,
1499,
1500,
1510,
1511,
1667,
1668,
1679,
1680,
1836,
1837,
1853,
1854,
1991,
1992,
2019
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2019,
"ccnet_original_nlines": 35,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.03793102875351906,
"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.09655171632766724,
"rps_doc_frac_unique_words": 0.48659002780914307,
"rps_doc_mean_word_length": 6.651340961456299,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.501816272735596,
"rps_doc_word_count": 261,
"rps_doc_frac_chars_dupe_10grams": 0.0875575989484787,
"rps_doc_frac_chars_dupe_5grams": 0.15841014683246613,
"rps_doc_frac_chars_dupe_6grams": 0.14170506596565247,
"rps_doc_frac_chars_dupe_7grams": 0.14170506596565247,
"rps_doc_frac_chars_dupe_8grams": 0.14170506596565247,
"rps_doc_frac_chars_dupe_9grams": 0.0875575989484787,
"rps_doc_frac_chars_top_2gram": 0.014400919899344444,
"rps_doc_frac_chars_top_3gram": 0.04838709905743599,
"rps_doc_frac_chars_top_4gram": 0.0276497695595026,
"rps_doc_books_importance": -96.37071990966797,
"rps_doc_books_importance_length_correction": -96.37071990966797,
"rps_doc_openwebtext_importance": -65.14013671875,
"rps_doc_openwebtext_importance_length_correction": -65.14013671875,
"rps_doc_wikipedia_importance": -49.099308013916016,
"rps_doc_wikipedia_importance_length_correction": -49.099308013916016
},
"fasttext": {
"dclm": 0.7773979902267456,
"english": 0.0004560799861792475,
"fineweb_edu_approx": 1.7037194967269897,
"eai_general_math": 0.0061120400205254555,
"eai_open_web_math": 0.5587345957756042,
"eai_web_code": 0.43634194135665894
}
}
|
{
"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": "658.40285",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "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": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,429,649,825,921,203,000 |
LinuxQuestions.org
LinuxQuestions.org (/questions/)
- Linux - Server (http://www.linuxquestions.org/questions/linux-server-73/)
- - Debian Squeeze - remote access vs. local access permissions ?? (http://www.linuxquestions.org/questions/linux-server-73/debian-squeeze-remote-access-vs-local-access-permissions-4175428878/)
billbrach 09-24-2012 10:23 PM
Debian Squeeze - remote access vs. local access permissions ??
Hello,
I have a local server running a custom web app that I wrote. I need to be able to work on the software when I am not at the server's physical location, my daytime job.
I set up OpenSSH, ProFTP, and also freeNX, on this server. All three of these work great, when I'm on the LAN at work.
I've opened the necessary ports through the router, but still cannot get into the server remotely. For about 2 weeks, I've suspected that there was some issue/s related to the router (Cisco RV220W) but now I'm fairly sure it is NOT. Today, I set up a Filezilla Server on a Windows XP box, and I can access via Filezilla Client without a problem.
So, my questions is: Are there separate permissions or authentication settings for remote access versus local access ??
Thanks,
Bill
henrycoffin 09-25-2012 04:22 AM
What is the output from iptables -L?
billbrach 09-26-2012 05:29 PM
Hi Henry,
Thanks for your reply and suggestion. I compared the output from iptables -L with a server that did work, and they are the same.
What I did find (my bad) was the gateway IP was not correct in /etc/network/interfaces.
This has allowed me to SSH in a couple of times, but now that has stopped working. Oddly enough, when you do an ifconfig command, the gateway IP is *not* listed even though it is in the interfaces file !! This is why it took me so long to find the error. Error occurred because I was carrying the system back and forth to home, where my network has different settings.
Still never been able to FTP or HTTP into the server though, so I'm still suspecting something weird with the router. I will remotely reset the router, sometime tonight, after the business closes.
Again, thanks.
Bill
All times are GMT -5. The time now is 08:02 PM.
|
{
"url": "http://www.linuxquestions.org/questions/linux-server-73/debian-squeeze-remote-access-vs-local-access-permissions-4175428878-print/",
"source_domain": "www.linuxquestions.org",
"snapshot_id": "crawl=CC-MAIN-2015-06",
"warc_metadata": {
"Content-Length": "6556",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6GEZM3G3J7JL4PUXD57FBYSNCYKXHSED",
"WARC-Concurrent-To": "<urn:uuid:9f3e0dee-35a7-4a00-9e0f-64361ba00400>",
"WARC-Date": "2015-01-26T01:02:38Z",
"WARC-IP-Address": "75.126.162.205",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:6Z6ASJP5YWR7SAZHMRSLWF3HWV6IZBL6",
"WARC-Record-ID": "<urn:uuid:9a0daa46-ddfe-44e6-b56d-1d86e9401b93>",
"WARC-Target-URI": "http://www.linuxquestions.org/questions/linux-server-73/debian-squeeze-remote-access-vs-local-access-permissions-4175428878-print/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0447a8b3-626a-4187-8b11-e754c2f86382>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-212-252.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-06\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for January 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
19,
20,
53,
131,
329,
330,
360,
361,
424,
426,
433,
434,
602,
603,
722,
723,
1069,
1070,
1190,
1191,
1199,
1200,
1205,
1206,
1238,
1239,
1276,
1277,
1307,
1308,
1318,
1319,
1448,
1449,
1537,
1538,
1907,
1908,
2105,
2106,
2121,
2122,
2127,
2128,
2129
],
"line_end_idx": [
19,
20,
53,
131,
329,
330,
360,
361,
424,
426,
433,
434,
602,
603,
722,
723,
1069,
1070,
1190,
1191,
1199,
1200,
1205,
1206,
1238,
1239,
1276,
1277,
1307,
1308,
1318,
1319,
1448,
1449,
1537,
1538,
1907,
1908,
2105,
2106,
2121,
2122,
2127,
2128,
2129,
2176
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2176,
"ccnet_original_nlines": 45,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3240000009536743,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06400000303983688,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2720000147819519,
"rps_doc_frac_unique_words": 0.5497075915336609,
"rps_doc_mean_word_length": 4.883040904998779,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.934048652648926,
"rps_doc_word_count": 342,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08502993732690811,
"rps_doc_frac_chars_dupe_6grams": 0.058682631701231,
"rps_doc_frac_chars_dupe_7grams": 0.058682631701231,
"rps_doc_frac_chars_dupe_8grams": 0.058682631701231,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02155688963830471,
"rps_doc_frac_chars_top_3gram": 0.0227544903755188,
"rps_doc_frac_chars_top_4gram": 0.02994012087583542,
"rps_doc_books_importance": -270.660400390625,
"rps_doc_books_importance_length_correction": -270.660400390625,
"rps_doc_openwebtext_importance": -153.18716430664062,
"rps_doc_openwebtext_importance_length_correction": -153.18716430664062,
"rps_doc_wikipedia_importance": -110.35311889648438,
"rps_doc_wikipedia_importance_length_correction": -110.35311889648438
},
"fasttext": {
"dclm": 0.08381860703229904,
"english": 0.9233955144882202,
"fineweb_edu_approx": 1.3987544775009155,
"eai_general_math": 0.2690916061401367,
"eai_open_web_math": 0.3271118998527527,
"eai_web_code": 0.08221495151519775
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.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": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,494,930,412,792,331,000 |
It’s late 2001 and I’ve finally managed to find a group of like minded people who enjoy computers, games and all things that I felt ashamed of liking for the better part of my teenage life. We’re gathered at a friend’s house to have a LAN as this was long before the time when broadband was a common thing in Australian households. As much as these gatherings were a hive for sharing ill-gotten files they were also the beginnings of my career in IT as often we’d be experimenting with the latest software just for laughs. It’s at this very gathering where I had my first encounter with the latest operating system from Microsoft, Windows XP, and little did I know that I’d still be encountering it for the next 13 years.
XP IS DEAD LONG LIVE WINDOWSToday marks a day that we have known was coming for a long time but many have refused to accept: the day when Windows XP is no longer supported by Microsoft. You can still get support for Microsoft Security Essentials on Windows XP until July 14, 2015 but Microsoft will no longer be providing any updates, free or paid, to the aging operating system. For administrators like me it’s the ammunition we’ve been using for the better part of 2 years to get people to move away from the old operating system as nothing scares corporate customers more than the possibility of no support. Still though out of the total Windows market share XP still claims a staggering 27%, meaning almost 1 in every 3 Windows users is now on a system that won’t have any kind of official support. Many have criticised Microsoft for doing this but in all honesty it had to happen sometime or they’d never see the end of it.
The reason behind XP’s longevity, something which is usually unheard of in the high technology industry, can be almost wholly attributed to the utter dismal failure that Windows Vista was. Prior to that Microsoft customers were more than happy to go through the routine upgrade process every 3~5 years however the fact that Vista didn’t deliver on what it promised, coupled with it’s astoundingly bad reliability, meant that the vast majority of organisations got comfortable with Windows XP as their operating system. The time between XP and Windows 7 was long enough that the pain of moving forward became too great and many opted to wait until there was just no option left for them. My most recent project was a great example of this, migrating a large government department to Windows 7 from XP which only barely missed the deadline that was hit today.
This is the prime reason behind Microsoft’s recent change from a longer product cycle to one that’s based around rapid innovation. Whilst it’s true that Windows 8 is shaping up to be the Vista of this current product cycle, with Windows 7 adoption rates still outpacing it, the vast majority of the hard work will be done if users finally move to Windows 7. The upgrade paths from there are a whole lot more forgiving than coming from XP and moving from 8 to 8.1 takes about as much effort as installing a patch. I’m quietly hopeful that Windows 7 won’t become the next XP but at the same time I know how readily history can repeat itself.
So it’s without a heavy heart I say goodbye to Windows XP. It will not be missed by anyone in the industry as it was supposed to be dead and buried a long time ago and it was only through the stubbornness of the majority that it managed to stick around for as long as it did. I’m hoping for a much brighter future, one where Microsoft’s quickened pace of development is embraced and legacy systems are allowed to die the swift death that they so rightly deserve.
About the Author
David Klemke
David is an avid gamer and technology enthusiast in Australia. He got his first taste for both of those passions when his father, a radio engineer from the University of Melbourne, gave him an old DOS box to play games on.
View All Articles
|
{
"url": "https://www.therefinedgeek.com.au/index.php/2014/04/08/windows-xp-is-no-more-finally/",
"source_domain": "www.therefinedgeek.com.au",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "39771",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SO6PZ3MSRO7BZ6I6ZLA3KK56SHLP5FKA",
"WARC-Concurrent-To": "<urn:uuid:2ea60ce4-0546-47e3-a7c8-2d54b7b05fe2>",
"WARC-Date": "2021-10-21T15:01:09Z",
"WARC-IP-Address": "63.250.43.2",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JGQXKLU2EVEU7IJ5ADPZVS3NT2TZG7VM",
"WARC-Record-ID": "<urn:uuid:c3b8776a-b444-484c-a8ad-e73b051bfd94>",
"WARC-Target-URI": "https://www.therefinedgeek.com.au/index.php/2014/04/08/windows-xp-is-no-more-finally/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5a10eb18-f02e-4894-82fc-8822da9863be>"
},
"warc_info": "isPartOf: CC-MAIN-2021-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-88\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,
722,
723,
1652,
1653,
2511,
2512,
3152,
3153,
3616,
3617,
3619,
3620,
3637,
3638,
3651,
3652,
3875,
3876
],
"line_end_idx": [
722,
723,
1652,
1653,
2511,
2512,
3152,
3153,
3616,
3617,
3619,
3620,
3637,
3638,
3651,
3652,
3875,
3876,
3893
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3893,
"ccnet_original_nlines": 18,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4879899024963379,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03539822995662689,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10619468986988068,
"rps_doc_frac_unique_words": 0.4935806095600128,
"rps_doc_mean_word_length": 4.476462364196777,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.332610130310059,
"rps_doc_word_count": 701,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.011472280137240887,
"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.014340340159833431,
"rps_doc_frac_chars_top_3gram": 0.0076481797732412815,
"rps_doc_frac_chars_top_4gram": 0.010197579860687256,
"rps_doc_books_importance": -315.12078857421875,
"rps_doc_books_importance_length_correction": -315.12078857421875,
"rps_doc_openwebtext_importance": -177.9081268310547,
"rps_doc_openwebtext_importance_length_correction": -177.9081268310547,
"rps_doc_wikipedia_importance": -108.94925689697266,
"rps_doc_wikipedia_importance_length_correction": -108.94925689697266
},
"fasttext": {
"dclm": 0.03523838892579079,
"english": 0.9710157513618469,
"fineweb_edu_approx": 1.1346145868301392,
"eai_general_math": 0.10772764682769775,
"eai_open_web_math": 0.2736849784851074,
"eai_web_code": 0.0016106399707496166
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.162",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.09",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic 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,398,388,935,787,451,000 |
Having problems with your PC Laptops ?
Gateway laptop, can't connect to internet
\015 I have a gateway laptop that is less than 2 yrs old. I have recently had intermitant problems connecting to the internet wirelessly. however now my NIC card is not even visible now. In the hardware, through the control panel I still see my wireless, but no network card. I cannot connect hardwired or wirelessly. I have a 2nd laptop that connects perfectly. Help, not sure what else to look for.\015
Answers :
Network controller in SouthBridge chip on motherboard needs REFLOW or replacement.
Basically board needs service.
Repair Help & Product Troubleshooting for PC Laptops
Tips for a great answer:
- Provide details, support with references or personal experience .
- If you need clarification, ask it in the comment box .
- It's 100% free, no registration required.
Suggested Questions/Answers :
I can't connect internet even though I have connections appearing
Use your other pc ..when connected click on the icon in task bar and select properties...in properties open internet protocol(may have to scroll to it) and check details and write them down.\015\012if its set to obtain ip and dns auto then canc ... HP Pavilion DV5234US Notebook Laptop
No internet connection
Lets try this kjc. First I need to know the operating system you are using. Then I can walk you through the process of elimination. Let me know...take care.. Mark ... Compaq Presario R3000 Notebook
I have bsnl broadband connection; i am using a desktop to connect the internet,but i cant able to connect other laptop with wifi. i need bellow things with step by step instruction: 1.connecting one computer with bsnl adsl router(nokia siemens 1600). 2.connecting one computer with lan and laptop with wifi 3.connecting one computer with lan and laptop with wifi 4.connecting one computer with 4 lan and laptop with lan port 5.clear configuration modem configuration:(Residential router) bsnl nokia s
Your router has an lan address or IP. Something like 192.168.1.1. This is what you must connect to. Each of the machines you want to connect must have (in this example) an IP number between 192.168.1.2 and 192.168.1.225. As long as your machines all ... PC Desktops
Dell laptop internet connection problem
Ok ...on one of the other pc's that do connect ok go into control panel...open network connections...click on wireless icon to highlight it...in drop down menu(now exrended)choose change settings of this connection...this will open wireless propertie ... Dell Latitude D505 Notebook
I have a emachine laptop i cant get online everything else works tried everything keeps saying im connected but my ip address is wrong tried to manually fix it but it wont take wht do i do?
Networks can be a little complicated and very picky.\015\012Much of it depends on how the network is set up. Many will allow you to use DHCP, which means you set the device to accept whatever IP configuration that the network assigns. S ... E-Machines eMachines Desktop PC
Cant connect to internet my isp says ipconfig
Well, first thing I would do is wire everything up and not go wireless just yet.So from the wall, to the modem, to the router, then to the computer.If you don't have internet then AND (if you haven't already done so) unplug an ... Acer Aspire M1641-U1521A PC Desktop
I have an acer aspire 5315. Don't think I've wifi.
If you're using your pc as a gateway to connect to the internet you need to make sure the pc is turned on and connected before you connect wirelessly from your laptop. alternatively you can connect directly to your wireless router from your laptop, e ... Acer Aspire 5315 Notebook
Can't get connected to the internet using my Gateway Laptop
... Dell Inspiron 6000 Notebook
Can't get connected to the internet using my Gateway Laptop
If you are using windows xp then you need to go to control panel and click on the network and internet connection icon and run the setup wizard. Choose the "other" box when asked and then choose the "I already have a network but no internet connectio ... PC Laptops
We have a main pc attached to our broadband via ethernet and 1 other laptop which is also attached to the the internet but wirelss, my son has purchased an acer aspire 7730/7330 series laptop , how do we get the internet on it have managed to get it to say we are connected but still no internet comes up , please help what do i do to get the laptop to run on our already up and running internet access
I think you need to specify the gateway address in your new laptop. For that you have to know the gateway address ( i,e. the IP address of your boardband router/ adsl modem.).\015\012\015\012First, go to your old laptop, right click on My ... Acer PC Desktops
How can I make my loptop wireless, I bought already a Glink wireless-G ADSL GAteway with speed booster, I connect it but sill I cant connect with the internet. ONE MORE WHAT WILL i NEED TO BUY IF i WANT TO USE THE TV AS MY MONITOR. uSING MY LOPTOP tHNK YOU VERY MH
Well, genius; you need to create a question in a category that isn't generic. Pick one for your laptop model, and ask how to go from there. In fact, if there's a sales/help number from your laptop's maker, call it and ask them if they have a WiFi 8 ... PC Desktops
Gateway laptop M-6750 successfully logged onto wireless network (that is connected to internet), but this laptop unable to log on. this is a first time attempt. Any ideas....thanks
Hi and welcome to FixYa,If I understand your post correctly:\015\012\015\012you have a MacBook Pro that can access the wireless network and can access the Internet;\015\012you ... Gateway M-6750 PC Notebook
My E-machines laptop's internet connection is slow via Wi-Fi.
... E-Machines M2352 Notebook
I have a zyxel p66ohw router connected to my pc via an ethernet card, everything is fine untill my son logs on with his playstation 3, or my wife logs on with her laptop then i cant connect everytime i try iget an error message saying cannot connect
Make sure that your TCP/IP properties are set to "Obtain an IP address automatically". If you still cannot connect after you change that, and after waiting for a couple of minutes, then open a command prompt and type "IPCONFIG". Make a note of the ad ... PC Desktops
Cant connect to the internet!!!
How far did U move? Do You need to change the dailer settings in the routers config? \015\012To verify your hardware connectivity you can click: Start/Run/CMD to open a DOS prompt. Then type IPCONFIG /all and see the TCP/IP information for all ... Dell Latitude D600 Notebook
Wireless internet connection
First step - Enable your wireless hardware by switching it on some models have a separate switch or with the keyboard\015\012\015\012Second step - Check your wireless zero configuration service under adminitration tools ->services is r ... PC Laptops
Acer aspire one notebook internet problem
Here is some great source to solve any kinds of laptop's problem.\015\012\015\012» Hp Laptop's Solution» ... Aspire Acer 7520-5071 Notebook
Laptop wireless connection
Hi . LImited access no internet service means that Authentication of your wireless network is not up.You must know what your wireless encryption is and you can check your manual/guide for your router or gateway on how to a ... PC Laptops
I cannot connect wirelessy to internet on my compaq pressario v6000. The orange wireless light is on and the internet connectivity icons in the task bar have a red cross on them. I have tried all options to connect to internet this way but cant and i cant set up a network.
Part 1: Before You Start\015\012loadTOCNode(2, 'summary');\015\012You need the following: \015\012\015\012\015\012\015\012•\015\012A broadband connection to the Internet and the appropriate hardware. For example, cable-based ... PC Desktops
I cannot connect to the internet what do I need to do?
Is your laptop connected via wireless or is it wired directly into your modem or router? Also confirm the following: 1. Click on Start 2. Click on Run 3. Type in the word "cmd" w/out quotes and press enter 4. In the wind ... Compaq Presario M2000 Notebook
Hi, I had my NEC Versa E6300 direct from NEC,
It does sound like it could be a driver issue or the card itself. You will never get anyone to admit they are to blame. Realteks make good stuff and seem quite reliable. My guess would be the driver as your symptoms are what I have seen before on oth ... PC Laptops
Cannot connect to internet
First check ipaddress \015\012 Click Start -run- type cmd hit enter for XP or Start -search-type cmd hit enter in Vista. On the DOS black screen after the blinking cursor type ipconfig hit enter check the ipaddress if are getting ipaddress other than ... Fujitsu AMILO Pro V1000 Notebook
Toshiba Satellite limitations on network adapters all wireless, need other
You need to log into the router setting by typing something like 192.168.*.* etc,check the right one for your router and enable some type of encryption like 128bits wep..Then your network is secured with a password which will stop anyone access.Now a ... Toshiba Satellite M40-S417TD Notebook
Need help with sharing an internet connection... Please Read
Only way I can think of doing that is if you used a cross over cat 5e network cable between the desktop and laptop and assigned static ip addresses to them so your desktop would have 192.168.1.2 and your laptop would have 192.168.1.3 both with subnet ... PC Desktops
Gateway laptop, can't connect to internet
Network controller in SouthBridge chip on motherboard needs REFLOW or replacement.Basically board needs service. ... PC Laptops
• Start your question with What, Why, How, When, etc. and end with a "?"
• Be clear and specific
• Use proper spelling and grammar
all rights reserved to the respective owners || www.electronic-servicing.com || Terms of Use || Contact || Privacy Policy
Load time: 0.8635 seconds
|
{
"url": "http://www.electronic-servicing.com/_pc_laptops/q1237035-gateway_laptop_connect_internet",
"source_domain": "www.electronic-servicing.com",
"snapshot_id": "crawl=CC-MAIN-2017-47",
"warc_metadata": {
"Content-Length": "26998",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FJMGLYNRE2KYJ43CT5UZMTP5DKY23L5Y",
"WARC-Concurrent-To": "<urn:uuid:65bb2173-38c2-412b-9dc4-2ab1486cd2bb>",
"WARC-Date": "2017-11-20T09:13:34Z",
"WARC-IP-Address": "104.27.178.222",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:P3GOLBERS4HSE7J4NLKUW43VWA45W5YX",
"WARC-Record-ID": "<urn:uuid:b6363214-d228-4924-b8d6-0376fbdc26c5>",
"WARC-Target-URI": "http://www.electronic-servicing.com/_pc_laptops/q1237035-gateway_laptop_connect_internet",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4ba691fd-dcfb-42cf-896d-ab0f6cab41ce>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-233-173-181.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,
1,
40,
41,
83,
84,
489,
490,
500,
501,
584,
585,
616,
617,
670,
671,
696,
697,
765,
822,
866,
867,
897,
898,
964,
965,
966,
1252,
1253,
1276,
1277,
1278,
1476,
1477,
1978,
1979,
1980,
2246,
2247,
2287,
2288,
2289,
2572,
2573,
2763,
2764,
2765,
3038,
3039,
3085,
3086,
3087,
3354,
3355,
3406,
3407,
3408,
3689,
3690,
3750,
3751,
3752,
3784,
3785,
3845,
3846,
3847,
4113,
4114,
4517,
4518,
4519,
4779,
4780,
5045,
5046,
5047,
5312,
5313,
5494,
5495,
5496,
5703,
5704,
5766,
5767,
5768,
5798,
5799,
6049,
6050,
6051,
6318,
6319,
6351,
6352,
6353,
6629,
6630,
6659,
6660,
6661,
6912,
6913,
6955,
6956,
6957,
7097,
7098,
7125,
7126,
7127,
7365,
7366,
7640,
7641,
7642,
7883,
7884,
7939,
7940,
7941,
8197,
8198,
8244,
8245,
8246,
8512,
8513,
8540,
8541,
8542,
8830,
8831,
8906,
8907,
8908,
9201,
9202,
9263,
9264,
9265,
9532,
9533,
9575,
9576,
9577,
9705,
9780,
9806,
9842,
9964
],
"line_end_idx": [
1,
40,
41,
83,
84,
489,
490,
500,
501,
584,
585,
616,
617,
670,
671,
696,
697,
765,
822,
866,
867,
897,
898,
964,
965,
966,
1252,
1253,
1276,
1277,
1278,
1476,
1477,
1978,
1979,
1980,
2246,
2247,
2287,
2288,
2289,
2572,
2573,
2763,
2764,
2765,
3038,
3039,
3085,
3086,
3087,
3354,
3355,
3406,
3407,
3408,
3689,
3690,
3750,
3751,
3752,
3784,
3785,
3845,
3846,
3847,
4113,
4114,
4517,
4518,
4519,
4779,
4780,
5045,
5046,
5047,
5312,
5313,
5494,
5495,
5496,
5703,
5704,
5766,
5767,
5768,
5798,
5799,
6049,
6050,
6051,
6318,
6319,
6351,
6352,
6353,
6629,
6630,
6659,
6660,
6661,
6912,
6913,
6955,
6956,
6957,
7097,
7098,
7125,
7126,
7127,
7365,
7366,
7640,
7641,
7642,
7883,
7884,
7939,
7940,
7941,
8197,
8198,
8244,
8245,
8246,
8512,
8513,
8540,
8541,
8542,
8830,
8831,
8906,
8907,
8908,
9201,
9202,
9263,
9264,
9265,
9532,
9533,
9575,
9576,
9577,
9705,
9780,
9806,
9842,
9964,
9989
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9989,
"ccnet_original_nlines": 151,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3811357021331787,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.053897980600595474,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1881616860628128,
"rps_doc_frac_unique_words": 0.34041261672973633,
"rps_doc_mean_word_length": 4.734223365783691,
"rps_doc_num_sentences": 132,
"rps_doc_symbol_to_word_ratio": 0.016361890360713005,
"rps_doc_unigram_entropy": 5.54494047164917,
"rps_doc_word_count": 1648,
"rps_doc_frac_chars_dupe_10grams": 0.02999231033027172,
"rps_doc_frac_chars_dupe_5grams": 0.0476800799369812,
"rps_doc_frac_chars_dupe_6grams": 0.0476800799369812,
"rps_doc_frac_chars_dupe_7grams": 0.038964368402957916,
"rps_doc_frac_chars_dupe_8grams": 0.038964368402957916,
"rps_doc_frac_chars_dupe_9grams": 0.02999231033027172,
"rps_doc_frac_chars_top_2gram": 0.00769033981487155,
"rps_doc_frac_chars_top_3gram": 0.011663679964840412,
"rps_doc_frac_chars_top_4gram": 0.008074849843978882,
"rps_doc_books_importance": -851.3673095703125,
"rps_doc_books_importance_length_correction": -851.3673095703125,
"rps_doc_openwebtext_importance": -451.5604553222656,
"rps_doc_openwebtext_importance_length_correction": -451.5604553222656,
"rps_doc_wikipedia_importance": -399.3631286621094,
"rps_doc_wikipedia_importance_length_correction": -399.3631286621094
},
"fasttext": {
"dclm": 0.02832108922302723,
"english": 0.890601634979248,
"fineweb_edu_approx": 1.305291771888733,
"eai_general_math": 0.047949548810720444,
"eai_open_web_math": 0.18224108219146729,
"eai_web_code": 0.10206800699234009
}
}
|
{
"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": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "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
|
1,628,710,270,742,396,700 |
Skip to main content
CDK Constructs for AWS CloudWatch
Project description
Amazon CloudWatch Construct Library
<html></html>---
Stability: Stable
<html></html>
Metric objects represent a metric that is emitted by AWS services or your own application, such as CPUUsage, FailureCount or Bandwidth.
Metric objects can be constructed directly or are exposed by resources as attributes. Resources that expose metrics will have functions that look like metricXxx() which will return a Metric object, initialized with defaults that make sense.
For example, lambda.Function objects have the fn.metricErrors() method, which represents the amount of errors reported by that Lambda function:
# Example may have issues. See https://github.com/aws/jsii/issues/826
errors = fn.metric_errors()
Aggregation
To graph or alarm on metrics you must aggregate them first, using a function like Average or a percentile function like P99. By default, most Metric objects returned by CDK libraries will be configured as Average over 300 seconds (5 minutes). The exception is if the metric represents a count of discrete events, such as failures. In that case, the Metric object will be configured as Sum over 300 seconds, i.e. it represents the number of times that event occurred over the time period.
If you want to change the default aggregation of the Metric object (for example, the function or the period), you can do so by passing additional parameters to the metric function call:
# Example may have issues. See https://github.com/aws/jsii/issues/826
minute_error_rate = fn.metric_errors(
statistic="avg",
period=Duration.minutes(1),
label="Lambda failure rate"
)
This function also allows changing the metric label or color (which will be useful when embedding them in graphs, see below).
Rates versus Sums
The reason for using Sum to count discrete events is that some events are emitted as either 0 or 1 (for example Errors for a Lambda) and some are only emitted as 1 (for example NumberOfMessagesPublished for an SNS topic).
In case 0-metrics are emitted, it makes sense to take the Average of this metric: the result will be the fraction of errors over all executions.
If 0-metrics are not emitted, the Average will always be equal to 1, and not be very useful.
In order to simplify the mental model of Metric objects, we default to aggregating using Sum, which will be the same for both metrics types. If you happen to know the Metric you want to alarm on makes sense as a rate (Average) you can always choose to change the statistic.
Alarms
Alarms can be created on metrics in one of two ways. Either create an Alarm object, passing the Metric object to set the alarm on:
# Example may have issues. See https://github.com/aws/jsii/issues/826
Alarm(self, "Alarm",
metric=fn.metric_errors(),
threshold=100,
evaluation_periods=2
)
Alternatively, you can call metric.createAlarm():
# Example may have issues. See https://github.com/aws/jsii/issues/826
fn.metric_errors().create_alarm(self, "Alarm",
threshold=100,
evaluation_periods=2
)
The most important properties to set while creating an Alarms are:
• threshold: the value to compare the metric against.
• comparisonOperator: the comparison operation to use, defaults to metric >= threshold.
• evaluationPeriods: how many consecutive periods the metric has to be breaching the the threshold for the alarm to trigger.
Dashboards
Dashboards are set of Widgets stored server-side which can be accessed quickly from the AWS console. Available widgets are graphs of a metric over time, the current value of a metric, or a static piece of Markdown which explains what the graphs mean.
The following widgets are available:
• GraphWidget -- shows any number of metrics on both the left and right vertical axes.
• AlarmWidget -- shows the graph and alarm line for a single alarm.
• SingleValueWidget -- shows the current value of a set of metrics.
• TextWidget -- shows some static Markdown.
Graph widget
A graph widget can display any number of metrics on either the left or right vertical axis:
# Example may have issues. See https://github.com/aws/jsii/issues/826
dashboard.add_widgets(GraphWidget(
title="Executions vs error rate",
left=[execution_count_metric],
right=[error_count_metric.with(
statistic="average",
label="Error rate",
color="00FF00"
)]
))
Alarm widget
An alarm widget shows the graph and the alarm line of a single alarm:
# Example may have issues. See https://github.com/aws/jsii/issues/826
dashboard.add_widgets(AlarmWidget(
title="Errors",
alarm=error_alarm
))
Single value widget
A single-value widget shows the latest value of a set of metrics (as opposed to a graph of the value over time):
# Example may have issues. See https://github.com/aws/jsii/issues/826
dashboard.add_widgets(SingleValueWidget(
metrics=[visitor_count, purchase_count]
))
Text widget
A text widget shows an arbitrary piece of MarkDown. Use this to add explanations to your dashboard:
# Example may have issues. See https://github.com/aws/jsii/issues/826
dashboard.add_widgets(TextWidget(
markdown="# Key Performance Indicators"
))
Dashboard Layout
The widgets on a dashboard are visually laid out in a grid that is 24 columns wide. Normally you specify X and Y coordinates for the widgets on a Dashboard, but because this is inconvenient to do manually, the library contains a simple layout system to help you lay out your dashboards the way you want them to.
Widgets have a width and height property, and they will be automatically laid out either horizontally or vertically stacked to fill out the available space.
Widgets are added to a Dashboard by calling add(widget1, widget2, ...). Widgets given in the same call will be laid out horizontally. Widgets given in different calls will be laid out vertically. To make more complex layouts, you can use the following widgets to pack widgets together in different ways:
• Column: stack two or more widgets vertically.
• Row: lay out two or more widgets horizontally.
• Spacer: take up empty space
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Files for aws-cdk.aws-cloudwatch, version 1.13.0
Filename, size File type Python version Upload date Hashes
Filename, size aws_cdk.aws_cloudwatch-1.13.0-py3-none-any.whl (119.8 kB) File type Wheel Python version py3 Upload date Hashes View
Filename, size aws-cdk.aws-cloudwatch-1.13.0.tar.gz (124.5 kB) File type Source Python version None Upload date Hashes View
Supported by
Pingdom Pingdom Monitoring Google Google Object Storage and Download Analytics Sentry Sentry Error logging AWS AWS Cloud computing DataDog DataDog Monitoring Fastly Fastly CDN DigiCert DigiCert EV certificate StatusPage StatusPage Status page
|
{
"url": "https://pypi.org/project/aws-cdk.aws-cloudwatch/1.13.0/",
"source_domain": "pypi.org",
"snapshot_id": "crawl=CC-MAIN-2020-34",
"warc_metadata": {
"Content-Length": "139241",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:F64KO3EHERI3ESXH6EPS7JIV4ZGLKBRP",
"WARC-Concurrent-To": "<urn:uuid:1b296f11-5504-411c-a333-08277d6eef15>",
"WARC-Date": "2020-08-14T23:27:02Z",
"WARC-IP-Address": "151.101.192.223",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PUT54GI7L72ILGUUJJXARTH3INRKCTJ3",
"WARC-Record-ID": "<urn:uuid:e06bda78-f17f-4d28-9a80-6886f03a5cdc>",
"WARC-Target-URI": "https://pypi.org/project/aws-cdk.aws-cloudwatch/1.13.0/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0ee01c02-2294-4a53-8251-2f9dea5b59c6>"
},
"warc_info": "isPartOf: CC-MAIN-2020-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-210.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,
21,
22,
56,
57,
77,
78,
114,
115,
132,
133,
151,
152,
153,
167,
168,
304,
305,
546,
547,
691,
692,
762,
790,
791,
803,
804,
1292,
1293,
1479,
1480,
1550,
1588,
1609,
1641,
1673,
1675,
1676,
1802,
1803,
1821,
1822,
2044,
2045,
2190,
2191,
2284,
2285,
2559,
2560,
2567,
2568,
2699,
2700,
2770,
2791,
2822,
2841,
2866,
2868,
2869,
2919,
2920,
2990,
3037,
3056,
3081,
3083,
3084,
3151,
3152,
3208,
3298,
3425,
3426,
3437,
3438,
3689,
3690,
3727,
3728,
3817,
3887,
3957,
4003,
4004,
4017,
4018,
4110,
4111,
4181,
4216,
4254,
4255,
4290,
4291,
4327,
4356,
4384,
4407,
4414,
4417,
4418,
4431,
4432,
4502,
4503,
4573,
4608,
4628,
4650,
4653,
4654,
4674,
4675,
4788,
4789,
4859,
4900,
4944,
4947,
4948,
4960,
4961,
5061,
5062,
5132,
5166,
5210,
5213,
5214,
5231,
5232,
5544,
5545,
5702,
5703,
6007,
6008,
6058,
6109,
6141,
6142,
6158,
6159,
6160,
6209,
6210,
6225,
6226,
6337,
6338,
6387,
6446,
6578,
6702,
6703,
6716,
6717
],
"line_end_idx": [
21,
22,
56,
57,
77,
78,
114,
115,
132,
133,
151,
152,
153,
167,
168,
304,
305,
546,
547,
691,
692,
762,
790,
791,
803,
804,
1292,
1293,
1479,
1480,
1550,
1588,
1609,
1641,
1673,
1675,
1676,
1802,
1803,
1821,
1822,
2044,
2045,
2190,
2191,
2284,
2285,
2559,
2560,
2567,
2568,
2699,
2700,
2770,
2791,
2822,
2841,
2866,
2868,
2869,
2919,
2920,
2990,
3037,
3056,
3081,
3083,
3084,
3151,
3152,
3208,
3298,
3425,
3426,
3437,
3438,
3689,
3690,
3727,
3728,
3817,
3887,
3957,
4003,
4004,
4017,
4018,
4110,
4111,
4181,
4216,
4254,
4255,
4290,
4291,
4327,
4356,
4384,
4407,
4414,
4417,
4418,
4431,
4432,
4502,
4503,
4573,
4608,
4628,
4650,
4653,
4654,
4674,
4675,
4788,
4789,
4859,
4900,
4944,
4947,
4948,
4960,
4961,
5061,
5062,
5132,
5166,
5210,
5213,
5214,
5231,
5232,
5544,
5545,
5702,
5703,
6007,
6008,
6058,
6109,
6141,
6142,
6158,
6159,
6160,
6209,
6210,
6225,
6226,
6337,
6338,
6387,
6446,
6578,
6702,
6703,
6716,
6717,
6959
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6959,
"ccnet_original_nlines": 158,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31014493107795715,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0130434799939394,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24057970941066742,
"rps_doc_frac_unique_words": 0.38729506731033325,
"rps_doc_mean_word_length": 5.545082092285156,
"rps_doc_num_sentences": 81,
"rps_doc_symbol_to_word_ratio": 0.0072463802061975,
"rps_doc_unigram_entropy": 5.358469486236572,
"rps_doc_word_count": 976,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.10643015801906586,
"rps_doc_frac_chars_dupe_6grams": 0.08573540300130844,
"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.014966740272939205,
"rps_doc_frac_chars_top_3gram": 0.020694749429821968,
"rps_doc_frac_chars_top_4gram": 0.02956392988562584,
"rps_doc_books_importance": -490.2832946777344,
"rps_doc_books_importance_length_correction": -490.2832946777344,
"rps_doc_openwebtext_importance": -320.31658935546875,
"rps_doc_openwebtext_importance_length_correction": -320.31658935546875,
"rps_doc_wikipedia_importance": -232.47267150878906,
"rps_doc_wikipedia_importance_length_correction": -232.47267150878906
},
"fasttext": {
"dclm": 0.025951089337468147,
"english": 0.8160336017608643,
"fineweb_edu_approx": 2.600254774093628,
"eai_general_math": 0.8550484776496887,
"eai_open_web_math": 0.22045540809631348,
"eai_web_code": 0.7596262693405151
}
}
|
{
"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.072",
"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": "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": "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
|
-6,272,565,730,317,587,000 |
The Difference Between Joe Sixpack, a Scientist, and an Engineer
Discussion in 'Science and Technology' started by JimBowie1958, Mar 1, 2012.
1. JimBowie1958
Offline
JimBowie1958 Old Fogey
Joined:
Sep 25, 2011
Messages:
37,272
Thanks Received:
5,113
Trophy Points:
1,162
Location:
Fredericksburg, VA
Ratings:
+18,869
The difference here I have seen so many times in my life, I just thought I would share the lesson with this classic discussion of odds.
The set up goes like this: youhave a tossed a coin and it has come up heads one thousand times in a row. What are the odds it will come up either heads or tails on the next toss?
Joe Sixpack will typically say that it should come up tails, because it has come up heads so many times, tails is due.
The Scientist, trained in mathematics, knows that what it has done before has no influence on what the coin will do next. In fact this situation is often used to illustrate odds when results occur in streaks.
The Engineer doesnt care so much about theory, all he cares about is what he sees happen when he does one thing or another, and he knows that the next result will most likely be heads because we have obviously been flipping a flawed coin.
Last edited: Mar 1, 2012
2. editec
Offline
editec Mr. Forgot-it-All
Joined:
Jun 5, 2008
Messages:
41,427
Thanks Received:
5,597
Trophy Points:
48
Location:
Maine
Ratings:
+5,616
And a statistician knows that BLACK SWAN coin flipping events DO happen.
He'd probably still want the check that coin, though, right along with that engineer.
3. Si modo
Offline
Si modo Diamond Member
Joined:
Sep 9, 2009
Messages:
41,538
Thanks Received:
6,382
Trophy Points:
1,810
Location:
St. Eligius
Ratings:
+8,701
Just a point I'd like to make: Most engineers are better trained in mathematics than are scientists, at least more than most chemists and definitely more than biologists. Physicists, about the same. (Math, itself, might be considered a pure science by some, but it's sorta a discipline all on its own.)
Nice story, though. :)
4. JimBowie1958
Offline
JimBowie1958 Old Fogey
Joined:
Sep 25, 2011
Messages:
37,272
Thanks Received:
5,113
Trophy Points:
1,162
Location:
Fredericksburg, VA
Ratings:
+18,869
Being an engineer myself, I am aware of the math requirement, but beyond that, engineers place proven results in real world ennvironments on a much higher priority than academic scientists who are more concerned about being published than building anything that would survive int he real world for very long.
:D
5. JimBowie1958
Offline
JimBowie1958 Old Fogey
Joined:
Sep 25, 2011
Messages:
37,272
Thanks Received:
5,113
Trophy Points:
1,162
Location:
Fredericksburg, VA
Ratings:
+18,869
I am not sure that is an acurate use of the phrase 'black swan event' as that describes a case where something thought previously to be IMPOSSIBLE is suddenly proven possible. The story being that prior to the discovery of the new world, 'you will see a black swan before that thing works' was ion effect taken to mean it was not possible for it to work, whatever it might be.
But if I am mistaken please ejumakate me on it.
Statisticians are to mathematicians as engineers are to physicists, IMO.
6. Si modo
Offline
Si modo Diamond Member
Joined:
Sep 9, 2009
Messages:
41,538
Thanks Received:
6,382
Trophy Points:
1,810
Location:
St. Eligius
Ratings:
+8,701
Ah, then I have a story for you, too:
There is a collegiate competition among three universities for their engineering schools. They are to build a bridge to withstand the exact same conditions that are quite rigorous.
The bridge the Cal Tech students built collapses within 20 minutes after application of the first load. The Cal Tech students can't figure out why it collapsed. They get points for the 20 minutes of success.
The bridge the MIT students built collapses with the first 20 minutes after application of the first load, but the MIT students actually figure out why it did. So, that puts them on the board in the number one position in the competition, eliminating Cal Tech.
The bridge the Purdue students built does not collapse and is still standing after one year of constant and varying loads and strains. And, the students are STILL trying to figure out why. (And, the judges are still scratching their heads as to how to rank them in the competition.)
:)
Last edited: Mar 1, 2012
7. whitehall
Offline
whitehall Gold Member
Joined:
Dec 28, 2010
Messages:
27,186
Thanks Received:
4,225
Trophy Points:
282
Location:
Western Va.
Ratings:
+9,961
Joe Sxpack works for a living. He knows that he has to produce in order to go home with a paycheck. A scientist who is compensated with federal grants is probably as smart as Joe Sixpack but not necessarily so. The scientist instinctively knows that he needs to justify the federal grants and keep the taxpayer funding so he comes up with theories that tend to justify the initial concept of the grant even if it means fudging a couple of data entries to come up with something nice. Joe Sixpack builds bridges and factories. The scientist in question is nothing but a parasite who counts on taxpayer funding.
8. JimBowie1958
Offline
JimBowie1958 Old Fogey
Joined:
Sep 25, 2011
Messages:
37,272
Thanks Received:
5,113
Trophy Points:
1,162
Location:
Fredericksburg, VA
Ratings:
+18,869
Have you ever thought of what kind of conditions you would live in if we had not developed modern science?
In the year 1400 prior to modern science:
If you are today over fifty you would have died by now.
If you are not related to a noble family or a wealthy urban family, then you are likely a peasant and considered a resource of the land your Lord owns, and breaking your back doing very harsh menial labor that has few mechanical aids to lighten your load.
If you ever had a broken bone in all likelihood you would have a fairly useless limb as they had no X-rays to see how well a broken bone had been set and it was rather hit and miss. If you broke you leg you would likely be maimed the rest of your life. Professional sports of today would ahve been regarded as insanely risky back then. It is not because of modern medicine.
If you like eating tomatoes, watermelon, sugar, smoking a cigar, chocolate, coacoa, vanilla, potatoes, pineapples or peanuts you would not have even heard of these things and they were discovered in the Americas, something you have never heard of and would not have ever heard of bec ause no scientists developed acurate ways of measuring longitude and latitude. The Top 10 Foods America Gave the World
If you like reading in good strong light at night, lol, forget it the light bulb was invented less than tw centuries ago. Forget about the internet, TV, radio, or any other means of electronic communication and all invented based on scientific theory.
I could go on but the point is, were it not for science and scientists you would be poor, filthy, living in squalor, hungry and miserable for you short, nasty hand-ass-wiping life.
Personally I think I rather like science. :D
Last edited: Mar 1, 2012
Share This Page
|
{
"url": "http://www.usmessageboard.com/threads/the-difference-between-joe-sixpack-a-scientist-and-an-engineer.210837/",
"source_domain": "www.usmessageboard.com",
"snapshot_id": "crawl=CC-MAIN-2016-44",
"warc_metadata": {
"Content-Length": "92637",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NTBEQOFBMHRJWBMPWA4MUIHQUVQRGWJS",
"WARC-Concurrent-To": "<urn:uuid:d0e67343-ca9e-4749-baae-bece821c8338>",
"WARC-Date": "2016-10-28T12:36:24Z",
"WARC-IP-Address": "209.99.52.83",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:YBVVRFOCLVXCC2LRZ2QEJ27JHE52AHYI",
"WARC-Record-ID": "<urn:uuid:db3bba4a-e390-4df3-9a7e-752cbe79027e>",
"WARC-Target-URI": "http://www.usmessageboard.com/threads/the-difference-between-joe-sixpack-a-scientist-and-an-engineer.210837/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:996d86e6-86a3-40b3-ab6e-2a8363c14687>"
},
"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,
65,
66,
143,
144,
162,
174,
175,
202,
203,
215,
232,
246,
257,
278,
288,
307,
317,
331,
354,
367,
379,
519,
520,
703,
704,
827,
828,
1041,
1042,
1285,
1291,
1320,
1332,
1344,
1345,
1374,
1375,
1387,
1403,
1417,
1428,
1449,
1459,
1478,
1485,
1499,
1509,
1522,
1533,
1610,
1611,
1701,
1707,
1720,
1732,
1733,
1760,
1761,
1773,
1789,
1803,
1814,
1835,
1845,
1864,
1874,
1888,
1904,
1917,
1928,
2235,
2236,
2263,
2269,
2287,
2299,
2300,
2327,
2328,
2340,
2357,
2371,
2382,
2403,
2413,
2432,
2442,
2456,
2479,
2492,
2504,
2817,
2818,
2825,
2831,
2849,
2861,
2862,
2889,
2890,
2902,
2919,
2933,
2944,
2965,
2975,
2994,
3004,
3018,
3041,
3054,
3066,
3447,
3448,
3500,
3501,
3502,
3579,
3585,
3598,
3610,
3611,
3638,
3639,
3651,
3667,
3681,
3692,
3713,
3723,
3742,
3752,
3766,
3782,
3795,
3806,
3848,
3849,
4034,
4035,
4247,
4248,
4513,
4514,
4801,
4802,
4809,
4815,
4844,
4859,
4871,
4872,
4898,
4899,
4911,
4928,
4942,
4953,
4974,
4984,
5003,
5011,
5025,
5041,
5054,
5065,
5679,
5685,
5703,
5715,
5716,
5743,
5744,
5756,
5773,
5787,
5798,
5819,
5829,
5848,
5858,
5872,
5895,
5908,
5920,
6031,
6032,
6078,
6079,
6139,
6140,
6400,
6401,
6779,
6780,
7187,
7188,
7444,
7445,
7630,
7631,
7680,
7686,
7715,
7716
],
"line_end_idx": [
65,
66,
143,
144,
162,
174,
175,
202,
203,
215,
232,
246,
257,
278,
288,
307,
317,
331,
354,
367,
379,
519,
520,
703,
704,
827,
828,
1041,
1042,
1285,
1291,
1320,
1332,
1344,
1345,
1374,
1375,
1387,
1403,
1417,
1428,
1449,
1459,
1478,
1485,
1499,
1509,
1522,
1533,
1610,
1611,
1701,
1707,
1720,
1732,
1733,
1760,
1761,
1773,
1789,
1803,
1814,
1835,
1845,
1864,
1874,
1888,
1904,
1917,
1928,
2235,
2236,
2263,
2269,
2287,
2299,
2300,
2327,
2328,
2340,
2357,
2371,
2382,
2403,
2413,
2432,
2442,
2456,
2479,
2492,
2504,
2817,
2818,
2825,
2831,
2849,
2861,
2862,
2889,
2890,
2902,
2919,
2933,
2944,
2965,
2975,
2994,
3004,
3018,
3041,
3054,
3066,
3447,
3448,
3500,
3501,
3502,
3579,
3585,
3598,
3610,
3611,
3638,
3639,
3651,
3667,
3681,
3692,
3713,
3723,
3742,
3752,
3766,
3782,
3795,
3806,
3848,
3849,
4034,
4035,
4247,
4248,
4513,
4514,
4801,
4802,
4809,
4815,
4844,
4859,
4871,
4872,
4898,
4899,
4911,
4928,
4942,
4953,
4974,
4984,
5003,
5011,
5025,
5041,
5054,
5065,
5679,
5685,
5703,
5715,
5716,
5743,
5744,
5756,
5773,
5787,
5798,
5819,
5829,
5848,
5858,
5872,
5895,
5908,
5920,
6031,
6032,
6078,
6079,
6139,
6140,
6400,
6401,
6779,
6780,
7187,
7188,
7444,
7445,
7630,
7631,
7680,
7686,
7715,
7716,
7731
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7731,
"ccnet_original_nlines": 205,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37323468923568726,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018829859793186188,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22864829003810883,
"rps_doc_frac_unique_words": 0.4043081998825073,
"rps_doc_mean_word_length": 4.632974147796631,
"rps_doc_num_sentences": 60,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.662636756896973,
"rps_doc_word_count": 1207,
"rps_doc_frac_chars_dupe_10grams": 0.14127324521541595,
"rps_doc_frac_chars_dupe_5grams": 0.17060086131095886,
"rps_doc_frac_chars_dupe_6grams": 0.15522174537181854,
"rps_doc_frac_chars_dupe_7grams": 0.15522174537181854,
"rps_doc_frac_chars_dupe_8grams": 0.15522174537181854,
"rps_doc_frac_chars_dupe_9grams": 0.14127324521541595,
"rps_doc_frac_chars_top_2gram": 0.02002860978245735,
"rps_doc_frac_chars_top_3gram": 0.005722459871321917,
"rps_doc_frac_chars_top_4gram": 0.024320460855960846,
"rps_doc_books_importance": -536.363525390625,
"rps_doc_books_importance_length_correction": -536.363525390625,
"rps_doc_openwebtext_importance": -266.70953369140625,
"rps_doc_openwebtext_importance_length_correction": -266.70953369140625,
"rps_doc_wikipedia_importance": -94.41734313964844,
"rps_doc_wikipedia_importance_length_correction": -94.41734313964844
},
"fasttext": {
"dclm": 0.09489352256059647,
"english": 0.9643540978431702,
"fineweb_edu_approx": 2.275364637374878,
"eai_general_math": 0.045491401106119156,
"eai_open_web_math": 0.38267993927001953,
"eai_web_code": 0.0009219099883921444
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "519.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
},
"secondary": {
"code": "620",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": ""
}
}
},
"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": "5",
"label": "Comment Section"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,028,531,374,930,907,000 |
New Question
0
Cloudbase-init 0.9.9 timing and sysprep
asked 2016-11-17 16:47:09 +0200
jrack gravatar image
updated 2016-11-17 16:51:01 +0200
Claudiu Belu gravatar image
So trying out not sysprep'ing my image that was generated on a KVM instance so it theoretically be reused with a simple convert format. I know there be dragons... ;-)
I can see in the initial boot the image goes into a device detection phase and during that detection phase (UI shows 66%) I can see in the console that init tries to connect to metadata and gets an "unreachable network error" which is fatal. After about 5min (which makes me think an internal timeout in the image) the instance will shift to Ready UI will come up and the instance will be then be pingable. If I manually force a reboot cb-init will restart and do what it should w/o an issue.
Couple thoughts....
• Assuming if I sysprep'd that init would not launch till after the devices are really ready and wouldn't hit the fatal and I would just carry the 3x prep annoyances etc.
• Assuming if I did the image prep (no sysprep) on Hyper-V only than the device detection would be shorter or unnecessary and wouldn't hit the fatal
This just creates a bit of a fudge factor with rally which I don't love. Is there a networkReady test that should occur before attempting the metadata pull that would prevent the fatal?
edit retag flag offensive close merge delete
2 answers
Sort by » oldest newest most voted
0
answered 2016-11-17 17:15:58 +0200
Claudiu Belu gravatar image
Hello,
This is might not directly answer your question, but regarding the "unreachable network error", the symptoms you're describing sound like the VM's neutron ports were bound after the VM started.
There is a feature in nova, which basically makes nova-compute wait for Neutron vif plug events before starting the VMs. This ensures that the VMs neutron ports and security groups are already processed and bound, ensuring that the VM will have network connectivity. The config option is called vif_plugging_timeout [1]. There is also a config option calledvif_plugging_is_fatal, which will cause the VM to fail to spawn on a host, if the Neutron vif plug events did not occur during the vif_plugging_is_fatal period.
We've introduced this feature into compute-hyperv in Mitaka.
What OpenStack version are you using? What hypervisor are you using?
[1] http://docs.openstack.org/kilo/config...
Best regards,
Claudiu Belu
edit flag offensive delete link more
Comments
This is on the Liberty driver today, but pushing on my team to upgrade to Mitaka hopefully soon and this is a WinSrv16 TP5. It has been inconsistent so makes sense that maybe neutron is just slow to respond. Don't think a backport is merited in this case, but helps to understand the cause.
jrack gravatar imagejrack ( 2016-11-17 17:23:29 +0200 )edit
So because this is back in neutron its hard to manage this in guest. The fact Server is showing devdetect tells me though there may be some status that cb-init could halt and wait for though?
jrack gravatar imagejrack ( 2016-11-17 17:25:28 +0200 )edit
Know of a way I could confirm the time when the plugging was complete in neutron to try and paint a picture? The plugging completing (or timing out) may be what allows device detect to end and shift to ready.
jrack gravatar imagejrack ( 2016-11-17 17:54:37 +0200 )edit
You will have to set debug=True and verbose=True in the compute node's nova.conf file. Then, when you spawn a VM, and it is waiting for a Neutron VIF plug event, it should look like this in the logs: http://paste.openstack.org/show/589616/
Claudiu Belu gravatar imageClaudiu Belu ( 2016-11-17 18:10:20 +0200 )edit
Also, neutron-hyperv-agent / neutron-ovs-agent logs what ports it processed in its logs. A VM's NIC name is the same as its neutron port name. Also, Windows / Hyper-V Server 2016 has been released, you can give it a try. :) https://www.microsoft.com/en-us/evalcenter/evaluate-hyper-v-server-2016
Claudiu Belu gravatar imageClaudiu Belu ( 2016-11-17 18:15:35 +0200 )edit
0
answered 2016-11-18 13:16:40 +0200
avladu gravatar image
Hello,
This issue you are getting might be related to the network autoconfiguration timeout. Before the shutdown, you need to run: "ipconfig.exe /release"
If this does not solve your issue, can you provide the cloudbase-init logs for debugging?
Thank you, Adrian Vladu
edit flag offensive delete link more
Comments
My lab is currently on paper tape storage so Glance ops have caused a few issues, but I will give that a shot in a bit after I see if I can get some hardware made in this millenia. I manually reboot around that 08:29 time http://paste.openstack.org/show/589708/
jrack gravatar imagejrack ( 2016-11-18 15:32:01 +0200 )edit
Your Answer
Please start posting anonymously - your entry will be published after you log in or create a new account.
Add Answer
Question Tools
1 follower
Stats
Asked: 2016-11-17 16:47:09 +0200
Seen: 233 times
Last updated: Nov 18 '16
|
{
"url": "https://ask.cloudbase.it/question/1712/cloudbase-init-099-timing-and-sysprep/",
"source_domain": "ask.cloudbase.it",
"snapshot_id": "crawl=CC-MAIN-2019-04",
"warc_metadata": {
"Content-Length": "78734",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Y6HCPYQVBQLWKR56I2HZNI4LRHJIXDCR",
"WARC-Concurrent-To": "<urn:uuid:98b29149-4a17-4e6a-a869-0565024462ee>",
"WARC-Date": "2019-01-22T13:24:24Z",
"WARC-IP-Address": "91.232.152.76",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:Y34ZDPQQT5IN4JWOTZDMATW7OXU4SOLZ",
"WARC-Record-ID": "<urn:uuid:8c3172b1-f90e-4f4b-94c1-3875ffe8cb0d>",
"WARC-Target-URI": "https://ask.cloudbase.it/question/1712/cloudbase-init-099-timing-and-sysprep/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2179b5df-0060-4aad-9c70-8db3e9eea05d>"
},
"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-152-117-40.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,
13,
15,
16,
56,
57,
89,
90,
111,
112,
146,
147,
175,
176,
343,
344,
837,
838,
858,
859,
1032,
1183,
1184,
1370,
1371,
1416,
1417,
1427,
1428,
1463,
1465,
1466,
1501,
1502,
1530,
1531,
1538,
1539,
1733,
1734,
2252,
2253,
2314,
2315,
2384,
2385,
2430,
2431,
2445,
2446,
2459,
2460,
2497,
2498,
2507,
2508,
2799,
2800,
2860,
2861,
3053,
3054,
3114,
3115,
3324,
3325,
3385,
3386,
3626,
3627,
3701,
3702,
3998,
3999,
4073,
4075,
4076,
4111,
4112,
4134,
4135,
4142,
4143,
4291,
4292,
4382,
4383,
4407,
4408,
4445,
4446,
4455,
4456,
4718,
4719,
4779,
4780,
4792,
4793,
4899,
4900,
4911,
4912,
4927,
4928,
4939,
4940,
4946,
4947,
4980,
4981,
4997,
4998
],
"line_end_idx": [
13,
15,
16,
56,
57,
89,
90,
111,
112,
146,
147,
175,
176,
343,
344,
837,
838,
858,
859,
1032,
1183,
1184,
1370,
1371,
1416,
1417,
1427,
1428,
1463,
1465,
1466,
1501,
1502,
1530,
1531,
1538,
1539,
1733,
1734,
2252,
2253,
2314,
2315,
2384,
2385,
2430,
2431,
2445,
2446,
2459,
2460,
2497,
2498,
2507,
2508,
2799,
2800,
2860,
2861,
3053,
3054,
3114,
3115,
3324,
3325,
3385,
3386,
3626,
3627,
3701,
3702,
3998,
3999,
4073,
4075,
4076,
4111,
4112,
4134,
4135,
4142,
4143,
4291,
4292,
4382,
4383,
4407,
4408,
4445,
4446,
4455,
4456,
4718,
4719,
4779,
4780,
4792,
4793,
4899,
4900,
4911,
4912,
4927,
4928,
4939,
4940,
4946,
4947,
4980,
4981,
4997,
4998,
5022
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5022,
"ccnet_original_nlines": 112,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.315978467464447,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025134649127721786,
"rps_doc_frac_lines_end_with_ellipsis": 0.017699120566248894,
"rps_doc_frac_no_alph_words": 0.27648115158081055,
"rps_doc_frac_unique_words": 0.4534161388874054,
"rps_doc_mean_word_length": 4.8596272468566895,
"rps_doc_num_sentences": 46,
"rps_doc_symbol_to_word_ratio": 0.002693000016734004,
"rps_doc_unigram_entropy": 5.4177937507629395,
"rps_doc_word_count": 805,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07310838252305984,
"rps_doc_frac_chars_dupe_6grams": 0.04192228987812996,
"rps_doc_frac_chars_dupe_7grams": 0.019938649609684944,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.012269940227270126,
"rps_doc_frac_chars_top_3gram": 0.019427400082349777,
"rps_doc_frac_chars_top_4gram": 0.023773010820150375,
"rps_doc_books_importance": -525.7681884765625,
"rps_doc_books_importance_length_correction": -525.7681884765625,
"rps_doc_openwebtext_importance": -315.4307556152344,
"rps_doc_openwebtext_importance_length_correction": -315.4307556152344,
"rps_doc_wikipedia_importance": -235.0537872314453,
"rps_doc_wikipedia_importance_length_correction": -235.0537872314453
},
"fasttext": {
"dclm": 0.12343412637710571,
"english": 0.9030337333679199,
"fineweb_edu_approx": 1.6411643028259277,
"eai_general_math": 0.3559887409210205,
"eai_open_web_math": 0.1860385537147522,
"eai_web_code": 0.03346985951066017
}
}
|
{
"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.44",
"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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "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,638,791,056,643,032,600 |
Articles of 烧瓶
结合python烧瓶和express.js
我有一个网站应用程序的网站build立在Python烧瓶。 现在我们要在一个页面中介绍实时聊天系统。 build议混合使用flask和express.js，或者只使用express.js来开发聊天页面，使用Flask来rest，或者我们有像python这样的可以和flask一起工作的express.js之类的框架吗？
每次使用Flask或Express时，如何不重新启动服务器？
我是新的Web应用程序开发。 我的问题是…我已经尝试了一些Zend + Apache（PHP），烧瓶（Python），Express下node.js手动开发。 我发现，当我开始在Zend framework + Apache上进行开发时，每当在Controller，Model或Views下PHP的代码更改时，都不需要重新启动Apache。 这是非常方便，快捷！ 但是，如果我使用Flask或Express，则每次更改Controller或Model部分的代码时，都必须重新启动整个应用程序。 如果View部件上有代码更改，则无需重新启动服务器。 但是，这是讨厌的！ 现在，我正在烧瓶上的项目，我怎么能避免每次重新启动服务器？ 问题可以解决，如果我把整个networking应用程序顶部的Nginx？ 非常感谢
authenticationsocket io连接
我如何authentication一个socket.io连接？ 我的应用程序使用来自另一台服务器（python）的login端点来获取令牌，每当用户在节点端打开一个套接字连接时，如何使用该令牌？ io.on('connection', function(socket) { socket.on('message', function(message) { io.emit('message', message); }); }); 而客户端： var token = sessionStorage.token; var socket = io.connect('http://localhost:3000', { query: 'token=' + token }); 如果令牌是在python中创build的： token = jwt.encode(payload, SECRET_KEY, algorithm='HS256') 我怎样才能使用这个令牌来validation节点中的套接字连接？
ReactJS服务器端在Flask中渲染
我刚刚开始学习ReactJS，并确定它是否值得从用于Flask的AngularJS切换。 我知道ReactJS的好处之一是renderToString的工作方式来呈现和HTMLstring更快的加载时间和更好的search引擎优化。 从我读的是SEO比AngularJS可以做的好得多，尽pipe谷歌正在努力提高爬行的Javascript。 我的问题是关于SEO的好处如何与像Flask这样的框架一起工作。 说我有一个像下面的组件，只是把它呈现给我的分区。 如果我想渲染这个服务器端，我需要使用像nodejs或一些可以执行Javascript的Python库的东西？ 如果我尝试做React.renderToString（…..）它不会做任何事情。 如果是这样的话，那么ReactJS的search引擎优化（SEO）的广告效益并不比AngularJS更好呢？ 请帮我理解这一点，如果它有可能呈现JavaScript服务器端与Flask我怎么去实现呢？ var Foo = React.createClass({ render: function() { return ( <div>Foo</div> ); } }); React.render(<Foo />, document.getElementById('foo'));
为什么我的Flask应用程序在Heroku上被检测为node.js
我最近对heroku托pipe的Flask应用程序的结构进行了一些更改，现在，heroku已经决定将其作为Python应用程序的Node.js应用程序intead进行检测。 我的应用程序使用python（Flask）作为后端api，而javascript作为前端。 我所做的更改包括将npm和bower集成到我的应用程序中，以简化应用程序的JavaScript开发。
|
{
"url": "http://nodejscore.com/node.js/1265",
"source_domain": "nodejscore.com",
"snapshot_id": "crawl=CC-MAIN-2018-30",
"warc_metadata": {
"Content-Length": "16519",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:H4B2J72FVKRGIVAHH7XB4XZUTGH4QAAZ",
"WARC-Concurrent-To": "<urn:uuid:7e24ae29-1fdf-4f8f-aaf1-be6ff2da6b0e>",
"WARC-Date": "2018-07-19T21:16:52Z",
"WARC-IP-Address": "45.33.24.75",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ZOT2C7T6JII7AGYOAUD76GWU4GVMGFWQ",
"WARC-Record-ID": "<urn:uuid:55ad8b5e-8d7e-4a42-948e-d1522e9590d9>",
"WARC-Target-URI": "http://nodejscore.com/node.js/1265",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7e72f237-eea1-4e47-b9fd-60d4412c4aaf>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-141-15-74.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-30\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for July 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
15,
16,
38,
39,
199,
200,
231,
232,
588,
589,
615,
616,
1064,
1065,
1086,
1087,
1652,
1653,
1687,
1688
],
"line_end_idx": [
15,
16,
38,
39,
199,
200,
231,
232,
588,
589,
615,
616,
1064,
1065,
1086,
1087,
1652,
1653,
1687,
1688,
1871
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1871,
"ccnet_original_nlines": 20,
"rps_doc_curly_bracket": 0.005344740115106106,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.010526319965720177,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014035089872777462,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6035087704658508,
"rps_doc_frac_unique_words": 0.9285714030265808,
"rps_doc_mean_word_length": 23.799999237060547,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0.007017539814114571,
"rps_doc_unigram_entropy": 4.122195243835449,
"rps_doc_word_count": 70,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -139.4224090576172,
"rps_doc_books_importance_length_correction": -139.40550231933594,
"rps_doc_openwebtext_importance": -75.82073974609375,
"rps_doc_openwebtext_importance_length_correction": -75.82073974609375,
"rps_doc_wikipedia_importance": -75.58133697509766,
"rps_doc_wikipedia_importance_length_correction": -75.58132934570312
},
"fasttext": {
"dclm": 0.9938210844993591,
"english": 0.004664219915866852,
"fineweb_edu_approx": 2.640059471130371,
"eai_general_math": 0.01730578951537609,
"eai_open_web_math": 0.000053640000260202214,
"eai_web_code": 0.5792828798294067
}
}
|
{
"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.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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
|
2,553,915,398,174,765,000 |
MJPEG to MP3 Converter
Convert your mjpeg files to mp3 online & free
Drop files here. 100 MB maximum file size or Sign Up
to
mjpeg
Motion JPEG
MJPEG is a format of multimedia data, which uses a frame-by-frame video track compression technology JPEG. This codec does not encode the difference (movement) between frames, whereby the image in some places does not turn out smooth enough. The main advantage of this format is the low requirements to hardware computational power, which, in turn, leads to a low level of compression and a larger resulting file size. It is actively used in web and IP-cameras.
mp3
MP3 Audio Format
Is the most common format for storing audio. Almost any player on any platform can open mp3 files. The audio is compressed with loss of quality, but the loss is negligible for the typical user, and the file size is usually less than that of the original files.
How to convert MJPEG to MP3
Step 1
Upload mjpeg-file(s)
Select files from Computer, Google Drive, Dropbox, URL or by dragging it on the page.
Step 2
Choose "to mp3"
Choose mp3 or any other format you need as a result (more than 200 formats supported)
Step 3
Download your mp3
Let the file convert and you can download your mp3 file right afterwards
|
{
"url": "https://convertio.co/mjpeg-mp3/",
"source_domain": "convertio.co",
"snapshot_id": "crawl=CC-MAIN-2019-43",
"warc_metadata": {
"Content-Length": "66793",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:U5VFN2DGSKZV62E73AFC2ALE7ICBVAI2",
"WARC-Concurrent-To": "<urn:uuid:8a3f2777-960c-4dba-80f4-fd3bf3382c74>",
"WARC-Date": "2019-10-13T20:13:01Z",
"WARC-IP-Address": "5.9.152.237",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:TTJMJC64CBE3OXTI2RPK3SLEA3U4DLOC",
"WARC-Record-ID": "<urn:uuid:5e7081af-086d-4b59-8e66-559bd251cec3>",
"WARC-Target-URI": "https://convertio.co/mjpeg-mp3/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ba6caa01-2fae-4604-8ff1-c8d372497012>"
},
"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-24.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,
23,
24,
70,
71,
124,
127,
128,
134,
135,
147,
148,
610,
611,
615,
616,
633,
634,
895,
896,
924,
925,
932,
933,
954,
955,
1041,
1042,
1049,
1050,
1066,
1067,
1153,
1154,
1161,
1162,
1180,
1181
],
"line_end_idx": [
23,
24,
70,
71,
124,
127,
128,
134,
135,
147,
148,
610,
611,
615,
616,
633,
634,
895,
896,
924,
925,
932,
933,
954,
955,
1041,
1042,
1049,
1050,
1066,
1067,
1153,
1154,
1161,
1162,
1180,
1181,
1253
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1253,
"ccnet_original_nlines": 37,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.359375,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04296875,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14453125,
"rps_doc_frac_unique_words": 0.5753424763679504,
"rps_doc_mean_word_length": 4.49315071105957,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.535812854766846,
"rps_doc_word_count": 219,
"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.020325200632214546,
"rps_doc_frac_chars_top_3gram": 0.020325200632214546,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -131.4808349609375,
"rps_doc_books_importance_length_correction": -131.4808349609375,
"rps_doc_openwebtext_importance": -79.73865509033203,
"rps_doc_openwebtext_importance_length_correction": -79.73865509033203,
"rps_doc_wikipedia_importance": -55.80060958862305,
"rps_doc_wikipedia_importance_length_correction": -55.80060958862305
},
"fasttext": {
"dclm": 0.031366050243377686,
"english": 0.8649798035621643,
"fineweb_edu_approx": 2.0772454738616943,
"eai_general_math": 0.12768292427062988,
"eai_open_web_math": 0.2222156524658203,
"eai_web_code": 0.009804129600524902
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "006.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Cognitive science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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
|
-1,945,163,829,316,128,000 |
intra-mart Accel Platform IMBox プログラミングガイド 第4版 2014-05-01
5. 送信側 IM-Propagation 追加プログラム
IMBoxでは受信側の IM-Propagation を用意しています。
送信側の実装を行うことで、IM-Propagation を利用して「 受信側 IM-Propagation 一覧 」に記載している処理が実行可能となります。
IM-Propagation についての詳細は、以下のドキュメントを参照してください。
5.1. 受信側 IM-Propagation 一覧
IMBoxで利用可能な受信側の IM-Propagation は以下となります。
IMBox受信側 IM-Propagation 一覧表
データの操作種別 概要
WATCH アプリケーションのウォッチを行います。
UNWATCH アプリケーションのウォッチ解除を行います。
SEND_NOTICE_MESSAGE ApplicationBoxへ通知メッセージを投稿します。（メッセージ形式で表示）
SEND_NOTICE_THREAD ApplicationBoxへ通知メッセージを投稿します。（スレッド形式で表示）
SEND_WATCH_MESSAGE ApplicationBoxへwatchユーザ宛てのメッセージを投稿します。（メッセージ形式で表示）
SEND_WATCH_THREAD ApplicationBoxへwatchユーザ宛てのメッセージを投稿します。（スレッド形式で表示）
5.2. サンプル実装
ここではサンプルとして、「ApplicationBoxへのwatchユーザ宛てのメッセージ投稿（メッセージ形式で表示）」の送信側の実装方法について説明します。
作成する資材は以下となります。
コラム
注意
5.2.1. 送信するデータを格納するためのクラスの作成
送信するデータを格納するためのクラス（以下、「独自モデル」）を作成します。
送信するデータを格納するためのクラス
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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
package jp.co.intra_mart.sample.model;
import java.io.Serializable;
import java.util.Map;
/**
* ApplicationBoxへのwatchユーザ宛てのメッセージ投稿（メッセージ形式で表示） 用の
* 送信するデータを格納するための独自モデルクラス
*/
public class SampleOriginalModel implements Serializable {
/** バージョン番号（新しく採番してください） */
private static final long serialVersionUID = 1234567890123456789L;
/** アプリケーションCD */
private String applicationCd;
/** 通知元ユーザのユーザCD */
private String sendUserCd;
/** 通知内容 */
private String messageText;
/** 投稿uri */
private String uri;
/** 投稿uriタイトル */
private String uriTitle;
/** URI添付ID */
private String uriAttachId;
/** 投稿uri内容 */
private String uriText;
/** 投稿URI添付パス */
private String uriAttachPath;
/** メッセージ種別コード */
private String messageTypeCd;
/** その他の属性 */
private Map<String, String> attributes;
/** ウォッチ対象の識別CD（複数指定可能） */
private String[] targetIds;
public String getApplicationCd() {
return applicationCd;
}
public Map<String, String> getAttributes() {
return attributes;
}
public String getMessageText() {
return messageText;
}
public String getMessageTypeCd() {
return messageTypeCd;
}
public String getSendUserCd() {
return sendUserCd;
}
public String[] getTargetIds() {
return targetIds;
}
public String getUri() {
return uri;
}
public String getUriAttachId() {
return uriAttachId;
}
public String getUriAttachPath() {
return uriAttachPath;
}
public String getUriText() {
return uriText;
}
public String getUriTitle() {
return uriTitle;
}
public void setApplicationCd(final String applicationCd) {
this.applicationCd = applicationCd;
}
public void setAttributes(final Map<String, String> attributes) {
this.attributes = attributes;
}
public void setMessageText(final String messageText) {
this.messageText = messageText;
}
public void setMessageTypeCd(final String messageTypeCd) {
this.messageTypeCd = messageTypeCd;
}
public void setSendUserCd(final String sendUserCd) {
this.sendUserCd = sendUserCd;
}
public void setTargetIds(String[] targetIds) {
this.targetIds = targetIds;
}
public void setUri(final String uri) {
this.uri = uri;
}
public void setUriAttachId(final String uriAttachId) {
this.uriAttachId = uriAttachId;
}
public void setUriAttachPath(final String uriAttachPath) {
this.uriAttachPath = uriAttachPath;
}
public void setUriText(final String uriText) {
this.uriText = uriText;
}
public void setUriTitle(final String uriTitle) {
this.uriTitle = uriTitle;
}
}
5.2.2. 送信側のデータ変換クラス（Encoder）の作成
「独自モデル」を「送受信モデル（Generic）」に変換する機能を提供するクラス（以下、「データ変換クラス」）を作成します。
送信側のデータ変換クラス
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
package jp.co.intra_mart.sample.encoder;
import java.util.LinkedHashMap;
import java.util.Map;
import java.util.Map.Entry;
import jp.co.intra_mart.foundation.propagation.exception.ConvertException;
import jp.co.intra_mart.foundation.propagation.model.generic.imbox.GenericSendWatchMessage;
import jp.co.intra_mart.foundation.propagation.sender.AbstractEncoder;
import jp.co.intra_mart.sample.model.SampleOriginalModel;
/**
* ApplicationBoxへのwatchユーザ宛てのメッセージ投稿（メッセージ形式で表示） 用の
* 送信側のデータ変換クラス（Encoder）です。
*/
public class SampleEncoder extends AbstractEncoder<SampleOriginalModel, GenericSendWatchMessage> {
/**
* @param model 変換前クラス
* @return 変換後クラス
* @throws ConvertException
*/
@Override
public GenericSendNoticeThread encode(final SampleOriginalModel model) throws ConvertException {
final GenericSendWatchMessage generic = new GenericSendWatchMessage();
generic.setApplicationCd(model.getApplicationCd());
generic.setSendUserCd(model.getSendUserCd());
generic.setMessageText(model.getMessageText());
generic.setUri(model.getUri());
generic.setUriTitle(model.getUriTitle());
generic.setUriAttachId(model.getUriAttachId());
generic.setUriText(model.getUriText());
generic.setUriAttachPath(model.getUriAttachPath());
generic.setMessageTypeCd(model.getMessageTypeCd());
generic.setTargetIds(model.getTargetIds());
if (null != model.getAttributes()) {
final Map<String, String> map = new LinkedHashMap<String, String>();
for (final Entry<String, String> attribute : model.getAttributes().entrySet()) {
map.put(attribute.getKey(), attribute.getValue());
}
generic.setAttributes(map);
}
return generic;
}
@Override
public Class<GenericSendWatchMessage> getGenericDataClass() {
return GenericSendWatchMessage.class;
}
}
コラム
IMBoxの「送受信モデル（Generic）」についての詳細は、「 APIドキュメント 」 を参照してください。
5.2.3. マッピング設定の作成
「独自モデル」「送受信モデル（Generic）」「データ変換クラス」を紐付けるためのマッピング設定を作成します。
マッピング設定は、以下の形式で記述します。
• WEB-INF/conf/propagation-senders-config/{任意のファイル名}.xml
マッピング設定
1
2
3
4
5
6
7
8
<?xml version="1.0" encoding="UTF-8"?>
<propagation-senders-config xmlns="http://www.intra-mart.jp/propagation/senders-config"
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
xsi:schemaLocation="http://www.intra-mart.jp/propagation/senders-config propagation-senders-config.xsd">
<sender source="jp.co.intra_mart.sample.model.SampleOriginalModel" operationType="SEND_WATCH_MESSAGE">
<encoder class="jp.co.intra_mart.sample.encoder.SampleEncoder" />
</sender>
</propagation-senders-config>
<sender> タグに以下の属性の設定を行います。
属性 内容 備考
source 「独自モデル」のパッケージ名を含むクラス名（完全修飾子） 送信するデータを格納するためのクラスの作成 で作成した独自モデルを設定します。
operationType データ変換対象の「データの操作種別」 ApplicationBoxへのwatchユーザ宛てのメッセージ投稿（メッセージ形式で表示）のデータの操作種別を設定します。
<encoder> タグに以下の属性の設定を行います。
属性 内容 備考
class 「データ変換クラス」のパッケージ名を含むクラス名（完全修飾子） 送信側のデータ変換クラス（Encoder）の作成 で作成したデータ変換クラスを設定します。
コラム
データの操作種別についての詳細は、「 IM-Propagation 送受信設定一覧 」-「 IM-Propagation 受信側一覧 」を参照してください。
5.2.4. データ送信処理を作成
データの送信処理を作成します。
作成したデータ送信処理（以下）を、アプリケーションから通知をしたいタイミングでコールしてください。
データ送信処理
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
package jp.co.intra_mart.sample.sender;
import jp.co.intra_mart.sample.model.SampleOriginalModel;
/**
* データ送信処理のサンプル実装です
*/
public class SampleSender {
/**
* データ送信処理です。
* アプリケーションから通知をしたいタイミングでコールしてください。
*
* @param sampleOriginalModel 独自モデル
*/
public static void send(final SampleOriginalModel sampleOriginalModel) {
final PropagationManager manager = PropagationManagerFactory.getInstance().getPropagationManager();
try {
// セッションを開始
manager.begin();
// データを送信
manager.send("SEND_WATCH_MESSAGE", SampleOriginalModel.class, sampleOriginalModel, EmptyObject.class);
// セッションを確定
manager.decide();
} catch (final BeginException e) {
// manager.begin() に失敗した場合
} catch (final SendException e) {
// manager.send() に失敗した場合
} catch (final DecideException e) {
// manager.decide() に失敗した場合
} catch (final Exception e) {
// その他例外が発生した場合
} finally {
// セッションを中断。 manager.decide() が成功した場合は何もしない
manager.abort();
}
}
}
上記の処理がコールされた場合に、ウォッチを行ったユーザのApplicationBoxにwatchユーザ宛てのメッセージが表示されます。
|
{
"url": "https://document.intra-mart.jp/library/iap/public/imbox/imbox_programming_guide/texts/propagation/index.html",
"source_domain": "document.intra-mart.jp",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "55099",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TPH4U6D6MWEEGQ4E2UFLXH6OWXUSCV3Y",
"WARC-Concurrent-To": "<urn:uuid:714c44be-5abe-42a5-8aab-188f732c526e>",
"WARC-Date": "2022-08-16T18:31:36Z",
"WARC-IP-Address": "54.95.201.8",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:N2HTUDSYL4DEENQFWHLZQRBZRG2B32YV",
"WARC-Record-ID": "<urn:uuid:bdd08f8c-18a5-47dc-a8ae-8da4f4af01d9>",
"WARC-Target-URI": "https://document.intra-mart.jp/library/iap/public/imbox/imbox_programming_guide/texts/propagation/index.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:76dcd8ca-6c6e-4a92-b221-56c93121aea5>"
},
"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-71\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,
58,
59,
89,
90,
127,
206,
250,
251,
278,
279,
320,
348,
360,
386,
416,
478,
538,
608,
676,
677,
689,
690,
770,
786,
787,
791,
792,
795,
796,
825,
826,
864,
883,
887,
891,
895,
899,
903,
907,
911,
915,
919,
923,
927,
931,
935,
939,
943,
947,
951,
955,
959,
963,
967,
971,
975,
979,
983,
987,
991,
995,
999,
1003,
1007,
1011,
1015,
1019,
1023,
1027,
1031,
1035,
1039,
1043,
1047,
1051,
1055,
1059,
1063,
1067,
1071,
1075,
1079,
1083,
1087,
1091,
1095,
1099,
1103,
1107,
1111,
1115,
1119,
1123,
1127,
1131,
1135,
1139,
1143,
1147,
1151,
1155,
1159,
1163,
1167,
1171,
1175,
1179,
1183,
1187,
1191,
1195,
1199,
1203,
1207,
1211,
1215,
1219,
1223,
1227,
1231,
1235,
1239,
1243,
1247,
1251,
1255,
1259,
1263,
1267,
1271,
1275,
1279,
1283,
1287,
1291,
1295,
1299,
1303,
1307,
1311,
1315,
1319,
1323,
1327,
1331,
1335,
1339,
1343,
1347,
1351,
1355,
1359,
1363,
1367,
1371,
1375,
1379,
1383,
1387,
1391,
1395,
1399,
1403,
1407,
1411,
1415,
1419,
1423,
1462,
1463,
1492,
1514,
1515,
1519,
1572,
1599,
1603,
1662,
1663,
1695,
1766,
1767,
1789,
1823,
1824,
1848,
1879,
1880,
1896,
1928,
1929,
1946,
1970,
1971,
1992,
2021,
2022,
2041,
2073,
2074,
2093,
2121,
2122,
2143,
2177,
2178,
2200,
2234,
2235,
2253,
2297,
2298,
2329,
2361,
2362,
2401,
2431,
2437,
2438,
2487,
2514,
2520,
2521,
2558,
2586,
2592,
2593,
2632,
2662,
2668,
2669,
2705,
2732,
2738,
2739,
2776,
2802,
2808,
2809,
2838,
2858,
2864,
2865,
2902,
2930,
2936,
2937,
2976,
3006,
3012,
3013,
3046,
3070,
3076,
3077,
3111,
3136,
3142,
3143,
3206,
3250,
3256,
3257,
3327,
3365,
3371,
3372,
3431,
3471,
3477,
3478,
3541,
3585,
3591,
3592,
3649,
3687,
3693,
3694,
3745,
3781,
3787,
3788,
3831,
3855,
3861,
3862,
3921,
3961,
3967,
3968,
4031,
4075,
4081,
4082,
4133,
4165,
4171,
4172,
4225,
4259,
4265,
4267,
4268,
4300,
4301,
4364,
4377,
4380,
4383,
4386,
4389,
4392,
4395,
4398,
4401,
4404,
4407,
4410,
4413,
4416,
4419,
4422,
4425,
4428,
4431,
4434,
4437,
4440,
4443,
4446,
4449,
4452,
4455,
4458,
4461,
4464,
4467,
4470,
4473,
4476,
4479,
4482,
4485,
4488,
4491,
4494,
4497,
4500,
4503,
4506,
4509,
4512,
4515,
4518,
4521,
4524,
4527,
4530,
4571,
4572,
4604,
4626,
4654,
4655,
4730,
4822,
4893,
4951,
4952,
4956,
5009,
5037,
5041,
5140,
5141,
5149,
5176,
5198,
5231,
5239,
5253,
5354,
5363,
5442,
5502,
5556,
5612,
5652,
5702,
5758,
5806,
5866,
5926,
5978,
6023,
6104,
6197,
6264,
6278,
6318,
6328,
6352,
6358,
6359,
6373,
6439,
6485,
6491,
6493,
6494,
6498,
6499,
6556,
6557,
6575,
6576,
6633,
6655,
6714,
6722,
6724,
6726,
6728,
6730,
6732,
6734,
6736,
6738,
6777,
6866,
6925,
7034,
7139,
7209,
7221,
7251,
7278,
7287,
7363,
7459,
7487,
7496,
7580,
7581,
7585,
7586,
7665,
7666,
7684,
7685,
7701,
7751,
7759,
7762,
7765,
7768,
7771,
7774,
7777,
7780,
7783,
7786,
7789,
7792,
7795,
7798,
7801,
7804,
7807,
7810,
7813,
7816,
7819,
7822,
7825,
7828,
7831,
7834,
7837,
7840,
7843,
7846,
7849,
7852,
7855,
7858,
7861,
7864,
7867,
7870,
7873,
7876,
7916,
7917,
7975,
7976,
7980,
8000,
8004,
8032,
8033,
8034,
8042,
8060,
8100,
8108,
8148,
8156,
8233,
8341,
8355,
8379,
8408,
8430,
8545,
8568,
8598,
8641,
8680,
8722,
8760,
8804,
8844,
8882,
8910,
8930,
8983,
9012,
9022,
9028,
9030
],
"line_end_idx": [
58,
59,
89,
90,
127,
206,
250,
251,
278,
279,
320,
348,
360,
386,
416,
478,
538,
608,
676,
677,
689,
690,
770,
786,
787,
791,
792,
795,
796,
825,
826,
864,
883,
887,
891,
895,
899,
903,
907,
911,
915,
919,
923,
927,
931,
935,
939,
943,
947,
951,
955,
959,
963,
967,
971,
975,
979,
983,
987,
991,
995,
999,
1003,
1007,
1011,
1015,
1019,
1023,
1027,
1031,
1035,
1039,
1043,
1047,
1051,
1055,
1059,
1063,
1067,
1071,
1075,
1079,
1083,
1087,
1091,
1095,
1099,
1103,
1107,
1111,
1115,
1119,
1123,
1127,
1131,
1135,
1139,
1143,
1147,
1151,
1155,
1159,
1163,
1167,
1171,
1175,
1179,
1183,
1187,
1191,
1195,
1199,
1203,
1207,
1211,
1215,
1219,
1223,
1227,
1231,
1235,
1239,
1243,
1247,
1251,
1255,
1259,
1263,
1267,
1271,
1275,
1279,
1283,
1287,
1291,
1295,
1299,
1303,
1307,
1311,
1315,
1319,
1323,
1327,
1331,
1335,
1339,
1343,
1347,
1351,
1355,
1359,
1363,
1367,
1371,
1375,
1379,
1383,
1387,
1391,
1395,
1399,
1403,
1407,
1411,
1415,
1419,
1423,
1462,
1463,
1492,
1514,
1515,
1519,
1572,
1599,
1603,
1662,
1663,
1695,
1766,
1767,
1789,
1823,
1824,
1848,
1879,
1880,
1896,
1928,
1929,
1946,
1970,
1971,
1992,
2021,
2022,
2041,
2073,
2074,
2093,
2121,
2122,
2143,
2177,
2178,
2200,
2234,
2235,
2253,
2297,
2298,
2329,
2361,
2362,
2401,
2431,
2437,
2438,
2487,
2514,
2520,
2521,
2558,
2586,
2592,
2593,
2632,
2662,
2668,
2669,
2705,
2732,
2738,
2739,
2776,
2802,
2808,
2809,
2838,
2858,
2864,
2865,
2902,
2930,
2936,
2937,
2976,
3006,
3012,
3013,
3046,
3070,
3076,
3077,
3111,
3136,
3142,
3143,
3206,
3250,
3256,
3257,
3327,
3365,
3371,
3372,
3431,
3471,
3477,
3478,
3541,
3585,
3591,
3592,
3649,
3687,
3693,
3694,
3745,
3781,
3787,
3788,
3831,
3855,
3861,
3862,
3921,
3961,
3967,
3968,
4031,
4075,
4081,
4082,
4133,
4165,
4171,
4172,
4225,
4259,
4265,
4267,
4268,
4300,
4301,
4364,
4377,
4380,
4383,
4386,
4389,
4392,
4395,
4398,
4401,
4404,
4407,
4410,
4413,
4416,
4419,
4422,
4425,
4428,
4431,
4434,
4437,
4440,
4443,
4446,
4449,
4452,
4455,
4458,
4461,
4464,
4467,
4470,
4473,
4476,
4479,
4482,
4485,
4488,
4491,
4494,
4497,
4500,
4503,
4506,
4509,
4512,
4515,
4518,
4521,
4524,
4527,
4530,
4571,
4572,
4604,
4626,
4654,
4655,
4730,
4822,
4893,
4951,
4952,
4956,
5009,
5037,
5041,
5140,
5141,
5149,
5176,
5198,
5231,
5239,
5253,
5354,
5363,
5442,
5502,
5556,
5612,
5652,
5702,
5758,
5806,
5866,
5926,
5978,
6023,
6104,
6197,
6264,
6278,
6318,
6328,
6352,
6358,
6359,
6373,
6439,
6485,
6491,
6493,
6494,
6498,
6499,
6556,
6557,
6575,
6576,
6633,
6655,
6714,
6722,
6724,
6726,
6728,
6730,
6732,
6734,
6736,
6738,
6777,
6866,
6925,
7034,
7139,
7209,
7221,
7251,
7278,
7287,
7363,
7459,
7487,
7496,
7580,
7581,
7585,
7586,
7665,
7666,
7684,
7685,
7701,
7751,
7759,
7762,
7765,
7768,
7771,
7774,
7777,
7780,
7783,
7786,
7789,
7792,
7795,
7798,
7801,
7804,
7807,
7810,
7813,
7816,
7819,
7822,
7825,
7828,
7831,
7834,
7837,
7840,
7843,
7846,
7849,
7852,
7855,
7858,
7861,
7864,
7867,
7870,
7873,
7876,
7916,
7917,
7975,
7976,
7980,
8000,
8004,
8032,
8033,
8034,
8042,
8060,
8100,
8108,
8148,
8156,
8233,
8341,
8355,
8379,
8408,
8430,
8545,
8568,
8598,
8641,
8680,
8722,
8760,
8804,
8844,
8882,
8910,
8930,
8983,
9012,
9022,
9028,
9030,
9097
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9097,
"ccnet_original_nlines": 532,
"rps_doc_curly_bracket": 0.008134550414979458,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.018987340852618217,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017721520736813545,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6341772079467773,
"rps_doc_frac_unique_words": 0.559540867805481,
"rps_doc_mean_word_length": 9.364418983459473,
"rps_doc_num_sentences": 144,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.554743766784668,
"rps_doc_word_count": 697,
"rps_doc_frac_chars_dupe_10grams": 0.03906847909092903,
"rps_doc_frac_chars_dupe_5grams": 0.040294159203767776,
"rps_doc_frac_chars_dupe_6grams": 0.040294159203767776,
"rps_doc_frac_chars_dupe_7grams": 0.040294159203767776,
"rps_doc_frac_chars_dupe_8grams": 0.040294159203767776,
"rps_doc_frac_chars_dupe_9grams": 0.03906847909092903,
"rps_doc_frac_chars_top_2gram": 0.01685306988656521,
"rps_doc_frac_chars_top_3gram": 0.0018385200528427958,
"rps_doc_frac_chars_top_4gram": 0.0024513599928468466,
"rps_doc_books_importance": -651.1065673828125,
"rps_doc_books_importance_length_correction": -651.1065673828125,
"rps_doc_openwebtext_importance": -446.7226867675781,
"rps_doc_openwebtext_importance_length_correction": -446.7226867675781,
"rps_doc_wikipedia_importance": -391.88116455078125,
"rps_doc_wikipedia_importance_length_correction": -391.88116455078125
},
"fasttext": {
"dclm": 0.8697763681411743,
"english": 0.02001084014773369,
"fineweb_edu_approx": 1.2419530153274536,
"eai_general_math": 0.33287352323532104,
"eai_open_web_math": 0.48867398500442505,
"eai_web_code": 0.20848673582077026
}
}
|
{
"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": "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
|
5,266,464,887,333,965,000 |
Previous: zgbtrs Up: ../lapack-z.html Next: zgebal
zgebak
NAME
ZGEBAK - form the right or left eigenvectors of a complex
general matrix by backward transformation on the computed
eigenvectors of the balanced matrix output by ZGEBAL
SYNOPSIS
SUBROUTINE ZGEBAK( JOB, SIDE, N, ILO, IHI, SCALE, M, V, LDV,
INFO )
CHARACTER JOB, SIDE
INTEGER IHI, ILO, INFO, LDV, M, N
DOUBLE PRECISION SCALE( * )
COMPLEX*16 V( LDV, * )
PURPOSE
ZGEBAK forms the right or left eigenvectors of a complex
general matrix by backward transformation on the computed
eigenvectors of the balanced matrix output by ZGEBAL.
ARGUMENTS
JOB (input) CHARACTER*1
Specifies the type of backward transformation
required: = 'N', do nothing, return immediately; =
'P', do backward transformation for permutation
only; = 'S', do backward transformation for scaling
only; = 'B', do backward transformations for both
permutation and scaling. JOB must be the same as
the argument JOB supplied to ZGEBAL.
SIDE (input) CHARACTER*1
= 'R': V contains right eigenvectors;
= 'L': V contains left eigenvectors.
N (input) INTEGER
The number of rows of the matrix V. N >= 0.
ILO (input) INTEGER
IHI (input) INTEGER The integers ILO and IHI
determined by ZGEBAL.
SCALE (input) DOUBLE PRECISION array, dimension (N)
Details of the permutation and scaling factors, as
returned by ZGEBAL.
M (input) INTEGER
The number of columns of the matrix V.
V (input/output) COMPLEX*16 array, dimension (LDV,M)
On entry, the matrix of right or left eigenvectors
to be transformed, as returned by ZHSEIN or ZTREVC.
On exit, V is overwritten by the transformed eigen-
vectors.
LDV (input) INTEGER
The leading dimension of the array V. LDV >=
max(1,N).
INFO (output) INTEGER
= 0: successful exit.
< 0: if INFO = -i, the i-th argument had an illegal
value.
|
{
"url": "http://www.math.utah.edu/software/lapack/lapack-z/zgebak.html",
"source_domain": "www.math.utah.edu",
"snapshot_id": "crawl=CC-MAIN-2018-30",
"warc_metadata": {
"Content-Length": "3480",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QEZCQC76XGLUNDCWFCUXTDQDGGOHDE22",
"WARC-Concurrent-To": "<urn:uuid:bbe13941-7cfb-4c24-a64c-7fae5a32dfad>",
"WARC-Date": "2018-07-19T15:10:19Z",
"WARC-IP-Address": "155.101.98.133",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:N5EIC7LECKGVAR3EQRU4PURC3WMXS3TY",
"WARC-Record-ID": "<urn:uuid:83c226f3-7ff6-4f6e-9bcb-8b9186d64008>",
"WARC-Target-URI": "http://www.math.utah.edu/software/lapack/lapack-z/zgebak.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ef85a400-afca-4fb3-80ee-1a838df145a0>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-47-163.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-30\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for July 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
51,
52,
53,
60,
61,
62,
68,
132,
196,
255,
256,
266,
333,
365,
366,
401,
402,
453,
454,
500,
501,
538,
539,
548,
611,
675,
735,
736,
747,
781,
841,
906,
968,
1034,
1098,
1162,
1213,
1214,
1248,
1301,
1353,
1354,
1384,
1443,
1444,
1474,
1537,
1573,
1574,
1634,
1699,
1733,
1734,
1764,
1817,
1818,
1883,
1884,
1949,
2015,
2081,
2104,
2105,
2135,
2194,
2218,
2219,
2250,
2287,
2354
],
"line_end_idx": [
51,
52,
53,
60,
61,
62,
68,
132,
196,
255,
256,
266,
333,
365,
366,
401,
402,
453,
454,
500,
501,
538,
539,
548,
611,
675,
735,
736,
747,
781,
841,
906,
968,
1034,
1098,
1162,
1213,
1214,
1248,
1301,
1353,
1354,
1384,
1443,
1444,
1474,
1537,
1573,
1574,
1634,
1699,
1733,
1734,
1764,
1817,
1818,
1883,
1884,
1949,
2015,
2081,
2104,
2105,
2135,
2194,
2218,
2219,
2250,
2287,
2354,
2374
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2374,
"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.20347395539283752,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.2109181135892868,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.31513649225234985,
"rps_doc_frac_unique_words": 0.3919413983821869,
"rps_doc_mean_word_length": 4.989010810852051,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.311131477355957,
"rps_doc_word_count": 273,
"rps_doc_frac_chars_dupe_10grams": 0.1923641711473465,
"rps_doc_frac_chars_dupe_5grams": 0.22613802552223206,
"rps_doc_frac_chars_dupe_6grams": 0.1923641711473465,
"rps_doc_frac_chars_dupe_7grams": 0.1923641711473465,
"rps_doc_frac_chars_dupe_8grams": 0.1923641711473465,
"rps_doc_frac_chars_dupe_9grams": 0.1923641711473465,
"rps_doc_frac_chars_top_2gram": 0.022026430815458298,
"rps_doc_frac_chars_top_3gram": 0.044052861630916595,
"rps_doc_frac_chars_top_4gram": 0.050660789012908936,
"rps_doc_books_importance": -244.04237365722656,
"rps_doc_books_importance_length_correction": -244.04237365722656,
"rps_doc_openwebtext_importance": -139.35260009765625,
"rps_doc_openwebtext_importance_length_correction": -139.35260009765625,
"rps_doc_wikipedia_importance": -86.27050018310547,
"rps_doc_wikipedia_importance_length_correction": -86.27050018310547
},
"fasttext": {
"dclm": 0.7359175086021423,
"english": 0.7401268482208252,
"fineweb_edu_approx": 2.7009546756744385,
"eai_general_math": 0.9921022057533264,
"eai_open_web_math": 0.6648526191711426,
"eai_web_code": 0.9074361324310303
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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
|
-4,286,328,418,227,821,600 |
tipmoose
Registered
For threads that are redirected, I would like to change their background color and font color so it is easier to see that they've been redirected. What is the easiest way to do that?
Russ
Pixel Exit Staff
With the current XF setup there's no class on each discussion item to check if it's a redirect.
You can add this to extra.less to make the redirect icon stand out a little further:
Code:
i.structItem-status.structItem-status--redirect:before {
color: red;
}
Of course, you can change it to whatever color you want.
Pre-Sale Questions
If you have any questions or concerns you want to ask before you make a purchase don't hesitate to use one of our multiple support channels for your convenience.
|
{
"url": "https://pixelexit.com/threads/redirected-threads.6207/",
"source_domain": "pixelexit.com",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "56990",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XCIVEX5LPVJSAEC6CYFE5IIEQE4RVYGK",
"WARC-Concurrent-To": "<urn:uuid:73228ac6-373f-42a9-aef6-ace1145b5899>",
"WARC-Date": "2023-12-11T08:08:59Z",
"WARC-IP-Address": "104.21.48.58",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LRTLHXSJ7GTGN5WSW4ZPXFFEQTU5KU2N",
"WARC-Record-ID": "<urn:uuid:375fa0d9-5b1d-46a2-8115-3d1a735b6189>",
"WARC-Target-URI": "https://pixelexit.com/threads/redirected-threads.6207/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:adecf6a8-2b5b-4740-a1de-2eb04a90cadb>"
},
"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-139\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,
9,
10,
21,
204,
206,
207,
212,
213,
230,
326,
327,
412,
413,
419,
476,
492,
494,
495,
552,
554,
555,
574,
575
],
"line_end_idx": [
9,
10,
21,
204,
206,
207,
212,
213,
230,
326,
327,
412,
413,
419,
476,
492,
494,
495,
552,
554,
555,
574,
575,
736
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 736,
"ccnet_original_nlines": 23,
"rps_doc_curly_bracket": 0.0027173899579793215,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4522292912006378,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012738849967718124,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15923567116260529,
"rps_doc_frac_unique_words": 0.7166666984558105,
"rps_doc_mean_word_length": 4.775000095367432,
"rps_doc_num_sentences": 8,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.265876770019531,
"rps_doc_word_count": 120,
"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.020942410454154015,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -63.02519989013672,
"rps_doc_books_importance_length_correction": -63.026676177978516,
"rps_doc_openwebtext_importance": -26.014474868774414,
"rps_doc_openwebtext_importance_length_correction": -26.015947341918945,
"rps_doc_wikipedia_importance": -23.48773193359375,
"rps_doc_wikipedia_importance_length_correction": -23.48920440673828
},
"fasttext": {
"dclm": 0.2569289207458496,
"english": 0.9121014475822449,
"fineweb_edu_approx": 1.0947235822677612,
"eai_general_math": 0.36538082361221313,
"eai_open_web_math": 0.2892088294029236,
"eai_web_code": 0.0016018199967220426
}
}
|
{
"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.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,041,965,881,607,658,000 |
YouTrack Standalone 7.0 Help
Create a User Group
In addition to the default user groups, you can create as many user groups as you need for your YouTrack instance.
To create a new group:
1. In the Access Management section of the Administration menu, select Groups.
2. Click the Create User Group button in the toolbar.
3. In the Create User Group dialog, enter a name and select the project to which the group will belong. To narrow down the list of projects, start typing the project name.
groupCreateNewProject
4. Click the Create User Group button.
• The new group is created.
• The group profile page opens. Here, you can configure its parameters. For more information, see Configure User Group Settings.
Why Add a Group to a Project?
In YouTrack, a group is used as a resource of a project. Unless a group is assigned to a project, the project administrator won't be able to view or edit this group regardless of access permissions.
For example, let's say we have Project A and Project B in YouTrack.
User 'John Johnson' is granted the Project Admin role in project A. Specifically, he is granted the following permissions:
• Per-project — Read Project, Update Project
• Global — Read User Group, Create User Group, Update User Group
These permissions are granted in the project A only. When 'John Johnson' opens the Administration > Projects list, he only sees project A, and not project B.
By default, we have the Registered Users group, which belongs to the Global project. The Global project is a virtual project that incorporates all projects in the system in the same way as the Registered Users group contains all accounts in the system. Thus the Registered Users group belongs to all projects in a YouTrack instance.
We create two user groups for the developers in the project: 'Team A' and 'Team B'. The members of Team A are developers for project A, and the members of Team B are developers for project B.
So, to be able to view and update the group 'Team A', this group must belong to the project A (or to the Global project and hence - to project A). Otherwise John Johnson will not even see 'Team A' in the list of available groups.
In our case, the project administrator of the Project A will be able to view and update or use (set as a group of assignees, for example) only the groups 'Team A' and Registered Users.
Last modified: 29 September 2016
|
{
"url": "https://www.jetbrains.com/help/youtrack/standalone/7.0/Create-User-Group.html",
"source_domain": "www.jetbrains.com",
"snapshot_id": "crawl=CC-MAIN-2017-04",
"warc_metadata": {
"Content-Length": "9117",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EKXEOM4RA2F3SDPJX6OSBRM37W7TVLYS",
"WARC-Concurrent-To": "<urn:uuid:1fef46e1-1a7a-4b10-bd5e-e941406fda11>",
"WARC-Date": "2017-01-20T18:01:36Z",
"WARC-IP-Address": "52.26.79.41",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:MRXGQBQT5Q5ID5EI4XHRB7O37BBV2FHO",
"WARC-Record-ID": "<urn:uuid:c5946a47-48ad-4c65-a22d-d8e28d9a0812>",
"WARC-Target-URI": "https://www.jetbrains.com/help/youtrack/standalone/7.0/Create-User-Group.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f335af0f-903a-4b5d-bf7d-e54ba05bb8a3>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-10-70.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-04\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for January 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
29,
30,
50,
51,
166,
167,
190,
191,
272,
328,
502,
528,
569,
601,
734,
735,
765,
766,
965,
966,
1034,
1035,
1158,
1159,
1206,
1273,
1274,
1432,
1433,
1766,
1767,
1959,
1960,
2190,
2191,
2376,
2377
],
"line_end_idx": [
29,
30,
50,
51,
166,
167,
190,
191,
272,
328,
502,
528,
569,
601,
734,
735,
765,
766,
965,
966,
1034,
1035,
1158,
1159,
1206,
1273,
1274,
1432,
1433,
1766,
1767,
1959,
1960,
2190,
2191,
2376,
2377,
2409
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2409,
"ccnet_original_nlines": 37,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34599998593330383,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.035999998450279236,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18000000715255737,
"rps_doc_frac_unique_words": 0.33571428060531616,
"rps_doc_mean_word_length": 4.452381134033203,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.294522762298584,
"rps_doc_word_count": 420,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.053475938737392426,
"rps_doc_frac_chars_dupe_6grams": 0.053475938737392426,
"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.024064170196652412,
"rps_doc_frac_chars_top_3gram": 0.03208556026220322,
"rps_doc_frac_chars_top_4gram": 0.028877010568976402,
"rps_doc_books_importance": -316.0215148925781,
"rps_doc_books_importance_length_correction": -316.0215148925781,
"rps_doc_openwebtext_importance": -183.49305725097656,
"rps_doc_openwebtext_importance_length_correction": -183.49305725097656,
"rps_doc_wikipedia_importance": -128.2439727783203,
"rps_doc_wikipedia_importance_length_correction": -128.2439727783203
},
"fasttext": {
"dclm": 0.03553098067641258,
"english": 0.8835210204124451,
"fineweb_edu_approx": 1.5653340816497803,
"eai_general_math": 0.10872966051101685,
"eai_open_web_math": 0.1847553253173828,
"eai_web_code": 0.17164361476898193
}
}
|
{
"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": "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": "-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": "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": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,154,896,128,130,672,000 |
Commits
Shlomi Fish committed b48b430
Finished the conversion of USAGE to AsciiDoc.
git-svn-id: file:///home/shlomif/Backup/svn-dumps/google-code/svnsync-repos/fc-solve/branches/online-documents-unification-into-markup-lang@2188 e7e8a897-7ba4-4ee7-b36f-f4c66519b19a
• Participants
• Parent commits 33dba30
• Branches online-documents-unification-into-markup-lang, online-documents-unification-into-markup-lang@3680
• Tags asciidoc.vim-USAGE-bug@2188
Comments (0)
Files changed (1)
File fc-solve/source/USAGE
Running Several Scans in Parallel:
----------------------------------
-Starting from Version 2.4.0, Freecell Solver can run several scans in
+Starting from Version 2.4.0, Freecell Solver can run several scans in
parallel on the same state collection. Each scan resides in its own
"Soft Thread". By specifying several soft threads on the command line
-one can create use several parallel scans. Once one of the scans
+one can create use several parallel scans. Once one of the scans
reaches a solution, the solution will be displayed.
+-nst , --next-soft-thread
+~~~~~~~~~~~~~~~~~~~~~~~
--nst
---next-soft-thread
-
-This option creates a new soft-thread and let the other scan-specific options
-initialize it. For example:
+This option creates a new soft-thread and makes the following scan-specific
+options initialize it. For example:
# fc-solve --method a-star -nst --method soft-dfs -to 0123467 myboard.txt
will run an A* scan and a Soft-DFS scan with a tests order of 0123467 on
myboard.txt.
-
--step [Number of Iterations in the Step]
---soft-thread-step [Number of Iterations in the Step]
+-step [Step] , --soft-thread-step [Step]
+~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
This option will set the number of iterations with which to run the
soft thread before switching to the next one. By specifying a larger
step, one can give a certain scan a longer run-time and a higher priority.
-
--nht
---next-hard-thread
+-nht , --next-hard-thread
+~~~~~~~~~~~~~~~~~~~~~~~~~
This argument lets one initialize the next hard thread. If Freecell Solver was
compiled with such support, then it is possible to run each hard thread in its
--st-name [soft thread name]
+~~~~~~~~~~~~~~~~~~~~~~~~~~~~
This argument sets the name used to identify the current soft thread. This name
can later be used to construct the prelude (see below).
--prelude [i1@st1{,i2@st2{,i3@st3...}}]
+~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Sets the prelude for the hard thread. At the beginning of the search, the
hard thread plays a static sequence of iterations at each of the soft threads
--scans-synergy {none|dead-ends-mark}
+~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Specifies the synergy between the various scans, or how much they cooperate
-between themselves. "none" means they do not cooperate and only share
-the same memory resources. "dead-end-marks" means they try to mark states
+between themselves. +none+ means they do not cooperate and only share
+the same memory resources. +dead-end-marks+ means they try to mark states
that they have withdrawn from, and states whose all their derived states are
such, as "dead ends". This may or may not improve the speed of the solution.
--ni
---next-instance
+-ni , --next-instance
+~~~~~~~~~~~~~~~~~~~~
This option allows to run two or more separate solvers one after the
other. If the first one returned an unsolvable verdict, then the second
still enjoy some of the speed of the meta-moves scan.
-7. Meta-Options
----------------
+Meta-Options
+------------
--reset
+~~~~~~~
This option resets the program to its initial state, losing all the
-logic that was inputted to it up to that state. Afterwards, it can
-be set to a different configuration, again.
+configuration logic that was inputted to it up to that state. Afterwards,
+it can be set to a different configuration, again.
---read-from-file [{num_skip},]filename
+--read-from-file [num_skip,]filename
+~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
This option will read the configuration options from a file. The format
of the file is similar to that used by the UNIX Bourne Shell. (i.e:
skip followed by a comma. (the default is 0)
--l [preset]
---load-config [preset]
+-l [preset] , --load-config [preset]
+~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Reads the configuration specified by [preset] and configures the solver
accordingly. A preset is a set of command line arguments to be analyzed
Presets that are shipped with Freecell Solver:
- abra-kadabra - a meta-moves preset
- cool-jives - a meta-moves preset
- crooked-nose - an atomic-moves preset (guarantees an accurate verdict)
- fools-gold - an atomic-moves preset
- good-intentions - runs "cool-jives" and then "fools-gold"
- gooey-unknown-thing - a meta-moves preset that aims to minimise the
- outcome solution's length.
- hello-world - a meta-moves preset
- john-galt-line - a meta-moves preset
- rin-tin-tin - a meta-moves prese
- sand-stone - an atomic-moves preset that aims to minimise the
- outcome solution's length.
- slick-rock - run "gooey-unknown-thing" and then "sand-stone"
- the-last-mohican - a preset for solving Simple Simon. Yields less
- false negatives than the default one, but might be slower.
- toons-for-twenty-somethings - an atomic-moves preset that solves
+[width="50%"]
+|===================================================
+|+abra-kadabra+ |a meta-moves preset
+|+cool-jives+ |a meta-moves preset
+|+crooked-nose+ |an atomic-moves preset (guarantees an
+ accurate verdict)
+|+fools-gold+ |an atomic-moves preset
+|+good-intentions+ |runs "cool-jives" and then "fools-gold"
+|+gooey-unknown-thing+ |a meta-moves preset that aims to minimise
+ the outcome solution's length.
+|+hello-world+ |a meta-moves preset
+|+john-galt-line+ |a meta-moves preset
+|+rin-tin-tin+ |a meta-moves prese
+|+sand-stone+ |an atomic-moves preset that aims to
+ minimise the outcome solution's length.
+|+slick-rock+ |run "gooey-unknown-thing" and then "sand-stone"
+|+the-last-mohican+ |a preset for solving Simple Simon. Yields
+ less false negatives than the default one, but might be slower.
+|+toons-for-twenty-somethings+ |an atomic-moves preset that solves
more boards efficiently than "fools-gold".
- yellow-brick-road - a meta-moves preset
+|+yellow-brick-road+ |a meta-moves preset
+|====================================================
+
They can be abbreviated into their lowercase acronym (i.e: "ak" or "rtt").
-8. Run-time Display Options
----------------------------
+Run-time Display Options
+------------------------
--i
---iter-output
+-i , --iter-output
+~~~~~~~~~~~~~~~~~~
This option tells fc-solve to print the iteration number and the
recursion depth of every state which is checked, to the standard
slows it down a bit.
--s
---state-output
+-s , --state-output
+~~~~~~~~~~~~~~~~~~~
This option implies -i. If specified, this option outputs the cards and
formation of the board itself, for every state that is checked.
it is so fast.
-9. Signal Combinations
-----------------------
+Signal Combinations
+-------------------
If you are working on a UNIX or a similar system then you can set some
run-time options in "fc-solve" by sending it some signal
combinations.
If you send the signal USR1, without sending any other signals before
-that, then "fc-solve" will output the present number of
+that, then +fc-solve+ will output the present number of
iterations. This method is a good way to monitor an instance that takes
a long time to solve.
-If you send it the signal USR2 and then USR1, then "fc-solve"
+If you send it the signal USR2 and then USR1, then +fc-solve+
will print the iteration number and depth on every state that it
checks. It is the equivalent of specifying (or unspecifying) the
option -i/--iter-output.
-If you send it two USR2 signals and then USR1, then "fc-solve"
+If you send it two USR2 signals and then USR1, then +fc-solve+
will also print the board of every state. Again, this will only be done
assuming the iteration output is turned on.
|
{
"url": "https://bitbucket.org/shlomif/fc-solve/commits/b48b430a6273",
"source_domain": "bitbucket.org",
"snapshot_id": "crawl=CC-MAIN-2015-35",
"warc_metadata": {
"Content-Length": "168472",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PK5LWQRYTR5DVVK2RZUJ2BNGDQOCSMTS",
"WARC-Concurrent-To": "<urn:uuid:019bb38a-6603-46e6-b84c-58f3e4c87c97>",
"WARC-Date": "2015-08-28T20:36:16Z",
"WARC-IP-Address": "131.103.20.167",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:WNY7X3NUS6PKAVBF6B3AXPHO6TK4LG4Q",
"WARC-Record-ID": "<urn:uuid:4c0893da-836b-4367-b532-f41903cc91df>",
"WARC-Target-URI": "https://bitbucket.org/shlomif/fc-solve/commits/b48b430a6273",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8118d470-fca0-45c5-a716-b69b759a7c16>"
},
"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,
8,
9,
40,
41,
87,
88,
270,
271,
288,
315,
426,
463,
464,
477,
478,
496,
497,
524,
525,
561,
597,
599,
671,
742,
811,
882,
949,
1015,
1068,
1070,
1097,
1122,
1124,
1130,
1150,
1152,
1231,
1260,
1337,
1374,
1376,
1451,
1453,
1527,
1541,
1543,
1545,
1587,
1642,
1684,
1724,
1726,
1796,
1867,
1943,
1945,
1947,
1953,
1973,
2000,
2027,
2029,
2109,
2189,
2191,
2193,
2223,
2253,
2255,
2336,
2393,
2395,
2397,
2438,
2479,
2481,
2556,
2635,
2637,
2639,
2678,
2717,
2719,
2796,
2867,
2942,
3013,
3088,
3167,
3245,
3247,
3249,
3254,
3271,
3294,
3316,
3318,
3388,
3461,
3516,
3518,
3520,
3537,
3554,
3568,
3582,
3584,
3586,
3595,
3604,
3606,
3675,
3743,
3788,
3863,
3915,
3917,
3919,
3959,
3997,
4035,
4037,
4110,
4179,
4225,
4227,
4229,
4242,
4266,
4304,
4342,
4344,
4417,
4490,
4492,
4540,
4542,
4587,
4632,
4713,
4761,
4826,
4899,
4939,
4984,
5029,
5073,
5147,
5187,
5260,
5332,
5405,
5475,
5490,
5544,
5597,
5650,
5722,
5753,
5809,
5882,
5957,
6001,
6054,
6107,
6159,
6228,
6281,
6362,
6437,
6515,
6583,
6639,
6684,
6737,
6792,
6794,
6796,
6872,
6874,
6876,
6905,
6934,
6960,
6986,
6988,
6990,
6994,
7009,
7029,
7049,
7051,
7117,
7183,
7205,
7207,
7209,
7213,
7229,
7250,
7271,
7273,
7347,
7413,
7429,
7431,
7433,
7457,
7481,
7502,
7523,
7525,
7597,
7655,
7670,
7672,
7743,
7800,
7857,
7930,
7953,
7955,
8018,
8081,
8147,
8213,
8239,
8241,
8305,
8369,
8442
],
"line_end_idx": [
8,
9,
40,
41,
87,
88,
270,
271,
288,
315,
426,
463,
464,
477,
478,
496,
497,
524,
525,
561,
597,
599,
671,
742,
811,
882,
949,
1015,
1068,
1070,
1097,
1122,
1124,
1130,
1150,
1152,
1231,
1260,
1337,
1374,
1376,
1451,
1453,
1527,
1541,
1543,
1545,
1587,
1642,
1684,
1724,
1726,
1796,
1867,
1943,
1945,
1947,
1953,
1973,
2000,
2027,
2029,
2109,
2189,
2191,
2193,
2223,
2253,
2255,
2336,
2393,
2395,
2397,
2438,
2479,
2481,
2556,
2635,
2637,
2639,
2678,
2717,
2719,
2796,
2867,
2942,
3013,
3088,
3167,
3245,
3247,
3249,
3254,
3271,
3294,
3316,
3318,
3388,
3461,
3516,
3518,
3520,
3537,
3554,
3568,
3582,
3584,
3586,
3595,
3604,
3606,
3675,
3743,
3788,
3863,
3915,
3917,
3919,
3959,
3997,
4035,
4037,
4110,
4179,
4225,
4227,
4229,
4242,
4266,
4304,
4342,
4344,
4417,
4490,
4492,
4540,
4542,
4587,
4632,
4713,
4761,
4826,
4899,
4939,
4984,
5029,
5073,
5147,
5187,
5260,
5332,
5405,
5475,
5490,
5544,
5597,
5650,
5722,
5753,
5809,
5882,
5957,
6001,
6054,
6107,
6159,
6228,
6281,
6362,
6437,
6515,
6583,
6639,
6684,
6737,
6792,
6794,
6796,
6872,
6874,
6876,
6905,
6934,
6960,
6986,
6988,
6990,
6994,
7009,
7029,
7049,
7051,
7117,
7183,
7205,
7207,
7209,
7213,
7229,
7250,
7271,
7273,
7347,
7413,
7429,
7431,
7433,
7457,
7481,
7502,
7523,
7525,
7597,
7655,
7670,
7672,
7743,
7800,
7857,
7930,
7953,
7955,
8018,
8081,
8147,
8213,
8239,
8241,
8305,
8369,
8442,
8486
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8486,
"ccnet_original_nlines": 231,
"rps_doc_curly_bracket": 0.000942729995585978,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2770005464553833,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009513149969279766,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3217683434486389,
"rps_doc_frac_unique_words": 0.3265896141529083,
"rps_doc_mean_word_length": 5.390173435211182,
"rps_doc_num_sentences": 65,
"rps_doc_symbol_to_word_ratio": 0.0011191900121048093,
"rps_doc_unigram_entropy": 5.227536678314209,
"rps_doc_word_count": 1038,
"rps_doc_frac_chars_dupe_10grams": 0.35889187455177307,
"rps_doc_frac_chars_dupe_5grams": 0.4214477241039276,
"rps_doc_frac_chars_dupe_6grams": 0.4121537208557129,
"rps_doc_frac_chars_dupe_7grams": 0.3864164352416992,
"rps_doc_frac_chars_dupe_8grams": 0.3742627203464508,
"rps_doc_frac_chars_dupe_9grams": 0.3742627203464508,
"rps_doc_frac_chars_top_2gram": 0.025022339075803757,
"rps_doc_frac_chars_top_3gram": 0.034316349774599075,
"rps_doc_frac_chars_top_4gram": 0.011438780464231968,
"rps_doc_books_importance": -665.1964111328125,
"rps_doc_books_importance_length_correction": -665.1964111328125,
"rps_doc_openwebtext_importance": -479.39715576171875,
"rps_doc_openwebtext_importance_length_correction": -479.39715576171875,
"rps_doc_wikipedia_importance": -299.3725280761719,
"rps_doc_wikipedia_importance_length_correction": -299.3725280761719
},
"fasttext": {
"dclm": 0.4627705216407776,
"english": 0.7536585330963135,
"fineweb_edu_approx": 2.9218924045562744,
"eai_general_math": 0.7039938569068909,
"eai_open_web_math": 0.5701735019683838,
"eai_web_code": 0.6935387253761292
}
}
|
{
"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.1",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "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
|
-8,476,255,119,383,355,000 |
2105 active members
251 are online
Year
20
Day
22
Time
09:13:18
Guest
Login
snewsgnewsmessagegeneralfactioninventorycombatroom
Message CentreRPG CentreQuestion Centre
Archives » Phone and swc aren't working together...
Christian Hall
Recently Ive had some major laptop problems so I've been forced to usE my iPhone.
I know for most phones everything works except the item interface. Well with mine I canT descend. Half of the travel page is gone. The rules don't load. I can't room travl, pressing the rooms does nothing. Sending creds either doesn't work or I misspelled the name. Oh anD the little auto complete thing for dms and credits sending doesn't work.
Any reason for this? I've never needed to worry about this but now that I have to use a phone it's seriously impeding my actions.
Thanks in advance.
(iPhone Internet browers use opera right?)
edit
AND my timers don't show up. Maybe my phone is just crap. I really don't know anymore.
Edited By: Christian Hall on Year 12 Day 238 22:20
Works fine on my Galaxy S. You're using an apple thingy, so that is probably the issue.*
*This may or may not be my bias against everything apple.
____________
Ellias_sig6.png
*This may or may not be my bias against everything apple.
Apple products do have a long list of deficiencies, although i've never heard anything bad about their internet capabilities. It may be you need to update the app a bit, or there may be a problem with your iPhone (apart from the Apple logo and other associated stuff). So, try to update it first, and if that doesn't succeed, tak to the community and see if anyone else has the same problem.
____________
Not even Death's embrace shall save you from me.
There are too many good guys in this galaxy, which is why you have me.
mystats.php?uid=c6464
I use my Iphone on the combine all the time, it only have miner problems out of it. the one thing that i can tell you is that when you are using room travel, you will have to "tap" twice instead of just once. other then that everything works just fine for me. hope that helps.
____________
Photobucket
I have been using an iPhone for swc access for two years now and pretty much always worked. There are only a few things not working very well if I remember it right, mostly inventory/filter related things.
____________
horbanner.gif
iPhone uses Safari by default. I've never had to use my iPhone for SWC, but on similar games and sites I've had trouble with loading some pages.
I've been using my iPhone as well and had to use either Opera or Atomic browse. Safari doesn't work for creature combat with the dropdown menus...
____________
Ezekiel_Master.png
Christian Hall
the double tap room travel trick doesn't work :(
I'll give updatting it a try, but I think I'm leaning towards agreeing with Ellias.
Thanks for the help!
Try downloading another browser. Every time I've tried it's worked fine for me.
Do you have an iPhone 4? The specific type of phone you have may also be an issue.
Christian Hall
o.O
Please tell me firefox has an app out!
anyway I have an iphone 3g.
I don't think Firefox has released an app, because they all still have to run Safari's basic engine, I think (whatever that is, I can't remember right off).
I know Opera has a free app. I'd try it and if it doesn't work, look for others (preferably free, first, but I'm cheap), especially if they tout "enhanced" or "expanded javascript support".
It's probably related to the fact that you have a 3G..
I have an iPhone 3GS. Only thing I can't do is (update my phone -.- stupid apple not liking microsoft) *clears throat* Only things I can't do on Combine is assign pilot/commander/etc by "clicking" the box and typing it in. I have to click the checkbox and scroll down etc. I also can't filter, but last I tried was pre- iOS4.. So I don't know if that changed.
I use the standard Safari, though, with no issues. And I've used Safari on my computer with no issues too (I don't use it because of the lack of tabs; it's just for a secondary email I don't want attached to my personal email)
Start by checking what iOS you have. You may just need to update. :)
____________
Padme_Smith_Sig06.png
Kuro Neko
iPhone 3G, software version 4.2.1
Room movement used to work on iPhone Safari, but stopped a few months ago. I just downloaded Opera (free), and room movement works in Opera.
Filtering is still a pain on both browsers. I'll give Opera a try again. I tried it a couple of years ago and at that time it didn't give me any significant reason to prefer it over Safari. But now with room movement available I may end up staying with it.
YMMV
KN
____________
RSani002.gif
There is no god but Ara... All will walk his path...
The Faithful of Ara <--- (Warning: music link)
I'm stuck using an iPhone 3G with the latest iOS
release, and perhaps the most frustrating thing that
I've found, is that I can't reply to DMs. I can *type*
a reply, but the Send button is hidden behind the
character menu, which floats to the middle of the
SWC screen, instead of being right-aligned.
|
{
"url": "http://www.swcombine.com/forum/thread.php?thread=49033&page=0",
"source_domain": "www.swcombine.com",
"snapshot_id": "crawl=CC-MAIN-2018-51",
"warc_metadata": {
"Content-Length": "35367",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MJAA5RKP65TMFESQJU6HE4I3AUP2ROBK",
"WARC-Concurrent-To": "<urn:uuid:6a22ad9f-313b-4560-a489-4954cd3d6f3f>",
"WARC-Date": "2018-12-19T16:11:33Z",
"WARC-IP-Address": "52.70.152.131",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:K3X5CKEVF4IUG4LNVP2QE73T2733TSEH",
"WARC-Record-ID": "<urn:uuid:d0956dbf-17c5-4061-a25d-419fd35be045>",
"WARC-Target-URI": "http://www.swcombine.com/forum/thread.php?thread=49033&page=0",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b4ffeeef-e5fb-4fe3-af05-a524bb457d51>"
},
"warc_info": "isPartOf: CC-MAIN-2018-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-123-222-118.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,
22,
39,
40,
45,
46,
49,
50,
54,
55,
58,
59,
64,
65,
74,
75,
81,
87,
138,
178,
230,
245,
246,
328,
674,
804,
823,
824,
867,
868,
873,
960,
961,
962,
1013,
1102,
1103,
1104,
1105,
1106,
1107,
1108,
1166,
1167,
1168,
1181,
1182,
1198,
1257,
1258,
1259,
1651,
1652,
1653,
1666,
1667,
1716,
1717,
1788,
1789,
1811,
2088,
2089,
2090,
2103,
2104,
2116,
2322,
2323,
2324,
2337,
2338,
2352,
2497,
2498,
2499,
2646,
2647,
2648,
2661,
2662,
2681,
2696,
2697,
2746,
2747,
2831,
2832,
2853,
2854,
2855,
2935,
2936,
3019,
3020,
3021,
3036,
3037,
3041,
3080,
3081,
3109,
3110,
3111,
3268,
3269,
3459,
3460,
3461,
3516,
3517,
3877,
3878,
4105,
4106,
4175,
4176,
4177,
4190,
4191,
4213,
4223,
4224,
4258,
4259,
4400,
4401,
4658,
4659,
4664,
4665,
4668,
4669,
4670,
4683,
4684,
4697,
4750,
4797,
4846,
4899,
4954,
5004,
5054
],
"line_end_idx": [
22,
39,
40,
45,
46,
49,
50,
54,
55,
58,
59,
64,
65,
74,
75,
81,
87,
138,
178,
230,
245,
246,
328,
674,
804,
823,
824,
867,
868,
873,
960,
961,
962,
1013,
1102,
1103,
1104,
1105,
1106,
1107,
1108,
1166,
1167,
1168,
1181,
1182,
1198,
1257,
1258,
1259,
1651,
1652,
1653,
1666,
1667,
1716,
1717,
1788,
1789,
1811,
2088,
2089,
2090,
2103,
2104,
2116,
2322,
2323,
2324,
2337,
2338,
2352,
2497,
2498,
2499,
2646,
2647,
2648,
2661,
2662,
2681,
2696,
2697,
2746,
2747,
2831,
2832,
2853,
2854,
2855,
2935,
2936,
3019,
3020,
3021,
3036,
3037,
3041,
3080,
3081,
3109,
3110,
3111,
3268,
3269,
3459,
3460,
3461,
3516,
3517,
3877,
3878,
4105,
4106,
4175,
4176,
4177,
4190,
4191,
4213,
4223,
4224,
4258,
4259,
4400,
4401,
4658,
4659,
4664,
4665,
4668,
4669,
4670,
4683,
4684,
4697,
4750,
4797,
4846,
4899,
4954,
5004,
5054,
5097
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5097,
"ccnet_original_nlines": 143,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4216972887516022,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.048118989914655685,
"rps_doc_frac_lines_end_with_ellipsis": 0.02083333022892475,
"rps_doc_frac_no_alph_words": 0.18547682464122772,
"rps_doc_frac_unique_words": 0.43566590547561646,
"rps_doc_mean_word_length": 4.319413185119629,
"rps_doc_num_sentences": 76,
"rps_doc_symbol_to_word_ratio": 0.003499560058116913,
"rps_doc_unigram_entropy": 5.4324469566345215,
"rps_doc_word_count": 886,
"rps_doc_frac_chars_dupe_10grams": 0.023517120629549026,
"rps_doc_frac_chars_dupe_5grams": 0.023517120629549026,
"rps_doc_frac_chars_dupe_6grams": 0.023517120629549026,
"rps_doc_frac_chars_dupe_7grams": 0.023517120629549026,
"rps_doc_frac_chars_dupe_8grams": 0.023517120629549026,
"rps_doc_frac_chars_dupe_9grams": 0.023517120629549026,
"rps_doc_frac_chars_top_2gram": 0.007839039899408817,
"rps_doc_frac_chars_top_3gram": 0.008622939698398113,
"rps_doc_frac_chars_top_4gram": 0.006793830078095198,
"rps_doc_books_importance": -495.1641845703125,
"rps_doc_books_importance_length_correction": -495.1641845703125,
"rps_doc_openwebtext_importance": -321.65313720703125,
"rps_doc_openwebtext_importance_length_correction": -321.65313720703125,
"rps_doc_wikipedia_importance": -219.298095703125,
"rps_doc_wikipedia_importance_length_correction": -219.298095703125
},
"fasttext": {
"dclm": 0.04119253158569336,
"english": 0.9615789651870728,
"fineweb_edu_approx": 0.9738300442695618,
"eai_general_math": 0.12439758330583572,
"eai_open_web_math": 0.14122623205184937,
"eai_web_code": 0.1544165015220642
}
}
|
{
"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.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": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "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": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,978,360,547,270,329,000 |
Merhaba Ziyaretçi
Forumumuza hoşgeldiniz.Sitemizi daha yararlı şekilde kullanabilmek için lütfen kayıt olun veya giriş yapın.
Oto Grade + Np Sembolu
Server Tanitimi , Ko Tanitimi , Silkroad Pvp Serverler , Metin2 Pvp Serverler
[XFB] Konu Bilgileri
Konu Hakkında Merhaba, tarihinde Prosedür & Kod Paylaşımları kategorisinde Stark tarafından oluşturulan Oto Grade + Np Sembolu başlıklı konuyu okuyorsunuz. Bu konu şimdiye dek 635 kez görüntülenmiş, 0 yorum ve 0 tepki puanı almıştır...
Kategori Adı Prosedür & Kod Paylaşımları
Konu Başlığı Oto Grade + Np Sembolu
Konbuyu başlatan Stark
Başlangıç tarihi
Cevaplar
Görüntüleme
İlk mesaj tepki puanı
Son Mesaj Yazan Stark
Stark
K.Destek Yöneticisi
27 May 2013
2,664
0
Kod:
CREATE PROCEDURE npsembol AS
-- Procedure Edited By Longh0rn type LoyaltyMontyly
truncate table np_kings
insert np_kings
select top 100 strUserID, Loyalty, LoyaltyMonthly, 'gokhantasci'
from USERDATA
where Nation = 1
order by Loyalty desc, LoyaltyMonthly desc
truncate table np_kings2
insert np_kings2
select top 100 strUserID, Loyalty, LoyaltyMonthly, 'gokhantasci'
from USERDATA
where Nation = 2
order by Loyalty desc, LoyaltyMonthly desc
declare @KarusD varchar(21), @KarusH varchar(21), @KarusM varchar(21), @KarusS varchar(21), @KarusMi varchar(21), @KarusT varchar(21), @ElmoD varchar(21), @ElmoH varchar(21), @ElmoM varchar(21), @ElmoS varchar(21), @ElmoMi varchar(21), @ElmoT varchar(21)
select @KarusD = struserid from np_kings where nrank = 1
select @KarusH = struserid from np_kings where nrank = 2
select @KarusM = struserid from np_kings where nrank = 3
select @KarusS = struserid from np_kings where nrank = 4
select @KarusMi = struserid from np_kings where nrank = 5
select @KarusT = struserid from np_kings where nrank = 6
select @ElmoD = struserid from np_kings2 where nrank = 1
select @ElmoH = struserid from np_kings2 where nrank = 2
select @ElmoM = struserid from np_kings2 where nrank = 3
select @ElmoS = struserid from np_kings2 where nrank = 4
select @ElmoMi = struserid from np_kings2 where nrank = 5
select @ElmoT = struserid from np_kings2 where nrank = 6
/* Update part wowowo */
update user_personal_rank set strelmouserid = @ElmoD , nElmoLoyaltyMonthly = (select LoyaltyMonthly from userdata where struserid = @ElmoD), strkarususerid = @karusD, nkarusLoyaltyMonthly = (select LoyaltyMonthly from userdata where struserid = @karusD) where nRank = 1
update user_personal_rank set strelmouserid = @ElmoH, nElmoLoyaltyMonthly = (select LoyaltyMonthly from userdata where struserid = @ElmoH), strkarususerid = @karusH, nkarusLoyaltyMonthly = (select LoyaltyMonthly from userdata where struserid = @KarusH) where nRank = 2
update user_personal_rank set strelmouserid = @ElmoM, nElmoLoyaltyMonthly = (select LoyaltyMonthly from userdata where struserid = @ElmoM), strkarususerid = @KarusM, nkarusLoyaltyMonthly = (select LoyaltyMonthly from userdata where struserid = @KarusM) where nRank = 3
update user_personal_rank set strelmouserid = @ElmoS, nElmoLoyaltyMonthly = (select LoyaltyMonthly from userdata where struserid = @ElmoS), strkarususerid = @KarusS, nkarusLoyaltyMonthly = ( select LoyaltyMonthly from userdata where struserid = @KarusS) where nRank = 4
update user_personal_rank set strelmouserid = @ElmoMi , nElmoLoyaltyMonthly = (select LoyaltyMonthly from userdata where struserid = @ElmoMi), strkarususerid = @KarusMi, nkarusLoyaltyMonthly = (select LoyaltyMonthly from userdata where struserid = @KarusMi) where nRank = 5
update user_personal_rank set strelmouserid = @ElmoT, nElmoLoyaltyMonthly = (select LoyaltyMonthly from userdata where struserid = @ElmoT), strkarususerid = @KarusT , nkarusLoyaltyMonthly = (select LoyaltyMonthly from userdata where struserid = @KarusT) where nRank= 6
/* end of the update */
GO
oto olması icin rank_knights a gir as dan sonra ( exec npsembol ) yaz update_knights a gir as dan sonra exec rank_knights yaz oto grade ve sembolun olr
Kullanımı ...
1 Başlat > Tüm Programlar > Microsoft SQL Server > Query Analyzer ‘ a giriyoruz.
2 SQL Server’ a bağlanıyoruz ve açılan ekranda ” master ” yerine ” DBmizi ” seçiyoruz.
3 Seçtikten sonra aşağıdaki kodu kopyalayıp , yapıştırıyoruz ve F5 yaparak kodumuzu uyguluyoruz.
Üst Alt
|
{
"url": "http://www.ko-destek.com/threads/oto-grade-np-sembolu.261/",
"source_domain": "www.ko-destek.com",
"snapshot_id": "crawl=CC-MAIN-2020-40",
"warc_metadata": {
"Content-Length": "58124",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FA34EXR2XIXXI7TRH7FX27B6WR3HYG2C",
"WARC-Concurrent-To": "<urn:uuid:23480699-6a8b-447d-a6dc-c0474ff1c9de>",
"WARC-Date": "2020-09-23T11:59:27Z",
"WARC-IP-Address": "93.89.224.152",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KJU2I3R4HPJUF5K5UZCQWYLTNEGBBAJK",
"WARC-Record-ID": "<urn:uuid:6709d04f-2dc7-450a-a304-5fd31a4c6725>",
"WARC-Target-URI": "http://www.ko-destek.com/threads/oto-grade-np-sembolu.261/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2942a975-971a-4df0-bfa0-bd98b31ba435>"
},
"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-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,
18,
126,
127,
150,
151,
229,
230,
251,
252,
488,
529,
565,
588,
605,
614,
626,
648,
670,
671,
677,
678,
698,
710,
716,
718,
723,
724,
753,
754,
806,
807,
831,
832,
848,
849,
914,
915,
929,
930,
947,
948,
991,
992,
993,
994,
1019,
1020,
1037,
1038,
1103,
1104,
1118,
1119,
1136,
1137,
1180,
1181,
1182,
1183,
1184,
1185,
1186,
1187,
1442,
1443,
1500,
1501,
1558,
1559,
1616,
1617,
1674,
1675,
1733,
1734,
1791,
1792,
1849,
1850,
1907,
1908,
1965,
1966,
2023,
2024,
2082,
2083,
2140,
2141,
2142,
2143,
2168,
2169,
2439,
2440,
2709,
2710,
2979,
2980,
3250,
3251,
3525,
3526,
3795,
3796,
3820,
3821,
3824,
3825,
3826,
3827,
3828,
3829,
3981,
3982,
3983,
3984,
3985,
3986,
3987,
3988,
3989,
3990,
3991,
3992,
4006,
4007,
4008,
4009,
4010,
4011,
4012,
4013,
4094,
4095,
4096,
4097,
4184,
4185,
4186,
4187,
4284,
4286
],
"line_end_idx": [
18,
126,
127,
150,
151,
229,
230,
251,
252,
488,
529,
565,
588,
605,
614,
626,
648,
670,
671,
677,
678,
698,
710,
716,
718,
723,
724,
753,
754,
806,
807,
831,
832,
848,
849,
914,
915,
929,
930,
947,
948,
991,
992,
993,
994,
1019,
1020,
1037,
1038,
1103,
1104,
1118,
1119,
1136,
1137,
1180,
1181,
1182,
1183,
1184,
1185,
1186,
1187,
1442,
1443,
1500,
1501,
1558,
1559,
1616,
1617,
1674,
1675,
1733,
1734,
1791,
1792,
1849,
1850,
1907,
1908,
1965,
1966,
2023,
2024,
2082,
2083,
2140,
2141,
2142,
2143,
2168,
2169,
2439,
2440,
2709,
2710,
2979,
2980,
3250,
3251,
3525,
3526,
3795,
3796,
3820,
3821,
3824,
3825,
3826,
3827,
3828,
3829,
3981,
3982,
3983,
3984,
3985,
3986,
3987,
3988,
3989,
3990,
3991,
3992,
4006,
4007,
4008,
4009,
4010,
4011,
4012,
4013,
4094,
4095,
4096,
4097,
4184,
4185,
4186,
4187,
4284,
4286,
4293
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4293,
"ccnet_original_nlines": 143,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.0910307914018631,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014725569635629654,
"rps_doc_frac_lines_end_with_ellipsis": 0.01388888992369175,
"rps_doc_frac_no_alph_words": 0.3654618561267853,
"rps_doc_frac_unique_words": 0.34381139278411865,
"rps_doc_mean_word_length": 6.620825290679932,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0.002677380107343197,
"rps_doc_unigram_entropy": 4.558202266693115,
"rps_doc_word_count": 509,
"rps_doc_frac_chars_dupe_10grams": 0.04510385915637016,
"rps_doc_frac_chars_dupe_5grams": 0.4189910888671875,
"rps_doc_frac_chars_dupe_6grams": 0.3103857636451721,
"rps_doc_frac_chars_dupe_7grams": 0.2783382833003998,
"rps_doc_frac_chars_dupe_8grams": 0.04510385915637016,
"rps_doc_frac_chars_dupe_9grams": 0.04510385915637016,
"rps_doc_frac_chars_top_2gram": 0.053412459790706635,
"rps_doc_frac_chars_top_3gram": 0.07062315195798874,
"rps_doc_frac_chars_top_4gram": 0.1139465868473053,
"rps_doc_books_importance": -266.1675720214844,
"rps_doc_books_importance_length_correction": -266.1675720214844,
"rps_doc_openwebtext_importance": -141.8605499267578,
"rps_doc_openwebtext_importance_length_correction": -141.8605499267578,
"rps_doc_wikipedia_importance": -138.2506561279297,
"rps_doc_wikipedia_importance_length_correction": -138.2506561279297
},
"fasttext": {
"dclm": 0.9921795725822449,
"english": 0.204371839761734,
"fineweb_edu_approx": 3.5975606441497803,
"eai_general_math": 0.43924665451049805,
"eai_open_web_math": 0.3189971446990967,
"eai_web_code": 0.7616797089576721
}
}
|
{
"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": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-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
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.