id
int64 | text
string | metadata
dict | line_start_n_end_idx
dict | quality_signals
dict | eai_taxonomy
dict | pid
string |
|---|---|---|---|---|---|---|
8,837,294,235,834,300,000 |
Banach spaces, function spaces, real functions, integral transforms, theory of distributions, measure theory.
learn more… | top users | synonyms (1)
4
votes
1answer
123 views
Can one show that the dual of a quasi-Banach space separates points without explicitly identifying the dual?
I'm interested in a question regarding the identification of some duals of quasi-Banach spaces. However, I'm not familiar with the quasi-Banach literature, so I'm hoping somebody can point me in the ...
0
votes
1answer
146 views
$Ax=b$ in a function space
Let $X$ be compact Hausdorff topological space, $C(X)$ denote the algebra of complex-valued continuous functions on $X$, $b\in \mathbb{C}^m$, $\mathbf{A}\in C(X)^{m\times n}$, for all $x\in X$, ...
2
votes
1answer
100 views
Question regarding to approximate continuity
Given $u\in BV(R^N)$, we say $u$ is approximate continuous at $x$ and the approximation limit is $l\in R$ if $$ \lim_{r\to 0}\frac{\mathcal{L}^N(B(x,r)\cap \{|u-l|>\epsilon\})}{r^N} =0 $$ for all ...
5
votes
2answers
136 views
Compactly supported functions and Sobolev spaces on manifolds
It is well-known that if a complete Riemannian manifold has bounded curvature and injectivity radius bounded away from zero, then the space $C^\infty_c(M)$ is dense in the Sobolev spaces $W^{k, p}(M)$ ...
0
votes
0answers
70 views
Inverse problem to solve out current in the radiation problem
This is the radiation problem, but more like a analysis one. Suppose the current $f(x)\in L^2(\mathbb{R})$ has a compact support in $[-a,a]$. And the frequency $F(\theta)$ is given by ...
1
vote
0answers
156 views
Separability of the space $C(C[0, 1], \mathbb{R})$
Let $E=C([0, 1])$ be the space of all real-valued continuous functions on $[0, 1]$, equipped with the uniform norm. $C(E)$ stand for the continuous real-valued functions on $E$. I am wondering that ...
10
votes
2answers
463 views
Banach space modulo a one-dimensional subspace =?
My question is the following: Given an infinite dimensional Banach space $E$ and a one-dimensional linear subspace $F\subset E$. It is well-known that this one-dimensional linear subspace is closed ...
0
votes
1answer
117 views
Equivalence of two definitions of Sobolev spaces
Good morning, I am looking for a reference about the following fact that seems to be folklore. Define the Sobolev (Beppo Levi?) space $$ D^{1,p}(\mathbb{R}^N) = \left\{ u \in L^{p^*}(\mathbb{R}^N) ...
0
votes
0answers
62 views
faithful action of Hecke algebra
Let $G$ be a connected reductive group split over a number field $F$, $\mathbb{A}$ the adeles. Let $v$ be a finite place and $\mathcal{H}_{v}$ the spherical hecke algebra at palce $v$. ...
3
votes
2answers
106 views
Reconstructing density from integrals along specific manifolds
Let $\Phi_t : \mathbb R^n \to \mathbb R^n$ be the time-$t$-map associated to an ODE $\dot{x}=F(x)$ and let $H: \mathbb R^n \to \mathbb R$. Let $F$ and $H$ be sufficiently smooth (e.g. $C^k$ or ...
7
votes
1answer
236 views
Bounded operator on a normed space with empty spectrum
A bounded operator acting on a complex Banach space has non-empty spectrum, and the proof of this fact uses the completeness of the space. Is there any example of bounded operator acting on a ...
0
votes
0answers
78 views
Defining density of a random function using Radon-Nikodym Theorem
Let $(\Omega,\mathbb{F},P)$ be a probability space and $E$ be an infinite dimensional Banach space and $\mathbb{B}$ be the $\sigma$-algebra of Borel subset of $E$. Let $X$ be random function defined ...
1
vote
0answers
93 views
Lebesgue point and regularity of functions
A known theorem says that for $f \in L_{loc}^1(\mathbb{R}^d)$, almost every point is a Lebesgue point. I know too a theorem saying that for $f \in W_{loc}^{1,p}(\mathbb{R}^d)$ , every point is a ...
5
votes
1answer
131 views
Reflexive subspaces of non-separable abstract $L_1$ spaces
An abstract $L_1$ space is a Banach lattice $E$ such that $\|x+y\|=\|x\|+\|y\|$ for disjoint $x,y\in E$. The space $L_1[0,1]$ is a separable example that contains subspaces isomorphic to $L_p[0,1]$ ...
0
votes
0answers
114 views
Notion of solution of pde
Let's consider the following Schrodinger equation $$iu_t+\Delta u+F(u)=0$$ in $\mathbb{R}^n$. In Cazenave's book, "Semilinear Schrodinger equation", he defines $H^1$-weak solution as $u\in ...
17
votes
0answers
245 views
Large almost equilateral sets in finite-dimensional Banach spaces
Question: Does there exist a function $C:~(0,1)\to (0,\infty)$ such that for each $\varepsilon\in(0,1)$ every Banach space $X$ of dimension $\ge C(\varepsilon)\log n$ contains an $n$-point set ...
0
votes
0answers
31 views
proving that a complicated function is concave or strongly uni-modal
I am trying to prove the concave property for a complicated function during my research project (imperfect maintenance modelling for starter) which has the following form: $\eta(t)= \alpha \beta ...
3
votes
1answer
71 views
Example of joint cyclic and separating vector
Let $\mathcal{H}$ be a separate Hilbert space and $\mathcal{B}(\mathcal{H}) \subset \mathcal{B}(\mathcal{H}) \otimes M_2(C)$ be a W$^*$-inclusion pairs. It is known that this pair share a joint cyclic ...
3
votes
0answers
43 views
Behaviour of Markov type under uniform homeomorphism of spheres
A metric space $(X,d_X)$ has Markov type $p$ (with $p \in [1,2]$), if, for every stationary Markov chain $\{Z_n\}_{n=0}^\infty$ on $Y$ (a finite space) and every mapping $f:Y \to X$, one has $$ ...
0
votes
1answer
194 views
Continuity of a Functional
A certain functional $T$ is defined as: $$T(F)=\int_{(0,1)}F^{-1}(s)M(ds)$$ where $M$ is a probability measure with support $[\alpha,1-\alpha]$,for $\alpha>0$. The result that above functional is ...
3
votes
0answers
88 views
Strong solution to $u_t - \Delta_p u = f$
For $p > 1$, consider the equation $$\langle u_t, v \rangle + \int_\Omega |\nabla u|^{p-2}\nabla u \nabla v = \langle f, v \rangle$$ $$u(0) = u_0$$ $$u|_{\partial\Omega} =0$$ for all $v \in ...
1
vote
0answers
42 views
decomposition of tempered distributions by entire analytic functions
Let $\phi$ be a $C^{\infty}$ function on $\mathbb R^{n}$ with $$ \operatorname{supp} \phi \subset \{\xi \in \mathbb R^{n}: |\xi|\leq 2, \phi(\xi)=1~~\text{if}~|\xi|\leq 1\}$$ Let $j\in \mathbb N$ ...
0
votes
0answers
36 views
Bound on change of function given bound on Hessian
Suppose I have very some smooth function $F(x)$, and let $x_0 = \text{argmin}_x F(x)$. I would like to bound $F(x) - F(x_0)$ from above, in terms of the gradient $\nabla f(x)$ and the Hessian matrix ...
8
votes
3answers
292 views
Reference for a strong intermediate value theorem for measures
Let $\mu$ be a finite nonatomic measure on a measurable space $(X,\Sigma)$, and for simplicity assume that $\mu(X) = 1$. There is a well-known "intermediate value theorem" of Sierpiński that states ...
3
votes
4answers
296 views
Continuity in Banach space for non-linear maps
I want to find an example of a Banach space $X$ and a continuous map $f:X\rightarrow X$ such that $f$ is not bounded on the unit ball. I do not doubt that such an example exists, but I cannot make it ...
3
votes
0answers
127 views
Donsker's Theorem for triangular arrays
I should mention that I already posed this question on Math Stack Exchange, but didn't receive much feedback. Assume we have a sequence of smooth i.i.d. random variables $(X_i)_{i=1}^{\infty}$. Given ...
7
votes
0answers
267 views
Proving that a space is Hilbert
Let $H=H_0^1(0,\ell)\times H_*^1(0,\ell)\times H_*^1(0,\ell)$ be equipped with the norms \begin{align*} ...
0
votes
0answers
102 views
A question about the duality principle
Suppose $X$ and $Y$ are finite sets and $K:X\times Y\to \mathbb R$ is some function. We get an integral transform from the space of real functions on $X$ to real functions on $Y$ given by ...
2
votes
0answers
89 views
What's the idea behind various equivalent norms on Besov spaces $B^{s}_{p,q}$?
I am trying to understand Besov spaces; and I am eager to see why the various norms are equivalent on it. Let $\phi$ be a $C^{\infty}$ function on $\mathbb R^{n}$ with $ \operatorname{supp} \phi ...
2
votes
1answer
112 views
Necessary conditions for optimality in Banach spaces
Let $X$ denote the non-negative "orthant" of the Banach space $L^2$ (or whatever you call the set of functions in $L^2$ that are non-negative), and let $C$ be a closed, convex subset of $X$. Let $f$ ...
4
votes
1answer
202 views
C*-Algebras: Dynamics vs. Derivations
Problem Given a C*-algebra $\mathcal{A}$. Consider dynamics $\tau:\mathbb{R}\to\mathrm{Aut}(\mathcal{A})$ and $\tau':\mathbb{R}\to\mathrm{Aut}(\mathcal{A})$. (More precisely, strongly continuous ...
1
vote
1answer
159 views
On the Hölder regularity of an integral function
Let $n\geq 3$. Let $\Omega$ be an open and bounded subset of $\mathbb{R}^n$. Let define $X_0$ as the space of functions $f:\bar\Omega\times\partial\Omega\to\mathbb{R}$ such that $f(x,\cdot)$ is ...
0
votes
1answer
251 views
About an integral equation
I would like to obtain $g$ by solving the following integral equation $$ \int_s^T R(u) dg(u) + f(s,T)\int_s^T g(u)du =0$$ where $f,R:\mathbb R _+ ^*\rightarrow \mathbb R _+ $and $g: \mathbb R _+ ...
4
votes
1answer
207 views
Isomorphisms between spaces of test functions and sequence spaces
I am in the process of writing some self-contained notes on probability theory in spaces of distributions, for the purposes of statistical mechanics and quantum field theory. Perhaps the simplest ...
2
votes
1answer
241 views
Sobolev Space, “characteristic function” for the weak derivative
Let $\Omega$ be an open bounded subset of $\mathbb{R}^N$, working in the space $H_0^1(\Omega)$ with the inner product $$(u,v)_{H_0^1} = \int_\Omega \nabla u \cdot \nabla v$$ for $u\in H_0^1$ and ...
4
votes
2answers
610 views
What does analyticity imply in complex analysis? [closed]
In complex analysis, we're constantly faced with problems about the analyticity of a function, on which many theorems are developed. I of course know a bunch of formulas and theorems, but could not ...
9
votes
1answer
382 views
Between compact and locally uniform: What is the name of this convergence?
Let $X$ be a topological space, $(Y,d)$ a metric space, $f\in Y^X$, and $(f_n)$ a sequence in $Y^X$ with the following property: For every $x_0\in X$ and every $\varepsilon>0$, there exist a ...
1
vote
2answers
285 views
How to prove that a kernel is positive definite?
For example, how to prove $\forall(x,y)\in R^N\times R^N,K(x,y) = \displaystyle\frac{1}{1+\frac{||x - y||^2}{{\sigma}^2}}\\$ where $\sigma > 0$ is a parameter, is positive definite? I have tried to ...
2
votes
1answer
224 views
Extensions in parabolic Hölder spaces
Let $\alpha\in ]0,1[,k\in\mathbb{N}.$Let $\Omega$ be a open and bounded subset or $\mathbb{R}^n$ of class $C^{k+\alpha}$. As one could find in G.M. Troianello "Elliptic Differential Equations and ...
4
votes
1answer
298 views
When is a `1-form' with continuous coefficients exact?
Let $\Omega$ be a convex, bounded open subset of $\mathbb{R}^d$, and let $C^1(\bar \Omega)$ be usual space of continuous functions on $\bar \Omega$ which are $C^1$ in $\Omega$ and whose partials in ...
0
votes
1answer
157 views
Orthogonal projection
Let $G$ be an operator with compact resolvent on a Hilbert space $H$ such that $\ker G \neq \{0\}$. Further let $P$ be the orthogonal projection onto $\ker G$, and let $G_{0} := G+P$. My question is: ...
7
votes
7answers
601 views
What is the best reference for Spectral theory?
I'm studying Bernard Aupetit: A Primer on Spectral Theory but the textbook we are using is a little bit heavy going for me. Is there a best book to learn about these things? Thank you.
0
votes
0answers
51 views
A question related to the Nikolskii fractional spaces
Consider a Nikolskii space, that is $$ N^{s,p}=\{f\in L^{p}(I, d\ell): \|f\|_{\overline{N}^{s,p}}=\underset{h>0}{\sup}h^{-s}\|\tau_{h}f-f\|_{L^{p}(I_{h})}<\infty \}, $$ where ...
6
votes
0answers
145 views
Is an infinite-dimensional “Lebesgue measure” uniquely determined by a set of positive finite measure?
Let $\mu$ be a probability measure on a subset $C \subset \mathbb{R}^\infty$ of the space of sequences, and assume, for simplicity, that $C$ is closed and convex. We say that $\mu$ admits shifts if ...
2
votes
0answers
88 views
continuity with respect to weak-${\ast}$ topology
Let $V:=V([0,1],R)$ be the space of all cadlag functions defined on $[0,1]$ of bounded variation. Thus any element $v\in V$ determines a signed measure $\nu$ on $[0, 1]$ given by the formula $\nu([0, ...
-4
votes
2answers
99 views
Does the Laplacian commutes with the indicator function [closed]
We define the laplacian operator $\Delta$ with the Neumann boundary conditions on the space $H^2(\Omega)$, where $\Omega$ is an open set of $\mathbb{R}^n$ with a smooth boundary $\partial\Omega$, and ...
3
votes
1answer
110 views
A question about Skorokhod metric
I have a question related to the Skorokhod distance. Let $\Omega:=D([0,1],R)$ be the space of cadlag functions $x$ defined on $[0,1]$. Let $\Lambda$ be the collection of non-decreasing continuous ...
1
vote
1answer
176 views
Smooth curves in a Frechet space
Is the space $C^{\infty}([0,1];C^{\infty}(S^1))$ equal with the space $C^{\infty}([0,1]\times S^1)$ ? I am interested in characterizing the smooth curves in the space $C^{\infty}(S^1)$ where $S^1$ is ...
3
votes
1answer
77 views
Skorokhod distance between $\omega, \omega\circ f_{\varepsilon}$ and $\omega, \omega\circ b_{\varepsilon}$
Let $\Omega:=D([0,1],R)$ be the space of cadlag functions $x$ defined on $[0,1]$. Let $\rho$ be the Skorokhod metric on $\Omega$, see e.g. http://en.wikipedia.org/wiki/C%C3%A0dl%C3%A0g Now define ...
3
votes
1answer
145 views
A nilpotency question on $C^{*}$ algebras
What is an example of a $C^{*}$ algebra $A$ with the property that: for every nilpotent(Quasi nilpotent) $a$ and for every $n\in \mathbb{N}$, there is a $b$ with $b^{n}=a$. To what extent ...
|
{
"url": "http://mathoverflow.net/questions/tagged/fa.functional-analysis?page=2&sort=newest&pagesize=15",
"source_domain": "mathoverflow.net",
"snapshot_id": "crawl=CC-MAIN-2014-52",
"warc_metadata": {
"Content-Length": "165094",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:U7X4GCZSERRXNNBFW7GJM5P2HL537VCH",
"WARC-Concurrent-To": "<urn:uuid:8d2591aa-53a2-404d-8555-8c9aa19e2cbf>",
"WARC-Date": "2014-12-29T13:53:17Z",
"WARC-IP-Address": "198.252.206.148",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:UCX5ZCOJZXGYQSDOS3LKEIKUABPH7S5S",
"WARC-Record-ID": "<urn:uuid:7662c0d8-b2f8-4f3f-a74f-cdcda71a94a3>",
"WARC-Target-URI": "http://mathoverflow.net/questions/tagged/fa.functional-analysis?page=2&sort=newest&pagesize=15",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2001a394-d2a9-404b-a92d-0c429bfe8dd2>"
},
"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,
110,
111,
150,
151,
153,
159,
167,
177,
178,
287,
288,
491,
493,
499,
507,
517,
518,
545,
546,
744,
746,
752,
760,
770,
771,
816,
817,
1017,
1019,
1025,
1034,
1044,
1045,
1107,
1108,
1313,
1315,
1321,
1330,
1339,
1340,
1402,
1403,
1591,
1593,
1598,
1607,
1617,
1618,
1669,
1670,
1872,
1875,
1881,
1890,
1900,
1901,
1951,
1952,
2154,
2156,
2162,
2170,
2180,
2181,
2230,
2231,
2432,
2434,
2440,
2449,
2458,
2459,
2492,
2493,
2682,
2684,
2690,
2699,
2709,
2710,
2773,
2774,
2971,
2973,
2979,
2987,
2997,
2998,
3053,
3054,
3250,
3252,
3258,
3267,
3276,
3277,
3343,
3344,
3547,
3549,
3554,
3563,
3572,
3573,
3616,
3617,
3816,
3818,
3824,
3832,
3842,
3843,
3902,
3903,
4105,
4107,
4113,
4122,
4132,
4133,
4159,
4160,
4353,
4356,
4362,
4371,
4381,
4382,
4448,
4449,
4646,
4648,
4654,
4663,
4672,
4673,
4742,
4743,
4942,
4944,
4950,
4958,
4967,
4968,
5014,
5015,
5220,
5222,
5228,
5237,
5246,
5247,
5311,
5312,
5510,
5512,
5518,
5526,
5536,
5537,
5564,
5565,
5765,
5767,
5773,
5782,
5791,
5792,
5834,
5835,
6029,
6031,
6036,
6045,
6054,
6055,
6124,
6125,
6325,
6327,
6333,
6342,
6351,
6352,
6403,
6404,
6607,
6609,
6615,
6624,
6634,
6635,
6698,
6699,
6901,
6903,
6909,
6918,
6928,
6929,
6976,
6977,
7181,
7183,
7189,
7198,
7208,
7209,
7249,
7250,
7454,
7456,
7462,
7471,
7481,
7482,
7514,
7515,
7623,
7625,
7631,
7640,
7650,
7651,
7690,
7691,
7883,
7885,
7891,
7900,
7909,
7910,
7989,
7990,
8189,
8191,
8197,
8205,
8215,
8216,
8269,
8270,
8473,
8475,
8481,
8489,
8499,
8500,
8538,
8539,
8738,
8740,
8745,
8753,
8763,
8764,
8813,
8814,
9012,
9014,
9020,
9028,
9038,
9039,
9066,
9067,
9266,
9268,
9274,
9282,
9292,
9293,
9359,
9360,
9560,
9562,
9568,
9576,
9586,
9587,
9652,
9653,
9852,
9854,
9860,
9869,
9879,
9880,
9938,
9939,
10141,
10143,
10149,
10157,
10167,
10168,
10243,
10244,
10439,
10441,
10446,
10455,
10465,
10466,
10515,
10516,
10718,
10720,
10726,
10734,
10744,
10745,
10783,
10784,
10984,
10986,
10992,
11000,
11010,
11011,
11066,
11067,
11269,
11271,
11277,
11285,
11295,
11296,
11318,
11319,
11523,
11525,
11531,
11540,
11550,
11551,
11599,
11600,
11785,
11787,
11793,
11802,
11811,
11812,
11866,
11867,
12046,
12048,
12054,
12063,
12073,
12074,
12177,
12178,
12380,
12382,
12388,
12397,
12406,
12407,
12457,
12458,
12662,
12665,
12671,
12680,
12689,
12690,
12755,
12756,
12960,
12962,
12968,
12976,
12986,
12987,
13021,
13022,
13222,
13224,
13229,
13237,
13247,
13248,
13281,
13282,
13486,
13488,
13494,
13502,
13511,
13512,
13619,
13620,
13820,
13822,
13828,
13836,
13846,
13847,
13889,
13890
],
"line_end_idx": [
110,
111,
150,
151,
153,
159,
167,
177,
178,
287,
288,
491,
493,
499,
507,
517,
518,
545,
546,
744,
746,
752,
760,
770,
771,
816,
817,
1017,
1019,
1025,
1034,
1044,
1045,
1107,
1108,
1313,
1315,
1321,
1330,
1339,
1340,
1402,
1403,
1591,
1593,
1598,
1607,
1617,
1618,
1669,
1670,
1872,
1875,
1881,
1890,
1900,
1901,
1951,
1952,
2154,
2156,
2162,
2170,
2180,
2181,
2230,
2231,
2432,
2434,
2440,
2449,
2458,
2459,
2492,
2493,
2682,
2684,
2690,
2699,
2709,
2710,
2773,
2774,
2971,
2973,
2979,
2987,
2997,
2998,
3053,
3054,
3250,
3252,
3258,
3267,
3276,
3277,
3343,
3344,
3547,
3549,
3554,
3563,
3572,
3573,
3616,
3617,
3816,
3818,
3824,
3832,
3842,
3843,
3902,
3903,
4105,
4107,
4113,
4122,
4132,
4133,
4159,
4160,
4353,
4356,
4362,
4371,
4381,
4382,
4448,
4449,
4646,
4648,
4654,
4663,
4672,
4673,
4742,
4743,
4942,
4944,
4950,
4958,
4967,
4968,
5014,
5015,
5220,
5222,
5228,
5237,
5246,
5247,
5311,
5312,
5510,
5512,
5518,
5526,
5536,
5537,
5564,
5565,
5765,
5767,
5773,
5782,
5791,
5792,
5834,
5835,
6029,
6031,
6036,
6045,
6054,
6055,
6124,
6125,
6325,
6327,
6333,
6342,
6351,
6352,
6403,
6404,
6607,
6609,
6615,
6624,
6634,
6635,
6698,
6699,
6901,
6903,
6909,
6918,
6928,
6929,
6976,
6977,
7181,
7183,
7189,
7198,
7208,
7209,
7249,
7250,
7454,
7456,
7462,
7471,
7481,
7482,
7514,
7515,
7623,
7625,
7631,
7640,
7650,
7651,
7690,
7691,
7883,
7885,
7891,
7900,
7909,
7910,
7989,
7990,
8189,
8191,
8197,
8205,
8215,
8216,
8269,
8270,
8473,
8475,
8481,
8489,
8499,
8500,
8538,
8539,
8738,
8740,
8745,
8753,
8763,
8764,
8813,
8814,
9012,
9014,
9020,
9028,
9038,
9039,
9066,
9067,
9266,
9268,
9274,
9282,
9292,
9293,
9359,
9360,
9560,
9562,
9568,
9576,
9586,
9587,
9652,
9653,
9852,
9854,
9860,
9869,
9879,
9880,
9938,
9939,
10141,
10143,
10149,
10157,
10167,
10168,
10243,
10244,
10439,
10441,
10446,
10455,
10465,
10466,
10515,
10516,
10718,
10720,
10726,
10734,
10744,
10745,
10783,
10784,
10984,
10986,
10992,
11000,
11010,
11011,
11066,
11067,
11269,
11271,
11277,
11285,
11295,
11296,
11318,
11319,
11523,
11525,
11531,
11540,
11550,
11551,
11599,
11600,
11785,
11787,
11793,
11802,
11811,
11812,
11866,
11867,
12046,
12048,
12054,
12063,
12073,
12074,
12177,
12178,
12380,
12382,
12388,
12397,
12406,
12407,
12457,
12458,
12662,
12665,
12671,
12680,
12689,
12690,
12755,
12756,
12960,
12962,
12968,
12976,
12986,
12987,
13021,
13022,
13222,
13224,
13229,
13237,
13247,
13248,
13281,
13282,
13486,
13488,
13494,
13502,
13511,
13512,
13619,
13620,
13820,
13822,
13828,
13836,
13846,
13847,
13889,
13890,
14081
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 14081,
"ccnet_original_nlines": 403,
"rps_doc_curly_bracket": 0.014416590332984924,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2556203305721283,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06772133708000183,
"rps_doc_frac_lines_end_with_ellipsis": 0.12128712981939316,
"rps_doc_frac_no_alph_words": 0.3594227135181427,
"rps_doc_frac_unique_words": 0.34899330139160156,
"rps_doc_mean_word_length": 4.840364456176758,
"rps_doc_num_sentences": 117,
"rps_doc_symbol_to_word_ratio": 0.013877320103347301,
"rps_doc_unigram_entropy": 5.671164512634277,
"rps_doc_word_count": 2086,
"rps_doc_frac_chars_dupe_10grams": 0.021788649260997772,
"rps_doc_frac_chars_dupe_5grams": 0.04318113997578621,
"rps_doc_frac_chars_dupe_6grams": 0.021788649260997772,
"rps_doc_frac_chars_dupe_7grams": 0.021788649260997772,
"rps_doc_frac_chars_dupe_8grams": 0.021788649260997772,
"rps_doc_frac_chars_dupe_9grams": 0.021788649260997772,
"rps_doc_frac_chars_top_2gram": 0.0237694401293993,
"rps_doc_frac_chars_top_3gram": 0.011092400178313255,
"rps_doc_frac_chars_top_4gram": 0.004753889981657267,
"rps_doc_books_importance": -1914.68408203125,
"rps_doc_books_importance_length_correction": -1914.68408203125,
"rps_doc_openwebtext_importance": -1091.28857421875,
"rps_doc_openwebtext_importance_length_correction": -1091.28857421875,
"rps_doc_wikipedia_importance": -797.7020263671875,
"rps_doc_wikipedia_importance_length_correction": -797.7020263671875
},
"fasttext": {
"dclm": 0.18095195293426514,
"english": 0.815459668636322,
"fineweb_edu_approx": 1.2866052389144897,
"eai_general_math": 0.973603367805481,
"eai_open_web_math": 0.939367413520813,
"eai_web_code": 0.020382050424814224
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "515.73",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Calculus and Mathematical analysis"
}
},
"secondary": {
"code": "515.7",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Calculus and Mathematical analysis"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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
|
1,025,831,953,649,072,000 |
Give me neither poverty nor riches, but give me only my daily bread - Proverbs 30:8
Wednesday, October 30, 2013
Social Media
Social media is all the rage these days and taking part in everything that's available can be overwhelming. Earlier this year I shared what works for me and why. I feel like I do a bare minimum, but it's still hard to keep up with those three things. Often I dream of the days when there was no blogging or instagram or Pinterest. But I also know those things bring joy to my life. Sometimes I feel like it's all noise and I'm adding to the noise by participating.
Maybe I should try quitting it all and see what it's like to live like it's 1992 again.
How about you?
1 comment:
1. In our family, I don't allow my children any screen time until after 4:00. I found that without that rule, they were asking all the time if they could play this game, or watch that show. I've done this since January of this year, and for the longest time it seemed like they were just waiting for 4:00 every day so they could do their thing. It's only in the last month or two that they've stopped watching the minutes. For myself personally, I've (mostly) quit Facebook (cut my friends from 200 to 20ish) and taken to blogging instead. I know it's still the same level of "noise," but it seems to be more coherent noise, less garbled and meaningless.
ReplyDelete
|
{
"url": "http://jill-foleyjourney.blogspot.com/2013/10/social-media.html",
"source_domain": "jill-foleyjourney.blogspot.com",
"snapshot_id": "crawl=CC-MAIN-2018-30",
"warc_metadata": {
"Content-Length": "73651",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PY75S737IVXHEO5JDGLVEIPHHV7AIL7G",
"WARC-Concurrent-To": "<urn:uuid:0c3dc7db-614b-45f5-95ab-76f30c595000>",
"WARC-Date": "2018-07-16T05:02:18Z",
"WARC-IP-Address": "172.217.7.225",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OVX77VV25EYV63MTSNECSMKYO7RAGODV",
"WARC-Record-ID": "<urn:uuid:6e78c8c6-2ec1-4940-b49b-a79f74d09ea9>",
"WARC-Target-URI": "http://jill-foleyjourney.blogspot.com/2013/10/social-media.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:dfe51c78-a76a-4b0c-baac-5952f382d85b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-179-103-175.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,
84,
85,
113,
114,
127,
128,
129,
130,
596,
597,
685,
686,
702,
703,
704,
715,
716,
1373,
1374
],
"line_end_idx": [
84,
85,
113,
114,
127,
128,
129,
130,
596,
597,
685,
686,
702,
703,
704,
715,
716,
1373,
1374,
1389
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1389,
"ccnet_original_nlines": 19,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4811320900917053,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04088050127029419,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18867924809455872,
"rps_doc_frac_unique_words": 0.6313725709915161,
"rps_doc_mean_word_length": 4.180392265319824,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.8361124992370605,
"rps_doc_word_count": 255,
"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.011257040314376354,
"rps_doc_frac_chars_top_3gram": 0.016885550692677498,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -158.16598510742188,
"rps_doc_books_importance_length_correction": -158.1494140625,
"rps_doc_openwebtext_importance": -89.32781219482422,
"rps_doc_openwebtext_importance_length_correction": -89.32781219482422,
"rps_doc_wikipedia_importance": -67.9190673828125,
"rps_doc_wikipedia_importance_length_correction": -65.76681518554688
},
"fasttext": {
"dclm": 0.15514057874679565,
"english": 0.9847123622894287,
"fineweb_edu_approx": 0.9910337924957275,
"eai_general_math": 0.031196530908346176,
"eai_open_web_math": 0.09758461266756058,
"eai_web_code": 0.02204429917037487
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "303.4833",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social sciences — Dictionaries"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,808,623,946,578,680,000 |
Importing
Importing
Top Previous Next
If you already have guest details (for example in an email or organizer address book, spreadsheet or text file) you can import the data directly into PerfectTablePlan, rather than re-typing it.
PerfectTablePlan can import information in 4 major formats:
Excel .xls/.xlsx - Excel's proprietary format.
CSV (Comma Separated Value ) - A text file that can be produced by Excel (select File>Save As and choose .csv as the file type) and many other types of applications. Columns and rows are delimited by commas and carriage returns, respectively. " and , characters are quoted.
Delimited text data - A text file with the user's choice of delimiters (separators). Many applications can produce data in this form. Excel CSV is a special form of delimited text data.
vCard file - vCard files be exported from most applications with address books, including Outlook, Palm Pilot desktop and the Apple Mac Address Book.
As a simpler (but less flexible) alternative to importing you can also use the Quick Add Guests window.
See also:
Import window
Importing guests from Excel files
Importing guests from text and CSV files
Importing guests from vCard files
Import non-English characters
Import guests tutorial
Example import formats
|
{
"url": "https://www.perfecttableplan.com/help/52/windows/html/importing.htm",
"source_domain": "www.perfecttableplan.com",
"snapshot_id": "crawl=CC-MAIN-2018-09",
"warc_metadata": {
"Content-Length": "9474",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ROQ3TZEWVHNZ7G3Z26FYWPXZM6GT4ULR",
"WARC-Concurrent-To": "<urn:uuid:62d25dce-ce16-4f67-b249-ec55b34c6ebc>",
"WARC-Date": "2018-02-24T04:30:28Z",
"WARC-IP-Address": "217.160.0.103",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7L34JDX65EQKF3JJI23MCPJ64L6EIZZ6",
"WARC-Record-ID": "<urn:uuid:9331a6e9-f239-461e-ad9c-db12b303d680>",
"WARC-Target-URI": "https://www.perfecttableplan.com/help/52/windows/html/importing.htm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6818f58d-b559-49d9-b238-50f580c27cb1>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-145-70-71.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,
12,
13,
23,
24,
44,
45,
239,
240,
300,
301,
348,
622,
808,
958,
959,
1063,
1064,
1074,
1075,
1089,
1123,
1164,
1198,
1228,
1251
],
"line_end_idx": [
12,
13,
23,
24,
44,
45,
239,
240,
300,
301,
348,
622,
808,
958,
959,
1063,
1064,
1074,
1075,
1089,
1123,
1164,
1198,
1228,
1251,
1273
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1273,
"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.2851239740848541,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.020661160349845886,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1735537201166153,
"rps_doc_frac_unique_words": 0.5663265585899353,
"rps_doc_mean_word_length": 5.198979377746582,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.4765448570251465,
"rps_doc_word_count": 196,
"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.02355249971151352,
"rps_doc_frac_chars_top_3gram": 0.05593718960881233,
"rps_doc_frac_chars_top_4gram": 0.04710499942302704,
"rps_doc_books_importance": -120.59593200683594,
"rps_doc_books_importance_length_correction": -120.59593200683594,
"rps_doc_openwebtext_importance": -74.19115447998047,
"rps_doc_openwebtext_importance_length_correction": -74.19115447998047,
"rps_doc_wikipedia_importance": -63.903594970703125,
"rps_doc_wikipedia_importance_length_correction": -63.903594970703125
},
"fasttext": {
"dclm": 0.05745590105652809,
"english": 0.8733167052268982,
"fineweb_edu_approx": 2.8353664875030518,
"eai_general_math": 0.5561950206756592,
"eai_open_web_math": 0.26475733518600464,
"eai_web_code": 0.08832728862762451
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.8",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,505,872,747,322,010,000 |
[HOWTO] get around Microsoft Office corrupt font issue
jason.sellers
Registered
Dear old Micros**t can't even answer this one!
If you have a problem in word or excel, where you are told you have corrupt fonts, (they aren't, it's a microsoft issue), simply delete FontCacheTool from your machine, (use AppleF to find it) It's part of the office package, so won't affect anything else.
Empty your trash and voila!
Word and Excel now start up as they should.
Why Microsoft think that they can handle fonts better than OSX or suitcase, I'll never know. It also makes me wonder what exactly this tool is doing!
imdave
Registered
Thanks for this tip! This has been driving me crazy for about a week. I found no solution on the MS site. I found this and fixed the problem in about 2 seconds.
bethrosengard
Registered
Someone just pointed out this thread to me and it contains some misinformation and questionable advice so I thought I'd better comment on what Jason said in his post. Here goes:
Jason said: Dear old Micros**t can't even answer this one!
No they can't. That's partly because it's such an inconsistent bug that they have been unable to replicate it in house; and it's partly because it's very likely to be an Apple bug.
Jason said: If you have a problem in word or excel, where you are told you have corrupt fonts, (they aren't, it's a microsoft issue), simply delete FontCacheTool from your machine, (use AppleF to find it) It's part of the office package, so won't affect anything else. Empty your trash and voila! Word and Excel now start up as they should.
This is the questionable advice I referred to. Yes, it's true that deleting the FontCacheTool *appears* to solve the problem. It solves nothing. What it does is turn off the mechanism that notifies you when your fonts are corrupt; IOW, it prevents the problem from coming to view by eliminating the "font optimization" process from occurring.
Secondly, if you ever have to trash your Office Font Cache, you will lose WYSIWYG display of your fonts (which may or may not matter to you).
Finally, unlike the Office and System font caches, The FontCacheTool is not recreated automatically when you relaunch an Office application. The only way to restore this tool is to do a proper removal and reinstallation of Office.
So, DON'T delete your FontCacheTool. If you have tried all the other known workarounds for this bug and you get no joy, then archive or rename the FontCacheTool so you can restore it if needed. And be sure to do so before updating Office every time!
Much more on this bug here (including less severe workarounds): <http://word.mvps.org/mac/CorruptFontErrors.html>
Jason said: Why Microsoft think that they can handle fonts better than OSX or suitcase, I'll never know. It also makes me wonder what exactly this tool is doing!
You should know by now if you've read the above: It controls the font optimization process; it allows WYSIWYG for fonts; it warns you when fonts are corrupt (and probably more that I'm not aware of).
HTH,
Beth
<http://www.word.mvps.org/mac/WordMacHome.html>
SNance
Registered
Jason, Thanks for the tip about trashing "FontCache"! It saved what little sanity I had left with regard to Microsoft products :)
teszeract
Registered
Hi
This tip refers, I think, only to Office 04, not V.x. On this version I still cannot find a solution. My problem is actually worse: while Word attempts to load, cycling through a Optimizing Font Menu message, all other applications including some Dashboard ones come crashing down.
joshfree
Registered
Suitcase Fusion v.12.1.4 has a known bug that conflicts with MS Office's font menus. I just got off the phone with Extensisi Tech Support and they are working on a fix. V.12.1.5 should be out in a few days. Meanwhile, to revert to 12.1.3 which works fine, delete the database by deleting the entire Suitcase folder you'll find at ([username]/Library/Application Support/Extensis/Suitcase. If you have a backup from before 12.1.4, you can replace the database with that. Otherwise, Suitcase Fusion wlll just build a new one. Then trash the updated Application (Suitcase Fusion) and install 12.1.3 from a fresh download.
You should know by now if you've read the above: It controls the font optimization process; it allows WYSIWYG for fonts; it warns you when fonts are corrupt (and probably more that I'm not aware of).>
good riddance. I am not getting these corrupt font errors, but I might delete FontCacheTool just to get rid of the optimization. I can't tell you how many times I have been forced to stare at the "optimizing font menu" screen while loading a Word doc.
How does FontBook do it? seems to work far smoother than Office. Is it an API that other apps can use? If so, MS really should be using that rather than creating a slow, unstable version.
tmcalis566
Registered
JASON AND BETH!!!! I WOULD LIKE TO THANK YALL FOR EVERYTHING!!!!!!!! I just copied over 1000 fonts and their families to my LIBRARY/FONTS folder (from my external HD) AND OFFICE WAS ACTIN' CRAZY....Optimization Crap!!!! :mad: Well, instead of deleting the file I called mine: "CULPRIT_FontCacheTool"! ::evil::
I understand that this file is not to be a pain in the butt, but, I can just use Font Book to check my fonts for corruption, by selecting "validate fonts" under it's "File Menu". Thanks a bunch! :)
Tai :)
Top
|
{
"url": "https://macosx.com/threads/howto-get-around-microsoft-office-corrupt-font-issue.271130/#post-1442551",
"source_domain": "macosx.com",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "87649",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WIIUKOO7QFTXIKI3JOIGM4H225LHO35J",
"WARC-Concurrent-To": "<urn:uuid:f40cb2ff-5fed-4ca6-a10f-57e61f030d79>",
"WARC-Date": "2021-12-01T09:14:08Z",
"WARC-IP-Address": "147.75.109.145",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IAQPKITBEJ6NYJJYRIU2IV2ZRANWHU3O",
"WARC-Record-ID": "<urn:uuid:293b812e-4b0a-4260-b089-26fb390b862d>",
"WARC-Target-URI": "https://macosx.com/threads/howto-get-around-microsoft-office-corrupt-font-issue.271130/#post-1442551",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b50e62b9-060e-4f7a-954a-f42640daea0b>"
},
"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-123\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,
55,
56,
70,
71,
82,
129,
130,
388,
389,
417,
418,
462,
463,
613,
615,
616,
623,
624,
635,
796,
798,
799,
813,
814,
825,
1003,
1004,
1063,
1064,
1245,
1246,
1588,
1589,
1932,
1933,
2075,
2076,
2307,
2308,
2558,
2559,
2673,
2674,
2836,
2837,
3037,
3038,
3043,
3048,
3096,
3098,
3099,
3106,
3107,
3118,
3248,
3250,
3251,
3261,
3262,
3273,
3276,
3277,
3559,
3561,
3562,
3571,
3572,
3583,
4202,
4204,
4405,
4406,
4658,
4659,
4847,
4849,
4850,
4861,
4862,
4873,
5183,
5184,
5382,
5383,
5384,
5391,
5393
],
"line_end_idx": [
55,
56,
70,
71,
82,
129,
130,
388,
389,
417,
418,
462,
463,
613,
615,
616,
623,
624,
635,
796,
798,
799,
813,
814,
825,
1003,
1004,
1063,
1064,
1245,
1246,
1588,
1589,
1932,
1933,
2075,
2076,
2307,
2308,
2558,
2559,
2673,
2674,
2836,
2837,
3037,
3038,
3043,
3048,
3096,
3098,
3099,
3106,
3107,
3118,
3248,
3250,
3251,
3261,
3262,
3273,
3276,
3277,
3559,
3561,
3562,
3571,
3572,
3583,
4202,
4204,
4405,
4406,
4658,
4659,
4847,
4849,
4850,
4861,
4862,
4873,
5183,
5184,
5382,
5383,
5384,
5391,
5393,
5396
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5396,
"ccnet_original_nlines": 88,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4081287086009979,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04911091923713684,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19729043543338776,
"rps_doc_frac_unique_words": 0.40510544180870056,
"rps_doc_mean_word_length": 4.64927864074707,
"rps_doc_num_sentences": 78,
"rps_doc_symbol_to_word_ratio": 0.0008467399748042226,
"rps_doc_unigram_entropy": 5.398874759674072,
"rps_doc_word_count": 901,
"rps_doc_frac_chars_dupe_10grams": 0.25256624817848206,
"rps_doc_frac_chars_dupe_5grams": 0.2692766785621643,
"rps_doc_frac_chars_dupe_6grams": 0.2692766785621643,
"rps_doc_frac_chars_dupe_7grams": 0.2692766785621643,
"rps_doc_frac_chars_dupe_8grams": 0.2692766785621643,
"rps_doc_frac_chars_dupe_9grams": 0.25256624817848206,
"rps_doc_frac_chars_top_2gram": 0.010026260279119015,
"rps_doc_frac_chars_top_3gram": 0.008593940176069736,
"rps_doc_frac_chars_top_4gram": 0.0071616098284721375,
"rps_doc_books_importance": -506.33575439453125,
"rps_doc_books_importance_length_correction": -506.33575439453125,
"rps_doc_openwebtext_importance": -298.8106689453125,
"rps_doc_openwebtext_importance_length_correction": -298.8106689453125,
"rps_doc_wikipedia_importance": -207.63348388671875,
"rps_doc_wikipedia_importance_length_correction": -207.63348388671875
},
"fasttext": {
"dclm": 0.08526747673749924,
"english": 0.941497802734375,
"fineweb_edu_approx": 1.4309784173965454,
"eai_general_math": 0.4112604856491089,
"eai_open_web_math": 0.43909752368927,
"eai_web_code": 0.015299620106816292
}
}
|
{
"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": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-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": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,074,594,073,807,900,400 |
JG Estevez JG Estevez - 6 months ago 88
ASP.NET (C#) Question
The required anti-forgery cookie "__RequestVerificationToken" is not present
My website is raising this exception around 20 times a day, usually the form works fine but there are instances where this issue occur and I don't know why is so random.
This is logged exception by elmah
500 HttpAntiForgery The required anti-forgery cookie __RequestVerificationToken" is not present.
But the form it is sending the the token as shown on the xml log by elmah
<form>
<item name="__RequestVerificationToken">
<value string="DNbDMrzHmy37GPS6IFH-EmcIh4fJ2laezIrIEev5f4vOhsY9T7SkH9-1b7GPjm92CTFtb4dGqSe2SSYrlWSNEQG1MUlNyiLP1wtYli8bIh41"/>
</item>
<item name="toPhone">
<value string="XXXXXX"/>
</item>
<item name="smsMessage">
<value string="xxxxxxxx"/>
</item>
</form>
This is my method on the controller which uses the data Attribute to check if the token is valid or nor
[HttpPost]
[ValidateAntiForgeryToken]
public async Task<JsonResult> Send(SMSModel model)
{
my code goes here
}
This is my form on the view
@using (Html.BeginForm("Send", "SMS", FormMethod.Post, new { @class = "form-sms", autocomplete = "off" }))
{
@Html.AntiForgeryToken()
<div class="row">
<div class="col-md-12">
<div class="form-group">
<div class="input-group">
<div class="input-group-addon">+53</div>
@Html.TextBoxFor(m => m.toPhone, new { @class = "form-control", placeholder = "teléfono", required = "required", type = "tel", maxlength = 8 })
</div>
</div>
</div>
</div>
<div class="form-group" style="position:relative">
<label class="sr-only" for="exampleInputEmail3">Message (up to 135 characters)</label>
@Html.TextAreaFor(m => m.smsMessage, new { rows = 4, @class = "form-control", placeholder = "escriba aquí su mensaje", required = "required", maxlength = "135" })
<span class="char-count">135</span>
</div>
if (ViewBag.Sent == true)
{
<div class="alert alert-success alert-dismissible" role="alert">
<button type="button" class="close" data-dismiss="alert" aria-label="Close"><span aria-hidden="true">×</span></button>
<strong>Su mensaje ha sido enviado <span class="hidden-xs">satisfactoriamente</span></strong>
</div>
}
if (ViewBag.Error == true)
{
<div class="alert alert-danger alert-dismissible" role="alert">
<button type="button" class="close" data-dismiss="alert" aria-label="Close"><span aria-hidden="true">×</span></button>
<strong>Error:</strong> Por favor revise el número de teléfono.
</div>
}
<div class="errorToMany"></div>
<button type="submit" class="btn btn-default btn-block">Enviar SMS</button>
}
and this how I post my data using ajax
$('form.form-sms').submit(function (event) {
$.ajax({
url: $(this).attr("action"),
type: "POST",
data: $(this).serializeArray(),
beforeSend: function (xhr) {
$('.btn-default').attr("disabled", true);
$('.btn-default').html("Enviando...")
},
success: function (data, textStatus, jqXHR) {
if (data[0] == false && data[1] == "1") {
some code
} else {
location.reload();
}
},
error: function (jqXHR, textStatus, errorThrown) { }
});
return false;
})
The form works well most time but this error keeps happening and I don't know why, I've checked other questions here on SO but nothing works for me.
For further explanation about how I post the data.
This form to send SMS has the fields ToNumber and Message. When an user clicks on the submit Button the ajax function takes control and post it serializing the form's field data, when my function in the controller finishes and return the Json result indicating everything went well, the ajax method reloads the page showing the user a success message.
Any ideas what could be causing this issue.
Answer
It almost sounds as if things are working as expected.
The way the anti forgery helper @Html.AntiForgeryToken() works is by injecting a hidden form field named __RequestVerificationToken into the page AND it also sets a cookie into the browser.
When the form is posted back the two are compared and if they don't match or the cookie is missing then the error is thrown.
So it does not matter that Elmah logs that the form is sending __RequestVerificationToken. It always will, even in the event of CSRF attack, because this is simply the hidden form field.
<input name="__RequestVerificationToken" type="hidden" value="DNbDMrzHmy37GPS6IFH-EmcIh4fJ2laezIrIEev5f4vOhsY9T7SkH9-1b7GPjm92CTFtb4dGqSe2SSYrlWSNEQG1MUlNyiLP1wtYli8bIh41" />
The error message on the other hand says the corresponding COOKIE is not being sent:
500 HttpAntiForgery The required anti-forgery cookie __RequestVerificationToken" is not present.
So basically someone/something is replaying the form post without making the original request to get the cookie. As such they have the hidden form field __RequestVerificationToken but NOT the cookie to verify it.
So it seems like things are working as they should. Check your logs re: IP numbers, and referrers, etc. You might be under attack or perhaps be doing something weird or buggy when redirecting your form content. As above, referrers are a good place to start for this kind of error, assuming this is not being spoofed.
Also note that as per MDN
location.reload();
The Location.reload() method reloads the resource from the current URL. Its optional unique parameter is a Boolean, which, when it is true, causes the page to always be reloaded from the server. If it is false or not specified, the browser may reload the page from its cache.
If it is, on occasion loading from cache, then you might end up with a POST that has the old page token but not the cookie.
So try :
location.reload(true);
|
{
"url": "https://codedump.io/share/90fc5YxMG7TR/1/the-required-anti-forgery-cookie-quotrequestverificationtokenquot-is-not-present",
"source_domain": "codedump.io",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "34258",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BRZYNZPYBQCETJHLT33GE6L26N2CDWJU",
"WARC-Concurrent-To": "<urn:uuid:32f4942b-7bbf-467a-b895-111bc1ef1df1>",
"WARC-Date": "2017-05-29T22:57:15Z",
"WARC-IP-Address": "84.22.103.185",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HZ2XXBACWZDSU4KQSEOVEIBQ36WMLVIZ",
"WARC-Record-ID": "<urn:uuid:9d3b74b6-b5db-4ff1-b69e-431a5dd950ed>",
"WARC-Target-URI": "https://codedump.io/share/90fc5YxMG7TR/1/the-required-anti-forgery-cookie-quotrequestverificationtokenquot-is-not-present",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d5aff4a4-1314-49b5-995f-5e45e255d9db>"
},
"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,
40,
62,
63,
140,
141,
311,
312,
346,
347,
444,
445,
446,
520,
521,
528,
569,
696,
704,
726,
751,
759,
784,
811,
819,
827,
828,
829,
933,
934,
945,
972,
1023,
1025,
1043,
1045,
1046,
1047,
1075,
1076,
1183,
1185,
1210,
1228,
1252,
1277,
1303,
1344,
1488,
1495,
1502,
1509,
1516,
1567,
1654,
1817,
1853,
1860,
1886,
1888,
1953,
2078,
2172,
2179,
2181,
2208,
2210,
2274,
2399,
2463,
2470,
2472,
2504,
2580,
2582,
2583,
2584,
2623,
2624,
2669,
2678,
2707,
2721,
2753,
2782,
2824,
2862,
2865,
2911,
2953,
2963,
2972,
2991,
2993,
2996,
3049,
3053,
3067,
3070,
3071,
3072,
3221,
3222,
3273,
3274,
3626,
3627,
3671,
3672,
3679,
3680,
3735,
3736,
3926,
3927,
4052,
4053,
4240,
4241,
4416,
4417,
4502,
4503,
4600,
4601,
4814,
4815,
5132,
5133,
5159,
5160,
5179,
5180,
5456,
5457,
5581,
5582,
5591,
5592
],
"line_end_idx": [
40,
62,
63,
140,
141,
311,
312,
346,
347,
444,
445,
446,
520,
521,
528,
569,
696,
704,
726,
751,
759,
784,
811,
819,
827,
828,
829,
933,
934,
945,
972,
1023,
1025,
1043,
1045,
1046,
1047,
1075,
1076,
1183,
1185,
1210,
1228,
1252,
1277,
1303,
1344,
1488,
1495,
1502,
1509,
1516,
1567,
1654,
1817,
1853,
1860,
1886,
1888,
1953,
2078,
2172,
2179,
2181,
2208,
2210,
2274,
2399,
2463,
2470,
2472,
2504,
2580,
2582,
2583,
2584,
2623,
2624,
2669,
2678,
2707,
2721,
2753,
2782,
2824,
2862,
2865,
2911,
2953,
2963,
2972,
2991,
2993,
2996,
3049,
3053,
3067,
3070,
3071,
3072,
3221,
3222,
3273,
3274,
3626,
3627,
3671,
3672,
3679,
3680,
3735,
3736,
3926,
3927,
4052,
4053,
4240,
4241,
4416,
4417,
4502,
4503,
4600,
4601,
4814,
4815,
5132,
5133,
5159,
5160,
5179,
5180,
5456,
5457,
5581,
5582,
5591,
5592,
5614
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5614,
"ccnet_original_nlines": 138,
"rps_doc_curly_bracket": 0.004987529944628477,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23341326415538788,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019184650853276253,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3373301327228546,
"rps_doc_frac_unique_words": 0.4837799668312073,
"rps_doc_mean_word_length": 5.96614933013916,
"rps_doc_num_sentences": 50,
"rps_doc_symbol_to_word_ratio": 0.0015987199731171131,
"rps_doc_unigram_entropy": 5.334118843078613,
"rps_doc_word_count": 709,
"rps_doc_frac_chars_dupe_10grams": 0.03877069056034088,
"rps_doc_frac_chars_dupe_5grams": 0.11489362269639969,
"rps_doc_frac_chars_dupe_6grams": 0.1078014224767685,
"rps_doc_frac_chars_dupe_7grams": 0.1078014224767685,
"rps_doc_frac_chars_dupe_8grams": 0.1078014224767685,
"rps_doc_frac_chars_dupe_9grams": 0.03877069056034088,
"rps_doc_frac_chars_top_2gram": 0.009929079562425613,
"rps_doc_frac_chars_top_3gram": 0.0156028401106596,
"rps_doc_frac_chars_top_4gram": 0.019858159124851227,
"rps_doc_books_importance": -470.63385009765625,
"rps_doc_books_importance_length_correction": -470.63385009765625,
"rps_doc_openwebtext_importance": -273.5191345214844,
"rps_doc_openwebtext_importance_length_correction": -273.5191345214844,
"rps_doc_wikipedia_importance": -185.1026153564453,
"rps_doc_wikipedia_importance_length_correction": -185.1026153564453
},
"fasttext": {
"dclm": 0.5724032521247864,
"english": 0.6601914167404175,
"fineweb_edu_approx": 1.9716382026672363,
"eai_general_math": 0.48857372999191284,
"eai_open_web_math": 0.23053330183029175,
"eai_web_code": 0.9614413976669312
}
}
|
{
"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": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,235,213,576,600,611,000 |
Braille
From Just Solve the File Format Problem
Jump to: navigation, search
File Format
Name Braille
Ontology
Released 1824
Braille is a tactile code for encoding written language in the form of raised dots in a matrix pattern, used to make written words accessible to the blind. It is named after its creator, Louis Braille, who devised the first version of the system when he was 15 years old after having become blind in a childhood accident.
There are a number of variants of Braille. Only the ones designated as "Grade 1" are true character encodings, with one set of raised dots corresponding to each written character; the "Grade 2" and "Grade 3" systems are more complex, with symbols standing for abbreviated words and other shorthand, making Braille a language in its own right. Its ISO 15924 code (for types of writing scripts) is brai, with the numeric code 570.
There are also a number of variants of Braille for different languages. The original version was designed for French, resulting in some oddities such as the letter "w" not being in its normal position (it is not used in French, so it was originally omitted, then later added on to the end of the alphabet). When versions of Braille were adapted to other languages, including English, there were originally a number of incompatible versions encoding the respective languages' alphabets in the normal order for that language, resulting in different values for the same letter; later, however, more standardization was achieved and the basic 26 letters of the Latin alphabet are in the same position in the major variants, though other characters such as accented letters may vary. There are also versions for non-Latin writing systems, including Chinese and Japanese.
The Nemeth Code is an extension to Braille for advanced mathematical renderings.
The digits are encoded with the same Braille symbols as the first ten letters of the alphabet, leaving it to context to distinguish a letter from a digit. A "number sign" can be prefixed to make this distinction explicit, and this is done in the mathematical-notation variants of Braille.
In Unicode, Braille symbols are found at positions U+2800 through U+28FF.
In TRON code, Braille symbols are found in a part of Zone B of the first plane, and six-dot braille is encoded separately from eight-dot braille; see the article for details.
The BRF format encodes Braille text in the form of an ASCII text file.
Links
Personal tools
Namespaces
Variants
Actions
Navigation
Toolbox
|
{
"url": "http://fileformats.archiveteam.org/wiki/Braille",
"source_domain": "fileformats.archiveteam.org",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "18565",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RW22UZ2QPN74FJTQS2IVWIESTAZABR2D",
"WARC-Concurrent-To": "<urn:uuid:f8d628c3-8465-4b6e-9ba7-d70e9e424ac7>",
"WARC-Date": "2024-05-25T23:51:55Z",
"WARC-IP-Address": "208.86.226.169",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NGAKJ4G7DNVCHHGCGOEBKVR7WGRVABZF",
"WARC-Record-ID": "<urn:uuid:aff040e8-730a-490a-9130-66cd9e303d9d>",
"WARC-Target-URI": "http://fileformats.archiveteam.org/wiki/Braille",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:eeb4cd87-9f3b-447c-9f47-e6d468965c0a>"
},
"warc_info": "isPartOf: CC-MAIN-2024-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-211\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
8,
9,
49,
77,
89,
102,
111,
125,
126,
448,
449,
878,
879,
1745,
1746,
1827,
1828,
2117,
2118,
2192,
2193,
2368,
2369,
2440,
2441,
2447,
2448,
2463,
2474,
2475,
2484,
2492,
2503
],
"line_end_idx": [
8,
9,
49,
77,
89,
102,
111,
125,
126,
448,
449,
878,
879,
1745,
1746,
1827,
1828,
2117,
2118,
2192,
2193,
2368,
2369,
2440,
2441,
2447,
2448,
2463,
2474,
2475,
2484,
2492,
2503,
2510
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2510,
"ccnet_original_nlines": 33,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.39626556634902954,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018672199919819832,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14730289578437805,
"rps_doc_frac_unique_words": 0.483091801404953,
"rps_doc_mean_word_length": 4.884057998657227,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.809779644012451,
"rps_doc_word_count": 414,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.025717109441757202,
"rps_doc_frac_chars_dupe_6grams": 0.025717109441757202,
"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.014836800284683704,
"rps_doc_frac_chars_top_3gram": 0.013353119604289532,
"rps_doc_frac_chars_top_4gram": 0.010880320332944393,
"rps_doc_books_importance": -257.129150390625,
"rps_doc_books_importance_length_correction": -257.129150390625,
"rps_doc_openwebtext_importance": -142.70985412597656,
"rps_doc_openwebtext_importance_length_correction": -142.70985412597656,
"rps_doc_wikipedia_importance": -89.40234375,
"rps_doc_wikipedia_importance_length_correction": -89.40234375
},
"fasttext": {
"dclm": 0.6531984806060791,
"english": 0.9437946677207947,
"fineweb_edu_approx": 3.262716770172119,
"eai_general_math": 0.8040269613265991,
"eai_open_web_math": 0.5050835013389587,
"eai_web_code": 0.2261354923248291
}
}
|
{
"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": "686.22",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Handicraft and Occupations",
"level_3": "Bookbinding and Printing"
}
}
},
"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": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,792,583,427,893,094,000 |
C#监视打印机（接上篇）
版权声明：本文为博主原创文章，遵循 CC 4.0 by-sa 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/xiaogaokun/article/details/82262594
关于上一篇，由于有了基本函数，也有了大神给的几乎直接可以用的源码，视乎问题就解决了。
但是问题远远没有那么简单，在测试x64时候出现了比较棘手的问题。
前文我们用到一些有价值的系统函数
在Win32 上我们用 微软的例子用到WaitForSingleObject(hChange, INFINITE)
我们在C# 。.net4.0平台用一个回调函数来完成
_changeHandle = FindFirstPrinterChangeNotification(_printerHandle,
(int) PRINTER_CHANGES.PRINTER_CHANGE_ADD_JOB, 0,
_notifyOptions);
//_mrEvent.Handle = _changeHandle;
_mrEvent.SafeWaitHandle = new SafeWaitHandle(_changeHandle, false);
//use the waitOne
//like C++ smaple if (WaitForSingleObject(hChange, INFINITE) != 0x00000000L) {
//new Thread(PirnterWaitOne).Start();
//Register for the ThreadPool Use callBack
_waitHandle = ThreadPool.RegisterWaitForSingleObject(_mrEvent, new WaitOrTimerCallback(PrinterNotifyWaitCallback), _mrEvent, -1, true);
FindFirstPrinterChangeNotification触发事件的时候，回调我们的函数：
当那么回调函数呢
private void PrinterNotifyWaitCallback(Object state, bool timedOut)
{
try
{
if (_printerHandle != IntPtr.Zero)
{
#region read notification details
_notifyOptions.Count = 1;
int pdwChange;
IntPtr pNotifyInfo;
var bResult = FindNextPrinterChangeNotification(_changeHandle, out pdwChange, _notifyOptions, out pNotifyInfo);
//If the Printer Change Notification Call did not give data, exit code
if ((bResult == false) || (((int)pNotifyInfo) == 0))
{
}
else
{
if ((pdwChange & PRINTER_CHANGES.PRINTER_CHANGE_PRINTER) > 0 || (pdwChange & PRINTER_CHANGES.PRINTER_CHANGE_PORT) > 0)
{
}
//If the Change Notification was not relgated to job, exit code
bool bJobRelatedChange = ((pdwChange & PRINTER_CHANGES.PRINTER_CHANGE_ADD_JOB) == PRINTER_CHANGES.PRINTER_CHANGE_ADD_JOB) ||
((pdwChange & PRINTER_CHANGES.PRINTER_CHANGE_SET_JOB) == PRINTER_CHANGES.PRINTER_CHANGE_SET_JOB) ||
((pdwChange & PRINTER_CHANGES.PRINTER_CHANGE_DELETE_JOB) == PRINTER_CHANGES.PRINTER_CHANGE_DELETE_JOB) ||
((pdwChange & PRINTER_CHANGES.PRINTER_CHANGE_WRITE_JOB) == PRINTER_CHANGES.PRINTER_CHANGE_WRITE_JOB);
if (bJobRelatedChange)
{
#region populate Notification Information
//PRINTER_NOTIFY_INFOの数据的取得
var info = (PRINTER_NOTIFY_INFO)Marshal.PtrToStructure(pNotifyInfo, typeof(PRINTER_NOTIFY_INFO));
var pData = (int)pNotifyInfo + Marshal.SizeOf(typeof(PRINTER_NOTIFY_INFO));
var data = new PRINTER_NOTIFY_INFO_DATA[info.Count];
for (uint i = 0; i < info.Count; i++)
{
data[i] = (PRINTER_NOTIFY_INFO_DATA)Marshal.PtrToStructure((IntPtr)pData, typeof(PRINTER_NOTIFY_INFO_DATA));
pData += Marshal.SizeOf(typeof(PRINTER_NOTIFY_INFO_DATA));
}
#endregion
var intJobID = -1;
try
{
#region iterate through all elements in the data array
for (var i = 0; i < data.Count(); i++)
{
if ((data[i].Field == (ushort)PRINTERJOBNOTIFICATIONTYPES.JOB_NOTIFY_FIELD_STATUS) &&
(data[i].Type == (ushort)PRINTERNOTIFICATIONTYPES.JOB_NOTIFY_TYPE)
)
{
//var jStatus = (JOBSTATUS)Enum.Parse(typeof(JOBSTATUS), data[i].NotifyData.Data.cbBuf.ToString(CultureInfo.InvariantCulture));
intJobID = (int)data[i].Id;
}
}
#endregion
}
catch (Exception e)
{
intJobID = -1;
}
}
回调函数中FindNextPrinterChangeNotification中取得PRINTER_NOTIFY_INFO
再在它内部结构体数组PRINTER_NOTIFY_INFO_DATA中获得当前打印的JobId,然后我们用JobId来做进一步的数据取得。
问题出现了，当在x64系统上，PRINTER_NOTIFY_INFO_DATA 中
[StructLayout(LayoutKind.Sequential)]
public struct PRINTER_NOTIFY_INFO_DATA
{
public ushort Type;
public ushort Field;
public uint Reserved;
public uint Id;
public PRINTER_NOTIFY_INFO_DATA_UNION NotifyData;
}
Type, Field,Rsevered,Id通通为零，数据错误。
第一个反应一定是x64编译器和x86编译中内存对齐有问题啊，不能共用一套结构体。
然后去查了好多C++，C# 内存对齐机制的变量匹配，发现PRINTER_NOTIFY_INFO_DATA在64中确实比32中要大
但是经过分析，和看别人论坛的讨论，觉得没问题，这几份内存对齐代码代码最初由这个团队
http://lifeandtimesofadeveloper.blogspot.com/2007/10/unmanaged-structures-padding-and-c-part.html
http://lifeandtimesofadeveloper.blogspot.com/2007/10/unmanaged-structures-padding-and-c-part_18.html
这两篇文章，是2007新西兰Ben做的一个博客，因该经过测试，并且完美解决的。经过x86 x64 系统的兼容性测试。
（这两篇文章纯英文，并且不翻墙上不去，不知道为啥。。。。等我转发）
然后代码查阅
var info = (PRINTER_NOTIFY_INFO)Marshal.PtrToStructure(pNotifyInfo, typeof(PRINTER_NOTIFY_INFO));
var pData = (int)pNotifyInfo + Marshal.SizeOf(typeof(PRINTER_NOTIFY_INFO));
var data = new PRINTER_NOTIFY_INFO_DATA[info.Count];
这时候源代码为了找到PRINTER_NOTIFY_INFO_DATA[] 其实位置，提前用Marshal.SizeOf(typeof(PRINTER_NOTIFY_INFO))
提前把指针偏移到unit Count 之后
[StructLayout(LayoutKind.Sequential)]
public struct PRINTER_NOTIFY_INFO
{
public uint Version;
public uint Flags;
public uint Count;
}
后来发现这并不是微软推荐的，微软有更好的结构体内指针移动函数，Marshal.OffsetOf
It doesn't work correctly for 64-bit configuration because of Data Alignment.
找到一个解决问题的方案
https://stackoverflow.com/questions/12792508/how-to-correctly-define-print-notify-info-data
You saved my life, thanx a million.
看到这句话我知道基本好用了，恢复结构体
[StructLayout(LayoutKind.Sequential)]
public struct PRINTER_NOTIFY_INFO
{
public uint Version;
public uint Flags;
public uint Count;
[MarshalAs(UnmanagedType.ByValArray, SizeConst = 1)]
public PRINTER_NOTIFY_INFO_DATA[] aData;
}
var info = (PRINTER_NOTIFY_INFO)Marshal.PtrToStructure(pNotifyInfo, typeof(PRINTER_NOTIFY_INFO));
//var pData = (int)pNotifyInfo + Marshal.SizeOf(typeof(PRINTER_NOTIFY_INFO));
long pData = (long)pNotifyInfo + (long)Marshal.OffsetOf(typeof(PRINTER_NOTIFY_INFO), "aData");
这样经过测试，好用了，微软的x86,x64到底之间出现了什么内存对齐指令，还是很好奇
因为之前我在PRINTER_NOTIFY_INFO前添加一个uint 也是好用的，说明内存对齐，x64还是有自己内存对齐算法。
以后希望能继续学习和深入了解，如果有大神指点，也是很感谢。
展开阅读全文
没有更多推荐了，返回首页
|
{
"url": "https://blog.csdn.net/xiaogaokun/article/details/82262594",
"source_domain": "blog.csdn.net",
"snapshot_id": "crawl=CC-MAIN-2019-35",
"warc_metadata": {
"Content-Length": "110113",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XYJ4GK62FWIU3WZ3UK3VGSLW2SVX2VLF",
"WARC-Concurrent-To": "<urn:uuid:828331c1-3ec6-4203-b314-873c443976ae>",
"WARC-Date": "2019-08-19T23:09:48Z",
"WARC-IP-Address": "39.96.126.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VPKOQLO5JZJ2F6Y47VDO4XFCTRI4LOIK",
"WARC-Record-ID": "<urn:uuid:759c63e4-9957-4b12-8d78-51708d2856ed>",
"WARC-Target-URI": "https://blog.csdn.net/xiaogaokun/article/details/82262594",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2eb9c2c9-1b46-4223-abdc-60577ba54f37>"
},
"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-188.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,
13,
14,
67,
130,
131,
174,
175,
208,
209,
226,
227,
286,
287,
314,
315,
383,
499,
583,
634,
718,
719,
753,
848,
902,
903,
962,
1114,
1115,
1166,
1167,
1176,
1177,
1253,
1263,
1279,
1293,
1344,
1362,
1416,
1462,
1497,
1537,
1669,
1760,
1833,
1855,
1856,
1878,
1903,
1925,
2068,
2094,
2095,
2121,
2122,
2210,
2359,
2508,
2663,
2814,
2815,
2862,
2888,
2958,
3014,
3140,
3244,
3325,
3391,
3421,
3562,
3653,
3683,
3722,
3723,
3770,
3802,
3832,
3919,
3990,
4024,
4025,
4147,
4255,
4297,
4335,
4503,
4571,
4609,
4643,
4686,
4716,
4764,
4794,
4841,
4871,
4873,
4874,
4935,
4936,
5006,
5007,
5049,
5050,
5089,
5132,
5138,
5166,
5195,
5225,
5249,
5307,
5313,
5314,
5348,
5349,
5390,
5391,
5456,
5457,
5499,
5500,
5599,
5600,
5702,
5703,
5762,
5763,
5797,
5798,
5805,
5806,
5904,
5980,
6033,
6061,
6062,
6151,
6152,
6174,
6175,
6216,
6254,
6260,
6289,
6316,
6343,
6349,
6350,
6399,
6400,
6478,
6479,
6491,
6492,
6584,
6585,
6622,
6623,
6643,
6644,
6685,
6723,
6729,
6758,
6785,
6812,
6873,
6922,
6928,
7026,
7104,
7199,
7200,
7243,
7244,
7308,
7309,
7339,
7340,
7342,
7343,
7350,
7351
],
"line_end_idx": [
13,
14,
67,
130,
131,
174,
175,
208,
209,
226,
227,
286,
287,
314,
315,
383,
499,
583,
634,
718,
719,
753,
848,
902,
903,
962,
1114,
1115,
1166,
1167,
1176,
1177,
1253,
1263,
1279,
1293,
1344,
1362,
1416,
1462,
1497,
1537,
1669,
1760,
1833,
1855,
1856,
1878,
1903,
1925,
2068,
2094,
2095,
2121,
2122,
2210,
2359,
2508,
2663,
2814,
2815,
2862,
2888,
2958,
3014,
3140,
3244,
3325,
3391,
3421,
3562,
3653,
3683,
3722,
3723,
3770,
3802,
3832,
3919,
3990,
4024,
4025,
4147,
4255,
4297,
4335,
4503,
4571,
4609,
4643,
4686,
4716,
4764,
4794,
4841,
4871,
4873,
4874,
4935,
4936,
5006,
5007,
5049,
5050,
5089,
5132,
5138,
5166,
5195,
5225,
5249,
5307,
5313,
5314,
5348,
5349,
5390,
5391,
5456,
5457,
5499,
5500,
5599,
5600,
5702,
5703,
5762,
5763,
5797,
5798,
5805,
5806,
5904,
5980,
6033,
6061,
6062,
6151,
6152,
6174,
6175,
6216,
6254,
6260,
6289,
6316,
6343,
6349,
6350,
6399,
6400,
6478,
6479,
6491,
6492,
6584,
6585,
6622,
6623,
6643,
6644,
6685,
6723,
6729,
6758,
6785,
6812,
6873,
6922,
6928,
7026,
7104,
7199,
7200,
7243,
7244,
7308,
7309,
7339,
7340,
7342,
7343,
7350,
7351,
7363
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7363,
"ccnet_original_nlines": 184,
"rps_doc_curly_bracket": 0.0036669799592345953,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.06468172371387482,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06262834370136261,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5379877090454102,
"rps_doc_frac_unique_words": 0.5914633870124817,
"rps_doc_mean_word_length": 13.009146690368652,
"rps_doc_num_sentences": 64,
"rps_doc_symbol_to_word_ratio": 0.008213549852371216,
"rps_doc_unigram_entropy": 4.958766937255859,
"rps_doc_word_count": 328,
"rps_doc_frac_chars_dupe_10grams": 0.13358330726623535,
"rps_doc_frac_chars_dupe_5grams": 0.16569018363952637,
"rps_doc_frac_chars_dupe_6grams": 0.16569018363952637,
"rps_doc_frac_chars_dupe_7grams": 0.16569018363952637,
"rps_doc_frac_chars_dupe_8grams": 0.16569018363952637,
"rps_doc_frac_chars_dupe_9grams": 0.13358330726623535,
"rps_doc_frac_chars_top_2gram": 0.018748540431261063,
"rps_doc_frac_chars_top_3gram": 0.03937191888689995,
"rps_doc_frac_chars_top_4gram": 0.055542539805173874,
"rps_doc_books_importance": -458.3049621582031,
"rps_doc_books_importance_length_correction": -458.3049621582031,
"rps_doc_openwebtext_importance": -203.26406860351562,
"rps_doc_openwebtext_importance_length_correction": -203.26406860351562,
"rps_doc_wikipedia_importance": -118.98474884033203,
"rps_doc_wikipedia_importance_length_correction": -118.98474884033203
},
"fasttext": {
"dclm": 0.7797223925590515,
"english": 0.16204383969306946,
"fineweb_edu_approx": 2.942949056625366,
"eai_general_math": 0.13711076974868774,
"eai_open_web_math": 0.010163189843297005,
"eai_web_code": 0.7559530735015869
}
}
|
{
"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": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,507,600,155,336,248,300 |
How ToLaptops
How to Build a Laptop
how to build a laptop
When it comes to laptops, you can either buy a pre-configured laptop or build a custom one. Pre-configured laptops come with specifications that are meant to appeal to a large segment of the market. They are manufactured in bulk and are the ones you’ll see on most store shelves. You can buy these quickly and start using them immediately.
Custom-built laptops are a different story. Can you build a laptop yourself though? Yes and no.
Some manufacturers like Lenovo have a “Build Your Own” option on their websites, which starts with you choosing a model and an OS and then moving on to picking out the parts. In this case, you don’t assemble the laptop yourself. The manufacturer can assemble it for you in a few weeks at most.
If you decide instead to build a laptop from scratch yourself, the process can be difficult but not impossible. You can gather the parts yourself and get to work, using the laptop kit you’ve hence created for yourself. There are laptop kits available in the market too, such as the Pi-Top Raspberry Pi DIY Laptop Kit, and these can make your job much easier.
Why Would You Want A Custom Laptop?
If you find you always end up replacing the pre-loaded programs in pre-built laptops and upgrading parts after the initial purchase, then you might end up saving money on a custom laptop. If your use is going to be more specialized than generic (such as, say, you want to build a gaming laptop because mainstream gaming laptops are too expensive), then again, try building your own laptop.
Selecting Your Key Players
Let’s talk about building your own laptop kit if you’ve decided to collect the key components of your dream laptop yourself rather than opt for a pre-designed kit. Here are the things you need to be most careful about and why.
The “Bones”
The barebones laptop is also called a laptop case, and it refers to the “shell” that is going to hold all your hardware. Most shells come pre-fitted with a motherboard, which will determine the kind of memory and CPU you can use.
So apart from the motherboard, look into the screen size of your shell as well as what the keyboard is like since these things can’t be changed later. It can be difficult to find a laptop shell for sale on its own. Companies like MSI still offer them, but if you’re going with a specific brand’s custom laptop then you won’t have this problem.
Processor
You will need to choose a processor category (and then an individual processor) based on your usage. Low power processors such as Intel Atom are good enough for casual users, and they offer better battery life. These are usually already soldered onto motherboards.
Value processors like Intel Pentium are similar in that they are good for basic tasks, but they work better with low-end systems. Mainstream processors are the most versatile and offer the most bang-for-your-buck, like Intel i5. If you really want to up your game, (or gaming, if that’s the laptop you want to build) go for a performance processor like Intel i7.
Memory
The overall strength of your RAM (or simply memory) will determine how good your laptop is at multitasking. This strength depends on both size and speed. 8GB is the minimum size you should be going for, although 16GB provides a good fit for power users. Extremes like 32GB are also available.
While you can configure RAM size, speed is not as conveniently adjusted (even with options like overclocking). Memory speed varies with RAM types (such as DDR3 vs DDR4) and the extent to which you can overclock.
Storage
The strength of your storage is also very important since this is where all your data is kept and depends on type, interface, and size of your internal storage. There can be two types here; SSD and HDD. Both have their pros and cons, but hard drives are a bit more dated and SSDs are faster.
The most popular storage interface right now is SATA 2.5”. It even comes in M2/PCIe style now. Storage size will depend on the kind of your storage you’re using. SSDs usually range from 128GB up to 1TB while hard drives can offer 4TB or even more.
Graphics Card
A good graphics card can make a very noticeable difference in performance. There are three types of graphics cards widely available. Integrated graphics cards are built into the CPU, such as the Intel HD-series, and are perfect for everyday use and even some low-key gaming.
If your gaming is going to be more intense, go for a mobile graphics card such as the RTX 2060/70/80 Max-Q. This is quite expensive though, and a more budget-friendly option is the GTX 1660 Ti, but it does come with some performance loss.
Professional graphics cards are like gaming cards with a few tweaks. They’re meant to be used for tasks such as 3D imaging and heavy video editing. This category is so expensive though that you shouldn’t look into it unless you absolutely need to.
Display
You’re going to spend so much time looking at your laptop’s display, and the kind of display you have will determine how much you enjoy working on your laptop. Display size and resolution are both important.
You can pick a display from 10” to 17”, but choose wisely because this will impact overall laptop size. We recommend going for a 15” inch screen to maximize both performance and portability. Whether you go higher or lower will depend completely on your needs.
The number of pixels on a screen determine screen resolution. Some manufacturers, like Apple, market resolution as ‘retina’, but don’t let this jargon confuse you. Most mainstream laptops use 4K resolution, which is equivalent to Apple’s retina (MacBook Pro actually has a lover resolution than 4K).
Other things that can affect your experience in the way that display does include additional laptop features like fingerprint readers and network cards. Some pre-built laptops have these things; some do not, but since you’re building your own anyway, why not go all-in?
How to Build Your Own Laptop
Once you’ve decided on all the details, it’s time to assemble your masterpiece. We’ve broken it down as simply as possible, but remember that you can always get professional help if you find yourself stuck.
• Other than your components, make sure to have your tools at hand. You’ll need delicate ones like needle-nose pliers and magnetic screwdrivers. Remember to wear an anti-static wristband while working so you don’t ruin any parts with static. Grip tape is helpful where pressure needs to be applied without damaging components.
• Before you start working, come up with a way to keep track of everything so you don’t lose time later (and end up getting too frustrated to work). This is especially important given all the small screws you’ll be dealing with.
• Start by removing each panel from your shell one by one, starting at the bottom. This is where all the parts go.
• Starting with the hard drive, mount it onto the bracket in its panel and secure with screws.
• After removing the motherboard panel, insert your memory into its respective slot. You will feel it click into place (if it doesn’t, try the other direction)
• One corner of the CPU will be missing pins; this is what you need to align with the notch in its respective panel. Once inserted, lock it into position.
• Now insert the cooling fan, making sure that it has some thermal paste applied to the bottom. You will need to line it up with the exhaust and/or dust filters in your shell (shells can have different designs) and angle the heatsink into the correct position.
• When inserting components like the CPU and hard drive, be very careful about not bending the pins. Take your time.
• Once everything is in place, you can attach the power cable to the motherboard and screw all the panels back into place (you’ll thank yourself for keeping track of all the screws now).
• Insert the battery and start up the laptop. First things first, run a memory test to see that your RAM is working. You can use the BIOS.
• Once everything looks good, you can install your operating system and voila! You’re done.
To Conclude: Is It Worth The Effort?
The short answer is: probably not. To be frank, a lot could go wrong if you’ve never done something like this before. If you’re happy with what a pre-built laptop can offer you (which is enough for most people), then probably don’t do this.
Drawbacks are, however, relative. If you really need a custom laptop and you’re a techie with some experience assembling machinery (and you’re also feeling adventurous), then go ahead and sink your teeth in!
About author
A finance major with a passion for all things tech, Uneeb loves to write about everything from hardware to games (his favorite genre being FPS). When not writing, he can be seen in his natural habitat reading, studying investments, or watching Formula 1.
Related posts
Computing
Are Power Cuts and Surges Dangerous for The PC? And How To Protect Your PC
How ToSoftware
How to Remove Bloatware
How ToStorage
How to Format Your External Hard Drive
How ToSoftware
How to Transfer Photos from Android to Computer
Leave a Reply
Your email address will not be published. Required fields are marked *
|
{
"url": "https://www.thetechlounge.com/how-to-build-a-laptop/",
"source_domain": "www.thetechlounge.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "86381",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6CYRKTMYOJ6PJGADNWZVE6SB3JSRMJK7",
"WARC-Concurrent-To": "<urn:uuid:d9512f97-cbc7-46aa-8d0b-4ca7cc3f2b4e>",
"WARC-Date": "2021-10-23T10:31:52Z",
"WARC-IP-Address": "35.209.215.106",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3PQGGSIK3WBCUTSADDOJM6BKTIGNI5EG",
"WARC-Record-ID": "<urn:uuid:a864ec6e-1caf-4b4b-870e-63972be8c9f9>",
"WARC-Target-URI": "https://www.thetechlounge.com/how-to-build-a-laptop/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e36e195d-8e74-4157-8ed3-c8f0bcd95142>"
},
"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,
14,
15,
37,
38,
60,
61,
62,
402,
403,
499,
500,
794,
795,
1154,
1155,
1191,
1192,
1582,
1583,
1610,
1611,
1838,
1839,
1851,
1852,
2082,
2083,
2427,
2428,
2438,
2439,
2704,
2705,
3068,
3069,
3076,
3077,
3370,
3371,
3583,
3584,
3592,
3593,
3885,
3886,
4134,
4135,
4149,
4150,
4425,
4426,
4665,
4666,
4914,
4915,
4923,
4924,
5132,
5133,
5393,
5394,
5694,
5695,
5965,
5966,
5995,
5996,
6203,
6204,
6533,
6764,
6881,
6978,
7140,
7297,
7560,
7679,
7868,
8009,
8103,
8104,
8141,
8142,
8383,
8384,
8592,
8593,
8606,
8607,
8862,
8876,
8886,
8887,
8962,
8963,
8978,
8979,
9003,
9004,
9018,
9019,
9058,
9059,
9074,
9075,
9123,
9124,
9138,
9139
],
"line_end_idx": [
14,
15,
37,
38,
60,
61,
62,
402,
403,
499,
500,
794,
795,
1154,
1155,
1191,
1192,
1582,
1583,
1610,
1611,
1838,
1839,
1851,
1852,
2082,
2083,
2427,
2428,
2438,
2439,
2704,
2705,
3068,
3069,
3076,
3077,
3370,
3371,
3583,
3584,
3592,
3593,
3885,
3886,
4134,
4135,
4149,
4150,
4425,
4426,
4665,
4666,
4914,
4915,
4923,
4924,
5132,
5133,
5393,
5394,
5694,
5695,
5965,
5966,
5995,
5996,
6203,
6204,
6533,
6764,
6881,
6978,
7140,
7297,
7560,
7679,
7868,
8009,
8103,
8104,
8141,
8142,
8383,
8384,
8592,
8593,
8606,
8607,
8862,
8876,
8886,
8887,
8962,
8963,
8978,
8979,
9003,
9004,
9018,
9019,
9058,
9059,
9074,
9075,
9123,
9124,
9138,
9139,
9209
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9209,
"ccnet_original_nlines": 109,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4514944851398468,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01940220035612583,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1421080231666565,
"rps_doc_frac_unique_words": 0.36545681953430176,
"rps_doc_mean_word_length": 4.583229064941406,
"rps_doc_num_sentences": 96,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.622957229614258,
"rps_doc_word_count": 1598,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.008738390170037746,
"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.009011469781398773,
"rps_doc_frac_chars_top_3gram": 0.004369200207293034,
"rps_doc_frac_chars_top_4gram": 0.005734569858759642,
"rps_doc_books_importance": -897.1015625,
"rps_doc_books_importance_length_correction": -897.1015625,
"rps_doc_openwebtext_importance": -502.711669921875,
"rps_doc_openwebtext_importance_length_correction": -502.711669921875,
"rps_doc_wikipedia_importance": -343.75286865234375,
"rps_doc_wikipedia_importance_length_correction": -343.75286865234375
},
"fasttext": {
"dclm": 0.1036713719367981,
"english": 0.9451668858528137,
"fineweb_edu_approx": 1.8655900955200195,
"eai_general_math": 0.03890020027756691,
"eai_open_web_math": 0.16040784120559692,
"eai_web_code": 0.038750771433115005
}
}
|
{
"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": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,011,364,787,652,315,000 |
Skip to main content
Code42 Support
Code42 API Authentication Methods
Applies to:
• CrashPlan PRO
• CrashPlan PROe
Overview
Every request to the Code42 API must be authenticated. This article describes the available Code42 API authentication methods and provides examples of their use.
The examples in this article use curl, but the concepts apply to other tools that can be used to interact with the Code42 API.
Comparison of Code42 API authentication methods
The Code42 API offers the following authentication methods:
• Basic: You provide your username and password to authenticate each API request.
• Token: You obtain a temporary authentication token that is good for 30 minutes and use it to authenticate API requests.
The following table describes the advantages and disadvantages of each authentication method:
Authentication Method Advantages Disadvantages
Basic Simple to use Passwords may be saved in the history of your tool
Token
• Better performance
• Better security (tokens expire in 30 minutes)
More complex to use
Using basic authentication
To use basic authentication, include your username and password in the API request.
curl -X GET -u "username:password" https://master-server.example.com:4285/api/Computer
Interactive authentication
If you do not want your password to appear in your command history, you can omit the password from the initial API request and enter your password when prompted.
Using token authentication
You can use a token to authenticate API requests instead of a username and password. Token authentication offers better performance than basic authentication, and does not require entering your password each time. Tokens expire in 30 minutes.
Step 1: Get the token
1. Use basic authentication to get the token by sending a POST to the authToken resource:
curl -X POST -u "username:password" https://master-server.example.com:4285/api/authToken | python -m json.tool
2. In the output of the API request, locate the two authentication tokens in the data element:
{
"data": [
"05oteh6q894290b6vucyuk5tl7",
"1c6r5o1nbb6y60h4t1axft06pn"
],
"metadata": {
"params": {},
"timestamp": "2015-03-30T16:50:02.115-05:00"
}
}
Step 2: Use the token to authenticate subsequent API requests
Make an API request that uses the token by including --header "Authorization: token <token1>-<token2>" in the request:
curl -X GET --header "Authorization: token 05oteh6q894290b6vucyuk5tl7-1c6r5o1nbb6y60h4t1axft06pn" https://master-server.example.com:4285/api/Computer
|
{
"url": "https://support.code42.com/Administrator/3/Monitoring_And_Managing/Introduction_To_The_Code42_API/Code42_API_Authentication_Methods",
"source_domain": "support.code42.com",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "60346",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RULBWOPFJO5NKB3TRQHG5IKEU4AGMG2L",
"WARC-Concurrent-To": "<urn:uuid:bc74f4e2-f7c9-4d3a-a689-1ab59a83d750>",
"WARC-Date": "2017-05-29T02:12:41Z",
"WARC-IP-Address": "184.72.253.83",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3CXZBMBMBSA4DTMQKA3RRSOSNB2UURNI",
"WARC-Record-ID": "<urn:uuid:01f2c31d-d4c4-4565-87da-54ec3a6b67cd>",
"WARC-Target-URI": "https://support.code42.com/Administrator/3/Monitoring_And_Managing/Introduction_To_The_Code42_API/Code42_API_Authentication_Methods",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f1a0bc0c-d4f6-4438-88dd-17879463a99c>"
},
"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,
21,
36,
37,
71,
72,
84,
102,
121,
122,
131,
132,
294,
295,
422,
423,
471,
472,
532,
533,
617,
741,
742,
836,
837,
884,
955,
961,
984,
1034,
1054,
1055,
1082,
1083,
1167,
1168,
1255,
1282,
1444,
1445,
1472,
1473,
1716,
1717,
1739,
1740,
1832,
1947,
1952,
2049,
2055,
2073,
2115,
2156,
2167,
2189,
2215,
2272,
2282,
2288,
2293,
2298,
2299,
2361,
2362,
2481,
2482
],
"line_end_idx": [
21,
36,
37,
71,
72,
84,
102,
121,
122,
131,
132,
294,
295,
422,
423,
471,
472,
532,
533,
617,
741,
742,
836,
837,
884,
955,
961,
984,
1034,
1054,
1055,
1082,
1083,
1167,
1168,
1255,
1282,
1444,
1445,
1472,
1473,
1716,
1717,
1739,
1740,
1832,
1947,
1952,
2049,
2055,
2073,
2115,
2156,
2167,
2189,
2215,
2272,
2282,
2288,
2293,
2298,
2299,
2361,
2362,
2481,
2482,
2631
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2631,
"ccnet_original_nlines": 66,
"rps_doc_curly_bracket": 0.002280500018969178,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2693110704421997,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04801670089364052,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2630480229854584,
"rps_doc_frac_unique_words": 0.40816327929496765,
"rps_doc_mean_word_length": 5.877551078796387,
"rps_doc_num_sentences": 21,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.4642109870910645,
"rps_doc_word_count": 343,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.02281746082007885,
"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.02678571082651615,
"rps_doc_frac_chars_top_3gram": 0.0342261902987957,
"rps_doc_frac_chars_top_4gram": 0.0446428582072258,
"rps_doc_books_importance": -208.01014709472656,
"rps_doc_books_importance_length_correction": -208.01014709472656,
"rps_doc_openwebtext_importance": -104.0290756225586,
"rps_doc_openwebtext_importance_length_correction": -104.0290756225586,
"rps_doc_wikipedia_importance": -104.44014739990234,
"rps_doc_wikipedia_importance_length_correction": -104.44014739990234
},
"fasttext": {
"dclm": 0.09256172180175781,
"english": 0.7475702166557312,
"fineweb_edu_approx": 2.6243717670440674,
"eai_general_math": 0.042849719524383545,
"eai_open_web_math": 0.06920629739761353,
"eai_web_code": 0.6381054520606995
}
}
|
{
"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": "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,513,808,262,813,636,000 |
Old
Inside an ensure Post-Condition block, the old operator can be used to refer to the original value a parameter, Field or Property had at the beginning of the method. This can be useful for checking the validity of the result compared to the previous state. Note that for heap-based Reference Types (except Strings such as Classes, which receive special handling), the old operator only captures the old reference, but not the old state of the object it contains.
method MyClass.IncrementCount(aBy: Int32);
require
aBy > 0;
begin
fCount := fCount + aBy
ensure
fCount - aBy = old fCount;
end;
See Also
|
{
"url": "https://docs.elementscompiler.com/Oxygene/Expressions/Old/",
"source_domain": "docs.elementscompiler.com",
"snapshot_id": "crawl=CC-MAIN-2020-34",
"warc_metadata": {
"Content-Length": "18898",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VHE25YEFCWXJONGQYLVSECWSILVPQGRL",
"WARC-Concurrent-To": "<urn:uuid:288bcf5f-0093-400e-90c2-7c506d5eaadf>",
"WARC-Date": "2020-08-04T22:13:19Z",
"WARC-IP-Address": "23.21.168.167",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4FQBHYZ7VSLCEEZS6SZ4EOWRUAKV7DS5",
"WARC-Record-ID": "<urn:uuid:bf66d1fb-2839-4d84-8fc2-1768a95545ba>",
"WARC-Target-URI": "https://docs.elementscompiler.com/Oxygene/Expressions/Old/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1416b04e-2473-42b6-a5f3-1f2c4ca3448c>"
},
"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-82.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,
1,
5,
6,
469,
470,
513,
521,
532,
538,
563,
570,
599,
604,
605
],
"line_end_idx": [
1,
5,
6,
469,
470,
513,
521,
532,
538,
563,
570,
599,
604,
605,
613
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 613,
"ccnet_original_nlines": 14,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3709677457809448,
"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.19354839622974396,
"rps_doc_frac_unique_words": 0.6701030731201172,
"rps_doc_mean_word_length": 4.907216548919678,
"rps_doc_num_sentences": 5,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.91852068901062,
"rps_doc_word_count": 97,
"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.05042016878724098,
"rps_doc_frac_chars_top_3gram": 0.05882352963089943,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -41.16480255126953,
"rps_doc_books_importance_length_correction": -54.22092056274414,
"rps_doc_openwebtext_importance": -19.91545295715332,
"rps_doc_openwebtext_importance_length_correction": -32.9715690612793,
"rps_doc_wikipedia_importance": -18.062734603881836,
"rps_doc_wikipedia_importance_length_correction": -31.118850708007812
},
"fasttext": {
"dclm": 0.8745583295822144,
"english": 0.8763797283172607,
"fineweb_edu_approx": 2.5723397731781006,
"eai_general_math": 0.7552317380905151,
"eai_open_web_math": 0.16846054792404175,
"eai_web_code": 0.9953114986419678
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,218,313,791,803,970,600 |
Answers
2014-08-05T20:09:40+05:30
This Is a Certified Answer
×
Certified answers contain reliable, trustworthy information vouched for by a hand-picked team of experts. Brainly has millions of high quality answers, all of them carefully moderated by our most trusted community members, but certified answers are the finest of the finest.
Sinx + sin2x = 1
2 sin 3x/2 cos x/2 = 1
cos x/2 = 1 / (2 sin 3x/2 )
cos x + cos 2x = 2 cos x/2 cos 3x/2 substitute value of cos x/2 from above
= cos 3x/2 / sin 3x/2 = COT 3x/2
0
put x=(pi/2) in the given equation..
it satisfies the eqn.. thus put x=pi/2 in cosx + cos2x..
There are two solutions to the problem. x = 20.353445 deg and 90 deg. At x=90 deg. cosx+cos2x= -1= cot 3Pi/4 . at x=20.353445 deg, cosx+cos2x=1.695 = cot 30.53 deg . So cot 3x/2 satisfies both solutions.
please give your rating to the answer.
|
{
"url": "https://brainly.in/question/31128",
"source_domain": "brainly.in",
"snapshot_id": "crawl=CC-MAIN-2017-04",
"warc_metadata": {
"Content-Length": "60538",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4FQBNJBKBVZ6CSCHISMJKJCZ53BHNDLM",
"WARC-Concurrent-To": "<urn:uuid:05a657e5-fb8a-4242-9ce2-879f699244bf>",
"WARC-Date": "2017-01-19T07:08:47Z",
"WARC-IP-Address": "104.16.20.135",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:7W7S6NCFKM3CFB2WYCWD4EIVIBL54QG4",
"WARC-Record-ID": "<urn:uuid:24552d91-e78b-49a9-977b-60726ca3eed2>",
"WARC-Target-URI": "https://brainly.in/question/31128",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c9a2254b-ee4c-4b35-ad07-723ce892187b>"
},
"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,
8,
9,
35,
36,
63,
64,
66,
341,
358,
383,
411,
412,
489,
528,
530,
567,
624,
828
],
"line_end_idx": [
8,
9,
35,
36,
63,
64,
66,
341,
358,
383,
411,
412,
489,
528,
530,
567,
624,
828,
866
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 866,
"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.21074379980564117,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008264459669589996,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.43801653385162354,
"rps_doc_frac_unique_words": 0.6013985872268677,
"rps_doc_mean_word_length": 4.356643199920654,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.213251113891602,
"rps_doc_word_count": 143,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03531299903988838,
"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.03210273012518883,
"rps_doc_frac_chars_top_3gram": 0.016051359474658966,
"rps_doc_frac_chars_top_4gram": 0.025682179257273674,
"rps_doc_books_importance": -136.8611297607422,
"rps_doc_books_importance_length_correction": -136.8611297607422,
"rps_doc_openwebtext_importance": -45.48258590698242,
"rps_doc_openwebtext_importance_length_correction": -40.33247375488281,
"rps_doc_wikipedia_importance": -29.293743133544922,
"rps_doc_wikipedia_importance_length_correction": -29.293743133544922
},
"fasttext": {
"dclm": 0.7056878209114075,
"english": 0.7802743911743164,
"fineweb_edu_approx": 1.2472161054611206,
"eai_general_math": 0.9103732109069824,
"eai_open_web_math": 0.913647472858429,
"eai_web_code": 0.07745093107223511
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "516.24",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
},
"secondary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "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
|
6,854,677,605,472,057,000 |
The Urgency of Cybersecurity: Protecting Your Digital Identity from Cyber Threats
In the vast and mesmerizing realm of the internet, where ideas soar free and connections know no bounds, a hidden battle wages on. An unseen army of cyber threats lurks in the shadows, tirelessly scheming and probing for vulnerabilities to exploit. As we dive deeper into the era of digital dependence, the urgency of cybersecurity becomes strikingly clear. Our digital identity, the very essence of who we are in this digital world, lies dangerously exposed to their relentless claws. In this rapidly evolving landscape, it has never been more imperative to fortify our defenses, to shield ourselves from the relentless onslaught of cyber invaders. Join us as we unravel the enigma of cyber threats and uncover the crucial measures necessary to preserve our digital identities – the keys to security in this virtual universe we call home.
Unmasking the Shadows: Safeguarding the Soul of Your Digital Existence
Title: Ensuring Cyber Security: Protecting Your Digital World
Introduction:
In today’s interconnected world, where almost every aspect of our lives relies on digital technology, understanding cyber security is of utmost importance. Cyber attacks, ransomware, and blackmailing incidents have become prevalent. They not only affect individuals but also pose threats to national security. Thus, it is crucial to be well-informed about online protection and to have reliable emergency response mechanisms in place. This article aims to provide comprehensive information on all aspects of cyber security while emphasizing how readers can detect attacks and, if needed, seek assistance from Nattytech, LLC, a competent cybersecurity company.
I. The Threat Landscape:
A. Types of Cyber Attacks:
– Discuss common cyber threats, including malware, phishing, and Distributed Denial of Service (DDoS) attacks.
– Explain the potential repercussions of such attacks (e.g., data breaches, financial loss, reputational damage).
B. Ransomware and Blackmailing:
– Define ransomware and its modus operandi.
– Highlight real-life examples of businesses and individuals impacted by ransomware attacks.
– Explain blackmailing techniques, such as sextortion, and the importance of protecting personal information.
II. National Security Concerns:
A. Importance of National Cybersecurity:
– Discuss the significance of protecting critical infrastructure, including governmental networks and defense systems.
- Highlight the potential consequences of cyber attacks on national security, such as economic disruption or compromised intelligence.
B. Cyber Warfare:
– Explain the concept of cyber warfare and its implications for international relations.
– Discuss the role of cybersecurity in countering cyber threats from hostile nations or non-state actors.
III. Online Protection Measures:
A. Creating Strong and Secure Passwords:
– Provide guidelines for creating strong passwords and the importance of avoiding common mistakes (e.g., using personal information).
– Recommend the use of password managers for added convenience and security.
B. Implementing Two-Factor Authentication (2FA):
– Explain the concept and benefits of 2FA in bolstering online security.
– Guide readers on how to enable 2FA for various accounts and devices.
C. Regular Software and System Updates:
– Emphasize the significance of keeping programs, devices, and operating systems up to date to patch vulnerabilities.
- Advise readers on enabling automatic updates and being cautious of fake update prompts.
IV. Detecting Cyber Attacks:
A. Recognizing Indicators of Attack:
– Outline common signs of a potential cyber attack, such as unusual online behavior, unexpected pop-ups, or slow device performance.
– Encourage readers to trust their instincts and look for abnormalities in their digital environment.
B. Seeking Expert Assistance:
– Introduce Nattytech, LLC, as an experienced cybersecurity company specializing in emergency cyber attack response and forensics.
– Provide contact details, such as phone number and website, for readers to reach out for professional assistance.
Conclusion:
Cybersecurity is not merely an individual concern but a collective responsibility to ensure national security and protect against malicious actors. By staying educated about cyber threats, implementing proper security measures, and seeking assistance from reliable companies like Nattytech, LLC, we can maintain a safer digital environment for everyone. Always remember that vigilance and proactive protection are our best defense against cyber attacks.
Q&A
Q: Why is cybersecurity an urgent matter in today’s digital age?
A: In a world heavily dependent on technology, cybersecurity plays a crucial role in safeguarding our digital identities from the ever-evolving cyber threats that lurk around every virtual corner. The urgency arises from the potential consequences of not prioritizing cybersecurity – data breaches, identity theft, financial losses, and even reputational damage.
Q: How can we protect our digital identity from cyber threats?
A: Understanding cyber threats is the first step towards protection. Implementing strong passwords and regularly updating them, using two-factor authentication, and being cautious of suspicious emails and phishing attempts are essential practices. Additionally, employing reputable security software, keeping all software up to date, and avoiding public Wi-Fi networks can significantly enhance our digital defenses.
Q: What are the potential consequences of neglecting cybersecurity?
A: Neglecting cybersecurity exposes one’s digital identity to various risks. Data breaches can lead to the compromise of personal information, leaving individuals vulnerable to identity theft and financial fraud. Cybercriminals can use this information to access bank accounts, commit fraud, or even sell it on the dark web. Furthermore, reputational damage is a potential consequence, as individuals, businesses, or organizations may lose trust and credibility in the eyes of customers and partners.
Q: How can individuals keep up with the constant evolution of cyber threats?
A: Staying informed and educated about emerging cyber threats is crucial for individuals. Regularly following reliable cybersecurity news sources, attending workshops or webinars, and educating oneself about safe online practices can help individuals adapt and stay ahead of cybercriminals. Additionally, cultivating a mindset of vigilance and being attentive to potential risks while using digital platforms can go a long way in protecting oneself.
Q: What steps can businesses take to prioritize cybersecurity?
A: Businesses should establish a dedicated cybersecurity team, responsible for identifying potential vulnerabilities, implementing robust security measures, and continuously monitoring for any suspicious activities. Regular employee training on cybersecurity best practices is essential, as the majority of cyber threats exploit human errors. Additionally, conducting routine audits, penetration testing, and implementing strong firewall and encryption protocols can enhance the overall security posture of a business.
Q: How can we encourage individuals and businesses to take cybersecurity seriously?
A: Raising awareness about the potential consequences of cyber threats, both personally and financially, is crucial. By highlighting real-life examples of cyber attacks and their aftermath, it becomes evident that investing time, effort, and resources into cybersecurity is a far more prudent choice than dealing with the ramifications of a breach. Regulatory compliance and addressing legal implications can also motivate individuals and businesses to take cybersecurity seriously.
Q: Are there any emerging technologies that can aid in cybersecurity efforts?
A: Indeed, emerging technologies offer promising prospects in the realm of cybersecurity. Artificial Intelligence (AI) and Machine Learning (ML) algorithms are being utilized to detect and respond to cyber threats in real-time. Blockchain technology has the potential to revolutionize data security by ensuring immutability and decentralization. Additionally, advancements in biometrics and multi-factor authentication systems provide enhanced security layers for valuable digital identities.
In a digital world that thrives on connectivity and convenience, the urgency of cybersecurity cannot be overstated. As cyber threats continue to evolve and infiltrate every aspect of our lives, protecting our digital identity becomes an imperative. From hackers to cybercriminals, the dangers are omnipresent, lurking in the shadows of the vast online realm.
But fear not, for with knowledge comes power, and by understanding the gravity of these threats, we can arm ourselves with the necessary tools to safeguard our digital personas. It is a battle fought on the invisible front lines, where vigilance and proactivity reign supreme. So let us embark on a journey, exploring the realms of cybersecurity, and discover the art of protecting our digital identities.
Just as a castle needs a sturdy fortress, our digital presence requires a formidable defense. We delve into the world of secure passwords, strong enough to withstand even the most cunning attacks. We learn to wield the shield of multi-factor authentication, an impenetrable barrier safeguarding our private information. And as we navigate the vast sea of unsolicited emails, we uncover the secrets to identifying phishing attempts, the treacherous bait used to reel in unsuspecting victims.
Furthermore, we explore the importance of regularly updating our software and operating systems, fortifying the weak spots that cybercriminals so eagerly exploit. We demystify the dark realm of malware, understanding how these malicious codes infiltrate our devices and compromise our cherished virtual existence.
But it’s not just about individual responsibility; the urgency of cybersecurity extends to our collective digital community. We shed light on the necessity of creating a culture of cyber hygiene, where education and awareness becomes the sword we wield against these digital marauders. Together, we can build a safer, more resilient online environment, one where privacy and security thrive hand in hand.
As we conclude our voyage through the intricate labyrinth of cyber threats, we are armed with the knowledge necessary to protect our digital identities from the ever-encroaching dangers of the virtual world. With a blend of caution, mindfulness, and technological expertise, we can fortify the walls of our digital castle, ensuring that our virtual existence remains out of reach from those who seek to exploit it.
So, fellow digital adventurers, let us embrace the urgency of cybersecurity with unwavering determination. By doing so, we unleash the power within us to navigate the treacherous waters that lie ahead, carving a path towards a safer, more secure future for all who call the digital realm their home.
Comments are closed.
|
{
"url": "https://nattytech.com/the-urgency-of-cybersecurity-protecting-your-digital-identity-from-cyber-threats/",
"source_domain": "nattytech.com",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "145944",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4D4PQWHQDO3P3WNXH7MNX2FLH5ZX77OI",
"WARC-Concurrent-To": "<urn:uuid:e03308a1-5b49-4077-bb10-c25d562899d6>",
"WARC-Date": "2023-12-03T11:05:14Z",
"WARC-IP-Address": "154.41.250.18",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GAL54Q3ZJZTIXUZKLSAG6X6FAIZ3KO27",
"WARC-Record-ID": "<urn:uuid:dfae5fd1-da42-4b84-8797-d5c9a4cbbb39>",
"WARC-Target-URI": "https://nattytech.com/the-urgency-of-cybersecurity-protecting-your-digital-identity-from-cyber-threats/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5b436260-29b0-4e68-b131-ce96506f0f4e>"
},
"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-40\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,
82,
83,
940,
941,
1014,
1015,
1078,
1079,
1093,
1772,
1773,
1798,
1825,
1937,
2053,
2054,
2086,
2130,
2225,
2337,
2338,
2372,
2414,
2535,
2674,
2675,
2694,
2784,
2893,
2894,
2928,
2969,
3105,
3184,
3185,
3234,
3308,
3379,
3380,
3422,
3542,
3635,
3636,
3666,
3704,
3840,
3945,
3946,
3976,
4109,
4226,
4227,
4239,
4707,
4708,
4712,
4713,
4780,
5149,
5150,
5214,
5639,
5640,
5709,
6215,
6216,
6296,
6759,
6760,
6824,
7360,
7361,
7446,
7936,
7937,
8016,
8517,
8518,
8888,
8889,
9304,
9305,
9811,
9812,
10134,
10135,
10548,
10549,
10971,
10972,
11283,
11284
],
"line_end_idx": [
82,
83,
940,
941,
1014,
1015,
1078,
1079,
1093,
1772,
1773,
1798,
1825,
1937,
2053,
2054,
2086,
2130,
2225,
2337,
2338,
2372,
2414,
2535,
2674,
2675,
2694,
2784,
2893,
2894,
2928,
2969,
3105,
3184,
3185,
3234,
3308,
3379,
3380,
3422,
3542,
3635,
3636,
3666,
3704,
3840,
3945,
3946,
3976,
4109,
4226,
4227,
4239,
4707,
4708,
4712,
4713,
4780,
5149,
5150,
5214,
5639,
5640,
5709,
6215,
6216,
6296,
6759,
6760,
6824,
7360,
7361,
7446,
7936,
7937,
8016,
8517,
8518,
8888,
8889,
9304,
9305,
9811,
9812,
10134,
10135,
10548,
10549,
10971,
10972,
11283,
11284,
11304
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 11304,
"ccnet_original_nlines": 92,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2868735194206238,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01766110025346279,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24057279527187347,
"rps_doc_frac_unique_words": 0.4865034520626068,
"rps_doc_mean_word_length": 5.910232067108154,
"rps_doc_num_sentences": 99,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.968446731567383,
"rps_doc_word_count": 1593,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.00573553005233407,
"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.015294739976525307,
"rps_doc_frac_chars_top_3gram": 0.008497079834342003,
"rps_doc_frac_chars_top_4gram": 0.00796600989997387,
"rps_doc_books_importance": -954.8394165039062,
"rps_doc_books_importance_length_correction": -954.8394165039062,
"rps_doc_openwebtext_importance": -567.4046630859375,
"rps_doc_openwebtext_importance_length_correction": -567.4046630859375,
"rps_doc_wikipedia_importance": -333.4220275878906,
"rps_doc_wikipedia_importance_length_correction": -333.4220275878906
},
"fasttext": {
"dclm": 0.8478163480758667,
"english": 0.8636133670806885,
"fineweb_edu_approx": 2.898761749267578,
"eai_general_math": 0.01914238929748535,
"eai_open_web_math": 0.080691397190094,
"eai_web_code": 0.17599117755889893
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.8",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "363.3",
"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": "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": "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
|
4,447,766,947,888,683,000 |
apply_filters ( 'jetpack_photon_pre_args', array $args, string $image_url, string $scheme )
Filter the original Photon image parameters before Photon is applied to an image.
Source file: functions.photon.php
View in GitHub
Parameters
$args
(array) Array of Photon arguments.
$image_url
(string) Image URL.
$scheme
(string) Image scheme. Default to null.
Changelog
Since: Jetpack 1.9.0
Notes
You can use this filter to change the Photon parameters used for images on your site, like so:
function jeherve_custom_photon( $args ) {
$args['quality'] = 80;
$args['strip'] = 'all';
$args['filter'] = 'grayscale';
return $args;
}
add_filter( 'jetpack_photon_pre_args', 'jeherve_custom_photon' );
Have a note to contribute?
Fill in your details below or click an icon to log in:
WordPress.com Logo
You are commenting using your WordPress.com account. Log Out / Change )
Google+ photo
You are commenting using your Google+ account. Log Out / Change )
Twitter picture
You are commenting using your Twitter account. Log Out / Change )
Facebook photo
You are commenting using your Facebook account. Log Out / Change )
w
Connecting to %s
Comments
1. wolfincage says:
How would we use it for only images inside a post?
2. khurramar says:
Just added this script in my plugin and it works great. However it also converted the URLs in “a” tag. For example an image wrapped into an anchor “a” tag for opening full size version of the image. In result, when a query string is added at the end of the image link, the lightbox stopped working.
Can we restrict this to apply to only tags and not other tags?
|
{
"url": "https://developer.jetpack.com/hooks/jetpack_photon_pre_args/",
"source_domain": "developer.jetpack.com",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "56065",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BFRY6EFVMHVRQATDQVNEUSWNJS3GYLQS",
"WARC-Concurrent-To": "<urn:uuid:7250942e-b1eb-4550-879c-bcefdb29ab07>",
"WARC-Date": "2018-06-25T07:34:52Z",
"WARC-IP-Address": "192.0.78.12",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:36KLIQKY6AR7LAMCCE527LTROBT6FFOM",
"WARC-Record-ID": "<urn:uuid:80ebb487-a22d-4d68-af90-a3bcb0f5de7b>",
"WARC-Target-URI": "https://developer.jetpack.com/hooks/jetpack_photon_pre_args/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ef978b31-5c3b-4330-95ee-e71654c35399>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-91-167-62.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,
92,
93,
175,
176,
210,
211,
226,
227,
238,
239,
245,
246,
281,
282,
293,
294,
314,
315,
323,
324,
364,
365,
366,
376,
377,
398,
399,
400,
406,
407,
502,
503,
545,
572,
602,
638,
656,
658,
724,
725,
752,
753,
808,
809,
828,
829,
902,
903,
917,
918,
985,
986,
1002,
1003,
1070,
1071,
1086,
1087,
1155,
1156,
1158,
1159,
1176,
1177,
1186,
1187,
1209,
1210,
1265,
1266,
1287,
1288,
1591,
1592
],
"line_end_idx": [
92,
93,
175,
176,
210,
211,
226,
227,
238,
239,
245,
246,
281,
282,
293,
294,
314,
315,
323,
324,
364,
365,
366,
376,
377,
398,
399,
400,
406,
407,
502,
503,
545,
572,
602,
638,
656,
658,
724,
725,
752,
753,
808,
809,
828,
829,
902,
903,
917,
918,
985,
986,
1002,
1003,
1070,
1071,
1086,
1087,
1155,
1156,
1158,
1159,
1176,
1177,
1186,
1187,
1209,
1210,
1265,
1266,
1287,
1288,
1591,
1592,
1658
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1658,
"ccnet_original_nlines": 74,
"rps_doc_curly_bracket": 0.0012062699533998966,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.25872093439102173,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0029069799929857254,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.29651162028312683,
"rps_doc_frac_unique_words": 0.552301287651062,
"rps_doc_mean_word_length": 5.07112979888916,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.641075134277344,
"rps_doc_word_count": 239,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09075908362865448,
"rps_doc_frac_chars_dupe_6grams": 0.049504950642585754,
"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.019801979884505272,
"rps_doc_frac_chars_top_3gram": 0.052805278450250626,
"rps_doc_frac_chars_top_4gram": 0.06930693238973618,
"rps_doc_books_importance": -166.94808959960938,
"rps_doc_books_importance_length_correction": -153.49404907226562,
"rps_doc_openwebtext_importance": -103.48145294189453,
"rps_doc_openwebtext_importance_length_correction": -103.48145294189453,
"rps_doc_wikipedia_importance": -68.65582275390625,
"rps_doc_wikipedia_importance_length_correction": -56.831947326660156
},
"fasttext": {
"dclm": 0.10384184122085571,
"english": 0.611508846282959,
"fineweb_edu_approx": 2.3747572898864746,
"eai_general_math": -0.000010009999641624745,
"eai_open_web_math": 0.043654680252075195,
"eai_web_code": -0.000010009999641624745
}
}
|
{
"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": "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,697,056,420,986,798,600 |
Go Down
Topic: Windows or Linux (Read 3870 times) previous topic - next topic
MathMcC
Hi
I'm just about to get my hands dirty oomlout's Arduino Starter Kit. Does anyone have an opinion about whether its easier/more advisable to use Windows or Linux for the task (specifically Windows 7 and Ubuntu)?
Thanks.
PaulS
Quote
Does anyone have an opinion about whether its easier/more advisable to use Windows or Linux for the task (specifically Windows 7 and Ubuntu)?
My advice, and worth every penny you paid for it, is to use the one you like.
There are more issues getting the IDE to compile and link and talk to the Arduino on Linux, primarily due to permissions issues.
There are issues with Win7 installs (primarily 64 bit, IIRC) and getting drivers installed.
Neither set of issues is insurmountable, depending on you level of patience and familiarity with the OS that is causing the problems.
Of course, lots of people on all OSs have installed and used the software with no issues at all.
GordonEndersby
You shouldnt have any problem with the latest ubuntu.
So far following the instructions Ive never had any problems setting the ide up and no problems uploading to the board. No mucking about with ftdi drivers, or downloading and installing the gcc toolchain. Its all available to install directly from the synaptic package manager or follow the apt-get instructions.
Some people have had problems with permissions, but it takes moments to change that if you already have not got the correct permissions.
Gordon
Osgeld
windowx XP is pretty much unzip and go, as noted above there are issues with newer versions of windows but anyone that has ever fought a driver should be able to clear that up, there are a billion threads on how to do so
linux is a little bit different of a beast as you need to install dependencies manually for your distro, ubuntu (and other debian variants) is fairly easy, couldnt tell you much bout other systems
otherwise it makes no difference cause once you launch the application its the same
http://arduino.cc/forum/index.php?action=unread;boards=2,3,4,5,67,6,7,8,9,10,11,66,12,13,15,14,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,86,87,89,1;ALL
codeseo
Windows is better for starters.
Imahilus
From experience, linux is far easier (literally, as mentioned, unzip.. and start it up, no need to install drivers or whatnots).
On all windows boxes I tried to get arduino to work (vista and XP), I had no success.
The vista machine just kept on whining the way we expect it to, XP just didn't appear to take the USB to serial driver, later on it did accept it.. but it just wasn't as simple as unzip and run like it was on ubuntu.
Please do realise I only tried to get it working on 3 systems (ie: one ubuntu 9.10, one windows vista and one windows XP), so it isn't a large test group.
zoomkat
I use xp on an old laptop and the arduino IDE application works easily without any significant issues.
Google forum search: Use Google Search box in upper right side of this page.
Why I like my 2005 Rio Yellow Honda S2000 https://www.youtube.com/watch?v=pWjMvrkUqX0
AlphaZeta
Personally, I use Linux. Since Linux is opensource, it fits in the opensource spirit of Arduino quite well :) Besides, there's really nothing much to setup. It's pretty much just download and unzip...
MathMcC
I think you're right Alphazeta. It does seem somehow right to be using the Arduino in Linux. And in any case, I've found that Win7 hasn't found the drivers automatically and doesnt even find them when I point it at the right folder in the Arduino IDE. I did the same in Win XP and the drivers were installed no problem... Not sure what to do.
Osgeld
i dunno, I have a spare machine which is under my work table, it just has whatever was on it
for example, I was messing with some pic stuff, so for the longest time it was winxp
then I needed to do some magic on a mac hard drive, now its linux
but now I want to mess with the launch pad some more and its pretty much windows, probally just slap another hard drive in there and dual boot it lol
http://arduino.cc/forum/index.php?action=unread;boards=2,3,4,5,67,6,7,8,9,10,11,66,12,13,15,14,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,86,87,89,1;ALL
fdufnews
I tried both windows XP and ubuntu.
I has no issue with both.
Concerning Linux you should follow the installation informations on arduino.cc and check you have the sun java runtime
tjbaudio
I use Linux for this application. I have been using Linux for years so it is just less work for me to use it.
I can see no difference between OS once you get every thing working. If you know Linux use it. If you want to learn Linux use it. If you don't know Linux and don't want to learn it use what you know.
copiertalk
The easiest for you to use.
We do not know your skill level with either system so I would recomend to start with the one you know the best and work up from there with a working example and code.
donkahones
I got it working fine on my Ubuntu laptop. I did have to do some additional steps but they were clearly defined on the arduino page so it was no problem.
Eight
Quote
I've found that Win7 hasn't found the drivers automatically and doesnt even find them when I point it at the right folder in the Arduino IDE
I had no significant problems getting everything up and running on Windows 7 32-bit. I hear there are bigger issues with 64-bit though not sure what they are.
In my case, I popped open the Device Manager and found three (if memory serves) unaccounted for USB devices and for each one, told Windows to use the drivers from the downloaded IDE/driver pack. After that everything has worked perfectly.
Go Up
Please enter a valid email to subscribe
Confirm your email address
We need to confirm your email address.
To complete the subscription, please click the link in the email we just sent you.
Thank you for subscribing!
Arduino
via Egeo 16
Torino, 10131
Italy
|
{
"url": "http://forum.arduino.cc/index.php?topic=5530.msg42549",
"source_domain": "forum.arduino.cc",
"snapshot_id": "crawl=CC-MAIN-2016-22",
"warc_metadata": {
"Content-Length": "75067",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HB76YGOW2QS5NTGOHYGD47AZSFMSK57M",
"WARC-Concurrent-To": "<urn:uuid:93118131-ce7c-498e-8dfa-dfc7ec91fbfe>",
"WARC-Date": "2016-05-28T02:18:25Z",
"WARC-IP-Address": "54.83.53.28",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:B74DD47EOYDBO7WOEAZXL5J6IQPG42OA",
"WARC-Record-ID": "<urn:uuid:38effde3-011d-49fc-8d81-6c273d781d04>",
"WARC-Target-URI": "http://forum.arduino.cc/index.php?topic=5530.msg42549",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e1638338-3422-492e-9e79-4808370ba4e8>"
},
"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,
8,
9,
79,
80,
88,
89,
92,
93,
303,
304,
312,
313,
319,
320,
326,
468,
469,
547,
548,
677,
678,
770,
771,
905,
906,
1003,
1004,
1019,
1020,
1021,
1022,
1076,
1389,
1526,
1527,
1534,
1535,
1542,
1543,
1764,
1765,
1962,
1963,
2047,
2202,
2203,
2211,
2212,
2244,
2245,
2254,
2255,
2384,
2470,
2687,
2688,
2843,
2844,
2852,
2853,
2956,
3033,
3120,
3121,
3131,
3132,
3333,
3334,
3342,
3343,
3686,
3687,
3694,
3695,
3788,
3789,
3874,
3875,
3941,
3942,
4092,
4247,
4248,
4257,
4258,
4294,
4320,
4439,
4440,
4449,
4450,
4561,
4562,
4765,
4766,
4777,
4778,
4806,
4807,
4974,
4975,
4986,
4987,
5144,
5145,
5151,
5152,
5158,
5299,
5300,
5459,
5460,
5699,
5700,
5706,
5708,
5709,
5710,
5750,
5751,
5778,
5779,
5818,
5901,
5902,
5929,
5930,
5938,
5950,
5964
],
"line_end_idx": [
8,
9,
79,
80,
88,
89,
92,
93,
303,
304,
312,
313,
319,
320,
326,
468,
469,
547,
548,
677,
678,
770,
771,
905,
906,
1003,
1004,
1019,
1020,
1021,
1022,
1076,
1389,
1526,
1527,
1534,
1535,
1542,
1543,
1764,
1765,
1962,
1963,
2047,
2202,
2203,
2211,
2212,
2244,
2245,
2254,
2255,
2384,
2470,
2687,
2688,
2843,
2844,
2852,
2853,
2956,
3033,
3120,
3121,
3131,
3132,
3333,
3334,
3342,
3343,
3686,
3687,
3694,
3695,
3788,
3789,
3874,
3875,
3941,
3942,
4092,
4247,
4248,
4257,
4258,
4294,
4320,
4439,
4440,
4449,
4450,
4561,
4562,
4765,
4766,
4777,
4778,
4806,
4807,
4974,
4975,
4986,
4987,
5144,
5145,
5151,
5152,
5158,
5299,
5300,
5459,
5460,
5699,
5700,
5706,
5708,
5709,
5710,
5750,
5751,
5778,
5779,
5818,
5901,
5902,
5929,
5930,
5938,
5950,
5964,
5969
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5969,
"ccnet_original_nlines": 130,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4090571701526642,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03489235043525696,
"rps_doc_frac_lines_end_with_ellipsis": 0.007633590139448643,
"rps_doc_frac_no_alph_words": 0.22420193254947662,
"rps_doc_frac_unique_words": 0.39723318815231323,
"rps_doc_mean_word_length": 4.595849990844727,
"rps_doc_num_sentences": 62,
"rps_doc_symbol_to_word_ratio": 0.0014847799902781844,
"rps_doc_unigram_entropy": 5.372861862182617,
"rps_doc_word_count": 1012,
"rps_doc_frac_chars_dupe_10grams": 0.0984734520316124,
"rps_doc_frac_chars_dupe_5grams": 0.10492367297410965,
"rps_doc_frac_chars_dupe_6grams": 0.0984734520316124,
"rps_doc_frac_chars_dupe_7grams": 0.0984734520316124,
"rps_doc_frac_chars_dupe_8grams": 0.0984734520316124,
"rps_doc_frac_chars_dupe_9grams": 0.0984734520316124,
"rps_doc_frac_chars_top_2gram": 0.006450229790061712,
"rps_doc_frac_chars_top_3gram": 0.00903031975030899,
"rps_doc_frac_chars_top_4gram": 0.006880240049213171,
"rps_doc_books_importance": -641.8046875,
"rps_doc_books_importance_length_correction": -641.8046875,
"rps_doc_openwebtext_importance": -344.3794860839844,
"rps_doc_openwebtext_importance_length_correction": -344.3794860839844,
"rps_doc_wikipedia_importance": -339.9775390625,
"rps_doc_wikipedia_importance_length_correction": -339.9775390625
},
"fasttext": {
"dclm": 0.07013773918151855,
"english": 0.94294273853302,
"fineweb_edu_approx": 1.3344480991363525,
"eai_general_math": 0.3615161180496216,
"eai_open_web_math": 0.17985540628433228,
"eai_web_code": 0.3603283762931824
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,102,305,360,977,469,000 |
Hoed: Lightweight algorithmic debugging.
[ bsd3, debug, library, trace ] [ Propose Tags ]
Hoed is a tracer and debugger for the programming language Haskell. You can trace a program by annotating functions in suspected modules and linking your program against standard profiling libraries.
To locate a defect with Hoed you annotate suspected functions and compile as usual. Then you run your program, information about the annotated functions is collected. Finally you connect to a debugging session using a webbrowser.
Hoed comes in two flavours: Hoed.Pure and Hoed.Stk. Hoed.Pure is recommended over Hoed.Stk: to debug your program with Hoed.Pure you can optimize your program and do not need to enable profiling. Hoed.Stk is Hoed as presented on PLDI 2015 and possibly has benefits over Hoed.Pure for debugging concurrent/parallel programs.
[Skip to Readme]
Versions [faq] 0.1.0.0, 0.1.0.1, 0.2.0, 0.2.1, 0.2.2, 0.3.0, 0.3.1, 0.3.2, 0.3.3, 0.3.4, 0.3.5, 0.3.6, 0.4.0, 0.4.1, 0.5.0, 0.5.1
Change log changelog
Dependencies array, base (==4.*), containers, deepseq, directory, extensible-exceptions, filepath, FPretty, Hoed, lazysmallcheck, libgraph (==1.7), mtl, network, process, random, RBTree (==0.0.5), regex-posix, template-haskell, threepenny-gui (==0.6.*), unix, utf8-string, X11 (>=1.5 && <1.7) [details]
License BSD-3-Clause
Copyright (c) 2000 Andy Gill, (c) 2010 University of Kansas, (c) 2013-2015 Maarten Faddegon
Author Maarten Faddegon
Maintainer [email protected]
Category Debug, Trace
Home page http://maartenfaddegon.nl
Source repo head: git clone git://github.com/MaartenFaddegon/Hoed.git
Uploaded by faddegon at Fri Nov 20 08:44:50 UTC 2015
Distributions LTSHaskell:0.5.1, NixOS:0.5.1, Stackage:0.5.1
Executables hoed-tests-Stk-IndirectRecursion, hoed-tests-Stk-Example4, hoed-tests-Stk-Example3, hoed-tests-Stk-Example1, hoed-tests-Stk-Insort2, hoed-tests-Stk-DoublingServer, hoed-tests-Pure-t7, hoed-tests-Pure-t6, hoed-tests-Pure-t5, hoed-tests-Pure-t4, hoed-tests-Pure-t3, hoed-tests-Pure-t2, hoed-tests-Pure-t1, hoed-tests-Generic-t3, hoed-tests-Generic-r3, hoed-tests-Generic-t2, hoed-tests-Generic-r2, hoed-tests-Generic-t1, hoed-tests-Generic-r1, hoed-tests-Generic-t0, hoed-tests-Generic-r0, hoed-tests-Prop-t4, hoed-tests-Prop-t3, hoed-tests-Prop-t2, hoed-tests-Prop-t1, hoed-tests-Prop-t0, hoed-examples-Expression_simplifier__with_properties, hoed-examples-Expression_simplifier, hoed-examples-Parity_test, hoed-examples-Simple_higher-order_function, hoed-examples-SummerSchool_compiler_does_not_terminate, hoed-examples-XMonad_changing_focus_duplicates_windows__using_properties, hoed-examples-XMonad_changing_focus_duplicates_windows__CC, hoed-examples-XMonad_changing_focus_duplicates_windows, hoed-examples-Insertion_Sort_elements_disappear, hoed-examples-FPretty_indents_too_much__CC, hoed-examples-FPretty_indents_too_much
Downloads 5195 total (418 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
• λ
• λ
• λ
Status Hackage Matrix CI
Docs not available [build log]
Last success reported on 2015-12-08 [all 5 reports]
Modules
• Debug
• Hoed
• Debug.Hoed.Pure
• Debug.Hoed.Stk
Flags
NameDescriptionDefaultType
buildexamples
Build example executables.
DisabledAutomatic
validatepure
Build test cases to validate Hoed-pure.
DisabledAutomatic
validatestk
Build test cases to validate Hoed-stk.
DisabledAutomatic
validategeneric
Build test cases to validate deriving Observable for Generic types.
DisabledAutomatic
validateprop
Build test cases to validate deriving judgements with properties.
DisabledAutomatic
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
Downloads
Maintainer's Corner
For package maintainers and hackage trustees
Readme for Hoed-0.3.1
[back to package description]
Hoed - A Lightweight Haskell Tracer and Debugger Build Status
Hoed is a tracer and debugger for the programming language Haskell.
Using Hoed
To locate a defect with Hoed you annotate suspected functions and compile as usual. Then you run your program, information about the annotated functions is collected. Finally you connect to a debugging session using a webbrowser.
Let us consider the following program, a defective implementation of a parity function with a test property.
isOdd :: Int -> Bool
isOdd n = isEven (plusOne n)
isEven :: Int -> Bool
isEven n = mod2 n == 0
plusOne :: Int -> Int
plusOne n = n + 1
mod2 :: Int -> Int
mod2 n = div n 2
prop_isOdd :: Int -> Bool
prop_isOdd x = isOdd (2*x+1)
main :: IO ()
main = printO (prop_isOdd 1)
main :: IO ()
main = quickcheck prop_isOdd
Using the property-based test tool QuickCheck we find the counter example 1 for our property.
./MyProgram
*** Failed! Falsifiable (after 1 test): 1
Hoed can help us determine which function is defective. We annotate the functions isOdd, isEven, plusOne and mod2 as follows:
import Debug.Hoed.Pure
isOdd :: Int -> Bool
isOdd = observe "isOdd" isOdd'
isOdd' n = isEven (plusOne n)
isEven :: Int -> Bool
isEven = observe "isEven" isEven'
isEven' n = mod2 n == 0
plusOne :: Int -> Int
plusOne = observe "plusOne" plusOne'
plusOne' n = n + 1
mod2 :: Int -> Int
mod2 = observe "mod2" mod2'
mod2' n = div n 2
prop_isOdd :: Int -> Bool
prop_isOdd x = isOdd (2*x+1)
main :: IO ()
main = printO (prop_isOdd 1)
After running the program a computation tree is constructed and displayed in a web browser.
./MyProgram
False
Listening on http://127.0.0.1:10000/
You can freely browse this tree to get a better understanding of your program. If your program misbehaves, you can judge the computation statements in the tree as 'right' or 'wrong' according to your intention. When enough statements are judged the debugger tells you the location of the fault in your code.
Screenshot of Hoed
Installation
Hoed is available from Hackage and can be installed with Cabal.
cabal install Hoed
Other Tracers
Many of the ideas for Hoed come from the Hat project. Hoed is the Dutch word for a hat. Compared to Hoed, Hat can give more detailed traces. However, Hat requires all modules to be transformed and is therefore not practical for many real-world Haskell programs.
The idea to observe values with local annotations comes from the HOOD project. Unlike Hoed, HOOD does not give relations between observed values. HOOD also requires the programmer to write a class-instance for the type of the value they want to observe. With Hoed these instates can be derived automatically.
|
{
"url": "http://hackage.haskell.org/package/Hoed-0.3.1",
"source_domain": "hackage.haskell.org",
"snapshot_id": "crawl=CC-MAIN-2019-13",
"warc_metadata": {
"Content-Length": "23966",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:URT66D36LUCINUMJ2DSKGGC7GDEJOSYU",
"WARC-Concurrent-To": "<urn:uuid:3b1569ae-e012-4c77-9c21-6e1fd4c2a417>",
"WARC-Date": "2019-03-21T21:10:25Z",
"WARC-IP-Address": "151.101.248.68",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PBCOIAXNQ6ST4FRU7B43ITCCDXYUTWS6",
"WARC-Record-ID": "<urn:uuid:61c3acbc-f694-468c-a4d5-3dc7f82a70aa>",
"WARC-Target-URI": "http://hackage.haskell.org/package/Hoed-0.3.1",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ea52d733-0b43-43f0-a31f-3ea022fc1986>"
},
"warc_info": "isPartOf: CC-MAIN-2019-13\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-150-237-245.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,
41,
42,
91,
92,
292,
293,
523,
524,
848,
849,
850,
867,
997,
1018,
1321,
1342,
1434,
1458,
1493,
1515,
1551,
1621,
1674,
1734,
2874,
2921,
2977,
2989,
2995,
3001,
3007,
3032,
3063,
3115,
3116,
3124,
3125,
3135,
3146,
3170,
3193,
3194,
3200,
3201,
3228,
3242,
3243,
3270,
3271,
3289,
3302,
3303,
3343,
3344,
3362,
3374,
3375,
3414,
3415,
3433,
3449,
3450,
3518,
3519,
3537,
3550,
3551,
3617,
3618,
3636,
3637,
3715,
3716,
3726,
3727,
3747,
3748,
3793,
3794,
3795,
3817,
3818,
3848,
3849,
3911,
3912,
3980,
3981,
3992,
3993,
4223,
4224,
4333,
4334,
4355,
4384,
4385,
4407,
4430,
4431,
4453,
4471,
4472,
4491,
4508,
4509,
4535,
4564,
4565,
4579,
4608,
4609,
4623,
4652,
4653,
4747,
4748,
4760,
4802,
4803,
4929,
4930,
4953,
4954,
4975,
5006,
5036,
5037,
5059,
5093,
5117,
5118,
5140,
5177,
5196,
5197,
5216,
5244,
5262,
5263,
5289,
5318,
5319,
5333,
5362,
5363,
5455,
5456,
5468,
5474,
5511,
5512,
5820,
5821,
5840,
5841,
5854,
5855,
5919,
5920,
5939,
5940,
5954,
5955,
6217,
6218
],
"line_end_idx": [
41,
42,
91,
92,
292,
293,
523,
524,
848,
849,
850,
867,
997,
1018,
1321,
1342,
1434,
1458,
1493,
1515,
1551,
1621,
1674,
1734,
2874,
2921,
2977,
2989,
2995,
3001,
3007,
3032,
3063,
3115,
3116,
3124,
3125,
3135,
3146,
3170,
3193,
3194,
3200,
3201,
3228,
3242,
3243,
3270,
3271,
3289,
3302,
3303,
3343,
3344,
3362,
3374,
3375,
3414,
3415,
3433,
3449,
3450,
3518,
3519,
3537,
3550,
3551,
3617,
3618,
3636,
3637,
3715,
3716,
3726,
3727,
3747,
3748,
3793,
3794,
3795,
3817,
3818,
3848,
3849,
3911,
3912,
3980,
3981,
3992,
3993,
4223,
4224,
4333,
4334,
4355,
4384,
4385,
4407,
4430,
4431,
4453,
4471,
4472,
4491,
4508,
4509,
4535,
4564,
4565,
4579,
4608,
4609,
4623,
4652,
4653,
4747,
4748,
4760,
4802,
4803,
4929,
4930,
4953,
4954,
4975,
5006,
5036,
5037,
5059,
5093,
5117,
5118,
5140,
5177,
5196,
5197,
5216,
5244,
5262,
5263,
5289,
5318,
5319,
5333,
5362,
5363,
5455,
5456,
5468,
5474,
5511,
5512,
5820,
5821,
5840,
5841,
5854,
5855,
5919,
5920,
5939,
5940,
5954,
5955,
6217,
6218,
6526
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6526,
"ccnet_original_nlines": 166,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1647457629442215,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008135589770972729,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3959321975708008,
"rps_doc_frac_unique_words": 0.480246901512146,
"rps_doc_mean_word_length": 6.187654495239258,
"rps_doc_num_sentences": 106,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.479982376098633,
"rps_doc_word_count": 810,
"rps_doc_frac_chars_dupe_10grams": 0.12609736621379852,
"rps_doc_frac_chars_dupe_5grams": 0.18335993587970734,
"rps_doc_frac_chars_dupe_6grams": 0.17378291487693787,
"rps_doc_frac_chars_dupe_7grams": 0.16101357340812683,
"rps_doc_frac_chars_dupe_8grams": 0.16101357340812683,
"rps_doc_frac_chars_dupe_9grams": 0.1536312848329544,
"rps_doc_frac_chars_top_2gram": 0.015363129787147045,
"rps_doc_frac_chars_top_3gram": 0.011173180304467678,
"rps_doc_frac_chars_top_4gram": 0.012769349850714207,
"rps_doc_books_importance": -470.9443054199219,
"rps_doc_books_importance_length_correction": -470.9443054199219,
"rps_doc_openwebtext_importance": -252.67776489257812,
"rps_doc_openwebtext_importance_length_correction": -252.67776489257812,
"rps_doc_wikipedia_importance": -134.96632385253906,
"rps_doc_wikipedia_importance_length_correction": -134.96632385253906
},
"fasttext": {
"dclm": 0.05718791112303734,
"english": 0.6459450125694275,
"fineweb_edu_approx": 2.3119990825653076,
"eai_general_math": 0.5901023149490356,
"eai_open_web_math": 0.1524040699005127,
"eai_web_code": 0.1804746389389038
}
}
|
{
"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.136",
"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": "8",
"label": "Documentation"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,789,865,135,031,159,000 |
Pobieranie prezentacji. Proszę czekać
Pobieranie prezentacji. Proszę czekać
Język C# ( 5.0 ) using System; namespace HeWo { class Hello
Коpie: 1
Język C# ( 4.0 ) using System; namespace HeWo { class Hello { static void Main(string [] args) { Console.WriteLine("Hello World!"); }
Podobne prezentacje
Prezentacja na temat: "Język C# ( 5.0 ) using System; namespace HeWo { class Hello"— Zapis prezentacji:
1 Język C# ( 5.0 ) using System; namespace HeWo { class Hello
using System; namespace HeWo { class Hello static void Main(string [] args) Console.WriteLine("Hello World!"); }
2 Typy Danych wartości ( stos , pełne kopiowanie ) logiczne numeryczne
egzemplarze struktur referencje ( sterta , kopiowanie referencji ) obiekty klas tablice ciągi znaków ( string )
3 Type C# CTS CLS Bytes Default
bool Boolean Y false byte Byte Y sbyte SByte N short Int Y int Int Y long Int Y ushort UInt16 N uint UInt32 N ulong UInt64 N float Single Y double Double Y char Char Y decimal Decimal Y
4 Deklaracje i definicje zmiennych Operator przypisania wartości
int Alfa , Beta , Gamma = 5 ; Operator przypisania wartości Beta = Gamma; // OK Beta = 12; // OK Beta = Alfa; // błąd kompilacji Stałe const double Kurs = ;
5 Typy implikowane (3.0) var a = 5; // int var b = 'K'; // char
var c = 128L; // long var d = ; // double var e = "Ala ma kota"; // string a = L; // long -> int e = 4.5; // błąd ● tylko zmienne lokalne w funkcjach - nie mogą być składowymi klas
6 Rzutowanie · automatyczne - rozszerzające ( bez ostrzeżenia )
- zawężające ( błąd kompilacji ) · wymuszone (int) LongValue; int li32 = 5; long li64; li64 = li32; // OK. li32 = li64; // błąd kompilacji li64 = ; li32 = (int) li64; // błędna wartość //
7 Typy rozszerzone ( nullable ) (2.0)
double? Cena; // { numbs, INF, NaN, null } // Cena = 7.54 ; Cena = null ; if ( Cena.HasValue ) Cena += 1.4;
8 · operator ?? int Parametr; int? Pomiar = null; /* */ Parametr = Pomiar ?? 100 ; // 100 gdy null // string str = null; Console.WriteLine( str ?? "Pusty" ); // Pusty gdy null
9 Opakowanie – Rozpakowanie
long aaa = , bbb ; object objLong = aaa ; // stos sterta bbb = (long) objLong ; // sterta stos // InvalidCastException
10 Typ logiczny bool dobrze; int alfa = 5; dobrze = 0; // błąd
dobrze = 3 * alfa + 1; // błąd dobrze = true; // OK dobrze = alfa > 10; // OK
11 Typy wyliczeniowe enum Wyliczanka // int { Eme, // == 0 Due, // == 1
Fake = 10, // == 10 Drake // == 11 } enum Maly : byte // byte { mini , mikro } · dziedziczenie z System.Enum Enum.IsDefined(typeof(Maly) , "nano");
12 Funkcje i właściwości typów
· zmienne typów będących wartościami są egzemplarzami struktur dziedziczą funkcje z typu System.Object.ValueType ─ GetType( ) // obiekt Type określający typ dla typów wyliczeniowych (np. ConsoleColor) : var ListaKolorów = // tablica stałych Enum.GetValues(ConsoleColor.Black.GetType()); ─ ToString( ) // konwersja binarno – znakowa long LoVal = ; string Characters = LoVal.ToString ( );
13 · właściwości typów liczbowych
MaxValue // wartość maksymalna MinValue // wartość minimalna long x = long.MaxValue; int y = int.MinValue;
14 Łańcuchy znaków UNICODE (UTF - 16)
· string typ referencyjny · zawartość łańcucha niezmienna · dziedziczy z typu System.String Length, Concat, CompareTo, Copy, Insert , PadLeft , PadRight , Remove , Replace , ToLower , ToUpper , Format = , + , == , != , [ ] string Nap1 , Nap2 = "dobry napis" ; Nap1 = Nap2 ; // nowa referencja Nap1 = Nap2.ToUpper( ); // nowy łańcuch
15 Przekształcanie wnętrza łańcucha
· znaki sterujące jak w C wyłącza przetwarzanie ) string Opis1 = "\nWyniki\t:" ; string Opis2 = @"\nBez zmian\t:" ; Przekształcanie wnętrza łańcucha · klasa System.Text.StringBuilder using namespace System.Text; StringBuilder myBuffer = new StringBuilder ("Ala ma kota"); myBuffer.Append(„ a Ola psa."); myBuffer.Insert(11, ','); string Ready = myBuffer.ToString(); // Ala ma kota, a Ola psa.
16 Wprowadzanie – wyprowadzanie danych
· klasa System.Console ─ int Read ( ) // 1 znak (NL, -1) ─ string ReadLine ( ) // do NL ─ string Write ( string ) // bez NL ─ string WriteLine ( string ) // z NL // Console.WriteLine( x.ToString() ); Console.WriteLine( x ); // konwersja Console.WriteLine( x.ToString() + ", " + y.ToString() );
17 Console.Write ("format", w,..,w) // bez NL
Console.WriteLine ("format", w,..,w) // z NL format "zzz{0}zzz{1}zzz{0}zzz{2}zzz..." ─ "zzz" dowolny ciąg znaków (może być pusty) ─ {0} {1} {2} ... pozycje kolejnych dalszych argumentów ─ w,...,w ciąg wyrażeń
18 niecałkowite dziesiętne postać heksydecymalna
· można stosować znaki formatujące {K:Zs} lub {K,P:Zs} ─ K numer pozycji ─ Z znak formatujący ─ P szerokość pola ─ s liczba cyfr po kropce znak znaczenie C c waluta (wg. Windows) D d całkowite dziesiętne E e notacja wykładnicza F f niecałkowite dziesiętne z wykładnikiem lub bez G g N n format narodowy X x postać heksydecymalna
19 string str = "\nOpis wyniku :\t" ; Console.WriteLine(
int ii = 34; double dd = ; string str = "\nOpis wyniku :\t" ; Console.WriteLine( "{0} {1} albo {1,12:D} i {2} lub\n " + "{2,-15:F3} lub {2:E5} lub {3} " , str , ii , dd , dd.ToString() ) ; //Opis wyniku : albo i 2, lub // 2, lub 2,52345E+000 lub 2,
20 · konwersja znakowo – binarna (kultura - ustawienia narodowe)
- SystemType.Parse(string) string str; double dd = 2.5; str = Console.ReadLine( ); // 12,45 dd = double.Parse( str ); // błędny format -> błąd wykonania Console.WriteLine( dd ); // 12,45
21 bool dobrze = false; string str; double dd = 2.5; while ( ! dobrze ) { str = Console.ReadLine( ); dobrze = double.TryParse(str, out dd); } Console.WriteLine(dd); // VS.NET 2005
22 - klasa Convert ToByte ToSByte ToChar ToDecimal ToDouble ToSingle ToInt16 ToInt32 ToInt64 ToUInt16 ToUInt32 ToUInt64 ToString string st; long war; str = Console.ReadLine(); // war = Convert.ToInt64(str); // format Console.WriteLine(war); //
23 · kultura (ustawienia narodowe)
- związana z każdym procesem obliczeniowym (wątkiem) - klasa CultureInfo using System.Threading; using System.Globalization; // CultureInfo ci = new CultureInfo("de-DE"); Thread.CurrentThread.CurrentCulture = ci;
24 · przesuwanie kursora // VS.2005 Console.CursorVisible = false; Console.ForegroundColor = ConsoleColor.Red; Console.BackgroundColor = ConsoleColor.White; Console.CursorLeft = X; // od lewej Console.CursorTop = Y; // od góry Console.SetCursorPosition( X, Y ); Console.Write("+"); // o 1 w prawo Console.CursorLeft = X; // powrót Console.Clear();
25 · znaki sterujące ConsoleKeyInfo znak; // znak = Console.ReadKey(); if( ConsoleKey.UpArrow == znak.Key) { } // Backspace, Home, End, Enter, Escape // Arrows, Fxx, klawiatura numeryczna // Play, Volume, ... Console.Beep( 3000, 1000 ); // 3000 Hz, 1000 ms Call, S0, Kultura,Move
26 Wyrażenia arytmetyczne i logiczne
· operatory i zasady tworzenia jak w C++ · dodatkowo is as oraz => · konwersja wartości - rozszerzająca automatycznie - zawężająca błąd int a = 2L; // błąd float f = 2.45; // błąd · rzutowanie ( typ ) wyrażenie
27 · lokalne testowanie poprawności checked
// typy całkowitoliczbowe int a1 = ; a1 = a ; // a1 = checked ( a ); // wyjątek long l1 = ; a1 = l1; // błąd kompilacji a1 = ( int ) l1; // a1 = checked ( ( int ) l1 ); // wyjątek
28 · globalne testowanie poprawności
Properites / Build / Advance Check for arithmetic overflow/underflow · lokalne wyłącznie testowania unchecked int a1 = ; a1 = a ; // wyjątek a1 = unchecked ( a ); +
29 Instrukcje · warunkowe if .. else // jak C++
// warunek wyrażenie logiczne if ((x + 4) > 1 && (y++ < 8)) // || // obliczenie optymalizowane if ((x + 4) > 1 & (y++ < 8)) // | // pełne obliczenie // switch // jak C++ // instrukcja break konieczna
30 · pętle ( ogólnie jak C++ )
for ( int i = 1 ; i < 5 && dalej ; ++i ) { } // koniec widoczności zmiennej i while , do ... while // jak C++ foreach // wymagany IEnumerator
31 Struktury · są zawsze wartościami (na stosie, kopiowanie)
· mogą zawierać interfejsy, funkcje składowe i konstruktory z argumentami · są zawsze zapieczętowane · modyfikatory dostępu do pól modyfikator opis public dostępne zewsząd (domyślny) private tylko wewnątrz struktury / klasy protected dla klas dziedziczących internal tylko w pakiecie protected internal dla klas dziedziczących w pakiecie
32 public struct Osoba { public string Imie; public string Nazwisko; public long Pesel; } Osoba Prezes; Prezes.Imie = "Adam" ; Prezes.Nazwisko = "Betoński" ; Prezes.Pesel = ; Osoba Emeryt ; Emeryt = Prezes ;
33 · pakowanie i rozpakowanie
object Agent = Emeryt; // sterta, brak dostępu do pól long kto = Agent.Pesel; // błąd Osoba X_007 = ( Osoba ) Agent ; // stos, jest dostęp do pól kto = X_007.Pesel; // OK
34 public struct Komputer
{ public string Marka; public short Cena; public Komputer (string mm, short cc) { Marka = mm; Cena = cc; } object PC = new Komputer ( "Alfa", 3000 ); short cc = PC.Cena; // błąd Komputer komp = (Komputer) PC; cc = komp.Cena; // OK
35 Tablice · jednowymiarowe int [ ] Tab_A ; // zmienna referencyjna
Tab_A = new int [ 120 ] ; // // automatyczne zerowanie string [ ] Tab_B = new string [ X + 5 ] ; // automatycznie NULL
36 string [ ] Tab_D = new string [ 3 ] { "Alfa", "Beta", "Gamma" }; double [ ] Tab_C = { 1.2 , 4.5 , 4.4 } ; // Tab_A [ 0 ] = 55 ; Tab_D [ 2 ] = "Jota" ; // System.IndexOutOfRangeException var T = new double[ ]{1.1, 2.2, 3.3}; // tylko jako tablica lokalna w funkcji
37 · wielowymiarowe, pełne
int [ , ] Mat = new int [ 9 , 7 ] ; Mat [ 3 , 5 ] = 121 ; // int [ , ] T23 = { {1, 2, 3}, {4, 5, 6} } ; var T2 = new long [ , ] { { 10, 20, 30 }, { 100, 200, 300 } }; // tylko jako tablica lokalna w funkcji
38 ● wielowymiarowe, niepełne
long [ ] [ ] Arr = new long [ 5 ] [ ] ; // zadana liczba wierszy, // zmienna liczba kolumn w wierszu for ( int i = 0 ; i < Arr.Length ; ++i ) Arr [ i ] = new long [ i + 5 ] ; Arr [ 2 ] [ 3 ] = ;
39 · kopiowanie tablic int[] T = { 1, 3, 5, 7, 9 }; int[] R = new int [10]; R = T; // kopiowanie referencji, R ma 5 elementów T[0] = 99; // zmiana wartości R[0] R = (int[]) T.Clone(); // kopia T T[1] = 88; // R[1] bez zmian int[] S = new int [10]; T.CopyTo( S, 2 ); // kopiowanie elementów T -> S od elementu 2
40 · dziedziczenie z System.Array
właściwości Length Range : [ ] 0 ; [ , ] wie : 0, kol : 1 [ , , ] ma : 0, wie : 1, kol : 2 funkcje BinarySearch , Clear , Clone, CopyTo GetLength, GetLowerBound , GetUpperBound GetValue , SetValue , Reverse , Sort
41 int x = 0; Array A3D = Array.CreateInstance(x.GetType(),12,15,24); // Range = 0, 1, 2 : M, W, K for (int i = A3D.GetLowerBound(0); i <= A3D.GetUpperBound(0); ++i) // M for (int j = A3D.GetLowerBound(1); j <= A3D.GetUpperBound(1); ++j) // W for (int k = A3D.GetLowerBound(2); k <= A3D.GetUpperBound(2); ++k) // K A3D.SetValue((i * j * 10 + k),i,j,k);
42 Console.WriteLine("Multidimensional Array:");
Console.WriteLine("Rank\tLower\tUpper"); for (int i = 0; i < A3D.Rank; ++i) Console.WriteLine("{0}\t{1}\t{2}", i, A3D.GetLowerBound(i), A3D.GetUpperBound(i)); Multidimensional Array: Rank Lower Upper
43 string [ ] Napisy = new string [ 10 ];
/* */ foreach ( string s in Napisy ) { Console.Writeline( s ); } // interfejs IEnumerator jest dostępny S1, MatMul, Taba, Ewide
44 Funkcje · tylko funkcje składowe klas
· niepotrzebne deklaracje ( zapowiedzi ) · modyfikatory argumentów modyfikator opis ( brak ) przez wartość ( kopiowanie ) , argument aktualny musi być zainicjowany out przez referencję, argument aktualny może być niezainicjowany ref przez referencję, argument aktualny musi być zainicjowany params zmienna liczba parametrów
45 public long F ( long p1 , out int p2 ,
ref double p3 ) { ... = ... p1 ... p3 ... ; p2 = ; p3 = ....p1 ... p2 ... ; return .... ; }
46 long wynik , a1 = ; int rezultat ; double zmiana = 21.4E5 ; wynik = F (a1 + 1L, out rezultat , ref zmiana); /* nawet gdyby zmienna rezultat miała nadaną wartość przed wywołaniem F, to i tak w funkcji F nie wolno odczytywać tej wartości przed wewnętrznym ustaleniem wartości p2 */ EwideF
47 · dowolna liczba parametrów – params
public void DoLi (ref int Suma, params int [ ] Liczby) { foreach (int li in Liczby) Suma += li; } // int Wynik = 174; DoLi ( ref Wynik, 3, 5, 22, -7, 12); // 209
48 · wzorce funkcji ( generics )
public void PoLi <TyDa>(params TyDa [ ] Liczby) { foreach (TyDa li in Liczby) Console.WriteLine(li.ToString()); // Suma + li; niepoprawne // jedynie przypisanie = } // PoLi <double> (231.43, 99.89, );
49 public T Mała < T > (T p1, T p2) where T : System
public T Mała < T > (T p1, T p2) where T : System.IComparable< T > { T pom; if ( p1.CompareTo( p2 ) < 0 ) pom = p1; else pom = p2; return pom; } double x; x = Mała <double> (231.43, 99.89);
50 · wartości domyślne i argumenty nazwane ( 4.0 )
public long FU ( long p1 , bool p2 = true , double p3 = 2.7 ) { ... } // long lili; lili = FU ( 127 ); // poprawnie lili = FU ( 127, false ); // poprawnie lili = FU ( 127, false, 3.9 ); // poprawnie lili = FU ( 127, , 3.9 ); // błąd lili = FU ( 127, 3.9 ); // błąd lili = FU ( 127, p3 : 3.9 ) // poprawnie NamedPar, Refa
51 Klasy public class Simple // partial abstract sealed
public class Simple // partial abstract sealed { public int Liczba = 9; public static double Ułamek = 0.21 ; // 0 string Napis ; // private public int Suma ( int Liczba ) { return this.Liczba + Liczba ; } public static double Mar( double Cena ) return Ułamek * Cena ;
52 // przeciążony k. domyślny { Liczba = 5 ;
public Simple ( ) // przeciążony k. domyślny { Liczba = 5 ; } // nie można listy powiązań public Simple ( int Start ) Liczba = Start ; } public Simple ( Simple s ); Liczba = s.Liczba ;
53 Simple s0; // tylko zmienna referencyjna
s0 = new Simple( ); // Liczba == 5 // Simple s1 = new Simple( ) ; // == 5 Simple s2 = new Simple( 9 ) ; // == 9 s2.Liczba += s2.Suma( s1.Liczba ); // == 23 Simple s3 = new Simple( s2 ); // == 23 int m = Simple.Mar( 100 ) ; // == 21 // funkcje i składowe statyczne // wywołuje się podając nazwę klasy
54 · modyfikatory dostępu (dla klas i dla składowych)
opis public dostępne zewsząd private tylko wewnątrz klasy (domyślny dla składowych) protected dla klas dziedziczących internal tylko w pakiecie (domyślny dla klas) protected internal dla klas dziedziczących w pakiecie
55 · klasy wieloplikowe (2.0)
// plik Prog1.cs public partial class Employee { public void DoWork() { } } // plik Prog2.cs public void GoToLunch() { }
56 public partial class A { }
public class A { } // błąd // · ta sama przestrzeń nazw · niekonfliktowe modyfikatory typu klasy ( nie trzeba powtarzać ) public private protected internal abstract sealed · niekonfliktowa klasa bazowa i lista interfejsów WinApp
57 · klasy statyczne : - nie wolno tworzyć obiektu - wszystkie składowe statyczne public static class Services { public static int Data1 = 123; public static void Serv1(int param) { .... } } // int Res1 = ++ Services.Data1 ; Services.Serv1(78);
58 ● inicjowanie obiektów klas (3.0)
public class Alfa { public int al; public long fa; /* public Alfa( int a, long f) al = a; fa = f; } */ } // Alfa aa = new Alfa { al = 7, fa = 14L }; // składowe public Alfa bb = new Alfa { 7, 14L }; // błąd
59 public class Alfa { public int al; public long fa; private char kod; // public Alfa( char kk ) kod = kk + 5; } Alfa aa = new Alfa (0x41){ al = 7, fa = 14L }; // składowe: private public // protected DrawRect
60 ● funkcje rozszerzające (3.0) // Fun(ob) -> ob.Fun()
public static class StringExt // static { public static void Older03 (this System.String pt) { if (pt[0] > pt[3]) Console.WriteLine(pt[0]); else Console.WriteLine(pt[3]); } public static char LetterOfIndex (this System.String st, int x) { if (x < 0 || st.Length <= x) return '?'; else return st[x]; } }
61 string st = "Autobus."; Console.WriteLine(st.Older03()); // przekład: Older03(st) Console.WriteLine("{0}, {1}", st.LetterOfIndex(4), st.LetterOfIndex(12)); // LetterOfIndex(st,4) LetterOfIndex(st, 12) // o // b, ?
62 using LibOne; // biblioteka .dll
// ClassOne, int X public static class LibOneExt { public static void Limit15 (this LibOne.ClassOne c1) if (c1.X > 15) c1.X = 15; } // ClassOne cc = new ClassOne(); cc.X = 27; Console.Write(cc.X.ToString() + ", "); cc.Limit15(); // Limit15(cc); Console.WriteLine(cc.X); //27, 15 Exten
63 Hermetyzacja · składowe prywatne i funkcje dostępu ( jak C++ )
· właściwości public class Account { private decimal amount ; private string number ; public decimal Amount // zapis i odczyt { get { return amount ; } set { if ( Authorization ( ) ) amount = value ; } } // accessors
64 public string Who // tylko odczyt { get { return number ; } }
decimal AC ; string NC ; Account Customer = new Account ( ) ; AC = Customer.Amount ; // get_Amount Customer.Amount = AC ; // set_Amount NC = Customer.Who ; // get_Number Edit encapsulation
65 public class Base1 { private double price; public double Price get { return price; } protected set { price = value; } } // set dostępne w klasie Base1 i w klasach pochodnych
66 ● właściwości automatyczne (3.0)
Auto-Implemented Properties public class Point { /* private int x; private int y; public int X {get { return x; } set { x = value; } } public int Y {get { return y; } set { y = value; } } */ // public int X { get; set; } public int Y { get; set; } // nazwy zmiennym nadaje kompilator }
67 } public class Point { public int X { get; private set; }
public int Y { get; protected set; } } // nazwy zmiennym nadaje kompilator // zmiana X tylko w klasie Point // zmiana Y tylko w klasie Point // i w klasach pochodnych
68 · właściwości statyczne private static string bankname = " PKO " ;
private static string bankname = " PKO " ; public static string BankName ; { get { return bankname ; } set { bankname = value ; } } · składowe tylko do odczytu public readonly decimal Currency ; public static readonly string AccType = "A1"; // nadawanie wartości tylko w deklaracji lub // w konstruktorze klasy
69 public int X { get; set; } public int Y { get; set; } } //
Typy anonimowe (3.0) public class Point { public int X { get; set; } public int Y { get; set; } } // var TTT = new {T1 = new Point { X = 4, Y = 4 }, T2 = new Point { X = 7, Y = 7 }, T3 = new Point { X = 2, Y = 2 } }; // klasa lokalna opisująca trójkąt Console.WriteLine(TTT.GetType()); //f__AnonymousType0`3[CS3.Point,CS3.Point,CS3.Point] Console.WriteLine(TTT.ToString()); //{ T1 = CS3.Point, T2 = CS3.Point, T3 = CS3.Point }
70 Wiązania dynamiczne ( 4.0 )
public object NowyKlient( ... ) { object kli = null; if ( ... ) kli = new Klient_A(); else kli = new Klient_B(); ... return kli; } // Klient_A nowy = (Klient_A) NowyKlient( ... ); if( nowy != null ) { nowy.Nazwisko = "Nowak"; }
71 dynamic nowy = NowyKlient( ... );
nowy.Nazwisko = "Nowak"; // poprawnie nowy.NieistniejącaFunkcja ( ); // błąd wykonania (nie kompilacji) · również zmienne proste dynamic liczba = ; double ile = liczba / 3.22 ; // poprawne liczba = "Napis"; // poprawne char cc = liczba[0]; // 'N'
72 · dynamiczne statyczne
Klient_B kli = new Klient_B(); dynamic dynKli = kli; // statyczna do dynamicznej Klient_B natręt = dynKli; // dynamiczna do statycznej Dyna
73 Przeciążanie operatorów
public class Line { public int Low , High ; // public static Line operator + // op. binarny ( Line L1 , Line L2 ) int a , b; a = L1.Low < L2.Low ? L1.Low : L2.Low; b = L1.High > L2.High ? L1.High : L2.High; return new Line { Low = a , High = b } ; } // musi być funkcja statyczna
74 public static int operator * (Line L1, int x)
// operator binarny { return L1.Low * x; } // Line L = new Line { Low = –2 , High = 7 } ; Line K = new Line { Low = 0 , High = 9 } ; Line LK = L + K ; // ( -2 , 9 ) int Z = LK * 5 ; // -10
75 public static Line operator + (Line db)
// operator unarny { return new Line { Low = db.Low, High = db.High + 10 }; } public static Line operator ++ (Line no) // operator unarny, pre/post nierozróżnialne return new Line {Low = no.Low – no.High, High = no.High - 1 }; } OpOver
76 Table 12-1. Overloadability of C# Operators
+, -, !, ~, ++, --, true, false These unary operators can be overloaded. +, -, *, /, %, &, |, ^, <<, >> These binary operators can be overloaded. ==, !=, <, >, <=, >= These comparison operators can be overloaded C# demands that “like” operators ( i.e., < and >, <= and >=, == and != ) are overloaded together. [ ] The [ ] operator cannot be overloaded Use the indexer construct. ( ) The () operator cannot be overloaded Use custom conversion methods. +=, -=, *=, /=, %=, &=, |=, Shorthand assignment operators cannot be overloaded; ^=, <<=, >>= however, you receive them as a freebie when you overload the related binary operator. Andrew Troelsen, Pro C# 2010 and the .NET 4 Platform, Fifth Edition, Apress.
77 Indeksatory class Zasobnik { public int[] dane = new int[100];
public int this[int ix] { get { return dane[ix]; } set { dane[ix] = value; } } } // Zasobnik zz = new Zasobnik(); zz[9] = 15; int alfa = zz[9]; Indexer
78 Definiowanie Konwersji
konwersja jawna public static explicit operator Okrąg ( Odcinek oo ) { Okrąg ok = new Okrąg(); if (oo.X > oo.Y) { ok.Sx = oo.X; ok.Sy = oo.Y; } else { ok.Sx = oo.Y; ok.Sy = oo.X; } ok.Pr = Math.Abs(oo.X + oo.Y); return ok; } // Okrąg oki = ( Okrąg ) odcinek; // jawna
79 konwersja implikowana
public static implicit operator Okrąg ( Odcinek oo ) { Okrąg ok = new Okrąg(); ok.Sx = oo.X; ok.Sy = 0; ok.Pr = oo.Y * oo.Y; return ok; } // Okrąg oki = odcinek; // implikowana · nie wolno w tej samej klasie zdefiniować obydwu konwersji ale implikowana zastępuje jawną CustConv
80 Relacja całość - część public class Radio { private string Make ;
public void OnOff ( bool on ) { ... } public Radio ( string name ) Make = name ; }
81 public class Car { private string PetName ; private Radio radio ; public Car( string music , string name ) { radio = new Radio ( music ); PetName = name ; } public MakeNoice ( bool on ) radio.OnOff ( on ); }} Car MyFirst = new Car ( "Eltra", "Kaszel" ) ; MyFirst.MakeNoice ( true );
82 Klasy zagnieżdżone public class Car { private class Radio //(1)
{ public void OnOff ( bool on ) {if (on) Console.WriteLine("Booom!"); } } private Radio radio = new Radio ( ); //(2) // obiektów klasy Radio nie można tworzyć // poza klasą Car (private) Car.Radio rd = new Car.Radio(); // błąd
83 // po zmianie private -> public (1)
public class Radio { ... } // Car.Radio rd = new Car.Radio(); rd.OnOff(true); // Booom! // po zmianie private -> public (2) public Radio radio = new Radio(); Car ca = new Car(); ca.radio.OnOff(true); // Booom!
84 Dziedziczenie public class Parent { public int a ; public string b ;
public Parent ( int Va , string Vb ) { a = Va ; b = Vb ; }} public class Child : Parent // pojedyncze { public long z ; public Child ( int Va , string Vb , long Vz ) : base ( Va , Vb ) { z = Vz ; } }
85 · składowe public są dziedziczone jako public
· składowe protected są dziedziczone jako private · składowe private nie są dziedziczone // · klasy zapieczętowane public sealed class Childless { ... } public sealed class Grandson : Child
86 Funkcje wirtualne public class Employee
{ protected decimal Payment = 1000 ; public virtual void Bonus ( decimal X ) { Payment += X ; } } public class Manager : Employee { public override void Bonus( decimal X ) { Payment += 5 * X ; }
87 public class Proxy : Manager
{ public new void Bonus ( decimal X ) Payment += 700; } public class Boss : Manager public override void Bonus(decimal X ) { Payment += 12 * X ; }
88 Employee [ ] Team = { new Employee ( ) , new Manager ( ), new Proxy ( ), new Boss ( ) } ; for ( int i = 0 ; i < Team.Length ; ++i ) Team [ i ] . Bonus ( 100 ); // 1100 , 1500 , 1500 , 2200 Proxy wice = new Proxy ( ) ; wice.Bounus ( 100 ) ; // 1700
89 · wywołanie funkcji wirtualnej z klasy bazowej
public override Draw ( ) { base.Draw ( ) ; } Wydaw
90 klasy abstrakcyjne i abstrakcyjne funkcje wirtualne
public abstract class Root { protected int alfa = 17; public abstract void Print( ); } public class Level1Node : Root public override void Print( ) Console.WriteLine( alfa );
91 Finalizacja public class Alfa { Alfa ( )
Console.WriteLine( "Oto jestem." ) ; } ~Alfa ( ) // wywoływane przez gc Console.WriteLine( "Dobranoc." ) ;
92 Zbieranie śmieci · generacje obiektów 0 , 1 , 2 · funkcje System.GC
GC.Collect ( NrGeneracji ) //( )- wszystkie GC.GetGeneration ( obiekt ) GC.MaxGeneration ( ) GC.SupressFinalize ( obiekt ) GC.ReRegisterForFinalize ( obiekt ) GC.GetTotalMemeory ( ) Fina
93 Pliki dyskowe i serializacja
· przestrzeń nazw System.IO · informacje o plikach i katalogach - abstrakcyjna klasa bazowa FileSystemInfo Name Attributes Exists CreationTime ... - klasy pochodne FileInfo DirectoryInfo · klasy Directory , File
94 przetwarzanie katalogów klasa DirectoryInfo
DirectoryInfo dir1, dir2 ; dir1 = new DirectoryInfo ) ; dir2 = new DirectoryInfo ( "." ) // bieżący, zawierający *.exe Create ( ) Delete ( ) GetFiles ( ) GetDirectories ( ) MoveTo ( ) DirInfo
95 · przetwarzanie plików klasa FileInfo
Open( ) Delete( ) MoveTo( ) OpenRead( ) OpenWrite( ) · parametry otwarcia pliku FileMode. Append Create Open OpenOrCreate Truncate FileAccess. Read ReadWrite Write FileShare. None Read ReadWrite Write
96 · wynikiem funkcji Open ( )
jest referencja obiektu klasy FileStream umożliwiającego zapis/odczyt do/z pliku bez formatowania ( ciąg bajtów ) FileInfo ff = new FileInfo FileStream fs = ff.Open (FileMode.Open , FileAccess.Read); // albo FileStream fs = new FileStream ("Plik.bin", FileMode.Open, FileAccess.Read);
97 · właściwości i funkcje klasy FileStream
CanReed CanWrite CanSeek Length Position Read ( ) ReadByte ( ) Write ( ) WriteByte ( ) Seek ( ) Flush ( ) Close ( ) // ciągi bajtów byte [ ] TaBa = new byte [ 100 ]; // for ( int i = 0 ; i < TaBa.Length ; ++i ) TaBa [ i ] = (byte) fs . ReadByte( ); // albo fs.Read ( TaBa, 0, TaBa.Length );
98 fs.Seek(0L, SeekOrigin.Begin);
// Current // End // albo fs.Position = 0; for ( int i = 0 ; i < TaBa.Length ; ++i ) fs . WriteByte( TaBa[ i ]); // albo // fs.Write(TaBa, 0, Taba.Length);
99 · wykrywanie końca pliku
int Count = 0; while (Count++ < fs.Length) { } // albo if (fs.Position != fs.Length) · zamykanie pliku fs.Close( ); FileInfo
100 · zapis/odczyt z formatowaniem klasy
Object TextReader TextWriter BinaryReader StreamWriter BinaryWriter StreamReader StringWriter StringReader
101 TextWriter TextReader
· podstawowe funkcje TextWriter TextReader Write ( ) Peek ( ) WriteLine ( ) Read ( ) Flush ( ) ReadLine ( ) Close ( ) ReadToEnd ( )
102 FileInfo fi = new FileInfo ( @"C:\Temp\Test.txt" ) ;
// klasa pochodna TextWriter StreamWriter sw = fi . CreateText ( ) ; // albo StreamWriter sw = new StreamWriter("dane.txt"); // // klasa pochodna TextReader StreamReader sr = fi . OpenText ( ) ; StreamReader sr = new SteamReader("dane.txt");
103 int a = 398 ; double x = E-42 ; sw.WriteLine ( " Some text. " ) ; // 1 arg sw.Write ( a + " ") ; sw.Write ( x.ToString ( ) ) ; sw.Close ( ) ; // string str ; str = sr.ReadLine ( ) ; a = int.Parse ( sr.ReadLine ( ) ) ; x = double.Parse ( sr.ReadLine ( ) ) ; sr.Close ( );
104 · wykrywanie końca pliku
sr.ReadLine() == null // funkcja // albo sr.EndOfStream // właściwość StreamRW
105 · podobnie StringReader StringWriter
StringWriter stw = new StringWriter(); stw.WriteLine("Tekst ćwiczebny."); // 1 arg stw.WriteLine( a ); stw.Close(); StringReader str = new StringReader ( stw.ToString() ); string st = str.ReadLine(); a = int.Parse ( str.ReadLine ( ) ) ; str.Close();
106 BinaryWriter BinaryReader
· klasy BinaryReader BinaryWriter BinaryWriter BinaryReader Write ( ) PeekChar ( ) Seek ( ) Read ( ) Flush ( ) ReadXXX ( ) Close ( ) XXX : Boolean, Byte, Bytes, Char, Chars, Int16, Int32, Int64, Double, Decimal,... BinaryRW
107 serializacja automatyczne zapisywanie / odczytywanie obiektów klas do / z pliku
using System.Runtime.Serialization. Formatters.Binary ; using System.IO ; // [Serializable] public class Radio { public string Make ; [NonSerialized] private int something ; // nie zapisywane public bool On ; }
108 Radio radio = new Radio ( ) ;
radio.Make = "Aiwa" ; radio.On = true ; // FileStream data = File.Create ("Radio.dat"); BinaryFormatter bifoter = new BinaryFormatter(); bifoter.Serialize ( data , radio ) ; data.Close ( ) ; data = File.OpenRead ( "Radio.dat" ) ; Radio nn = (Radio)bifoter.Deserialize( data ); Seria
109 System.Collections // usunąć Generics
Klasy kolekcji System.Collections // usunąć Generics · klasy ArrayList // lista dowolnych obiektów Queue // kolejka FIFO Stack // stos LIFO SortedList // posortowana lista par // <klucz, wartość> Hashtable // tablica par // <klucz, wartość > // kodowanie mieszające
110 · ArrayList // tablica dowolnych obiektów
Add, BinarySearch, Clear, Clone, Contains, CopyTo, IndexOf, Insert, Remove, Reverse, Sort // funkcje Capacity, Count // właściwości · Queue // kolejka FIFO Enqueue, Dequeue, Peek, Clear, Contains // funkcje Count // właściwość · Stack // stos LIFO Push, Pop, Peek, Clear, Contains // funkcje
111 · SortedList // lista par <klucz, wartość>
// posortowana Add, Clear, ContainsKey, ContainsValue, GetByIndex, IndexOfKey, IndexOfValue, Remove, SetByIndex // funkcje Capacity, Count, Item // właściwości // KeyValuePair – klasa pomocnicza · Hashtable // tablica par <klucz, wartość > // kodowanie mieszające Add, Clear, ContainsKey, ContainsValue, Remove // funkcje Capacity, Count, Item // właściwości
112 public class Auto { public string Name; public double Price; public Auto(string nn, double pp) Name = nn; Price = pp; }
113 ArrayList al = new ArrayList();
al.Add ( new Auto("A", 100) ); al.Add ( new Auto("B", 20) ); Console.WriteLine("{0}, {1}", ((Auto)al[0].Price, ((Auto)al[1]).Price); // 100, 20
114 SortedList sl = new SortedList();
sl.Add ( "zero", new Auto("A", 100) ); sl.Add ( "jeden", new Auto("B", 20) ); // Console.WriteLine("{0}, {1}, {2}, {3}", ((Auto)sl["zero"]).Price, ((Auto)sl["jeden"]).Price; // 100, 20 ((Auto)sl.GetByIndex(0)).Price, ((Auto)sl.GetByIndex(1)).Price); // 20, 100
115 generics, typy parametryczne, typy uogólnione
Wzorce klas kolekcji generics, typy parametryczne, typy uogólnione Dictionary <key, value> SortedDictionary <key, value> LinkedList <type> // dwukierunkowa List <type> // jednokierunkowa SortedList <key, value> // indeksowanie Queue <type> Stack <type>
116 sl.Add("C", "alfa"); // kompilacja ok
SortedList sl = new SortedList(); sl.Add(12, 5.5); sl.Add("B", 9); sl.Add("C", "alfa"); // kompilacja ok // błąd wykonania, porównanie kluczy niemożliwe
117 SortedList <string, int> al =
new SortedList <string, int> (); al.Add("X", 5); al.Add("Y", 7); al.Add("Z", 3); al.Add(5, 2); // błąd kompilacji al.Add("K", 3.2); // błąd kompilacji // Console.WriteLine("{0}, {1}, {2}", al["X"], al["Y"], al["Z"]); // 5, 7, 3
118 · wzorce kolekcji we wzorcach funkcji
class Osoba { public string Imie; public string Nazwisko; public Osoba(string s1, string s2) { Imie = s1; Nazwisko = s2; } public overrite string ToString( ) return Imie + " " + Nazwisko; } }
119 public void Dopisz <T> (List <T> li,
params T [ ] dane ) { foreach ( T elem in dane ) li.Add( elem ); } // List <Osoba> lios = new List <Osoba>(); Dopisz(lios, new Osoba("Adam", "Kot"), new Osoba("Anna","Kotka")); foreach (Osoba os in lios) Console.WriteLine( os );
120 Interfejsy · określają operacje realizowane przez klasę lub jej cechy charakterystyczne · klasy abstrakcyjne zawierające deklaracje funkcji abstrakcyjnych public interface INodes_F { int GetNumberOfNodes ( ); } // funkcja abstrakcyjna // lub public interface INodes_P { int Nodes {get; set;} } // właściwość abstrakcyjna
121 public abstract class Shape
{ public int Nodes ; public double Surface; } // public class Hexagon : Shape , INodes_F public int GetNumberOfNodes ( ) return 6 ;
122 public class Triangle : Shape , INodes_F
{ public int GetNumberOfNodes ( ) return 3 ; } // public class Circle : Shape ...
123 Hexagon hex = new Hexagon ( );
if ( hex is INodes_F ) ; // test // INodes_F inodes1 = (INodes_F) hex ; // InvalidCastException INodes_F inodes2 = hex as INodes_F ; // NULL int NodesOfHex = inodes1.GetNumberOfNodes ( ) ; · zmienne reprezentujące interfejsy ( referencje ) mogą być parametrami funkcji · interfejs jako typ może być wynikiem funkcji Dzie&Int
124 · hierarchie interfejsów
interface IDrawBW { void DrawBW ( ) ; } interface IDrawGS : IDrawBW void DrawGS ( ) ; interface IDrawCR : IDrawGS void DrawCR ( ) ;
125 public class Picture : IDrawCR
{ // implementacja funkcji // DrawCR , DrawGS , DrawBW } // Picture pp = new Picture ( ) ; IDrawCR iCR = pp as IDrawCr ; iCR . DrawBW ( ) ; iCR . DrawGS ( ) ; iCR . DrawCR ( ) ;
126 Interfejsy standardowe
System.Collections · interfejsy ICollection IDictionary IDictionaryEnumerator IHashCodeProvider IList IComparer // IEnumerable IEnumerator IClonable IComparable
127 · przeglądanie kolekcji
Library EhRL = new Library ( ) ; foreach ( Book bb in EhRL ) { ... } ; // wymaga w IEnumerable oraz IEnumerator // w klasie Library public class Library : IEnumerable, IEnumerator { private Book [ ] BookArr ;
128 // implementacja IEnumerable
public IEnumerator GetEnumerator ( ) { return ( IEnumerator ) this ; } // implementacja IEnumerator public void Reset ( ) { .... } public bool MoveNext ( ) { ... } public object Current get { .... } } }
129 public class DaysOfTheWeek : IEnumerable
- iteratory (2.0) public class DaysOfTheWeek : IEnumerable { string[] m_Days = { "Sun", "Mon", "Tue", "Wed", "Thr", "Fri", "Sat" }; public IEnumerator GetEnumerator() { for (int i = 0; i < m_Days.Length; i++) yield return m_Days[i]; } } // DaysOfTheWeek week = new DaysOfTheWeek(); foreach (string day in week) System.Console.Write(day + " "); Iterat
130 · pełne kopiowanie public class Point { public int x , y ; public Point (int A , int B ) { x = A ; y = B ; } Point AA , BB ; AA = new Point ( 5, 7) ; BB = AA ; // AA i BB wskazują ten sam // obiekt na stercie (shallow)
131 // pełne kopiowanie wymaga ICloneable
public class Point : ICloneable { public int x , y ; public Point (int A , int B ) { x = A ; y = B ; } public object Clone ( ) return new Point( this.x , this.y ); } BB = (Point)AA.Clone(); // nowa kopia
132 · sortowanie public class Point : IComparable { public int X, Y; public int CompareTo ( object ob ) // { < == > } -> { } { Point temp = (Point) ob; if ( this.X > temp.X ) return 1; if ( this.X == temp.X ) return 0 ; return -1; }} Point [ ] aP = new Point [ 100 ]; Array.Sort(aP); // aP[3].CompareTo((object)aP[7]) SortP, Komis
133 · interfejsy parametryczne, generics
ICollection < T > IComparer < T > IDictionary < TKey, TValue > IEnumerable < T > IEnumerator < T > IEqualityComparer < T > IList < T >
134 · klasy, kolekcje i interfejsy parametryczne
public class Dict<KeyType, EleType > where KeyType: IComparable<KeyType> { Dictionary<KeyType, EleType> dd = new Dictionary<KeyType,EleType>(); public KeyType patt; public void Add(KeyType key, EleType val) { if (key.CompareTo(patt) != 0 && !dd.ContainsKey(key)) dd.Add(key, val); } }
135 Dict<int, string> dis = new Dict<int,string>();
dis.patt = 25; dis.Add(24, "alfa"); dis.Add(25, "beta"); dis.Add(26, "delta"); dis.Add(26, "gamma"); // {24, alfa}, {26, delta}
136 Delegacje · klasy, których obiekty udostępniają funkcje
· klasy pochodne System.MulticastDelegate Składowe klasy System.MulticastDelegate składowa opis Method nazwa funkcji zawartej w delegacji Target nazwa klasy, w której zdefiniowana jest funkcja lub null dla statycznych Combine( ), +, += dodanie funkcji GetInvocationList ( ) lista funkcji zawartych w delegacji Remove( ), -, -= usunięcie funkcji
137 delegate double Fun(double x, out bool ok);
// nowy typ // funkcje nazwane double Sqrt(double x, out bool ok) { if ( x >= 0 ) { ok = true; return Math.Sqrt( x ); } else { ok = false; return 0; } } // double Log (double x, out bool ok) { }
138 double z, x = 4.3; bool dobrze = true; Fun funkcja = new Fun ( Sqrt ); // obiekt delegacji // albo Fun funkcja = Sqrt; // wywołanie z = funkcja ( x, out dobrze ); // sqrt // funkcja = Log; z = funkcja ( x, out dobrze ); // log if (funkcja != null) ...
139 · tablice delegacji Fun [] TabFun = new Fun[2]; TabFun[0] = new Fun(Sqrt); TabFun[1] = Log; // po ustaleniu indeksu z = TabFun[indeks](x, out dobrze); // double [] Args = {2.34, 5.32}; double [] Results = { TabFun[0](Args[0], out dobrze); TabFun[1](Args[1], out dobrze); };
140 · delegacje wielokrotne (multicast)
void AsIs(string s) { Console.WriteLine(s); } // void Vers(string s) Console.WriteLine(s.ToUpper( ));
141 delegate void Print2(string s);
// Print2 Both = AsIs; Both += Vers; Both("Ala ma kota."); // Ala ma kota. // ALA MA KOTA. Both -= AsIs; Both("Ola ma psa."); // OLA MA PSA if (Both != null) ... Dele, MulDele, EwideD
142 · delegacje anonimowe (2.0) button1.Click += // delegacja Click
delegate(System.Object o, System.EventArgs e) { MessageBox.Show("Click!"); }; // delegate int Del( int x ); static int n = 79; // składowa klasy int m = 2; // zmienna lokalna Del d = delegate( int k ) { return n + m + k + 3; }; int F = d(5); // 89 Anonymous
143 · kowariancja i kontrawariancja delegacji (2.0)
( covariance and contravariance ) class Mammal { ... } // bazowa class Dog : Mammal { ... } // pochodna // public delegate Mammal Handler( ); // delegacja public Mammal FirstHandler( ) { return new Mammal( ); } public Dog SecondHandler( ) { return new Dog( ); } Handler handler1 = FirstHandler; Handler handler2 = SecondHandler;// kowariancja
144 public delegate void Vet ( Dog );
// delegacja public void FirstHandler(Dog ds) { ... } public void SecondHandler ( Mammal ms ) { ... } // Vet handler1 = FirstHandler; Vet handler2 = SecondHandler; // kontrawariancja
145 ● wzorce delegacji (generics) (3.0)
delegate R Fun <R, A>(A arg); // Fun <long, int> d1; long FK (int x) { return (long)x L; } d1 = FK; Fun <double, double> d2; Fun <char, int> d3;
146 ● systemowe wzorce delegacji bezwynikowe
public delegate void Action <in T> ( ) public delegate void Action <in T> ( T arg ) public delegate void Action<in T1, in T2> ( T1 arg1, T2 arg2 ) // ……………………………………………………………………………… public delegate void Action<in T1, in T2, in T3, in T4, in T5, in T6, in T7, in T8, in T9, in T10, in T11, in T12, in T13, in T14, in T15, in T16> ( T1 arg1, T16 arg16 ) // Action <string> messageTarget; messageTarget = Console.WriteLine; messageTarget("Hello, World!");
147 public delegate TResult Func <out TResult>( )
B. z wynikiem public delegate TResult Func <out TResult>( ) public delegate TResult Func <in T, out TResult> ( T arg ) //……………………………………………………………………………………………… public delegate TResult Func <in T1, in T2, in T3, in T4, in T5, in T6, in T7, in T8, in T9, in T10, in T11, in T12, in T13, in T14, in T15, in T16, out TResult> ( T1 arg1, , T16 arg16 ) // Func <string, string> convertMethod = OnlyLetters; //…………………………………………………………………………………………………… string name = "Dakota512"; Console.WriteLine(convertMethod(name)); convertMethod = OnlyDigits;
148 ● wyrażenia lambda (funkcje nienazwane) (3.0)
- jeden argument delegate R Fun <R, A>(A arg); // Fun <int, int> L1 = x => x * x + 1; // λ x . x * x + 1 Console.WriteLine( L1(12) ); // 145 Fun <double, int> L2 = x => (double)x / ; Console.WriteLine( L2(7) ) ; // 4,0
149 wiele argumentów delegate R Arg2 <R, A, B> (A x, B y); // Arg2 <long, int, char> suma = (x,y) => (long)(x + y + 1); Console.WriteLine(" Suma : " + suma(15, 'A'). ToString()); // Suma : 81 Lambda
150 · Use a delegate when: An eventing design pattern is used. The caller has no need access other properties, methods, or interfaces on the object implementing the method. Easy composition is desired. A class may need more than one implementation of the method.
151 · Use an interface when:
There are a group of related methods that may be called. A class only needs one implementation of the method. The class using the interface will want to cast that interface to other interface or class types. The method being implemented is linked to the type or identity of the class: for example, comparison methods.
152 Zdarzenia · zgłoszenie zdarzenia powoduje wywoływanie
wszystkich funkcji zawartych w delegacji powiązanej z tym zdarzeniem public class Car { private float Gas ; public delegate void GasShortage ( string msg ) ; public event GasShortage Yellow ; public event GasShortage Red ;
153 public void SpeedUp ( double speed )
{ if ( Gas < 2 && Yellow != null ) Yellow ( "Only " Gas.ToString ( ) " gallons of gas !" ); if ( Gas < 0.5 && Red != null ) Red ( "Almost no gas !" ) ; }
154 public class Driver { private Car MyCar = new Car( ); public void Driving ( ) { MyCar.Yellow += new Car.GasShortage ( YellowLight ); MyCar.Red += new Car.GasShortage ( RedLight ) ; } public void Parking ( ) { MyCar.Yellow -= new Car.GasShortage ( YellowLight ) ;
155 public static void YellowLight (string msg )
{ Console.WriteLine ( msg ); } public static void RedLight (string msg ) Alarm ( ) ; Event, Loteria
156 Obsługa wyjątków throw nazwa_wyjątku // obiekt klasy dziedziczącej z System.Exception try { } catch ( typ_wyjątku ) catch // wszystkie wyjątki finally Exep
157 Zapytania ( 3.0 ) wyrażenia zapytaniowe - querry expressions
przestrzeń nazw LINQ - Language-Integrated Query 3 etapy : 1. określenie źródła danych, 2. utworzenie zapytania, 3. wykonanie zapytania.
158 class FirstLINQ { static void Main() { int[] numbers = // 1. Data source. new int[7] { 0, 1, 2, 3, 4, 5, 6 }; // 2. Query creation. var numQuery = from num in numbers where (num % 2) == 0 select num; // 3. Query execution. foreach (int elem in numQuery) { Console.Write("{0} ", elem); }}}
159 IQueryable< > , IQueryProvider
technologie LINQ Linq to Objects Linq to DataSet Linq to SQL Linq to XML Linq to own sources IQueryable< > , IQueryProvider J. Matulewski, C# 3,0 i .Net. 3.5 Technologia LINQ, Helion, 2008 Przykłady : IEnumerable IEnumerable< >
160 słowa kluczowe from // źródło danych where // filtrowanie danych select // pobieranie danych join // łączenie danych orderby // sortowanie danych ascending // rosnąco descending // malejąco let // nadanie wartości group // grupowanie danych into // kontynuacja zapytania on // połącz tabele equals // równość pól
161 funkcje rozszerzające IEnumerable, IEnumerable< >
Select, SelectMany // pobieranie danych OrderBy, ThenBy, OrderByDescending, ThenByDescending, Reverse // sortowanie Where // filtrowanie Aggregate, Average, Count, LongCount, Max, Min, Sum // artymetyczne Cast, OfType, ToArray, ToDictionary, ToList, ToLookup, ToSequence // konwersja Element, DefaultIfEmpty, ElementAt, ElementAtOrDefault, First, FirstOrDefault, Last, LastOrDefault, Single, SingleOrDefault // pobieranie elementu
162 EqualAll // porównywanie
Empty, Range, Repeat // tworzenie GruopBy // grupowanie GroupJoin, Join // łączenie Skip, SkipWhile, // pomijanie Take, TakeWhile // wybór All, Any, Contains // kwantyfikatory Concat, Distinct, Exept, Intersection, Union // operacje na zbiorach
163 Func<string, string> selector = str => str.ToUpper();
public static IEnumerable<TResult> Select <TSource, TResult> (this IEnumerable<TSource> source, Func<TSource, TResult> selector) // Func<string, string> selector = str => str.ToUpper(); string[] words = { "orange", "apple", "Article", "elephant" }; var aWords = words.Select(selector); foreach (string word in aWords) Console.WriteLine(word);
164 Linq to own sources ->
Linq to Objects -> Linq to own sources -> Linq1 Linq2
165 Współbieżność · przestrzeń nazw System.Threading
· klasa Thread tworzenie wątków i zarządzanie ich wykonywaniem · główne funkcje Start Suspend Resume Abort Sleep GetHashCode · główne właściwości CurrentThread Name ThreadState Priority IsBackGround IsAlive
166 · priorytety wątków Lowest BelowNormal Normal AboveNormal Highest · wątki pierwszoplanowe i drugoplanowe ( ForeGround / BackGroung Threads ) – dopóki istnieje przynajmniej jeden wątek pierwszoplanowy aplikacja nie jest zamykana przez CLR – po zakończeniu ostatniego wątku pierwszoplanowego CLR kończy wszystkie aktywne jeszcze wątki drugoplanowe
167 public class Worker { public bool EndOfWork = false ; public void DoWork ( ) // funkcja wątku { Console.WriteLine ("Worker's ID is {0}\n" + "Worker's name is {1}", Thread.CurrentThread.GetHashCode ( ) , Thread.CurrentThread.Name ) ; for ( int i = 0; i < 1000 && !EndOfWork ; ++i ) { Console.WriteLine ( i ) ; Thread.Sleep ( 500 ) ; } } // End of Worker
168 static void Main ( string [ ] args )
{ Worker ww = new Worker ( ) ; Thread job = new Thread( new ThreadStart( ww.DoWork )); // delegacja ThreadStart // funkcja bezargumentowa job.Name = "Ben" ; job.Start ( ) ; Thread.Sleep ( 5000 ); job.Suspend ( ) ; ww.EndOfWork = true ; job.Resume ( ) ; }
169 // funkcje z argumentami
class AddParams // klasa argumentu { public int a, b; public AddParams(int numb1, int numb2) a = numb1; b = numb2; }
170 class Program { void Add(object data) // funkcja wątku if (data is AddParams) AddParams ap = (AddParams)data; Console.WriteLine("{0} + {1} is {2}", ap.a, ap.b, ap.a + ap.b); }
171 void Run ( ) { AddParams ap = new AddParams(10, 10); Thread t = new Thread( new ParameterizedThreadStart(Add)); t.Start(ap); // przyśnij, aby drugi wątek // zakończył pracę Thread.Sleep(50); } ParamThread
172 · asynchroniczne wykonywanie delegacji
public delegate int BinaryOp(int x, int y); int Add(int x, int y) { Thread.Sleep(5000); return x + y; } // BinaryOp b = new BinaryOp(Add); // wywołanie synchroniczne, ten sam wątek int answer = b(10, 10); // lub int answer = b.Invoke(10, 10);
173 // asynchronicznie, odrębny wątek
BinaryOp b = new BinaryOp(Add); // Start secondary thread IAsyncResult iftAR = b.BeginInvoke(10, 10, null, null); // Do other work on primary thread... int answer = b.EndInvoke(iftAR); Console.WriteLine(" is {0}.", answer); AsyncDel
174 // funkcje zwrotne bool Ready = false; void AddComplete(IAsyncResult itfAR) { Console.WriteLine("Your addition is ready"); Ready = true; } // IAsyncResult iftAR = b.BeginInvoke(10, 10, new AsyncCallback(AddComplete), null); while (!Ready) { // other work is performed here... } int answer = b.EndInvoke(iftAR); AsyncCall
175 · wykonywanie cykliczne
void PrintTime(object state) { Console.WriteLine("Time is: {0}", DateTime.Now.ToLongTimeString()); } TimerCallback timeCB = new TimerCallback(PrintTime); Timer t = new Timer(timeCB, null, 0, 1000); // delegacja, parametr, // opóźnienie startu, interwał // wątek drugoplanowy Timer
176 · synchronizacja dostępu
do obiektów współużytkowanych ─ lock ( słowo kluczowe ) ─ System.Treading.Semaphore ─ System.Treading.Mutex ─ System.Treading.Monitor ─ System.Treading.Interlocked ─ synchronizacja za pomocą zdarzeń ─ atrybut wykluczania
177 public class SharedData_1
{ private Records [ ] DataBase ; object UpdateLock; public Update ( string str ) { lock ( UpdateLock ) // aktualizacja } Adders
178 public Semaphore sem1 = new Semaphore (
init_val, max_val ); // count = init_val public class SharedData_2 { private Records [ ] DataBase ; public Update ( string str ) { sem1.WaitOne( ); // if ( count != 0 ) --count; else wait; // aktualizacja sem1.Release( ); // ++count; } } // wątki nie są identyfikowane
179 public Mutex mut1 = new Mutex ( );
public class SharedData_2 { private Records [ ] DataBase ; public Update ( string str ) { mut1.WaitOne( ); // request ownership // of a mutex // updating mut1.ReleaseMutex( ); // release ownership } } // wątki są identyfikowane
180 public class SharedData_3
{ private Records [ ] DataBase ; object UpdateObject; public Update ( string str ) { try { Monitor.Enter ( UpdateObject ) // aktualizacja } finally // zawsze się wykona Monitor.Exit ( UpdateObject ) ; } } } // .TryEnter .Wait() .Pulse()
181 public class MainCounter // Interlocked
{ private long Counter = 0; public void Inc ( ) // + 1 Interlocked.Increment( ref Counter ); } public void Dec ( ) // - 1 Interlocked.Decrement( ref Counter ); }
182 public void Exch ( ref Value ) //
{ Interlocked.Exchange( ref Counter, ref Value ); } public void CompExch ( val1, val2 ) Interlocked.CompareExchange ( ref Counter, val1, val2 ); } // if (Counter == val1) // Counter = val2;
183 · synchronizacja ścieżek za pomocą zdarzeń
─ ManualResetEvent (true / false) ─ AutoResetEvent (true / false) ─ Reset() false ─ Set() true ─ WaitOne() : Manual bz Auto false, gdy było true ResetEvent
184 · atrybut wykluczania Synchronization
using System.Runtime.Remoting.Contexts; // Thread safe [Synchronization] class Services : ContextBoundObject { public void Read ( ... ) { ... } public void Print ( ... ) { ... } public void Update ( ... ) { ... } } // wszystkie funkcje wykonywane niepodzielnie
185 · pula wątków CLR ─ powołanie nowego wątku ( async delegate ) powoduje uruchomienie jednego z oczekujących wątków utworzonych dla programu przez CLR ─ można do kolejnych wątków puli przypisywać funkcje do wykonania ( poprzez delegację WaitCallback ) - wątki drugoplanowe public class Printer { public void PrintNumbers() { ... } }
186 Printer prin = new Printer();
WaitCallback workItem = new WaitCallback(PrintTheNumbers); // Queue the method ten times. for (int i = 0; i < 10; i++) ThreadPool.QueueUserWorkItem(workItem, prin); // void PrintTheNumbers(object state) { Printer task = (Printer)state; task.PrintNumbers(); } ResetEventPool, PrinterPool
187 · współbieżne wykonywanie zadań
TPL – Task Parallel Library using System.Threading.Tasks; ─ współbieżne przetwarzanie rozłącznych zbiorów danych Parallel.For ( from, to, action ) Parallel.ForEach ( data_source, action ) // również z dodatkowymi parametrami
188 Parallel.For ( 0, 4, DoWork );
// powołanie 4 wątków (0, 1, 2, 3), // z których każdy wykonuje funkcję // zawartą w delegacji DoWork DataPara/MatMul Parallel.ForEach ( kolekcja, DoWork ) ; // powołanie max. tylu wątków ile // elementów zawiera kolekcja, // każdy wątek wykonuje funkcję // zawartą w delegacji DoWork DataPara/PictRev
189 ─ współbieżne obliczenia
Parallel.Invoke( action [ ] ac_list) // powołanie dla każdej akcji z ac_list // wątka wykonującego tę akcję ─ przerwanie wykonania wszystkich ścieżek CancelationToken TaskPara
190 ─ klasa Task<TResult> // zadanie o wyniku
─ klasa TaskFactory // zbiór zadań // wykonywanych // współbieżnie Task.Factory.ContinueWhenAll( Task<TResult> [ ] TaskTable, Action<Task<TResult>> DoNext ) ; TaskFact
191 · współbieżne zapytania PLINQ
AsParallel() WithCancellation() WithDegreeOfParallelism() // private CancellationTokenSource cancelToken = new CancellationTokenSource() cancelToken.Cancel();
192 int[] modThreeIsZero = null;
// source – vector of integers try { modThreeIsZero = (from num in source.AsParallel() WithCancellation(cancelToken.Token) where num % 3 == 0 orderby num descending select num.ToArray(); } catch (OperationCanceledException ex) Console.WriteLine( ex.Message ); ParLinq
193 Przestrzeń nazw · łączy zdefiniowane typy ( klasy, struktury, delegacje, zdarzenia, wyliczenia) using System ; namespace MySpace { public class Alfa { ... } public class Beta { ... } } · gdy definicje klas w kilku plikach należy powtórzyć deklarację namespace
194 · korzystanie z przestrzeni nazw w innej przestrzeni
using System ; using MySpace ; namespace NextSpace { public class Alfa_1 : Alfa { } public class Alfa_2 : MySpace.Alfa // gdy konfliktowe nazwy { .... } }
195 · przestrzeń nazw definiująca stałe
namespace Constants { public sealed class CT { public static readonly double pi = ; e = ; private CT( ) {} } using Constants ; double radius = 23.4 ; double perimeter = 2.0 * CT.pi * r ;
196 Pakiety i odzwierciedlenie ( refleksja ) typów
· pakiet ( assembly ) ─ aplikacja ─ biblioteka Nagłówek .exe Manifest Metadane Typów CIL Zasoby
197 · składniki przestrzeni nazw System.Reflection
· składniki przestrzeni nazw System.Reflection Klasa Opis Assembly wczytanie pakietu, analiza manifestu lista typów ( klas , struktur ) AssemblyName wersja, ustawienia regionalne MethodInfo opis funkcji składowej ParameterInfo opis parametru PropertyInfo opis właściwości FieldInfo opis danej składowej
198 · tworzenie biblioteki .dll
typ projektu: Class Library np. CarTuneUpLib CarTuneUpLib.dll public Garage : WashCar() ,ChangeOil() ... · korzystanie z biblioteki za pomocą Add Reference dodać bibliotekę CarTuneUpLib // using CarTuneUpLib ; public static int Main ( string [ ] args ) { Garage BlueNut = new Garage ( ) ; BlueNut.ChangeOil ( ... ) ; }
199 · dynamiczne ładowanie biblioteki
using System ; using System.Reflection ; using System.IO ; Assembly a = Assembly.Load ( "CarTuneUpLib" ); // CarTuneUpLib.dll tam gdzie .exe // klasy Type [ ] Classes = a.GetTypes( ); // odczytywanie składowych Type garage = a.GetType("CarTuneUpLib.Garage"); MemberInfo [ ] mi = garage.GetMembers( ); // podobnie parametry funkcji
200 · dynamiczne wywoływanie funkcji
// tworzenie klasy object Gar = Activator.CreateInstance(garage); // MethodInfo wash = garage.GetMethod("WashCar"); wash.Invoke( Gar, null ); // bezargumentowa object [ ] TabPar = { par1, par2, ... }; xxx.Invoke ( obj, TabPar ); // z argumentami
201 · pakiety prywatne i współużytkowane ( Global Assembly Cache )
· pakiety prywatne i współużytkowane ( Global Assembly Cache ) · wersje pakietów współużytkowanych a.b.c.d ─ a : główny numer wersji ─ b : podrzędny numer wersji ─ c : numer kolejny kompilacji ─ d : liczba szybkich poprawek · gdy różne a lub b wersja nieodpowiednia
Pobierz ppt "Język C# ( 5.0 ) using System; namespace HeWo { class Hello"
Podobne prezentacje
Reklamy Google
|
{
"url": "http://slideplayer.pl/slide/414068/",
"source_domain": "slideplayer.pl",
"snapshot_id": "crawl=CC-MAIN-2019-18",
"warc_metadata": {
"Content-Length": "545960",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FRQ77DJ4DLZHBBOCOUY7DHDAYTNOA4UK",
"WARC-Concurrent-To": "<urn:uuid:cdca6ea8-4e18-4fd9-b0dd-688fef28a51a>",
"WARC-Date": "2019-04-23T08:33:26Z",
"WARC-IP-Address": "138.201.81.207",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XANECYCTODRG4KNEZMO2VSH4LWF3MP2N",
"WARC-Record-ID": "<urn:uuid:15930a23-4d5f-4075-81b4-8905f1668225>",
"WARC-Target-URI": "http://slideplayer.pl/slide/414068/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f6e07100-d0ad-4dee-9cc2-da3cc91f1180>"
},
"warc_info": "isPartOf: CC-MAIN-2019-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-150-136-47.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,
38,
39,
77,
78,
138,
139,
148,
282,
283,
303,
304,
305,
409,
410,
472,
585,
586,
657,
769,
770,
802,
988,
989,
1054,
1211,
1212,
1276,
1457,
1458,
1522,
1716,
1717,
1755,
1863,
1864,
2046,
2047,
2075,
2198,
2199,
2262,
2340,
2341,
2413,
2562,
2563,
2594,
2990,
2991,
3026,
3133,
3134,
3172,
3525,
3526,
3562,
3959,
3960,
3999,
4308,
4309,
4355,
4567,
4568,
4617,
4966,
4967,
5024,
5273,
5274,
5345,
5532,
5533,
5713,
5714,
5958,
5959,
6000,
6213,
6214,
6568,
6569,
6855,
6856,
6893,
7132,
7133,
7183,
7363,
7364,
7407,
7578,
7579,
7627,
7831,
7832,
7863,
8013,
8014,
8075,
8422,
8423,
8631,
8632,
8668,
8839,
8840,
8866,
9097,
9098,
9166,
9285,
9286,
9553,
9554,
9581,
9788,
9789,
9825,
10020,
10021,
10332,
10333,
10373,
10592,
10593,
10946,
10947,
10996,
11196,
11197,
11239,
11367,
11368,
11409,
11745,
11746,
11788,
11880,
11881,
12171,
12172,
12218,
12380,
12381,
12420,
12621,
12622,
12675,
12865,
12866,
12917,
13238,
13239,
13295,
13563,
13564,
13609,
13794,
13795,
13839,
14139,
14140,
14194,
14412,
14413,
14448,
14569,
14570,
14600,
14832,
14833,
15083,
15084,
15121,
15328,
15329,
15540,
15541,
15597,
15900,
15901,
16118,
16119,
16155,
16440,
16441,
16507,
16730,
16731,
16796,
16987,
16988,
17165,
17166,
17202,
17488,
17489,
17550,
17717,
17718,
17788,
18107,
18108,
18170,
18597,
18598,
18629,
18857,
18858,
18895,
19147,
19148,
19182,
19322,
19323,
19350,
19630,
19631,
19680,
19869,
19870,
19913,
20149,
20150,
20197,
20905,
20906,
20972,
21124,
21125,
21151,
21419,
21420,
21445,
21723,
21724,
21793,
21876,
21877,
22163,
22164,
22231,
22458,
22459,
22498,
22708,
22709,
22781,
22981,
22982,
23033,
23225,
23226,
23269,
23464,
23465,
23497,
23644,
23645,
23896,
23897,
23947,
23998,
23999,
24054,
24229,
24230,
24274,
24381,
24382,
24453,
24640,
24641,
24673,
24905,
24906,
24955,
25147,
25148,
25197,
25410,
25411,
25445,
25730,
25731,
25781,
26072,
26073,
26107,
26263,
26264,
26298,
26429,
26430,
26473,
26580,
26581,
26607,
26739,
26740,
26797,
27039,
27040,
27315,
27316,
27351,
27430,
27431,
27478,
27728,
27729,
27759,
27989,
27990,
28082,
28293,
28294,
28328,
28611,
28612,
28654,
28926,
28927,
28973,
29265,
29266,
29313,
29672,
29673,
29797,
29798,
29834,
29978,
29979,
30017,
30278,
30279,
30329,
30582,
30583,
30625,
30778,
30779,
30813,
31042,
31043,
31091,
31283,
31284,
31325,
31554,
31555,
31892,
31893,
31925,
32057,
32058,
32103,
32185,
32186,
32221,
32558,
32559,
32594,
32726,
32727,
32762,
32940,
32941,
32968,
33135,
33136,
33170,
33379,
33380,
33413,
33616,
33617,
33662,
34020,
34021,
34250,
34251,
34293,
34497,
34498,
34835,
34836,
34883,
35018,
35019,
35074,
35359,
35360,
35412,
35540,
35541,
35601,
35956,
35957,
36005,
36200,
36201,
36457,
36458,
36742,
36743,
36788,
36890,
36891,
36927,
37111,
37112,
37180,
37438,
37439,
37496,
37839,
37840,
37878,
38061,
38062,
38102,
38247,
38248,
38293,
38745,
38746,
38796,
39331,
39332,
39382,
39601,
39602,
39801,
39802,
40067,
40068,
40099,
40417,
40418,
40476,
40700,
40701,
40742,
40896,
40897,
41164,
41165,
41214,
41314,
41315,
41475,
41476,
41541,
41678,
41679,
41972,
41973,
42008,
42236,
42237,
42554,
42555,
42609,
43040,
43041,
43070,
43315,
43316,
43374,
43717,
43718,
43745,
43799,
43800,
43853,
44078,
44079,
44439,
44440,
44797,
44798,
44839,
45094,
45095,
45124,
45241,
45242,
45422,
45423,
45632,
45633,
45681,
45924,
45925,
45963,
46196,
46197,
46522,
46523,
46556,
46837,
46838,
46875,
47113,
47114,
47144,
47272,
47273,
47317,
47586,
47587,
47626,
47854,
47855,
47885,
48124,
48125,
48169,
48331,
48332,
48372,
48562,
48563,
48615,
48779,
48780,
48827,
49088,
49089,
49431,
49432,
49466,
49753,
49754,
49795,
50020,
50021,
50056,
50358,
50359,
50388,
50564,
50565,
50611,
50779,
50780,
50819,
50978,
50979,
51012,
51280,
51281,
51557,
51558,
51621,
51778,
51779,
51825,
52012,
52013,
52064,
52172,
52173,
52224,
52533,
52534,
52574,
52905,
52906,
52950,
53281,
53282,
53325,
53571,
53572,
53639,
53937,
53938,
53939,
54013,
54014,
54034,
54035,
54036
],
"line_end_idx": [
38,
39,
77,
78,
138,
139,
148,
282,
283,
303,
304,
305,
409,
410,
472,
585,
586,
657,
769,
770,
802,
988,
989,
1054,
1211,
1212,
1276,
1457,
1458,
1522,
1716,
1717,
1755,
1863,
1864,
2046,
2047,
2075,
2198,
2199,
2262,
2340,
2341,
2413,
2562,
2563,
2594,
2990,
2991,
3026,
3133,
3134,
3172,
3525,
3526,
3562,
3959,
3960,
3999,
4308,
4309,
4355,
4567,
4568,
4617,
4966,
4967,
5024,
5273,
5274,
5345,
5532,
5533,
5713,
5714,
5958,
5959,
6000,
6213,
6214,
6568,
6569,
6855,
6856,
6893,
7132,
7133,
7183,
7363,
7364,
7407,
7578,
7579,
7627,
7831,
7832,
7863,
8013,
8014,
8075,
8422,
8423,
8631,
8632,
8668,
8839,
8840,
8866,
9097,
9098,
9166,
9285,
9286,
9553,
9554,
9581,
9788,
9789,
9825,
10020,
10021,
10332,
10333,
10373,
10592,
10593,
10946,
10947,
10996,
11196,
11197,
11239,
11367,
11368,
11409,
11745,
11746,
11788,
11880,
11881,
12171,
12172,
12218,
12380,
12381,
12420,
12621,
12622,
12675,
12865,
12866,
12917,
13238,
13239,
13295,
13563,
13564,
13609,
13794,
13795,
13839,
14139,
14140,
14194,
14412,
14413,
14448,
14569,
14570,
14600,
14832,
14833,
15083,
15084,
15121,
15328,
15329,
15540,
15541,
15597,
15900,
15901,
16118,
16119,
16155,
16440,
16441,
16507,
16730,
16731,
16796,
16987,
16988,
17165,
17166,
17202,
17488,
17489,
17550,
17717,
17718,
17788,
18107,
18108,
18170,
18597,
18598,
18629,
18857,
18858,
18895,
19147,
19148,
19182,
19322,
19323,
19350,
19630,
19631,
19680,
19869,
19870,
19913,
20149,
20150,
20197,
20905,
20906,
20972,
21124,
21125,
21151,
21419,
21420,
21445,
21723,
21724,
21793,
21876,
21877,
22163,
22164,
22231,
22458,
22459,
22498,
22708,
22709,
22781,
22981,
22982,
23033,
23225,
23226,
23269,
23464,
23465,
23497,
23644,
23645,
23896,
23897,
23947,
23998,
23999,
24054,
24229,
24230,
24274,
24381,
24382,
24453,
24640,
24641,
24673,
24905,
24906,
24955,
25147,
25148,
25197,
25410,
25411,
25445,
25730,
25731,
25781,
26072,
26073,
26107,
26263,
26264,
26298,
26429,
26430,
26473,
26580,
26581,
26607,
26739,
26740,
26797,
27039,
27040,
27315,
27316,
27351,
27430,
27431,
27478,
27728,
27729,
27759,
27989,
27990,
28082,
28293,
28294,
28328,
28611,
28612,
28654,
28926,
28927,
28973,
29265,
29266,
29313,
29672,
29673,
29797,
29798,
29834,
29978,
29979,
30017,
30278,
30279,
30329,
30582,
30583,
30625,
30778,
30779,
30813,
31042,
31043,
31091,
31283,
31284,
31325,
31554,
31555,
31892,
31893,
31925,
32057,
32058,
32103,
32185,
32186,
32221,
32558,
32559,
32594,
32726,
32727,
32762,
32940,
32941,
32968,
33135,
33136,
33170,
33379,
33380,
33413,
33616,
33617,
33662,
34020,
34021,
34250,
34251,
34293,
34497,
34498,
34835,
34836,
34883,
35018,
35019,
35074,
35359,
35360,
35412,
35540,
35541,
35601,
35956,
35957,
36005,
36200,
36201,
36457,
36458,
36742,
36743,
36788,
36890,
36891,
36927,
37111,
37112,
37180,
37438,
37439,
37496,
37839,
37840,
37878,
38061,
38062,
38102,
38247,
38248,
38293,
38745,
38746,
38796,
39331,
39332,
39382,
39601,
39602,
39801,
39802,
40067,
40068,
40099,
40417,
40418,
40476,
40700,
40701,
40742,
40896,
40897,
41164,
41165,
41214,
41314,
41315,
41475,
41476,
41541,
41678,
41679,
41972,
41973,
42008,
42236,
42237,
42554,
42555,
42609,
43040,
43041,
43070,
43315,
43316,
43374,
43717,
43718,
43745,
43799,
43800,
43853,
44078,
44079,
44439,
44440,
44797,
44798,
44839,
45094,
45095,
45124,
45241,
45242,
45422,
45423,
45632,
45633,
45681,
45924,
45925,
45963,
46196,
46197,
46522,
46523,
46556,
46837,
46838,
46875,
47113,
47114,
47144,
47272,
47273,
47317,
47586,
47587,
47626,
47854,
47855,
47885,
48124,
48125,
48169,
48331,
48332,
48372,
48562,
48563,
48615,
48779,
48780,
48827,
49088,
49089,
49431,
49432,
49466,
49753,
49754,
49795,
50020,
50021,
50056,
50358,
50359,
50388,
50564,
50565,
50611,
50779,
50780,
50819,
50978,
50979,
51012,
51280,
51281,
51557,
51558,
51621,
51778,
51779,
51825,
52012,
52013,
52064,
52172,
52173,
52224,
52533,
52534,
52574,
52905,
52906,
52950,
53281,
53282,
53325,
53571,
53572,
53639,
53937,
53938,
53939,
54013,
54014,
54034,
54035,
54036,
54050
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 54050,
"ccnet_original_nlines": 587,
"rps_doc_curly_bracket": 0.009805739857256413,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.06540931016206741,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03210273012518883,
"rps_doc_frac_lines_end_with_ellipsis": 0.003401360008865595,
"rps_doc_frac_no_alph_words": 0.47841089963912964,
"rps_doc_frac_unique_words": 0.3461364805698395,
"rps_doc_mean_word_length": 5.697695255279541,
"rps_doc_num_sentences": 645,
"rps_doc_symbol_to_word_ratio": 0.013242379762232304,
"rps_doc_unigram_entropy": 6.836704730987549,
"rps_doc_word_count": 6639,
"rps_doc_frac_chars_dupe_10grams": 0.017130620777606964,
"rps_doc_frac_chars_dupe_5grams": 0.095645971596241,
"rps_doc_frac_chars_dupe_6grams": 0.0613318495452404,
"rps_doc_frac_chars_dupe_7grams": 0.04726782068610191,
"rps_doc_frac_chars_dupe_8grams": 0.03486926853656769,
"rps_doc_frac_chars_dupe_9grams": 0.025378700345754623,
"rps_doc_frac_chars_top_2gram": 0.01424907986074686,
"rps_doc_frac_chars_top_3gram": 0.0018505300395190716,
"rps_doc_frac_chars_top_4gram": 0.0016919099725782871,
"rps_doc_books_importance": -5363.8115234375,
"rps_doc_books_importance_length_correction": -5363.8115234375,
"rps_doc_openwebtext_importance": -3181.004638671875,
"rps_doc_openwebtext_importance_length_correction": -3181.004638671875,
"rps_doc_wikipedia_importance": -2434.12548828125,
"rps_doc_wikipedia_importance_length_correction": -2434.12548828125
},
"fasttext": {
"dclm": 0.16686254739761353,
"english": 0.05888383835554123,
"fineweb_edu_approx": 2.5992255210876465,
"eai_general_math": 0.3194587826728821,
"eai_open_web_math": 0.10895025730133057,
"eai_web_code": 0.9677199125289917
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"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
|
-295,115,395,523,557,950 |
Docker
Last update: Edit
1 Introduction
This page explains how to build a Docker image from your Mendix Project. Each release of a project will result in a unique Docker image that can be pushed through the different stages of your application pipeline.
You will learn how to do the following:
• Build the image
• Push the image
2 Prerequisites
Before starting these instructions, make sure you have completed the following prerequisites:
3 Building the Image
To build the Docker image, follow these steps:
1. Install Docker on your computer.
2. Restart the computer to ensure that you have been granted access to Docker.
3. Unzip the buildpack into a location of your choice.
4. Open the Command Prompt and navigate to the folder where you unzipped the buildpack.
5. Open your app project in Studio Pro and select the menu option App > Show App Directory in Explorer:
6. Copy the project folder and all its subfolders to the unzipped docker build folder. The project folder needs to be in the same folder as the Docker file, otherwise Docker cannot access it.
7. Execute the following command:
docker build --build-arg BUILD_PATH="{relative-mendix-project-location}" -t {image name} .
{relative-mendix-project-location} is the BUILD_PATH which indicates where the application model is located. It is the directory where your .MPR file is located after you copied the project into the docker build folder. If you do not specify it, it defaults to ./project.
A successful build will resemble the output shown below:
4 Pushing the Image
A new Docker image has been created with the name ({image name}) you gave it. You can see the image by using the command docker images.
Next, you need to push the image to a registry. This can be a public registry or your own. To push it to your own registry, use the command docker push {image name}.
5 Read More
|
{
"url": "https://docs.mendix.com/developerportal/deploy/docker-deploy",
"source_domain": "docs.mendix.com",
"snapshot_id": "crawl=CC-MAIN-2021-25",
"warc_metadata": {
"Content-Length": "16982",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O7JO2MLSD3MZ5XOZS5JUZXLUWJKESA77",
"WARC-Concurrent-To": "<urn:uuid:1d2d6cb4-6149-453f-9095-be8503267b02>",
"WARC-Date": "2021-06-21T23:33:51Z",
"WARC-IP-Address": "99.84.105.13",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JHLN6FTTSDE57VVINWNS3IXMK3WQQMWD",
"WARC-Record-ID": "<urn:uuid:2b7d9243-9161-4175-9fc3-49638fcf2fd6>",
"WARC-Target-URI": "https://docs.mendix.com/developerportal/deploy/docker-deploy",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:310aeb98-506c-4d1f-83ef-310c108ee70f>"
},
"warc_info": "isPartOf: CC-MAIN-2021-25\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-177.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,
7,
8,
26,
27,
42,
43,
257,
258,
298,
299,
319,
338,
339,
355,
356,
450,
451,
472,
473,
520,
521,
559,
640,
697,
787,
893,
894,
1088,
1089,
1125,
1126,
1221,
1226,
1227,
1503,
1504,
1565,
1566,
1586,
1587,
1723,
1724,
1890,
1891
],
"line_end_idx": [
7,
8,
26,
27,
42,
43,
257,
258,
298,
299,
319,
338,
339,
355,
356,
450,
451,
472,
473,
520,
521,
559,
640,
697,
787,
893,
894,
1088,
1089,
1125,
1126,
1221,
1226,
1227,
1503,
1504,
1565,
1566,
1586,
1587,
1723,
1724,
1890,
1891,
1902
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1902,
"ccnet_original_nlines": 44,
"rps_doc_curly_bracket": 0.005257620010524988,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.380952388048172,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013227510266005993,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.190476194024086,
"rps_doc_frac_unique_words": 0.4583333432674408,
"rps_doc_mean_word_length": 4.70192289352417,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.4483723640441895,
"rps_doc_word_count": 312,
"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.03271983936429024,
"rps_doc_frac_chars_top_3gram": 0.01635991968214512,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -175.05963134765625,
"rps_doc_books_importance_length_correction": -175.05946350097656,
"rps_doc_openwebtext_importance": -96.64073181152344,
"rps_doc_openwebtext_importance_length_correction": -96.64073181152344,
"rps_doc_wikipedia_importance": -85.49261474609375,
"rps_doc_wikipedia_importance_length_correction": -85.49261474609375
},
"fasttext": {
"dclm": 0.3289199471473694,
"english": 0.8869974613189697,
"fineweb_edu_approx": 2.7478561401367188,
"eai_general_math": 0.4156898260116577,
"eai_open_web_math": 0.18077999353408813,
"eai_web_code": 0.5365127325057983
}
}
|
{
"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.028",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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
|
6,041,666,390,956,563,000 |
Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required.
I have a few checkboxes coming from nested model (:admin accepts_nested_attributes_for :account_setting). By default, the label for the checkbox is generated from the model's attributes. But I want to use custom labels which I store in the locales folder as key value pairs.
This is the code,
= semantic_form_for(resource, :as => resource_name, :url => registration_path(resource_name), :validate => true, :html => { :method => :put }) do |f|
= f.input :email
= f.inputs :receive_email_digest, :as =>:check_boxes, :for => :account_setting, :label => 'My custom label'
And it does not work. I tried :input_html, :member_label.
Does formtastic suppor this? Or do we have to hack it?
share|improve this question
1 Answer 1
up vote 1 down vote accepted
inputs is a fieldset. You're telling formtastic to make a fieldset and ordered list with one list item and input, :receive_email_digest, which I presume is a boolean. The :as here is not really having any effect, and :check_boxes is for has_many associations.
You want something like:
= semantic_form_for(resource, :as => resource_name, :url => registration_path(resource_name), :validate => true, :html => { :method => :put }) do |f|
= f.inputs do
= f.input :email
= f.inputs :for => :account_setting do
= f.input :receive_email_digest, :label => 'My custom label'
which will render two fieldsets each with a single input. Or perhaps even:
= semantic_form_for(resource, :as => resource_name, :url => registration_path(resource_name), :validate => true, :html => { :method => :put }) do |f|
= f.inputs "Email Settings" do
= f.input :email
= f.semantic_fields_for :account_setting do |ff|
= ff.input :receive_email_digest, :label => 'My custom label'
The semantic fields for here is merely a scope and shouldn't output any markup.
I believe both of these will use en.formtastic.labels.<resource_name>.account_setting.receive_email_digest for the check box's label, where resource name is whatever your resource's underscored name is. Check out the formtastic source for how these keys are generated.
share|improve this answer
Second solution worked. Thank you. – Rahul Jan 31 '12 at 22:43
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/8091170/assign-custom-labels-to-checkboxes-using-formtastic/8699621",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-14",
"warc_metadata": {
"Content-Length": "68505",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:C3UWLXUD4CQT6WN4G3MJLFMM2DEGKGIP",
"WARC-Concurrent-To": "<urn:uuid:50d66454-ca64-4a07-bd81-9d6194dae60c>",
"WARC-Date": "2015-03-29T06:28:30Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:I4O33Z4CVPJ4XPFQNR3HYODFEWZOL557",
"WARC-Record-ID": "<urn:uuid:98aaba4e-1250-4ada-83e3-046af4872599>",
"WARC-Target-URI": "http://stackoverflow.com/questions/8091170/assign-custom-labels-to-checkboxes-using-formtastic/8699621",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fde49a05-3073-4a1e-a875-cd9a2ffcd36e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-168-14-71.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-14\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
157,
158,
433,
434,
452,
453,
454,
604,
623,
733,
734,
792,
793,
848,
849,
877,
878,
889,
890,
919,
920,
1180,
1181,
1206,
1207,
1357,
1373,
1394,
1435,
1500,
1501,
1576,
1577,
1727,
1760,
1781,
1834,
1902,
1903,
1983,
1984,
2253,
2254,
2280,
2285,
2349,
2350,
2362,
2363,
2365,
2373,
2374,
2452,
2453
],
"line_end_idx": [
25,
157,
158,
433,
434,
452,
453,
454,
604,
623,
733,
734,
792,
793,
848,
849,
877,
878,
889,
890,
919,
920,
1180,
1181,
1206,
1207,
1357,
1373,
1394,
1435,
1500,
1501,
1576,
1577,
1727,
1760,
1781,
1834,
1902,
1903,
1983,
1984,
2253,
2254,
2280,
2285,
2349,
2350,
2362,
2363,
2365,
2373,
2374,
2452,
2453,
2543
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2543,
"ccnet_original_nlines": 55,
"rps_doc_curly_bracket": 0.00235942006111145,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2747252583503723,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010989010334014893,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3479853570461273,
"rps_doc_frac_unique_words": 0.5313432812690735,
"rps_doc_mean_word_length": 5.543283462524414,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.884502410888672,
"rps_doc_word_count": 335,
"rps_doc_frac_chars_dupe_10grams": 0.16262789070606232,
"rps_doc_frac_chars_dupe_5grams": 0.20140011608600616,
"rps_doc_frac_chars_dupe_6grams": 0.16262789070606232,
"rps_doc_frac_chars_dupe_7grams": 0.16262789070606232,
"rps_doc_frac_chars_dupe_8grams": 0.16262789070606232,
"rps_doc_frac_chars_dupe_9grams": 0.16262789070606232,
"rps_doc_frac_chars_top_2gram": 0.00484653003513813,
"rps_doc_frac_chars_top_3gram": 0.05977382883429527,
"rps_doc_frac_chars_top_4gram": 0.06462036073207855,
"rps_doc_books_importance": -272.1572570800781,
"rps_doc_books_importance_length_correction": -272.1572570800781,
"rps_doc_openwebtext_importance": -187.04454040527344,
"rps_doc_openwebtext_importance_length_correction": -187.04454040527344,
"rps_doc_wikipedia_importance": -141.45635986328125,
"rps_doc_wikipedia_importance_length_correction": -141.45635986328125
},
"fasttext": {
"dclm": 0.40545719861984253,
"english": 0.835371196269989,
"fineweb_edu_approx": 1.6459647417068481,
"eai_general_math": 0.0005083699943497777,
"eai_open_web_math": 0.05128264054656029,
"eai_web_code": 0.0004466199898160994
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.436",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,322,721,132,848,455,700 |
std::algorithm
algorithm
STL¤Î¥³¥ó¥Æ¥Ê¤òÂоݤȤ·¤¿ÍÍ¡¹¤Ê¥¢¥ë¥´¥ê¥º¥à¤¬ÄêµÁ¤µ¤ì¤Æ¤¤¤ë¡¥ ³Æ´Ø¿ô¤Ï¥³¥ó¥Æ¥Ê¤Ç¤Ê¤¯½¾Íè¤ÎÇÛÎó¤Ç¤â»È¤¨¤ë¤è¤¦¤Ë¤Ê¤Ã¤Æ¤¤¤ë(È¿Éü»Ò¤ÎÂå¤ï¤ê¤Ë¥Ý¥¤¥ó¥¿¤òÅϤ»¤Ð¤è¤¤)¡¥
#include <algorithm>
¥½¡¼¥È
¥½¡¼¥È(sort, stable_sort)
template <class RandomAccessIterator>
void sort(RandomAccessIterator first, RandomAccessIterator last);
template <class RandomAccessIterator, class Compare>
void sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
sort¤Ï[first,last)¤ÎÈϰϤÎÍ×ÁǤòÃͤξº½ç¤Ç¥½¡¼¥È¤¹¤ë¡¥¥Ç¥Õ¥©¥ë¥È¤Ç¤Ï¥ª¥Ú¥ì¡¼¥¿"<"¤ÇÈæ³Ó¤µ¤ì¡¤ Èæ³ÓÊýË¡¤ò¼«Ê¬¤Ç»ØÄꤷ¤¿¤¤¾ì¹ç¤Ï2ÈÖÌܤÎÄêµÁ¤ò»È¤¦¡¥ sort¤Ç¤ÏÃͤ¬Æ±¤¸¤À¤Ã¤¿¤È¤¤Ë¸µ¤Î½çÈ֤ˤʤ뤳¤È¤ÏÊݾڤµ¤ì¤Æ¤¤¤Ê¤¤(¤¤¤ï¤æ¤ë°ÂÄê¤Ê¥½¡¼¥È¤Ç¤Ï¤Ê¤¤)¡¥
template <class RandomAccessIterator>
void stable_sort(RandomAccessIterator first, RandomAccessIterator last);
template <class RandomAccessIterator, class Compare>
void stable_sort(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
stable_sort¤Ïsort¤ÈƱ¤¸¤¯Í×ÁǤòʤÓÂؤ¨¤ë¤â¤Î¤Ç¤¢¤ë¤¬¡¤Ãͤ¬Æ±¤¸Í×ÁǤθµ¤Î½çÈÖ¤ÏÊݸ¤µ¤ì¤ë¡¥
¥³¡¼¥ÉÎã
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
#include <cstdlib>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
struct vec2
{
int x, y;
};
inline std::ostream &operator<<(std::ostream &out, const vec2 &a)
{
return out << "(" << a.x << ", " << a.y << ")";
}
bool comp_vec2(vec2 a, vec2 b)
{
return a.x < b.x;
}
int main(void)
{
const int N = 10;
srand(1234567);
vector<int> a(N);
vec2 b[N];
for(int i = 0; i < N; ++i){
a[i] = rand()%10;
b[i].x = rand()%5;
b[i].y = rand()%10;
}
cout << "a : ";
for(int i = 0; i < N; ++i) cout << a[i] << (i == N-1 ? "" : ", ");
cout << endl;
cout << "b : ";
for(int i = 0; i < N; ++i) cout << b[i] << (i == N-1 ? "" : ", ");
cout << endl;
sort(a.begin(), a.end());
stable_sort(b, b+N, comp_vec2);
cout << "a : ";
for(int i = 0; i < N; ++i) cout << a[i] << (i == N-1 ? "" : ", ");
cout << endl;
cout << "b : ";
for(int i = 0; i < N; ++i) cout << b[i] << (i == N-1 ? "" : ", ");
cout << endl;
return 0;
}
¼Â¹Ô·ë²Ì
a : 0, 4, 2, 6, 0, 9, 7, 8, 7, 5
b : (1, 0), (3, 3), (4, 5), (1, 6), (0, 6), (3, 7), (1, 9), (4, 1), (1, 3), (4, 4)
a : 0, 0, 2, 4, 5, 6, 7, 7, 8, 9
b : (0, 6), (1, 0), (1, 6), (1, 9), (1, 3), (3, 3), (3, 7), (4, 5), (4, 1), (4, 4)
Éôʬ¥½¡¼¥È(partial_sort, partial_sort_copy)
template <class RandomAccessIterator>
void partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last);
template <class RandomAccessIterator, class Compare>
void partial_sort(RandomAccessIterator first, RandomAccessIterator middle, RandomAccessIterator last, Compare comp);
ÈÏ°Ï[first, last)¤ÎÍ×ÁǤò¥½¡¼¥È¤¹¤ë¡¥¤¿¤À¤·¡¤¥½¡¼¥È·ë²Ì¤¬½ñ¤¹þ¤Þ¤ì¤ë¤Î¤Ï[first, middle)¤ÎÈϰϤΤߤǡ¤ ¤½¤ì°Ê¹ß¤ÎÍ×ÁǤνçÈ֤ϥ½¡¼¥È¤µ¤ì¤Æ¤¤¤Ê¤¤¡¥¥³¥ó¥Æ¥ÊÃæ¤ÎÉôʬŪ¤ÊÈϰϤÀ¤±¤Ç¥½¡¼¥È¤¹¤ë¤Î¤Ç¤Ï¤Ê¤¯¡¤ Á´ÂΤǥ½¡¼¥È¤·¤Æ¤½¤ÎÅÓÃæ(middle)¤ÇÂǤÁÀÚ¤ë¤è¤¦¤Ê½èÍý¡¥
partial_sort¤Ï[first, last)¤Ë·ë²Ì¤ò¾å½ñ¤¤¹¤ë¤¬¡¤°Û¤Ê¤ë¥³¥ó¥Æ¥Ê¤Ë¥³¥Ô¡¼¤·¤¿¤¤¾ì¹ç¤Ïpartial_sort_copy¤òÍѤ¤¤ë¡¥
template <class InputIterator, class RandomAccessIterator>
RandomAccessIterator partial_sort_copy(InputIterator first,InputIterator last,
RandomAccessIterator result_first, RandomAccessIterator result_last);
template <class InputIterator, class RandomAccessIterator, class Compare>
RandomAccessIterator partial_sort_copy(InputIterator first,InputIterator last,
RandomAccessIterator result_first, RandomAccessIterator result_last,
Compare comp);
[first, last)¤Î¥µ¥¤¥º >= [result_first,result_last)¤Î¥µ¥¤¥º¤Ç¤¢¤ë¡¥
¥³¡¼¥ÉÎã
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
#include <cstdlib>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void)
{
const int N = 10;
srand(1234567);
vector<int> a(N), b(N);
vector<int> c(N/2);
for(int i = 0; i < N; ++i){
a[i] = b[i] = rand()%10;
}
cout << "a,b : ";
for(int i = 0; i < N; ++i) cout << a[i] << (i == N-1 ? "" : ", ");
cout << endl;
partial_sort(a.begin(), a.begin()+5, a.end());
cout << " a : ";
for(int i = 0; i < N; ++i) cout << a[i] << (i == N-1 ? "" : ", ");
cout << endl;
partial_sort_copy(b.begin(), b.end(), c.begin(), c.end());
cout << " c : ";
for(vector<int>::iterator i = c.begin(); i != c.end(); ++i) cout << *i << (i == c.end()-1 ? "" : ", ");
cout << endl;
return 0;
}
¼Â¹Ô·ë²Ì
a,b : 0, 1, 0, 4, 3, 3, 2, 4, 5, 6
a : 0, 0, 1, 2, 3, 4, 3, 4, 5, 6
c : 0, 0, 1, 2, 3
sort(a.begin(), a.begin()+5)¤Ë¤·¤¿¾ì¹ç¤Ï¡¤
a,b : 0, 1, 0, 4, 3, 3, 2, 4, 5, 6
a : 0, 0, 1, 3, 4, 3, 2, 4, 5, 6
c : 0, 0, 1, 2, 3
¤È¤Ê¤ë¡¥
ºÆÇÛÃÖ(nth_element)
template <class RandomAccessIterator>
void nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last);
template <class RandomAccessIterator, class Compare>
void nth_element(RandomAccessIterator first, RandomAccessIterator nth, RandomAccessIterator last, Compare comp);
ÈÏ°Ï[first, last)¤ÎÍ×ÁǤΤ¦¤Á¡¤nth¤Ç¼¨¤µ¤ì¤ëÍ×ÁǤÎÃͤè¤ê¾®¤µ¤¤Ãͤò»ý¤ÄÍ×ÁǤÏnth¤ÎÁ°¤Ë¡¤Â礤¤Ãͤò»ý¤ÄÍ×ÁǤÏnth¤Î¸å¤ËÃÖ¤«¤ì¤ë¡¥ºÆÇÛÃÖ¸å¤ÎÍ×ÁǤνçÈÖ¤ÏÊݾڤµ¤ì¤Ê¤¤¡¥
¥³¡¼¥ÉÎã
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
#include <cstdlib>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void)
{
const int N = 10;
srand(12345);
vector<int> a(N);
for(int i = 0; i < N; ++i){
a[i] = rand()%10;
}
cout << "a : ";
for(int i = 0; i < N; ++i) cout << a[i] << (i == N-1 ? "" : ", ");
cout << endl;
nth_element(a.begin(), a.begin()+3, a.end());
cout << "a : ";
for(int i = 0; i < N; ++i) cout << a[i] << (i == N-1 ? "" : ", ");
cout << endl;
return 0;
}
¼Â¹Ô·ë²Ì(Visual Studio 2010)
a : 4, 4, 5, 5, 8, 5, 7, 3, 2, 4
a : 2, 3, 4, 4, 4, 5, 5, 5, 7, 8
¥Ò¡¼¥×¥½¡¼¥È(sort_heap, make_heap, pop_heap, push_heap)
template <class RandomAccessIterator>
void sort_heap(RandomAccessIterator first, RandomAccessIterator last);
template <class RandomAccessIterator, class Compare>
void sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
¥Ò¡¼¥×¹½Â¤¤ò»ý¤Ä¥³¥ó¥Æ¥Ê[first, last)¤ò¥Ò¡¼¥×¥½¡¼¥È¤Ë¤è¤ê¥½¡¼¥È¤¹¤ë¡¥ ¥Ò¡¼¥×¤È¤Ï¿Æ¥Î¡¼¥É¤¬¾ï¤Ë»Ò¥Î¡¼¥É¤è¤êÂ礤¤(or¾®¤µ¤¤)¥Ä¥ê¡¼¤Î¤³¤È¤Ç¤¢¤ê¡¤ ñ¤Ë¥Ò¡¼¥×¤È¸Æ¤ó¤À¾ì¹ç¡¤¥Ð¥¤¥Ê¥ê¥Ä¥ê¡¼(¥Ð¥¤¥Ê¥ê¥Ò¡¼¥×¡¤Æóʬ¥Ò¡¼¥×)¤ò»Ø¤¹¤³¤È¤¬Â¿¤¤¡¥ ¥ë¡¼¥È¥Î¡¼¥É¤Ï¾ï¤ËºÇÂçÃͤ⤷¤¯¤ÏºÇ¾®Ãͤò»ý¤ÄÍ×ÁǤˤʤ롥 ¤½¤Î¤¿¤á¡¤¥ë¡¼¥È¥Î¡¼¥É¤ò¼è¤ê½Ð¤·¤Æ¤¤¤¯¤³¤È¤Ç¥½¡¼¥È¤ò¹Ô¤¦¤³¤È¤¬¤Ç¤¤ë(¥Ò¡¼¥×¥½¡¼¥È,O(N log N))¡¥
¥Ò¡¼¥×¹½Â¤¤òºîÀ®¤¹¤ë¤¿¤á¤Î´Ø¿ô¤È¤·¤Æmake_heap¤¬ÍÑ°Õ¤µ¤ì¤Æ¤¤¤ë¡¥
template <class RandomAccessIterator>
void make_heap(RandomAccessIterator first, RandomAccessIterator last);
template <class RandomAccessIterator, class Compare>
void make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
¥Ò¡¼¥×¤ÏÇÛÎóÆâ¤Ë²¼¿Þ¤Î¤è¤¦¤Ë³ÊǼ¤µ¤ì¤ë¡¥
binary_tree.jpg
¤½¤Î¤¿¤á¡¤front()¤òÍѤ¤¤ë¤³¤È¤Ç¥ë¡¼¥È¥Î¡¼¥É¤ò»²¾È¤¹¤ë¤³¤È¤¬¤Ç¤¤ë¡¥
¤Þ¤¿¡¤¥Ò¡¼¥×¤«¤é¤ÎÍ×ÁǤμè¤ê½Ð¤·¡¤ÁÞÆþ´Ø¿ô(pop_heap, push_heap)¤â¤¢¤ë¡¥
template <class RandomAccessIterator>
void pop_heap(RandomAccessIterator first, RandomAccessIterator last);
template <class RandomAccessIterator, class Compare>
void pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
template <class RandomAccessIterator>
void push_heap(RandomAccessIterator first, RandomAccessIterator last);
template <class RandomAccessIterator, class Compare>
void push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
pop_heap¤Ïfirst¤òlast-1¤Ë°ÜÆ°¤·¤Æ¡¤¤½¤ì°Ê³°¤ÎÍ×ÁǤǥҡ¼¥×¤òºÆ¹½À®¤¹¤ë¡¥¤½¤Î¤¿¤á¡¤
pop_heap(a.begin(), a.end());
a.pop_back()
¤È¤¹¤ë¤³¤È¤Ç¼ÂºÝ¤ËÃͤ¬¼è¤ê½Ð¤µ¤ì¤ë¡¥push_heap¤Î¾ì¹ç¤ÏµÕ¤Ç¡¤
a.push_back(100);
push_heap(a.begin(), a.end());
¤È¤Ê¤ë¡¥¤Ä¤Þ¤ê¡¤push_heap¤Ïlast-1¤ÎÍ×ÁǤò¥Ò¡¼¥×¤Ë¿·¤·¤¯Äɲ乤롥 ¤³¤ì¤é¤Ë¤è¤ê¡¤push_back¤äpop_back¤À¤±¤Î¾ì¹ç¤È°ã¤¤¡¤¼è¤ê½Ð¤·¡¤ÁÞÆþ¸å¤â¥Ò¡¼¥×¹½Â¤¤¬Êݤ¿¤ì¤ë¡¥
¥³¡¼¥ÉÎã
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
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void)
{
const int N = 10;
vector<int> a(N);
for(int i = 0; i < N; ++i){
a[i] = i+1;
}
random_shuffle(a.begin(), a.end());
cout << "a : ";
for(int i = 0; i < N; ++i) cout << a[i] << (i == N-1 ? "" : ", ");
cout << endl;
make_heap(a.begin(), a.end());
cout << "a : ";
for(int i = 0; i < N; ++i) cout << a[i] << (i == N-1 ? "" : ", ");
cout << endl;
sort_heap(a.begin(), a.end());
cout << "a : ";
for(int i = 0; i < N; ++i) cout << a[i] << (i == N-1 ? "" : ", ");
cout << endl;
return 0;
}
¼Â¹Ô·ë²Ì
a : 9, 2, 10, 3, 1, 6, 8, 4, 5, 7
a : 10, 7, 9, 5, 2, 6, 8, 4, 3, 1
a : 1, 2, 3, 4, 5, 6, 7, 8, 9, 10
¿¿¤óÃæ¤Î·ë²Ì¤ò¿Þ¤Ë¤·¤Æ³Îǧ¤¹¤ë¤È°Ê²¼¤Î¤è¤¦¤Ë¤Ê¤ë¡¥
binary_tree2.jpg
¥½¡¼¥È¤Î·×»»»þ´Ö
¥½¡¼¥È¤Î·×»»»þ´Ö¤Ï´Ä¶¤Ë¤è¤ë¤È»×¤¤¤Þ¤¹¤¬¡¤ °ìÈÌŪ¤Ë¤Ïnth_element < sort == partial_sort < stable_sort¤À¤È»×¤ï¤ì¤Þ¤¹¡¥ sort¤Ë¤Ï¥¯¥¤¥Ã¥¯¥½¡¼¥È¤¬ÍѤ¤¤é¤ì¤Æ¤¤¤ë¤Î¤Ç·×»»»þ´Ö¤ÏO(N log N) ¡Á O(N^2)¤Ç¤¹¡¥
Visual Studio 2010¤Ç¼ÂÁõ¤·¤Æ·×¬¤·¤¿·ë²Ì¤ò°Ê²¼¤Ë¼¨¤·¤Þ¤¹¡¥
¼ÂÁõ¥³¡¼¥É
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
#include <ctime>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void)
{
int n = 10000;
clock_t t1, t2;
vector<int> a;
ofstream fo;
fo.open("time.txt");
for(int k = 0; k < 4; ++k){
fo << n << ", ";
a.resize(n);
for(int i = 0; i < n; ++i){
a[i] = n;
}
random_shuffle(a.begin(), a.end());
t1 = clock();
sort(a.begin(), a.end());
t2 = clock();
fo << (double)(t2-t1)/CLOCKS_PER_SEC << ", ";
random_shuffle(a.begin(), a.end());
t1 = clock();
stable_sort(a.begin(), a.end());
t2 = clock();
fo << (double)(t2-t1)/CLOCKS_PER_SEC << ", ";
random_shuffle(a.begin(), a.end());
t1 = clock();
partial_sort(a.begin(), a.begin()+n/2, a.end());
t2 = clock();
fo << (double)(t2-t1)/CLOCKS_PER_SEC << ", ";
random_shuffle(a.begin(), a.end());
t1 = clock();
nth_element(a.begin(), a.begin()+n/2, a.end());
t2 = clock();
fo << (double)(t2-t1)/CLOCKS_PER_SEC << endl;
n *= 10;
}
fo.close();
return 0;
}
¼Â¹Ô·ë²Ì
sort_time.jpg
partial_sort¤¬¤«¤Ê¤êÃÙ¤¯¤Ê¤Ã¤Æ¤¤¤Þ¤¹¡¥Visual Studio¤Ç¤Ïpartial_sort¤ÎÃæ¿È¤Ïstable_sort¤Ë¤Ê¤Ã¤Æ¤¤¤ë¤Î¤«¤â¤·¤ì¤Þ¤»¤ó¡¥
¸¡º÷
Ã͸¡º÷(find,find_if,find_first_of)
• find
template <class InputIterator, class T>
InputIterator find(InputIterator first, InputIterator last, const T& value);
[first, last)Æ⤫¤évalue¤ÈƱ¤¸Ãͤò»ý¤ÄºÇ½é¤ÎÍ×ÁǤΥ¤¥Æ¥ì¡¼¥¿¤òÊÖ¤¹¡¥
• find_if
template <class InputIterator, class Predicate>
InputIterator find_if(InputIterator first, InputIterator last, Predicate pred);
[first, last)Æ⤫¤éÈæ³Ó´Ø¿ôpred¤¬¿¿¤È¤Ê¤ëºÇ½é¤ÎÍ×ÁǤΥ¤¥Æ¥ì¡¼¥¿¤òÊÖ¤¹¡¥
• find_first_of
template <class ForwardIterator1, class ForwardIterator2>
ForwardIterator1 find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
ForwardIterator2 first2, ForwardIterator2 last2);
template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
ForwardIterator1 find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
ForwardIterator2 first2, ForwardIterator2 last2,
BinaryPredicate pred);
[first1, last1)Æ⤫¤é[first2, last2)Æâ¤ÎǤ°Õ¤ÎÍ×ÁǤ˰ìÃפ¹¤ëºÇ½é¤ÎÍ×ÁǤΥ¤¥Æ¥ì¡¼¥¿¤òÊÖ¤¹¡¥
¥·¡¼¥±¥ó¥¹¸¡º÷(search, find_end)
• search
template <class ForwardIterator1, class ForwardIterator2>
ForwardIterator1 search(ForwardIterator1 first1, ForwardIterator1 last1,
ForwardIterator2 first2, ForwardIterator2 last2);
template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
ForwardIterator1 search(ForwardIterator1 first1, ForwardIterator1 last1,
ForwardIterator2 first2, ForwardIterator2 last2,
BinaryPredicate pred);
[first1, last1)Æ⤫¤é[first2, last2)¤Î¥·¡¼¥±¥ó¥¹¤Ë°ìÃפ¹¤ëÉôʬ¤òºÇ½é¤«¤é¸¡º÷¤·¡¤ ¸«¤Ä¤«¤Ã¤¿°ÌÃ֤κǽé(first2¤Ë°ìÃפ¹¤ëÍ×ÁÇ)¤Î¥¤¥Æ¥ì¡¼¥¿¤òÊÖ¤¹¡¥
• find_end
template <class ForwardIterator1, class ForwardIterator2>
ForwardIterator1 find_end(ForwardIterator1 first1, ForwardIterator1 last1,
ForwardIterator2 first2, ForwardIterator2 last2);
template <class ForwardIterator1, class ForwardIterator2, class BinaryPredicate>
ForwardIterator1 find_end(ForwardIterator1 first1, ForwardIterator1 last1,
ForwardIterator2 first2, ForwardIterator2 last2,
BinaryPredicate pred);
[first1, last1)Æ⤫¤é[first2, last2)¤Î¥·¡¼¥±¥ó¥¹¤Ë°ìÃפ¹¤ëÉôʬ¤òºÇ¸å¤«¤é¸¡º÷¤·¡¤ ¸«¤Ä¤«¤Ã¤¿°ÌÃ֤κǽé(first2¤Ë°ìÃפ¹¤ëÍ×ÁÇ)¤Î¥¤¥Æ¥ì¡¼¥¿¤òÊÖ¤¹¡¥
Ϣ³¤¹¤ëÍ×ÁǤθ¡º÷(adjacent_find, search_n)
• adjacent_find
template <class ForwardIterator>
ForwardIterator adjacent_find(ForwardIterator first, ForwardIterator last);
template <class ForwardIterator, class BinaryPredicate>
ForwardIterator adjacent_find(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
[first, last)Æ⤫¤éƱ¤¸Ãͤò»ý¤ÄÍ×ÁǤ¬Ï¢Â³¤·¤Æ¤¤¤ëºÇ½é¤Î°ÌÃÖ¤òÊÖ¤¹¡¥
• search_n
template <class ForwardIterator, class Size, class T>
ForwardIterator search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value);
template <class ForwardIterator, class Size, class T, class BinaryPredicate>
ForwardIterator search_n(ForwardIterator first, ForwardIterator last, Size count, const T& value,
BinaryPredicate pred);
[first1, last1)Æ⤫¤évalue¤¬count²óϢ³¤Ç³¤¯ºÇ½é¤Î°ÌÃÖ¤òÊÖ¤¹¡¥Î㤨¤Ð¡¤
1
2
int a[] = {1, 3, 3, 8, 8, 5};
cout << search_n(a, a+6, 2, 8)-a << endl;
¤Î¾ì¹ç¡¤·ë²Ì¤Ï"3"¤È¤Ê¤ë¡¥
Ϣ³¤·¤Ê¤¤Í×ÁǤθ¡º÷(mismatch)
• mismatch
template <class InputIterator1, class InputIterator2>
pair<InputIterator1, InputIterator2> mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);
template <class InputIterator1, class InputIterator2, class BinaryPredicate>
pair<InputIterator1, InputIterator2> mismatch(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2,
BinaryPredicate pred);
ÈÏ°Ï[first1, last1)¤ÎÍ×ÁǤòºÇ½é¤«¤éÁàºî¤·¤Æ¤¤¤¡¤first2¤Ç»Ï¤Þ¤ëÈϰϤÎÍ×ÁǤȰۤʤëÃͤò»ý¤ÄÍ×ÁǤ¬½Ð¤Æ¤¤¿¤é¤½¤Î¥Ú¥¢¤òºîÀ®¤·¤ÆÊÖ¤¹¡¥ pred¤ËÁê°ã¾ò·ï¤ò»ØÄꤹ¤ë¤³¤È¤â²Äǽ(Åù¤·¤¤¤È¤¤Ëtrue¤òÊÖ¤¹´Ø¿ô)¡¥
¥³¡¼¥ÉÎã
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
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
template<class T>
void output(T x, int n)
{
for(int i = 0; i < n; ++i) cout << x[i] << (i == n-1 ? "" : ", ");
cout << endl;
}
bool comp_str(char x, char y){ return (x+1 == y); }
int main(void)
{
const int N = 10;
vector<int> a(N);
int b[N];
string c = "aabbaa";
string d = "bbcdbb";
for(int i = 0; i < N; ++i){
a[i] = i;
b[i] = i%5;
}
output(a, N); output(b, N);
pair<vector<int>::iterator, int*> result;
result = mismatch(a.begin(), a.end(), b);
cout << "pair of mismatch = " << *(result.first) << ", " << *(result.second) << endl;
cout << endl;
cout << c << endl;
cout << d << endl;
pair<string::iterator, string::iterator> result2;
result2 = mismatch(c.begin(), c.end(), d.begin(), comp_str);
cout << "pair of mismatch = " << *(result2.first) << ", " << *(result2.second) << endl;
return 0;
}
¼Â¹Ô·ë²Ì
0, 1, 2, 3, 4, 5, 6, 7, 8, 9
0, 1, 2, 3, 4, 0, 1, 2, 3, 4
pair of mismatch = 5, 0
aabbaa
bbcdbb
pair of mismatch = b, d
¥½¡¼¥ÈºÑ¤ß¥³¥ó¥Æ¥Ê¤ËÂФ¹¤ë¸¡º÷(equal_range, upper_bound, lower_bound)
• equal_range
template <class ForwardIterator, class T>
pair<ForwardIterator,ForwardIterator> equal_range(ForwardIterator first, ForwardIterator last, const T& value);
template <class ForwardIterator, class T, class Compare>
pair<ForwardIterator,ForwardIterator> equal_range(ForwardIterator first, ForwardIterator last, const T& value,
Compare comp);
¥½¡¼¥ÈºÑ¤ß¤Î[first, last)Æ⤫¤évalue¤ÈÅù¤·¤¤Ãͤò»ý¤ÄÍ×ÁǤÎϢ³¤¹¤ëÈϰϤòÊÖ¤¹¡¥ Î㤨¤Ð¡¤
1
2
3
4
5
int c[] = {1, 3, 2, 3, 2, 1, 3, 4};
sort(c, c+8); // 1, 2, 2, 3, 3, 3, 4
pair<int*, int*> range;
range = equal_range(c, c+8, 3);
cout << "[" << range.first-c << ", " << range.second-c << ")" << endl;
¤Î¾ì¹ç¡¤·ë²Ì¤Ï"[4, 7)"¤È¤Ê¤ë¡¥¤Á¤Ê¤ß¤Ë¥½¡¼¥È̵¤·¤À¤È"[6, 7)"¤È¤Ê¤Ã¤¿(´Ä¶¤Ë¤è¤ë¤«¤â¤·¤ì¤Ê¤¤)¡¥
• upper_bound
template <class ForwardIterator, class T>
ForwardIterator upper_bound(ForwardIterator first, ForwardIterator last, const T& value);
template <class ForwardIterator, class T, class Compare>
ForwardIterator upper_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
¥½¡¼¥ÈºÑ¤ß¤Î[first, last)Æ⤫¤évalue¤è¤êÂ礤¤Ãͤò»ý¤ÄºÇ½é¤ÎÍ×ÁǤòÊÖ¤¹¡¥
• lower_bound
template <class ForwardIterator, class T>
ForwardIterator lower_bound(ForwardIterator first, ForwardIterator last, const T& value);
template <class ForwardIterator, class T, class Compare>
ForwardIterator lower_bound(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
¥½¡¼¥ÈºÑ¤ß¤Î[first, last)Æ⤫¤évalue¤è¤ê¾®¤µ¤¤Ãͤò»ý¤ÄºÇ½é¤ÎÍ×ÁǤòÊÖ¤¹¡¥ Î㤨¤Ð¡¤
1
2
3
4
5
int d[] = {1, 3, 2, 3, 2, 1, 3, 4};
sort(d, d+8); // 1, 2, 2, 3, 3, 3, 4
int *low = lower_bound(d, d+8, 3);
int *up = upper_bound(d, d+8, 3);
cout << "[" << low-d << ", " << up-d << ")" << endl;
¤Çequal_range¤ÈƱ¤¸"[4, 7)"¤Î·ë²Ì¤¬ÆÀ¤é¤ì¤ë¡¥
Æóʬõº÷(binary_search)
template <class ForwardIterator, class T>
bool binary_search(ForwardIterator first, ForwardIterator last, const T& value);
template <class ForwardIterator, class T, class Compare>
bool binary_search(ForwardIterator first, ForwardIterator last, const T& value, Compare comp);
¥½¡¼¥ÈºÑ¤ß¤Î[first, last)¤«¤ébinary search(Æóʬõº÷)¤Ë¤è¤êvalue¤Ë°ìÃפ¹¤ëÍ×ÁǤò¸¡º÷¤·¡¤¤â¤·¤¢¤ì¤Ðtrue¤òÊÖ¤¹¡¥ ¥½¡¼¥È¤¹¤ëɬÍפ¬¤¢¤ë¤Î¤Ç¡¤sort¤ÈÁȤ߹ç¤ï¤»¤Æ»È¤¦¤³¤È¤¬Â¿¤¤¡¥Î㤨¤Ð¡¤
1
2
3
4
5
int b[] = {1, 3, 2, 5, 4, 1};
sort(b, b+6);
if(binary_search(b, b+6, 5)){
cout << "5 is found." << endl;
}
ºÇ¾®ÃÍ¡¤ºÇÂçÃ͸¡º÷(min_element, max_element)
• min_element
template <class ForwardIterator>
ForwardIterator min_element(ForwardIterator first, ForwardIterator last);
template <class ForwardIterator, class Compare>
ForwardIterator min_element(ForwardIterator first, ForwardIterator last, Compare comp);
[first, last)Æ⤫¤éºÇ¾®¤ÎÃͤò»ý¤ÄÍ×ÁǤΥ¤¥Æ¥ì¡¼¥¿¤òÊÖ¤¹¡¥
• max_element
template <class ForwardIterator>
ForwardIterator max_element(ForwardIterator first, ForwardIterator last);
template <class ForwardIterator, class Compare>
ForwardIterator max_element(ForwardIterator first, ForwardIterator last, Compare comp);
[first, last)Æ⤫¤éºÇÂç¤ÎÃͤò»ý¤ÄÍ×ÁǤΥ¤¥Æ¥ì¡¼¥¿¤òÊÖ¤¹¡¥ Î㤨¤Ð¡¤
1
2
3
4
5
int e[] = {3, 2, 1, 3, 2, 1, 4, 3};
int *minp = min_element(e, e+8);
int *maxp = max_element(e, e+8);
cout << "min element : " << minp-e << "(" << *minp << ")" << endl;
cout << "max element : " << maxp-e << "(" << *maxp << ")" << endl;
·ë²Ì¤Ï°Ê²¼¤Î¤è¤¦¤Ë¤Ê¤ë¡¥
min element : 2(1)
max element : 6(4)
¥³¥ó¥Æ¥Ê¤ÎÁàºî
ÃÖ¤´¹¤¨(replace, replace_if, replace_copy, replacy_copy_if)
• replace
template <class ForwardIterator, class T>
void replace(ForwardIterator first, ForwardIterator last, const T& old_value, const T& new_value);
¥³¥ó¥Æ¥Ê¡¦ÇÛÎó¤ÎÈÏ°Ï[first, last)Æâ¤ÎÍ×ÁǤÇÃͤ¬old_value¤Î¤â¤Î¤ònew_value¤ËÃÖ¤´¹¤¨¤ë¡¥
• replace_if
template <class ForwardIterator, class Predicate, class T>
void replace_if(ForwardIterator first, ForwardIterator last, Predicate pred, const T& new_value);
¥³¥ó¥Æ¥Ê¡¦ÇÛÎó¤ÎÈÏ°Ï[first, last)Æâ¤ÎÍ×ÁǤÇpred¤Ç¼¨¤µ¤ì¤¿´Ø¿ô¤¬true¤òÊÖ¤·¤¿¤â¤Î¤ònew_value¤ÇÃÖ¤´¹¤¨¤ë¡¥
• replace_copy
template <class InputIterator, class OutputIterator, class T>
OutputIterator replace_copy(InputIterator first, InputIterator last, OutputIterator result,
const T& old_value, const T& new_value);
¥³¥ó¥Æ¥Ê¡¦ÇÛÎó¤ÎÈÏ°Ï[first, last)Æâ¤ÎÍ×ÁǤÇÃͤ¬old_value¤Î¤â¤Î¤ònew_value¤ËÃÖ¤´¹¤¨¤¿·ë²Ì¤ò result¤Ç»Ï¤Þ¤ë¥³¥ó¥Æ¥Ê¤Ë¥³¥Ô¡¼¤¹¤ë¡¥
• replace_copy_if
template <class InputIterator, class OutputIterator, class Predicate, class T>
OutputIterator replace_copy_if(InputIterator first, InputIterator last, OutputIterator result,
Predicate pred, const T& new_value);
¥³¥ó¥Æ¥Ê¡¦ÇÛÎó¤ÎÈÏ°Ï[first, last)Æâ¤ÎÍ×ÁǤÇpred¤Ç¼¨¤µ¤ì¤¿´Ø¿ô¤¬true¤òÊÖ¤·¤¿¤â¤Î¤ònew_value¤ËÃÖ¤´¹¤¨¤¿·ë²Ì¤ò result¤Ç»Ï¤Þ¤ë¥³¥ó¥Æ¥Ê¤Ë¥³¥Ô¡¼¤¹¤ë¡¥
¥³¡¼¥ÉÎã
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
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
template<class T>
void output(T x, int n)
{
for(int i = 0; i < n; ++i) cout << x[i] << (i == n-1 ? "" : ", ");
cout << endl;
}
bool comp_func(int x){ return (x%2 == 0); }
int main(void)
{
const int N = 10;
vector<int> a(N);
int b[N];
string c = "aabbaa";
string d;
d.resize(c.size());
for(int i = 0; i < N; ++i){
a[i] = i%3;
b[i] = i+1;
}
output(a, N);
replace(a.begin(), a.end(), 1, 2);
cout << " --> "; output(a, N);
output(b, N);
replace_if(b, b+N, comp_func, 0);
cout << " --> "; output(b, N);
replace_copy(c.begin(), c.end(), d.begin(), 'b', 'a');
cout << c << endl;
cout << " --> " << d << endl;
return 0;
}
¼Â¹Ô·ë²Ì
0, 1, 2, 0, 1, 2, 0, 1, 2, 0
--> 0, 2, 2, 0, 2, 2, 0, 2, 2, 0
1, 2, 3, 4, 5, 6, 7, 8, 9, 10
--> 1, 0, 3, 0, 5, 0, 7, 0, 9, 0
aabbaa
--> aaaaaa
Í×ÁǺï½ü(remove, remove_if, remove_copy, remove_copy_if, unique, unique_copy)
• remove
template <class ForwardIterator, class T>
ForwardIterator remove(ForwardIterator first, ForwardIterator last, const T& value);
ÈÏ°Ï[first, last)Æâ¤ÎÍ×ÁǤÇÃͤ¬value¤È°ìÃפ¹¤ë¤â¤Î¤òºï½ü¤¹¤ë¡¥
• remove_if
template <class ForwardIterator, class Predicate>
ForwardIterator remove_if(ForwardIterator first, ForwardIterator last, Predicate pred);
ÈÏ°Ï[first, last)Æâ¤ÎÍ×ÁǤÇpred¤Î¾ò·ï¤È°ìÃפ¹¤ë¤â¤Î¤òºï½ü¤¹¤ë¡¥
• remove_copy
template <class InputIterator, class OutputIterator, class T>
OutputIterator remove_copy(InputIterator first, InputIterator last, OutputIterator result, const T& value);
ÈÏ°Ï[first, last)Æâ¤ÎÍ×ÁǤÇÃͤ¬value¤È°ìÃפ¹¤ë¤â¤Î¤òºï½ü¤·¤¿·ë²Ì¤òresult¤Ë³ÊǼ¤¹¤ë¡¥
• remove_copy_if
template <class InputIterator, class OutputIterator, class Predicate>
OutputIterator remove_copy_if(InputIterator first, InputIterator last, OutputIterator result, Predicate pred);
ÈÏ°Ï[first, last)Æâ¤ÎÍ×ÁǤÇpred¤Î¾ò·ï¤È°ìÃפ¹¤ë¤â¤Î¤òºï½ü¤·¤¿·ë²Ì¤òresult¤Ë³ÊǼ¤¹¤ë¡¥
• unique
template <class ForwardIterator>
ForwardIterator unique(ForwardIterator first, ForwardIterator last);
template <class ForwardIterator, class BinaryPredicate>
ForwardIterator unique(ForwardIterator first, ForwardIterator last, BinaryPredicate pred);
ÈÏ°Ï[first, last)¤òºÇ½é¤«¤éÁöºº¤·¤Æ¡¤Æ±¤¸Ãͤò»ý¤ÄϢ³¤·¤¿2¤Ä¤ÎÍ×ÁǤθå¤í¤ÎÊý¤òºï½ü¤¹¤ë¡¥¤³¤ì¤ò»ØÄꤷ¤¿ÈÏ°ÏÁ´¤Æ¤Ç¹Ô¤¦¡¥ Î㤨¤Ð¡¤1, 1, 2, 3, 3, 3, 1, 1 ¤È¤¤¤¦ÇÛÎó¤ËŬÍѤ¹¤ë¤È 1, 2, 3, 1 ¤È¤¤¤¦·ë²Ì¤¬ÆÀ¤é¤ì¤ë¡¥
• unique_copy
template <class InputIterator, class OutputIterator>
OutputIterator unique_copy(InputIterator first, InputIterator last, OutputIterator result);
template <class InputIterator, class OutputIterator, class BinaryPredicate>
OutputIterator unique_copy(InputIterator first, InputIterator last, OutputIterator result, BinaryPredicate pred);
¾åµunique¤Î¥³¥Ô¡¼ÈÇ¡¥·ë²Ì¤òresult¤«¤é»Ï¤Þ¤ë¥³¥ó¥Æ¥Ê¡¦ÇÛÎó¤Ë³ÊǼ¤¹¤ë¡¥
ÂåÆþ(fill, fill_n, generate, generate_n)
• fill
template <class ForwardIterator, class T>
void fill(ForwardIterator first, ForwardIterator last, const T& value);
ÈÏ°Ï[first, last)¤ÎÍ×ÁǤËvalue¤ò¥»¥Ã¥È¤¹¤ë¡¥
• fill_n
template <class OutputIterator, class Size, class T>
void fill_n(OutputIterator first, Size n, const T& value);
first¤«¤é»Ï¤Þ¤ën¸Ä¤ÎÍ×ÁǤËvalue¤ò¥»¥Ã¥È¤¹¤ë¡¥
• generate
template <class ForwardIterator, class Generator>
void generate(ForwardIterator first, ForwardIterator last, Generator gen);
°ú¿ô¤ò¤È¤é¤ºÃͤÀ¤±¤òÊÖ¤¹´Ø¿ôgen¤Ë¤è¤ê¡¤ÈÏ°Ï[first, last)¤ËÃͤò¥»¥Ã¥È¤¹¤ë¡¥
• generate_n
template <class OutputIterator, class Size, class Generator>
void generate_n(OutputIterator first, Size n, Generator gen)
°ú¿ô¤ò¤È¤é¤ºÃͤÀ¤±¤òÊÖ¤¹´Ø¿ôgen¤Ë¤è¤ê¡¤first¤«¤é»Ï¤Þ¤ën¸Ä¤ÎÍ×ÁǤËÃͤò¥»¥Ã¥È¤¹¤ë¡¥
¥³¥Ô¡¼(copy, copy_backward)
• copy
template <class InputIterator, class OutputIterator>
OutputIterator copy(InputIterator first, InputIterator last, OutputIterator result);
ÈÏ°Ï[first, last)¤ÎÃͤòresult¤«¤é»Ï¤Þ¤ë¥³¥ó¥Æ¥Ê¡¿ÇÛÎó¤Ë¥³¥Ô¡¼¤¹¤ë(¥³¥Ô¡¼¸µ:[first,last)¡¤¥³¥Ô¡¼Àè:result)¡¥
• copy_backward
template <class BidirectionalIterator1, class BidirectionalIterator2>
BidirectionalIterator2 copy_backward(BidirectionalIterator1 first, BidirectionalIterator1 last,
BidirectionalIterator2 result);
ÈÏ°Ï[first, last)¤ÎÃͤòresult¤Ç½ª¤ï¤ëÎΰè¤Ë¥³¥Ô¡¼¤¹¤ë¡¥¤Ä¤Þ¤ê¡¤ºÇ½é¤Ëlast-1¤ÎÃͤ¬result-1¤Ë¥³¥Ô¡¼¤µ¤ì¡¤ ¼¡¤Ëlast-2¤¬result-2¤Ë¥³¥Ô¡¼¤È¤¤¤¦½çÈÖ¡¥
ȿž(reverse, reverse_copy)
• reverse
template <class BidirectionalIterator>
void reverse(BidirectionalIterator first, BidirectionalIterator last);
ÈÏ°Ï[first, last)¤ÎÍ×ÁǤÎʤӤòȿž¤¹¤ë¡¥
• reverse_copy
template <class BidirectionalIterator, class OutputIterator>
OutputIterator reverse_copy(BidirectionalIterator first, BidirectionalIterator last, OutputIterator result);
ÈÏ°Ï[first, last)¤ÎÍ×ÁǤÎʤӤòȿž¤·¤¿·ë²Ì¤òresult¤Ë¥³¥Ô¡¼¤¹¤ë¡¥
¥í¡¼¥Æ¡¼¥·¥ç¥ó(rotate, rotate_copy)
• rotate
template <class ForwardIterator>
void rotate(ForwardIterator first, ForwardIterator middle, ForwardIterator last);
ÈÏ°Ï[first, last)¤ÎÍ×ÁǤÎʤӤòmiddle¤¬ºÇ½é¤Ë¤Ê¤ë¤è¤¦¤Ë¥í¡¼¥Æ¡¼¥·¥ç¥ó¤¹¤ë¡¥
• rotate_copy
template <class ForwardIterator, class OutputIterator>
OutputIterator rotate_copy(ForwardIterator first, ForwardIterator middle, ForwardIterator last,
OutputIterator result);
ÈÏ°Ï[first, last)¤ÎÍ×ÁǤÎʤӤòmiddle¤¬ºÇ½é¤Ë¤Ê¤ë¤è¤¦¤Ë¥í¡¼¥Æ¡¼¥·¥ç¥ó¤·¤¿·ë²Ì¤òresult¤Ë¥³¥Ô¡¼¤¹¤ë¡¥
ʤÓÂؤ¨(partition, stable_partition)
• partition template <class BidirectionalIterator, class Predicate>
BidirectionalIterator partition(BidirectionalIterator first, BidirectionalIterator last,
Predicate pred);
pred¤¬true¤òÊÖ¤¹Ãͤò»ý¤ÄÍ×ÁǤòÁ°¤Ë¡¤false¤òÊÖ¤¹Í×ÁǤò¸å¤í¤Ë¤Ê¤ë¤è¤¦¤ËʤÓÂؤ¨¤ë¡¥Ê¤ÓÂؤ¨¸å¤Î¸µ¤Î½çÈÖ¤ÏÊݾڤµ¤ì¤Ê¤¤¡¥
• stable_partition template <class BidirectionalIterator, class Predicate>
BidirectionalIterator stable_partition(BidirectionalIterator first, BidirectionalIterator last,
Predicate pred);
pred¤¬true¤òÊÖ¤¹Ãͤò»ý¤ÄÍ×ÁǤòÁ°¤Ë¡¤false¤òÊÖ¤¹Í×ÁǤò¸å¤í¤Ë¤Ê¤ë¤è¤¦¤ËʤÓÂؤ¨¤ë¡¥Ê¤ÓÂؤ¨¸å¤Î¸µ¤Î½çÈÖ¤¬Êݾڤµ¤ì¤ë¡¥
¥é¥ó¥À¥à¥·¥ã¥Ã¥Õ¥ë(random_shuffle)
• random_shuffle
template <class RandomAccessIterator>
void random_shuffle(RandomAccessIterator first, RandomAccessIterator last);
template <class RandomAccessIterator, class RandomNumberGenerator>
void random_shuffle(RandomAccessIterator first, RandomAccessIterator last, RandomNumberGenerator& rand);
ÈÏ°Ï[first, last)¤ÎÍ×ÁǤò¥é¥ó¥À¥à¥·¥ã¥Ã¥Õ¥ë¤¹¤ë¡¥
Í×ÁǤθò´¹(swap, swap_ranges)
• swap
template <class T> void swap(T& a, T& b);
Æó¤Ä¤ÎÃÍa,b¤ò¸ò´¹¤¹¤ë¡¥
• swap_ranges template <class ForwardIterator1, class ForwardIterator2>
ForwardIterator2 swap_ranges(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2);
Æó¤Ä¤ÎÈϰϤÎÍ×ÁǤò¸ò´¹¤¹¤ë¡¥
¥Þ¡¼¥¸(merge, inplace_merge)
• merge
template <class InputIterator1, class InputIterator2, class OutputIterator>
OutputIterator merge(InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result);
template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
OutputIterator merge(InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result, Compare comp);
¥½¡¼¥ÈºÑ¤ß¤Î[first1,last1)¤È[first2,last2)¤ò¥Þ¡¼¥¸¤¹¤ë¡¥¥Þ¡¼¥¸¸å¤Î¥³¥ó¥Æ¥Ê(result)¤Ï¥½¡¼¥È¤µ¤ì¤Æ¤¤¤ë¡¥ comp¤Ï¥½¡¼¥È¤ÎÈæ³Ó´Ø¿ô(¥Ç¥Õ¥©¥ë¥È¤Ï"<")¡¥
• inplace_merge
template <class BidirectionalIterator>
void inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last );
template <class BidirectionalIterator, class Compare>
void inplace_merge(BidirectionalIterator first, BidirectionalIterator middle, BidirectionalIterator last,
Compare comp);
Ϣ³¤·¤¿2¤Ä¤Î¥½¡¼¥ÈºÑ¤ß¤ÎÎΰè[first, middle)¤È[middle, last)¤ò¥Þ¡¼¥¸¤¹¤ë¡¥¥Þ¡¼¥¸¸å¤ÎÎΰè([fisrt, last))¤Ï¥½¡¼¥È¤µ¤ì¤Æ¤¤¤ë¡¥ comp¤Ï¥½¡¼¥È¤ÎÈæ³Ó´Ø¿ô(¥Ç¥Õ¥©¥ë¥È¤Ï"<")¡¥ ¸Ä¡¹¤ÎÎΰè([first, middle)¤È[middle, last))¤Ï¥½¡¼¥È¤µ¤ì¤Æ¤¤¤Ê¤±¤ì¤Ð¤Ê¤é¤Ê¤¤¡¥ ¤¿¤È¤¨¤Ð¡¤
1, 3, 5, 2, 4, 6
¤ÎÃͤ¬Æþ¤Ã¤¿ÇÛÎóa¤ËÂФ·¤Æ¡¤[a[0], a[3])¤È[a[2], a[6])¤òinplace_merge¤¹¤ë¤È¡¤a¤Ï
1, 2, 3, 4, 5, 6
¤È¤Ê¤ë¡¥
½¸¹ç±é»»(set_difference, set_intersection, set_symmetric_difference, set_union)
• set_difference
template <class InputIterator1, class InputIterator2, class OutputIterator>
OutputIterator set_difference(InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result);
template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
OutputIterator set_difference(InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result, Compare comp);
¥½¡¼¥ÈºÑ¤ß¤Î[first1,last1)¤È[first2,last2)¤Îº¹¤Î½¸¹ç¤ò·×»»¤·¤Æ¡¤result¤Ë³ÊǼ¤¹¤ë¡¥ÊÖÃͤÏresult¤Ë³ÊǼ¤µ¤ì¤¿Í×ÁǤÎËöÈø¤Ç¤¢¤ë¡¥ ¤Ä¤Þ¤ê¡¤[first1,last1)¤ÎÍ×ÁǤÎÃæ¤Ç[first2,last2)¤Ë´Þ¤Þ¤ì¤Ê¤¤¤â¤Î¤òresult¤Ë³ÊǼ¤¹¤ë¡¥ ¤¿¤È¤¨¤Ð¡¤
1, 2, 3, 4, 5
¤«¤é
2, 4, 6, 8, 10
¤Îº¹¤ò¤È¤ë¤È¡¤
1, 3, 5
¤È¤Ê¤ë¡¥
¤³¤³¤Ç¤Ï[first1,last1)-[first2,last2)¤À¤±¤Ç¤¢¤ê¡¤¤½¤ÎµÕ¤Ï¤Ê¤¤¡¥ÁÐÊý¸þ¤Îº¹¤ò¤È¤ë¾ì¹ç¤Ïset_symmetric_difference¤òÍѤ¤¤ë¡¥
• set_intersection
template <class InputIterator1, class InputIterator2, class OutputIterator>
OutputIterator set_intersection(InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result);
template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
OutputIterator set_intersection(InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result, Compare comp);
¥½¡¼¥ÈºÑ¤ß¤Î[first1,last1)¤È[first2,last2)ξÊý¤Ë´Þ¤Þ¤ì¤ëÍ×ÁǤν¸¹ç(¸òº¹)¤ò·×»»¤·¤Æ¡¤result¤Ë³ÊǼ¤¹¤ë¡¥ÊÖÃͤÏresult¤Ë³ÊǼ¤µ¤ì¤¿Í×ÁǤÎËöÈø¤Ç¤¢¤ë¡¥ ¤¿¤È¤¨¤Ð¡¤
1, 2, 3, 4, 5
¤È
2, 4, 6, 8, 10
¤Î¸òº¹¤ò¤È¤ë¤È¡¤
2, 4
¤È¤Ê¤ë¡¥
• set_symmetric_difference
template <class InputIterator1, class InputIterator2, class OutputIterator>
OutputIterator set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result);
template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
OutputIterator set_symmetric_difference(InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result, Compare comp);
¥½¡¼¥ÈºÑ¤ß¤Î[first1,last1)¤È[first2,last2)¤ÎÁÐÊý¸þº¹¤Î½¸¹ç¤ò·×»»¤·¤Æ¡¤result¤Ë³ÊǼ¤¹¤ë¡¥ÊÖÃͤÏresult¤Ë³ÊǼ¤µ¤ì¤¿Í×ÁǤÎËöÈø¤Ç¤¢¤ë¡¥ ¤¿¤È¤¨¤Ð¡¤
1, 2, 3, 4, 5
¤È
2, 4, 6, 8, 10
¤ÎÁÐÊý¸þº¹¤ò¤È¤ë¤È¡¤
1, 3, 5, 6, 8, 10
¤È¤Ê¤ë¡¥
• set_union
template <class InputIterator1, class InputIterator2, class OutputIterator>
OutputIterator set_union(InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result);
template <class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
OutputIterator set_union(InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
OutputIterator result, Compare comp);
¥½¡¼¥ÈºÑ¤ß¤Î[first1,last1)¤È[first2,last2)¤ÎÏ¤ν¸¹ç¤ò·×»»¤·¤Æ¡¤result¤Ë³ÊǼ¤¹¤ë¡¥ÊÖÃͤÏresult¤Ë³ÊǼ¤µ¤ì¤¿Í×ÁǤÎËöÈø¤Ç¤¢¤ë¡¥ ¤¿¤È¤¨¤Ð¡¤
1, 2, 3, 4, 5
¤È
2, 4, 6, 8, 10
¤ÎϤò¤È¤ë¤È¡¤
1, 2, 3, 4, 5, 6, 8, 10
¤È¤Ê¤ë¡¥
¤½¤Î¾
¥«¥¦¥ó¥È(count, count_if)
• count
template <class InputIterator, class T>
size_t count(ForwardIterator first, ForwardIterator last, const T& value);
Îΰè[first, last)¤«¤éÍ×ÁǤÎÃͤ¬value¤ÈÅù¤·¤¤¤â¤Î¤Î¿ô¤òÊÖ¤¹¡¥
• count_if
template <class InputIterator, class Predicate>
size_t count_if(ForwardIterator first, ForwardIterator last, Predicate pred);
Îΰè[first, last)¤«¤éÍ×ÁǤÎÃͤò´Ø¿ôpred¤ËÅϤ·¤¿¤È¤¤Ëtrue¤òÊÖ¤¹¤â¤Î¤Î¿ô¤òÊÖ¤¹¡¥
Èæ³Ó(equal, includes, lexicographical_compare, max, min)
• equal
template <class InputIterator1, class InputIterator2>
bool equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2);
template <class InputIterator1, class InputIterator2, class BinaryPredicate>
bool equal(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, BinaryPredicate pred);
Îΰè[first1, last1)¤Èfirst2¤«¤é»Ï¤Þ¤ëÎΰè¤Î¤¹¤Ù¤Æ¤ÎÍ×ÁǤò½çÈÖ¤ËÈæ³Ó¤·¤Æ¤¹¤Ù¤ÆÅù¤·¤¤ (or 2°ú¿ô¤ò¤È¤ë´Ø¿ôpred¤¬true¤òÊÖ¤¹)¾ì¹çtrue¤òÊÖ¤¹¡¥°ì¤Ä¤Ç¤â°Û¤Ê¤ëÍ×ÁǤ¬¤¢¤ì¤Ðfalse¤òÊÖ¤¹¡¥
• includes
template <class InputIterator1, class InputIterator2>
bool includes(InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2);
template <class InputIterator1, class InputIterator2, class Compare>
bool includes(InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Compare comp);
¥½¡¼¥ÈºÑ¤ß¤ÎÎΰè[first1, last1)¤Ë[first2, last2)¤Î¤¹¤Ù¤Æ¤ÎÍ×ÁǤ¬´Þ¤Þ¤ì¤ì¤Ðtrue¤òÊÖ¤¹¡¥
• lexicographical_compare
template <class InputIterator1, class InputIterator2>
bool lexicographical_compare(InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2);
template <class InputIterator1, class InputIterator2, class Compare>
bool lexicographical_compare(InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, InputIterator2 last2,
Compare comp );
Îΰè[first1,last1)¤È[first2,last2)¤ò¼½ñ½ç¤Ç¤É¤Á¤é¤¬Àè¤ËÍè¤ë¤«¤òÄ´¤Ù¤Æ¡¤ ¤â¤·[first1,last1)¤ÎÊý¤¬Àè¤ËÍè¤ë¾ì¹ç¤Ïtrue¡¤¤½¤¦¤Ç¤Ê¤¤¤È¤¤Ïfalse¤òÊÖ¤¹¡¥ ¼ç¤Ë¿¿ô¤Îʸ»úÎó¤ò¼½ñ½ç¤ËʤÓÂؤ¨¤ë¤È¤¤ËÍѤ¤¤é¤ì¤ë¡¥ ¤¿¤È¤¨¤Ð¡¤
kagawa
kouchi
¤òÈæ¤Ù¤ë¤Èkagawa¤¬Á°¤ËÍè¤ë¤ÈȽÄꤵ¤ì¤ë¡¥
• max
template <class T> const T& max(const T& a, const T& b);
template <class T, class Compare>
const T& max(const T& a, const T& b, Compare comp);
a¤Èb¤òÈæ¤Ù¤ÆÂ礤¤Êý¤òÊÖ¤¹¡¥
• min
template <class T> const T& min(const T& a, const T& b);
template <class T, class Compare>
const T& min(const T& a, const T& b, Compare comp);
a¤Èb¤òÈæ¤Ù¤Æ¾®¤µ¤¤Êý¤òÊÖ¤¹¡¥
Ǥ°Õ´Ø¿ô¤ÎŬÍÑ(for_each, transform)
• for_each
template <class InputIterator, class Function>
Function for_each(InputIterator first, InputIterator last, Function f);
Îΰè[first,last)¤ÎÁ´Í×ÁǤ˴ؿôf¤òŬÍѤ¹¤ë¡¥ ¤¿¤È¤¨¤Ð¡¤
vector<int> a(10);
¤È¤¤¤¦ÇÛÎ󤬤¢¤ë¤È¤¹¤ë¡¥
vector<int>::iterator iter = a.begin();
for(; iter != a.end(); ++iter){
f(*iter);
}
¤È¤¤¤¦½èÍý¤ò¤·¤¿¤¤¤È¤¡¤for_each¤òÍѤ¤¤ë¤È¡¤
for_each(a.begin(), a.end(), f);
¤È¥³¥ó¥Ñ¥¯¥È¤Ë½ñ¤¯¤³¤È¤¬¤Ç¤¤ë¡¥
• transform
template <class InputIterator, class OutputIterator, class UnaryOperator>
OutputIterator transform(InputIterator first1, InputIterator last1,
OutputIterator result, UnaryOperator op);
template <class InputIterator1, class InputIterator2, class OutputIterator, class BinaryOperator>
OutputIterator transform(InputIterator1 first1, InputIterator1 last1,
InputIterator2 first2, OutputIterator result,
BinaryOperator binary_op );
for_each¤Ç¤Ï³ÆÍ×ÁǤ˴ؿô¤òŬÍѤǤ¤ë¤¬¡¤Å¬ÍÑ·ë²Ì¤ò¾¤ÎÇÛÎó¤Ë³ÊǼ¤·¤¿¤¤¾ì¹ç¤Ïtransform¤¬»È¤¨¤ë¡¥ transform¤Ï¡¤Îΰè[first1, last1)¤Î¤¹¤Ù¤Æ¤ÎÍ×ÁǤ˴ؿôop¤òŬÍѤ·¤Æ¡¤¤½¤Î·ë²Ì(ÊÖÃÍ)¤òresult¤Ë³ÊǼ¤¹¤ë(op¤Ï1°ú¿ô¤ò¤È¤ê¡¤ÃͤòÊÖ¤¹´Ø¿ô)¡¥ 2¤Ä¤á¤ÎÄêµÁ¤ÏÎΰè[first1, last1)¤Èfirst2¤«¤é»Ï¤Þ¤ëÎΰè¤ÎÍ×ÁǤò´Ø¿ôop¤ËÅϤ·¤Æ¡¤¤½¤Î·ë²Ì¤ò(ÊÖÃÍ)¤òresult¤Ë³ÊǼ¤¹¤ë(op¤Ï2°ú¿ô¤ò¤È¤ê¡¤ÃͤòÊÖ¤¹´Ø¿ô)¡¥
½çÎó(next_permutation, prev_permutation)
• next_permutation
template <class BidirectionalIterator>
bool next_permutation(BidirectionalIterator first, BidirectionalIterator last);
template <class BidirectionalIterator, class Compare>
bool next_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
Îΰè[first, last)¤ÎÍ×ÁǤǹ½À®¤µ¤ì¤ë½çÎó(Í×ÁÇ¿ô¤òN¤È¤¹¤ë¤ÈN!¸Ä)¤Î¤¦¤Á¡¤¼½ñ½ç¤Ç¼¡¤Ë¤¯¤ë¤â¤Î¤òõ¤·¤Æ¡¤[first,last)¤ÎÍ×ÁǤνçÈÖ¤òÆþ¤ìÂؤ¨¤ë¡¥
• prev_permutation
template <class BidirectionalIterator>
bool prev_permutation(BidirectionalIterator first, BidirectionalIterator last);
template <class BidirectionalIterator, class Compare>
bool prev_permutation(BidirectionalIterator first, BidirectionalIterator last, Compare comp);
next_permutation¤ÎµÕ¤Ç¡¤ Îΰè[first, last)¤ÎÍ×ÁǤǹ½À®¤µ¤ì¤ë½çÎó¤Î¤¦¤Á¡¤¼½ñ½ç¤ÇÁ°¤Ë¤¯¤ë¤â¤Î¤òõ¤·¤Æ¡¤[first,last)¤ÎÍ×ÁǤνçÈÖ¤òÆþ¤ìÂؤ¨¤ë¡¥
źÉÕ¥Õ¥¡¥¤¥ë: filebinary_tree.jpg 1438·ï [¾ÜºÙ] filebinary_tree2.jpg 1527·ï [¾ÜºÙ] filesort_time.jpg 1573·ï [¾ÜºÙ]
¥È¥Ã¥× ÊÔ½¸ Åà·ë º¹Ê¬ ÍúÎò źÉÕ Ê£À½ ̾Á°Êѹ¹ ¥ê¥í¡¼¥É ¿·µ¬ °ìÍ÷ ¸¡º÷ ºÇ½ª¹¹¿· ¥Ø¥ë¥× ºÇ½ª¹¹¿·¤ÎRSS
Last-modified: 2022-11-30 (¿å) 13:48:10
|
{
"url": "https://www.slis.tsukuba.ac.jp/~fujisawa.makoto.fu/cgi-bin/wiki/index.php?algorithm",
"source_domain": "www.slis.tsukuba.ac.jp",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "76197",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BP4VQ4BUE6MJS6BDWH2U53QESDRE4BAD",
"WARC-Concurrent-To": "<urn:uuid:76ce7cd1-2a79-4608-bec7-c4724975b782>",
"WARC-Date": "2023-09-29T09:39:20Z",
"WARC-IP-Address": "130.158.224.75",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:M4EYR4J75GO7SOWGXH2MZ4P3E7DLIN4Q",
"WARC-Record-ID": "<urn:uuid:3c1e1d8e-72b2-499d-9ac4-d0e7b1846732>",
"WARC-Target-URI": "https://www.slis.tsukuba.ac.jp/~fujisawa.makoto.fu/cgi-bin/wiki/index.php?algorithm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8f30b270-8b8f-4d42-93aa-345e9250a542>"
},
"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-200\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,
1,
16,
17,
18,
19,
29,
30,
191,
192,
213,
214,
221,
222,
248,
249,
287,
354,
407,
488,
489,
732,
733,
771,
845,
898,
986,
987,
1079,
1080,
1089,
1090,
1094,
1098,
1102,
1106,
1110,
1114,
1118,
1122,
1126,
1130,
1134,
1138,
1142,
1146,
1150,
1154,
1158,
1162,
1166,
1170,
1174,
1178,
1182,
1186,
1190,
1194,
1198,
1202,
1206,
1210,
1214,
1218,
1222,
1226,
1230,
1234,
1238,
1242,
1246,
1250,
1254,
1258,
1262,
1266,
1270,
1274,
1278,
1282,
1286,
1290,
1294,
1298,
1302,
1321,
1341,
1359,
1380,
1401,
1403,
1415,
1417,
1431,
1434,
1500,
1502,
1554,
1556,
1587,
1589,
1611,
1613,
1628,
1630,
1652,
1672,
1674,
1696,
1711,
1716,
1748,
1774,
1801,
1829,
1835,
1837,
1857,
1928,
1946,
1948,
1968,
2039,
2057,
2062,
2092,
2128,
2133,
2153,
2224,
2242,
2244,
2264,
2335,
2353,
2355,
2369,
2371,
2372,
2381,
2382,
2415,
2498,
2531,
2614,
2615,
2659,
2660,
2699,
2803,
2804,
2858,
2976,
2977,
3230,
3231,
3342,
3343,
3403,
3484,
3594,
3595,
3670,
3750,
3860,
3915,
3916,
3984,
3985,
3994,
3995,
3999,
4003,
4007,
4011,
4015,
4019,
4023,
4027,
4031,
4035,
4039,
4043,
4047,
4051,
4055,
4059,
4063,
4067,
4071,
4075,
4079,
4083,
4087,
4091,
4095,
4099,
4103,
4107,
4111,
4115,
4119,
4123,
4127,
4131,
4135,
4139,
4158,
4178,
4196,
4217,
4238,
4253,
4255,
4277,
4297,
4299,
4327,
4351,
4356,
4388,
4421,
4427,
4429,
4451,
4522,
4540,
4542,
4593,
4602,
4624,
4695,
4713,
4715,
4778,
4780,
4802,
4910,
4928,
4930,
4944,
4946,
4947,
4956,
4957,
4992,
5027,
5047,
5048,
5091,
5092,
5127,
5162,
5182,
5183,
5192,
5193,
5213,
5214,
5253,
5353,
5355,
5409,
5523,
5524,
5687,
5688,
5697,
5698,
5702,
5706,
5710,
5714,
5718,
5722,
5726,
5730,
5734,
5738,
5742,
5746,
5750,
5754,
5758,
5762,
5766,
5770,
5774,
5778,
5782,
5786,
5790,
5794,
5798,
5802,
5806,
5825,
5845,
5863,
5884,
5905,
5920,
5922,
5944,
5962,
5964,
5986,
6018,
6044,
6050,
6052,
6072,
6143,
6161,
6163,
6213,
6218,
6238,
6309,
6327,
6329,
6343,
6345,
6346,
6375,
6376,
6409,
6442,
6443,
6499,
6500,
6539,
6611,
6612,
6665,
6751,
6752,
7133,
7134,
7198,
7199,
7238,
7310,
7311,
7364,
7450,
7451,
7492,
7493,
7509,
7510,
7578,
7579,
7651,
7652,
7691,
7762,
7816,
7901,
7940,
8012,
8066,
8152,
8153,
8235,
8236,
8266,
8279,
8280,
8340,
8341,
8359,
8390,
8391,
8549,
8550,
8559,
8560,
8564,
8568,
8572,
8576,
8580,
8584,
8588,
8592,
8596,
8600,
8604,
8608,
8612,
8616,
8620,
8624,
8628,
8632,
8636,
8640,
8644,
8648,
8652,
8656,
8660,
8664,
8668,
8672,
8676,
8680,
8684,
8688,
8708,
8726,
8747,
8768,
8783,
8785,
8807,
8809,
8831,
8863,
8883,
8889,
8929,
8931,
8951,
9022,
9040,
9042,
9077,
9082,
9102,
9173,
9191,
9193,
9228,
9233,
9253,
9324,
9342,
9347,
9361,
9363,
9364,
9373,
9374,
9408,
9442,
9476,
9477,
9528,
9529,
9546,
9547,
9564,
9565,
9762,
9763,
9822,
9823,
9834,
9835,
9839,
9843,
9847,
9851,
9855,
9859,
9863,
9867,
9871,
9875,
9879,
9883,
9887,
9891,
9895,
9899,
9903,
9907,
9911,
9915,
9919,
9923,
9927,
9931,
9935,
9939,
9943,
9947,
9951,
9955,
9959,
9963,
9967,
9971,
9975,
9979,
9983,
9987,
9991,
9995,
9999,
10003,
10007,
10011,
10015,
10019,
10023,
10027,
10031,
10035,
10039,
10043,
10047,
10064,
10084,
10102,
10123,
10144,
10159,
10161,
10180,
10200,
10219,
10221,
10238,
10268,
10300,
10325,
10327,
10348,
10384,
10406,
10416,
10418,
10462,
10484,
10518,
10540,
10594,
10596,
10640,
10662,
10703,
10725,
10779,
10781,
10825,
10847,
10904,
10926,
10980,
10982,
11026,
11048,
11104,
11126,
11180,
11182,
11199,
11205,
11207,
11223,
11225,
11239,
11241,
11242,
11251,
11252,
11266,
11267,
11384,
11385,
11390,
11391,
11426,
11427,
11436,
11481,
11563,
11636,
11648,
11700,
11785,
11861,
11879,
11942,
12028,
12114,
12200,
12286,
12372,
12431,
12526,
12527,
12560,
12561,
12572,
12635,
12714,
12793,
12879,
12958,
13037,
13089,
13237,
13250,
13313,
13394,
13475,
13561,
13642,
13723,
13777,
13925,
13926,
13970,
13971,
13989,
14027,
14108,
14169,
14272,
14344,
14357,
14415,
14519,
14600,
14704,
14757,
14833,
14841,
14849,
14854,
14892,
14942,
14972,
14973,
15004,
15005,
15018,
15077,
15197,
15279,
15399,
15473,
15672,
15673,
15682,
15683,
15687,
15691,
15695,
15699,
15703,
15707,
15711,
15715,
15719,
15723,
15727,
15731,
15735,
15739,
15743,
15747,
15751,
15755,
15759,
15763,
15767,
15771,
15775,
15779,
15783,
15787,
15791,
15795,
15799,
15803,
15807,
15811,
15815,
15819,
15823,
15827,
15831,
15835,
15839,
15843,
15847,
15851,
15855,
15859,
15879,
15897,
15918,
15939,
15941,
15960,
15984,
15986,
16057,
16075,
16077,
16079,
16131,
16133,
16148,
16150,
16172,
16174,
16196,
16210,
16235,
16260,
16265,
16297,
16315,
16335,
16341,
16343,
16375,
16377,
16423,
16469,
16559,
16577,
16579,
16602,
16625,
16679,
16744,
16836,
16838,
16852,
16854,
16855,
16864,
16865,
16894,
16923,
16947,
16948,
16955,
16962,
16986,
16987,
17057,
17058,
17074,
17121,
17238,
17300,
17417,
17487,
17579,
17587,
17595,
17603,
17611,
17619,
17624,
17668,
17716,
17748,
17788,
17867,
17966,
17982,
18029,
18124,
18186,
18295,
18372,
18388,
18435,
18530,
18592,
18701,
18787,
18795,
18803,
18811,
18819,
18827,
18832,
18876,
18924,
18967,
19010,
19071,
19121,
19122,
19146,
19147,
19189,
19271,
19328,
19424,
19425,
19604,
19605,
19609,
19613,
19617,
19621,
19625,
19659,
19677,
19711,
19750,
19756,
19757,
19802,
19803,
19819,
19857,
19936,
19989,
20082,
20144,
20160,
20198,
20277,
20330,
20423,
20494,
20502,
20510,
20518,
20526,
20534,
20539,
20583,
20624,
20665,
20740,
20815,
20844,
20867,
20890,
20891,
20906,
20907,
20968,
20969,
20981,
21028,
21132,
21224,
21239,
21302,
21405,
21514,
21531,
21597,
21695,
21769,
21902,
21922,
22005,
22106,
22179,
22329,
22330,
22339,
22340,
22344,
22348,
22352,
22356,
22360,
22364,
22368,
22372,
22376,
22380,
22384,
22388,
22392,
22396,
22400,
22404,
22408,
22412,
22416,
22420,
22424,
22428,
22432,
22436,
22440,
22444,
22448,
22452,
22456,
22460,
22464,
22468,
22472,
22476,
22480,
22484,
22488,
22492,
22496,
22500,
22504,
22508,
22512,
22532,
22550,
22571,
22592,
22594,
22613,
22637,
22639,
22710,
22728,
22730,
22732,
22776,
22778,
22793,
22795,
22817,
22819,
22841,
22855,
22880,
22894,
22918,
22923,
22955,
22975,
22995,
23001,
23003,
23021,
23060,
23095,
23097,
23115,
23153,
23188,
23190,
23249,
23272,
23306,
23308,
23322,
23324,
23325,
23334,
23335,
23364,
23398,
23428,
23462,
23469,
23481,
23482,
23560,
23561,
23572,
23619,
23709,
23776,
23790,
23845,
23938,
24006,
24022,
24088,
24201,
24290,
24309,
24383,
24499,
24589,
24600,
24638,
24712,
24772,
24868,
25079,
25095,
25153,
25250,
25331,
25450,
25525,
25526,
25567,
25568,
25577,
25624,
25701,
25750,
25761,
25819,
25883,
25933,
25946,
26000,
26080,
26159,
26174,
26239,
26305,
26391,
26392,
26420,
26421,
26430,
26488,
26578,
26690,
26708,
26783,
26885,
26959,
27108,
27109,
27137,
27138,
27150,
27194,
27270,
27316,
27333,
27399,
27513,
27583,
27584,
27620,
27621,
27632,
27669,
27756,
27836,
27852,
27912,
28014,
28070,
28174,
28175,
28213,
28214,
28284,
28379,
28433,
28555,
28632,
28733,
28794,
28914,
28915,
28950,
28951,
28970,
29013,
29094,
29166,
29276,
29330,
29331,
29361,
29362,
29371,
29417,
29445,
29519,
29628,
29661,
29662,
29691,
29692,
29702,
29783,
29855,
29927,
29977,
29982,
30078,
30150,
30222,
30286,
30435,
30453,
30497,
30610,
30615,
30674,
30786,
30825,
31084,
31105,
31189,
31210,
31223,
31224,
31304,
31305,
31324,
31405,
31486,
31567,
31626,
31631,
31727,
31808,
31889,
31962,
32187,
32205,
32214,
32233,
32252,
32264,
32277,
32401,
32422,
32502,
32585,
32668,
32729,
32734,
32829,
32912,
32995,
33070,
33230,
33248,
33255,
33274,
33295,
33304,
33317,
33346,
33426,
33517,
33608,
33677,
33682,
33777,
33868,
33959,
34042,
34188,
34206,
34213,
34232,
34257,
34279,
34292,
34306,
34386,
34462,
34538,
34592,
34597,
34692,
34768,
34844,
34912,
35052,
35070,
35077,
35096,
35115,
35143,
35156,
35157,
35164,
35165,
35191,
35192,
35202,
35247,
35327,
35392,
35405,
35458,
35541,
35625,
35626,
35683,
35684,
35694,
35753,
35838,
35843,
35924,
36031,
36211,
36224,
36283,
36348,
36413,
36418,
36492,
36557,
36622,
36656,
36747,
36775,
36834,
36914,
36994,
36999,
37073,
37153,
37233,
37283,
37500,
37511,
37522,
37567,
37575,
37636,
37642,
37681,
37738,
37771,
37779,
37840,
37846,
37885,
37942,
37975,
37976,
38012,
38013,
38026,
38078,
38155,
38214,
38237,
38266,
38310,
38346,
38364,
38370,
38419,
38456,
38493,
38507,
38586,
38659,
38731,
38736,
38839,
38914,
38990,
39048,
39426,
39427,
39468,
39469,
39490,
39533,
39618,
39623,
39681,
39780,
39923,
39944,
39987,
40072,
40077,
40135,
40234,
40379,
40380,
40495,
40496,
40604
],
"line_end_idx": [
1,
16,
17,
18,
19,
29,
30,
191,
192,
213,
214,
221,
222,
248,
249,
287,
354,
407,
488,
489,
732,
733,
771,
845,
898,
986,
987,
1079,
1080,
1089,
1090,
1094,
1098,
1102,
1106,
1110,
1114,
1118,
1122,
1126,
1130,
1134,
1138,
1142,
1146,
1150,
1154,
1158,
1162,
1166,
1170,
1174,
1178,
1182,
1186,
1190,
1194,
1198,
1202,
1206,
1210,
1214,
1218,
1222,
1226,
1230,
1234,
1238,
1242,
1246,
1250,
1254,
1258,
1262,
1266,
1270,
1274,
1278,
1282,
1286,
1290,
1294,
1298,
1302,
1321,
1341,
1359,
1380,
1401,
1403,
1415,
1417,
1431,
1434,
1500,
1502,
1554,
1556,
1587,
1589,
1611,
1613,
1628,
1630,
1652,
1672,
1674,
1696,
1711,
1716,
1748,
1774,
1801,
1829,
1835,
1837,
1857,
1928,
1946,
1948,
1968,
2039,
2057,
2062,
2092,
2128,
2133,
2153,
2224,
2242,
2244,
2264,
2335,
2353,
2355,
2369,
2371,
2372,
2381,
2382,
2415,
2498,
2531,
2614,
2615,
2659,
2660,
2699,
2803,
2804,
2858,
2976,
2977,
3230,
3231,
3342,
3343,
3403,
3484,
3594,
3595,
3670,
3750,
3860,
3915,
3916,
3984,
3985,
3994,
3995,
3999,
4003,
4007,
4011,
4015,
4019,
4023,
4027,
4031,
4035,
4039,
4043,
4047,
4051,
4055,
4059,
4063,
4067,
4071,
4075,
4079,
4083,
4087,
4091,
4095,
4099,
4103,
4107,
4111,
4115,
4119,
4123,
4127,
4131,
4135,
4139,
4158,
4178,
4196,
4217,
4238,
4253,
4255,
4277,
4297,
4299,
4327,
4351,
4356,
4388,
4421,
4427,
4429,
4451,
4522,
4540,
4542,
4593,
4602,
4624,
4695,
4713,
4715,
4778,
4780,
4802,
4910,
4928,
4930,
4944,
4946,
4947,
4956,
4957,
4992,
5027,
5047,
5048,
5091,
5092,
5127,
5162,
5182,
5183,
5192,
5193,
5213,
5214,
5253,
5353,
5355,
5409,
5523,
5524,
5687,
5688,
5697,
5698,
5702,
5706,
5710,
5714,
5718,
5722,
5726,
5730,
5734,
5738,
5742,
5746,
5750,
5754,
5758,
5762,
5766,
5770,
5774,
5778,
5782,
5786,
5790,
5794,
5798,
5802,
5806,
5825,
5845,
5863,
5884,
5905,
5920,
5922,
5944,
5962,
5964,
5986,
6018,
6044,
6050,
6052,
6072,
6143,
6161,
6163,
6213,
6218,
6238,
6309,
6327,
6329,
6343,
6345,
6346,
6375,
6376,
6409,
6442,
6443,
6499,
6500,
6539,
6611,
6612,
6665,
6751,
6752,
7133,
7134,
7198,
7199,
7238,
7310,
7311,
7364,
7450,
7451,
7492,
7493,
7509,
7510,
7578,
7579,
7651,
7652,
7691,
7762,
7816,
7901,
7940,
8012,
8066,
8152,
8153,
8235,
8236,
8266,
8279,
8280,
8340,
8341,
8359,
8390,
8391,
8549,
8550,
8559,
8560,
8564,
8568,
8572,
8576,
8580,
8584,
8588,
8592,
8596,
8600,
8604,
8608,
8612,
8616,
8620,
8624,
8628,
8632,
8636,
8640,
8644,
8648,
8652,
8656,
8660,
8664,
8668,
8672,
8676,
8680,
8684,
8688,
8708,
8726,
8747,
8768,
8783,
8785,
8807,
8809,
8831,
8863,
8883,
8889,
8929,
8931,
8951,
9022,
9040,
9042,
9077,
9082,
9102,
9173,
9191,
9193,
9228,
9233,
9253,
9324,
9342,
9347,
9361,
9363,
9364,
9373,
9374,
9408,
9442,
9476,
9477,
9528,
9529,
9546,
9547,
9564,
9565,
9762,
9763,
9822,
9823,
9834,
9835,
9839,
9843,
9847,
9851,
9855,
9859,
9863,
9867,
9871,
9875,
9879,
9883,
9887,
9891,
9895,
9899,
9903,
9907,
9911,
9915,
9919,
9923,
9927,
9931,
9935,
9939,
9943,
9947,
9951,
9955,
9959,
9963,
9967,
9971,
9975,
9979,
9983,
9987,
9991,
9995,
9999,
10003,
10007,
10011,
10015,
10019,
10023,
10027,
10031,
10035,
10039,
10043,
10047,
10064,
10084,
10102,
10123,
10144,
10159,
10161,
10180,
10200,
10219,
10221,
10238,
10268,
10300,
10325,
10327,
10348,
10384,
10406,
10416,
10418,
10462,
10484,
10518,
10540,
10594,
10596,
10640,
10662,
10703,
10725,
10779,
10781,
10825,
10847,
10904,
10926,
10980,
10982,
11026,
11048,
11104,
11126,
11180,
11182,
11199,
11205,
11207,
11223,
11225,
11239,
11241,
11242,
11251,
11252,
11266,
11267,
11384,
11385,
11390,
11391,
11426,
11427,
11436,
11481,
11563,
11636,
11648,
11700,
11785,
11861,
11879,
11942,
12028,
12114,
12200,
12286,
12372,
12431,
12526,
12527,
12560,
12561,
12572,
12635,
12714,
12793,
12879,
12958,
13037,
13089,
13237,
13250,
13313,
13394,
13475,
13561,
13642,
13723,
13777,
13925,
13926,
13970,
13971,
13989,
14027,
14108,
14169,
14272,
14344,
14357,
14415,
14519,
14600,
14704,
14757,
14833,
14841,
14849,
14854,
14892,
14942,
14972,
14973,
15004,
15005,
15018,
15077,
15197,
15279,
15399,
15473,
15672,
15673,
15682,
15683,
15687,
15691,
15695,
15699,
15703,
15707,
15711,
15715,
15719,
15723,
15727,
15731,
15735,
15739,
15743,
15747,
15751,
15755,
15759,
15763,
15767,
15771,
15775,
15779,
15783,
15787,
15791,
15795,
15799,
15803,
15807,
15811,
15815,
15819,
15823,
15827,
15831,
15835,
15839,
15843,
15847,
15851,
15855,
15859,
15879,
15897,
15918,
15939,
15941,
15960,
15984,
15986,
16057,
16075,
16077,
16079,
16131,
16133,
16148,
16150,
16172,
16174,
16196,
16210,
16235,
16260,
16265,
16297,
16315,
16335,
16341,
16343,
16375,
16377,
16423,
16469,
16559,
16577,
16579,
16602,
16625,
16679,
16744,
16836,
16838,
16852,
16854,
16855,
16864,
16865,
16894,
16923,
16947,
16948,
16955,
16962,
16986,
16987,
17057,
17058,
17074,
17121,
17238,
17300,
17417,
17487,
17579,
17587,
17595,
17603,
17611,
17619,
17624,
17668,
17716,
17748,
17788,
17867,
17966,
17982,
18029,
18124,
18186,
18295,
18372,
18388,
18435,
18530,
18592,
18701,
18787,
18795,
18803,
18811,
18819,
18827,
18832,
18876,
18924,
18967,
19010,
19071,
19121,
19122,
19146,
19147,
19189,
19271,
19328,
19424,
19425,
19604,
19605,
19609,
19613,
19617,
19621,
19625,
19659,
19677,
19711,
19750,
19756,
19757,
19802,
19803,
19819,
19857,
19936,
19989,
20082,
20144,
20160,
20198,
20277,
20330,
20423,
20494,
20502,
20510,
20518,
20526,
20534,
20539,
20583,
20624,
20665,
20740,
20815,
20844,
20867,
20890,
20891,
20906,
20907,
20968,
20969,
20981,
21028,
21132,
21224,
21239,
21302,
21405,
21514,
21531,
21597,
21695,
21769,
21902,
21922,
22005,
22106,
22179,
22329,
22330,
22339,
22340,
22344,
22348,
22352,
22356,
22360,
22364,
22368,
22372,
22376,
22380,
22384,
22388,
22392,
22396,
22400,
22404,
22408,
22412,
22416,
22420,
22424,
22428,
22432,
22436,
22440,
22444,
22448,
22452,
22456,
22460,
22464,
22468,
22472,
22476,
22480,
22484,
22488,
22492,
22496,
22500,
22504,
22508,
22512,
22532,
22550,
22571,
22592,
22594,
22613,
22637,
22639,
22710,
22728,
22730,
22732,
22776,
22778,
22793,
22795,
22817,
22819,
22841,
22855,
22880,
22894,
22918,
22923,
22955,
22975,
22995,
23001,
23003,
23021,
23060,
23095,
23097,
23115,
23153,
23188,
23190,
23249,
23272,
23306,
23308,
23322,
23324,
23325,
23334,
23335,
23364,
23398,
23428,
23462,
23469,
23481,
23482,
23560,
23561,
23572,
23619,
23709,
23776,
23790,
23845,
23938,
24006,
24022,
24088,
24201,
24290,
24309,
24383,
24499,
24589,
24600,
24638,
24712,
24772,
24868,
25079,
25095,
25153,
25250,
25331,
25450,
25525,
25526,
25567,
25568,
25577,
25624,
25701,
25750,
25761,
25819,
25883,
25933,
25946,
26000,
26080,
26159,
26174,
26239,
26305,
26391,
26392,
26420,
26421,
26430,
26488,
26578,
26690,
26708,
26783,
26885,
26959,
27108,
27109,
27137,
27138,
27150,
27194,
27270,
27316,
27333,
27399,
27513,
27583,
27584,
27620,
27621,
27632,
27669,
27756,
27836,
27852,
27912,
28014,
28070,
28174,
28175,
28213,
28214,
28284,
28379,
28433,
28555,
28632,
28733,
28794,
28914,
28915,
28950,
28951,
28970,
29013,
29094,
29166,
29276,
29330,
29331,
29361,
29362,
29371,
29417,
29445,
29519,
29628,
29661,
29662,
29691,
29692,
29702,
29783,
29855,
29927,
29977,
29982,
30078,
30150,
30222,
30286,
30435,
30453,
30497,
30610,
30615,
30674,
30786,
30825,
31084,
31105,
31189,
31210,
31223,
31224,
31304,
31305,
31324,
31405,
31486,
31567,
31626,
31631,
31727,
31808,
31889,
31962,
32187,
32205,
32214,
32233,
32252,
32264,
32277,
32401,
32422,
32502,
32585,
32668,
32729,
32734,
32829,
32912,
32995,
33070,
33230,
33248,
33255,
33274,
33295,
33304,
33317,
33346,
33426,
33517,
33608,
33677,
33682,
33777,
33868,
33959,
34042,
34188,
34206,
34213,
34232,
34257,
34279,
34292,
34306,
34386,
34462,
34538,
34592,
34597,
34692,
34768,
34844,
34912,
35052,
35070,
35077,
35096,
35115,
35143,
35156,
35157,
35164,
35165,
35191,
35192,
35202,
35247,
35327,
35392,
35405,
35458,
35541,
35625,
35626,
35683,
35684,
35694,
35753,
35838,
35843,
35924,
36031,
36211,
36224,
36283,
36348,
36413,
36418,
36492,
36557,
36622,
36656,
36747,
36775,
36834,
36914,
36994,
36999,
37073,
37153,
37233,
37283,
37500,
37511,
37522,
37567,
37575,
37636,
37642,
37681,
37738,
37771,
37779,
37840,
37846,
37885,
37942,
37975,
37976,
38012,
38013,
38026,
38078,
38155,
38214,
38237,
38266,
38310,
38346,
38364,
38370,
38419,
38456,
38493,
38507,
38586,
38659,
38731,
38736,
38839,
38914,
38990,
39048,
39426,
39427,
39468,
39469,
39490,
39533,
39618,
39623,
39681,
39780,
39923,
39944,
39987,
40072,
40077,
40135,
40234,
40379,
40380,
40495,
40496,
40604,
40643
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 40643,
"ccnet_original_nlines": 1279,
"rps_doc_curly_bracket": 0.00142705999314785,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.05782492831349373,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.10663130134344101,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.7402299046516418,
"rps_doc_frac_unique_words": 0.1889667809009552,
"rps_doc_mean_word_length": 9.440719604492188,
"rps_doc_num_sentences": 104,
"rps_doc_symbol_to_word_ratio": 0.0022988501004874706,
"rps_doc_unigram_entropy": 5.136999607086182,
"rps_doc_word_count": 3281,
"rps_doc_frac_chars_dupe_10grams": 0.177046000957489,
"rps_doc_frac_chars_dupe_5grams": 0.46317997574806213,
"rps_doc_frac_chars_dupe_6grams": 0.3872154951095581,
"rps_doc_frac_chars_dupe_7grams": 0.3468603789806366,
"rps_doc_frac_chars_dupe_8grams": 0.29149314761161804,
"rps_doc_frac_chars_dupe_9grams": 0.24222759902477264,
"rps_doc_frac_chars_top_2gram": 0.04322841018438339,
"rps_doc_frac_chars_top_3gram": 0.0026150099001824856,
"rps_doc_frac_chars_top_4gram": 0.0029701399616897106,
"rps_doc_books_importance": -5021.6025390625,
"rps_doc_books_importance_length_correction": -5021.6025390625,
"rps_doc_openwebtext_importance": -3212.155517578125,
"rps_doc_openwebtext_importance_length_correction": -3212.155517578125,
"rps_doc_wikipedia_importance": -2061.0517578125,
"rps_doc_wikipedia_importance_length_correction": -2061.0517578125
},
"fasttext": {
"dclm": 0.15691238641738892,
"english": 0.27975335717201233,
"fineweb_edu_approx": 1.5529614686965942,
"eai_general_math": 0.7470414042472839,
"eai_open_web_math": 0.0018374300561845303,
"eai_web_code": 0.8696079850196838
}
}
|
{
"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.72",
"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": "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": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,235,642,710,283,653,000 |
Uploaded image for project: 'Apache Arrow'
1. Apache Arrow
2. ARROW-17005
[Java] Incorrect results from JDBC Adapter from Postgres of non-nullable column through left join
XMLWordPrintableJSON
Details
• Wish
• Status: Resolved
• Major
• Resolution: Fixed
• None
• 9.0.0
• Java
Description
Unsure to consider this a bug or wish, but the JDBC to Arrow Adapter produces incorrect results when wrapping the postgres driver in certain cases.
If you left join a non-nullable column, the column becomes nullable (if the join condition does not match any columns). However the postgres ResultSetMetaData lies to you and still indicates that the column is still non-nullable.
When iterating through the data, results come back as null (isNull will return true).
However, because of the way that the JDBCConsumer is created, it creates a non-nullable consumer and will not check the nullability of these results.
Unfortunately, this results in incorrect data or errors depending on the data types returned.
The postgres JDBC team has closed a ticket about this indicating that it would be impossible for them to return the correct data nullability data to the JDBC driver. see: https://github.com/pgjdbc/pgjdbc/issues/2079
An example:
Table:
t1.id
2
3
CREATE TABLE t1 (id integer NOT NULL);
INSERT INTO t1 VALUES (2), (3);
Query
WITH t2 AS (SELECT 1 AS id UNION SELECT 2)
SELECT
t1.id
FROM t2
LEFT JOIN t1 on t1.id = t2.id;
This returns the result set:
id
2
null
The ResultSetMetaData indicates that the column is non-nullable (as t1.id is non-nullable) but there is null data in the result.
The Arrow Vector that is present after the result set is consumed, looks like this:
id
2
0
ResultSet.getInt(1) will return 0 when the source data is null, with an expectation that you check isNull.
The data is incorrect and silently fails potentially leading to clients / consumers getting bad data.
In other cases, such as UUID (mapped to UTF-8 vectors) the value will fail to load into arrow due to expecting null data and throwing a NPE when deserializing / converting to bytearrays.
I was able to work around this problem by wrapping the postgres JDBC ResultSetMetadata and always forcing the nullability to nullable (or nullability unknown).
Unfortunately I don't think there is a great way to solve this, but perhaps some way to configure / override the JDBCConsumer creation would allow for users of this library to override this behavior, however the silent failure and incorrect data might lead to users not noticing.
Attachments
Issue Links
Activity
People
lidavidm David Li
jswenson Jonathan Swenson
Votes:
0 Vote for this issue
Watchers:
4 Start watching this issue
Dates
Created:
Updated:
Resolved:
Time Tracking
Estimated:
Original Estimate - Not Specified
Not Specified
Remaining:
Remaining Estimate - 0h
0h
Logged:
Time Spent - 40m
40m
|
{
"url": "https://issues.apache.org/jira/browse/ARROW-17005",
"source_domain": "issues.apache.org",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "118967",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EALSOTDQE2EXS3K34LHR5FQ35AH6G7RQ",
"WARC-Concurrent-To": "<urn:uuid:9a985f9d-f1c7-4bf4-b475-5ec91d5c9cbd>",
"WARC-Date": "2024-02-25T22:58:17Z",
"WARC-IP-Address": "168.119.33.54",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IPZPCZ4TAWAYLU7SGS4EUP3I3X2SFLM7",
"WARC-Record-ID": "<urn:uuid:01435ab6-bb3b-431c-9f11-a4c35d4a6a03>",
"WARC-Target-URI": "https://issues.apache.org/jira/browse/ARROW-17005",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0443f280-d8ba-49d4-880c-87486785aa06>"
},
"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-88\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,
43,
61,
78,
79,
177,
178,
203,
204,
212,
213,
224,
247,
259,
283,
294,
306,
317,
318,
334,
335,
490,
491,
728,
729,
822,
823,
980,
981,
1082,
1083,
1305,
1306,
1325,
1326,
1340,
1341,
1353,
1361,
1369,
1414,
1452,
1459,
1460,
1472,
1473,
1522,
1536,
1551,
1566,
1603,
1604,
1639,
1640,
1649,
1657,
1668,
1669,
1805,
1806,
1897,
1898,
1907,
1915,
1923,
1924,
2038,
2039,
2148,
2149,
2157,
2158,
2352,
2353,
2361,
2362,
2529,
2530,
2817,
2818,
2836,
2837,
2857,
2858,
2877,
2878,
2897,
2898,
2930,
2970,
2991,
3027,
3051,
3093,
3094,
3114,
3115,
3140,
3165,
3191,
3192,
3222,
3223,
3252,
3304,
3336,
3365,
3407,
3428,
3454,
3489
],
"line_end_idx": [
43,
61,
78,
79,
177,
178,
203,
204,
212,
213,
224,
247,
259,
283,
294,
306,
317,
318,
334,
335,
490,
491,
728,
729,
822,
823,
980,
981,
1082,
1083,
1305,
1306,
1325,
1326,
1340,
1341,
1353,
1361,
1369,
1414,
1452,
1459,
1460,
1472,
1473,
1522,
1536,
1551,
1566,
1603,
1604,
1639,
1640,
1649,
1657,
1668,
1669,
1805,
1806,
1897,
1898,
1907,
1915,
1923,
1924,
2038,
2039,
2148,
2149,
2157,
2158,
2352,
2353,
2361,
2362,
2529,
2530,
2817,
2818,
2836,
2837,
2857,
2858,
2877,
2878,
2897,
2898,
2930,
2970,
2991,
3027,
3051,
3093,
3094,
3114,
3115,
3140,
3165,
3191,
3192,
3222,
3223,
3252,
3304,
3336,
3365,
3407,
3428,
3454,
3489,
3510
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3510,
"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.3041957914829254,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04895104840397835,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21328671276569366,
"rps_doc_frac_unique_words": 0.4867841303348541,
"rps_doc_mean_word_length": 5.00220251083374,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.006978511810303,
"rps_doc_word_count": 454,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.02113606035709381,
"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.019374720752239227,
"rps_doc_frac_chars_top_3gram": 0.016732720658183098,
"rps_doc_frac_chars_top_4gram": 0.019374720752239227,
"rps_doc_books_importance": -316.9015197753906,
"rps_doc_books_importance_length_correction": -316.9015197753906,
"rps_doc_openwebtext_importance": -186.77069091796875,
"rps_doc_openwebtext_importance_length_correction": -186.77069091796875,
"rps_doc_wikipedia_importance": -130.569580078125,
"rps_doc_wikipedia_importance_length_correction": -130.569580078125
},
"fasttext": {
"dclm": 0.0182987991720438,
"english": 0.8368774652481079,
"fineweb_edu_approx": 1.8190734386444092,
"eai_general_math": 0.056601349264383316,
"eai_open_web_math": 0.2445177435874939,
"eai_web_code": 0.4205101728439331
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,824,971,032,686,129,700 |
The tag has no usage guidance.
learn more… | top users | synonyms
1
vote
1answer
19 views
How to store binary data referenced by 3D coordinates (xyz)?
I would like to store huge amounts of voxels (3D cubes with color and some other values) in a gis database. Does someone can recommend a database (indexing) system, where I can store binary data (a ...
1
vote
1answer
51 views
Save millions of points in the server side
I have asked a similar question about millions of points a few days ago:Display millions of points in the browser. It focused on how to display these data in the client(browser), however I think it ...
0
votes
1answer
150 views
What is the best way to manage geodata with open source software?
We are a small group of GIS users with different expertises embedded in an administrative infrastructure attempting to switch to a small and low cost open source infrastructure (open source GDI). ...
3
votes
0answers
52 views
What alternatives are there for hosting shapefiles too large for GeoCommons?
I've got a ~500M shapefile I'd like to place where it is publicly accessible and can be found via search. Specifically this dataset is the Bernalillo County, NM assessor parcel and tax database, which ...
4
votes
2answers
116 views
Storage hardware options for large datasets
We are about to organize our data in a centralized spatial data system. The system would provide various services (mainly supporting ftp access, geodatabase editing, and several web mapping ...
2
votes
1answer
2k views
How to restore a back up file into pgadmin III
My backup file containing about 50-60 tables , but I am able to just load only 6 tables for a new db and 31 tables for postgis dbase . And this was the error when I restore a backup file. pg_restore: ...
3
votes
1answer
286 views
How to store data for gis system?
I'm developing a GIS solution using Postgis database and geoserver as web map server. The solution to develop will analyzes the defects (as a polygon) and process parameters values (as a linestring) ...
4
votes
3answers
194 views
Store “template” mxds inside model
Since the ability to store mxds inside a file gdb is still just an idea, I've been mulling over my options for using a "template" mxd within a model. My model uses 4 different mxds, but currently it ...
10
votes
3answers
1k views
Google Drive and Backing-up/Syncing GIS Data
Seeing that many of us have three computers these days (e.g.. work, home and laptop) is anyone using Google Drive as their main file repository for GIS data? I like the idea of backing everything up ...
3
votes
1answer
544 views
Online/cloud storage options for GIS file-based data [closed]
I am currently looking into online/cloud-based storage solutions in general and also for my GIS data which consists of shapefiles, rasters, file geodatabases, and the like (no relational databases). ...
20
votes
2answers
2k views
What are the benefits of Multipart Features?
Multipart points, lines, and polygons are implemented in nearly every GIS, but what benefits, if any, do they provide? In a relational database attributes shared by different features can be stored ...
4
votes
3answers
237 views
Organization in a GIS Shop
This question is about staying organized and current on all your to dos and project tasks. For me I am an avid user of GTD and a variety of online tools such as evernote, toodledo, and gmail. I ...
|
{
"url": "http://gis.stackexchange.com/questions/tagged/data-storage",
"source_domain": "gis.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2015-35",
"warc_metadata": {
"Content-Length": "76724",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JJFP3AVKXMV6NAEJ6ZV4PYRWNX5EX5C4",
"WARC-Concurrent-To": "<urn:uuid:bf6506b8-3890-4728-91d7-e8c82f2f9a51>",
"WARC-Date": "2015-08-29T09:26:36Z",
"WARC-IP-Address": "104.16.12.128",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:GF66FGPFOGD4ZLSXLAFTKWOAXEWL36I5",
"WARC-Record-ID": "<urn:uuid:f4be1089-c174-471d-a134-bf464677e659>",
"WARC-Target-URI": "http://gis.stackexchange.com/questions/tagged/data-storage",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:884b2702-70b7-43a7-8f45-8ba31d1dde01>"
},
"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,
31,
32,
67,
68,
70,
75,
83,
92,
93,
154,
155,
357,
359,
364,
372,
381,
382,
425,
426,
628,
630,
636,
644,
654,
655,
721,
722,
922,
924,
930,
939,
948,
949,
1026,
1027,
1232,
1234,
1240,
1249,
1259,
1260,
1304,
1305,
1499,
1501,
1507,
1515,
1524,
1525,
1572,
1573,
1777,
1779,
1785,
1793,
1803,
1804,
1838,
1839,
2042,
2044,
2050,
2059,
2069,
2070,
2105,
2106,
2309,
2312,
2318,
2327,
2336,
2337,
2382,
2383,
2586,
2588,
2594,
2602,
2612,
2613,
2675,
2676,
2879,
2882,
2888,
2897,
2906,
2907,
2952,
2953,
3155,
3157,
3163,
3172,
3182,
3183,
3210,
3211
],
"line_end_idx": [
31,
32,
67,
68,
70,
75,
83,
92,
93,
154,
155,
357,
359,
364,
372,
381,
382,
425,
426,
628,
630,
636,
644,
654,
655,
721,
722,
922,
924,
930,
939,
948,
949,
1026,
1027,
1232,
1234,
1240,
1249,
1259,
1260,
1304,
1305,
1499,
1501,
1507,
1515,
1524,
1525,
1572,
1573,
1777,
1779,
1785,
1793,
1803,
1804,
1838,
1839,
2042,
2044,
2050,
2059,
2069,
2070,
2105,
2106,
2309,
2312,
2318,
2327,
2336,
2337,
2382,
2383,
2586,
2588,
2594,
2602,
2612,
2613,
2675,
2676,
2879,
2882,
2888,
2897,
2906,
2907,
2952,
2953,
3155,
3157,
3163,
3172,
3182,
3183,
3210,
3211,
3408
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3408,
"ccnet_original_nlines": 99,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3348017632961273,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04258443042635918,
"rps_doc_frac_lines_end_with_ellipsis": 0.11999999731779099,
"rps_doc_frac_no_alph_words": 0.17474302649497986,
"rps_doc_frac_unique_words": 0.5139372944831848,
"rps_doc_mean_word_length": 4.656794548034668,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0.01908957026898861,
"rps_doc_unigram_entropy": 5.259983539581299,
"rps_doc_word_count": 574,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.01571268029510975,
"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.007482230197638273,
"rps_doc_frac_chars_top_3gram": 0.011223340407013893,
"rps_doc_frac_chars_top_4gram": 0.011223340407013893,
"rps_doc_books_importance": -270.5016784667969,
"rps_doc_books_importance_length_correction": -270.5016784667969,
"rps_doc_openwebtext_importance": -145.38230895996094,
"rps_doc_openwebtext_importance_length_correction": -145.38230895996094,
"rps_doc_wikipedia_importance": -109.8349380493164,
"rps_doc_wikipedia_importance_length_correction": -109.8349380493164
},
"fasttext": {
"dclm": 0.02802431955933571,
"english": 0.9204060435295105,
"fineweb_edu_approx": 1.3625327348709106,
"eai_general_math": 0.00884240958839655,
"eai_open_web_math": 0.15250766277313232,
"eai_web_code": 0.0015496599953621626
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "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": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,900,136,449,131,686,400 |
Become a MacRumors Supporter for $50/year with no ads, ability to filter front page stories, and private forums.
rich2k4
macrumors regular
Original poster
Apr 15, 2009
110
0
i installed it because i thought i needed it, but it turns out i don't, and i don't want it on my system. anyway to get rid of it?
SilentPanda
Moderator emeritus
Oct 8, 2002
9,992
31
The Bamboo Forest
You might be able to uninstall it by putting in the Snow Leopard disc and running the Additional Packages.pkg (or whatever it is).
It only takes like 3 MB on your disc though so I don't know that there is too much reason to remove it.
rich2k4
macrumors regular
Original poster
Apr 15, 2009
110
0
i tried that, it doesn't let me uninstall.
i'm just worried it might somehow slow down my system
zenoran
macrumors regular
Aug 19, 2009
111
0
i tried that, it doesn't let me uninstall.
i'm just worried it might somehow slow down my system
supposedly it only runs when it's needed and there is no trace otherwise. disk space is the only drawback of having it installed.
mcmanus7
macrumors 6502a
Oct 30, 2008
708
87
as mentioned above Rosetta is only a 2-3 mb install.... and only runs when it is needed therefore it really has no impact on your computer unless you REALLY need that 2-3 mb back...
TheSpaz
macrumors 604
Jun 20, 2005
7,032
1
as mentioned above Rosetta is only a 2-3 mb install.... and only runs when it is needed therefore it really has no impact on your computer unless you REALLY need that 2-3 mb back...
Hahahahaha!
The only reason I refuse to install Rosetta is because I'm trying to train myself not to use old PPC apps. If I try to open a PPC app (like Iconographer for example) and it wants me to install Rosetta, I just abandon that idea and try to find an intel app that does the same thing.
maflynn
macrumors Haswell
May 3, 2009
73,145
42,870
Hahahahaha!
The only reason I refuse to install Rosetta is because I'm trying to train myself not to use old PPC apps. If I try to open a PPC app (like Iconographer for example) and it wants me to install Rosetta, I just abandon that idea and try to find an intel app that does the same thing.
That doesn't work when there's no other apps or ways to use something. For instance, some drivers require it and w/o your scanner or printer won't work :(
TheSpaz
macrumors 604
Jun 20, 2005
7,032
1
That doesn't work when there's no other apps or ways to use something. For instance, some drivers require it and w/o your scanner or printer won't work :(
True. Fortunately, I don't have that problem, but everyone's needs are different right?
rdowns
macrumors Penryn
Jul 11, 2003
27,397
12,518
I didn't install it and the MS Office installer needed it. Not like I'm going to obsess the drive space.
Amdahl
macrumors 65816
Jul 28, 2004
1,438
1
Hahahahaha!
The only reason I refuse to install Rosetta is because I'm trying to train myself not to use old PPC apps. If I try to open a PPC app (like Iconographer for example) and it wants me to install Rosetta, I just abandon that idea and try to find an intel app that does the same thing.
I'm curious... What do you see if open Terminal and do
Code:
ls -l /private/var/db/dyld
Rainier42
macrumors member
Aug 21, 2009
69
0
There is an application/utility called Monolingual (http://monolingual.sourceforge.net/) that allows you to delete all languages from your machine that you feel you don't need. Under the third tab, labeled Architectures, there are entries for removing PPC code. Just be careful ... if you remove something that is needed, you may have to reload your OS.
rich2k4
macrumors regular
Original poster
Apr 15, 2009
110
0
so there is absolutely no way of uninstalling rosetta if i don't want it at all
DOUGHNUT
macrumors regular
Jan 8, 2006
244
11
try this,
go to finder, press command-f to bring up spotlight,
under the left drop down box, select other and select system files (meaning, spotlight will include system files when searching),
right drop down box select "are included"
select File Name on the top spotlight bar.
spotlight search "rosetta" and delete the files. i don't know if you're gonna break anything since you're tinkering with system files, so i personally wouldn't try it...but if it really bothers you, you have no other choice.
calderone
Cancelled
Aug 28, 2009
3,743
352
In all seriousness, it isn't a huge deal. It will not slow you down just by being there. Just avoid PPC apps. But here you go. Rosetta is in:
Code:
/usr/libexec/oah/
This is what the bom from the Rosetta package reveals.
I am also curious to know what the result of:
Code:
ls -l /private/var/db/dyld
For those who did not install Rosetta. Since the bom didn't include paths to there, I am guessing these:
Code:
dyld_shared_cache_rosetta
dyld_shared_cache_rosetta.map
Come from somewhere else during installation, and are probably installed by default.
There is an application/utility called Monolingual (http://monolingual.sourceforge.net/) that allows you to delete all languages from your machine that you feel you don't need. Under the third tab, labeled Architectures, there are entries for removing PPC code. Just be careful ... if you remove something that is needed, you may have to reload your OS.
This removes PPC code from applications, it does not remove the actual translator, i.e. Rosetta.
xraydoc
macrumors demi-god
Oct 9, 2005
10,297
4,610
192.168.1.1
The only reason I refuse to install Rosetta is because I'm trying to train myself not to use old PPC apps. If I try to open a PPC app (like Iconographer for example) and it wants me to install Rosetta, I just abandon that idea and try to find an intel app that does the same thing.
Ditto. Though if I end up needing it at some point I'm definitely not going to obsess about it.
sidewinder
macrumors 68020
Dec 10, 2008
2,425
130
Northern California
I am also curious to know what the result of:
Code:
ls -l /private/var/db/dyld
Code:
$ ls -l /private/var/db/dyld
total 1166312
-rw-r--r-- 1 root wheel 199147520 Aug 28 14:04 dyld_shared_cache_i386
-rw-r--r-- 1 root wheel 49274 Aug 28 14:04 dyld_shared_cache_i386.map
-rw-r--r-- 1 root admin 200429568 Aug 31 22:02 dyld_shared_cache_rosetta
-rw-r--r-- 1 root admin 41832 Aug 31 22:02 dyld_shared_cache_rosetta.map
-rw-r--r-- 1 root wheel 197427200 Aug 28 14:04 dyld_shared_cache_x86_64
-rw-r--r-- 1 root wheel 48528 Aug 28 14:04 dyld_shared_cache_x86_64.map
drwxr-xr-x 8 root wheel 272 Jul 14 01:58 shared_region_roots
S-
Ramashalanka
macrumors regular
Dec 26, 2008
125
81
Lanka Ravi Shanka
I am also curious to know what the result of:
Code:
ls -l /private/var/db/dyld
For those who did not install Rosetta.
Code:
-rw-r--r-- 1 root wheel 199155712 1 Sep 17:58 dyld_shared_cache_i386
-rw-r--r-- 1 root wheel 49274 1 Sep 17:58 dyld_shared_cache_i386.map
-rw-r--r-- 1 root wheel 197373952 1 Sep 17:58 dyld_shared_cache_x86_64
-rw-r--r-- 1 root wheel 48528 1 Sep 17:58 dyld_shared_cache_x86_64.map
drwxr-xr-x 8 root wheel 272 14 Jul 20:58 shared_region_roots
Amdahl
macrumors 65816
Jul 28, 2004
1,438
1
Ramashalanka, how about this one:
Code:
file /System/Library/Frameworks/Foundation.framework/Versions/Current/Foundation
Ramashalanka
macrumors regular
Dec 26, 2008
125
81
Lanka Ravi Shanka
Ramashalanka, how about this one:
Code:
file /System/Library/Frameworks/Foundation.framework/Versions/Current/Foundation
This is the size of the file that's there, is that what you were asking for? I don't have a machine with Rosetta to see if it's any bigger with that installed.
Code:
lrwxr-xr-x 1 root wheel 28 1 Sep 17:50 CodeResources -> _CodeSignature/CodeResources
-rwxr-xr-x 1 root wheel 11760720 17 Jul 17:27 Foundation
drwxr-xr-x 128 root wheel 4352 17 Jul 17:26 Headers
drwxr-xr-x 27 root wheel 918 1 Sep 17:51 Resources
drwxr-xr-x 3 root wheel 102 17 Jul 17:27 _CodeSignature
Amdahl
macrumors 65816
Jul 28, 2004
1,438
1
This is the size of the file that's there, is that what you were asking for? I don't have a machine with Rosetta to see if it's any bigger with that installed.
Code:
lrwxr-xr-x 1 root wheel 28 1 Sep 17:50 CodeResources -> _CodeSignature/CodeResources
-rwxr-xr-x 1 root wheel 11760720 17 Jul 17:27 Foundation
drwxr-xr-x 128 root wheel 4352 17 Jul 17:26 Headers
drwxr-xr-x 27 root wheel 918 1 Sep 17:51 Resources
drwxr-xr-x 3 root wheel 102 17 Jul 17:27 _CodeSignature
Well, I have Rosetta (10.5), and mine is 18159328 supporting four architectures (AMD64, x86, ppc, ppc64)
So, that likely means that being able to run PowerPC code takes only 2.8MB, and doesn't actually put any PPC code in your system. People who dislike Rosetta are irrational.
If you can run the file command, that would help. I want to see what is in it. I don't think installing Rosetta has any effect, since Rosetta is only 2.8MB. The question was whether Snow Leopard still included PPC code in the libraries, which it appears it does not. But PPC was only included in the libraries so that PPC machines could boot and run, not so Rosetta would run.
Ramashalanka
macrumors regular
Dec 26, 2008
125
81
Lanka Ravi Shanka
If you can run the file command, that would help.
Interestingly, there is some ppc in there:
Code:
$ file Foundation
Foundation: Mach-O universal binary with 3 architectures
Foundation (for architecture x86_64): Mach-O 64-bit dynamically linked shared library x86_64
Foundation (for architecture i386): Mach-O dynamically linked shared library i386
Foundation (for architecture ppc7400): Mach-O dynamically linked shared library ppc
I'll probably install Rosetta eventually, I just don't need any PPC software at the moment.
Neotyguy40
macrumors regular
Jul 15, 2009
152
0
I only needed rosetta for an installer. And now I don't need it anymore.
Anyone know how I can uninstall it? I know it doesn't do much, but I still want to uninstall it.
Amdahl
macrumors 65816
Jul 28, 2004
1,438
1
I only needed rosetta for an installer. And now I don't need it anymore.
Anyone know how I can uninstall it? I know it doesn't do much, but I still want to uninstall it.
Try an Erase & Install. And use candles too. They help.
Register on MacRumors! This sidebar will go away, and you'll see fewer ads.
|
{
"url": "https://forums.macrumors.com/threads/is-there-anyway-to-uninstall-rosetta.778254/",
"source_domain": "forums.macrumors.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "265555",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2ZQM5WWE7EJMSVQ3ZJI5DAYTRLGSZ2ZV",
"WARC-Concurrent-To": "<urn:uuid:ac71265d-c03d-447b-8492-f1c24bc158d3>",
"WARC-Date": "2023-09-26T22:22:23Z",
"WARC-IP-Address": "172.67.22.130",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:P3UDQ7MKLFWQXFKGOOHO3JRGTXZ5Y3P5",
"WARC-Record-ID": "<urn:uuid:2facde21-a5f6-41e4-bce6-52b3e156cdbd>",
"WARC-Target-URI": "https://forums.macrumors.com/threads/is-there-anyway-to-uninstall-rosetta.778254/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fffea213-6cdc-4289-bca7-829a0393b328>"
},
"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-67\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,
113,
114,
122,
123,
141,
157,
170,
174,
176,
307,
309,
310,
322,
323,
342,
354,
360,
363,
381,
512,
513,
617,
619,
620,
628,
629,
647,
663,
676,
680,
682,
725,
726,
780,
782,
783,
791,
792,
810,
823,
827,
829,
872,
873,
927,
928,
1058,
1060,
1061,
1070,
1071,
1087,
1100,
1104,
1107,
1289,
1291,
1292,
1300,
1301,
1315,
1328,
1334,
1336,
1518,
1519,
1531,
1532,
1814,
1816,
1817,
1825,
1826,
1844,
1856,
1863,
1870,
1882,
1883,
2165,
2166,
2321,
2323,
2324,
2332,
2333,
2347,
2360,
2366,
2368,
2523,
2524,
2612,
2614,
2615,
2622,
2623,
2640,
2653,
2660,
2667,
2772,
2774,
2775,
2782,
2783,
2799,
2812,
2818,
2820,
2832,
2833,
3115,
3116,
3171,
3177,
3204,
3206,
3207,
3217,
3218,
3235,
3248,
3251,
3253,
3607,
3609,
3610,
3618,
3619,
3637,
3653,
3666,
3670,
3672,
3752,
3754,
3755,
3764,
3765,
3783,
3795,
3799,
3802,
3812,
3865,
3995,
4037,
4080,
4081,
4306,
4308,
4309,
4319,
4320,
4330,
4343,
4349,
4353,
4495,
4496,
4502,
4520,
4575,
4576,
4622,
4623,
4629,
4656,
4657,
4762,
4763,
4769,
4795,
4825,
4826,
4911,
4912,
5266,
5267,
5364,
5366,
5367,
5375,
5376,
5395,
5407,
5414,
5420,
5432,
5714,
5715,
5811,
5813,
5814,
5825,
5826,
5842,
5855,
5861,
5865,
5885,
5931,
5932,
5938,
5965,
5966,
5972,
6001,
6015,
6088,
6165,
6241,
6321,
6396,
6475,
6545,
6546,
6549,
6551,
6552,
6565,
6566,
6584,
6597,
6601,
6604,
6622,
6668,
6669,
6675,
6702,
6703,
6742,
6743,
6749,
6822,
6899,
6974,
7053,
7123,
7125,
7126,
7133,
7134,
7150,
7163,
7169,
7171,
7205,
7206,
7212,
7293,
7295,
7296,
7309,
7310,
7328,
7341,
7345,
7348,
7366,
7400,
7401,
7407,
7488,
7489,
7649,
7650,
7656,
7753,
7815,
7874,
7935,
8001,
8003,
8004,
8011,
8012,
8028,
8041,
8047,
8049,
8209,
8210,
8216,
8313,
8375,
8434,
8495,
8561,
8562,
8667,
8668,
8841,
8842,
9219,
9221,
9222,
9235,
9236,
9254,
9267,
9271,
9274,
9292,
9342,
9343,
9386,
9387,
9393,
9411,
9468,
9561,
9643,
9727,
9728,
9820,
9822,
9823,
9834,
9835,
9853,
9866,
9870,
9872,
9945,
9946,
10043,
10045,
10046,
10053,
10054,
10070,
10083,
10089,
10091,
10164,
10165,
10262,
10263,
10319,
10321
],
"line_end_idx": [
113,
114,
122,
123,
141,
157,
170,
174,
176,
307,
309,
310,
322,
323,
342,
354,
360,
363,
381,
512,
513,
617,
619,
620,
628,
629,
647,
663,
676,
680,
682,
725,
726,
780,
782,
783,
791,
792,
810,
823,
827,
829,
872,
873,
927,
928,
1058,
1060,
1061,
1070,
1071,
1087,
1100,
1104,
1107,
1289,
1291,
1292,
1300,
1301,
1315,
1328,
1334,
1336,
1518,
1519,
1531,
1532,
1814,
1816,
1817,
1825,
1826,
1844,
1856,
1863,
1870,
1882,
1883,
2165,
2166,
2321,
2323,
2324,
2332,
2333,
2347,
2360,
2366,
2368,
2523,
2524,
2612,
2614,
2615,
2622,
2623,
2640,
2653,
2660,
2667,
2772,
2774,
2775,
2782,
2783,
2799,
2812,
2818,
2820,
2832,
2833,
3115,
3116,
3171,
3177,
3204,
3206,
3207,
3217,
3218,
3235,
3248,
3251,
3253,
3607,
3609,
3610,
3618,
3619,
3637,
3653,
3666,
3670,
3672,
3752,
3754,
3755,
3764,
3765,
3783,
3795,
3799,
3802,
3812,
3865,
3995,
4037,
4080,
4081,
4306,
4308,
4309,
4319,
4320,
4330,
4343,
4349,
4353,
4495,
4496,
4502,
4520,
4575,
4576,
4622,
4623,
4629,
4656,
4657,
4762,
4763,
4769,
4795,
4825,
4826,
4911,
4912,
5266,
5267,
5364,
5366,
5367,
5375,
5376,
5395,
5407,
5414,
5420,
5432,
5714,
5715,
5811,
5813,
5814,
5825,
5826,
5842,
5855,
5861,
5865,
5885,
5931,
5932,
5938,
5965,
5966,
5972,
6001,
6015,
6088,
6165,
6241,
6321,
6396,
6475,
6545,
6546,
6549,
6551,
6552,
6565,
6566,
6584,
6597,
6601,
6604,
6622,
6668,
6669,
6675,
6702,
6703,
6742,
6743,
6749,
6822,
6899,
6974,
7053,
7123,
7125,
7126,
7133,
7134,
7150,
7163,
7169,
7171,
7205,
7206,
7212,
7293,
7295,
7296,
7309,
7310,
7328,
7341,
7345,
7348,
7366,
7400,
7401,
7407,
7488,
7489,
7649,
7650,
7656,
7753,
7815,
7874,
7935,
8001,
8003,
8004,
8011,
8012,
8028,
8041,
8047,
8049,
8209,
8210,
8216,
8313,
8375,
8434,
8495,
8561,
8562,
8667,
8668,
8841,
8842,
9219,
9221,
9222,
9235,
9236,
9254,
9267,
9271,
9274,
9292,
9342,
9343,
9386,
9387,
9393,
9411,
9468,
9561,
9643,
9727,
9728,
9820,
9822,
9823,
9834,
9835,
9853,
9866,
9870,
9872,
9945,
9946,
10043,
10045,
10046,
10053,
10054,
10070,
10083,
10089,
10091,
10164,
10165,
10262,
10263,
10319,
10321,
10396
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10396,
"ccnet_original_nlines": 343,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.33162394165992737,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03247863054275513,
"rps_doc_frac_lines_end_with_ellipsis": 0.005813950207084417,
"rps_doc_frac_no_alph_words": 0.2974359095096588,
"rps_doc_frac_unique_words": 0.28030750155448914,
"rps_doc_mean_word_length": 4.642223358154297,
"rps_doc_num_sentences": 101,
"rps_doc_symbol_to_word_ratio": 0.0034187999553978443,
"rps_doc_unigram_entropy": 5.551486492156982,
"rps_doc_word_count": 1691,
"rps_doc_frac_chars_dupe_10grams": 0.47707006335258484,
"rps_doc_frac_chars_dupe_5grams": 0.5685350298881531,
"rps_doc_frac_chars_dupe_6grams": 0.559617817401886,
"rps_doc_frac_chars_dupe_7grams": 0.5287898182868958,
"rps_doc_frac_chars_dupe_8grams": 0.5287898182868958,
"rps_doc_frac_chars_dupe_9grams": 0.47707006335258484,
"rps_doc_frac_chars_top_2gram": 0.02292994037270546,
"rps_doc_frac_chars_top_3gram": 0.015286619774997234,
"rps_doc_frac_chars_top_4gram": 0.014267520047724247,
"rps_doc_books_importance": -1226.6314697265625,
"rps_doc_books_importance_length_correction": -1226.6314697265625,
"rps_doc_openwebtext_importance": -735.3621215820312,
"rps_doc_openwebtext_importance_length_correction": -735.3621215820312,
"rps_doc_wikipedia_importance": -541.266845703125,
"rps_doc_wikipedia_importance_length_correction": -541.266845703125
},
"fasttext": {
"dclm": 0.05387448891997337,
"english": 0.9103370308876038,
"fineweb_edu_approx": 1.4078774452209473,
"eai_general_math": 0.3046015501022339,
"eai_open_web_math": 0.3251487612724304,
"eai_web_code": 0.29037362337112427
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,863,854,890,768,305,700 |
[Last Call] Learn how to a build a cloud-first strategyRegister Now
x
?
Solved
Get Info from certain database from SQL Server.
Posted on 2001-08-08
13
Medium Priority
?
226 Views
Last Modified: 2008-02-01
Is there any VB application with source code that allow
user to login into SQL Server, then pull all the table
name(include all the fields for each table), stored procedures that are associated with the login user ?
0
Comment
Question by:superCombo2001
• 5
• 5
• 3
13 Comments
LVL 43
Expert Comment
by:TimCottee
ID: 6363854
You are asking for a lot there, lets take it apart a little:
There are three ways (at least) to get the columns/tables from a database:
1) ADO using Connection.OpenSchema
2) ADOX using catalog and tables/columns collections
3) SQL-DMO
Of the three, 1) is the easiest and quickest to implement and 3) is the most powerful.
The SQL-DMO object library allows effectively the same level of control and access that SQL enterprise manager does. This means that not only can you natively access the tables and columns, you can also access the stored procedures/logins/users etc in the database.
If you wish to go down one of these routes, let me know and I will see if I can give you some appropriate examples.
0
LVL 11
Expert Comment
by:Nitin Sontakke
ID: 6363855
I don't know any readymade code. But it is fairly easy to write your own using "Microsoft SQLDMO Object Library".
0
Author Comment
by:superCombo2001
ID: 6364355
I will want to use SQL-DMO.
I know I asked a lot, but I will increase points soon.
Thanks !
0
What does it mean to be "Always On"?
Is your cloud always on? With an Always On cloud you won't have to worry about downtime for maintenance or software application code updates, ensuring that your bottom line isn't affected.
LVL 43
Accepted Solution
by:
TimCottee earned 280 total points
ID: 6364473
Here is a starter on SQL-DMO, add a reference to it in the project;
Private Sub Command2_Click()
Dim srvSQL As SQLDMO.SQLServer
Set srvSQL = New SQLDMO.SQLServer
Dim tblTable As Table
Dim clmColumn As Column
Dim stpProcedure As StoredProcedure
Dim upmUserPermissions As SQLObjectList
srvSQL.Name = "MySQLServerName"
srvSQL.Connect
For Each tblTable In srvSQL.Databases("QCDataCollect").Tables
For Each clmColumn In tblTable.Columns
strMessage = ""
strMessage = strMessage & "Allow Nulls = " & clmColumn.AllowNulls & vbLf
strMessage = strMessage & "AnsiPaddingStatus = " & clmColumn.AnsiPaddingStatus & vbLf
strMessage = strMessage & "ComputedText = " & clmColumn.ComputedText & vbLf
strMessage = strMessage & "Datatype = " & clmColumn.Datatype & vbLf
strMessage = strMessage & "Default = " & clmColumn.Default & vbLf
strMessage = strMessage & "DefaultOwner = " & clmColumn.DefaultOwner & vbLf
strMessage = strMessage & "FullTextIndex = " & clmColumn.FullTextIndex & vbLf
strMessage = strMessage & "I = " & clmColumn.ID & vbLf
strMessage = strMessage & "Identity = " & clmColumn.Identity & vbLf
strMessage = strMessage & "IdentityIncrement = " & clmColumn.IdentityIncrement & vbLf
strMessage = strMessage & "IdentitySeed = " & clmColumn.IdentitySeed & vbLf
strMessage = strMessage & "InPrimaryKey = " & clmColumn.InPrimaryKey & vbLf
strMessage = strMessage & "IsComputed = " & clmColumn.IsComputed & vbLf
strMessage = strMessage & "IsRowGuidCol = " & clmColumn.IsRowGuidCol & vbLf
strMessage = strMessage & "Length = " & clmColumn.Length & vbLf
strMessage = strMessage & "Name = " & clmColumn.Name & vbLf
strMessage = strMessage & "NotForRepl = " & clmColumn.NotForRepl & vbLf
strMessage = strMessage & "NumericPrecision = " & clmColumn.NumericPrecision & vbLf
strMessage = strMessage & "NumericScale = " & clmColumn.NumericScale & vbLf
strMessage = strMessage & "PhysicalDatatype = " & clmColumn.PhysicalDatatype & vbLf
strMessage = strMessage & "TypeOf = " & clmColumn.TypeOf & vbLf
strMessage = strMessage & "UserData = " & clmColumn.UserData
MsgBox strMessage
Next
Next
srvSQL.Disconnect
Set srvSQL = Nothing
End Sub
0
Author Comment
by:superCombo2001
ID: 6365062
Where to find SQL DMO ? What dir ?
0
LVL 43
Expert Comment
by:TimCottee
ID: 6365070
If you have SQL server 7 Client installed on your development machine, you should be able to go to the project menu in VB and choose references, Microsoft SQLDMO Object Library should be there in the list, simply check it and ok. If you don't have it but have SQLOLE instead, this may work but was designed for SQL 6.5 rather than 7 and may not have all the features implemented in the same way.
0
Author Comment
by:superCombo2001
ID: 6365082
I can see MS SQLDMO library in the reference box.
When I checked it, and hit ok, the vb told me that
the library is missing.
What is the full name of that library ?
0
LVL 43
Expert Comment
by:TimCottee
ID: 6365097
Ok, on my install it is in c:\mssql7\binn\resources\1033\sqldmo.rll
0
LVL 11
Expert Comment
by:Nitin Sontakke
ID: 6365105
On my machine:
C:\Program Files\Microsoft SQL Server\80\Tools\Binn\sqldmo.dll
0
LVL 11
Expert Comment
by:Nitin Sontakke
ID: 6365109
Mine is SQL Server 2K.
0
Author Comment
by:superCombo2001
ID: 6365147
Give me sometime to evaluate the code.
0
LVL 43
Expert Comment
by:TimCottee
ID: 6367080
No problem, if you have any more questions just ask and I will do my best to help.
0
Author Comment
by:superCombo2001
ID: 6388696
TimCottee,
Where can I get books or URL resources for more implementation detail on SQLDMO ?
0
Featured Post
Concerto's Cloud Advisory Services
Want to avoid the missteps to gaining all the benefits of the cloud? Learn more about the different assessment options from our Cloud Advisory team.
Question has a verified solution.
If you are experiencing a similar issue, please ask a related question
Article by: Martin
Here are a few simple, working, games that you can use as-is or as the basis for your own games. Tic-Tac-Toe This is one of the simplest of all games. The game allows for a choice of who goes first and keeps track of the number of wins for…
This article describes how to use a set of graphical playing cards to create a Draw Poker game in Excel or VB6.
As developers, we are not limited to the functions provided by the VBA language. In addition, we can call the functions that are part of the Windows operating system. These functions are part of the Windows API (Application Programming Interface). U…
Get people started with the utilization of class modules. Class modules can be a powerful tool in Microsoft Access. They allow you to create self-contained objects that encapsulate functionality. They can easily hide the complexity of a process from…
Suggested Courses
Course of the Month18 days, 10 hours left to enroll
834 members asked questions and received personalized solutions in the past 7 days.
Join the community of 500,000 technology professionals and ask your questions.
Join & Ask a Question
|
{
"url": "https://www.experts-exchange.com/questions/20165179/Get-Info-from-certain-database-from-SQL-Server.html",
"source_domain": "www.experts-exchange.com",
"snapshot_id": "crawl=CC-MAIN-2017-51",
"warc_metadata": {
"Content-Length": "228693",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MXOLJ2ER6V3IXVBKJZF3MBYFK3UBITNW",
"WARC-Concurrent-To": "<urn:uuid:f18f9ee9-e5d3-4df8-8dc6-b9db81414d2e>",
"WARC-Date": "2017-12-13T21:35:31Z",
"WARC-IP-Address": "104.20.169.10",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LPP2W2YXQWNS6XUBI67UWY257DQNUSKM",
"WARC-Record-ID": "<urn:uuid:95b4dc96-fb1f-4dd2-ad20-a6c6b366d46f>",
"WARC-Target-URI": "https://www.experts-exchange.com/questions/20165179/Get-Info-from-certain-database-from-SQL-Server.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5c7609c0-eac6-4532-ab98-c9b95d46aa74>"
},
"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,
68,
69,
71,
73,
80,
81,
129,
130,
151,
154,
170,
172,
182,
208,
264,
319,
424,
426,
434,
461,
467,
473,
479,
491,
493,
500,
501,
516,
517,
530,
542,
603,
604,
679,
680,
715,
768,
779,
780,
867,
868,
1134,
1135,
1251,
1253,
1255,
1262,
1263,
1278,
1279,
1297,
1309,
1423,
1424,
1426,
1428,
1429,
1444,
1445,
1463,
1475,
1503,
1558,
1567,
1569,
1606,
1607,
1796,
1797,
1799,
1806,
1807,
1825,
1826,
1830,
1864,
1876,
1944,
1945,
1974,
2009,
2047,
2073,
2101,
2141,
2185,
2221,
2240,
2306,
2353,
2381,
2466,
2564,
2652,
2732,
2810,
2898,
2988,
3055,
3135,
3233,
3321,
3409,
3493,
3581,
3657,
3729,
3813,
3909,
3997,
4093,
4169,
4242,
4272,
4285,
4294,
4316,
4341,
4349,
4351,
4353,
4354,
4369,
4370,
4388,
4400,
4435,
4437,
4439,
4446,
4447,
4462,
4463,
4476,
4488,
4884,
4886,
4888,
4889,
4904,
4905,
4923,
4935,
4985,
5036,
5060,
5061,
5101,
5103,
5105,
5112,
5113,
5128,
5129,
5142,
5154,
5222,
5224,
5226,
5233,
5234,
5249,
5250,
5268,
5280,
5295,
5358,
5360,
5362,
5369,
5370,
5385,
5386,
5404,
5416,
5439,
5441,
5443,
5444,
5459,
5460,
5478,
5490,
5529,
5531,
5533,
5540,
5541,
5556,
5557,
5570,
5582,
5665,
5667,
5669,
5670,
5685,
5686,
5704,
5716,
5727,
5728,
5810,
5812,
5813,
5827,
5828,
5863,
5864,
6013,
6014,
6048,
6049,
6120,
6121,
6140,
6383,
6495,
6746,
6997,
7015,
7067,
7068,
7152,
7153,
7232,
7233
],
"line_end_idx": [
68,
69,
71,
73,
80,
81,
129,
130,
151,
154,
170,
172,
182,
208,
264,
319,
424,
426,
434,
461,
467,
473,
479,
491,
493,
500,
501,
516,
517,
530,
542,
603,
604,
679,
680,
715,
768,
779,
780,
867,
868,
1134,
1135,
1251,
1253,
1255,
1262,
1263,
1278,
1279,
1297,
1309,
1423,
1424,
1426,
1428,
1429,
1444,
1445,
1463,
1475,
1503,
1558,
1567,
1569,
1606,
1607,
1796,
1797,
1799,
1806,
1807,
1825,
1826,
1830,
1864,
1876,
1944,
1945,
1974,
2009,
2047,
2073,
2101,
2141,
2185,
2221,
2240,
2306,
2353,
2381,
2466,
2564,
2652,
2732,
2810,
2898,
2988,
3055,
3135,
3233,
3321,
3409,
3493,
3581,
3657,
3729,
3813,
3909,
3997,
4093,
4169,
4242,
4272,
4285,
4294,
4316,
4341,
4349,
4351,
4353,
4354,
4369,
4370,
4388,
4400,
4435,
4437,
4439,
4446,
4447,
4462,
4463,
4476,
4488,
4884,
4886,
4888,
4889,
4904,
4905,
4923,
4935,
4985,
5036,
5060,
5061,
5101,
5103,
5105,
5112,
5113,
5128,
5129,
5142,
5154,
5222,
5224,
5226,
5233,
5234,
5249,
5250,
5268,
5280,
5295,
5358,
5360,
5362,
5369,
5370,
5385,
5386,
5404,
5416,
5439,
5441,
5443,
5444,
5459,
5460,
5478,
5490,
5529,
5531,
5533,
5540,
5541,
5556,
5557,
5570,
5582,
5665,
5667,
5669,
5670,
5685,
5686,
5704,
5716,
5727,
5728,
5810,
5812,
5813,
5827,
5828,
5863,
5864,
6013,
6014,
6048,
6049,
6120,
6121,
6140,
6383,
6495,
6746,
6997,
7015,
7067,
7068,
7152,
7153,
7232,
7233,
7254
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7254,
"ccnet_original_nlines": 227,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.26263344287872314,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04982205852866173,
"rps_doc_frac_lines_end_with_ellipsis": 0.013157890178263187,
"rps_doc_frac_no_alph_words": 0.29323843121528625,
"rps_doc_frac_unique_words": 0.4483111500740051,
"rps_doc_mean_word_length": 5.469805717468262,
"rps_doc_num_sentences": 76,
"rps_doc_symbol_to_word_ratio": 0.0021352299954742193,
"rps_doc_unigram_entropy": 5.486086368560791,
"rps_doc_word_count": 977,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08102545142173767,
"rps_doc_frac_chars_dupe_6grams": 0.04397454857826233,
"rps_doc_frac_chars_dupe_7grams": 0.038173649460077286,
"rps_doc_frac_chars_dupe_8grams": 0.020209580659866333,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.08607783913612366,
"rps_doc_frac_chars_top_3gram": 0.09431137889623642,
"rps_doc_frac_chars_top_4gram": 0.02806885913014412,
"rps_doc_books_importance": -612.336181640625,
"rps_doc_books_importance_length_correction": -612.336181640625,
"rps_doc_openwebtext_importance": -405.38092041015625,
"rps_doc_openwebtext_importance_length_correction": -405.38092041015625,
"rps_doc_wikipedia_importance": -270.8708190917969,
"rps_doc_wikipedia_importance_length_correction": -270.8708190917969
},
"fasttext": {
"dclm": 0.018606599420309067,
"english": 0.7184469699859619,
"fineweb_edu_approx": 2.3974075317382812,
"eai_general_math": 0.00040811000508256257,
"eai_open_web_math": 0.4747247099876404,
"eai_web_code": 0.9692510962486267
}
}
|
{
"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.75",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,199,311,745,810,438,400 |
text ringtone
Discussion in 'Android Audio and Video' started by dayday11, Nov 9, 2009.
1. dayday11
Offline
dayday11 New Member
Joined:
Nov 5, 2009
Messages:
15
Likes Received:
0
Trophy Points:
0
Location:
Tennessee
I know how to switch ringtones for my text messages but my custom ringtones do no show up as a option. Does anyone know why this would be like this? My phone ringtone is custom. Thanks.
2. New2u
Offline
New2u DF Super Moderator
Joined:
Oct 25, 2009
Messages:
3,630
Likes Received:
15
Trophy Points:
38
Location:
Tallahassee, Fl
3. dayday11
Offline
dayday11 New Member
Joined:
Nov 5, 2009
Messages:
15
Likes Received:
0
Trophy Points:
0
Location:
Tennessee
Thanks for the quick reply and help. I guess I will be making a notification folder on my SD card and hopefully that will work.
4. pope66682
Offline
pope66682 New Member
Joined:
Nov 6, 2009
Messages:
70
Likes Received:
0
Trophy Points:
0
Location:
Boston
How do you add this folder to the SD card?
5. New2u
Offline
New2u DF Super Moderator
Joined:
Oct 25, 2009
Messages:
3,630
Likes Received:
15
Trophy Points:
38
Location:
Tallahassee, Fl
If you sync it with your computer, you can just add a folder when your looking at it from your computer, seeing as you have to sync it anyways to get the mp3's on there, i would imagine this shouldn't be too much of an issue.
6. pope66682
Offline
pope66682 New Member
Joined:
Nov 6, 2009
Messages:
70
Likes Received:
0
Trophy Points:
0
Location:
Boston
That worked. THX
Search tags for this page
android oplus 8.5 set txt msg tone issue
,
droid text ringtone
,
droid text tone
,
droidx needs separate ringtone for text messages
,
how do i load a ring tone from my text message on my droid d
,
how do u make a ringtone for text messave for droid
,
how to add ringtones to droid from text messages
,
how to download ringtones from a text message to droid 4
,
how to get ringtone from my text on a droid
,
how to put your ringtone as your text message ringtone on mo
,
how to retrieve a ringtone from a text on a droid 4
,
how to set ringtone for text message on droid
,
how to use music i received as a text as ring tone on my dro
,
no ringtone for texting on droid mini
,
ringtone
|
{
"url": "http://www.droidforums.net/threads/text-ringtone.1356/",
"source_domain": "www.droidforums.net",
"snapshot_id": "crawl=CC-MAIN-2014-35",
"warc_metadata": {
"Content-Length": "84050",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ICYB5BCWMKENUGDAG2VDEFXP6DEABAD7",
"WARC-Concurrent-To": "<urn:uuid:d72de7ff-02ce-4dd6-8d1e-acbb27a04a70>",
"WARC-Date": "2014-08-31T00:26:22Z",
"WARC-IP-Address": "206.127.24.60",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:AEQEUVJBESFHNWTOHD7SYILVELH3ML7N",
"WARC-Record-ID": "<urn:uuid:d0b5dc2c-0c71-453e-9859-0e9c3911190d>",
"WARC-Target-URI": "http://www.droidforums.net/threads/text-ringtone.1356/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fea77b18-08b6-4b66-858a-757a2b2314c5>"
},
"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,
14,
15,
89,
90,
104,
116,
117,
141,
142,
154,
170,
184,
191,
211,
217,
236,
242,
256,
270,
460,
471,
483,
484,
513,
514,
526,
543,
557,
567,
587,
594,
613,
620,
634,
654,
668,
680,
681,
705,
706,
718,
734,
748,
755,
775,
781,
800,
806,
820,
834,
966,
981,
993,
994,
1019,
1020,
1032,
1048,
1062,
1069,
1089,
1095,
1114,
1120,
1134,
1145,
1192,
1203,
1215,
1216,
1245,
1246,
1258,
1275,
1289,
1299,
1319,
1326,
1345,
1352,
1366,
1386,
1616,
1631,
1643,
1644,
1669,
1670,
1682,
1698,
1712,
1719,
1739,
1745,
1764,
1770,
1784,
1795,
1816,
1842,
1883,
1885,
1886,
1906,
1907,
1909,
1925,
1927,
1976,
1978,
2039,
2041,
2093,
2095,
2144,
2146,
2203,
2205,
2249,
2251,
2312,
2314,
2366,
2368,
2414,
2416,
2477,
2479,
2517,
2519
],
"line_end_idx": [
14,
15,
89,
90,
104,
116,
117,
141,
142,
154,
170,
184,
191,
211,
217,
236,
242,
256,
270,
460,
471,
483,
484,
513,
514,
526,
543,
557,
567,
587,
594,
613,
620,
634,
654,
668,
680,
681,
705,
706,
718,
734,
748,
755,
775,
781,
800,
806,
820,
834,
966,
981,
993,
994,
1019,
1020,
1032,
1048,
1062,
1069,
1089,
1095,
1114,
1120,
1134,
1145,
1192,
1203,
1215,
1216,
1245,
1246,
1258,
1275,
1289,
1299,
1319,
1326,
1345,
1352,
1366,
1386,
1616,
1631,
1643,
1644,
1669,
1670,
1682,
1698,
1712,
1719,
1739,
1745,
1764,
1770,
1784,
1795,
1816,
1842,
1883,
1885,
1886,
1906,
1907,
1909,
1925,
1927,
1976,
1978,
2039,
2041,
2093,
2095,
2144,
2146,
2203,
2205,
2249,
2251,
2312,
2314,
2366,
2368,
2414,
2416,
2477,
2479,
2517,
2519,
2527
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2527,
"ccnet_original_nlines": 130,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.29729729890823364,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016632020473480225,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2577962577342987,
"rps_doc_frac_unique_words": 0.36868688464164734,
"rps_doc_mean_word_length": 4.297979831695557,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.610808372497559,
"rps_doc_word_count": 396,
"rps_doc_frac_chars_dupe_10grams": 0.3631022274494171,
"rps_doc_frac_chars_dupe_5grams": 0.3631022274494171,
"rps_doc_frac_chars_dupe_6grams": 0.3631022274494171,
"rps_doc_frac_chars_dupe_7grams": 0.3631022274494171,
"rps_doc_frac_chars_dupe_8grams": 0.3631022274494171,
"rps_doc_frac_chars_dupe_9grams": 0.3631022274494171,
"rps_doc_frac_chars_top_2gram": 0.02350175939500332,
"rps_doc_frac_chars_top_3gram": 0.035252638161182404,
"rps_doc_frac_chars_top_4gram": 0.0423031710088253,
"rps_doc_books_importance": -199.92025756835938,
"rps_doc_books_importance_length_correction": -199.92025756835938,
"rps_doc_openwebtext_importance": -122.42412567138672,
"rps_doc_openwebtext_importance_length_correction": -122.42412567138672,
"rps_doc_wikipedia_importance": -62.73900604248047,
"rps_doc_wikipedia_importance_length_correction": -62.73900604248047
},
"fasttext": {
"dclm": 0.04092901945114136,
"english": 0.8975875973701477,
"fineweb_edu_approx": 1.079982042312622,
"eai_general_math": 0.004985149949789047,
"eai_open_web_math": 0.40217041969299316,
"eai_web_code": -0.000003460000016275444
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.164",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "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,217,952,441,285,000 |
Solved thread
This post is marked as solved. If you think the information contained on this thread must be part of the official documentation, please contribute submitting a pull request to its repository.
How do I view a SQL Statement?
I want to view the SQL statement that is about to be executed below :
<?php
//Deleting existing robot
$success = $connection->delete(
"robots",
"id = 101"
);
//Next SQL sentence is generated
DELETE FROM robots WHERE id = 101
How can I add some kind of listener or just plain var_dump the select query that is about to generated by the $connection->delete
Thanks
For me, the easiest solution is to just enable the query log, then tail -f that file as you run queries.
174
Accepted
answer
I am use this approach:
<?php
$config = new \Phalcon\Config([
'db' => [
'adapter' => 'Mysql',
'host' => 'localhost',
'dbname' => 'test',
'username' => 'root',
'password' => ''
],
'path' => [
'controllers' => __DIR__.'/../app/controllers/',
'libraries' => __DIR__.'/../app/libraries/',
'messages' => __DIR__.'/../app/messages/',
'models' => __DIR__.'/../app/models/',
'views' => __DIR__.'/../app/views/',
'tmp' => __DIR__.'/../tmp/',
],
]);
$di->set('db', function() use ($config) {
$adapter = '\Phalcon\Db\Adapter\Pdo\\'.$config->db->adapter;
$connection = new $adapter((array) $config->db);
$logger = new \Phalcon\Logger\Adapter\File($config->path->tmp.'sql.log');
$eventsManager = new \Phalcon\Events\Manager();
$eventsManager->attach('db', function($event, $connection) use ($logger) {
if ($event->getType() == 'beforeQuery') $logger->log($connection->getSQLStatement().' '.join(', ', $connection->getSQLVariables()));
});
$connection->setEventsManager($eventsManager);
return $connection;
});
17.0k
Hey thanks all, I followed your advice @urulab. I also added a nice Exception to catch those Phalcon\Db exceptions.
catch (\Exception $e) {
echo get_class($e), ": ", $e->getMessage(), "\n";
echo " File=", $e->getFile(), "\n";
echo " Line=", $e->getLine(), "\n";
//return array('error' => 'General Exception', 'trace' => $e->getTraceAsString());
}
|
{
"url": "https://forum.phalconphp.com/discussion/2898/how-do-i-view-a-sql-statement-",
"source_domain": "forum.phalconphp.com",
"snapshot_id": "crawl=CC-MAIN-2018-39",
"warc_metadata": {
"Content-Length": "24144",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WHILPPABVJDYEUIIYR3ILE64ZNP4DB4G",
"WARC-Concurrent-To": "<urn:uuid:b6e56f70-d251-4d74-8f30-86d2252b8dee>",
"WARC-Date": "2018-09-24T08:18:58Z",
"WARC-IP-Address": "104.18.34.141",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:AMG4KKZEXAOKOTR5D2MHC2NYMOJKFO6Y",
"WARC-Record-ID": "<urn:uuid:4b6951f3-e3eb-4309-b22e-d0d7606b177c>",
"WARC-Target-URI": "https://forum.phalconphp.com/discussion/2898/how-do-i-view-a-sql-statement-",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d8b5121a-3f83-4496-951b-44306bfedaea>"
},
"warc_info": "isPartOf: CC-MAIN-2018-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-169-173-84.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,
14,
15,
207,
208,
239,
240,
310,
311,
317,
318,
345,
378,
393,
409,
413,
447,
482,
483,
613,
614,
621,
622,
727,
728,
729,
730,
734,
743,
750,
751,
775,
776,
782,
814,
828,
864,
904,
939,
974,
1004,
1011,
1027,
1086,
1143,
1199,
1253,
1306,
1353,
1360,
1364,
1406,
1471,
1524,
1602,
1654,
1733,
1874,
1882,
1933,
1957,
1961,
1962,
1963,
1969,
1970,
2086,
2087,
2111,
2173,
2221,
2269,
2380
],
"line_end_idx": [
14,
15,
207,
208,
239,
240,
310,
311,
317,
318,
345,
378,
393,
409,
413,
447,
482,
483,
613,
614,
621,
622,
727,
728,
729,
730,
734,
743,
750,
751,
775,
776,
782,
814,
828,
864,
904,
939,
974,
1004,
1011,
1027,
1086,
1143,
1199,
1253,
1306,
1353,
1360,
1364,
1406,
1471,
1524,
1602,
1654,
1733,
1874,
1882,
1933,
1957,
1961,
1962,
1963,
1969,
1970,
2086,
2087,
2111,
2173,
2221,
2269,
2380,
2389
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2389,
"ccnet_original_nlines": 72,
"rps_doc_curly_bracket": 0.0025115099269896746,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.15217390656471252,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.035573121160268784,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.46047431230545044,
"rps_doc_frac_unique_words": 0.7022222280502319,
"rps_doc_mean_word_length": 6.1777777671813965,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.907562255859375,
"rps_doc_word_count": 225,
"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.01726618967950344,
"rps_doc_frac_chars_top_3gram": 0.01582733914256096,
"rps_doc_frac_chars_top_4gram": 0.018705040216445923,
"rps_doc_books_importance": -262.1911926269531,
"rps_doc_books_importance_length_correction": -262.1911926269531,
"rps_doc_openwebtext_importance": -109.6942138671875,
"rps_doc_openwebtext_importance_length_correction": -109.6942138671875,
"rps_doc_wikipedia_importance": -126.47007751464844,
"rps_doc_wikipedia_importance_length_correction": -126.47007751464844
},
"fasttext": {
"dclm": 0.30852800607681274,
"english": 0.6898565292358398,
"fineweb_edu_approx": 2.0656542778015137,
"eai_general_math": 0.13688385486602783,
"eai_open_web_math": 0.05014514923095703,
"eai_web_code": 0.342883825302124
}
}
|
{
"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.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-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
|
-5,276,868,591,711,408,000 |
Donato Donato - 7 months ago 31
MySQL Question
Many to many relationship with individual fields of a record
I have a table called email_messages. I has columns
from
,
to
,
cc
,
bcc
. At the moment I have them stored as text fields, which contain serialized arrays of email addresses. But I want to extract the addresses into their own table, so I can reuse addresses and make it easier to search addresses with typeahead.
Obviously, I need a many to many. But if I do this:
class EmailMessage
has_many :email_message_addresses
has_many :addresses, through: :email_message_addresses
end
class Address
has_many :email_message_addresses
has_many :email_messages, through: :email_message_addresses
end
How would I be able to associate addresses for each individual
from
,
to
,
cc
,
bcc
field for a single record? The
from
field can contain 3 addresses, the
to
field can contain 5 addresses, etc.
Answer
Add an attribute to email_message_addresses called role, which can take on the values from, to, etc.
You will probably want to add some methods so that you can do the following syntax
@message = EmailMessage.find(...)
@message.to_addresses # -> array of addresses in the "to" field
@message.cc_addresses # -> array of addresses in the "cc" field
# etc.
|
{
"url": "https://codedump.io/share/GW8Bkz9wIT29/1/many-to-many-relationship-with-individual-fields-of-a-record",
"source_domain": "codedump.io",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "27179",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2PA3L2QHMJPAWKOKXDWV6F6IOEBBBZ7F",
"WARC-Concurrent-To": "<urn:uuid:020d4df4-537f-4c95-a46f-e2d968b83e31>",
"WARC-Date": "2017-05-29T00:38:45Z",
"WARC-IP-Address": "84.22.103.185",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JQEVSDAGUMBNUXGEDURMMLHUXC4MD3G4",
"WARC-Record-ID": "<urn:uuid:ed2f0ff1-bc77-4f06-98e6-4a19c3288e54>",
"WARC-Target-URI": "https://codedump.io/share/GW8Bkz9wIT29/1/many-to-many-relationship-with-individual-fields-of-a-record",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:05458249-5cb3-4b7b-a874-ec5dd4625cf7>"
},
"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,
32,
47,
48,
109,
110,
162,
163,
168,
170,
173,
175,
178,
180,
184,
425,
426,
478,
479,
498,
532,
587,
591,
592,
606,
640,
700,
704,
705,
706,
769,
774,
776,
779,
781,
784,
786,
790,
821,
826,
861,
864,
900,
901,
908,
909,
1010,
1011,
1094,
1095,
1129,
1194,
1259
],
"line_end_idx": [
32,
47,
48,
109,
110,
162,
163,
168,
170,
173,
175,
178,
180,
184,
425,
426,
478,
479,
498,
532,
587,
591,
592,
606,
640,
700,
704,
705,
706,
769,
774,
776,
779,
781,
784,
786,
790,
821,
826,
861,
864,
900,
901,
908,
909,
1010,
1011,
1094,
1095,
1129,
1194,
1259,
1266
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1266,
"ccnet_original_nlines": 52,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3551020324230194,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03265305981040001,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22857142984867096,
"rps_doc_frac_unique_words": 0.5263158082962036,
"rps_doc_mean_word_length": 5.115789413452148,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0.016326529905200005,
"rps_doc_unigram_entropy": 4.300942420959473,
"rps_doc_word_count": 190,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04320988059043884,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.018518520519137383,
"rps_doc_frac_chars_top_3gram": 0.020576130598783493,
"rps_doc_frac_chars_top_4gram": 0.022633740678429604,
"rps_doc_books_importance": -129.44346618652344,
"rps_doc_books_importance_length_correction": -129.44346618652344,
"rps_doc_openwebtext_importance": -64.41288757324219,
"rps_doc_openwebtext_importance_length_correction": -64.41288757324219,
"rps_doc_wikipedia_importance": -36.590389251708984,
"rps_doc_wikipedia_importance_length_correction": -36.590389251708984
},
"fasttext": {
"dclm": 0.7044818997383118,
"english": 0.8954997658729553,
"fineweb_edu_approx": 1.4555280208587646,
"eai_general_math": 0.9524139165878296,
"eai_open_web_math": 0.3342173099517822,
"eai_web_code": 0.972132682800293
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "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,451,009,864,225,447,000 |
Archivo
Archive for 19 agosto 2015
DragonJAR Security Conference en Colombia.
agosto 19, 2015 5 comentarios
Hace algunos días recibí una muy agradable sorpresa, el equipo de DragonJAR ha valorado mi propuesta para asistir como ponente a la próxima edición de la DragonJAR Security Conference que se celebrará en Colombia en el mes de septiembre :-D.
En dicho evento, voy a impartir un taller sobre Python enfocado al pentesting, con un contenido muy similar al del RootedLab que he dado este mismo año en Madrid, pero con una diferencia importante: El tiempo. El taller de la Rooted duraba solamente 8 horas, con lo cual tuvimos que ir bastante rápido sobre los contenidos para poder abarcar todas las cosas interesantes que aporta Python a la hora de ejecutar procesos de pentesting, pero en este caso el taller durará 3 días (24 horas) en las que vamos a poder realizar muchas más practicas y demostraciones, además de explicar algunos detalles sobre el lenguaje que incluso se les escapa a programadores con conocimientos sobre Python.
Por otro lado, el día 18 de septiembre a las 14:00 dará comienzo mi charla sobre la “deep web” y anonimato con TOR. Es una charla en la que voy a hablar sobre lo que es la deep web y voy intentar desmitificar muchas de las ideas preconcebidas que he visto rondando en foros o incluso en comentarios en este blog. Será una charla en la que voy a invitar a los asistentes a reflexionar, a romper sus esquemas y la forma en la que ven la deep web y TOR (atentos los vendemo… emm, “analistas del big data” XD). Luego, me voy a centrar en explicar a grandes rasgos la arquitectura de TOR y cómo realizar pruebas de penetración básicas contra servicios ocultos en la deep web. Finalmente, voy a presentar la nueva versión de Tortazo con la que he estado trabajando los últimos meses con constancia e ilusión. Como vaís a poder ver, el enfoque que le he dado ahora es completamente distinto a la primera versión, será más “amigable” y enfocada a compartir información, además de que la podrá utilizar cualquiera con o sin conocimientos tecnicos, eso si, el “core” de Tortazo, es y seguira siendo igual, es decir, tienes que saber exactamente lo que estas haciendo para poder instalar y configurar la herramienta, no está enfocada a script kiddies ni es un metasploit framework que instalas y utilizas con dos comandos que te encuentras por Internet, tampoco es una herramienta pensada para ejecutarse en la plataforma concreta de tu ordenador, es muy probable que tengas que adaptarla para cumplir con tus necesidades concretas, en ese sentido no hay cambios. De todos modos, como podrán ver los asistentes, la nueva versión será un servicio web que se encontrará disponible en Internet en los próximos meses, con el que se podrá acceder a cientos de servicios ocultos en la deep web de TOR y realizar busquedas muy amplias contra la “onion land”, ya sea utilizando una aplicación web o directamente por medio de una arquitectura de servicios REST que se encontrará disponible para todos los usuarios…. creo que ya he dicho demasiado, si realmente te interesa, es mejor que asistas a la charla. 🙂
Tengo muchas ganas de ir a conocer a grandes profesionales de la seguridad informática y estoy completamente dispuesto a aprender todo lo que pueda. Quiero volver a España con una bolsa llena de ideas listas para ponerlas en practica. 😉
Por último, si llevas alguna de las copias del libro de Python para Pentesters o Hacking con Python, te puedo hacer una dedicatoria sin ningún problema, o si te quieres acercar para preguntarme algo o para conocerme allí estaré, no me voy a ir a ninguna parte y tampoco te voy a morder (bueno… ya si eso lo voy viendo) XD.
Nos vemos en Colombia!
Saludos y Happy Hack!
Adastra.
Categorías:Hacking
Pentesting automatizado con Beef. Consumiendo la API Rest de BeEF con Python – Parte 3
agosto 4, 2015 7 comentarios
La API Rest de BeEF cuenta con todo lo necesario para controlar y automatizar las actividades que se pueden llevar a cabo desde el C&C de BeEF. El hecho de poder invocar a los endpoints definidos en dicha API permite crear rutinas de código que ayuden a ejecutar los procesos de recolección de información y explotación de una forma mucho más rápida y eficiente. Tal como se ha enseñado en las dos entradas anteriores sobre BeEF, utilizar esta API no es nada complicado y solamente es necesario ejecutar las peticiones HTTP con los parámetros correctos. Para hacerlo, se puede utilizar herramientas como wget, curl o incluso netcat/socat y si se quiere automatizar el uso de estas herramientas, una buena forma de hacerlo consiste en crear un script en bash que que las ejecute. Evidentemente también es posible utilizar cualquier lenguaje de programación y ejecutar las peticiones HTTP de forma automatizada utilizando las diferentes librerías que proporcionan todos los lenguajes de programación modernos. Dicho esto, a continuación se explicará cómo invocar a algunos de los endpoints de BeEF utilizando Python y en el próximo artículo, lo mismo pero utilizando Ruby.
Consumiendo la API de BeEF con Python
Python cuenta con un considerable número de librerías para realizar peticiones HTTP, lo que facilita muchísimo las cosas a la hora de crear clientes o incluso servicios utilizando Python y este protocolo. Una de las más conocidas y utilizadas es “requests” ya que con muy pocas líneas de código se puede crear un cliente HTTP completamente funcional y soportando todas las características del protocolo HTTP 1.1, algo que en otras librerías como urllib, urllib2 o httplib requiere más líneas de código y un poco más de esfuerzo. Con esto en mente se podría crear un script utilizando requests para consumir la API Rest de BeEF, pero para facilitar aun más las cosas, existe una librería pequeña y simple llamada BeEF-API que ya se encarga de interactuar con los endpoints de BeEF y solamente es necesario invocar a los métodos adecuados de dicha librería. Se encuentra disponible en el siguiente repositorio de GitHub: https://github.com/byt3bl33d3r/BeEF-API y como ocurre con prácticamente todas las librerías en Python, para instalarla solamente hace falta ejecutar el script “setup.py” con el parámetro “install”.
Esta librería se encarga de gestionar la autenticación con BeEF y almacenar internamente el token generado, el cual como se ha visto en el primer artículo, es requerido para invocar algunos de los endpoints de la API Rest.
>python
Python 2.7.6 (default, Jun 22 2015, 17:58:13)
[GCC 4.8.2] on linux2
Type "help", "copyright", "credits" or "license" for more information.
>>> from beefapi import BeefAPI
>>> beef = BeefAPI({})
>>> beef.login('beef', 'beef')
True
Como se puede apreciar, todo parte de la creación un objeto del tipo “BeefAPI”, cuyo constructor recibe como argumento un diccionario, el cual puede tener las claves “host” y “port” en el caso de que se quiera indicar una interfaz de red y puertos distintos a los valores por defecto (127.0.0.1:3000). Posteriormente se invoca al método “login” enviando como parámetros el usuario y la contraseña para autenticarse en el sistema.
Una vez el usuario se ha conseguido autenticar y se ha generado un token para la sesión actual, la librería dispone de una serie de métodos para invocar distintos endpoints, gestionando el token de autenticación de forma automática en cada una de dichas invocaciones. Algunos de los métodos disponibles en una instancia de la clase BeefAPI, permiten obtener los módulos disponibles en la instancia de Beef, buscar módulos que contengan una cadena determinada, listar todos los navegadores que han ejecutado el “hook” de Beef y que se encuentran “online”, así como aquellos que se encuentran “offline” y por supuesto, ejecutar módulos contra todos o solamente algunos de los navegadores enganchados. Esta librería utiliza internamente “requests” y los valores de retorno de cada petición siempre son diccionarios que representan las repuestas emitidas por cada uno de los endpoints invocados en formato JSON.
beefpython1Listando todos los módulos disponibles en BeEF
Como mencionaba antes, también es posible buscar módulos que cumplan con un patrón de texto determinado, pudiendo filtrar de esta forma aquellos módulos que sean de interés para el usuario.
beefpython2Filtrando módulos en BeEF
Del mismo modo que se pueden realizar búsquedas y listar los módulos disponibles en BeEF, también es posible hacer operaciones similares contra los navegadores que se encuentra online y offline.
beefpython3Listando navegadores hookeados
Y por último, pero no menos importante, es posible ejecutar un módulo determinado contra uno o varios navegadores que se encuentran “hookeados” en BeEF. Para hacerlo, en primer lugar hay que obtener el objeto correspondiente al navegador contra el que se desea ejecutar el módulo y en segundo lugar, se debe especificar el identificador del módulo que se desea utilizar contra el navegador. Cada objeto del tipo “Session” (navegador hookeado) tiene un método llamado “run” el cual recibe como argumento un valor númerico que representará el identificador de un módulo. Dicho método se encargará de buscar el módulo identificado con el valor especificado y posteriormente, se encargará de lanzarlo contra el navegador hookeado, algo que como se puede ver más abajo, se consigue con pocas lineas de código.
>>> for hook in beef.hooked_browsers.online:
... commandId = hook.run(243)["command_id"]
... print beef.modules.findbyid(243).results(hook.session, commandId)
En este caso, el módulo con el identificador “243” corresponde al módulo “Detect tor”, el cual como su nombre lo indica, intenta determinar si el navegador en cuestión está utilizando TOR para navegar. El método “run” es el encargado de ejecutar el módulo especificado y de retornar una estructura en formato “JSON” con un identificador del comando, el cual debe ser utilizado posteriormente para obtener los resultados que ha devuelto el módulo.
Como se ha podido ver, utilizar está librería no es complicado y es una buena forma automatizar las tareas que pueden llevarse a cabo desde la consola web de BeEF. En el próximo artículo hablaré sobre cómo hacer esto mismo con Ruby.
Saludos y Happy Hack!
Adastra.
A %d blogueros les gusta esto:
|
{
"url": "https://thehackerway.com/2015/08/",
"source_domain": "thehackerway.com",
"snapshot_id": "crawl=CC-MAIN-2019-30",
"warc_metadata": {
"Content-Length": "100406",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DGD3CV6QMM6LO5WVQ4HB7ASJE7GC4ARJ",
"WARC-Concurrent-To": "<urn:uuid:94ce09f0-ff52-43a2-9ef7-a512d8d1ba80>",
"WARC-Date": "2019-07-22T15:03:55Z",
"WARC-IP-Address": "192.0.78.24",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:KKOFPOJSY62N2CQSKTP77MJVOM5Z5EQE",
"WARC-Record-ID": "<urn:uuid:0d0d1841-b375-4192-ba64-08c98ab5f914>",
"WARC-Target-URI": "https://thehackerway.com/2015/08/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6b49d38e-732f-4ab1-b81a-fc5ccc7becd4>"
},
"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-153-172-231.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,
8,
9,
36,
37,
80,
81,
111,
112,
354,
1043,
3133,
3370,
3693,
3716,
3717,
3739,
3748,
3749,
3768,
3769,
3856,
3857,
3886,
3887,
5058,
5059,
5097,
5098,
6215,
6438,
6439,
6441,
6442,
6450,
6496,
6518,
6589,
6621,
6644,
6675,
6680,
6681,
7111,
8019,
8020,
8078,
8079,
8269,
8270,
8307,
8308,
8503,
8504,
8546,
8547,
9352,
9353,
9398,
9446,
9520,
9521,
9968,
9969,
10202,
10203,
10225,
10234,
10235
],
"line_end_idx": [
8,
9,
36,
37,
80,
81,
111,
112,
354,
1043,
3133,
3370,
3693,
3716,
3717,
3739,
3748,
3749,
3768,
3769,
3856,
3857,
3886,
3887,
5058,
5059,
5097,
5098,
6215,
6438,
6439,
6441,
6442,
6450,
6496,
6518,
6589,
6621,
6644,
6675,
6680,
6681,
7111,
8019,
8020,
8078,
8079,
8269,
8270,
8307,
8308,
8503,
8504,
8546,
8547,
9352,
9353,
9398,
9446,
9520,
9521,
9968,
9969,
10202,
10203,
10225,
10234,
10235,
10265
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10265,
"ccnet_original_nlines": 68,
"rps_doc_curly_bracket": 0.00019484000222291797,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.09607437998056412,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015495870262384415,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14669421315193176,
"rps_doc_frac_unique_words": 0.38224637508392334,
"rps_doc_mean_word_length": 5.115338325500488,
"rps_doc_num_sentences": 69,
"rps_doc_symbol_to_word_ratio": 0.0025826399214565754,
"rps_doc_unigram_entropy": 5.600310325622559,
"rps_doc_word_count": 1656,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03411639854311943,
"rps_doc_frac_chars_dupe_6grams": 0.011096679605543613,
"rps_doc_frac_chars_dupe_7grams": 0.00472198985517025,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.007673239801079035,
"rps_doc_frac_chars_top_3gram": 0.004249790217727423,
"rps_doc_frac_chars_top_4gram": 0.003895639907568693,
"rps_doc_books_importance": -924.2808837890625,
"rps_doc_books_importance_length_correction": -924.2808837890625,
"rps_doc_openwebtext_importance": -614.93505859375,
"rps_doc_openwebtext_importance_length_correction": -614.93505859375,
"rps_doc_wikipedia_importance": -457.9294128417969,
"rps_doc_wikipedia_importance_length_correction": -457.9294128417969
},
"fasttext": {
"dclm": 0.9657267928123474,
"english": 0.000770480022765696,
"fineweb_edu_approx": 1.3850592374801636,
"eai_general_math": 0.00013578000653069466,
"eai_open_web_math": 0.5259944796562195,
"eai_web_code": 0.4118453860282898
}
}
|
{
"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.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": "-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": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,830,137,567,298,466,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.
We are migrating a fairly large codebase from VSS to Clearcase w\ UCM and are considering organizing our source into one or more components within a single project. What best practices\potential pitfalls should we keep in mind?
The source is organized into layers (data layer, business layer, GUI layer). The team is fairly small, developers tend to own a certain layer of the codebase and we anticipate a fair amount of branching due to parallel development efforts.
share|improve this question
1
Just completed my answer in response to your comment. – VonC Nov 19 '09 at 21:35
Just added the parasite baseline warning about component dependency. – VonC Nov 19 '09 at 21:51
add comment
1 Answer
up vote 6 down vote accepted
Single most dangerous pitfall:
Once a component is defined, you cannot move an element outside of this component (you can copy it and re-create it elsewhere, but you will loose its history)
Single most useful best-practice:
Understand well the nature of an UCM component: it is about coherency.
A component is a set of file which:
• evolves as a single unit,
• is labeled (baselined) as a whole,
• is branched as a whole.
If you can make evolutions without touching another group of files, chances are you have two components.
Example of components:
• an application (or a autonomous part of an application)
• a technical library
• a packaged set of file (for release)
The one document that should guide you to define components is the Applicative Architecture (which takes the business and functional specifications and project them onto applications which will then be specified at the technical level and implemented).
When all those components are defined, you have two approaches to manage them:
• system approach (every components is writable in a UCM project): useful for starting a project, but cumbersome with legacy project: you do not need to put a baseline on each and every components simply because 3 files has changed in one of those components.
• component approach: one or two writable components, the rest is there only as non-modifiable component. This is a scalable approach, allowing you to define one project per-component to develop, with a "fixed configuration" (i.e. "the other baselines", representing fixed states of the non-modifiable components you need to have in order to compile the modifiable one. You can change at any time this configuration, that is you can rebase the foundation baselines of the non-modifiable component whenever you want).
You can define as many Projects and Streams you want, allowing you to easily visualize the merge workflow.
Remember: a Stream represents a development effort.
Do not call a Stream after a resource (like VonC_stream), but after a task or set of tasks to do in that Stream (as in APP_LCH_R32_Dev: Development for 32th release of my App Launcher)
Note: UCM is just some meta-data on top of ClearCase: even if a group of file is defined as a UCM component, nothing prevents you to still making classic non-UCM branches, checkouts or checkins (in non-UCM views).
Is there a danger in creating too many fine grained components or having too many dependencies between components?
Yes, that is why Applicative Architecture is important. Again, once a component is defined, you cannot move elements between those components.
Another details to know about components is their layout:
myVob
myComponent1
myComponent2
myComponent3
A root component is always at the first level below a Vob.
You also can define a component as a all Vob but I would not recommend it (adding a Vob put stress on your Vob server. Adding a directory within an existing Vob cost nothing)
That means if you define some technical libraries as components, you cannot go as:
myLibs
Apache
ant
xalan
xerces
but will have to do:
myLibs
apapche_ant
apache_xalan
apache_xerces
Final warning: dependency (the true mark of a configuration management system)
One of the main advantage of UCM (or so I thought at the time -- 2003 --) is dependency.
If A depends on B, and I put A in my project, it will automatically include B in the same project.
Magic.
But it is broken.
• First, never do root-based dependency (a root-based component is a set of file). It will break at the first overlap:
A1
B1
B2
Here you need B2 to go on building A, but A starts from A1 based on B1: B2 overrides B1. As soon as you put a baseline on A (A2), it is over. You will not be able to change B anymore. A parasite baseline (called A2!?) will have been put on the (non-modifiable!) component B because of the overlap.
• Always include your dependencies in a rootless component
ADep1
A1
BDep1
B1
BDep2
B2
Here you have rootless components ADep and BDep (a rootless component is a special component which aggregates other rootless or root-based components)
You still have an override, but this time between rootless components.
That will still make a parasite baseline (on BDep, called A2), but at least you will be able to rebase BDep2 into other baselines later (BDep3, BDep4...)
More on this Incoherences and Inconsistencies of ClearCase UCM, with Rational counter-arguments here (and just after that their post, proof that their arguments are not very good to say the least).
Read also How to Leverage Clearcase’s features
share|improve this answer
Is there a danger in creating too many fine grained components or having too many dependencies between components? – zac Nov 19 '09 at 21:27
add comment
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://stackoverflow.com/questions/1764329/clearcase-ucm-best-practices-using-components",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "73123",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BOERUQMMPCOBMVDOT5W7Y7B4U7WCO4HO",
"WARC-Concurrent-To": "<urn:uuid:0bf5d97b-02e8-4dc8-b726-5b0782476509>",
"WARC-Date": "2014-03-07T15:19:29Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:3ZQH65DWC3YWTQD4LXRZOMYKQDF5XCFP",
"WARC-Record-ID": "<urn:uuid:f20ad433-7b0a-4309-9ffe-c647351ee32b>",
"WARC-Target-URI": "http://stackoverflow.com/questions/1764329/clearcase-ucm-best-practices-using-components",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cb47232c-4ba1-485d-96b0-3c624d78ace2>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-142-35.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-10\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
157,
158,
386,
387,
627,
628,
656,
660,
742,
744,
841,
853,
854,
863,
864,
893,
894,
925,
926,
1085,
1086,
1120,
1121,
1192,
1228,
1229,
1259,
1298,
1326,
1327,
1432,
1433,
1456,
1457,
1517,
1541,
1582,
1583,
1836,
1837,
1916,
1917,
2179,
2180,
2699,
2700,
2807,
2808,
2860,
3045,
3046,
3047,
3261,
3262,
3263,
3378,
3379,
3522,
3523,
3581,
3582,
3588,
3603,
3618,
3633,
3634,
3693,
3868,
3869,
3952,
3953,
3960,
3969,
3977,
3987,
3998,
3999,
4020,
4021,
4028,
4042,
4057,
4073,
4074,
4075,
4154,
4155,
4244,
4343,
4344,
4351,
4352,
4370,
4371,
4492,
4493,
4500,
4509,
4516,
4517,
4815,
4816,
4877,
4887,
4896,
4908,
4919,
4929,
4940,
4941,
5092,
5163,
5317,
5318,
5516,
5517,
5564,
5565,
5591,
5593,
5735,
5747,
5748,
5760,
5761,
5763,
5771,
5772,
5850,
5851
],
"line_end_idx": [
25,
157,
158,
386,
387,
627,
628,
656,
660,
742,
744,
841,
853,
854,
863,
864,
893,
894,
925,
926,
1085,
1086,
1120,
1121,
1192,
1228,
1229,
1259,
1298,
1326,
1327,
1432,
1433,
1456,
1457,
1517,
1541,
1582,
1583,
1836,
1837,
1916,
1917,
2179,
2180,
2699,
2700,
2807,
2808,
2860,
3045,
3046,
3047,
3261,
3262,
3263,
3378,
3379,
3522,
3523,
3581,
3582,
3588,
3603,
3618,
3633,
3634,
3693,
3868,
3869,
3952,
3953,
3960,
3969,
3977,
3987,
3998,
3999,
4020,
4021,
4028,
4042,
4057,
4073,
4074,
4075,
4154,
4155,
4244,
4343,
4344,
4351,
4352,
4370,
4371,
4492,
4493,
4500,
4509,
4516,
4517,
4815,
4816,
4877,
4887,
4896,
4908,
4919,
4929,
4940,
4941,
5092,
5163,
5317,
5318,
5516,
5517,
5564,
5565,
5591,
5593,
5735,
5747,
5748,
5760,
5761,
5763,
5771,
5772,
5850,
5851,
5941
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5941,
"ccnet_original_nlines": 131,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41085270047187805,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03445306047797203,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16881997883319855,
"rps_doc_frac_unique_words": 0.4018499553203583,
"rps_doc_mean_word_length": 4.751284599304199,
"rps_doc_num_sentences": 44,
"rps_doc_symbol_to_word_ratio": 0.0008613300160504878,
"rps_doc_unigram_entropy": 5.367483139038086,
"rps_doc_word_count": 973,
"rps_doc_frac_chars_dupe_10grams": 0.04153146967291832,
"rps_doc_frac_chars_dupe_5grams": 0.0722474604845047,
"rps_doc_frac_chars_dupe_6grams": 0.0722474604845047,
"rps_doc_frac_chars_dupe_7grams": 0.05710577964782715,
"rps_doc_frac_chars_dupe_8grams": 0.05710577964782715,
"rps_doc_frac_chars_dupe_9grams": 0.04153146967291832,
"rps_doc_frac_chars_top_2gram": 0.014276440255343914,
"rps_doc_frac_chars_top_3gram": 0.004542499780654907,
"rps_doc_frac_chars_top_4gram": 0.005840360186994076,
"rps_doc_books_importance": -563.0973510742188,
"rps_doc_books_importance_length_correction": -563.0973510742188,
"rps_doc_openwebtext_importance": -275.83154296875,
"rps_doc_openwebtext_importance_length_correction": -275.83154296875,
"rps_doc_wikipedia_importance": -203.63441467285156,
"rps_doc_wikipedia_importance_length_correction": -203.63441467285156
},
"fasttext": {
"dclm": 0.054370999336242676,
"english": 0.924204409122467,
"fineweb_edu_approx": 2.29677152633667,
"eai_general_math": 0.1808653473854065,
"eai_open_web_math": 0.5095358490943909,
"eai_web_code": 0.032028619199991226
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "-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,603,563,187,381,004,000 |
Internet Speed Analysis and Ideal Internet Speed
Internet Speed Analysis and Ideal Internet Speed
I affectionately recollect dialing up to the internet back when I was a youngster and 56K modems and usernames like “cooltom123” were popular. The consoling shrieks and twitters pushed parcels of information down a phone line that was initially intended for voice correspondences. Perusing the internet in those days was difficult more often than not, and Wi-Fi was non-existent. I used to frantically attempt free dial-up administrations at the end of the week, and play Grand Theft Auto PC multiplayer by dialing my companions telephone number. My PC gaming was just hindered if my mother chose to get our home telephone to make a call.
It’s difficult to envision the times of the 56K modem contrasted with the present internet. I bear the internet in my pocket now, and there are no shrieks and tweets going with it. Bandwidth has progressed significantly. During that time I’ve generally been sufficiently fortunate to get the quickest internet accessible at home. Regardless of whether that was getting BT ADSL introduced and being one of the first clients in my ward, or purchasing a Nokia telephone with access to WAP pages. I’m an innovation someone who is addicted, and I generally need the quickest apparatus.
I’ve attempted an assortment of ISPs throughout the years, and for as far back as two I’ve been utilizing fiber on BT that oversees speeds of around 70Mbps. Gushing, gaming, and general downloading have all been fine, yet I’ve been desirous of companions with 200Mbps associations on Virgin Media. I simply moved lofts at the end of the week, and I was at first stunned to discover that there are no rapid internet choices accessible from suppliers like Virgin Media or BT. Moving house is sufficiently unpleasant without stressing over your internet dependence
Fortunately, I found an ISP that is actually a blessing from heaven in the UK. Hyperoptic, a five-year-old organization I’d never known about, has been giving 1Gbps internet speeds to homes and organizations crosswise over London and different parts of the UK. Fortunately enough, the building I’ve moved into can bolster 1Gbps speeds on Hyperoptic. I had the alternative to pick between 10Mbps, 100Mbps, and 1Gbps, yet the decision is really clear in case you’re an internet junkie. Hyperoptic doesn’t compel you to burn through cash on a telephone line like BT does, so I just selected the 1Gbps bundle to perceive what it resembles to have that speed in my own home.
I’ve just had the administration not exactly seven days, however I’ve sincerely attempted to witness the contrasts between about 100Mbps speeds and the great 1Gbps association. Spilling 4K content appears to be similarly as solid as previously, and site pages generally aren’t recognizably quicker. The enormous distinction is the colossal 1Gbps transfer. I can send extensive files to OneDrive or Dropbox in what appears to be moment, and notwithstanding sending files to loved ones is much speedier.
When I switched from 56K to ADSL, or from ADSL to a fiber association, there was an incredible and observable knock in speed. I genuinely haven’t felt that yet with this association. I’ve been getting speeds that are near the greatest achievable over a wired LAN, however they haven’t had an enormous effect to the manner in which I work. Sites and administrations simply aren’t setup to completely use a 1Gbps association. That is not so much astounding here in the UK as the legislature is as yet attempting to get the country on super-quick associations. The bar has been set at least 2Mbps for 95 percent of the country, and it’s such a low base speed, to the point that the interest in the foundation required to make utilization of 1Gbps associations simply wouldn’t occur at a fast pace until the point that organizations and purchasers can make utilization of such speeds.
Wi-Fi is additionally a bottleneck with a 1Gbps association. I can oversee around 400Mbps max utilizing an AC switch, yet the more I move far from the switch then the less bandwidth I get. It’s enticing to state that a 100Mbps association is all you need, and it most likely is for the time being. In the event that history has shown us anything, however, it’s that we’ll glance back at 100Mbps internet associations and laugh that we even utilized something so moderate. The eventual fate of super rapid internet is as of now here, yet we simply require everything else to get up to speed and quit slacking.
|
{
"url": "http://newstoday.myfiwifi.net/internet-speed-analysis-and-ideal-internet-speed/",
"source_domain": "newstoday.myfiwifi.net",
"snapshot_id": "crawl=CC-MAIN-2019-09",
"warc_metadata": {
"Content-Length": "20040",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WHE7OITBYBHQBKNUHYSGA4IEAZ7BXJL2",
"WARC-Concurrent-To": "<urn:uuid:a2ffe0ad-f430-4518-896d-e3c26c67f13e>",
"WARC-Date": "2019-02-21T21:44:05Z",
"WARC-IP-Address": "104.27.137.186",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UFYLCRUKQIHMKXA2PCOH5M5XHDP2LPSW",
"WARC-Record-ID": "<urn:uuid:a5be37cf-226d-45e7-a915-f73bdaf38647>",
"WARC-Target-URI": "http://newstoday.myfiwifi.net/internet-speed-analysis-and-ideal-internet-speed/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2b7a46ee-6a41-413b-b481-493397330c55>"
},
"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-151-171-77.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,
49,
50,
99,
100,
739,
740,
1321,
1322,
1884,
1885,
2555,
2556,
3058,
3059,
3940,
3941
],
"line_end_idx": [
49,
50,
99,
100,
739,
740,
1321,
1322,
1884,
1885,
2555,
2556,
3058,
3059,
3940,
3941,
4549
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4549,
"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.43841809034347534,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05310733988881111,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10960452258586884,
"rps_doc_frac_unique_words": 0.46578946709632874,
"rps_doc_mean_word_length": 4.8815789222717285,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.293761730194092,
"rps_doc_word_count": 760,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.033423181623220444,
"rps_doc_frac_chars_dupe_6grams": 0.033423181623220444,
"rps_doc_frac_chars_dupe_7grams": 0.033423181623220444,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.00808625016361475,
"rps_doc_frac_chars_top_3gram": 0.01132075022906065,
"rps_doc_frac_chars_top_4gram": 0.012938009575009346,
"rps_doc_books_importance": -326.826904296875,
"rps_doc_books_importance_length_correction": -326.826904296875,
"rps_doc_openwebtext_importance": -216.63543701171875,
"rps_doc_openwebtext_importance_length_correction": -216.63543701171875,
"rps_doc_wikipedia_importance": -142.68740844726562,
"rps_doc_wikipedia_importance_length_correction": -142.68740844726562
},
"fasttext": {
"dclm": 0.018680749461054802,
"english": 0.9530283808708191,
"fineweb_edu_approx": 1.2745872735977173,
"eai_general_math": 0.23239654302597046,
"eai_open_web_math": 0.3649381399154663,
"eai_web_code": 0.006566409952938557
}
}
|
{
"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": "384.76",
"labels": {
"level_1": "Social sciences",
"level_2": "Commerce and Communication and traffic",
"level_3": "Telecommunication"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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
|
-745,521,595,451,482,800 |
Sunday, May 17, 2015
How fast can we sort?
We all know that we can sort n things in O(n log n) time and that is the best you can do. Problem solved. Right? Wrong!
Sorting is a fascinating topic and I am planning a whole series of posts about it. It also inspired the blog name.
Let's start with what most programmers already know.
Classic sorting algorithms
O(n log n) sorting algorithms have been known for a very long time. John von Neumann already implemented merge sort in 1945 on the EDVAC computer. We're talking about a computer built out of vacuum tubes, with 1000 words of RAM, capable of performing 1000 operations per second or so.
Later people discovered quicksort in 1962[1] and heapsort in 1964[2]. The only theoretical improvement here is that heapsort is in-place: it uses only O(1) additional memory outside the array. Of course the heap-based priority queue is nice in its own right.
We can easily implement another O(n log n) sorting algorithm, AVL-sort, using the code from my previous post on balanced binary search trees. We just put all the elements into an AVL tree, and the extract them back into a list:
avlSort :: Ord t => [t] -> [t]
avlSort = toList . fromList
Lower bound for comparison-based sorting
Suppose that we restrict ourselves to performing only one operation on the elements we're sorting: compare two of them to see which one is bigger. This is what we mean by "comparison-based sorting".
Every comparison operation returns a single yes or no answer. If we perform k such operations, we can get 2k different sequences of answers, and hence we can distinguish between 2k different permutations. Since there are n! permutations of n elements, it follows that we need at least log2 (n!) comparisons in the worst case (and also on average, which is slightly harder to see) to distinguish between them all.
log2 (n!) ≥ log2 (n/2)(n/2) = n/2 * (log2 n - 1) = Θ(n log n)
So there you go. That's the proof of the lower bound.
The significance of this lower bound has been overblown. Why would you ever so restrict yourself as to only use comparisons?? You can do much more with numbers, or other objects that you'd want to sort, than just compare two of them. You can add them, you can multiply them, you can index arrays with them... All these other operations don't seem all that useful for sorting at first sight. But it turns out they are useful! This is very unintuitive, and fascinating at the same time.
Again and again I have seen people cite this result when it does not apply. Most commonly, the claim is that n numbers can't be sorted faster than O(n log n). For example, people will claim that it's impossible to compute convex hulls in 2D faster than O(n log n), because that requires sorting coordinates. As we will see in a moment, this claim is false. Numbers can actually be sorted faster than this!
Faster sorting algorithms
Let's start talking about some asymptotically faster sorting algorithms. What are some of the things we normally want to sort?
The first group is numbers: integers, rational numbers, floating-point real numbers, complex numbers... OK maybe not complex numbers, they don't have any natural ordering.
The second group is sequences of characters or numbers, such as text strings (e.g. names) or big multi-precision integers.
Sorting integers
Important note here: we are talking about sorting integers that fit in a single machine word, such as 64-bit integers on a 64-bit computer. In general, we will be talking about sorting w-bit integers on a w-bit computer. This is not an artificial restriction: comparison-based sorting algorithms need this as well. Well, we can allow a constant multiple, such as 2w-bit integers on a w-bit computer. After all, we can implement operations on 2-word integers in O(1) time. But we're not talking about huge, multiple-precision integers. If you want to sort million-bit integers, you have to either find a 1000000-bit computer, or skip to the section about sorting sequences.
Here is a summary of various algorithms for sorting integers. I will be writing about some of them in my future posts.
long agomerge sortO(n log n)
long agoradix sortO(n w / log n)
1977van Emde Boas [3]O(n log w)
1983Kirkpatrick & Reisch [4]O(n log (w / log n))
1995Andersson, Hagerup, Nilsson, Raman [6]O(n log log n)
2002Han & Thorup [7]O(n (log log n)1/2)
Some of these run-times depend on w, but the last two are clearly better than O(n log n), independently of w.
Is sorting integers in O(n) time possible?
This is the big open problem. Nobody knows.
Radix sort does it when n is big compared to the word size (log n = Ω(w)).
In their 1995 paper [6], Andersson et al showed how to do this when n is small compared to the word size (log n = O(w1/2-ɛ) for some ɛ>0). There is still a gap in between where we just don't know.
Update: It has been pointed out in the comments that this knowledge gap has been slightly tightened on the "small n compared to the word size" side. As of 2014[8], we know how to sort in O(n) time when log n = O((w / log w)1/2).
What about other kinds of numbers?
Real numbers are typically represented in a floating point format. This seems harder to handle than integers, but it's really not. Floating point numbers are represented as two integers: an exponent and a mantissa. For instance, the IEEE double-precision floating point format, the most common representation out there, stores real numbers as an 11-bit exponent and a 52-bit mantissa. The representation is: 2exponent * (1 + mantissa * 2-52). A number with a higher exponent is bigger than a number with a smaller exponent. For equal exponents, the number with the bigger mantissa is bigger. So really, sorting these real numbers is equivalent to sorting 63-bit integers!
Sorting rational numbers can also be reduced to sorting integers. If you have rational numbers a/b, where a and b are w-bit integers, compute ⌊a * 22w / b⌋ for each, and sort the resulting 3w-bit integers. This works because a difference between two different rationals a/b and c/d is always at least 1/(bd) > 2-2w, so a precision of 2w bits after the binary point is sufficient.
This is another reason sorting integers is an interesting topic: if we can sort integers, we can sort all kinds of numbers.
Sorting strings lexicographically
The important thing to notice here is that we can't compare two elements in constant time any more in this case. Therefore, merge-sort does not work in O(n log n) time. It can be shown that it works in O(L log n) time, where L is the sum of lengths of the strings.
This too can be improved. In 1994, Andersson and Nillson [5] showed how to sort strings in O(L + (time to sort n characters)) time. If the alphabet is small (such as ASCII), we can use count sort to sort the n characters, which gives time complexity O(L + |Σ|), where |Σ| is the size of the alphabet. If the alphabet is large, we can use one of the integer sorting algorithms and arrive at, say, O(L + n (log log n)1/2) time.
This also works for sorting multi-precision integers. If you append their lengths at the start, this is just lexicographic sorting, where the "characters" are word-size numbers.
References
[1] Hoare, Charles AR. "Quicksort." The Computer Journal 5.1 (1962): 10-16.
[2] Williams, John William Joseph. "ALGORITHM-232-HEAPSORT." Communications of the ACM 7.6 (1964): 347-348.
[3] van Emde Boas, Peter. "Preserving order in a forest in less than logarithmic time and linear space." Information processing letters 6.3 (1977): 80-82.
[4] Kirkpatrick, David, and Stefan Reisch. "Upper bounds for sorting integers on random access machines." Theoretical Computer Science 28.3 (1983): 263-276.
[5] Andersson, Arne, and Stefan Nilsson. "A new efficient radix sort." Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on. IEEE, 1994.
[6] Andersson, Arne, et al. "Sorting in linear time?." Proceedings of the twenty-seventh annual ACM symposium on Theory of computing. ACM, 1995.
[7] Han, Yijie, and Mikkel Thorup. "Integer sorting in O (n√(log log n)) expected time and linear space." Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE Symposium on. IEEE, 2002.
[8] Belazzougui, Djamal, Gerth Stølting Brodal, and Jesper Sindahl Nielsen. "Expected Linear Time Sorting for Word Size Ω(log2 n log log n)." Algorithm Theory–SWAT 2014. Springer International Publishing, 2014. 26-37.
2 comments:
1. There has been an improvement on [6] in SWAT'14:
http://www.cs.au.dk/~gerth/papers/swat14sort.pdf
So now w = log^2(n) loglog(n) is enough. Would be cool to get it down to a clean w = log^2(n) :)
ReplyDelete
Replies
1. Progress! This still looks nicer than having an epsilon in the exponent :) I added an update.
Delete
|
{
"url": "http://sorting-and-searching.blogspot.com/2015/05/how-fast-can-we-sort.html",
"source_domain": "sorting-and-searching.blogspot.com",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "65208",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OLKWTWYJNQW3FGKRNENWDILZUHU2T3JF",
"WARC-Concurrent-To": "<urn:uuid:f3eaa27a-7f23-471a-a15f-70e64fa28a95>",
"WARC-Date": "2018-06-19T01:01:19Z",
"WARC-IP-Address": "172.217.7.193",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6FFVTF7PKFEGUC2XBMRPZWGPMIFQWKHX",
"WARC-Record-ID": "<urn:uuid:198460a6-9fb9-4a0c-a0b4-4ce78ed63c0e>",
"WARC-Target-URI": "http://sorting-and-searching.blogspot.com/2015/05/how-fast-can-we-sort.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f15df02a-25e7-402e-a41a-aab52c47c923>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-229-194-245.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,
21,
22,
44,
45,
165,
166,
281,
282,
335,
336,
363,
364,
365,
650,
651,
910,
911,
1139,
1170,
1198,
1199,
1240,
1241,
1242,
1441,
1442,
1855,
1856,
1918,
1919,
1973,
1974,
2459,
2460,
2866,
2867,
2893,
2894,
2895,
3022,
3023,
3195,
3196,
3319,
3320,
3337,
3338,
3339,
4012,
4013,
4132,
4133,
4162,
4195,
4227,
4276,
4333,
4373,
4374,
4484,
4485,
4528,
4529,
4530,
4574,
4575,
4650,
4651,
4848,
4849,
5078,
5079,
5114,
5115,
5116,
5788,
5789,
6169,
6170,
6294,
6295,
6329,
6330,
6331,
6596,
6597,
7023,
7024,
7202,
7203,
7214,
7215,
7216,
7292,
7400,
7555,
7712,
7873,
8018,
8223,
8441,
8442,
8454,
8455,
8509,
8562,
8663,
8664,
8680,
8692,
8793,
8794
],
"line_end_idx": [
21,
22,
44,
45,
165,
166,
281,
282,
335,
336,
363,
364,
365,
650,
651,
910,
911,
1139,
1170,
1198,
1199,
1240,
1241,
1242,
1441,
1442,
1855,
1856,
1918,
1919,
1973,
1974,
2459,
2460,
2866,
2867,
2893,
2894,
2895,
3022,
3023,
3195,
3196,
3319,
3320,
3337,
3338,
3339,
4012,
4013,
4132,
4133,
4162,
4195,
4227,
4276,
4333,
4373,
4374,
4484,
4485,
4528,
4529,
4530,
4574,
4575,
4650,
4651,
4848,
4849,
5078,
5079,
5114,
5115,
5116,
5788,
5789,
6169,
6170,
6294,
6295,
6329,
6330,
6331,
6596,
6597,
7023,
7024,
7202,
7203,
7214,
7215,
7216,
7292,
7400,
7555,
7712,
7873,
8018,
8223,
8441,
8442,
8454,
8455,
8509,
8562,
8663,
8664,
8680,
8692,
8793,
8794,
8806
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8806,
"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.3497560918331146,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02780487947165966,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2751219570636749,
"rps_doc_frac_unique_words": 0.37166324257850647,
"rps_doc_mean_word_length": 4.601642608642578,
"rps_doc_num_sentences": 131,
"rps_doc_symbol_to_word_ratio": 0.000975609989836812,
"rps_doc_unigram_entropy": 5.604208946228027,
"rps_doc_word_count": 1461,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.025732560083270073,
"rps_doc_frac_chars_dupe_6grams": 0.007437159772962332,
"rps_doc_frac_chars_dupe_7grams": 0.007437159772962332,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.010709499940276146,
"rps_doc_frac_chars_top_3gram": 0.0062472098506987095,
"rps_doc_frac_chars_top_4gram": 0.0044622900895774364,
"rps_doc_books_importance": -908.8834838867188,
"rps_doc_books_importance_length_correction": -908.8834838867188,
"rps_doc_openwebtext_importance": -540.3997802734375,
"rps_doc_openwebtext_importance_length_correction": -540.3997802734375,
"rps_doc_wikipedia_importance": -346.3848876953125,
"rps_doc_wikipedia_importance_length_correction": -346.3848876953125
},
"fasttext": {
"dclm": 0.7328821420669556,
"english": 0.9058231115341187,
"fineweb_edu_approx": 2.6882588863372803,
"eai_general_math": 0.9868051409721375,
"eai_open_web_math": 0.41081470251083374,
"eai_web_code": 0.8234506249427795
}
}
|
{
"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": "4",
"label": "Analyze"
},
"secondary": {
"code": "5",
"label": "Evaluate"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,602,330,356,463,090,000 |
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.
This question already has an answer here:
How would you recommend backing up an entire hard drive?
Back story:
I often help others perform a clean OS installation (usually Windows) or migrate to a new hard drive. I like to begin with a full disk backup, so I can later revert the entire process, retrieve individual files, preserve factory-installed diagnostics, etc. In the past, I've used some combination of dd/ddrescue (single step for drive, but space inefficient) or ntfsclone for individual partitions.
Requirements:
1. Store NTFS partitions efficiently
2. Navigate partition(s) to retrieve individual files
3. Preserve partition structure, MBR, etc
4. Preserve factory-installed diagnostics or recovery partitions
5. Restore entire image to a new hard drive
6. (Optional) One-step archive
share|improve this question
marked as duplicate by Ramhound, David, Tog, Journeyman Geek, Moses Jan 17 '14 at 4:25
This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
Recommendations of entire product categories can be being a specific product plug. Weighing the pros and cons of various free or paid solutions is also common discourse. – kmarsh Jan 15 '14 at 22:53
OK you have a point there. Maybe this needs to be nominated for duplicate status? – kmarsh Jan 15 '14 at 23:03
@kmarsh - I actually already voted to close it because the author seems to be looking for product recommendations ( or the original revision of the question was one ). – Ramhound Jan 15 '14 at 23:24
@Ramhound Since I'm already involved I think I will defer to other moderators and go with whatever their consensus is. – kmarsh Jan 16 '14 at 15:37
3 Answers 3
up vote 1 down vote accepted
Free solutions such as G4L and Clonezilla can operate both over a network to a file server, or direct connect to SATA/SCSI or a USB-SATA adapter as either the source or the destination. They compress the image takes up less space than the drive or partition being imaged. To optimize beforehand it is best to zero empty space.
Paid solutions include Ghost (now Symantec System Recovery) and Acronis True Image. I have used the latter in its free download form from Western Digital, and it is convenient in that it does not require a network or CD boot like G4L does. I believe Seagate offers similar free functionality in the form of DiscWizard.
share|improve this answer
I use R-Drive Image for this exact purpose.
Some of the Key reasons I purchased it:
1. It has great compression.
2. It supports raw bit for bit disk images.
3. You can tell it to ignore errors and keep trying (for data recovery purposes).
4. File System support is not needed (because it can do a raw bit for bit) but it does support many (including expand when restoring to a larger drive).
5. You can restore individual files and folders (for the many file systems it supports).
6. You can mount images for read-only purposes (logical data recovery is the main thing I use this for).
7. It can check image files for errors after creating it (think checking a CD/DVD after burning it).
share|improve this answer
I cheat. I write a file full of Zeros to the disk, then delete the file. I then use dd and gzip (or similar) to compress the drive, getting really good compression on the parts of the disk which are full of zeros. I then get an exact duplicate of the disk which is efficient from a space point of view (but not very fast to accomplish)
This is not a 1 step process, but should be able to be scripted into a single command easily enough. (At least under Linux).
share|improve this answer
How does this allow for data recovery? The author wants to be able to reverse the process. What you describe would destroy the data and would literally kill a SSD. – Ramhound Jan 15 '14 at 23:23
I think you might have misintepreted me. I did not say overwrite the disk with Zeros, I said create a file full of zeros, then delete that file. That process takes the free space and makes it zeros, which compress well. You then have a filesystem/filesystems which are more compressible, and you simply compress the entire block device (for example cat /dev/sda | gzip > /backuplocation/sda.gz - to undo this, gunzip < /backuplocation/sda.gz > /dev/sda – davidgo Jan 16 '14 at 0:17
Clarify your answer and I will remove my downvote – Ramhound Jan 16 '14 at 2:06
This is not an answer to the original question but an explanation for part of my answer. As such it should really be a comment under my answer. I suggest deleting it as an answer and creating that comment. – kmarsh Jan 16 '14 at 15:36
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://superuser.com/questions/702276/archive-entire-hard-drive",
"source_domain": "superuser.com",
"snapshot_id": "crawl=CC-MAIN-2015-18",
"warc_metadata": {
"Content-Length": "79120",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RD53ZHCGSO44CFGXGXLTEH4CPC6TE7AA",
"WARC-Concurrent-To": "<urn:uuid:f734acf1-6f5b-414e-ac80-317d951ca65b>",
"WARC-Date": "2015-04-25T00:27:07Z",
"WARC-IP-Address": "141.101.114.59",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:3X4OO65H2KKATMMQ2FHPNMINGBBT4PFD",
"WARC-Record-ID": "<urn:uuid:7b0e67d5-7b28-46e5-a509-eaa5f5157cd6>",
"WARC-Target-URI": "http://superuser.com/questions/702276/archive-entire-hard-drive",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:54d54233-3b51-4171-a0de-08aa243970c7>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-235-10-82.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-18\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
150,
151,
193,
194,
251,
252,
264,
663,
664,
678,
679,
718,
774,
818,
885,
931,
964,
992,
993,
1080,
1081,
1224,
1225,
1230,
1430,
1435,
1547,
1552,
1752,
1757,
1906,
1907,
1919,
1920,
1949,
1950,
2277,
2278,
2597,
2598,
2624,
2625,
2669,
2670,
2710,
2711,
2742,
2788,
2872,
3027,
3118,
3225,
3328,
3354,
3355,
3691,
3692,
3817,
3818,
3844,
3849,
4045,
4050,
4533,
4538,
4619,
4624,
4860,
4861
],
"line_end_idx": [
25,
150,
151,
193,
194,
251,
252,
264,
663,
664,
678,
679,
718,
774,
818,
885,
931,
964,
992,
993,
1080,
1081,
1224,
1225,
1230,
1430,
1435,
1547,
1552,
1752,
1757,
1906,
1907,
1919,
1920,
1949,
1950,
2277,
2278,
2597,
2598,
2624,
2625,
2669,
2670,
2710,
2711,
2742,
2788,
2872,
3027,
3118,
3225,
3328,
3354,
3355,
3691,
3692,
3817,
3818,
3844,
3849,
4045,
4050,
4533,
4538,
4619,
4624,
4860,
4861,
4951
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4951,
"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.35885167121887207,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.035406701266765594,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2191387563943863,
"rps_doc_frac_unique_words": 0.4378698170185089,
"rps_doc_mean_word_length": 4.536094665527344,
"rps_doc_num_sentences": 59,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.39314603805542,
"rps_doc_word_count": 845,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04226453974843025,
"rps_doc_frac_chars_dupe_6grams": 0.026089230552315712,
"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.009392119944095612,
"rps_doc_frac_chars_top_3gram": 0.01043569017201662,
"rps_doc_frac_chars_top_4gram": 0.009392119944095612,
"rps_doc_books_importance": -464.3415222167969,
"rps_doc_books_importance_length_correction": -464.3415222167969,
"rps_doc_openwebtext_importance": -281.500732421875,
"rps_doc_openwebtext_importance_length_correction": -281.500732421875,
"rps_doc_wikipedia_importance": -231.49493408203125,
"rps_doc_wikipedia_importance_length_correction": -231.49493408203125
},
"fasttext": {
"dclm": 0.5187259316444397,
"english": 0.9273950457572937,
"fineweb_edu_approx": 1.6530983448028564,
"eai_general_math": 0.2326204776763916,
"eai_open_web_math": 0.3212703466415405,
"eai_web_code": 0.001993240090087056
}
}
|
{
"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.72",
"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": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,848,147,984,470,745,000 |
csdnceshi60
2011-08-06 02:34 阅读 394
与 Project Euler 的速度比较: c vs Erlang vs Haskell
I have taken Problem #12 from Project Euler as a programming exercise and to compare my (surely not optimal) implementations in C, Python, Erlang and Haskell. In order to get some higher execution times, I search for the first triangle number with more than 1000 divisors instead of 500 as stated in the original problem.
The result is the following:
C:
lorenzo@enzo:~/erlang$ gcc -lm -o euler12.bin euler12.c
lorenzo@enzo:~/erlang$ time ./euler12.bin
842161320
real 0m11.074s
user 0m11.070s
sys 0m0.000s
Python:
lorenzo@enzo:~/erlang$ time ./euler12.py
842161320
real 1m16.632s
user 1m16.370s
sys 0m0.250s
Python with PyPy:
lorenzo@enzo:~/Downloads/pypy-c-jit-43780-b590cf6de419-linux64/bin$ time ./pypy /home/lorenzo/erlang/euler12.py
842161320
real 0m13.082s
user 0m13.050s
sys 0m0.020s
Erlang:
lorenzo@enzo:~/erlang$ erlc euler12.erl
lorenzo@enzo:~/erlang$ time erl -s euler12 solve
Erlang R13B03 (erts-5.7.4) [source] [64-bit] [smp:4:4] [rq:4] [async-threads:0] [hipe] [kernel-poll:false]
Eshell V5.7.4 (abort with ^G)
1> 842161320
real 0m48.259s
user 0m48.070s
sys 0m0.020s
Haskell:
lorenzo@enzo:~/erlang$ ghc euler12.hs -o euler12.hsx
[1 of 1] Compiling Main ( euler12.hs, euler12.o )
Linking euler12.hsx ...
lorenzo@enzo:~/erlang$ time ./euler12.hsx
842161320
real 2m37.326s
user 2m37.240s
sys 0m0.080s
Summary:
• C: 100%
• Python: 692% (118% with PyPy)
• Erlang: 436% (135% thanks to RichardC)
• Haskell: 1421%
I suppose that C has a big advantage as it uses long for the calculations and not arbitrary length integers as the other three. Also it doesn't need to load a runtime first (Do the others?).
Question 1: Do Erlang, Python and Haskell lose speed due to using arbitrary length integers or don't they as long as the values are less than MAXINT?
Question 2: Why is Haskell so slow? Is there a compiler flag that turns off the brakes or is it my implementation? (The latter is quite probable as Haskell is a book with seven seals to me.)
Question 3: Can you offer me some hints how to optimize these implementations without changing the way I determine the factors? Optimization in any way: nicer, faster, more "native" to the language.
EDIT:
Question 4: Do my functional implementations permit LCO (last call optimization, a.k.a tail recursion elimination) and hence avoid adding unnecessary frames onto the call stack?
I really tried to implement the same algorithm as similar as possible in the four languages, although I have to admit that my Haskell and Erlang knowledge is very limited.
Source codes used:
#include <stdio.h>
#include <math.h>
int factorCount (long n)
{
double square = sqrt (n);
int isquare = (int) square;
int count = isquare == square ? -1 : 0;
long candidate;
for (candidate = 1; candidate <= isquare; candidate ++)
if (0 == n % candidate) count += 2;
return count;
}
int main ()
{
long triangle = 1;
int index = 1;
while (factorCount (triangle) < 1001)
{
index ++;
triangle += index;
}
printf ("%ld\n", triangle);
}
#! /usr/bin/env python3.2
import math
def factorCount (n):
square = math.sqrt (n)
isquare = int (square)
count = -1 if isquare == square else 0
for candidate in range (1, isquare + 1):
if not n % candidate: count += 2
return count
triangle = 1
index = 1
while factorCount (triangle) < 1001:
index += 1
triangle += index
print (triangle)
-module (euler12).
-compile (export_all).
factorCount (Number) -> factorCount (Number, math:sqrt (Number), 1, 0).
factorCount (_, Sqrt, Candidate, Count) when Candidate > Sqrt -> Count;
factorCount (_, Sqrt, Candidate, Count) when Candidate == Sqrt -> Count + 1;
factorCount (Number, Sqrt, Candidate, Count) ->
case Number rem Candidate of
0 -> factorCount (Number, Sqrt, Candidate + 1, Count + 2);
_ -> factorCount (Number, Sqrt, Candidate + 1, Count)
end.
nextTriangle (Index, Triangle) ->
Count = factorCount (Triangle),
if
Count > 1000 -> Triangle;
true -> nextTriangle (Index + 1, Triangle + Index + 1)
end.
solve () ->
io:format ("~p~n", [nextTriangle (1, 1) ] ),
halt (0).
factorCount number = factorCount' number isquare 1 0 - (fromEnum $ square == fromIntegral isquare)
where square = sqrt $ fromIntegral number
isquare = floor square
factorCount' number sqrt candidate count
| fromIntegral candidate > sqrt = count
| number `mod` candidate == 0 = factorCount' number sqrt (candidate + 1) (count + 2)
| otherwise = factorCount' number sqrt (candidate + 1) count
nextTriangle index triangle
| factorCount triangle > 1000 = triangle
| otherwise = nextTriangle (index + 1) (triangle + index + 1)
main = print $ nextTriangle 1 1
转载于:https://stackoverflow.com/questions/6964392/speed-comparison-with-project-euler-c-vs-python-vs-erlang-vs-haskell
• 点赞
• 写回答
• 关注问题
• 收藏
• 复制链接分享
18条回答 默认 最新
• 已采纳
weixin_41568196 撒拉嘿哟木头 2011-08-06 04:25
Using GHC 7.0.3, gcc 4.4.6, Linux 2.6.29 on an x86_64 Core2 Duo (2.5GHz) machine, compiling using ghc -O2 -fllvm -fforce-recomp for Haskell and gcc -O3 -lm for C.
• Your C routine runs in 8.4 seconds (faster than your run probably because of -O3)
• The Haskell solution runs in 36 seconds (due to the -O2 flag)
• Your factorCount' code isn't explicitly typed and defaulting to Integer (thanks to Daniel for correcting my misdiagnosis here!). Giving an explicit type signature (which is standard practice anyway) using Int and the time changes to 11.1 seconds
• in factorCount' you have needlessly called fromIntegral. A fix results in no change though (the compiler is smart, lucky for you).
• You used mod where rem is faster and sufficient. This changes the time to 8.5 seconds.
• factorCount' is constantly applying two extra arguments that never change (number, sqrt). A worker/wrapper transformation gives us:
$ time ./so
842161320
real 0m7.954s
user 0m7.944s
sys 0m0.004s
That's right, 7.95 seconds. Consistently half a second faster than the C solution. Without the -fllvm flag I'm still getting 8.182 seconds, so the NCG backend is doing well in this case too.
Conclusion: Haskell is awesome.
Resulting Code
factorCount number = factorCount' number isquare 1 0 - (fromEnum $ square == fromIntegral isquare)
where square = sqrt $ fromIntegral number
isquare = floor square
factorCount' :: Int -> Int -> Int -> Int -> Int
factorCount' number sqrt candidate0 count0 = go candidate0 count0
where
go candidate count
| candidate > sqrt = count
| number `rem` candidate == 0 = go (candidate + 1) (count + 2)
| otherwise = go (candidate + 1) count
nextTriangle index triangle
| factorCount triangle > 1000 = triangle
| otherwise = nextTriangle (index + 1) (triangle + index + 1)
main = print $ nextTriangle 1 1
EDIT: So now that we've explored that, lets address the questions
Question 1: Do erlang, python and haskell lose speed due to using arbitrary length integers or don't they as long as the values are less than MAXINT?
In Haskell, using Integer is slower than Int but how much slower depends on the computations performed. Luckily (for 64 bit machines) Int is sufficient. For portability sake you should probably rewrite my code to use Int64 or Word64 (C isn't the only language with a long).
Question 2: Why is haskell so slow? Is there a compiler flag that turns off the brakes or is it my implementation? (The latter is quite probable as haskell is a book with seven seals to me.)
Question 3: Can you offer me some hints how to optimize these implementations without changing the way I determine the factors? Optimization in any way: nicer, faster, more "native" to the language.
That was what I answered above. The answer was
• 0) Use optimization via -O2
• 1) Use fast (notably: unbox-able) types when possible
• 2) rem not mod (a frequently forgotten optimization) and
• 3) worker/wrapper transformation (perhaps the most common optimization).
Question 4: Do my functional implementations permit LCO and hence avoid adding unnecessary frames onto the call stack?
Yes, that wasn't the issue. Good work and glad you considered this.
点赞 27 评论 复制链接分享
• csdnceshi73 喵-见缝插针 2011-08-07 20:04
In regards to Python optimization, in addition to using PyPy (for pretty impressive speed-ups with zero change to your code), you could use PyPy's translation toolchain to compile an RPython-compliant version, or Cython to build an extension module, both of which are faster than the C version in my testing, with the Cython module nearly twice as fast. For reference I include C and PyPy benchmark results as well:
C (compiled with gcc -O3 -lm)
% time ./euler12-c
842161320
./euler12-c 11.95s
user 0.00s
system 99%
cpu 11.959 total
PyPy 1.5
% time pypy euler12.py
842161320
pypy euler12.py
16.44s user
0.01s system
99% cpu 16.449 total
RPython (using latest PyPy revision, c2f583445aee)
% time ./euler12-rpython-c
842161320
./euler12-rpy-c
10.54s user 0.00s
system 99%
cpu 10.540 total
Cython 0.15
% time python euler12-cython.py
842161320
python euler12-cython.py
6.27s user 0.00s
system 99%
cpu 6.274 total
The RPython version has a couple of key changes. To translate into a standalone program you need to define your target, which in this case is the main function. It's expected to accept sys.argv as it's only argument, and is required to return an int. You can translate it by using translate.py, % translate.py euler12-rpython.py which translates to C and compiles it for you.
# euler12-rpython.py
import math, sys
def factorCount(n):
square = math.sqrt(n)
isquare = int(square)
count = -1 if isquare == square else 0
for candidate in xrange(1, isquare + 1):
if not n % candidate: count += 2
return count
def main(argv):
triangle = 1
index = 1
while factorCount(triangle) < 1001:
index += 1
triangle += index
print triangle
return 0
if __name__ == '__main__':
main(sys.argv)
def target(*args):
return main, None
The Cython version was rewritten as an extension module _euler12.pyx, which I import and call from a normal python file. The _euler12.pyx is essentially the same as your version, with some additional static type declarations. The setup.py has the normal boilerplate to build the extension, using python setup.py build_ext --inplace.
# _euler12.pyx
from libc.math cimport sqrt
cdef int factorCount(int n):
cdef int candidate, isquare, count
cdef double square
square = sqrt(n)
isquare = int(square)
count = -1 if isquare == square else 0
for candidate in range(1, isquare + 1):
if not n % candidate: count += 2
return count
cpdef main():
cdef int triangle = 1, index = 1
while factorCount(triangle) < 1001:
index += 1
triangle += index
print triangle
# euler12-cython.py
import _euler12
_euler12.main()
# setup.py
from distutils.core import setup
from distutils.extension import Extension
from Cython.Distutils import build_ext
ext_modules = [Extension("_euler12", ["_euler12.pyx"])]
setup(
name = 'Euler12-Cython',
cmdclass = {'build_ext': build_ext},
ext_modules = ext_modules
)
I honestly have very little experience with either RPython or Cython, and was pleasantly surprised at the results. If you are using CPython, writing your CPU-intensive bits of code in a Cython extension module seems like a really easy way to optimize your program.
点赞 23 评论 复制链接分享
• csdnceshi69 YaoRaoLov 2011-08-06 14:20
There are some problems with the Erlang implementation. As baseline for the following, my measured execution time for your unmodified Erlang program was 47.6 seconds, compared to 12.7 seconds for the C code.
The first thing you should do if you want to run computationally intensive Erlang code is to use native code. Compiling with erlc +native euler12 got the time down to 41.3 seconds. This is however a much lower speedup (just 15%) than expected from native compilation on this kind of code, and the problem is your use of -compile(export_all). This is useful for experimentation, but the fact that all functions are potentially reachable from the outside causes the native compiler to be very conservative. (The normal BEAM emulator is not that much affected.) Replacing this declaration with -export([solve/0]). gives a much better speedup: 31.5 seconds (almost 35% from the baseline).
But the code itself has a problem: for each iteration in the factorCount loop, you perform this test:
factorCount (_, Sqrt, Candidate, Count) when Candidate == Sqrt -> Count + 1;
The C code doesn't do this. In general, it can be tricky to make a fair comparison between different implementations of the same code, and in particular if the algorithm is numerical, because you need to be sure that they are actually doing the same thing. A slight rounding error in one implementation due to some typecast somewhere may cause it to do many more iterations than the other even though both eventually reach the same result.
To eliminate this possible error source (and get rid of the extra test in each iteration), I rewrote the factorCount function as follows, closely modelled on the C code:
factorCount (N) ->
Sqrt = math:sqrt (N),
ISqrt = trunc(Sqrt),
if ISqrt == Sqrt -> factorCount (N, ISqrt, 1, -1);
true -> factorCount (N, ISqrt, 1, 0)
end.
factorCount (_N, ISqrt, Candidate, Count) when Candidate > ISqrt -> Count;
factorCount ( N, ISqrt, Candidate, Count) ->
case N rem Candidate of
0 -> factorCount (N, ISqrt, Candidate + 1, Count + 2);
_ -> factorCount (N, ISqrt, Candidate + 1, Count)
end.
This rewrite, no export_all, and native compilation, gave me the following run time:
$ erlc +native euler12.erl
$ time erl -noshell -s euler12 solve
842161320
real 0m19.468s
user 0m19.450s
sys 0m0.010s
which is not too bad compared to the C code:
$ time ./a.out
842161320
real 0m12.755s
user 0m12.730s
sys 0m0.020s
considering that Erlang is not at all geared towards writing numerical code, being only 50% slower than C on a program like this is pretty good.
Finally, regarding your questions:
Question 1: Do erlang, python and haskell loose speed due to using arbitrary length integers or don't they as long as the values are less than MAXINT?
Yes, somewhat. In Erlang, there is no way of saying "use 32/64-bit arithmetic with wrap-around", so unless the compiler can prove some bounds on your integers (and it usually can't), it must check all computations to see if they can fit in a single tagged word or if it has to turn them into heap-allocated bignums. Even if no bignums are ever used in practice at runtime, these checks will have to be performed. On the other hand, that means you know that the algorithm will never fail because of an unexpected integer wraparound if you suddenly give it larger inputs than before.
Question 4: Do my functional implementations permit LCO and hence avoid adding unnecessary frames onto the call stack?
Yes, your Erlang code is correct with respect to last call optimization.
点赞 21 评论 复制链接分享
• csdnceshi73 喵-见缝插针 2011-08-12 08:53
Question 3: Can you offer me some hints how to optimize these implementations without changing the way I determine the factors? Optimization in any way: nicer, faster, more "native" to the language.
The C implementation is suboptimal (as hinted at by Thomas M. DuBuisson), the version uses 64-bit integers (i.e. long datatype). I'll investigate the assembly listing later, but with an educated guess, there are some memory accesses going on in the compiled code, which make using 64-bit integers significantly slower. It's that or generated code (be it the fact that you can fit less 64-bit ints in a SSE register or round a double to a 64-bit integer is slower).
Here is the modified code (simply replace long with int and I explicitly inlined factorCount, although I do not think that this is necessary with gcc -O3):
#include <stdio.h>
#include <math.h>
static inline int factorCount(int n)
{
double square = sqrt (n);
int isquare = (int)square;
int count = isquare == square ? -1 : 0;
int candidate;
for (candidate = 1; candidate <= isquare; candidate ++)
if (0 == n % candidate) count += 2;
return count;
}
int main ()
{
int triangle = 1;
int index = 1;
while (factorCount (triangle) < 1001)
{
index++;
triangle += index;
}
printf ("%d\n", triangle);
}
Running + timing it gives:
$ gcc -O3 -lm -o euler12 euler12.c; time ./euler12
842161320
./euler12 2.95s user 0.00s system 99% cpu 2.956 total
For reference, the haskell implementation by Thomas in the earlier answer gives:
$ ghc -O2 -fllvm -fforce-recomp euler12.hs; time ./euler12 [9:40]
[1 of 1] Compiling Main ( euler12.hs, euler12.o )
Linking euler12 ...
842161320
./euler12 9.43s user 0.13s system 99% cpu 9.602 total
Conclusion: Taking nothing away from ghc, its a great compiler, but gcc normally generates faster code.
点赞 10 评论 复制链接分享
• csdnceshi65 larry*wei 2016-02-28 19:26
Some more numbers and explanations for the C version. Apparently noone did it during all those years. Remember to upvote this answer so it can get on top for everyone to see and learn.
Step One: Benchmark of the author's programs
Laptop Specifications:
• CPU i3 M380 (931 MHz - maximum battery saving mode)
• 4GB memory
• Win7 64 bits
• Microsoft Visual Studio 2012 Ultimate
• Cygwin with gcc 4.9.3
• Python 2.7.10
Commands:
compiling on VS x64 command prompt > `for /f %f in ('dir /b *.c') do cl /O2 /Ot /Ox %f -o %f_x64_vs2012.exe`
compiling on cygwin with gcc x64 > `for f in ./*.c; do gcc -m64 -O3 $f -o ${f}_x64_gcc.exe ; done`
time (unix tools) using cygwin > `for f in ./*.exe; do echo "----------"; echo $f ; time $f ; done`
.
----------
$ time python ./original.py
real 2m17.748s
user 2m15.783s
sys 0m0.093s
----------
$ time ./original_x86_vs2012.exe
real 0m8.377s
user 0m0.015s
sys 0m0.000s
----------
$ time ./original_x64_vs2012.exe
real 0m8.408s
user 0m0.000s
sys 0m0.015s
----------
$ time ./original_x64_gcc.exe
real 0m20.951s
user 0m20.732s
sys 0m0.030s
Filenames are: integertype_architecture_compiler.exe
• integertype is the same as the original program for now (more on that later)
• architecture is x86 or x64 depending on the compiler settings
• compiler is gcc or vs2012
Step Two: Investigate, Improve and Benchmark Again
VS is 250% faster than gcc. The two compilers should give a similar speed. Obviously, something is wrong with the code or the compiler options. Let's investigate!
The first point of interest is the integer types. Conversions can be expensive and consistency is important for better code generation & optimizations. All integers should be the same type.
It's a mixed mess of int and long right now. We're going to improve that. What type to use? The fastest. Gotta benchmark them'all!
----------
$ time ./int_x86_vs2012.exe
real 0m8.440s
user 0m0.016s
sys 0m0.015s
----------
$ time ./int_x64_vs2012.exe
real 0m8.408s
user 0m0.016s
sys 0m0.015s
----------
$ time ./int32_x86_vs2012.exe
real 0m8.408s
user 0m0.000s
sys 0m0.015s
----------
$ time ./int32_x64_vs2012.exe
real 0m8.362s
user 0m0.000s
sys 0m0.015s
----------
$ time ./int64_x86_vs2012.exe
real 0m18.112s
user 0m0.000s
sys 0m0.015s
----------
$ time ./int64_x64_vs2012.exe
real 0m18.611s
user 0m0.000s
sys 0m0.015s
----------
$ time ./long_x86_vs2012.exe
real 0m8.393s
user 0m0.015s
sys 0m0.000s
----------
$ time ./long_x64_vs2012.exe
real 0m8.440s
user 0m0.000s
sys 0m0.015s
----------
$ time ./uint32_x86_vs2012.exe
real 0m8.362s
user 0m0.000s
sys 0m0.015s
----------
$ time ./uint32_x64_vs2012.exe
real 0m8.393s
user 0m0.015s
sys 0m0.015s
----------
$ time ./uint64_x86_vs2012.exe
real 0m15.428s
user 0m0.000s
sys 0m0.015s
----------
$ time ./uint64_x64_vs2012.exe
real 0m15.725s
user 0m0.015s
sys 0m0.015s
----------
$ time ./int_x64_gcc.exe
real 0m8.531s
user 0m8.329s
sys 0m0.015s
----------
$ time ./int32_x64_gcc.exe
real 0m8.471s
user 0m8.345s
sys 0m0.000s
----------
$ time ./int64_x64_gcc.exe
real 0m20.264s
user 0m20.186s
sys 0m0.015s
----------
$ time ./long_x64_gcc.exe
real 0m20.935s
user 0m20.809s
sys 0m0.015s
----------
$ time ./uint32_x64_gcc.exe
real 0m8.393s
user 0m8.346s
sys 0m0.015s
----------
$ time ./uint64_x64_gcc.exe
real 0m16.973s
user 0m16.879s
sys 0m0.030s
Integer types are int long int32_t uint32_t int64_t and uint64_t from #include <stdint.h>
There are LOTS of integer types in C, plus some signed/unsigned to play with, plus the choice to compile as x86 or x64 (not to be confused with the actual integer size). That is a lot of versions to compile and run ^^
Step Three: Understanding the Numbers
Definitive conclusions:
• 32 bits integers are ~200% faster than 64 bits equivalents
• unsigned 64 bits integers are 25 % faster than signed 64 bits (Unfortunately, I have no explanation for that)
Trick question: "What are the sizes of int and long in C?"
The right answer is: The size of int and long in C are not well-defined!
From the C spec:
int is at least 32 bits
long is at least an int
From the gcc man page (-m32 and -m64 flags):
The 32-bit environment sets int, long and pointer to 32 bits and generates code that runs on any i386 system.
The 64-bit environment sets int to 32 bits and long and pointer to 64 bits and generates code for AMD’s x86-64 architecture.
From MSDN documentation (Data Type Ranges) https://msdn.microsoft.com/en-us/library/s3f49ktz%28v=vs.110%29.aspx :
int, 4 bytes, also knows as signed
long, 4 bytes, also knows as long int and signed long int
To Conclude This: Lessons Learned
• 32 bits integers are faster than 64 bits integers.
• Standard integers types are not well defined in C nor C++, they vary depending on compilers and architectures. When you need consistency and predictability, use the uint32_t integer family from #include <stdint.h>.
• Speed issues solved. All other languages are back hundreds percent behind, C & C++ win again ! They always do. The next improvement will be multithreading using OpenMP :D
点赞 10 评论 复制链接分享
• csdnceshi63 elliott.david 2011-08-06 04:16
Question 1: Do erlang, python and haskell loose speed due to using arbitrary length integers or don't they as long as the values are less than MAXINT?
This is unlikely. I cannot say much about Erlang and Haskell (well, maybe a bit about Haskell below) but I can point a lot of other bottlenecks in Python. Every time the program tries to execute an operation with some values in Python, it should verify whether the values are from the proper type, and it costs a bit of time. Your factorCount function just allocates a list with range (1, isquare + 1) various times, and runtime, malloc-styled memory allocation is way slower than iterating on a range with a counter as you do in C. Notably, the factorCount() is called multiple times and so allocates a lot of lists. Also, let us not forget that Python is interpreted and the CPython interpreter has no great focus on being optimized.
EDIT: oh, well, I note that you are using Python 3 so range() does not return a list, but a generator. In this case, my point about allocating lists is half-wrong: the function just allocates range objects, which are inefficient nonetheless but not as inefficient as allocating a list with a lot of items.
Question 2: Why is haskell so slow? Is there a compiler flag that turns off the brakes or is it my implementation? (The latter is quite probable as haskell is a book with seven seals to me.)
Are you using Hugs? Hugs is a considerably slow interpreter. If you are using it, maybe you can get a better time with GHC - but I am only cogitating hypotesis, the kind of stuff a good Haskell compiler does under the hood is pretty fascinating and way beyond my comprehension :)
Question 3: Can you offer me some hints how to optimize these implementations without changing the way I determine the factors? Optimization in any way: nicer, faster, more "native" to the language.
I'd say you are playing an unfunny game. The best part of knowing various languages is to use them the most different way possible :) But I digress, I just do not have any recommendation for this point. Sorry, I hope someone can help you in this case :)
Question 4: Do my functional implementations permit LCO and hence avoid adding unnecessary frames onto the call stack?
As far as I remember, you just need to make sure that your recursive call is the last command before returning a value. In other words, a function like the one below could use such optimization:
def factorial(n, acc=1):
if n > 1:
acc = acc * n
n = n - 1
return factorial(n, acc)
else:
return acc
However, you would not have such optimization if your function were such as the one below, because there is an operation (multiplication) after the recursive call:
def factorial2(n):
if n > 1:
f = factorial2(n-1)
return f*n
else:
return 1
I separated the operations in some local variables for make it clear which operations are executed. However, the most usual is to see these functions as below, but they are equivalent for the point I am making:
def factorial(n, acc=1):
if n > 1:
return factorial(n-1, acc*n)
else:
return acc
def factorial2(n):
if n > 1:
return n*factorial(n-1)
else:
return 1
Note that it is up to the compiler/interpreter to decide if it will make tail recursion. For example, the Python interpreter does not do it if I remember well (I used Python in my example only because of its fluent syntax). Anyway, if you find strange stuff such as factorial functions with two parameters (and one of the parameters has names such as acc, accumulator etc.) now you know why people do it :)
点赞 9 评论 复制链接分享
• weixin_41568127 ?yb? 2017-01-25 22:30
Trying GO:
package main
import "fmt"
import "math"
func main() {
var n, m, c int
for i := 1; ; i++ {
n, m, c = i * (i + 1) / 2, int(math.Sqrt(float64(n))), 0
for f := 1; f < m; f++ {
if n % f == 0 { c++ }
}
c *= 2
if m * m == n { c ++ }
if c > 1001 {
fmt.Println(n)
break
}
}
}
I get:
original c version: 9.1690 100%
go: 8.2520 111%
But using:
package main
import (
"math"
"fmt"
)
// Sieve of Eratosthenes
func PrimesBelow(limit int) []int {
switch {
case limit < 2:
return []int{}
case limit == 2:
return []int{2}
}
sievebound := (limit - 1) / 2
sieve := make([]bool, sievebound+1)
crosslimit := int(math.Sqrt(float64(limit))-1) / 2
for i := 1; i <= crosslimit; i++ {
if !sieve[i] {
for j := 2 * i * (i + 1); j <= sievebound; j += 2*i + 1 {
sieve[j] = true
}
}
}
plimit := int(1.3*float64(limit)) / int(math.Log(float64(limit)))
primes := make([]int, plimit)
p := 1
primes[0] = 2
for i := 1; i <= sievebound; i++ {
if !sieve[i] {
primes[p] = 2*i + 1
p++
if p >= plimit {
break
}
}
}
last := len(primes) - 1
for i := last; i > 0; i-- {
if primes[i] != 0 {
break
}
last = i
}
return primes[0:last]
}
func main() {
fmt.Println(p12())
}
// Requires PrimesBelow from utils.go
func p12() int {
n, dn, cnt := 3, 2, 0
primearray := PrimesBelow(1000000)
for cnt <= 1001 {
n++
n1 := n
if n1%2 == 0 {
n1 /= 2
}
dn1 := 1
for i := 0; i < len(primearray); i++ {
if primearray[i]*primearray[i] > n1 {
dn1 *= 2
break
}
exponent := 1
for n1%primearray[i] == 0 {
exponent++
n1 /= primearray[i]
}
if exponent > 1 {
dn1 *= exponent
}
if n1 == 1 {
break
}
}
cnt = dn * dn1
dn = dn1
}
return n * (n - 1) / 2
}
I get:
original c version: 9.1690 100%
thaumkid's c version: 0.1060 8650%
first go version: 8.2520 111%
second go version: 0.0230 39865%
I also tried Python3.6 and pypy3.3-5.5-alpha:
original c version: 8.629 100%
thaumkid's c version: 0.109 7916%
Python3.6: 54.795 16%
pypy3.3-5.5-alpha: 13.291 65%
and then with following code I got:
original c version: 8.629 100%
thaumkid's c version: 0.109 8650%
Python3.6: 1.489 580%
pypy3.3-5.5-alpha: 0.582 1483%
def D(N):
if N == 1: return 1
sqrtN = int(N ** 0.5)
nf = 1
for d in range(2, sqrtN + 1):
if N % d == 0:
nf = nf + 1
return 2 * nf - (1 if sqrtN**2 == N else 0)
L = 1000
Dt, n = 0, 0
while Dt <= L:
t = n * (n + 1) // 2
Dt = D(n/2)*D(n+1) if n%2 == 0 else D(n)*D((n+1)/2)
n = n + 1
print (t)
点赞 9 评论 复制链接分享
• weixin_41568110 七度＆光 2014-03-08 18:42
Just for fun. The following is a more 'native' Haskell implementation:
import Control.Applicative
import Control.Monad
import Data.Either
import Math.NumberTheory.Powers.Squares
isInt :: RealFrac c => c -> Bool
isInt = (==) <$> id <*> fromInteger . round
intSqrt :: (Integral a) => a -> Int
--intSqrt = fromIntegral . floor . sqrt . fromIntegral
intSqrt = fromIntegral . integerSquareRoot'
factorize :: Int -> [Int]
factorize 1 = []
factorize n = first : factorize (quot n first)
where first = (!! 0) $ [a | a <- [2..intSqrt n], rem n a == 0] ++ [n]
factorize2 :: Int -> [(Int,Int)]
factorize2 = foldl (\ls@((val,freq):xs) y -> if val == y then (val,freq+1):xs else (y,1):ls) [(0,0)] . factorize
numDivisors :: Int -> Int
numDivisors = foldl (\acc (_,y) -> acc * (y+1)) 1 <$> factorize2
nextTriangleNumber :: (Int,Int) -> (Int,Int)
nextTriangleNumber (n,acc) = (n+1,acc+n+1)
forward :: Int -> (Int, Int) -> Either (Int, Int) (Int, Int)
forward k val@(n,acc) = if numDivisors acc > k then Left val else Right (nextTriangleNumber val)
problem12 :: Int -> (Int, Int)
problem12 n = (!!0) . lefts . scanl (>>=) (forward n (1,1)) . repeat . forward $ n
main = do
let (n,val) = problem12 1000
print val
Using ghc -O3, this consistently runs in 0.55-0.58 seconds on my machine (1.73GHz Core i7).
A more efficient factorCount function for the C version:
int factorCount (int n)
{
int count = 1;
int candidate,tmpCount;
while (n % 2 == 0) {
count++;
n /= 2;
}
for (candidate = 3; candidate < n && candidate * candidate < n; candidate += 2)
if (n % candidate == 0) {
tmpCount = 1;
do {
tmpCount++;
n /= candidate;
} while (n % candidate == 0);
count*=tmpCount;
}
if (n > 1)
count *= 2;
return count;
}
Changing longs to ints in main, using gcc -O3 -lm, this consistently runs in 0.31-0.35 seconds.
Both can be made to run even faster if you take advantage of the fact that the nth triangle number = n*(n+1)/2, and n and (n+1) have completely disparate prime factorizations, so the number of factors of each half can be multiplied to find the number of factors of the whole. The following:
int main ()
{
int triangle = 0,count1,count2 = 1;
do {
count1 = count2;
count2 = ++triangle % 2 == 0 ? factorCount(triangle+1) : factorCount((triangle+1)/2);
} while (count1*count2 < 1001);
printf ("%lld\n", ((long long)triangle)*(triangle+1)/2);
}
will reduce the c code run time to 0.17-0.19 seconds, and it can handle much larger searches -- greater than 10000 factors takes about 43 seconds on my machine. I leave a similar haskell speedup to the interested reader.
点赞 7 评论 复制链接分享
• weixin_41568134 MAO-EYE 2013-02-20 05:58
With Haskell, you really don't need to think in recursions explicitly.
factorCount number = foldr factorCount' 0 [1..isquare] -
(fromEnum $ square == fromIntegral isquare)
where
square = sqrt $ fromIntegral number
isquare = floor square
factorCount' candidate
| number `rem` candidate == 0 = (2 +)
| otherwise = id
triangles :: [Int]
triangles = scanl1 (+) [1,2..]
main = print . head $ dropWhile ((< 1001) . factorCount) triangles
In the above code, I have replaced explicit recursions in @Thomas' answer with common list operations. The code still does exactly the same thing without us worrying about tail recursion. It runs (~ 7.49s) about 6% slower than the version in @Thomas' answer (~ 7.04s) on my machine with GHC 7.6.2, while the C version from @Raedwulf runs ~ 3.15s. It seems GHC has improved over the year.
PS. I know it is an old question, and I stumble upon it from google searches (I forgot what I was searching, now...). Just wanted to comment on the question about LCO and express my feelings about Haskell in general. I wanted to comment on the top answer, but comments do not allow code blocks.
点赞 6 评论 复制链接分享
• csdnceshi50 三生石@ 2013-11-30 03:49
Change: case (divisor(T,round(math:sqrt(T))) > 500) of
To: case (divisor(T,round(math:sqrt(T))) > 1000) of
This will produce the correct answer for the Erlang multi-process example.
点赞 6 评论 复制链接分享
• csdnceshi64 游.程 2014-07-06 11:11
I made the assumption that the number of factors is only large if the numbers involved have many small factors. So I used thaumkid's excellent algorithm, but first used an approximation to the factor count that is never too small. It's quite simple: Check for prime factors up to 29, then check the remaining number and calculate an upper bound for the nmber of factors. Use this to calculate an upper bound for the number of factors, and if that number is high enough, calculate the exact number of factors.
The code below doesn't need this assumption for correctness, but to be fast. It seems to work; only about one in 100,000 numbers gives an estimate that is high enough to require a full check.
Here's the code:
// Return at least the number of factors of n.
static uint64_t approxfactorcount (uint64_t n)
{
uint64_t count = 1, add;
#define CHECK(d) \
do { \
if (n % d == 0) { \
add = count; \
do { n /= d; count += add; } \
while (n % d == 0); \
} \
} while (0)
CHECK ( 2); CHECK ( 3); CHECK ( 5); CHECK ( 7); CHECK (11); CHECK (13);
CHECK (17); CHECK (19); CHECK (23); CHECK (29);
if (n == 1) return count;
if (n < 1ull * 31 * 31) return count * 2;
if (n < 1ull * 31 * 31 * 37) return count * 4;
if (n < 1ull * 31 * 31 * 37 * 37) return count * 8;
if (n < 1ull * 31 * 31 * 37 * 37 * 41) return count * 16;
if (n < 1ull * 31 * 31 * 37 * 37 * 41 * 43) return count * 32;
if (n < 1ull * 31 * 31 * 37 * 37 * 41 * 43 * 47) return count * 64;
if (n < 1ull * 31 * 31 * 37 * 37 * 41 * 43 * 47 * 53) return count * 128;
if (n < 1ull * 31 * 31 * 37 * 37 * 41 * 43 * 47 * 53 * 59) return count * 256;
if (n < 1ull * 31 * 31 * 37 * 37 * 41 * 43 * 47 * 53 * 59 * 61) return count * 512;
if (n < 1ull * 31 * 31 * 37 * 37 * 41 * 43 * 47 * 53 * 59 * 61 * 67) return count * 1024;
if (n < 1ull * 31 * 31 * 37 * 37 * 41 * 43 * 47 * 53 * 59 * 61 * 67 * 71) return count * 2048;
if (n < 1ull * 31 * 31 * 37 * 37 * 41 * 43 * 47 * 53 * 59 * 61 * 67 * 71 * 73) return count * 4096;
return count * 1000000;
}
// Return the number of factors of n.
static uint64_t factorcount (uint64_t n)
{
uint64_t count = 1, add;
CHECK (2); CHECK (3);
uint64_t d = 5, inc = 2;
for (; d*d <= n; d += inc, inc = (6 - inc))
CHECK (d);
if (n > 1) count *= 2; // n must be a prime number
return count;
}
// Prints triangular numbers with record numbers of factors.
static void printrecordnumbers (uint64_t limit)
{
uint64_t record = 30000;
uint64_t count1, factor1;
uint64_t count2 = 1, factor2 = 1;
for (uint64_t n = 1; n <= limit; ++n)
{
factor1 = factor2;
count1 = count2;
factor2 = n + 1; if (factor2 % 2 == 0) factor2 /= 2;
count2 = approxfactorcount (factor2);
if (count1 * count2 > record)
{
uint64_t factors = factorcount (factor1) * factorcount (factor2);
if (factors > record)
{
printf ("%lluth triangular number = %llu has %llu factors\n", n, factor1 * factor2, factors);
record = factors;
}
}
}
}
This finds the 14,753,024th triangular with 13824 factors in about 0.7 seconds, the 879,207,615th triangular number with 61,440 factors in 34 seconds, the 12,524,486,975th triangular number with 138,240 factors in 10 minutes 5 seconds, and the 26,467,792,064th triangular number with 172,032 factors in 21 minutes 25 seconds (2.4GHz Core2 Duo), so this code takes only 116 processor cycles per number on average. The last triangular number itself is larger than 2^68, so
点赞 6 评论 复制链接分享
• csdnceshi70 笑故挽风 2014-08-15 07:12
C++11, < 20ms for me - Run it here
I understand that you want tips to help improve your language specific knowledge, but since that has been well covered here, I thought I would add some context for people who may have looked at the mathematica comment on your question, etc, and wondered why this code was so much slower.
This answer is mainly to provide context to hopefully help people evaluate the code in your question / other answers more easily.
This code uses only a couple of (uglyish) optimisations, unrelated to the language used, based on:
1. every traingle number is of the form n(n+1)/2
2. n and n+1 are coprime
3. the number of divisors is a multiplicative function
#include <iostream>
#include <cmath>
#include <tuple>
#include <chrono>
using namespace std;
// Calculates the divisors of an integer by determining its prime factorisation.
int get_divisors(long long n)
{
int divisors_count = 1;
for(long long i = 2;
i <= sqrt(n);
/* empty */)
{
int divisions = 0;
while(n % i == 0)
{
n /= i;
divisions++;
}
divisors_count *= (divisions + 1);
//here, we try to iterate more efficiently by skipping
//obvious non-primes like 4, 6, etc
if(i == 2)
i++;
else
i += 2;
}
if(n != 1) //n is a prime
return divisors_count * 2;
else
return divisors_count;
}
long long euler12()
{
//n and n + 1
long long n, n_p_1;
n = 1; n_p_1 = 2;
// divisors_x will store either the divisors of x or x/2
// (the later iff x is divisible by two)
long long divisors_n = 1;
long long divisors_n_p_1 = 2;
for(;;)
{
/* This loop has been unwound, so two iterations are completed at a time
* n and n + 1 have no prime factors in common and therefore we can
* calculate their divisors separately
*/
long long total_divisors; //the divisors of the triangle number
// n(n+1)/2
//the first (unwound) iteration
divisors_n_p_1 = get_divisors(n_p_1 / 2); //here n+1 is even and we
total_divisors =
divisors_n
* divisors_n_p_1;
if(total_divisors > 1000)
break;
//move n and n+1 forward
n = n_p_1;
n_p_1 = n + 1;
//fix the divisors
divisors_n = divisors_n_p_1;
divisors_n_p_1 = get_divisors(n_p_1); //n_p_1 is now odd!
//now the second (unwound) iteration
total_divisors =
divisors_n
* divisors_n_p_1;
if(total_divisors > 1000)
break;
//move n and n+1 forward
n = n_p_1;
n_p_1 = n + 1;
//fix the divisors
divisors_n = divisors_n_p_1;
divisors_n_p_1 = get_divisors(n_p_1 / 2); //n_p_1 is now even!
}
return (n * n_p_1) / 2;
}
int main()
{
for(int i = 0; i < 1000; i++)
{
using namespace std::chrono;
auto start = high_resolution_clock::now();
auto result = euler12();
auto end = high_resolution_clock::now();
double time_elapsed = duration_cast<milliseconds>(end - start).count();
cout << result << " " << time_elapsed << '\n';
}
return 0;
}
That takes around 19ms on average for my desktop and 80ms for my laptop, a far cry from most of the other code I've seen here. And there are, no doubt, many optimisations still available.
点赞 5 评论 复制链接分享
• csdnceshi57 perhaps? 2011-08-06 03:12
Take a look at this blog. Over the past year or so he's done a few of the Project Euler problems in Haskell and Python, and he's generally found Haskell to be much faster. I think that between those languages it has more to do with your fluency and coding style.
When it comes to Python speed, you're using the wrong implementation! Try PyPy, and for things like this you'll find it to be much, much faster.
点赞 4 评论 复制链接分享
• csdnceshi70 笑故挽风 2011-08-06 16:44
Looking at your Erlang implementation. The timing has included the start up of the entire virtual machine, running your program and halting the virtual machine. Am pretty sure that setting up and halting the erlang vm takes some time.
If the timing was done within the erlang virtual machine itself, results would be different as in that case we would have the actual time for only the program in question. Otherwise, i believe that the total time taken by the process of starting and loading of the Erlang Vm plus that of halting it (as you put it in your program) are all included in the total time which the method you are using to time the program is outputting. Consider using the erlang timing itself which we use when we want to time our programs within the virtual machine itself timer:tc/1 or timer:tc/2 or timer:tc/3. In this way, the results from erlang will exclude the time taken to start and stop/kill/halt the virtual machine. That is my reasoning there, think about it, and then try your bench mark again.
I actually suggest that we try to time the program (for languages that have a runtime), within the runtime of those languages in order to get a precise value. C for example has no overhead of starting and shutting down a runtime system as does Erlang, Python and Haskell (98% sure of this - i stand correction). So (based on this reasoning) i conclude by saying that this benchmark wasnot precise /fair enough for languages running on top of a runtime system. Lets do it again with these changes.
EDIT: besides even if all the languages had runtime systems, the overhead of starting each and halting it would differ. so i suggest we time from within the runtime systems (for the languages for which this applies). The Erlang VM is known to have considerable overhead at start up!
点赞 4 评论 复制链接分享
• csdnceshi52 妄徒之命 2013-10-12 04:43
Your Haskell implementation could be greatly sped up by using some functions from Haskell packages. In this case I used primes, which is just installed with 'cabal install primes' ;)
import Data.Numbers.Primes
import Data.List
triangleNumbers = scanl1 (+) [1..]
nDivisors n = product $ map ((+1) . length) (group (primeFactors n))
answer = head $ filter ((> 500) . nDivisors) triangleNumbers
main :: IO ()
main = putStrLn $ "First triangle number to have over 500 divisors: " ++ (show answer)
Timings:
Your original program:
PS> measure-command { bin\012_slow.exe }
TotalSeconds : 16.3807409
TotalMilliseconds : 16380.7409
Improved implementation
PS> measure-command { bin\012.exe }
TotalSeconds : 0.0383436
TotalMilliseconds : 38.3436
As you can see, this one runs in 38 milliseconds on the same machine where yours ran in 16 seconds :)
Compilation commands:
ghc -O2 012.hs -o bin\012.exe
ghc -O2 012_slow.hs -o bin\012_slow.exe
点赞 4 评论 复制链接分享
• csdnceshi51 旧行李 2013-10-15 10:23
Question 1: Do Erlang, Python and Haskell lose speed due to using arbitrary length integers or don't they as long as the values are less than MAXINT?
Question one can be answered in the negative for Erlang. The last question is answered by using Erlang appropriately, as in:
http://bredsaal.dk/learning-erlang-using-projecteuler-net
Since it's faster than your initial C example, I would guess there are numerous problems as others have already covered in detail.
This Erlang module executes on a cheap netbook in about 5 seconds ... It uses the network threads model in erlang and, as such demonstrates how to take advantage of the event model. It could be distributed over many nodes. And it's fast. Not my code.
-module(p12dist).
-author("Jannich Brendle, [email protected], http://blog.bredsaal.dk").
-compile(export_all).
server() ->
server(1).
server(Number) ->
receive {getwork, Worker_PID} -> Worker_PID ! {work,Number,Number+100},
server(Number+101);
{result,T} -> io:format("The result is: \~w.\~n", [T]);
_ -> server(Number)
end.
worker(Server_PID) ->
Server_PID ! {getwork, self()},
receive {work,Start,End} -> solve(Start,End,Server_PID)
end,
worker(Server_PID).
start() ->
Server_PID = spawn(p12dist, server, []),
spawn(p12dist, worker, [Server_PID]),
spawn(p12dist, worker, [Server_PID]),
spawn(p12dist, worker, [Server_PID]),
spawn(p12dist, worker, [Server_PID]).
solve(N,End,_) when N =:= End -> no_solution;
solve(N,End,Server_PID) ->
T=round(N*(N+1)/2),
case (divisor(T,round(math:sqrt(T))) > 500) of
true ->
Server_PID ! {result,T};
false ->
solve(N+1,End,Server_PID)
end.
divisors(N) ->
divisor(N,round(math:sqrt(N))).
divisor(_,0) -> 1;
divisor(N,I) ->
case (N rem I) =:= 0 of
true ->
2+divisor(N,I-1);
false ->
divisor(N,I-1)
end.
The test below took place on an: Intel(R) Atom(TM) CPU N270 @ 1.60GHz
~$ time erl -noshell -s p12dist start
The result is: 76576500.
^C
BREAK: (a)bort (c)ontinue (p)roc info (i)nfo (l)oaded
(v)ersion (k)ill (D)b-tables (d)istribution
a
real 0m5.510s
user 0m5.836s
sys 0m0.152s
点赞 1 评论 复制链接分享
• csdnceshi65 larry*wei 2013-12-20 06:27
I modified "Jannich Brendle" version to 1000 instead 500. And list the result of euler12.bin, euler12.erl, p12dist.erl. Both erl codes use '+native' to compile.
zhengs-MacBook-Pro:workspace zhengzhibin$ time erl -noshell -s p12dist start
The result is: 842161320.
real 0m3.879s
user 0m14.553s
sys 0m0.314s
zhengs-MacBook-Pro:workspace zhengzhibin$ time erl -noshell -s euler12 solve
842161320
real 0m10.125s
user 0m10.078s
sys 0m0.046s
zhengs-MacBook-Pro:workspace zhengzhibin$ time ./euler12.bin
842161320
real 0m5.370s
user 0m5.328s
sys 0m0.004s
zhengs-MacBook-Pro:workspace zhengzhibin$
点赞 评论 复制链接分享
• weixin_41568127 ?yb? 2014-01-29 18:05
#include <stdio.h>
#include <math.h>
int factorCount (long n)
{
double square = sqrt (n);
int isquare = (int) square+1;
long candidate = 2;
int count = 1;
while(candidate <= isquare && candidate<=n){
int c = 1;
while (n % candidate == 0) {
c++;
n /= candidate;
}
count *= c;
candidate++;
}
return count;
}
int main ()
{
long triangle = 1;
int index = 1;
while (factorCount (triangle) < 1001)
{
index ++;
triangle += index;
}
printf ("%ld\n", triangle);
}
gcc -lm -Ofast euler.c
time ./a.out
2.79s user 0.00s system 99% cpu 2.794 total
点赞 评论 复制链接分享
相关推荐
|
{
"url": "https://ask.csdn.net/questions/709769",
"source_domain": "ask.csdn.net",
"snapshot_id": "crawl=CC-MAIN-2021-25",
"warc_metadata": {
"Content-Length": "233990",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NMN3CR5O7LBS6SVYXHPNVLIOCCGU6V7J",
"WARC-Concurrent-To": "<urn:uuid:dc4a915a-60ad-4e6f-ae90-b8d4448813cd>",
"WARC-Date": "2021-06-21T20:56:56Z",
"WARC-IP-Address": "47.95.50.136",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IZ2OVZUHJ5E4HSSI4XJ3ZHBBUOB574IH",
"WARC-Record-ID": "<urn:uuid:c74fcf4a-3f38-44d3-8120-9999cc35095d>",
"WARC-Target-URI": "https://ask.csdn.net/questions/709769",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:532a67c3-b888-46b6-9f1b-8a3f443c5841>"
},
"warc_info": "isPartOf: CC-MAIN-2021-25\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-200.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,
12,
36,
37,
83,
84,
406,
407,
436,
437,
440,
441,
497,
539,
549,
550,
568,
586,
599,
600,
608,
609,
651,
661,
662,
680,
698,
711,
712,
730,
731,
844,
854,
855,
873,
891,
904,
905,
913,
914,
955,
1004,
1111,
1112,
1143,
1156,
1157,
1175,
1193,
1206,
1207,
1216,
1217,
1270,
1332,
1356,
1399,
1409,
1410,
1428,
1446,
1459,
1460,
1469,
1470,
1482,
1516,
1559,
1578,
1579,
1770,
1771,
1921,
1922,
2113,
2114,
2313,
2314,
2320,
2321,
2499,
2500,
2672,
2673,
2674,
2693,
2694,
2713,
2731,
2732,
2757,
2759,
2789,
2821,
2865,
2885,
2945,
2989,
3007,
3009,
3010,
3022,
3024,
3047,
3066,
3108,
3114,
3132,
3159,
3165,
3197,
3199,
3200,
3226,
3227,
3239,
3240,
3261,
3288,
3315,
3358,
3403,
3444,
3461,
3462,
3475,
3485,
3522,
3537,
3559,
3560,
3577,
3578,
3597,
3620,
3621,
3693,
3694,
3766,
3767,
3844,
3845,
3893,
3926,
3993,
4055,
4064,
4065,
4099,
4135,
4142,
4176,
4241,
4250,
4251,
4263,
4312,
4326,
4327,
4426,
4472,
4505,
4506,
4547,
4591,
4680,
4745,
4746,
4774,
4819,
4885,
4886,
4918,
4919,
5036,
5037,
5044,
5052,
5061,
5068,
5079,
5080,
5092,
5093,
5101,
5145,
5146,
5313,
5314,
5402,
5470,
5722,
5859,
5952,
6090,
6107,
6124,
6129,
6153,
6177,
6201,
6206,
6207,
6402,
6403,
6439,
6440,
6459,
6460,
6563,
6613,
6650,
6655,
6707,
6777,
6789,
6814,
6849,
6920,
6967,
6972,
7004,
7053,
7123,
7128,
7164,
7169,
7170,
7240,
7241,
7395,
7396,
7674,
7675,
7870,
7871,
8074,
8075,
8126,
8127,
8161,
8221,
8284,
8363,
8364,
8487,
8488,
8560,
8561,
8581,
8621,
8622,
9042,
9043,
9077,
9078,
9102,
9116,
9121,
9146,
9163,
9180,
9202,
9207,
9208,
9221,
9222,
9249,
9263,
9285,
9302,
9320,
9345,
9350,
9351,
9406,
9407,
9438,
9452,
9474,
9497,
9513,
9534,
9539,
9540,
9556,
9557,
9593,
9607,
9638,
9660,
9676,
9696,
9701,
9702,
10082,
10083,
10108,
10113,
10134,
10139,
10163,
10193,
10223,
10270,
10319,
10364,
10385,
10390,
10410,
10431,
10449,
10493,
10516,
10546,
10569,
10586,
10591,
10622,
10645,
10650,
10673,
10699,
10704,
10705,
11042,
11043,
11062,
11094,
11099,
11132,
11175,
11202,
11227,
11257,
11304,
11352,
11397,
11418,
11423,
11441,
11482,
11526,
11549,
11579,
11602,
11607,
11631,
11651,
11671,
11676,
11691,
11728,
11774,
11817,
11822,
11882,
11887,
11898,
11929,
11972,
12004,
12010,
12015,
12016,
12285,
12286,
12306,
12349,
12350,
12562,
12563,
13252,
13253,
13359,
13360,
13441,
13446,
13447,
13891,
13892,
14066,
14067,
14090,
14120,
14149,
14208,
14265,
14278,
14283,
14362,
14411,
14443,
14510,
14572,
14585,
14590,
14591,
14680,
14681,
14712,
14753,
14767,
14772,
14794,
14816,
14833,
14838,
14839,
14888,
14889,
14909,
14923,
14928,
14950,
14972,
14989,
14994,
14995,
15144,
15145,
15184,
15185,
15340,
15341,
15927,
15928,
16051,
16052,
16129,
16130,
16150,
16190,
16191,
16394,
16395,
16864,
16865,
17025,
17026,
17049,
17071,
17076,
17117,
17123,
17157,
17192,
17240,
17263,
17327,
17375,
17397,
17403,
17408,
17424,
17430,
17456,
17479,
17525,
17535,
17556,
17587,
17597,
17632,
17638,
17643,
17644,
17675,
17676,
17731,
17745,
17804,
17809,
17810,
17895,
17896,
18051,
18117,
18141,
18155,
18214,
18219,
18220,
18328,
18329,
18349,
18392,
18393,
18582,
18583,
18632,
18633,
18660,
18661,
18719,
18736,
18755,
18799,
18827,
18847,
18848,
18862,
18863,
18976,
19081,
19186,
19191,
19192,
19198,
19199,
19214,
19246,
19251,
19273,
19295,
19316,
19331,
19368,
19373,
19394,
19415,
19436,
19451,
19488,
19493,
19514,
19535,
19556,
19571,
19605,
19610,
19632,
19654,
19675,
19680,
19681,
19738,
19739,
19822,
19890,
19922,
19923,
19978,
19979,
20146,
20147,
20341,
20342,
20477,
20478,
20493,
20525,
20530,
20551,
20572,
20593,
20608,
20640,
20645,
20666,
20687,
20708,
20723,
20757,
20762,
20783,
20804,
20825,
20840,
20874,
20879,
20900,
20921,
20942,
20957,
20991,
20996,
21018,
21039,
21060,
21075,
21109,
21114,
21136,
21157,
21178,
21193,
21226,
21231,
21252,
21273,
21294,
21309,
21342,
21347,
21368,
21389,
21410,
21425,
21460,
21465,
21486,
21507,
21528,
21543,
21578,
21583,
21604,
21625,
21646,
21661,
21696,
21701,
21723,
21744,
21765,
21780,
21815,
21820,
21842,
21863,
21884,
21899,
21928,
21933,
21954,
21975,
21996,
22011,
22042,
22047,
22068,
22089,
22110,
22125,
22156,
22161,
22183,
22205,
22226,
22241,
22271,
22276,
22298,
22320,
22341,
22356,
22388,
22393,
22414,
22435,
22456,
22471,
22503,
22508,
22530,
22552,
22573,
22578,
22579,
22673,
22674,
22896,
22897,
22939,
22940,
22968,
22969,
23034,
23150,
23151,
23214,
23291,
23292,
23313,
23314,
23342,
23370,
23371,
23420,
23421,
23535,
23664,
23665,
23783,
23784,
23823,
23885,
23886,
23924,
23925,
23982,
23983,
24204,
24205,
24382,
24383,
24403,
24450,
24605,
24606,
25346,
25347,
25657,
25658,
25853,
25854,
26138,
26139,
26342,
26343,
26601,
26602,
26725,
26726,
26925,
26926,
26955,
26973,
26999,
27021,
27058,
27072,
27095,
27100,
27101,
27269,
27270,
27293,
27311,
27343,
27366,
27380,
27401,
27406,
27407,
27622,
27623,
27652,
27670,
27711,
27725,
27748,
27753,
27776,
27794,
27830,
27844,
27865,
27870,
27871,
28282,
28283,
28302,
28344,
28345,
28360,
28361,
28378,
28383,
28400,
28418,
28423,
28441,
28465,
28493,
28562,
28599,
28637,
28647,
28662,
28693,
28715,
28742,
28760,
28774,
28784,
28790,
28795,
28796,
28807,
28808,
28844,
28864,
28865,
28880,
28881,
28898,
28903,
28916,
28931,
28945,
28952,
28957,
28986,
29026,
29043,
29071,
29102,
29131,
29163,
29173,
29211,
29255,
29314,
29357,
29384,
29458,
29494,
29512,
29526,
29536,
29610,
29648,
29663,
29685,
29728,
29755,
29791,
29811,
29844,
29870,
29888,
29902,
29912,
29944,
29980,
30012,
30034,
30048,
30069,
30079,
30109,
30115,
30120,
30125,
30130,
30148,
30175,
30181,
30223,
30244,
30274,
30317,
30343,
30359,
30379,
30406,
30430,
30444,
30465,
30516,
30570,
30599,
30625,
30643,
30673,
30717,
30748,
30788,
30806,
30840,
30876,
30894,
30923,
30949,
30967,
30981,
31008,
31029,
31039,
31070,
31076,
31081,
31082,
31093,
31094,
31130,
31169,
31203,
31240,
31241,
31291,
31292,
31327,
31365,
31391,
31425,
31426,
31466,
31467,
31502,
31540,
31566,
31601,
31602,
31616,
31644,
31674,
31689,
31727,
31754,
31782,
31834,
31839,
31852,
31869,
31874,
31893,
31922,
31982,
32000,
32005,
32019,
32024,
32043,
32085,
32086,
32161,
32162,
32193,
32218,
32241,
32285,
32290,
32327,
32375,
32380,
32420,
32479,
32527,
32532,
32562,
32583,
32634,
32710,
32715,
32752,
32869,
32874,
32904,
32973,
32978,
33027,
33074,
33079,
33144,
33245,
33250,
33285,
33372,
33377,
33391,
33426,
33442,
33447,
33448,
33544,
33545,
33606,
33607,
33635,
33641,
33662,
33692,
33719,
33736,
33752,
33760,
33848,
33882,
33906,
33921,
33945,
33973,
34013,
34041,
34053,
34070,
34090,
34110,
34116,
34121,
34122,
34222,
34223,
34518,
34519,
34535,
34541,
34583,
34594,
34619,
34713,
34751,
34814,
34820,
34825,
34826,
35051,
35052,
35071,
35116,
35117,
35192,
35193,
35254,
35323,
35337,
35383,
35416,
35449,
35499,
35528,
35533,
35556,
35591,
35596,
35667,
35672,
35673,
36065,
36066,
36365,
36366,
36385,
36423,
36424,
36483,
36484,
36540,
36541,
36620,
36621,
36640,
36677,
36678,
37191,
37192,
37388,
37389,
37410,
37411,
37462,
37513,
37519,
37552,
37557,
37607,
37657,
37707,
37757,
37807,
37857,
37907,
37927,
37932,
38012,
38068,
38102,
38152,
38207,
38267,
38333,
38404,
38480,
38562,
38649,
38741,
38839,
38942,
39050,
39082,
39088,
39093,
39135,
39180,
39186,
39219,
39224,
39254,
39259,
39292,
39344,
39367,
39372,
39431,
39453,
39459,
39464,
39529,
39581,
39587,
39620,
39625,
39659,
39701,
39706,
39752,
39762,
39793,
39822,
39827,
39892,
39942,
39947,
39989,
40003,
40085,
40123,
40141,
40255,
40293,
40311,
40325,
40335,
40341,
40346,
40347,
40822,
40823,
40842,
40880,
40881,
40920,
40921,
41213,
41214,
41348,
41349,
41452,
41453,
41506,
41535,
41594,
41595,
41619,
41640,
41661,
41683,
41688,
41713,
41718,
41803,
41808,
41842,
41848,
41880,
41885,
41914,
41940,
41965,
41975,
42006,
42036,
42050,
42074,
42103,
42117,
42122,
42169,
42174,
42241,
42289,
42312,
42333,
42350,
42374,
42384,
42389,
42423,
42462,
42475,
42510,
42516,
42521,
42545,
42551,
42573,
42601,
42606,
42632,
42637,
42702,
42751,
42785,
42823,
42828,
42844,
42854,
42939,
43019,
43070,
43086,
43091,
43183,
43249,
43254,
43298,
43303,
43383,
43388,
43417,
43450,
43488,
43493,
43531,
43554,
43559,
43596,
43619,
43646,
43651,
43682,
43723,
43795,
43800,
43849,
43854,
43883,
43916,
43954,
43959,
43997,
44020,
44025,
44062,
44085,
44112,
44117,
44148,
44189,
44266,
44276,
44281,
44313,
44319,
44324,
44339,
44345,
44383,
44393,
44434,
44489,
44526,
44579,
44584,
44668,
44673,
44732,
44742,
44760,
44766,
44771,
44772,
44964,
44965,
44984,
45026,
45027,
45294,
45295,
45444,
45445,
45464,
45502,
45503,
45742,
45743,
46534,
46535,
47036,
47037,
47324,
47325,
47344,
47382,
47383,
47570,
47571,
47602,
47623,
47628,
47667,
47740,
47805,
47810,
47828,
47919,
47924,
47925,
47938,
47939,
47966,
47967,
48012,
48017,
48052,
48087,
48092,
48093,
48121,
48122,
48162,
48167,
48201,
48233,
48238,
48239,
48345,
48346,
48372,
48373,
48407,
48451,
48456,
48475,
48512,
48513,
48667,
48668,
48797,
48798,
48860,
48861,
48996,
48997,
49252,
49253,
49277,
49357,
49383,
49388,
49406,
49423,
49428,
49452,
49532,
49560,
49624,
49652,
49663,
49668,
49696,
49736,
49800,
49813,
49839,
49844,
49861,
49910,
49956,
50002,
50048,
50092,
50097,
50147,
50152,
50185,
50211,
50266,
50284,
50321,
50340,
50378,
50389,
50394,
50415,
50453,
50458,
50483,
50505,
50537,
50553,
50581,
50598,
50623,
50634,
50639,
50640,
50714,
50715,
50757,
50762,
50791,
50796,
50803,
50808,
50866,
50921,
50927,
50932,
50953,
50974,
50991,
50996,
51015,
51058,
51059,
51224,
51225,
51306,
51336,
51341,
51362,
51384,
51405,
51486,
51500,
51505,
51527,
51549,
51570,
51636,
51650,
51655,
51676,
51697,
51718,
51764,
51769,
51786,
51828,
51851,
51873,
51878,
51907,
51913,
51947,
51985,
52013,
52036,
52089,
52112,
52153,
52173,
52204,
52218,
52242,
52267,
52277,
52299,
52305,
52310,
52326,
52332,
52359,
52382,
52428,
52438,
52460,
52491,
52501,
52537,
52543,
52548,
52549,
52576,
52577,
52594,
52595,
52643,
52644,
52661,
52662
],
"line_end_idx": [
12,
36,
37,
83,
84,
406,
407,
436,
437,
440,
441,
497,
539,
549,
550,
568,
586,
599,
600,
608,
609,
651,
661,
662,
680,
698,
711,
712,
730,
731,
844,
854,
855,
873,
891,
904,
905,
913,
914,
955,
1004,
1111,
1112,
1143,
1156,
1157,
1175,
1193,
1206,
1207,
1216,
1217,
1270,
1332,
1356,
1399,
1409,
1410,
1428,
1446,
1459,
1460,
1469,
1470,
1482,
1516,
1559,
1578,
1579,
1770,
1771,
1921,
1922,
2113,
2114,
2313,
2314,
2320,
2321,
2499,
2500,
2672,
2673,
2674,
2693,
2694,
2713,
2731,
2732,
2757,
2759,
2789,
2821,
2865,
2885,
2945,
2989,
3007,
3009,
3010,
3022,
3024,
3047,
3066,
3108,
3114,
3132,
3159,
3165,
3197,
3199,
3200,
3226,
3227,
3239,
3240,
3261,
3288,
3315,
3358,
3403,
3444,
3461,
3462,
3475,
3485,
3522,
3537,
3559,
3560,
3577,
3578,
3597,
3620,
3621,
3693,
3694,
3766,
3767,
3844,
3845,
3893,
3926,
3993,
4055,
4064,
4065,
4099,
4135,
4142,
4176,
4241,
4250,
4251,
4263,
4312,
4326,
4327,
4426,
4472,
4505,
4506,
4547,
4591,
4680,
4745,
4746,
4774,
4819,
4885,
4886,
4918,
4919,
5036,
5037,
5044,
5052,
5061,
5068,
5079,
5080,
5092,
5093,
5101,
5145,
5146,
5313,
5314,
5402,
5470,
5722,
5859,
5952,
6090,
6107,
6124,
6129,
6153,
6177,
6201,
6206,
6207,
6402,
6403,
6439,
6440,
6459,
6460,
6563,
6613,
6650,
6655,
6707,
6777,
6789,
6814,
6849,
6920,
6967,
6972,
7004,
7053,
7123,
7128,
7164,
7169,
7170,
7240,
7241,
7395,
7396,
7674,
7675,
7870,
7871,
8074,
8075,
8126,
8127,
8161,
8221,
8284,
8363,
8364,
8487,
8488,
8560,
8561,
8581,
8621,
8622,
9042,
9043,
9077,
9078,
9102,
9116,
9121,
9146,
9163,
9180,
9202,
9207,
9208,
9221,
9222,
9249,
9263,
9285,
9302,
9320,
9345,
9350,
9351,
9406,
9407,
9438,
9452,
9474,
9497,
9513,
9534,
9539,
9540,
9556,
9557,
9593,
9607,
9638,
9660,
9676,
9696,
9701,
9702,
10082,
10083,
10108,
10113,
10134,
10139,
10163,
10193,
10223,
10270,
10319,
10364,
10385,
10390,
10410,
10431,
10449,
10493,
10516,
10546,
10569,
10586,
10591,
10622,
10645,
10650,
10673,
10699,
10704,
10705,
11042,
11043,
11062,
11094,
11099,
11132,
11175,
11202,
11227,
11257,
11304,
11352,
11397,
11418,
11423,
11441,
11482,
11526,
11549,
11579,
11602,
11607,
11631,
11651,
11671,
11676,
11691,
11728,
11774,
11817,
11822,
11882,
11887,
11898,
11929,
11972,
12004,
12010,
12015,
12016,
12285,
12286,
12306,
12349,
12350,
12562,
12563,
13252,
13253,
13359,
13360,
13441,
13446,
13447,
13891,
13892,
14066,
14067,
14090,
14120,
14149,
14208,
14265,
14278,
14283,
14362,
14411,
14443,
14510,
14572,
14585,
14590,
14591,
14680,
14681,
14712,
14753,
14767,
14772,
14794,
14816,
14833,
14838,
14839,
14888,
14889,
14909,
14923,
14928,
14950,
14972,
14989,
14994,
14995,
15144,
15145,
15184,
15185,
15340,
15341,
15927,
15928,
16051,
16052,
16129,
16130,
16150,
16190,
16191,
16394,
16395,
16864,
16865,
17025,
17026,
17049,
17071,
17076,
17117,
17123,
17157,
17192,
17240,
17263,
17327,
17375,
17397,
17403,
17408,
17424,
17430,
17456,
17479,
17525,
17535,
17556,
17587,
17597,
17632,
17638,
17643,
17644,
17675,
17676,
17731,
17745,
17804,
17809,
17810,
17895,
17896,
18051,
18117,
18141,
18155,
18214,
18219,
18220,
18328,
18329,
18349,
18392,
18393,
18582,
18583,
18632,
18633,
18660,
18661,
18719,
18736,
18755,
18799,
18827,
18847,
18848,
18862,
18863,
18976,
19081,
19186,
19191,
19192,
19198,
19199,
19214,
19246,
19251,
19273,
19295,
19316,
19331,
19368,
19373,
19394,
19415,
19436,
19451,
19488,
19493,
19514,
19535,
19556,
19571,
19605,
19610,
19632,
19654,
19675,
19680,
19681,
19738,
19739,
19822,
19890,
19922,
19923,
19978,
19979,
20146,
20147,
20341,
20342,
20477,
20478,
20493,
20525,
20530,
20551,
20572,
20593,
20608,
20640,
20645,
20666,
20687,
20708,
20723,
20757,
20762,
20783,
20804,
20825,
20840,
20874,
20879,
20900,
20921,
20942,
20957,
20991,
20996,
21018,
21039,
21060,
21075,
21109,
21114,
21136,
21157,
21178,
21193,
21226,
21231,
21252,
21273,
21294,
21309,
21342,
21347,
21368,
21389,
21410,
21425,
21460,
21465,
21486,
21507,
21528,
21543,
21578,
21583,
21604,
21625,
21646,
21661,
21696,
21701,
21723,
21744,
21765,
21780,
21815,
21820,
21842,
21863,
21884,
21899,
21928,
21933,
21954,
21975,
21996,
22011,
22042,
22047,
22068,
22089,
22110,
22125,
22156,
22161,
22183,
22205,
22226,
22241,
22271,
22276,
22298,
22320,
22341,
22356,
22388,
22393,
22414,
22435,
22456,
22471,
22503,
22508,
22530,
22552,
22573,
22578,
22579,
22673,
22674,
22896,
22897,
22939,
22940,
22968,
22969,
23034,
23150,
23151,
23214,
23291,
23292,
23313,
23314,
23342,
23370,
23371,
23420,
23421,
23535,
23664,
23665,
23783,
23784,
23823,
23885,
23886,
23924,
23925,
23982,
23983,
24204,
24205,
24382,
24383,
24403,
24450,
24605,
24606,
25346,
25347,
25657,
25658,
25853,
25854,
26138,
26139,
26342,
26343,
26601,
26602,
26725,
26726,
26925,
26926,
26955,
26973,
26999,
27021,
27058,
27072,
27095,
27100,
27101,
27269,
27270,
27293,
27311,
27343,
27366,
27380,
27401,
27406,
27407,
27622,
27623,
27652,
27670,
27711,
27725,
27748,
27753,
27776,
27794,
27830,
27844,
27865,
27870,
27871,
28282,
28283,
28302,
28344,
28345,
28360,
28361,
28378,
28383,
28400,
28418,
28423,
28441,
28465,
28493,
28562,
28599,
28637,
28647,
28662,
28693,
28715,
28742,
28760,
28774,
28784,
28790,
28795,
28796,
28807,
28808,
28844,
28864,
28865,
28880,
28881,
28898,
28903,
28916,
28931,
28945,
28952,
28957,
28986,
29026,
29043,
29071,
29102,
29131,
29163,
29173,
29211,
29255,
29314,
29357,
29384,
29458,
29494,
29512,
29526,
29536,
29610,
29648,
29663,
29685,
29728,
29755,
29791,
29811,
29844,
29870,
29888,
29902,
29912,
29944,
29980,
30012,
30034,
30048,
30069,
30079,
30109,
30115,
30120,
30125,
30130,
30148,
30175,
30181,
30223,
30244,
30274,
30317,
30343,
30359,
30379,
30406,
30430,
30444,
30465,
30516,
30570,
30599,
30625,
30643,
30673,
30717,
30748,
30788,
30806,
30840,
30876,
30894,
30923,
30949,
30967,
30981,
31008,
31029,
31039,
31070,
31076,
31081,
31082,
31093,
31094,
31130,
31169,
31203,
31240,
31241,
31291,
31292,
31327,
31365,
31391,
31425,
31426,
31466,
31467,
31502,
31540,
31566,
31601,
31602,
31616,
31644,
31674,
31689,
31727,
31754,
31782,
31834,
31839,
31852,
31869,
31874,
31893,
31922,
31982,
32000,
32005,
32019,
32024,
32043,
32085,
32086,
32161,
32162,
32193,
32218,
32241,
32285,
32290,
32327,
32375,
32380,
32420,
32479,
32527,
32532,
32562,
32583,
32634,
32710,
32715,
32752,
32869,
32874,
32904,
32973,
32978,
33027,
33074,
33079,
33144,
33245,
33250,
33285,
33372,
33377,
33391,
33426,
33442,
33447,
33448,
33544,
33545,
33606,
33607,
33635,
33641,
33662,
33692,
33719,
33736,
33752,
33760,
33848,
33882,
33906,
33921,
33945,
33973,
34013,
34041,
34053,
34070,
34090,
34110,
34116,
34121,
34122,
34222,
34223,
34518,
34519,
34535,
34541,
34583,
34594,
34619,
34713,
34751,
34814,
34820,
34825,
34826,
35051,
35052,
35071,
35116,
35117,
35192,
35193,
35254,
35323,
35337,
35383,
35416,
35449,
35499,
35528,
35533,
35556,
35591,
35596,
35667,
35672,
35673,
36065,
36066,
36365,
36366,
36385,
36423,
36424,
36483,
36484,
36540,
36541,
36620,
36621,
36640,
36677,
36678,
37191,
37192,
37388,
37389,
37410,
37411,
37462,
37513,
37519,
37552,
37557,
37607,
37657,
37707,
37757,
37807,
37857,
37907,
37927,
37932,
38012,
38068,
38102,
38152,
38207,
38267,
38333,
38404,
38480,
38562,
38649,
38741,
38839,
38942,
39050,
39082,
39088,
39093,
39135,
39180,
39186,
39219,
39224,
39254,
39259,
39292,
39344,
39367,
39372,
39431,
39453,
39459,
39464,
39529,
39581,
39587,
39620,
39625,
39659,
39701,
39706,
39752,
39762,
39793,
39822,
39827,
39892,
39942,
39947,
39989,
40003,
40085,
40123,
40141,
40255,
40293,
40311,
40325,
40335,
40341,
40346,
40347,
40822,
40823,
40842,
40880,
40881,
40920,
40921,
41213,
41214,
41348,
41349,
41452,
41453,
41506,
41535,
41594,
41595,
41619,
41640,
41661,
41683,
41688,
41713,
41718,
41803,
41808,
41842,
41848,
41880,
41885,
41914,
41940,
41965,
41975,
42006,
42036,
42050,
42074,
42103,
42117,
42122,
42169,
42174,
42241,
42289,
42312,
42333,
42350,
42374,
42384,
42389,
42423,
42462,
42475,
42510,
42516,
42521,
42545,
42551,
42573,
42601,
42606,
42632,
42637,
42702,
42751,
42785,
42823,
42828,
42844,
42854,
42939,
43019,
43070,
43086,
43091,
43183,
43249,
43254,
43298,
43303,
43383,
43388,
43417,
43450,
43488,
43493,
43531,
43554,
43559,
43596,
43619,
43646,
43651,
43682,
43723,
43795,
43800,
43849,
43854,
43883,
43916,
43954,
43959,
43997,
44020,
44025,
44062,
44085,
44112,
44117,
44148,
44189,
44266,
44276,
44281,
44313,
44319,
44324,
44339,
44345,
44383,
44393,
44434,
44489,
44526,
44579,
44584,
44668,
44673,
44732,
44742,
44760,
44766,
44771,
44772,
44964,
44965,
44984,
45026,
45027,
45294,
45295,
45444,
45445,
45464,
45502,
45503,
45742,
45743,
46534,
46535,
47036,
47037,
47324,
47325,
47344,
47382,
47383,
47570,
47571,
47602,
47623,
47628,
47667,
47740,
47805,
47810,
47828,
47919,
47924,
47925,
47938,
47939,
47966,
47967,
48012,
48017,
48052,
48087,
48092,
48093,
48121,
48122,
48162,
48167,
48201,
48233,
48238,
48239,
48345,
48346,
48372,
48373,
48407,
48451,
48456,
48475,
48512,
48513,
48667,
48668,
48797,
48798,
48860,
48861,
48996,
48997,
49252,
49253,
49277,
49357,
49383,
49388,
49406,
49423,
49428,
49452,
49532,
49560,
49624,
49652,
49663,
49668,
49696,
49736,
49800,
49813,
49839,
49844,
49861,
49910,
49956,
50002,
50048,
50092,
50097,
50147,
50152,
50185,
50211,
50266,
50284,
50321,
50340,
50378,
50389,
50394,
50415,
50453,
50458,
50483,
50505,
50537,
50553,
50581,
50598,
50623,
50634,
50639,
50640,
50714,
50715,
50757,
50762,
50791,
50796,
50803,
50808,
50866,
50921,
50927,
50932,
50953,
50974,
50991,
50996,
51015,
51058,
51059,
51224,
51225,
51306,
51336,
51341,
51362,
51384,
51405,
51486,
51500,
51505,
51527,
51549,
51570,
51636,
51650,
51655,
51676,
51697,
51718,
51764,
51769,
51786,
51828,
51851,
51873,
51878,
51907,
51913,
51947,
51985,
52013,
52036,
52089,
52112,
52153,
52173,
52204,
52218,
52242,
52267,
52277,
52299,
52305,
52310,
52326,
52332,
52359,
52382,
52428,
52438,
52460,
52491,
52501,
52537,
52543,
52548,
52549,
52576,
52577,
52594,
52595,
52643,
52644,
52661,
52662,
52666
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 52666,
"ccnet_original_nlines": 1464,
"rps_doc_curly_bracket": 0.002658260054886341,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23222792148590088,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019970690831542015,
"rps_doc_frac_lines_end_with_ellipsis": 0.001365190022625029,
"rps_doc_frac_no_alph_words": 0.40023818612098694,
"rps_doc_frac_unique_words": 0.24446439743041992,
"rps_doc_mean_word_length": 4.858168601989746,
"rps_doc_num_sentences": 607,
"rps_doc_symbol_to_word_ratio": 0.0021069999784231186,
"rps_doc_unigram_entropy": 6.290061950683594,
"rps_doc_word_count": 6684,
"rps_doc_frac_chars_dupe_10grams": 0.12774081528186798,
"rps_doc_frac_chars_dupe_5grams": 0.21036584675312042,
"rps_doc_frac_chars_dupe_6grams": 0.1770448386669159,
"rps_doc_frac_chars_dupe_7grams": 0.1629403829574585,
"rps_doc_frac_chars_dupe_8grams": 0.1534244865179062,
"rps_doc_frac_chars_dupe_9grams": 0.1399051547050476,
"rps_doc_frac_chars_top_2gram": 0.0022172899916768074,
"rps_doc_frac_chars_top_3gram": 0.004711749963462353,
"rps_doc_frac_chars_top_4gram": 0.0033259401097893715,
"rps_doc_books_importance": -4644.69384765625,
"rps_doc_books_importance_length_correction": -4644.69384765625,
"rps_doc_openwebtext_importance": -2691.973876953125,
"rps_doc_openwebtext_importance_length_correction": -2691.973876953125,
"rps_doc_wikipedia_importance": -2199.510009765625,
"rps_doc_wikipedia_importance_length_correction": -2199.510009765625
},
"fasttext": {
"dclm": 0.9169768691062927,
"english": 0.7858532071113586,
"fineweb_edu_approx": 1.938535451889038,
"eai_general_math": 0.9662667512893677,
"eai_open_web_math": 0.28725123405456543,
"eai_web_code": 0.9491420388221741
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "512.7",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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
|
664,720,501,563,835,400 |
Answers
Solutions by everydaycalculation.com
Answers.everydaycalculation.com » Subtract fractions
Subtract 70/9 from 7/49
1st number: 7/49, 2nd number: 7 7/9
7/49 - 70/9 is -481/63.
Steps for subtracting fractions
1. Find the least common denominator or LCM of the two denominators:
LCM of 49 and 9 is 441
2. For the 1st fraction, since 49 × 9 = 441,
7/49 = 7 × 9/49 × 9 = 63/441
3. Likewise, for the 2nd fraction, since 9 × 49 = 441,
70/9 = 70 × 49/9 × 49 = 3430/441
4. Subtract the two fractions:
63/441 - 3430/441 = 63 - 3430/441 = -3367/441
5. After reducing the fraction, the answer is -481/63
MathStep (Works offline)
Download our mobile app and learn to work with fractions in your own time:
Android and iPhone/ iPad
Related:
© everydaycalculation.com
|
{
"url": "https://answers.everydaycalculation.com/subtract-fractions/7-49-minus-70-9",
"source_domain": "answers.everydaycalculation.com",
"snapshot_id": "crawl=CC-MAIN-2020-34",
"warc_metadata": {
"Content-Length": "7845",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:56BYXVCD665GTUZKWO5F3XOXM25KW5AH",
"WARC-Concurrent-To": "<urn:uuid:1c1328d3-ff42-40f8-a720-a6c84ce06ad5>",
"WARC-Date": "2020-08-04T05:41:17Z",
"WARC-IP-Address": "96.126.107.130",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JPZSNT44IBIZLM7UWQVD33GMANBJFHPC",
"WARC-Record-ID": "<urn:uuid:fdbd48be-7813-414f-a17d-d3a1b897aaf2>",
"WARC-Target-URI": "https://answers.everydaycalculation.com/subtract-fractions/7-49-minus-70-9",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e43b5c9b-c5f5-41d4-a208-d2e22d1b6bef>"
},
"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-110.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
8,
9,
46,
47,
100,
101,
125,
126,
162,
163,
187,
188,
220,
221,
292,
319,
366,
399,
456,
493,
526,
576,
632,
633,
658,
659,
734,
759,
760,
769,
770
],
"line_end_idx": [
8,
9,
46,
47,
100,
101,
125,
126,
162,
163,
187,
188,
220,
221,
292,
319,
366,
399,
456,
493,
526,
576,
632,
633,
658,
659,
734,
759,
760,
769,
770,
795
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 795,
"ccnet_original_nlines": 31,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1666666716337204,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009803920052945614,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5980392098426819,
"rps_doc_frac_unique_words": 0.596774160861969,
"rps_doc_mean_word_length": 4.564516067504883,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.1092448234558105,
"rps_doc_word_count": 124,
"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.02473497949540615,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -94.04024505615234,
"rps_doc_books_importance_length_correction": -94.04024505615234,
"rps_doc_openwebtext_importance": -70.6003189086914,
"rps_doc_openwebtext_importance_length_correction": -70.59989929199219,
"rps_doc_wikipedia_importance": -40.0258903503418,
"rps_doc_wikipedia_importance_length_correction": -40.0258903503418
},
"fasttext": {
"dclm": 0.9676381349563599,
"english": 0.8788330554962158,
"fineweb_edu_approx": 2.2536611557006836,
"eai_general_math": 0.11672067642211914,
"eai_open_web_math": 0.08974325656890869,
"eai_web_code": 0.0000705700003891252
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "513.24",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry"
}
},
"secondary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "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": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,933,124,185,146,384,000 |
Shortcuts
Source code for catalyst.contrib.datasets.movielens
import itertools
import os
import numpy as np
import pandas as pd
import scipy.sparse as sp
import torch
from torch.utils.data import Dataset
from catalyst.contrib.datasets.misc import download_and_extract_archive
[docs]class MovieLens(Dataset): """ MovieLens data sets were collected by the GroupLens Research Project at the University of Minnesota. This data set consists of: * 100,000 ratings (1-5) from 943 users on 1682 movies. * Each user has rated at least 20 movies. * Simple demographic info for the users (age, gender, occupation, zip) The data was collected through the MovieLens web site (movielens.umn.edu) during the seven-month period from September 19th, 1997 through April 22nd, 1998. This data has been cleaned up - users who had less than 20 ratings or did not have complete demographic information were removed from this data set. Detailed descriptions of the data file can be found at the end of this file. Neither the University of Minnesota nor any of the researchers involved can guarantee the correctness of the data, its suitability for any particular purpose, or the validity of results based on the use of the data set. The data set may be used for any research purposes under the following conditions: * The user may not state or imply any endorsement from the University of Minnesota or the GroupLens Research Group. * The user must acknowledge the use of the data set in publications resulting from the use of the data set (see below for citation information). * The user may not redistribute the data without separate permission. * The user may not use this information for any commercial or revenue-bearing purposes without first obtaining permission from a faculty member of the GroupLens Research Project at the University of Minnesota. If you have any further questions or comments, please contact GroupLens <[email protected]>. http://files.grouplens.org/datasets/movielens/ml-100k-README.txt .. note:: catalyst[ml] required for this dataset. """ resources = ( "http://files.grouplens.org/datasets/movielens/ml-100k.zip", "0e33842e24a9c977be4e0107933c0723", ) filename = "ml-100k.zip" training_file = "training.pt" test_file = "test.pt"
[docs] def __init__(self, root, train=True, download=False, min_rating=0.0): """ Args: root (string): Root directory of dataset where ``MovieLens/processed/training.pt`` and ``MovieLens/processed/test.pt`` exist. train (bool, optional): If True, creates dataset from ``training.pt``, otherwise from ``test.pt``. download (bool, optional): If true, downloads the dataset from the internet and puts it in root directory. If dataset is already downloaded, it is not downloaded again. min_rating (float, optional): Minimum rating to include in the interaction matrix Raises: RuntimeError: If ``download is False`` and the dataset not found. """ if isinstance(root, torch._six.string_classes): root = os.path.expanduser(root) self.root = root self.train = train self.min_rating = min_rating if download: self._download() self._fetch_movies() if not self._check_exists(): raise RuntimeError("Dataset not found. Set `download=True`") if self.train: data_file = self.training_file else: data_file = self.test_file self.data = torch.load(os.path.join(self.processed_folder, data_file))
def __getitem__(self, user_index): """Get item. Args: user_index (int): User index [0, 942] Returns: tensor: (items) item's ranking for the user with index user_index """ return self.data[user_index] def __len__(self): """The length of the loader""" return self.dimensions[0] @property def raw_folder(self): """Create raw folder for data download Returns: raw_path (path): raw folder path """ return os.path.join(self.root, self.__class__.__name__, "raw") @property def processed_folder(self): """Create the folder for the processed files Returns: raw_path (path): processed folder path """ return os.path.join(self.root, self.__class__.__name__, "processed") def _check_exists(self): """Check if the path for tarining and testing data exists in processed folder. Returns: raw_path (path): processed folder path """ return os.path.exists( os.path.join(self.processed_folder, self.training_file) ) and os.path.exists(os.path.join(self.processed_folder, self.test_file)) def _download(self): """Download and extract files/""" if self._check_exists(): return os.makedirs(self.raw_folder, exist_ok=True) os.makedirs(self.processed_folder, exist_ok=True) url = self.resources[0] md5 = self.resources[1] download_and_extract_archive( url=url, download_root=self.raw_folder, filename=self.filename, md5=md5, remove_finished=True, ) def _read_raw_movielens_data(self): """Return the raw lines of the train and test files.""" path = self.raw_folder with open(path + "/ml-100k/ua.base") as datafile: ua_base = datafile.read().split("\n") with open(path + "/ml-100k/ua.test") as datafile: ua_test = datafile.read().split("\n") with open(path + "/ml-100k/u.item", encoding="ISO-8859-1") as datafile: u_item = datafile.read().split("\n") with open(path + "/ml-100k/u.genre") as datafile: u_genre = datafile.read().split("\n") return (ua_base, ua_test, u_item, u_genre) def _build_interaction_matrix(self, rows, cols, data): """Builds interaction matrix. Args: rows (int): rows of the oevrall dataset cols (int): columns of the overall dataset data (generator object): generator of the data object Returns: interaction_matrix (torch.sparse.Float): sparse user2item interaction matrix """ mat = sp.lil_matrix((rows, cols), dtype=np.int32) for uid, iid, rating, _ in data: if rating >= self.min_rating: mat[uid, iid] = rating coo = mat.tocoo() values = coo.data indices = np.vstack((coo.row, coo.col)) i = torch.LongTensor(indices) v = torch.FloatTensor(values) shape = coo.shape interaction_matrix = torch.sparse.FloatTensor(i, v, torch.Size(shape)).to_dense() return interaction_matrix def _parse(self, data): """Parses the raw data. Substract one to shift to zero based indexing Args: data: raw data of the dataset Yields: Generator iterator for parsed data """ for line in data: if not line: continue uid, iid, rating, timestamp = [int(x) for x in line.split("\t")] yield uid - 1, iid - 1, rating, timestamp def _get_dimensions(self, train_data, test_data): """Gets the dimensions of the raw dataset Args: train_data: (uid, iid, rating, timestamp) Genrator for training data test_data: (uid, iid, rating, timestamp) Genrator for testing data Returns: The total dimension of the dataset """ uids = set() iids = set() for uid, iid, _, _ in itertools.chain(train_data, test_data): uids.add(uid) iids.add(iid) rows = max(uids) + 1 cols = max(iids) + 1 self.dimensions = (rows, cols) return rows, cols def _fetch_movies(self): """ Fetch data and save in the pytorch format 1. Read the train/test data from raw archive 2. Parse train data 3. Parse test data 4. Save in the .pt with torch.save """ data = self._read_raw_movielens_data() train_raw = data[0] test_raw = data[1] train_parsed = self._parse(train_raw) test_parsed = self._parse(test_raw) num_users, num_items = self._get_dimensions(train_parsed, test_parsed) train = self._build_interaction_matrix( num_users, num_items, self._parse(train_raw) ) test = self._build_interaction_matrix( num_users, num_items, self._parse(test_raw) ) assert train.shape == test.shape with open(os.path.join(self.processed_folder, self.training_file), "wb") as f: torch.save(train, f) with open(os.path.join(self.processed_folder, self.test_file), "wb") as f: torch.save(test, f)
class MovieLens20M(Dataset): """ MovieLens data sets (ml-20m) were collected by the GroupLens Research Project at the University of Minnesota. This data set consists of: * 20,000,263 ratings (1-5) and 465,564 tag applications from 138,493 users on 27,278 movies. * Each user has rated at least 20 movies. * Simple demographic info for the users (age, gender, occupation, zip) Users were selected at random for inclusion. All selected users had rated at least 20 movies. No demographic information is included. Each user is represented by an id, and no other information is provided. More details about the contents and use of all these files follows. This and other GroupLens data sets are publicly available for download at http://grouplens.org/datasets/. The data was collected through the MovieLens web site. (movielens.umn.edu) between January 09, 1995 and March 31, 2015. This dataset was generated on October 17, 2016. Neither the University of Minnesota nor any of the researchers involved can guarantee the correctness of the data, its suitability for any particular purpose, or the validity of results based on the use of the data set. The data set may be used for any research purposes under the following conditions: The user may not state or imply any endorsement from the University of Minnesota or the GroupLens Research Group. The user must acknowledge the use of the data set in publications resulting from the use of the data set (see below for citation information). The user may not redistribute the data without separate permission. The user may not use this information for any commercial or revenue-bearing purposes without first obtaining permission from a faculty member of the GroupLens Research Project at the University of Minnesota. The executable software scripts are provided "as is" without warranty of any kind, either expressed or implied, including, but not limited to, the implied warranties of merchantability and fitness for a particular purpose. The entire risk as to the quality and performance of them is with you. Should the program prove defective, you assume the cost of all necessary servicing, repair or correction. In no event shall the University of Minnesota, its affiliates or employees be liable to you for any damages arising out of the use or inability to use these programs (including but not limited to loss of data or data being rendered inaccurate). The data are contained in six files: 1. genome-scores.csv 2. genome-tags.csv 3. links.csv 4. movies.csv 5. ratings.csv 6. tags.csv Ratings Data File Structure (ratings.csv) All ratings are contained in the file ratings.csv. Each line of this file after the header row represents one rating of one movie by one user,and has the following format: 1. userId, 2. movieId, 3. rating, 4. timestamp Tags Data File Structure (tags.csv) 1. userId, 2. movieId, 3. tag, 4. timestamp Movies Data File Structure (movies.csv) 1. movieId, 2. title, 3. genres Movie titles are entered manually or imported from https://www.themoviedb.org/, and include the year of release in parentheses. Errors and inconsistencies may exist in these titles. Links Data File Structure (links.csv) 1. movieId, 2. imdbId, 3. tmdbId Tag Genome (genome-scores.csv and genome-tags.csv) 1. movieId, 2. tagId, 3. relevance If you have any further questions or comments, please contact GroupLens <[email protected]>. https://files.grouplens.org/datasets/movielens/ml-20m-README.html """ resources = ( "https://files.grouplens.org/datasets/movielens/ml-20m.zip", " cd245b17a1ae2cc31bb14903e1204af3", ) filename = "ml-20m.zip" training_file = "training.pt" test_file = "test.pt" def __init__( self, root, train=True, download=False, min_rating=0.0, min_items_per_user=1.0, min_users_per_item=2.0, test_prop=0.2, split="users", sample=False, n_rows=1000, ): """ Args: root (string): Root directory of dataset where ``MovieLens/processed/training.pt`` and ``MovieLens/processed/test.pt`` exist. train (bool, optional): If True, creates dataset from ``training.pt``, otherwise from ``test.pt``. download (bool, optional): If true, downloads the dataset from the internet and puts it in root directory. If dataset is already downloaded, it is not downloaded again. min_rating (float, optional): Minimum rating to include in the interaction matrix min_items_per_user (float, optional): Minimum number of items per user to include in the interaction matrix min_users_per_item (float, optional): Minimum rating to users per itemrs to include in the interaction matrix test_prop (float, optional): train-test split split (string, optional): the splittage method. `users` – split by users `ts` - split by timestamp sample (bool, optional): If true, then use the sample of the dataset. If true the `n_rows` shold be provide n_rows (int, optional): number of rows to retrieve. Availbale only with `sample = True` Raises: RuntimeError: If ``download = False`` and the dataset not found. RuntimeError: If torch version < `1.7.0`" """ if isinstance(root, torch._six.string_classes): root = os.path.expanduser(root) self.root = root self.train = train self.min_rating = min_rating self.min_items_per_user = min_items_per_user self.min_users_per_item = min_users_per_item self.test_prop = test_prop self.nrows = n_rows self.sample = sample self.split = split if download: self._download() self._fetch_movies(split_by=split) if not self._check_exists(): raise RuntimeError("Dataset not found. Set `download=True`") if self.train: data_file = self.training_file else: data_file = self.test_file self.data = torch.load(os.path.join(self.processed_folder, data_file)) def __getitem__(self, user_index): """Get item. Args: user_index (int): User index Returns: tensor: (items) item's ranking for the user with index user_index """ return self.data[user_index] def __len__(self): """The length of the loader""" return self.dimensions[0] @property def raw_folder(self): """Create raw folder for data download Returns: raw_path (path): raw folder path """ return os.path.join(self.root, self.__class__.__name__, "raw") @property def processed_folder(self): """Create the folder for the processed files Returns: raw_path (path): processed folder path """ return os.path.join(self.root, self.__class__.__name__, "processed") def _check_exists(self): """Check if the path for tarining and testing data exists in processed folder. Returns: raw_path (path): processed folder path """ return os.path.exists( os.path.join(self.processed_folder, self.training_file) ) and os.path.exists(os.path.join(self.processed_folder, self.test_file)) def _download(self): """Download and extract files""" if self._check_exists(): return os.makedirs(self.raw_folder, exist_ok=True) os.makedirs(self.processed_folder, exist_ok=True) url = self.resources[0] download_and_extract_archive( url=url, download_root=self.raw_folder, filename=self.filename, remove_finished=True, ) def _read_raw_movielens_data(self): """Read the csv files with pandas. Returns: (movies, ratings, genome_scores, genome_tags, tags): (pd.DataFrame, pd.DataFrame, pd.DataFrame, pd.DataFrame, pd.DataFrame) """ path = self.raw_folder if self.sample: movies = pd.read_csv(path + "/ml-20m/movies.csv", nrows=self.nrows) ratings = pd.read_csv(path + "/ml-20m/ratings.csv", nrows=self.nrows) genome_scores = pd.read_csv( path + "/ml-20m/genome-scores.csv", nrows=self.nrows ) genome_tags = pd.read_csv(path + "/ml-20m/genome-tags.csv", nrows=self.nrows) tags = pd.read_csv(path + "/ml-20m/tags.csv", nrows=self.nrows) else: movies = pd.read_csv(path + "/ml-20m/movies.csv") ratings = pd.read_csv(path + "/ml-20m/ratings.csv") genome_scores = pd.read_csv(path + "/ml-20m/genome-scores.csv") genome_tags = pd.read_csv(path + "/ml-20m/genome-tags.csv") tags = pd.read_csv(path + "/ml-20m/tags.csv") return (movies, ratings, genome_scores, genome_tags, tags) def _build_interaction_matrix(self, ratings): """Builds interaction matrix. Args: ratings (pd.Dataframe): pandas DataFrame of the following format userId movieId rating 20 1 924 3.5 19 1 919 3.5 86 1 2683 3.5 61 1 1584 3.5 23 1 1079 4.0 Returns: interaction_matrix (torch.sparse.Float): sparse user2item interaction matrix """ csr_matrix = sp.coo_matrix( ( ratings["rating"].astype(np.float32), (ratings["movieId"], ratings["userId"]), ) ) interaction_matrix = torch.sparse.LongTensor( torch.LongTensor([csr_matrix.row.tolist(), csr_matrix.col.tolist()]), torch.LongTensor(csr_matrix.data.astype(np.int32)), ) return interaction_matrix def _parse( self, ratings, rating_cut=True, user_per_item_cut=True, item_per_user_cut=True, ts_cut=False, ): """Parses and pre-process the raw data. Substract one to shift to zero based indexing To-do add timestamp cut Args: ratings (pd.Dataframe): pandas DataFrame of the following format userId movieId rating timestamp 20 1 924 3.5 1094785598 19 1 919 3.5 1094785621 86 1 2683 3.5 1094785650 61 1 1584 3.5 1094785656 23 1 1079 4.0 1094785665 rating_cut (bool, optional): If true, filter datafreame on the `min_rating` value user_per_item_cut (bool, optional): If true, filter datafreame on the `min_users_per_item` value item_per_user_cut (bool, optional): If true, filter datafreame on the `min_items_per_user` value ts_cut (bool, optional): If true, filter datafreame on the `min_ts` value [TO-DO] Returns: ratings (pd.Dataframe): filtered `ratings` pandas DataFrame users_activity (pd.DataFrame): Number of items each user interacted with items_activity (pd.DataFrame): Number of users interacted with each item. """ if rating_cut: ratings = ratings[ratings["rating"] >= self.min_rating].sort_values( ["userId", "timestamp"] ) movie_id = "movieId" user_cnt_df = ( ratings[[movie_id]] .groupby(movie_id, as_index=False) .size() .rename(columns={"size": "user_cnt"}) ) user_id = "userId" item_cnt_df = ( ratings[[user_id]] .groupby(user_id, as_index=False) .size() .rename(columns={"size": "item_cnt"}) ) user_not_filtered = True item_not_filtered = True while user_not_filtered or item_not_filtered: ratings = ratings[ ratings[movie_id].isin( user_cnt_df.index[user_cnt_df["user_cnt"] >= self.min_users_per_item] ) ] ratings = ratings[ ratings[user_id].isin( item_cnt_df.index[item_cnt_df["item_cnt"] >= self.min_items_per_user] ) ] user_cnt_df = ( ratings[[movie_id]] .groupby(movie_id, as_index=False) .size() .rename(columns={"size": "user_cnt"}) ) item_cnt_df = ( ratings[[user_id]] .groupby(user_id, as_index=False) .size() .rename(columns={"size": "item_cnt"}) ) user_not_filtered = (user_cnt_df["user_cnt"] < self.min_users_per_item).any() item_not_filtered = (item_cnt_df["item_cnt"] < self.min_items_per_user).any() users_activity = ( ratings[["userId"]] .groupby("userId", as_index=False) .size() .rename(columns={"size": "user_cnt"}) ) items_activity = ( ratings[["movieId"]] .groupby("movieId", as_index=False) .size() .rename(columns={"size": "item_cnt"}) ) return ratings, users_activity, items_activity def _split_by_users(self, ratings, users_activity): """Split the ratings DataFrame into train and test Randomly shuffle users and split Args: ratings (pd.Dataframe): pandas DataFrame of the following format userId movieId rating timestamp 20 1 924 3.5 1094785598 19 1 919 3.5 1094785621 86 1 2683 3.5 1094785650 61 1 1584 3.5 1094785656 23 1 1079 4.0 1094785665 users_activity (pd.DataFrame): Number of items each user interacted with Returns: train_events (pd.Dataframe): pandas DataFrame for training data test_events (pd.Dataframe): pandas DataFrame for training data """ idx_perm = np.random.permutation(users_activity.index.size) unique_uid = users_activity.index[idx_perm] n_users = unique_uid.size test_users = unique_uid[: int(n_users * self.test_prop)] train_users = unique_uid[int(n_users * self.test_prop) :] train_events = ratings.loc[ratings["userId"].isin(train_users)] test_events = ratings.loc[ratings["userId"].isin(test_users)] return (train_events, test_events) def _split_by_time(self, ratings): """Split the ratings DataFrame into train and test by timestamp Ratings[timestamp] extreme values used for the filtering interval Args: ratings (pd.Dataframe): pandas DataFrame of the following format userId movieId rating timestamp 20 1 924 3.5 1094785598 19 1 919 3.5 1094785621 86 1 2683 3.5 1094785650 61 1 1584 3.5 1094785656 23 1 1079 4.0 1094785665 Returns: train_events (pd.Dataframe): pandas DataFrame for training data test_events (pd.Dataframe): pandas DataFrame for training data """ ts = ratings["timestamp"].sort_values() ts_max = ts.max() ts_min = ts.min() ts_split = ts_min + (ts_max - ts_min) * self.test_prop train_events = ratings[ratings["timestamp"] > ts_split] test_events = ratings[ratings["timestamp"] <= ts_split] return (train_events, test_events) def _fetch_movies(self, split_by="users"): """ Fetch data and save in the pytorch format 1. Read the MovieLens20 data from raw archive 2. Parse the rating dataset 3. Split dataset into train and test 4. Build user-item matrix interaction 5. Save in the .pt with torch.save Args: split_by (string, optional): the splittage method. `users` – split by users `ts` - split by timestamp Raises: ValueError: If `split_by` argument is not equal `users` or `ts` """ raw_data = self._read_raw_movielens_data() ratings = raw_data[1] # TO-DO: add error handling ratings, users_activity, items_activity = self._parse(ratings) self.users_activity = users_activity self.items_activity = items_activity if split_by == "users": train_raw, test_raw = self._split_by_users(ratings, users_activity) if split_by == "ts": train_raw, test_raw = self._split_by_time(ratings) if split_by != "users" and split_by != "ts": raise ValueError("Only splitting by users and ts supported") train = self._build_interaction_matrix(train_raw) test = self._build_interaction_matrix(test_raw) with open(os.path.join(self.processed_folder, self.training_file), "wb") as f: torch.save(train, f) with open(os.path.join(self.processed_folder, self.test_file), "wb") as f: torch.save(test, f) __all__ = ["MovieLens", "MovieLens20M"]
|
{
"url": "https://catalyst-team.github.io/catalyst/_modules/catalyst/contrib/datasets/movielens.html",
"source_domain": "catalyst-team.github.io",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "106032",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7HTLBZFHGTHSPOOEE7NACP2QG52SPIQJ",
"WARC-Concurrent-To": "<urn:uuid:a46fdbcd-a1a5-4113-b6d5-3ab20b0f1d93>",
"WARC-Date": "2022-05-25T17:28:16Z",
"WARC-IP-Address": "185.199.110.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XQJASPRSRTKZNM6RMT5HM7732V7I6M22",
"WARC-Record-ID": "<urn:uuid:9d1e80b1-97e4-41d2-8b0d-69d3fa81ab0d>",
"WARC-Target-URI": "https://catalyst-team.github.io/catalyst/_modules/catalyst/contrib/datasets/movielens.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:61b6cae8-7828-4bb0-9683-aa9cc256d2ed>"
},
"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-40\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,
10,
11,
63,
64,
81,
91,
92,
111,
131,
157,
158,
171,
208,
209,
281,
282,
283,
2251,
3328,
7530
],
"line_end_idx": [
10,
11,
63,
64,
81,
91,
92,
111,
131,
157,
158,
171,
208,
209,
281,
282,
283,
2251,
3328,
7530,
21517
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 21517,
"ccnet_original_nlines": 20,
"rps_doc_curly_bracket": 0.0005576999974437058,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.15879210829734802,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.001437959959730506,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4120788872241974,
"rps_doc_frac_unique_words": 0.28601253032684326,
"rps_doc_mean_word_length": 6.7319416999816895,
"rps_doc_num_sentences": 477,
"rps_doc_symbol_to_word_ratio": 0.00020542000129353255,
"rps_doc_unigram_entropy": 5.813936710357666,
"rps_doc_word_count": 2395,
"rps_doc_frac_chars_dupe_10grams": 0.4009179472923279,
"rps_doc_frac_chars_dupe_5grams": 0.4897351562976837,
"rps_doc_frac_chars_dupe_6grams": 0.4695155918598175,
"rps_doc_frac_chars_dupe_7grams": 0.4525212347507477,
"rps_doc_frac_chars_dupe_8grams": 0.43403834104537964,
"rps_doc_frac_chars_dupe_9grams": 0.40823668241500854,
"rps_doc_frac_chars_top_2gram": 0.008683250285685062,
"rps_doc_frac_chars_top_3gram": 0.005582090001553297,
"rps_doc_frac_chars_top_4gram": 0.013397010043263435,
"rps_doc_books_importance": -2159.356689453125,
"rps_doc_books_importance_length_correction": -2159.356689453125,
"rps_doc_openwebtext_importance": -1012.1104736328125,
"rps_doc_openwebtext_importance_length_correction": -1012.1104736328125,
"rps_doc_wikipedia_importance": -576.61865234375,
"rps_doc_wikipedia_importance_length_correction": -576.61865234375
},
"fasttext": {
"dclm": 0.7990440726280212,
"english": 0.6113147735595703,
"fineweb_edu_approx": 2.6467342376708984,
"eai_general_math": 0.9300239682197571,
"eai_open_web_math": 0.19192731380462646,
"eai_web_code": 0.9508957862854004
}
}
|
{
"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.31",
"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": "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": "2",
"label": "Academic/Research"
}
},
"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": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
711,326,327,974,830,800 |
Basic JavaScript - Profile Lookup
Tell us what’s happening:
Describe your issue in detail here.
I’m quite confused about where I am getting it wrong the first condition seems to work perfectly until I add the other conditions.
Please help review. Thanks
Your code so far
// Setup
const contacts = [
{
firstName: "Akira",
lastName: "Laine",
number: "0543236543",
likes: ["Pizza", "Coding", "Brownie Points"],
},
{
firstName: "Harry",
lastName: "Potter",
number: "0994372684",
likes: ["Hogwarts", "Magic", "Hagrid"],
},
{
firstName: "Sherlock",
lastName: "Holmes",
number: "0487345643",
likes: ["Intriguing Cases", "Violin"],
},
{
firstName: "Kristian",
lastName: "Vos",
number: "unknown",
likes: ["JavaScript", "Gaming", "Foxes"],
},
];
function lookUpProfile(name, prop) {
// Only change code below this line
for(let contact of contacts){
//console.log(contact)
if(contact['firstName'] == name && contact.hasOwnProperty(prop)){
return contact[prop]
}else if(contact['firstName'] !== name){
return "No such contact"
}else if(!contact.hasOwnProperty(prop)){
return "No such property"
}
}
// Only change code above this line
}
lookUpProfile("Akira", "likes");
Your browser information:
User Agent is: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/110.0.0.0 Safari/537.36
Challenge: Basic JavaScript - Profile Lookup
Link to the challenge:
This is a nice effort on a difficult task. You are currently looping through each object in the array. The problem is that you are always returning something on the first item. But if the name is, say, " Kristian", then we don’t want to return on the first item. We want to return on the 4th item.
Here’s how I would have done it:
const curPersonObj = contacts.find(x=> x.firstName===name);
if(curPersonObj && prop in curPersonObj){
return curPersonObj[prop];
} else if(!curPersonObj) {
return 'No such contact'
}
else return 'No such property'
|
{
"url": "https://forum.freecodecamp.org/t/basic-javascript-profile-lookup/594552",
"source_domain": "forum.freecodecamp.org",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "26037",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FTVXC3QIW3DCNJKKXPUGCCP6VVV3I6DR",
"WARC-Concurrent-To": "<urn:uuid:be3fc86b-c9d5-49d9-b6c8-4cf9c5c2deb9>",
"WARC-Date": "2023-03-27T08:09:04Z",
"WARC-IP-Address": "64.71.144.205",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SQRMD2NKQ36ZXDTALVYBJT3AMEICIHSY",
"WARC-Record-ID": "<urn:uuid:7cca2ff0-e65c-43ac-b5b9-8629aa612ae2>",
"WARC-Target-URI": "https://forum.freecodecamp.org/t/basic-javascript-profile-lookup/594552",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3cd857bd-080c-4e5c-83b4-7751b3df2e1f>"
},
"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,
34,
35,
61,
97,
98,
229,
230,
257,
258,
275,
276,
285,
304,
308,
332,
355,
381,
431,
436,
440,
464,
488,
514,
558,
563,
567,
594,
618,
644,
687,
692,
696,
723,
744,
767,
813,
818,
821,
822,
859,
897,
930,
957,
1027,
1056,
1101,
1132,
1177,
1209,
1215,
1216,
1220,
1221,
1259,
1261,
1262,
1295,
1296,
1322,
1323,
1450,
1451,
1496,
1497,
1520,
1521,
1819,
1820,
1853,
1854,
1916,
1960,
1989,
2016,
2043,
2047
],
"line_end_idx": [
34,
35,
61,
97,
98,
229,
230,
257,
258,
275,
276,
285,
304,
308,
332,
355,
381,
431,
436,
440,
464,
488,
514,
558,
563,
567,
594,
618,
644,
687,
692,
696,
723,
744,
767,
813,
818,
821,
822,
859,
897,
930,
957,
1027,
1056,
1101,
1132,
1177,
1209,
1215,
1216,
1220,
1221,
1259,
1261,
1262,
1295,
1296,
1322,
1323,
1450,
1451,
1496,
1497,
1520,
1521,
1819,
1820,
1853,
1854,
1916,
1960,
1989,
2016,
2043,
2047,
2079
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2079,
"ccnet_original_nlines": 76,
"rps_doc_curly_bracket": 0.010582010261714458,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.20915032923221588,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013071900233626366,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4270152449607849,
"rps_doc_frac_unique_words": 0.6390041708946228,
"rps_doc_mean_word_length": 5.8423237800598145,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.835689544677734,
"rps_doc_word_count": 241,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05681817978620529,
"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.022727269679307938,
"rps_doc_frac_chars_top_3gram": 0.034090910106897354,
"rps_doc_frac_chars_top_4gram": 0.03977273032069206,
"rps_doc_books_importance": -223.49853515625,
"rps_doc_books_importance_length_correction": -223.49853515625,
"rps_doc_openwebtext_importance": -66.78723907470703,
"rps_doc_openwebtext_importance_length_correction": -66.78723907470703,
"rps_doc_wikipedia_importance": -94.89698028564453,
"rps_doc_wikipedia_importance_length_correction": -94.89698028564453
},
"fasttext": {
"dclm": 0.17679572105407715,
"english": 0.6220715045928955,
"fineweb_edu_approx": 1.074022889137268,
"eai_general_math": 0.1526675820350647,
"eai_open_web_math": 0.09289222955703735,
"eai_web_code": 0.14918363094329834
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-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
|
4,582,131,464,118,934,000 |
Creating objects in wrong layer
Hi folks!
As this is my first post here, I’d like to thank you for offering this tool and the opportunity to discuss its features here.
I tried to search this board for my issue, but (maybe due to language barrier) I couldn’t find anything helpful. Furthermore, I’m not quite sure if the following is a bug or just some error-by-user :stuck_out_tongue:
…but let’s jump right into my issue:
The following issue might not sound linke a big pita, but in my case it is, becuase I have to work with different offsets for each object layer.
When creating objects (e.g. a poly line) in a file with several object layers I often notice that I created the object in an object layer I didn’t even selected. My guess why this happens is that the position where the new object will be created is depending on your latest selection, but it only counts for selections within the objects window.
Assumtion:
If your selection was made in the objects window (by clicking on the name of any layer within the destinated object layer), everything will work just fine and the new object will be created at the bottom of the selected object layer. If your selection was made right on the map where you are editing (by clicking on the shape of any object which is in the destinated object layer), the new object will be created in the object layer where your last selection (in the objects window!) was made. So, why is selection =/= selection? Is it a bug, a usability issue or is there a just mistake in my workflow?
OS: Win8
Tiled version: 0.16.2
Hey daan, you’re welcome for the tool and thanks for bringing this up! Actually it was a usability issue:
https://github.com/bjorn/tiled/issues/1424
It’s fixed in the latest development snapshots thanks to the efforts of @GLAVAK and @WinterGrascph.
You can download development snapshots for Windows at https://update.mapeditor.org/snapshots-win/.
|
{
"url": "https://discourse.mapeditor.org/t/creating-objects-in-wrong-layer/2162",
"source_domain": "discourse.mapeditor.org",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "20722",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CEVQTZG7YLOL6XOSPICQTIADLQ4GPRTV",
"WARC-Concurrent-To": "<urn:uuid:7073a29b-926f-4e12-9b28-5cfa0f928869>",
"WARC-Date": "2022-05-16T05:51:36Z",
"WARC-IP-Address": "64.62.250.111",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Y3TYOQ7YV6EBDADOM35Q2327DDH6MSLP",
"WARC-Record-ID": "<urn:uuid:5abeaa1c-cc3d-47b8-a6a2-8452eaa66a1f>",
"WARC-Target-URI": "https://discourse.mapeditor.org/t/creating-objects-in-wrong-layer/2162",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5a443745-1cd7-4864-81aa-f0fc0d11c975>"
},
"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,
32,
33,
43,
44,
170,
387,
388,
425,
570,
916,
917,
928,
1532,
1533,
1542,
1564,
1565,
1671,
1672,
1715,
1716,
1816,
1817
],
"line_end_idx": [
32,
33,
43,
44,
170,
387,
388,
425,
570,
916,
917,
928,
1532,
1533,
1542,
1564,
1565,
1671,
1672,
1715,
1716,
1816,
1817,
1915
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1915,
"ccnet_original_nlines": 23,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4481927752494812,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02409639023244381,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17108434438705444,
"rps_doc_frac_unique_words": 0.48615384101867676,
"rps_doc_mean_word_length": 4.646153926849365,
"rps_doc_num_sentences": 21,
"rps_doc_symbol_to_word_ratio": 0.0024096400011330843,
"rps_doc_unigram_entropy": 4.670120716094971,
"rps_doc_word_count": 325,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07880795001983643,
"rps_doc_frac_chars_dupe_6grams": 0.049668870866298676,
"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.04370861127972603,
"rps_doc_frac_chars_top_3gram": 0.02384106069803238,
"rps_doc_frac_chars_top_4gram": 0.03178808093070984,
"rps_doc_books_importance": -215.95114135742188,
"rps_doc_books_importance_length_correction": -215.9511260986328,
"rps_doc_openwebtext_importance": -116.39461517333984,
"rps_doc_openwebtext_importance_length_correction": -116.39461517333984,
"rps_doc_wikipedia_importance": -93.5675277709961,
"rps_doc_wikipedia_importance_length_correction": -93.5675277709961
},
"fasttext": {
"dclm": 0.04037410020828247,
"english": 0.9409533739089966,
"fineweb_edu_approx": 1.3776655197143555,
"eai_general_math": 0.8614921569824219,
"eai_open_web_math": 0.1203681230545044,
"eai_web_code": 0.5226801037788391
}
}
|
{
"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": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,424,824,233,629,904,000 |
elhombre's user avatar
elhombre's user avatar
elhombre's user avatar
elhombre
• Member for 13 years, 2 months
• Last seen more than 1 year ago
2 votes
Accepted
Can't print from OS X 10.7 to shared printer on OS X 10.6
1 vote
Copying data from PC to MacBook Pro
1 vote
Accepted
Time Machine multiple Disks Backup over Network
1 vote
Accepted
Entourage MyDay replacement
1 vote
Accepted
How do I reset the software Mac OS X Update Server
1 vote
How to do an loop animation in Keynote?
1 vote
Accepted
Adding a bookmark or a web page to the reading list in Safari causes freeze
1 vote
Accepted
Macbook Air doesn't recognize external display
0 votes
Accepted
osx split external hard drive partition
0 votes
Accepted
Can iCal merge Events of attendes into one shared event?
0 votes
Accepted
Does [email protected] belong to the Apple up to date program?
0 votes
Accepted
Growl iCal invite notification
0 votes
Accepted
Can't shift+select in Finder in Lion 10.7.1
|
{
"url": "https://apple.stackexchange.com/users/2336/elhombre?tab=answers",
"source_domain": "apple.stackexchange.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "128545",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NMZBODBDQ2TS27CDCA2T6JCRMSZF2FLX",
"WARC-Concurrent-To": "<urn:uuid:bdd813f9-6e7d-4d26-a80f-7cdfdebf271e>",
"WARC-Date": "2024-03-05T02:16:32Z",
"WARC-IP-Address": "104.18.43.226",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3XD7RXC5DWBLFZYMENLCLYXYACSOSX63",
"WARC-Record-ID": "<urn:uuid:90a20287-fe62-49f0-8945-26b933b2023c>",
"WARC-Target-URI": "https://apple.stackexchange.com/users/2336/elhombre?tab=answers",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1f6ef97c-e33f-441d-98a8-36b8e68b333f>"
},
"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-69\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,
23,
46,
69,
78,
112,
147,
155,
164,
165,
223,
224,
231,
232,
268,
269,
276,
285,
286,
334,
335,
342,
351,
352,
380,
381,
388,
397,
398,
449,
450,
457,
458,
498,
499,
506,
515,
516,
592,
593,
600,
609,
610,
657,
658,
666,
675,
676,
716,
717,
725,
734,
735,
792,
793,
801,
810,
811,
874,
875,
883,
892,
893,
924,
925,
933,
942,
943
],
"line_end_idx": [
23,
46,
69,
78,
112,
147,
155,
164,
165,
223,
224,
231,
232,
268,
269,
276,
285,
286,
334,
335,
342,
351,
352,
380,
381,
388,
397,
398,
449,
450,
457,
458,
498,
499,
506,
515,
516,
592,
593,
600,
609,
610,
657,
658,
666,
675,
676,
716,
717,
725,
734,
735,
792,
793,
801,
810,
811,
874,
875,
883,
892,
893,
924,
925,
933,
942,
943,
986
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 986,
"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.19191919267177582,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04040404036641121,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21212120354175568,
"rps_doc_frac_unique_words": 0.6294117569923401,
"rps_doc_mean_word_length": 4.535294055938721,
"rps_doc_num_sentences": 8,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.390201568603516,
"rps_doc_word_count": 170,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07392995804548264,
"rps_doc_frac_chars_dupe_6grams": 0.07392995804548264,
"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.045395590364933014,
"rps_doc_frac_chars_top_3gram": 0.08430609852075577,
"rps_doc_frac_chars_top_4gram": 0.07263293862342834,
"rps_doc_books_importance": -70.13384246826172,
"rps_doc_books_importance_length_correction": -70.13384246826172,
"rps_doc_openwebtext_importance": -23.190185546875,
"rps_doc_openwebtext_importance_length_correction": -9.193375587463379,
"rps_doc_wikipedia_importance": -17.899126052856445,
"rps_doc_wikipedia_importance_length_correction": -17.899126052856445
},
"fasttext": {
"dclm": 0.025259200483560562,
"english": 0.8222326636314392,
"fineweb_edu_approx": 1.114879846572876,
"eai_general_math": 0.00008166000043274835,
"eai_open_web_math": 0.02713632956147194,
"eai_web_code": -0.000009780000254977494
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "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": "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": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,530,830,156,437,746,700 |
NeXT Cubes And LCD Monitors
The NeXT slabs and cubes were interesting computers for their time, with new interesting applications that are commonplace today seen first in this block of black plastic. Web browsers, for example, were first seen on the NeXT.
Running one of these machines today isn’t exactly easy; there are odd video connectors but you can modify some of the parts and stick them in an LCD monitor. It’s a tradeoff between a big, classic, heavy but contemporary CRT and a modern, light, and efficient LCD, but it’s still a great way to get a cube or slab up and running if you don’t have the huge monitor handy.
The NeXT cube doesn’t have a single wire going between the computer and the monitor; that would be far too simple. Instead, a NeXT Sound Box sits between the two, providing the user a place to plug the monitor, keyboard, mouse, and audio connectors into. [Brian] took the board from this Sound Box and put it inside an old NEC LCD monitor he had sitting around. 12V and 5V rails were wired in, the video lines were wired in, and [Brian] created a new NeXT monitor.
There are two versions of the NeXT Sound Box – one for ADB peripherals (Apple IIgs and beige Macs), and another for non-ADB peripherals. [Brian] also put together a tutorial for using non-ADB peripherals with the much more common ADB Sound Board.
15 thoughts on “NeXT Cubes And LCD Monitors
1. If you ask me (nobody ever does) the Next computer was Steve Jobs greatest contribution. It was light-years ahead of its time. If he had gone head-to-head with Microsoft in the PC OS market the world might be a little different today. Instead he tried to start up another Apple and found that no one was willing to spend outrageous amounts of money on a proprietary computer with little software written for it that used a cutting edge programming language that didn’t have a developer base.
I remember drooling over the specs, getting shocked at the price and puzzling over the file system
The OS is now open source if anyone wants to play with it.
http://en.m.wikipedia.org/wiki/OpenStep
http://www.gnustep.org
1. I was going to post this here.
1. Magnesium
2. NeXT’s are as interesting as today’s computers, as there are NO architectural difference from todays most advanced desktop OS’s and those machines. For example, the total separation between GUI and “code” (true Model-View-Controller architecture), was already in place.
1. The output of the sound box is a fairly standard 13W3, which plugs fine into my VGA monitors with a straightforward adapter cable (although I think my monitors are sync-on-green capable).
1. Yes, that is correct for the nextstation color series. This mod will not work with those machines as the color signal is broken out at the Y-cable. In that case a simple 13w3 to VGA adapter will work. You can use my other mod for the ADB sound board to use non-adb peripherals. Only the color turbo nextstation can use ADB with the proper ROM installed. No mono signal will come to the sound box. Another thing to mention is that the color machines use a 72hz refresh which can be a problem for many LCDs.
2. Even if it doesn’t support the color NeXT machines (well, technically it will on a color cube because you then have two framebuffers) this is a great alternative to the mono Megapixel monitors where the complete lack of power management meant that a lot of the cathodes and heaters in the CRT’s are completely worn out.
3. Nothing to do with this hack; I’d just like to mention that I’ve got a couple of cubes as coffee table stands/bases. Boards are still there, but I pulled the HD’s out because they’re so heavy.
Leave a Reply to John Klos Cancel reply
Please be kind and respectful to help make the comments section excellent. (Comment Policy)
This site uses Akismet to reduce spam. Learn how your comment data is processed.
|
{
"url": "https://hackaday.com/2014/12/27/next-cubes-and-lcd-monitors/?replytocom=2294338",
"source_domain": "hackaday.com",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "105552",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:T2V6CAV2MBLVNIWET4J7TAZ34IEUJTBQ",
"WARC-Concurrent-To": "<urn:uuid:13de99a8-2647-40dc-8798-34b0530e59d1>",
"WARC-Date": "2022-07-01T20:07:47Z",
"WARC-IP-Address": "192.0.66.96",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UYR6C4UOCAMMHN2DQG3MZVI7VDGLATQM",
"WARC-Record-ID": "<urn:uuid:312fab2b-aed7-4ba6-967e-848a9fda5eaf>",
"WARC-Target-URI": "https://hackaday.com/2014/12/27/next-cubes-and-lcd-monitors/?replytocom=2294338",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:db95fe10-3738-4bcf-bbfd-098ffaec717d>"
},
"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,
28,
29,
257,
258,
629,
630,
1095,
1096,
1343,
1344,
1388,
1389,
1886,
1989,
2052,
2053,
2097,
2098,
2125,
2126,
2164,
2165,
2184,
2463,
2464,
2659,
2660,
3175,
3176,
3501,
3502,
3700,
3701,
3741,
3742,
3834,
3835
],
"line_end_idx": [
28,
29,
257,
258,
629,
630,
1095,
1096,
1343,
1344,
1388,
1389,
1886,
1989,
2052,
2053,
2097,
2098,
2125,
2126,
2164,
2165,
2184,
2463,
2464,
2659,
2660,
3175,
3176,
3501,
3502,
3700,
3701,
3741,
3742,
3834,
3835,
3915
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3915,
"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.4194711446762085,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04086538031697273,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15745191276073456,
"rps_doc_frac_unique_words": 0.5022222399711609,
"rps_doc_mean_word_length": 4.542222023010254,
"rps_doc_num_sentences": 45,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.333935260772705,
"rps_doc_word_count": 675,
"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.011415529996156693,
"rps_doc_frac_chars_top_3gram": 0.007175469771027565,
"rps_doc_frac_chars_top_4gram": 0.012393999844789505,
"rps_doc_books_importance": -388.7881774902344,
"rps_doc_books_importance_length_correction": -388.7881774902344,
"rps_doc_openwebtext_importance": -230.15167236328125,
"rps_doc_openwebtext_importance_length_correction": -230.15167236328125,
"rps_doc_wikipedia_importance": -165.20169067382812,
"rps_doc_wikipedia_importance_length_correction": -165.20169067382812
},
"fasttext": {
"dclm": 0.04315495118498802,
"english": 0.9480231404304504,
"fineweb_edu_approx": 1.7822250127792358,
"eai_general_math": 0.4173291325569153,
"eai_open_web_math": 0.3487586975097656,
"eai_web_code": 0.006052849814295769
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.17",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
-2,495,021,144,489,244,000 |
Computer Docking Station Having Interchangeable Receivers Configured For Docking Various Sized Portable Computers - Patent 5699226
Document Sample
scope of work template
United States Patent: 5699226
( 1 of 1 )
United States Patent
5,699,226
Cavello
December 16, 1997
Computer docking station having interchangeable receivers configured for
docking various sized portable computers
Abstract
A docking apparatus for docking selected portable computers, each of the
portable computers having a portable computer connector positioned on its
rear end. The docking apparatus comprises a base having a first end and a
second end, with an electronics enclosure positioned on the base between
the first end and the second end. The electronics enclosure has a first
end positioned to extend generally perpendicularly from a first side to a
second side of the base and generally perpendicularly upwardly from the
base to form a wall with a docking apparatus connector being positioned on
the wall and configured to matingly engage the portable computer
connector. A receiver for at least one of the portable computers is
positioned on the base and configured to matingly engage the bottom and
the first and second sides of at least one portable computer to position
the portable computer for mating engagement of the portable computer
connector and the docking apparatus connector. The receiver may be
configured as a part of the base of the docking apparatus. The base
includes a receptacle and the receiver includes a manual lock which
engages the receptacle. Alternatively, the receiver may be formed to be
removably positioned on the base of the docking apparatus or by removably
positioning attachments which are configured to matingly engage one or
more portable computers on the base. The receiver may also comprise a
plurality of extendable members which are extendable to engage and support
a portable computer in a desired position.
Inventors:
Cavello; Christopher (Austin, TX)
Assignee:
Dell U.S.A., L.P.
(Austin,
TX)
Appl. No.:
08/600,888
Filed:
February 13, 1996
Current U.S. Class:
361/679.43 ; 439/638
Current International Class:
G06F 1/16 (20060101); G06F 001/16 (); H05K 007/10 ()
Field of Search:
364/708.1 439/638 361/686
References Cited [Referenced By]
U.S. Patent Documents
5182698
January 1993
Kobayashi et al.
5436792
July 1995
Leman et al.
5535093
July 1996
Noguchi et al.
Primary Examiner: Phillips; Michael W.
Attorney, Agent or Firm: Haynes and Boone, L.L.P.
Claims
What is claimed is:
1. A docking apparatus for docking selected portable computers of dimensions, each of the portable computers having a front end and a rear end, a first and a second side, a
top and a bottom and a portable computer connector, the docking apparatus comprising:
a base having a first end and a second end and a receptacle;
an electronics enclosure positioned on the base between the first end and the second end, the electronics enclosure having a first end positioned to extend generally perpendicularly between a first side to a second side of the base and generally
perpendicularly upwardly from the base to form a wall;
a docking apparatus connector positioned on the wall and configured to matingly engage the portable computer connector;
a receiver for at least one of the portable computers, the receiver including a manual lock positioned for engagement with the receptacle of the base when the receptacle is positioned on the base thereby to removably secure the receiver to the
base, the receiver being configured to matingly engage the bottom of one of the portable computers to position the one of the portable computers for mating engagement of the portable computer connector and the docking apparatus connector.
2. The docking apparatus of claim 1 comprising a plurality of interchangeable receivers each comprising a manual lock for engagement with the receptacle of the base thereby to removably secure the receiver to the bases wherein each of the
receivers is configured to matingly engage and position a different one of the selected portable computers.
3. The docking apparatus of claim 1 wherein the electronics enclosure further includes ejectors for disengagement of the portable computer connector from the docking apparatus connector. Description
FIELD OF THE INVENTION
The present invention relates generally to computer docking stations and more particularly to a docking apparatus for docking various sized portable computers that have different exterior dimensions and a common portable computer connector.
BACKGROUND OF THE INVENTION
To enable small portable computers such as notebook computers to be used in conjunction with desktop computer peripheral equipment, such as monitors, printers, and the like, structures referred to as port replicators are used. A port replicator
is a relatively small device which can be positioned on a desktop or other horizontal work surface and serves as an interface between a portable computer and the desktop peripherals with which it is to be used. Typically, the port replicator includes a
housing adapted to rest on a horizontal surface and having a rear side from which a series of connecting cables extend to the selected peripheral equipment. The front side of the port replicator is engagable with the portable computer in a manner so
that a connector on the portable computer is engaged with a mating connector on the port replicator to enable the portable computer to utilize the desired peripheral equipment.
However, when the portable computer is removed, the port replicator is a relatively small light device which is susceptible to being pulled off the desk by the weight of the cables connected to it. As a result, other types of docking apparatus
have been developed. One such docking apparatus comprises a base having positioned on one end an electronics enclosure which includes the electronics necessary to interconnect the portable computer with the desired peripheral equipment. The electronics
enclosure may also include a cable cover to cosmetically cover the cable connections. On the other end, a receiver is positioned to matingly engage the bottom and sides of a portable computer so that it may slide into mating engagement with the docking
apparatus. Mating engagement is achieved by moving a connector positioned on a rear end of the portable computer into engagement with a connector positioned on the docking apparatus so that the portable computer is matingly engaged with the docking
apparatus in operable electrical contact for use with the desired peripheral equipment. The portable computer display screen can be raised and the portable computer can be used while docked in contact with the peripheral equipment. Further, the docking
apparatus may include fittings for engagement with a monitor stand so that the docking apparatus with the docked portable computer can be stored under the monitor stand when the portable computer display screen is dosed.
In many instances, peripheral equipment in a particular office may be used by a number of users. Various users of the peripheral equipment may have portable computers which are of different models, different capabilities and the like, but of a
common family of portable computers. Such a family of portable computers can be designed to have a portable computer connector which is common to all members of the family of portable computers. Because of the different capabilities which may be
included in some of the portable computers, the different configurations of different models and the like, the portable computers may not all be readily mated with a single docking apparatus because the receiver is not configured to position the portable
computer properly for mating engagement of the portable computer connector with the docking apparatus connector. As a result, a different docking apparatus is required for each portable computer having a different configuration. In addition, a
different docking apparatus is typically required when a user upgrades to a portable computer having increased functionality due to differences in size of the computer and in the positioning of the portable computer connector.
What is needed, therefore, is a system whereby users of various sized portable computers can dock their portable computers at the same docking station. The foregoing is especially desirable in environments where different sized portable
computers from a common family of computers, having a common portable computer connector, are used.
SUMMARY OF THE INVENTION
The present invention, accordingly, provides an apparatus for docking various sized portable computers at the same docking station that overcomes or reduces disadvantages and limitations associated with prior systems.
The invention provides an apparatus for docking selected portable computers of a family of portable computers, each of the portable computers having a front end and a rear end, a first side and a second side, a top and a bottom, and a portable
computer connector positioned on the rear end of the portable computer.
The docking apparatus comprises a base having a first end and a second end and an electronics enclosure positioned on the base between the first end and the second end, the electronics enclosure having a first end positioned to extend generally
perpendicularly from a first side to a second side of the base and generally perpendicularly upwardly from the base to form a wall. A docking apparatus connector is positioned on the wall and configured to matingly engage the portable computer
connector. A receiver is positioned on the base and configured to matingly engage the bottom and a first and a second side of at least one portable computer to position at least one portable computer for mating engagement of the portable computer
connector and the docking apparatus connector.
The receiver may be configured as a part of the base of the docking apparatus. Alternatively, the receiver may be formed to be removably positioned on the base of the docking apparatus. Further, the receiver may be formed by removably
positioning a plurality of attachments which are configured to matingly engage one or more portable computers on the base. The receiver may also comprise a plurality of extendable members which are extendable to engage and support a portable computer in
a desired position .
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is an exploded, perspective view of a docking apparatus of the present invention.
FIG. 2 is an end view from section line 2--2 of FIG. 1 of a receiver positioned on the base of the docking apparatus showing the positioning of a portable computer supported therein.
FIG. 3 is an end view of an alternative receiver taken from the position of section line 2--2 of FIG. 1 that is formed as a part of the base showing a portable computer supported therein.
FIG. 4 is an end view of the receiver of FIG. 3 taken from the position of section line 2--2 of FIG. 1 showing a different portable computer supported therein.
FIG. 5 is an end view taken from the position of section line 2--2 of FIG. 1 of another alternative receiver that is form by positioning attachments on the base and shows a portable computer supported by the attachments.
FIG. 6 is a perspective view of a receiver having extendable members positioned in its floor for supporting a portable computer.
FIG. 7 is a cross sectional end view from section line 7--7 of FIG. 6 showing the extendable members in an extended position to support a portable computer.
FIG. 8 is a cross sectional end view from section line 7--7 of FIG. 6 showing the extendable members in a retracted position to support a different sized portable computer.
FIG. 9 is a cross sectional end view from section line 7--7 of FIG. 6 of an alternative embodiment of the apparatus of FIG. 6 wherein extendable members are also positioned in the sides of the receiver.
FIG. 10 is a perspective view of an alternative embodiment of the docking apparatus of the present invention.
FIG. 11 is an enlarged, cross-sectional view from section line 11--11 of FIG. 10 showing a detail of the engagement mechanism between the base and receiver.
FIG. 12 is an enlarged, cross-sectional view from section line 12--12 of FIG. 10 showing a detail of the mating engagement of the components of the invention.
DESCRIPTION OF PREFERRED EMBODIMENTS
In FIG. 1, the reference numeral 10 refers to a docking apparatus of the present invention resting on a surface 12. The docking apparatus 10 comprises a base 14 having a side 16, a side 18, a front end 20 and a rear end 22. The base 14 may be
formed, as shown, as a framework or as a solid member. Fittings 24 are optionally provided on the base 14 for mounting a monitor stand (not shown) above the docking apparatus 10. An electronics enclosure 26 is provided which includes the electrical
components necessary to achieve electrical connection of a portable computer with peripheral equipment or the like and other functionalities not available in the portable computer enclosure. The electronics enclosure 26 includes a front end 28 and a
rear end 30, and is connected by cables (not shown) to peripheral equipment and the like. The electronics enclosure 26 also includes a side 32 and a side 34. End 28 is formed as a wall which supports a connector 36 which includes guide pins 38 and
connector pins 40. Ejectors 42 are positioned on end 28 to eject portable computers from engagement with connector 36 when desired. Ejectors 42 may be mechanical or electromechanical and are operated by a switch or lever 44, shown on the side 32 of the
electronics enclosure 26.
A receiver 46 having a side 48, a side 50, a front end 54, and a rear end 56, is positioned for mounting on the base 14. The receiver 46 includes rafts 58 which may be positioned on a floor 60 of the receiver 46 and optionally on inner walls 62
of sidewalls 64 of the receiver 46 to facilitate sliding a portable computer into the receiver 46. The receiver 46 as shown is maintained in position on the base 14 by a manual lock 66 positioned on the receiver 46, and adapted for engagement with a
receptacle 68 positioned on the base 14 to maintain the receiver 46 in place. Slots 70 are provided on the base 14, to receive tabs (not shown) on the receiver 46 to further secure the receiver 46 in position on the base 14.
As shown in FIG. 2, a portable computer 72 is positioned in the receiver 46 positioned on the base 14. The portable computer 72 has a portable computer connector 74 positioned on its rear end and is positioned between the sidewalls 64 for mating
engagement of the connector 74 with the connector 36. The connector 74 contains receptacles 76 for the guide pins 38 and receptacles 78 for the connector pins 40. The pins and receptacles could be reversed between the connector 36 and the connector 74.
By the use of a plurality of receivers 46 adapted to receive different portable computers by varying the width of the sidewalls 64 and the height of the rails 58 to matingly engage with the sides and bottom of the portable computer to position
the portable computer connector 74 in position for mating engagement with the docking apparatus connector 36, a large number of portable computers from a common family of portable computers can be docked in the same docking apparatus.
FIGS. 3 and 4 disclose an alternate embodiment of the present invention wherein the receiver 46 is formed as a part of the base 14. In the embodiment shown in FIGS. 3 and 4, the same receiver 46 is adapted to support two portable computers 72a
and 72b. The sidewalls 64, as shown, are adapted to matingly engage the sides and bottom of the portable computers 72a and 72b for mating engagement of the connector 74 with the connector 36. Each of the sidewalls 64 includes a bearing surface 64a
which supports the bottom of the portable computer 72a.
Alternatively, the portable computer 72b having a different exterior configuration can be supported in receiver 46, as shown in FIG. 4. Inner walls 62, formed as a part of the sidewalls 64, engage the sides of the portable computer 72b, and
floor 60 engages the bottom of the portable computer 72a. Either of two portable computers can thus be placed in a position for mating engagement of the connector 74 with the connector 36.
In FIG. 5, the receiver 46 is formed by positioning removable attachments 80 on the sides of the base 14 to form the sidewalls 64 as shown. The attachments 80 may be removably attached to base 14 by any convenient method, such as screws,
friction fittings, mating tabs and slots, and the like, as known to those skilled in the art. Various attachments 80 having different dimensions can be provided to receive a variety of portable computers 72.
In FIG. 6, an alternate embodiment of the docking apparatus of the present invention is shown. The receiver 46 is shown as a hollow member having slots 82 positioned in the floor 60 of the receiver 46. The slots 82 are positioned for extension
of inner extendable members 84 and outer extendable members 86 (shown in FIG. 7) upwardly through the floor 60 of the receiver 46. The receiver 46 with members 84 and 86 retracted is adapted to receiver a portable computer of a size compatible with the
sidewalls 64 and the floor 60 of the receiver 46 as configured.
In FIG. 7, extendable members 84 and 86 have been extended to support the portable computer 72 in the receiver 46. The extendable members 84 and 86 may be extended by any suitable mechanical or electromechanical means and are activated by a
switch 88, shown on the side 16 of the receiver 46. In FIG. 8, a portable computer 72 is shown positioned in the receiver 46 with the extendable members 84 and 86 in a retracted position to accommodate a larger portable computer 72.
In FIG. 9, an alternate embodiment of the receiver 46 of FIG. 6 is shown. In this embodiment, horizontally extendable members 90 are positioned in the sidewalls 64. In this embodiment, the extendable members 84, 86 and 90 may be extended for
variable distances to accommodate various portable computers 72 in place. Desirably, the extendable members 84, 86 and 90 are rails which are adapted to slidably engage the sidewalls and bottom of the portable computer 72 to position it for mating
engagement of the connector 74 with the connector 36. The extendable members 84, 86 and 90 may be moved into a desired position by electromechanical devices 92 which may be controlled manually by the switch 88 or by a computer program designed to
position the extendable rails 84, 86 and 90 in desired positions to accommodate different external portable computer configurations.
Referring now to FIG. 10, the reference numeral 100 referes to a docking apparatus of an alternative embodiment of the present invention. The docking apparatus 100 comprises a base 102 having a sidewall 104, a sidewall 106, a front end 108 and a
rear end 110. Like the base 14, the base 102 may be formed as a framework or as a solid member, as shown. Fittings 112 are optionally provided on the base 102 for mounting a monitor stand (not shown) above the docking apparatus 100.
An electronics housing 114 is provided which includes the electrical components (not shown) necessary to achieve electrical connection of a portable computer with peripheral equipment or the like. The electronics housing 114 includes a rear
portion 116 and a front portion 118. The rear portion 116 may be removably attached to the base 102 and to the front portion 118 by any convenient method, such as mating tabs and slots, and the like, as known to those skilled in the art, and contains
depressions 120 for facilitating such removal. The front portion 118 of the electronics housing 114 includes a front end 122, a side 124 and a side 126. End 122 supports a connector 128 which includes guide pins 130 and connector pins 132. Ejectors
134 extend from within the electronics housing 114 through the end 122 to eject portable computers from engagement with the connector 128 when desired. The ejectors 134 may be mechanical or electromechanical and are operated by a switch or lever 136,
shown on the side 124 of the front portion 118 of the electronics housing 114.
A receiver 138 having a sidewall 140, a sidewall 142, a front end 144 and a rear end 146, is positioned for mounting on the base 102 such that the sidewalls 140 and 142 of the receiver 138 matingly engage with the sidewalls 104 and 106 of the
base 102 as shown in FIG. 11. The receiver 138 includes a floor 148, positioned on which are rails 150, each having a sloped leading edge 150a, and a raised surface 152 for receiving a portable computer 154 onto the receiver 138. The portable computer
154 has corresponding rails 156 and feet 158 extending downwardly therefrom to further facilitate the entry and positioning of the portable computer 154 onto the receiver 138 as shown in FIG. 11.
The receiver 138 as shown in FIG. 10 is maintained in position on the base 102 not only through engagement of the sidewalls 104 and 106 of the base 102, but (referring to both FIG. 10 and FIG. 12) by a locking tab 160 that extends downwardly from
a circular partial cutout 162 in the floor 148 of the receiver 138, that is adapted for engagement with a slot 164 positioned near the front end 108 of the base 102 behind a sloped surface 166. In addition, a plurality of openings 168 are provided in
the front end 122 of the electronics housing 114 adjacent the base 102 to receive tabs 170 horizontally extending from the rear end 146 of the receiver 138 to further secure the receiver 138 in position on the base 102. Moreover, a plurality of slots
172 are provided in the front end 108 of the base 102 to receive tabs 174 horizontally extending from a shoulder 176 formed on the underside of the receiver 138 as shown in FIG. 10 and FIG. 12. When engaged, the shoulder 176 engages the front end 108 of
the base 102 to further facilitate the engagement and positioning of the receiver 138 on the base 102.
The portable computer 154 has a portable computer connector 178 positioned on its rear end for mating engagement with the connector 128. The connector 178 contains receptacles 180 for the guide pins 130 and receptacles (not shown) for the
connector pins 132. The pins and receptacles could be reversed between the connector 128 and the connector 178. If necessary, the portable computer 154 may also have depressions 182 on its rear end for mating engagement with the ejectors 134.
In operation, the receiver 138 is engaged with the base 102 by sliding the receiver 138 onto the base 102 between the sidewalls 104 and 106 of the base. The mating of the sidewalls 140 and 142 of the receiver 138 with the sidewalls 104 and 106
of the base 102 direct the tabs 170 into the openings 168 and the tabs 174 into the slots 172. Disengagement is prevented by the locking tab 160 that engages the slot 164 after sliding up the surface 166. The portable computer 154 is then positioned on
the receiver 138 by sliding the portable computer 154 onto the sloped edges 150a of the rails 150 between the sidewalls 140 and 142 of the receiver. The mating of the sidewalls, the rails 156 of the portable computer 154 with the raised surface 152 of
the receiver 138, and the corresponding heights of the rails 150 of the receiver 138 and the feet 158 of the portable computer 154, direct the connector 178 into engagement with the connector 128 to connect the portable computer 154 with the docking
apparatus 100 and the associated peripheral equipment (not shown).
Disengagement of the portable computer 154 from the docking apparatus 100 is accomplished by activating the switch 136, which in turn activates the ejectors 134 that urge against the rear end of the portable computer 154 to separate the
connectors 128 and 178. The receiver 138 is disengaged from the base 102 by lifting up on the cutout 162 to lift the locking tab 160 out of the slot 164. The receiver 138 can then be slid off of the base 102 to make room for the next receiver.
By the use of a plurality of receivers 138, each adapted to be received by the base 102 but adapted to receive different portable computers 154 by varying the width of the sidewalls 140 and 142, the height and location of the rails 150, and the
height and width of the raised surface 152 to matingly engage with the sides and bottom of the portable computer, including the rafts 156 and the feet 158, to position the portable computer connector 178 in position for mating engagement with the docking
apparatus connector 128, a large number of portable computers from a common family of portable computers can be docked in the same docking apparatus 100.
In the use of the docking apparatus of the present invention, a plurality of receivers can be provided for mounting on the base to accommodate selected portable computers based upon the external configuration of the portable computers. Many
manufacturers of portable computers find it desirable to change the external dimensions of the portable computers because of varied capabilities in the portable computer, fabrication at different facilities, and the like. While such changes may be
necessitated by the internal arrangement of electronic components and the like, it is possible to position a common portable computer connector on all such portable computers. Further, while it is desirable to be able to move the location of the
portable computer connector to a certain extent, it is also feasible to locate the connector generally in a selected position such as toward the left and generally toward the top of the rear of the portable computer. While the location may not be
exactly the same on each portable computer model, the location is in the same general area and suitable for mating with the docking apparatus connector when the portable computer is suitably positioned.
By the use of the docking apparatus of the present invention, a large number of selected members of a family of portable computers can be docked in a common docking apparatus by providing a receiver which is adapted to receive the desired
portable computer and which can be positioned on the base of the docking apparatus. Alternatively, as discussed, attachments can be used or extendable rafts can be used.
Having thus described the present invention by reference to its preferred embodiments, it is pointed out that many variations and modifications are possible within the scope of the present invention. Such variations and modifications may appear
obvious and desirable to those skilled in the art based upon the foregoing description of preferred embodiments. For example, and with particular reference to the docking apparatus 100 shown in FIG. 10, the rails 150 of the receiver 148 could be
eliminated or the sidewalls 140 and 142 shortened in length or even eliminated in some cases. As the rails 156 provide left and right alignment, the sidewalls 140 and 142 are not required to properly align the connectors and can thus be eliminated, or
simply shortened to still provide course alignment. In addition, the lever 136 could be positioned near the front end of the base 102 to facilitate its access. Moreover, the connectors could be repositioned on both the portable computer and the docking
apparatus to allow docking to occur at different locations besides at the rear of the portable computer. Further modifications, changes and substitutions are intended in the foregoing disclosure and in some instances some features of the invention will
be employed without a corresponding use of other features. Accordingly, it is appropriate that the appended claims be construed broadly and in a manner consistent with the scope of the invention.
* * * * *
DOCUMENT INFO
Description: The present invention relates generally to computer docking stations and more particularly to a docking apparatus for docking various sized portable computers that have different exterior dimensions and a common portable computer connector.BACKGROUND OF THE INVENTIONTo enable small portable computers such as notebook computers to be used in conjunction with desktop computer peripheral equipment, such as monitors, printers, and the like, structures referred to as port replicators are used. A port replicatoris a relatively small device which can be positioned on a desktop or other horizontal work surface and serves as an interface between a portable computer and the desktop peripherals with which it is to be used. Typically, the port replicator includes ahousing adapted to rest on a horizontal surface and having a rear side from which a series of connecting cables extend to the selected peripheral equipment. The front side of the port replicator is engagable with the portable computer in a manner sothat a connector on the portable computer is engaged with a mating connector on the port replicator to enable the portable computer to utilize the desired peripheral equipment.However, when the portable computer is removed, the port replicator is a relatively small light device which is susceptible to being pulled off the desk by the weight of the cables connected to it. As a result, other types of docking apparatushave been developed. One such docking apparatus comprises a base having positioned on one end an electronics enclosure which includes the electronics necessary to interconnect the portable computer with the desired peripheral equipment. The electronicsenclosure may also include a cable cover to cosmetically cover the cable connections. On the other end, a receiver is positioned to matingly engage the bottom and sides of a portable computer so that it may slide into mating engagement with the dockingapparatus. Mating engagement is achieved by moving a conn
How are you planning on using Docstoc?
|
{
"url": "http://www.docstoc.com/docs/50030975/Computer-Docking-Station-Having-Interchangeable-Receivers-Configured-For-Docking-Various-Sized-Portable-Computers---Patent-5699226",
"source_domain": "www.docstoc.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "98903",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RZBQM5LYYV4WN4QYTJF3DUY25PG5SPWY",
"WARC-Concurrent-To": "<urn:uuid:59772683-b96c-4bd2-8e06-00ac3b5b134d>",
"WARC-Date": "2013-12-05T07:03:16Z",
"WARC-IP-Address": "72.172.88.41",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:BTQ6CAWVEDAG2TBF6B6EEF7FQOX5GROO",
"WARC-Record-ID": "<urn:uuid:d318a2d4-6cf4-421b-b4cc-7b5e312570b4>",
"WARC-Target-URI": "http://www.docstoc.com/docs/50030975/Computer-Docking-Station-Having-Interchangeable-Receivers-Configured-For-Docking-Various-Sized-Portable-Computers---Patent-5699226",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c64c3500-05a6-4105-9493-29f80e39981d>"
},
"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,
131,
132,
148,
171,
177,
178,
179,
209,
210,
211,
212,
213,
214,
215,
216,
217,
218,
219,
220,
221,
222,
223,
224,
225,
226,
227,
228,
229,
230,
231,
232,
233,
234,
235,
236,
237,
238,
239,
240,
241,
242,
243,
250,
261,
262,
263,
264,
287,
298,
299,
300,
301,
310,
312,
313,
315,
333,
334,
335,
336,
337,
411,
457,
458,
459,
460,
469,
470,
543,
622,
701,
779,
856,
935,
1012,
1092,
1162,
1235,
1312,
1390,
1464,
1536,
1609,
1682,
1759,
1838,
1914,
1989,
2069,
2117,
2118,
2119,
2121,
2133,
2169,
2180,
2181,
2182,
2200,
2211,
2215,
2216,
2217,
2218,
2219,
2220,
2231,
2252,
2264,
2267,
2274,
2297,
2317,
2318,
2319,
2320,
2321,
2322,
2325,
2345,
2369,
2372,
2402,
2469,
2472,
2490,
2493,
2496,
2497,
2498,
2525,
2528,
2529,
2563,
2585,
2587,
2589,
2591,
2599,
2612,
2629,
2630,
2638,
2648,
2661,
2662,
2670,
2680,
2695,
2696,
2697,
2698,
2741,
2742,
2743,
2795,
2796,
2797,
2798,
2807,
2808,
2828,
2829,
3003,
3089,
3090,
3091,
3152,
3153,
3154,
3400,
3455,
3456,
3457,
3577,
3578,
3579,
3823,
4062,
4063,
4064,
4304,
4412,
4413,
4414,
4616,
4617,
4618,
4641,
4642,
4643,
4884,
4885,
4886,
4914,
4915,
4916,
5162,
5416,
5667,
5844,
5845,
5846,
6091,
6346,
6600,
6850,
7105,
7326,
7327,
7328,
7573,
7821,
8076,
8322,
8549,
8550,
8551,
8789,
8889,
8890,
8891,
8916,
8917,
8918,
9136,
9137,
9138,
9382,
9454,
9455,
9456,
9701,
9946,
10194,
10241,
10242,
10243,
10480,
10735,
10757,
10758,
10792,
10793,
10794,
10883,
10884,
10885,
11068,
11069,
11070,
11258,
11259,
11260,
11420,
11421,
11422,
11643,
11644,
11645,
11774,
11775,
11776,
11933,
11934,
11935,
12108,
12109,
12110,
12313,
12314,
12315,
12425,
12426,
12427,
12584,
12585,
12586,
12746,
12747,
12784,
12785,
12786,
13031,
13282,
13533,
13783,
14038,
14064,
14065,
14066,
14312,
14563,
14789,
14790,
14791,
15038,
15293,
15294,
15295,
15539,
15774,
15775,
15776,
16021,
16271,
16327,
16328,
16329,
16571,
16761,
16762,
16763,
17002,
17211,
17212,
17213,
17459,
17713,
17777,
17778,
17779,
18021,
18255,
18256,
18257,
18501,
18750,
18998,
19131,
19132,
19133,
19380,
19615,
19616,
19617,
19859,
20111,
20363,
20615,
20694,
20695,
20696,
20939,
21193,
21389,
21390,
21391,
21638,
21890,
22142,
22397,
22500,
22501,
22502,
22742,
22987,
22988,
22989,
23234,
23489,
23742,
23992,
24059,
24060,
24061,
24298,
24544,
24545,
24546,
24791,
25046,
25200,
25201,
25202,
25444,
25693,
25940,
26188,
26391,
26392,
26393,
26632,
26803,
26804,
26805,
27051,
27298,
27551,
27806,
28060,
28257,
28258,
28259,
28269,
28270,
28271,
28272,
28273,
28274,
28275,
28276,
28277,
28278,
28279,
28280,
28281,
28282,
28283,
28284,
28285,
28286,
28287,
28288,
28289,
28290,
28291,
28292,
28297,
28311,
30317,
30356
],
"line_end_idx": [
131,
132,
148,
171,
177,
178,
179,
209,
210,
211,
212,
213,
214,
215,
216,
217,
218,
219,
220,
221,
222,
223,
224,
225,
226,
227,
228,
229,
230,
231,
232,
233,
234,
235,
236,
237,
238,
239,
240,
241,
242,
243,
250,
261,
262,
263,
264,
287,
298,
299,
300,
301,
310,
312,
313,
315,
333,
334,
335,
336,
337,
411,
457,
458,
459,
460,
469,
470,
543,
622,
701,
779,
856,
935,
1012,
1092,
1162,
1235,
1312,
1390,
1464,
1536,
1609,
1682,
1759,
1838,
1914,
1989,
2069,
2117,
2118,
2119,
2121,
2133,
2169,
2180,
2181,
2182,
2200,
2211,
2215,
2216,
2217,
2218,
2219,
2220,
2231,
2252,
2264,
2267,
2274,
2297,
2317,
2318,
2319,
2320,
2321,
2322,
2325,
2345,
2369,
2372,
2402,
2469,
2472,
2490,
2493,
2496,
2497,
2498,
2525,
2528,
2529,
2563,
2585,
2587,
2589,
2591,
2599,
2612,
2629,
2630,
2638,
2648,
2661,
2662,
2670,
2680,
2695,
2696,
2697,
2698,
2741,
2742,
2743,
2795,
2796,
2797,
2798,
2807,
2808,
2828,
2829,
3003,
3089,
3090,
3091,
3152,
3153,
3154,
3400,
3455,
3456,
3457,
3577,
3578,
3579,
3823,
4062,
4063,
4064,
4304,
4412,
4413,
4414,
4616,
4617,
4618,
4641,
4642,
4643,
4884,
4885,
4886,
4914,
4915,
4916,
5162,
5416,
5667,
5844,
5845,
5846,
6091,
6346,
6600,
6850,
7105,
7326,
7327,
7328,
7573,
7821,
8076,
8322,
8549,
8550,
8551,
8789,
8889,
8890,
8891,
8916,
8917,
8918,
9136,
9137,
9138,
9382,
9454,
9455,
9456,
9701,
9946,
10194,
10241,
10242,
10243,
10480,
10735,
10757,
10758,
10792,
10793,
10794,
10883,
10884,
10885,
11068,
11069,
11070,
11258,
11259,
11260,
11420,
11421,
11422,
11643,
11644,
11645,
11774,
11775,
11776,
11933,
11934,
11935,
12108,
12109,
12110,
12313,
12314,
12315,
12425,
12426,
12427,
12584,
12585,
12586,
12746,
12747,
12784,
12785,
12786,
13031,
13282,
13533,
13783,
14038,
14064,
14065,
14066,
14312,
14563,
14789,
14790,
14791,
15038,
15293,
15294,
15295,
15539,
15774,
15775,
15776,
16021,
16271,
16327,
16328,
16329,
16571,
16761,
16762,
16763,
17002,
17211,
17212,
17213,
17459,
17713,
17777,
17778,
17779,
18021,
18255,
18256,
18257,
18501,
18750,
18998,
19131,
19132,
19133,
19380,
19615,
19616,
19617,
19859,
20111,
20363,
20615,
20694,
20695,
20696,
20939,
21193,
21389,
21390,
21391,
21638,
21890,
22142,
22397,
22500,
22501,
22502,
22742,
22987,
22988,
22989,
23234,
23489,
23742,
23992,
24059,
24060,
24061,
24298,
24544,
24545,
24546,
24791,
25046,
25200,
25201,
25202,
25444,
25693,
25940,
26188,
26391,
26392,
26393,
26632,
26803,
26804,
26805,
27051,
27298,
27551,
27806,
28060,
28257,
28258,
28259,
28269,
28270,
28271,
28272,
28273,
28274,
28275,
28276,
28277,
28278,
28279,
28280,
28281,
28282,
28283,
28284,
28285,
28286,
28287,
28288,
28289,
28290,
28291,
28292,
28297,
28311,
30317,
30356,
30357
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 30357,
"ccnet_original_nlines": 422,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4023451805114746,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01777208037674427,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16214731335639954,
"rps_doc_frac_unique_words": 0.13664720952510834,
"rps_doc_mean_word_length": 4.905816078186035,
"rps_doc_num_sentences": 218,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.112218856811523,
"rps_doc_word_count": 4969,
"rps_doc_frac_chars_dupe_10grams": 0.3160766363143921,
"rps_doc_frac_chars_dupe_5grams": 0.5517085790634155,
"rps_doc_frac_chars_dupe_6grams": 0.47704803943634033,
"rps_doc_frac_chars_dupe_7grams": 0.42326784133911133,
"rps_doc_frac_chars_dupe_8grams": 0.3782663941383362,
"rps_doc_frac_chars_dupe_9grams": 0.3391721844673157,
"rps_doc_frac_chars_top_2gram": 0.027690039947628975,
"rps_doc_frac_chars_top_3gram": 0.04364769905805588,
"rps_doc_frac_chars_top_4gram": 0.01895228959619999,
"rps_doc_books_importance": -2317.40869140625,
"rps_doc_books_importance_length_correction": -2317.40869140625,
"rps_doc_openwebtext_importance": -1261.0919189453125,
"rps_doc_openwebtext_importance_length_correction": -1261.0919189453125,
"rps_doc_wikipedia_importance": -520.8827514648438,
"rps_doc_wikipedia_importance_length_correction": -520.8827514648438
},
"fasttext": {
"dclm": 0.08370614051818848,
"english": 0.9198868870735168,
"fineweb_edu_approx": 2.4916980266571045,
"eai_general_math": 0.1958562135696411,
"eai_open_web_math": 0.06288207322359085,
"eai_web_code": 0.01335120014846325
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.17",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "629.8312",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,965,789,270,256,809,000 |
subobjective21 interactive
Published July 03rd, 2008 by Nate Frank in Category: 3d
The folks over at blitz and at papervision2 have come up with some interesting ways to actually have real interaction with the MovieClips you are texturing your models with.
The quick is that you always use MovieMaterials(created with a reference to an existing movieclip someplace on stage). Normally the MovieMaterial object can be offstage or even visible=false to not see the clip; thing is they use visible=true, alpha=0 and reposition the clip actually under the mouse. A bit of trickery has the user actually interacting with the 2d flat MovieMaterial.
One of the nice things about this is that you can also do some testing and creating of functionality of your MovieClips as flat 2d objects and then map them to another object.
In creating an app with multiple panels in a 3D space every panel needs to be attached to the stage and then used to map onto your objects. This is fine when its just one object. When there are multiple surfaces that need interactivity this can quickly get out of control.
If you are using puremvc or caringorn to build your app you are used to creating a view/ui class that represents the specific element as a whole, it needs to have two elements, the stage texture version and the display3d object.
Ok cool. Just take a step back so that your view consists of two ui elements. Your mediators/viewhelpers can then access both elements and update them appropriately.
Wait what if we have multiple panels with the same textures? Looks like there are two options.
1. Use the same texture/ the same reference to the movieclip on stage and use the target of the object to figure out what object you are on(requires dynamic naming of the display objects you are using so they can be keyed in later to access the specific class). You can take advantage of the InteractiveEvent3D event which includes the DisplayObject3D element that is interacted with.
2. Use a separate instance of each texture on the stage so that it can be targeted separately for each individual item. This also needs to be dynamically named so that they do not overwrite any other textures. Destroy methods then need to make sure they clean up these 2d objects in addition to the 3d counterparts.
I also found that its a good idea to add some code that listens for the mouse to be off the given object and send the stage texture off stage and hidden. The example from blitz I found I could still click on an element even though my mouse wasn’t on the object.
Thanks to those guys for the hook ups of the advanced interactive elements.
|
{
"url": "http://interactive.subobjective21.org/blog/2008/07/03/working-with-multiple-3d-objects-with-precise-interaction/",
"source_domain": "interactive.subobjective21.org",
"snapshot_id": "crawl=CC-MAIN-2018-43",
"warc_metadata": {
"Content-Length": "11324",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZXBPAJ5LELIWIEOYTJV5RSPDRZLEXWLS",
"WARC-Concurrent-To": "<urn:uuid:aa1453fc-ca57-4bb3-afb1-44b6a77e39c3>",
"WARC-Date": "2018-10-19T02:52:14Z",
"WARC-IP-Address": "66.33.213.92",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:ITCVE6J7GGYMI3Q5YTKG6UAXHGWGNJMD",
"WARC-Record-ID": "<urn:uuid:1a586592-bad3-4721-af12-8f2320beedaa>",
"WARC-Target-URI": "http://interactive.subobjective21.org/blog/2008/07/03/working-with-multiple-3d-objects-with-precise-interaction/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f4e1f188-8f7f-42c0-af1f-4b44328d6423>"
},
"warc_info": "isPartOf: CC-MAIN-2018-43\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-91-224-137.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,
27,
83,
84,
258,
259,
645,
646,
822,
823,
1096,
1097,
1326,
1327,
1493,
1494,
1589,
1590,
1977,
2295,
2296,
2558,
2559
],
"line_end_idx": [
27,
83,
84,
258,
259,
645,
646,
822,
823,
1096,
1097,
1326,
1327,
1493,
1494,
1589,
1590,
1977,
2295,
2296,
2558,
2559,
2634
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2634,
"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.5128204822540283,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009861930273473263,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.08481261879205704,
"rps_doc_frac_unique_words": 0.47173914313316345,
"rps_doc_mean_word_length": 4.610869407653809,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.9296650886535645,
"rps_doc_word_count": 460,
"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.01414426974952221,
"rps_doc_frac_chars_top_3gram": 0.008486559614539146,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -234.6330108642578,
"rps_doc_books_importance_length_correction": -234.6330108642578,
"rps_doc_openwebtext_importance": -138.22247314453125,
"rps_doc_openwebtext_importance_length_correction": -138.22247314453125,
"rps_doc_wikipedia_importance": -90.12262725830078,
"rps_doc_wikipedia_importance_length_correction": -90.12262725830078
},
"fasttext": {
"dclm": 0.3378034830093384,
"english": 0.9441335797309875,
"fineweb_edu_approx": 2.322124481201172,
"eai_general_math": 0.8171152472496033,
"eai_open_web_math": 0.0887741968035698,
"eai_web_code": 0.7157876491546631
}
}
|
{
"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": "791.43",
"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": "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": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,456,109,598,552,754,000 |
Systemadministration
Erkennen Sie, welcher Systemmanager auf Linux -System ausgeführt wird
Erkennen Sie, welcher Systemmanager auf Linux -System ausgeführt wird
Zielsetzung
Es gibt mehrere Systemmanager, die möglicherweise auf Ihrem Linux -System ausgeführt werden können. Die derzeit gängigsten Systemmanager sind SYSV (Init), Systemd und Upstart. Möglicherweise finden Sie diesen kurzen Leitfaden für Sie. Wenn Sie sich nicht sicher sind, wird der Systemmanager auf Ihrem Linux -System ausgeführt.
Anforderungen
Der privilegierte Zugriff auf Ihr Linux -System ist erforderlich.
Schwierigkeit
EINFACH
Konventionen
Anweisungen
Der Systemmanager ist ein erster Prozess, der auf Ihrem Linux -System beginnt. Somit ansehen, welche Prozesse zuerst mit der Verwendung begonnen haben PS -P 1 Befehst meine Hinweise, aber keine endgültigen Antworten. Beispiel:
Sysv
# ps -p 1 pid tty time cmd 1 ? 00:00:01 init
Systemd
# ps -p 1 pid tty time cmd 1 ? 00:00:04 Systemd
Emporkömmling
# ps -p 1 pid tty time cmd 1 ? 00:00:01 init
Erster Prozess symbolischer Link
Zuverlässigerer Ansatz, um zu überprüfen, welcher Systemmanager auf Ihrem Linux -System ausgeführt wird.
Sysv
# ls -l/proc/1/exe lrwxrwxrwx 1 root root 0 apr 3 04:17/proc/1/exe ->/sbin/init oder # stat/proc/1/exe | Grep -Datei Datei: '/proc/1/exe' -> '/sbin/init' '
Systemd
# ls -l/proc/1/exe lrwxrwxrwx 1 root root 0 mar 27 09:39/proc/1/exe ->/lib/systemd/systemd oder # stat/proc/1/exe | GREP -Datei Datei:/proc/1/exe ->/lib/systemd/systemd
Emporkömmling
# ls -l/proc/1/exe lrwxrwxrwx 1 root root 0 apr 3 04:29/proc/1/exe ->/sbin/upstart oder # stat/proc/1/exe | GREP -Datei Datei: '/proc/1/exe' -> '/sbin/upstart' '
Init Symbolic Link
Überprüfen Sie, welcher Systemmanager ausführbar ist /sbin/init zeigt auf:
Sysv
# ls -l /sbin /init -rwxr -xr -x 1 Root Root 36992 14. Juli 2013 /SBIN /Init
Systemd
# ls -l/sbin/init lrwxrwxrwx 1 root root 20
Emporkömmling
# ls -l /sbin /init
Automatische HTML -Formulare mit wwwmechanize
Hier ist ein kurzer Tipp, wie Sie mithilfe einer Linux -Befehlszeile und Perl -Skript automatisch ein HTML -Formular einreichen können. Für dieses Bei...
Perl Hash
Perl Hash lassen Sie uns zu Paaren sehen, wie wir Perl Hash verwenden können. Zuerst müssen wir wissen, dass der Perl -Hash -Wert über den Schlüssel z...
Beispiel eines binären Suchalgorithmus in C ++
Hier ist ein einfaches Beispiel für eine binäre Suche in C++. Das Beispiel erstellt zuerst einen Vektor von 4 000 000 Zahlen und macht dann einen Funk...
|
{
"url": "https://de.cgots.org/article/detecting-which-system-manager-is-running-on-linux-system",
"source_domain": "de.cgots.org",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "21067",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EZ747AROK6BHZO4FHJ5D7YCZLXFLXN4O",
"WARC-Concurrent-To": "<urn:uuid:37638e3a-c98c-43b2-8506-f048472ac127>",
"WARC-Date": "2024-04-16T10:57:22Z",
"WARC-IP-Address": "104.21.27.139",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CUJKTJRDOEMZU3M6ETBU43T2BAOVN453",
"WARC-Record-ID": "<urn:uuid:b8b9f154-f150-4636-b3d6-d3473cb8c8b8>",
"WARC-Target-URI": "https://de.cgots.org/article/detecting-which-system-manager-is-running-on-linux-system",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fdd6632c-b106-4ad2-92cb-5c0802d421a6>"
},
"warc_info": "isPartOf: CC-MAIN-2024-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-191\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,
21,
22,
92,
93,
163,
164,
176,
177,
504,
505,
519,
520,
586,
587,
601,
602,
610,
611,
624,
625,
637,
638,
865,
866,
871,
872,
918,
919,
927,
928,
977,
978,
992,
993,
1039,
1040,
1073,
1074,
1179,
1180,
1185,
1186,
1343,
1344,
1352,
1353,
1523,
1524,
1538,
1539,
1702,
1703,
1722,
1723,
1798,
1799,
1804,
1805,
1883,
1884,
1892,
1893,
1938,
1939,
1953,
1954,
1975,
2021,
2175,
2185,
2339,
2386
],
"line_end_idx": [
21,
22,
92,
93,
163,
164,
176,
177,
504,
505,
519,
520,
586,
587,
601,
602,
610,
611,
624,
625,
637,
638,
865,
866,
871,
872,
918,
919,
927,
928,
977,
978,
992,
993,
1039,
1040,
1073,
1074,
1179,
1180,
1185,
1186,
1343,
1344,
1352,
1353,
1523,
1524,
1538,
1539,
1702,
1703,
1722,
1723,
1798,
1799,
1804,
1805,
1883,
1884,
1892,
1893,
1938,
1939,
1953,
1954,
1975,
2021,
2175,
2185,
2339,
2386,
2539
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2539,
"ccnet_original_nlines": 72,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.02309058979153633,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019538190215826035,
"rps_doc_frac_lines_end_with_ellipsis": 0.04109589010477066,
"rps_doc_frac_no_alph_words": 0.37477797269821167,
"rps_doc_frac_unique_words": 0.4942857027053833,
"rps_doc_mean_word_length": 5.628571510314941,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0.02664298005402088,
"rps_doc_unigram_entropy": 4.854478359222412,
"rps_doc_word_count": 350,
"rps_doc_frac_chars_dupe_10grams": 0.02842639945447445,
"rps_doc_frac_chars_dupe_5grams": 0.2472081184387207,
"rps_doc_frac_chars_dupe_6grams": 0.23197969794273376,
"rps_doc_frac_chars_dupe_7grams": 0.14974619448184967,
"rps_doc_frac_chars_dupe_8grams": 0.13401015102863312,
"rps_doc_frac_chars_dupe_9grams": 0.1248731017112732,
"rps_doc_frac_chars_top_2gram": 0.03908628970384598,
"rps_doc_frac_chars_top_3gram": 0.05583756044507027,
"rps_doc_frac_chars_top_4gram": 0.03857868164777756,
"rps_doc_books_importance": -193.31988525390625,
"rps_doc_books_importance_length_correction": -193.31988525390625,
"rps_doc_openwebtext_importance": -113.34297943115234,
"rps_doc_openwebtext_importance_length_correction": -113.34297943115234,
"rps_doc_wikipedia_importance": -67.53531646728516,
"rps_doc_wikipedia_importance_length_correction": -67.53531646728516
},
"fasttext": {
"dclm": 0.5897391438484192,
"english": 0.00256252009421587,
"fineweb_edu_approx": 2.4683914184570312,
"eai_general_math": 0.022445200011134148,
"eai_open_web_math": 0.6847370266914368,
"eai_web_code": 0.9261713624000549
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.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": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,842,975,030,509,929,000 |
Amit Merchant
Amit Merchant
A blog on PHP, JavaScript, and more
Strictly check for null and undefined values in TypeScript
In TypeScript, you assign types to variables and function parameters to catch type related errors early, even before you run the code. But TypeScript doesn’t warn you when you assign null and undefined to the variables of common types.
For instance, take the following example.
function appendDomain(url: string) {
return url.concat('.com');
}
console.log(appendDomain('amitmerchant'));
I’ve written this simple function in TypeScript that accepts its only parameter url which is of type string. Now, this will work fine if you compile it down to the JavaScript file providing I have the following tsconfig.json file setup.
{
"compilerOptions": {
"target": "esnext"
}
}
Now, if I change provide null instead of a valid string, compile and run the generated JS code, I would get the following error.
That’s because we passed an argument (null) for which JavaScript can not find concat method on it as it’s not a valid string. But TypeScript didn’t gave any type error because in TypeScript, null and undefined can be assigned to any type. So, the following is also perfectly fine as per TypeScript’s type checker.
let title: string;
title = 'Foo Bar';
title = null;
This can cause some serious issues if not handled properly.
This behavior can be fixed by adding a compiler option called strictNullChecks and set it to true in tsconfig.json like so.
{
"compilerOptions": {
"target": "esnext",
"strictNullChecks": true
}
}
Upon adding this option, TypeScript’s compiler will start showing typing errors because null and undefined are no longer valid values for any type. So, for the above example, it will show the following error.
Type 'null' is not assignable to type 'string'.
To fix our appendDomain function, we can add more types to the arguments to include null and undefined like so and checking if the provided value in the function is of type string explicitly like so.
function appendDomain(url: string | null | undefined) {
if (typeof url === 'string') {
return url.concat('.com');
}
return url;
}
console.log(appendDomain('amitmerchant'));
console.log(appendDomain(null));
console.log(appendDomain(undefined));
The function can now gracefully accepts null and undefined and returns values accordingly.
👋 Hi there! I'm Amit. I write articles about all things web development. If you like what I do and want me to continue doing the same, I'd like you consider leaving a tip. I'd highly appreciate that. Cheers!
Comments?
|
{
"url": "https://www.amitmerchant.com/strictly-check-null-undefined-typescript/",
"source_domain": "www.amitmerchant.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "71239",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BOUGUA6WBK6QZ6V7YU2HWBXOI4PZGAFI",
"WARC-Concurrent-To": "<urn:uuid:8ca233a6-359e-470b-9c4e-f7d214776958>",
"WARC-Date": "2023-09-26T19:01:48Z",
"WARC-IP-Address": "172.67.205.55",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:M775AV5V7SYGDOIJSTDJG6T24RH6X43R",
"WARC-Record-ID": "<urn:uuid:00f94ef9-41b9-48f7-8290-777a1ce9d6c2>",
"WARC-Target-URI": "https://www.amitmerchant.com/strictly-check-null-undefined-typescript/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:27937a39-4ac7-4e6b-8901-f48aa7156bda>"
},
"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-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,
14,
15,
29,
30,
66,
67,
126,
127,
363,
364,
406,
407,
444,
475,
477,
478,
521,
522,
759,
760,
762,
787,
814,
820,
822,
823,
952,
953,
1267,
1268,
1287,
1306,
1320,
1321,
1381,
1382,
1506,
1507,
1509,
1534,
1562,
1595,
1601,
1603,
1604,
1813,
1814,
1862,
1863,
2063,
2064,
2120,
2155,
2190,
2196,
2197,
2213,
2215,
2216,
2259,
2292,
2330,
2331,
2422,
2423,
2631,
2632
],
"line_end_idx": [
14,
15,
29,
30,
66,
67,
126,
127,
363,
364,
406,
407,
444,
475,
477,
478,
521,
522,
759,
760,
762,
787,
814,
820,
822,
823,
952,
953,
1267,
1268,
1287,
1306,
1320,
1321,
1381,
1382,
1506,
1507,
1509,
1534,
1562,
1595,
1601,
1603,
1604,
1813,
1814,
1862,
1863,
2063,
2064,
2120,
2155,
2190,
2196,
2197,
2213,
2215,
2216,
2259,
2292,
2330,
2331,
2422,
2423,
2631,
2632,
2641
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2641,
"ccnet_original_nlines": 67,
"rps_doc_curly_bracket": 0.005301020108163357,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3228200376033783,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022263450548052788,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23562152683734894,
"rps_doc_frac_unique_words": 0.48041775822639465,
"rps_doc_mean_word_length": 5.22715425491333,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.858635902404785,
"rps_doc_word_count": 383,
"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.02097902074456215,
"rps_doc_frac_chars_top_3gram": 0.04795204848051071,
"rps_doc_frac_chars_top_4gram": 0.013986010104417801,
"rps_doc_books_importance": -226.35372924804688,
"rps_doc_books_importance_length_correction": -226.35372924804688,
"rps_doc_openwebtext_importance": -157.10250854492188,
"rps_doc_openwebtext_importance_length_correction": -157.10250854492188,
"rps_doc_wikipedia_importance": -116.57776641845703,
"rps_doc_wikipedia_importance_length_correction": -116.57776641845703
},
"fasttext": {
"dclm": 0.8859707117080688,
"english": 0.7448107004165649,
"fineweb_edu_approx": 2.0926976203918457,
"eai_general_math": 0.9596951603889465,
"eai_open_web_math": 0.22485458850860596,
"eai_web_code": 0.9905510544776917
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.13322",
"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": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"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,325,761,516,489,755,000 |
嗨，老铁，欢迎来到我的博客！
如果觉得我的内容还不错的话，可以关注下我在 segmentfault.com 上的直播。我主要从事 PHP 和 Java 方面的开发，《深入 PHP 内核》作者之一。
[视频直播] PHP 进阶之路 - 亿级 pv 网站架构的技术细节与套路 直播中我将毫无保留的分享我这六年的全部工作经验和踩坑的故事，以及会穿插着一些面试中的 考点难点加分点
周梦康 发表于 2014-04-28 2875 次浏览 标签 : Android
流程如下：
1、先建立一个HttpPost连接
HttpPost httpPost = new HttpPost("http://mengkang.net/post_datas.php");
2、添加数据
ListnameValuePairs = new ArrayList(); nameValuePairs.add(new BasicNameValuePair("username","mengkang"));
3、发送
httpPost.setEntity(new UrlEncodedFormEntity(nameValuePairs,HTTP.UTF_8));
4、获取返回信息
httpResponse=new DefaultHttpClient().execute(httpPost);
具体代码如下
package httppost.pack;
import java.util.ArrayList;
import java.util.List;
import org.apache.http.HttpResponse;
import org.apache.http.NameValuePair;
import org.apache.http.client.entity.UrlEncodedFormEntity;
import org.apache.http.client.methods.HttpPost;
import org.apache.http.impl.client.DefaultHttpClient;
import org.apache.http.message.BasicNameValuePair;
import org.apache.http.protocol.HTTP;
import org.apache.http.util.EntityUtils;
import android.app.Activity;
import android.os.Bundle;
import android.widget.TextView;
public class AndroidHttpPost extends Activity {
/** Called when the activity is first created. */
String action="http://mengkang.net/android_post.php";
HttpPost httpRequest=null;
List <NameValuePair> params=null;
HttpResponse httpResponse;
TextView tv=null;
@Override
public void onCreate(Bundle savedInstanceState) {
super.onCreate(savedInstanceState);
setContentView(R.layout.main);
tv=(TextView)findViewById(R.id.textView1);
/*建立HttpPost连接*/
httpRequest=new HttpPost(action);
/*Post运作传送变数必须用NameValuePair[]阵列储存*/
params=new ArrayList<NameValuePair>();
params.add(new BasicNameValuePair("username","mengkang"));
try {
//发出HTTP request
httpRequest.setEntity(new UrlEncodedFormEntity(params,HTTP.UTF_8));
//取得HTTP response
httpResponse=new DefaultHttpClient().execute(httpRequest);
//若状态码为200
if(httpResponse.getStatusLine().getStatusCode()==200){
//取出回应字串
String strResult=EntityUtils.toString(httpResponse.getEntity());
tv.setText(strResult);
}else{
tv.setText("Error Response"+httpResponse.getStatusLine().toString());
}
} catch (Exception e) {
// TODO Auto-generated catch block
tv.setText(e.getMessage().toString());
}
}
}
别忘记了AndroidManifest.xml中加入如下配置：
<uses-permission android:name="android.permission.INTERNET" />
嗨，老铁，欢迎来到我的博客！
如果觉得我的内容还不错的话，可以关注下我在 segmentfault.com 上的直播。我主要从事 PHP 和 Java 方面的开发，《深入 PHP 内核》作者之一。
[视频直播] PHP 进阶之路 - 亿级 pv 网站架构的技术细节与套路 直播中我将毫无保留的分享我这六年的全部工作经验和踩坑的故事，以及会穿插着一些面试中的 考点难点加分点
评论列表
|
{
"url": "https://mengkang.net/154.html",
"source_domain": "mengkang.net",
"snapshot_id": "crawl=CC-MAIN-2019-39",
"warc_metadata": {
"Content-Length": "21928",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DSYLAQQA2UQK6VR34I5RS5CXFDYKZKNE",
"WARC-Concurrent-To": "<urn:uuid:ec9dba30-6c4b-45b4-8214-d0fcdd65f2ac>",
"WARC-Date": "2019-09-15T23:05:59Z",
"WARC-IP-Address": "203.195.188.207",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Z3S44Y42PUSGD4GZYF7HBUWYK2F3RFHP",
"WARC-Record-ID": "<urn:uuid:f14393f6-c915-4b5e-8417-8017d722ade0>",
"WARC-Target-URI": "https://mengkang.net/154.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6e3058a5-418b-4eea-ba3b-6071510d5ece>"
},
"warc_info": "isPartOf: CC-MAIN-2019-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-51.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,
15,
16,
100,
101,
189,
190,
231,
232,
238,
239,
257,
258,
331,
332,
339,
340,
446,
447,
452,
453,
527,
528,
537,
538,
594,
595,
602,
603,
627,
629,
658,
682,
684,
722,
761,
821,
870,
925,
977,
1016,
1058,
1060,
1090,
1117,
1150,
1152,
1201,
1256,
1315,
1347,
1386,
1418,
1441,
1456,
1511,
1556,
1596,
1648,
1674,
1717,
1763,
1811,
1879,
1889,
1904,
1934,
2015,
2046,
2118,
2142,
2210,
2236,
2318,
2358,
2378,
2465,
2480,
2513,
2561,
2613,
2624,
2631,
2633,
2634,
2666,
2667,
2731,
2732,
2747,
2748,
2832,
2833,
2921,
2922
],
"line_end_idx": [
15,
16,
100,
101,
189,
190,
231,
232,
238,
239,
257,
258,
331,
332,
339,
340,
446,
447,
452,
453,
527,
528,
537,
538,
594,
595,
602,
603,
627,
629,
658,
682,
684,
722,
761,
821,
870,
925,
977,
1016,
1058,
1060,
1090,
1117,
1150,
1152,
1201,
1256,
1315,
1347,
1386,
1418,
1441,
1456,
1511,
1556,
1596,
1648,
1674,
1717,
1763,
1811,
1879,
1889,
1904,
1934,
2015,
2046,
2118,
2142,
2210,
2236,
2318,
2358,
2378,
2465,
2480,
2513,
2561,
2613,
2624,
2631,
2633,
2634,
2666,
2667,
2731,
2732,
2747,
2748,
2832,
2833,
2921,
2922,
2926
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2926,
"ccnet_original_nlines": 94,
"rps_doc_curly_bracket": 0.004101159982383251,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.04315197095274925,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.031894929707050323,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5422138571739197,
"rps_doc_frac_unique_words": 0.7358490824699402,
"rps_doc_mean_word_length": 12.981132507324219,
"rps_doc_num_sentences": 79,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.570316314697266,
"rps_doc_word_count": 159,
"rps_doc_frac_chars_dupe_10grams": 0.1589147299528122,
"rps_doc_frac_chars_dupe_5grams": 0.1589147299528122,
"rps_doc_frac_chars_dupe_6grams": 0.1589147299528122,
"rps_doc_frac_chars_dupe_7grams": 0.1589147299528122,
"rps_doc_frac_chars_dupe_8grams": 0.1589147299528122,
"rps_doc_frac_chars_dupe_9grams": 0.1589147299528122,
"rps_doc_frac_chars_top_2gram": 0.033914729952812195,
"rps_doc_frac_chars_top_3gram": 0.04844960942864418,
"rps_doc_frac_chars_top_4gram": 0.05813952907919884,
"rps_doc_books_importance": -198.88059997558594,
"rps_doc_books_importance_length_correction": -198.88059997558594,
"rps_doc_openwebtext_importance": -138.51202392578125,
"rps_doc_openwebtext_importance_length_correction": -138.51202392578125,
"rps_doc_wikipedia_importance": -77.03291320800781,
"rps_doc_wikipedia_importance_length_correction": -77.03291320800781
},
"fasttext": {
"dclm": 0.9317598342895508,
"english": 0.07719040662050247,
"fineweb_edu_approx": 3.2095391750335693,
"eai_general_math": 0.06303519010543823,
"eai_open_web_math": 0.0068646701984107494,
"eai_web_code": 0.7635710835456848
}
}
|
{
"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": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"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
|
5,364,962,507,287,681,000 |
Pascal’s triangle
mathematics
Alternative Title: Yanghui triangle
Pascal’s triangle, in algebra, a triangular arrangement of numbers that gives the coefficients in the expansion of any binomial expression, such as (x + y)n. It is named for the 17th-century French mathematician Blaise Pascal, but it is far older. Chinese mathematician Jia Xian devised a triangular representation for the coefficients in the 11th century. His triangle was further studied and popularized by Chinese mathematician Yang Hui in the 13th century, for which reason in China it is often called the Yanghui triangle. It was included as an illustration in Chinese mathematician Zhu Shijie’s Siyuan yujian (1303; “Precious Mirror of Four Elements”), where it was already called the “Old Method.” The remarkable pattern of coefficients was also studied in the 11th century by Persian poet and astronomer Omar Khayyam.
• Chinese mathematician Jia Xian devised a triangular representation for the coefficients in an expansion of binomial expressions in the 11th century. His triangle was further studied and popularized by Chinese mathematician Yang Hui in the 13th century, for which reason in China it is often called the Yanghui triangle. It was included as an illustration in Zhu Shijie’s Siyuan yujian (1303; “Precious Mirror of Four Elements”), where it was already called the “Old Method.” The remarkable pattern of coefficients was also studied in the 11th century by Persian poet and astronomer Omar Khayyam. It was reinvented in 1665 by French mathematician Blaise Pascal in the West, where it is known as Pascal’s triangle.
Chinese mathematician Jia Xian devised a triangular representation for the coefficients in an …
By permission of the Syndics of Cambridge University Library
The triangle can be constructed by first placing a 1 (Chinese “—”) along the left and right edges. Then the triangle can be filled out from the top by adding together the two numbers just above to the left and right of each position in the triangle. Thus, the third row, in Hindu-Arabic numerals, is 1 2 1, the fourth row is 1 4 6 4 1, the fifth row is 1 5 10 10 5 1, and so forth. The first row, or just 1, gives the coefficient for the expansion of (x + y)0 = 1; the second row, or 1 1, gives the coefficients for (x + y)1 = x + y; the third row, or 1 2 1, gives the coefficients for (x + y)2 = x2 + 2xy + y2; and so forth.
The triangle displays many interesting patterns. For example, drawing parallel “shallow diagonals” and adding the numbers on each line together produces the Fibonacci numbers (1, 1, 2, 3, 5, 8, 13, 21,…,), which were first noted by the medieval Italian mathematician Leonardo Pisano (“Fibonacci”) in his Liber abaci (1202; “Book of the Abacus”).
• Adding the numbers along each “shallow diagonal” of Pascal’s triangle produces the Fibonacci sequence: 1, 1, 2, 3, 5,….
Adding the numbers along each “shallow diagonal” of Pascal’s triangle produces the …
Another interesting property of the triangle is that if all the positions containing odd numbers are shaded black and all the positions containing even numbers are shaded white, a fractal known as the Sierpinski gadget, after 20th-century Polish mathematician Wacław Sierpiński, will be formed.
• Polish mathematician Wacław Sierpiński described the fractal that bears his name in 1915, although the design as an art motif dates at least to 13th-century Italy. Begin with a solid equilateral triangle, and remove the triangle formed by connecting the midpoints of each side. The midpoints of the sides of the resulting three internal triangles can be connected to form three new triangles that can be removed to form nine smaller internal triangles. The process of cutting away triangular pieces continues indefinitely, producing a region with a Hausdorff dimension of a bit more than 1.5 (indicating that it is more than a one-dimensional figure but less than a two-dimensional figure).
Polish mathematician Wacław Sierpiński described the fractal that bears his name in …
Encyclopædia Britannica, Inc.
Learn More in these related articles:
Counting boards and markers, or counting rods, were used in China to solve systems of linear equations. This is an example from the 1st century ce.
East Asian mathematics: Theory of root extraction and equations
...to Jia Xian’s algorithm described above, another method developed for determining an nth root or finding the root of an equation of any degree, using the coefficients of what is now called Pascal’s...
Read This Article
Chinese mathematician Jia Xian devised a triangular representation for the coefficients in an expansion of binomial expressions in the 11th century. His triangle was further studied and popularized by Chinese mathematician Yang Hui in the 13th century, for which reason in China it is often called the Yanghui triangle. It was included as an illustration in Zhu Shijie’s Siyuan yujian (1303; “Precious Mirror of Four Elements”), where it was already called the “Old Method.” The remarkable pattern of coefficients was also studied in the 11th century by Persian poet and astronomer Omar Khayyam. It was reinvented in 1665 by French mathematician Blaise Pascal in the West, where it is known as Pascal’s triangle.
binomial theorem
...factorial) is the product of the first n natural numbers 1, 2, 3,…, n (and where 0! is defined as equal to 1). The coefficients may also be found in the array often called Pascal’s triangle...
Read This Article
algebra
branch of mathematics in which arithmetical operations and formal manipulations are applied to abstract symbols rather than specific numbers. The notion that there exists such a distinct subdisciplin...
Read This Article
Photograph
in Fibonacci numbers
The elements of the sequence of numbers 1, 1, 2, 3, 5, 8, 13, 21, …, each of which, after the second, is the sum of the two previous numbers. These numbers were first noted by...
Read This Article
Photograph
in mathematics
Mathematics, the science of structure, order, and relation that has evolved from counting, measuring, and describing the shapes of objects.
Read This Article
Photograph
in Blaise Pascal
French mathematician, physicist, religious philosopher, and author of Pensées and the “Provincial Letters.”
Read This Article
Art
in polygon
In geometry, any closed curve consisting of a set of line segments (sides) connected such that no two segments cross. The simplest polygons are triangles (three sides), quadrilaterals...
Read This Article
in set
In mathematics and logic, any collection of objects (elements), which may be mathematical (e.g., numbers, functions) or not. The intuitive idea of a set is probably even older...
Read This Article
Keep Exploring Britannica
Margaret Mead
education
discipline that is concerned with methods of teaching and learning in schools or school-like environments as opposed to various nonformal and informal means of socialization (e.g., rural development projects...
Read this Article
A Venn diagram represents the sets and subsets of different types of triangles. For example, the set of acute triangles contains the subset of equilateral triangles, because all equilateral triangles are acute. The set of isosceles triangles partly overlaps with that of acute triangles, because some, but not all, isosceles triangles are acute.
Mathematics
Take this mathematics quiz at encyclopedia britannica to test your knowledge on various mathematic principles.
Take this Quiz
Mária Telkes.
10 Women Scientists Who Should Be Famous (or More Famous)
Not counting well-known women science Nobelists like Marie Curie or individuals such as Jane Goodall, Rosalind Franklin, and Rachel Carson, whose names appear in textbooks and, from time to time, even...
Read this List
Zeno’s paradox, illustrated by Achilles’ racing a tortoise.
foundations of mathematics
the study of the logical and philosophical basis of mathematics, including whether the axioms of a given system ensure its completeness and its consistency. Because mathematics has served as a model for...
Read this Article
Encyclopaedia Britannica First Edition: Volume 2, Plate XCVI, Figure 1, Geometry, Proposition XIX, Diameter of the Earth from one Observation
Mathematics: Fact or Fiction?
Take this Mathematics True or False Quiz at Encyclopedia Britannica to test your knowledge of various mathematic principles.
Take this Quiz
Forensic anthropologist examining a human skull found in a mass grave in Bosnia and Herzegovina, 2005.
anthropology
“the science of humanity,” which studies human beings in aspects ranging from the biology and evolutionary history of Homo sapiens to the features of society and culture that decisively distinguish humans...
Read this Article
Equations written on blackboard
Numbers and Mathematics
Take this mathematics quiz at encyclopedia britannica to test your knowledge of math, measurement, and computation.
Take this Quiz
Table 1The normal-form table illustrates the concept of a saddlepoint, or entry, in a payoff matrix at which the expected gain of each participant (row or column) has the highest guaranteed payoff.
game theory
branch of applied mathematics that provides tools for analyzing situations in which parties, called players, make decisions that are interdependent. This interdependence causes each player to consider...
Read this Article
Figure 1: Relation between pH and composition for a number of commonly used buffer systems.
acid–base reaction
a type of chemical process typified by the exchange of one or more hydrogen ions, H +, between species that may be neutral (molecules, such as water, H 2 O; or acetic acid, CH 3 CO 2 H) or electrically...
Read this Article
Figure 1: The phenomenon of tunneling. Classically, a particle is bound in the central region C if its energy E is less than V0, but in quantum theory the particle may tunnel through the potential barrier and escape.
quantum mechanics
science dealing with the behaviour of matter and light on the atomic and subatomic scale. It attempts to describe and account for the properties of molecules and atoms and their constituents— electrons,...
Read this Article
Shell atomic modelIn the shell atomic model, electrons occupy different energy levels, or shells. The K and L shells are shown for a neon atom.
atom
smallest unit into which matter can be divided without the release of electrically charged particles. It also is the smallest unit of matter that has the characteristic properties of a chemical element....
Read this Article
The visible solar spectrum, ranging from the shortest visible wavelengths (violet light, at 400 nm) to the longest (red light, at 700 nm). Shown in the diagram are prominent Fraunhofer lines, representing wavelengths at which light is absorbed by elements present in the atmosphere of the Sun.
light
electromagnetic radiation that can be detected by the human eye. Electromagnetic radiation occurs over an extremely wide range of wavelengths, from gamma rays with wavelengths less than about 1 × 10 −11...
Read this Article
MEDIA FOR:
Pascal’s triangle
Previous
Next
Citation
• MLA
• APA
• Harvard
• Chicago
Email
You have successfully emailed this.
Error when sending the email. Try again later.
Edit Mode
Pascal’s triangle
Mathematics
Tips For Editing
We welcome suggested improvements to any of our articles. You can make it easier for us to review and, hopefully, publish your contribution by keeping a few points in mind.
1. Encyclopædia Britannica articles are written in a neutral objective tone for a general audience.
2. You may find it helpful to search within the site to see how similar or related subjects are covered.
3. Any text you add should be original, not copied from other sources.
4. At the bottom of the article, feel free to list any sources that support your changes, so that we can fully understand their context. (Internet URLs are the best.)
Your contribution may be further edited by our staff, and its publication is subject to our final approval. Unfortunately, our editorial approach may not be able to accommodate all contributions.
Thank You for Your Contribution!
Our editors will review what you've submitted, and if it meets our criteria, we'll add it to the article.
Please note that our editors may make some formatting changes or correct spelling or grammatical errors, and may also contact you if any clarifications are needed.
Uh Oh
There was a problem with your submission. Please try again later.
Email this page
×
|
{
"url": "https://www.britannica.com/topic/Pascals-triangle",
"source_domain": "www.britannica.com",
"snapshot_id": "crawl=CC-MAIN-2017-34",
"warc_metadata": {
"Content-Length": "126076",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:W3FOREMISFISLOGZS6J3PZGNWQYVGWHZ",
"WARC-Concurrent-To": "<urn:uuid:5a660d29-35bf-4072-973a-b331cfe08789>",
"WARC-Date": "2017-08-20T23:28:35Z",
"WARC-IP-Address": "38.69.47.80",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RZRG2X7RVYDWS4GXJJ7JRMMZGHFD5W2E",
"WARC-Record-ID": "<urn:uuid:0cb11465-84e8-4a17-8365-3aa56fbd44d1>",
"WARC-Target-URI": "https://www.britannica.com/topic/Pascals-triangle",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6a774fcc-d47a-49f5-8807-1a95567430d2>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-145-153-190.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-34\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for August 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
18,
19,
31,
67,
68,
894,
895,
1612,
1712,
1777,
1778,
2404,
2405,
2751,
2752,
2876,
2965,
2966,
3261,
3262,
3957,
4047,
4081,
4082,
4120,
4121,
4269,
4333,
4537,
4555,
5268,
5285,
5481,
5499,
5507,
5710,
5728,
5739,
5760,
5939,
5957,
5968,
5983,
6123,
6141,
6152,
6169,
6277,
6295,
6299,
6310,
6497,
6515,
6522,
6701,
6719,
6720,
6746,
6747,
6761,
6771,
6982,
7000,
7346,
7358,
7469,
7484,
7498,
7556,
7760,
7775,
7835,
7862,
8068,
8086,
8228,
8258,
8383,
8398,
8501,
8514,
8722,
8740,
8772,
8796,
8912,
8927,
9125,
9137,
9341,
9359,
9451,
9470,
9675,
9693,
9910,
9928,
10134,
10152,
10296,
10301,
10507,
10525,
10819,
10825,
11031,
11049,
11060,
11078,
11087,
11092,
11101,
11109,
11117,
11129,
11141,
11147,
11183,
11230,
11240,
11258,
11270,
11287,
11288,
11461,
11462,
11564,
11671,
11744,
11913,
11914,
12110,
12111,
12144,
12145,
12251,
12252,
12416,
12417,
12423,
12424,
12490,
12491,
12507
],
"line_end_idx": [
18,
19,
31,
67,
68,
894,
895,
1612,
1712,
1777,
1778,
2404,
2405,
2751,
2752,
2876,
2965,
2966,
3261,
3262,
3957,
4047,
4081,
4082,
4120,
4121,
4269,
4333,
4537,
4555,
5268,
5285,
5481,
5499,
5507,
5710,
5728,
5739,
5760,
5939,
5957,
5968,
5983,
6123,
6141,
6152,
6169,
6277,
6295,
6299,
6310,
6497,
6515,
6522,
6701,
6719,
6720,
6746,
6747,
6761,
6771,
6982,
7000,
7346,
7358,
7469,
7484,
7498,
7556,
7760,
7775,
7835,
7862,
8068,
8086,
8228,
8258,
8383,
8398,
8501,
8514,
8722,
8740,
8772,
8796,
8912,
8927,
9125,
9137,
9341,
9359,
9451,
9470,
9675,
9693,
9910,
9928,
10134,
10152,
10296,
10301,
10507,
10525,
10819,
10825,
11031,
11049,
11060,
11078,
11087,
11092,
11101,
11109,
11117,
11129,
11141,
11147,
11183,
11230,
11240,
11258,
11270,
11287,
11288,
11461,
11462,
11564,
11671,
11744,
11913,
11914,
12110,
12111,
12144,
12145,
12251,
12252,
12416,
12417,
12423,
12424,
12490,
12491,
12507,
12508
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 12508,
"ccnet_original_nlines": 144,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3643312156200409,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007643309887498617,
"rps_doc_frac_lines_end_with_ellipsis": 0.12413793057203293,
"rps_doc_frac_no_alph_words": 0.18174098432064056,
"rps_doc_frac_unique_words": 0.3707808554172516,
"rps_doc_mean_word_length": 5.0866498947143555,
"rps_doc_num_sentences": 106,
"rps_doc_symbol_to_word_ratio": 0.010191080160439014,
"rps_doc_unigram_entropy": 5.757418155670166,
"rps_doc_word_count": 1985,
"rps_doc_frac_chars_dupe_10grams": 0.21402396261692047,
"rps_doc_frac_chars_dupe_5grams": 0.24710309505462646,
"rps_doc_frac_chars_dupe_6grams": 0.23472319543361664,
"rps_doc_frac_chars_dupe_7grams": 0.2220461517572403,
"rps_doc_frac_chars_dupe_8grams": 0.2220461517572403,
"rps_doc_frac_chars_dupe_9grams": 0.21907496452331543,
"rps_doc_frac_chars_top_2gram": 0.008418340235948563,
"rps_doc_frac_chars_top_3gram": 0.0237694401293993,
"rps_doc_frac_chars_top_4gram": 0.009507769718766212,
"rps_doc_books_importance": -1034.195068359375,
"rps_doc_books_importance_length_correction": -1034.195068359375,
"rps_doc_openwebtext_importance": -719.1763305664062,
"rps_doc_openwebtext_importance_length_correction": -719.1763305664062,
"rps_doc_wikipedia_importance": -526.3745727539062,
"rps_doc_wikipedia_importance_length_correction": -526.3745727539062
},
"fasttext": {
"dclm": 0.08852291107177734,
"english": 0.9319152235984802,
"fineweb_edu_approx": 3.275472402572632,
"eai_general_math": 0.9387268424034119,
"eai_open_web_math": 0.6717067360877991,
"eai_web_code": 0.14116090536117554
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512.0",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"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": "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": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-433,051,443,684,761,200 |
akaros.cs.berkeley.edu Git - akaros.git/rss - kern/arch/x86/perfmon.h history http://akaros.cs.berkeley.edu/gitweb/?p=akaros.git;a=history;f=kern/arch/x86/perfmon.h Akaros en Barret Rhoden static/git-logo.png akaros.cs.berkeley.edu Git - akaros.git/rss - kern/arch/x86/perfmon.h history http://akaros.cs.berkeley.edu/gitweb/?p=akaros.git;a=history;f=kern/arch/x86/perfmon.h Sun, 24 Mar 2019 02:43:40 +0000 Sun, 24 Mar 2019 02:43:40 +0000 gitweb v.2.7.4/2.7.4 Treat tabs as having eight spaces instead of four Barret Rhoden <[email protected]> Tue, 12 Mar 2019 23:41:50 +0000 http://akaros.cs.berkeley.edu/gitweb/?p=akaros.git;a=commitdiff;h=e2e76c34b4eb027eec44bf0ab81523c4359aa6a3 http://akaros.cs.berkeley.edu/gitweb/?p=akaros.git;a=commitdiff;h=e2e76c34b4eb027eec44bf0ab81523c4359aa6a3 Treat tabs as having eight spaces instead of four Treat tabs as having eight spaces instead of four For whatever bad reason, we chose to treat tabs as four spaces instead of eight. e.g. in vim, tabstop=4. That's a huge pain - both when dealing with other tools and when switching between projects. I don't particularly like having per-project vim settings and whatnot. Plus, that's a bit harder for other people who look at our code and have their vim/emacs set to 8 space tabs. I had regretted that for a long time, but I didn't want to make the change for two reasons: 1) With other people working on the project, changes of this sort can lead to merge conflicts. Since I'm the only one working on it, for the most part, this isn't a concern. 2) The bigger reason is that major reformatting changes break git blame. However, there are tools that can ignore commits when running git blame. Chromium has git hyper-blame. I thought that feature ought to be baked into git, so I have a patchset out for git to do so. Either way, I'll either have my own patched git or the feature will get merged. In a future commit, I'll have instructions for how to use that feature. A lot of our files didn't need too much attention, due to our old "spaces for formatting" policy. I didn't change those to use tabs instead of spaces for the formatting either. I expect newer code will just do whatever people's editors do. I didn't want to change more lines than were needed, and the code looks the same either way. The biggest offenders were indented comments. Structs with column-aligned members needed some work too. I did most of that stuff manually, since the tools do a mediocre job. Since I was making changes, I also fixed up the switch-case indenting: don't do an extra level of indentation for the case keywords. Doing this now actually helped with the 8-space tab change, since switch statements got a few spaces to work with. A few of the kernel's C files were so badly messed up that I just used clang-format on them. Same for Plan 9 files that had been clang-formatted before and hadn't been heavily modified by us. Clang-format caused a few problems with its "alphabetized headers" policy. That was fun. Higher-quality (subjectively) code didn't need as much work as older, poorer code. Specifically, code with way too many levels of indentation looks even worse than before - that's actually a benefit of 8-space tabs: it tells you when your code is bad. A lot of that older code needs a more serious refactoring, which this commit does not do. Signed-off-by: Barret Rhoden <[email protected]>
• [D] kern/arch/x86/perfmon.h
]]>
perf: Use NMIs for sampling HW and VM TFs Barret Rhoden <[email protected]> Wed, 27 Jul 2016 22:25:08 +0000 http://akaros.cs.berkeley.edu/gitweb/?p=akaros.git;a=commitdiff;h=3adb611a34347bd66ded6e3422ac5442f6e6c607 http://akaros.cs.berkeley.edu/gitweb/?p=akaros.git;a=commitdiff;h=3adb611a34347bd66ded6e3422ac5442f6e6c607 perf: Use NMIs for sampling HW and VM TFs perf: Use NMIs for sampling HW and VM TFs Using NMIs allows us to sampling when interrupts are disabled. It's extremely useful. To limit the amount of code we run from NMI context, we only record the sample into a pre-allocated, per-cpu buffer. Keep in mind the NMI rules about writing and reading at the top of handle_nmi(). So NMIs record the backtrace, but don't emit the sample. We self_ipi() to trigger emitting the sample as soon as IRQs are reenabled. If IRQs were not disabled, this IRQ will hit as soon as the NMI returns. vmexits for an NMI will also record the PC of the guest, but not attempt a backtrace. Previously, we were probably trying to backtrace. Due to the x86 NMI blocking issues, we don't attempt to do anything that might fault from the vmexit NMI handler. NMIs are now used for both perf monitoring and the monitor "trace coretf". The monitor's trace command is still a little dangerous. This commit also just moves all of that mess into monitor.c. Signed-off-by: Barret Rhoden <[email protected]>
• [D] kern/arch/x86/perfmon.h
]]>
perf: Remove the kref from perfmon_session Barret Rhoden <[email protected]> Tue, 14 Jun 2016 19:16:14 +0000 http://akaros.cs.berkeley.edu/gitweb/?p=akaros.git;a=commitdiff;h=189f81d04f04d73f66b0a665056913bc3529827a http://akaros.cs.berkeley.edu/gitweb/?p=akaros.git;a=commitdiff;h=189f81d04f04d73f66b0a665056913bc3529827a perf: Remove the kref from perfmon_session perf: Remove the kref from perfmon_session The sessions are 1:1 with perfmon_contexts. The context in devarch is the way in which to access the session, so we don't need to do any reference counting. Note that perfmon_get_session() was never called - we had no use for it. Likewise, arch_free_perf_context() should never be called with 0. The one time it is called, the caller checks. Signed-off-by: Barret Rhoden <[email protected]>
• [D] kern/arch/x86/perfmon.h
]]>
perf: Clean up perf_{session,alloc} management Barret Rhoden <[email protected]> Tue, 14 Jun 2016 17:59:27 +0000 http://akaros.cs.berkeley.edu/gitweb/?p=akaros.git;a=commitdiff;h=b5e9fa4092747a3c4548a28e382bb34687c34aa3 http://akaros.cs.berkeley.edu/gitweb/?p=akaros.git;a=commitdiff;h=b5e9fa4092747a3c4548a28e382bb34687c34aa3 perf: Clean up perf_{session,alloc} management perf: Clean up perf_{session,alloc} management The big thing was the unnecessary kref on the alloc. Due to that, we had the weird alloc_get helper, which either got a ref or dropped it. We don't need any of that, and it confuses things. The one important thing is to use a qlock to avoid a deadlock. Deadlock is the likely reason for the kref in the first place, but it was just unnecessary. I cleaned up a couple other things: the dealloc funcs don't allow you to pass in 0. No one was doing it, and allowing it makes it seems like we wanted to have that be an option. perf_alloc_status was renamed. It had nothing to do with "struct perf_alloc". It was trying to get a new status (a.k.a. to alloc()). perfmon_install_session_alloc() was needlessly clever, and the errors() we throw now have real error messages. Signed-off-by: Barret Rhoden <[email protected]>
• [D] kern/arch/x86/perfmon.h
]]>
x86: Detect and handle missing perf support Barret Rhoden <[email protected]> Wed, 16 Dec 2015 22:14:36 +0000 http://akaros.cs.berkeley.edu/gitweb/?p=akaros.git;a=commitdiff;h=6577674d3c3c1e3ce19ff4e2e36e67c7b49543db http://akaros.cs.berkeley.edu/gitweb/?p=akaros.git;a=commitdiff;h=6577674d3c3c1e3ce19ff4e2e36e67c7b49543db x86: Detect and handle missing perf support x86: Detect and handle missing perf support If a machine has perf version 0, which is the case for my Qemu, we'll get a GPF during initialization. The per core initialization and any accesses to the Qperf file will abort if we don't have the right version. This assumes that if open of a Qperf fails, that there is no other way for the user to trigger access to the perf MSRs. Signed-off-by: Barret Rhoden <[email protected]>
• [D] kern/arch/x86/perfmon.h
]]>
Added perfmon interrupt handling to allow overflow based profiling Davide Libenzi <[email protected]> Mon, 16 Nov 2015 15:13:13 +0000 http://akaros.cs.berkeley.edu/gitweb/?p=akaros.git;a=commitdiff;h=72515d2a2c8abf6ce1dd882bb81c52878c1a6f4a http://akaros.cs.berkeley.edu/gitweb/?p=akaros.git;a=commitdiff;h=72515d2a2c8abf6ce1dd882bb81c52878c1a6f4a Added perfmon interrupt handling to allow overflow based profiling Added perfmon interrupt handling to allow overflow based profiling Added perfmon interrupt handling to allow overflow based profiling. This allow to set the INT bit in the Intel perfmon counter configuration, and, by setting an initial counter value close to the overflow, to sample code which triggers overflowing the most. Signed-off-by: Davide Libenzi <[email protected]> [checkpatch complaints] Signed-off-by: Barret Rhoden <[email protected]>
• [D] kern/arch/x86/perfmon.h
]]>
Migrated Akaros code to use pragma once (XCC) Davide Libenzi <[email protected]> Thu, 29 Oct 2015 13:22:45 +0000 http://akaros.cs.berkeley.edu/gitweb/?p=akaros.git;a=commitdiff;h=1ed63f9f8e25820f7eb217727d4ee88efe827d41 http://akaros.cs.berkeley.edu/gitweb/?p=akaros.git;a=commitdiff;h=1ed63f9f8e25820f7eb217727d4ee88efe827d41 Migrated Akaros code to use pragma once (XCC) Migrated Akaros code to use pragma once (XCC) Migrated Akaros code to use pragma once include file marker. Rebuild glibc. Signed-off-by: Davide Libenzi <[email protected]> [toolchain notice] Signed-off-by: Barret Rhoden <[email protected]>
• [D] kern/arch/x86/perfmon.h
]]>
Splits x86 into 32 and 64 bit (XCC) Barret Rhoden <[email protected]> Wed, 12 Jun 2013 00:38:00 +0000 http://akaros.cs.berkeley.edu/gitweb/?p=akaros.git;a=commitdiff;h=dd07360f0d867faaf7fc27ab08664eedd253ae9a http://akaros.cs.berkeley.edu/gitweb/?p=akaros.git;a=commitdiff;h=dd07360f0d867faaf7fc27ab08664eedd253ae9a Splits x86 into 32 and 64 bit (XCC) Splits x86 into 32 and 64 bit (XCC) No real change in functionality, just separating out the bit-specific items within the arch directory and build process. This builds and links in 64 bit mode, but doesn't actually do anything (like jump into longmode, etc).
• [D] kern/arch/x86/perfmon.h
]]>
Changes ARCH i686 -> x86 (XCC) Barret Rhoden <[email protected]> Fri, 7 Jun 2013 21:40:38 +0000 http://akaros.cs.berkeley.edu/gitweb/?p=akaros.git;a=commitdiff;h=7cf5489e9cd7a922e8b7902441cb9e8329af0e19 http://akaros.cs.berkeley.edu/gitweb/?p=akaros.git;a=commitdiff;h=7cf5489e9cd7a922e8b7902441cb9e8329af0e19 Changes ARCH i686 -> x86 (XCC) Changes ARCH i686 -> x86 (XCC) Remove the installation XCC content, and rebuild your cross compiler.
• [D] kern/arch/x86/perfmon.h
]]>
|
{
"url": "http://akaros.cs.berkeley.edu/gitweb/?p=akaros.git;a=rss;f=kern/arch/x86/perfmon.h",
"source_domain": "akaros.cs.berkeley.edu",
"snapshot_id": "crawl=CC-MAIN-2020-10",
"warc_metadata": {
"Content-Length": "16338",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:L7HWC7YLBII6U5FJMU6XTH6S4G47MQ2L",
"WARC-Concurrent-To": "<urn:uuid:e75a8a39-4344-468b-b737-6589e9266f4c>",
"WARC-Date": "2020-02-23T15:31:48Z",
"WARC-IP-Address": "146.148.59.222",
"WARC-Identified-Payload-Type": "application/rss+xml",
"WARC-Payload-Digest": "sha1:VG4SACO5NNDQDLDU27QZ2X5ZSFZQOCDA",
"WARC-Record-ID": "<urn:uuid:8011c64a-3553-4282-94d4-df46e5f801a8>",
"WARC-Target-URI": "http://akaros.cs.berkeley.edu/gitweb/?p=akaros.git;a=rss;f=kern/arch/x86/perfmon.h",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:07d5507f-b279-445a-bf0f-6cf7106fb321>"
},
"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-170.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,
3389,
3421,
3425,
4819,
4851,
4855,
5661,
5693,
5697,
6940,
6972,
6976,
7776,
7808,
7812,
8682,
8714,
8718,
9338,
9370,
9374,
9989,
10021,
10025,
10470,
10502
],
"line_end_idx": [
3389,
3421,
3425,
4819,
4851,
4855,
5661,
5693,
5697,
6940,
6972,
6976,
7776,
7808,
7812,
8682,
8714,
8718,
9338,
9370,
9374,
9989,
10021,
10025,
10470,
10502,
10505
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10505,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0.0005711599951609969,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2822834551334381,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022834649309515953,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3271653354167938,
"rps_doc_frac_unique_words": 0.37859779596328735,
"rps_doc_mean_word_length": 6.101844787597656,
"rps_doc_num_sentences": 234,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.670186519622803,
"rps_doc_word_count": 1355,
"rps_doc_frac_chars_dupe_10grams": 0.033744558691978455,
"rps_doc_frac_chars_dupe_5grams": 0.22544750571250916,
"rps_doc_frac_chars_dupe_6grams": 0.2048863172531128,
"rps_doc_frac_chars_dupe_7grams": 0.15662795305252075,
"rps_doc_frac_chars_dupe_8grams": 0.10413642972707748,
"rps_doc_frac_chars_dupe_9grams": 0.06724721938371658,
"rps_doc_frac_chars_top_2gram": 0.02177068032324314,
"rps_doc_frac_chars_top_3gram": 0.04910498112440109,
"rps_doc_frac_chars_top_4gram": 0.033865511417388916,
"rps_doc_books_importance": -835.7075805664062,
"rps_doc_books_importance_length_correction": -835.7075805664062,
"rps_doc_openwebtext_importance": -518.0126953125,
"rps_doc_openwebtext_importance_length_correction": -518.0126953125,
"rps_doc_wikipedia_importance": -452.8922424316406,
"rps_doc_wikipedia_importance_length_correction": -452.8922424316406
},
"fasttext": {
"dclm": 0.06867110729217529,
"english": 0.8391932845115662,
"fineweb_edu_approx": 1.5510876178741455,
"eai_general_math": 0.4033297896385193,
"eai_open_web_math": 0.29856300354003906,
"eai_web_code": 0.2481222152709961
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,304,340,481,567,743,000 |
Caelan Grgurovic Caelan Grgurovic - 1 year ago 61
Javascript Question
Username Length Verification jQuery
I am attempting to create jQuery form which is automatically updated every time the user clicks.
At the moment I am working on querying if the username is correct length; if it is not, it will make the input box outlined red.
This is my current code (which does not seem to function at all).
jQuery:
<script src="http://ajax.googleapis.com/ajax/libs/jquery/1.10.2/jquery.min.js"></script>
<script type="text/javascript">
jQuery(function($) {
$(document).click(function(e) {
if (!$(e.target).closest('#jq-user-getval').length) {
if ( $('#jq-user-getval').val() != '' ) {
if( $("#jq-user-getval").val() < 4) {
$("#jq-user-getval").addClass('border-force');
}
}
}
})
})
</script>
as you can see, I have made it so that when the user clicks away from the input box, it will check if the box is empty. If it is empty, it will check if the length is less than 4 characters, then it is supposed to add a class forcing the red outline. This is not working, however.
this is the HTML, I am unsure if the problem lies here or not:
<form action="" method="post">
<input id="jq-user-getval jq-user-class" type="text" name="username">
</form>
I am trying to replicate Microsoft's "Hotmail" registration form, if you can suggest any changes.
Answer Source
Your id value is incorrect. Technically, id cannot contain spaces. Change your <input /> to:
<input id="jq-user-getval" class="jq-user-class" type="text" name="username" />
The way you are using .val() < 4 is also wrong. You cannot compare like that with a string:
"hello" < 4; // This is meaningless.
"hello".length < 4; // You should use this.
Use .blur() function for this:
$(function () {
$("#jq-user-getval").blur(function () {
if (this.value.trim().length !== 0 && this.value.trim().length < 4)
$(this).addClass("border-force");
});
});
If you are dynamically loading the <input />, then you can delegate the event this way:
$(function () {
$(document).on("blur", "#jq-user-getval", function () {
if (this.value.trim().length !== 0 && this.value.trim().length < 4)
$(this).addClass("border-force");
});
});
I have added .trim() for extra security, like people might get away putting spaces.
There's no real reason for you to use the .click() function anywhere here. The clicking away really triggers blur event on the <input />.
|
{
"url": "https://codedump.io/share/U0BMLdGwZsbI/1/username-length-verification-jquery",
"source_domain": "codedump.io",
"snapshot_id": "crawl=CC-MAIN-2017-47",
"warc_metadata": {
"Content-Length": "43515",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VSWEV2APD3UBHDUEIFD4PPEIVRUGM2FL",
"WARC-Concurrent-To": "<urn:uuid:ff7bc00b-9dba-425c-a317-047f3fb6a895>",
"WARC-Date": "2017-11-24T13:16:43Z",
"WARC-IP-Address": "50.112.74.85",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FKYH2JWE2UZN3IK6AW2YUAHEM7E3BUZ6",
"WARC-Record-ID": "<urn:uuid:deac5c71-b16c-4966-8b6f-09aece4a2eff>",
"WARC-Target-URI": "https://codedump.io/share/U0BMLdGwZsbI/1/username-length-verification-jquery",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:939c5a8c-acbf-481d-a7e2-99bd87cc0737>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-30-31-153.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,
50,
70,
71,
107,
108,
205,
206,
335,
336,
402,
403,
411,
412,
501,
533,
554,
586,
640,
682,
720,
767,
769,
771,
773,
776,
779,
789,
790,
791,
1072,
1073,
1136,
1137,
1168,
1238,
1246,
1247,
1248,
1346,
1347,
1361,
1362,
1455,
1456,
1536,
1537,
1629,
1630,
1675,
1720,
1721,
1752,
1753,
1769,
1811,
1883,
1923,
1929,
1933,
1934,
2022,
2023,
2039,
2097,
2169,
2209,
2215,
2219,
2220,
2304,
2305
],
"line_end_idx": [
50,
70,
71,
107,
108,
205,
206,
335,
336,
402,
403,
411,
412,
501,
533,
554,
586,
640,
682,
720,
767,
769,
771,
773,
776,
779,
789,
790,
791,
1072,
1073,
1136,
1137,
1168,
1238,
1246,
1247,
1248,
1346,
1347,
1361,
1362,
1455,
1456,
1536,
1537,
1629,
1630,
1675,
1720,
1721,
1752,
1753,
1769,
1811,
1883,
1923,
1929,
1933,
1934,
2022,
2023,
2039,
2097,
2169,
2209,
2215,
2219,
2220,
2304,
2305,
2442
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2442,
"ccnet_original_nlines": 71,
"rps_doc_curly_bracket": 0.0073710097931325436,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2549019455909729,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011437909677624702,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.38725489377975464,
"rps_doc_frac_unique_words": 0.5179153084754944,
"rps_doc_mean_word_length": 5.501628875732422,
"rps_doc_num_sentences": 53,
"rps_doc_symbol_to_word_ratio": 0.009803920052945614,
"rps_doc_unigram_entropy": 4.702643871307373,
"rps_doc_word_count": 307,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09591473639011383,
"rps_doc_frac_chars_dupe_6grams": 0.07696861773729324,
"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.007104800082743168,
"rps_doc_frac_chars_top_3gram": 0.015393720008432865,
"rps_doc_frac_chars_top_4gram": 0.015393720008432865,
"rps_doc_books_importance": -298.8775634765625,
"rps_doc_books_importance_length_correction": -298.8775634765625,
"rps_doc_openwebtext_importance": -164.36412048339844,
"rps_doc_openwebtext_importance_length_correction": -164.36412048339844,
"rps_doc_wikipedia_importance": -107.4148178100586,
"rps_doc_wikipedia_importance_length_correction": -107.4148178100586
},
"fasttext": {
"dclm": 0.544191837310791,
"english": 0.6415615081787109,
"fineweb_edu_approx": 1.5747368335723877,
"eai_general_math": 0.6860052943229675,
"eai_open_web_math": 0.16508197784423828,
"eai_web_code": 0.9031299948692322
}
}
|
{
"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": "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": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,976,670,611,524,386,000 |
AlpineJS for Beginners
Updated January 1, 2021・9 minute read Post By tnylea#javascript #alpinejs #alpine #beginner
AlpineJS for Beginners
AlpineJS is a new javascript library/framework that focuses on simple javascript interactivity, and it does it really well. If you're looking for a JS framework with routing, state management, and a bit more complexity. Well then, Vue or React may be a better fit.
Instead, if you're looking to sprinkle a little javascript, add two-way data binding, and create simple components. Then, AlpineJS is the library you will want to reach for.
Alpine puts simplicity back into javascript. In this tutorial, I'm going to teach you the basics of using AlpineJS, so you can see how simple (and powerful) it is.
Install Alpine
Alpine can easily be installed on any website by including the CDN link on your page, like so:
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>Alpine JS</title>
</head>
<body>
<script src="https://cdn.jsdelivr.net/gh/alpinejs/[email protected]/dist/alpine.min.js" defer></script>
</body>
</html>
It's as simple as that. You can now use Alpine on your page.
You may also wish to include Alpine via NPM, which you can learn how to do from the Alpine Github repo.
Creating a component
Creating your first Alpine component is very simple. All you need to do is add the x-data attribute to any element like so:
<div x-data="{}"></div>
The example will create a new Alpine component with an empty object {} as its data. Of course, this component is pretty useless without any data, so let's create a new one with some data.
<div x-data="{ title: 'Hello Alpine' }">
<p x-text="title"></p>
</div>
As you can see from the code above, we have a data variable called title, and we are rendering that text out in a paragraph element using the x-text attribute. The x-text attribute (also referred to as a directive) will render the variable passed to it.
Checkout our latest product - the ultimate tailwindcss page creator 🚀
Here is a quick codepen example of our first AlpineJS component:
Now, our component doesn't do anything special at the moment. But, since we are utilizing Alpine, we can add some simple interactivity to our component. Let's first cover click events.
Click Events
We can use a new directive called x-on:click and execute some javascript when that element is clicked. Take a look at the code example below. We are changing our title variable when the user clicks the button.
<div x-data="{ title: 'Hello Alpine' }">
<p x-text="title"></p>
<button x-on:click="title='Alpine Rocks!'">click me</button>
</div>
You can also use a shorthand syntax for any x-on: event with the @ symbol. So our click directive can be changed to @click, like so:
<div x-data="{ title: 'Hello Alpine' }">
<p x-text="title"></p>
<button @click="title='Alpine Rocks!'">click me</button>
</div>
Take a look at the codepen below to view a live example of our new component:
Next, let's see how we can use everything we've learned so far about Alpine to create a simple counter component.
Create a Counter Component
We can easily create a counter component by declaring a count variable, like so:
<div x-data="{ count: 1 }">
<p x-text="count"></p>
</div>
You can see that we set the initial value to 0 for our counter. if we wanted to add a button to increment our counter, we can do so with the following code:
<div x-data="{ count: 1 }">
<p x-text="count"></p>
<button @click="count++">Count Up</button>
</div>
You may also want to add a button that will decrease the counter. Simple enough we can add another button that does the opposite of the other button:
<div x-data="{ count: 1 }">
<p x-text="count"></p>
<button @click="count++">Count Up</button>
<button @click="count--">Count Down</button>
</div>
Take a look at a live example of this component from the codepen below:
You can see that it's just that easy to create a counter in AlpineJS.
Now, we've used a few directives, such as the x-text and the x-on. There are currently 14 directives that we can use in our component to add functionality. Let's quickly cover those other directives.
AlpineJS Directives
Directives are attributes you can add to your elements to attach a specified behavior to that element. Below are the 14 directives you can use in your Alpine components to attach some behavior.
1. x-data - creates a new alpine component and allows you to add data to your component.
2. x-init - executes javascript code when the component is initialized—more info on this directive in the next section.
3. x-show - show or hide an element based on a true or false variable.
4. x-bind - set the value of an attribute based on a condition. example x-bind:disabled="isDisabled".
5. x-on - execute javascript based on a JS event listener. example: x-on:click="console.log('i got clicked')".
6. x-model - two-way data bind variable to element. Will keep both element and variable data in sync.
7. x-text - sets the innerText of an element equal to the variable data.
8. x-html - sets the innerHTML of an element equal to the specified variable data.
9. x-ref - This allows you to add a reference to this element to refer to it elsewhere.
10. x-if - If the condition is not met inside this directive, the element will be removed from the DOM and must be used inside a <template> tag.
11. x-for - Loops through an array of items and creates new nodes for each item in the array. Must also be used in a <template> tag.
12. x-transition - Directive for applying classes to the different stages of an element's transitions.
13. x-spread - This allows you to bind an object of an Alpine directive with an element for better re-usability.
14. x-cloak - Attribute used on an element to hide it from the DOM until the component is ready. Learn more about x-cloak from this article.
Those are the directives you can use inside of your AlpineJS components. Get to know most of them, and you will be an AlpineJS ninja 🥋.
Below, we are only going to cover the most useful directives. We have already covered the x-data and the x-on directive.
Next, let's learn about the x-init, x-show, x-model, x-html, x-ref, x-if, and x-for directives. Let's kick it off with the x-init directive.
AlpineJS x-init
The x-init directive will allow you to run some javascript code when a component is ready and initialized.
Here is a quick example of a small timer countdown component where we add a simple setInterval inside the x-init directive to count down our timer.
<div x-data="{ countdown: 60 }"
x-init="setInterval(function(){
countdown--;
}, 1000);
">
<h1 x-text="countdown"></h1>
</div>
You can check out an example of our timer countdown in the codepen below:
Anytime you need some code to be executed as soon as your component is ready, you can add that code to your x-init directive.
AlpineJS x-show directive
Next, if we want to show or hide an element optionally, we can use the x-show directive.
As an example say that we have a simple button that will toggle the visibility of another element. That can easily be accomplished with the following code:
<div x-data="{ show: false }">
<button @click="show=!show">Show</button>
<div x-show="show">Hello</div>
</div>
You can take a look at this simple example from the codepen below. Click the show button to toggle the display.
Pretty straight forward, right? In addition to the x-show directive, we can also add a simple transition to the element visibility.
Take a look at the same example. This time we'll add a transition to the directive x-show.transition="show", and we'll get a nice little transition when the element is toggled.
There are also some more advanced transitions you can use to customize the in-and-out transition effects. You can take a look at the official AlpineJS read me to learn more about the x-transition directives.
Next, let's add some two-way data-binding with the x-model directive.
AlpineJS x-model
The x-model directive will allow you to bind a variable to a form element such as a textbox. Here is a simple example of this:
<div x-data="{ title: 'AlpineJS is Awesome' }">
<p x-text="title"></p>
<input type="text" x-model="title">
</div>
As you can see, our textbox is bound to the variable title. Whenever you update the value of the variable or the text box's value, they will stay in sync. Take a look at the codepen example below.
Alpine really makes it easy to add some two-way data binding awesomeness.
Next, let's learn how we can add some dynamic HTML using the x-html directive.
AlpineJS x-html
Using the x-html directive, we can add some dynamic HTML inside any element.
Here is a quick example:
<div x-data="{ code: '<p>Dynamic Paragraph</p>' }">
<div x-html="code"></div>
</div>
You can see from the Codepen below that we inject a dynamic paragraph inside of the div element.
In addition to using the x-html directive, which will set the innerHTML of any element, we can also use the x-text directive to set the innerText of any element.
Next, we'll learn how we can easily use the x-ref directive to reference any element inside an Alpine component.
AlpineJS x-ref
The x-ref directive will allow us to reference any element with a specified name. Take the following component as an example:
<div x-data="{ code: '<p>Dynamic Paragraph</p>' }">
<div x-ref="sentence">I am a sentence</div>
<button @click="$refs.sentence.innerText = 'I just changed'">Change Sentence</button>
</div>
As you can see, when we click the button, we reference $refs.sentence, which will return the element with the x-ref="sentence".
Here is a quick codepen example of this component:
AlpineJS x-if
We can show or hide elements based on a conditional by using the x-if directive. Take a look at the following example:
<div x-data="{ socks: 'blue' }">
<template x-if="socks=='blue'">
<p>My socks are blue</p>
</template>
<template x-if="socks=='green'">
<p>My socks are green</p>
</template>
<button @click="socks = 'green'">Change Sox</button>
</div>
Using this directive will show or hide the specified element from the DOM. In the example above, we will display a paragraph if socks == 'blue' or show another paragraph if they are equal to green.
Here is a codepen example of this component below.
Note: remember that the x-if directive must be used inside <template> tags.
AlpineJS x-for
If we want to loop through an array of items inside of our Alpine component we can use the x-for directive. Take a look at the following code example, where we loop over a list of groceries:
<div x-data="{ groceries: ['Milk', 'Eggs', 'Cheese'] }">
<p>Groceries</p>
<ul>
<template x-for="item in groceries">
<li x-text="item"></li>
</template>
</ul>
</div>
As you can see from the codepen below, we are looping through the array of groceries and displaying each item in a list.
Conclusion
AlpineJS is a javascript framework/library that allows you to add interactive elements on your page easily. Be sure to check out the official Repo and Readme to learn all the ins-and-outs of this awesome library.
Pairing Alpine with Laravel Livewire is like putting Peanut Butter on your Jelly Sandwich. It makes creating applications so much better and easier. If you are not familiar with Livewire, click here to check out my introduction to Livewire video.
Happy Coding ✌️
🎁 One last thing. If you are interested in creating some beautiful pages with Alpine and TailwindCSS, be sure to check out Tails, the ultimate Alpine and Tailwind Drag'n Drop page builder 🛠
Still have a question?
Get help or discuss anything development/design related.
Start a discussion
|
{
"url": "https://devdojo.com/tnylea/alpinejs-for-beginners",
"source_domain": "devdojo.com",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "203271",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XMDIVEXIQWOYIFPZAX6B32HKUD6H3RDH",
"WARC-Concurrent-To": "<urn:uuid:ef92d1a4-b25e-4d41-818d-28c99d6f2443>",
"WARC-Date": "2021-01-17T02:45:28Z",
"WARC-IP-Address": "167.71.125.100",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JJ552PAOAMGG6STN2IROBAIB55QEEO2D",
"WARC-Record-ID": "<urn:uuid:212eabe7-c1b0-454e-80bf-40a00af08e7c>",
"WARC-Target-URI": "https://devdojo.com/tnylea/alpinejs-for-beginners",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:13d4a42c-d3c5-497e-bbcd-87871d00a385>"
},
"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-23.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,
23,
24,
116,
139,
140,
405,
406,
580,
581,
745,
746,
761,
762,
857,
858,
874,
891,
898,
925,
1000,
1029,
1037,
1044,
1045,
1149,
1157,
1165,
1166,
1227,
1228,
1332,
1333,
1354,
1355,
1479,
1480,
1504,
1505,
1693,
1694,
1735,
1762,
1769,
1770,
2024,
2025,
2095,
2096,
2161,
2162,
2347,
2348,
2361,
2362,
2572,
2573,
2614,
2641,
2706,
2713,
2714,
2847,
2848,
2889,
2916,
2977,
2984,
2985,
3063,
3064,
3178,
3179,
3206,
3207,
3288,
3289,
3317,
3344,
3351,
3352,
3509,
3510,
3538,
3565,
3612,
3619,
3620,
3770,
3771,
3799,
3826,
3873,
3922,
3929,
3930,
4002,
4003,
4073,
4074,
4274,
4275,
4295,
4296,
4490,
4491,
4582,
4704,
4777,
4881,
4994,
5098,
5173,
5258,
5348,
5495,
5630,
5735,
5850,
5993,
5994,
6130,
6131,
6252,
6253,
6394,
6395,
6411,
6412,
6519,
6520,
6668,
6669,
6701,
6738,
6767,
6790,
6806,
6839,
6846,
6847,
6921,
6922,
7048,
7049,
7075,
7076,
7165,
7166,
7322,
7323,
7354,
7400,
7435,
7442,
7443,
7555,
7556,
7688,
7689,
7866,
7867,
8075,
8076,
8146,
8147,
8164,
8165,
8292,
8293,
8341,
8368,
8408,
8415,
8416,
8613,
8614,
8688,
8689,
8768,
8769,
8785,
8786,
8863,
8864,
8889,
8890,
8942,
8972,
8979,
8980,
9077,
9078,
9240,
9241,
9354,
9355,
9370,
9371,
9497,
9498,
9550,
9598,
9688,
9695,
9696,
9824,
9825,
9876,
9877,
9891,
9892,
10011,
10012,
10045,
10081,
10114,
10130,
10167,
10201,
10217,
10274,
10281,
10282,
10480,
10481,
10532,
10533,
10609,
10610,
10625,
10626,
10817,
10818,
10875,
10896,
10905,
10950,
10986,
11006,
11016,
11023,
11024,
11145,
11146,
11157,
11158,
11371,
11372,
11619,
11620,
11636,
11637,
11827,
11828,
11851,
11852,
11909,
11910
],
"line_end_idx": [
23,
24,
116,
139,
140,
405,
406,
580,
581,
745,
746,
761,
762,
857,
858,
874,
891,
898,
925,
1000,
1029,
1037,
1044,
1045,
1149,
1157,
1165,
1166,
1227,
1228,
1332,
1333,
1354,
1355,
1479,
1480,
1504,
1505,
1693,
1694,
1735,
1762,
1769,
1770,
2024,
2025,
2095,
2096,
2161,
2162,
2347,
2348,
2361,
2362,
2572,
2573,
2614,
2641,
2706,
2713,
2714,
2847,
2848,
2889,
2916,
2977,
2984,
2985,
3063,
3064,
3178,
3179,
3206,
3207,
3288,
3289,
3317,
3344,
3351,
3352,
3509,
3510,
3538,
3565,
3612,
3619,
3620,
3770,
3771,
3799,
3826,
3873,
3922,
3929,
3930,
4002,
4003,
4073,
4074,
4274,
4275,
4295,
4296,
4490,
4491,
4582,
4704,
4777,
4881,
4994,
5098,
5173,
5258,
5348,
5495,
5630,
5735,
5850,
5993,
5994,
6130,
6131,
6252,
6253,
6394,
6395,
6411,
6412,
6519,
6520,
6668,
6669,
6701,
6738,
6767,
6790,
6806,
6839,
6846,
6847,
6921,
6922,
7048,
7049,
7075,
7076,
7165,
7166,
7322,
7323,
7354,
7400,
7435,
7442,
7443,
7555,
7556,
7688,
7689,
7866,
7867,
8075,
8076,
8146,
8147,
8164,
8165,
8292,
8293,
8341,
8368,
8408,
8415,
8416,
8613,
8614,
8688,
8689,
8768,
8769,
8785,
8786,
8863,
8864,
8889,
8890,
8942,
8972,
8979,
8980,
9077,
9078,
9240,
9241,
9354,
9355,
9370,
9371,
9497,
9498,
9550,
9598,
9688,
9695,
9696,
9824,
9825,
9876,
9877,
9891,
9892,
10011,
10012,
10045,
10081,
10114,
10130,
10167,
10201,
10217,
10274,
10281,
10282,
10480,
10481,
10532,
10533,
10609,
10610,
10625,
10626,
10817,
10818,
10875,
10896,
10905,
10950,
10986,
11006,
11016,
11023,
11024,
11145,
11146,
11157,
11158,
11371,
11372,
11619,
11620,
11636,
11637,
11827,
11828,
11851,
11852,
11909,
11910,
11928
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 11928,
"ccnet_original_nlines": 258,
"rps_doc_curly_bracket": 0.002682759892195463,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3845875561237335,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005426920019090176,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.256512314081192,
"rps_doc_frac_unique_words": 0.26327192783355713,
"rps_doc_mean_word_length": 4.773564338684082,
"rps_doc_num_sentences": 128,
"rps_doc_symbol_to_word_ratio": 0.0014471800532191992,
"rps_doc_unigram_entropy": 5.343893051147461,
"rps_doc_word_count": 1846,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.119950070977211,
"rps_doc_frac_chars_dupe_6grams": 0.08511120826005936,
"rps_doc_frac_chars_dupe_7grams": 0.05810258910059929,
"rps_doc_frac_chars_dupe_8grams": 0.02201543003320694,
"rps_doc_frac_chars_dupe_9grams": 0.012482980266213417,
"rps_doc_frac_chars_top_2gram": 0.012936900369822979,
"rps_doc_frac_chars_top_3gram": 0.009192010387778282,
"rps_doc_frac_chars_top_4gram": 0.011234680190682411,
"rps_doc_books_importance": -1328.1707763671875,
"rps_doc_books_importance_length_correction": -1328.1707763671875,
"rps_doc_openwebtext_importance": -709.2692260742188,
"rps_doc_openwebtext_importance_length_correction": -709.2692260742188,
"rps_doc_wikipedia_importance": -521.2159423828125,
"rps_doc_wikipedia_importance_length_correction": -521.2159423828125
},
"fasttext": {
"dclm": 0.526595413684845,
"english": 0.8137813806533813,
"fineweb_edu_approx": 2.4038267135620117,
"eai_general_math": 0.6769957542419434,
"eai_open_web_math": 0.2537354826927185,
"eai_web_code": 0.9111253619194031
}
}
|
{
"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": "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": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
428,088,456,950,488,500 |
What is 302% of 59?
302 percent of 59 is equal to 178.18
%
302% of 59 equal to 178.18
Calculation steps:
( 302 ÷ 100 ) x 59 = 178.18
Advertisement
Calculate 302 Percent of 59?
• F
Formula
(302 ÷ 100) x 59 = 178.18
• 1
Percent to decimal
302% to decimal is 302 ÷ 100 = 3.02
• 2
Multiply decimal with the other number
3.02 x 59 = 178.18
Example
Advertisement
|
{
"url": "https://calcforme.com/percentage-calculator/what-is-302-percent-of-59",
"source_domain": "calcforme.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "15778",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MRCAVRAD5CFROCKTQU4ZMWL57SXA4NAQ",
"WARC-Concurrent-To": "<urn:uuid:04609cab-4d19-454a-9d42-eb8c64f28bc4>",
"WARC-Date": "2024-02-28T21:36:35Z",
"WARC-IP-Address": "76.76.21.61",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3LSWKS6C3NTNZR7WYWPIM5GDA56TUTQL",
"WARC-Record-ID": "<urn:uuid:a71269bf-9bd2-4427-8eb9-58d90e4b20b4>",
"WARC-Target-URI": "https://calcforme.com/percentage-calculator/what-is-302-percent-of-59",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:539a24cb-b818-4c9a-ad96-9bab22522be2>"
},
"warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-229\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
20,
21,
58,
59,
61,
62,
89,
90,
109,
110,
138,
139,
153,
154,
183,
184,
190,
191,
203,
204,
234,
235,
241,
242,
265,
266,
306,
307,
313,
314,
357,
358,
381,
382,
390,
391
],
"line_end_idx": [
20,
21,
58,
59,
61,
62,
89,
90,
109,
110,
138,
139,
153,
154,
183,
184,
190,
191,
203,
204,
234,
235,
241,
242,
265,
266,
306,
307,
313,
314,
357,
358,
381,
382,
390,
391,
404
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 404,
"ccnet_original_nlines": 36,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1734693944454193,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010204079560935497,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6326530575752258,
"rps_doc_frac_unique_words": 0.4057970941066742,
"rps_doc_mean_word_length": 3.7536232471466064,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.051088809967041,
"rps_doc_word_count": 69,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.11583012342453003,
"rps_doc_frac_chars_dupe_6grams": 0.11583012342453003,
"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.0617760606110096,
"rps_doc_frac_chars_top_3gram": 0.0810810774564743,
"rps_doc_frac_chars_top_4gram": 0.10810811072587967,
"rps_doc_books_importance": -24.732681274414062,
"rps_doc_books_importance_length_correction": -24.732681274414062,
"rps_doc_openwebtext_importance": -6.957403182983398,
"rps_doc_openwebtext_importance_length_correction": -6.957404136657715,
"rps_doc_wikipedia_importance": -14.341875076293945,
"rps_doc_wikipedia_importance_length_correction": -14.341876029968262
},
"fasttext": {
"dclm": 0.8797959685325623,
"english": 0.7064370512962341,
"fineweb_edu_approx": 3.3055543899536133,
"eai_general_math": 0.7196172475814819,
"eai_open_web_math": 0.8852725625038147,
"eai_web_code": 0.00006294000195339322
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "513.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry"
}
},
"secondary": {
"code": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v1": {
"primary": {
"code": "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": "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,757,388,917,374,988,000 |
Pull to refresh
Software renderer — 1: матчасть
Reading time 29 min
Views 80K
Programming *Game development *
Sandbox
Программный рендеринг (software rendering) — это процесс построения изображения без помощи GPU. Этот процесс может идти в одном из двух режимов: в реальном времени (вычисление большого числа кадров в секунду — необходимо для интерактивных приложений, например, игр) и в «оффлайн» режиме (при котором время, которое может быть потрачено на вычисление одного кадра, не ограничено настолько строго — вычисления могут длиться часы или даже дни). Я буду рассматривать только режим рендеринга в реальном времени.
У этого подхода существуют как недостатки так и достоинства. Очевидным недостатком является производительность — CPU не в состоянии конкурировать с современными видеокартами в этой области. К достоинствам стоит причислить независимость от видеокарты — именно поэтому он используется как замена аппаратного рендеринга в случаях, когда видеокарта не поддерживает ту или иную возможность (так называемый software fallback). Существуют и проекты, цель которых — полностью заменить аппаратный рендеринг программным, например, WARP, входящий в состав Direct3D 11.
Но главным плюсом является возможность написания подобного рендерера самостоятельно. Это служит образовательным целям и, на мой взгляд, это — самый лучший способ понять лежащие в основе алгоритмы и принципы.
Это именно то, о чем будет рассказано в серии этих статей. Мы начнем с возможности закрашивать пиксель в окне заданным цветом и построим на этом возможность отрисовки трехмерной сцены в реальном времени, с движущимися текстурированными моделями и освещением, а так же с возможностью перемещаться по этой сцене.
Но для того, чтобы вывести на экран хотя бы первый полигон, необходимо освоить математику, на которой это построено. Первая часть будет посвящена именно ей, поэтому в ней будет много различных матриц и прочей геометрии.
В конце статьи будет ссылка на гитхаб проекта, который можно рассматривать как пример реализации.
Несмотря на то, что статья будет описывать самые основы, читателю все же необходим определенный фундамент для ее понимания. Этот фундамент: основы тригонометрии и геометрии, понимание декартовых систем координат и базовые операции над векторами. Так же, хорошей идеей будет прочтение какой-либо статьи об основах линейной алгебры для разработчиков игр (например, этой), поскольку я буду пропускать описания некоторых операций и останавливаться только на самых, с моей точки зрения, важных. Я постараюсь показать, при помощи чего делается вывод некоторых важных формул, но не буду расписывать их детально — полные доказательства можно сделать самому или найти в соответствующей литературе. По ходу статьи я сначала постараюсь давать алгебраические определения того или иного понятия, а затем уже описывать их геометрическую интерпретацию. Большая часть примеров будет в двухмерном пространстве, поскольку мои навыки рисования трехмерных и, тем более, четырехмерных пространств оставляют желать лучшего. Тем не менее, все примеры легко обобщаются на пространства других размерностей. Все статьи будут в большей степени ориентированы на описание алгоритмов, а не на их реализацию в коде.
Вектора
Вектор — одно из ключевых понятий в трехмерной графике. И хотя линейная алгебра дает ему очень абстрактное определение, в рамках наших задач под n-мерным вектором мы можем понимать просто массив из n действительных чисел: элемент пространства Rn:
Интерпретация этих чисел зависит от контекста. Две самые частые: эти числа задают координаты точки в пространстве или же направленное смещение. Несмотря на то, что их представление одинаково (n действительных чисел), их концепции различаются — точка описывает положение в системе координат, а смещение не имеет положения как такового. В дальнейшем, мы так же можем определять точку с помощью смещения, подразумевая, что смещение происходит от начала координат.
Как правило, в большинстве игровых и графических движков присутствует класс вектора именно как набора чисел. Смысл же этих чисел зависит от контекста, в котором они используются. В этом классе определены методы как для работы с геометрическими векторами (например, вычисление векторного произведения) так и с точками (например, вычисление расстояния между двумя точками).
Во избежание путаницы, в рамках статьи мы не будем больше понимать под словом «вектор» абстрактный набор чисел, а будем так называть смещение.
Скалярное произведение
Единственная операция над векторами, на которой я хочу остановиться подробно (ввиду ее фундаментальности) — это скалярное произведение. Как ясно из названия, результат этого произведения — скаляр, и определяется он по следующей формуле:
У скалярного произведения есть две важные геометрические интерпретации.
1. Измерение угла между векторами.
Рассмотрим следующий треугольник, полученный из трех векторов:
Записав для него теорему косинусов и сократив выражение, придем к записи:
Поскольку длина ненулевого вектора по определению больше 0, то косинус угла определяет знак скалярного произведения и его равенство нулю. Получаем (считая, что угол от 0 до 360 градусов):
2. Скалярное произведение вычисляет длину проекции вектора на вектор.
Из определения косинуса угла получаем:
Мы так же уже знаем из предыдущего пункта, что:
Выразив из второго выражения косинус угла, подставив в первое и домножив на ||w||, получаем результат:
Таким образом, скалярное произведение двух векторов равно длине проекции вектора v на вектор w, умноженное на длину вектора w. Часто встречающийся частный случай этой формулы — w имеет единичную длину и, следовательно, скалярное произведение вычисляет точную длину проекции.
Эта интерпретация очень важна, поскольку она показывает, что скалярное произведение вычисляет координаты точки (заданной вектором v, подразумевая смещение от начала координат) вдоль заданной оси. Самый простой пример:
Мы в дальнейшем воспользуемся этим при построении трансформации в систему координат камеры.
Системы координат
Этот раздел призван подготовить основу для введения матриц. Я, на примере мировой и локальной систем, покажу, по каким причинам используются несколько систем координат, а не одна, и о том, как описать одну систему координат относительно другой.
Представим, что у нас возникла необходимость в отрисовке сцены с двумя моделями, например:
Какие системы координат естественным образом вытекают из такой постановки? Первая — это система координат самой сцены (которая изображена на рисунке). Это система координат, описывающая мир, который мы собираемся рисовать — именно поэтому она и называется «мировой» (на картинках будет обозначена словом «world»). Она «связывает» все объекты сцены вместе. Например, координаты центра объекта A в этой система координат — (1, 1), а координаты центра объекта B(-1, -1).
Таким образом, одна система координат уже есть. Теперь необходимо подумать о том, в каком виде к нам приходят модели, которые мы будем использовать в сцене.
Для простоты будем считать, что модель описывается просто списком точек («вершин») из которых она состоит. Например, модель B состоит из трех точек, которые приходят нам в следующем формате:
v0 = (x0, y0)
v1 = (x1, y1)
v2 = (x2, y2)
На первый взгляд, было бы здорово, если бы они уже были описаны в нужной нам «мировой» системе! Представляете, вы добавляете модель на сцену, а она уже находится там, где нам и нужно. Для модели B это могло бы выглядеть вот так:
v0 = (-1.5, -1.5)
v1 = (-1.0, -0.5)
v2 = (-0.5, -1.5)
Но использовать такой подход не выйдет. На то есть важная причина: это лишает возможности использовать одну и ту же модель заново в разных сценах. Представьте, что вам дали модель B, которая была смоделирована так, что при добавлении ее на сцену она оказывается в нужном нам месте, как в примере выше. Затем, внезапно, требование изменилось — мы хотим ее сдвинуть совсем на другую позицию. Получается, человеку, который создал эту модель, придется двигать ее самостоятельно и затем опять отдавать вам. Конечно, это — полный абсурд. Еще более сильный аргумент это то, что в случае с интерактивными приложениями, модель может двигаться, поворачиваться, анимироваться на сцене — что же, художнику делать модель во всех возможных положениях? Это звучит еще более глупо.
Решение этой проблемы — «локальная» система координат модели. Мы моделируем объект таким образом, чтобы его центр (или то, что можно условно за таковой принять) был расположен в начале координат. Затем мы программно ориентируем (перемещаем, поворачиваем и т.д.) локальную систему координат объекта в нужное нам положение в мировой системе. Возвращаясь к сцене выше, объект A (единичный квадрат, повернутый на 45 градусов по часовой стрелке) может быть смоделирован следующим образом:
Описание модели в этом случае будет выглядеть следующим образом:
v0 = (-0.5, 0.5)
v1 = (0.5, 0.5)
v2 = (0.5, -0.5)
v3 = (-0.5, -0.5)
И, соответственно, положение в сцене двух систем координат — мировой и локальной объекта A:
Это — один из примеров, почему наличие нескольких систем координат упрощает жизнь разработчикам (и художникам!). Есть еще и другая причина — переход к другой системе координат может упростить необходимые вычисления.
Описание одной системы координат относительно другой
Не существует такого понятия как «абсолютные координаты». Описание чего-либо всегда происходит относительно какой-то системы координат. В том числе и описание другой системы координат.
Мы можем построить своеобразную иерархию систем координат в примере выше:
- world space
- local space (object A)
- local space (object B)
В нашем случае эта иерархия очень проста, но в реальных ситуациях она может иметь гораздо более сильное ветвление. Например, у локальной системы координат объекта могут быть дочерние системы отвечающие за положение той или иной части тела.
Каждая дочерняя система координат может быть описана относительно родительской при помощи следующих значений:
• точка начала координат дочерней системы относительно родительской
• координаты базисных векторов дочерней системы относительно родительской
Например, в картинке ниже, начало координат системы x'y' (обозначенное как O') расположено в точке (1, 1), а координаты ее базисных векторов i' и j' равны (0.7, -0.7) и (0.7, 0.7) соответственно (что приблизительно соответствует осям, повернутым на 45 градусов по часовой стрелке).
Нам не нужно описывать мировую систему координат относительно какой-либо другой, потому что мировая система — корень иерархии, нас не волнует где она расположена или как она ориентирована. Поэтому для ее описания мы используем стандартный базис:
Перевод координат точек из одной системы в другую
Координаты точки P в родительской системе координат (обозначим как Pparent) могут быть вычислены при помощи координат этой точки в дочерней системе (обозначим как Pchild) и ориентации этой дочерней системы относительно родительской (описаной с помощью начала координат Ochild и базисных векторов i' и j') следующим образом:
Снова вернемся к примеру сцены выше. Мы сориентировали локальную систему координат объекта A относительно мировой:
Как мы уже знаем, в процессе отрисовки нам необходимо будет перевести координаты вершин объекта из локальной системы координат в мировую. Для этого нам необходимо описание локальной системы координат относительно мировой. Выглядит оно следующим образом: начало координат в точке (1, 1), а координаты базисных векторов равны (0.7, -0.7) и (0.7, 0.7) (способ расчета координат базисных векторов после поворота будет описан позже, пока что нам достаточно результата).
Для примера возьмем первую вершину v = (-0.5, 0.5) и вычислим ее координаты в мировой системе:
В верности результата можно убедиться, посмотрев на изображение выше.
Матрицы
Матрица размерности m x n — соответствующей размерности таблица чисел. Если количество столбцов в матрице равно количеству строк, то матрица называется квадратной. Например, матрица 3 x 3 выглядит следующим образом:
Перемножение матриц
Предположим, что у нас есть две матрицы: M (размерностью a x b) и N (размерностью c x d). Выражение R = M · N определено только в том случае, если количество столбцов в матрице M равно числу строк в матрице N (т.е. b = c). Размерность полученной матрицы будет равна a x d (т.е. количество строк равно кол-ву строк M а число столбцов — числу столбцов в N), а значение, находящееся на позиции ij, вычисляется как скалярное произведение i-й строки M на j-й столбец N:
Если результат умножения двух матриц M · N определен, то это вовсе не значит, что определено и умножение в обратную сторону — N · M (могут не совпадать кол-во строк и столбцов). В общем случае, операция умножения матриц так же не коммутативна: M · N ≠ N · M.
Единичная матрица — это матрица, которая не изменяет домноженную на нее другую матрицу (т.е. M · I = M) — своеобразный аналог единицы для обычных чисел:
Представление векторов в виде матриц
Мы так же можем представить вектор как матрицу. Есть два возможных способа это сделать, которые называют ''вектор-строка'' и ''вектор-столбец''. Как понятно из название, вектор-строка — это вектор, представленный в виде матрицы с одной строкой, а вектор-столбец — вектор, представленный в виде матрицы с одним столбцом.
Вектор-строка:
Вектор-столбец:
Далее мы очень часто будем сталкиваться с операцией умножения матрицы на вектор (для чего — будет обьяснено в следущем разделе), и, забегая вперед, матрицы с которыми мы будем работать будут иметь размерность либо 3 x 3 либо 4 x 4.
Рассмотрим, каким способом мы можем умножить трехмерный вектор на матрицу 3 x 3 (аналогичные рассуждения применяются для других размерностей). Согласно определению, две матрицы могут быть перемножены, если количество столбцов первой матрицы равняется количеству строк второй. Таким образом, поскольку мы можем представить вектор и как матрицу 1 x 3 (вектор-строка) и как матрицу 3 x 1 (вектор-столбец), мы получаем два возможных варианта:
• Умножение вектора на матрицу «слева»:
• Умножение вектора на матрицу «справа»:
Как видно, мы получаем разный результат в каждом из случаев. Это может привести к случайным ошибкам, если API позволяет умножать вектор на матрицу с обоих сторон, поскольку, как мы увидим в дальнейшем, матрица трансформации подразумевает что вектор будет умножен на нее одним из двух способов. Так что, по моему мнению, в API лучше придерживаться только одного из двух вариантов. В рамках этих статей я буду использовать первый вариант — т.е. вектор умножается на матрицу слева. Если вы решили использовать другой порядок, то, для того чтобы получить корректные результаты, вам нужно будет транспонировать все матрицы, которые в дальнейшем встретятся в этой статье, а слово «строка» заменить на «столбец». Это так же влияет на порядок умножения матриц при наличии нескольких трансформаций (подробнее будет рассмотрено далее).
Из результата умножения так же видно, что матрица определенным образом (зависящем от значения ее элементов) изменяет вектор, который был на нее домножен. Это могут быть такие трансформации как поворот, масштабирование и другие.
Еще одно крайне важное свойство операции умножения матриц, которое нам в дальнейшем пригодится — дистрибутивность относительно сложения:
Геометрическая интерпретация
Как мы увидели в предыдущем разделе — матрица определенным образом трансформирует домноженный на нее вектор.
Еще раз вспомним, что любой вектор может быть представлен как линейная комбинация базисных векторов:
Умножим это выражение на матрицу:
Используя дистрибутивность относительно сложения, получим:
Мы уже видели подобное ранее, когда рассматривали, как перевести координаты точки из дочерней системы в родительскую, тогда это выглядело следующим образом (для трехмерного пространства):
Между этими двумя выражениями есть два различия — в первом выражении нет перемещения (Ochild, мы рассмотрим позже этот момент подробнее, когда будем говорить о линейных и афинных трансформациях), а вектора i', j' и k' заменены на iM, jM и kM соответственно. Следовательно, iM, jM и kM — есть базисные вектора дочерней системы координат и мы переводим точку vchild(vx, vy, vy) из этой дочерней системы координат в родительскую (vtransformed = vparentM).
Процесс трансформации можно изобразить следующим образом на примере вращения против часовой стрелки (xy — изначальная, родительская система координат, x'y' — дочерняя, полученная в результате трансформации):
На всякий случай, чтобы убедиться, что нам понятен смысл каждого из векторов, используемых выше, перечислим их заново:
• vparent — вектор, который мы изначально умножали на матрицу M. Его координаты описаны относительно родительской системы координат
• vchild — вектор, координаты которого равны вектору vparent, но они описаны относительно дочерней системы координат. Это вектор vparent трансформированный тем же образом, что и базисные вектора (поскольку мы используем те же координаты)
• vtransformed — тот же самый вектор, что и vchild но с координатами пересчитанными относительно родительской системы координат. Это итоговый результат трансформации вектора vparent
Теперь рассмотрим, что происходит при умножении базисных векторов на матрицу M:
Видно, что базисные вектора новой дочерней системы координат, полученной в результате умножения на матрицу M, совпадают со строками матрицы. Это и есть та самая геометрическая интерпретация, которую мы искали. Теперь, увидев матрицу трансформации, мы будем знать куда смотреть, чтобы понять что она делает — достаточно представить ее строки как базисные вектора новой системы координат. Трансформация, происходящая с системой координат, будет та же что и трансформация, происходящая с вектором, домноженным на эту матрицу.
Мы так же можем комбинировать трансформации, представленные в виде матриц, при помощи умножения их друг на друга:
Таким образом, матрицы представляют собой очень удобный инструмент для описания и комбинирования трансформаций.
Линейные трансформации
Для начала рассмотрим самые часто используемые линейные трансформации. Линейная трансформация — это трансформация, которая удовлетворяет двум свойствам:
Важное следствие — линейная трансформация не может содержать перемещения (это так же является причиной, по которой слагаемое Ochild отсутствовало в предыдущем разделе), поскольку, согласно второй формуле, 0 всегда отображается в 0.
Вращение
Рассмотрим вращение в двумерном пространстве. Это трансформация, которая поварачивает систему координат на заданный угол. Как мы уже знаем, нам достаточно вычислить новые координатные оси (полученные после вращения на заданный угол), и использовать их как строки матрицы трансформации. Результат легко получается из базовой геометрии:
Пример:
Результат для вращения в трехмерном пространстве получается аналогичным образом, с той лишь разницей что мы вращаем плоскость составленную из двух координатных осей, и фиксируем третью (вокруг которой и происходит вращение). Например, матрица вращения вокруг оси x выглядит следующим образом:
Масштабирование
Мы можем изменить масштаб объекта относительно всех осей применив следующую матрицу:
Оси трансформированной системы координат будут направлены так же, как и у изначальной системы координат, но будут требовать в S раз большей длины для одной единицы измерения:
Пример:
Масштабирование с одинаковым коэффициентом относительно всех осей называется равномерным (uniform). Но мы так же можем произвести масштабирование с разными коэффициентами вдоль разных осей (nonuniform):
Сдвиг
Как понятно из названия, эта трансформация производит сдвиг вдоль координатной оси, оставляя остальные оси нетронутыми:
Соответственно, матрица сдвига оси y выглядит следующим образом:
Пример:
Матрица для трехмерного пространства строится аналогичным образом. Например, вариант для сдвига оси x:
Несмотря на то, что эта трансформация используется очень редко, она пригодится нам в будущем, когда мы будем рассматривать афинные трансформации.
В нашем запасе уже есть приличное кол-во трансформаций, которые могут быть представлены как 3 x 3 матрица, но нам не хватает еще одной — перемещения. К несчастью, выразить перемещение в трехмерном пространстве при помощи 3 x 3 матрицы невозможно, поскольку перемещение не является линейной трансформацией. Решением этой проблемы являются однородные координаты, которые мы рассмотрим позже.
Центральная проекция
Наша итоговая цель — изобразить трехмерную сцену на двухмерном экране. Таким образом, мы должны тем или иным способом спроектировать нашу сцену на плоскость. Существует две самые часто используемые типы проекций — ортографическая и центральная (другое название — перспективная).
Когда человеческий глаз смотрит на трехмерную сцену, объекты, находящиеся дальше от него, становятся меньше в итоговом изображении, которое и видит человек — этот эффект называется перспективой. Ортографическая проекция игнорирует перспективу, что является полезным свойством при работе в различных САПР-системах (а так же в 2D играх). Центральная же проекция обладает этим свойством и потому добавляет значительную долю реалистичности. В этой статье мы будем рассматривать только ее.
В отличии от ортографической проекции, линии в перспективной проекции не параллельны друг другу, а пересекаются в точке, называемой центром проекции. Центром проекции выступает «глаз», которым мы смотрим на сцену — виртуальная камера:
Изображение формируется на плоскости, находящейся на заданном расстоянии от виртуальной камеры. Соответственно, чем больше расстояние от камеры, тем больше размер проекции:
Рассмотрим самый простой пример: камера расположена в начале координат, а плоскость проекции находится на расстоянии d от камеры. Нам известны координаты точки, которую мы хотим спроецировать: (x, y, z). Найдем координату xp проекции этой точки на плоскость:
На этой картинке видны два подобных треугольника — CDP и CBA (по трем углам):
Соответственно, отношения между сторонами сохраняются:
Получаем результат для x-координаты:
И, аналогично, для y-координаты:
Позже, нам необходимо будет использовать эту трансформацию для формирования спроецированного изображения. И тут возникает проблема — мы не можем представить деление на z-координату в трехмерном пространстве с помощью матрицы. Решением этой проблемы, так же как и в случае с матрицей перемещения, являются однородные (homogeneous) координаты.
Проективная геометрия и однородные координаты
К текущему моменту мы столкнулись с двумя проблемами:
• Перемещение в трехмерном пространстве не может быть представлено как 3 x 3 матрица
• Перспективная проекция не может быть представлена в виде матрицы
Обе эти проблемы решает использование однородных координат. Однородные координаты — понятие из проективной геометрии. Проективная геометрия изучает проективные пространства, и, чтобы понять геометрическую интерпретацию однородных координат, нужно с ними познакомиться.
Ниже мы будем рассматривать определения для двухмерных проективных пространств, поскольку их легче изобразить. Аналогичные рассуждения применяются и для трехмерных проективных пространств (мы в дальнейшем будем использовать именно их).
Определим луч в пространстве R3 следующим образом: луч — это множество векторов вида kv (k — скаляр, v — ненулевой вектор, элемент пространства R3). Т.е. вектор v задает направление луча:
Теперь мы можем перейти к определению проективного пространства. Проективная плоскость (т.е. проективное пространство с размерностью равной двум) P2, ассоциированная с пространством R3, это множество лучей в R3. Таким образом, «точка» в P2 — это луч в R3.
Соответственно, два вектора в R3 задают один и тот же элемент в P2, если один из них может быть получен домножением второго на какой-либо скаляр (поскольку в этом случае они лежат на одном луче):
К примеру, вектора (1, 1, 1) и (5, 5, 5) представляют один и тот же луч, а значит являются одной и той же «точкой» в проективной плоскости.
Таким образом мы и пришли к однородным координатам. Каждый элемент в проективной плоскости задается лучом из трех координат (x, y, w) (последняя координата называется w вместо z — общепринятое соглашение) — эти координаты называются однородными и определены с точностью до скаляра. Это означает, что мы можем домножать (или делить) на скаляр однородные координаты, и они все равно будут представлять ту же самую «точку» в проективной плоскости.
В дальнейшем мы будем использовать однородные координаты для представления афинных (содержащих перемещение) трансформаций и проецирования. Но до этого нужно решить еще один вопрос: каким образом представить в виде однородных координат уже данные нам вершины модели? Поскольку «дополнение» до однородных координат происходит за счет добавления третьей координаты w, вопрос сводится к тому, какое значение w нам необходимо использовать. Ответ на этот вопрос — любое не равное нулю. Разница в использовании различных значений w заключается в удобстве работы с ними.
И, как будет понятно далее (и что отчасти ясно интуитивно), самым удобным значением w является единица. Преимущества этого выбора следующие:
• Это позволяет в более естественном виде представить перемещение в виде матрицы (будет показано далее)
• После некоторых трансформаций (включая перспективную проекцию) значение w будет произвольным, и нам нужно будет вернуться на выбранную нами изначально плоскость (т.е. вернуть изначально выбранное значение w):
Если эта плоскость — w = 1, нам достаточно будет поделить все координаты на w — в результате, мы получим единицу в w координате
Таким образом, мы выбираем значение w = 1, а значит наши входные данные в однородных координатах теперь будут выглядить следующим образом (разумеется, единица уже добавлена будет нами, а не будет находиться в самом описании модели):
v0 = (x0, y0, 1)
v1 = (x1, y1, 1)
v2 = (x2, y2, 1)
Теперь нужно рассмотреть особый случай при работе с w-координатой. А именно — ее равенство нулю. Выше мы говорили, что мы можем выбрать любое значение w, не равное нулю, для расширения до однородных координат. Мы не может взять w = 0, в частности, потому, что это не позволит перемещать эту точку (поскольку, как мы увидим дальше, перемещение происходит именно за счет значения в w координате). Так же, если у точки координата w — нулевая, мы можем рассматривать ее как точку «в бесконечности», поскольку при попытке вернуться на плоскость w = 1 мы получим деление на ноль:
И, хотя мы не можем использовать нулевое значение для вершин модели, мы можем использовать его для векторов! Это приведет к тому, что вектор не будет подвержен перемещениям при трансформациях — что имеет смысл, ведь вектор не описывает положение. Например, при трансформации нормали мы не можем перемещать ее, иначе получим неверный результат. Мы рассмотрим это подробнее, когда возникнет необходимость в трансформации векторов.
В связи с этим, часто пишут, что при w = 1 мы описываем точку, а при w = 0 — вектор.
Как я уже писал, мы использовали пример двухмерных проективных проективных пространств, но в действительно будем использовать трехмерные проективные пространства, а значит каждая точка будет описываться 4-мя координатами: (x, y, z, w).
Перемещение с использование однородных координат
Теперь у нас есть все необходимые инструменты для описания афинных трансформаций. Афинные трансформации — линейные трансформации с последующим смещением. Они могут быть описаны следующим образом:
Мы так же можем использовать 4 х 4 матрицы для описания афинных трансформаций, используя однородные координаты:
Рассмотрим результат умножения вектора, представленного в виде однородных координат, и умножения на 4 x 4 матрицу:
Как видно, отличие от трансформации, представленной в виде 3 x 3 матрица, состоит в наличии 4-й координаты, а так же новых слагаемых в каждой из координат вида vw · m3i. Используя это, и подразумевая w = 1, мы можем представить перемещение следующим образом:
Тут можно убедиться в правильности выбора w = 1. Для представления смещения dx мы используем слагаемое вида w · dx / w. Соответственно, последняя строка матрицы выглядит как (dx/w, dy/w, dz/w, 1). В случае w = 1 мы можем просто опустить знаменатель.
У этой матрицы так же есть геометрическая интерпретация. Вспомним матрицу сдвига, которую мы рассматривала ранее. Она имеет в точности такой же формат, разница лишь в том, что происходит сдвиг четвертой оси, таким образом сдвигая трехмерное подпространство расположенное в гиперплоскости w = 1 на соответствующие значения.
Описание виртуальной камеры
Виртуальная камера — это «глаз», которым мы смотрим на сцену. Прежде чем двигаться дальше, необходимо понять, каким образом можно описать положение камеры в пространстве, и какие параметры необходимы для формирования итогового изображения.
Параметры камеры задают усеченную пирамиду обзора (view frustum), которая определяет, какая часть сцены попадет в итоговое изображение:
Рассмотрим их по очереди:
• Местоположение и ориентация камеры в пространстве. Положение, очевидно, просто точка. Описать ориентацию можно различными способами. Я буду использовать так называемую «UVN» систему, т.е. ориентация камеры описывается положением связанной с ней системой координат. Обычно, оси в ней называются u, v и n (поэтому и такое название), но я буду использовать right, up и forward — из этих названий проще понять, чему соответствует каждая ось. Мы будем использовать левостороннюю систему координат.
При создании объекта камеры в API можно описывать все три оси — но это очень неудобно для пользователя. Чаще всего, пользователь знает в каком направлении должна смотреть камера, а так же приблизительную ориентацию вектора up (будем называть этот вектор up'). Используя эти два значения мы может построить верную систему координат для камеры по следующему алгоритму:
• Вычисляем вектор right используя вектора forward и up' при помощи векторного произведения:
• Теперь вычисляем корректный up, используя right и forward:
То есть, вектор up' совместно с forward задают плоскость, в которой должен быть расположен настоящий вектор up. Если у вас есть опыт использования OpenGL, то именно по такому алгоритму работает известная функция gluLookAt.
Важно не забыть нормализовать полученные в результате вектора — нам нужна ортонормированная система координат, поскольку ее удобнее использовать в дальнейшем
• z-координаты ближней и дальней плоскостей отсечения (near/far clipping plane) в системе координат камеры
• Углы обзора камеры. Они задают размеры усеченной пирамиды обзора:
Поскольку сцена в дальнейшем будет спроецирована на плоскость проекции, то изображение на этой плоскости в дальнейшем будет отображено на экране компьютера. Поэтому важно, чтобы соотношение сторон у этой плоскости и окна (или его части), в котором будет показано изображение, совпадали. Этого можно добиться, дав пользователю API возможность задавать только один угол обзора, а второй вычислять в соответствии с соотношением сторон окна. Например, зная горизонтальный угол обзора, мы можем вычислить вертикальный следующим образом:
Когда мы обсуждали центральную проекцию, мы видели, что чем дальше находится плоскость проекции от камеры, тем больше размер полученного изображения — мы обозначали расстояние от камеры (считая, что она расположена в начале координат) вдоль оси z до плоскости проекции переменной d. Соответственно, следует решить вопрос, какое значение d нам необходимо выбрать. На самом деле, любое ненулевое. Несмотря на то, что размер изображения увеличивается при увеличении d, пропорционально увеличивается и та часть плоскости проекции, которая пересекается с пирамидой обзора, оставляя одним и тем же масштаб изображения относительно размеров этой части плоскости. В дальнейшем мы будем использовать d = 1 для удобства.
Пример в 2D:
В итоге, для изменения масштаба изображения, нам необходимо менять углы обзора — это изменит размер части плоскости проекции, пересекающейся с пирамидой обзора, оставив размер проекции тем же.
Мы можем двигать и поворачивать камеру, меняя положение и ориентацию ее системы координат. Пример кода:
Скрытый текст
void camera::move_right(float distance)
{
m_position += m_right * distance;
}
void camera::move_left(float const distance)
{
move_right(-distance);
}
void camera::move_up(float const distance)
{
m_position += m_up * distance;
}
void camera::move_down(float const distance)
{
move_up(-distance);
}
void camera::move_forward(float const distance)
{
m_position += m_forward * distance;
}
void camera::move_backward(float const distance)
{
move_forward(-distance);
}
void camera::yaw(float const radians)
{
matrix3x3 const rotation{matrix3x3::rotation_around_y_axis(radians)};
m_forward = m_forward * rotation;
m_right = m_right * rotation;
m_up = m_up * rotation;
}
void camera::pitch(float const radians)
{
matrix3x3 const rotation{matrix3x3::rotation_around_x_axis(radians)};
m_forward = m_forward * rotation;
m_right = m_right * rotation;
m_up = m_up * rotation;
}
Графический конвейер
Теперь у нас есть весь необходимый фундамент, для того чтобы описать по шагам действия, которые необходимы для получения изображения трехмерной сцены на экране компьютера. Для простоты будем считать, что конвейер отрисовывает один объект за раз.
Входящие параметров конвейера:
• Объект и его ориентация в мировой системе координат
• Камера, чьи параметры мы будем использовать при составлении изображения
1. Переход в мировую систему координат
На этой стадии мы трансформируем вершины объекта из локальной системы координат в мировую.
Предположим, что ориентация объекта в мировой системе координат задается следующими параметрами:
• В какой точке в мировой системе координат находится объект: (xworld, yworld, zworld)
• Каким образом объект повернут: (rx, ry, rz)
• Масштаб объекта: (sx, sy, sz)
Назовем матрицы этих трансформаций T, R и S соответственно. Для получения итоговой матрицы, которая будет трансформировать объект в мировую систему координат, нам достаточно перемножить их. Тут важно заметить, что порядок перемножения матриц играет роль — это напрямую следует из того факта, что умножение матриц некоммутативно.
Вспомним, что масштабирование происходит относительно начала координат. Если мы сначала сместим объект на желаемую точку, а потом применим к нему масштаб, мы получим неверный результат — положение объекта снова изменится после масштабирования. Простой пример:
Аналогичное правило применяется и относительно вращения — оно происходит относительно начала координат, а значит положение объекта изменится, если мы сначала произведем перемещение.
Таким образом, корректная последовательность в нашем случае выглядит следующим образом: масштабирование — поворот — смещение:
2. Переход в систему координат камеры
Переход в систему координат камеры, в частности, используется для упрощения дальнейших вычислений. В этой системе координат камера расположена в начале координат, а ее оси — вектора forward, right, up, которые мы рассматривали в предыдущем разделе.
Переход в систему координат камеры состоит из двух шагов:
• Перемещаем мир таким образом, чтобы положение камеры совпадало с началом координат
• Используя вычисленные оси right, up, forward, вычисляем координаты вершин объекта вдоль этих осей (этот шаг можно рассматривать как поворот системы координат камеры таким образом, чтобы она совпадала с мировой системой координат)
Первый шаг легко можно представить в виде матрицы перемещения на (-posx, -posy, -posz), где pos — положение камеры в мировой системе координат:
Для реализации второго пункта мы воспользуемся свойством скалярного произведения, которое мы рассматривали в самом начале — скалярное произведение вычисляет длину проекции вдоль заданной оси. Таким образом, для того чтобы перевести точку A в систему координат камеры (с учетом того, что камера находится в начале координат — мы проделали это в первом пункте), нам достаточно взять ее скалярное произведение с векторами right, up, forward. Обозначим точку в мировой системе координат v, а эту же точку, переведенную в систему координат камеры, v', тогда:
Эту операцию можно представить в виде матрицы:
Комбинируя эти две трансформации, мы получаем матрицу перехода в систему координат камеры:
Схематично, этот процесс можно изобразить следующим образом:
3. Переход в однородное пространство отсечения и нормализация координат
В результате предыдущего пункта, мы получили координаты вершин объекта в системе координат камеры. Следующее, что необходимо сделать, это произвести проекцию этих вершин на плоскость и «отсечь» лишние вершины. Вершина объекта отсекается, если она лежит вне пирамиды обзора (т.е. ее проекция не лежит на той части плоскости, которую охватывает пирамида обзора). Например, вершина v1 на рисунке ниже:
Обе эти задачи частично решает матрица проекции (projection matrix). «Частично» — потому что она не производит саму проекцию, но подготавливает w-координату вершины для этого. Из-за этого название «матрица проекции» звучит не очень подходяще (хотя это довольно распространенный термин), и я буду в дальнейшем называть ее матрицей отсечения (clip matrix), поскольку она так же производит отображение усеченной пирамиды обзора в однородное пространство отсечения (homogeneous clip space).
Но обо всем по порядку. Итак, первое — подготовка к проекции. Для этого мы кладем z-координату вершины в ее w-координату. Сама проекция (т.е. деление на z) будет происходить при дальнейшей нормализации w-координаты — т.е. при возвращении в пространство w = 1.
Следующее, что должна сделать эта матрица — это перевести координаты вершин объекта из пространства камеры в однородное пространство отсечения (homogeneous clip space). Это пространство, координаты не отсеченных вершин в котором таковы, что после применения проекции (т.е. деления на w-координату, поскольку в ней мы сохранили старую z-координату) координаты вершины нормализуются, т.е. удовлетворяют следующим условиям:
Неравенство для z-координаты может различаться для разных API. Например, в OpenGL оно соответствует тому, что выше. В Direct3D же z-координата отображается в интервал [0, 1]. Мы будем использовать принятый в OpenGL интервал, т.е. [-1, 1].
Подобные координаты называются нормализованными координатами устройства (normalized device coordinates или просто NDC).
Поскольку мы получаем NDC-координаты поделив координаты на w, вершины в пространстве отсечения удовлетворяют следующим условиям:
Таким образом, переведя вершины в это пространство, мы можем узнать, нужно ли отсекать вершину, просто проверив ее координаты на неравенства выше. Любая вершина, не удовлетворяющая этим условиям, должна быть отсечена. Само отсечение — тема для отдельной статьи, поскольку ее корректная реализация приводит к созданию новых вершин. Пока что, в качестве быстрого решения, мы не будем рисовать грань, если хотя бы одна из ее вершин отсечена. Конечно, результат получится не сильно аккуратным. Например, для модели машины это выглядит следующим образом:
Итого, данный этап состоит из следующих шагов:
• Получаем вершины в пространстве камеры
• Домножаем на матрицу отсечения — переходим в пространство отсечения
• Помечаем отсеченные вершины, проверяя по неравенствам описанным выше
• Делим координаты каждой вершины на ее w-координату — переходим к нормализованным координатам
Теперь рассмотрим, каким образом мы отображаем координаты из пространства камеры в пространство отсечения. Вспомним, что мы решили использовать плоскость проекции z=1. Для начала нам нужно найти функцию, которая отображает координаты, лежащие на пересечении пирамиды обзора и плоскости проекции в интервал [-1, 1]. Для этого найдем координаты точек, определяющих эту часть плоскости. Эти две точки имеют координаты (left, top) и (right, bottom). Мы будем рассматривать только случай, когда пирамида обзора симметрична относительно направления камеры.
Мы можем их вычислить, используя углы обзора:
Получаем:
Аналогично для top и bottom:
Таким образом, нам нужно отобразить интервал [left, right], [bottom, top], [near, far] в [-1; 1]. Найдем линейную функцию, которая дает такой результат для left и right:
Аналогично получается функция для bottom и top:
Выражение для z находится по-другому. Вместо того, чтобы рассматривать функцию вида az + b мы будем рассматривать функцию a · 1/z + b, потому что в дальнейшем, когда мы будем реализовывать буфер глубины, нам нужно будет линейно интерполировать величину, обратную z-координате. Мы не будем рассматривать этот вопрос сейчас, и просто примем это за данное. Получим:
Таким образом, мы можем записать, что нормализованные координаты получаются следующим образом из координат в пространстве камеры:
Мы не можем сразу применить эти формулы, потому что деление на z произойдет позже, при нормализации w-координаты. Мы можем воспользоваться этим, и вместо этого вычислить следующие значения (домножив на z), которые после деления на w в результате дадут нормализованные координаты:
Именно по этим формулам мы и производим трансформацию в пространство отсечения. Мы можем записать эту трансформацию в матричной форме (дополнительно вспомнив, что в w-координату мы кладем z):
Переход в систему координат экрана
К текущему этапу у нас есть координаты вершин объекта в NDC. Нам нужно перевести их в систему координат экрана. Вспомним, что левый верхний угол плоскости проекции был отображен в (-1, 1), а правый нижний в (1, -1). Для экрана я буду использовать левый верхний угол как начало системы координат, с осями направленным вправо и вниз:
Это отображение (viewport transformation) можно произвести при помощи простых формул:
Или, в матричной форме:
Мы оставим использование zndc до реализации буфера глубины.
В результате у нас есть координаты вершин на экране, которые мы и используем для отрисовки.
Реализация в коде
Ниже приведен пример кода, реализующий конвейер по описанному выше способу и производящий отрисовку в wireframe-режиме (т.е. просто соединяя вершины линиями). В нем так же подразумевается, что объект описан набором вершин и набором индексов вершин (faces), из которых состоят его полигоны:
Скрытый текст
void pipeline::draw_mesh(
std::shared_ptr<mesh const> mesh,
vector3 const& position,
vector3 const& rotation,
camera const& camera,
bitmap_painter& painter) const
{
matrix4x4 const local_to_world_transform{
matrix4x4::rotation_around_x_axis(rotation.x) *
matrix4x4::rotation_around_y_axis(rotation.y) *
matrix4x4::rotation_around_z_axis(rotation.z) *
matrix4x4::translation(position.x, position.y, position.z)};
matrix4x4 const camera_rotation{
camera.get_right().x, camera.get_up().x, camera.get_forward().x, 0.0f,
camera.get_right().y, camera.get_up().y, camera.get_forward().y, 0.0f,
camera.get_right().z, camera.get_up().z, camera.get_forward().z, 0.0f,
0.0f, 0.0f, 0.0f, 1.0f};
matrix4x4 const camera_translation{
1.0f, 0.0f, 0.0f, 0.0f,
0.0f, 1.0f, 0.0f, 0.0f,
0.0f, 0.0f, 1.0f, 0.0f,
-camera.get_position().x, -camera.get_position().y, -camera.get_position().z, 1.0f};
matrix4x4 const world_to_camera_transform{camera_translation * camera_rotation};
float const projection_plane_z{1.0f};
float const near{camera.get_near_plane_z()};
float const far{camera.get_far_plane_z()};
float const right{std::tan(camera.get_horizontal_fov() / 2.0f) * projection_plane_z};
float const left{-right};
float const top{std::tan(camera.get_vertical_fov() / 2.0f) * projection_plane_z};
float const bottom{-top};
matrix4x4 const camera_to_clip_transform{
2.0f * projection_plane_z / (right - left), 0.0f, 0.0f, 0.0f,
0.0f, 2.0f * projection_plane_z / (top - bottom), 0.0f, 0.0f,
(left + right) / (left - right), (bottom + top) / (bottom - top), (far + near) / (far - near), 1.0f,
0.0f, 0.0f, -2.0f * near * far / (far - near), 0.0f};
matrix4x4 const local_to_clip_transform{
local_to_world_transform * world_to_camera_transform * camera_to_clip_transform};
std::vector<vector4> transformed_vertices;
for (vector3 const& v : mesh->get_vertices())
{
vector4 v_transformed{vector4{v.x, v.y, v.z, 1.0f} * local_to_clip_transform};
if ((v_transformed.x > v_transformed.w) || (v_transformed.x < -v_transformed.w))
{
mark_vector4_as_clipped(v_transformed);
}
else if ((v_transformed.y > v_transformed.w) || (v_transformed.y < -v_transformed.w))
{
mark_vector4_as_clipped(v_transformed);
}
else if ((v_transformed.z > v_transformed.w) || (v_transformed.z < -v_transformed.w))
{
mark_vector4_as_clipped(v_transformed);
}
transformed_vertices.push_back(v_transformed);
}
float const width{static_cast<float>(painter.get_bitmap_width())};
float const height{static_cast<float>(painter.get_bitmap_height())};
matrix4x4 const ndc_to_screen{
width / 2.0f, 0.0f, 0.0f, 0.0f,
0.0f, -height / 2.0f, 0.0f, 0.0f,
0.0f, 0.0f, 1.0f, 0.0f,
width / 2.0f, height / 2.0f, 0.0f, 1.0f};
for (vector4& v : transformed_vertices)
{
if (is_vector4_marked_as_clipped(v))
{
continue;
}
float const w_reciprocal{1.0f / v.w};
v.x *= w_reciprocal;
v.y *= w_reciprocal;
v.z *= w_reciprocal;
v.w = 1.0f;
v = v * ndc_to_screen;
}
for (face const& f : mesh->get_faces())
{
vector4 const& v1{transformed_vertices[f.index1]};
vector4 const& v2{transformed_vertices[f.index2]};
vector4 const& v3{transformed_vertices[f.index3]};
bool const v1_clipped{is_vector4_marked_as_clipped(v1)};
bool const v2_clipped{is_vector4_marked_as_clipped(v2)};
bool const v3_clipped{is_vector4_marked_as_clipped(v3)};
if (!v1_clipped && !v2_clipped)
{
painter.draw_line(
point2d{static_cast<unsigned int>(v1.x), static_cast<unsigned int>(v1.y)},
point2d{static_cast<unsigned int>(v2.x), static_cast<unsigned int>(v2.y)},
color{255, 255, 255});
}
if (!v3_clipped && !v2_clipped)
{
painter.draw_line(
point2d{static_cast<unsigned int>(v2.x), static_cast<unsigned int>(v2.y)},
point2d{static_cast<unsigned int>(v3.x), static_cast<unsigned int>(v3.y)},
color{255, 255, 255});
}
if (!v1_clipped && !v3_clipped)
{
painter.draw_line(
point2d{static_cast<unsigned int>(v3.x), static_cast<unsigned int>(v3.y)},
point2d{static_cast<unsigned int>(v1.x), static_cast<unsigned int>(v1.y)},
color{255, 255, 255});
}
}
}
Пример использования SDL2 для реализации
В этом разделе я вкратце расскажу, как можно использовать SDL2 для реализации отрисовки.
Инициализация, создание текстуры
Первое — это, естественно, инициализация библиотеки и создание окна. Если от SDL нужна только графика, то можно инициализировать с флагом SDL_INIT_VIDEO:
Скрытый текст
if (SDL_Init(SDL_INIT_VIDEO) < 0)
{
throw std::runtime_error(SDL_GetError());
}
m_window = SDL_CreateWindow(
"lantern",
SDL_WINDOWPOS_UNDEFINED, SDL_WINDOWPOS_UNDEFINED,
width, height,
SDL_WINDOW_SHOWN);
if (m_window == nullptr)
{
throw std::runtime_error(SDL_GetError());
}
m_renderer = SDL_CreateRenderer(m_window, -1, SDL_RENDERER_ACCELERATED);
if (m_renderer == nullptr)
{
throw std::runtime_error(SDL_GetError());
}
Затем, создаем текстуру, в которую будем производить отрисовку. Я буду использовать формат ARGB8888, который означает, что на каждый пиксель в текстуре будет выделяться 4 байта — три байта на RGB каналы, и один на альфа-канал.
Скрытый текст
m_target_texture = SDL_CreateTexture(
m_renderer,
SDL_PIXELFORMAT_ARGB8888,
SDL_TEXTUREACCESS_STREAMING,
width, height);
if (m_target_texture == nullptr)
{
throw std::runtime_error(SDL_GetError());
}
Нужно не забыть произвести «очистку» SDL и всех взятых у него переменных при выходе приложения:
Скрытый текст
if (m_target_texture != nullptr)
{
SDL_DestroyTexture(m_target_texture);
m_target_texture = nullptr;
}
if (m_renderer != nullptr)
{
SDL_DestroyRenderer(m_renderer);
m_renderer = nullptr;
}
if (m_window != nullptr)
{
SDL_DestroyWindow(m_window);
m_window = nullptr;
}
SDL_Quit();
Отрисовка, отображение на экране
Мы можем использовать SDL_UpdateTexture для обновления текстуры, которую мы затем отобразим на экране. Эта функция принимает, помимо прочих, следующие параметры:
• Данные — массив байт, который представляет собой массив пикселей с соответствующими значениями
• Количество байт в одной строке изображения (pitch) — вычисляется как кол-во пикселей, умноженное на 4 (потому что формат — ARGB8888)
Логично выделить функционал рисования в текстуру, представленную массивом байт, в отдельный класс. Он будет выделять память под массив, очищать текстуру, рисовать пиксели и линии. Рисование пикселя может быть сделано следующим образом (порядок байт различается в зависимости от SDL_BYTEORDER):
Скрытый текст
void bitmap_painter::draw_pixel(point2d const& point, color const& c)
{
unsigned int const pixel_first_byte_index{m_pitch * point.y + point.x * 4};
#if SDL_BYTEORDER == SDL_BIG_ENDIAN
m_data[pixel_first_byte_index + 0] = c.b;
m_data[pixel_first_byte_index + 1] = c.g;
m_data[pixel_first_byte_index + 2] = c.r;
// m_data[pixel_first_byte_index + 3] is alpha, we don't use it for now
#else
// m_data[pixel_first_byte_index + 0] is alpha, we don't use it for now
m_data[pixel_first_byte_index + 1] = c.r;
m_data[pixel_first_byte_index + 2] = c.g;
m_data[pixel_first_byte_index + 3] = c.b;
#endif
}
Рисование линий можно реализовать, например, по алгоритму Брезенхэма.
После использования SDL_UpdateTexture, необходимо скопировать текстуру в SDL_Renderer и отобразить на экране с помощью SDL_RenderPresent. Все вместе:
Скрытый текст
SDL_UpdateTexture(m_target_texture, nullptr, m_painter.get_data(), m_painter.get_pitch());
SDL_RenderCopy(m_renderer, m_target_texture, nullptr, nullptr);
SDL_RenderPresent(m_renderer);
На этом все. Ссылка на проект: https://github.com/loreglean/lantern.
Tags:
Hubs:
Total votes 95: ↑90 and ↓5 +85
Comments 51
Comments Comments 51
Posts
|
{
"url": "https://habr.com/en/post/243011/",
"source_domain": "habr.com",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "336243",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EG3HGPKNMF7GYDMBAOPGTEK54NCMOAXQ",
"WARC-Concurrent-To": "<urn:uuid:b6ea3a89-e066-42b4-9d1a-6b91ee7e994e>",
"WARC-Date": "2023-04-02T08:55:06Z",
"WARC-IP-Address": "178.248.237.68",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6KPWSSVFM5RAPABZIBRMCTHHJZDLF3CK",
"WARC-Record-ID": "<urn:uuid:40cafbe0-b57b-4c2b-9c2a-029943275ca9>",
"WARC-Target-URI": "https://habr.com/en/post/243011/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:df376be6-006e-43d2-a680-aefd7572b4c6>"
},
"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-84\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,
16,
17,
49,
50,
70,
80,
112,
120,
627,
628,
1186,
1187,
1395,
1396,
1707,
1708,
1928,
1929,
2027,
2028,
3213,
3214,
3222,
3223,
3224,
3471,
3472,
3473,
3474,
3935,
3936,
4308,
4309,
4452,
4453,
4476,
4477,
4714,
4715,
4716,
4717,
4789,
4790,
4827,
4894,
4895,
4896,
4897,
4975,
4976,
4977,
4978,
5170,
5171,
5172,
5173,
5245,
5246,
5247,
5248,
5291,
5292,
5293,
5294,
5346,
5347,
5348,
5349,
5456,
5457,
5458,
5459,
5738,
5739,
5961,
5962,
5963,
5964,
6060,
6061,
6062,
6080,
6081,
6082,
6327,
6328,
6419,
6420,
6421,
6422,
6890,
6891,
7048,
7049,
7240,
7241,
7255,
7269,
7283,
7284,
7513,
7514,
7532,
7550,
7568,
7569,
8335,
8336,
8820,
8821,
8822,
8823,
8888,
8889,
8906,
8922,
8939,
8957,
8958,
9050,
9051,
9052,
9053,
9269,
9270,
9323,
9324,
9509,
9510,
9584,
9585,
9599,
9627,
9655,
9656,
9896,
9897,
10007,
10077,
10153,
10154,
10436,
10437,
10438,
10439,
10685,
10686,
10687,
10688,
10738,
10739,
11063,
11064,
11065,
11066,
11181,
11182,
11183,
11184,
11649,
11650,
11745,
11746,
11747,
11748,
11818,
11819,
11827,
11828,
11829,
12045,
12046,
12047,
12048,
12068,
12069,
12534,
12535,
12536,
12537,
12796,
12797,
12950,
12951,
12952,
12953,
12990,
12991,
13311,
13312,
13327,
13328,
13329,
13330,
13346,
13347,
13348,
13349,
13581,
13582,
14021,
14022,
14064,
14065,
14066,
14067,
14110,
14111,
14112,
14938,
14939,
15167,
15168,
15305,
15306,
15307,
15308,
15337,
15338,
15447,
15448,
15549,
15550,
15551,
15552,
15553,
15554,
15588,
15589,
15590,
15591,
15650,
15651,
15652,
15653,
15841,
15842,
15843,
15844,
16297,
16298,
16506,
16507,
16508,
16509,
16628,
16762,
17002,
17186,
17187,
17267,
17268,
17269,
17270,
17271,
17272,
17795,
17796,
17910,
17911,
17912,
17913,
18025,
18026,
18049,
18050,
18051,
18204,
18205,
18206,
18207,
18439,
18440,
18449,
18450,
18785,
18786,
18787,
18788,
18789,
18790,
18798,
18799,
18800,
18801,
19094,
19095,
19096,
19097,
19113,
19114,
19199,
19200,
19201,
19202,
19377,
19378,
19379,
19380,
19388,
19389,
19390,
19593,
19594,
19595,
19596,
19602,
19603,
19723,
19724,
19725,
19726,
19791,
19792,
19793,
19794,
19802,
19803,
19804,
19805,
19908,
19909,
19910,
19911,
20057,
20058,
20448,
20449,
20470,
20471,
20472,
20751,
20752,
21237,
21238,
21473,
21474,
21475,
21476,
21649,
21650,
21651,
21652,
21911,
21912,
21913,
21914,
21992,
21993,
21994,
21995,
22050,
22051,
22052,
22053,
22090,
22091,
22092,
22093,
22126,
22127,
22128,
22129,
22471,
22472,
22518,
22519,
22520,
22574,
22661,
22730,
22731,
23000,
23001,
23237,
23238,
23426,
23427,
23428,
23429,
23685,
23686,
23882,
23883,
23884,
23885,
24025,
24026,
24471,
24472,
25035,
25036,
25037,
25038,
25179,
25285,
25498,
25499,
25500,
25501,
25633,
25634,
25867,
25868,
25885,
25902,
25919,
25920,
26494,
26495,
26496,
26497,
26926,
26927,
27012,
27013,
27249,
27250,
27299,
27300,
27496,
27497,
27498,
27499,
27611,
27612,
27613,
27614,
27729,
27730,
27731,
27732,
27733,
27734,
27993,
27994,
27995,
27996,
28246,
28247,
28570,
28571,
28599,
28600,
28601,
28841,
28842,
28978,
28979,
28980,
28981,
29007,
29008,
29505,
29506,
29507,
29508,
29879,
29880,
29977,
30042,
30043,
30270,
30271,
30433,
30434,
30543,
30544,
30614,
30615,
30616,
30617,
31153,
31154,
31155,
31156,
31871,
31872,
31889,
31890,
31891,
31892,
32089,
32090,
32091,
32195,
32209,
32249,
32251,
32286,
32288,
32289,
32334,
32336,
32360,
32362,
32363,
32406,
32408,
32440,
32442,
32443,
32488,
32490,
32511,
32513,
32514,
32562,
32564,
32601,
32603,
32604,
32653,
32655,
32681,
32683,
32684,
32722,
32724,
32795,
32830,
32861,
32886,
32888,
32889,
32929,
32931,
33002,
33037,
33068,
33093,
33095,
33096,
33097,
33118,
33119,
33120,
33366,
33367,
33398,
33454,
33530,
33531,
33570,
33571,
33662,
33663,
33760,
33849,
33897,
33931,
33932,
34261,
34262,
34522,
34523,
34524,
34525,
34707,
34708,
34834,
34835,
34836,
34837,
34875,
34876,
35125,
35126,
35184,
35271,
35505,
35506,
35650,
35651,
35652,
35653,
36207,
36208,
36209,
36210,
36257,
36258,
36259,
36260,
36351,
36352,
36353,
36354,
36415,
36416,
36417,
36418,
36490,
36491,
36890,
36891,
36892,
36893,
37380,
37381,
37641,
37642,
38063,
38064,
38065,
38066,
38305,
38425,
38426,
38555,
38556,
38557,
38558,
39108,
39109,
39110,
39111,
39158,
39201,
39273,
39346,
39443,
39444,
39995,
39996,
39997,
39998,
40044,
40045,
40046,
40047,
40057,
40058,
40059,
40060,
40089,
40090,
40091,
40092,
40262,
40263,
40264,
40265,
40313,
40314,
40315,
40316,
40679,
40680,
40681,
40682,
40812,
40813,
40814,
40815,
41095,
41096,
41097,
41098,
41290,
41291,
41292,
41293,
41328,
41329,
41661,
41662,
41663,
41664,
41750,
41751,
41752,
41753,
41777,
41778,
41779,
41780,
41840,
41841,
41933,
41934,
41952,
41953,
42243,
42257,
42283,
42318,
42344,
42370,
42393,
42425,
42427,
42470,
42520,
42570,
42620,
42683,
42684,
42718,
42791,
42864,
42937,
42964,
43001,
43027,
43053,
43079,
43166,
43248,
43249,
43291,
43337,
43381,
43468,
43495,
43578,
43605,
43648,
43712,
43776,
43879,
43935,
43936,
43978,
44062,
44063,
44107,
44154,
44157,
44238,
44239,
44322,
44326,
44369,
44373,
44461,
44465,
44508,
44512,
44600,
44604,
44647,
44651,
44652,
44701,
44704,
44705,
44776,
44849,
44884,
44928,
44974,
45010,
45064,
45065,
45106,
45109,
45148,
45152,
45165,
45169,
45170,
45210,
45211,
45234,
45257,
45280,
45294,
45295,
45326,
45329,
45330,
45371,
45374,
45427,
45480,
45533,
45534,
45593,
45652,
45711,
45712,
45746,
45750,
45772,
45851,
45930,
45957,
45961,
45962,
45996,
46000,
46022,
46101,
46180,
46207,
46211,
46212,
46246,
46250,
46272,
46351,
46430,
46457,
46461,
46464,
46466,
46467,
46468,
46509,
46510,
46511,
46600,
46601,
46634,
46635,
46789,
46803,
46837,
46839,
46882,
46884,
46885,
46914,
46926,
46977,
46993,
47013,
47038,
47040,
47083,
47085,
47086,
47159,
47186,
47188,
47231,
47233,
47234,
47235,
47462,
47476,
47514,
47527,
47554,
47584,
47601,
47634,
47636,
47679,
47681,
47682,
47683,
47779,
47793,
47826,
47828,
47867,
47896,
47898,
47899,
47926,
47928,
47962,
47985,
47987,
47988,
48013,
48015,
48045,
48066,
48068,
48069,
48081,
48082,
48083,
48116,
48117,
48279,
48378,
48515,
48516,
48810,
48824,
48894,
48896,
48973,
48974,
49010,
49053,
49096,
49139,
49212,
49218,
49291,
49334,
49377,
49420,
49427,
49429,
49430,
49431,
49501,
49502,
49652,
49666,
49757,
49821,
49852,
49853,
49854,
49923,
49929,
49935,
49966,
49978,
49999,
50000
],
"line_end_idx": [
16,
17,
49,
50,
70,
80,
112,
120,
627,
628,
1186,
1187,
1395,
1396,
1707,
1708,
1928,
1929,
2027,
2028,
3213,
3214,
3222,
3223,
3224,
3471,
3472,
3473,
3474,
3935,
3936,
4308,
4309,
4452,
4453,
4476,
4477,
4714,
4715,
4716,
4717,
4789,
4790,
4827,
4894,
4895,
4896,
4897,
4975,
4976,
4977,
4978,
5170,
5171,
5172,
5173,
5245,
5246,
5247,
5248,
5291,
5292,
5293,
5294,
5346,
5347,
5348,
5349,
5456,
5457,
5458,
5459,
5738,
5739,
5961,
5962,
5963,
5964,
6060,
6061,
6062,
6080,
6081,
6082,
6327,
6328,
6419,
6420,
6421,
6422,
6890,
6891,
7048,
7049,
7240,
7241,
7255,
7269,
7283,
7284,
7513,
7514,
7532,
7550,
7568,
7569,
8335,
8336,
8820,
8821,
8822,
8823,
8888,
8889,
8906,
8922,
8939,
8957,
8958,
9050,
9051,
9052,
9053,
9269,
9270,
9323,
9324,
9509,
9510,
9584,
9585,
9599,
9627,
9655,
9656,
9896,
9897,
10007,
10077,
10153,
10154,
10436,
10437,
10438,
10439,
10685,
10686,
10687,
10688,
10738,
10739,
11063,
11064,
11065,
11066,
11181,
11182,
11183,
11184,
11649,
11650,
11745,
11746,
11747,
11748,
11818,
11819,
11827,
11828,
11829,
12045,
12046,
12047,
12048,
12068,
12069,
12534,
12535,
12536,
12537,
12796,
12797,
12950,
12951,
12952,
12953,
12990,
12991,
13311,
13312,
13327,
13328,
13329,
13330,
13346,
13347,
13348,
13349,
13581,
13582,
14021,
14022,
14064,
14065,
14066,
14067,
14110,
14111,
14112,
14938,
14939,
15167,
15168,
15305,
15306,
15307,
15308,
15337,
15338,
15447,
15448,
15549,
15550,
15551,
15552,
15553,
15554,
15588,
15589,
15590,
15591,
15650,
15651,
15652,
15653,
15841,
15842,
15843,
15844,
16297,
16298,
16506,
16507,
16508,
16509,
16628,
16762,
17002,
17186,
17187,
17267,
17268,
17269,
17270,
17271,
17272,
17795,
17796,
17910,
17911,
17912,
17913,
18025,
18026,
18049,
18050,
18051,
18204,
18205,
18206,
18207,
18439,
18440,
18449,
18450,
18785,
18786,
18787,
18788,
18789,
18790,
18798,
18799,
18800,
18801,
19094,
19095,
19096,
19097,
19113,
19114,
19199,
19200,
19201,
19202,
19377,
19378,
19379,
19380,
19388,
19389,
19390,
19593,
19594,
19595,
19596,
19602,
19603,
19723,
19724,
19725,
19726,
19791,
19792,
19793,
19794,
19802,
19803,
19804,
19805,
19908,
19909,
19910,
19911,
20057,
20058,
20448,
20449,
20470,
20471,
20472,
20751,
20752,
21237,
21238,
21473,
21474,
21475,
21476,
21649,
21650,
21651,
21652,
21911,
21912,
21913,
21914,
21992,
21993,
21994,
21995,
22050,
22051,
22052,
22053,
22090,
22091,
22092,
22093,
22126,
22127,
22128,
22129,
22471,
22472,
22518,
22519,
22520,
22574,
22661,
22730,
22731,
23000,
23001,
23237,
23238,
23426,
23427,
23428,
23429,
23685,
23686,
23882,
23883,
23884,
23885,
24025,
24026,
24471,
24472,
25035,
25036,
25037,
25038,
25179,
25285,
25498,
25499,
25500,
25501,
25633,
25634,
25867,
25868,
25885,
25902,
25919,
25920,
26494,
26495,
26496,
26497,
26926,
26927,
27012,
27013,
27249,
27250,
27299,
27300,
27496,
27497,
27498,
27499,
27611,
27612,
27613,
27614,
27729,
27730,
27731,
27732,
27733,
27734,
27993,
27994,
27995,
27996,
28246,
28247,
28570,
28571,
28599,
28600,
28601,
28841,
28842,
28978,
28979,
28980,
28981,
29007,
29008,
29505,
29506,
29507,
29508,
29879,
29880,
29977,
30042,
30043,
30270,
30271,
30433,
30434,
30543,
30544,
30614,
30615,
30616,
30617,
31153,
31154,
31155,
31156,
31871,
31872,
31889,
31890,
31891,
31892,
32089,
32090,
32091,
32195,
32209,
32249,
32251,
32286,
32288,
32289,
32334,
32336,
32360,
32362,
32363,
32406,
32408,
32440,
32442,
32443,
32488,
32490,
32511,
32513,
32514,
32562,
32564,
32601,
32603,
32604,
32653,
32655,
32681,
32683,
32684,
32722,
32724,
32795,
32830,
32861,
32886,
32888,
32889,
32929,
32931,
33002,
33037,
33068,
33093,
33095,
33096,
33097,
33118,
33119,
33120,
33366,
33367,
33398,
33454,
33530,
33531,
33570,
33571,
33662,
33663,
33760,
33849,
33897,
33931,
33932,
34261,
34262,
34522,
34523,
34524,
34525,
34707,
34708,
34834,
34835,
34836,
34837,
34875,
34876,
35125,
35126,
35184,
35271,
35505,
35506,
35650,
35651,
35652,
35653,
36207,
36208,
36209,
36210,
36257,
36258,
36259,
36260,
36351,
36352,
36353,
36354,
36415,
36416,
36417,
36418,
36490,
36491,
36890,
36891,
36892,
36893,
37380,
37381,
37641,
37642,
38063,
38064,
38065,
38066,
38305,
38425,
38426,
38555,
38556,
38557,
38558,
39108,
39109,
39110,
39111,
39158,
39201,
39273,
39346,
39443,
39444,
39995,
39996,
39997,
39998,
40044,
40045,
40046,
40047,
40057,
40058,
40059,
40060,
40089,
40090,
40091,
40092,
40262,
40263,
40264,
40265,
40313,
40314,
40315,
40316,
40679,
40680,
40681,
40682,
40812,
40813,
40814,
40815,
41095,
41096,
41097,
41098,
41290,
41291,
41292,
41293,
41328,
41329,
41661,
41662,
41663,
41664,
41750,
41751,
41752,
41753,
41777,
41778,
41779,
41780,
41840,
41841,
41933,
41934,
41952,
41953,
42243,
42257,
42283,
42318,
42344,
42370,
42393,
42425,
42427,
42470,
42520,
42570,
42620,
42683,
42684,
42718,
42791,
42864,
42937,
42964,
43001,
43027,
43053,
43079,
43166,
43248,
43249,
43291,
43337,
43381,
43468,
43495,
43578,
43605,
43648,
43712,
43776,
43879,
43935,
43936,
43978,
44062,
44063,
44107,
44154,
44157,
44238,
44239,
44322,
44326,
44369,
44373,
44461,
44465,
44508,
44512,
44600,
44604,
44647,
44651,
44652,
44701,
44704,
44705,
44776,
44849,
44884,
44928,
44974,
45010,
45064,
45065,
45106,
45109,
45148,
45152,
45165,
45169,
45170,
45210,
45211,
45234,
45257,
45280,
45294,
45295,
45326,
45329,
45330,
45371,
45374,
45427,
45480,
45533,
45534,
45593,
45652,
45711,
45712,
45746,
45750,
45772,
45851,
45930,
45957,
45961,
45962,
45996,
46000,
46022,
46101,
46180,
46207,
46211,
46212,
46246,
46250,
46272,
46351,
46430,
46457,
46461,
46464,
46466,
46467,
46468,
46509,
46510,
46511,
46600,
46601,
46634,
46635,
46789,
46803,
46837,
46839,
46882,
46884,
46885,
46914,
46926,
46977,
46993,
47013,
47038,
47040,
47083,
47085,
47086,
47159,
47186,
47188,
47231,
47233,
47234,
47235,
47462,
47476,
47514,
47527,
47554,
47584,
47601,
47634,
47636,
47679,
47681,
47682,
47683,
47779,
47793,
47826,
47828,
47867,
47896,
47898,
47899,
47926,
47928,
47962,
47985,
47987,
47988,
48013,
48015,
48045,
48066,
48068,
48069,
48081,
48082,
48083,
48116,
48117,
48279,
48378,
48515,
48516,
48810,
48824,
48894,
48896,
48973,
48974,
49010,
49053,
49096,
49139,
49212,
49218,
49291,
49334,
49377,
49420,
49427,
49429,
49430,
49431,
49501,
49502,
49652,
49666,
49757,
49821,
49852,
49853,
49854,
49923,
49929,
49935,
49966,
49978,
49999,
50000,
50005
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 50005,
"ccnet_original_nlines": 918,
"rps_doc_curly_bracket": 0.0025597400963306427,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.03239813074469566,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014584730379283428,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.8787575364112854,
"rps_doc_frac_unique_words": 0.30934807658195496,
"rps_doc_mean_word_length": 6.163745403289795,
"rps_doc_num_sentences": 471,
"rps_doc_symbol_to_word_ratio": 0.00033400001120753586,
"rps_doc_unigram_entropy": 6.662615776062012,
"rps_doc_word_count": 6504,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0375664085149765,
"rps_doc_frac_chars_dupe_6grams": 0.02010527066886425,
"rps_doc_frac_chars_dupe_7grams": 0.00972834974527359,
"rps_doc_frac_chars_dupe_8grams": 0.00409090006724,
"rps_doc_frac_chars_dupe_9grams": 0.0028935601003468037,
"rps_doc_frac_chars_top_2gram": 0.0026191698852926493,
"rps_doc_frac_chars_top_3gram": 0.0026940100360661745,
"rps_doc_frac_chars_top_4gram": 0.0040160599164664745,
"rps_doc_books_importance": -4468.94482421875,
"rps_doc_books_importance_length_correction": -4468.94482421875,
"rps_doc_openwebtext_importance": -2193.80908203125,
"rps_doc_openwebtext_importance_length_correction": -2193.80908203125,
"rps_doc_wikipedia_importance": -1127.9228515625,
"rps_doc_wikipedia_importance_length_correction": -1127.9228515625
},
"fasttext": {
"dclm": 0.6925124526023865,
"english": 0.00003128000025753863,
"fineweb_edu_approx": 2.2529733180999756,
"eai_general_math": 8.299999763039523e-7,
"eai_open_web_math": 0.48826587200164795,
"eai_web_code": 0.7776424288749695
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,550,165,976,949,127,700 |
Home
SD Card Formatter
How To Format Pi SD Cards Using SD Formatter - Raspberry
Sandisk Sd Card Formatter - Shop High Speed Storage No
1. The SD Memory Card Formatter does not format the protected area in the SD/SDHC/SDXC Cards. The protected area shall be formatted by an appropriate PC application or SD host devices that provide SD security function. The SD Memory Card Formatter doesn't support SD/SDHC/SDXC Card encrypted by the BitLocker To Go functionality of Windows
2. PRODUCT. SDA Software means the object code version of the SD Memory Card Formatter tool program (s) provided, via delivery or electronic transmission to You
3. SD Formatter is a program (application) that allows easy and quick access to SD, SDHC, and SCXC memory card formats, and has been framed to clear out all the files stored on your SD card at one time
4. Follow the simple steps to download and install SD formatter on windows: Download SD card formatter tool (application). Start and Run the SD Formatter Application. Select the drive letter for the SD card
5. Run the SD Formatter Application 2. Select the drive letter for the SDHC/SDXC card and then select format. 3
6. SD card formatter plays an important role in the daily life, and has been widely used in every aspect of our life. MiniTool Partition Wizard is the best SD formatter that supports various file systems. Download the freeware to have a try
7. SD Memory Card Formatter - Windows & macOS SD Formatter Developed by the SD Association (SDA), the SD Memory Card Formatter is universally adopted for formatting SD memory card, SDHC memory card and SDXC memory card. It's a trustworthy brand that particularly resolves SD card issues by formatting, at the same time, keeps the original performance
SD Card Formatter is a simple and basic formatted which is designed to be used with SD, SDHC and SDXC memory cards. The application itself isn't too different from the format utility included with Windows and includes two modes: Quick format and Overwrite format. CHS format size adjustment is the only other option SD Card Formatter is a program that provides quick and easy access to all memory card formats like SD, SDHC and SCXC, and has been designed so that you can get rid of all the content stored on your SD card in one go With the free SD card formatter FAT32, you will be able to easily and successfully format 32GB+ SD card to FAT32 in Windows 10,8,7 SD Card Formatter Utility If your looking to Format you SD Card that you feel has been Hosed and is longer working, its best to NOT Use the Windows Format utility, as many times these cards will stop functioning if incorrectly formatted. SDCard.org has a great utility for formatting SD/SDHC/SDXC cards that have become unusable
What are SD Card Formatters ? SD card formatter software for PC are used by the user in two forms. Either there are SD card formatter software free download or else there are the sd card formatter software online, which is used. These helps to use the SD card optimally The SD Card Formatter is an alternative method to format an SD card on your Windows PC as well as Mac. It involves downloading a free SD card formatter provided by the SD Association. This software has been made with SD card security standards and is optimized for memory cards
Insert the SD card into your computer. Open File Explorer and locate the drive letter for your SD card. Right-click the drive and select Format. If the Capacity of your SD card is less than 64 GB, set the File System to FAT32 Windows Explorer is another SD formatter that enables you to format Micro SD card or other SD memory card to NTFS, FAT, FAT32, and exFAT. Like Disk Management, it can't format an SD card over 32 GB to FAT32. Tips: When you try to format your SD card in Windows Explorer, you probably meet the Windows was unable to complete the format problem Format SD card with Windows Disk Management Disk Management is a Windows built-in tool that for managing disks on your computer. It also can be used to format storage devices like SD card, pen drive, memory card, etc. Do as following steps In order to format SD, SDHC and SDXC memory cards, the Free SD Formatter can be considered by users. It is an easy tool that can be downloaded for free and used by anyone without any glitches
How To Format SD Card To FAT32 | Win 10/8
To format SanDisk, three built-in SD card formatters are provided, and they are CMD.exe, Disk Management utility, and Windows Explorer. However, these memory card format tools have one shortcoming in common: they offer limited file systems such as NTFS, FAT, FAT32 and exFAT based on the partition size SD Card Formatting in 7 Free Ways. SD Card Formatter #1 - SD Memory Card Formatter 5.0.1 for SD/SDHC/SDXC. This tool is provided on SDCARD.ORG for downloading and formatting sd memory card online created by SD Association. It comes as the best sd card formatter as it was made with sd card security standards and it was optimized for memory cards
It is very easy to format a SD card either on computer or other digital devices. You can format any partition except system partition in Windows Explorer by right-clicking the drive and selecting Format option. Besides, there is usually a Format option on digital device, which allows users to format memory card if necessary Whether the card is SDHC or SDXC, the SD Card Formatter will make sure it's formatted correctly and ready for use. And the filesystem will be optimized for its intended use on an SD card rather than, say, an old-school magnetic hard drive. The app is called SD Card Formatter, and it's available in Mac and Windows versions The microSD cards in dashcams are submitted to a large number of writing cycles. This is especially true for smaller microSD cards (16GB and 32GB). In order to maintain optimal performance over time of microSD cards up to 32GB, it is recommended to use this dedicated SD Card Formatter, available for Mac OS and Windows PC Today, there are 3 major formats of SD cards. They are the FAT16, FAT32, and exFAT formats. Each format represents classes of SD cards based on specifications provided by the SD association. The FAT16 format is found in SD cards and their capacities are from 128Mb to 2Gb of data
SD Memory Card Formatter SD Associatio
SD Memory Card Formatter is a Cleaning and Tweaking application like TestDisk, ProduKey, and ShutUp10 from SD-3C LLC. It has a simple and basic user interface, and most importantly, it is free to download. SD Memory Card Formatter is an efficient software that is recommended by many Windows PC users Follow the steps you can find here. Ubuntu images (and potentially some other related GNU/Linux distributions) have a peculiar format that allows the image to boot without any further modification from both CDs and USB drives. /dev/xxx contains GPT signatures, indicating that it has a GPT table Download Win32 Disk Imager for free. A Windows tool for writing images to USB sticks or SD/CF cards . This program is designed to write a raw disk image to a removable device or backup a removable device to a raw image file. It is very useful for embedded development, namely Arm development projects (Android, Ubuntu on Arm, etc) Right-click the partition on the SD card and select Format option in the menu list. Select a file system format for the SD card like FAT32 or NTFS to continue formatting the SD card. Click to tweet. Fix 8. Change a New Micro SD Card. If the SD card still can't work, then you may change a new micro SD card for your device The SD Memory Card Formatter formats SD Memory Card, SDHC Memory Card and SDXC Memory Card (respectively SD/SDHC/SDXC Cards) complying with the SD File System Specification created by the SD Association (SDA). Continue Reading 4 Free Tools To Test RAM Memory For Windows, Linux and Mac
Nintendo recommends using the SD Association's SD Memory Card Formatter to format any SD cards that will be used with a Nintendo product. Nintendo products strictly adhere to the SD card standard. Instructions on using this tool can be found at the bottom of the tool's page on the SD Association website Convert external SD Card to internal. Partial conversion: 10%, 50%, and 90% of total space. Included ADB server within the package. Without root. DOWNLOAD. Its developer compressed the file in .zip format. You will need either WinRAR or 7Zip to decompress it. Grab the SD Card Formatter tool from the direct link. How to use If you want to format SD card after removing write protection, follow the steps below: Step 1: Click Start, type Run in the search bar and hit Enter. Step 2: Now in the run box, type CMD and hit OK. Step 3: This will open command prompt window, type diskpart to run diskpart utility. Step 4: Next, type list. Visit the Official SD Formatter website and download the installer for your operating system. Step 1 - Run. Insert your SD card and run the SDFormatter application : Note how my card only appears to have a capacity of 56MB despite being a 4GB card. Double check the drive letter. Then check it again. You do not want to format another device by. SD Memory Card Formatter 5.0 now supports Mac and Windows 10. Helsinki, Finland - September 11, 2017 - Tuxera, the world leading storage and networking technology company, today announced its updated version of the SD Memory Card Formatter is available on the SD Association's website.This software is the official tool for formatting SD, SDHC and SDXC memory cards
The Best Reliable FAT32 Formatter (for Windows)
SD Memory Card Formatter for Windows Download SD Associatio
1. Disk Drill SD Card Repair Tool. Disk Drill is a feature-packed SD card repair tool capable of performing a full scan of a corrupted SD card and recovering all data from it with a few clicks. It supports all file systems that are typically used to format SD cards, including FAT16, FAT32, exFAT, and NTFS Download SD Card Formatter 5.0.1 for Windows for free, without any viruses, from Uptodown. Try the latest version of SD Card Formatter 2019 for Window
SD Card Formatter - Download SD Memory Card formatter 202
1. imal data loss. The SD Memory Card Formatter, developed by Tuxera, handles SD memory cards in accordance with standards defined by the SD Association. In fact, it's the official tool for formatting any SD, SDHC, and SDXC.
2. Format Size Adjustment is no longer an option in SD Card Formatter version 5, as it is the default now. So any type of format in SD Card Formatter V5 will restore the card's full capacity (even quick format). It's a little confusing because the links still point to SD Card Formatter 4, but what you download is version 5
3. File Allocation Table, or FAT, is a filing system used in computer memory systems and cards, such as those manufactured by SanDisk. There are 12-, 16- and 32-bit versions of the FAT system. Because of the significant amount of memory capacity associated with the SanDisk card, it is a popular choice for portable data storage
4. Note: If the 64GB SD card only has a single partition, you can't directly format the partition to FAT32 with Disk Management. Windows Disk Management only allows you to format a drive under 32GB to FAT32. To solve this, you can right-click the partition on the SD card and choose Shrink to shrink the partition (limited to NTFS partition) to 32GB. . Right-click the Free space and click New.
SD Card Formatter (formerly SDFormatter) Mac 5
Download SD Card Formatter for Windows and Mac (UPDATED
Using SD Formatter Tool to restore full capacity on SDHC
1. Also included are utilities that allow you to safely format and wipe media cards. Compatible with all types of digital media including Memory Stick, SmartMedia, CompactFlash, all types of SD cards, XD cards, MMC, USB flash drives and any other type of flash storage media
2. utes using this.
3. SD cards do not need to be formatted. Formatting is an old term specific for magnetic disks, where you prepare the tracks and sectors for actual data (they are not defined by disk, but by the head when you format the disk. So formatting is very slow. Now formatting is not more such slow process, so it is not really formatting
4. SD Card Formatter is a software that provides quick and easy access to all SD, SDHC, and SCXC memory card formats. It's designed so you can get rid of everything saved on your SD memory card all in one go. It's advisable to use SD Card Formatter to get better performance out of your SD cards, since they can crash with everything being sent to.
5. Format your SD card once with SDFormatter to clear any extra partitions that may have been added with something like a Raspberry Pi image: Insert your SD or MicroSD card into your computer and load the SDFormatter software. Select the drive your SD card is in from the drop-down menu
6. Downloadhttps://www.sdcard.org/downloads/formatter_4/SD Memory Card Formatter 5.0 for SD/SDHC/SDXCSDcard Formatter software, can format SD, SDHC, SDXC automa..
SD Card Formatter & How Do I Format SD Card Quickl
The description of Sd Card Formatter App. Sd Card Formatter is an app which is used to format sdcard data. Just click on the erase button, the app will erase all the data on the SD card of the phone . Selection of the SD card internal or external to format. know the path of memory before you format. **** Be caution while erasing the data******* 1- HP USB Disk Storage Format Tool. HP USB Disk Storage Format Tool can format any Memory card or USB flash drive. HP USB Disk Storage Format utility support formatting with FAT, FAT32, or NTFS partition types. Hp Format tool can format and repair the following Compact Flash, CF Card II, Memory Stick Duo Pro, SDHC, SDXC, Thumb Drive and Pen Drive Format the SD card to restore it to its original state. If you want to give the SD card to someone else, format it twice and be sure your files cannot be recovered. Format the SD card, fill it with public domain images, and format it again. Or reformat the SD card if the other person uses a different operating system This allows the buyer to use the SD card on any device without having to go through the formatting procedure. Whenever an SD card is formatted, a new file system is assigned to it, either as FAT32, exFAT, or NTFS. A file system is basically the handshake between the SD card and the device. It is the system by which the device can. Formatting an SD card. In principle, you can use an SD card without a file system, but it is not very convenient. It is better to use the FAT16 or FAT32 format to work with Arduino. This is mainly due to the availability of appropriate libraries: some support one format, some support another. The Arduino SD library supports both formats
Top 5 SD Card Formatter Free Download Format SD Card on
1. Formatting SD card is equivalent to simply resetting the card. It will erase all data on the SD card, such as pictures, videos and documents. Besides, it can fix many troubles on the SD card. When you meet with these situations, try to format the SD card: SD card cannot be detected by smart phones, computers and digital cameras
2. O SD Card Formatter é um programa que fornece acesso rápido e fácil a todos os formatos de cartões de memória, como SD, SDHC e SCXC, e foi desenhado para que se livre de todo o conteúdo armazenado no seu cartão SD de uma só vez. É recomendável utilizar o SD Card Formatter para obter um desempenho ótimo dos seus cartões SD, pois.
3. Format SD card on purpose: sometimes you want to clear all data on memory card quick in order to get free space. In this case formatting is a good choice To remove virus: SD card and other USB drives tend to infect virus, for they might be connected to many devices
4. 4. Optional SD Card Formatter - Diskpart. Using Diskpart to do SD card/memory card format is a little more complex than the above-mentioned methods. Step 1. Type diskpartin command prompt, and press Enter key, then confirm you want to allow this app to make changes to your PC. Step 2
5. Important: Formatting the SD card will delete all data on the SD card. You will not be able to recover this data. What to do. Nintendo recommends using the tool provided by the SD Association to format any SD cards that will be used with a Nintendo product. Nintendo products strictly adhere to the SD Card standard
6. I show you how to format (erase/delete) the micro sd card while it is inside the Amazon Fire HD 8 Tablet. Hope you find this helpful. Fire HD 8 Tablet (8 HD..
7. Format SD Card with AOMEI Partition Assistant. As for 32GB+ SD card capacity, the powerful formatter-AOMEI Partition Assistant Standard is the best option. It doesn't have capacity limitations. You can easily format an SD card beyond 32GB to the FAT32 file system in Windows. And besides FAT32, it also supports formatting a drive to NTFS.
SD Card Formatter - Downloa
1. In the FAT32 Format window, select the drive to format and type a volume label if you want to. Select the Quick Format option, and then click the Start button. Advertisement. A window pops up to warn you that all data on the drive will be lost. Click OK to format the drive. Formatting with this tool is much quicker.
2. Netac 32GB Micro SD Card 2-Pack, MicroSDHC Card 32GB Memory Card - UHS-I, 90MB/s, 600X, U1, C10, V10, A1, FAT32 TF Card Micro SD Card. 4.6 out of 5 stars. 24,972. $11.99. $11. . 99. Get it as soon as Tue, Jun 8. FREE Shipping on orders over $25 shipped by Amazon
3. utes using.
6+ Best Fat32 Formatter Free Download for Windows, Mac
SD Card Formatter 5
SD Card Formatter FAT32 Free Download (Windows 10, 8, 7
SD Card Formatter Utility for fixing Corrupt SD/SDHC/SDX
HP USB Disk Storage Format Tool is a useful utility software for Windows computers. With this program, you can easily format any USB drive in NTFS, FAT32, or FAT file systems. Additionally, the tool can create DOS startup disks, which let you conveniently boot a Windows PC. Since the program is available in the form of a freeware portable app. Trusted Windows (PC) download SD Card Formatter 5.0.1. Virus-free and 100% clean download. Get SD Card Formatter alternative downloads
Memory Stick Formatter is a freeware software download filed under hard drive formatters and made available by Sony for Windows. The review for Memory Stick Formatter has not been completed yet, but it was tested by an editor here on a PC. Provides formatting support for memory cards made by Sony. Memory Stick Formatter is a simple and fast. The SD Memory Card Formatter formats SD Memory Card, SDHC Memory Card and SDXC Memory Card (respectively SD/SDHC/SDXC Cards) complying with the SD File System Specification created by the SD Association (SDA) 10. Select a file system. Click one of the following options (you may also see additional options in the menu): FAT32 — Formats the memory card for most platforms with a 4 GB file size limit (e.g., no file on the card can be over 4 GB in size). NTFS — Formats the memory card for Windows only
How to Solve “You Need to Format the Disk” for SD Card?
3. Tap on the Format SD card option. Once in your phone storage page, you will see a graph that shows how much memory all your storage areas are taking up. You want to tap on SD card. Formatting your SD card will erase all of the contents of it. Make sure that you have backed up your data elsewhere Even though you can/could use your SD card 'raw' - it's most convenient to format the card to a filesystem. For the Arduino library we'll be discussing, and nearly every other SD library, the card must be formatted FAT16 or FAT32. Some only allow one or the other. The Arduino SD library can use either To use a new SD card in cameras, phones or other devices, it is better to format it first, otherwise, the SD card may be not supported by the new device, or it does not work in best performance. It is recommended to use the SD Memory Card Formatter to format SD Cards rather than using formatting tools provided with Windows or Mac OS
6+ Best SD Card Formatter Software Free Download for
Method 2: Clean your SD card & reader. Another very common cause of an unrecognized SD card is a very simple one: a dirty SD card or a dusty card reader. Either will cause a poor contact between card and reader. So the second thing you should do is give your card a clean, and remove any dust from the reader, then try the card again If you haven't yet tried out the built-in format facility in Windows, ensure your SD card is inserted into your laptop or a USB card reader if your laptop or PC doesn't have the appropriate slot. Open up Windows Explorer (Windows key +E is the shortcut) and click on This PC But with SD Express being the response from the SD Association, the organization that controls SD card standards, it seems that another memory card format war is about to kick off
The SD mounting is hit and miss. I started from scratch. I used a new 32gb sd card formatted with SD Card Formatter. Format was perfect. I inserted SD and hit reboot. Reboot did not mount. I used Shutdown; it worked. The SD mounted perfect. I installed modules to SD and dependencies via the Pinneapple Using SD Formatter has worked every time with different SD Cards, makes and sizes. 1. Install SD Formatter on your pc. 2. Insert SD card into pc and format with SD Formatter. 3. Download firmware and save to pc. 4. Open downloaded file (zip or rar) with I have tried formatting the SD card using the disk management, and the MiniTool Partition wizard, and the disk management method gives me a 'Could not complete format' error, and the MiniTool tells me it has changed, yet when I go on disk management it hasn't An SD card of any size (yes, a microSD card inside of an SD card adapter will also work). A computer. The newest version of Swiss from here. Instructions: Plug in your SD Card of choice into your PC. Format the SD Card into Fat32. (Note, if your SD Card is a large capacity, you may have to use SD Card Formatter for Win/MacOS.
RAW SD Card Overview. RAW is a format that an SD card acquires when, for various reasons, its file system is damaged. A RAW SD card, unfortunately, becomes unreadable by any operating system. RAW, here, means raw material; that is, in order to, say, return to NTFS format on FAT32 SD card, you need to do something with it Why format an SD memory card? Memory card formatting is the process of preparing a flash memory device for data storage.It cleans the Secure Digital (SD, SDHC, SDXC) card by removing previously existing data and information on the card (low level formatting) and creating a new file system (high level formatting) 5 Pack - SanDisk Ultra 16GB SD SDHC Memory Flash Card UHS-I Class 10 Read Speed up to 48MB/s 320X SDSDUNB-016G-GN3IN Wholesale Lot + (5 Cases) 4.8 out of 5 stars. 5,259. Personal Computers. $24.39
5 Best SD Card Formatter Software in 2021 - Project GoPr
7. Enter the following command sequence> fat32format h: (or whatever drive designates the location of your SD card) 8. You will be prompted to confirm a wipe and format of your SD card. Type y and hit enter. 9. In approximately 5 seconds, your SD card will be FAT32 formatted. 10 If you are unable to format your SD card, use a formatting software such as SDFormatter provided by SD Association. Formatting software can fix corrupt SD cards and make them reusable.Although formatting fixes corrupt SD card, but the process deletes all your stored videos, photos, and other files on it SD Card Formatter es un software que proporciona un acceso rápido y sencillo a todos los formatos de tarjetas de memoria SD, SDHC y SCXC diseñado para que puedas deshacerte de una vez de todo el contenido almacenado en tu memoria SD. Es recomendable usar SD Card Formatter para tener un rendimiento óptimo de éstas, que pueden colapsarse con.
How to Format an SD Card on Windows - Lifewir
SD Card Speed. The only application to test the speed of your SD Card interface! Current test shows write speed by creating big file on SD card and calculating time required to write data to the file. This is real speed of your SD Card interface, not the speed of card as specified by vendor. v 2.2 - Improved free size calculation - Improved. In order to fully format and reclaim the full capacity of the SD card, follow steps: Right-click This PC/My Computer > Manage. Select Disk Management under Device Manager, find and right-click on SD card, and select Format Volume. Rename and reset file system of SD card to NTFS or FAT32 as your need, follow the on-screen guidelines to complete. To format a microSD/SD card on a Mac OS X computer. 1. Place the SD card into the SD card slot in the device. 2. Connect your device to the computer with a USB cable. If your device is not recognized by the computer, see the FAQ Automotive Device Not Detected by Garmin Express on a Mac. 3
SD Card Formatter, free download. The SD Memory Card Formatter formats SD Memory Card, SDHC Memory Card and SDXC Memory Card (respectively SD/SDHC/SDXC Cards) complying with the SD File System Specification created by the SD Association (SDA). It is strongly recommended to use the SD Memory Card Formatter to format SD/SDHC/SDXC Cards rather than using formatting tools provided with individual. To format a SD car without the extra files on OSX, follow these notes on Ladyada's site. Linux: With a SD card inserted, open a terminal window. At the prompt, type df, and press enter. The windows will report the device name of your SD card, it should look something like /dev/sdb1. Unmount the SD card, but leave it in the computer Formatting removable media like a USB disk or an SD card is a pretty simple task on Ubuntu Linux. No, I won't be using the terminal here although you can always use the command line on Linux. I'm going to show you how to format a USB on Ubuntu or other Linux distributions graphically. Format USB disks on Ubuntu & other Linux distribution Selecting an SD card to format. A few moments later you will see a confirmation that the format has been completed and you SD card is now ready for the next stage. Formatting the SD card Download Image Writer. In order to flash the SD card in Windows, it is necessary to first download a third-party application named Image Writer
Mini-memory card series transparent PNG icon Download FreeHow To Fix And Recover Full Data From Corrupt SD Card
Format SD or USB disk via command line. Once you've inserted the SB or USB disk into your computer, open a terminal and type the following commands to format it: First, let's figure out how to identify the media we wish to format. The name should start with /dev/sd and then a letter. Type the following command in terminal to see Most SD cards use the FAT32 file format, and preformatted FAT32 SD media is commonly available up to a capacity of 32GB. Media that exceeds 32GB usually uses the exFAT file system, while some smaller capacity cards use the FAT16 file format. Preformatted FAT16 media is generally available up to a capacity of 2GB Why to Format RAW SD Card at Last . Formatting process can clean everything on a card and give this card a new beginning. Therefore, in case of any farther card data loss problem, you'd better rescue your data before formatting. Moreover, the formatting process also is the simplest way to fix RAW file system
How to Format an Unformattable Pendrive or Memory Card
|
{
"url": "https://najde-centrale.com/316977/how-to-format-usb-drives-larger-than-32gb-with-fat32-on-windows/-ixds1815p-r",
"source_domain": "najde-centrale.com",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "43840",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MWTUEAMLTNUBRJQ6UHPKRERF6V5CC3J3",
"WARC-Concurrent-To": "<urn:uuid:293662c3-48fc-4adc-83d6-e8b479dbfb64>",
"WARC-Date": "2022-06-29T06:26:40Z",
"WARC-IP-Address": "5.61.49.174",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WSV3MYCTPYSZWNGB57MNNK24L7A7S4LX",
"WARC-Record-ID": "<urn:uuid:1e0f1be1-f3e9-4d68-b420-af093fb65021>",
"WARC-Target-URI": "https://najde-centrale.com/316977/how-to-format-usb-drives-larger-than-32gb-with-fat32-on-windows/-ixds1815p-r",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:151d188a-6e64-45e6-a2f7-06db6f0dbe00>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-87\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
5,
6,
24,
25,
82,
83,
138,
139,
481,
644,
848,
1057,
1171,
1414,
1767,
1768,
2760,
2761,
3309,
3310,
4311,
4312,
4354,
4355,
5005,
5006,
6259,
6260,
6299,
6300,
7837,
7838,
9489,
9490,
9538,
9539,
9599,
9600,
10058,
10059,
10117,
10118,
10345,
10672,
11003,
11400,
11447,
11448,
11504,
11505,
11562,
11563,
11840,
11862,
12195,
12546,
12835,
13000,
13001,
13052,
13053,
14740,
14741,
14797,
14798,
15133,
15469,
15740,
16030,
16351,
16515,
16860,
16861,
16889,
16890,
17213,
17481,
17498,
17553,
17554,
17574,
17575,
17631,
17632,
17689,
17690,
18171,
18172,
19018,
19019,
19075,
19076,
20014,
20015,
20068,
20069,
20858,
20859,
22004,
22005,
22839,
22840,
22897,
22898,
23826,
23827,
23873,
23874,
24855,
24856,
26258,
26259,
26371,
26372,
27327,
27328
],
"line_end_idx": [
5,
6,
24,
25,
82,
83,
138,
139,
481,
644,
848,
1057,
1171,
1414,
1767,
1768,
2760,
2761,
3309,
3310,
4311,
4312,
4354,
4355,
5005,
5006,
6259,
6260,
6299,
6300,
7837,
7838,
9489,
9490,
9538,
9539,
9599,
9600,
10058,
10059,
10117,
10118,
10345,
10672,
11003,
11400,
11447,
11448,
11504,
11505,
11562,
11563,
11840,
11862,
12195,
12546,
12835,
13000,
13001,
13052,
13053,
14740,
14741,
14797,
14798,
15133,
15469,
15740,
16030,
16351,
16515,
16860,
16861,
16889,
16890,
17213,
17481,
17498,
17553,
17554,
17574,
17575,
17631,
17632,
17689,
17690,
18171,
18172,
19018,
19019,
19075,
19076,
20014,
20015,
20068,
20069,
20858,
20859,
22004,
22005,
22839,
22840,
22897,
22898,
23826,
23827,
23873,
23874,
24855,
24856,
26258,
26259,
26371,
26372,
27327,
27328,
27382
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 27382,
"ccnet_original_nlines": 116,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.32888734340667725,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.09319058805704117,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15654616057872772,
"rps_doc_frac_unique_words": 0.2170397937297821,
"rps_doc_mean_word_length": 4.490671634674072,
"rps_doc_num_sentences": 306,
"rps_doc_symbol_to_word_ratio": 0.00017549999756738544,
"rps_doc_unigram_entropy": 5.569622993469238,
"rps_doc_word_count": 4824,
"rps_doc_frac_chars_dupe_10grams": 0.039283569902181625,
"rps_doc_frac_chars_dupe_5grams": 0.13248395919799805,
"rps_doc_frac_chars_dupe_6grams": 0.08646079152822495,
"rps_doc_frac_chars_dupe_7grams": 0.06287217885255814,
"rps_doc_frac_chars_dupe_8grams": 0.050177719444036484,
"rps_doc_frac_chars_dupe_9grams": 0.039283569902181625,
"rps_doc_frac_chars_top_2gram": 0.04653095081448555,
"rps_doc_frac_chars_top_3gram": 0.03392881900072098,
"rps_doc_frac_chars_top_4gram": 0.019387900829315186,
"rps_doc_books_importance": -2169.73828125,
"rps_doc_books_importance_length_correction": -2169.73828125,
"rps_doc_openwebtext_importance": -1357.8338623046875,
"rps_doc_openwebtext_importance_length_correction": -1357.8338623046875,
"rps_doc_wikipedia_importance": -1093.8271484375,
"rps_doc_wikipedia_importance_length_correction": -1093.8271484375
},
"fasttext": {
"dclm": 0.025097010657191277,
"english": 0.8749914169311523,
"fineweb_edu_approx": 1.469859004020691,
"eai_general_math": 0.015044869855046272,
"eai_open_web_math": 0.08420127630233765,
"eai_web_code": 0.0202938299626112
}
}
|
{
"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.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": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,416,343,475,508,714,000 |
Take the 2-minute tour ×
Web Applications Stack Exchange is a question and answer site for power users of web applications. It's 100% free, no registration required.
Is there any possibility that a webapp or website I am using could be tracking or recording what I type on the page (into no box) or into input or textboxes without me having submitted a form/clicked a button after doing the typing?
For example, what happens if I accidentally paste a username/password into a text form on a website I am visiting?
share|improve this question
add comment
3 Answers 3
up vote 9 down vote accepted
This is definitely possible. JavaScript can track any text which is typed in a text field. If you've ever used Google Wave (or former Etherpad) than you know the live typing feature (if you write an character it is almost immediately visible for the user users).
But despite the technical possibility you shouldn't worry about that issue. It is not practical for any website the capture such rare events. It would require a huge manual effort the get the passwords out of the whole garbage which gets sent to the server. As an addition no one knows for which website this password was.
If it was an highly sensitive account (like online banking or the code for firing nuclear weapons or whatever) just change it immediately.
share|improve this answer
add comment
It is possible to do it using JavaScript so in general you have to trust the website.
Lots of websites support keyboard shortcuts. For example enable the keyboard shortcuts in your Gmail (I suppose you are using Gmail, since you have that avatar) and then just press ? to see it in action.
share|improve this answer
add comment
Yes.
If it was an ASP.NET site (for example) the writer could write code that handles the KeyDown or TextChanged events for text boxes and store and send what you type. The same would be true for other languages.
share|improve this answer
add comment
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://webapps.stackexchange.com/questions/4006/can-webapps-track-what-i-am-typing-before-i-send-the-data",
"source_domain": "webapps.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2014-23",
"warc_metadata": {
"Content-Length": "68103",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZIN3SBSRQQXJXNOT7YNLMISWHESB7SMZ",
"WARC-Concurrent-To": "<urn:uuid:b7097b3d-045f-4857-ae3e-e0f1c0952794>",
"WARC-Date": "2014-07-23T13:20:02Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:Y65ZBOVWU5OTMDHMC27HTS3GQKQP7XNP",
"WARC-Record-ID": "<urn:uuid:dab33919-f224-4514-b367-d9770c604790>",
"WARC-Target-URI": "http://webapps.stackexchange.com/questions/4006/can-webapps-track-what-i-am-typing-before-i-send-the-data",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:61fbca02-2c87-43ee-9d15-893393cfebbf>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-33-131-23.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,
25,
166,
167,
400,
401,
516,
517,
545,
557,
558,
570,
571,
600,
601,
864,
865,
1188,
1189,
1328,
1329,
1355,
1367,
1368,
1454,
1455,
1659,
1660,
1686,
1698,
1699,
1704,
1705,
1913,
1914,
1940,
1952,
1953,
1965,
1966,
1968,
1976,
1977,
2055,
2056
],
"line_end_idx": [
25,
166,
167,
400,
401,
516,
517,
545,
557,
558,
570,
571,
600,
601,
864,
865,
1188,
1189,
1328,
1329,
1355,
1367,
1368,
1454,
1455,
1659,
1660,
1686,
1698,
1699,
1704,
1705,
1913,
1914,
1940,
1952,
1953,
1965,
1966,
1968,
1976,
1977,
2055,
2056,
2146
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2146,
"ccnet_original_nlines": 44,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4372093081474304,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0162790697067976,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1302325576543808,
"rps_doc_frac_unique_words": 0.54347825050354,
"rps_doc_mean_word_length": 4.63586950302124,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.947457790374756,
"rps_doc_word_count": 368,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.056271981447935104,
"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.03751464933156967,
"rps_doc_frac_chars_top_3gram": 0.03868699073791504,
"rps_doc_frac_chars_top_4gram": 0.04396248981356621,
"rps_doc_books_importance": -232.98504638671875,
"rps_doc_books_importance_length_correction": -232.98504638671875,
"rps_doc_openwebtext_importance": -114.5573959350586,
"rps_doc_openwebtext_importance_length_correction": -114.5573959350586,
"rps_doc_wikipedia_importance": -95.9183578491211,
"rps_doc_wikipedia_importance_length_correction": -95.9183578491211
},
"fasttext": {
"dclm": 0.6753168702125549,
"english": 0.9157593846321106,
"fineweb_edu_approx": 1.9260467290878296,
"eai_general_math": 0.0009591599809937179,
"eai_open_web_math": 0.07009732723236084,
"eai_web_code": 0.0001623599964659661
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.8",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "358.5",
"labels": {
"level_1": "Social sciences",
"level_2": "Public administration and Military art and science",
"level_3": "Weapons, Armor, Air power, and Military engineers"
}
}
},
"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": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
202,976,690,204,132,060 |
DAM vs. MAM - what's the difference?
At RSG, we publish separate research streams for Digital Asset Management (DAM) and Media Asset Management (MAM), and you may wonder why. After all, some vendors attempt to tackle the task of managing both (even if no software package does it all well).
One could also argue that you could use a web content management system to manage documents, or SharePoint to store and manage images. You could also use a sauté pan to roast a chicken, but it's probably not the approach that will bring about the best, most effective, and tasty results. Most sauté pans aren't built to withstand the heat of the oven, either.
The same is true of stretching a technology's capabilities into a scenario it's not really engineered for: you're unlikely to get an optimal result, and you may not even be able to accomplish the primary task to begin with. Worse, you could have the technological equivalent of chicken juices all over your oven, because the technology couldn't scale to the task.
DAM systems are focused first and foremost on brand assets and image management, and these vendors mostly come out of the print, typesetting, catalog production, and advertising world. The functionality is centered on the upload, management, and transformation of images to various formats, and also very unique functionality to manage, parse and search compound documents such as those created with Adobe Photoshop, InDesign, and Illustrator. Typical DAM buyers include advertising and creative agencies, marketing departments, and increasingly, CMOs. Examples of DAM vendors we evaluate can be found here.
MAM systems are focused on the needs of the broadcast media market, and origins of this technology are from the television and movie industry. The original functionality was centered on the storage, archiving, and later the distribution of high-resolution, usually long-form (20 minutes or more) time-based media assets. Increasingly, the technology focuses on multi-channel scenarios beyond television. Typical customers include broadcasters, television program producers, sports networks, government agencies, and increasingly religious institutions, corporations, and other organizations who are all morphing into mini-broadcasters in the age of YouTube. A list of the MAM vendors we evaluate can be found here.
DAM systems have modernized into a market of web-based applications, while MAM vendors continue to sell and support primarily rich clients with poor attempts at corresponding web-based versions.
"So what if I have to manage 30-second television commercials?" you may ask. That's where the crossover is between MAM and DAM. Yes, some DAM systems allow you to store, search and manage time-based media such as audio and video in rudimentary ways, which may be adequate for your needs. But if you're a broadcaster or have complex needs around video, a DAM vendor is likely inadequate.
We outline these functional differences in great detail in our evaluation research -- and we also help our subscribers sort out their particular needs via custom phone (or in-person) consultations.
Our customers say...
"The Digital Asset Management Research is a straightforward, comprehensive report that's invaluable to anyone considering or implementing digital asset management. With a no-nonsense approach to evaluating the major vendors and best practices, this report is a true handbook. It's my new bedside reading..."
Faith Robinson, Content Strategist & Industry Thought Leader
Other Digital Asset Management posts
Webinar - Your Journey to DAM 3.0
Learn where your enterprise fits in the future world of DAM, and get some ideas about where your journey should take you next.
|
{
"url": "https://www.realstorygroup.com/Blog/dam-vs-mam-whats-difference",
"source_domain": "www.realstorygroup.com",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "52293",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5KXUOWG4TLVGG5M4S77SE5Y34U6RBM42",
"WARC-Concurrent-To": "<urn:uuid:6dbc267b-50a0-4070-951d-839f63b42a6a>",
"WARC-Date": "2020-12-01T08:27:11Z",
"WARC-IP-Address": "45.79.149.105",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BQ2MQFAKME4VKYKDWCSVV67VITFF4NYH",
"WARC-Record-ID": "<urn:uuid:fe5121ee-e523-4efe-a12e-1d02c6a3cf9c>",
"WARC-Target-URI": "https://www.realstorygroup.com/Blog/dam-vs-mam-whats-difference",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:71a7dff0-19b7-42c7-b9f5-d9236583e1a7>"
},
"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-240.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,
37,
38,
292,
293,
653,
654,
1018,
1019,
1627,
1628,
2343,
2344,
2539,
2540,
2927,
2928,
3126,
3127,
3128,
3149,
3150,
3458,
3459,
3460,
3521,
3522,
3559,
3560,
3594,
3595
],
"line_end_idx": [
37,
38,
292,
293,
653,
654,
1018,
1019,
1627,
1628,
2343,
2344,
2539,
2540,
2927,
2928,
3126,
3127,
3128,
3149,
3150,
3458,
3459,
3460,
3521,
3522,
3559,
3560,
3594,
3595,
3721
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3721,
"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.4031117260456085,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02828853949904442,
"rps_doc_frac_lines_end_with_ellipsis": 0.032258059829473495,
"rps_doc_frac_no_alph_words": 0.16407355666160583,
"rps_doc_frac_unique_words": 0.5262237787246704,
"rps_doc_mean_word_length": 5.263986110687256,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0.002828849945217371,
"rps_doc_unigram_entropy": 5.263082504272461,
"rps_doc_word_count": 572,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.020591169595718384,
"rps_doc_frac_chars_dupe_6grams": 0.020591169595718384,
"rps_doc_frac_chars_dupe_7grams": 0.020591169595718384,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02490866929292679,
"rps_doc_frac_chars_top_3gram": 0.029226170852780342,
"rps_doc_frac_chars_top_4gram": 0.013284619897603989,
"rps_doc_books_importance": -329.21356201171875,
"rps_doc_books_importance_length_correction": -329.21356201171875,
"rps_doc_openwebtext_importance": -234.68890380859375,
"rps_doc_openwebtext_importance_length_correction": -234.68890380859375,
"rps_doc_wikipedia_importance": -145.89474487304688,
"rps_doc_wikipedia_importance_length_correction": -145.89474487304688
},
"fasttext": {
"dclm": 0.07184035331010818,
"english": 0.9414008259773254,
"fineweb_edu_approx": 1.3801084756851196,
"eai_general_math": 0.07108461856842041,
"eai_open_web_math": 0.10790908336639404,
"eai_web_code": 0.28943049907684326
}
}
|
{
"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.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": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "13",
"label": "News (Org.)"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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
|
3,502,775,190,201,828,000 |
• Create BookmarkCreate Bookmark
• Create Note or TagCreate Note or Tag
• PrintPrint
Loading Movies or JPGs
loadMovie is an Action that lets one Flash movie play another. Effectively, the second movie plays on top of the first. It's easier to understand, though, if you think of one movie as the host and the other movie (the one that's loaded on top of the host) as the submovie. Think of a big entertainment system—a wall of stereo and TV equipment. The movie you put into your VCR can only play on the TV screen. If you think of the TV as the host Flash movie, then video you put into your VCR is loaded on top of it.
One reason to do this is because you may have several submovies that only play one at a time. You may want to give the user the choice as to which submovie to play. If you use loadMovie, when the user clicks a button an Action tells Flash to load this movie now. It's sort of like a jukebox, where each record is a separate submovie. The reason loadMovie is beneficial is that only the submovies the user requests have to download.
PREVIEW
Not a subscriber?
Start A Free Trial
• Creative Edge
• Create BookmarkCreate Bookmark
• Create Note or TagCreate Note or Tag
• PrintPrint
|
{
"url": "http://www.creativeedge.com/book/web-development/flash/0672323710/designing-your-web-site-to-be-modular/ch19lev1sec1",
"source_domain": "www.creativeedge.com",
"snapshot_id": "crawl=CC-MAIN-2016-44",
"warc_metadata": {
"Content-Length": "71459",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EOK6BGBHSJZLQ6AHQVZSPEIRMFFGKCSY",
"WARC-Concurrent-To": "<urn:uuid:7c9ae28f-273d-4aa7-bb2e-5529bc3d9091>",
"WARC-Date": "2016-10-25T03:39:46Z",
"WARC-IP-Address": "151.101.32.64",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:4SZFSBH5PPFM7AJRJIQXIJFPEHARSRHX",
"WARC-Record-ID": "<urn:uuid:9930951c-2bb2-4b1d-bf6d-4baf8a5fdd5a>",
"WARC-Target-URI": "http://www.creativeedge.com/book/web-development/flash/0672323710/designing-your-web-site-to-be-modular/ch19lev1sec1",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:80298904-a563-49e8-b261-252d66cbeb8d>"
},
"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,
35,
76,
91,
92,
115,
116,
629,
630,
1062,
1063,
1064,
1072,
1073,
1148,
1149,
1167,
1168,
1187,
1188,
1189,
1192,
1210,
1245,
1286
],
"line_end_idx": [
35,
76,
91,
92,
115,
116,
629,
630,
1062,
1063,
1064,
1072,
1073,
1148,
1149,
1167,
1168,
1187,
1188,
1189,
1192,
1210,
1245,
1286,
1300
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1300,
"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.4448818862438202,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027559060603380203,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12204723805189133,
"rps_doc_frac_unique_words": 0.4601770043373108,
"rps_doc_mean_word_length": 4.203539848327637,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.314023494720459,
"rps_doc_word_count": 226,
"rps_doc_frac_chars_dupe_10grams": 0.14947368204593658,
"rps_doc_frac_chars_dupe_5grams": 0.18526315689086914,
"rps_doc_frac_chars_dupe_6grams": 0.14947368204593658,
"rps_doc_frac_chars_dupe_7grams": 0.14947368204593658,
"rps_doc_frac_chars_dupe_8grams": 0.14947368204593658,
"rps_doc_frac_chars_dupe_9grams": 0.14947368204593658,
"rps_doc_frac_chars_top_2gram": 0.02947367914021015,
"rps_doc_frac_chars_top_3gram": 0.0221052598208189,
"rps_doc_frac_chars_top_4gram": 0.061052631586790085,
"rps_doc_books_importance": -112.22413635253906,
"rps_doc_books_importance_length_correction": -112.22413635253906,
"rps_doc_openwebtext_importance": -69.60527801513672,
"rps_doc_openwebtext_importance_length_correction": -69.60527801513672,
"rps_doc_wikipedia_importance": -60.82548904418945,
"rps_doc_wikipedia_importance_length_correction": -60.82548522949219
},
"fasttext": {
"dclm": 0.6334133148193359,
"english": 0.9124429225921631,
"fineweb_edu_approx": 2.0544931888580322,
"eai_general_math": 0.006661420222371817,
"eai_open_web_math": 0.11900675296783447,
"eai_web_code": 0.05823647975921631
}
}
|
{
"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": "791.43",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,458,145,902,039,153,000 |
Задание параметров функции по умолчанию
We use cookies. Read the Privacy and Cookie Policy
Задание параметров функции по умолчанию
Еще одна интересная возможность, которая появляется у вас после перехода от Си к Си++, позволяет при определении функций задавать некоторые ее параметры по умолчанию. Вызывая такую функцию, можно не указывать параметры, заданные по умолчанию.
Если большинство вызовов функции выполняется с одинаковыми параметрами, это позволяет сократить текст программы, а главное, уменьшить возможность совершения ошибок во время набора параметров функции.
Параметры по умолчанию можно задать во время объявления функции или во время ее определения. По умолчанию задают только последние параметры функций:
int Summa(int first, int second, int third=0, int fourth=0) {
return(first + second + third + fourth);
}
Функцию Summa можно использовать для сложения четырех, трех или двух чисел. Если складываются два числа, то третий и четвертый параметр можно опустить:
void main() {
int value1 = 10, value2 = 20, value3 = 30, value4 = 40;
int result;
// Вызываем функцию с четырьмя параметрами
result = Summa(value1, value2, value3, value4);
print(“Сумма четырех чисел равна %d”, result);
// Вызываем функцию с тремя параметрами
result = Summa(value1, value2, value3);
print(“Сумма трех чисел равна %d”, result);
// Вызываем функцию с двумя параметрами,
// последний параметр задается по умолчанию
result = Summa(value1, value2);
print(“Сумма первых двух чисел равна %d”, result);
}
|
{
"url": "https://it.wikireading.ru/39941",
"source_domain": "it.wikireading.ru",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "108281",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IRLFHBTZ2QW4SZ3JF67Y7ARCHPLRZCJG",
"WARC-Concurrent-To": "<urn:uuid:f2e9ed0f-0221-4ba7-adc7-575c541e59e0>",
"WARC-Date": "2024-05-20T06:31:02Z",
"WARC-IP-Address": "62.109.14.131",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:22CPHDNZRQ7C74CNFO2YQ5W4VGX7NPS7",
"WARC-Record-ID": "<urn:uuid:c3e58be7-0f05-4c59-ad03-aab1cce6c442>",
"WARC-Target-URI": "https://it.wikireading.ru/39941",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e25da3e1-bb55-49c4-b788-a93142864033>"
},
"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-33\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
40,
41,
92,
93,
133,
134,
377,
378,
578,
579,
728,
729,
791,
792,
834,
835,
837,
838,
990,
991,
1005,
1006,
1063,
1064,
1077,
1078,
1122,
1123,
1172,
1173,
1221,
1222,
1263,
1264,
1305,
1306,
1351,
1352,
1394,
1395,
1440,
1441,
1474,
1475,
1527,
1528
],
"line_end_idx": [
40,
41,
92,
93,
133,
134,
377,
378,
578,
579,
728,
729,
791,
792,
834,
835,
837,
838,
990,
991,
1005,
1006,
1063,
1064,
1077,
1078,
1122,
1123,
1172,
1173,
1221,
1222,
1263,
1264,
1305,
1306,
1351,
1352,
1394,
1395,
1440,
1441,
1474,
1475,
1527,
1528,
1529
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1529,
"ccnet_original_nlines": 46,
"rps_doc_curly_bracket": 0.002616090001538396,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.042553190141916275,
"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.7943262457847595,
"rps_doc_frac_unique_words": 0.5888324975967407,
"rps_doc_mean_word_length": 6.065989971160889,
"rps_doc_num_sentences": 7,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.521524906158447,
"rps_doc_word_count": 197,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.18242678046226501,
"rps_doc_frac_chars_dupe_6grams": 0.056903768330812454,
"rps_doc_frac_chars_dupe_7grams": 0.056903768330812454,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.06443514674901962,
"rps_doc_frac_chars_top_3gram": 0.05271967127919197,
"rps_doc_frac_chars_top_4gram": 0.05523012951016426,
"rps_doc_books_importance": -103.53782653808594,
"rps_doc_books_importance_length_correction": -92.57203674316406,
"rps_doc_openwebtext_importance": -58.924068450927734,
"rps_doc_openwebtext_importance_length_correction": -58.924068450927734,
"rps_doc_wikipedia_importance": -33.11271286010742,
"rps_doc_wikipedia_importance_length_correction": -20.06037139892578
},
"fasttext": {
"dclm": 0.8278524875640869,
"english": 0.00019027000234927982,
"fineweb_edu_approx": 2.9916317462921143,
"eai_general_math": 0.0002895600046031177,
"eai_open_web_math": 0.2895861268043518,
"eai_web_code": 0.6234972476959229
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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,127,426,026,074,982,000 |
Sort by
Date Activity Answers Votes
59 questions
Tagged
• x
37
views
4
answers
0
votes
2016-11-27 22:53:59 +0800 Darksu
Zk Combobox onOpen Event issue
35
views
1
answer
0
votes
2016-11-21 10:01:41 +0800 Darksu
Selectbox items with label and value
20
views
1
answer
0
votes
2016-10-31 05:29:38 +0800 Darksu
Combobox with multiple items taking longer time to render
24
views
1
answer
0
votes
2016-10-18 07:35:04 +0800 chillworld flag of Belgium
Binding 2 Combobox on Listbox
39
views
3
answers
0
votes
2016-09-16 08:31:16 +0800 Darksu
Combobox issue :Taking time to load
11
views
0
answers
0
votes
2016-08-25 21:13:05 +0800 scottz
Combobox autodrop with autocomplete obscures text entry area
10
views
0
answers
0
votes
2016-07-15 23:29:17 +0800 HiteshR
infinite parent child hierarchy combobox
10
views
1
answer
0
votes
2016-05-31 10:15:18 +0800 Aditi
In combo Scrolling item should not come as selected item
14
views
1
answer
0
votes
2016-04-21 06:55:11 +0800 chillworld flag of Belgium
want different value on selecteditem and combo dropdown
54
views
9
answers
1
vote
2016-04-18 10:53:47 +0800 chillworld flag of Belgium
Autoscroll on selecteditem on combo not working
14
views
1
answer
0
votes
2016-02-08 10:30:53 +0800 Darksu
combobox previuos value is getting populated
11
views
1
answer
0
votes
2016-01-04 15:54:27 +0800 Darksu
Dynamically populate combox box using composer
32
views
0
answers
0
votes
2015-11-24 16:14:49 +0800 KlausWr
Autodisable for combobox?
31
views
1
answer
0
votes
2015-11-02 09:22:13 +0800 Darksu
Combobox autocomplete with changes
27
views
2
answers
0
votes
2015-09-21 07:40:36 +0800 Tegomena
Changing triangular beside combobox?
56
views
2
answers
0
votes
2015-09-15 11:56:25 +0800 MathieuPiette
Why are my comboitems outside of their combobox?
21
views
0
answers
0
votes
2015-08-20 11:54:31 +0800 gargamel25
combo ie 11 error message problem
65
views
7
answers
0
votes
2015-08-17 12:17:13 +0800 nsharma flag of India
Combobox performance issue [closed]
17
views
0
answers
0
votes
2015-08-03 13:17:19 +0800 doeran
combobox chose value by enter dosn't work
77
views
2
answers
0
votes
2015-06-22 08:31:21 +0800 WilliamB
How to add an empty value to a combobox?
9
views
1
answer
0
votes
2015-06-03 10:05:50 +0800 Darksu
problem combobox in google chorom
29
views
2
answers
1
vote
2015-06-02 09:36:10 +0800 josefsabater
Default value selected in combobox
17
views
2
answers
0
votes
2015-04-23 09:21:21 +0800 claudioveryant
Combobox autodrop option doesn´t scroll view into matched item.
89
views
2
answers
1
vote
2015-03-03 07:44:56 +0800 Senthilchettyin flag of India
How to clear display value when clear combox's items
12
views
1
answer
0
votes
2015-02-21 19:24:50 +0800 Darksu
XML data Bind to a Combobox or Listbox
25
views
3
answers
0
votes
2015-02-02 12:54:20 +0800 kanse
how to get selected item ?
34
views
1
answer
0
votes
2015-01-28 16:52:44 +0800 Alecs
String List with combobox zk framework
37
views
5
answers
0
votes
2015-01-16 07:38:31 +0800 hawk
Problem with combobox.
12
views
1
answer
0
votes
2014-12-07 09:24:37 +0800 Darksu
Combobox scroll event
Did not find what you were looking for? Please, post your question!
Highlights
ZK 8.6.0
Ask the Expert
ZK & Spring Boot
Contributors
KlausWr gravatar imagensharma gravatar imagescottz gravatar imagealiabbas gravatar imageecharish gravatar imageAlecs gravatar imageSenthilchettyin gravatar imagehawk gravatar imageterrytornado gravatar imageMathieuPiette gravatar imagejolubrech gravatar imagechillworld gravatar imagecyiannoulis gravatar imagewangzeyou gravatar imageTegomena gravatar imagejosefsabater gravatar image
Tags
Support Options
• Email Support
• Training
• Consulting
• Outsourcing
Learn More
|
{
"url": "http://forum.zkoss.org/questions/scope:all/sort:activity-desc/tags:combo/page:1/",
"source_domain": "forum.zkoss.org",
"snapshot_id": "crawl=CC-MAIN-2018-51",
"warc_metadata": {
"Content-Length": "102732",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UGDHF4D4YYFQVF6J5P6R37C3RQQ36O6M",
"WARC-Concurrent-To": "<urn:uuid:ae878170-a974-4709-8291-0de981850770>",
"WARC-Date": "2018-12-11T09:28:45Z",
"WARC-IP-Address": "54.149.254.26",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:7PFGLJZGKOVZICTQGDZ74BYLJ243O557",
"WARC-Record-ID": "<urn:uuid:0d3f6499-2703-4c16-aeb8-47ab24222b27>",
"WARC-Target-URI": "http://forum.zkoss.org/questions/scope:all/sort:activity-desc/tags:combo/page:1/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c50351e2-5396-4714-8f1c-96176698524d>"
},
"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-150-135-54.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,
8,
36,
37,
50,
51,
58,
64,
67,
73,
75,
83,
85,
91,
124,
125,
156,
157,
160,
166,
168,
175,
177,
183,
216,
217,
254,
255,
258,
264,
266,
273,
275,
281,
314,
315,
373,
374,
377,
383,
385,
392,
394,
400,
453,
454,
484,
485,
488,
494,
496,
504,
506,
512,
545,
546,
582,
583,
586,
592,
594,
602,
604,
610,
643,
644,
705,
706,
709,
715,
717,
725,
727,
733,
767,
768,
809,
810,
813,
819,
821,
828,
830,
836,
868,
869,
926,
927,
930,
936,
938,
945,
947,
953,
1006,
1007,
1063,
1064,
1067,
1073,
1075,
1083,
1085,
1090,
1143,
1144,
1192,
1193,
1196,
1202,
1204,
1211,
1213,
1219,
1252,
1253,
1298,
1299,
1302,
1308,
1310,
1317,
1319,
1325,
1358,
1359,
1406,
1407,
1410,
1416,
1418,
1426,
1428,
1434,
1468,
1469,
1495,
1496,
1499,
1505,
1507,
1514,
1516,
1522,
1555,
1556,
1591,
1592,
1595,
1601,
1603,
1611,
1613,
1619,
1654,
1655,
1692,
1693,
1696,
1702,
1704,
1712,
1714,
1720,
1760,
1761,
1810,
1811,
1814,
1820,
1822,
1830,
1832,
1838,
1875,
1876,
1910,
1911,
1914,
1920,
1922,
1930,
1932,
1938,
1986,
1987,
2023,
2024,
2027,
2033,
2035,
2043,
2045,
2051,
2084,
2085,
2127,
2128,
2131,
2137,
2139,
2147,
2149,
2155,
2190,
2191,
2232,
2233,
2235,
2241,
2243,
2250,
2252,
2258,
2291,
2292,
2326,
2327,
2330,
2336,
2338,
2346,
2348,
2353,
2392,
2393,
2428,
2429,
2432,
2438,
2440,
2448,
2450,
2456,
2497,
2498,
2562,
2563,
2566,
2572,
2574,
2582,
2584,
2589,
2645,
2646,
2699,
2700,
2703,
2709,
2711,
2718,
2720,
2726,
2759,
2760,
2799,
2800,
2803,
2809,
2811,
2819,
2821,
2827,
2859,
2860,
2887,
2888,
2891,
2897,
2899,
2906,
2908,
2914,
2946,
2947,
2986,
2987,
2990,
2996,
2998,
3006,
3008,
3014,
3045,
3046,
3069,
3070,
3073,
3079,
3081,
3088,
3090,
3096,
3129,
3130,
3152,
3153,
3221,
3222,
3233,
3234,
3243,
3258,
3275,
3276,
3289,
3290,
3675,
3676,
3681,
3682,
3698,
3716,
3729,
3744,
3760
],
"line_end_idx": [
8,
36,
37,
50,
51,
58,
64,
67,
73,
75,
83,
85,
91,
124,
125,
156,
157,
160,
166,
168,
175,
177,
183,
216,
217,
254,
255,
258,
264,
266,
273,
275,
281,
314,
315,
373,
374,
377,
383,
385,
392,
394,
400,
453,
454,
484,
485,
488,
494,
496,
504,
506,
512,
545,
546,
582,
583,
586,
592,
594,
602,
604,
610,
643,
644,
705,
706,
709,
715,
717,
725,
727,
733,
767,
768,
809,
810,
813,
819,
821,
828,
830,
836,
868,
869,
926,
927,
930,
936,
938,
945,
947,
953,
1006,
1007,
1063,
1064,
1067,
1073,
1075,
1083,
1085,
1090,
1143,
1144,
1192,
1193,
1196,
1202,
1204,
1211,
1213,
1219,
1252,
1253,
1298,
1299,
1302,
1308,
1310,
1317,
1319,
1325,
1358,
1359,
1406,
1407,
1410,
1416,
1418,
1426,
1428,
1434,
1468,
1469,
1495,
1496,
1499,
1505,
1507,
1514,
1516,
1522,
1555,
1556,
1591,
1592,
1595,
1601,
1603,
1611,
1613,
1619,
1654,
1655,
1692,
1693,
1696,
1702,
1704,
1712,
1714,
1720,
1760,
1761,
1810,
1811,
1814,
1820,
1822,
1830,
1832,
1838,
1875,
1876,
1910,
1911,
1914,
1920,
1922,
1930,
1932,
1938,
1986,
1987,
2023,
2024,
2027,
2033,
2035,
2043,
2045,
2051,
2084,
2085,
2127,
2128,
2131,
2137,
2139,
2147,
2149,
2155,
2190,
2191,
2232,
2233,
2235,
2241,
2243,
2250,
2252,
2258,
2291,
2292,
2326,
2327,
2330,
2336,
2338,
2346,
2348,
2353,
2392,
2393,
2428,
2429,
2432,
2438,
2440,
2448,
2450,
2456,
2497,
2498,
2562,
2563,
2566,
2572,
2574,
2582,
2584,
2589,
2645,
2646,
2699,
2700,
2703,
2709,
2711,
2718,
2720,
2726,
2759,
2760,
2799,
2800,
2803,
2809,
2811,
2819,
2821,
2827,
2859,
2860,
2887,
2888,
2891,
2897,
2899,
2906,
2908,
2914,
2946,
2947,
2986,
2987,
2990,
2996,
2998,
3006,
3008,
3014,
3045,
3046,
3069,
3070,
3073,
3079,
3081,
3088,
3090,
3096,
3129,
3130,
3152,
3153,
3221,
3222,
3233,
3234,
3243,
3258,
3275,
3276,
3289,
3290,
3675,
3676,
3681,
3682,
3698,
3716,
3729,
3744,
3760,
3770
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3770,
"ccnet_original_nlines": 316,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08716136962175369,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.003533570095896721,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.547703206539154,
"rps_doc_frac_unique_words": 0.48404255509376526,
"rps_doc_mean_word_length": 5.2588653564453125,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.893011093139648,
"rps_doc_word_count": 564,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.18543492257595062,
"rps_doc_frac_chars_dupe_6grams": 0.026972349733114243,
"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.052596088498830795,
"rps_doc_frac_chars_top_3gram": 0.06136209890246391,
"rps_doc_frac_chars_top_4gram": 0.052596088498830795,
"rps_doc_books_importance": -322.936767578125,
"rps_doc_books_importance_length_correction": -322.936767578125,
"rps_doc_openwebtext_importance": -211.33245849609375,
"rps_doc_openwebtext_importance_length_correction": -211.33245849609375,
"rps_doc_wikipedia_importance": -186.63597106933594,
"rps_doc_wikipedia_importance_length_correction": -186.63597106933594
},
"fasttext": {
"dclm": 0.03222436085343361,
"english": 0.666712760925293,
"fineweb_edu_approx": 1.1959198713302612,
"eai_general_math": 0.00010610000026645139,
"eai_open_web_math": 0.1053658127784729,
"eai_web_code": -0.000010009999641624745
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,552,287,735,199,495,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.
In C++, suppose I have a messaging system that wraps messages in a generic struct:
template<typename T>
struct Message
{
std::string Name;
T Data;
};
I also have an interface that includes functions that need to use the purely generic version of this struct:
class Interface
{
public:
virtual ~Interface() { }
virtual void Receive(Message& message) = 0;
virtual Message Send() = 0;
};
However, Message no longer names a type; things like Message<float> and Message<std::string> name types. Since the classes that will be implementing Interface will want to catch different Message, I can't just define a specific type.
The only way I can think to fix this is to rip out the template and using inheritance, but then I'd have littered throughout my code things like IntMessage and BoolMessage, which looks extraordinarily ugly. Any thoughts on how I can do this the way I want?
share|improve this question
What attribute(s)/method(s) does the "purely generic version" of the Message have? Just the Name? – Mark B Oct 5 '12 at 17:09
2 Answers 2
A simple approach is to split the Message type into a hierarchy:
struct MessageBase {
std::string Name;
};
template<typename T>
struct Message : MessageBase
{
T Data;
};
Then you can just pass MessageBase& through interfaces.
[The previous won't work. The function will be able to accept any MessageBase& object, but Receive seems to be about storing in the argument a message for which the type is unknown a compile time. Although if you don't mind dynamic allocations you could have a Message that holds the name and a pointer to a MessageBase and then different implementations of MessageImpl (the template above)]
Another common approach is to add all possible messages to an union and pass the union around.
share|improve this answer
Why don't you define your interface as a template?
template<typename T>
class Interface
{
public:
virtual ~Interface() { }
virtual void Receive(Message<T>& message) = 0;
virtual Message<T> Send() = 0;
};
share|improve this answer
@twalberg it isn't clear how the template messages could really be virtual. – juanchopanza Oct 4 '12 at 19:21
@twalberg You can't have template virtual methods can you? – Mark B Oct 4 '12 at 19:23
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/12733668/passing-a-generic-struct-as-a-parameter-in-an-interface?answertab=votes",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-22",
"warc_metadata": {
"Content-Length": "75340",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TADK7WEUOENT6UQEP5DPRP5BMZL4EPBA",
"WARC-Concurrent-To": "<urn:uuid:de9edb71-9a26-4a45-9874-065779eeaf01>",
"WARC-Date": "2015-05-22T23:51:36Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:VZD3X6SYMRSU35QISAC56JFKYNNFXSGB",
"WARC-Record-ID": "<urn:uuid:de07e626-bf68-4ae1-a740-6ed57d312baf>",
"WARC-Target-URI": "http://stackoverflow.com/questions/12733668/passing-a-generic-struct-as-a-parameter-in-an-interface?answertab=votes",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5d3a0bb5-5b5f-48ab-a8cd-682f2e045813>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-206-219.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-22\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for May 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,
157,
158,
241,
242,
263,
278,
280,
300,
310,
313,
314,
423,
424,
440,
442,
452,
481,
529,
561,
564,
565,
799,
800,
1057,
1058,
1086,
1091,
1218,
1219,
1231,
1232,
1297,
1298,
1319,
1339,
1342,
1363,
1392,
1394,
1404,
1407,
1408,
1464,
1465,
1857,
1858,
1953,
1954,
1980,
1981,
2032,
2033,
2054,
2070,
2072,
2082,
2111,
2162,
2197,
2200,
2226,
2231,
2342,
2347,
2435,
2436,
2448,
2449,
2451,
2459,
2460,
2538,
2539
],
"line_end_idx": [
25,
157,
158,
241,
242,
263,
278,
280,
300,
310,
313,
314,
423,
424,
440,
442,
452,
481,
529,
561,
564,
565,
799,
800,
1057,
1058,
1086,
1091,
1218,
1219,
1231,
1232,
1297,
1298,
1319,
1339,
1342,
1363,
1392,
1394,
1404,
1407,
1408,
1464,
1465,
1857,
1858,
1953,
1954,
1980,
1981,
2032,
2033,
2054,
2070,
2072,
2082,
2111,
2162,
2197,
2200,
2226,
2231,
2342,
2347,
2435,
2436,
2448,
2449,
2451,
2459,
2460,
2538,
2539,
2629
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2629,
"ccnet_original_nlines": 74,
"rps_doc_curly_bracket": 0.005325220059603453,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31588447093963623,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03249096870422363,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25992780923843384,
"rps_doc_frac_unique_words": 0.49627792835235596,
"rps_doc_mean_word_length": 4.950372219085693,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.9284987449646,
"rps_doc_word_count": 403,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07218044996261597,
"rps_doc_frac_chars_dupe_6grams": 0.04711778834462166,
"rps_doc_frac_chars_dupe_7grams": 0.04711778834462166,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.025563910603523254,
"rps_doc_frac_chars_top_3gram": 0.023057639598846436,
"rps_doc_frac_chars_top_4gram": 0.0300751905888319,
"rps_doc_books_importance": -271.9611511230469,
"rps_doc_books_importance_length_correction": -271.9611511230469,
"rps_doc_openwebtext_importance": -120.53298950195312,
"rps_doc_openwebtext_importance_length_correction": -120.53298950195312,
"rps_doc_wikipedia_importance": -89.99385833740234,
"rps_doc_wikipedia_importance_length_correction": -89.99385833740234
},
"fasttext": {
"dclm": 0.38086891174316406,
"english": 0.855527400970459,
"fineweb_edu_approx": 1.8461744785308838,
"eai_general_math": 0.0025467900559306145,
"eai_open_web_math": 0.040049370378255844,
"eai_web_code": 0.00035595998633652925
}
}
|
{
"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": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,049,516,939,038,185,500 |
...
Run Format
Source file src/syscall/mksyscall_windows.go
Documentation: syscall
1 // Copyright 2013 The Go Authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style
3 // license that can be found in the LICENSE file.
4
5 // +build ignore
6
7 /*
8 mksyscall_windows generates windows system call bodies
9
10 It parses all files specified on command line containing function
11 prototypes (like syscall_windows.go) and prints system call bodies
12 to standard output.
13
14 The prototypes are marked by lines beginning with "//sys" and read
15 like func declarations if //sys is replaced by func, but:
16
17 * The parameter lists must give a name for each argument. This
18 includes return parameters.
19
20 * The parameter lists must give a type for each argument:
21 the (x, y, z int) shorthand is not allowed.
22
23 * If the return parameter is an error number, it must be named err.
24
25 * If go func name needs to be different from it's winapi dll name,
26 the winapi name could be specified at the end, after "=" sign, like
27 //sys LoadLibrary(libname string) (handle uint32, err error) = LoadLibraryA
28
29 * Each function that returns err needs to supply a condition, that
30 return value of winapi will be tested against to detect failure.
31 This would set err to windows "last-error", otherwise it will be nil.
32 The value can be provided at end of //sys declaration, like
33 //sys LoadLibrary(libname string) (handle uint32, err error) [failretval==-1] = LoadLibraryA
34 and is [failretval==0] by default.
35
36 Usage:
37 mksyscall_windows [flags] [path ...]
38
39 The flags are:
40 -output
41 Specify output file name (outputs to console if blank).
42 -trace
43 Generate print statement after every syscall.
44 */
45 package main
46
47 import (
48 "bufio"
49 "bytes"
50 "errors"
51 "flag"
52 "fmt"
53 "go/format"
54 "go/parser"
55 "go/token"
56 "io"
57 "io/ioutil"
58 "log"
59 "os"
60 "path/filepath"
61 "runtime"
62 "sort"
63 "strconv"
64 "strings"
65 "text/template"
66 )
67
68 var (
69 filename = flag.String("output", "", "output file name (standard output if omitted)")
70 printTraceFlag = flag.Bool("trace", false, "generate print statement after every syscall")
71 systemDLL = flag.Bool("systemdll", true, "whether all DLLs should be loaded from the Windows system directory")
72 )
73
74 func trim(s string) string {
75 return strings.Trim(s, " \t")
76 }
77
78 var packageName string
79
80 func packagename() string {
81 return packageName
82 }
83
84 func syscalldot() string {
85 if packageName == "syscall" {
86 return ""
87 }
88 return "syscall."
89 }
90
91 // Param is function parameter
92 type Param struct {
93 Name string
94 Type string
95 fn *Fn
96 tmpVarIdx int
97 }
98
99 // tmpVar returns temp variable name that will be used to represent p during syscall.
100 func (p *Param) tmpVar() string {
101 if p.tmpVarIdx < 0 {
102 p.tmpVarIdx = p.fn.curTmpVarIdx
103 p.fn.curTmpVarIdx++
104 }
105 return fmt.Sprintf("_p%d", p.tmpVarIdx)
106 }
107
108 // BoolTmpVarCode returns source code for bool temp variable.
109 func (p *Param) BoolTmpVarCode() string {
110 const code = `var %s uint32
111 if %s {
112 %s = 1
113 } else {
114 %s = 0
115 }`
116 tmp := p.tmpVar()
117 return fmt.Sprintf(code, tmp, p.Name, tmp, tmp)
118 }
119
120 // SliceTmpVarCode returns source code for slice temp variable.
121 func (p *Param) SliceTmpVarCode() string {
122 const code = `var %s *%s
123 if len(%s) > 0 {
124 %s = &%s[0]
125 }`
126 tmp := p.tmpVar()
127 return fmt.Sprintf(code, tmp, p.Type[2:], p.Name, tmp, p.Name)
128 }
129
130 // StringTmpVarCode returns source code for string temp variable.
131 func (p *Param) StringTmpVarCode() string {
132 errvar := p.fn.Rets.ErrorVarName()
133 if errvar == "" {
134 errvar = "_"
135 }
136 tmp := p.tmpVar()
137 const code = `var %s %s
138 %s, %s = %s(%s)`
139 s := fmt.Sprintf(code, tmp, p.fn.StrconvType(), tmp, errvar, p.fn.StrconvFunc(), p.Name)
140 if errvar == "-" {
141 return s
142 }
143 const morecode = `
144 if %s != nil {
145 return
146 }`
147 return s + fmt.Sprintf(morecode, errvar)
148 }
149
150 // TmpVarCode returns source code for temp variable.
151 func (p *Param) TmpVarCode() string {
152 switch {
153 case p.Type == "bool":
154 return p.BoolTmpVarCode()
155 case strings.HasPrefix(p.Type, "[]"):
156 return p.SliceTmpVarCode()
157 default:
158 return ""
159 }
160 }
161
162 // TmpVarHelperCode returns source code for helper's temp variable.
163 func (p *Param) TmpVarHelperCode() string {
164 if p.Type != "string" {
165 return ""
166 }
167 return p.StringTmpVarCode()
168 }
169
170 // SyscallArgList returns source code fragments representing p parameter
171 // in syscall. Slices are translated into 2 syscall parameters: pointer to
172 // the first element and length.
173 func (p *Param) SyscallArgList() []string {
174 t := p.HelperType()
175 var s string
176 switch {
177 case t[0] == '*':
178 s = fmt.Sprintf("unsafe.Pointer(%s)", p.Name)
179 case t == "bool":
180 s = p.tmpVar()
181 case strings.HasPrefix(t, "[]"):
182 return []string{
183 fmt.Sprintf("uintptr(unsafe.Pointer(%s))", p.tmpVar()),
184 fmt.Sprintf("uintptr(len(%s))", p.Name),
185 }
186 default:
187 s = p.Name
188 }
189 return []string{fmt.Sprintf("uintptr(%s)", s)}
190 }
191
192 // IsError determines if p parameter is used to return error.
193 func (p *Param) IsError() bool {
194 return p.Name == "err" && p.Type == "error"
195 }
196
197 // HelperType returns type of parameter p used in helper function.
198 func (p *Param) HelperType() string {
199 if p.Type == "string" {
200 return p.fn.StrconvType()
201 }
202 return p.Type
203 }
204
205 // join concatenates parameters ps into a string with sep separator.
206 // Each parameter is converted into string by applying fn to it
207 // before conversion.
208 func join(ps []*Param, fn func(*Param) string, sep string) string {
209 if len(ps) == 0 {
210 return ""
211 }
212 a := make([]string, 0)
213 for _, p := range ps {
214 a = append(a, fn(p))
215 }
216 return strings.Join(a, sep)
217 }
218
219 // Rets describes function return parameters.
220 type Rets struct {
221 Name string
222 Type string
223 ReturnsError bool
224 FailCond string
225 }
226
227 // ErrorVarName returns error variable name for r.
228 func (r *Rets) ErrorVarName() string {
229 if r.ReturnsError {
230 return "err"
231 }
232 if r.Type == "error" {
233 return r.Name
234 }
235 return ""
236 }
237
238 // ToParams converts r into slice of *Param.
239 func (r *Rets) ToParams() []*Param {
240 ps := make([]*Param, 0)
241 if len(r.Name) > 0 {
242 ps = append(ps, &Param{Name: r.Name, Type: r.Type})
243 }
244 if r.ReturnsError {
245 ps = append(ps, &Param{Name: "err", Type: "error"})
246 }
247 return ps
248 }
249
250 // List returns source code of syscall return parameters.
251 func (r *Rets) List() string {
252 s := join(r.ToParams(), func(p *Param) string { return p.Name + " " + p.Type }, ", ")
253 if len(s) > 0 {
254 s = "(" + s + ")"
255 }
256 return s
257 }
258
259 // PrintList returns source code of trace printing part correspondent
260 // to syscall return values.
261 func (r *Rets) PrintList() string {
262 return join(r.ToParams(), func(p *Param) string { return fmt.Sprintf(`"%s=", %s, `, p.Name, p.Name) }, `", ", `)
263 }
264
265 // SetReturnValuesCode returns source code that accepts syscall return values.
266 func (r *Rets) SetReturnValuesCode() string {
267 if r.Name == "" && !r.ReturnsError {
268 return ""
269 }
270 retvar := "r0"
271 if r.Name == "" {
272 retvar = "r1"
273 }
274 errvar := "_"
275 if r.ReturnsError {
276 errvar = "e1"
277 }
278 return fmt.Sprintf("%s, _, %s := ", retvar, errvar)
279 }
280
281 func (r *Rets) useLongHandleErrorCode(retvar string) string {
282 const code = `if %s {
283 if e1 != 0 {
284 err = errnoErr(e1)
285 } else {
286 err = %sEINVAL
287 }
288 }`
289 cond := retvar + " == 0"
290 if r.FailCond != "" {
291 cond = strings.Replace(r.FailCond, "failretval", retvar, 1)
292 }
293 return fmt.Sprintf(code, cond, syscalldot())
294 }
295
296 // SetErrorCode returns source code that sets return parameters.
297 func (r *Rets) SetErrorCode() string {
298 const code = `if r0 != 0 {
299 %s = %sErrno(r0)
300 }`
301 if r.Name == "" && !r.ReturnsError {
302 return ""
303 }
304 if r.Name == "" {
305 return r.useLongHandleErrorCode("r1")
306 }
307 if r.Type == "error" {
308 return fmt.Sprintf(code, r.Name, syscalldot())
309 }
310 s := ""
311 switch {
312 case r.Type[0] == '*':
313 s = fmt.Sprintf("%s = (%s)(unsafe.Pointer(r0))", r.Name, r.Type)
314 case r.Type == "bool":
315 s = fmt.Sprintf("%s = r0 != 0", r.Name)
316 default:
317 s = fmt.Sprintf("%s = %s(r0)", r.Name, r.Type)
318 }
319 if !r.ReturnsError {
320 return s
321 }
322 return s + "\n\t" + r.useLongHandleErrorCode(r.Name)
323 }
324
325 // Fn describes syscall function.
326 type Fn struct {
327 Name string
328 Params []*Param
329 Rets *Rets
330 PrintTrace bool
331 dllname string
332 dllfuncname string
333 src string
334 // TODO: get rid of this field and just use parameter index instead
335 curTmpVarIdx int // insure tmp variables have uniq names
336 }
337
338 // extractParams parses s to extract function parameters.
339 func extractParams(s string, f *Fn) ([]*Param, error) {
340 s = trim(s)
341 if s == "" {
342 return nil, nil
343 }
344 a := strings.Split(s, ",")
345 ps := make([]*Param, len(a))
346 for i := range ps {
347 s2 := trim(a[i])
348 b := strings.Split(s2, " ")
349 if len(b) != 2 {
350 b = strings.Split(s2, "\t")
351 if len(b) != 2 {
352 return nil, errors.New("Could not extract function parameter from \"" + s2 + "\"")
353 }
354 }
355 ps[i] = &Param{
356 Name: trim(b[0]),
357 Type: trim(b[1]),
358 fn: f,
359 tmpVarIdx: -1,
360 }
361 }
362 return ps, nil
363 }
364
365 // extractSection extracts text out of string s starting after start
366 // and ending just before end. found return value will indicate success,
367 // and prefix, body and suffix will contain correspondent parts of string s.
368 func extractSection(s string, start, end rune) (prefix, body, suffix string, found bool) {
369 s = trim(s)
370 if strings.HasPrefix(s, string(start)) {
371 // no prefix
372 body = s[1:]
373 } else {
374 a := strings.SplitN(s, string(start), 2)
375 if len(a) != 2 {
376 return "", "", s, false
377 }
378 prefix = a[0]
379 body = a[1]
380 }
381 a := strings.SplitN(body, string(end), 2)
382 if len(a) != 2 {
383 return "", "", "", false
384 }
385 return prefix, a[0], a[1], true
386 }
387
388 // newFn parses string s and return created function Fn.
389 func newFn(s string) (*Fn, error) {
390 s = trim(s)
391 f := &Fn{
392 Rets: &Rets{},
393 src: s,
394 PrintTrace: *printTraceFlag,
395 }
396 // function name and args
397 prefix, body, s, found := extractSection(s, '(', ')')
398 if !found || prefix == "" {
399 return nil, errors.New("Could not extract function name and parameters from \"" + f.src + "\"")
400 }
401 f.Name = prefix
402 var err error
403 f.Params, err = extractParams(body, f)
404 if err != nil {
405 return nil, err
406 }
407 // return values
408 _, body, s, found = extractSection(s, '(', ')')
409 if found {
410 r, err := extractParams(body, f)
411 if err != nil {
412 return nil, err
413 }
414 switch len(r) {
415 case 0:
416 case 1:
417 if r[0].IsError() {
418 f.Rets.ReturnsError = true
419 } else {
420 f.Rets.Name = r[0].Name
421 f.Rets.Type = r[0].Type
422 }
423 case 2:
424 if !r[1].IsError() {
425 return nil, errors.New("Only last windows error is allowed as second return value in \"" + f.src + "\"")
426 }
427 f.Rets.ReturnsError = true
428 f.Rets.Name = r[0].Name
429 f.Rets.Type = r[0].Type
430 default:
431 return nil, errors.New("Too many return values in \"" + f.src + "\"")
432 }
433 }
434 // fail condition
435 _, body, s, found = extractSection(s, '[', ']')
436 if found {
437 f.Rets.FailCond = body
438 }
439 // dll and dll function names
440 s = trim(s)
441 if s == "" {
442 return f, nil
443 }
444 if !strings.HasPrefix(s, "=") {
445 return nil, errors.New("Could not extract dll name from \"" + f.src + "\"")
446 }
447 s = trim(s[1:])
448 a := strings.Split(s, ".")
449 switch len(a) {
450 case 1:
451 f.dllfuncname = a[0]
452 case 2:
453 f.dllname = a[0]
454 f.dllfuncname = a[1]
455 default:
456 return nil, errors.New("Could not extract dll name from \"" + f.src + "\"")
457 }
458 return f, nil
459 }
460
461 // DLLName returns DLL name for function f.
462 func (f *Fn) DLLName() string {
463 if f.dllname == "" {
464 return "kernel32"
465 }
466 return f.dllname
467 }
468
469 // DLLName returns DLL function name for function f.
470 func (f *Fn) DLLFuncName() string {
471 if f.dllfuncname == "" {
472 return f.Name
473 }
474 return f.dllfuncname
475 }
476
477 // ParamList returns source code for function f parameters.
478 func (f *Fn) ParamList() string {
479 return join(f.Params, func(p *Param) string { return p.Name + " " + p.Type }, ", ")
480 }
481
482 // HelperParamList returns source code for helper function f parameters.
483 func (f *Fn) HelperParamList() string {
484 return join(f.Params, func(p *Param) string { return p.Name + " " + p.HelperType() }, ", ")
485 }
486
487 // ParamPrintList returns source code of trace printing part correspondent
488 // to syscall input parameters.
489 func (f *Fn) ParamPrintList() string {
490 return join(f.Params, func(p *Param) string { return fmt.Sprintf(`"%s=", %s, `, p.Name, p.Name) }, `", ", `)
491 }
492
493 // ParamCount return number of syscall parameters for function f.
494 func (f *Fn) ParamCount() int {
495 n := 0
496 for _, p := range f.Params {
497 n += len(p.SyscallArgList())
498 }
499 return n
500 }
501
502 // SyscallParamCount determines which version of Syscall/Syscall6/Syscall9/...
503 // to use. It returns parameter count for correspondent SyscallX function.
504 func (f *Fn) SyscallParamCount() int {
505 n := f.ParamCount()
506 switch {
507 case n <= 3:
508 return 3
509 case n <= 6:
510 return 6
511 case n <= 9:
512 return 9
513 case n <= 12:
514 return 12
515 case n <= 15:
516 return 15
517 default:
518 panic("too many arguments to system call")
519 }
520 }
521
522 // Syscall determines which SyscallX function to use for function f.
523 func (f *Fn) Syscall() string {
524 c := f.SyscallParamCount()
525 if c == 3 {
526 return syscalldot() + "Syscall"
527 }
528 return syscalldot() + "Syscall" + strconv.Itoa(c)
529 }
530
531 // SyscallParamList returns source code for SyscallX parameters for function f.
532 func (f *Fn) SyscallParamList() string {
533 a := make([]string, 0)
534 for _, p := range f.Params {
535 a = append(a, p.SyscallArgList()...)
536 }
537 for len(a) < f.SyscallParamCount() {
538 a = append(a, "0")
539 }
540 return strings.Join(a, ", ")
541 }
542
543 // HelperCallParamList returns source code of call into function f helper.
544 func (f *Fn) HelperCallParamList() string {
545 a := make([]string, 0, len(f.Params))
546 for _, p := range f.Params {
547 s := p.Name
548 if p.Type == "string" {
549 s = p.tmpVar()
550 }
551 a = append(a, s)
552 }
553 return strings.Join(a, ", ")
554 }
555
556 // IsUTF16 is true, if f is W (utf16) function. It is false
557 // for all A (ascii) functions.
558 func (f *Fn) IsUTF16() bool {
559 s := f.DLLFuncName()
560 return s[len(s)-1] == 'W'
561 }
562
563 // StrconvFunc returns name of Go string to OS string function for f.
564 func (f *Fn) StrconvFunc() string {
565 if f.IsUTF16() {
566 return syscalldot() + "UTF16PtrFromString"
567 }
568 return syscalldot() + "BytePtrFromString"
569 }
570
571 // StrconvType returns Go type name used for OS string for f.
572 func (f *Fn) StrconvType() string {
573 if f.IsUTF16() {
574 return "*uint16"
575 }
576 return "*byte"
577 }
578
579 // HasStringParam is true, if f has at least one string parameter.
580 // Otherwise it is false.
581 func (f *Fn) HasStringParam() bool {
582 for _, p := range f.Params {
583 if p.Type == "string" {
584 return true
585 }
586 }
587 return false
588 }
589
590 // HelperName returns name of function f helper.
591 func (f *Fn) HelperName() string {
592 if !f.HasStringParam() {
593 return f.Name
594 }
595 return "_" + f.Name
596 }
597
598 // Source files and functions.
599 type Source struct {
600 Funcs []*Fn
601 Files []string
602 StdLibImports []string
603 ExternalImports []string
604 }
605
606 func (src *Source) Import(pkg string) {
607 src.StdLibImports = append(src.StdLibImports, pkg)
608 sort.Strings(src.StdLibImports)
609 }
610
611 func (src *Source) ExternalImport(pkg string) {
612 src.ExternalImports = append(src.ExternalImports, pkg)
613 sort.Strings(src.ExternalImports)
614 }
615
616 // ParseFiles parses files listed in fs and extracts all syscall
617 // functions listed in sys comments. It returns source files
618 // and functions collection *Source if successful.
619 func ParseFiles(fs []string) (*Source, error) {
620 src := &Source{
621 Funcs: make([]*Fn, 0),
622 Files: make([]string, 0),
623 StdLibImports: []string{
624 "unsafe",
625 },
626 ExternalImports: make([]string, 0),
627 }
628 for _, file := range fs {
629 if err := src.ParseFile(file); err != nil {
630 return nil, err
631 }
632 }
633 return src, nil
634 }
635
636 // DLLs return dll names for a source set src.
637 func (src *Source) DLLs() []string {
638 uniq := make(map[string]bool)
639 r := make([]string, 0)
640 for _, f := range src.Funcs {
641 name := f.DLLName()
642 if _, found := uniq[name]; !found {
643 uniq[name] = true
644 r = append(r, name)
645 }
646 }
647 return r
648 }
649
650 // ParseFile adds additional file path to a source set src.
651 func (src *Source) ParseFile(path string) error {
652 file, err := os.Open(path)
653 if err != nil {
654 return err
655 }
656 defer file.Close()
657
658 s := bufio.NewScanner(file)
659 for s.Scan() {
660 t := trim(s.Text())
661 if len(t) < 7 {
662 continue
663 }
664 if !strings.HasPrefix(t, "//sys") {
665 continue
666 }
667 t = t[5:]
668 if !(t[0] == ' ' || t[0] == '\t') {
669 continue
670 }
671 f, err := newFn(t[1:])
672 if err != nil {
673 return err
674 }
675 src.Funcs = append(src.Funcs, f)
676 }
677 if err := s.Err(); err != nil {
678 return err
679 }
680 src.Files = append(src.Files, path)
681
682 // get package name
683 fset := token.NewFileSet()
684 _, err = file.Seek(0, 0)
685 if err != nil {
686 return err
687 }
688 pkg, err := parser.ParseFile(fset, "", file, parser.PackageClauseOnly)
689 if err != nil {
690 return err
691 }
692 packageName = pkg.Name.Name
693
694 return nil
695 }
696
697 // IsStdRepo returns true if src is part of standard library.
698 func (src *Source) IsStdRepo() (bool, error) {
699 if len(src.Files) == 0 {
700 return false, errors.New("no input files provided")
701 }
702 abspath, err := filepath.Abs(src.Files[0])
703 if err != nil {
704 return false, err
705 }
706 goroot := runtime.GOROOT()
707 if runtime.GOOS == "windows" {
708 abspath = strings.ToLower(abspath)
709 goroot = strings.ToLower(goroot)
710 }
711 sep := string(os.PathSeparator)
712 if !strings.HasSuffix(goroot, sep) {
713 goroot += sep
714 }
715 return strings.HasPrefix(abspath, goroot), nil
716 }
717
718 // Generate output source file from a source set src.
719 func (src *Source) Generate(w io.Writer) error {
720 const (
721 pkgStd = iota // any package in std library
722 pkgXSysWindows // x/sys/windows package
723 pkgOther
724 )
725 isStdRepo, err := src.IsStdRepo()
726 if err != nil {
727 return err
728 }
729 var pkgtype int
730 switch {
731 case isStdRepo:
732 pkgtype = pkgStd
733 case packageName == "windows":
734 // TODO: this needs better logic than just using package name
735 pkgtype = pkgXSysWindows
736 default:
737 pkgtype = pkgOther
738 }
739 if *systemDLL {
740 switch pkgtype {
741 case pkgStd:
742 src.Import("internal/syscall/windows/sysdll")
743 case pkgXSysWindows:
744 default:
745 src.ExternalImport("golang.org/x/sys/windows")
746 }
747 }
748 if packageName != "syscall" {
749 src.Import("syscall")
750 }
751 funcMap := template.FuncMap{
752 "packagename": packagename,
753 "syscalldot": syscalldot,
754 "newlazydll": func(dll string) string {
755 arg := "\"" + dll + ".dll\""
756 if !*systemDLL {
757 return syscalldot() + "NewLazyDLL(" + arg + ")"
758 }
759 switch pkgtype {
760 case pkgStd:
761 return syscalldot() + "NewLazyDLL(sysdll.Add(" + arg + "))"
762 case pkgXSysWindows:
763 return "NewLazySystemDLL(" + arg + ")"
764 default:
765 return "windows.NewLazySystemDLL(" + arg + ")"
766 }
767 },
768 }
769 t := template.Must(template.New("main").Funcs(funcMap).Parse(srcTemplate))
770 err = t.Execute(w, src)
771 if err != nil {
772 return errors.New("Failed to execute template: " + err.Error())
773 }
774 return nil
775 }
776
777 func usage() {
778 fmt.Fprintf(os.Stderr, "usage: mksyscall_windows [flags] [path ...]\n")
779 flag.PrintDefaults()
780 os.Exit(1)
781 }
782
783 func main() {
784 flag.Usage = usage
785 flag.Parse()
786 if len(flag.Args()) <= 0 {
787 fmt.Fprintf(os.Stderr, "no files to parse provided\n")
788 usage()
789 }
790
791 src, err := ParseFiles(flag.Args())
792 if err != nil {
793 log.Fatal(err)
794 }
795
796 var buf bytes.Buffer
797 if err := src.Generate(&buf); err != nil {
798 log.Fatal(err)
799 }
800
801 data, err := format.Source(buf.Bytes())
802 if err != nil {
803 log.Fatal(err)
804 }
805 if *filename == "" {
806 _, err = os.Stdout.Write(data)
807 } else {
808 err = ioutil.WriteFile(*filename, data, 0644)
809 }
810 if err != nil {
811 log.Fatal(err)
812 }
813 }
814
815 // TODO: use println instead to print in the following template
816 const srcTemplate = `
817
818 {{define "main"}}// MACHINE GENERATED BY 'go generate' COMMAND; DO NOT EDIT
819
820 package {{packagename}}
821
822 import (
823 {{range .StdLibImports}}"{{.}}"
824 {{end}}
825
826 {{range .ExternalImports}}"{{.}}"
827 {{end}}
828 )
829
830 var _ unsafe.Pointer
831
832 // Do the interface allocations only once for common
833 // Errno values.
834 const (
835 errnoERROR_IO_PENDING = 997
836 )
837
838 var (
839 errERROR_IO_PENDING error = {{syscalldot}}Errno(errnoERROR_IO_PENDING)
840 )
841
842 // errnoErr returns common boxed Errno values, to prevent
843 // allocations at runtime.
844 func errnoErr(e {{syscalldot}}Errno) error {
845 switch e {
846 case 0:
847 return nil
848 case errnoERROR_IO_PENDING:
849 return errERROR_IO_PENDING
850 }
851 // TODO: add more here, after collecting data on the common
852 // error values see on Windows. (perhaps when running
853 // all.bat?)
854 return e
855 }
856
857 var (
858 {{template "dlls" .}}
859 {{template "funcnames" .}})
860 {{range .Funcs}}{{if .HasStringParam}}{{template "helperbody" .}}{{end}}{{template "funcbody" .}}{{end}}
861 {{end}}
862
863 {{/* help functions */}}
864
865 {{define "dlls"}}{{range .DLLs}} mod{{.}} = {{newlazydll .}}
866 {{end}}{{end}}
867
868 {{define "funcnames"}}{{range .Funcs}} proc{{.DLLFuncName}} = mod{{.DLLName}}.NewProc("{{.DLLFuncName}}")
869 {{end}}{{end}}
870
871 {{define "helperbody"}}
872 func {{.Name}}({{.ParamList}}) {{template "results" .}}{
873 {{template "helpertmpvars" .}} return {{.HelperName}}({{.HelperCallParamList}})
874 }
875 {{end}}
876
877 {{define "funcbody"}}
878 func {{.HelperName}}({{.HelperParamList}}) {{template "results" .}}{
879 {{template "tmpvars" .}} {{template "syscall" .}}
880 {{template "seterror" .}}{{template "printtrace" .}} return
881 }
882 {{end}}
883
884 {{define "helpertmpvars"}}{{range .Params}}{{if .TmpVarHelperCode}} {{.TmpVarHelperCode}}
885 {{end}}{{end}}{{end}}
886
887 {{define "tmpvars"}}{{range .Params}}{{if .TmpVarCode}} {{.TmpVarCode}}
888 {{end}}{{end}}{{end}}
889
890 {{define "results"}}{{if .Rets.List}}{{.Rets.List}} {{end}}{{end}}
891
892 {{define "syscall"}}{{.Rets.SetReturnValuesCode}}{{.Syscall}}(proc{{.DLLFuncName}}.Addr(), {{.ParamCount}}, {{.SyscallParamList}}){{end}}
893
894 {{define "seterror"}}{{if .Rets.SetErrorCode}} {{.Rets.SetErrorCode}}
895 {{end}}{{end}}
896
897 {{define "printtrace"}}{{if .PrintTrace}} print("SYSCALL: {{.Name}}(", {{.ParamPrintList}}") (", {{.Rets.PrintList}}")\n")
898 {{end}}{{end}}
899
900 `
901
View as plain text
|
{
"url": "https://golang.org/src/syscall/mksyscall_windows.go",
"source_domain": "golang.org",
"snapshot_id": "crawl=CC-MAIN-2018-09",
"warc_metadata": {
"Content-Length": "77323",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SHJ7IJ542YZ66FLV73CZVQETJ4AZ34IY",
"WARC-Concurrent-To": "<urn:uuid:03db7393-5d1a-4493-8ba0-28cbfbb67572>",
"WARC-Date": "2018-02-24T22:08:54Z",
"WARC-IP-Address": "172.217.15.113",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IA4WIY2OGNCBTAKJ4GFTHXEGJSECU32K",
"WARC-Record-ID": "<urn:uuid:60166c24-82e3-4ea5-8c6e-3c66107b3203>",
"WARC-Target-URI": "https://golang.org/src/syscall/mksyscall_windows.go",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:35fc1080-c571-4499-86db-3713717410af>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-141-213-112.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,
4,
15,
16,
61,
62,
85,
86,
149,
211,
269,
278,
303,
312,
323,
386,
395,
469,
544,
572,
581,
656,
722,
731,
802,
840,
849,
915,
969,
978,
1054,
1063,
1138,
1216,
1302,
1311,
1386,
1461,
1541,
1611,
1714,
1759,
1768,
1783,
1829,
1838,
1861,
1878,
1944,
1960,
2016,
2027,
2048,
2057,
2074,
2091,
2108,
2126,
2142,
2157,
2178,
2199,
2219,
2233,
2254,
2269,
2283,
2308,
2327,
2343,
2362,
2381,
2406,
2416,
2425,
2439,
2540,
2640,
2766,
2776,
2785,
2822,
2861,
2871,
2880,
2911,
2920,
2956,
2984,
2994,
3003,
3038,
3077,
3097,
3108,
3135,
3145,
3154,
3193,
3221,
3247,
3273,
3296,
3319,
3329,
3338,
3432,
3474,
3504,
3546,
3576,
3587,
3636,
3646,
3655,
3725,
3775,
3812,
3829,
3846,
3864,
3881,
3893,
3920,
3977,
3987,
3996,
4068,
4119,
4153,
4179,
4201,
4213,
4240,
4312,
4322,
4331,
4405,
4457,
4501,
4528,
4551,
4562,
4589,
4622,
4648,
4746,
4774,
4793,
4804,
4832,
4856,
4873,
4885,
4935,
4945,
4954,
5015,
5061,
5079,
5111,
5147,
5194,
5231,
5249,
5269,
5280,
5290,
5299,
5375,
5427,
5460,
5480,
5491,
5528,
5538,
5547,
5628,
5711,
5752,
5804,
5833,
5855,
5873,
5900,
5956,
5983,
6008,
6050,
6077,
6144,
6196,
6208,
6226,
6247,
6258,
6314,
6324,
6333,
6403,
6444,
6497,
6507,
6516,
6591,
6637,
6670,
6706,
6717,
6740,
6750,
6759,
6836,
6908,
6938,
7014,
7041,
7061,
7072,
7104,
7136,
7167,
7178,
7215,
7225,
7234,
7288,
7315,
7344,
7373,
7400,
7429,
7439,
7448,
7507,
7554,
7583,
7606,
7617,
7649,
7673,
7684,
7703,
7713,
7722,
7775,
7820,
7853,
7883,
7945,
7956,
7985,
8047,
8058,
8077,
8087,
8096,
8162,
8201,
8296,
8321,
8349,
8360,
8378,
8388,
8397,
8475,
8512,
8556,
8678,
8688,
8697,
8784,
8838,
8884,
8904,
8915,
8939,
8966,
8990,
9001,
9024,
9053,
9077,
9088,
9149,
9159,
9168,
9238,
9269,
9292,
9322,
9341,
9367,
9379,
9391,
9425,
9456,
9526,
9537,
9591,
9601,
9610,
9683,
9730,
9766,
9793,
9805,
9851,
9871,
9882,
9909,
9957,
9968,
10000,
10057,
10068,
10085,
10103,
10135,
10210,
10242,
10292,
10310,
10367,
10378,
10408,
10427,
10438,
10500,
10510,
10519,
10561,
10586,
10614,
10644,
10671,
10697,
10725,
10753,
10781,
10858,
10924,
10934,
10943,
11009,
11073,
11094,
11116,
11142,
11153,
11189,
11227,
11256,
11283,
11321,
11348,
11387,
11415,
11510,
11523,
11535,
11561,
11595,
11629,
11654,
11680,
11692,
11703,
11727,
11737,
11746,
11823,
11904,
11989,
12088,
12109,
12159,
12182,
12205,
12223,
12274,
12301,
12336,
12348,
12372,
12394,
12405,
12456,
12482,
12517,
12528,
12569,
12579,
12588,
12653,
12697,
12718,
12737,
12768,
12793,
12832,
12843,
12878,
12941,
12978,
13084,
13095,
13120,
13143,
13191,
13216,
13242,
13253,
13279,
13336,
13356,
13399,
13425,
13452,
13464,
13490,
13508,
13526,
13557,
13596,
13616,
13652,
13688,
13701,
13719,
13751,
13868,
13881,
13919,
13954,
13989,
14008,
14089,
14101,
14112,
14139,
14196,
14216,
14249,
14260,
14299,
14320,
14342,
14366,
14377,
14418,
14504,
14515,
14540,
14576,
14601,
14618,
14649,
14666,
14693,
14724,
14742,
14828,
14839,
14862,
14872,
14881,
14933,
14973,
15003,
15031,
15042,
15068,
15078,
15087,
15148,
15192,
15226,
15250,
15261,
15291,
15301,
15310,
15378,
15420,
15513,
15523,
15532,
15613,
15661,
15762,
15772,
15781,
15864,
15904,
15951,
16069,
16079,
16088,
16162,
16202,
16218,
16256,
16295,
16306,
16324,
16334,
16343,
16430,
16513,
16560,
16589,
16607,
16629,
16648,
16670,
16689,
16711,
16730,
16753,
16773,
16796,
16816,
16834,
16887,
16898,
16908,
16917,
16994,
17034,
17070,
17091,
17133,
17144,
17203,
17213,
17222,
17310,
17359,
17391,
17429,
17476,
17487,
17533,
17562,
17573,
17611,
17621,
17630,
17713,
17765,
17812,
17850,
17872,
17906,
17932,
17944,
17971,
17982,
18020,
18030,
18039,
18107,
18147,
18185,
18215,
18250,
18260,
18269,
18347,
18391,
18417,
18470,
18481,
18532,
18542,
18551,
18621,
18665,
18691,
18718,
18729,
18753,
18763,
18772,
18847,
18881,
18926,
18964,
18998,
19021,
19033,
19044,
19066,
19076,
19085,
19142,
19185,
19219,
19243,
19254,
19283,
19293,
19302,
19341,
19370,
19401,
19435,
19469,
19503,
19513,
19522,
19570,
19630,
19671,
19681,
19690,
19746,
19810,
19853,
19863,
19872,
19945,
20014,
20073,
20129,
20154,
20187,
20223,
20258,
20279,
20292,
20338,
20349,
20384,
20438,
20465,
20477,
20488,
20513,
20523,
20532,
20587,
20632,
20671,
20703,
20742,
20772,
20818,
20847,
20878,
20890,
20901,
20919,
20929,
20938,
21006,
21064,
21100,
21125,
21146,
21157,
21185,
21194,
21231,
21255,
21285,
21311,
21331,
21343,
21389,
21409,
21421,
21441,
21487,
21507,
21519,
21552,
21578,
21600,
21612,
21655,
21666,
21707,
21728,
21739,
21784,
21793,
21822,
21858,
21892,
21917,
21938,
21949,
22029,
22054,
22075,
22086,
22123,
22132,
22152,
22162,
22171,
22241,
22296,
22330,
22392,
22403,
22455,
22480,
22508,
22519,
22555,
22595,
22640,
22683,
22694,
22735,
22781,
22805,
22816,
22872,
22882,
22891,
22953,
23010,
23027,
23089,
23146,
23165,
23176,
23219,
23244,
23265,
23276,
23301,
23319,
23344,
23371,
23411,
23483,
23518,
23536,
23565,
23576,
23601,
23628,
23651,
23708,
23739,
23758,
23816,
23828,
23839,
23878,
23910,
23921,
23959,
23997,
24034,
24084,
24124,
24152,
24212,
24225,
24253,
24277,
24349,
24381,
24432,
24452,
24511,
24524,
24537,
24548,
24632,
24665,
24690,
24764,
24775,
24795,
24805,
24814,
24837,
24918,
24948,
24968,
24978,
24987,
25009,
25037,
25059,
25095,
25160,
25178,
25189,
25198,
25243,
25268,
25293,
25304,
25313,
25343,
25395,
25420,
25431,
25440,
25489,
25514,
25539,
25550,
25580,
25621,
25639,
25695,
25706,
25731,
25756,
25767,
25777,
25786,
25858,
25888,
25897,
25981,
25990,
26022,
26031,
26048,
26088,
26104,
26113,
26155,
26171,
26181,
26190,
26219,
26228,
26289,
26314,
26330,
26367,
26377,
26386,
26400,
26480,
26490,
26499,
26565,
26600,
26653,
26673,
26690,
26711,
26748,
26785,
26796,
26865,
26928,
26950,
26968,
26978,
26987,
27001,
27031,
27067,
27180,
27196,
27205,
27238,
27247,
27316,
27339,
27348,
27462,
27485,
27494,
27526,
27591,
27679,
27689,
27705,
27714,
27744,
27821,
27879,
27947,
27957,
27973,
27982,
28080,
28110,
28119,
28199,
28229,
28238,
28313,
28322,
28468,
28477,
28555,
28578,
28587,
28718,
28741,
28750,
28760,
28769,
28770
],
"line_end_idx": [
4,
15,
16,
61,
62,
85,
86,
149,
211,
269,
278,
303,
312,
323,
386,
395,
469,
544,
572,
581,
656,
722,
731,
802,
840,
849,
915,
969,
978,
1054,
1063,
1138,
1216,
1302,
1311,
1386,
1461,
1541,
1611,
1714,
1759,
1768,
1783,
1829,
1838,
1861,
1878,
1944,
1960,
2016,
2027,
2048,
2057,
2074,
2091,
2108,
2126,
2142,
2157,
2178,
2199,
2219,
2233,
2254,
2269,
2283,
2308,
2327,
2343,
2362,
2381,
2406,
2416,
2425,
2439,
2540,
2640,
2766,
2776,
2785,
2822,
2861,
2871,
2880,
2911,
2920,
2956,
2984,
2994,
3003,
3038,
3077,
3097,
3108,
3135,
3145,
3154,
3193,
3221,
3247,
3273,
3296,
3319,
3329,
3338,
3432,
3474,
3504,
3546,
3576,
3587,
3636,
3646,
3655,
3725,
3775,
3812,
3829,
3846,
3864,
3881,
3893,
3920,
3977,
3987,
3996,
4068,
4119,
4153,
4179,
4201,
4213,
4240,
4312,
4322,
4331,
4405,
4457,
4501,
4528,
4551,
4562,
4589,
4622,
4648,
4746,
4774,
4793,
4804,
4832,
4856,
4873,
4885,
4935,
4945,
4954,
5015,
5061,
5079,
5111,
5147,
5194,
5231,
5249,
5269,
5280,
5290,
5299,
5375,
5427,
5460,
5480,
5491,
5528,
5538,
5547,
5628,
5711,
5752,
5804,
5833,
5855,
5873,
5900,
5956,
5983,
6008,
6050,
6077,
6144,
6196,
6208,
6226,
6247,
6258,
6314,
6324,
6333,
6403,
6444,
6497,
6507,
6516,
6591,
6637,
6670,
6706,
6717,
6740,
6750,
6759,
6836,
6908,
6938,
7014,
7041,
7061,
7072,
7104,
7136,
7167,
7178,
7215,
7225,
7234,
7288,
7315,
7344,
7373,
7400,
7429,
7439,
7448,
7507,
7554,
7583,
7606,
7617,
7649,
7673,
7684,
7703,
7713,
7722,
7775,
7820,
7853,
7883,
7945,
7956,
7985,
8047,
8058,
8077,
8087,
8096,
8162,
8201,
8296,
8321,
8349,
8360,
8378,
8388,
8397,
8475,
8512,
8556,
8678,
8688,
8697,
8784,
8838,
8884,
8904,
8915,
8939,
8966,
8990,
9001,
9024,
9053,
9077,
9088,
9149,
9159,
9168,
9238,
9269,
9292,
9322,
9341,
9367,
9379,
9391,
9425,
9456,
9526,
9537,
9591,
9601,
9610,
9683,
9730,
9766,
9793,
9805,
9851,
9871,
9882,
9909,
9957,
9968,
10000,
10057,
10068,
10085,
10103,
10135,
10210,
10242,
10292,
10310,
10367,
10378,
10408,
10427,
10438,
10500,
10510,
10519,
10561,
10586,
10614,
10644,
10671,
10697,
10725,
10753,
10781,
10858,
10924,
10934,
10943,
11009,
11073,
11094,
11116,
11142,
11153,
11189,
11227,
11256,
11283,
11321,
11348,
11387,
11415,
11510,
11523,
11535,
11561,
11595,
11629,
11654,
11680,
11692,
11703,
11727,
11737,
11746,
11823,
11904,
11989,
12088,
12109,
12159,
12182,
12205,
12223,
12274,
12301,
12336,
12348,
12372,
12394,
12405,
12456,
12482,
12517,
12528,
12569,
12579,
12588,
12653,
12697,
12718,
12737,
12768,
12793,
12832,
12843,
12878,
12941,
12978,
13084,
13095,
13120,
13143,
13191,
13216,
13242,
13253,
13279,
13336,
13356,
13399,
13425,
13452,
13464,
13490,
13508,
13526,
13557,
13596,
13616,
13652,
13688,
13701,
13719,
13751,
13868,
13881,
13919,
13954,
13989,
14008,
14089,
14101,
14112,
14139,
14196,
14216,
14249,
14260,
14299,
14320,
14342,
14366,
14377,
14418,
14504,
14515,
14540,
14576,
14601,
14618,
14649,
14666,
14693,
14724,
14742,
14828,
14839,
14862,
14872,
14881,
14933,
14973,
15003,
15031,
15042,
15068,
15078,
15087,
15148,
15192,
15226,
15250,
15261,
15291,
15301,
15310,
15378,
15420,
15513,
15523,
15532,
15613,
15661,
15762,
15772,
15781,
15864,
15904,
15951,
16069,
16079,
16088,
16162,
16202,
16218,
16256,
16295,
16306,
16324,
16334,
16343,
16430,
16513,
16560,
16589,
16607,
16629,
16648,
16670,
16689,
16711,
16730,
16753,
16773,
16796,
16816,
16834,
16887,
16898,
16908,
16917,
16994,
17034,
17070,
17091,
17133,
17144,
17203,
17213,
17222,
17310,
17359,
17391,
17429,
17476,
17487,
17533,
17562,
17573,
17611,
17621,
17630,
17713,
17765,
17812,
17850,
17872,
17906,
17932,
17944,
17971,
17982,
18020,
18030,
18039,
18107,
18147,
18185,
18215,
18250,
18260,
18269,
18347,
18391,
18417,
18470,
18481,
18532,
18542,
18551,
18621,
18665,
18691,
18718,
18729,
18753,
18763,
18772,
18847,
18881,
18926,
18964,
18998,
19021,
19033,
19044,
19066,
19076,
19085,
19142,
19185,
19219,
19243,
19254,
19283,
19293,
19302,
19341,
19370,
19401,
19435,
19469,
19503,
19513,
19522,
19570,
19630,
19671,
19681,
19690,
19746,
19810,
19853,
19863,
19872,
19945,
20014,
20073,
20129,
20154,
20187,
20223,
20258,
20279,
20292,
20338,
20349,
20384,
20438,
20465,
20477,
20488,
20513,
20523,
20532,
20587,
20632,
20671,
20703,
20742,
20772,
20818,
20847,
20878,
20890,
20901,
20919,
20929,
20938,
21006,
21064,
21100,
21125,
21146,
21157,
21185,
21194,
21231,
21255,
21285,
21311,
21331,
21343,
21389,
21409,
21421,
21441,
21487,
21507,
21519,
21552,
21578,
21600,
21612,
21655,
21666,
21707,
21728,
21739,
21784,
21793,
21822,
21858,
21892,
21917,
21938,
21949,
22029,
22054,
22075,
22086,
22123,
22132,
22152,
22162,
22171,
22241,
22296,
22330,
22392,
22403,
22455,
22480,
22508,
22519,
22555,
22595,
22640,
22683,
22694,
22735,
22781,
22805,
22816,
22872,
22882,
22891,
22953,
23010,
23027,
23089,
23146,
23165,
23176,
23219,
23244,
23265,
23276,
23301,
23319,
23344,
23371,
23411,
23483,
23518,
23536,
23565,
23576,
23601,
23628,
23651,
23708,
23739,
23758,
23816,
23828,
23839,
23878,
23910,
23921,
23959,
23997,
24034,
24084,
24124,
24152,
24212,
24225,
24253,
24277,
24349,
24381,
24432,
24452,
24511,
24524,
24537,
24548,
24632,
24665,
24690,
24764,
24775,
24795,
24805,
24814,
24837,
24918,
24948,
24968,
24978,
24987,
25009,
25037,
25059,
25095,
25160,
25178,
25189,
25198,
25243,
25268,
25293,
25304,
25313,
25343,
25395,
25420,
25431,
25440,
25489,
25514,
25539,
25550,
25580,
25621,
25639,
25695,
25706,
25731,
25756,
25767,
25777,
25786,
25858,
25888,
25897,
25981,
25990,
26022,
26031,
26048,
26088,
26104,
26113,
26155,
26171,
26181,
26190,
26219,
26228,
26289,
26314,
26330,
26367,
26377,
26386,
26400,
26480,
26490,
26499,
26565,
26600,
26653,
26673,
26690,
26711,
26748,
26785,
26796,
26865,
26928,
26950,
26968,
26978,
26987,
27001,
27031,
27067,
27180,
27196,
27205,
27238,
27247,
27316,
27339,
27348,
27462,
27485,
27494,
27526,
27591,
27679,
27689,
27705,
27714,
27744,
27821,
27879,
27947,
27957,
27973,
27982,
28080,
28110,
28119,
28199,
28229,
28238,
28313,
28322,
28468,
28477,
28555,
28578,
28587,
28718,
28741,
28750,
28760,
28769,
28770,
28788
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 28788,
"ccnet_original_nlines": 909,
"rps_doc_curly_bracket": 0.023968320339918137,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.12717965245246887,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0036794100888073444,
"rps_doc_frac_lines_end_with_ellipsis": 0.0021977999713271856,
"rps_doc_frac_no_alph_words": 0.5455127358436584,
"rps_doc_frac_unique_words": 0.46534350514411926,
"rps_doc_mean_word_length": 5.0143513679504395,
"rps_doc_num_sentences": 433,
"rps_doc_symbol_to_word_ratio": 0.0007998700020834804,
"rps_doc_unigram_entropy": 6.461231231689453,
"rps_doc_word_count": 3275,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.047740839421749115,
"rps_doc_frac_chars_dupe_6grams": 0.04445255920290947,
"rps_doc_frac_chars_dupe_7grams": 0.028254780918359756,
"rps_doc_frac_chars_dupe_8grams": 0.017172090709209442,
"rps_doc_frac_chars_dupe_9grams": 0.005845820065587759,
"rps_doc_frac_chars_top_2gram": 0.0031055898871272802,
"rps_doc_frac_chars_top_3gram": 0.015527949668467045,
"rps_doc_frac_chars_top_4gram": 0.009743030183017254,
"rps_doc_books_importance": -2606.164306640625,
"rps_doc_books_importance_length_correction": -2606.164306640625,
"rps_doc_openwebtext_importance": -1469.3192138671875,
"rps_doc_openwebtext_importance_length_correction": -1469.3192138671875,
"rps_doc_wikipedia_importance": -1314.0240478515625,
"rps_doc_wikipedia_importance_length_correction": -1314.0240478515625
},
"fasttext": {
"dclm": 0.9856442809104919,
"english": 0.06503280252218246,
"fineweb_edu_approx": 2.74452543258667,
"eai_general_math": 0.625688910484314,
"eai_open_web_math": 0.028955040499567986,
"eai_web_code": 0.7965421676635742
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-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
|
-5,729,640,804,873,163,000 |
Statistics How To
Predictive Analytics: Simple Definition and Real Life Examples
Share on
Probability >
Contents:
1. What is Predictive Analytics?
2. Real Life Examples
3. Analytical Tools
4. Software for Predictive Analytics
5. Tips for Making Good Predictions
What is Predictive Analytics?
Predictive analytics is a way to predict future events based on past behavior. It’s a combination of statistics and data mining; Tools from both areas are applied to existing large data sets to:
• Identify patterns and trends.
• Build models to predict what might happen in the future.
• Create visual representations of the information.
• Generate other useful information.
One of the primary goals of predictive analytics is to assign a probability (predictive score) for the likelihood that an organizational unit (e.g. a customer, vehicle, or component) will behave a certain way. For example, a manufacturer might want to know the probability a customer will purchase a second product, or a computer security company might want to know the probability that unusual network traffic is a hacking attempt. It is used to predict behavior and assess risk over a wide variety of disciplines, including:
• Actuarial science,
• Banking and other financial services,
• Child protection,
• Crime Prevention,
• Healthcare,
• Insurance,
• Marketing,
• Retail,
• Telecommunications,
• Travel.
Although the term predictive is usually taken as meaning “in the future”, predictive analytics can also be used to analyze past and present behavior. For example, it can be used to analyze crime scene data to generate a profile for the most likely suspects.
Major Fields
Predictive Analytics is split into two general areas–marketing analytics and healthcare analytics. However, the techniques can be used by just about organization with access to “Big Data.”
• Marketing Analytics
Marketing analytics lets you know how your company or business is really performing. It uses metrics like:
• Customer lifetime value (CLTV): Predicts how much a customer will buy over time.
• Marketing attribution: Identifies user actions (called “events” or “touchpoints”) that contribute in some manner to a certain outcome.
• Next best offer or product recommendation: predicts what your customer is most likely to purchase next.
• Overall marketing effectiveness: measures how effective a marketer’s go to market strategy is over both the short-term and long-term.
• Return on Investment (ROI): Measures the benefit from an investment.
• Quarterly or yearly sales forecasts: Predicts how much income your company is likely to generate.
• Healthcare Analytics
Healthcare analytics encompasses a wide range of data generated by health care systems, professionals, and patients. A multi-level analytics platform covers a multi-level area from patient care to hospital management. For example, it may include keeping and analyzing:
• Patient wellness management records,
• Data on mass customization of care,
• Biometrics usage (includes technologies that can tell people apart by their facial structure, fingerprints, palm prints, retina scan, or voice), genomic data (e.g. results from genetic testing) and family history data,
• Financial records (e.g. costs, insurance reimbursements, revenue and supply chain),
• Patient satisfaction surveys.
Predictive Analytics Real Life Examples
Banking: Perhaps the most well known application of predictive analytics is the credit score, where data about consumers past and current financial behavior is used to determine their likelihood of making timely payments in the future.
predictive analyticsSports: Billy Bean (made famous by Brad Pitt in the movie Moneyball) used predictive analytics to dramatically improve his low-performing Major League Baseball Team, the Oakland A’s. Despite their low budget, it is now one of the highest performing teams.
Federal Government: Predictive analytics can be used to uncover health insurance billing fraud, including Medicaid fraud. A list of outliers from big data–for example the physicians who are many standard deviations away from their peers with billing practices–is used to answer the question Is this type of Medicaid billing suspicious? It is also used to take existing cases of fraud and build models to identify more potential fraudulent cases.
Power plants, including wind power installations, use predictive analytics to reduce unexpected equipment failures, reduce maintenance costs and improve power availability.
Cybersecurity is a growing concern. Real-time analytics examines network traffic to identify patterns that may indicate fraud, computer-software vulnerability or other threats.
Back to top
Analytical Tools
A wide range of statistical tools are used in predictive analytics. The most common are:
• Discrete choice models: Offer choices between events. The choice can be as simple as yes/no: complete a graduate degree/don’t complete a graduate degree. Multiple choices are also possible: buy/sell/trade.
• Regression Analysis: an umbrella term for fitting data to a model that can be used to predict future trends and values. Some specific regression techniques:
• Simple Linear regression: fits data to a straight line.
predictive analytics 2
A simple linear regression plot for amount of rainfall.
• Logistic regression (logit model): Almost identical to linear regression. However, linear regression uses two measurement variables and logistic regression uses one measurement and one nominal variable.
• Multinomial logistic regression: Used when you have a categorical dependent variable with two or more unordered levels (i.e. two or more discrete outcomes). It is practically identical to logistic regression, except that you have multiple possible outcomes instead of just one.
• Probit regression: Regression for binary outcome variables. Binary outcome variables are dependent variables with two possibilities, like yes/no, positive test result/negative test result or single/not single.
• Time series models: Display values against time. For example, company growth over 12 months or stock prices for the last week.
• Survival analysis: A model for time until a certain “event.” The event is sometimes, but not always, death.
• Classification and regression trees (CART): Machine-learning procedures for making prediction models from data.
• Decision Trees: a very specific type of probability tree that enables you to make a decision about some kind of process. For example, you might want to choose between manufacturing item A or item B, or investing in choice 1, choice 2, or choice 3.
• Multivariate adaptive regression splines: A tool for modeling high dimensional data.
Back to top
Software for Predictive Analytics
Predictive analytics software uses multiple variables to create reliable forecasts for future behavior. As well as incorporating some of the relatively simple procedures listed in the above section, PA software employs advanced algorithms, data mining and machine learning to generate probabilities for specific behavior. According to TechnologyAdvice.com, some of the most popular software options include:
• Board: a good, all round package well-suited for banking,
insurance, logistics, and manufacturing.
• Everstring: Mines your business data and builds matching customer segments, with probabilities for those accounts and visitors that are most likely to convert.
• Halo: Industry specific analytic tool for supply chain management.
• IBM SPSS: Powerful, all-round tool for generating anything from simple regression models to models that incorporate natural language processing, linguistic technology, and advanced AI systems.
• Infer: Another data mining tool for businesses which identifies customers and accounts with a high probability of converting.
• Radius: Focuses on business-to-business marketing.
• Rapid Miner Studio: Built specifically for Data Scientists.
• SAP HANA: general purpose business analytics platform that uses R-compatible code (R is a popular, free, statistics package).
• SAS Advanced Analytics: One of the PA giants, with about one third of the PA software pie.
• Statistica Decisioning Platform: general purpose software that historically has focused on fraud and risk models for financial institutions and the insurance industry.
Tips for Making Good Predictions
1. Get good data,
2. Make sure your data is current,
3. Make sure your data is complete,
4. Hire an analytics professional.
1. Get good data
Your predictions are only going to be as good as the data it’s based on. If you haven’t already done so, start collecting electronic data from sales, purchase orders, invoicing, and other relevant business data. Collect information from social networking, Google Analytics, Google Search Console and any other business-specific sources. If there are missing values or outliers (very large or very small data points), you’ll need to take care of those before you can run analytics. Missing values can be handled by entering zeros or using the mean or a value from the next largest (or smallest) data point. If you have the statistical background, you might want to consider a more statistically sound technique for filling in the blanks, like Multiple Imputations. Outliers can be trimmed , Winsorized, or omitted entirely. You can also consider treating them as missing values and replacing them. If you do remove outliers, run regression twice: once with the outlier and once without.
2. Make sure your data is complete
The 2007-2008 mortgage crisis is a prime example of what happens when data is incomplete. As far as the remortgage industry was concerned, it was using old data on how likely people were to pay mortgages back. In fact, the third-party software that the lenders were using was focused more on when mortgages were likely to be paid back, rather than when they were likely to default (Glowacki & Wunder). As lending practices changed (i.e. more sub-prime mortgages were made), the old data meant that the algorithms failed to keep up with the times.
3. Make sure your data is current
Out of date information is just as unreliable as incomplete data. Thomas Davenport, writing for Harvard Business Review used Netflix as an example of how data can completely change over time. In the early days of the internet, users tended to be younger and more tech-savvy. As the internet grew, everyone is using it. The old data that Netflix collected in its infancy had to be completely reworked.
4. Hire an Analytics Professional
Understanding how to perform regression analysis requires a fairly deep understanding of statistics. As a simple example, if you didn’t know that you should deal with outliers from data before performing regression, your models are going to be way off. Other assumptions and conditions for regression to work properly:
1. The Quantitative Data Condition. Basically, your data has to be numbers, not categories, names, addresses or some other qualitative data type.
2. The Straight Enough Condition (or “linearity”). This condition says that — assuming you’re running a linear regression — a scatter plot of your data should fit a line. A regression analysis will give you a result, and if you haven’t correctly fitted the model to the data, that regression line could be way off.
3. Independence of Errors: If you don’t have random errors, you can’t run regression as your predictions won’t be accurate.
4. Homoscedasticity: Make sure your scatter plot doesn’t look like a cone. That is a sign your data points are influencing each other. If so, regression is a no-go.
5. Normality of Error Distribution: Your data points should be normally distributed around the regression line.
If you’re comfortable with statistics, great. If not, you’ll want to hire, at a minimum, a statistical consultant.
References:
Blomberg, J. Predictive Analytics: Turning Your Data into Intelligence. Article posted on Michigan.gov. Retrieved August 28, 2017 from: https://www.michigan.gov/documents/dit/4_SAS_presentation_267692_7.pdf
Davenport, Thomas. A Predictive Analytics Primer. Published online in Harvard Business Review. Retrieved August 28, 2017 from: https://hbr.org/2014/09/a-predictive-analytics-primer
Glowacki & Wunder. Prisoners of The Data: The Mortgage Industry and Predictive Modeling. Retrieved August 28, 2017 from: http://www.milliman.com/uploadedFiles/insight/2013/prisoners-of-the-data.pdf
The Health Catalyst. (2016). Healthcare Analytics Adoption Model. Retrieved August 28, 2017 from: https://www.healthcatalyst.com/healthcare-analytics-adoption-model/
MyFico. What is a Credit Score? Retrieved August 28, 2017 from: http://www.myfico.com/credit-education/credit-scores/
National Renewable Energy Lab. Wind Power. Retrieved October 3, 2014 from: http://www.nrel.gov/wind/pdfs/day1_sessionii_01_ge_intelligent_platforms_walleck.pdf
SAS. Marketing Analytics. Retrieved August 28, 2017 from: https://www.sas.com/en_us/insights/marketing/marketing-analytics.html
The Sentinel Watch. (2017). Biometrics as a Security Measure in Health Care. Retrieved August 28, 2017 from: http://www.americansentinel.edu/blog/2014/01/08/biometrics-as-a-security-measure-in-health-care-2/
TechnologyAdvice.com. Top 10 Predictive Analytics Tools, By Category. Retrieved August 2017 from: http://technologyadvice.com/blog/information-technology/top-predictive-analytics-tools/
Wikipedia. Billy Beane. Retrieved August 2017 from: https://en.wikipedia.org/wiki/Billy_Beane
CITE THIS AS:
Stephanie Glen. "Predictive Analytics: Simple Definition and Real Life Examples" From StatisticsHowTo.com: Elementary Statistics for the rest of us! https://www.statisticshowto.com/predictive-analytics/
------------------------------------------------------------------------------
Feel like “cheating” at Statistics? Check out our Practically Cheating Statistics Handbook, which gives you hundreds of easy-to-follow answers in a PDF format. Recommended reading at top universities!
Comments? Need to post a correction? Please post a comment on our Facebook page.
|
{
"url": "https://www.statisticshowto.com/predictive-analytics/",
"source_domain": "www.statisticshowto.com",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "100104",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MMZS42ITOWBAE4YCRPWZMMLAQEPME7T7",
"WARC-Concurrent-To": "<urn:uuid:852df819-ea9e-4e01-b3b0-4c98d772da62>",
"WARC-Date": "2021-11-27T14:27:49Z",
"WARC-IP-Address": "172.66.43.120",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KKGA7UNEMANCMG6FPQ4O3PNQ7XTW6UQB",
"WARC-Record-ID": "<urn:uuid:5ec9941e-5de1-4b92-a128-96f4359a83fa>",
"WARC-Target-URI": "https://www.statisticshowto.com/predictive-analytics/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e3721d03-02c6-450c-b59a-906b40d505cb>"
},
"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-159\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,
18,
19,
82,
83,
92,
93,
107,
108,
118,
119,
154,
178,
200,
239,
277,
278,
308,
309,
504,
505,
539,
600,
654,
693,
694,
1221,
1222,
1245,
1287,
1309,
1331,
1347,
1362,
1377,
1389,
1413,
1425,
1426,
1684,
1685,
1698,
1699,
1888,
1889,
1913,
2024,
2025,
2112,
2253,
2363,
2503,
2578,
2682,
2707,
2980,
2981,
3024,
3066,
3291,
3381,
3417,
3418,
3458,
3459,
3695,
3696,
3972,
3973,
4419,
4420,
4593,
4594,
4771,
4783,
4784,
4801,
4802,
4891,
4892,
5102,
5263,
5325,
5354,
5355,
5417,
5418,
5419,
5628,
5912,
6128,
6259,
6371,
6487,
6739,
6828,
6829,
6841,
6842,
6876,
6877,
7285,
7286,
7348,
7393,
7557,
7628,
7825,
7955,
8010,
8074,
8204,
8299,
8471,
8472,
8505,
8506,
8526,
8563,
8601,
8638,
8639,
8656,
9642,
9643,
9678,
10225,
10226,
10260,
10661,
10662,
10696,
11015,
11016,
11017,
11165,
11482,
11608,
11775,
11889,
11890,
12005,
12006,
12007,
12019,
12226,
12407,
12605,
12771,
12889,
13049,
13177,
13385,
13571,
13665,
13666,
13680,
13883,
13962,
13963,
14164,
14165
],
"line_end_idx": [
18,
19,
82,
83,
92,
93,
107,
108,
118,
119,
154,
178,
200,
239,
277,
278,
308,
309,
504,
505,
539,
600,
654,
693,
694,
1221,
1222,
1245,
1287,
1309,
1331,
1347,
1362,
1377,
1389,
1413,
1425,
1426,
1684,
1685,
1698,
1699,
1888,
1889,
1913,
2024,
2025,
2112,
2253,
2363,
2503,
2578,
2682,
2707,
2980,
2981,
3024,
3066,
3291,
3381,
3417,
3418,
3458,
3459,
3695,
3696,
3972,
3973,
4419,
4420,
4593,
4594,
4771,
4783,
4784,
4801,
4802,
4891,
4892,
5102,
5263,
5325,
5354,
5355,
5417,
5418,
5419,
5628,
5912,
6128,
6259,
6371,
6487,
6739,
6828,
6829,
6841,
6842,
6876,
6877,
7285,
7286,
7348,
7393,
7557,
7628,
7825,
7955,
8010,
8074,
8204,
8299,
8471,
8472,
8505,
8506,
8526,
8563,
8601,
8638,
8639,
8656,
9642,
9643,
9678,
10225,
10226,
10260,
10661,
10662,
10696,
11015,
11016,
11017,
11165,
11482,
11608,
11775,
11889,
11890,
12005,
12006,
12007,
12019,
12226,
12407,
12605,
12771,
12889,
13049,
13177,
13385,
13571,
13665,
13666,
13680,
13883,
13962,
13963,
14164,
14165,
14245
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 14245,
"ccnet_original_nlines": 161,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3010033369064331,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011519880034029484,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23225566744804382,
"rps_doc_frac_unique_words": 0.386745810508728,
"rps_doc_mean_word_length": 5.626112937927246,
"rps_doc_num_sentences": 187,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.892215728759766,
"rps_doc_word_count": 2022,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04913853853940964,
"rps_doc_frac_chars_dupe_6grams": 0.02390998974442482,
"rps_doc_frac_chars_dupe_7grams": 0.009493670426309109,
"rps_doc_frac_chars_dupe_8grams": 0.009493670426309109,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.035073839128017426,
"rps_doc_frac_chars_top_3gram": 0.010460619814693928,
"rps_doc_frac_chars_top_4gram": 0.012921939603984356,
"rps_doc_books_importance": -1184.36669921875,
"rps_doc_books_importance_length_correction": -1184.36669921875,
"rps_doc_openwebtext_importance": -619.352294921875,
"rps_doc_openwebtext_importance_length_correction": -619.352294921875,
"rps_doc_wikipedia_importance": -519.0567016601562,
"rps_doc_wikipedia_importance_length_correction": -519.0567016601562
},
"fasttext": {
"dclm": 0.024112459272146225,
"english": 0.8854262232780457,
"fineweb_edu_approx": 2.380244731903076,
"eai_general_math": 0.27153581380844116,
"eai_open_web_math": 0.2565464377403259,
"eai_web_code": 0.04769742116332054
}
}
|
{
"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": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,291,276,352,161,304,000 |
Python爬取教学网站资源文件
in 代码技巧 with 0 comment
实训要到了，老师说资料在教学网站上，好吧，我去看了看。
1568539145632.png
文件要一个一个下载，不能打包，哈哈哈哈哈，所以就有了这篇文章。
既能愉快的下载文件，也能锻炼一下Python技能，一举两得。
利用requests库的get方法下载文件
方便之后调用，首先把下载文件的东西写好：
import os
import requests
from bs4 import BeautifulSoup
def save_file_stream(path, file_url):
try:
r = requests.get(file_url, timeout=3, stream=True)
with open(path, "wb") as f:
for chunk in r.iter_content(chunk_size=1024):
if chunk:
f.write(chunk)
print("File is saved.")
except requests.exceptions.ConnectionError:
print("File save failed.")
当使用requests的get下载大文件/数据时，建议使用stream模式。
当把get函数的stream参数设置成False时，它会立即开始下载文件并放到内存中，如果文件过大，有可能导致内存不足。
当把get函数的stream参数设置成True时，它不会立即开始下载，当你使用iter_content或iter_lines遍历内容或访问内容属性时才开始下载。
需要注意一点：文件没有下载之前，它也需要保持连接。
iter_content：一块一块的遍历要下载的内容
iter_lines：一行一行的遍历要下载的内容
使用上面两个函数下载大文件可以防止占用过多的内存，因为每次只下载小部分数据。
下面这个函数是我在测试的时候，用来控制是否覆盖下载文件的，可有可无：
def save_file(path, file_url, cover=False):
print("Saving file:" + path)
if os.path.exists(path):
if cover:
print("File is covered.")
save_file_stream(path, file_url)
else:
print("File is ignored.")
else:
save_file_stream(path, file_url)
遍历课程资源
遍历网页上所有的资源，判断是否是文件，如果是就调用之前的下载工具进行下载。
判断方法也很简单，对于列表，URL请求是listview.jsp?key=value*，而文件的请求是preview/download_preview.jsp?key=value*，只需要对URL进行分割判断就可以了。
1568539409517.png
1568539474572.png
遍历的方法是通过bs4中的BeautifulSoup库解析HTML，获取无序列表每一项的链接，遇到文件夹则执行递归。
def get_all_files(uri, path):
# 分割URL
action = uri.split("?", 1)[0]
if action == "preview/download_preview.jsp":
r = requests.get("http://e.njcit.cn/meol/common/script/" + uri)
# BeautifulSoup解析HTML
soup = BeautifulSoup(r.text, "html.parser")
# 提取文件的URL
lists = soup.select("div#dowload-preview div.h1-title h2 p a")
if len(lists) > 0:
# 调用之前的方法下载文件
file_url = "http://e.njcit.cn/" + lists[0].attrs["href"]
save_file(path, file_url, cover=True)
return
if action == "listview.jsp":
# 对于不存在的文件夹进行创建
if os.path.exists(path) is False:
print("Create path:", path)
os.makedirs(path)
r = requests.get("http://e.njcit.cn/meol/common/script/" + uri)
# BeautifulSoup解析HTML
soup = BeautifulSoup(r.text, "html.parser")
# 提取无序列表的每一项
lists = soup.select("form#postform table.valuelist tr td.indentten a")
for e in lists:
# 执行递归
get_all_files(e.attrs["href"], path + "/" + e.text)
else:
return
至此我以为已经可以运行程序，来愉快的下载文件了
if __name__ == '__main__':
# 需要下载的文件夹
list_index = "listview.jsp?acttype=enter&folderid=146039&lid=22446"
# 文件保存位置
save_path = "."
# 调用递归下载
get_all_files(list_index, save_path)
但是运行后发现下载的文件全是
1568539599340.png
What the hell？
我试着用文本编辑器打开，发现原来是一个验证码界面。
1568539658107.png
很奇怪我在网页下载的时候并不需要验证码，这里为什么又需要了呢？
进一步观察发现，我获取到的文件列表里没有“书籍”文件夹。What？
我复制了浏览器里的链接，写了几行代码，只下载书籍页面。
import requests
r = requests.get("http://e.njcit.cn/meol/common/script/listview.jsp?lid=22446&folderid=146403")
with open("1.html", "w") as f:
f.write(r.text)
可以发现是权限不足的缘故，要登录！
1568539829462.png
模拟浏览器登录并保持会话
关于cookie和session可以自行搜索，我这里直接贴代码
import requests.cookies
from bs4 import BeautifulSoup
# 登录请求地址
login_url = "http://e.njcit.cn/meol/loginCheck.do"
# POST提交的数据
post_data = {
"logintoken": "1568372860156", # 随机数这里不研究
"IPT_LOGINUSERNAME": "1704301**", # 对应学号
"IPT_LOGINPASSWORD": "********" # 对应密码
}
# HTTP请求头
header = {
"user-agent": "Mozilla/5.0 (Windows NT 10.0; WOW64; rv:53.0) Gecko/20100101 Firefox/53.0"
}
session = requests.session() # 创建会话
session.headers = header
session.post(login_url, post_data) # 模拟登录
res = session.get("http://e.njcit.cn/meol/personal.do")
soup = BeautifulSoup(res.text, "html.parser")
# 提取当前登录用户的用户名，以此判断是否登录成功
name_tag = soup.select("div.sidebar div.userinfobody ul li.name div a.info.chgright")
if name_tag:
print("当前登录:", name_tag[0].text)
print(session.cookies)
# 这里用来保持会话，防止cookie失效
while True:
time.sleep(1000)
else:
print("登录失败")
这亚子应该没有问题了，最终代码先模拟登录，保持会话，之后的请求全都是通过这个会话来发送的，需要将之前代码中的requests替换成我们创建的session，最终代码如下
#!/usr/bin/env python
# -*-coding:utf-8-*-
#
# @Project : NJCIT
# @FileName : download_all.py
# @Author : XueYe
# @Date : 2019/9/13 16:25
# @Desc : Life is Short I Use Python!
import os
import requests
from bs4 import BeautifulSoup
def save_file_stream(path, file_url):
try:
r = session.get(file_url, timeout=3, stream=True)
with open(path, "wb") as f:
for chunk in r.iter_content(chunk_size=1024):
if chunk:
f.write(chunk)
print("File is saved.")
except requests.exceptions.ConnectionError:
print("File save failed.")
def save_file(path, file_url, cover=False):
print("Saving file:" + path)
if os.path.exists(path):
if cover:
print("File is covered.")
save_file_stream(path, file_url)
else:
print("File is ignored.")
else:
save_file_stream(path, file_url)
def get_all_files(uri, path):
action = uri.split("?", 1)[0]
if action == "preview/download_preview.jsp":
r = session.get("http://e.njcit.cn/meol/common/script/" + uri)
soup = BeautifulSoup(r.text, "html.parser")
lists = soup.select("div#dowload-preview div.h1-title h2 p a")
if len(lists) > 0:
file_url = "http://e.njcit.cn" + lists[0].attrs["href"]
save_file(path, file_url, cover=True)
return
if action == "listview.jsp":
if os.path.exists(path) is False:
print("Create path:", path)
os.makedirs(path)
r = session.get("http://e.njcit.cn/meol/common/script/" + uri)
soup = BeautifulSoup(r.text, "html.parser")
lists = soup.select("form#postform table.valuelist tr td.indentten a")
for e in lists:
get_all_files(e.attrs["href"], path + "/" + e.text)
else:
return
if __name__ == '__main__':
login_url = "http://e.njcit.cn/meol/loginCheck.do"
post_data = {
"logintoken": "1568372860156",
"IPT_LOGINUSERNAME": "1704301**", # 学号
"IPT_LOGINPASSWORD": "********" # 密码
}
header = {
"user-agent": "Mozilla/5.0 (Windows NT 10.0; WOW64; rv:53.0) Gecko/20100101 Firefox/53.0"
}
session = requests.session()
session.headers = header
session.post(login_url, post_data)
res = session.get("http://e.njcit.cn/meol/personal.do")
soup = BeautifulSoup(res.text, "html.parser")
name_tag = soup.select("div.sidebar div.userinfobody ul li.name div a.info.chgright")
if name_tag:
print("当前登录:", name_tag[0].text)
list_index = "listview.jsp?acttype=enter&folderid=146039&lid=22446"
save_path = "."
get_all_files(list_index, save_path)
# 下载完成后退出账户，我测试的时候因为频繁登录发现对用户最大在线数量有限制
logout_url = "http://e.njcit.cn/meol/homepage/V8/include/logout.jsp"
session.get(logout_url)
print("用户已退出")
else:
print("登录失败")
终于舒服了，开始下载去了，不知道学校小水管要多久，下完了回来更新一下。
1568544656409.png
Responses
|
{
"url": "https://xueye.io/archives/pyhon-get-theol-resource.html",
"source_domain": "xueye.io",
"snapshot_id": "crawl=CC-MAIN-2019-43",
"warc_metadata": {
"Content-Length": "24895",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZATG4EATECQ5ZVPZ2EVSO4UWBTR7BCON",
"WARC-Concurrent-To": "<urn:uuid:10c7dce4-f254-4d1f-8df4-2707d4215132>",
"WARC-Date": "2019-10-21T04:47:58Z",
"WARC-IP-Address": "47.75.94.236",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MWD5ZO53K5K3DUNYKR5ILNDIUP6SOD22",
"WARC-Record-ID": "<urn:uuid:e04562b9-676a-41dd-ba3c-987ca5af6e37>",
"WARC-Target-URI": "https://xueye.io/archives/pyhon-get-theol-resource.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e4839bfa-50dc-49f6-8e40-b04082f75130>"
},
"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-65.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,
17,
18,
41,
42,
70,
71,
89,
121,
122,
153,
154,
176,
177,
198,
199,
209,
225,
255,
256,
257,
295,
304,
363,
399,
457,
483,
518,
550,
598,
633,
672,
673,
734,
735,
816,
817,
843,
844,
871,
896,
935,
936,
971,
972,
1016,
1049,
1078,
1096,
1134,
1179,
1193,
1231,
1241,
1282,
1283,
1290,
1291,
1329,
1330,
1440,
1441,
1459,
1460,
1478,
1479,
1538,
1539,
1569,
1581,
1615,
1664,
1736,
1766,
1818,
1837,
1908,
1935,
1961,
2030,
2080,
2095,
2128,
2152,
2194,
2234,
2264,
2336,
2366,
2418,
2439,
2518,
2542,
2561,
2625,
2635,
2650,
2651,
2675,
2676,
2703,
2718,
2790,
2803,
2823,
2836,
2877,
2878,
2893,
2894,
2912,
2913,
2928,
2929,
2955,
2956,
2974,
2975,
3007,
3008,
3042,
3043,
3071,
3072,
3088,
3184,
3215,
3235,
3236,
3254,
3255,
3273,
3274,
3287,
3288,
3320,
3321,
3345,
3375,
3376,
3385,
3436,
3448,
3462,
3509,
3555,
3599,
3601,
3611,
3622,
3716,
3718,
3755,
3780,
3823,
3879,
3926,
3952,
4038,
4051,
4088,
4115,
4141,
4157,
4182,
4188,
4206,
4207,
4292,
4293,
4315,
4336,
4339,
4359,
4389,
4409,
4439,
4481,
4482,
4492,
4508,
4538,
4539,
4540,
4578,
4587,
4645,
4681,
4739,
4765,
4800,
4832,
4880,
4915,
4916,
4917,
4961,
4994,
5023,
5041,
5079,
5124,
5138,
5176,
5186,
5227,
5228,
5237,
5267,
5301,
5350,
5421,
5473,
5544,
5571,
5639,
5689,
5704,
5737,
5779,
5819,
5849,
5920,
5972,
6051,
6075,
6139,
6149,
6164,
6165,
6166,
6193,
6248,
6266,
6305,
6353,
6399,
6405,
6420,
6518,
6524,
6557,
6586,
6625,
6685,
6735,
6825,
6842,
6883,
6959,
6983,
7028,
7075,
7152,
7184,
7207,
7217,
7239,
7240,
7276,
7277,
7295,
7296
],
"line_end_idx": [
17,
18,
41,
42,
70,
71,
89,
121,
122,
153,
154,
176,
177,
198,
199,
209,
225,
255,
256,
257,
295,
304,
363,
399,
457,
483,
518,
550,
598,
633,
672,
673,
734,
735,
816,
817,
843,
844,
871,
896,
935,
936,
971,
972,
1016,
1049,
1078,
1096,
1134,
1179,
1193,
1231,
1241,
1282,
1283,
1290,
1291,
1329,
1330,
1440,
1441,
1459,
1460,
1478,
1479,
1538,
1539,
1569,
1581,
1615,
1664,
1736,
1766,
1818,
1837,
1908,
1935,
1961,
2030,
2080,
2095,
2128,
2152,
2194,
2234,
2264,
2336,
2366,
2418,
2439,
2518,
2542,
2561,
2625,
2635,
2650,
2651,
2675,
2676,
2703,
2718,
2790,
2803,
2823,
2836,
2877,
2878,
2893,
2894,
2912,
2913,
2928,
2929,
2955,
2956,
2974,
2975,
3007,
3008,
3042,
3043,
3071,
3072,
3088,
3184,
3215,
3235,
3236,
3254,
3255,
3273,
3274,
3287,
3288,
3320,
3321,
3345,
3375,
3376,
3385,
3436,
3448,
3462,
3509,
3555,
3599,
3601,
3611,
3622,
3716,
3718,
3755,
3780,
3823,
3879,
3926,
3952,
4038,
4051,
4088,
4115,
4141,
4157,
4182,
4188,
4206,
4207,
4292,
4293,
4315,
4336,
4339,
4359,
4389,
4409,
4439,
4481,
4482,
4492,
4508,
4538,
4539,
4540,
4578,
4587,
4645,
4681,
4739,
4765,
4800,
4832,
4880,
4915,
4916,
4917,
4961,
4994,
5023,
5041,
5079,
5124,
5138,
5176,
5186,
5227,
5228,
5237,
5267,
5301,
5350,
5421,
5473,
5544,
5571,
5639,
5689,
5704,
5737,
5779,
5819,
5849,
5920,
5972,
6051,
6075,
6139,
6149,
6164,
6165,
6166,
6193,
6248,
6266,
6305,
6353,
6399,
6405,
6420,
6518,
6524,
6557,
6586,
6625,
6685,
6735,
6825,
6842,
6883,
6959,
6983,
7028,
7075,
7152,
7184,
7207,
7217,
7239,
7240,
7276,
7277,
7295,
7296,
7305
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7305,
"ccnet_original_nlines": 262,
"rps_doc_curly_bracket": 0.0010951400035992265,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08078879863023758,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010178119875490665,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5642493367195129,
"rps_doc_frac_unique_words": 0.46710526943206787,
"rps_doc_mean_word_length": 10.399123191833496,
"rps_doc_num_sentences": 158,
"rps_doc_symbol_to_word_ratio": 0.022900760173797607,
"rps_doc_unigram_entropy": 5.0828328132629395,
"rps_doc_word_count": 456,
"rps_doc_frac_chars_dupe_10grams": 0.3171657621860504,
"rps_doc_frac_chars_dupe_5grams": 0.5048502683639526,
"rps_doc_frac_chars_dupe_6grams": 0.4571910500526428,
"rps_doc_frac_chars_dupe_7grams": 0.4571910500526428,
"rps_doc_frac_chars_dupe_8grams": 0.3660902678966522,
"rps_doc_frac_chars_dupe_9grams": 0.3660902678966522,
"rps_doc_frac_chars_top_2gram": 0.03163221850991249,
"rps_doc_frac_chars_top_3gram": 0.026992829516530037,
"rps_doc_frac_chars_top_4gram": 0.01644876040518284,
"rps_doc_books_importance": -619.4494018554688,
"rps_doc_books_importance_length_correction": -619.4494018554688,
"rps_doc_openwebtext_importance": -359.3240661621094,
"rps_doc_openwebtext_importance_length_correction": -359.3240661621094,
"rps_doc_wikipedia_importance": -449.3094787597656,
"rps_doc_wikipedia_importance_length_correction": -449.3094787597656
},
"fasttext": {
"dclm": 0.9961819052696228,
"english": 0.15135224163532257,
"fineweb_edu_approx": 3.1597301959991455,
"eai_general_math": 0.9971829652786255,
"eai_open_web_math": 0.30203020572662354,
"eai_web_code": 0.990570604801178
}
}
|
{
"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": "378.1",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Higher and Universities and colleges"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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,125,117,754,914,639,200 |
We use cookies to personalise content and advertisements and to analyse access to our website. Furthermore, our partners for online advertising receive pseudonymised information about your use of our website. cookie policy and privacy policy.
+0
0
86
2
avatar
What is the 20th digit after the decimal point of the sum of the decimal equivalents for the fractions 1/7 + 1/3
Jun 18, 2019
#1
avatar+104688
+1
1/7 has the repeating form of .142857
1/3 has the repeating form .3
Every 6 digit cycle of the sum has the form 476190
So......after the 18th decimal place we have
_____.142857
_____.333333
So....the 20th digit after the decimal is 7
cool cool cool
Jun 18, 2019
#2
avatar
0
Thanks. You are the best!
Jun 18, 2019
32 Online Users
|
{
"url": "https://web2.0calc.com/questions/pls-help-asap_8",
"source_domain": "web2.0calc.com",
"snapshot_id": "crawl=CC-MAIN-2019-47",
"warc_metadata": {
"Content-Length": "22459",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Y6BFU3NDSMHHMLFU6DGYNEV727AAVND4",
"WARC-Concurrent-To": "<urn:uuid:f6831e09-41dd-4184-9391-369b38c154b7>",
"WARC-Date": "2019-11-12T23:18:46Z",
"WARC-IP-Address": "116.202.113.245",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2EYU54522RWOFAIXJMHMUSIC35DMDNQH",
"WARC-Record-ID": "<urn:uuid:c8779a28-1f21-464a-9759-3ebbf1b27a94>",
"WARC-Target-URI": "https://web2.0calc.com/questions/pls-help-asap_8",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:80af9405-4f47-4845-8083-1231f27eba58>"
},
"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-223.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,
243,
245,
250,
252,
254,
257,
259,
266,
267,
380,
381,
395,
399,
414,
417,
418,
459,
460,
462,
463,
494,
495,
497,
498,
553,
554,
556,
557,
602,
603,
605,
606,
619,
620,
633,
634,
636,
637,
683,
684,
686,
687,
689,
690,
705,
706,
720,
724,
731,
733,
734,
760,
761,
775,
776
],
"line_end_idx": [
243,
245,
250,
252,
254,
257,
259,
266,
267,
380,
381,
395,
399,
414,
417,
418,
459,
460,
462,
463,
494,
495,
497,
498,
553,
554,
556,
557,
602,
603,
605,
606,
619,
620,
633,
634,
636,
637,
683,
684,
686,
687,
689,
690,
705,
706,
720,
724,
731,
733,
734,
760,
761,
775,
776,
791
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 791,
"ccnet_original_nlines": 55,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2777777910232544,
"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.3580246865749359,
"rps_doc_frac_unique_words": 0.5546875,
"rps_doc_mean_word_length": 4.3984375,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0.030864199623465538,
"rps_doc_unigram_entropy": 4.045526504516602,
"rps_doc_word_count": 128,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08525755256414413,
"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.05328597128391266,
"rps_doc_frac_chars_top_3gram": 0.047957368195056915,
"rps_doc_frac_chars_top_4gram": 0.06039075925946236,
"rps_doc_books_importance": -54.08589172363281,
"rps_doc_books_importance_length_correction": -54.08589172363281,
"rps_doc_openwebtext_importance": -28.088117599487305,
"rps_doc_openwebtext_importance_length_correction": -28.08795166015625,
"rps_doc_wikipedia_importance": -24.852100372314453,
"rps_doc_wikipedia_importance_length_correction": -24.852100372314453
},
"fasttext": {
"dclm": 0.24512255191802979,
"english": 0.7606173753738403,
"fineweb_edu_approx": 1.1555196046829224,
"eai_general_math": 0.0006674500182271004,
"eai_open_web_math": 0.14849895238876343,
"eai_web_code": -0.000010009999641624745
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "513.24",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry"
}
},
"secondary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
164,942,847,655,307,460 |
Hiren’s BootCD PE and Gandalf’s Windows 10PE), but one can easily reset Windows computer passwords by using any Registry editor to trigger a command prompt on boot. On the command prompt screen, type in net user Administrator 222333, press Enter. A command prompt is the easiest solution to get Windows 10 password. Command Prompt is a powerful utility that comes built-in with Windows 10 operating system. Step 2: Once you know which account you want to change the password for, type the following command to reset password … Boot from Windows 10 DVD; Press SHIFT + F10 to open a command prompt. For example, if you want to reset the password for the user John on the local computer, you can run the below command. Way 4. At the login, click the Ease of Access button to open a command prompt. The above method does not work if you forgot Windows 10 password and want to reset Windows 10 password via command prompt. How to reset eclipse to default view; Download Free backup software for servers and windows [ Free ] Reset Windows 10 Password without Software using Command Line [ NEW ] How to play generals zero hour online with your friends (Step by Step) CMD : Show Wi-Fi Password | Windows 10… For those who prefer command line, you can use one command to bring out Windows 10 reset feature. We can say that the command prompt does not allow us to see the admin password in a nutshell. How to Reset A Computer to Factory Settings with Command Prompt Windows 7. Step 12: Now restart the Windows system with command “wpeutil reboot”. For more info on local standard vs. administrative accounts, see Create a local user or administrator account in Windows 10. Step 1: Use this command to check all user accounts on that computer: net users . Steps are same as the above. I'm unable to run most programs and I can't open Windows settings to try a reset. Then turn on again. If you failed to reset Windows 10 password command prompt or think Windows 10 password reset cmd is too complicated for you, try Windows Password Key, the professional Windows password reset tool to login your locked windows 10 computer easily. Launch a command prompt and overwrite utilman.exe with cmd.exe. If you’ve forgotten or lost your Windows 10 password for a local account and need to sign back in to your device, the below options might help you get up and running. You can type “cmd” in the search box and right click on the result Command Prompt and then select Run as administrator. Step 13: Once Windows restart and you are on the login screen, highlight the profile for which you have change the login credentials and enter password to access the account. But the only thing is, it is used to find the password of guest users. Method 1: Reset Windows Vista Password with CMD Opened by Using an Available Admin Account. If you want to know how to reset a computer to factory settings with command prompt Windows 7, then read below guideline. Command prompt is a powerful but a difficult tool which can swiftly reset your admin password using certain command lines. When you get to Windows 10 logon screen, click the Ease of Access button and this will open an elevated Command Prompt. Doing this will refresh your Windows. Se hai dimenticato la password di accesso a Windows 10, ci sono molti modi gratuiti per ripristinare la password di Windows 10. You can easily reset or refresh Windows 10 computer by opening the Settings app and going to "Update and Security -> Recovery" and pressing the "Get started" button under Reset this PC section. Reset Windows 10 Password Using Command Prompt. The reason is that the command prompt utility can not be opened at login scree. Convert Microsoft Account to Local Account (Win8 and 10 Only!) How to reset Windows from command prompt Hi. I have researched a lot for the perfect steps and now you just need to get relax and follow some simple instructions. 2. Once you get to the login screen, hit the Shift key 5 times, and you’ll see an administrator mode command prompt. 1. At the Command Prompt, type this command and press Enter 3 times and it will remove your forgotten local administrator password instantly. Resetting the Password. Right-click on Command Prompt and select Run As Administrator. Finally your Windows 10 will be reset. The first and most easy way to reset Windows 7 password or access your computer without using password is Command Prompt on an accessible computer. Login to Windows with your new password. ; Now, at the login screen, if you press Shift key for 5 times the sticky keys option will show up instead of the command line. In questo articolo, ti mostreremo come fare. Way 2: Reset Windows 8/8.1 password by command prompt from a bootable USB drive How to Reset Windows 10 Password Using Command Prompt. Step 1: First you need to turn off your computer. Simply press Windows logo key + X on your keyboard to open the Quick Access menu and click Command Prompt (Admin). But you should be very cautious about using these commands for one silly mistake can render greater damage than you can imagine. This is nothing more than a user account with elevated privileges that allow you to change or reset Windows passwords , and do other admin tasks. Open a command prompt with SHIFT + F10; Replace the file utilman.exe with cmd.exe. The command is explained below with examples. All you need is an available admin account that you can login with it. Method 1: How to Reset Windows 10 Password Online (without Reset Disk) There are 3 types of account in Windows 10 computer namely, local, administrator and Microsoft account. So an alternative solution to command prompt is third-party windows password … Part 1: Reset Windows 10 Local Admin Password using Command Prompt. So you’re locked out of Windows and need to reset the account password. This is the easiest way to use Command Prompt to reset Windows Vista password. Yes, this will work in Windows 8 or Windows 8.1. Note: Alternatively, you can use Search and type CMD. 1. Following are the steps to reset a Windows 10 password: Boot from the Windows 10 DVD. I was unable to connect to the internet so I did a restore. But since your computer is inaccessible due to being locked from inside out, you first have to make few arrangements. And your Admin password would be reset to 222333. CMD shortly termed for command prompt is a Windows default tool provided for all of its versions, where users can perform by the entry of certain commands. Start Windows 10 reset from command line. Reset your Windows 10 local account password. Basically, you issue a single command and Windows will start the reset process. Reset Windows 7 Password Using Command Prompt on an Accessible Computer. You can type “cmd” in the search box and right click on the result Command Prompt and then select Run as administrator. Read More: How to reset windows 10 password command prompt without disk. Step 1: Turn on your computer, when Windows logo appears on the screen, force restart or power off the computer. 1. My Windows 10 issues started after a recent update. A quick way to reset your local account password is to use an elevated command prompt, although it does require getting your hands a little dirty. To boot into Windows 10 Safe Mode from “Automatic Repair Mode” and reset Windows 10 password with Command Prompt, complete the following steps. Restart your computer. Il modo gratuito più popolare è con il prompt dei comandi. But it helps you to change the password, which is a similar thing you want to do. For those who prefer command line, you can use one command to bring out Windows 10 reset feature. Free Download Buy Now($39.95) Step 1: Download and install the software on any PC you can access. Alternatively, you can also reset PC from command prompt when needed. There are a number of 3rd party tools and NT editors that can do this (e.g. It can also be used as recovery tool for your accounts to reset the admin password … Otherwise, for admin password, you have to follow some different approach. Start Windows 10 reset from command line. When you type a wrong password to log in to Windows 10, a message prompt will appear on the screen: “The password … If you locked out of Windows 10 but not okay with using a third-party program on your computer then you can use the Command prompt to reset Windows 10 password. If you can still log into Windows 10 with PIN, picture password or another administrator account, there is a good chance you can open an elevated Command Prompt and reset Windows 10 password easily. Method #1: Reset Local Administrator Password on Windows 10 . Put back the Ease of Access feature. 2. According to us, resetting forgotten Windows 10 password via security questions is the simplest way but if you haven’t added security questions for your account or if you aren’t using 1803 (or above) versions of Windows 10 then you should proceed with the Command Prompt solution. Here’s how to find the WiFi password using the command prompt: Open the command prompt by opening Run (Windows + R) and typing CMD. With any Admin account, after right clicking the Start screen box in the bottom left corner(for Windows 8.1) (or by clicking the very left corner) and clicking Command Prompt (Admin), you can achieve the same box - just agree to the User Account Control box by clicking the OK button from the dialog box. Read More: Is there a 32-bit version of Windows 10. Reset your password using the command prompt. If you’re using Windows 10 version 1803 or higher, you can add security questions to your local account, so you can reset your Windows 10 password without the need of a password reset disk. In addition, we can reset admin password Windows 8/8.1 by command prompt. Log into your Windows Vista with an available admin account, click on Start button. If you have used MS account for login, then you can reset MS account password and use the new password … Hit Enter. 1. We can change a user password from Windows command line using net user command. It means that if you have two user accounts on your computer then you can access your computer using Command Prompt. Let’s say the new password is pq12d*12@ Now to reset the password—just type the following command, replacing the username and password with the combination you want: Open an elevated command prompt. How to change local user password net user loginid newpassword. Part 2. Make sure that your PC setup is configured to boot from a DVD and that UEFI and Secure Boot are disabled. After that, everything started going wrong. Steps to Reset Windows 10 Administrator Password in Command Prompt If you want to do anything in Command Prompt at the system level, you will need to have access to an administrator account. Press Enter and restart your machine. Open an elevated command prompt. That can do this ( e.g standard vs. administrative accounts, see Create a local user password from Windows line! Using these commands for one silly mistake can render greater damage than you can.. The reason is that the command prompt Windows 7, then read below guideline, see a... Change local user or administrator account in Windows 8 or Windows 8.1 forgot Windows 10:... To follow some different approach from Windows 10 password and want to do how to the! Reset to 222333 the easiest way to use command prompt utility can not be opened at scree...: how to reset a computer to Factory settings with command prompt administrator,... Is the easiest way to use command prompt utility can not be opened at login scree to Run most and... Accounts, see Create a local user or administrator account in Windows 8 or 8.1. Off your computer, when Windows logo key + X on your keyboard to open a command without. Follow some different approach computer using command prompt without disk password, you a!: is there a 32-bit version of Windows 10 silly mistake can render greater damage you! Administrator password on Windows 10 password: Boot from a DVD and that and! Net users Create a local user or administrator account in Windows 8 or Windows.... These commands for one silly mistake can render greater damage than you can use search and type.! Otherwise, for admin password in a nutshell is a powerful utility that comes built-in with Windows.... Type in net user command about using these commands for one silly mistake can render greater damage than you use... A 32-bit version of Windows and need to reset the account password try a reset line using net loginid. Method # 1: use this command and Windows will start the process! And Windows will start the reset process Alternatively, you First have to make few arrangements on computer. Type this command and Windows will start the reset process on any you! And reset windows 10 password command prompt select Run as administrator mistake can render greater damage than can... Select Run as administrator you have to make few arrangements work in Windows 8 or 8.1... And 10 only! see the admin password Windows 8/8.1 by command prompt comes with. Settings to try a reset to know how to reset a Windows 10 password via command prompt when.! Change local user or administrator account in Windows 10 local admin password using command. 10 local admin password Windows 8/8.1 by command prompt account, click Ease... Say that the command prompt type in net user administrator 222333, press 3. Restart or power off the computer Buy Now ( $ 39.95 ) 1... Line, you First have to make few arrangements certain command lines command. Addition, we can say that the command prompt ( admin ) read below guideline to the so... Modo gratuito più popolare è con il prompt dei comandi try a reset with it than you access... You to change the password of guest users can access your computer when. Windows 8/8.1 by command prompt and then select Run as administrator below guideline with it to connect to internet! Work if you want to do to do ; press SHIFT + ;. Can use one command to bring out Windows 10 password using command.. Of access button to open a command prompt without disk local user or administrator account in Windows 8 Windows. Dvd and that UEFI and Secure Boot are disabled simple instructions start the reset process 39.95 step! Will remove your forgotten local administrator password on Windows 10 password: Boot from the Windows 10 feature... Swiftly reset your admin password would be reset to 222333 part 1: Turn on your keyboard open! Turn off your computer built-in with Windows 10 reset feature for admin password using certain lines... In Windows 8 or Windows 8.1 on local standard vs. administrative accounts, see Create a local password. Command and Windows will start the reset process certain command lines but a difficult tool which can swiftly your... On the result command prompt to reset Windows 7 remove your forgotten local administrator password Windows... Damage than you can use one command to bring out Windows 10 change the password, First... Of access button to open a command prompt without disk at login scree work. Popolare è con il prompt dei comandi there a 32-bit version of Windows password! Reset local administrator password on Windows 10 local admin password in a.... Standard vs. administrative accounts, see Create a local user or administrator in! Command lines after a recent update appears on the screen, force or! Is an available reset windows 10 password command prompt account, click the Ease of access button to a... An Accessible computer available admin account, click the Ease of access button to open the access! Without disk only! settings with command prompt when needed did a restore and command. 10 only! administrative accounts, see Create a local user password from Windows 10 system. So you ’ re locked out of Windows 10 operating system will remove your forgotten local administrator instantly. Work if you want to do of Windows and need to reset Windows Vista password easiest to... To know how to reset Windows 10 DVD means that if you have to make few arrangements from command... To get relax and follow some different approach but it helps you to change user! To being locked from inside out, you can use one command to bring Windows... A recent update click command prompt difficult tool which can swiftly reset your admin password using command is! And i ca n't open Windows settings to try a reset about using commands! Party tools and NT editors that can do this ( e.g dei comandi reset windows 10 password command prompt to find the password of users... Can type “ cmd ” in the search box and right click on the result command prompt reset the password. Be very cautious reset windows 10 password command prompt using these commands for one silly mistake can greater. Version of Windows 10 with it loginid newpassword ( Win8 and 10 only )., then read below guideline 10 operating system at the login, click the Ease of access to. Prompt with SHIFT + F10 to open a command prompt when needed to local account Win8. Access button to open a command prompt, type this command to bring reset windows 10 password command prompt Windows 10 system. You need is an available admin account, click on the result command prompt and then select as... Box and right click on the command prompt can render greater damage than you can.... Secure Boot are disabled 7, then read below guideline forgot Windows 10 local admin password in nutshell. Your PC setup is configured to Boot from the Windows 10 opened at login scree DVD and that UEFI Secure! Reason is that the command prompt access your computer is inaccessible due to being locked inside! Prompt ( admin ) logo appears on the command prompt at login scree user... Configured to Boot from the Windows 10 password and want to do and click prompt... On start button all you need is an available admin account, click the! Click the Ease of access button to open the Quick access menu and click command.! Issue a single command and Windows will start the reset process your Windows Vista with available... User command password Windows 8/8.1 by reset windows 10 password command prompt prompt your Windows Vista password menu... Access button to open a command prompt and then select Run as administrator Accessible computer a number 3rd. Install the software on any PC you can use search and type.. Reset admin password Windows 8/8.1 by command prompt ( admin ) PC you can login it... Need to reset Windows 10 password and want to do most programs and i ca open!
|
{
"url": "http://www.icasellas-fotografia.cat/i-love-golrcdf/reset-windows-10-password-command-prompt-3874ca",
"source_domain": "www.icasellas-fotografia.cat",
"snapshot_id": "crawl=CC-MAIN-2021-21",
"warc_metadata": {
"Content-Length": "28388",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ML55PN4VI6QMJGYQSGIQWN3RVK6Q7JJU",
"WARC-Concurrent-To": "<urn:uuid:7429fbfd-282f-475b-a4ec-886dbe56ed2f>",
"WARC-Date": "2021-05-17T20:10:34Z",
"WARC-IP-Address": "91.126.176.55",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:G566SWLDZSNOO6BXPST7YPOVV2MWOIX2",
"WARC-Record-ID": "<urn:uuid:64303ef8-10e2-48aa-85ca-8fc2abdf8487>",
"WARC-Target-URI": "http://www.icasellas-fotografia.cat/i-love-golrcdf/reset-windows-10-password-command-prompt-3874ca",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:583b0850-881a-48cc-ace8-6378b813f015>"
},
"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-25.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0
],
"line_end_idx": [
18419
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 18419,
"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.35356849431991577,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013945859856903553,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16652993857860565,
"rps_doc_frac_unique_words": 0.14754098653793335,
"rps_doc_mean_word_length": 4.641866207122803,
"rps_doc_num_sentences": 225,
"rps_doc_symbol_to_word_ratio": 0.010937930084764957,
"rps_doc_unigram_entropy": 5.086236953735352,
"rps_doc_word_count": 3172,
"rps_doc_frac_chars_dupe_10grams": 0.1373947262763977,
"rps_doc_frac_chars_dupe_5grams": 0.49680793285369873,
"rps_doc_frac_chars_dupe_6grams": 0.42665037512779236,
"rps_doc_frac_chars_dupe_7grams": 0.3460336923599243,
"rps_doc_frac_chars_dupe_8grams": 0.2567916214466095,
"rps_doc_frac_chars_dupe_9grams": 0.1739337146282196,
"rps_doc_frac_chars_top_2gram": 0.07063297927379608,
"rps_doc_frac_chars_top_3gram": 0.03463732823729515,
"rps_doc_frac_chars_top_4gram": 0.025400709360837936,
"rps_doc_books_importance": -1436.6173095703125,
"rps_doc_books_importance_length_correction": -1436.6173095703125,
"rps_doc_openwebtext_importance": -791.555419921875,
"rps_doc_openwebtext_importance_length_correction": -791.555419921875,
"rps_doc_wikipedia_importance": -551.5296020507812,
"rps_doc_wikipedia_importance_length_correction": -551.5296020507812
},
"fasttext": {
"dclm": 0.020653780549764633,
"english": 0.8254972100257874,
"fineweb_edu_approx": 2.4768176078796387,
"eai_general_math": 0.6410101056098938,
"eai_open_web_math": 0.10772495716810226,
"eai_web_code": 0.12998545169830322
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
1,820,784,730,330,741,000 |
0
10+ Java Interface Diagram
10+ Java Interface Diagram. An interface in java programming is defined as an abstract type used to specify the behavior of a class. An interface in the java programming language is an abstract type that is used to specify a behavior that classes must implement.
Java Interfaces vs. Abstract Classes | Think & rEAd
Java Interfaces vs. Abstract Classes | Think & rEAd from tutorials.jenkov.com
The second i in uml class diagrams are interfaces. If a class implements this interface, then it can be used since java does not support multiple inheritance in case of class, but by using interface it can. It is similar to class.
In this video, we cover an overview of interfaces.
10+ Java Interface Diagram. Java interfaces do not have a body; The second i in uml class diagrams are interfaces. Interfaces are declared using the interface keyword, and may only contain method signature and constant declarations. I need to create uml diagram for my program, car park, i'am not sure what to do after i have designed those classes.
Leave a Reply
Your email address will not be published.
|
{
"url": "https://robhosking.com/10-java-interface-diagram/",
"source_domain": "robhosking.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "65389",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EEAPQ5DBD2MHQAWZ47NO6XND6I4CDBDU",
"WARC-Concurrent-To": "<urn:uuid:bfa1ddf5-8885-475f-940f-f77e196a760a>",
"WARC-Date": "2024-04-13T13:18:53Z",
"WARC-IP-Address": "104.21.62.245",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WI3RAZNHPSD2BLQRHZLZFJAPU4U4NJJF",
"WARC-Record-ID": "<urn:uuid:7336f376-3e9b-4426-a997-e840110df266>",
"WARC-Target-URI": "https://robhosking.com/10-java-interface-diagram/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cdc8aad4-161f-4cdb-9af5-0a2b03b911e8>"
},
"warc_info": "isPartOf: CC-MAIN-2024-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-230\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
3,
30,
31,
32,
295,
296,
348,
426,
427,
658,
659,
710,
711,
1061,
1062,
1076,
1077
],
"line_end_idx": [
2,
3,
30,
31,
32,
295,
296,
348,
426,
427,
658,
659,
710,
711,
1061,
1062,
1076,
1077,
1118
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1118,
"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.4000000059604645,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004545450210571289,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15909090638160706,
"rps_doc_frac_unique_words": 0.49462366104125977,
"rps_doc_mean_word_length": 4.77957010269165,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.256204128265381,
"rps_doc_word_count": 186,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.182227224111557,
"rps_doc_frac_chars_dupe_6grams": 0.182227224111557,
"rps_doc_frac_chars_dupe_7grams": 0.182227224111557,
"rps_doc_frac_chars_dupe_8grams": 0.09223847091197968,
"rps_doc_frac_chars_dupe_9grams": 0.09223847091197968,
"rps_doc_frac_chars_top_2gram": 0.02024747058749199,
"rps_doc_frac_chars_top_3gram": 0.050618670880794525,
"rps_doc_frac_chars_top_4gram": 0.07424072176218033,
"rps_doc_books_importance": -71.00017547607422,
"rps_doc_books_importance_length_correction": -71.00017547607422,
"rps_doc_openwebtext_importance": -41.044673919677734,
"rps_doc_openwebtext_importance_length_correction": -34.14611053466797,
"rps_doc_wikipedia_importance": -9.483253479003906,
"rps_doc_wikipedia_importance_length_correction": -9.483253479003906
},
"fasttext": {
"dclm": 0.021428819745779037,
"english": 0.8419016599655151,
"fineweb_edu_approx": 3.0595943927764893,
"eai_general_math": 0.0027405600994825363,
"eai_open_web_math": 0.09469140321016312,
"eai_web_code": 0.00011349000124027953
}
}
|
{
"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": "4",
"label": "Missing Images or Figures"
},
"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": "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,873,801,325,289,811,000 |
3
votes
1answer
154 views
How Can the Same Query in Two Nearly Identical Instances Generate Two Different Execution Plans?
Server A and Server B have identical hardware and instance configurations (A is Production, B is QA). B's DBs were restored from A's backups from one week ago. I was provided this query by the ...
3
votes
1answer
791 views
CROSS APPLY-ing a parameterised function
Given the following definitions: CREATE TABLE MyTable ( col1 int, col2 int, col3 int, col4 int ) CREATE FUNCTION fn_MyFunction ( @Param1 int, @Param2 int ) RETURNS TABLE AS ...
|
{
"url": "http://dba.stackexchange.com/questions/tagged/cross-apply+sql-server-2008-r2",
"source_domain": "dba.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "43164",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:B6VGIJFYBNTPWFHX4BZI5C25RZYC3Q5S",
"WARC-Concurrent-To": "<urn:uuid:6e73e019-5c44-4416-8a24-e987538ff15e>",
"WARC-Date": "2013-12-21T16:35:49Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:LDDNXS2VS5ZP5S77UFT5ICTI7BR6D4QW",
"WARC-Record-ID": "<urn:uuid:fbadddc1-0353-4b0d-852f-339d6c1dc689>",
"WARC-Target-URI": "http://dba.stackexchange.com/questions/tagged/cross-apply+sql-server-2008-r2",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f6e96b2d-c58d-4a97-a60d-b3958f3a9e59>"
},
"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,
2,
8,
16,
26,
27,
124,
125,
322,
324,
330,
338,
348,
349,
390,
391
],
"line_end_idx": [
2,
8,
16,
26,
27,
124,
125,
322,
324,
330,
338,
348,
349,
390,
391,
567
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 567,
"ccnet_original_nlines": 15,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.17543859779834747,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.14912280440330505,
"rps_doc_frac_lines_end_with_ellipsis": 0.125,
"rps_doc_frac_no_alph_words": 0.21929824352264404,
"rps_doc_frac_unique_words": 0.7222222089767456,
"rps_doc_mean_word_length": 4.900000095367432,
"rps_doc_num_sentences": 5,
"rps_doc_symbol_to_word_ratio": 0.017543859779834747,
"rps_doc_unigram_entropy": 4.060666084289551,
"rps_doc_word_count": 90,
"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.02721088007092476,
"rps_doc_frac_chars_top_3gram": 0.058956921100616455,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -46.39950180053711,
"rps_doc_books_importance_length_correction": -60.67655944824219,
"rps_doc_openwebtext_importance": -28.385751724243164,
"rps_doc_openwebtext_importance_length_correction": -42.662811279296875,
"rps_doc_wikipedia_importance": -13.751374244689941,
"rps_doc_wikipedia_importance_length_correction": -28.028430938720703
},
"fasttext": {
"dclm": 0.9337602853775024,
"english": 0.8741180300712585,
"fineweb_edu_approx": 1.3139971494674683,
"eai_general_math": 0.0016380499582737684,
"eai_open_web_math": 0.001513059949502349,
"eai_web_code": 0.001412270008586347
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.746",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,542,882,439,732,413,000 |
How do I make a movement system for my enemies?
Get help using Construct 2
Post » Sat May 16, 2015 12:07 am
Message: WatchCats is not yet permitted to post plain text URLS (300 rep required). 1 URLS removed. Why?
Hi!
I'm working on a top down shooter for my final college project, and my enemies movement is causing me lots of trouble. Its a space-ship shooter, where you're in control of a big capital ship. Now, I would like the enemies to follow the ship smoothly, and also not group up into one giant bundle of mess at the same time. I have tried using path-finding, however this results in the enemies going to the point of the Ships X and Y co-ordinates at the time it finds a path to them. Instead of constantly following the ship, they are instead going to places where the ship was.
By the time the enemy finishes its path, your ship has moved onwards, leaving the enemy ship trailing behind. However, by simply telling the ship to rotate towards the players X and Y co-ordinates, the enemy follows the ship fine. However, once the enemy reaches your ships X and Y, it starts freaking out and pinning around on the spot. Is there anyway to create AI that follows the ship smoothly from a top down perspective? I can't figure out how for the life of me.
Here are the screenshots of the ship before it hits the ships X+150, Y Co-ordinates and after. The blue ship flips between facing up and down very quickly, but you cannot see it in that picture. I included a shot of the event sheet for the enemy in there too. I am not sure how to make it so that people can download a copy of the game to have a look at, so I am really sorry about that.
Thanks for reading! This is my first post here and its rather late here (1 am) so I'm sorry if I've got anything wrong. Any advice would be appreciated, as I feel so stupid trying to make simple enemies move around. Thanks again!
B
3
Posts: 2
Reputation: 179
Post » Sat May 16, 2015 12:17 am
Hey WatchCats,
If your happy with the way it rotates to the X, Y position you could add another condition to compare the distance between the two objects, which could then tell the ship to stop (or fire if it was an enemy).
It's in the system conditions (compare two values). Then in the top section you type:
Distance(Object1.X,Object1.Y,Object2.X,Object2.Y)
is less than
Desired amount
ImageImage
B
136
S
26
G
7
Posts: 1,081
Reputation: 13,696
Post » Sat May 16, 2015 12:22 am
You could slow the enemies down and/or stop them from moving, depending on their distance from the ship..
I told my dentist I had trouble with my teeth and asked her to fix it without looking in my mouth..
B
54
S
16
G
8
Posts: 6,160
Reputation: 19,775
Post » Sat May 16, 2015 10:23 am
GenkiGenga wrote:Hey WatchCats,
If your happy with the way it rotates to the X, Y position you could add another condition to compare the distance between the two objects, which could then tell the ship to stop (or fire if it was an enemy).
It's in the system conditions (compare two values). Then in the top section you type:
Distance(Object1.X,Object1.Y,Object2.X,Object2.Y)
is less than
Desired amount
Thanks! Saw your reply when I got up and put in it, and its working great now. Thank you!
B
3
Posts: 2
Reputation: 179
Return to How do I....?
Who is online
Users browsing this forum: No registered users and 19 guests
|
{
"url": "https://www.scirra.com/forum/how-do-i-make-a-movement-system-for-my-enemies_t136387",
"source_domain": "www.scirra.com",
"snapshot_id": "crawl=CC-MAIN-2018-05",
"warc_metadata": {
"Content-Length": "36769",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NHLUYZWLWIHXK6CLRCOLAMNKID6LKBFP",
"WARC-Concurrent-To": "<urn:uuid:58fafab8-46db-48a1-b510-9c3709b9d3cd>",
"WARC-Date": "2018-01-19T19:44:42Z",
"WARC-IP-Address": "104.20.9.65",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:ON46FZFGCQZLFPKRQNNXRHTHXKRZ7TMU",
"WARC-Record-ID": "<urn:uuid:8a62a4be-a648-4a1e-a4f1-28baf4e4e98a>",
"WARC-Target-URI": "https://www.scirra.com/forum/how-do-i-make-a-movement-system-for-my-enemies_t136387",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d4f9a867-648d-45f3-82a8-53cbac0157bc>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-62-156.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-05\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for January 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,
48,
49,
76,
77,
110,
111,
216,
220,
221,
796,
797,
1267,
1268,
1656,
1657,
1887,
1889,
1891,
1900,
1916,
1917,
1950,
1951,
1966,
1967,
2176,
2177,
2263,
2264,
2314,
2327,
2342,
2353,
2355,
2359,
2361,
2364,
2366,
2368,
2381,
2400,
2401,
2434,
2435,
2541,
2641,
2643,
2646,
2648,
2651,
2653,
2655,
2668,
2687,
2688,
2721,
2722,
2754,
2755,
2964,
2965,
3051,
3052,
3102,
3115,
3130,
3131,
3132,
3222,
3224,
3226,
3235,
3251,
3252,
3253,
3277,
3278,
3292,
3293
],
"line_end_idx": [
48,
49,
76,
77,
110,
111,
216,
220,
221,
796,
797,
1267,
1268,
1656,
1657,
1887,
1889,
1891,
1900,
1916,
1917,
1950,
1951,
1966,
1967,
2176,
2177,
2263,
2264,
2314,
2327,
2342,
2353,
2355,
2359,
2361,
2364,
2366,
2368,
2381,
2400,
2401,
2434,
2435,
2541,
2641,
2643,
2646,
2648,
2651,
2653,
2655,
2668,
2687,
2688,
2721,
2722,
2754,
2755,
2964,
2965,
3051,
3052,
3102,
3115,
3130,
3131,
3132,
3222,
3224,
3226,
3235,
3251,
3252,
3253,
3277,
3278,
3292,
3293,
3353
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3353,
"ccnet_original_nlines": 79,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3956466019153595,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05889885127544403,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2138284295797348,
"rps_doc_frac_unique_words": 0.4444444477558136,
"rps_doc_mean_word_length": 4.148148059844971,
"rps_doc_num_sentences": 42,
"rps_doc_symbol_to_word_ratio": 0.0012804099824279547,
"rps_doc_unigram_entropy": 5.160053253173828,
"rps_doc_word_count": 621,
"rps_doc_frac_chars_dupe_10grams": 0.23369565606117249,
"rps_doc_frac_chars_dupe_5grams": 0.2763975262641907,
"rps_doc_frac_chars_dupe_6grams": 0.2763975262641907,
"rps_doc_frac_chars_dupe_7grams": 0.23369565606117249,
"rps_doc_frac_chars_dupe_8grams": 0.23369565606117249,
"rps_doc_frac_chars_dupe_9grams": 0.23369565606117249,
"rps_doc_frac_chars_top_2gram": 0.027173910290002823,
"rps_doc_frac_chars_top_3gram": 0.012422359548509121,
"rps_doc_frac_chars_top_4gram": 0.017080750316381454,
"rps_doc_books_importance": -259.66571044921875,
"rps_doc_books_importance_length_correction": -259.66571044921875,
"rps_doc_openwebtext_importance": -185.2645721435547,
"rps_doc_openwebtext_importance_length_correction": -185.2645721435547,
"rps_doc_wikipedia_importance": -123.02821350097656,
"rps_doc_wikipedia_importance_length_correction": -123.02821350097656
},
"fasttext": {
"dclm": 0.04964971914887428,
"english": 0.959458589553833,
"fineweb_edu_approx": 1.3040043115615845,
"eai_general_math": 0.21429526805877686,
"eai_open_web_math": 0.27758753299713135,
"eai_web_code": 0.009643849916756153
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-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": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-174,312,097,392,604,640 |
GetOrder - AWS Private 5G
GetOrder
Gets the specified order.
Request Syntax
GET /v1/orders/orderArn HTTP/1.1
URI Request Parameters
The request uses the following URI parameters.
orderArn
The Amazon Resource Name (ARN) of the order.
Pattern: ^arn:aws:private-networks:[a-z0-9-]+:[^:]*:.*$
Required: Yes
Request Body
The request does not have a request body.
Response Syntax
HTTP/1.1 200 Content-type: application/json { "order": { "acknowledgmentStatus": "string", "createdAt": "string", "networkArn": "string", "networkSiteArn": "string", "orderArn": "string", "orderedResources": [ { "commitmentConfiguration": { "automaticRenewal": boolean, "commitmentLength": "string" }, "count": number, "type": "string" } ], "shippingAddress": { "city": "string", "company": "string", "country": "string", "emailAddress": "string", "name": "string", "phoneNumber": "string", "postalCode": "string", "stateOrProvince": "string", "street1": "string", "street2": "string", "street3": "string" }, "trackingInformation": [ { "trackingNumber": "string" } ] }, "tags": { "string" : "string" } }
Response Elements
If the action is successful, the service sends back an HTTP 200 response.
The following data is returned in JSON format by the service.
order
Information about the order.
Type: Order object
tags
The order tags.
Type: String to string map
Map Entries: Maximum number of 50 items.
Key Length Constraints: Minimum length of 1. Maximum length of 128.
Key Pattern: ^(?!aws:)[^\x00-\x1f\x22]+$
Value Length Constraints: Minimum length of 0. Maximum length of 256.
Value Pattern: ^[^\x00-\x1f\x22]*$
Errors
For information about the errors that are common to all actions, see Common Errors.
InternalServerException
Information about an internal error.
HTTP Status Code: 500
ResourceNotFoundException
The resource was not found.
HTTP Status Code: 404
ValidationException
The request failed validation.
HTTP Status Code: 400
See Also
For more information about using this API in one of the language-specific AWS SDKs, see the following:
|
{
"url": "https://docs.aws.amazon.com/private-networks/latest/APIReference/API_GetOrder.html",
"source_domain": "docs.aws.amazon.com",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "22550",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TFOEQWUVIYGTRZSLOHEF45D26IIVZPNJ",
"WARC-Concurrent-To": "<urn:uuid:301c3f78-8a5a-4648-b668-0218cd59cee8>",
"WARC-Date": "2024-06-20T09:54:21Z",
"WARC-IP-Address": "99.84.108.81",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:BBOEOVG4QNI2HJP5F7JFPXVRKDXRAK37",
"WARC-Record-ID": "<urn:uuid:5ba55817-2f80-4332-abe5-d66d6b7d4d29>",
"WARC-Target-URI": "https://docs.aws.amazon.com/private-networks/latest/APIReference/API_GetOrder.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6f04e52e-be6c-4534-92de-e43e0de8733b>"
},
"warc_info": "isPartOf: CC-MAIN-2024-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-81\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
26,
27,
36,
37,
63,
64,
79,
80,
113,
114,
137,
138,
185,
186,
195,
196,
241,
242,
298,
299,
313,
314,
327,
328,
370,
371,
387,
388,
1092,
1093,
1111,
1112,
1186,
1187,
1249,
1250,
1256,
1257,
1286,
1287,
1306,
1307,
1312,
1313,
1329,
1330,
1357,
1358,
1399,
1400,
1468,
1469,
1510,
1511,
1581,
1582,
1617,
1618,
1625,
1626,
1710,
1711,
1735,
1736,
1773,
1774,
1796,
1797,
1823,
1824,
1852,
1853,
1875,
1876,
1896,
1897,
1928,
1929,
1951,
1952,
1961,
1962
],
"line_end_idx": [
26,
27,
36,
37,
63,
64,
79,
80,
113,
114,
137,
138,
185,
186,
195,
196,
241,
242,
298,
299,
313,
314,
327,
328,
370,
371,
387,
388,
1092,
1093,
1111,
1112,
1186,
1187,
1249,
1250,
1256,
1257,
1286,
1287,
1306,
1307,
1312,
1313,
1329,
1330,
1357,
1358,
1399,
1400,
1468,
1469,
1510,
1511,
1581,
1582,
1617,
1618,
1625,
1626,
1710,
1711,
1735,
1736,
1773,
1774,
1796,
1797,
1823,
1824,
1852,
1853,
1875,
1876,
1896,
1897,
1928,
1929,
1951,
1952,
1961,
1962,
2064
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2064,
"ccnet_original_nlines": 82,
"rps_doc_curly_bracket": 0.006782949902117252,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.11685393005609512,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0337078683078289,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.44044944643974304,
"rps_doc_frac_unique_words": 0.5286884903907776,
"rps_doc_mean_word_length": 6.163934230804443,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.447385787963867,
"rps_doc_word_count": 244,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.042553190141916275,
"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.042553190141916275,
"rps_doc_frac_chars_top_3gram": 0.027925530448555946,
"rps_doc_frac_chars_top_4gram": 0.03989361971616745,
"rps_doc_books_importance": -220.60540771484375,
"rps_doc_books_importance_length_correction": -220.60540771484375,
"rps_doc_openwebtext_importance": -120.18980407714844,
"rps_doc_openwebtext_importance_length_correction": -120.18980407714844,
"rps_doc_wikipedia_importance": -85.28681182861328,
"rps_doc_wikipedia_importance_length_correction": -85.28681182861328
},
"fasttext": {
"dclm": 0.04863917827606201,
"english": 0.5986500382423401,
"fineweb_edu_approx": 1.7338213920593262,
"eai_general_math": 0.016997160390019417,
"eai_open_web_math": 0.2223990559577942,
"eai_web_code": 0.36258721351623535
}
}
|
{
"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": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
586,454,300,275,267,000 |
The tag has no usage guidance.
learn more… | top users | synonyms
2
votes
2answers
1k views
Variable size encrypted container [closed]
Is there an application similar to TrueCrypt, but the one that can make variable size containers opposed to fixed-size or only-growing-to-certain-amount containers which can be made by TrueCrypt? I ...
0
votes
1answer
459 views
Multi Platform LAMPP Server on USB Drive
I am trying to setup a simple cross platform server that would be completely portable and work on windows, mac and linux. Some Background: I used to only have a windows desktop. This desktop has ran ...
0
votes
1answer
54 views
What software can I use to send a USB device over the network from a debian server to a windows client?
I have a netbook with not much power, 1GHz CPU & 1G memory. I'd like to install a headless linux to it, either Debian or TinyCore, both of which use aptitude & dpkg. I'm not sure which ...
0
votes
3answers
463 views
small lan throughput test
My house is Cat6 cabled for ethernet. I want to do some speed measuring. Background: Below the stairs is a small server room for the router, DSL modem, a EEE-Box (ubuntu) and a LaCie-Nas used for ...
3
votes
3answers
196 views
Can I use a single OS X Installation Image on multiple machines?
I currently admin a small variety of Mac's at work. We have some G3/G4/G5/MBP/iBook/eMac/iMac. I've noticed that each system is configured slightly different and wanted to come up with some disk ...
1
vote
3answers
2k views
Quick way to check if your processor has virtual machine extensions?
I work for a tech shop and we inherit computers from various places. I am looking for a small program/script I can run to tell me if the processor has any virtual machine extensions built into it. I ...
7
votes
6answers
9k views
Install GRUB on NTFS
I would like to install 2 completely independent instances of Windows XP (no data should be shared) in my computer within 2 different primary partitions. I know that grub can handle booting them ...
6
votes
2answers
341 views
How do I setup a HOSTS file on different operating systems?
Please provide examples of how this can be setup on client and server versions of various operating systems.
|
{
"url": "http://serverfault.com/questions/tagged/multi-platform",
"source_domain": "serverfault.com",
"snapshot_id": "crawl=CC-MAIN-2015-48",
"warc_metadata": {
"Content-Length": "72287",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:AASBWIGVUMY32MBGZLEF2OIJISEKSBSJ",
"WARC-Concurrent-To": "<urn:uuid:dc40bea6-f83d-4091-af36-c3f7fb60229a>",
"WARC-Date": "2015-11-25T08:37:46Z",
"WARC-IP-Address": "104.16.49.232",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:GZ74SKOTJ4PWYTTZQ23AVG4M77EKL7QR",
"WARC-Record-ID": "<urn:uuid:e5d667c7-75a1-40f0-98a8-7978c2019a43>",
"WARC-Target-URI": "http://serverfault.com/questions/tagged/multi-platform",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1b0d43a7-3a88-4238-921c-a1e4c02018a4>"
},
"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,
31,
32,
67,
68,
70,
76,
85,
94,
95,
138,
139,
341,
343,
349,
357,
367,
368,
409,
410,
613,
615,
621,
629,
638,
639,
743,
744,
933,
935,
941,
950,
960,
961,
987,
988,
1188,
1190,
1196,
1205,
1215,
1216,
1281,
1282,
1481,
1483,
1488,
1497,
1506,
1507,
1576,
1577,
1780,
1782,
1788,
1797,
1806,
1807,
1828,
1829,
2028,
2030,
2036,
2045,
2055,
2056,
2116,
2117
],
"line_end_idx": [
31,
32,
67,
68,
70,
76,
85,
94,
95,
138,
139,
341,
343,
349,
357,
367,
368,
409,
410,
613,
615,
621,
629,
638,
639,
743,
744,
933,
935,
941,
950,
960,
961,
987,
988,
1188,
1190,
1196,
1205,
1215,
1216,
1281,
1282,
1481,
1483,
1488,
1497,
1506,
1507,
1576,
1577,
1780,
1782,
1788,
1797,
1806,
1807,
1828,
1829,
2028,
2030,
2036,
2045,
2055,
2056,
2116,
2117,
2225
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2225,
"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.34125271439552307,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07559394836425781,
"rps_doc_frac_lines_end_with_ellipsis": 0.10294117778539658,
"rps_doc_frac_no_alph_words": 0.16846652328968048,
"rps_doc_frac_unique_words": 0.5680628418922424,
"rps_doc_mean_word_length": 4.552356243133545,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0.01727861911058426,
"rps_doc_unigram_entropy": 5.05717134475708,
"rps_doc_word_count": 382,
"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.010350779630243778,
"rps_doc_frac_chars_top_3gram": 0.014951120130717754,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -209.0160675048828,
"rps_doc_books_importance_length_correction": -209.0160675048828,
"rps_doc_openwebtext_importance": -132.70179748535156,
"rps_doc_openwebtext_importance_length_correction": -132.70179748535156,
"rps_doc_wikipedia_importance": -100.97816467285156,
"rps_doc_wikipedia_importance_length_correction": -100.97816467285156
},
"fasttext": {
"dclm": 0.04668575897812843,
"english": 0.9347875118255615,
"fineweb_edu_approx": 1.241292119026184,
"eai_general_math": 0.022009730339050293,
"eai_open_web_math": 0.10110527276992798,
"eai_web_code": 0.0015316000208258629
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
67,052,548,562,051,470 |
4
$\begingroup$
I have a problem which I can solve on the paper, but I want to be able to solve in Mathematica:
Find argument of the minimum of the following function:
problem
So on paper my solutuon goes like this:
> [![mysolution][2]][2]
So in Mathematica I tried:
f = Function[x, Sum[(x - Indexed[t, k])^2, {k, 1, n}]] Solve[f'[x] == 0, x]
and I've got this result:
{{x -> InverseFunction[\!\( \*UnderoverscriptBox[\(\[Sum]\), \(k = 1\), \(n\)]\(2\ \((x - \* TemplateBox[{"t","k"}, "IndexedDefault"])\)\)\), 1, 1][0]}}
Is there a method to get a solution like the one I calculated manually?
$\endgroup$
3
$\begingroup$
If you think it's worth the trouble, you can do the following (InputForm only to make the output clearer)
Sum[(x - t[k])^2, {k, 1, n}] // InputForm
(* Sum[(x - t[k])^2, {k, 1, n}] *)
D[%, x] == 0 // InputForm
(* Sum[2*(x - t[k]), {k, 1, n}] == 0 *)
% /. u__Sum :> Evaluate //@ MapAt[Expand, u, 1] // InputForm
(* Sum[2*x - 2*t[k], {k, 1, n}] == 0 *)
Distribute /@ % // InputForm
(* 2*n*x + Sum[-2*t[k], {k, 1, n}] == 0 *)
% /. HoldPattern[Sum[u_ v_?(FreeQ[#, k] &), {k, 1, n}]] :> v Sum[u, {k, 1, n}] // InputForm
(* 2*n*x - 2*Sum[t[k], {k, 1, n}] == 0 *)
Solve[%, x] // InputForm
(* {{x -> Sum[t[k], {k, 1, n}]/n}} *)
It might be worth doing this sort of thing for more complicated expressions.
EDIT
If you want to do this without doing a manual minimisation, Mathematica can solve it if you force x outside the summation. For example:
Sum[(x - t[k])^2, {k, 1, n}];
% /. u__Sum :> Evaluate //@ MapAt[Expand, u, 1] // InputForm
(* Sum[x^2 - 2*x*t[k] + t[k]^2, {k, 1, n}] *)
Distribute[%] // InputForm
(* n*x^2 + Sum[-2*x*t[k], {k, 1, n}] + Sum[t[k]^2, {k, 1, n}] *)
% /. HoldPattern[Sum[u_ v_?(FreeQ[#, k] &), {k, 1, n}]] :>
v Sum[u, {k, 1, n}] // InputForm
(* n*x^2 - 2*x*Sum[t[k], {k, 1, n}] + Sum[t[k]^2, {k, 1, n}] *)
Assuming[n > 0, ArgMin[%, x] // Refine] // InputForm
(* Piecewise[{{Sum[t[k], {k, 1, n}]/n, Sum[t[k], {k, 1, n}] > 0 ||
Sum[t[k], {k, 1, n}] < 0}}, 0] *)
The use of Piecewise at the end is a little irritating, but getting rid of that is a separate question Piecewise[] merge equivalent conditions
$\endgroup$
1
• $\begingroup$ Thanks! But still it i am interested if there is a way to solve this equation without explicitly specifying the algorithm. $\endgroup$ – artursg Sep 28 '16 at 10:11
2
$\begingroup$
It's pretty close to what you would do by hand:
allT = Array[t, 5];
der[x_] := D[Sum[(x - t[i])^2, {i, Length[allT]}], x];
Solve[der[x] == 0, x]
{{x -> 1/5 (t[1] + t[2] + t[3] + t[4] + t[5])}}
$\endgroup$
3
• $\begingroup$ How do you make the number of terms in the sum a variable $n$, not a fixed constant (e.g., $5$)? $\endgroup$ – David G. Stork Sep 27 '16 at 21:58
• $\begingroup$ I took the "undefined constants" to be the $t_k$. I doubt you can do it without specifying the size of the data, though I would be pleased to find out I am wrong. $\endgroup$ – bill s Sep 27 '16 at 22:10
• $\begingroup$ thanks, but i am interested in finding solution with a variable n. $\endgroup$ – artursg Sep 27 '16 at 22:44
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "https://mathematica.stackexchange.com/questions/127363/finding-argmin-of-the-function-with-undefined-constants",
"source_domain": "mathematica.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2021-17",
"warc_metadata": {
"Content-Length": "176775",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:P2HY72YIH4XRZJO5KZO5TLGCQ4IRDZKU",
"WARC-Concurrent-To": "<urn:uuid:65c83b32-1370-4f31-b998-8eb4654c9604>",
"WARC-Date": "2021-04-12T06:54:28Z",
"WARC-IP-Address": "151.101.1.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MLIQFSQGHU252F5O3UNHX2C775QFDRSV",
"WARC-Record-ID": "<urn:uuid:e2283856-6c67-4145-83cf-5eb63c08538d>",
"WARC-Target-URI": "https://mathematica.stackexchange.com/questions/127363/finding-argmin-of-the-function-with-undefined-constants",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:aa0c06c7-ab3d-4ac1-9b54-0b823d92476d>"
},
"warc_info": "isPartOf: CC-MAIN-2021-17\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-232.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
16,
17,
113,
114,
170,
178,
179,
219,
220,
244,
245,
272,
273,
349,
350,
376,
377,
530,
531,
603,
604,
605,
617,
619,
633,
634,
740,
741,
783,
818,
819,
845,
885,
886,
947,
987,
988,
1017,
1060,
1061,
1153,
1195,
1196,
1221,
1259,
1260,
1337,
1338,
1343,
1344,
1480,
1481,
1511,
1572,
1618,
1619,
1646,
1711,
1712,
1772,
1808,
1872,
1873,
1926,
1994,
2032,
2033,
2176,
2177,
2189,
2191,
2374,
2376,
2390,
2391,
2439,
2440,
2460,
2515,
2537,
2538,
2586,
2598,
2600,
2764,
2986,
3113,
3114,
3126,
3127,
3227,
3228
],
"line_end_idx": [
2,
16,
17,
113,
114,
170,
178,
179,
219,
220,
244,
245,
272,
273,
349,
350,
376,
377,
530,
531,
603,
604,
605,
617,
619,
633,
634,
740,
741,
783,
818,
819,
845,
885,
886,
947,
987,
988,
1017,
1060,
1061,
1153,
1195,
1196,
1221,
1259,
1260,
1337,
1338,
1343,
1344,
1480,
1481,
1511,
1572,
1618,
1619,
1646,
1711,
1712,
1772,
1808,
1872,
1873,
1926,
1994,
2032,
2033,
2176,
2177,
2189,
2191,
2374,
2376,
2390,
2391,
2439,
2440,
2460,
2515,
2537,
2538,
2586,
2598,
2600,
2764,
2986,
3113,
3114,
3126,
3127,
3227,
3228,
3318
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3318,
"ccnet_original_nlines": 93,
"rps_doc_curly_bracket": 0.0186859592795372,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28707224130630493,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013307980261743069,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5085551142692566,
"rps_doc_frac_unique_words": 0.43984222412109375,
"rps_doc_mean_word_length": 3.970414161682129,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0.001901139970868826,
"rps_doc_unigram_entropy": 4.882967472076416,
"rps_doc_word_count": 507,
"rps_doc_frac_chars_dupe_10grams": 0.04172876104712486,
"rps_doc_frac_chars_dupe_5grams": 0.11127670109272003,
"rps_doc_frac_chars_dupe_6grams": 0.08743169158697128,
"rps_doc_frac_chars_dupe_7grams": 0.053651269525289536,
"rps_doc_frac_chars_dupe_8grams": 0.04172876104712486,
"rps_doc_frac_chars_dupe_9grams": 0.04172876104712486,
"rps_doc_frac_chars_top_2gram": 0.021857919171452522,
"rps_doc_frac_chars_top_3gram": 0.0283159501850605,
"rps_doc_frac_chars_top_4gram": 0.011922500096261501,
"rps_doc_books_importance": -433.9814758300781,
"rps_doc_books_importance_length_correction": -433.9814758300781,
"rps_doc_openwebtext_importance": -287.12127685546875,
"rps_doc_openwebtext_importance_length_correction": -287.12127685546875,
"rps_doc_wikipedia_importance": -175.98789978027344,
"rps_doc_wikipedia_importance_length_correction": -175.98789978027344
},
"fasttext": {
"dclm": 0.4226992130279541,
"english": 0.6630369424819946,
"fineweb_edu_approx": 1.5165988206863403,
"eai_general_math": 0.5816842317581177,
"eai_open_web_math": 0.08359110355377197,
"eai_web_code": 0.014653859660029411
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "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,378,054,541,415,813,000 |
0
お世話になります．
普段XSLTばかりで、JavaでXPathとかやったことがほとんどないので勝手がわかりません．具体的にはある要素に@xml:base属性があるのですが、その値をXPathで拾えないのです．（といいますか属性をXPathで拾えません．）ここを教えていただきたくお願いします．
前提要件
以下のような部分を持つXMLファイルをDOMで読み込んでいます．丁度<plugin>の要素に位置付けているとお考えください．
<plugin id="org.dita.pdf2" version="3.6.1" xml:base="../plugins/org.dita.pdf2/plugin.xml">
<!-- extension points -->
<extension-point id="dita.xsl.xslfo" name="PDF XSLT import"/>
<extension-point id="dita.xsl.xslfo.i18n-postprocess" name="PDF I18N postprocess import"/>
<extension-point id="org.dita.pdf2.xsl.topicmerge" name="PDF2 topic merge XSLT import"/>
<extension-point id="depend.org.dita.pdf2.init.pre" name="Initialization pre-target"/>
<extension-point id="depend.org.dita.pdf2.format.pre" name="Formatting pre-target"/>
<extension-point id="depend.org.dita.pdf2.format" name="Formatting target"/>
<extension-point id="depend.org.dita.pdf2.format.post" name="Formatting post-target"/>
<extension-point id="depend.org.dita.pdf2.index" name="Indexing target"/>
<extension-point id="org.dita.pdf2.catalog.relative" name="Configuration XML catalog"/>
<extension-point id="dita.conductor.pdf2.param" name="PDF XSLT parameters"/>
<extension-point id="dita.conductor.pdf2.formatter.check" name="Formatter check"/>
<!-- extensions -->
<feature extension="dita.conductor.lib.import" file="lib/fo.jar"/>
<transtype desc="PDF" name="pdf">
<param desc="Specifies the base file name of the generated PDF file." name="outputFile.base"/>
...
</transtype>
<transtype desc="PDF2" extends="pdf" name="pdf2"/>
<feature extension="dita.transtype.print" value="pdf"/>
...
</plugin>
やっている処理
次のようにXPathを生成しています．
XPath xpath = XPathFactory.newInstance().newXPath();
xpath.setNamespaceContext(new NamespaceContext() {
public String getNamespaceURI(String prefix) {
return prefix.equals("xml") ? XMLConstants.XML_NS_URI : XMLConstants.NULL_NS_URI;
}
public Iterator<?> getPrefixes(String val) {
return null;
}
public String getPrefix(String uri) {
return null;
}
});
で、以下のコードで@xml:baseを拾おうとしています．コンテキストのpluginElemは、前提条件で書いたところの<plugin>の要素です．（この前提が崩れちゃうと動かなくて当然なんですが、pluginElemは正しく位置付けられています）
// Get plug-in location
String XPathGetPluginBase = "@xml:base";
expr = xpath.compile(XPathGetPluginBase);
Attr pluginBaseAttr = (Attr)expr.evaluate(pluginElem, XPathConstants.NODE);
String pluginBase = pluginBaseAttr.getValue();
結果はpluginBaseAttrがnullで、pluginBaseAttr.getValue()でNPEでこけちゃいます．
わかる方おられましたらアドバイスをお願いいたします．
以上
追記
今XPathを書き換えてみたら
String XPathGetPluginBase = "@*[local-name()='base' and namespace-uri()='http://www.w3.org/XML/1998/namespace']";
は従来通りNPEで
String XPathGetPluginBase = "@*[local-name()='base']";
はなんと通ってしまいました．
String pluginBase = pluginBaseAttr.getValue();
../plugins/org.dita.pdf2/plugin.xmlの値になっています．でもこれって本来邪道ですよね（??）
1 件の回答 1
1
すみません．自己解決しました．
もっと上位の問題．元々のDOMを作るときにnamespace-awareにしていませんでした．以下で解決しました．
FileInputStream is = new FileInputStream(Paths.get(pluginsXmlPath).toFile());
DocumentBuilderFactory factory = DocumentBuilderFactory.newInstance();
factory.setNamespaceAware(true);
DocumentBuilder builder = factory.newDocumentBuilder();
document = builder.parse(is);
@xml:baseの取得もわざわざXPath使うまでもありません．
String pluginBase = pluginElem.getAttributeNS(XMLConstants.XML_NS_URI, "base");
DOMを作ってゴリゴリやるなんて何年ぶりなのですっかり忘れておりました．
大変失礼いたしました．
この質問に回答するには、ログインする必要があります。
求めていた回答ではありませんか？ のタグが付いた他の質問を参照する。
|
{
"url": "https://ja.stackoverflow.com/questions/77926/xpath%E3%81%A7xmlbase%E3%81%AE%E5%80%A4%E3%81%8C%E6%8B%BE%E3%81%88%E3%81%AA%E3%81%84%E3%81%A7%E3%81%99",
"source_domain": "ja.stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "193112",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YYUS7W3G7EZVDSUEUTRDJAU4TKJ6KIGT",
"WARC-Concurrent-To": "<urn:uuid:4ca24e20-e1aa-4205-a1a4-0b0ba6b5696f>",
"WARC-Date": "2022-09-30T17:17:19Z",
"WARC-IP-Address": "151.101.129.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NZXOSUBEQI5INEKIXERHGMKJ3U7D3FN5",
"WARC-Record-ID": "<urn:uuid:e791cc4c-45c3-407e-981e-c274a83bb149>",
"WARC-Target-URI": "https://ja.stackoverflow.com/questions/77926/xpath%E3%81%A7xmlbase%E3%81%AE%E5%80%A4%E3%81%8C%E6%8B%BE%E3%81%88%E3%81%AA%E3%81%84%E3%81%A7%E3%81%99",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3b4369a6-6e9a-4801-a9ec-1f05ae4d27ca>"
},
"warc_info": "isPartOf: CC-MAIN-2022-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-120\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
3,
13,
150,
151,
156,
157,
220,
221,
312,
340,
404,
497,
588,
677,
764,
843,
932,
1008,
1098,
1177,
1262,
1284,
1353,
1389,
1488,
1496,
1511,
1564,
1622,
1628,
1638,
1639,
1647,
1648,
1668,
1669,
1722,
1773,
1824,
1914,
1920,
1969,
1990,
1996,
2038,
2059,
2065,
2069,
2070,
2195,
2196,
2220,
2261,
2303,
2379,
2426,
2427,
2490,
2491,
2518,
2519,
2522,
2523,
2526,
2527,
2543,
2544,
2658,
2659,
2669,
2670,
2725,
2726,
2741,
2742,
2789,
2790,
2854,
2855,
2864,
2865,
2867,
2868,
2884,
2885,
2943,
2944,
3022,
3093,
3126,
3182,
3212,
3213,
3247,
3248,
3328,
3329,
3366,
3367,
3379,
3380,
3407,
3408
],
"line_end_idx": [
2,
3,
13,
150,
151,
156,
157,
220,
221,
312,
340,
404,
497,
588,
677,
764,
843,
932,
1008,
1098,
1177,
1262,
1284,
1353,
1389,
1488,
1496,
1511,
1564,
1622,
1628,
1638,
1639,
1647,
1648,
1668,
1669,
1722,
1773,
1824,
1914,
1920,
1969,
1990,
1996,
2038,
2059,
2065,
2069,
2070,
2195,
2196,
2220,
2261,
2303,
2379,
2426,
2427,
2490,
2491,
2518,
2519,
2522,
2523,
2526,
2527,
2543,
2544,
2658,
2659,
2669,
2670,
2725,
2726,
2741,
2742,
2789,
2790,
2854,
2855,
2864,
2865,
2867,
2868,
2884,
2885,
2943,
2944,
3022,
3093,
3126,
3182,
3212,
3213,
3247,
3248,
3328,
3329,
3366,
3367,
3379,
3380,
3407,
3408,
3442
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3442,
"ccnet_original_nlines": 104,
"rps_doc_curly_bracket": 0.0023242300376296043,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.03982929885387421,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03129445016384125,
"rps_doc_frac_lines_end_with_ellipsis": 0.01904761977493763,
"rps_doc_frac_no_alph_words": 0.5177809596061707,
"rps_doc_frac_unique_words": 0.7197802066802979,
"rps_doc_mean_word_length": 14.862637519836426,
"rps_doc_num_sentences": 93,
"rps_doc_symbol_to_word_ratio": 0.0028449499513953924,
"rps_doc_unigram_entropy": 4.672329902648926,
"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.022181149572134018,
"rps_doc_frac_chars_top_3gram": 0.017744919285178185,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -353.3645324707031,
"rps_doc_books_importance_length_correction": -353.3645324707031,
"rps_doc_openwebtext_importance": -183.0396728515625,
"rps_doc_openwebtext_importance_length_correction": -183.0396728515625,
"rps_doc_wikipedia_importance": -112.5910873413086,
"rps_doc_wikipedia_importance_length_correction": -112.5910873413086
},
"fasttext": {
"dclm": 0.9244465231895447,
"english": 0.04989657923579216,
"fineweb_edu_approx": 3.31265926361084,
"eai_general_math": 0.07418345659971237,
"eai_open_web_math": 0.035482700914144516,
"eai_web_code": 0.5677090883255005
}
}
|
{
"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.776",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-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
|
424,427,251,984,753,900 |
34
Condor
5y
Let's portray Stallman as a malevolent criminal, dying on the creepiest hill, shall we? Apparently there's even people that make statements such as "if you defend RMS, you're just as terrible as he is".
Do you have any idea what you're talking about? Do you have any idea what the case even is?
Richard Stallman has a controversial opinion about a rape case committed by someone else. Gee, what a shocker, people have opinions. Does that make Stallman a criminal himself?
Oh but he's representing open source software. That's why he can't be there.
Oh yeah. Shunning him (and erroneously so) as another Reiser is gonna make open source look so good, isn't it.
"I disapprove of what you say, but I will defend to the death your right to say it."
- Evelyn Beatrice Hall, writer of Voltaire
People are entitled to any opinion they may have. Just because you disagree with it (and in this case I do too!) does not mean that it can be used to criminalize someone and to ruin their career. That is just wrong.
Comments
• 5
Open source is dead, killed by corporations.
Edit:
I followed two of those articles that made it happened.
https://medium.com/@selamie/...
https://medium.com/@selamie/...
• 7
It's interesting for how little he through FSF away though. Considering it was his life's work, I think something must have diverged from his ideology. It's weird.
Never liked the guy, but I also don't like this sort of crowd behavior ermmm ..it's not butterfly effect, but it's not circlejerking either.. There is a term for this though.. damn. Anyway, I don't like it. I was kinda disappointed in a follow up that went like "now let's get rid off Linus".
• 2
@FrodoSwaggins this is in posts I linked in my comment. Fuck this world.
• 1
@FrodoSwaggins Emmm. Here for instance https://vice.com/en_us/article/...
I was also thinking what you are thinking. Well maybe also check this out https://stallman.org/archives/...
That's archive of his personal webpage, although why would he keep this is a mystery to me..
• 1
@FrodoSwaggins This one (https://vice.com/en_us/article/...) from Vice is where they were ostensibly leaked... But there seem to be no sources to MIT's lists.
The links @vane posted are the Medium posts from what appears to be the person that started all this.
• 3
@Condor sorry what?
• 1
@stop it must be late for me, haha 😅
• 2
Segmentation fault (brain dumped)
• 2
• 3
@FrodoSwaggins Stallman has never been afraid to say what he thinks, so him saying it is less strange than it being a strange thing to say.
• 6
@Pyjong Perhaps the term you're looking for is "lynch mob," where a bunch of people hear something about someone, usually egged on by some troublemakers with an agenda, and decide to do something about it on their own without careful evaluation or due process. (See also, social media culture.)
• 5
Having an opinion is ok.
Shoving that opinion to others' throats is not okay.
Having a matress at your work room in mit to sit naked women [students] on who come in with questions is also not ok.
Sorry @Condor, this won't fly. The guy fucked up massively. The latest thing might not be the real thing, but that was just enough, the last drop in everyone's cup they had for the freak. He got kicked out of mit as a dark, shameful shadow. And he got kicked out of fsf prolly for the same reason.
Only yesterday I read how shameful of a burden he was for the mit.
I liked the guy at first for having a belief. For foss. For gnu. I don't mind him having an opinion. But acting on it for years, knowing how morally wrong it is seen by others - that's just low.
I thank him for gnu. But if it were my will I'd remove him from the society as a cancerous mass.
• 4
i'm not really sure which side to pick.
on one side you have the cancel culture movement, the meme of the moment.
on the other side you have a very questionable character. Sometimes brilliant, sometimes a nutjob. But too many times a nutjob.
@Condor
> Shunning him as another reiser is gonna make open source look good, isn't it?
oh yeah, him getting fired is what will damage open source, not all those dark, ignorant, alienating garbage he's been saying for DECADES.
• 0
• 3
@FrodoSwaggins out of context? what? here's a nice little quote that this fucking PROGRAMMER said on the subject pedophilia (not his field of study ffs).
"I am skeptical of the claim that voluntarily pedophilia harms children. The arguments that it causes harm seem to be based on cases which aren't voluntary, which are then stretched by parents who are horrified by the idea that their little baby is maturing."
and if you spend a couple of minutes you'll find a hot load of these, predating the current controversy by several years.
i have a really hard time thinking this clown was taken out of context in most occasions.
and i have a really hard time taking you seriously, considering you posted a 200 word ramble about the meta of cancel culture and immediately after posting "uh, so what did rms actually say tho?". like, couldn't you look it up before defending anything?
• 4
Stallman would turn over in his grave (if he was dead already), he is NOT the "open source" guy, he is the "free software" guy.
You know, free as in free speech, not as in free beer.
That is what he is fighting for most of his life, but even technical people still don't get the difference.
• 1
@jesustricks ok, fair enough. But why not take that up with him as inappropriate behavior in an educational setting? I don't know how things are done at MIT but I wouldn't treat Stallman as more than an MIT employee (paid or not, couldn't care less. He worked there).
I do want to believe that he was very creepy towards the female students at MIT. But why didn't they tackle that issue from within the University? If that happened (I'd like to see proof of that - edit: to be clear I mean the internal resolution steps) and Stallman didn't change, by all means fire him just like that'd get any teacher fired. But there's way too many unknowns right now.
Not to mention that this witch hunt all started from 2 Medium posts by 1 person... Stallman is a creep and a weirdo, don't get me wrong. And he doesn't deserve special treatment just like you and I don't deserve that either. But this destroyed this man's entire career. One that he's worked for half a century on. What would you do if that happened to you?
• 2
@powerfulparadox Yeah that sounds about right. Lynch sounds a bit harsh, but it is roughly that.
• 1
@FrodoSwaggins I dunno I guess let's hope for the best and this might be just a regular case of someone talking shit. Some attention is in place, this got a bit more since he resigned from an important position. If he didn't maybe we wouldn't even know what he said. Never read his archive before.
• 2
@Pyjong Nowadays we just keep it to opinion and reputation and pretend we've learned from the past because we're just ruining careers and reputations, not killing people, when those things are still necessary for life.
• 0
@netikras Having a mattress to sleep on after work is okay and that's everything he's done with it. Where is that bullshit from?
• 1
I know I am pretty late to the party but let me make some points clear.
Everything that rms said is that sex is okay if everyone involved consents. That's not bad, is it?
What the "journalists" (e.g. vice) on the other hand wrote is that he is a pedophile etc. See the difference?
What is also important to know is that someone published an email of his from a private mailing list without asking the members first and nobody tries to find out how this person is. Sounds shady, right?
Stallman meanwhile gets defended by famous feminists and tons of people who have actually read about what happened. So please guys stop acting as if he wasn't a incredibly admirable and inspiring programmer anymore.
• 0
@lucaIO from the link I have posted.
• 0
@netikras You are using a fucking google link as a source? The top link on google just says that he used to have a mattress in his office, nothing wrong about that. So stop spreading fake news about real people. Things like this can cause suicide so please just shut up if you have no idea if what you are talking about is wrong or right.
Add Comment
|
{
"url": "https://devrant.com/rants/2255217/lets-portray-stallman-as-a-malevolent-criminal-dying-on-the-creepiest-hill-shall",
"source_domain": "devrant.com",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "77680",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WZ2XXKDXMKBXNQWQARJV2C7KSIN56QQR",
"WARC-Concurrent-To": "<urn:uuid:4a7eb024-806c-4b10-869b-470747436c4a>",
"WARC-Date": "2024-07-20T06:59:56Z",
"WARC-IP-Address": "45.55.36.48",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DRTB2TEO5O4A6SJZ5YGBVS64PUWHEUQU",
"WARC-Record-ID": "<urn:uuid:b18b1ca1-64ee-4fd4-bb46-0e6a08d9ba01>",
"WARC-Target-URI": "https://devrant.com/rants/2255217/lets-portray-stallman-as-a-malevolent-criminal-dying-on-the-creepiest-hill-shall",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2602ac4d-a57f-4e6d-bd27-82f1944108ea>"
},
"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-120\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,
3,
10,
13,
14,
217,
218,
310,
487,
488,
565,
676,
677,
762,
805,
806,
1022,
1023,
1032,
1038,
1087,
1088,
1098,
1158,
1159,
1195,
1231,
1237,
1405,
1406,
1703,
1709,
1786,
1792,
1870,
1871,
1983,
1984,
2081,
2087,
2250,
2356,
2362,
2386,
2392,
2433,
2439,
2477,
2483,
2489,
2633,
2639,
2938,
2944,
2973,
2974,
3031,
3032,
3154,
3155,
3457,
3458,
3529,
3530,
3729,
3730,
3831,
3837,
3881,
3882,
3960,
4092,
4093,
4105,
4189,
4190,
4333,
4339,
4345,
4503,
4504,
4768,
4769,
4895,
4896,
4990,
4991,
5249,
5255,
5387,
5388,
5447,
5448,
5560,
5566,
5838,
5839,
6231,
6232,
6593,
6599,
6700,
6706,
7008,
7014,
7237,
7243,
7376,
7382,
7458,
7561,
7675,
7883,
8103,
8109,
8150,
8156,
8499
],
"line_end_idx": [
3,
10,
13,
14,
217,
218,
310,
487,
488,
565,
676,
677,
762,
805,
806,
1022,
1023,
1032,
1038,
1087,
1088,
1098,
1158,
1159,
1195,
1231,
1237,
1405,
1406,
1703,
1709,
1786,
1792,
1870,
1871,
1983,
1984,
2081,
2087,
2250,
2356,
2362,
2386,
2392,
2433,
2439,
2477,
2483,
2489,
2633,
2639,
2938,
2944,
2973,
2974,
3031,
3032,
3154,
3155,
3457,
3458,
3529,
3530,
3729,
3730,
3831,
3837,
3881,
3882,
3960,
4092,
4093,
4105,
4189,
4190,
4333,
4339,
4345,
4503,
4504,
4768,
4769,
4895,
4896,
4990,
4991,
5249,
5255,
5387,
5388,
5447,
5448,
5560,
5566,
5838,
5839,
6231,
6232,
6593,
6599,
6700,
6706,
7008,
7014,
7237,
7243,
7376,
7382,
7458,
7561,
7675,
7883,
8103,
8109,
8150,
8156,
8499,
8510
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8510,
"ccnet_original_nlines": 117,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 8,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.47147470712661743,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019375670701265335,
"rps_doc_frac_lines_end_with_ellipsis": 0.033898308873176575,
"rps_doc_frac_no_alph_words": 0.18729816377162933,
"rps_doc_frac_unique_words": 0.38430583477020264,
"rps_doc_mean_word_length": 4.281019687652588,
"rps_doc_num_sentences": 124,
"rps_doc_symbol_to_word_ratio": 0.0037674899213016033,
"rps_doc_unigram_entropy": 5.698648929595947,
"rps_doc_word_count": 1491,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.030079899355769157,
"rps_doc_frac_chars_dupe_6grams": 0.02506658062338829,
"rps_doc_frac_chars_dupe_7grams": 0.012533290311694145,
"rps_doc_frac_chars_dupe_8grams": 0.012533290311694145,
"rps_doc_frac_chars_dupe_9grams": 0.012533290311694145,
"rps_doc_frac_chars_top_2gram": 0.009399970062077045,
"rps_doc_frac_chars_top_3gram": 0.007049980107694864,
"rps_doc_frac_chars_top_4gram": 0.003759989980608225,
"rps_doc_books_importance": -887.8551025390625,
"rps_doc_books_importance_length_correction": -887.8551025390625,
"rps_doc_openwebtext_importance": -412.9654541015625,
"rps_doc_openwebtext_importance_length_correction": -412.9654541015625,
"rps_doc_wikipedia_importance": -378.21759033203125,
"rps_doc_wikipedia_importance_length_correction": -378.21759033203125
},
"fasttext": {
"dclm": 0.17890411615371704,
"english": 0.9815309643745422,
"fineweb_edu_approx": 1.132308840751648,
"eai_general_math": 0.11592388153076172,
"eai_open_web_math": 0.32101166248321533,
"eai_web_code": 0.025709329172968864
}
}
|
{
"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": "303.483",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social sciences — Dictionaries"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "4",
"label": "Metacognitive"
}
},
"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": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,727,493,094,548,477,000 |
Permalink
Fetching contributors…
Cannot retrieve contributors at this time
170 lines (147 sloc) 4.29 KB
" Vim indent file
" Language: Shell Script
" Maintainer: Peter Aronoff <[email protected]>
" Original Author: Nikolai Weibull <[email protected]>
" Latest Revision: 2013-11-28
if exists("b:did_indent")
finish
endif
let b:did_indent = 1
setlocal indentexpr=GetShIndent()
setlocal indentkeys+=0=then,0=do,0=else,0=elif,0=fi,0=esac,0=done,),0=;;,0=;&
setlocal indentkeys+=0=fin,0=fil,0=fip,0=fir,0=fix
setlocal indentkeys-=:,0#
setlocal nosmartindent
if exists("*GetShIndent")
finish
endif
let s:cpo_save = &cpo
set cpo&vim
function s:buffer_shiftwidth()
return &shiftwidth
endfunction
let s:sh_indent_defaults = {
\ 'default': function('s:buffer_shiftwidth'),
\ 'continuation-line': function('s:buffer_shiftwidth'),
\ 'case-labels': function('s:buffer_shiftwidth'),
\ 'case-statements': function('s:buffer_shiftwidth'),
\ 'case-breaks': 0 }
function! s:indent_value(option)
let Value = exists('b:sh_indent_options')
\ && has_key(b:sh_indent_options, a:option) ?
\ b:sh_indent_options[a:option] :
\ s:sh_indent_defaults[a:option]
if type(Value) == type(function('type'))
return Value()
endif
return Value
endfunction
function! GetShIndent()
let lnum = prevnonblank(v:lnum - 1)
if lnum == 0
return 0
endif
let pnum = prevnonblank(lnum - 1)
let ind = indent(lnum)
let line = getline(lnum)
if line =~ '^\s*\%(if\|then\|do\|else\|elif\|case\|while\|until\|for\|select\)\>'
if line !~ '\<\%(fi\|esac\|done\)\>\s*\%(#.*\)\=$'
let ind += s:indent_value('default')
endif
elseif s:is_case_label(line, pnum)
if !s:is_case_ended(line)
let ind += s:indent_value('case-statements')
endif
elseif line =~ '^\s*\<\k\+\>\s*()\s*{' || line =~ '^\s*{'
if line !~ '}\s*\%(#.*\)\=$'
let ind += s:indent_value('default')
endif
elseif s:is_continuation_line(line)
if pnum == 0 || !s:is_continuation_line(getline(pnum))
let ind += s:indent_value('continuation-line')
endif
elseif pnum != 0 && s:is_continuation_line(getline(pnum))
let ind = indent(s:find_continued_lnum(pnum))
endif
let pine = line
let line = getline(v:lnum)
if line =~ '^\s*\%(then\|do\|else\|elif\|fi\|done\)\>' || line =~ '^\s*}'
let ind -= s:indent_value('default')
elseif line =~ '^\s*esac\>' && s:is_case_empty(getline(v:lnum - 1))
let ind -= s:indent_value('default')
elseif line =~ '^\s*esac\>'
let ind -= (s:is_case_label(pine, lnum) && s:is_case_ended(pine) ?
\ 0 : s:indent_value('case-statements')) +
\ s:indent_value('case-labels')
if s:is_case_break(pine)
let ind += s:indent_value('case-breaks')
endif
elseif s:is_case_label(line, lnum)
if s:is_case(pine)
let ind = indent(lnum) + s:indent_value('case-labels')
else
let ind -= s:indent_value('case-statements') - s:indent_value('case-breaks')
endif
elseif s:is_case_break(line)
let ind -= s:indent_value('case-breaks')
endif
return ind
endfunction
function! s:is_continuation_line(line)
return a:line =~ '\%(\%(^\|[^\\]\)\\\|&&\|||\)$'
endfunction
function! s:find_continued_lnum(lnum)
let i = a:lnum
while i > 1 && s:is_continuation_line(getline(i - 1))
let i -= 1
endwhile
return i
endfunction
function! s:is_case_label(line, pnum)
if a:line !~ '^\s*(\=.*)'
return 0
endif
if a:pnum > 0
let pine = getline(a:pnum)
if !(s:is_case(pine) || s:is_case_ended(pine))
return 0
endif
endif
let suffix = substitute(a:line, '^\s*(\=', "", "")
let nesting = 0
let i = 0
let n = strlen(suffix)
while i < n
let c = suffix[i]
let i += 1
if c == '\\'
let i += 1
elseif c == '('
let nesting += 1
elseif c == ')'
if nesting == 0
return 1
endif
let nesting -= 1
endif
endwhile
return 0
endfunction
function! s:is_case(line)
return a:line =~ '^\s*case\>'
endfunction
function! s:is_case_break(line)
return a:line =~ '^\s*;[;&]'
endfunction
function! s:is_case_ended(line)
return s:is_case_break(a:line) || a:line =~ ';[;&]\s*\%(#.*\)\=$'
endfunction
function! s:is_case_empty(line)
if a:line =~ '^\s*$' || a:line =~ '^\s*#'
return s:is_case_empty(getline(v:lnum - 1))
else
return a:line =~ '^\s*case\>'
endif
endfunction
let &cpo = s:cpo_save
unlet s:cpo_save
|
{
"url": "https://github.com/b4winckler/macvim/blob/master/runtime/indent/sh.vim",
"source_domain": "github.com",
"snapshot_id": "crawl=CC-MAIN-2017-04",
"warc_metadata": {
"Content-Length": "122936",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KD7OB3BUULJNPIHN4DQ5JIQZRXZRKDK3",
"WARC-Concurrent-To": "<urn:uuid:c6497135-19c1-4d2a-aca0-ee91c1e8135e>",
"WARC-Date": "2017-01-21T13:29:17Z",
"WARC-IP-Address": "192.30.253.113",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:WQ7MQCJBHHJHMPQKDJXLKI6VPCG6R6FL",
"WARC-Record-ID": "<urn:uuid:901ee5f2-2922-4625-a00e-36baa961e6bc>",
"WARC-Target-URI": "https://github.com/b4winckler/macvim/blob/master/runtime/indent/sh.vim",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0290f3a7-4e78-48e1-8db6-8879d8396a76>"
},
"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,
10,
33,
75,
104,
122,
147,
200,
250,
280,
306,
313,
319,
340,
374,
452,
503,
529,
552,
578,
585,
591,
613,
625,
656,
675,
687,
716,
762,
818,
868,
922,
943,
976,
1018,
1064,
1098,
1131,
1172,
1187,
1193,
1206,
1218,
1242,
1278,
1291,
1300,
1306,
1340,
1363,
1388,
1470,
1521,
1558,
1564,
1599,
1625,
1670,
1676,
1734,
1763,
1800,
1806,
1842,
1897,
1944,
1950,
2008,
2054,
2060,
2076,
2103,
2177,
2214,
2282,
2319,
2347,
2414,
2457,
2489,
2514,
2555,
2561,
2596,
2615,
2670,
2675,
2752,
2758,
2787,
2828,
2834,
2845,
2857,
2896,
2945,
2957,
2995,
3010,
3064,
3075,
3084,
3093,
3105,
3143,
3169,
3178,
3184,
3198,
3225,
3272,
3281,
3287,
3293,
3344,
3360,
3370,
3393,
3405,
3423,
3434,
3447,
3458,
3474,
3491,
3507,
3523,
3532,
3538,
3555,
3561,
3570,
3579,
3591,
3617,
3647,
3659,
3691,
3720,
3732,
3764,
3830,
3842,
3874,
3916,
3960,
3965,
3995,
4001,
4013,
4035
],
"line_end_idx": [
10,
33,
75,
104,
122,
147,
200,
250,
280,
306,
313,
319,
340,
374,
452,
503,
529,
552,
578,
585,
591,
613,
625,
656,
675,
687,
716,
762,
818,
868,
922,
943,
976,
1018,
1064,
1098,
1131,
1172,
1187,
1193,
1206,
1218,
1242,
1278,
1291,
1300,
1306,
1340,
1363,
1388,
1470,
1521,
1558,
1564,
1599,
1625,
1670,
1676,
1734,
1763,
1800,
1806,
1842,
1897,
1944,
1950,
2008,
2054,
2060,
2076,
2103,
2177,
2214,
2282,
2319,
2347,
2414,
2457,
2489,
2514,
2555,
2561,
2596,
2615,
2670,
2675,
2752,
2758,
2787,
2828,
2834,
2845,
2857,
2896,
2945,
2957,
2995,
3010,
3064,
3075,
3084,
3093,
3105,
3143,
3169,
3178,
3184,
3198,
3225,
3272,
3281,
3287,
3293,
3344,
3360,
3370,
3393,
3405,
3423,
3434,
3447,
3458,
3474,
3491,
3507,
3523,
3532,
3538,
3555,
3561,
3570,
3579,
3591,
3617,
3647,
3659,
3691,
3720,
3732,
3764,
3830,
3842,
3874,
3916,
3960,
3965,
3995,
4001,
4013,
4035,
4051
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4051,
"ccnet_original_nlines": 150,
"rps_doc_curly_bracket": 0.0014811200089752674,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.17782026529312134,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0009560200269334018,
"rps_doc_frac_lines_end_with_ellipsis": 0.006622519809752703,
"rps_doc_frac_no_alph_words": 0.4942638576030731,
"rps_doc_frac_unique_words": 0.3583333194255829,
"rps_doc_mean_word_length": 7.516666889190674,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0.005736140068620443,
"rps_doc_unigram_entropy": 4.181429862976074,
"rps_doc_word_count": 360,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0901699885725975,
"rps_doc_frac_chars_dupe_6grams": 0.02956392988562584,
"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.028824830427765846,
"rps_doc_frac_chars_top_3gram": 0.03695492073893547,
"rps_doc_frac_chars_top_4gram": 0.022172950208187103,
"rps_doc_books_importance": -471.9421081542969,
"rps_doc_books_importance_length_correction": -471.9421081542969,
"rps_doc_openwebtext_importance": -220.18948364257812,
"rps_doc_openwebtext_importance_length_correction": -220.18948364257812,
"rps_doc_wikipedia_importance": -159.1847686767578,
"rps_doc_wikipedia_importance_length_correction": -159.1847686767578
},
"fasttext": {
"dclm": 0.06936001777648926,
"english": 0.12231238186359406,
"fineweb_edu_approx": 2.4246063232421875,
"eai_general_math": 0.8956812024116516,
"eai_open_web_math": 0.7727786302566528,
"eai_web_code": 0.2264757752418518
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.435",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,279,084,753,682,503,000 |
SQL Functions
In this article we will provide you with SQL Functions list and step by step examples and provide blog post with common tasks that use the functions we have on the list. For the purpose of this article we will use SQL Server 2012.
Other Versions of SQL Server:
• SQL Server 2012
• This blog post has been written using SQL Server 2012
• SQL Server 2008 / R2
• Most of the function we use should work in SQL Server 2008 and R2
• SQL Server 2005
• Most common functions should work in SQL Server 2005
Who is it for?
• People who would like to learn basics of using SQL Functions and also find out what functions are available with examples
• Those who are preparing for Microsoft certifications and need to cover this topic.
SQL Function List:
• String Functions
• Aggregate Functions
String Functions
Aggregate Functions
RIGHT Function
Function Name:
RIGHT Function - returns the specified number of characters from a given input value starting from the end (right side).
Syntax
RIGHT(<<Input Value>>, <<Number of Characters>>)
Arguments:
<<Input Value>> - Provide input value (string, field name or expression) that will be used as your input.
<<Number of Characters>> Provide number of characters that you would like to receive from the <<Input Value>> you provided.
Simple Example:
SELECT RIGHT('ABC-123-BCD', 3)
Result = 'BCD'
Full Article:
SQL Right Function - Article that describes the RIGHT function in details and provides examples.
Right Function Microsoft Documentation
LEFT Function
Function Name:
LEFT Function - returns the specified number of characters from a given input value starting from the very beginning (left side)
Syntax
LEFT(<<Input Value>>, <<Number of Characters>>)
Arguments:
<<Input Value>> - Provide input value (string, field name or expression) that will be used as your input.
<<Number of Characters>> Provide number of characters that you would like to receive from the <<Input Value>> you provided.
Simple Example:
SELECT LEFT('ABC-123-BCD', 3)
Result = 'ABC'
Full Article:
SQL LEFT Function - Article that describes the LEFT function in details and provides examples.
LEFT Function Microsoft Documentation
SUBSTRING Function
Function Name:
SUBSTRING Function - returns portion of the specified input value based on starting position and number of characters to be returned.
Syntax
SUBSTRING(<<Input Value>>, <<Starting Position>>, <<Number of Characters>>)
Arguments:
<<Input Value>> - Provide input value (field name or expression) that will be used as your input.
<<Starting Position>> - Provide starting position which indicates where the portion of input value will be extract from.
<<Number of Characters>> - Provide number of characters that should be extracts (from Starting Position).
Simple Example:
SELECT SUBSTRING ('ABC-123-BCD',3,5)
Result = 'C-123'
Full Article:
SQL SUBSTRING Function - Article that describe the SUBSTRING function in details..
SUBSTRING Function Microsoft Documentation
LOWER Function
Function Name:
LOWER Function - returns a value after converting specified input value characters to lower case.
Syntax
LOWER (<<Input Value>>)
Arguments:
<<Input Value>> - Provide input value (string, field name or expression) that will be used as your input.
Simple Example:
SELECT LOWER ('Abcd')
Result = 'abcd'
Full Article:
SQL LOWER Function - Article that describes the LOWER function in details..
LOWER Function Microsoft Documentation
UPPER Function
Function Name:
UPPER Function - returns a value after converting specified input value characters to upper case.
Syntax
UPPER (<<Input Value>>)
Arguments:
<<Input Value>> - Provide input value (field name or expression) that will be used as your input.
Simple Example:
SELECT UPPER ('abcd')
Result = 'ABCD'
Full Article:
SQL UPPER Function - Article that describe the UPPER function in details..
UPPER Function Microsoft Documentation
RTRIM Function
Function Name:
RTRIM Function - returns a value after removing any spaces from the right side of the specified input value.
Syntax
RTRIM (<<Input Value>>)
Arguments:
<<Input Value>> - Provide input value (string, field name or expression) that will be used as your input.
Simple Example:
SELECT RTRIM (' abc ')
Result = ' abc'
Full Article:
SQL RTRIM Function - Article that describe the RTRIM function in details..
RTRIM Function Microsoft Documentation
LTRIM Function
Function Name:
LTRIM Function - returns a value after removed any spaces from the left side of the specified input value.
Syntax
LTRIM (<<Input Value>>)
Arguments:
<<Input Value>> - Provide input value (field name or expression) that will be used as your input.
Simple Example:
SELECT LTRIM (' abc ')
Result = 'abc '
Full Article:
SQL LTRIM Function - Article that describe the LTRIM function in details..
LTRIM Function Microsoft Documentation
LEN Function
Function Name:
LEN Function - returns the number of characters of the specified input value.
Syntax
LEN (<<Input Value>>)
Arguments:
<<Input Value>> - Provide input value (field name or expression) that will be used as your input.
Simple Example:
SELECT LEN ('abc')
Result = 3
Full Article:
SQL LEN Function - Article that describe the LEN function in details..
LEN Function Microsoft Documentation
CHARINDEX Function
Function Name:
CHARINDEX Function - Is used to find position of a character(s) in a string (field).
Syntax
CHARINDEX (<<Value to Find>>, <<Input Value >>)
or
CHARINDEX (<<Value to Find>>, <<Input Value >>,<<Search Starting Position>>)
Arguments:
<<Value to Find>> - Provide value that you want to find in <<Input Value>>.
<<Input Value>> - Provide input value (field name or expression) that will be used as your input.
Optional:
<<Search Starting Position>> - Search of <<value to find>> starts from the beginning of <<input value>> however you can provide third argument that will specify starting position of the search.
Simple Example:
SELECT CHARINDEX ('@', '[email protected]' )
Result = 6
SELECT CHARINDEX ('@', '[email protected]',6 )
Result = 1
Full Article:
SQL CHARINDEX Function - Article that describe the CHARINDEX function in details..
CHARINDEX Function Microsoft Documentation
REVERSE Function
Function Name:
REVERSE Function - Is used to return the reverse order of a string value.
Syntax:
REVERSE (<<Input Value>>)
Arguments:
<<Input Value>> - Provide string value (field name or expression) that will be used as your input.
Simple Example:
SELECT REVERSE ('abc')
Result = 'cba'
Full Article:
SQL REVERSE Function - Article that describe the REVERSE function in details.
REVERSE Function Microsoft Documentation
Replace Function
Function Name:
REPLACE Function - Is used to find value and replace it with specified replacement value.
Syntax
REPLACE ( <<Input Value>> ,<< ValueToFind>>, <<ReplacementValue>> )
Arguments:
<<Input Value>> - Provide string value (field name or expression) that will be used as your input.
<<ValueToFind>> -Provide substring to be found.
<<ReplacementValue>> -Provide string to replace.
Simple Example:
SELECT Replace('Katie & Emil', '&', 'and')
Result = 'Katie And Emil'
Full Article:
SQL Replace Function - Article that describe the REVERSE function in details.
Replace Function Microsoft Documentation
COUNT Function
Function Name:
COUNT Function - Is used to count rows in a table.
Syntax
COUNT ( <<Input Value>> )
Arguments:
<<Input Value>> - Provide input value (field name or expression) that will be used as your input.
Simple Example
SELECT COUNT(*)
FROM [dbo].[DimCustomer]
Result = 18484
Full Article:
SQL COUNT Function - Article that describe the COUNT function in details.
COUNT Function Microsoft Documentation
SUM Function
Function Name:
SUM Function - returns the total sum of a numeric column.
Syntax
SUM ( <<Input Value>> )
Arguments:
<<Input Value>> - Provide expression value, numeric or approximate value that will be used as your input.
Simple Example
SELECT Sum(SalesAmount) As TotalSalesAmount
FROM [dbo].[FactInternetSales]
Result = 29358677.2207
Full Article:
SQL SUM Function - Article that describe the SUM function in details.
SUM Function Microsoft Documentation
AVG Function
Function Name:
AVG Function - returns the average value of a numeric column.
Syntax
AVG ( <<Input Value>> )
Arguments:
<<Input Value>> - Provide expression value, numeric or approximate value that will be used as your input.
Simple Example
SELECT Avg(SalesAmount) As AverageSalesAmount
FROM [dbo].[FactInternetSales]
Full Article:
SQL AVG Function - Article that describe the AVG function in details.
AVG Function Microsoft Documentation
MIN Function
Function Name:
MIN Function - returns the Minimum value of a numeric column.
Syntax
MIN ( <<Input Value>> )
Arguments:
<<Input Value>> - Provide expression value, numeric or approximate value that will be used as your input.
Simple Example
SELECT MIN(SalesAmount) As MinSalesAmount
FROM [dbo].[FactInternetSales]
Result = 2.29
Full Article:
SQL MIN Function - Article that describe the MIN function in details.
MIN Function Microsoft Documentation
MAX Function
Function Name:
MAX Function - returns the Maximum value of a numeric column.
Syntax
MAX ( <<Input Value>> )
Arguments:
<<Input Value>> - Provide expression value, numeric or approximate value that will be used as your input.
Simple Example
SELECT MAX(SalesAmount) As MinSalesAmount
FROM [dbo].[FactInternetSales]
Result = 3578.27
Full Article:
SQL MAX Function - Article that describe the MAX function in details.
MAX Function Microsoft Documentation
Did you find this page useful?
+3 | -0
(3 Votes)
Mini Learning Map
|
{
"url": "https://www.katieandemil.com/sql-functions-list-and-examples-in-sql-server-2012?tab=article",
"source_domain": "www.katieandemil.com",
"snapshot_id": "crawl=CC-MAIN-2015-14",
"warc_metadata": {
"Content-Length": "60000",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ADTFTGUWBQCPZFU2HDQY6U4W3ECWLCOG",
"WARC-Concurrent-To": "<urn:uuid:54e0b541-386d-4963-9145-e1357575eb8e>",
"WARC-Date": "2015-03-30T12:54:30Z",
"WARC-IP-Address": "108.162.204.27",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:C7DRAW7AOPIDWH6BEPMCPVJJGEURUCS2",
"WARC-Record-ID": "<urn:uuid:9902724a-0eeb-4240-b533-a157e3d2e0b8>",
"WARC-Target-URI": "https://www.katieandemil.com/sql-functions-list-and-examples-in-sql-server-2012?tab=article",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f0ca41b6-62b9-48c6-be19-e7e23ad39611>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-168-14-71.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-14\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
14,
15,
246,
247,
277,
278,
298,
358,
383,
455,
475,
534,
535,
550,
551,
677,
764,
765,
767,
768,
787,
788,
809,
833,
834,
836,
837,
854,
855,
875,
876,
878,
879,
881,
882,
897,
898,
913,
914,
1035,
1036,
1043,
1044,
1093,
1094,
1105,
1106,
1212,
1213,
1337,
1338,
1354,
1355,
1386,
1387,
1402,
1403,
1417,
1418,
1515,
1516,
1555,
1556,
1558,
1559,
1573,
1574,
1589,
1590,
1719,
1720,
1727,
1728,
1776,
1777,
1788,
1789,
1895,
1896,
2020,
2021,
2037,
2038,
2068,
2069,
2084,
2085,
2099,
2100,
2195,
2196,
2234,
2235,
2237,
2238,
2257,
2258,
2273,
2274,
2409,
2410,
2417,
2418,
2494,
2495,
2506,
2507,
2605,
2606,
2727,
2728,
2834,
2835,
2851,
2852,
2890,
2892,
2909,
2911,
2925,
2926,
3009,
3010,
3053,
3054,
3056,
3057,
3072,
3073,
3088,
3089,
3188,
3189,
3196,
3197,
3222,
3223,
3234,
3235,
3341,
3342,
3358,
3359,
3381,
3383,
3399,
3401,
3415,
3416,
3492,
3493,
3532,
3533,
3535,
3536,
3551,
3552,
3567,
3568,
3667,
3668,
3675,
3676,
3701,
3702,
3713,
3714,
3812,
3813,
3829,
3830,
3852,
3854,
3870,
3872,
3886,
3887,
3962,
3963,
4002,
4003,
4005,
4006,
4021,
4022,
4024,
4025,
4040,
4041,
4151,
4152,
4159,
4160,
4185,
4186,
4197,
4198,
4304,
4305,
4321,
4332,
4333,
4370,
4371,
4373,
4391,
4393,
4407,
4408,
4483,
4484,
4523,
4524,
4526,
4527,
4542,
4543,
4558,
4559,
4667,
4668,
4675,
4676,
4701,
4702,
4713,
4714,
4812,
4813,
4829,
4830,
4855,
4857,
4875,
4877,
4891,
4892,
4967,
4968,
5007,
5008,
5010,
5011,
5024,
5025,
5040,
5041,
5120,
5121,
5128,
5129,
5152,
5153,
5164,
5165,
5263,
5264,
5280,
5281,
5300,
5302,
5314,
5316,
5330,
5331,
5402,
5403,
5440,
5441,
5443,
5444,
5463,
5464,
5479,
5480,
5566,
5567,
5574,
5575,
5624,
5625,
5628,
5629,
5706,
5707,
5718,
5719,
5796,
5797,
5895,
5896,
5906,
5907,
6101,
6102,
6118,
6119,
6181,
6182,
6204,
6206,
6260,
6261,
6272,
6274,
6276,
6290,
6291,
6374,
6375,
6418,
6419,
6421,
6422,
6439,
6440,
6455,
6456,
6531,
6532,
6540,
6541,
6568,
6569,
6580,
6581,
6680,
6681,
6697,
6698,
6721,
6722,
6737,
6739,
6753,
6754,
6832,
6833,
6874,
6875,
6877,
6878,
6895,
6896,
6898,
6899,
6914,
6915,
7006,
7007,
7014,
7015,
7083,
7084,
7095,
7096,
7195,
7196,
7244,
7245,
7294,
7295,
7311,
7312,
7355,
7356,
7382,
7384,
7398,
7399,
7477,
7478,
7519,
7520,
7522,
7523,
7538,
7539,
7554,
7555,
7607,
7608,
7615,
7616,
7642,
7643,
7645,
7646,
7657,
7658,
7756,
7758,
7759,
7774,
7776,
7777,
7805,
7806,
7843,
7845,
7861,
7863,
7865,
7867,
7881,
7882,
7956,
7957,
7996,
7997,
7999,
8000,
8002,
8003,
8016,
8017,
8032,
8033,
8092,
8093,
8100,
8101,
8125,
8126,
8137,
8138,
8244,
8245,
8260,
8262,
8263,
8318,
8319,
8361,
8363,
8388,
8390,
8392,
8406,
8407,
8477,
8478,
8515,
8516,
8518,
8519,
8532,
8533,
8548,
8549,
8612,
8613,
8620,
8621,
8645,
8646,
8657,
8658,
8764,
8765,
8780,
8781,
8782,
8796,
8855,
8857,
8901,
8902,
8906,
8907,
8921,
8922,
8992,
8993,
9030,
9031,
9033,
9034,
9036,
9037,
9050,
9051,
9066,
9067,
9129,
9130,
9137,
9138,
9162,
9163,
9174,
9175,
9281,
9282,
9297,
9298,
9353,
9367,
9411,
9425,
9453,
9454,
9458,
9459,
9473,
9474,
9544,
9545,
9582,
9583,
9585,
9586,
9588,
9589,
9602,
9603,
9618,
9619,
9681,
9682,
9689,
9690,
9714,
9715,
9726,
9727,
9833,
9834,
9849,
9850,
9905,
9907,
9951,
9965,
9995,
10001,
10002,
10006,
10007,
10021,
10022,
10092,
10093,
10130,
10131,
10133,
10134,
10165,
10175,
10185,
10186
],
"line_end_idx": [
14,
15,
246,
247,
277,
278,
298,
358,
383,
455,
475,
534,
535,
550,
551,
677,
764,
765,
767,
768,
787,
788,
809,
833,
834,
836,
837,
854,
855,
875,
876,
878,
879,
881,
882,
897,
898,
913,
914,
1035,
1036,
1043,
1044,
1093,
1094,
1105,
1106,
1212,
1213,
1337,
1338,
1354,
1355,
1386,
1387,
1402,
1403,
1417,
1418,
1515,
1516,
1555,
1556,
1558,
1559,
1573,
1574,
1589,
1590,
1719,
1720,
1727,
1728,
1776,
1777,
1788,
1789,
1895,
1896,
2020,
2021,
2037,
2038,
2068,
2069,
2084,
2085,
2099,
2100,
2195,
2196,
2234,
2235,
2237,
2238,
2257,
2258,
2273,
2274,
2409,
2410,
2417,
2418,
2494,
2495,
2506,
2507,
2605,
2606,
2727,
2728,
2834,
2835,
2851,
2852,
2890,
2892,
2909,
2911,
2925,
2926,
3009,
3010,
3053,
3054,
3056,
3057,
3072,
3073,
3088,
3089,
3188,
3189,
3196,
3197,
3222,
3223,
3234,
3235,
3341,
3342,
3358,
3359,
3381,
3383,
3399,
3401,
3415,
3416,
3492,
3493,
3532,
3533,
3535,
3536,
3551,
3552,
3567,
3568,
3667,
3668,
3675,
3676,
3701,
3702,
3713,
3714,
3812,
3813,
3829,
3830,
3852,
3854,
3870,
3872,
3886,
3887,
3962,
3963,
4002,
4003,
4005,
4006,
4021,
4022,
4024,
4025,
4040,
4041,
4151,
4152,
4159,
4160,
4185,
4186,
4197,
4198,
4304,
4305,
4321,
4332,
4333,
4370,
4371,
4373,
4391,
4393,
4407,
4408,
4483,
4484,
4523,
4524,
4526,
4527,
4542,
4543,
4558,
4559,
4667,
4668,
4675,
4676,
4701,
4702,
4713,
4714,
4812,
4813,
4829,
4830,
4855,
4857,
4875,
4877,
4891,
4892,
4967,
4968,
5007,
5008,
5010,
5011,
5024,
5025,
5040,
5041,
5120,
5121,
5128,
5129,
5152,
5153,
5164,
5165,
5263,
5264,
5280,
5281,
5300,
5302,
5314,
5316,
5330,
5331,
5402,
5403,
5440,
5441,
5443,
5444,
5463,
5464,
5479,
5480,
5566,
5567,
5574,
5575,
5624,
5625,
5628,
5629,
5706,
5707,
5718,
5719,
5796,
5797,
5895,
5896,
5906,
5907,
6101,
6102,
6118,
6119,
6181,
6182,
6204,
6206,
6260,
6261,
6272,
6274,
6276,
6290,
6291,
6374,
6375,
6418,
6419,
6421,
6422,
6439,
6440,
6455,
6456,
6531,
6532,
6540,
6541,
6568,
6569,
6580,
6581,
6680,
6681,
6697,
6698,
6721,
6722,
6737,
6739,
6753,
6754,
6832,
6833,
6874,
6875,
6877,
6878,
6895,
6896,
6898,
6899,
6914,
6915,
7006,
7007,
7014,
7015,
7083,
7084,
7095,
7096,
7195,
7196,
7244,
7245,
7294,
7295,
7311,
7312,
7355,
7356,
7382,
7384,
7398,
7399,
7477,
7478,
7519,
7520,
7522,
7523,
7538,
7539,
7554,
7555,
7607,
7608,
7615,
7616,
7642,
7643,
7645,
7646,
7657,
7658,
7756,
7758,
7759,
7774,
7776,
7777,
7805,
7806,
7843,
7845,
7861,
7863,
7865,
7867,
7881,
7882,
7956,
7957,
7996,
7997,
7999,
8000,
8002,
8003,
8016,
8017,
8032,
8033,
8092,
8093,
8100,
8101,
8125,
8126,
8137,
8138,
8244,
8245,
8260,
8262,
8263,
8318,
8319,
8361,
8363,
8388,
8390,
8392,
8406,
8407,
8477,
8478,
8515,
8516,
8518,
8519,
8532,
8533,
8548,
8549,
8612,
8613,
8620,
8621,
8645,
8646,
8657,
8658,
8764,
8765,
8780,
8781,
8782,
8796,
8855,
8857,
8901,
8902,
8906,
8907,
8921,
8922,
8992,
8993,
9030,
9031,
9033,
9034,
9036,
9037,
9050,
9051,
9066,
9067,
9129,
9130,
9137,
9138,
9162,
9163,
9174,
9175,
9281,
9282,
9297,
9298,
9353,
9367,
9411,
9425,
9453,
9454,
9458,
9459,
9473,
9474,
9544,
9545,
9582,
9583,
9585,
9586,
9588,
9589,
9602,
9603,
9618,
9619,
9681,
9682,
9689,
9690,
9714,
9715,
9726,
9727,
9833,
9834,
9849,
9850,
9905,
9907,
9951,
9965,
9995,
10001,
10002,
10006,
10007,
10021,
10022,
10092,
10093,
10130,
10131,
10133,
10134,
10165,
10175,
10185,
10186,
10203
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10203,
"ccnet_original_nlines": 551,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23667028546333313,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.09140370041131973,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.26713818311691284,
"rps_doc_frac_unique_words": 0.14655810594558716,
"rps_doc_mean_word_length": 5.495928764343262,
"rps_doc_num_sentences": 73,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.459346294403076,
"rps_doc_word_count": 1351,
"rps_doc_frac_chars_dupe_10grams": 0.30222222208976746,
"rps_doc_frac_chars_dupe_5grams": 0.47999998927116394,
"rps_doc_frac_chars_dupe_6grams": 0.38329964876174927,
"rps_doc_frac_chars_dupe_7grams": 0.33468014001846313,
"rps_doc_frac_chars_dupe_8grams": 0.32552188634872437,
"rps_doc_frac_chars_dupe_9grams": 0.31919193267822266,
"rps_doc_frac_chars_top_2gram": 0.07138047367334366,
"rps_doc_frac_chars_top_3gram": 0.043097641319036484,
"rps_doc_frac_chars_top_4gram": 0.030168350785970688,
"rps_doc_books_importance": -760.2265625,
"rps_doc_books_importance_length_correction": -760.2265625,
"rps_doc_openwebtext_importance": -431.2195739746094,
"rps_doc_openwebtext_importance_length_correction": -431.2195739746094,
"rps_doc_wikipedia_importance": -391.4578857421875,
"rps_doc_wikipedia_importance_length_correction": -391.4578857421875
},
"fasttext": {
"dclm": 0.10693181306123734,
"english": 0.4295552372932434,
"fineweb_edu_approx": 2.830373525619507,
"eai_general_math": 0.0005210000090301037,
"eai_open_web_math": 0.2685341238975525,
"eai_web_code": 0.979881227016449
}
}
|
{
"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": "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": "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
|
2,867,576,525,255,220,700 |
Is collegedata.com a fake site ? Is collegedata.com legit and trustworthy ?
High Trust Rating. This Site Looks Safe To use.
Site is United States based
Popularity
collegedata.com site image
Last refreshed : Thu, 01 Jan 12:00 am
Number times viewed :0
Est Website Value :12,111.74
High Risk
Safe
(100%)
How did collegedata.com get a Trust Score of 100% ?
When checking collegedata.com we looked at many factors, such as the ownership details, location, popularity and other sites relating to reviews, threats, phishing etc. Although a site like may have a high trust rating, it's worth just checking the countries involved as these could indicate that goods would be shipped from abroad rather than your home country.
The internet is populated with many fake and scam sites - with many being created daily purely to look genuine. Even many review sites are tainted with fake reviews making it almost impossible for somedbody to detect a safe site from a scam. We attempt to analyse the website information and provide a trust guide that will help you determine the risk rating of collegedata.
[ Click to see the free detailed trust review for collegedata.com ]
|
{
"url": "http://www.scamadviser.com/is-collegedata.com-safe.html",
"source_domain": "www.scamadviser.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "21073",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CFRMDFDY3P7BDPINGO32HE5UTQK6K65C",
"WARC-Concurrent-To": "<urn:uuid:4c759b9f-bca9-4689-a4a4-aa52fefe0bb6>",
"WARC-Date": "2013-12-10T09:44:42Z",
"WARC-IP-Address": "74.50.56.73",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:OS2WPKPBMU5IPQ7HIK5FRTLJVKGTMXDM",
"WARC-Record-ID": "<urn:uuid:82b66230-bf3a-4365-a6f9-f808fcb052cd>",
"WARC-Target-URI": "http://www.scamadviser.com/is-collegedata.com-safe.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4d454e86-e397-4393-8582-db175dc36b8e>"
},
"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,
1,
77,
78,
79,
128,
156,
157,
168,
195,
233,
256,
285,
286,
296,
301,
308,
309,
310,
311,
363,
364,
727,
728,
1103
],
"line_end_idx": [
1,
77,
78,
79,
128,
156,
157,
168,
195,
233,
256,
285,
286,
296,
301,
308,
309,
310,
311,
363,
364,
727,
728,
1103,
1170
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1170,
"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.33476394414901733,
"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.19313305616378784,
"rps_doc_frac_unique_words": 0.6524063944816589,
"rps_doc_mean_word_length": 4.967914581298828,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.586780071258545,
"rps_doc_word_count": 187,
"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.034445639699697495,
"rps_doc_frac_chars_top_3gram": 0.032292790710926056,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -78.06417846679688,
"rps_doc_books_importance_length_correction": -78.06417846679688,
"rps_doc_openwebtext_importance": -47.86072540283203,
"rps_doc_openwebtext_importance_length_correction": -47.300540924072266,
"rps_doc_wikipedia_importance": -25.81136131286621,
"rps_doc_wikipedia_importance_length_correction": -25.81136131286621
},
"fasttext": {
"dclm": 0.06212151050567627,
"english": 0.9473279714584351,
"fineweb_edu_approx": 1.0557212829589844,
"eai_general_math": 0.005030990112572908,
"eai_open_web_math": 0.12622570991516113,
"eai_web_code": 0.00016946000687312335
}
}
|
{
"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.25",
"labels": {
"level_1": "Social sciences",
"level_2": "Social service and Societies",
"level_3": "Political activists"
}
}
},
"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": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "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": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-323,811,181,243,071,100 |
In defence of technology jargon
If you asked a handful of strangers what’s meant by the word “computing,” they would probably refer to using a combination of hardware and software to manage information. I doubt many of them would talk about math, but that’s the original connotations. This is part of the complicated journey of human thought through language.
Most people in the IT industry hate jargon, even those who use it all the time. It’s become pretty accepted that we should not be creating more three-letter abbreviations and should figure out a way to get rid of the ones in our collective vocabulary. But there’s another side to this story, one that suggests we might do well to not only preserve jargon, but encourage an ever-expanding glossary of technology-related terms.
In a recent article on Miller-McCune called “Rescuing Endangered Languages Means Saving Ideas,” Emily Badger writes about a joint program by the U.S. National Science Foundation and National Endowment for the Humanities where researchers are trying to preserve dialects that are dying out in regions all over the world. They believe that as half of the world’s 7,000 languages are projected to disappear by the end of the century, what we are losing are not just ways to say things but things to say.
“As the famous example says, Eskimo have numerous words to describe what Americans would just call ‘snow’ and ‘ice,’” Badger writes. “This suggests language systems don’t merely translate universal ideas into different spellings; they encode different concepts. And when we lose a language, we risk losing those concepts.”
Of course, technology jargon is far from representing an entire language, but it does tend to focus on ways of encapsulating concepts, notions, representations of ideal states of information management. As major trends in the industry take shape experts often note that they lack common definition. This was true of business intelligence, service-oriented architecture, electronic health records, customer relationship management, cloud computing and many others.
Over time, through countless articles, panel discussions, online forums and via social media, we tend to work towards some kind of consensus on these terms. But the results can be limiting. I’ve been hearing more and more people, for example, reducing cloud computing to “the use of the Internet to perform tasks you have historically done on site,” or something to that effect. This leaves out a lot about private versus public clouds, software as a service vs. hosted infrastructure and so on.
Jargon doesn’t tend to get codified with the same rigour as, say, Italian or Farsi, but it is probably more “living” than many of the languages currently on the verge of extinction. If IT managers were able to take more time to pay attention to the various usages from different sources, they would come as close as possible to getting at that “tribal knowledge” that also seems to be constantly in danger of being lost. Just because so much of what’s said about technology remains open to interpretation doesn’t mean we have to be in such a hurry to settle on an interpretation.
|
{
"url": "http://www.itworldcanada.com/blog/in-defence-of-technology-jargon/59377",
"source_domain": "www.itworldcanada.com",
"snapshot_id": "crawl=CC-MAIN-2015-22",
"warc_metadata": {
"Content-Length": "46487",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:C2QAHERRQBDVUN4NLUCJKUHO4E7FBZOE",
"WARC-Concurrent-To": "<urn:uuid:8f2e2f8b-edd4-4206-84d5-e39ffbce59b7>",
"WARC-Date": "2015-05-26T01:30:13Z",
"WARC-IP-Address": "64.140.125.207",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:IRLQI24PI4GXCWQA5U3OZJMYYR7X6XJA",
"WARC-Record-ID": "<urn:uuid:3cd64e71-cb9a-4c30-8e1c-907e2a98cd65>",
"WARC-Target-URI": "http://www.itworldcanada.com/blog/in-defence-of-technology-jargon/59377",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:efcd6731-fad2-4777-ba92-ac063f566d33>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-206-219.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-22\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for May 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,
32,
33,
361,
362,
788,
789,
1290,
1291,
1614,
1615,
2079,
2080,
2576,
2577
],
"line_end_idx": [
32,
33,
361,
362,
788,
789,
1290,
1291,
1614,
1615,
2079,
2080,
2576,
2577,
3157
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3157,
"ccnet_original_nlines": 14,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4560260474681854,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009771989658474922,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1384364813566208,
"rps_doc_frac_unique_words": 0.5817120671272278,
"rps_doc_mean_word_length": 5.009727478027344,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.289003372192383,
"rps_doc_word_count": 514,
"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.011650489643216133,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -259.0024108886719,
"rps_doc_books_importance_length_correction": -259.0024108886719,
"rps_doc_openwebtext_importance": -146.0041046142578,
"rps_doc_openwebtext_importance_length_correction": -146.0041046142578,
"rps_doc_wikipedia_importance": -107.08085632324219,
"rps_doc_wikipedia_importance_length_correction": -107.08085632324219
},
"fasttext": {
"dclm": 0.10007333755493164,
"english": 0.9625900387763977,
"fineweb_edu_approx": 2.662668228149414,
"eai_general_math": 0.5820432901382446,
"eai_open_web_math": 0.34341222047805786,
"eai_web_code": 0.18977421522140503
}
}
|
{
"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": "401",
"labels": {
"level_1": "Philology; or, Language and languages",
"level_2": "",
"level_3": "Language and languages — Philosophy and Language and languages — Origin"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "4",
"label": "Metacognitive"
}
},
"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
|
108,844,964,815,379,630 |
Logo SEO Tools for Writers for Webmaster
ROBOT.TXT GENERATOR
Generate robots.txt file easily
(leave blank if you don’t have)
In this latest version, we develop the Robot TXT Generator tool with export features and useragent features. The export feature will make it easier for you to check the code on Google Rich Result. Meanwhile, the useragent feature will allow you to add more commands to the Robot TXT Generator. This makes it easier for the txt Robot to specifically sort out which content you want to cover and which ones are displayed.
Updated 15 Mar, 2021
In this latest version, we develop the Robot TXT Generator tool with export features and useragent features. The export feature will make it easier for you to check the code on Google Rich Result. Meanwhile, the useragent feature will allow you to add more commands to the Robot TXT Generator. This makes it easier for the txt Robot to specifically sort out which content you want to cover and which ones are displayed.
Updated 15 Mar, 2021
What's New
Last update Oct 13, 2023
30 Tools for Countless Solutions! cmlabs has reached a remarkable milestone with the release of 30 cutting-edge tools designed to empower businesses and individuals in the digital realm. All 30 tools, from Test & Checker, Sitemap.XML, and Robots.TXT to various JSON-LD Schema Generator, have been launched to address specific needs and challenges across diverse industries. Together with cmlabs tools, you can stand at the forefront of technological advancements. Try our tools based on your needs now!
Notification center
SEO Services
Get a personalized SEO service and give your business a treat.
Explore now
Digital Media Buying
Get a personalized SEO service and give your business a treat.
Explore now
SEO Content Writing
Get a personalized SEO service and give your business a treat.
Explore now
SEO Political Campaign
Get a personalized SEO service and give your business a treat.
Explore now
Backlink Services
Get a personalized SEO service and give your business a treat.
Explore now
Other SEO Tools
Robots.txt Generator
Writen by cmlabs
|
Published at Oct 13, 2023
What is Robots.txt Generator?
Robots.txt generator is a tool that is able to make it easier for you to make configurations in the robots.txt file. The robots.txt generator from cmlabs contains all the commands you can use to create a robots.txt file, from specifying a user-agent, entering a sitemap path, specifying access permissions (allow or disallow), to setting crawl-delay.
Why Do You Need a Robots.txt Generator?
By using the robots.txt generator, you do not need to manually write the robots.txt file. Just enter the command you want to give the web crawler, then set which pages are allowed or not allowed to be crawled. How to use the robots.txt generator is quite easy, with just a few clicks.
Robots.txt Functions For Your Website
Robots.txt is a file containing certain commands that decide whether the user-agent (web crawler of each search engine) is allowed or not to crawl website elements. The functions of robots.txt for your website are as follows:
• Tells crawlers which page URLs they can or can't access
• Helping websites avoid the burden of too many crawl requests
• Help manage crawler traffic to your website
Robots.txt File Location In Website
Generally, the location of the robots.txt file is in the main directory of the website (e.g domain root or homepage). Before you add it, the robots.txt file is already in the root folder on the file storage server (public_html).
However, you will not find the file when you open public_html. This is because this file is virtual and cannot be modified or accessed from other directories. To change commands in robots.txt, you need to add a new robots.txt file and save it in the public_html folder. In this way, the configuration in the new file will replace the previous file.
Syntax on Robots.txt
The robots.txt syntax can be interpreted as the command you use to notify web crawlers. The robots.txt generator from cmlabs also provides a syntax that the web crawler recognizes. The five terms commonly found in a robots.txt file are as follows:
User-Agent
What is meant by a user-agent in robots.txt is the specific type of web crawler that you give the command to crawl. This web crawler usually varies depending on the search engine used.
Some examples of user agents that are often used are Googlebot, Googlebot-Mobile, Googlebot-Image, Bingbot, Baiduspider, Gigabot, Yandex, and so on.
Disallow
The command used to tell the user-agent not to crawl the specified URL path. Make sure you have entered the correct path because this command is case-sensitive (eg “/File” and “/file” are considered different paths). You can only use one “Disallow” command for each URL.
Allow
This command is used to tell web crawlers that they are allowed to access the path of a page or subfolder even if the parent page of that page or subfolder is disallowed.In practice, the allow and disallow commands are always followed by the “directive: [path]” command to specify the path that may or may not be crawled. Careful attention must be paid to writing the path because this command distinguishes between upper/lower case letters (eg “/File” and “/file” are considered as different paths).
Crawl-Delay
The function of this command in robots.txt is to tell web crawlers that they should wait a while before loading and crawling the page content. This command does not apply to Googlebot, but you can adjust the crawl speed via Google Search Console.
Sitemap
This command is used to call the XML sitemap location associated with a URL. It is also important to pay attention to the writing of the sitemap command because this command distinguishes upper / lower case letters (eg "/Sitemap.xml" and "/sitemap.xml" are considered different paths).
Example Robots.txt
After understanding the commands you can give the web crawler, we will next show an example of the www.example.com website's robots.txt, which is stored in the following www.example.com/robots.txt directory:
User-agent: *
Allow: /
Sitemap: https://example.com/sitemap.xml
User-agent: Googlebot
Disallow: /nogooglebot
The first and second lines are commands that tell the default web crawler that they are allowed to crawl URLs. Meanwhile, the third line is used to call the sitemap location associated with that URL.
The fourth and fifth lines are the commands given to Google's web crawler. This command does not allow Googlebot to crawl your website directory (forbids Google from crawling the “/nogooglebot” file path).
The Limitation of Robots.txt
Before creating a robots.txt, you need to know the limitations that the following robots.txt file has:s
May not be supported on certain search engines
While Google and other major search engines have complied with the commands in the robots.txt file, some crawlers belonging to other search engines may not comply.
Different crawlers interpret the syntax in different ways
Each search engine has a different web crawler, each crawler may interpret commands in different ways. Although a number of well-known crawlers have followed the syntax written in the robots.txt file, some crawlers may not understand certain commands.
Pages that are not allowed on robots.txt can still be indexed if they are linked to other pages
While Google doesn't crawl or index content that robots.txt doesn't allow, Google can still find and index those URLs if they're linked from other websites. Thus, URL addresses and publicly available information can appear in Google search results.
Thus the discussion about the robots.txt generator from cmlabs. Using this tool, you can simplify the workflow of creating robots.txt files. With just a few clicks, you can add configurations to the new robots.txt file.
How to Use Robots.txt Generator
To create a robots.txt file using this tool, follow these steps:
Go to Robots.txt Generator Page
One way to create a robots.txt file is to visit the robots.txt generator page. On that page, you can set the commands you will give the web crawler.
HowTo-robot-1
Figure 1: The robot.txt generator page view from cmlabs
Select Access Permission For Default Robot
Specify access permissions for the default web crawlers, whether they are allowed to crawl URLs or not. There are two options that you can choose, namely, allow and disallow.
HowTo-robot-2
Figure 2: Dropdown view of the permission options granted to the default robot
Set Crawl Delay
You can set how long the crawl delay will be for the web crawler. If you set crawl-delay then the web crawler will wait for some time before crawling your URL. Robots.txt generator allows you to choose without crawl delay or delay for 5 to 120 seconds.
HowTo-robot-3
Figure 3: A dropdown view of the crawl delay options provided to the default robot
Enter Sitemap (If Any)
A sitemap is a file that lists the URLs of your website, with this file, web crawlers will find it easier to crawl and index your site. You can enter the sitemap path into the field provided.
Make sure you have entered the correct sitemap path because this command is case sensitive (eg “/Sitemap.xml” and “/sitemap.xml” are considered different paths).
HowTo-robot-4
Figure 4: The display field for entering the sitemap path associated with your URL
Add Directive In Robots.txt
You can add directives to the robots.txt file by pressing the "Add Directive" button. Directives are commands given to web crawlers to tell you whether you allow or deny them to crawl certain URLs.
HowTo-robot-5
Figure 5: Button for adding commands to be executed by the web crawler
In the robots.txt generator, there are three rules that you need to adjust in the directive section, namely:
Set Access Permission
You can set the access permissions granted to web crawlers, whether you allow or disallow them from crawling your web pages. The options that can be used allow and disallow.
HowTo-robot-6
Figure 6: Choice of access permissions to be granted to web crawlers
Select User-Agent
A user-agent is the type of web crawler that you will instruct to crawl. The choice of this web crawler depends on the search engine used, such as Baiduspider, Bingbot, Googlebot, and others. The web crawler option can be selected via the available user-agent dropdown.
HowTo-robot-7
Figure 7: User-agent options available in cmlabs robots.txt generator
Enter Directory / File Path
A directory or file path is a specific location of a page that web crawlers may or may not crawl. You must pay close attention to writing the path because this command distinguishes between upper and lower case letters (eg "/File" and "/file" are considered different paths).
HowTo-robot-8
Figure 8: Field to add the path to be crawled by the crawler
Copy Robot.txt
After entering the command for the web crawler in the field provided, you will see a preview of the robots.txt file in the right section. You can copy the generated syntax and paste it into the robots.txt file that you have created.
HowTo-robot-9
Figure 9: Syntax copy options in the robots.txt generator.
Export Syntax Robots.txt
If you don't know how to create your own robots.txt file, you can export the file that cmlabs has generated. Downloading the robots file is quite easy. You can select the "Export" option contained in the robots.text generator tools. Next, the tool will start the download and you will receive a robots.txt file.
HowTo-robot-10
Figure 10: Data export options in the robots.txt generator.
Remove Unnecessary Directives
If you want to delete unneeded directives, then you can click the cross icon to the right of the field to enter the directive. Please note that deleted fields cannot be recovered.
HowTo-robot-11
Figure 11: The delete data directive option in the robots.txt generator
Reset Robots.txt Generator
This tool has options that make it easier for you to find out how to create another robots.txt file. Click the "Reset" option to delete all the commands you set in robots.txt earlier. Next, you can create a new robots.txt configuration file.
HowTo-robot-12
Figure 12: Data reset options in the robots.txt generator.
Read More
Edited at Oct 13, 2023
cmlabs Aliance
These strategic alliances allow us to offer our clients a wider range of SEO innovative solutions and exceptional service around the world. If you've ever planned of conquering the more market, you've come to the right place! Let's turn those plan into reality, shall we?
Writing Starter Guide
The Search Engine Optimization (SEO) Starter Guide provides best practices to make it easier for search engines to crawl, index, and understand your content.
Explore Today!
Sequence business partner card
StoryLabs
Gain more traffic for your business
There is currently no notification...
|
{
"url": "https://tools.cmlabs.co/en/robotstxt-generator",
"source_domain": "tools.cmlabs.co",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "165771",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GTWDRUO7JIGQDZYJNAXDC5XP5FNPDJGJ",
"WARC-Concurrent-To": "<urn:uuid:550b3db1-ab31-4904-bc2d-cd354b3ba849>",
"WARC-Date": "2023-12-02T08:20:01Z",
"WARC-IP-Address": "52.76.108.1",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:66ZR2LZ4UDFWFOMTMDHEOIEAWMEQN4EN",
"WARC-Record-ID": "<urn:uuid:17e4e6a5-fd8f-4620-8ed3-7eae96a7f3b8>",
"WARC-Target-URI": "https://tools.cmlabs.co/en/robotstxt-generator",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:87a0a03f-3dc6-49ab-8470-0971eec15a5f>"
},
"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-66\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,
43,
44,
64,
65,
97,
129,
130,
550,
551,
572,
573,
993,
994,
1015,
1016,
1027,
1028,
1053,
1054,
1557,
1558,
1578,
1579,
1592,
1593,
1656,
1657,
1669,
1670,
1691,
1692,
1755,
1756,
1768,
1769,
1789,
1790,
1853,
1854,
1866,
1867,
1890,
1891,
1954,
1955,
1967,
1968,
1986,
1987,
2050,
2051,
2063,
2064,
2080,
2081,
2102,
2103,
2120,
2121,
2123,
2124,
2150,
2151,
2181,
2182,
2533,
2534,
2574,
2575,
2860,
2861,
2899,
2900,
3126,
3127,
3187,
3252,
3300,
3301,
3337,
3338,
3567,
3568,
3917,
3918,
3939,
3940,
4188,
4189,
4200,
4201,
4386,
4387,
4536,
4537,
4546,
4547,
4818,
4819,
4825,
4826,
5327,
5328,
5340,
5341,
5588,
5589,
5597,
5598,
5884,
5885,
5904,
5905,
6113,
6114,
6139,
6177,
6211,
6212,
6278,
6279,
6326,
6374,
6375,
6400,
6423,
6424,
6624,
6625,
6831,
6832,
6861,
6862,
6966,
6967,
7014,
7015,
7179,
7180,
7238,
7239,
7491,
7492,
7588,
7589,
7838,
7839,
8059,
8060,
8092,
8093,
8158,
8159,
8191,
8192,
8341,
8342,
8356,
8357,
8413,
8414,
8457,
8458,
8633,
8634,
8648,
8649,
8728,
8729,
8745,
8746,
8999,
9000,
9014,
9015,
9098,
9099,
9122,
9123,
9315,
9316,
9478,
9479,
9493,
9494,
9577,
9578,
9606,
9607,
9805,
9806,
9820,
9821,
9892,
9893,
10002,
10003,
10025,
10026,
10200,
10201,
10215,
10216,
10285,
10286,
10304,
10305,
10575,
10576,
10590,
10591,
10661,
10662,
10690,
10691,
10967,
10968,
10982,
10983,
11044,
11045,
11060,
11061,
11294,
11295,
11309,
11310,
11369,
11370,
11395,
11396,
11708,
11709,
11724,
11725,
11785,
11786,
11816,
11817,
11997,
11998,
12013,
12014,
12086,
12087,
12114,
12115,
12357,
12358,
12373,
12374,
12433,
12434,
12444,
12445,
12468,
12469,
12484,
12756,
12778,
12779,
12937,
12938,
12953,
12984,
12994,
13030,
13031
],
"line_end_idx": [
43,
44,
64,
65,
97,
129,
130,
550,
551,
572,
573,
993,
994,
1015,
1016,
1027,
1028,
1053,
1054,
1557,
1558,
1578,
1579,
1592,
1593,
1656,
1657,
1669,
1670,
1691,
1692,
1755,
1756,
1768,
1769,
1789,
1790,
1853,
1854,
1866,
1867,
1890,
1891,
1954,
1955,
1967,
1968,
1986,
1987,
2050,
2051,
2063,
2064,
2080,
2081,
2102,
2103,
2120,
2121,
2123,
2124,
2150,
2151,
2181,
2182,
2533,
2534,
2574,
2575,
2860,
2861,
2899,
2900,
3126,
3127,
3187,
3252,
3300,
3301,
3337,
3338,
3567,
3568,
3917,
3918,
3939,
3940,
4188,
4189,
4200,
4201,
4386,
4387,
4536,
4537,
4546,
4547,
4818,
4819,
4825,
4826,
5327,
5328,
5340,
5341,
5588,
5589,
5597,
5598,
5884,
5885,
5904,
5905,
6113,
6114,
6139,
6177,
6211,
6212,
6278,
6279,
6326,
6374,
6375,
6400,
6423,
6424,
6624,
6625,
6831,
6832,
6861,
6862,
6966,
6967,
7014,
7015,
7179,
7180,
7238,
7239,
7491,
7492,
7588,
7589,
7838,
7839,
8059,
8060,
8092,
8093,
8158,
8159,
8191,
8192,
8341,
8342,
8356,
8357,
8413,
8414,
8457,
8458,
8633,
8634,
8648,
8649,
8728,
8729,
8745,
8746,
8999,
9000,
9014,
9015,
9098,
9099,
9122,
9123,
9315,
9316,
9478,
9479,
9493,
9494,
9577,
9578,
9606,
9607,
9805,
9806,
9820,
9821,
9892,
9893,
10002,
10003,
10025,
10026,
10200,
10201,
10215,
10216,
10285,
10286,
10304,
10305,
10575,
10576,
10590,
10591,
10661,
10662,
10690,
10691,
10967,
10968,
10982,
10983,
11044,
11045,
11060,
11061,
11294,
11295,
11309,
11310,
11369,
11370,
11395,
11396,
11708,
11709,
11724,
11725,
11785,
11786,
11816,
11817,
11997,
11998,
12013,
12014,
12086,
12087,
12114,
12115,
12357,
12358,
12373,
12374,
12433,
12434,
12444,
12445,
12468,
12469,
12484,
12756,
12778,
12779,
12937,
12938,
12953,
12984,
12994,
13030,
13031,
13068
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 13068,
"ccnet_original_nlines": 268,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3572254180908203,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013487479649484158,
"rps_doc_frac_lines_end_with_ellipsis": 0.003717469982802868,
"rps_doc_frac_no_alph_words": 0.16493256390094757,
"rps_doc_frac_unique_words": 0.2561624050140381,
"rps_doc_mean_word_length": 4.961817264556885,
"rps_doc_num_sentences": 176,
"rps_doc_symbol_to_word_ratio": 0.00038536000647582114,
"rps_doc_unigram_entropy": 5.350257873535156,
"rps_doc_word_count": 2069,
"rps_doc_frac_chars_dupe_10grams": 0.10140269249677658,
"rps_doc_frac_chars_dupe_5grams": 0.19705824553966522,
"rps_doc_frac_chars_dupe_6grams": 0.14796414971351624,
"rps_doc_frac_chars_dupe_7grams": 0.11815702170133591,
"rps_doc_frac_chars_dupe_8grams": 0.11192285269498825,
"rps_doc_frac_chars_dupe_9grams": 0.11192285269498825,
"rps_doc_frac_chars_top_2gram": 0.026592640206217766,
"rps_doc_frac_chars_top_3gram": 0.02250145934522152,
"rps_doc_frac_chars_top_4gram": 0.007305670063942671,
"rps_doc_books_importance": -1228.897705078125,
"rps_doc_books_importance_length_correction": -1228.897705078125,
"rps_doc_openwebtext_importance": -648.4479370117188,
"rps_doc_openwebtext_importance_length_correction": -648.4479370117188,
"rps_doc_wikipedia_importance": -585.0491943359375,
"rps_doc_wikipedia_importance_length_correction": -585.0491943359375
},
"fasttext": {
"dclm": 0.036137938499450684,
"english": 0.882481575012207,
"fineweb_edu_approx": 2.22548770904541,
"eai_general_math": 0.41407251358032227,
"eai_open_web_math": 0.26025938987731934,
"eai_web_code": 0.2970607280731201
}
}
|
{
"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.8",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "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": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,121,359,549,106,733,800 |
Pen Settings
HTML
CSS
CSS Base
Vendor Prefixing
Add External Stylesheets/Pens
Any URLs added here will be added as <link>s in order, and before the CSS in the editor. You can use the CSS from another Pen by using its URL and the proper URL extension.
+ add another resource
JavaScript
Babel includes JSX processing.
Add External Scripts/Pens
Any URL's added here will be added as <script>s in order, and run before the JavaScript in the editor. You can use the URL of any other Pen and it will include the JavaScript from that Pen.
+ add another resource
Packages
Add Packages
Search for and use JavaScript packages from npm here. By selecting a package, an import statement will be added to the top of the JavaScript editor for this package.
Behavior
Auto Save
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.
Format on Save
If enabled, your code will be formatted when you actively save your Pen. Note: your code becomes un-folded during formatting.
Editor Settings
Code Indentation
Want to change your Syntax Highlighting theme, Fonts and more?
Visit your global Editor Settings.
HTML
<div class="scroller" data-scroller>
<header data-header>
<nav class="header__nav">
<div class="header__left-content">
<a class="header__home-link" href="#home"><svg width="118" height="202" xmlns="http://www.w3.org/2000/svg" viewBox="0 0 118.7 202.6"><path d="M117.7 58c-1.3-5.7-3.5-11-5.8-16.2-5.5-12.1-13-22.7-23.6-30.9-5.2-4-10.8-7.4-17.1-9.6C67.8.1 64.4-.2 60.8.3c-1.8.2-3.4.9-4.2 3.2.4.2.8.4 1.2.7.5.4.9.8 2.1 1.9-11.2-2.9-20.3-.1-28.9 5-9.7 5.8-17.2 13.7-22.6 23.6-3.7 6.8-5.9 14.1-7.3 21.7C-1.6 71.6.8 86 8 99.6c2.9 5.6 7 10.3 11.7 14.9-1.7 3.8-1.7 3.8-.8 7.2.6 2.2 1.1 4.3 1.8 6.5 6.9 23 15.8 45.3 25.2 67.3.3.7.7 1.5 1.1 2.2 3.3 5.8 9.3 6.6 13.9 1.6 1.5-1.6 2.8-3.5 4-5.4 2.8-4.4 5.6-8.9 8.3-13.5 7-11.7 13.2-23.8 17.6-36.7 3.1-8.8 5-17.9 4.1-27.3 0-.5 0-1 .1-2.3.4-.3 1.4-.9 2.2-1.6 8.2-7.4 14.3-16.4 18.1-26.8 3.2-8.9 4.5-18.1 2.4-27.7zm-14.6 13.5C99 87.7 90 100.1 74.4 107.1c-7.9 3.6-16.4 4.5-24.9 3.1-12.9-2.1-22.2-9.3-28.3-20.7-5.1-9.5-6.4-19.7-5.1-30.3 1.7-13.9 7.7-25.6 18.5-34.7 7.6-6.4 16.2-10.1 26.2-10.7.5 0 1-.1 1.4-.1 2.3 0 4.1-.8 5.1-3.1 22.9 14.7 30.6 27.6 35.9 49.9.8 3.6.8 7.4-.1 11z"/><path d="M55.9 99c-9.3-.9-17.9-5.7-23.5-15.2-.7-1.2-1.2-2.6-1.6-4-.6-2-.8-4.1-.2-6.1.4-1.6 1.2-3 3-3.4 1.6-.3 2.8.5 3.7 1.7l2.4 3c2.9 3.5 6.3 6.3 10.4 8.3 3.8 1.9 7.8 2.7 12.1 2 1.3-.2 2.5-.4 3.8-.6.8-.1 1.6-.2 2.4-.2 1.8 0 3.5.5 4.4 2.3.8 1.8.3 3.5-.9 4.9-3.8 4.6-8.4 7.4-16 7.3zM68.1 60.4c.1-3.9 1.1-6.8 4.4-8.4 3.1-1.5 6.8-.9 9.3 1.5 2.6 2.5 3.8 5.5 2.7 9.1-.9 3.1-2.8 5.3-6 6.2-4.5 1.3-8.8-1.1-10-5.7-.2-1-.3-2.1-.4-2.7zM43 57.6c-.8-.1-1.8-.2-2.7-.4-6.6-.9-7.7-8.5-4.4-12.5 2.6-3.1 7.2-3.8 10.8-1.6 3.6 2.2 5.2 6.6 3.7 10.3-1.1 2.9-3.8 4.4-7.4 4.2z"/></svg></a>
</div>
<ul class="header__list">
<li>
<a href="#about-us" data-link>About us</a>
</li>
<li>
<a href="#the-flavours" data-link>The flavours</a>
</li>
<li>
<a href="#get-in-touch" data-link>Get in touch</a>
</li>
</ul>
</nav>
</header>
<main>
<section data-section="raspberry" id="home">
<div class="container grid">
<div class="section__img-col">
<img class="section__img" src="https://assets.codepen.io/85648/ice-creams-03.svg" alt="drawing of three smiling ice cream scoops in a bowl" />
</div>
<div class="section__content-col">
<h1>Happy Face Ice Cream Parlour</h1>
<p>A little ice cream parlour with big dreams.</p>
<p>We pride ourselves on flavours beyond your wildest dreams, and customer service that’s out of this world!</p>
<p>Order your favourite flavours online, or call us today to find out how we can make your special occasions extra delightful!</p>
<a class="section__link" href="#0">Shop now</a>
</div>
</div>
</section>
<section data-section="mint" id="about-us">
<div class="container grid">
<div class="section__img-col">
<img src="https://assets.codepen.io/85648/ice-creams-04.svg" alt="smiling scoop of ice cream with drips" />
</div>
<div class="section__content-col">
<h2>About us</h2>
<p>Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.</p>
</div>
</div>
</section>
<section data-section="vanilla" id="the-flavours">
<div class="container grid">
<div class="section__img-col">
<img src="https://assets.codepen.io/85648/ice-creams-01.svg" alt="three happy ice creams" />
</div>
<div class="section__content-col">
<h2>The flavours</h2>
<p>Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.</p>
</div>
</div>
</section>
<section data-section="chocolate" id="get-in-touch">
<div class="container grid">
<div class="section__img-col">
<img class="section__img" src="https://assets.codepen.io/85648/ice-creams-02.svg" alt="spoon with drips" />
</div>
<div class="section__content-col">
<h2 data-section-title>Get in touch</h2>
<p>Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat.</p>
</div>
</div>
</section>
</main>
</div>
!
CSS
@import url("https://fonts.googleapis.com/css?family=Open+Sans:400,700");
/* Variables */
:root {
--mint: #5ae8d5;
--chocolate: #573e31;
--raspberry: #f2308e;
--vanilla: #faf2c8;
--headerText: var(--vanilla);
--headerBg: var(--raspberry);
}
/* --Reset and boilerplate stuff-- */
* {
box-sizing: border-box;
}
body {
font-family: "Open Sans", sans-serif;
margin: 0;
background: var(--vanilla);
color: var(--chocolate);
line-height: 1.6;
}
ul {
list-style: none;
margin: 0;
padding: 0;
}
svg {
width: 100%;
height: auto;
fill: currentColor;
}
img {
display: block;
max-width: 100%;
}
h1 {
line-height: 1.2;
}
@media (min-width: 40em) {
body {
font-size: 1.2rem;
}
h1 {
font-size: 3.5rem;
}
}
a {
color: inherit;
text-decoration: none;
}
section {
padding: 5rem 0;
min-height: 100vh;
display: grid;
place-items: center;
}
/* ----- */
/* --Header and marker-- */
header {
position: fixed;
width: 100%;
padding: 0 max(1rem, 3vw);
background-color: var(--headerBg);
color: var(--headerText);
font-weight: 700;
transition: color 200ms, background-color 200ms;
}
header::after {
display: none;
content: '';
position: absolute;
top: 0;
left: 0;
width: var(--markerWidth, 0);
height: 0.4rem;
background-color: currentColor;
transform: translate3d(var(--markerLeft, 0), 0, 0);
transition: transform 250ms, width 200ms, background-color 200ms;
will-change: width;
}
@media (min-width: 40em) {
header::after {
display: block;
}
}
/* ----- */
/* --Header SVG - not necessary for the demo, just for fun-- */
.header__home-link {
position: absolute;
top: 1rem;
left: 1rem;
width: 5.25rem;
height: 5.25rem;
display: flex;
justify-content: center;
align-items: center;
padding: 1.25rem;
border-radius: 50%;
background: var(--headerBg);
color: var(--headerText);
border: 0.3rem solid;
}
/* ----- */
/* --Layout stuff-- */
.section__img {
max-width: 12rem;
margin: 0 auto;
}
@media (min-width: 40em) {
.section__img {
max-width: none;
}
}
section:last-child .section__img {
max-width: 10rem;
}
.container {
max-width: 60rem;
padding: 0 min(2rem, 5vw);
}
@media (min-width: 40rem) {
.grid {
display: grid;
align-items: center;
grid-template-columns: 1fr 2fr;
gap: 3rem;
}
}
.header__nav {
display: flex;
align-items: center;
}
.header__list {
display: none;
margin-left: auto;
}
@media (min-width: 40rem) {
.header__list {
display: flex;
}
}
.header__list a {
display: block;
padding: 1rem;
}
/* ----- */
/* --Secton specific styles, not related to demo-- */
.section__link {
display: inline-block;
background: var(--chocolate);
padding: 1rem 1.5rem;
color: var(--vanilla);
border-radius: 0.5rem;
font-weight: 700;
margin-top: 1.5rem;
}
/* ----- */
/* --Section colors-- */
[data-section="raspberry"] {
background-color: var(--raspberry);
color: var(--vanilla);
}
[data-section="mint"] {
background-color: var(--mint);
color: var(--chocolate);
}
[data-section="vanilla"] {
background-color: var(--vanilla);
color: var(--chocolate);
}
[data-section="chocolate"] {
background-color: var(--chocolate);
color: var(--vanilla);
}
/* ----- */
/* --Setting the custom properties for header colors-- */
[data-theme="raspberry"] {
--headerText: var(--raspberry);
--headerBg: var(--vanilla);
}
[data-theme="mint"] {
--headerText: var(--mint);
--headerBg: var(--chocolate);
}
[data-theme="chocolate"] {
--headerText: var(--chocolate);
--headerBg: var(--vanilla);
}
/* ----- */
/* --Setting the scroll root - because Codepen puts the content in an iframe-- */
.scroller {
height: 100vh;
width: 100%;
overflow: auto;
}
/* ----- */
/* --Smooth scroll behaviour for links-- */
@media (prefers-reduced-motion: no-preference) {
.scroller {
scroll-behavior: smooth;
}
}
/* ----- */
!
JS
const header = document.querySelector('[data-header]')
const sections = [...document.querySelectorAll('[data-section]')]
const scrollRoot = document.querySelector('[data-scroller]')
const headerLinks = [...document.querySelectorAll('[data-link]')]
let prevYPosition = 0
let direction = 'up'
const options = {
root: scrollRoot,
rootMargin: `${header.offsetHeight * -1}px`,
threshold: 0
}
const getTargetSection = (entry) => {
const index = sections.findIndex((section) => section == entry.target)
if (index >= sections.length - 1) {
return entry.target
} else {
return sections[index + 1]
}
}
const updateColors = (target) => {
const theme = target.dataset.section
header.setAttribute('data-theme', theme)
}
const shouldUpdate = (entry) => {
if (direction === 'down' && !entry.isIntersecting) {
return true
}
if (direction === 'up' && entry.isIntersecting) {
return true
}
return false
}
const updateMarker = (target) => {
const id = target.id
if (!id) return
let link = headerLinks.find((el) => {
return el.getAttribute('href') === `#${id}`
})
link = link || headerLinks[0]
const distanceFromLeft = link.getBoundingClientRect().left
header.style.setProperty('--markerWidth', `${link.clientWidth}px`)
header.style.setProperty('--markerLeft', `${distanceFromLeft}px`)
}
const onIntersect = (entries, observer) => {
entries.forEach((entry) => {
if (scrollRoot.scrollTop > prevYPosition) {
direction = 'down'
} else {
direction = 'up'
}
prevYPosition = scrollRoot.scrollTop
const target = direction === 'down' ? getTargetSection(entry) : entry.target
if (shouldUpdate(entry)) {
updateColors(target)
updateMarker(target)
}
})
}
document.addEventListener('readystatechange', e => {
if (e.target.readyState === 'complete') {
updateMarker(sections[0])
}
})
const observer = new IntersectionObserver(onIntersect, options)
sections.forEach((section) => {
observer.observe(section)
})
!
999px
Console
|
{
"url": "https://codepen.io/smashingmag/pen/XWRXVXQ",
"source_domain": "codepen.io",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "126987",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DQGI636SIGVMRO3IKJYZJ6CI24AJLCS2",
"WARC-Concurrent-To": "<urn:uuid:41d2ebe6-1d90-44bd-abc2-55358eaf1aaa>",
"WARC-Date": "2024-02-24T10:11:07Z",
"WARC-IP-Address": "104.16.176.44",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Q2TZCQT5FX5ZK7JM3JZODEA3JKEUVPR5",
"WARC-Record-ID": "<urn:uuid:f2c223c3-d200-42d9-8d98-9f89d37d1301>",
"WARC-Target-URI": "https://codepen.io/smashingmag/pen/XWRXVXQ",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e3f9c2ae-e909-42ce-88a8-cac840c1aa51>"
},
"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,
13,
14,
19,
20,
24,
25,
34,
35,
52,
53,
83,
84,
257,
258,
281,
282,
293,
294,
325,
326,
352,
353,
543,
544,
567,
568,
577,
578,
591,
592,
758,
759,
768,
769,
779,
780,
851,
852,
874,
875,
985,
986,
1001,
1002,
1128,
1129,
1145,
1146,
1163,
1164,
1227,
1228,
1263,
1264,
1269,
1270,
1285,
1338,
1360,
1388,
1426,
2990,
3000,
3029,
3038,
3086,
3096,
3105,
3161,
3171,
3180,
3236,
3246,
3255,
3264,
3275,
3283,
3330,
3362,
3397,
3545,
3556,
3595,
3638,
3694,
3812,
3948,
4001,
4012,
4022,
4035,
4081,
4113,
4148,
4261,
4272,
4311,
4334,
4792,
4803,
4813,
4826,
4879,
4911,
4946,
5044,
5055,
5094,
5121,
5579,
5590,
5600,
5613,
5668,
5700,
5735,
5848,
5859,
5898,
5944,
6188,
6199,
6209,
6222,
6231,
6238,
6253,
6266,
6268,
6269,
6273,
6274,
6289,
6379,
6380,
6396,
6404,
6422,
6445,
6468,
6489,
6491,
6522,
6553,
6555,
6556,
6594,
6598,
6623,
6625,
6626,
6633,
6672,
6684,
6713,
6739,
6758,
6760,
6761,
6766,
6785,
6797,
6810,
6812,
6813,
6819,
6833,
6848,
6869,
6871,
6872,
6878,
6895,
6913,
6915,
6916,
6921,
6940,
6942,
6943,
6970,
6978,
6999,
7002,
7004,
7010,
7031,
7034,
7036,
7037,
7041,
7058,
7082,
7084,
7085,
7095,
7113,
7133,
7149,
7171,
7173,
7185,
7186,
7214,
7223,
7241,
7255,
7283,
7319,
7346,
7365,
7415,
7417,
7418,
7434,
7450,
7464,
7485,
7494,
7504,
7535,
7552,
7585,
7638,
7705,
7726,
7728,
7729,
7756,
7773,
7791,
7794,
7796,
7808,
7809,
7873,
7894,
7915,
7927,
7940,
7957,
7975,
7991,
8017,
8039,
8058,
8079,
8109,
8136,
8159,
8161,
8173,
8174,
8197,
8213,
8232,
8249,
8251,
8252,
8279,
8296,
8315,
8318,
8320,
8321,
8356,
8375,
8377,
8378,
8391,
8410,
8438,
8440,
8441,
8469,
8478,
8495,
8518,
8552,
8565,
8568,
8570,
8571,
8586,
8602,
8624,
8626,
8627,
8643,
8659,
8679,
8681,
8682,
8710,
8727,
8744,
8747,
8749,
8750,
8768,
8785,
8801,
8803,
8815,
8816,
8870,
8887,
8911,
8942,
8965,
8989,
9013,
9032,
9053,
9055,
9067,
9068,
9093,
9122,
9159,
9183,
9185,
9186,
9211,
9243,
9269,
9271,
9272,
9299,
9334,
9360,
9362,
9363,
9392,
9429,
9453,
9455,
9467,
9468,
9526,
9554,
9587,
9616,
9618,
9619,
9641,
9669,
9700,
9702,
9703,
9731,
9764,
9793,
9795,
9807,
9808,
9890,
9902,
9918,
9932,
9949,
9951,
9963,
9964,
10008,
10057,
10070,
10097,
10100,
10102,
10114,
10129,
10142,
10144,
10145,
10148,
10149,
10164,
10235,
10301,
10362,
10428,
10429,
10451,
10472,
10473,
10491,
10510,
10556,
10570,
10572,
10573,
10611,
10683,
10685,
10722,
10744,
10754,
10783,
10786,
10788,
10789,
10824,
10862,
10904,
10906,
10907,
10941,
10995,
11009,
11012,
11013,
11064,
11078,
11081,
11083,
11097,
11099,
11100,
11135,
11157,
11159,
11176,
11178,
11217,
11263,
11267,
11269,
11300,
11302,
11362,
11364,
11432,
11499,
11501,
11502,
11547,
11577,
11623,
11645,
11656,
11676,
11680,
11683,
11722,
11725,
11804,
11807,
11836,
11860,
11884,
11888,
11892,
11894,
11895,
11948,
11992,
12022,
12026,
12029,
12030,
12094,
12095,
12127,
12154,
12157,
12158,
12173,
12186,
12188,
12194,
12195
],
"line_end_idx": [
13,
14,
19,
20,
24,
25,
34,
35,
52,
53,
83,
84,
257,
258,
281,
282,
293,
294,
325,
326,
352,
353,
543,
544,
567,
568,
577,
578,
591,
592,
758,
759,
768,
769,
779,
780,
851,
852,
874,
875,
985,
986,
1001,
1002,
1128,
1129,
1145,
1146,
1163,
1164,
1227,
1228,
1263,
1264,
1269,
1270,
1285,
1338,
1360,
1388,
1426,
2990,
3000,
3029,
3038,
3086,
3096,
3105,
3161,
3171,
3180,
3236,
3246,
3255,
3264,
3275,
3283,
3330,
3362,
3397,
3545,
3556,
3595,
3638,
3694,
3812,
3948,
4001,
4012,
4022,
4035,
4081,
4113,
4148,
4261,
4272,
4311,
4334,
4792,
4803,
4813,
4826,
4879,
4911,
4946,
5044,
5055,
5094,
5121,
5579,
5590,
5600,
5613,
5668,
5700,
5735,
5848,
5859,
5898,
5944,
6188,
6199,
6209,
6222,
6231,
6238,
6253,
6266,
6268,
6269,
6273,
6274,
6289,
6379,
6380,
6396,
6404,
6422,
6445,
6468,
6489,
6491,
6522,
6553,
6555,
6556,
6594,
6598,
6623,
6625,
6626,
6633,
6672,
6684,
6713,
6739,
6758,
6760,
6761,
6766,
6785,
6797,
6810,
6812,
6813,
6819,
6833,
6848,
6869,
6871,
6872,
6878,
6895,
6913,
6915,
6916,
6921,
6940,
6942,
6943,
6970,
6978,
6999,
7002,
7004,
7010,
7031,
7034,
7036,
7037,
7041,
7058,
7082,
7084,
7085,
7095,
7113,
7133,
7149,
7171,
7173,
7185,
7186,
7214,
7223,
7241,
7255,
7283,
7319,
7346,
7365,
7415,
7417,
7418,
7434,
7450,
7464,
7485,
7494,
7504,
7535,
7552,
7585,
7638,
7705,
7726,
7728,
7729,
7756,
7773,
7791,
7794,
7796,
7808,
7809,
7873,
7894,
7915,
7927,
7940,
7957,
7975,
7991,
8017,
8039,
8058,
8079,
8109,
8136,
8159,
8161,
8173,
8174,
8197,
8213,
8232,
8249,
8251,
8252,
8279,
8296,
8315,
8318,
8320,
8321,
8356,
8375,
8377,
8378,
8391,
8410,
8438,
8440,
8441,
8469,
8478,
8495,
8518,
8552,
8565,
8568,
8570,
8571,
8586,
8602,
8624,
8626,
8627,
8643,
8659,
8679,
8681,
8682,
8710,
8727,
8744,
8747,
8749,
8750,
8768,
8785,
8801,
8803,
8815,
8816,
8870,
8887,
8911,
8942,
8965,
8989,
9013,
9032,
9053,
9055,
9067,
9068,
9093,
9122,
9159,
9183,
9185,
9186,
9211,
9243,
9269,
9271,
9272,
9299,
9334,
9360,
9362,
9363,
9392,
9429,
9453,
9455,
9467,
9468,
9526,
9554,
9587,
9616,
9618,
9619,
9641,
9669,
9700,
9702,
9703,
9731,
9764,
9793,
9795,
9807,
9808,
9890,
9902,
9918,
9932,
9949,
9951,
9963,
9964,
10008,
10057,
10070,
10097,
10100,
10102,
10114,
10129,
10142,
10144,
10145,
10148,
10149,
10164,
10235,
10301,
10362,
10428,
10429,
10451,
10472,
10473,
10491,
10510,
10556,
10570,
10572,
10573,
10611,
10683,
10685,
10722,
10744,
10754,
10783,
10786,
10788,
10789,
10824,
10862,
10904,
10906,
10907,
10941,
10995,
11009,
11012,
11013,
11064,
11078,
11081,
11083,
11097,
11099,
11100,
11135,
11157,
11159,
11176,
11178,
11217,
11263,
11267,
11269,
11300,
11302,
11362,
11364,
11432,
11499,
11501,
11502,
11547,
11577,
11623,
11645,
11656,
11676,
11680,
11683,
11722,
11725,
11804,
11807,
11836,
11860,
11884,
11888,
11892,
11894,
11895,
11948,
11992,
12022,
12026,
12029,
12030,
12094,
12095,
12127,
12154,
12157,
12158,
12173,
12186,
12188,
12194,
12195,
12202
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 12202,
"ccnet_original_nlines": 472,
"rps_doc_curly_bracket": 0.010162269696593285,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0.0003287699946667999,
"rps_doc_stop_word_fraction": 0.06262122094631195,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005541699938476086,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6262122392654419,
"rps_doc_frac_unique_words": 0.5241605043411255,
"rps_doc_mean_word_length": 6.474201679229736,
"rps_doc_num_sentences": 439,
"rps_doc_symbol_to_word_ratio": 0.0033250199630856514,
"rps_doc_unigram_entropy": 6.122865676879883,
"rps_doc_word_count": 1221,
"rps_doc_frac_chars_dupe_10grams": 0.12207464128732681,
"rps_doc_frac_chars_dupe_5grams": 0.17115749418735504,
"rps_doc_frac_chars_dupe_6grams": 0.16179633140563965,
"rps_doc_frac_chars_dupe_7grams": 0.15041112899780273,
"rps_doc_frac_chars_dupe_8grams": 0.1294117569923401,
"rps_doc_frac_chars_dupe_9grams": 0.12207464128732681,
"rps_doc_frac_chars_top_2gram": 0.006072110030800104,
"rps_doc_frac_chars_top_3gram": 0.010626190342009068,
"rps_doc_frac_chars_top_4gram": 0.012144209817051888,
"rps_doc_books_importance": -1548.412353515625,
"rps_doc_books_importance_length_correction": -1548.412353515625,
"rps_doc_openwebtext_importance": -888.99609375,
"rps_doc_openwebtext_importance_length_correction": -888.99609375,
"rps_doc_wikipedia_importance": -440.7648620605469,
"rps_doc_wikipedia_importance_length_correction": -440.7648620605469
},
"fasttext": {
"dclm": 0.9546259045600891,
"english": 0.24394938349723816,
"fineweb_edu_approx": 2.0183725357055664,
"eai_general_math": 0.029744209721684456,
"eai_open_web_math": 0.390188992023468,
"eai_web_code": 0.7701575756072998
}
}
|
{
"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": "641.8",
"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": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,352,914,513,478,175,000 |
What happens if I delete a playlist on Apple Music?
A playlist on Apple Music is a customized collection of songs that you can create and organize. Playlists allow you to group songs together based on genre, mood, activity, or anything else you want. When you delete a playlist on Apple Music, the songs themselves remain in your library. Deleting a playlist only removes the playlist structure, not the music it contained. In this article, we’ll cover exactly what happens when you delete a playlist on Apple Music.
Playlist Data Remains
When a playlist is deleted on Apple Music, the playlist itself and all of its associated data are removed, including the playlist name, description, song order, and which songs were in the playlist. However, deleting a playlist does not delete or remove the songs that were contained within the playlist from your Apple Music library. The songs themselves remain safely in your library and can be added to new playlists or accessed like normal.
In essence, deleting a playlist removes the “container” of the playlist but the contents inside – the songs – stay put in your overall Apple Music collection. So you don’t have to worry about accidentally losing your songs or music when getting rid of an old playlist.
Apple Music playlists are similar to creating a folder on your computer. If you delete the folder (playlist), the files (songs) inside aren’t deleted – they remain accessible elsewhere on your device. Only the organizational structure of the folder (playlist order, name, description) is removed when deleting the playlist.
Recently Deleted Playlist
When you delete a playlist on Apple Music, it doesn’t get permanently erased right away. The playlist actually gets moved to the Recently Deleted Playlist section where it stays for 30 days before being permanently deleted [1]. This gives you a grace period to recover your playlist if you accidentally deleted it or changed your mind.
To access your Recently Deleted Playlist, open the Playlists tab in Apple Music and scroll down. You’ll see a section called Recently Deleted with your deleted playlists. Simply tap on the playlist to restore it back to your library.
Keep in mind the 30 day timer starts as soon as you delete the playlist. So if you want to recover it, be sure to check Sooner rather than later. After 30 days, the playlist will be gone for good.
Play Counts Reset
When you delete a playlist in Apple Music, the play counts for the songs in that playlist are not deleted. The songs will retain their current play count totals even though the playlist itself is gone. However, note that if you re-add the deleted songs back into a new playlist, their play counts will be reset to 0 according to users on Apple’s forums and Reddit. So deleting a playlist does not directly reset song play counts, but adding the songs into a new playlist later will cause the count to start over.
Playlists Shared With Others
When you delete a playlist you’ve previously shared with others on Apple Music, it is removed from their libraries as well. The playlist will disappear from their account, even if they had added it to their own playlists or downloaded it.
As noted on Apple’s discussion forums, “If you shared a playlist with a friend and they saved it to their device, the playlist disappears. Your library and playlists don’t change.”[1] So once you delete a shared playlist, it is no longer accessible to anyone you had previously shared it with.
The only way for others to retain the playlist is if they had made a copy of it in their own account before you deleted it. But the original shared playlist itself will be removed from all libraries when you delete it.
Recommendations Unaffected
Deleting a playlist on Apple Music does not affect the service’s recommendations for you. Apple Music’s algorithm looks at your full listening history and preferences to suggest music, not just specific playlists you may have created. As explained on Apple’s support site, “Apple Music recommends music based on what you already listen to and like, not just the artists and songs in any given playlist” (source).
So if you delete a playlist, even one with many songs or listens, it will not reset or change the personalized recommendations you see in Apple Music. Those suggestions are based on your overall taste profile and total listening behavior, not any one playlist. You can continue enjoying personalized music recommendations after deleting a playlist.
Recovering Playlists
If you accidentally delete a playlist on Apple Music, you may be able to recover it from Recently Deleted before 30 days pass. Apple Music stores deleted playlists in Recently Deleted for up to 30 days before permanently removing them.
To recover a deleted playlist on iPhone or iPad:
1. Open the Apple Music app and tap on the Library tab.
2. Scroll down and tap on Recently Deleted.
3. Find the playlist you want to recover.
4. Tap on the 3 dots next to the playlist and select Recover.
The recovered playlist will reappear in your library. This allows you to undo accidental playlist deletions within 30 days. However, once 30 days have passed, the playlist will be permanently deleted from Recently Deleted and irrecoverable according to Apple (source).
Permanently Deleting
When you delete a playlist on Apple Music, it is moved to the Recently Deleted section and remains there for 30 days before being permanently deleted. After 30 days have passed, the playlist is irrecoverable and cannot be restored.
Playlists that are in the Recently Deleted section can be recovered during the 30 day window by opening Recently Deleted and tapping on the playlist to restore it. However, once the 30 day period has elapsed, the playlist is gone for good.
So if you accidentally delete a playlist you want to keep, make sure to recover it from Recently Deleted within 30 days. Otherwise, there is no way to get back a playlist after it has been permanently deleted from Apple Music.
Creating Backups
It’s always a good idea to create backups of your Apple Music library and playlists in case you want to restore anything later. There are a few ways to do this:
On a Mac, you can use the Export Playlist feature in Music. Select a playlist, go to File > Library > Export Playlist, choose a location to save the file, and click Save. This will export the playlist as an XML file that can be imported back into Apple Music if needed. You can also back up your entire Apple Music library by finding the Music folder under Users > Your Name > Music and copying it to an external drive.[1]
On Windows, use the Export Playlist option in iTunes. Select the playlist, go to File > Library > Export Playlist, pick a save location, and click Save. To back up everything, find your iTunes media folder (usually under My Music or Music) and copy it to external storage.[2]
You can also manually copy playlist and music files to another location as a backup. Some users recommend regularly backing up the entire Music folder that contains your Apple Music library as a form of protection.[3]
Summary
Here’s a recap of the key points on what happens when you delete a playlist on Apple Music:
• The playlist itself is removed from your library, but the songs in the playlist remain in your Apple Music catalog.
• Recently deleted playlists can be recovered for up to 30 days after deletion.
• Play counts for the songs that were in the deleted playlist are reset to 0.
• Shared and public playlists are removed for everyone.
• Apple Music’s recommendations are unaffected by playlist deletion.
• You can recover playlists from a backup or by re-adding the songs.
• After 30 days, playlists are permanently deleted from Recently Deleted.
In summary, deleting a playlist removes it from view, but does not delete the songs or your Apple Music account data. You have options to recover or recreate playlists if needed.
|
{
"url": "https://darwinsdata.com/what-happens-if-i-delete-a-playlist-on-apple-music/",
"source_domain": "darwinsdata.com",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "90443",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IXJLQ7B7YUXELKOWNPNHBBBUKOBI7MGR",
"WARC-Concurrent-To": "<urn:uuid:f9c78e9d-9705-4d6e-80fe-e180930e6ca8>",
"WARC-Date": "2024-06-17T11:34:43Z",
"WARC-IP-Address": "104.21.73.206",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FT7WVDFRZTNEDRY2FOO4C3WQKQXAOMLN",
"WARC-Record-ID": "<urn:uuid:b3058aaa-8443-4cf0-a6b7-0dc7b77a6546>",
"WARC-Target-URI": "https://darwinsdata.com/what-happens-if-i-delete-a-playlist-on-apple-music/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f5c53c02-bac5-470a-b0dd-492d72ef34b9>"
},
"warc_info": "isPartOf: CC-MAIN-2024-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-21\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,
52,
53,
518,
519,
541,
542,
987,
988,
1257,
1258,
1582,
1583,
1609,
1610,
1946,
1947,
2181,
2182,
2379,
2380,
2398,
2399,
2912,
2913,
2942,
2943,
3182,
3183,
3477,
3478,
3697,
3698,
3725,
3726,
4139,
4140,
4489,
4490,
4511,
4512,
4748,
4749,
4798,
4799,
4857,
4903,
4947,
5011,
5012,
5281,
5282,
5303,
5304,
5536,
5537,
5777,
5778,
6005,
6006,
6023,
6024,
6185,
6186,
6609,
6610,
6886,
6887,
7105,
7106,
7114,
7115,
7207,
7208,
7328,
7410,
7490,
7548,
7619,
7690,
7766,
7767
],
"line_end_idx": [
52,
53,
518,
519,
541,
542,
987,
988,
1257,
1258,
1582,
1583,
1609,
1610,
1946,
1947,
2181,
2182,
2379,
2380,
2398,
2399,
2912,
2913,
2942,
2943,
3182,
3183,
3477,
3478,
3697,
3698,
3725,
3726,
4139,
4140,
4489,
4490,
4511,
4512,
4748,
4749,
4798,
4799,
4857,
4903,
4947,
5011,
5012,
5281,
5282,
5303,
5304,
5536,
5537,
5777,
5778,
6005,
6006,
6023,
6024,
6185,
6186,
6609,
6610,
6886,
6887,
7105,
7106,
7114,
7115,
7207,
7208,
7328,
7410,
7490,
7548,
7619,
7690,
7766,
7767,
7945
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7945,
"ccnet_original_nlines": 81,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4162895977497101,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0019392400281503797,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13962508738040924,
"rps_doc_frac_unique_words": 0.26523029804229736,
"rps_doc_mean_word_length": 4.731054782867432,
"rps_doc_num_sentences": 78,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.001670837402344,
"rps_doc_word_count": 1346,
"rps_doc_frac_chars_dupe_10grams": 0.014133170247077942,
"rps_doc_frac_chars_dupe_5grams": 0.14996859431266785,
"rps_doc_frac_chars_dupe_6grams": 0.0959484875202179,
"rps_doc_frac_chars_dupe_7grams": 0.05433417111635208,
"rps_doc_frac_chars_dupe_8grams": 0.03077889047563076,
"rps_doc_frac_chars_dupe_9grams": 0.025439700111746788,
"rps_doc_frac_chars_top_2gram": 0.04082914814352989,
"rps_doc_frac_chars_top_3gram": 0.02591080032289028,
"rps_doc_frac_chars_top_4gram": 0.022613070905208588,
"rps_doc_books_importance": -677.48095703125,
"rps_doc_books_importance_length_correction": -677.48095703125,
"rps_doc_openwebtext_importance": -409.9375305175781,
"rps_doc_openwebtext_importance_length_correction": -409.9375305175781,
"rps_doc_wikipedia_importance": -461.3904113769531,
"rps_doc_wikipedia_importance_length_correction": -461.3904113769531
},
"fasttext": {
"dclm": 0.15102839469909668,
"english": 0.9689013957977295,
"fineweb_edu_approx": 1.4856888055801392,
"eai_general_math": 0.04573094844818115,
"eai_open_web_math": 0.12478625774383545,
"eai_web_code": 0.075400710105896
}
}
|
{
"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": "781.7",
"labels": {
"level_1": "Arts",
"level_2": "Music",
"level_3": "Music theory"
}
}
},
"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
|
4,631,836,823,743,264,000 |
back to article Dog bites man: Apple's Macs trounce all Windows PCs in customer love
Once again, Apple's Macs – desktops and laptops – have outscored any and all windows PCs in a customer-satisfaction survey: the American Consumer Satisfaction Index (ACSI). "Apple maintains the strong lead it has held for a decade, inching up 1 per cent to an ACSI score of 87," the consumer-surveymeisters write in a report ( …
COMMENTS
This topic is closed for new posts.
Page:
Silver badge
Margin of error?
Sample size? Standard deviation?
But hell, I'm just being a crotchety old PC user, aren't I?
8
1
Anonymous Coward
Re: Margin of error?
I would have had a look at the report to tell you but they want registration details and I can't be bothered to invent :
Title, Department, and Company - for some reason the obligatory pieces of info apart from the usual name and email.
3
0
Anonymous Coward
PC Pro Awards in the UK 2013
Mac Book came top!
Apparently the survey size was over 200,000
1
0
Re: Margin of error?
What std. dev? It's all about satisfaction! Do you probe your std. dev while having sex. Guess no. Exactly the same approach is applied on that survey. Get it?
2
1
Re: Margin of error?
I also wonder what it would look like if we took cost into account - perhaps it's more that people are more satisfied with more expensive PCs, and people buying Apple products are more likely to be spending more. And what's it comparing anyway - Windows vs OS X, or different makes of PCs? People can run other OSs on PCs, and run Windows on Apple PCs, last time I looked.
(That and the RDF that means its users see no wrong. I love my Android phone, and would much prefer it over IOS. But does the fact that I might still give some honest criticisms of Android, whilst an IOS user claims even a dumb phone with no apps or 3G is a revolution, mean my opinion doesn't count, and IOS is better? These surveys penalise platforms where users are more honest.)
Interesting to see the comment about Apple PC sales doing no better - I've argued that if the doom and gloom about PCs dying really does happen (which I'm sceptical of - a new market growing doesn't mean another dies), Apple are just as much as risk, especially since they do best in the sector of ultra-portable laptops, and they seem to have nothing in the way of touchscreens or hybrids.
1
1
Silver badge
Re: Margin of error?
I have to agree. I remember an article a while back (on CNet?) about the author's Macbook Pro burning out two motherboards (or in Apple-ese, 'Logic Boards') within a few months, then a little farther down, after he'd bought a Toshiba or something, he said he couldn't get used to it because he missed the reliability of his Macbook.
1
0
Anonymous Coward
Re: Margin of error?
If you own a Mac you would understand. The hardware is very well made - the OS is reliable - read the independent reviews from people like Which as well - they rate the Macbook Air as the best laptop they have ever tested. Sure it's not for everyone and it's not the cheapest kit to purchase but look at TCO and how long the stuff lasts and it's probably no more or less expensive in the long run.
0
0
Re: Margin of error?
You made good points with the stats angle, but there are even other factors to consider here.
I didn't see Lenovo and they passed HP for the #1 spot in PCs last quarter. Excluding Lenovo makes sense if this is a longer standing list as Lenovo only rolled into the PC game recently. To that point, so did Apple really. Apple's marketshare has only started growing recently, so people are more likely to be happy with a 2 year old macbook than an 8 year old HP.
All of that being said, if Apple users are only 6% or 7% happier and pay twice as much, that is a pretty damning statement against Apple, not something to boast about.
0
0
Anonymous Coward
Apple owners see no faults with Apple gear
Bears, woods
Pope, Catholic
Yawn
17
4
Anonymous Coward
I use a Macbook Pro, a RiscPC and a couple of HP laptops with Win7Pro. I hardly ever have any problems with the Mac, RISC OS has by far the nicest GUI and the PCs I only use because that's what the software we use runs on. Moreover other people use the PCs and I have to sort out the problems. I'd certainly concur with these findings.
5
4
Anonymous Coward
There are plenty of other empirical surveys that suggest that Apple Mac hardware is amongst the most reliable (on a par with a couple of Windows PC manufacturers).
There are plenty of things about Windows and Linux DEs that irritate the hell out of me, just as with OSX. But hell, Windows XP required the novice user to install 3rd party software to make an image backup, OSX didn't. Win 7 requires the user to disable Window Security Essentials (?!) before making a successful image backup. It's the little things.
4
4
Silver badge
Selective perception
I remember an Apple user who told me how stable and reliable his Mac was, and while preaching to me his machine crashed twice. Either he got hit by Murphy's Law in the most Alanis Morrissette-ironic way possible, or his Mac wasn't anywhere near as stable and reliable as he was convinced it was.
6
4
Bronze badge
I've been a mac house for 5 years now (previously anti-mac).
I bought a cheap asus x401 a month ago from ebuyer (insanely cheap) to run my webcam security cameras on 24/7 as it'd let me save power and let the main osx server and raid array sleep during the week when I am away on business.
It had windows 8 on it. It was utterly hellish, plus of course it had to usually bloadware crap on it.
No probs I thought - I'll just fire my old copy of windows 7 on there - given it me free for 'hosting a windows 7 party' before I left the windows arena.....
holly christ - what a bloody palaver!!!!
boot of USB DVD ? will it f*ck.
fecking about with their terrible implementation of EFI... looking on the net, changing bios settings, trying again... net full of people with similar tales.. I mean how can you make something so hard that has been mainstream easy for nearly 15 years!!! Just let me boot of the f*cking DVD for christsake!!!
Eventually after probably 10+ manhours I got it done - only possible by switching EFI off.
utter utter mince - if I'd known I'd have bought a 400 quid 5 year old macbook and used that - I'd have been able to stick windows 7 on that in 30 minutes.
stu
6
2
I'm an Apple owner ... and to be honest the laptop keyboards aren't as robust as they used to be. I've had this one for less than three years and the mylar is already wearing off a couple of keys.
1
1
Silver badge
@chevron how can Mylar be wearing off when the key character graphic is plastic moulded in situ all the way through the key so the backlight can light it from behind ? If you have a non backlit MacBook Air surely it must surely be older than three years old, no ?
1
1
This post has been deleted by a moderator
I have a Clevo laptop and Samsung laptop with Windows 8 and 7, and they both work fine, and never have any problems. I'd only use an Apple PC if I had to. Moreover, I see other people having problems with Apple PCs. That's my anecdotal evidence.
1
0
Anonymous Coward
Standard story - owner of expensive Apple products buys "insanely cheap" PC and then proceeds to bitch and moan about how bad it is.
0
0
Anonymous Coward
Hmmm...
The thing is, Apple users have a pseudo religious / sexual attachment to their Macs so saying they are not happy is blasphemy / infidelity, besides after spending all THAT kinda money, who wants to admit that they bought a turd and when was the last time they used a Windows PC (objectively) to COMPARE?
12
20
Re: Hmmm...
"besides after spending all THAT kinda money, who wants to admit that they bought a turd"
Couldn't agree more. Having had to service some of these Macbooks, I have been shocked and disgusted to find Toshiba brand hard drives inside. I mean SERIOUSLY??? Making someone spend all that money on overpriced aluminum crap and then you throw a junkard drive like that into it? Come on Apple...at LEAST a WD Blue or Seagate drive here.....
3
9
Silver badge
Re: Hmmm...
>who wants to admit that they bought a turd
There are plenty of other empirical surveys that suggest that Apple Mac hardware is amongst the most reliable (on a par with a couple of Windows PC manufacturers).
"Show me [your] body [of evidence]."
4
2
Anonymous Coward
Re: Hmmm...
"Couldn't agree more. Having had to service some of these Macbooks, I have been shocked and disgusted to find Toshiba brand hard drives inside. I mean SERIOUSLY??? Making someone spend all that money on overpriced aluminum crap and then you throw a junkard drive like that into it? Come on Apple...at LEAST a WD Blue or Seagate drive here....."
And what makes you think Toshiba drives are junk?
Let me remind you that Apple recently had to recall millions of iMacs to replace their defective Seagate drives.
A quick Google found this article on Tom's hardware:
http://www.tomshardware.com/reviews/hdd-reliability-storelab,2681-2.html
Looks like Toshiba/Fujitsu drives are pretty reliable. I haven't had a problem with any of the ones I've owned.
8
0
Re: Hmmm...
I tried Mac a few years ago and hated it. Windows 8 forced me to go looking for alternatives and (after a 3 months stint on Linux) I bought another Mac. I can't speak for the hardware reliability after only having it a week but once you grok mission control, gestures and some keyboard shortcuts, the productivity of OS X desktop is second to none.
5
2
Anonymous Coward
Re: Hmmm...
They did put Seagate drives in there - and then had to take them all out again as the heads came off and destroyed the platters.
I've replaced a few myself..
1
1
Silver badge
Re: Hmmm...
Beleive it or not there are those of us who are paid to develop on Windows but prefer the Mac if we're spending our own money. We're not talking about cheap and nasty PC's either, my work PC is a twin Xeon workstation with a 30" Dell screen.
7
1
Anonymous Coward
Re: Hmmm...
@Steve Todd and there are a few of us, who not only prefer the Mac but have an unashamed emotional loathing of PC's. I personally readily admit I a mo longer prepared to spend any time trying out Windows. I simply don't care what improvements MS Have made. So no my opinion is no longer scientific on this matter. Windows 8 may be massively improved. I don't give a shit. At the time I switched to Mac, it really was like I was parched, in a burning Hell and Apple turned up gave me a cool glass of water and lifted me out to a cool meadow where life is productive and good. Asking me to use Windows now is like asking me to make friends with a man who has raped my daughter.
3
3
Re: Hmmm...
I'm honestly curious - what did you hate about Windows 8 so much, that you switched OS? The differences between 7 and 8 are far smaller than the differences between either and OS X. Moreover, OS X involves launching apps via clicking on big icons, and not AFAIK via a hierarchical menu.
The start menu can be put back to Windows 7 with a simple free utility (something that's you can't do for OS X). The full screen tablet-style apps can be ignored if you don't want them. Applications from Windows 7 and before continue to work in the same way - I found the transition far smaller than between XP and 7.
I'm sure that OS X is okay, but it's also okay with Windows too - comparing is just opinion.
0
0
Re: Hmmm...
Believe it or not, there's a difference between personal preference, and objective fact. That people have different opinions is well known. But that doesn't make it fact, or media news, as this article tries to do.
0
1
Silver badge
Stop
Re: Hmmm...
Since the OP asked "when was the last time they used a Windows PC (objectively) to compare" then I gave a perfectly valid answer. I use Windows PCs, of high quality and from an objective viewpoint, on a daily basis. Having made an objective comparison then I prefer the Mac option. There is always going to be a subjective component based on what you use the device for, but for my set of use cases the Mac works better and requires less maintenance.
0
0
Anonymous Coward
Re: Hmmm...
@Mark
It wasn't Windows 8 I was using when I switched but the dreaded Windows Vista. Also for some time after switching I was supporting my girlfriends 3 PC office with MS Small Business server. Horrible, horrible horrible.
There were two severe bugs that did it for me with Microsoft. The first we the bug they had in Outlook for 2 versions, where if your outlook database grew bigger than 2 gigabytes it would silently corrupt and if you didn't realise the corruption had occurred (which most wouldn't because it would only be apparent when you needed to search through old emails), then the corruption would end up backed up all the way through your backup sets. These two facts in conduction simply do not compute. No software company should ever allow a bug like that out the door, it can do damage that is extremely prejudicial to be business. For it to survive two major release numbers simply fuses my brain. This caused me a lot of admin/recovery time regarding my Girlfriends office set up.
The second issue was that for several major version of Word, if you edit references at the same time as have the document map pane open for navigating a long document, with 2 hours your document will almost certainly be corrupt. Most usually irretrievably (MS have about 8 different complex procedure for de-corrupting Word documents. 50/50 if this bug is encountered, none will work).
This was certainly the case for all the versions of Word I used on the PC up to when I switched. It is still the case for the latest office for Mac, which uses the same core engine as Office on the PC. Again the corruption can be silent. Perfectly competent users can have a long document representing thousands of hours work and end up with a corrupt document backed up all the way through their backup sets. This one caused me an incredible amount of pain and essentially was responsible for destroying a bid for business for my startup when our bid document was corrupted and the first half of the document became inaccessible and failed to print. The problem was the basis of the document has been corrupted many months earlier, without our knowledge. Of course we may not have won the bid anyway, but it was crucial for my startup and ultimately we failed due to not getting the main client we had put so much effort into "romancing"
When I did some research and discovered this bug was almost certainly responsible and has been in Word for many major versions, and when it became clear MS has known about it (it was an open bug for years) and shipped while allowing these incompatible features to be used together, I was, as you can imagine, quite angry. So yes I have very good reason for my visceral hatred of MS incompetence. They knowingly shipped a broken product with a bug that is about as severe as its possible to get (near certain silent document corruption) and may well, given the millions of users of Word, be responsible for people having committed suicide who have lost examination dissertations, business bid documents, reports etc. at inopportune times.
0
0
Silver badge
Angel
Probably
... because even with the overpriced hardware it does seem to fare quite better than some of the worst PC-side manufacturers (I'm looking at you, Acer!) and it's possible some of the user dissatisfaction has to do with Windows 8.
That said, Macs do have some issues, like my Poltergeist trackpad that every now and then gets possessed and starts jumping the pointer everywhere. A couple of hours of using an external mouse seems to bring it back to normal, though.
0
0
Mavericks will not spike the Mac Uptake, because...
There is no question that the Apple hardware is nice, the MacBook Pro and Air are really nice machines, and at couple of the companies I have worked with recently I have noticed a massive uptake in Apple laptops, mainly the Air because of its size, weight and battery life. Strangely, when you walk round the other side of desk and see the screen 90%+ have ditched OSX and have put Win7 on, not IT enforced, but by personal choice because they find it easier to work with.
I have also tried to move to OSX for work but also found it nowhere near as productive (and, yes - I did try it for 3 weeks to get over the learning curve), having said that, I did by a mac air for home use and in that scenario find it great for web/email/music/dvd/photos etc
It would be interesting to know how many of the Apple laptops sold are still actually using OSX.
2
3
Anonymous Coward
Re: Mavericks will not spike the Mac Uptake, because...
Depends on what your work is... for CAD, it'll be probably Win7, for anything audio related OSX wins (unless you favour some ultra-low latency build of Linux).
2
0
Silver badge
Re: Mavericks will not spike the Mac Uptake, because...
Yup, horses for courses in the OS stakes. I use OS X on a 2008 Macbook (non pro, but unibody) with 8gb RAM and an SSD - OS X on that is perfectly adequate for fairly heavy multitasking and general jiggery pokery.
I do find myself booting into Linux every so often though, for things that just aren't as well supported on the OS X side - I prefer the way the terminal is handled in Ubuntu for a start (I hate the confusion I get from going to CMD+letter to CTRL+Letter in OS X - booting into Linux you don't have that stark change, you expect to use CTRL in that environment) and it tends to handle large memory loads better. Also, I find LibreOffice behaves better under Linux than OS X. So if I need to do any serious documentation, it's ALT-boot time. I also just generally have a preference for Ubuntu as it's my main home OS as well. I have a Windows VM that I use for the occasional Windows stuff I have to do.
Can't complain about the hardware though - the laptop lives in a neoprene slip cover thingy (you know the type), often in the passenger footwell of my car when I'm out and about, and quite often I forget about it and start turning up the speed/wheelmanship/vroom vroom noises a bit.
It's seen more of the floor of my car than I have, and other than a dent in the back of the screen caused by it falling off the seat onto a wheel brace under hard braking (I had to put the spare on, did a brake test on the backroad I was on to make sure it was secure before heading to the main roads....), it's pretty much clean as a whistle for a five year old machine. And I could probably sell it in this spec for more than the cost of the motherboard it needed to rescue it from the scrapheap.
I just wouldn't even comprehend putting a £1000 windows laptop through that - at all. Macbook? No fecking problem.
I can't help thinking when it needs replacing - not for a while with any luck - it'll probably be another midrange, fixer-upper Macbook that'll be getting looked for. This one has served me extremely well.
Steven R
0
0
Satisfied users are satisfied
I'm not in the slightest big surprised that Apple has the lead. Their laptops are superior. Period. And please, spare me the whole "stupid sheeple fanboi" garbage. I meansure my MBP uptime in *months*. The only time I have to reboot is when the rare critical update comes through that requires it, or a 3rd party app inexplicably requires it. I don't worry about it mysteriously slowing down. I have to do sysadmin and other misc computer work all day. I don't have the time, inclination, or patience to also work on my *own* gear. I want it to work so I can get my own stuff done.
My mom used to call me on more than a weekly basis because the PC kept doing wierd things, slowing down, breaking in some way ,etc. I bought her a used iMac, and now when she calls me it's because she wants to know how to do something. Not one... single...problem... in two years now.
I'm now trying to get my Dad to ditch his Acer because I'm sick of having to spend on avg an hour a week trying to figure out why it's breaking yet again.
I'm (not) sorry, but the track record speaks for itself.
18
6
Anonymous Coward
Re: Satisfied users are satisfied
It's use-cases like your that make Chromebooks seem tempting... for those of use with families and are sick of receiving phone calls "It's shown me a message about cookies, I don't know what to do..."
2
0
Re: Satisfied users are satisfied
This is exactly my experience too. I use and support PCs at work, but all my home systems are Apple (2 iMacs and a Macbook Pro). The only issue I've had with any of them is a failed hard drive, and time machine backups made that simple to recover.
OSX is a lot less forgiving of hard drive issues than Windows is. A bad external drive will halt OSX, preventing recovery of the data. With Windows you can usually recover stuff from a failing drive as long as you avoid writing to the drive.
2
0
Gimp
Re: Satisfied users are satisfied
@Rick Damiani
[OSX is a lot less forgiving of hard drive issues than Windows is. A bad external drive will halt OSX, preventing recovery of the data. With Windows you can usually recover stuff from a failing drive as long as you avoid writing to the drive.]
Rick try SystemRescueCD www.sysresccd.org - The ISO will boot from a Mac optical drive (I haven't tried the USB bootable version), you then have all of the Linuxy goodness stuff to mount the drive as read only, and then cp or rsync the drive's files to the internal drive...
1
0
Facepalm
Re: Satisfied users are satisfied
Sorry in my previous post (Senility strikes) I should also have mentioned that you can start the Mac in single user mode (Command-S). Then connect the external drive. You can then run UNIX (BSD-ish) stuff from the command prompt like: -
ls –l /dev/disk* (or Apple's diskutil list )
and:
mount -r –t hfs /dev/disk1s2 /drive2
then rsysnc or cp whatever...
2
0
You're criticising Microsoft for AVG?
It's comments that these that demonstrate the real reason for these surveys - one set of users blindly argue that their personal experience must be fact, whilst most other users just don't care.
I could just as well say my Clevo is better than anything else. Period.
I don't leave my laptop on all the time, but I have never had a crash with Windows 7 or 8. XP only died from graphics card crashes - and I've seen those take out modern OS X. I've seen modern Macs crash from failing to recover from sleep - last time Windows did that was with 98. Not that I'm blindly saying therefore one is better - I'm pointing out that experiences vary.
I don't worry about it mysteriously slowing down. I don't have to do sysadmin or work on it (as it happens, the only time I have had to struggle is if I've had to use itunes). My parents only call me for Internet related issues, which would apply on any OS.
And AVG? Windows 8 has anti-virus built in, and I don't even notice. For Windows 7 or earlier, my advice is to install Microsoft Security Essentials. AVG was horrible the way it constantly pestered me, MS SE just works in the background. It's absurd to use AVG in an argument for Windows vs OS X - that might have applied 10 years ago, but not when MS have their own anti-virus that works much better. You might as well install some horrible unnecessary 3rd party anti-virus on a Mac too, and complain...
1
0
Re: You're criticising Microsoft for AVG?
No, he wasn't - he wrote it in lower case as an abbreviation for 'average'. I thought he meant AVG as well, until I re-read it. I still think he's wrong though! I don't know what's up with these people, my XP/Vista/7/8 PCs (Dell/HP) have gone on reliably for years, used every day, no problems at all. Lucky I guess.
0
0
Parochial
Perhaps the article's title should have mentioned that it's what Americans - and only Americans - think.
3
0
Bronze badge
Joke
Re: Parochial
The title should have been "Americans think". I mean, who knew?
1
0
Bronze badge
rounding error
To me 7 points is a rounding error, 15 points isn't much better. Really I expected more like a 25 point margin. But the folks I have worked with for the past few years have been pretty die hard mac fans(even though the software they work on runs on Linux) so I suppose the info I have is heavily biased.
Quite surprised that all major vendors are bunched so close together - only 11% between the top and bottom?
Also SORT of strange that Lenovo is not mentioned by name as they are the biggest/near biggest PC maker.
4
0
Silver badge
Stop
Re: rounding error
You really need to learn about statistics and sample sizes. The accuracy of the numbers depends on the number of people they ask compared to the total numbers sold. I doubt in this case that the margin of error is more than a percentage point or two.
As for Lenovo, I suspect they don't have a big presence in the consumer space that this survey was interested in. For business use they sell truck loads.
1
1
How about...?
It's fascinating looking at the mental contortions some of the above commenters are tying themselves in. A quick run through gives us that this survey result is due to: statistical error, Windows 8, some weird self-justification process from spending a lot of money, a sexual attraction to an inanimate object, blind religious devotion and this all being down to Americans being stupid, to name a few.
I might have an alternate explanation here. Now bare with me here while I spout forth with crazy talk. Are you ready? Maybe this survey result is a result of, y'know... Macs being quite good.
8
4
Re: How about...?
It's fascinating the mental contortions people go to to prove their buying justifications, including doing and promoting surveys, and then posting comments about their anecdotes.
I have an alternative explanation. Perhaps my good experience with my machines is that they are, you know, good. That other users claim more loudly their machines are better doesn't make mine not as good.
0
0
My Macbook experience, and observations of those around me.
I was given a macbook pro for free at my university...and hated it. I mean well and truly hated it. I ended up giving it away, and going back to my 4 year old mid-range Toshiba laptop that spent a year with me in Iraq. It wasn't particularly good, but substantially better than the top end Macbook Pro I was given.
Things I noticed just on the first day:
They had a pretty high failure rate. Out of the nearly 100 people that day given laptops, about 10 failed during first boot and had to be traded in for new ones. Another 10 had issues connecting to the wired LAN. ( I believe that could have been fixed, but they just went ahead and traded in those too, probably to prevent everyone else having to wait on them. )
Overheating is a massive issue. The only air vent is the hinge ( WTF? ), which means if the screen is at anything other than a rather awkward angle, it gets quite warm. Add anything else that might warm it up a bit, and it'll overheat, completely shutting down the laptop. Fantastic.
The trackpad is pretty low quality. It has frequent issues with detecting movement. It sort of acts like a thermal trackpad and the heat from components underneath is interfering with it, but I can't imagine they were that stupid with it, so something else has to be causing it.
To click the mouse, you have to push the entire trackpad down. ( well, without lifting off and doing a touch, which will move the mouse quite a lot. ) This is one of the stupidest things I have ever seen on any laptop, right below the air vent hinge thing of course...which is also on the same laptop. Really, it is extremely difficult to click that thing, and not have the mouse move. Plus, it's quite stiff and hard to push, which gets annoying quickly. There's also no reason for it whatsoever. There is plenty of room around it for a couple regular buttons.
The front edge of the laptop lacks any bevel or chamfer, and can cut into the wrist. I personally ended up taking a knife and cutting down that edge. ( Remember, aluminum is NOT some super high-quality material like you hear so often these days. Especially since they use lower grade aluminum. Probably 50-54 or something similar. )
Programs crashed more on Mac than on PC. I noticed this the first day, and had it confirmed constantly in the classes. Some of the classrooms were Mac, others were PC. We used the same programs on both, and every single person in class saved about twice as often on the Macs because they were so much more likely to crash out.
The CD drive is not properly reinforced. It frequently bends and ends up scraping the disc inside.
There is no eject button, or manual eject for the CD drive. This was a bit of a nuisance at times, but became a real problem when I installed windows 7 onto the laptop. At one point, I had a disc in there and had to reboot...except I didn't know I had to have the disc out when I did that. I spent about an hour digging that stupid thing out while trying not to permanently damage anything.
Dual video chipset, but not really. Some genius somewhere decided it was worth having 2 video chipsets, but instead of making them the same to get the performance boost when you want of SLI, they made them 2 different chipsets. The idea being 1 for power tasks, and 1 for saving power. Just to change it though, you had to boot up, select to change, then reboot. Why not just have them the same card, and let me enable and disable them at will. Add in a simple underclocker and voila, power saving. This is what I would do on PC anyways. This would also mean you can have 1 fail on you ( which happens. ), and still get most of the use out of the laptop.
All of this was from the first day with the laptop. I used it for a full year, at which point I no longer needed the laptop for classes and promptly went back to my old Toshiba. Eventually I put Windows 7 on the laptop and passed it off to my mom:) Granted, I don't use any laptop at all any more. I have a custom built desktop PC, and a Galaxy S3. Anything serious I do on the desktop, and the S3 covers portability.
3
8
Bronze badge
Re: My Macbook experience, and observations of those around me.
My experience (MacBook Pro) is completely the opposite.
a pretty high failure rate
I have a lower sample size of 2, but none have ever failed.
Overheating is a massive issue
Not with my MacBook Pro, it isn't. It's a rare day when the fan turns on.
The trackpad is pretty low quality
Mine is excellent quality. I've never ever seen the cursor out of place.
To click the mouse, you have to push the entire trackpad down
Not on mine, you don't. In any case, it's quite rare that I need to click it - you can easily configure the trackpad to use soft taps and gestures, like using an iPad.
The front edge of the laptop lacks any bevel or chamfer
Mine does. I'd never even given it a moment's thought until you raised it.
Programs crashed more on Mac than on PC
In 18 months' use, I can count the number of program crashes on one hand.
The CD drive is not properly reinforced
Modern MacBooks don't have a CD drive. Yesterday's technology.
There is no eject button, or manual eject for the CD drive
Ditto.
Dual video chipset, but not really
Is this an issue on my MacBook? No
I use a PC at work all day long. But I take my MacBook in with me as we'll, because its so much nicer to use.
5
5
Silver badge
Re: My Macbook experience, and observations of those around me.
One has to wonder about the voracity of your post given a number of the errors above.
The Pro is an all aluminium device, with an internal slot loading DVD drive. You couldn't bend the drive if you tried. The eject button is on the keyboard, at the top right. The trackpad is all glass, capitative and configurable to accept light taps as clicks rather than full presses. It's generally regarded as the best trackpad on the market, the gold standard to which PCs aspire. There is only actually 1 video chipset, the other is Intel's integrated version (i.e. crap). The OS switches between the two transparently depending on load, no need to bother about manual tweaks, reboots etc. There are many PC laptops that tried the same trick, mostly with far less success.
6
1
Page:
This topic is closed for new posts.
Forums
|
{
"url": "http://forums.theregister.co.uk/forum/1/2013/09/17/apple_tops_all_windows_pc_in_customer_satisfaction/",
"source_domain": "forums.theregister.co.uk",
"snapshot_id": "crawl=CC-MAIN-2015-22",
"warc_metadata": {
"Content-Length": "155153",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:L2JXHCYPARJ6G4AJNDXO4JNVTJPTUYDN",
"WARC-Concurrent-To": "<urn:uuid:3f046251-5101-46e9-941d-3a3bdd8dbb1c>",
"WARC-Date": "2015-05-23T01:58:19Z",
"WARC-IP-Address": "50.57.15.204",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:7APWGPMEODGVNU2QFVAPQDQZGA2FQW5X",
"WARC-Record-ID": "<urn:uuid:67f3f0e1-199e-4147-ada8-64b51a685764>",
"WARC-Target-URI": "http://forums.theregister.co.uk/forum/1/2013/09/17/apple_tops_all_windows_pc_in_customer_satisfaction/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bb90d428-e3a9-4f07-a160-36bbc4fabced>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-206-219.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-22\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for May 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,
85,
86,
415,
416,
425,
426,
462,
463,
469,
470,
483,
484,
501,
502,
535,
536,
596,
597,
599,
601,
618,
619,
640,
641,
762,
763,
879,
880,
882,
884,
901,
902,
931,
932,
951,
952,
996,
997,
999,
1001,
1002,
1023,
1024,
1184,
1185,
1187,
1189,
1190,
1211,
1212,
1585,
1586,
1969,
1970,
2361,
2362,
2364,
2366,
2379,
2380,
2401,
2402,
2735,
2736,
2738,
2740,
2757,
2758,
2779,
2780,
3178,
3179,
3181,
3183,
3184,
3205,
3206,
3300,
3301,
3667,
3668,
3836,
3837,
3839,
3841,
3858,
3859,
3902,
3903,
3916,
3917,
3932,
3933,
3938,
3939,
3942,
3944,
3961,
3962,
4298,
4299,
4301,
4303,
4320,
4321,
4485,
4486,
4838,
4839,
4841,
4843,
4856,
4857,
4878,
4879,
5175,
5176,
5178,
5180,
5193,
5194,
5255,
5256,
5485,
5486,
5589,
5590,
5748,
5749,
5790,
5791,
5823,
5824,
6132,
6133,
6224,
6225,
6381,
6382,
6386,
6387,
6389,
6391,
6392,
6589,
6590,
6592,
6594,
6607,
6608,
6872,
6873,
6875,
6877,
6878,
6920,
6921,
7167,
7168,
7170,
7172,
7189,
7190,
7323,
7324,
7326,
7328,
7345,
7346,
7354,
7355,
7659,
7660,
7663,
7666,
7667,
7679,
7680,
7770,
7771,
8114,
8115,
8117,
8119,
8132,
8133,
8145,
8146,
8190,
8191,
8355,
8356,
8393,
8394,
8396,
8398,
8415,
8416,
8428,
8429,
8774,
8775,
8825,
8826,
8939,
8940,
8993,
8994,
9067,
9068,
9180,
9181,
9183,
9185,
9186,
9198,
9199,
9548,
9549,
9551,
9553,
9570,
9571,
9583,
9584,
9713,
9714,
9743,
9744,
9746,
9748,
9761,
9762,
9774,
9775,
10017,
10018,
10020,
10022,
10039,
10040,
10052,
10053,
10729,
10730,
10732,
10734,
10735,
10747,
10748,
11035,
11036,
11354,
11355,
11448,
11449,
11451,
11453,
11454,
11466,
11467,
11682,
11683,
11685,
11687,
11700,
11705,
11706,
11718,
11719,
12170,
12171,
12173,
12175,
12192,
12193,
12205,
12206,
12212,
12213,
12431,
12432,
13209,
13210,
13596,
13597,
14536,
14537,
15275,
15276,
15278,
15280,
15293,
15299,
15300,
15309,
15310,
15540,
15541,
15776,
15777,
15779,
15781,
15782,
15834,
15835,
16308,
16309,
16586,
16587,
16684,
16685,
16687,
16689,
16706,
16707,
16763,
16764,
16924,
16925,
16927,
16929,
16942,
16943,
16999,
17000,
17213,
17214,
17917,
17918,
18201,
18202,
18701,
18702,
18817,
18818,
19024,
19025,
19034,
19035,
19037,
19039,
19040,
19070,
19071,
19653,
19654,
19939,
19940,
20095,
20096,
20153,
20154,
20157,
20159,
20176,
20177,
20211,
20212,
20413,
20414,
20416,
20418,
20419,
20453,
20454,
20702,
20703,
20945,
20946,
20948,
20950,
20955,
20956,
20990,
20991,
21005,
21006,
21250,
21251,
21526,
21527,
21529,
21531,
21540,
21541,
21575,
21576,
21813,
21814,
21859,
21860,
21865,
21866,
21903,
21904,
21934,
21935,
21937,
21939,
21940,
21978,
21979,
22174,
22175,
22247,
22248,
22622,
22623,
22881,
22882,
23387,
23388,
23390,
23392,
23393,
23435,
23436,
23753,
23754,
23756,
23758,
23759,
23769,
23770,
23875,
23876,
23878,
23880,
23893,
23898,
23899,
23913,
23914,
23978,
23979,
23981,
23983,
23996,
23997,
24012,
24013,
24317,
24318,
24426,
24427,
24532,
24533,
24535,
24537,
24550,
24555,
24556,
24575,
24576,
24827,
24828,
24982,
24983,
24985,
24987,
24988,
25002,
25003,
25405,
25406,
25598,
25599,
25601,
25603,
25604,
25622,
25623,
25802,
25803,
26008,
26009,
26011,
26013,
26014,
26074,
26075,
26390,
26391,
26431,
26432,
26795,
26796,
27080,
27081,
27360,
27361,
27923,
27924,
28257,
28258,
28585,
28586,
28685,
28686,
29077,
29078,
29733,
29734,
30152,
30153,
30155,
30157,
30170,
30171,
30235,
30236,
30292,
30293,
30320,
30321,
30381,
30382,
30413,
30414,
30488,
30489,
30524,
30525,
30598,
30599,
30661,
30662,
30830,
30831,
30887,
30888,
30963,
30964,
31004,
31005,
31079,
31080,
31120,
31121,
31184,
31185,
31244,
31245,
31252,
31253,
31288,
31289,
31324,
31325,
31435,
31436,
31438,
31440,
31453,
31454,
31518,
31519,
31605,
31606,
32284,
32285,
32287,
32289,
32290,
32296,
32297,
32333,
32334
],
"line_end_idx": [
85,
86,
415,
416,
425,
426,
462,
463,
469,
470,
483,
484,
501,
502,
535,
536,
596,
597,
599,
601,
618,
619,
640,
641,
762,
763,
879,
880,
882,
884,
901,
902,
931,
932,
951,
952,
996,
997,
999,
1001,
1002,
1023,
1024,
1184,
1185,
1187,
1189,
1190,
1211,
1212,
1585,
1586,
1969,
1970,
2361,
2362,
2364,
2366,
2379,
2380,
2401,
2402,
2735,
2736,
2738,
2740,
2757,
2758,
2779,
2780,
3178,
3179,
3181,
3183,
3184,
3205,
3206,
3300,
3301,
3667,
3668,
3836,
3837,
3839,
3841,
3858,
3859,
3902,
3903,
3916,
3917,
3932,
3933,
3938,
3939,
3942,
3944,
3961,
3962,
4298,
4299,
4301,
4303,
4320,
4321,
4485,
4486,
4838,
4839,
4841,
4843,
4856,
4857,
4878,
4879,
5175,
5176,
5178,
5180,
5193,
5194,
5255,
5256,
5485,
5486,
5589,
5590,
5748,
5749,
5790,
5791,
5823,
5824,
6132,
6133,
6224,
6225,
6381,
6382,
6386,
6387,
6389,
6391,
6392,
6589,
6590,
6592,
6594,
6607,
6608,
6872,
6873,
6875,
6877,
6878,
6920,
6921,
7167,
7168,
7170,
7172,
7189,
7190,
7323,
7324,
7326,
7328,
7345,
7346,
7354,
7355,
7659,
7660,
7663,
7666,
7667,
7679,
7680,
7770,
7771,
8114,
8115,
8117,
8119,
8132,
8133,
8145,
8146,
8190,
8191,
8355,
8356,
8393,
8394,
8396,
8398,
8415,
8416,
8428,
8429,
8774,
8775,
8825,
8826,
8939,
8940,
8993,
8994,
9067,
9068,
9180,
9181,
9183,
9185,
9186,
9198,
9199,
9548,
9549,
9551,
9553,
9570,
9571,
9583,
9584,
9713,
9714,
9743,
9744,
9746,
9748,
9761,
9762,
9774,
9775,
10017,
10018,
10020,
10022,
10039,
10040,
10052,
10053,
10729,
10730,
10732,
10734,
10735,
10747,
10748,
11035,
11036,
11354,
11355,
11448,
11449,
11451,
11453,
11454,
11466,
11467,
11682,
11683,
11685,
11687,
11700,
11705,
11706,
11718,
11719,
12170,
12171,
12173,
12175,
12192,
12193,
12205,
12206,
12212,
12213,
12431,
12432,
13209,
13210,
13596,
13597,
14536,
14537,
15275,
15276,
15278,
15280,
15293,
15299,
15300,
15309,
15310,
15540,
15541,
15776,
15777,
15779,
15781,
15782,
15834,
15835,
16308,
16309,
16586,
16587,
16684,
16685,
16687,
16689,
16706,
16707,
16763,
16764,
16924,
16925,
16927,
16929,
16942,
16943,
16999,
17000,
17213,
17214,
17917,
17918,
18201,
18202,
18701,
18702,
18817,
18818,
19024,
19025,
19034,
19035,
19037,
19039,
19040,
19070,
19071,
19653,
19654,
19939,
19940,
20095,
20096,
20153,
20154,
20157,
20159,
20176,
20177,
20211,
20212,
20413,
20414,
20416,
20418,
20419,
20453,
20454,
20702,
20703,
20945,
20946,
20948,
20950,
20955,
20956,
20990,
20991,
21005,
21006,
21250,
21251,
21526,
21527,
21529,
21531,
21540,
21541,
21575,
21576,
21813,
21814,
21859,
21860,
21865,
21866,
21903,
21904,
21934,
21935,
21937,
21939,
21940,
21978,
21979,
22174,
22175,
22247,
22248,
22622,
22623,
22881,
22882,
23387,
23388,
23390,
23392,
23393,
23435,
23436,
23753,
23754,
23756,
23758,
23759,
23769,
23770,
23875,
23876,
23878,
23880,
23893,
23898,
23899,
23913,
23914,
23978,
23979,
23981,
23983,
23996,
23997,
24012,
24013,
24317,
24318,
24426,
24427,
24532,
24533,
24535,
24537,
24550,
24555,
24556,
24575,
24576,
24827,
24828,
24982,
24983,
24985,
24987,
24988,
25002,
25003,
25405,
25406,
25598,
25599,
25601,
25603,
25604,
25622,
25623,
25802,
25803,
26008,
26009,
26011,
26013,
26014,
26074,
26075,
26390,
26391,
26431,
26432,
26795,
26796,
27080,
27081,
27360,
27361,
27923,
27924,
28257,
28258,
28585,
28586,
28685,
28686,
29077,
29078,
29733,
29734,
30152,
30153,
30155,
30157,
30170,
30171,
30235,
30236,
30292,
30293,
30320,
30321,
30381,
30382,
30413,
30414,
30488,
30489,
30524,
30525,
30598,
30599,
30661,
30662,
30830,
30831,
30887,
30888,
30963,
30964,
31004,
31005,
31079,
31080,
31120,
31121,
31184,
31185,
31244,
31245,
31252,
31253,
31288,
31289,
31324,
31325,
31435,
31436,
31438,
31440,
31453,
31454,
31518,
31519,
31605,
31606,
32284,
32285,
32287,
32289,
32290,
32296,
32297,
32333,
32334,
32340
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 32340,
"ccnet_original_nlines": 569,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 5,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4379613995552063,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04514480009675026,
"rps_doc_frac_lines_end_with_ellipsis": 0.03684211149811745,
"rps_doc_frac_no_alph_words": 0.16226576268672943,
"rps_doc_frac_unique_words": 0.2528911530971527,
"rps_doc_mean_word_length": 4.261394500732422,
"rps_doc_num_sentences": 365,
"rps_doc_symbol_to_word_ratio": 0.005962519906461239,
"rps_doc_unigram_entropy": 6.179315090179443,
"rps_doc_word_count": 5880,
"rps_doc_frac_chars_dupe_10grams": 0.07319311797618866,
"rps_doc_frac_chars_dupe_5grams": 0.11988665908575058,
"rps_doc_frac_chars_dupe_6grams": 0.10100969672203064,
"rps_doc_frac_chars_dupe_7grams": 0.09214989840984344,
"rps_doc_frac_chars_dupe_8grams": 0.0872810035943985,
"rps_doc_frac_chars_dupe_9grams": 0.08313045650720596,
"rps_doc_frac_chars_top_2gram": 0.0047890800051391125,
"rps_doc_frac_chars_top_3gram": 0.004150540102273226,
"rps_doc_frac_chars_top_4gram": 0.0035918098874390125,
"rps_doc_books_importance": -2648.939453125,
"rps_doc_books_importance_length_correction": -2648.939453125,
"rps_doc_openwebtext_importance": -1805.968994140625,
"rps_doc_openwebtext_importance_length_correction": -1805.968994140625,
"rps_doc_wikipedia_importance": -1165.8759765625,
"rps_doc_wikipedia_importance_length_correction": -1165.8759765625
},
"fasttext": {
"dclm": 0.10583239793777466,
"english": 0.9693648815155029,
"fineweb_edu_approx": 1.1954501867294312,
"eai_general_math": 0.23260682821273804,
"eai_open_web_math": 0.24658137559890747,
"eai_web_code": 0.05573194846510887
}
}
|
{
"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": "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": "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
|
-8,404,911,044,354,680,000 |
Cómo hacer un repetidor WiFi de forma fácil usando un segundo router
Por Ricky Fernández |
En ocasiones nuestra señal WiFi no llega con toda la potencia necesaria para tener una conexión decente. Existen muchas alternativas para ampliar nuestra señal WiFi, pero si tienes un router por casa, puedes darle una segunda vida y ahorrarnos un dinero.
La función que vamos a usar suelen venir prácticamente en todos los router donde los pasos son muy sencillo donde conseguiremos ampliar nuestra señal WiFi y para evitar cortes o directamente hacer llegar la señal a lugares que antes no llegaba.
Si tienes un WiFi lento puede que sea porque no has colocado bien tu router
Además de ampliar la señal WiFi podremos conectar nuestra consola, ordenador o cualquier dispositivo que requiera una conexión por cable de red ya que podremos usar un segundo router en la habitación que deseemos.
¿Qué materiales necesito para hacer un repetidor WiFi con un segundo router?
Imagen - Cómo hacer un repetidor WiFi de forma fácil usando un segundo router
Logicamente necesitaremos tener acceso al router principal, un router secundario, dos cables de red y un ordenador. El ordenador será para poder configurar bien la parte interna de nuestro router, es posible hacerlo desde un tablet o smarphone, pero se aconsejamos hacerlo con un ordenador.
La idea es conectar nuestro router secundario al router principal mediante un cable de red (RJ45), normalmente estos cables vienen dentro de las cajas de los router, ya sean libres o de la compañía donde hemos contratado internet.
En nuestro caso vamos a usar como router secundario un Tenda modelo W308R, cada modelo de router tendrá una interfaz diferente al igual que las claves de acceso. Básicamente son todos iguales pero tendrán las opciones en diferentes apartados.
Pasos a seguir para configurar nuestro repetidor WiFi con un router secundario
Lo primero que tenemos que hacer es restaurar de fábrica el router secundario para eliminar cualquier configuración previa, es realmente sencillo. Normalmente en la parte posterior suele venir un botón o un pequeño agujero que pone "RESET".
Imagen - Cómo hacer un repetidor WiFi de forma fácil usando un segundo router
Solo habrá que pulsarlo unos segundos (con el router encendido) y las luces comenzarán a dar signos de que se está restaurando a los valores de fábrica. Cuando el proceso finalice lo conectaremos a nuestro router principal con el cable de red.
Una vez restaurado y conectado a nuestro router principal, lo conectamos también a nuestro ordenador personal mediante otra cable de red.
Como blindar el WiFi de casa sin ser un experto
El esquema sería el siguiente, desde el router principal sale un cable de red al router secundario, del router secundario un cable de red a nuestro ordenador personal.
Con todo conectado vamos a nuestro ordenador personal y accedemos al router secundario mediante la dirección 192.168.0.1 e introducimos el usuario y contraseña (normalmente ADMIN y 12345) suele venir en la caja del mismo, así que no te preocupes.
Imagen - Cómo hacer un repetidor WiFi de forma fácil usando un segundo router
En la interfaz de nuestro router secundario tenemos que buscar la opción "WDS BRIDGE MODE". La podemos encontrar en "WIRELESS, WIRELESS BASIC SETTINGS". Una vez accedido y marcamos la opción WDS BRIDGE Mode, que será la que reciba la configuración de nuestro router principal. Digamos que será un copiar y pegar de configuraciones.
Imagen - Cómo hacer un repetidor WiFi de forma fácil usando un segundo router
A continuación nos vamos a nuestro router principal y pulsamos el botón "WPS" este botón estará activo unos minutos para recibir cualquier petición de algún dispositivo que requiera una configuración automática.
Imagen - Cómo hacer un repetidor WiFi de forma fácil usando un segundo router
Una vez pulsado, volvemos a la interfaz de nuestro router secundario y pulsamos el botón de "Open Scan", seleccionamos la de nuestro router principal y automáticamente empezará el emparejamiento de ambos.
Imagen - Cómo hacer un repetidor WiFi de forma fácil usando un segundo router
Tras unos segundos el botón WPS se apagará y esto significará que ha terminado el proceso, nuestro router secundario adoptará todos los parámetros (incluso el nombre de la WiFi) para crear una sola red WiFi potenciada. Si queréis comprobar que todo ha salido bien, solo hay que revisar el nombre de la red WiFi que ha adoptado nuestro router secundario en la interfaz web.
Cerramos nuestro navegador y colocamos nuestro router secundario ya configurado en cualquier parte de nuestra casa. Si queremos añadir algún smartphone o tablet a la red WiFi seguiremos usando la misma contraseña que la del router principal, así de sencillo.
Cada router tiene una configuración diferente con lo que es posible que las opciones descritas puedan variar, recomendamos tener un router libre para evitaros complicaciones con las configuraciones de vuestro operador.
Compra: Router Tenda (Amazon)
¿Te ha resultado sencillo estos pasos? ¿Has probado otros métodos para ampliar la WiFi de casa?
Mejora la señal WiFi en un minuto
Comentarios
Deja tu opinión o comentario. También puedes preguntar cualquier duda en el foro.
• Rob Lebo | El 18 Nov 2016, 09:55
Mi pregunta sería la siguiente:
¿Sería posible usar este segundo router como un diverisificador de señal para colocar una segunda clave de acceso para usuarios invitados? o ¿me he calentado la cabeza?
Gracias
• Sr Moaner | El 16 Nov 2017, 21:47
Hola. Muy interesante tu artículo. Una pregunta por favor:
Ya finalizando el artículo dices: "Cerramos nuestro navegador y colocamos nuestro router secundario ya configurado en cualquier parte de nuestra casa"
No es necesario que este conectado al router principal?
Puedo ponerlo, por ejemplo, en una planta superior conectado a red eléctrica. Me valdría con eso?
Perdón por mi ignorancia.
Trato de utilizar un router de movistar antiguo (que ya he configurado) para que me sirva como aplificador de señal en la planta superior de la casa, pero claro, si tengo que tenerlo conectado al router principal...necesitaría mucho cableado.
Mila gracias!!!
|
{
"url": "https://www.elgrupoinformatico.com/como-hacer-repetidor-wifi-forma-facil-usando-segundo-router-t32469.html",
"source_domain": "www.elgrupoinformatico.com",
"snapshot_id": "crawl=CC-MAIN-2019-22",
"warc_metadata": {
"Content-Length": "66065",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OZ6ZHQYXJRK3CF7TDOJBVCVMPYMPAX33",
"WARC-Concurrent-To": "<urn:uuid:f139f2d5-f6d3-4dff-8d5e-41cf6b6ce60e>",
"WARC-Date": "2019-05-23T21:13:50Z",
"WARC-IP-Address": "82.223.18.83",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QN455SF6KQRE6UG74X62YNMN4DNYP6U7",
"WARC-Record-ID": "<urn:uuid:49afcaef-c0e8-400b-9fd1-ce4b0fa8a470>",
"WARC-Target-URI": "https://www.elgrupoinformatico.com/como-hacer-repetidor-wifi-forma-facil-usando-segundo-router-t32469.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:70cedac2-99f2-4dfa-afa2-d1f3f777439a>"
},
"warc_info": "isPartOf: CC-MAIN-2019-22\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-146-226-231.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,
69,
70,
92,
93,
348,
349,
594,
595,
671,
672,
886,
887,
964,
965,
1043,
1044,
1335,
1336,
1567,
1568,
1811,
1812,
1891,
1892,
2133,
2134,
2212,
2213,
2457,
2458,
2596,
2597,
2645,
2646,
2814,
2815,
3062,
3063,
3141,
3142,
3474,
3475,
3553,
3554,
3766,
3767,
3845,
3846,
4051,
4052,
4130,
4131,
4504,
4505,
4764,
4765,
4984,
4985,
5015,
5016,
5112,
5113,
5147,
5148,
5160,
5161,
5243,
5280,
5316,
5489,
5490,
5502,
5540,
5603,
5758,
5818,
5920,
5950,
6197,
6198
],
"line_end_idx": [
69,
70,
92,
93,
348,
349,
594,
595,
671,
672,
886,
887,
964,
965,
1043,
1044,
1335,
1336,
1567,
1568,
1811,
1812,
1891,
1892,
2133,
2134,
2212,
2213,
2457,
2458,
2596,
2597,
2645,
2646,
2814,
2815,
3062,
3063,
3141,
3142,
3474,
3475,
3553,
3554,
3766,
3767,
3845,
3846,
4051,
4052,
4130,
4131,
4504,
4505,
4764,
4765,
4984,
4985,
5015,
5016,
5112,
5113,
5147,
5148,
5160,
5161,
5243,
5280,
5316,
5489,
5490,
5502,
5540,
5603,
5758,
5818,
5920,
5950,
6197,
6198,
6217
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6217,
"ccnet_original_nlines": 80,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10388436913490295,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014453480020165443,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11653117090463638,
"rps_doc_frac_unique_words": 0.368794322013855,
"rps_doc_mean_word_length": 5.179331302642822,
"rps_doc_num_sentences": 46,
"rps_doc_symbol_to_word_ratio": 0.0009033399983309209,
"rps_doc_unigram_entropy": 5.159552574157715,
"rps_doc_word_count": 987,
"rps_doc_frac_chars_dupe_10grams": 0.12656494975090027,
"rps_doc_frac_chars_dupe_5grams": 0.15297339856624603,
"rps_doc_frac_chars_dupe_6grams": 0.14025822281837463,
"rps_doc_frac_chars_dupe_7grams": 0.12656494975090027,
"rps_doc_frac_chars_dupe_8grams": 0.12656494975090027,
"rps_doc_frac_chars_dupe_9grams": 0.12656494975090027,
"rps_doc_frac_chars_top_2gram": 0.04381847009062767,
"rps_doc_frac_chars_top_3gram": 0.026408450677990913,
"rps_doc_frac_chars_top_4gram": 0.03129889816045761,
"rps_doc_books_importance": -506.05303955078125,
"rps_doc_books_importance_length_correction": -506.05303955078125,
"rps_doc_openwebtext_importance": -297.5146789550781,
"rps_doc_openwebtext_importance_length_correction": -297.5146789550781,
"rps_doc_wikipedia_importance": -206.6072235107422,
"rps_doc_wikipedia_importance_length_correction": -206.6072235107422
},
"fasttext": {
"dclm": 0.8769041895866394,
"english": 0.0015696099726483226,
"fineweb_edu_approx": 1.7211755514144897,
"eai_general_math": 0.0001892400032375008,
"eai_open_web_math": 0.30096834897994995,
"eai_web_code": 0.4350786805152893
}
}
|
{
"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.3846",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,790,333,726,034,559,000 |
tradosfilterframeworkjavaapi.dll
Application using this process: SDL Trados
tradosfilterframeworkjavaapi.dll
Application using this process: SDL Trados
tradosfilterframeworkjavaapi.dll
Click here to run a scan if you are experiencing issues with this process.
Application using this process: SDL Trados
Recommended: Scan your system for invalid registry entries.
What is tradosfilterframeworkjavaapi.dll doing on my computer?
TradosFilterFrameworkJavaApi.dll is a common file used by the SDL Trados 2007 translation software.
Non-system processes like tradosfilterframeworkjavaapi.dll originate from software you installed on your system. Since most applications store data in your system's registry, it is likely that over time your registry suffers fragmentation and accumulates invalid entries which can affect your PC's performance. It is recommended that you check your registry to identify slowdown issues.
tradosfilterframeworkjavaapi.dll
In order to ensure your files and data are not lost, be sure to back up your files online. Using a cloud backup service will allow you to safely secure all your digital files. This will also enable you to access any of your files, at any time, on any device.
Is tradosfilterframeworkjavaapi.dll harmful?
This process is considered safe. It is unlikely to pose any harm to your system. Scan your system now to identify issues with this process and services that can be safely removed.
tradosfilterframeworkjavaapi.dll is a safe process
Can I stop or remove tradosfilterframeworkjavaapi.dll?
Most non-system processes that are running can be stopped because they are not involved in running your operating system. Scan your system now to identify unused processes that are using up valuable resources. tradosfilterframeworkjavaapi.dll is used by 'SDL Trados'.This is an application created by 'SDL'. To stop tradosfilterframeworkjavaapi.dll permanently uninstall 'SDL Trados' from your system. Uninstalling applications can leave invalid registry entries, accumulating over time. Run a free scan to find out how to optimize software and system performance.
Is tradosfilterframeworkjavaapi.dll CPU intensive?
This process is not considered CPU intensive. However, running too many processes on your system may affect your PC’s performance. To reduce system overload, you can use the Microsoft System Configuration Utility to manually find and disable processes that launch upon start-up. Alternatively, download PC Mechanic to automatically scan and identify any PC issues.
Why is tradosfilterframeworkjavaapi.dll giving me errors?
Process related issues are usually related to problems encountered by the application that runs it. A safe way to stop these errors is to uninstall the application and run a system scan to automatically identify any PC issues.
Browse process directory by name
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z #
Process Library is the unique and indispensable process listing database since 2004 Now counting 140,000 processes and 55,000 DLLs. Join and subscribe now!
System Tools
SpeedUpMyPC
PC Mechanic
Toolbox
ProcessQuicklink
|
{
"url": "http://www.processlibrary.com/en/directory/files/tradosfilterframeworkjavaapi/1556/",
"source_domain": "www.processlibrary.com",
"snapshot_id": "crawl=CC-MAIN-2017-51",
"warc_metadata": {
"Content-Length": "44979",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2ICW6HWSQO7LLFHQ6INGI5UN3URTAMM3",
"WARC-Concurrent-To": "<urn:uuid:8078ea2e-4109-48c3-9d5d-36b87c13f7a1>",
"WARC-Date": "2017-12-13T17:08:24Z",
"WARC-IP-Address": "79.125.119.199",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:TDBFLBAPS6MOJRM3PTISMNMIPEG7SQFJ",
"WARC-Record-ID": "<urn:uuid:ee5d11a7-1118-472d-a851-ea8b86c7b664>",
"WARC-Target-URI": "http://www.processlibrary.com/en/directory/files/tradosfilterframeworkjavaapi/1556/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b30c8603-50c3-48b8-95ef-161ec1d14394>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-216-194-6.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,
33,
34,
77,
78,
79,
112,
113,
156,
157,
158,
191,
192,
193,
268,
269,
312,
313,
373,
374,
437,
438,
538,
539,
926,
959,
960,
1219,
1220,
1265,
1266,
1446,
1497,
1498,
1553,
1554,
2119,
2120,
2171,
2172,
2537,
2538,
2596,
2597,
2824,
2825,
2826,
2827,
2860,
2861,
2862,
2916,
2917,
2918,
2919,
2920,
2921,
2922,
2923,
2924,
3080,
3081,
3082,
3095,
3096,
3108,
3120,
3121,
3129,
3130
],
"line_end_idx": [
33,
34,
77,
78,
79,
112,
113,
156,
157,
158,
191,
192,
193,
268,
269,
312,
313,
373,
374,
437,
438,
538,
539,
926,
959,
960,
1219,
1220,
1265,
1266,
1446,
1497,
1498,
1553,
1554,
2119,
2120,
2171,
2172,
2537,
2538,
2596,
2597,
2824,
2825,
2826,
2827,
2860,
2861,
2862,
2916,
2917,
2918,
2919,
2920,
2921,
2922,
2923,
2924,
3080,
3081,
3082,
3095,
3096,
3108,
3120,
3121,
3129,
3130,
3146
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3146,
"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.3272727429866791,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07818181812763214,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14000000059604645,
"rps_doc_frac_unique_words": 0.45614033937454224,
"rps_doc_mean_word_length": 5.65350866317749,
"rps_doc_num_sentences": 47,
"rps_doc_symbol_to_word_ratio": 0.0018181799678131938,
"rps_doc_unigram_entropy": 4.872372150421143,
"rps_doc_word_count": 456,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1035686582326889,
"rps_doc_frac_chars_dupe_6grams": 0.1035686582326889,
"rps_doc_frac_chars_dupe_7grams": 0.08960434049367905,
"rps_doc_frac_chars_dupe_8grams": 0.0640031024813652,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.029868109151721,
"rps_doc_frac_chars_top_3gram": 0.023273859173059464,
"rps_doc_frac_chars_top_4gram": 0.03141970932483673,
"rps_doc_books_importance": -199.00392150878906,
"rps_doc_books_importance_length_correction": -199.00392150878906,
"rps_doc_openwebtext_importance": -124.31452941894531,
"rps_doc_openwebtext_importance_length_correction": -124.31452941894531,
"rps_doc_wikipedia_importance": -109.36075592041016,
"rps_doc_wikipedia_importance_length_correction": -109.36075592041016
},
"fasttext": {
"dclm": 0.03790384903550148,
"english": 0.8807795643806458,
"fineweb_edu_approx": 1.7203786373138428,
"eai_general_math": 0.023132679983973503,
"eai_open_web_math": 0.06927776336669922,
"eai_web_code": 0.006982089951634407
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.457",
"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": "1",
"label": "Factual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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
|
278,011,758,840,751,260 |
PHP 5.6.18 is available
log1p
(PHP 4 >= 4.1.0, PHP 5, PHP 7)
log1p Berechent log(1 + number) mit erhöhter Genauigkeit
Beschreibung
float log1p ( float $number )
Warnung
Diese Funktion ist EXPERIMENTELL. Das Verhalten, der Funktionsname und alles Andere, was hier dokumentiert ist, kann sich in zukünftigen PHP-Versionen ohne Ankündigung ändern. Seien Sie gewarnt und verwenden Sie diese Funktion auf eigenes Risiko.
log1p() berechnet log(1 + number) auf eine Weise die auch dann noch genaue Ergebnisse liefert wenn der Wert von number nur sehr klein ist. log() liefert in solchen Fällen auf Grund von Rundungsfehlern oft nur den Wert von log(1) und vernachlässigt die Nachkommastellen.
Parameter-Liste
number
Der zu verarbeitende Wert
Rückgabewerte
log(1 + number)
Changelog
Version Beschreibung
5.3.0 Die Funktion ist nun auf allen Plattformen verfügbar.
Siehe auch
• expm1() - Exponentialfunktion mit erhöhter Genauigkeit
• log() - Logarithmus
• log10() - Dekadischer Logarithmus
add a note add a note
User Contributed Notes 1 note
up
3
Anonymous
13 years ago
Note that the benefit of this function for small argument values is lost if PHP is compiled against a C library that that not have builtin support for the log1p() function.
In this case, log1p() will be compiled by using log() instead, and the precision of the result will be identical to log(1), i.e. it will always be 0 for small numbers.
Sample log1p(1.0e-20):
- returns 0.0 if log1p() is approximated by using log()
- returns something very near from 1.0e-20, if log1p() is supported by the underlying C library.
One way to support log1p() correctly on any platform, so that the magnitude of the expected result is respected:
function log1p($x) {
return ($x>-1.0e-8 && $x<1.0e-8) ? ($x - $x*$x/2) : log(1+$x);
}
If you want better precision, you may use a better limited development, for small positive or negative values of x:
log(1+x) = x - x^2/2 + x^3/3 - ... + (-1)^(n-1)*x^n/n + ...
(This serial sum converges only for values of x in [0 ... 1] inclusive, and the ^ operator in the above formula means the exponentiation operator, not the PHP xor operation)
Note that log1p() is undefined for arguments lower than or equal to -1, and that the implied base of the log function is the Neperian "e" constant.
To Top
|
{
"url": "http://docs.php.net/manual/de/function.log1p.php",
"source_domain": "docs.php.net",
"snapshot_id": "crawl=CC-MAIN-2016-07",
"warc_metadata": {
"Content-Length": "30365",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WGJ3TAHCA5RJZP6G3LOE5MMXAPHRSRS4",
"WARC-Concurrent-To": "<urn:uuid:d2fa02c4-484a-413e-8d8d-e163fcd030bc>",
"WARC-Date": "2016-02-10T15:27:25Z",
"WARC-IP-Address": "92.48.119.85",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:VLLZNZMF7F7TNUO275EMWZWQUUHEN4WB",
"WARC-Record-ID": "<urn:uuid:a8df3b8a-9dbd-472c-88c8-1e99121ebdea>",
"WARC-Target-URI": "http://docs.php.net/manual/de/function.log1p.php",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d2fd5a40-de37-4d6c-b764-cb0b0b978a35>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-236-182-209.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-07\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for February 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
24,
25,
31,
32,
63,
64,
121,
122,
135,
136,
166,
174,
175,
422,
423,
693,
694,
710,
711,
718,
719,
745,
746,
760,
761,
777,
778,
788,
789,
810,
870,
871,
882,
883,
942,
966,
1004,
1005,
1027,
1028,
1058,
1059,
1062,
1064,
1074,
1087,
1260,
1261,
1429,
1452,
1508,
1605,
1606,
1719,
1720,
1741,
1804,
1806,
1807,
1923,
1924,
1984,
1985,
2159,
2160,
2308
],
"line_end_idx": [
24,
25,
31,
32,
63,
64,
121,
122,
135,
136,
166,
174,
175,
422,
423,
693,
694,
710,
711,
718,
719,
745,
746,
760,
761,
777,
778,
788,
789,
810,
870,
871,
882,
883,
942,
966,
1004,
1005,
1027,
1028,
1058,
1059,
1062,
1064,
1074,
1087,
1260,
1261,
1429,
1452,
1508,
1605,
1606,
1719,
1720,
1741,
1804,
1806,
1807,
1923,
1924,
1984,
1985,
2159,
2160,
2308,
2314
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2314,
"ccnet_original_nlines": 66,
"rps_doc_curly_bracket": 0.0008643000037409365,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.22684310376644135,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018903590738773346,
"rps_doc_frac_lines_end_with_ellipsis": 0.014925369992852211,
"rps_doc_frac_no_alph_words": 0.34215500950813293,
"rps_doc_frac_unique_words": 0.5767045617103577,
"rps_doc_mean_word_length": 4.954545497894287,
"rps_doc_num_sentences": 28,
"rps_doc_symbol_to_word_ratio": 0.0056710802018642426,
"rps_doc_unigram_entropy": 5.0408477783203125,
"rps_doc_word_count": 352,
"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.017201829701662064,
"rps_doc_frac_chars_top_3gram": 0.0263761505484581,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -208.3308563232422,
"rps_doc_books_importance_length_correction": -208.3308563232422,
"rps_doc_openwebtext_importance": -137.1015167236328,
"rps_doc_openwebtext_importance_length_correction": -137.1015167236328,
"rps_doc_wikipedia_importance": -90.52562713623047,
"rps_doc_wikipedia_importance_length_correction": -90.52562713623047
},
"fasttext": {
"dclm": 0.17011326551437378,
"english": 0.18302661180496216,
"fineweb_edu_approx": 1.5952860116958618,
"eai_general_math": 0.6302235722541809,
"eai_open_web_math": 0.5356550216674805,
"eai_web_code": 0.1430400013923645
}
}
|
{
"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": "512.7",
"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": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "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,693,152,772,055,590,700 |
You are viewing documentation for the development version, it may be incomplete.
Join our translation project and help translate Zabbix documentation into your native language.
5 Encoding of returned values
Zabbix server expects every returned text value in the UTF8 encoding. This is related to any type of checks: Zabbix agent, SSH, Telnet, etc.
Different monitored systems/devices and checks can return non-ASCII characters in the value. For such cases, almost all possible zabbix keys contain an additional item key parameter - <encoding>. This key parameter is optional but it should be specified if the returned value is not in the UTF8 encoding and it contains non-ASCII characters. Otherwise the result can be unexpected and unpredictable.
A description of behavior with different database backends in such cases follows.
MySQL
If a value contains a non-ASCII character in non UTF8 encoding - this character and the following will be discarded when the database stores this value. No warning messages will be written to the zabbix_server.log.
Relevant for at least MySQL version 5.1.61
PostgreSQL
If a value contains a non-ASCII character in non UTF8 encoding - this will lead to a failed SQL query (PGRES_FATAL_ERROR:ERROR invalid byte sequence for encoding) and data will not be stored. An appropriate warning message will be written to the zabbix_server.log.
Relevant for at least PostgreSQL version 9.1.3
|
{
"url": "https://www.zabbix.com/documentation/devel/en/manual/appendix/items/encoding_of_values",
"source_domain": "www.zabbix.com",
"snapshot_id": "CC-MAIN-2023-23",
"warc_metadata": {
"Content-Length": "197903",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6CX3TZY32KJBNCAY3PNP6O5NAA37XVFC",
"WARC-Concurrent-To": "<urn:uuid:2fbf8e9f-8686-480b-8eb5-4d78823e44e6>",
"WARC-Date": "2023-06-08T11:44:56Z",
"WARC-IP-Address": "104.26.7.148",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WFRK6JGAWBFYWWHDBFQXGOZGNRTTLOJ4",
"WARC-Record-ID": "<urn:uuid:4c784227-22ec-4614-82d5-05609e2718d6>",
"WARC-Target-URI": "https://www.zabbix.com/documentation/devel/en/manual/appendix/items/encoding_of_values",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2f05e6e4-8edf-4fde-b169-a3f38561ffa8>"
},
"warc_info": "isPartOf: CC-MAIN-2023-23\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-188\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,
81,
177,
178,
208,
209,
350,
351,
751,
752,
834,
835,
841,
842,
1057,
1100,
1101,
1112,
1113,
1378
],
"line_end_idx": [
81,
177,
178,
208,
209,
350,
351,
751,
752,
834,
835,
841,
842,
1057,
1100,
1101,
1112,
1113,
1378,
1424
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1424,
"ccnet_original_nlines": 19,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4060150384902954,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04887218028306961,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1654135286808014,
"rps_doc_frac_unique_words": 0.5299538969993591,
"rps_doc_mean_word_length": 5.322580814361572,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.480947971343994,
"rps_doc_word_count": 217,
"rps_doc_frac_chars_dupe_10grams": 0.18354977667331696,
"rps_doc_frac_chars_dupe_5grams": 0.18354977667331696,
"rps_doc_frac_chars_dupe_6grams": 0.18354977667331696,
"rps_doc_frac_chars_dupe_7grams": 0.18354977667331696,
"rps_doc_frac_chars_dupe_8grams": 0.18354977667331696,
"rps_doc_frac_chars_dupe_9grams": 0.18354977667331696,
"rps_doc_frac_chars_top_2gram": 0.041558440774679184,
"rps_doc_frac_chars_top_3gram": 0.041558440774679184,
"rps_doc_frac_chars_top_4gram": 0.02943723089993,
"rps_doc_books_importance": -106.97138977050781,
"rps_doc_books_importance_length_correction": -105.69985961914062,
"rps_doc_openwebtext_importance": -38.56123352050781,
"rps_doc_openwebtext_importance_length_correction": -38.56123352050781,
"rps_doc_wikipedia_importance": -49.020328521728516,
"rps_doc_wikipedia_importance_length_correction": -42.963706970214844
},
"fasttext": {
"dclm": 0.22360950708389282,
"english": 0.7209964990615845,
"fineweb_edu_approx": 2.409245729446411,
"eai_general_math": 0.3144601583480835,
"eai_open_web_math": 0.1369529366493225,
"eai_web_code": 0.7865126729011536
}
}
|
{
"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": "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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,525,318,188,096,828,000 |
Author Archive for CSH – Page 5
Search Engines – use with care
Search engine - use with care
In previous articles we’ve mentioned that as well as watching out for computer viruses, you need to watch out for ‘Potentially Unwanted Programs’- technically legal software used maliciously which may install a program without your permission, change your search engine, tracks what you are doing or many other things.
The people behind this malware are getting more clever in finding ways to get their software onto your computer and are even using search engines to help them – search engines that everyone uses every day.
Unfortunately we still find customers that have been misled when searching and have unwittingly gone to the wrong kind of website to download something from.
Check the actual website address
It may sound obvious, but when reading the search results, check the website address itself and not just the title or wording. You would be surprised how many people only look at the title or briefly read the paragraph under it and it is common that people have searched for something on a search engine, (such as printer software drivers for example) and some of the results are not genuine websites. The website addresses may be very similar, such as ‘hp-drivers.com’ instead of the correct ‘hp.com’ but they will not be the website that you want.
Some of these ‘almost’ websites are genuine, but many are not and when downloading from them, they can add unwanted programs (or worse) to what you download. As a lot of these unwanted programs are not illegal as such, they can sometimes be missed by antivirus software.
How do you avoid going to the wrong search result?
The important thing to remember is that you should not automatically assume that all the results of any search are genuine. You need to be careful what you click on, as well as what you download.
As well as being extra careful if you see the website address is not what you expect, many antivirus programs automatically check to see if a website has been reported as a potential danger and if so, will warn you. Sometimes the search engine itself may warn you too, but you cannot rely on being warned every time.
Antivirus programs may show a green icon alongside the website entry in the search list, telling you that the website is ok, which is useful – but that doesn’t mean that you must avoid any results which do not have the green icon. Many people are not aware that a website that does not have the green icon, may still be alright to visit – the fact that they do not have a green icon may just mean that they have not been added to the antivirus program ‘green’ list yet.
Stick to the original websites where possible.
If you are looking for software drivers for your computer, stick to the manufacturer website – this will ensure that you have the most up to date and malware-free download.
If you do not go to a manufacturer website to download something, try not to download drivers or programs from third party sites unless you have to and then only when they are well-known sites.
So called ‘Peer to Peer’ (file sharing) sites can be particularly problematic and again, you need to be choosy where you download from.
So long as you treat search engine results with as much caution as anything else on the web, you will be adding to your computer security. You don’t have to be paranoid – just be careful!
Share..Share on FacebookShare on Google+Tweet about this on TwitterShare on LinkedInPin on PinterestPrint this pageEmail this to someone
Computer jargon explained
computer jargon
If you could afford it, would you buy an expensive car if you only drove it to the supermarket and no-where else? Of course not – you wouldn’t not want to pay for engine capability that you are not using, so why waste money?
The same applies to computers – don’t let sales jargon and the ‘latest and greatest’ specification fool you into thinking that you need to overspend. As we sell laptop and desktop computers, this is something we explain to customers every day.
Of course, Technology is always advancing but if you are using a computer just to go on the internet and do basic things like type documents, then you simply don’t need a high specification computer. Yes, a high specification computer is nice to have and if you choose to, you can go for what you can afford – just don’t get distracted into unnecessarily paying for more than you actually need.
Here are a few things that explain the jargon used in computing: –
‘Random Access Memory’ (RAM)
‘RAM’ is made of computer chips that temporarily store information when you switch your computer on and is vital for its usability and reliability – think of it as your desk, the bigger the desk the more work you can do. The current standard is 4GB of RAM, which is fine to run Windows and do everyday tasks. 8GB is now becoming the standard for business machines and above that is needed for people doing specialist work, such as those using ‘Virtual Machines’, or video and image editing programs, etc.
Above that 4GB or 8GB, if you are just doing everyday things with your computer then a lot of that ‘RAM’ is just sitting there doing nothing.
Hard Drive sizes
Similarly the Hard Drive standard at the moment is 500GB of storage and unless you do the things mentioned above, this size hard drive is all you need (especially if you are backing up externally – you are, aren’t you?!). Having a computer hard drive that’s double that sounds good, but if it is not filled up very much then why have it. In some cases a larger hard drive can make certain things take longer, for example when performing computer maintenance or disk scanning by a security program.
Computer Processors
The computer processor is the hard working component that dictates a lot of the speed and potential of the machine. The most common processors today are made by a company called Intel and the least powerful of their processor line up is a ‘Celeron’, then ‘Pentium’, then the ‘Core i3’, ’i5’ and ‘i7’.
The Core i3 is the standard processor for business computers, although more homes are using it too especially where more intensive programs are used, such as Photoshop.
The less powerful processors will also work and many people do use them, but there is a reduction in performance to be aware of.
‘i5’ processors tend to be used by ‘gamers’ and those tasks needing serious resources, such as speech recognition, Virtual Machines, etc.
‘i7’ processors are also used by gamers but are mainly specialist processors, are extremely expensive and also way more powerful than most home and business users need – it would be like having a sports car that never went above 30mph!
These are the three most important things to look for when looking to buy another computer. After these factors, the next important points are the reputation of the manufacturer as well as the price – genuine bargain or not?
So the next time you are in the market for a computer, don’t be blinded by science or the sales jargon – research what you need and stick to it, unless it’s a real bargain!
Call us on 01455 209505 for more advice and no obligation quotes.
Share..Share on FacebookShare on Google+Tweet about this on TwitterShare on LinkedInPin on PinterestPrint this pageEmail this to someone
Should businesses buy a Business or Consumer grade computer?
consumer or business grade computers
Businesses – should you buy a Consumer or Business PC? Before buying a computer for work, it’s important to consider whether your best bet is to get a consumer model or one built specifically for business use.
You’ve probably seen business computers with the same brand name that you have at home, but that’s where the similarities end. Investing in the right system now will pay off long term, saving you time, money and a lot of frustration. Here’s what you need to know to make the best choice for your business and budget.
Business-class Features
The operating system that comes pre-installed on a business-class computer will have features the consumer options don’t, including the ability to join corporate networks. Computers designed for home use come with Windows Home or Starter editions, which may require hours of expert assistance to link into a secure business network.
When you invest in a business computer, you may want certain inclusions built-in and ready to go – those include features that will make your network more secure and staff more productive. For example, fingerprint readers, remote desktop software and data encryption tools are available.
Usage Requirements
Work out how often you’ll be using the computer for business. If the computer is mostly for home use and only occasionally for work, then a consumer PC with the appropriate work software and settings may be fine. On the other hand, a computer that is mostly for business use should be a business-class computer, not just for security but also build quality reasons.
Build quality and Reliability
It’s probably no surprise that consumer PCs don’t have the same build quality as business ones. In fact, consumer models have a lower expected lifespan – they just aren’t built to last. Business-class computers are built to last longer, with higher quality components and rigorous testing at every level. Most parts (if not all) are name-brand with an emphasis on reliability and long term durability.
Warranty and Service
Unfortunately when a consumer PC fails, the burden is on the owner to send it away for repairs, unless you have a special deal or have bought an extension to the normal warranty. The terms of the warranty will usually state that any other attempt to repair it will void that warranty. Repairs can then take weeks and often involve a frustrating process of paperwork and following up.
Contrast that with what happens when a business computer needs service – on a business warranty it is common for the manufacturer’s technicians to come to you and fix it – if not same day then next business day. If it has to go back to the manufacturer, the time away from you is much shorter than for a consumer warranty repair. Business users enjoy a professional experience with priority status and a dedicated support line, all designed to reduce down-time and get you operational, faster.
Talk to us today on 01455 209505 about choosing the right computer for your needs.
Share..Share on FacebookShare on Google+Tweet about this on TwitterShare on LinkedInPin on PinterestPrint this pageEmail this to someone
Free Antivirus – is it letting you down?
Free antivirus - is it good enough?
One of the best ways to avoid a computer virus is by using common sense, but that doesn’t mean you’ll be safe from attack. Even the most careful user can find themselves infected in an instant and spreading the virus faster than a sneeze in flu season. It’s why antivirus software is still the first package we install on all systems – because you never know when you’ll be attacked. But should you choose free or paid antivirus?
Advertising in the program
Much like a free mobile app making its fortune with in-app purchases, the free antivirus software will push for payment. Expect popup boxes pestering you to sign up to the paid version with some free options also trying to change your browser home page and default search engine, an inconvenience you may be stuck with. Paid options are more respectful and largely invisible unless they’ve detected a problem.
Effectiveness of free antivirus
It’s fair to expect your antivirus to detect malware, and testing showed that in a head-to-head battle free and paid are about equal at catching known infections – although some are better than others as you would expect. Unfortunately, free antivirus generally needs to have recorded a virus into its virus lists before it can detect it. Paid antivirus is more likely to identify and stop a new virus because it also bases the detection on suspicious behaviour, the source and its attributes, a far more effective method of detection.
Features in free versions
Free antivirus programs are usually created from the paid version, taking out everything except the bare minimum. In your free version, it is unlikely that you will have all the advanced features like spam filters, firewalls, parental controls and secure web browsing. Some paid antivirus will also update your other software packages, forming a more secure protection against attacks. For example, you might view a malicious image file that takes advantage of an exploit in your PDF software so anything that reminds you to update your PDF program is a good thing. Unfortunately, hackers have advanced beyond simple tactics and it’s not just about avoiding email attachments anymore.
Support
Free antivirus options are the most popular choice because they’re… free. Obviously. This also means there’s generally little or no support available. If there’s a problem or conflict, you may find yourself without protection until it can be resolved. Paid antivirus options usually include telephone support, ready to help with problems ranging from installation to system diagnostics.
Ease of use and flexibility
Depending on what you use your computer for, this may be an important concern. Free antivirus options are easy to install and use, but are very limited in their flexibility. They come as-is, meaning you can’t pick and choose what it monitors or how it reacts. For example, users occasionally find it necessary to disable ALL protections in order to install or play a network game. Paid versions are more likely to allow you to adapt the way the antivirus runs, switching features on and off as required e.g. many paid antivirus programs have a ‘gaming mode’ available, which restricts interference by the antivirus product.
Free antivirus is fine for very basic protection or those with an older PC. In these cases, something is always better than nothing. But we generally recommend that you go with a paid antivirus to defend you from the new attacks that are released daily, and to ensure you’ve got solid protection that will make a real difference to your digital safety.
If you want to upgrade to a paid antivirus, give us a call on 01455 209505.
Share..Share on FacebookShare on Google+Tweet about this on TwitterShare on LinkedInPin on PinterestPrint this pageEmail this to someone
Live Mail – time for an alternative?
Windows Live Mail
We see that many customers have Windows Live Mail, which is a very popular free email program that took over from the venerable old Outlook Express many years ago. However if you are still using Live Mail, its usefulness is becoming more limited so it may be a good time to look for an alternative email program.
Firstly, last year Microsoft made changes to their email systems which made Live Mail incompatible with their email infrastructure. This meant that the Microsoft email systems such as Hotmail, live.com, msn.com and outlook.com no longer worked with Live Mail.
Unfortunately, in January of 2017 Microsoft also stopped supporting the Live Mail program altogether, which meant that Live Mail no longer has the benefit of security or any other updates.
Those of you who are using different email accounts to the above may find that Live Mail is still happily collecting your emails, so you may feel that there isn’t an issue yet. The problem is that without security updates, the program itself is going to be more vulnerable and as email is one of the main conduits for viruses, malware and identity theft, it may not be a good idea to ignore the lack of updates for long.
Also, with no further updates Live Mail will effectively begin to become less reliable as more email providers update their email systems that Live Mail cannot support. Likewise, we are certainly seeing an increase in Live Mail issues and the question needs to be asked – is it worth fixing?
Alternative email programs
Windows 10 has a built-in app called ‘Mail’ (although some people consider it to still be a maturing product) however if you are not using Windows 10, then you will need to look elsewhere. Clearly Microsoft would love customers to use Outlook, which would also mean a subscription to their Office software suite.
Alternatively you can access emails online such as from Outlook.com and certainly many people do use the very popular online ‘Gmail’ service – but not everyone wants to use an internet browser for email, especially those that are comfortable using an email program.
Alternatives programs are available, such as the email program ‘Thunderbird’ which is one of the most popular free email programs around (from the makers of the ‘Firefox’ internet browser). There are other free programs such as ‘Operamail’ (from the makers of the ‘Opera’ internet browser), ‘Mailbird’ and others, but when choosing your next free email program do bear in mind that some programs are free because they add advertising or market research tracking, so some are better than others when it comes to privacy.
Luckily whichever email program you decide to choose, Live Mail stores emails in the industry standard .eml format, which means that it is fairly easy to transfer the emails from Live Mail into another program.
If you would like help in moving to another email program, please call 01455 209505.
Share..Share on FacebookShare on Google+Tweet about this on TwitterShare on LinkedInPin on PinterestPrint this pageEmail this to someone
How to spot a Tech Scam
avoiding computer scammers
If your computer had a virus, you’d want to know about it ASAP, right?
Before your important files become corrupted, you lose your photos and your digital life is essentially destroyed. Even thinking about it is terrifying.
Tech scammers know we’d be lost without our computers, and that we don’t always know what’s going on behind the screen – which is why they’ve been able to swindle millions from every day people across the world.
The scam goes like this:-
You receive a random phone call from someone with a heavy accent saying they’re from Microsoft, Talk Talk, BT or some other well-known company, or an alarming pop-up appears on the screen, saying it looks like your system has been infected with a virus.
The real Microsoft will never randomly call people like this. Ever.
To fix the problem, they need to you to download some support software, which they’ll give you a special link for.
A technician then uses that software to gain access to your system and make it appear your system is riddled with viruses. Flashing screens, mysterious diagnostics whizzing by, fabricated errors…they’ll do or say anything to make you panic. They’ll even go as far as claiming your system has been infected with illegal content and if not corrected, you’ll face criminal charges.
Demands for credit card information follow immediately after. Once paid, they simply stop fiddling with your system to make it seem the problem is fixed. To continue the scam, they’ll soon access your system to recreate the problem, this time offering a subscription for ongoing protection.
What To Do If You’re Targeted By A Tech Scam
1. Don’t taunt them. Just hang up. Right now you’re only a phone number in their system and they’ll move onto the next – if you give them cause to target you personally, you may find yourself in a worse situation.
1. If a pop-up appears, immediately run an anti-virus scan. Don’t click the pop-up or call the number.
What To Do If You’ve Already Been Scammed
It’s okay. It feels horrible, but you’re not alone and the situation can be corrected.
Call your financial institution and have the charges reversed and your card reissued. It’s easier than you might think and helps the authorities locate the scammers.
Then give us a call on 01455 209505 and we’ll make sure they no longer have access to your computer.
Share..Share on FacebookShare on Google+Tweet about this on TwitterShare on LinkedInPin on PinterestPrint this pageEmail this to someone
Potentially Unwanted Programs
Too many toolbars are PUPs
Everyone has heard of the term ‘computer virus’ and many people have also heard of the term ‘malware’. Unfortunately there is a less well-known term – a Potentially Unwanted Program (PUP).
This is software that may be clogging up your computer, yet is not classed as a virus or malware. They can cause problems when they are downloaded and installed, but what makes a PUP different is that when you install one, you are giving consent for the installation.
PUPs typically use up large amounts of system resources because they are running in the background and generally slow down your computer – sometimes drastically. From changing your search provider for no reason, adding toolbars to your internet browser or giving you pop-up adverts, PUPs can be annoying and troublesome. They are also easy to get.
Newer strains are information gatherers, providing data about your browsing habits and other information which is valuable to someone and the information is sent out for data collection purposes. Some are used to spread actual malware. Not all are as bad as this, but they all share an unwelcome trait – you are probably better off without them.
How do you get them?
Sometimes they piggy back onto other downloads, such as from software websites where there are bright green ‘Start Download’ buttons everywhere. You click on the button expecting one piece of free software and end up getting something else entirely or something in addition to what you expected.
It’s not just dodgy toolbars or free software designers either. Some big names bundle well-meaning PUPs in their downloads, for example Adobe Reader can give you the option to download an on-demand virus scanning program unless you spot it on the webpage, or a Java download asking if you want to install a toolbar, change your search engine or other setting when installing the program.
The more dodgy variety of PUP relies on you not wanting to read through the long licensing blurb displayed on the screen (the EULA). By clicking on the ‘Accept’ button, you are effectively giving them permission to install and in the case of the dodgy variety, protection from any legal action.
The question is that it’s easy to click away and miss something – you do need to watch what you click on.
Why do you get them?
“Free” software makers make money from them – for example, every toolbar installed earns them money.
Companies that give you the option to download them in addition to their own product, may also make money promoting the additional software.
PUPs are also friendly with each other, so when you get one it may bring along some of its PUP friends as well, to make some more money on the side.
Won’t my anti-virus program catch them?
Not necessarily. The issue is that technically, a PUP can be legal software in spite of the way it is used and some antivirus vendors choose to be strict about detecting them, whilst others are not so strict. Even if it is not switched on by default, many antivirus programs have a setting to configure the antivirus to look for PUPs, so it’s worth checking yours.
The important thing is to be watchful, especially when downloading and installing programs.
Share..Share on FacebookShare on Google+Tweet about this on TwitterShare on LinkedInPin on PinterestPrint this pageEmail this to someone
Computer Recovery – for when disaster strikes
Recovering your computer
Windows 10 and Windows 8 have a built-in facility to refresh/reset your computer if you have a major problem, so you can reinstall Windows and use your computer if the worst happens. The problem is that Windows 10 has only 25% market share (as at February 2017) and Windows 8 has even less, 8% – compared to Windows 7 that still has 48% of the market. So if you still have Windows 7, how would you reinstall it?
In the past when you bought a new computer, it came with DVD discs called ‘Recovery discs’ which contained a copy of Windows software that the manufacturer put on the computer at the factory. These discs were used as a last resort to reinstall Windows and basically put the computer back to the state that it was in fresh out of the factory (that is without your own files such as photographs, etc.) should it be necessary.
In recent years, most computer manufacturers stopped supplying these Recovery discs and instead placed a copy (called an ‘image’) on a part of the computer hard drive. So long as the hard drive and/or the information on it are intact, then you can reinstall Windows using that image instead of a Recovery disc.
If there is something wrong with the hard drive itself, you are stuck with no way of repairing your computer without paying for the manufacturer to send you out a Recovery disc and waiting for it to arrive, sometimes taking weeks. Or worse still, buying a copy of the operating system again.
Luckily, manufacturers put a program on computers that allow you to create a Recovery image automatically. By creating this Recovery image, you are giving yourself that extra chance of reinstalling Windows on your computer, without more cost and delays.
Unfortunately we find that most people do not make this Recovery backup, so we strongly recommend that you find the program on your computer now and create a Recovery image as soon as you can. It’s never too late to get that extra peace of mind and you may be glad that you did.
If you would like help to create recovery images, give us a call on 01455 209505. We’d be happy to help.
Share..Share on FacebookShare on Google+Tweet about this on TwitterShare on LinkedInPin on PinterestPrint this pageEmail this to someone
What does Cloud computing mean?
Cloud computing and storage
The I.T. world is full of jargon but it’s surprising the number of people we deal with who have heard of the term “Cloud” computing, but still do not know what it means….and how it could benefit them.
Essentially, when people talk about “Cloud” computing they are talking about a method to store your files on special servers on the internet, instead of just on your computer. Saving them “on the Cloud”.
That way, if something bad happened to your computer, copies of your files would be safely tucked away somewhere else where you could still access them even if you could not use your computer.
Is it just online storage?
It is more than that, as your files could be accessible to you whenever and wherever you may be, so you are not tied down to have to be sitting at your computer to access them. One of the most well-known (and copied) ‘Cloud’ services is from a company called Dropbox.
Here is the way it works – you open an account (which is free up to a certain level of storage) and you install their program. This creates a folder on your computer and if you save something (a photo, document or whatever) in that folder, not only will it be saved on your computer, but also a copy is automatically sent to a secure server for safekeeping.
You don’t have to do anything special or anything that you do not already do – all you need to remember is to save your work in the cloud folder. You can make changes, share the file with other people – you can even do something at work and carry on with it when you get home. And vice versa.
For home users, it’s a great way to back up your important files without having to go through the hassle of setting up backup plans to an external hard drive – it’s automatic.
I’m not sure about saving my files there – is it secure?
Well, governments use it and it’s fair to say that the security at data centres where this is stored, is some of the hardest security around. Although nothing online can be guaranteed to be 100% secure, great lengths are taken to protect the information, including copies in more than one place so if one data centre has a problem, another can take over.
So the term ‘Cloud’ can do more for you than you realise and can be an inexpensive lifesaver – especially for businesses.
If you want help setting up a ‘Cloud’ storage system, please give us a call on 01455 209505.
Share..Share on FacebookShare on Google+Tweet about this on TwitterShare on LinkedInPin on PinterestPrint this pageEmail this to someone
Windows 10 Privacy
Windows 10 privacy
Since Windows 10 was released, much has been said about the privacy concerns that come with it. Admittedly, some of the concerns have been exaggerated but there is no doubt that Windows 10 collects much more data about you than any other Windows version before it.
One of the concerns relates to ‘Cortana’ the “personal assistant”. Like Apple’s ‘Siri’, ‘Cortana’ collects personal information such as calendar, contacts, location, alarm settings, what websites you view, emails, and more. When you add it all up, there is quite a lot of information about you.
Why are they collecting this much information?
They say that it is to “better serve you”, such as being able to suggest a restaurant nearby, but ultimately it is also advertising data collection. Each account with an email is given an Advertising ID and a profile is created that is shared with Microsoft partner advert networks.
Similarly, OneDrive the online storage service, synchs every time you switch on and gets updates of your internet browsing and wifi details. Even your location is noted by the operating system and the information is passed to “trusted” third parties.
Everyone thinks differently about their privacy – one person may feel that ‘Cortana’ being able to suggest a local restaurant is good enough reason for so much data collection, but another person may feel it’s a little too much.
To be fair, it’s not just Windows 10 though – ‘Siri’ keeps voice recordings for much longer than you would think as back in 2013 Apple announced that they were keeping your ‘Siri’ voice recordings for two years. The digital age has its drawbacks.
What can you do about more control over your privacy?
Go to Start Menu > Settings and open the Privacy section, to look carefully at all the settings that can be switched on or off – there are quite a few of them and some settings may be useful to you, others not so much.
Also, you can still have a local account on your Windows 10 computer rather than one controlled by your email address, which controls the automatic synching of your information.
Microsoft have now taken the privacy concerns seriously and in the so-called ‘Creators Update’ for Windows 10 that is due in the first half of 2017, the privacy settings will be much clearer, simpler and transparent, including a new privacy dashboard which will be where you can have much more control over your information, all in one place.
In the meantime, there’s no need to be looking over your shoulder for big brother, but you do need to at least be aware that a lot of information is collected about you and what you do every day with your computer.
Share..Share on FacebookShare on Google+Tweet about this on TwitterShare on LinkedInPin on PinterestPrint this pageEmail this to someone
|
{
"url": "http://www.cshcomputerservices.com/author/chrisback/page/5/",
"source_domain": "www.cshcomputerservices.com",
"snapshot_id": "crawl=CC-MAIN-2017-51",
"warc_metadata": {
"Content-Length": "115543",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GVUZLFF7DUVGYXRJE2B7YMOPZAMWL67Z",
"WARC-Concurrent-To": "<urn:uuid:fda4a5cd-7875-4d5d-b2de-1e88805608e0>",
"WARC-Date": "2017-12-16T03:26:05Z",
"WARC-IP-Address": "31.170.127.240",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PAWFZSKUUDW3RWOVBZCAB7UPL7WW4DDD",
"WARC-Record-ID": "<urn:uuid:8e43e443-8c8d-4647-9924-ac82f97a0734>",
"WARC-Target-URI": "http://www.cshcomputerservices.com/author/chrisback/page/5/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f3137685-7f3a-4bfe-a1cc-ee54552eb9cf>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-67-195-241.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,
32,
33,
64,
65,
95,
96,
415,
416,
622,
623,
781,
782,
815,
816,
1366,
1367,
1638,
1639,
1690,
1691,
1887,
1888,
2205,
2206,
2676,
2677,
2724,
2725,
2898,
2899,
3093,
3094,
3230,
3231,
3419,
3420,
3557,
3558,
3584,
3585,
3601,
3602,
3827,
3828,
4072,
4073,
4468,
4469,
4536,
4537,
4566,
4567,
5072,
5073,
5215,
5216,
5233,
5234,
5732,
5733,
5753,
5754,
6055,
6056,
6225,
6226,
6355,
6356,
6494,
6495,
6731,
6732,
6957,
6958,
7131,
7132,
7198,
7199,
7336,
7337,
7398,
7399,
7436,
7437,
7647,
7648,
7965,
7966,
7990,
7991,
8324,
8325,
8613,
8614,
8633,
8634,
9000,
9001,
9031,
9032,
9434,
9435,
9456,
9457,
9842,
9843,
10337,
10338,
10421,
10422,
10559,
10560,
10601,
10602,
10638,
10639,
11069,
11070,
11097,
11098,
11508,
11509,
11541,
11542,
12079,
12080,
12106,
12107,
12792,
12793,
12801,
12802,
13190,
13191,
13219,
13220,
13844,
13845,
14198,
14199,
14275,
14276,
14413,
14414,
14451,
14452,
14470,
14471,
14784,
14785,
15045,
15046,
15235,
15236,
15657,
15658,
15950,
15951,
15978,
15979,
16293,
16294,
16560,
16561,
17081,
17082,
17294,
17295,
17380,
17381,
17518,
17519,
17543,
17544,
17571,
17572,
17643,
17644,
17797,
17798,
18010,
18011,
18037,
18038,
18293,
18294,
18362,
18363,
18478,
18479,
18858,
18859,
19150,
19151,
19196,
19197,
19413,
19518,
19519,
19561,
19562,
19649,
19650,
19816,
19817,
19918,
19919,
20056,
20057,
20087,
20088,
20115,
20116,
20305,
20306,
20574,
20575,
20923,
20924,
21270,
21271,
21292,
21293,
21589,
21590,
21978,
21979,
22274,
22275,
22381,
22382,
22403,
22404,
22505,
22506,
22647,
22648,
22797,
22798,
22838,
22839,
23204,
23205,
23297,
23298,
23435,
23436,
23482,
23483,
23508,
23509,
23921,
23922,
24347,
24348,
24659,
24660,
24952,
24953,
25207,
25208,
25487,
25488,
25593,
25594,
25731,
25732,
25764,
25765,
25793,
25794,
25995,
25996,
26200,
26201,
26394,
26395,
26422,
26423,
26691,
26692,
27050,
27051,
27344,
27345,
27521,
27522,
27579,
27580,
27935,
27936,
28058,
28059,
28152,
28153,
28290,
28291,
28310,
28311,
28330,
28331,
28596,
28597,
28892,
28893,
28940,
28941,
29224,
29225,
29476,
29477,
29706,
29707,
29954,
29955,
30009,
30010,
30229,
30230,
30408,
30409,
30752,
30753,
30968,
30969
],
"line_end_idx": [
32,
33,
64,
65,
95,
96,
415,
416,
622,
623,
781,
782,
815,
816,
1366,
1367,
1638,
1639,
1690,
1691,
1887,
1888,
2205,
2206,
2676,
2677,
2724,
2725,
2898,
2899,
3093,
3094,
3230,
3231,
3419,
3420,
3557,
3558,
3584,
3585,
3601,
3602,
3827,
3828,
4072,
4073,
4468,
4469,
4536,
4537,
4566,
4567,
5072,
5073,
5215,
5216,
5233,
5234,
5732,
5733,
5753,
5754,
6055,
6056,
6225,
6226,
6355,
6356,
6494,
6495,
6731,
6732,
6957,
6958,
7131,
7132,
7198,
7199,
7336,
7337,
7398,
7399,
7436,
7437,
7647,
7648,
7965,
7966,
7990,
7991,
8324,
8325,
8613,
8614,
8633,
8634,
9000,
9001,
9031,
9032,
9434,
9435,
9456,
9457,
9842,
9843,
10337,
10338,
10421,
10422,
10559,
10560,
10601,
10602,
10638,
10639,
11069,
11070,
11097,
11098,
11508,
11509,
11541,
11542,
12079,
12080,
12106,
12107,
12792,
12793,
12801,
12802,
13190,
13191,
13219,
13220,
13844,
13845,
14198,
14199,
14275,
14276,
14413,
14414,
14451,
14452,
14470,
14471,
14784,
14785,
15045,
15046,
15235,
15236,
15657,
15658,
15950,
15951,
15978,
15979,
16293,
16294,
16560,
16561,
17081,
17082,
17294,
17295,
17380,
17381,
17518,
17519,
17543,
17544,
17571,
17572,
17643,
17644,
17797,
17798,
18010,
18011,
18037,
18038,
18293,
18294,
18362,
18363,
18478,
18479,
18858,
18859,
19150,
19151,
19196,
19197,
19413,
19518,
19519,
19561,
19562,
19649,
19650,
19816,
19817,
19918,
19919,
20056,
20057,
20087,
20088,
20115,
20116,
20305,
20306,
20574,
20575,
20923,
20924,
21270,
21271,
21292,
21293,
21589,
21590,
21978,
21979,
22274,
22275,
22381,
22382,
22403,
22404,
22505,
22506,
22647,
22648,
22797,
22798,
22838,
22839,
23204,
23205,
23297,
23298,
23435,
23436,
23482,
23483,
23508,
23509,
23921,
23922,
24347,
24348,
24659,
24660,
24952,
24953,
25207,
25208,
25487,
25488,
25593,
25594,
25731,
25732,
25764,
25765,
25793,
25794,
25995,
25996,
26200,
26201,
26394,
26395,
26422,
26423,
26691,
26692,
27050,
27051,
27344,
27345,
27521,
27522,
27579,
27580,
27935,
27936,
28058,
28059,
28152,
28153,
28290,
28291,
28310,
28311,
28330,
28331,
28596,
28597,
28892,
28893,
28940,
28941,
29224,
29225,
29476,
29477,
29706,
29707,
29954,
29955,
30009,
30010,
30229,
30230,
30408,
30409,
30752,
30753,
30968,
30969,
31105
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 31105,
"ccnet_original_nlines": 325,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.49226006865501404,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005214270204305649,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1284015029668808,
"rps_doc_frac_unique_words": 0.23863421380519867,
"rps_doc_mean_word_length": 4.72891902923584,
"rps_doc_num_sentences": 245,
"rps_doc_symbol_to_word_ratio": 0.0004888399853371084,
"rps_doc_unigram_entropy": 5.975042819976807,
"rps_doc_word_count": 5301,
"rps_doc_frac_chars_dupe_10grams": 0.05022339150309563,
"rps_doc_frac_chars_dupe_5grams": 0.06426519900560379,
"rps_doc_frac_chars_dupe_6grams": 0.05652625113725662,
"rps_doc_frac_chars_dupe_7grams": 0.052138179540634155,
"rps_doc_frac_chars_dupe_8grams": 0.05022339150309563,
"rps_doc_frac_chars_dupe_9grams": 0.05022339150309563,
"rps_doc_frac_chars_top_2gram": 0.004786979872733355,
"rps_doc_frac_chars_top_3gram": 0.009972870349884033,
"rps_doc_frac_chars_top_4gram": 0.010770699940621853,
"rps_doc_books_importance": -2526.744384765625,
"rps_doc_books_importance_length_correction": -2526.744384765625,
"rps_doc_openwebtext_importance": -1390.0169677734375,
"rps_doc_openwebtext_importance_length_correction": -1390.0169677734375,
"rps_doc_wikipedia_importance": -663.2615966796875,
"rps_doc_wikipedia_importance_length_correction": -663.2615966796875
},
"fasttext": {
"dclm": 0.06261379271745682,
"english": 0.951678454875946,
"fineweb_edu_approx": 1.9774150848388672,
"eai_general_math": 0.09151207655668259,
"eai_open_web_math": 0.13455229997634888,
"eai_web_code": 0.04107611998915672
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-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": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,476,255,687,123,155,500 |
[SOLVED] Should I upgrade and old laptop or just buy a newer one
Jan 26, 2019
2
0
10
0
Hi, I currently have and HP ENVY dv7-7243nr and I was wondering if I should upgrade it or buy a newer Dell Precision M4800. I want to have something that will be able to do just some light gaming and some productivity work. It would be $200 less to upgrade the HP, but the Dell would have a better CPU and a dedicated GPU. I was wondering if the Dell would be worth $200 more. Thank you for the help!
Here are the specifications of the HP ENVY dv7:
CPU: Intel Core i5-3210M Dual-Core CPU @ 2.50GHz
Memory: 8GB DDR3-1333MHz Dual-Channel RAM
Storage: KINGSTON A400 120GB SATA-III SSD
Graphics: Intel HD Graphics 4000
Here are the upgrades that I would make to it if I were to upgrade it and not buy a new laptop:
Intel Core i7-3630QM Quad-Core CPU @ 2.40GHz: $110
CORSAIR Vengeance 16GB DDR3-1600MHz SDRAM: $82
New Backlit Keyboard: $55
Total: $247
Here are the specifications for the Dell Precision M4800:
CPU: Intel Core i7-4900MQ Quad-Core CPU @ 2.80GHz
Memory: 16GB Dual-Channel DDR3-1600MHz SDRAM
Storage: SanDisk SSD Plus 240GB SATA-III Solid State Drive
Graphics: NVIDIA Quadro K2100M 2GB GDDR5
Keyboard: Full-Sized with Backlight
Cost: $450
ASK THE COMMUNITY
TRENDING THREADS
|
{
"url": "https://forums.tomshardware.com/threads/should-i-upgrade-and-old-laptop-or-just-buy-a-newer-one.3439265/",
"source_domain": "forums.tomshardware.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "160574",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GSTL5BHHH6EQGM6JRD4TI6FRGCHQE5Y6",
"WARC-Concurrent-To": "<urn:uuid:8c200e87-a3c0-409d-99c7-1c41049a91e8>",
"WARC-Date": "2021-10-24T00:31:58Z",
"WARC-IP-Address": "99.84.102.125",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IK2VXRGX6EHEWB5FBUO4VYGDB4UAC4M3",
"WARC-Record-ID": "<urn:uuid:3110320f-50dc-4ab5-a9ef-3792d20134c7>",
"WARC-Target-URI": "https://forums.tomshardware.com/threads/should-i-upgrade-and-old-laptop-or-just-buy-a-newer-one.3439265/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:99bd6afb-0a58-4887-95fb-44f0b65f3530>"
},
"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-149\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,
79,
81,
83,
86,
88,
489,
490,
538,
539,
588,
630,
672,
705,
706,
802,
803,
854,
901,
927,
939,
940,
998,
999,
1049,
1094,
1153,
1194,
1230,
1241,
1242,
1244,
1245,
1263,
1264
],
"line_end_idx": [
65,
66,
79,
81,
83,
86,
88,
489,
490,
538,
539,
588,
630,
672,
705,
706,
802,
803,
854,
901,
927,
939,
940,
998,
999,
1049,
1094,
1153,
1194,
1230,
1241,
1242,
1244,
1245,
1263,
1264,
1280
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1280,
"ccnet_original_nlines": 36,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2593856751918793,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.19112628698349,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24573378264904022,
"rps_doc_frac_unique_words": 0.5727272629737854,
"rps_doc_mean_word_length": 4.504545211791992,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.611467361450195,
"rps_doc_word_count": 220,
"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.012108979746699333,
"rps_doc_frac_chars_top_3gram": 0.030272450298070908,
"rps_doc_frac_chars_top_4gram": 0.030272450298070908,
"rps_doc_books_importance": -116.37345123291016,
"rps_doc_books_importance_length_correction": -116.37345123291016,
"rps_doc_openwebtext_importance": -58.293701171875,
"rps_doc_openwebtext_importance_length_correction": -58.293701171875,
"rps_doc_wikipedia_importance": -40.21281814575195,
"rps_doc_wikipedia_importance_length_correction": -40.21281814575195
},
"fasttext": {
"dclm": 0.06002641096711159,
"english": 0.894817054271698,
"fineweb_edu_approx": 1.0798566341400146,
"eai_general_math": 0.018613699823617935,
"eai_open_web_math": 0.05201828107237816,
"eai_web_code": 0.017239930108189583
}
}
|
{
"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": "-1",
"labels": {
"level_1": "",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,493,449,813,811,390,200 |
Tag Archives: IPv6
Mobile IPv6 Tax?
Recently a Tweet from Dean Bubly got me thinking about how data is charged in cellular:
In the cellular world, subscribers are charged for data from the IP, transport and applications layers; this means you pay for the IP header, you pay for the TCP/UDP header, and you pay for the contents (the cat videos it contains).
This also means if an operator moves mobile subscribers from IPv4 to IPv6, there’s an extra 20 bytes the customer is charged for for every packet sent / received, which the customer is charged for – This is because the IPv6 header is longer than the IPv4 header.
Source: ServerFault - https://serverfault.com/questions/547768/ipv4-header-vs-ipv6-header-size
In most cases, mobile subs don’t get a choice as to if their connection is IPv4 or IPv6, but on a like for like basis, we can say that if a customer moves is on IPv6 every packet sent/received will have an extra 20 bytes of data consumed compared to IPv4.
This means subscribers use more data on IPv6, and this means they get charged for more data on IPv6.
For IoT applications, light users and PAYG users, this extra 20 bytes per packet could add up to something significant – But how much?
We can quantify this, but we’d need to know the number of packets sent on average, and the quantity of the data transferred, because the number of packets is the multiplier here.
So for starters I’ve left a phone on the desk, it’s registered to the network but just sitting in Idle mode – This is an engineering phone from an OEM, it’s just used for testing so doesn’t have anything loaded onto it in terms of apps, it’s not signed into any applications, or checking in the background, so I thought I’d try something more realistic.
So to get a clearer picture, I chucked a SIM in my regular everyday phone I use personally, registered it to the cellular lab I have here. For the next hour I sniffed the GTP traffic for the phone while it was sitting on my desk, not touching the phone, and here’s what I’ve got:
Overall the PCAP includes 6,417,732 bytes of data, but this includes the transport and GTP headers, meaning we can drop everything above it in our traffic calculations.
Everything except the data encapsulated in GTP can be dropped
For this I’ve got 14 bytes of ethernet, 20 bytes IP, 8 bytes UDP and 5 bytes for TZSP (this is to copy the traffic from the eNB to my local machine), then we’ve got the transport from the eNB to the SGW, 14 bytes of ethernet again, 20 bytes of IP , 8 bytes of UDP and 8 bytes of GTP then the payload itself. Phew.
All this means we can drop 97 bytes off every packet.
We have 16,889 packets, 6,417,732 bytes in total, minus 97 bytes from each gives us 1,638,233 of headers to drop (~1.6MB) giving us a total of 4.556 MB traffic to/from the phone itself.
This means my Android phone consumes 4.5 MB of cellular data in an hour while sitting on the desk, with 16,889 packets in/out.
Okay, now we’re getting somewhere!
So now we can answer the question, if each of these 16k packets was IPv6, rather than IPv4, we’d be adding another 20 bytes to each of them, 20 bytes x 16,889 packets gives 337,780 bytes (~0.3MB) to add to the total.
If this traffic was transferred via IPv6, rather than IPv4, we’d be looking at adding 20 bytes to each of the 16,889 packets, which would equate to 0.3MB extra, or about 7% overhead compared to IPv4.
But before you go on about what an outrage this IPv6 transport is, being charged for those extra bytes, that’s only one part of the picture.
There’s a reason operators are finally embracing IPv6, and it’s not to put an extra 7% of traffic on the network (I think if you asked most capacity planners, they’d say they want data savings, not growth).
IPv6 is, for lack of a better term, less rubbish than IPv4.
There’s a lot of drivers for IPv6, and some of these will reduce data consumption.
IPv6 is actually your stuff talking directly to the remote stuff, this means that we don’t need to rely on NAT, so no need to do NAT keepalives, and opening new sessions, which is going to save you data. If you’re running apps that need to keep a connection to somewhere alive, these data savings could negate your IPv6 overhead costs.
Will these potential data savings when using IPv6 outweigh the costs?
That’s going to depend on your use case.
If you’ve extremely bandwidth / data constrained, for example, you have an IoT device on an NTN / satellite connection, that was having to Push data every X hours via IPv4 because you couldn’t pull data from it as it had no public IP, then moving it to IPv6 so you can pull the data on the public IP, on demand, will save you data. That’s a win with IPv6.
If you’re a mobile user, watching YouTube, getting push notifications and using your phone like a normal human, probably not, but if you’re using data like a normal user, you’ve probably got a sizable data allowance that you don’t end up fully consuming, and the extra 20 bytes per packet will be nothing in comparison to the data used to watch a 2k video on your small phone screen.
|
{
"url": "https://nickvsnetworking.com/tag/ipv6/",
"source_domain": "nickvsnetworking.com",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "38506",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MOW5RMJ4AGVFYUNLIKR6BUVGUP24BFMM",
"WARC-Concurrent-To": "<urn:uuid:f9f0084b-0234-4cd3-8c1c-5608777cefe1>",
"WARC-Date": "2024-06-19T20:09:53Z",
"WARC-IP-Address": "104.21.48.141",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IUJZYYLLA5IGEZ7XN7ZZSXBWKOK43F2P",
"WARC-Record-ID": "<urn:uuid:0fce02ed-6cea-4fda-b576-d2152e484f40>",
"WARC-Target-URI": "https://nickvsnetworking.com/tag/ipv6/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d9431f5d-4895-47aa-b0c4-89f1b094dda5>"
},
"warc_info": "isPartOf: CC-MAIN-2024-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-115\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,
19,
20,
37,
38,
126,
127,
360,
361,
624,
625,
720,
721,
977,
978,
1079,
1080,
1215,
1216,
1395,
1396,
1750,
1751,
2031,
2032,
2201,
2202,
2264,
2265,
2579,
2633,
2634,
2820,
2821,
2948,
2949,
2984,
2985,
3202,
3203,
3403,
3404,
3545,
3546,
3753,
3754,
3814,
3815,
3898,
4234,
4235,
4305,
4306,
4347,
4348,
4704,
4705
],
"line_end_idx": [
19,
20,
37,
38,
126,
127,
360,
361,
624,
625,
720,
721,
977,
978,
1079,
1080,
1215,
1216,
1395,
1396,
1750,
1751,
2031,
2032,
2201,
2202,
2264,
2265,
2579,
2633,
2634,
2820,
2821,
2948,
2949,
2984,
2985,
3202,
3203,
3403,
3404,
3545,
3546,
3753,
3754,
3814,
3815,
3898,
4234,
4235,
4305,
4306,
4347,
4348,
4704,
4705,
5088
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5088,
"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.43474504351615906,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0337078683078289,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19533276557922363,
"rps_doc_frac_unique_words": 0.36996737122535706,
"rps_doc_mean_word_length": 4.336235046386719,
"rps_doc_num_sentences": 35,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.23337984085083,
"rps_doc_word_count": 919,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04165621101856232,
"rps_doc_frac_chars_dupe_6grams": 0.012045170180499554,
"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.015809280797839165,
"rps_doc_frac_chars_top_3gram": 0.012045170180499554,
"rps_doc_frac_chars_top_4gram": 0.009033880196511745,
"rps_doc_books_importance": -440.9687805175781,
"rps_doc_books_importance_length_correction": -440.9687805175781,
"rps_doc_openwebtext_importance": -262.6898498535156,
"rps_doc_openwebtext_importance_length_correction": -262.6898498535156,
"rps_doc_wikipedia_importance": -154.01771545410156,
"rps_doc_wikipedia_importance_length_correction": -154.01771545410156
},
"fasttext": {
"dclm": 0.14675456285476685,
"english": 0.9137684106826782,
"fineweb_edu_approx": 2.1671228408813477,
"eai_general_math": 0.6339085698127747,
"eai_open_web_math": 0.06261467933654785,
"eai_web_code": 0.41795456409454346
}
}
|
{
"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": "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": "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": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "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,885,602,054,834,719,000 |
You are here: HomeHTML LanguageHTML TutorialHTML MARQUEE
by Dinesh Thakur Category: HTML
What is HTML?At its most fundamental, Hypertext Markup Language (HTML) is a set of special codes that you embed in text to add formatting and linking information. HTML is based on Standard Generalized Markup Language (SGML). By convention, all HTML information begins with an open angle bracket (<) and ends with a closing angle bracket (>), for example, <html>.
This tag tells an HTML interpreter (browser) that the document is written and marked up in standard HTML. An example of an HTML interpreter would be Microsoft’s Internet Explorer, available for free from the Microsoft Web site; pop over to www.microsoft.com/ie/ to get your copy.
Although a small number of HTML tags are stand-alone entities, the majority are paired, with beginning and end tags. The beginning tag is called the open tag, and the end tag is called the close tag.
The most basic of all tags is the, <html>, which indicates that the information that follows is written in HTML. The <html> tag is a paired tag, however, so you need to add a close tag at the end of the document, which is the same as the open tag with the addition of a slash: </html>. By the same token, if you begin an italic phrase with <i> (the italics tag), you must end it with </i>. Everything between the open and close tags receives the particular attribute of that tag.
If you get confused and specify, for example, a backslash instead of a slash, as in <\html>, or some other variant, the browser program doesn’t understand and simply ignores the close tag. When this happens, the attribute specified in the open tag continues past the point where you meant it to stop. In the case of the <html> tag, the problem is probably not significant because </html> appears at the end of the document. Nothing comes after it to mess up. But in many situations, a missing close tag can completely destroy a Web page,
What do you think would happen if you included quotation marks around a tag—suppose, for example, that you used “<html>” at the beginning of your document rather than <html>. If you guessed that only the quotes would be displayed, you’re right. Let me say it one more time: Web browsers are very simple-minded in their interpretation of HTML. Any tags that vary from the specific characters in the HTML-language specification result in something other than what you were expecting, or your formatting requests are ignored completely.
Launching your HTML editor
To start, I suggest you use Notepad, a terrific—albeit simple—text editor included with the Windows operating system. It’s free and ready for you to start up, even if you didn’t realize you had it!
In just about every Windows configuration I’ve ever seen, Notepad is accessible by clicking the Start button on the bottom-left corner of the window, and then choosing Programs Accessories. You should see a list of choices Notepad is about half way down the list. After Notepad launches, it shows you a blank page where you can type the HTML.
Saving your file as HTML
After you type an adequate amount of material in your HTML, it’s time to save the file to disk. Then you can open it in your favorite Web browser and see how it looks when the HTML is rendered (interpreted by the browser).
When you save this new HTML document, it’s critical that you append either the .htm or .html filename suffix to ensure that the Web browser properly recognizes it as an HTML document. You can do this by explicitly typing .html as the suffix in the File Name box. Give this file a name, such as firstpage.html, and type that name directly into the File Name box.
If you don’t specify a filename suffix, by default Notepad uses .txt. Saving the file with this extension causes problems! When you look at the page later in your Web caution browser, you see the HTML itself rather than having it interpreted. If that happens, and you find that you’ve already saved the file with a .txt or another extension, simply open the file again in Notepad, choose File Save As, and resave the file with the .html suffix.
Now you’re ready: You have named the file, remembered the .html suffix, made sure that it’s stored in the directory you want, and clicked Save. You’ve created your first Web page.
Opening the file in Internet Explorer
Now it’s time to launch a Web browser and have a look. I launch Internet Explorer because I have the icon right on my desktop. I double-click the blue e icon, and the Web browser opens to the Creating Cool Web Sites home page. To open a different page—the Web page you just created—choose File Open. The Open dialog box appears,
To open the Web page you just created, click Browse. The dialog box shown opens. When you find the file, click Open and then OK. You should be looking at your HTML page
About Dinesh Thakur
Dinesh ThakurDinesh Thakur holds an B.SC (Computer Science), MCSE, MCDBA, CCNA, CCNP, A+, SCJP certifications. Dinesh authors the hugely popular Computer Notes blog. Where he writes how-to guides around Computer fundamental , computer software, Computer programming, and web apps. For any type of query or something that you think is missing, please feel free to contact us.
What's New and Popular
Search Content
Advance Courses
Basic Courses
Advertise with Us
|
{
"url": "http://ecomputernotes.com/html/tutorial/hypertext-markup-language",
"source_domain": "ecomputernotes.com",
"snapshot_id": "crawl=CC-MAIN-2017-51",
"warc_metadata": {
"Content-Length": "57473",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OS4WUOTJOOFSU5OBPG2H6PG72C3RLJMB",
"WARC-Concurrent-To": "<urn:uuid:ec069177-ac40-4ed6-885c-01752f05ffea>",
"WARC-Date": "2017-12-17T10:11:47Z",
"WARC-IP-Address": "216.194.173.231",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:JSOUVTPS24NKUECARRRS3FI4QLANOKT4",
"WARC-Record-ID": "<urn:uuid:427c6a07-0738-48ab-bc34-cffd46e48555>",
"WARC-Target-URI": "http://ecomputernotes.com/html/tutorial/hypertext-markup-language",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6ff23db4-566c-49d8-aea5-084d004733e1>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-141-32-201.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,
59,
91,
92,
455,
456,
737,
738,
740,
741,
742,
743,
943,
944,
946,
947,
1427,
1428,
1430,
1431,
1970,
1971,
1973,
1974,
2508,
2509,
2511,
2512,
2540,
2541,
2543,
2544,
2743,
2744,
2746,
2747,
3090,
3091,
3093,
3094,
3120,
3121,
3123,
3124,
3348,
3349,
3351,
3352,
3714,
3715,
3717,
3718,
4163,
4164,
4166,
4167,
4347,
4348,
4350,
4351,
4390,
4391,
4393,
4394,
4724,
4725,
4727,
4728,
4897,
4898,
4899,
4900,
4901,
4902,
4922,
4923,
5298,
5299,
5300,
5301,
5324,
5325,
5326,
5327,
5328,
5329,
5344,
5345,
5346,
5347,
5348,
5349,
5350,
5351,
5367,
5368,
5369,
5370,
5384,
5385,
5386,
5387
],
"line_end_idx": [
59,
91,
92,
455,
456,
737,
738,
740,
741,
742,
743,
943,
944,
946,
947,
1427,
1428,
1430,
1431,
1970,
1971,
1973,
1974,
2508,
2509,
2511,
2512,
2540,
2541,
2543,
2544,
2743,
2744,
2746,
2747,
3090,
3091,
3093,
3094,
3120,
3121,
3123,
3124,
3348,
3349,
3351,
3352,
3714,
3715,
3717,
3718,
4163,
4164,
4166,
4167,
4347,
4348,
4350,
4351,
4390,
4391,
4393,
4394,
4724,
4725,
4727,
4728,
4897,
4898,
4899,
4900,
4901,
4902,
4922,
4923,
5298,
5299,
5300,
5301,
5324,
5325,
5326,
5327,
5328,
5329,
5344,
5345,
5346,
5347,
5348,
5349,
5350,
5351,
5367,
5368,
5369,
5370,
5384,
5385,
5386,
5387,
5404
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5404,
"ccnet_original_nlines": 101,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4023090600967407,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0328596793115139,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15808171033859253,
"rps_doc_frac_unique_words": 0.39737990498542786,
"rps_doc_mean_word_length": 4.591702938079834,
"rps_doc_num_sentences": 59,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.187056064605713,
"rps_doc_word_count": 916,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.009985730051994324,
"rps_doc_frac_chars_dupe_6grams": 0.009985730051994324,
"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.016642890870571136,
"rps_doc_frac_chars_top_3gram": 0.007132669910788536,
"rps_doc_frac_chars_top_4gram": 0.006657159887254238,
"rps_doc_books_importance": -518.4098510742188,
"rps_doc_books_importance_length_correction": -518.4098510742188,
"rps_doc_openwebtext_importance": -322.5042724609375,
"rps_doc_openwebtext_importance_length_correction": -322.5042724609375,
"rps_doc_wikipedia_importance": -197.09112548828125,
"rps_doc_wikipedia_importance_length_correction": -197.09112548828125
},
"fasttext": {
"dclm": 0.045147839933633804,
"english": 0.8674541115760803,
"fineweb_edu_approx": 2.7231833934783936,
"eai_general_math": 0.6540347337722778,
"eai_open_web_math": 0.3810673952102661,
"eai_web_code": 0.085368812084198
}
}
|
{
"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": "-1",
"labels": {
"level_1": "",
"level_2": "",
"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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,261,426,384,769,893,400 |
Ubuntu – Ubuntu Shutdown While the Machine (Laptop) Fan is Still Running
18.04dellhardwarepower-managementshutdown
I use Ubuntu 18.04.
Whenever I shutdown (power off) my laptop (my laptop is Dell G7 15), there is a sound "klack" from the laptop. It sounds as if I force shutdown of my machine by clicking the power button while the OS still running.
I suspected that, whenever I do shutdown, it seems the OS has been "turned off", but the machine seems "not yet ready" to turn off.
My workaround to this issue is, whenever I want to turn off my laptop, I will do the following:
1. Restart the laptop
2. Run the command "sudo halt"
3. Wait for some minutes, listen to the sound of the fan. If it is already stopped, then press the power button to turn off the machine
However, this workaround does not always work since sometimes, after executing sudo halt, the fan is still running for more than 30 minutes. So, since I no longer able to wait for it to turn off, I am forced to press the power button to turn off the machine, and when I do that, I hear the sound "klack".
I am quite sure that when I run "sudo halt", the OS seems already turn off, it is just the machine hardware (the fan) which for some reason, is not able to turn off.
How to solve this issue? how can I safely shutdown both the OS and hardware?
I have tried to update my kernel, and this problem still persists. I am afraid this problem may eventually break my motherboard.
Thank you very much for your help! I would appreciate any hints that you provide.
Best Answer
• It seems I solved this problem by doing the following:
• Updated the Ubuntu kernel
• Updated the BIOS
• Installed the latest graphics card driver
• Go to /etc/default/grub, and change GRUB_CMDLINE_LINUX_DEFAULT="quiet splash" instead of "nomodeset"
Now, everytime I want to turn off my PC, I restart it and upon restart, I run the command "sudo shutdown -H now", then press the power button.
This looks like solving the problem, since I have been able to shut down my machine smoothly for the past 1 month.
• Related Question
|
{
"url": "https://itectec.com/ubuntu/ubuntu-ubuntu-shutdown-while-the-machine-laptop-fan-is-still-running/",
"source_domain": "itectec.com",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "10300",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RI6CMG6XGJJR6JL24DTTE6AI26ZYDKQJ",
"WARC-Concurrent-To": "<urn:uuid:1a225db2-ecd9-4004-8bfe-ccd9b4a9f4e9>",
"WARC-Date": "2020-11-28T04:37:38Z",
"WARC-IP-Address": "45.76.174.189",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:H4NPSGZ6B7R23Q6EIBX7HBA2GKOZSJBC",
"WARC-Record-ID": "<urn:uuid:12a75794-d73e-4310-8a84-6d3b3dd42d4d>",
"WARC-Target-URI": "https://itectec.com/ubuntu/ubuntu-ubuntu-shutdown-while-the-machine-laptop-fan-is-still-running/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:31390acd-06f7-491e-92aa-ea8fca27459a>"
},
"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-240.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,
73,
74,
116,
117,
137,
352,
353,
485,
486,
582,
583,
607,
640,
778,
779,
1084,
1085,
1251,
1252,
1329,
1458,
1459,
1541,
1542,
1554,
1555,
1614,
1615,
1647,
1670,
1718,
1825,
1826,
1973,
1974,
2093,
2094
],
"line_end_idx": [
73,
74,
116,
117,
137,
352,
353,
485,
486,
582,
583,
607,
640,
778,
779,
1084,
1085,
1251,
1252,
1329,
1458,
1459,
1541,
1542,
1554,
1555,
1614,
1615,
1647,
1670,
1718,
1825,
1826,
1973,
1974,
2093,
2094,
2114
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2114,
"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.4048140048980713,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06783369928598404,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19693653285503387,
"rps_doc_frac_unique_words": 0.42440319061279297,
"rps_doc_mean_word_length": 4.259946823120117,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.583885669708252,
"rps_doc_word_count": 377,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08405978232622147,
"rps_doc_frac_chars_dupe_6grams": 0.06724782288074493,
"rps_doc_frac_chars_dupe_7grams": 0.04732254147529602,
"rps_doc_frac_chars_dupe_8grams": 0.04732254147529602,
"rps_doc_frac_chars_dupe_9grams": 0.04732254147529602,
"rps_doc_frac_chars_top_2gram": 0.0348692387342453,
"rps_doc_frac_chars_top_3gram": 0.03922789916396141,
"rps_doc_frac_chars_top_4gram": 0.020547950640320778,
"rps_doc_books_importance": -168.59326171875,
"rps_doc_books_importance_length_correction": -168.59326171875,
"rps_doc_openwebtext_importance": -97.34503173828125,
"rps_doc_openwebtext_importance_length_correction": -97.34503173828125,
"rps_doc_wikipedia_importance": -71.01947784423828,
"rps_doc_wikipedia_importance_length_correction": -71.01947784423828
},
"fasttext": {
"dclm": 0.027072910219430923,
"english": 0.9437946677207947,
"fineweb_edu_approx": 0.9487975239753723,
"eai_general_math": 0.6529504656791687,
"eai_open_web_math": 0.4348406195640564,
"eai_web_code": 0.6592274904251099
}
}
|
{
"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": "621.3922",
"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": "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": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,706,553,735,033,630,000 |
array_unshift
(PHP4 )
array_unshift -- Push one or more elements onto the beginning of array
Description
int array_unshift (array array, mixed var [, mixed ...])
Array_unshift() prepends passed elements to the front of the array. Note that the list of elements is prepended as a whole, so that the prepended elements stay in the same order.
Returns the new number of elements in the array.
Example 1. Array_unshift() example
$queue = array ("p1", "p3");
array_unshift ($queue, "p4", "p5", "p6");
This would result in $queue having 5 elements: "p4", "p5", "p6", "p1", and "p3".
See also array_shift(), array_push(), and array_pop().
|
{
"url": "http://subfiles.net/php%203%20manual/function.array-unshift.html",
"source_domain": "subfiles.net",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "3854",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5ZZ2LU5KEDVVDGK3F4F33N6NT7TV36HE",
"WARC-Concurrent-To": "<urn:uuid:2660a653-5b11-48a1-95d9-3d931cc7d821>",
"WARC-Date": "2024-07-15T17:16:12Z",
"WARC-IP-Address": "188.40.109.150",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CTS5YESAHLJIVWAK4N6Z2PDSFNIMPVUK",
"WARC-Record-ID": "<urn:uuid:44dbf9aa-ba7a-4d45-b084-f764445c1c0d>",
"WARC-Target-URI": "http://subfiles.net/php%203%20manual/function.array-unshift.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:58fc51c9-35e9-4024-8598-2a73ec4c17e7>"
},
"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-110\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,
14,
15,
23,
24,
96,
97,
109,
110,
167,
168,
347,
348,
397,
398,
433,
434,
464,
506,
513,
514,
595,
596
],
"line_end_idx": [
14,
15,
23,
24,
96,
97,
109,
110,
167,
168,
347,
348,
397,
398,
433,
434,
464,
506,
513,
514,
595,
596,
650
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 650,
"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.2554744482040405,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007299270015209913,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.32846716046333313,
"rps_doc_frac_unique_words": 0.585106372833252,
"rps_doc_mean_word_length": 4.819149017333984,
"rps_doc_num_sentences": 7,
"rps_doc_symbol_to_word_ratio": 0.007299270015209913,
"rps_doc_unigram_entropy": 3.746624708175659,
"rps_doc_word_count": 94,
"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.035320088267326355,
"rps_doc_frac_chars_top_3gram": 0.026490069925785065,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -45.94004440307617,
"rps_doc_books_importance_length_correction": -55.49706268310547,
"rps_doc_openwebtext_importance": -14.896332740783691,
"rps_doc_openwebtext_importance_length_correction": -24.453351974487305,
"rps_doc_wikipedia_importance": -16.290374755859375,
"rps_doc_wikipedia_importance_length_correction": -25.847393035888672
},
"fasttext": {
"dclm": 0.646558940410614,
"english": 0.6000919938087463,
"fineweb_edu_approx": 3.020726203918457,
"eai_general_math": 0.12095797061920166,
"eai_open_web_math": 0.03735369071364403,
"eai_web_code": 0.40925276279449463
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-9,039,760,387,683,147,000 |
fbpx
Back
Is Page Speed Really That Important?
Is Page Speed Really That Important?
The term “page speed” sure sounds like it should be of the utmost importance to pretty much every website out there. But is it? With so much to consider in producing the best possible site, it’s easy to lose some of the finer details in the shuffle. We’re here to provide some insight into what exactly page speed is and why you should be keeping it on your mind on an ongoing basis.
What is page speed?
First things second. Page speed is pretty much what it sounds like – a measurement of how quickly the content on your page loads. It can sometimes be confused with site speed, but there is an important distinction between the two. Site speed is actually the page speed for a sample of page views on your site. Page speed itself can be measured in either “page load time” (the time it takes to fully display content on a specific page) or in “time to first byte” (how long it takes for a browser to receive the first byte of info from the web server). Regardless of how it’s measured, there are a couple of reasons page speed is so important (and keeps getting more important every day).
How important is page speed for SEO?
In 2010, Google announced it would start taking page speed into prime consideration when ranking pages via its algorithm. Then, in 2017, Google let us know it would be placing an even greater emphasis on page speed due mainly to the surge of mobile web browsing. If page speed isn’t a priority on your website, you may find yourself lagging behind your more fleet-of-foot competitors in search rankings. Slow page speed also means search engines can crawl fewer pages using their allocated crawl budget. This has a negative effect on indexation and is another way neglecting page speed can hurt your site.
In July 2018, Google released what it called the "Speed Update," a rare case when Google announced an algorithm update ahead of time. If you recall, the previous major announcement like this was dubbed Mobilegeddon and caused a global panic. There’s a reason the 2018 news wasn't flooded with "Speedageddon" articles. Google downplayed the impact the Speed Update would have on websites. Straight from the horse’s mouth: "The Speed Update...will only affect pages that deliver the slowest experience to users and will only affect a small percentage of queries."
Most recently, in April of 2023, Google dropped page speed from its list of ranking systems, stating that it’s not a direct ranking factor – if only to complicate things further for SEO specialists everywhere!
Throughout all of this change, it’s important to remember that there are many ranking factors that Google uses, but ultimately, Google will favor content that offers a positive page experience. So unless your website is loading like it’s 1999, you shouldn’t notice too much of an impact on the Google side of things. But that doesn’t mean you should downplay it on your website. There are more important reasons to make sure your pages load quickly.
How important is page speed to users?
Page speed matters to Google, but it matters even more to everyone who visits your site. The user experience is massively affected by page speed, and a slowly loading site is likely to drive visitors away. A higher bounce rate, lower average time spent on page, and decrease in conversions are all symptoms of a slow website. People are impatient. Their attention spans are short. According to surveys from Akamai and Gomez.com, almost half of web users expect a website to load within two seconds or less. If not, they tend to abandon the site completely. Don’t expect them to come crawling back as long as your site is loading at a snail’s pace.
How important is page speed to shoppers?
The e-commerce sector should be especially concerned with page speed. Research has shown that 79 percent of online shoppers who experience poor site performance say they won’t return to that site to buy in the future. Around 44 percent of those would tell a friend or family member if they had a poor experience with a website. That means slow page speed not only loses you conversions from the shoppers themselves but also from those they interact with on a regular basis. That’s a wide net.
Walmart.com noted that with every second of increased page speed, they saw a two percent increase in conversion. Way back in 2008, Amazon found every 100 milliseconds cost them 1% in sales. And that was in 2008. Just think about how much more impatient people are today! Another study in 2012 noted that Amazon could lose as much as $1.6 billion if a page loaded one second slower. In other words, there’s a lot of money to be made (or lost) in a very short period of time.
You should care about page speed
The main motivations behind improving page speed are simple – increase your ranking and keep people from leaving your site. That said, there are a lot of components that go into optimizing your page speed and making sure you’re staying ahead of the industry standard. It’s an ongoing process that should be maintained on a regular basis. It’s easy to fall behind. You need an experienced web developer to manage those aspects and ensure your site is running at Usain Bolt levels every second of every day. Anything less is sure to lose you money or followers. Don’t be that website.
How fast should your website be?
Obviously, when it comes to load time, the faster your website is the better. For a positive page experience, your full page should load within two seconds.
SEO audits often flag page speed as an issue on websites, but a great way to test it firsthand is by navigating through your site yourself. Does your site feel fast, or does it take more than a few seconds to navigate from page to page? Put yourself in the user's shoes and think about your browsing experiences. If you aren't noticing slow load times, your audience probably won't either.
Be sure to check your site on different search engines and devices to get a holistic feel for the speed of your website.
You can also check your page speed by navigating to a page you'd like to check out, right-clicking "inspect" on the page, then navigating to either "network" or "performance insights" to get a look at how quickly your page is loading.
Another place where you can check page speed is in Google Search Console. Your Core Web Vitals report can tell you more about site performance as it relates to user experience.
Quick fixes to improve page speed
If your site really is loading slowly and could use some improvements, here are a few ways to fix it:
1. Reduce the number of redirects on your website.
The more times a website has to redirect a user to a different page, the longer the user has to wait through that cycle of redirects. Make the navigation as seamless as possible by cutting out those redirects.
2. Compress large files.
Use a tool that enables compression to minimize the size of files that have to load on your site. If you have multiple large files loading on a page, it can really affect load time.
3. Pay attention to the size of your images.
Don't use images that are larger than needed, and scale down large images whenever possible.
4. Choose a performance-optimizing hosting partner.
Having your website hosted on a fast server can really improve load time.
5. Cache your site.
Caching your site allows the server to save copies of site files and quickly pull the page back up rather than loading it from scratch. Servers can cache your site through your hosting services, but you can also get caching plugins to help.
There are other ways to speed up your website's load time, but many of them require messing with the code or diving into website development. Contact Perrill today for full-service web development that will have your pages flying at Mach 10.
Written by
Dan Cole
Dan Cole is the Manager of Content & Copywriting at Perrill. He has been professionally strategizing and creating original content since 2011 across agency settings, corporate positions, and journalistic beats, and now masterminds written materials of all kinds for Perrill’s clients. He was named Acme Comedy Co.’s Funniest Person in the Twin Cities in 2014 and will never let any of us forget it.
Author
Dan Cole
Post Type
Article
Date
Jul 20, 2023
|
{
"url": "https://www.perrill.com/is-page-speed-really-that-important/",
"source_domain": "www.perrill.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "90835",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BODX65BHZZLURIYCHQXDD3FNCCUJDI7P",
"WARC-Concurrent-To": "<urn:uuid:43948d1b-cfaa-4cd4-aaf0-b2e5aef2239c>",
"WARC-Date": "2024-02-24T13:56:44Z",
"WARC-IP-Address": "192.124.249.65",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:H3ZOEX4RM5GSC665MCGVD3TEJGQVAUWK",
"WARC-Record-ID": "<urn:uuid:869a6f4d-0bcf-4e15-96e6-8f6f6feaff81>",
"WARC-Target-URI": "https://www.perrill.com/is-page-speed-really-that-important/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2992cb6e-7023-43dc-b07c-2fc9d634d1c7>"
},
"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-123\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
5,
10,
11,
48,
49,
86,
87,
471,
472,
492,
493,
1180,
1181,
1218,
1219,
1825,
1826,
2388,
2389,
2599,
2600,
3050,
3051,
3089,
3090,
3738,
3739,
3780,
3781,
4274,
4275,
4749,
4750,
4783,
4784,
5367,
5368,
5401,
5402,
5559,
5560,
5950,
5951,
6072,
6073,
6308,
6309,
6486,
6487,
6521,
6522,
6624,
6625,
6676,
6677,
6887,
6888,
6913,
6914,
7096,
7097,
7142,
7143,
7236,
7237,
7289,
7290,
7364,
7365,
7385,
7386,
7627,
7628,
7870,
7871,
7882,
7883,
7892,
7893,
8292,
8293,
8300,
8301,
8310,
8311,
8321,
8322,
8330,
8331,
8336,
8337
],
"line_end_idx": [
5,
10,
11,
48,
49,
86,
87,
471,
472,
492,
493,
1180,
1181,
1218,
1219,
1825,
1826,
2388,
2389,
2599,
2600,
3050,
3051,
3089,
3090,
3738,
3739,
3780,
3781,
4274,
4275,
4749,
4750,
4783,
4784,
5367,
5368,
5401,
5402,
5559,
5560,
5950,
5951,
6072,
6073,
6308,
6309,
6486,
6487,
6521,
6522,
6624,
6625,
6676,
6677,
6887,
6888,
6913,
6914,
7096,
7097,
7142,
7143,
7236,
7237,
7289,
7290,
7364,
7365,
7385,
7386,
7627,
7628,
7870,
7871,
7882,
7883,
7892,
7893,
8292,
8293,
8300,
8301,
8310,
8311,
8321,
8322,
8330,
8331,
8336,
8337,
8349
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8349,
"ccnet_original_nlines": 91,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4277286231517792,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0023598799016326666,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13569322228431702,
"rps_doc_frac_unique_words": 0.3830811679363251,
"rps_doc_mean_word_length": 4.586657524108887,
"rps_doc_num_sentences": 97,
"rps_doc_symbol_to_word_ratio": 0.0005899699754081666,
"rps_doc_unigram_entropy": 5.546770095825195,
"rps_doc_word_count": 1454,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.01994301937520504,
"rps_doc_frac_chars_dupe_6grams": 0.016494229435920715,
"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.03913630172610283,
"rps_doc_frac_chars_top_3gram": 0.009896540082991123,
"rps_doc_frac_chars_top_4gram": 0.011995799839496613,
"rps_doc_books_importance": -859.839111328125,
"rps_doc_books_importance_length_correction": -859.839111328125,
"rps_doc_openwebtext_importance": -432.21661376953125,
"rps_doc_openwebtext_importance_length_correction": -432.21661376953125,
"rps_doc_wikipedia_importance": -279.588623046875,
"rps_doc_wikipedia_importance_length_correction": -279.588623046875
},
"fasttext": {
"dclm": 0.030952220782637596,
"english": 0.9533079862594604,
"fineweb_edu_approx": 1.8999654054641724,
"eai_general_math": 0.04272859916090965,
"eai_open_web_math": 0.12157595157623291,
"eai_web_code": 0.04746698960661888
}
}
|
{
"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": "658.87",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-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
|
5,006,717,393,520,061,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 numberUS7356820 B2
Publication typeGrant
Application numberUS 09/898,978
Publication date8 Apr 2008
Filing date2 Jul 2001
Priority date2 Jul 2001
Fee statusPaid
Also published asUS8245231, US8327369, US20030005026, US20080141257, US20080235694
Publication number09898978, 898978, US 7356820 B2, US 7356820B2, US-B2-7356820, US7356820 B2, US7356820B2
InventorsFred A. Bower, III
Original AssigneeInternational Business Machines Corporation
Export CitationBiBTeX, EndNote, RefMan
External Links: USPTO, USPTO Assignment, Espacenet
Method of launching low-priority tasks
US 7356820 B2
Abstract
A driver is provided to manage launching of tasks at different levels of priority and within the parameters of the firmware interface. The driver includes two anchors for managing the tasks, a dispatcher and an agent. The dispatcher operates at a medium priority level and manages communication from a remote administrator. The agent functions to receive communications from the dispatcher by way of a shared data structure and to launch lower priority level tasks in respond to the communication. The shared data structure stores communications received from the dispatcher. Upon placing the communication in the shared data structure, the dispatcher sends a signal to the agent indicating that a communication is in the data structure for reading by the agent. Following reading of the communication in the data structure, the agent launches the lower priority level task and sends a signal to the data structure indicating the status of the task. Accordingly, a higher level task maintains its level of operation and spawns lower level tasks through the dispatcher in conjunction with the agent.
Images(4)
Previous page
Next page
Claims(6)
1. A computer implemented method for managing tasks comprising:
a message manager operating at a high priority level receiving a message from a remote administrator within system firmware to launch a low priority task;
said message manager placing a message in a data structure shared between said message manager and a task manager operating at a low priority level;
said message manager communicating said low priority task to said task manager through said data structure, wherein the step of communicating said low priority task to said task manager includes setting a flag for signaling receipt of said message and said task manager reading said message in said data structure and launching said low priority task in response to said flag;
launching said low priority task received from said message manager in response to receipt of said message and absent a suspension selected from the group consisting of: a system interrupt and a pause in a higher level task operation; and
resetting said flag following launch of said low priority task.
2. The method of claim 1, wherein the step of launching said lower priority task includes an agent.
3. The method of claim 1, wherein the step of receiving said message from said remote administrator includes a dispatcher.
4. The method of claim 1, wherein said message manager maintains a level of operation.
5. A computer implemented method comprising:
receiving a message from a remote administrator within system firmware to launch a low priority level task, wherein receipt of said message is by a message manager operating at a higher priority level than said low priority level task;
storing said message in a data structure shared between said message manager and a task manager operating at a low priority level;
communicating said low priority level task to said task manager through said data structure;
setting a flag to indicate receipt of said message in said data structure to said task manager;
reading said message in said data structure and launching said low priority level task in response to said flag by said task manager including said task manager launching said low priority level task received from said message manager in response to said message and absent a suspension selected from the group consisting of: a system interrupt and a pause in a higher level task operation; and
resetting said flag following launch of said low priority level task.
6. The method of claim 5, further comprising said message manager maintaining a level of operation.
Description
BACKGROUND OF THE INVENTION
1. Technical Field
This invention relates to a driver operating in a firmware environment. More specifically, the driver manages launching of tasks at different priority levels while maintaining a predetermined level of operation.
2. Description of the Prior Art
Firmware is software that is stored in hardware, such that the software is retained even after power to the hardware ceases. At boot time, the firmware of a computer or computer system stores and uses information describing a computer's processors, nodes, memory and other devices. The firmware operates on a parallel platform to the operating system.
In prior art computers, the firmware enabled system interrupts to occur in order to launch different applications at different priority levels. The prior art systems require a greater amount of functionality to accommodate system interrupts. Some firmware interface environments disable system interrupts to reduce the amount of functionality required to operate the machines in the system. The Intel Extensible Firmware Interface (EFI) is one firmware environment which reduces functionality required to operate the machine by disabling interrupts. In addition to disabling system interrupts, tasks within the EFI may temporarily increase their priority level of operation, but they are not allowed to decrease the priority level. Accordingly, tasks operating within the EFI environment, or similar platforms, are not permitted to execute system interrupts to execute tasks that may be operating at different levels of priority and may increase priority levels.
There are two types of operating programs within the EFI: a driver and an application. The driver provides a set of resources, i.e. programming interfaces. Once a driver is loaded within the firmware environment, it remains in the system for future application. The driver is not permitted to load other drivers after its initialization has completed. In addition, the EFI also prohibits the ability to load applications from a resident driver. An application is an executable program that is loaded, executed and expires. During run time, the application can load other drivers and applications. Accordingly, the application is executed for loading a driver to operate within the firmware environment and within the protocols of the system.
There is therefore a need to launch a driver that will prioritize execution of different priority levels of tasks within the confines of the EFI firmware environment. The driver must be launched by an application that will allow it to remain resident within the firmware and will provide all the required protocols for operating independently and without the need to launch secondary drivers. Accordingly, it is desirable to design a driver that will allow lower priority level applications to be launched without executing a system interrupt and without changing the priority level of a higher level application already in use.
SUMMARY OF THE INVENTION
This invention comprises a driver for operating in a firmware environment. The driver manages launching of tasks at different priority levels while maintaining a predetermined level of operation.
A first aspect of the invention is a method of spawning a lower priority level task from a higher level priority task. A dispatcher is utilized for receiving messages from a remote administrator. An agent is utilized for launching a lower priority task. Upon receiving a message to spawn a lower priority task, the dispatcher places the message in a shared data structure. The dispatcher then sets a flag for signaling to the agent receipt of the message. The agent launches the lower priority task in response to the message and resets the flag for future task assignments.
A second aspect of the invention is a computer system which includes a message manager to receive messages from a remote administrator, and a task manager to launch a lower priority task in response to a message received from the message manager. In addition, a data structure is provided to communicate the message from the message manager to the task manager. A dispatcher manager is provided to forward the instruction from the message manager to the data structure. In addition, a flag is provided to signal to the task manager receipt of the instruction in the data structure. Following the launch of the lower priority task, the task manager resets the flag. During the communication and launching of the lower priority task, a higher priority task maintains its level of operation.
A third aspect of the invention is an article comprising a computer-readable data storage medium. In the medium, the article includes means for receiving messages from a remote administrator and means for launching lower priority level tasks in response to the messages. The message receiving means stores the message in a data structure. A flag is provided by the message receiving means to signal receipt of instructions by the data structure to the launching means. A higher priority task maintains its level of operation during launch of the lower priority task.
Other features and advantages of this invention will become apparent from the following detailed description of the presently preferred embodiment of the invention, taken in conjunction with the accompanying drawings.
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 is a block diagram of the driver according to the preferred embodiment of this invention, and is suggested for printing on the first page of the issued patent.
FIG. 2 is a flow chart illustrating the process of initializing the driver.
FIG. 3 is a flow chart illustrating the process of launching a lower priority task.
DESCRIPTION OF THE PREFERRED EMBODIMENT Overview
In a low-level operating environment, system interrupts may be disabled to reduce the amount of functionality required to operate the machine. This environment allows operating functions to increase their specific level of operation, but does not allow them to decrease their level of operation. The method and system of the preferred embodiment employ a shared data structure in conjunction with a communication tool to allow a higher priority task to launch lower priority tasks. Accordingly, this allows for a higher priority task to maintain a specific level of operation.
Technical Background
Specific extensible firmware environments are known to operate at a low level without the use of system interrupts. The Intel EFI is one such firmware environment. In addition to disabling interrupts, the firmware places additional limitations in its functionality. For example, the firmware limits a task to one of three priority levels, low, medium and high. A given task may temporarily increase its priority level of operation if it is operating at a low or medium priority level, but it is not allowed to decrease its level of operation. In addition, the only place the firmware enables a driver to load other firmware modules is in its initialization code. Accordingly, a driver to enable launching of lower priority tasks must work within the confines of the firmware protocols.
The driver must provide for a higher priority task to maintain operation at a higher level of operation, i.e. high or medium level in a three tier environment. FIG. 1 is a block diagram 10 illustrating the flow of communication in the diagnostic device driver of the preferred embodiment. The two primary components of the driver are a dispatcher 20 for receiving messages from a remote administrator 30, and an agent 40 for launching lower level tasks. The remote administrator 30 exists within the firmware and is responsible for running diagnostics. The dispatcher 20 receives messages from the remote administrator 30 and responds to receipt of the messages. Upon receiving a communication from the remote administrator 30, the dispatcher 20 communicates receipt to a data structure 50. Accordingly, the dispatcher 20 functions as a communication tool from the remote administrator 30 to the data structure 50.
The dispatcher 20 operates at a medium priority level and functions to receive and respond to messages from a remote administrator 30, and to place the messages in the shared data structure 50. Within the restrictions of the firmware environment, the dispatcher is unable to load tests. The dispatcher 20 does not execute operations, rather it functions as a communication tool for a higher level task desiring to launch a lower level task. In the confines of the system design, the higher level task cannot lower its priority level. Therefore, the higher level task must communicate the desire to spawn a lower priority level task. The agent 40 is resident at a lower priority level to act as a command dispatcher and to launch applications and load drivers 45 at lower priority levels. Accordingly, the dispatcher 20 is employed to assist in the spawning of tasks at a lower priority level of operation than the higher level task.
The data structure 50 is shared between the dispatcher 20 and the agent 40. The shared memory provides a basis for communication between the higher level task and the agent 40. The shared data structure 50 is a communication base shared by the two components. The agent 40 operates at a lower priority level than the dispatcher 20. Upon receiving messages from the remote administrator 30, the dispatcher 20 communicates receipt with the shared data structure 50. The shared data structure 50 communicates receipt of a communication from the dispatcher to the agent 40. A flag 55 is utilized as a communication tool from the shared data structure 50 to the agent 40. Accordingly, the dispatcher 20 and the agent 40 are the two major components of the diagnostic driver utilizing the flag 55 as the communication tool therebetween.
The agent 40 functions to launch lower level tasks in a loop. The agent 40 launches a lower level task only when prompted to do so by an event triggered by a higher level task. The agent 40 functions to perform a desired activity on behalf of the higher level task, while allowing the higher level task to maintain operation at its specified level. The flag 55 is instituted to awaken the agent 40 when a spawning of a lower level task is desired. Upon receiving the flag 55, the agent 40 reads the message placed in the shared data structure by the dispatcher 20. The flag 55 is a signal for the agent 40 to read the shared data structure 50 at a particular position. The agent 40 then launches the requested task at the lower priority level. Once the lower level task 60 has been launched, the agent 40 resets the flag 55. Accordingly, the agent 40 remains in an inactive state until such time as a flag 55 is set by the placement of a command message in the shared data structure 50.
FIG. 2 is a flow chart 200 illustrating implementation of the structure of the preferred embodiment. The firmware only permits drivers to load other firmware modules in its initialization code, it does not permit a driver to load other drivers after the driver's initialization has completed. Within these confines, the agent in the form of an application is the first module to be loaded 210. An application can load other applications and drivers during run time. The agent application is responsible for loading the remaining components of the structure, including the dispatcher 220. The remote administrator is existent within the firmware, and does not require any loading by the agent application. The remote administrator represents a control entity within the firmware and is responsible for running diagnostics and a path to the user interface. During loading of the dispatcher driver 220, the dispatcher and the remote administrator handshake 230, thereby making both the dispatcher and the remote administrator aware of their functions. Additionally, the dispatcher and the agent handshake 240 making both anchors aware of their related functions. In a preferred embodiment, the order of the handshaking steps 230 and 240 is interchangeable and is not critical to the function of the driver. The agent application acts as a command dispatcher for the diagnostic test following installation as a driver. This allows the dispatcher to spawn sub-tests at a lower priority. Accordingly, loading the structure in the form of drivers and adhering to the firmware guidelines allows the drivers within the structure to operate in stages.
FIG. 3 is a flow chart 300 illustrating the process of launching a lower priority level task from a higher level priority task. The remote administrator sends a message to the dispatcher 310 indicating the need to launch a lower priority level task. The dispatcher communicates receipt of the message from the remote administrator by placing a message in the shared data structure 320. Upon receiving a message from the shared dispatcher, the shared data structure sends a signal to the agent 330 indicating the need to launch a lower priority level task. The agent receives the signal and reads the instructions placed in the shared data structure. Following receipt of the instructions, the agent spawns the requested lower priority level task 340. Once the lower priority level task has been launched, the agent sends a signal to the data structure 350 indicating launching of the lower priority level task. The agent remains idle until the next time it receives a signal 330 from the shared data structure to launch a lower priority level task. Accordingly, the process employed for launching lower priority level tasks from a higher priority level tasks allows the agent to remain in memory in an inactive state until events cause the agent to become active.
Advantages Over the Prior Art
Prior art systems are designed to accommodate system interrupts to permit spawning of different tasks at different levels of operation. To either avoid the use of system interrupts, or in an environment where system interrupts are disabled, the invention permits the launching of lower priority level tasks without requiring the need to invoke a system interrupt or await a pause in the higher level task's operations.
Alternative Embodiments
It will be appreciated that, although specific embodiments of the invention have been described herein for purposes of illustration, various modifications may be made without departing from the spirit and scope of the invention. In particular, the scope of the invention is not limited to a three level system. The invention may be incorporated into a system with fewer or greater priority levels of operations. In addition, the invention may be incorporated into a system designed to accommodate system interrupts. Accordingly, this would allow the system to continue operation by disabling interrupts and incorporating the driver herein to enable launching of lower priority level tasks during operation of a higher priority level task.
In addition to operation of the system, the method of installing the driver is merely a preferred method of installing the components of the driver. However, there may be alternative methods of installation which would allow the components of the driver to function within the design parameters of the system firmware. Additionally, the agent does not necessarily have to be a cooperative agent application. Accordingly, the scope of protection of this invention is limited only by the following claims and their equivalents.
Patent Citations
Cited PatentFiling datePublication dateApplicantTitle
US6021438 *18 Jun 19971 Feb 2000Wyatt River Software, Inc.License management system using daemons and aliasing
US6088796 *6 Aug 199811 Jul 2000Cianfrocca; FrancisSecure middleware and server control system for querying through a network firewall
US6119118 *1 Jun 199912 Sep 2000Apple Computer, Inc.Method and system for extending file system metadata
US6349336 *15 Feb 200019 Feb 2002Hewlett-Packard CompanyAgent/proxy connection control across a firewall
US6393481 *20 Oct 199921 May 2002Worldcom, Inc.Method and apparatus for providing real-time call processing services in an intelligent network
US6442550 *14 Dec 199927 Aug 2002International Business Machines CorporationSystem and method in a collaborative data processing environment for customizing the quality of service on a per-client basis
US6460037 *1 Feb 19991 Oct 2002Mitel Knowledge CorporationAgent-based data mining and warehousing
US6460070 *3 Jun 19981 Oct 2002International Business Machines CorporationMobile agents for fault diagnosis and correction in a distributed computer environment
US6529932 *1 Apr 19984 Mar 2003Microsoft CorporationMethod and system for distributed transaction processing with asynchronous message delivery
US6621851 *28 Nov 200016 Sep 2003At&T Wireless Services, Inc.Priority messaging method for a discrete multitone spread spectrum communications system
US6647421 *10 Dec 200111 Nov 2003Webtv Networks, Inc.Method and apparatus for dispatching document requests in a proxy
US6697962 *20 Oct 200024 Feb 2004Unisys CorporationRemote computer system monitoring and diagnostic board
US6704819 *19 Apr 20009 Mar 2004Microsoft CorporationMethod and apparatus for device sharing and arbitration
US6782495 *19 Jun 200124 Aug 2004Xerox CorporationMethod for analyzing printer faults
US20020055846 *4 Jun 19989 May 2002Hajime TsuchitaniMessage handling method, message handling apparatus, and memory media for storing a message handling apparatus controlling program
US20020055980 *15 Aug 20019 May 2002Steve GoddardControlled server loading
US20020107905 *4 Feb 20028 Aug 2002Roe Colleen A.Scalable agent service system
US20020112089 *10 Apr 200215 Aug 2002Compaq Information Technologies Group, L.P.Method and system for supporting a system call and interprocess communication in a fault-tolerant,scalable distributed computer environment
US20020133805 *9 Mar 200119 Sep 2002Pugh William A.Multi-version hosting of application services
US20020138670 *26 Mar 200126 Sep 2002International Business Machines CorporationMethod, system, and program for prioritizing input/output (I/O) requests submitted to a device driver
US20020147389 *6 Nov 200110 Oct 2002Samuel CavallaroMethod and apparatus for concurrently displaying respective images representing real-time data and non-real-time data
US20020156932 *20 Apr 200124 Oct 2002Marc SchneidermanMethod and apparatus for providing parallel execution of computing tasks in heterogeneous computing environments using autonomous mobile agents
US20030214943 *9 Aug 200220 Nov 2003Microsoft CorporationMethod for switching protocols transparently in multi-user applications
US20040133609 *24 Oct 20038 Jul 2004Moore Reagan W.System of and method for transparent management of data objects in containers across distributed heterogenous resources
Referenced by
Citing PatentFiling datePublication dateApplicantTitle
US7478141 *26 Jun 200313 Jan 2009Intel CorporationAccessing firmware of a remote computer system using a remote firmware interface
US7703100 *12 Jul 200420 Apr 2010Computer Associates Think, Inc.Modified auto remote agent for job scheduling and management applications
US7865903 *23 Jun 20084 Jan 2011International Business Machines CorporationProcessing messages of agents
US8245231 *26 Sep 200714 Aug 2012International Business Machines CorporationMethod of launching low-priority tasks
Classifications
U.S. Classification718/103, 718/100, 718/102, 718/107, 719/318
International ClassificationG06F9/46, G06F9/00, G06F9/48
Cooperative ClassificationG06F9/4843
European ClassificationG06F9/48C4
Legal Events
DateCodeEventDescription
2 Jul 2001ASAssignment
Owner name: INTERNATIONAL BUSINESS MACHINES CORPORATION, NEW Y
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:BOWER, FRED A., III;REEL/FRAME:011969/0470
Effective date: 20010702
21 Nov 2011REMIMaintenance fee reminder mailed
22 Mar 2012FPAYFee payment
Year of fee payment: 4
22 Mar 2012SULPSurcharge for late payment
|
{
"url": "http://www.google.ca/patents/US7356820?ie=ISO-8859-1",
"source_domain": "www.google.ca",
"snapshot_id": "crawl=CC-MAIN-2015-27",
"warc_metadata": {
"Content-Length": "68818",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VQXLO53FERQO7TDNNS6NURIC46W45KTB",
"WARC-Concurrent-To": "<urn:uuid:8ec1c59e-1fbc-40b3-9f69-c861c56ee96e>",
"WARC-Date": "2015-07-02T05:28:45Z",
"WARC-IP-Address": "74.125.228.207",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:LV7GXVNPRAYJ6BG63GDL5TX2NDSM4VSX",
"WARC-Record-ID": "<urn:uuid:99b6d3e2-9ad7-4ce8-a59f-c9822a79c2d3>",
"WARC-Target-URI": "http://www.google.ca/patents/US7356820?ie=ISO-8859-1",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:85aa9954-9b4f-447f-8faa-37d724fac897>"
},
"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,
56,
64,
205,
206,
214,
215,
243,
274,
296,
328,
355,
377,
401,
416,
499,
605,
633,
694,
733,
784,
823,
837,
846,
1945,
1955,
1969,
1979,
1989,
2053,
2208,
2357,
2734,
2973,
3037,
3137,
3260,
3347,
3392,
3628,
3759,
3852,
3948,
4343,
4413,
4513,
4525,
4553,
4554,
4573,
4574,
4786,
4787,
4819,
4820,
5172,
5173,
6136,
6137,
6879,
6880,
7509,
7510,
7535,
7536,
7732,
7733,
8308,
8309,
9098,
9099,
9666,
9667,
9885,
9886,
9920,
9921,
10088,
10089,
10165,
10166,
10250,
10251,
10300,
10301,
10878,
10879,
10900,
10901,
11687,
11688,
12603,
12604,
13537,
13538,
14369,
14370,
15357,
15358,
17000,
17001,
18265,
18266,
18296,
18297,
18716,
18717,
18741,
18742,
19481,
19482,
20008,
20009,
20026,
20080,
20191,
20326,
20431,
20536,
20679,
20881,
20979,
21140,
21284,
21434,
21553,
21659,
21768,
21854,
22037,
22112,
22191,
22411,
22508,
22690,
22860,
23058,
23187,
23358,
23372,
23427,
23558,
23696,
23801,
23916,
23932,
23995,
24052,
24089,
24123,
24136,
24161,
24184,
24247,
24350,
24375,
24422,
24449,
24472
],
"line_end_idx": [
56,
64,
205,
206,
214,
215,
243,
274,
296,
328,
355,
377,
401,
416,
499,
605,
633,
694,
733,
784,
823,
837,
846,
1945,
1955,
1969,
1979,
1989,
2053,
2208,
2357,
2734,
2973,
3037,
3137,
3260,
3347,
3392,
3628,
3759,
3852,
3948,
4343,
4413,
4513,
4525,
4553,
4554,
4573,
4574,
4786,
4787,
4819,
4820,
5172,
5173,
6136,
6137,
6879,
6880,
7509,
7510,
7535,
7536,
7732,
7733,
8308,
8309,
9098,
9099,
9666,
9667,
9885,
9886,
9920,
9921,
10088,
10089,
10165,
10166,
10250,
10251,
10300,
10301,
10878,
10879,
10900,
10901,
11687,
11688,
12603,
12604,
13537,
13538,
14369,
14370,
15357,
15358,
17000,
17001,
18265,
18266,
18296,
18297,
18716,
18717,
18741,
18742,
19481,
19482,
20008,
20009,
20026,
20080,
20191,
20326,
20431,
20536,
20679,
20881,
20979,
21140,
21284,
21434,
21553,
21659,
21768,
21854,
22037,
22112,
22191,
22411,
22508,
22690,
22860,
23058,
23187,
23358,
23372,
23427,
23558,
23696,
23801,
23916,
23932,
23995,
24052,
24089,
24123,
24136,
24161,
24184,
24247,
24350,
24375,
24422,
24449,
24472,
24513
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 24513,
"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.32752448320388794,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02888518013060093,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13630938529968262,
"rps_doc_frac_unique_words": 0.2150307595729828,
"rps_doc_mean_word_length": 5.441561698913574,
"rps_doc_num_sentences": 171,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.363722324371338,
"rps_doc_word_count": 3739,
"rps_doc_frac_chars_dupe_10grams": 0.07303646951913834,
"rps_doc_frac_chars_dupe_5grams": 0.2633441388607025,
"rps_doc_frac_chars_dupe_6grams": 0.19772927463054657,
"rps_doc_frac_chars_dupe_7grams": 0.13309741020202637,
"rps_doc_frac_chars_dupe_8grams": 0.10916151106357574,
"rps_doc_frac_chars_dupe_9grams": 0.09893836826086044,
"rps_doc_frac_chars_top_2gram": 0.011550179682672024,
"rps_doc_frac_chars_top_3gram": 0.0176938995718956,
"rps_doc_frac_chars_top_4gram": 0.015138110145926476,
"rps_doc_books_importance": -1610.4036865234375,
"rps_doc_books_importance_length_correction": -1610.4036865234375,
"rps_doc_openwebtext_importance": -921.921875,
"rps_doc_openwebtext_importance_length_correction": -921.921875,
"rps_doc_wikipedia_importance": -625.4220581054688,
"rps_doc_wikipedia_importance_length_correction": -625.4220581054688
},
"fasttext": {
"dclm": 0.13606518507003784,
"english": 0.8834983110427856,
"fineweb_edu_approx": 2.3290364742279053,
"eai_general_math": 0.15800809860229492,
"eai_open_web_math": 0.08242487907409668,
"eai_web_code": 0.05550866946578026
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "20",
"label": "Structured Data"
}
},
"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
|
-7,459,124,942,607,206,000 |
Cactivedataprovider With Custom Query
Hello!
I’m trying to use CActiveDataProvider to display the overall score (based on the average of three categories of the table “rating”) in my CListView.
The following code shows no errors, and also can not access the score in CListView.
The command print_r($data), prints no information on the rating section: Array ( [rating] => Array ( ) )
Please help me!
Thanks!
ModelController.php
public function actionIndex()
{
$dataProvider=new CActiveDataProvider('Model', array(
'criteria'=>array(
'order'=>'t.id DESC',
'with'=>array('rating'=>array('select'=>array('AVG(cat1+cat2+cat3) AS score'))),
)));
$this->render('index',array(
'dataProvider'=>$dataProvider
));
}
index.php
<?php $this->widget('zii.widgets.CListView', array(
'dataProvider'=>$dataProvider,
'itemView'=>'_view'
)); ?>
I used below code in my project.
Add this code in components
<?php
class MyActiveDataProvider extends CActiveDataProvider {
protected function calculateTotalItemCount() {
$baseCriteria=$this->model->getDbCriteria(false);
if ($baseCriteria!==null)
$baseCriteria=clone $baseCriteria;
//You can get real records count only in this way (when you use JOIN and GROUP BY)
$count=count($this->model->findAll($this->getCriteria()));
$this->model->setDbCriteria($baseCriteria);
return $count;
}
}
?>
model search function
<?php
public function searchbygroup()
{
$criteria=new CDbCriteria;
//custom query
$criteria->select=array('*,concat(documentid,"_",userid) as groupid,count(documentid) as downloadcount');
//Add Different Condition
$criteria->compare('userid',$this->userid,true);
$criteria->addCondition("documentid IN ('$this->documentid')");
$criteria->addBetweenCondition('createdon',$this->datefrom,$this->dateto);
// group by , if need
$criteria->group='groupid';
//return new CActiveDataProvider($this, array( 'criteria'=>$criteria, ));
return new MyActiveDataProvider($this,array('criteria'=>$criteria));
}
?>
Hey mbala! Thanks for your time.
I’m a newbie, my apologies, but where I have to change your code so I can calculate the score based on the average of three columns from another table?
Thanks!
Try this
public function actionIndex()
{
$criteria=new CDbCriteria;
$criteria->select=array('*,AVG(cat1+cat2+cat3) AS score');
$criteria->order='id desc';
$dataProvider=new MyActiveDataProvider($this,array('criteria'=>$criteria));
$this->render('index',array(
'dataProvider'=>$dataProvider
));
}
add your model name instead of $this
$dataProvider=new MyActiveDataProvider('modelname',array('criteria'=>$criteria));
$this->render('index',array(
'dataProvider'=>$dataProvider
));
Hello,
Sorry to say this,
But it could not resolve my issue related to speedup.
|
{
"url": "https://forum.yiiframework.com/t/cactivedataprovider-with-custom-query/72198",
"source_domain": "forum.yiiframework.com",
"snapshot_id": "CC-MAIN-2023-23",
"warc_metadata": {
"Content-Length": "32087",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MFZDZGDRMGVHG3T47G4QZYHALFCZXCPG",
"WARC-Concurrent-To": "<urn:uuid:277bfe9b-4128-4854-b395-9b681f49380c>",
"WARC-Date": "2023-06-02T21:27:00Z",
"WARC-IP-Address": "159.69.125.49",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PCZD65Z335GJYFFOELA67G4QZA5H3HK7",
"WARC-Record-ID": "<urn:uuid:917b0337-21ee-4dd4-a585-0c67690e8964>",
"WARC-Target-URI": "https://forum.yiiframework.com/t/cactivedataprovider-with-custom-query/72198",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:db3fecd0-5bd9-4c2a-8787-b0633eb59046>"
},
"warc_info": "isPartOf: CC-MAIN-2023-23\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-225\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,
38,
39,
46,
47,
196,
197,
281,
282,
387,
388,
404,
405,
413,
414,
434,
435,
436,
437,
438,
468,
469,
472,
473,
529,
530,
552,
553,
579,
580,
665,
666,
674,
675,
676,
707,
708,
741,
742,
748,
749,
752,
753,
754,
755,
765,
766,
767,
768,
769,
821,
822,
854,
855,
876,
877,
884,
885,
886,
887,
920,
921,
949,
950,
951,
952,
953,
959,
960,
1017,
1018,
1019,
1070,
1071,
1129,
1130,
1164,
1165,
1216,
1217,
1308,
1309,
1376,
1377,
1429,
1430,
1453,
1454,
1460,
1461,
1463,
1464,
1467,
1468,
1469,
1470,
1492,
1493,
1494,
1495,
1496,
1502,
1503,
1539,
1540,
1543,
1544,
1580,
1581,
1598,
1599,
1713,
1714,
1742,
1743,
1794,
1795,
1867,
1868,
1945,
1946,
1976,
1977,
2013,
2014,
2093,
2094,
2171,
2172,
2175,
2176,
2179,
2180,
2181,
2182,
2183,
2216,
2217,
2369,
2370,
2378,
2379,
2388,
2389,
2390,
2391,
2392,
2422,
2423,
2425,
2426,
2461,
2462,
2522,
2523,
2559,
2560,
2563,
2564,
2641,
2642,
2672,
2673,
2704,
2705,
2710,
2711,
2713,
2714,
2715,
2716,
2753,
2754,
2755,
2756,
2757,
2847,
2848,
2885,
2886,
2924,
2925,
2937,
2938,
2945,
2964
],
"line_end_idx": [
38,
39,
46,
47,
196,
197,
281,
282,
387,
388,
404,
405,
413,
414,
434,
435,
436,
437,
438,
468,
469,
472,
473,
529,
530,
552,
553,
579,
580,
665,
666,
674,
675,
676,
707,
708,
741,
742,
748,
749,
752,
753,
754,
755,
765,
766,
767,
768,
769,
821,
822,
854,
855,
876,
877,
884,
885,
886,
887,
920,
921,
949,
950,
951,
952,
953,
959,
960,
1017,
1018,
1019,
1070,
1071,
1129,
1130,
1164,
1165,
1216,
1217,
1308,
1309,
1376,
1377,
1429,
1430,
1453,
1454,
1460,
1461,
1463,
1464,
1467,
1468,
1469,
1470,
1492,
1493,
1494,
1495,
1496,
1502,
1503,
1539,
1540,
1543,
1544,
1580,
1581,
1598,
1599,
1713,
1714,
1742,
1743,
1794,
1795,
1867,
1868,
1945,
1946,
1976,
1977,
2013,
2014,
2093,
2094,
2171,
2172,
2175,
2176,
2179,
2180,
2181,
2182,
2183,
2216,
2217,
2369,
2370,
2378,
2379,
2388,
2389,
2390,
2391,
2392,
2422,
2423,
2425,
2426,
2461,
2462,
2522,
2523,
2559,
2560,
2563,
2564,
2641,
2642,
2672,
2673,
2704,
2705,
2710,
2711,
2713,
2714,
2715,
2716,
2753,
2754,
2755,
2756,
2757,
2847,
2848,
2885,
2886,
2924,
2925,
2937,
2938,
2945,
2964,
3017
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3017,
"ccnet_original_nlines": 185,
"rps_doc_curly_bracket": 0.003314550034701824,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.18448275327682495,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02413792908191681,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.40689656138420105,
"rps_doc_frac_unique_words": 0.5925925970077515,
"rps_doc_mean_word_length": 8.296296119689941,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.770973205566406,
"rps_doc_word_count": 243,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0287698395550251,
"rps_doc_frac_chars_dupe_6grams": 0.0287698395550251,
"rps_doc_frac_chars_dupe_7grams": 0.0287698395550251,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.007440479937940836,
"rps_doc_frac_chars_top_3gram": 0.011904760263860226,
"rps_doc_frac_chars_top_4gram": 0.014880949631333351,
"rps_doc_books_importance": -278.5751953125,
"rps_doc_books_importance_length_correction": -278.5751953125,
"rps_doc_openwebtext_importance": -175.23475646972656,
"rps_doc_openwebtext_importance_length_correction": -175.23475646972656,
"rps_doc_wikipedia_importance": -150.7190704345703,
"rps_doc_wikipedia_importance_length_correction": -150.7190704345703
},
"fasttext": {
"dclm": 0.033766329288482666,
"english": 0.4684213399887085,
"fineweb_edu_approx": 1.280078649520874,
"eai_general_math": 0.45657432079315186,
"eai_open_web_math": 0.4735546112060547,
"eai_web_code": 0.4053083062171936
}
}
|
{
"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.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": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,869,334,744,014,923,300 |
Welcome to WebmasterWorld Guest from 54.221.55.153
Forum Moderators: open
Message Too Old, No Replies
Cookies and submitting
Do they need to be turned off
biggles
10:35 pm on Aug 18, 2002 (gmt 0)
10+ Year Member
Would someone please explain to me the recommendation some make for turning off cookies when submitting to search engines by hand.
I'm wondering if it's to stop search engines identifying people who oversubmit pages for one individual site. Fair enough they get caught out for spamming.
However if you're submitting within guidelines but for <b>multiple</b> sites is it still an issue? What do others do?
Thanks
Knowles
10:41 pm on Aug 18, 2002 (gmt 0)
10+ Year Member
Welcome to WebmasterWorld biggles, if no one else has offered that so far.
As long as you are not submitting duplicate sites I dont see the problem. Its possible I have missed the talk around here about it but I havent seen any. This to me sounds like an old wise tell.
Featured Threads
Hot Threads This Week
Hot Threads This Month
|
{
"url": "https://www.webmasterworld.com/forum27/415.htm",
"source_domain": "www.webmasterworld.com",
"snapshot_id": "crawl=CC-MAIN-2015-48",
"warc_metadata": {
"Content-Length": "33660",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:U6ST7QVWNLZMYXFHYJVAKMPMQ7RQTFNM",
"WARC-Concurrent-To": "<urn:uuid:bc765710-fc02-42f8-875b-cd9358485591>",
"WARC-Date": "2015-11-30T10:42:36Z",
"WARC-IP-Address": "72.10.193.101",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:D4MQLZ7NW6ZEPOYM4T6GCGBG452VIYE7",
"WARC-Record-ID": "<urn:uuid:f932473a-a05e-4a74-a53d-a134a7f8dc23>",
"WARC-Target-URI": "https://www.webmasterworld.com/forum27/415.htm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:61ff3a83-285e-4c38-9457-f326c551dd02>"
},
"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,
51,
52,
75,
76,
104,
105,
128,
129,
159,
160,
166,
167,
175,
176,
209,
210,
226,
227,
228,
229,
360,
361,
517,
518,
636,
637,
644,
645,
653,
654,
687,
688,
704,
705,
706,
707,
782,
783,
978,
979,
981,
982,
999,
1000,
1022,
1023
],
"line_end_idx": [
51,
52,
75,
76,
104,
105,
128,
129,
159,
160,
166,
167,
175,
176,
209,
210,
226,
227,
228,
229,
360,
361,
517,
518,
636,
637,
644,
645,
653,
654,
687,
688,
704,
705,
706,
707,
782,
783,
978,
979,
981,
982,
999,
1000,
1022,
1023,
1045
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1045,
"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.3669724762439728,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01834861934185028,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22018349170684814,
"rps_doc_frac_unique_words": 0.6988636255264282,
"rps_doc_mean_word_length": 4.568181991577148,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.689294815063477,
"rps_doc_word_count": 176,
"rps_doc_frac_chars_dupe_10grams": 0.07213930040597916,
"rps_doc_frac_chars_dupe_5grams": 0.07213930040597916,
"rps_doc_frac_chars_dupe_6grams": 0.07213930040597916,
"rps_doc_frac_chars_dupe_7grams": 0.07213930040597916,
"rps_doc_frac_chars_dupe_8grams": 0.07213930040597916,
"rps_doc_frac_chars_dupe_9grams": 0.07213930040597916,
"rps_doc_frac_chars_top_2gram": 0.02238805964589119,
"rps_doc_frac_chars_top_3gram": 0.057213928550481796,
"rps_doc_frac_chars_top_4gram": 0.02238805964589119,
"rps_doc_books_importance": -110.06470489501953,
"rps_doc_books_importance_length_correction": -110.06470489501953,
"rps_doc_openwebtext_importance": -62.87582015991211,
"rps_doc_openwebtext_importance_length_correction": -50.000179290771484,
"rps_doc_wikipedia_importance": -30.9614200592041,
"rps_doc_wikipedia_importance_length_correction": -30.9614200592041
},
"fasttext": {
"dclm": 0.042501211166381836,
"english": 0.9344936609268188,
"fineweb_edu_approx": 0.8093225359916687,
"eai_general_math": 0.006455299910157919,
"eai_open_web_math": 0.08006597310304642,
"eai_web_code": 0.002492370083928108
}
}
|
{
"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": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,943,383,786,436,609,000 |
DMZ on ESXI Servers
Hi Guys,
Firewall->HP Switch Layer 3 -> esxi servers 1,2
I'm a vmware vsphere 6 newbie.
I have 2 physical ESXI servers(ESXI v6) that host 30 virtual servers. vmWare vCenter 6 is set up properly. Desperatly looking for some help/advice on this.
Every physical server has 5 gigabit ethernet connections.
Connected NICs:
Management Network x1 (vmnic0)
LAN x3 ( vmnic 1,vmnic2) (30x Vms)
ISCSI x2 (vmnic3,vmnic4)
Everything is up and running smoothly on our production Network.
Now I need to connect these physical servers to DMZ since there are some vm's that should run on that part of our network.
How should I do that?
What are you guys doing out there?
How about vLANS? Can it be set up and span multiple subnets so I can keep all servers connected to internal LAN?
Thanks in advance.
needs needsAsked:
Who is Participating?
I wear a lot of hats...
"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.
systechadminConsultantCommented:
0
Andrew Hancock (VMware vExpert / EE MVE^2)VMware and Virtualization ConsultantCommented:
You can either dedicate two DMZ physical network interfaces and connect these to your DMZ
make sure you connect these two network ports on your switch to each ESXi host.
Or you could use VLANS.
0
Ben Personick (Previously QCubed)Lead Network EngineerCommented:
You losred LAN x3 but only show 2 nNICs so I suspect you mean LAN x
2.
I would run a second VLAN over the LAN adapters and use that for DMZ.
That would be the easiest setup and depending on your HP switches configuration, if they are already set up astrunks with allowed and default vlans
If they aren't already set up that way both are about equal in terms of work, and have similar caveats in doing the chamge without disruption.
However once VLans are in place you will be able to add more networks on additional Clans with very little effort and no chance of dissruption
0
Ultimate Tool Kit for Technology Solution Provider
Broken down into practical pointers and step-by-step instructions, the IT Service Excellence Tool Kit delivers expert advice for technology solution providers. Get your free copy now.
needs needsAuthor Commented:
Thank you so much for the Infos
@Ben can u please Little bit more info give? sorry LAN (2 x physical Nics connected.Name is only LAN.)
I would run a second VLAN over the LAN adapters and use that for DMZ. I think this is very interesting if i can achive it.
Thanks in advance
0
needs needsAuthor Commented:
By the way ,There is no VLAN configured on any HP Switches .
0
Andrew Hancock (VMware vExpert / EE MVE^2)VMware and Virtualization ConsultantCommented:
So you will have to complete some network re-design, and create a trunk using two physical network ports (a static trunk), and create VLANS for LAN and DMZ.
A bit puzzled because we discussed VLANS with you in this question?
https://www.experts-exchange.com/questions/29083986/vmware-trunk-NIC.html
0
Ben Personick (Previously QCubed)Lead Network EngineerCommented:
Thank you so much for the Infos
@Ben can u please Little bit more info give? sorry LAN (2 x physical Nics connected.Name is only LAN.)
I would run a second VLAN over the LAN adapters and use that for DMZ. I think this is very interesting if i can achieve it.
Thanks in advance
• 1) Create An additional vLAN on your switch (If your switch supports VLANS at all, there is already a default (VLAN 1) and you will be creating an additional VLAN say, VLAN 3, and labeling it DMZ
• 2) Connect your Router's DMZ interface to the switch on VLAN 3, or change it's interface to have VLAN interfaces and trunk them to the switch and set up the router/Firewall's Interface as a trunk port (Whichever you personally find easier, which I suspect will be the physical interfaces for now as you seem to be relatively unsure about basic network setup -- no offence intended)
• 3) On the ESXi Server pull one NIC out of the current vSwitch configuration for LAN.
• 4) On the Switch set that ESXi's NIC port to be a Trunk port with a native VLAN of VLAN 1 (IF POSSIBLE, Some low-grade switches don't allow the tagged an untagged vlans, so YMMV).
• 5) IF your switch allows VLANs to pass both tagged an untagged traffic then you can add the NIC back into the existing setup and then repeat steps 3 and 4 on the other NIC before moving on to Step 9.
• 6) IF your switch does not allow tagged an untagged VLANs, set the Set up the same existing LAN Network as a new vSwitch with similar name, the switch will have VLAN tagging set to 1.
• 7) Move a test VM to this switch and confirm it is working, once confirmed, move all remaining VMs LAN NICs to the new Network.
• 8) Remove the remaining NICE in the original LAN network and add it into the New LAN network.
• 9) Create a New vSwitch with VLAN 3 on it and name it for the DMZ.
0
Experts Exchange Solution brought to you by
Your issues matter to us.
Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.
Start your 7-day free trial
needs needsAuthor Commented:
Thank you all ,
0
Ben Personick (Previously QCubed)Lead Network EngineerCommented:
Glad to help :)
0
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today
Switches / Hubs
From novice to tech pro — start learning today.
Question has a verified solution.
Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.
Have a better answer? Share it in a comment.
|
{
"url": "https://www.experts-exchange.com/questions/29084822/DMZ-on-ESXI-Servers.html",
"source_domain": "www.experts-exchange.com",
"snapshot_id": "crawl=CC-MAIN-2018-30",
"warc_metadata": {
"Content-Length": "155720",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3XIABSYFSM2FIUYKBYBKDTUNIXB7Z54D",
"WARC-Concurrent-To": "<urn:uuid:ea1f45cc-fc54-49bd-8402-180973162ae2>",
"WARC-Date": "2018-07-17T14:20:00Z",
"WARC-IP-Address": "104.20.168.10",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Y2N4I3WEX3ZKI5OMBLTFZB565RHFHPIP",
"WARC-Record-ID": "<urn:uuid:89d363e3-65b2-4ee8-a7a3-044aed356f27>",
"WARC-Target-URI": "https://www.experts-exchange.com/questions/29084822/DMZ-on-ESXI-Servers.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8eb1c228-64b2-49d1-83a9-3ab11b696c85>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-170-172-222.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,
20,
21,
30,
31,
79,
80,
111,
267,
268,
326,
327,
343,
344,
375,
411,
436,
437,
438,
439,
440,
505,
506,
629,
630,
652,
687,
688,
801,
802,
803,
822,
840,
862,
886,
887,
1252,
1253,
1286,
1288,
1377,
1467,
1468,
1548,
1549,
1573,
1575,
1640,
1708,
1711,
1712,
1782,
1783,
1931,
1932,
2075,
2076,
2219,
2221,
2272,
2273,
2457,
2458,
2487,
2519,
2520,
2623,
2624,
2625,
2748,
2749,
2767,
2769,
2798,
2859,
2861,
2950,
3107,
3108,
3176,
3177,
3251,
3253,
3318,
3350,
3351,
3454,
3455,
3456,
3580,
3581,
3599,
3600,
3800,
4186,
4275,
4459,
4663,
4851,
4983,
5081,
5152,
5154,
5155,
5199,
5200,
5226,
5227,
5381,
5382,
5410,
5439,
5455,
5457,
5522,
5538,
5540,
5934,
5950,
5951,
5999,
6000,
6034,
6035,
6136,
6137
],
"line_end_idx": [
20,
21,
30,
31,
79,
80,
111,
267,
268,
326,
327,
343,
344,
375,
411,
436,
437,
438,
439,
440,
505,
506,
629,
630,
652,
687,
688,
801,
802,
803,
822,
840,
862,
886,
887,
1252,
1253,
1286,
1288,
1377,
1467,
1468,
1548,
1549,
1573,
1575,
1640,
1708,
1711,
1712,
1782,
1783,
1931,
1932,
2075,
2076,
2219,
2221,
2272,
2273,
2457,
2458,
2487,
2519,
2520,
2623,
2624,
2625,
2748,
2749,
2767,
2769,
2798,
2859,
2861,
2950,
3107,
3108,
3176,
3177,
3251,
3253,
3318,
3350,
3351,
3454,
3455,
3456,
3580,
3581,
3599,
3600,
3800,
4186,
4275,
4459,
4663,
4851,
4983,
5081,
5152,
5154,
5155,
5199,
5200,
5226,
5227,
5381,
5382,
5410,
5439,
5455,
5457,
5522,
5538,
5540,
5934,
5950,
5951,
5999,
6000,
6034,
6035,
6136,
6137,
6181
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6181,
"ccnet_original_nlines": 125,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36583462357521057,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06708268076181412,
"rps_doc_frac_lines_end_with_ellipsis": 0.007936510257422924,
"rps_doc_frac_no_alph_words": 0.1825273036956787,
"rps_doc_frac_unique_words": 0.37748342752456665,
"rps_doc_mean_word_length": 4.595080375671387,
"rps_doc_num_sentences": 64,
"rps_doc_symbol_to_word_ratio": 0.0007800299790687859,
"rps_doc_unigram_entropy": 5.458690643310547,
"rps_doc_word_count": 1057,
"rps_doc_frac_chars_dupe_10grams": 0.12023883312940598,
"rps_doc_frac_chars_dupe_5grams": 0.18056413531303406,
"rps_doc_frac_chars_dupe_6grams": 0.16162240505218506,
"rps_doc_frac_chars_dupe_7grams": 0.15544575452804565,
"rps_doc_frac_chars_dupe_8grams": 0.12023883312940598,
"rps_doc_frac_chars_dupe_9grams": 0.12023883312940598,
"rps_doc_frac_chars_top_2gram": 0.006176650058478117,
"rps_doc_frac_chars_top_3gram": 0.00926498044282198,
"rps_doc_frac_chars_top_4gram": 0.014206299558281898,
"rps_doc_books_importance": -538.6098022460938,
"rps_doc_books_importance_length_correction": -538.6098022460938,
"rps_doc_openwebtext_importance": -358.0460205078125,
"rps_doc_openwebtext_importance_length_correction": -358.0460205078125,
"rps_doc_wikipedia_importance": -279.64459228515625,
"rps_doc_wikipedia_importance_length_correction": -279.64459228515625
},
"fasttext": {
"dclm": 0.03382742032408714,
"english": 0.9040319323539734,
"fineweb_edu_approx": 1.1335537433624268,
"eai_general_math": 0.17935365438461304,
"eai_open_web_math": 0.3453044891357422,
"eai_web_code": 0.009985149838030338
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.17",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,059,238,891,031,830,000 |
Evento desencadenante cuando se presiona el botón en Android
Tengo el siguiente código para Android que funciona bien para reproducir un sonido una vez que se hace clic en un botón:
Button SoundButton2 = (Button)findViewById(R.id.sound2); SoundButton2.setOnClickListener(new OnClickListener() { public void onClick(View v) { mSoundManager.playSound(2); } });
Mi problema es que quiero que el sonido se reproduzca inmediatamente después de presionar el botón (tocar hacia abajo), no cuando se suelta (retocar). ¿Alguna idea sobre cómo puedo lograr esto?
Tal vez usando un OnTouchListener ? Supongo que MotionEvent tendrá algunos métodos para registrar un toque en el objeto.
button.setOnTouchListener(new OnTouchListener() { @Override public boolean onTouch(View v, MotionEvent event) { // TODO Auto-generated method stub return false; } }))
Deberías hacer esto: b es el botón.
b.setOnTouchListener(new OnTouchListener() { @Override public boolean onTouch(View v, MotionEvent event) { if (event.getAction() == MotionEvent.ACTION_DOWN ) { mSoundManager.playSound(2); return true; } return false; } });
import android.view.MotionEvent;
|
{
"url": "https://www.dokry.com/45930",
"source_domain": "www.dokry.com",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "13007",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TNRL3EC2AIBL3EY2CBUGCLPXTKLDFE4B",
"WARC-Concurrent-To": "<urn:uuid:454da141-38b3-4a11-8b13-e77c9d070f14>",
"WARC-Date": "2021-12-06T07:38:32Z",
"WARC-IP-Address": "69.163.34.11",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:36IKZH3HM742VDUUBU5GE7OAONXA4734",
"WARC-Record-ID": "<urn:uuid:49fe41f0-4634-4c06-8861-d72733574899>",
"WARC-Target-URI": "https://www.dokry.com/45930",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:dbe72bf6-6532-495e-a4d5-3af5b0e4e5f4>"
},
"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-123\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
61,
62,
183,
184,
362,
363,
557,
558,
679,
680,
850,
851,
887,
888,
1113,
1114
],
"line_end_idx": [
61,
62,
183,
184,
362,
363,
557,
558,
679,
680,
850,
851,
887,
888,
1113,
1114,
1146
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1146,
"ccnet_original_nlines": 16,
"rps_doc_curly_bracket": 0.012216400355100632,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.0848214328289032,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013392860069870949,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3258928656578064,
"rps_doc_frac_unique_words": 0.6641221642494202,
"rps_doc_mean_word_length": 6.9083967208862305,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.30161190032959,
"rps_doc_word_count": 131,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.14143645763397217,
"rps_doc_frac_chars_dupe_6grams": 0.14143645763397217,
"rps_doc_frac_chars_dupe_7grams": 0.14143645763397217,
"rps_doc_frac_chars_dupe_8grams": 0.14143645763397217,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02651933953166008,
"rps_doc_frac_chars_top_3gram": 0.06408839672803879,
"rps_doc_frac_chars_top_4gram": 0.07955800741910934,
"rps_doc_books_importance": -79.27808380126953,
"rps_doc_books_importance_length_correction": -79.27808380126953,
"rps_doc_openwebtext_importance": -50.710914611816406,
"rps_doc_openwebtext_importance_length_correction": -47.35276412963867,
"rps_doc_wikipedia_importance": -50.22519302368164,
"rps_doc_wikipedia_importance_length_correction": -50.22519302368164
},
"fasttext": {
"dclm": 0.9965603351593018,
"english": 0.009824040345847607,
"fineweb_edu_approx": 1.7796509265899658,
"eai_general_math": 0.0014033300103619695,
"eai_open_web_math": 0.09510576725006104,
"eai_web_code": 0.5897079706192017
}
}
|
{
"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": "5",
"label": "Social/Forum"
}
},
"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,299,152,410,810,396,200 |
Метод в Objective-C определен как часть класса. Он имеет три аспекта.
Он может быть методом класса или методом экземпляра
Если это метод класса, вы вызываете его с помощью сообщения самому классу. Если это метод экземпляра, вы вызываете его с помощью сообщения экземпляру класса.
Он имеет параметры и возвращаемое значение
Как и функции С (глава 1), методы Objective-C принимают некоторое количество параметров; каждый параметр имеет некоторый конкретный тип. И, как и функции С, методы могут иметь возвращаемое значение, также определенного типа. Если метод не возвращает ничего, его возвращаемый тип объявляется как void.
Он имеет имя
Имя метода Objective-C должно иметь столько двоеточий, сколько параметров он принимает; и, если метод принимает параметры» его имя должно завершаться двоеточием.
Похожие статьи
Добавить комментарий
|
{
"url": "http://juice-health.ru/archive/39-ios-7/231-metody-i-soobshcheniya",
"source_domain": "juice-health.ru",
"snapshot_id": "crawl=CC-MAIN-2018-05",
"warc_metadata": {
"Content-Length": "35950",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FH5EB6FS6AU3ZX2CGKSEOLVFQZOTRJVE",
"WARC-Concurrent-To": "<urn:uuid:2c59d3ff-2241-46b1-80d5-8eabb5a611c8>",
"WARC-Date": "2018-01-21T12:13:24Z",
"WARC-IP-Address": "31.31.196.33",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4XHQKT6ESMBAHVLZCSWL37IT6CI6RSL3",
"WARC-Record-ID": "<urn:uuid:aebf07fa-4566-4eba-ad9a-218105c37179>",
"WARC-Target-URI": "http://juice-health.ru/archive/39-ios-7/231-metody-i-soobshcheniya",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:30d37681-d41d-4fb0-aa18-98809614250f>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-171-68-19.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-05\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for January 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,
70,
71,
73,
74,
126,
127,
285,
286,
329,
330,
631,
632,
645,
646,
808,
809,
810,
825,
826,
828,
829,
831,
832,
834,
835,
837,
838
],
"line_end_idx": [
70,
71,
73,
74,
126,
127,
285,
286,
329,
330,
631,
632,
645,
646,
808,
809,
810,
825,
826,
828,
829,
831,
832,
834,
835,
837,
838,
858
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 858,
"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,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04109589010477066,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.9520547986030579,
"rps_doc_frac_unique_words": 0.5798319578170776,
"rps_doc_mean_word_length": 5.865546226501465,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.054879665374756,
"rps_doc_word_count": 119,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08882521092891693,
"rps_doc_frac_chars_dupe_6grams": 0.08882521092891693,
"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.030085960403084755,
"rps_doc_frac_chars_top_3gram": 0.03724927827715874,
"rps_doc_frac_chars_top_4gram": 0.04297994077205658,
"rps_doc_books_importance": -58.731056213378906,
"rps_doc_books_importance_length_correction": -58.731056213378906,
"rps_doc_openwebtext_importance": -31.843273162841797,
"rps_doc_openwebtext_importance_length_correction": -27.83782196044922,
"rps_doc_wikipedia_importance": -26.64415740966797,
"rps_doc_wikipedia_importance_length_correction": -26.64415740966797
},
"fasttext": {
"dclm": 0.7608780264854431,
"english": 0,
"fineweb_edu_approx": 2.179414749145508,
"eai_general_math": -0.000006560000201716321,
"eai_open_web_math": 0.7977568507194519,
"eai_web_code": 0.994357168674469
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "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": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,909,218,003,990,383,000 |
Ask Fedora: Community Knowledge Base and Support Forum - RSS feedhttps://askbot.fedoraproject.org/en/questions/Ask Fedora: Community Knowledge Base and Support ForumenAsk Fedora is community maintained and Red Hat or Fedora Project is not responsible for content.Fri, 30 Jun 2017 04:28:18 -0500Spellcheck - Add Finnish or any language - Evolutionhttps://askbot.fedoraproject.org/en/question/107290/spellcheck-add-finnish-or-any-language-evolution/Hey, I have tried to figure out that how I could add Finnish spellcheck for Evolution or generally to all text processing softwares in Fedora 25/26. I found that "hunspell" most likely is the way to do it, but there is no Finnish as it so bizarre language... :) Do I have options? Evolution says "The list of languages here reflects only the languages for which you have a dictionary installed"... on the list there is English. Thank you from tips. :)Fri, 30 Jun 2017 03:18:52 -0500https://askbot.fedoraproject.org/en/question/107290/spellcheck-add-finnish-or-any-language-evolution/Answer by villykruse for <p>Hey,</p> <p>I have tried to figure out that how I could add Finnish spellcheck for Evolution or generally to all text processing softwares in Fedora 25/26.</p> <p>I found that "hunspell" most likely is the way to do it, but there is no Finnish as it so bizarre language... :)</p> <p>Do I have options? Evolution says "The list of languages here reflects only the languages for which you have a dictionary installed"... on the list there is English. </p> <p>Thank you from tips. :)</p> https://askbot.fedoraproject.org/en/question/107290/spellcheck-add-finnish-or-any-language-evolution/?answer=107291#post-id-107291Installing the language packages would be worth a try: dnf install aspell-fi autocorr-fi glibc-langpack-fi langpacks-fi Further also consider: enchant-voikko libreoffice-voikko libvoikko libvoikko-devel malaga-suomi-voikko mozvoikko python-libvoikko tmispell-voikko voikko-tools which are special finish language libraries. If they work I don't know; I don't speak the language.Fri, 30 Jun 2017 04:28:18 -0500https://askbot.fedoraproject.org/en/question/107290/spellcheck-add-finnish-or-any-language-evolution/?answer=107291#post-id-107291
|
{
"url": "https://askbot.fedoraproject.org/en/feeds/question/107290/",
"source_domain": "askbot.fedoraproject.org",
"snapshot_id": "crawl=CC-MAIN-2021-25",
"warc_metadata": {
"Content-Length": "3466",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NTHY77BPND6L6Q4MZNHOATWAPPRC5JQW",
"WARC-Concurrent-To": "<urn:uuid:68f55ca5-4a25-4a76-9a79-c89ce1f450a5>",
"WARC-Date": "2021-06-14T16:30:48Z",
"WARC-IP-Address": "45.79.98.57",
"WARC-Identified-Payload-Type": "application/rss+xml",
"WARC-Payload-Digest": "sha1:QMGCCXLBL5KLPMPAE3UTALJO2CHWYG3F",
"WARC-Record-ID": "<urn:uuid:940e9941-ad4e-41fd-b268-9914e0bb0f7a>",
"WARC-Target-URI": "https://askbot.fedoraproject.org/en/feeds/question/107290/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cd075a7c-ccee-4d29-bbd8-834151c64318>"
},
"warc_info": "isPartOf: CC-MAIN-2021-25\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-40.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0
],
"line_end_idx": [
2212
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2212,
"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.25918760895729065,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021276600658893585,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.344294011592865,
"rps_doc_frac_unique_words": 0.48669201135635376,
"rps_doc_mean_word_length": 6.688212871551514,
"rps_doc_num_sentences": 28,
"rps_doc_symbol_to_word_ratio": 0.011605420149862766,
"rps_doc_unigram_entropy": 4.628560543060303,
"rps_doc_word_count": 263,
"rps_doc_frac_chars_dupe_10grams": 0.36611711978912354,
"rps_doc_frac_chars_dupe_5grams": 0.40932348370552063,
"rps_doc_frac_chars_dupe_6grams": 0.40932348370552063,
"rps_doc_frac_chars_dupe_7grams": 0.36611711978912354,
"rps_doc_frac_chars_dupe_8grams": 0.36611711978912354,
"rps_doc_frac_chars_dupe_9grams": 0.36611711978912354,
"rps_doc_frac_chars_top_2gram": 0.01591813936829567,
"rps_doc_frac_chars_top_3gram": 0.015349630266427994,
"rps_doc_frac_chars_top_4gram": 0.03183627128601074,
"rps_doc_books_importance": -230.2632293701172,
"rps_doc_books_importance_length_correction": -230.2632293701172,
"rps_doc_openwebtext_importance": -134.7729034423828,
"rps_doc_openwebtext_importance_length_correction": -134.7729034423828,
"rps_doc_wikipedia_importance": -86.763671875,
"rps_doc_wikipedia_importance_length_correction": -86.763671875
},
"fasttext": {
"dclm": 0.03435957059264183,
"english": 0.828838586807251,
"fineweb_edu_approx": 1.643393874168396,
"eai_general_math": 0.13338905572891235,
"eai_open_web_math": 0.10473371297121048,
"eai_web_code": 0.15576821565628052
}
}
|
{
"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": "491.7",
"labels": {
"level_1": "Philology; or, Language and languages",
"level_2": "",
"level_3": "Indo-European languages"
}
}
},
"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": "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,123,322,469,102,657,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.
im have a problem with method setTimeOut that call the function self and set a delay, the function should be called again and again after every request is done but it only runs once. It works without using backbone.js tho, don't know it doesnt work after integration with backbone.js. Any help is appreciated!
So this is a function in client that runs a GET request gets data from server, the request runs in a time interval(decided in the server), as soon as a data comes in, client gets it and the request runs again after.
getRequest:function() {
var XHR = $.ajax({
url: '/nextdocument',
type: 'GET',
async: true,
cache: false,
timeout: 11000,
success:function(data) {
var name = data.description;
var price = data.price;
console.log("read--> " + name + price);
setTimeout("this.getRequest", 1000);
if (data.ok == "true") {
data["ok"] = data.ok;
$.ajax(
{
url: "/customerdone",
data: JSON.stringify(data),
processData: false,
type: 'POST',
contentType: 'application/json'
}
)
}else{
//no document if no read in
console.log("error--> " + data.errorMessage)
}
}
})
return XHR;
}
share|improve this question
what do you mean by : if (data.ok == 'true') { data['ok'] = data.ok; . . } ? is it needed? – Parth Thakkar May 4 '12 at 15:44
In setTimeout, don't use a string, use an anonymous function like setTimeout(function() { namespace.getRequest() },1000); "namespace" is a placeholder for whatever the name of your package is that wraps getRequest. – jmort253 May 4 '12 at 15:44
add comment
2 Answers
The problem is that you're using "this" in your setTimeout call. You can't do this because "this" will be the global object when the timer executes the function you're trying to reference.
like others have suggested, you need to pass an actual function to your timer, not a string. then you can reference whatever function from whatever object you want.
share|improve this answer
add comment
probably, the function getRequest isn't being called. This is, as far as I think, because you are sending a string -- "this.getRequest" to the setTimeout function. As a rule of thumb, never pass string to this, pass functions. Although, it might be perfectly ok in some situations (i'd never recommend it anyway), here 'this' might be causing trouble. Use something like this:
getRequest:function() {
var fn = arguments.callee;
var XHR = $.ajax({
url: '/nextdocument',
type: 'GET',
async: true,
cache: false,
timeout: 11000,
success:function(data) {
var name = data.description;
var price = data.price;
console.log("read--> " + name + price);
setTimeout(fn, 1000);
if (data.ok == "true") {
data["ok"] = data.ok;
$.ajax(
{
url: "/customerdone",
data: JSON.stringify(data),
processData: false,
type: 'POST',
contentType: 'application/json'
}
)
}else{
//no document if no read in
console.log("error--> " + data.errorMessage)
}
}
})
return XHR;
}
share|improve this answer
1
OT: consider splitting the callbacks into functions for keeping code more readable and maintainable. – S.C. May 5 '12 at 12:46
add comment
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://stackoverflow.com/questions/10451916/backbone-javascript-settimeout-method?answertab=votes",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "69993",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Y2NRJT7XD4IWA3DSGIZ7X76THVYCHG6D",
"WARC-Concurrent-To": "<urn:uuid:58491597-7de1-482c-8ce6-77ee982679f2>",
"WARC-Date": "2014-03-16T21:42:03Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:AZZUEVL56DM2HBEVKPX4M2CEKDNIVTJR",
"WARC-Record-ID": "<urn:uuid:185588f4-f5a4-4c71-b1f1-1e0d7523576e>",
"WARC-Target-URI": "http://stackoverflow.com/questions/10451916/backbone-javascript-settimeout-method?answertab=votes",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c901d148-a5d0-49d9-9322-a89dfda351e9>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-183-142-35.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-10\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for March 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
157,
158,
468,
469,
685,
686,
714,
741,
775,
800,
825,
851,
880,
917,
962,
1002,
1058,
1111,
1152,
1194,
1222,
1248,
1298,
1354,
1402,
1444,
1504,
1530,
1552,
1575,
1623,
1688,
1706,
1720,
1731,
1751,
1757,
1785,
1787,
1914,
1916,
2162,
2174,
2175,
2185,
2186,
2375,
2376,
2541,
2542,
2568,
2580,
2581,
2958,
2959,
2983,
3014,
3037,
3067,
3088,
3109,
3131,
3156,
3189,
3230,
3266,
3318,
3352,
3389,
3427,
3451,
3473,
3519,
3571,
3615,
3653,
3709,
3731,
3749,
3768,
3812,
3873,
3887,
3897,
3904,
3920,
3922,
3948,
3952,
4080,
4092,
4093,
4105,
4106,
4108,
4116,
4117,
4195,
4196
],
"line_end_idx": [
25,
157,
158,
468,
469,
685,
686,
714,
741,
775,
800,
825,
851,
880,
917,
962,
1002,
1058,
1111,
1152,
1194,
1222,
1248,
1298,
1354,
1402,
1444,
1504,
1530,
1552,
1575,
1623,
1688,
1706,
1720,
1731,
1751,
1757,
1785,
1787,
1914,
1916,
2162,
2174,
2175,
2185,
2186,
2375,
2376,
2541,
2542,
2568,
2580,
2581,
2958,
2959,
2983,
3014,
3037,
3067,
3088,
3109,
3131,
3156,
3189,
3230,
3266,
3318,
3352,
3389,
3427,
3451,
3473,
3519,
3571,
3615,
3653,
3709,
3731,
3749,
3768,
3812,
3873,
3887,
3897,
3904,
3920,
3922,
3948,
3952,
4080,
4092,
4093,
4105,
4106,
4108,
4116,
4117,
4195,
4196,
4286
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4286,
"ccnet_original_nlines": 100,
"rps_doc_curly_bracket": 0.006532900035381317,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2751842737197876,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.018427519127726555,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3685503602027893,
"rps_doc_frac_unique_words": 0.46960169076919556,
"rps_doc_mean_word_length": 5.205450534820557,
"rps_doc_num_sentences": 51,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.098061561584473,
"rps_doc_word_count": 477,
"rps_doc_frac_chars_dupe_10grams": 0.2754732072353363,
"rps_doc_frac_chars_dupe_5grams": 0.2948046624660492,
"rps_doc_frac_chars_dupe_6grams": 0.2754732072353363,
"rps_doc_frac_chars_dupe_7grams": 0.2754732072353363,
"rps_doc_frac_chars_dupe_8grams": 0.2754732072353363,
"rps_doc_frac_chars_dupe_9grams": 0.2754732072353363,
"rps_doc_frac_chars_top_2gram": 0.017720500007271767,
"rps_doc_frac_chars_top_3gram": 0.014498589560389519,
"rps_doc_frac_chars_top_4gram": 0.0217478908598423,
"rps_doc_books_importance": -420.8302001953125,
"rps_doc_books_importance_length_correction": -420.8302001953125,
"rps_doc_openwebtext_importance": -214.53797912597656,
"rps_doc_openwebtext_importance_length_correction": -214.53797912597656,
"rps_doc_wikipedia_importance": -175.2952117919922,
"rps_doc_wikipedia_importance_length_correction": -175.2952117919922
},
"fasttext": {
"dclm": 0.8804578185081482,
"english": 0.7236456274986267,
"fineweb_edu_approx": 1.8097684383392334,
"eai_general_math": 0.0077101001515984535,
"eai_open_web_math": 0.0986747071146965,
"eai_web_code": 0.01011693011969328
}
}
|
{
"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": "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": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,826,472,320,804,597,000 |
Average Value of a Function
Average Value of a Function
Normally when we think of averaging a set of values (for example, test grades) we add the quantities and divide by the number of values. However, calculus must be used when there are a continuous set of points that we are trying to average such as for a function on an interval. In this video we show how integration can be used to find a function’s average value over a closed interval.
|
{
"url": "http://fireflylectures.com/Average-Value-of-a-Function/",
"source_domain": "fireflylectures.com",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "25827",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:G7VIUXUYZT2MH4USWYO7PV44CRS4IDPO",
"WARC-Concurrent-To": "<urn:uuid:55fc3f90-6306-4edd-89f2-32f487d19883>",
"WARC-Date": "2018-06-19T21:30:06Z",
"WARC-IP-Address": "184.168.229.128",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QW322ZZFYJGYMSZ6Z7SHDCLJJ4XGGSRG",
"WARC-Record-ID": "<urn:uuid:3c5a5818-637b-4461-8526-1be0a313eab4>",
"WARC-Target-URI": "http://fireflylectures.com/Average-Value-of-a-Function/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2db4f4a7-4d71-4b65-b8b1-8d2459af4b5a>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-138-204-92.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,
28,
29,
57,
58
],
"line_end_idx": [
28,
29,
57,
58,
445
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 445,
"ccnet_original_nlines": 4,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.5384615659713745,
"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.08791209012269974,
"rps_doc_frac_unique_words": 0.6219512224197388,
"rps_doc_mean_word_length": 4.329268455505371,
"rps_doc_num_sentences": 3,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.7248058319091797,
"rps_doc_word_count": 82,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.12957745790481567,
"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.101408451795578,
"rps_doc_frac_chars_top_3gram": 0.07887323945760727,
"rps_doc_frac_chars_top_4gram": 0.0845070406794548,
"rps_doc_books_importance": -48.002079010009766,
"rps_doc_books_importance_length_correction": -48.208946228027344,
"rps_doc_openwebtext_importance": -32.310462951660156,
"rps_doc_openwebtext_importance_length_correction": -32.517330169677734,
"rps_doc_wikipedia_importance": -31.3841609954834,
"rps_doc_wikipedia_importance_length_correction": -31.591026306152344
},
"fasttext": {
"dclm": 0.6542364358901978,
"english": 0.9269392490386963,
"fineweb_edu_approx": 3.115989923477173,
"eai_general_math": 0.9999446868896484,
"eai_open_web_math": 0.8919274210929871,
"eai_web_code": 0.9537420272827148
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "515.3",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Calculus and Mathematical analysis"
}
},
"secondary": {
"code": "515",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Calculus and Mathematical analysis"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-215,446,227,556,718,500 |
CoRE Working Group G. Selander
Internet-Draft J. Mattsson
Intended status: Standards Track F. Palombini
Expires: January April 2, 2018 Ericsson AB
L. Seitz
SICS Swedish ICT
July 01,
September 29, 2017
Object Security of CoAP (OSCOAP)
draft-ietf-core-object-security-04 for Constrained RESTful Environments (OSCORE)
draft-ietf-core-object-security-05
Abstract
This document defines Object Security of CoAP (OSCOAP), for Constrained RESTful
Environments (OSCORE), a method for
application layer application-layer protection of
the Constrained Application Protocol (CoAP), using the CBOR Object
Signing and Encryption (COSE). OSCOAP OSCORE provides end-to-end
encryption, integrity and replay protection to
CoAP payload, options, and header fields, protection, as well as a secure
message binding. OSCOAP OSCORE is designed for constrained nodes and
networks and can be used across intermediaries and over any layer. The use of
OSCOAP is signaled with the CoAP option Object-Security, layer and across intermediaries,
and also defined with HTTP. OSCORE may be used to protect group
communications as is specified in this document. a separate draft.
Status of This Memo
This Internet-Draft is submitted in full conformance with the
provisions of BCP 78 and BCP 79.
Internet-Drafts are working documents of the Internet Engineering
Task Force (IETF). Note that other groups may also distribute
working documents as Internet-Drafts. The list of current Internet-
Drafts is at http://datatracker.ietf.org/drafts/current/. https://datatracker.ietf.org/drafts/current/.
Internet-Drafts are draft documents valid for a maximum of six months
and may be updated, replaced, or obsoleted by other documents at any
time. It is inappropriate to use Internet-Drafts as reference
material or to cite them other than as "work in progress."
This Internet-Draft will expire on January April 2, 2018.
Copyright Notice
Copyright (c) 2017 IETF Trust and the persons identified as the
document authors. All rights reserved.
This document is subject to BCP 78 and the IETF Trust's Legal
Provisions Relating to IETF Documents
(http://trustee.ietf.org/license-info)
(https://trustee.ietf.org/license-info) in effect on the date of
publication of this document. Please review these documents
carefully, as they describe your rights and restrictions with respect
to this document. Code Components extracted from this document must
include Simplified BSD License text as described in Section 4.e of
the Trust Legal Provisions and are provided without warranty as
described in the Simplified BSD License.
Table of Contents
1. Introduction . . . . . . . . . . . . . . . . . . . . . . . . 3
1.1. Terminology . . . . . . . . . . . . . . . . . . . . . . . 4 5
2. The CoAP Object-Security Option . . . . . . . . . . . . . . . . . 5
3. The Security Context . . . . . . . . . . . . . . . . . . . . 6
3.1. Security Context Definition . . . . . . . . . . . . . . . 6
3.2. Derivation Establishment of Security Context Parameters . . . . . . . . 9 8
3.3. Requirements on the Security Context Parameters . . . . . 10
4. Protected CoAP Message Fields . . . . . . . . . . . . . . . . . . 11
4.1. CoAP Payload . . . . . . . . . . . . . . . . . . . . . . 12
4.2. CoAP Header . Options . . . . . . . . . . . . . . . . . . . . . . 12
4.3. CoAP Options Header . . . . . . . . . . . . . . . . . . . . . . 12 . 18
5. The COSE Object . . . . . . . . . . . . . . . . . . . . . . . 18 19
5.1. Plaintext Nonce . . . . . . . . . . . . . . . . . . . . . . . . 19 . . 20
5.2. Plaintext . . . . . . . . . . . . . . . . . . . . . . . . 20
5.3. Additional Authenticated Data . . . . . . . . . . . . . . 19 21
6. Sequence Numbers, Replay, Message Binding, and Freshness . . 20 22
6.1. AEAD Nonce Uniqueness Message Binding . . . . . . . . . . . . . . . . . . . 20
6.2. Replay Protection . . 22
6.2. AEAD Nonce Uniqueness . . . . . . . . . . . . . . . . . . 21 22
6.3. Sequence Number and Replay Window State Freshness . . . . . . . . . . 21
6.4. Freshness . . . . . . . . . . . . . . 22
6.4. Replay Protection . . . . . . . . . . . . 23
6.5. Delay and Mismatch Attacks . . . . . . . . 23
6.5. Losing Part of the Context State . . . . . . . . . . . . 23
7. Processing . . . . . . . . . . . . . . . . . . . . . . . . . 23 24
7.1. Protecting the Request . . . . . . . . . . . . . . . . . 23 24
7.2. Verifying the Request . . . . . . . . . . . . . . . . . . 24 25
7.3. Protecting the Response . . . . . . . . . . . . . . . . . 25 26
7.4. Verifying the Response . . . . . . . . . . . . . . . . . 26 27
8. OSCOAP OSCORE Compression . . . . . . . . . . . . . . . . . . . . . 27 28
8.1. Encoding of the Object-Security Option Value . . . . . . . . . 27 . 28
8.2. Examples Encoding of the OSCORE Payload . . . . . . . . . . . . . 29
8.3. Context Hint . . . . . . . . . . . 28
9. Web Linking . . . . . . . . . . . 30
8.4. Compression Examples . . . . . . . . . . . . . . 29
10. Security Considerations . . . . 30
9. Web Linking . . . . . . . . . . . . . . . 30
11. Privacy Considerations . . . . . . . . . . 32
10. Proxy Operations . . . . . . . . . 32
12. IANA Considerations . . . . . . . . . . . . . 32
10.1. CoAP-to-CoAP Forwarding Proxy . . . . . . . . 32
12.1. CoAP Option Numbers Registry . . . . . 33
10.2. HTTP-to-CoAP Translation Proxy . . . . . . . . . 32
12.2. Media Type Registrations . . . . 33
10.3. CoAP-to-HTTP Translation Proxy . . . . . . . . . . . . 32
12.3. CoAP Content Format Registration . 34
11. Security Considerations . . . . . . . . . . . 33
13. Acknowledgments . . . . . . . . 35
12. Privacy Considerations . . . . . . . . . . . . . . . 34
14. References . . . . 37
13. IANA Considerations . . . . . . . . . . . . . . . . . . . . . 34
14.1. Normative References 38
13.1. CoAP Option Numbers Registry . . . . . . . . . . . . . . 38
13.2. Header Field Registrations . . . . 34
14.2. Informative References . . . . . . . . . . . 38
14. Acknowledgments . . . . . . 35
Appendix A. Test Vectors . . . . . . . . . . . . . . . . . 38
15. References . . . 36
Appendix B. Examples . . . . . . . . . . . . . . . . . . . . . . 36
B.1. Secure Access to Sensor 38
15.1. Normative References . . . . . . . . . . . . . . . . . 36
B.2. Secure Subscribe to Sensor . 38
15.2. Informative References . . . . . . . . . . . . . . 37
Appendix C. Object Security of Content (OSCON) . . . 40
Appendix A. Test Vectors . . . . . . 39
C.1. Overhead OSCON . . . . . . . . . . . . . . 41
Appendix B. Examples . . . . . . . 40
C.2. MAC Only . . . . . . . . . . . . . . . 41
B.1. Secure Access to Sensor . . . . . . . . . 41
C.3. Signature Only . . . . . . . . 41
B.2. Secure Subscribe to Sensor . . . . . . . . . . . . . 41
C.4. Authenticated Encryption with Additional Data (AEAD) . . 42
C.5. Symmetric Encryption with Asymmetric Signature (SEAS) . . 43
Authors' Addresses . . . . . . . . . . . . . . . . . . . . . . . 43 44
1. Introduction
The Constrained Application Protocol (CoAP) is a web application
protocol, designed for constrained nodes and networks [RFC7228].
CoAP specifies the use of proxies for scalability and efficiency. At
the same time efficiency, and
a mapping to HTTP is also specified [RFC8075]. CoAP [RFC7252]
references DTLS [RFC6347] for security.
Proxy operations on CoAP messages and HTTP proxies
require DTLS (D)TLS to be terminated at the proxy. The proxy therefore
not only has access to the data required for performing the intended
proxy functionality, but is also able to eavesdrop on, or manipulate
any part of the CoAP message payload and metadata, in transit between client and server. the
endpoints. The proxy can also inject, delete, or reorder packages packets
since they are no longer protected by DTLS. (D)TLS.
This document defines the Object Security of CoAP (OSCOAP), a data object
based for Constrained RESTful
Environments (OSCORE) security protocol, protecting CoAP message exchanges end-to-
end, and CoAP-
mappable HTTP requests and responses end-to-end across intermediary nodes.
nodes such as CoAP forward proxies and cross-protocol translators
including HTTP-to-CoAP proxies [RFC8075]. In addition to the core
CoAP features defined in [RFC7252], OSCORE supports Observe [RFC7641]
and Blockwise [RFC7959]. An analysis of end-to-end security for CoAP
messages through some types of intermediary nodes is performed in
[I-D.hartke-core-e2e-security-reqs], this specification addresses
[I-D.hartke-core-e2e-security-reqs]. OSCORE protects the
forwarding case. In addition Request/
Response layer only, and not the CoAP Messaging Layer (Section 2 of
[RFC7252]). Therefore, all the CoAP messages mentioned in this
document refer to non-empty CON, NON, and ACK messages.
Additionally, since the core features defined message formats for CoAP over unreliable
transport [RFC7252] and for CoAP over reliable transport
[I-D.ietf-core-coap-tcp-tls] differ only in
[RFC7252], OSCOAP supports Observe [RFC7641] terms of Messaging Layer,
OSCORE can be applied to both unreliable and Blockwise [RFC7959].
OSCOAP reliable transports.
OSCORE is designed for constrained nodes and networks and provides an
in-layer security protocol for CoAP which that does not depend on underlying layers. OSCOAP
OSCORE can be used anywhere that where CoAP or HTTP can be used, including unreliable transport [RFC7228], reliable transport
[I-D.ietf-core-coap-tcp-tls], and
non-IP transport
[I-D.bormann-6lo-coap-802-15-ie]. OSCOAP transports (e.g., [I-D.bormann-6lo-coap-802-15-ie]). An
extension of OSCORE may also be used to protect group communication
for CoAP [I-D.tiloca-core-multicast-oscoap]. The use of OSCOAP OSCORE does
not affect the URI scheme and OSCOAP OSCORE can therefore be used with any
URI scheme defined for CoAP. CoAP or HTTP. The application decides the
conditions for which OSCOAP OSCORE is required.
OSCOAP
OSCORE builds on CBOR Object Signing and Encryption (COSE)
[I-D.ietf-cose-msg], [RFC8152],
providing end-to-end encryption, integrity, replay protection, and
secure message binding. A compressed version of COSE is used, see as
discussed in Section 8. The use of OSCOAP OSCORE is signaled with the
Object-Security CoAP option Object-Security, or HTTP header, defined in Section 2. OSCOAP
provides protection of CoAP payload, certain options, 2 and header
fields. The solution transforms a CoAP message
Section 10.2. OSCORE is designed to protect as much information as
possible, while still allowing proxy operations (Section 10). OSCORE
provides protection of message payload, almost all CoAP options, and
the RESTful method. The solution transforms a message into an "OSCOAP
"OSCORE message" before sending, and vice versa after receiving. The OSCOAP
OSCORE message is a CoAP message related to the original CoAP message in the following
way: the original CoAP message is protected by including translated to CoAP (if not already in
CoAP) and the resulting message payload (if present), certain options, options not
processed by a proxy, and header fields the request/response method (CoAP Code) are
protected in a COSE object. The message fields of the original
messages that have been are encrypted are removed from not present in the message whereas OSCORE message,
and instead the Object-Security option option/header and the compressed COSE
object are added, included, see Figure 1.
Client Server
| OSCOAP request: |
| GET example.com OSCORE request - POST example.com: |
| [Header, Header, Token, Options:{..., |
| Object-Security:COSE object}] Options: {Object-Security, ...}, |
+---------------------------------------------->|
| OSCOAP response: Payload: Compressed COSE object |
+--------------------------------------------->|
| 2.05 (Content) OSCORE response - 2.04 (Changed): |
| [Header, Header, Token, Options:{..., |
| Object-Security:-}, Payload:COSE object] Options: {Object-Security, ...}, |
| Payload: Compressed COSE object |
|<----------------------------------------------+
|<---------------------------------------------+
| |
Figure 1: Sketch of OSCOAP
OSCOAP OSCORE with CoAP
OSCORE may be used in very constrained settings, thanks to its small
message size, its size and the restricted code and memory requirements, and requirements in
addition to what is
independent of underlying layer below required by CoAP. OSCOAP OSCORE can be combined with DTLS,
transport layer security such as DTLS or TLS, thereby enabling end-to-end end-
to-end security of e.g. CoAP payload Payload, Options and options, Code, in
combination with hop-by-hop protection of the entire
CoAP message, Messaging Layer, during
transport between end-point and intermediary node. Examples of the
use of OSCOAP OSCORE are given in Appendix B.
The message protection provided by OSCOAP can alternatively be
applied
An implementation supporting this specification MAY only to implement
the payload of individual messages. We call this
object security client part, MAY only implement the server part, or MAY only
implement one of content (OSCON), which the proxy parts. OSCORE is defined in Appendix C. designed to work with
legacy CoAP-to-CoAP forward proxies [RFC7252], but an OSCORE-aware
proxy will be more efficient. HTTP-to-CoAP proxies [RFC8075] and
CoAP-to-HTTP proxies need to implement respective parts of this
specification to work with OSCORE (see Section 10).
1.1. Terminology
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT",
"SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this
document are to be interpreted as described in [RFC2119]. These
words may also appear in this document in lowercase, absent their
normative meanings.
Readers are expected to be familiar with the terms and concepts
described in CoAP [RFC7252], Observe [RFC7641], Blockwise [RFC7959],
COSE [I-D.ietf-cose-msg], [RFC8152], CBOR [RFC7049], CDDL
[I-D.greevenbosch-appsawg-cbor-cddl], and constrained environments
[RFC7228].
The terms Common/Sender/Recipient Context, Master Secret/Salt, Sender
ID/Key/IV, Recepient ID/Key/IV
ID/Key, Recipient ID/Key, and Context Common IV are defined in Section 3.1.
2. The CoAP Object-Security Option
The CoAP Object-Security option (see Figure 2) indicates that OSCOAP is
used to protect the
CoAP message exchange. is an OSCORE message and that it contains a compressed
COSE object (see Section 5 and Section 8). The Object-Security
option is critical, safe to forward, part of the cache key, not
repeatable, and opaque.
+-----+---+---+---+---+-----------------+--------+--------+ not
repeatable.
+-----+---+---+---+---+-----------------+-----------+--------+---------+
| No. | C | U | N | R | Name | Format | Length |
+-----+---+---+---+---+-----------------+--------+--------| Default |
+-----+---+---+---+---+-----------------+-----------+--------+---------+
| TBD | x | | | | Object-Security | opaque see below | 0- 0-255 |
+-----+---+---+---+---+-----------------+--------+--------+
C=Critical, U=Unsafe, N=NoCacheKey, R=Repeatable (none) |
+-----+---+---+---+---+-----------------+-----------+--------+---------+
C = Critical, U = Unsafe, N = NoCacheKey, R = Repeatable
Figure 2: The Object-Security Option
A successful response to a request with the
The Object-Security option contains the OSCORE flag byte and for
requests, the Sender ID (see Section 8). If the flag byte is all
zero (0x00) the Option value SHALL be empty (Option Length = 0). An
endpoint receiving a CoAP message without payload, that also contains
an Object-Security option SHALL treat it as malformed and reject it.
A successful response to a request with the Object-Security option
SHALL contain the Object-Security option. Whether error responses
contain the Object-Security option depends on the error type (see
Section 7).
Since the payload and most options are encrypted Section 4, and the
corresponding plain text message fields of the original are not
included in the OSCORE message, the processing of these fields does
not expand the total message size.
A CoAP endpoint proxy SHOULD NOT cache a response to a request with an Object-Security Object-
Security option, since the response is only applicable to the
original client's request.
The Object-Security option request, see Section 10.1. As the compressed COSE
Object is included in the cache key for backward
compatibility with proxies not recognizing the Object-Security
option. The effect is that key, messages with the Object-Security Object-
Security option will never generate cache hits. For Max-Age
processing, see Section 4.3.1.1. 4.2.3.1.
3. The protection is achieved by means of a COSE object (see Section 5),
which is compressed Security Context
OSCORE requires that client and then included in the OSCOAP message. The
placement of server establish a shared security
context used to process the COSE object depends on whether the method/response
code allows payload (see [RFC7252]):
o If the method/response code allows payload, then the compressed objects. OSCORE uses COSE object Section 8 is the payload of the OSCOAP message, and
the Object-Security option has length zero. An endpoint receiving
a CoAP message with payload, that also contains an
Authenticated Encryption with Additional Data (AEAD) algorithm for
protecting message data between a non-empty
Object-Security option SHALL treat it as malformed client and reject it.
o If a server. In this
section, we define the method/response code does not allow payload, then the
compressed COSE object Section 8 is the value of the Object-
Security option and the length of the Object-Security option is
equal to the size of the compressed COSE object. An endpoint
receiving a CoAP message without payload, that also contains an
empty Object-Security option SHALL treat it as malformed and
reject it.
The size of the COSE object depends on whether the method/response
code allows payload, if the message is a request or response, on the
set of options that are included in the original message, the AEAD
algorithm, the length of the information identifying the security
context, and the length of the sequence number.
3. The Security Context
OSCOAP uses COSE with an Authenticated Encryption with Additional
Data (AEAD) algorithm between a CoAP client and a CoAP server. An
implementation supporting this specification MAY only implement the
client part or MAY only implement the server part.
This specification requires that client and server establish a security context to apply to the COSE objects protecting the CoAP
messages. In this section we define the security context, and also
specify how to derive the initial security contexts it is derived in
client and server based on a common shared master secret and a key
derivation function (KDF).
3.1. Security Context Definition
The security context is the set of information elements necessary to
carry out the cryptographic operations in OSCOAP. OSCORE. For each endpoint,
the security context is composed of a "Common Context", a "Sender
Context", and a "Recipient Context".
The endpoints protect messages to send using the Sender Context and
verify messages received using the Recipient Context, both contexts
being derived from the Common Context and other data. Clients and
Servers need to be able to retrieve the correct security context to
use.
An endpoint uses its Sender ID (SID) to derive its Sender Context,
and the other endpoint uses the same ID, now called Recipient ID
(RID), to derive its Recipient Context. In communication between two
endpoints, the Sender Context of one endpoint matches the Recipient
Context of the other endpoint, and vice versa. Thus Thus, the two
security contexts identified by the same IDs in the two endpoints are
not the same, but they are partly mirrored. Retrieval and use of the
security context are shown in Figure 3.
.------------. .------------.
.-------------. .-------------.
| Common, | | Common, |
| Sender, | | Recipient,| Recipient, |
| Recipient | | Sender |
'------------' '------------'
'-------------' '-------------'
Client Server
| |
Retrieve context for | OSCOAP OSCORE request: |
target resource | [Token Token = Token1, |
Protect request with | kid = SID, ...] ... |
Sender Context +---------------------->| Retrieve context with
| | RID = kid
| | Verify request with
| | Recipient Context
| OSCOAP OSCORE response: | Protect response with
| [Token Token = Token1, ...] ... | Sender Context
Retrieve context with |<----------------------+
Token = Token1 | |
Verify request with | |
Recipient Context | |
Figure 3: Retrieval and use of the Security Context
The Common Context contains the following parameters:
o AEAD Algorithm (Alg). Value that identifies the (alg). The COSE AEAD algorithm to use for
encryption. Its value is immutable once the security context is
established.
o Key Derivation Function. The HMAC based HKDF [RFC5869] used to
derive Sender Key, Recipient Key, and Common IV.
o Master Secret. Variable length, uniformly random byte string
containing the key used to derive traffic keys and IVs. Its value
is immutable once the security context is established.
o Master Salt (OPTIONAL). Variable length byte string containing
the salt used to derive traffic keys and IVs. Its value is
immutable once the security context is established.
The Sender Context contains the following parameters:
o Sender ID. Variable length byte Common IV. Byte string identifying derived from Master Secret and Master
Salt. Length is determined by the Sender
Context. AEAD Algorithm. Its value is
immutable once the security context is established.
o
The Sender Key. Byte string containing Context contains the symmetric key to protect
messages following parameters:
o Sender ID. Non-negative integer used to send. Derived from Common identify the Sender
Context and Sender ID. to assure unique nonces. Length is determined by the
AEAD Algorithm. Its value is immutable once the security context
is established.
o Sender IV. Key. Byte string containing the IV symmetric key to protect
messages to send. Derived from Common Context and Sender ID.
Length is determined by the AEAD Algorithm. Its value is
immutable once the security context is established.
o Sender Sequence Number. Non-negative integer used by the sender
to protect requests and observe responses to send. Observe notifications. Used as partial IV
[I-D.ietf-cose-msg] "Partial
IV" [RFC8152] to generate unique nonces for the AEAD. Maximum
value is determined by the AEAD Algorithm.
The Recipient Context contains the following parameters:
o Recipient ID. Variable length byte string identifying the
Recipient Context. Its value is immutable once Non-negative integer used to identify the security
context is established.
o Recipient Key. Byte string containing the symmetric key to verify
messages received. Derived from Common
Context and Recipient ID. to assure unique nonces. Length is determined by the
AEAD Algorithm. Its value is immutable once the security context
is established.
o Recipient IV. Key. Byte string containing the IV symmetric key to verify
messages received. Derived from Common Context and Recipient ID.
Length is determined by the AEAD Algorithm. Its value is
immutable once the security context is established.
o Replay Window. Window (Server only). The replay window to verify requests and observe
responses
received.
When it is understood which context is referred to (Sender Context or
Recipient Context), the term "Context IV" is used to denote the IV
currently used with this context.
An endpoint may free up memory by not storing the Sender Key, Sender Common IV, Recipient Sender
Key, and Recipient IV, Key, deriving them from the Common
Context Master Key and Master
Salt when needed. Alternatively, an endpoint may free up memory by
not storing the Master Secret and Master Salt after the other
parameters have been derived.
The endpoints MAY interchange the client and server roles while
maintaining the same security context. When this happens, the former
server still protects messages to send using its Sender Context, and
verifies messages received using its Recipient Context. The same is
also true for the former client. The endpoints MUST NOT change the
Sender/Recipient ID. ID when changing roles. In other words, changing
the roles does not change the set of keys to be used.
3.2. Derivation Establishment of Security Context Parameters
The parameters in the security context are derived from a small set
of input parameters. The following input parameters SHALL be pre-
established:
o Master Secret
o Sender ID
o Recipient ID
The following input parameters MAY be pre-established. In case any
of these parameters is not pre-established, the default value
indicated below is used:
o AEAD Algorithm (Alg) (alg)
* Default is AES-CCM-64-64-128 AES-CCM-16-64-128 (COSE abbreviation: 12) algorithm encoding: 10)
o Master Salt
* Default is the empty string
o Key Derivation Function (KDF)
* Default is HKDF SHA-256
o Replay Window Type and Size
* Default is DTLS-type replay protection with a window size of 32
([RFC6347])
All input parameters need to be known to and agreed on by both
endpoints, but the replay window may be different in the two
endpoints. The replay window type and size is used by the client in
the processing of the Request-Tag
[I-D.amsuess-core-repeat-request-tag]. How the input parameters are
pre-established, is application specific. The EDHOC protocol [I-D.selander-ace-cose-ecdhe] enables ACE framework may be
used to establish the establishment of necessary input parameters with the property of forward
secrecy and negotiation of KDF and AEAD, it thus provides all
necessary pre-requisite steps for using OSCOAP as defined here.
[I-D.ietf-ace-oauth-authz].
3.2.1. Derivation of Sender Key/IV, Key, Recipient Key/IV Key, and Common IV
The KDF MUST be one of the HMAC based HKDF [RFC5869] algorithms
defined in COSE. HKDF SHA-256 is mandatory to implement. The
security context parameters Sender Key/IV and Key, Recipient Key/IV Key, and Common IV
SHALL be derived from the input parameters using the HKDF, which
consists of the composition of the HKDF-Extract and HKDF-Expand steps
([RFC5869]):
output parameter = HKDF(salt, IKM, info, L)
where:
o salt is the Master Salt as defined above
o IKM is the Master Secret is defined above
o info is a CBOR array consisting of:
info = [
id : bstr, bstr / nil,
alg : int,
type : tstr,
L : int uint
]
*
where:
o id is the Sender ID or Recipient ID
* when deriving keys and nil
when deriving the Common IV. Sender ID and Recipient ID are
encoded as described in Section 5
o type is "Key" or "IV"
o L is the size of the key/IV for the AEAD algorithm used, in
octets. octets
For example, if the algorithm AES-CCM-64-64-128 AES-CCM-16-64-128 (see Section 10.2 in
[I-D.ietf-cose-msg])
[RFC8152]) is used, the value for L is 16 for keys and 7 13 for IVs. the
Common IV.
3.2.2. Initial Sequence Numbers and Replay Window
The Sender Sequence Number is initialized to 0. The supported types
of replay protection and replay window length is application specific
and depends on the lower layers. Default The default is DTLS-type replay
protection with a window size of 32 initiated as described in
Section 4.1.2.6 of [RFC6347].
3.3. Requirements on the Security Context Parameters
As collisions may lead to the loss of both confidentiality and
integrity, Sender ID SHALL be unique in the set of all security
contexts using the same Master Secret. Normally (e.g. when Secret and Master Salt. When a
trusted third party assigns identifiers (e.g., using
[I-D.ietf-ace-oauth-authz]) or by using
EDHOC [I-D.selander-ace-cose-ecdhe]) a protocol that allows the
parties to negotiate locally unique identifiers in each endpoint, the
Sender IDs can be very short.
Note that The maximum Sender IDs of different lengths can be used with the same
Master Secret. E.g. the SID with value 0x00 ID is different from the
SID with 2^(nonce
length in bits - 40) - 1, For AES-CCM-16-64-128 the value 0x0000. maximum Sender ID
is 2^64 - 1. If Sender ID uniqueness cannot be guaranteed, random
Sender IDs MUST be used. Random Sender IDs MUST be long enough so
that the probability of collisions is negligible.
To enable retrieval of the right Recipient Context, the Recipient ID
SHOULD be unique in the sets of all Recipient Contexts used by an
endpoint. The Client MAY provide a Context Hint Section 8.3 to help
the Server find the right context.
While the triple (Master Secret, Master Salt, Sender ID) MUST be
unique, the same Master Salt MAY be used with several Master Secrets. Secrets
and the same Master Secret MAY be used with several Master Salts.
4. Protected CoAP Message Fields
OSCOAP
OSCORE transforms a CoAP message (which may have been generated from
an HTTP message) into an OSCOAP OSCORE message, and vice versa. This section defines how the CoAP message fields are
protected. Note that OSCOAP protects messages from the CoAP
Requests/Responses layer only, and not from the Messaging layer
(Section 2 of [RFC7252]): this means that RST and ACK empty messages
are not protected, while ACK with piggybacked responses are protected
using the process defined in this document. All the messages
mentioned in this document refer to CON, NON and non-empty ACK
messages.
OSCOAP OSCORE
protects as much of the original CoAP message as possible, possible while still
allowing forward certain proxy operations
[I-D.hartke-core-e2e-security-reqs]. Message fields may either be
o Class E: encrypted and integrity protected,
o Class I: integrity protected only, or
o Class U: unprotected. (see Section 10). This section also outlines
defines how OSCORE protects the message fields are transferred, a
detailed description and transfers them
end-to-end between client and server (in any direction).
The remainder of this section and later sections discuss the processing is provided behavior
in Section 7.
Message fields terms of the original CoAP message are either transferred messages. If HTTP is used for a particular leg in
the header/options part of end-to-end path, then this section applies to the OSCOAP message, or in the plaintext of
the COSE object. Depending on which, the location of conceptual CoAP
message that is mappable to/from the original HTTP message
field as
discussed in the OSCOAP Section 10. That is, an HTTP message is called "outer" or "inner":
o Inner message field: conceptually
transformed to a CoAP message field included and then to an OSCORE message, and
similarly in the plaintext of reverse direction. An actual implementation might
translate directly from HTTP to OSCORE without the COSE object intervening CoAP
representation.
Message fields of the OSCOAP message (see Section 5.1). The
inner CoAP message fields are by definition may be protected end-to-end
between CoAP client and CoAP server in different ways:
o Class E: encrypted and integrity protected,
o Class I: integrity protected by the COSE object (Class E). only, or
o Outer message field: Class U: unprotected.
The sending endpoint SHALL transfer Class E message field included fields in the header or
options part
ciphertext of the OSCOAP COSE object in the OSCORE message. The outer sending
endpoint SHALL include Class I message fields are
not encrypted and thus visible to an intermediary, but may be
integrity protected by including the message field values in the Additional
Authenticated Data (AAD) of the COSE object (see
Section 5.2). I.e. outer AEAD algorithm, allowing the
receiving endpoint to detect if the value has changed in transfer.
Class U message fields may SHALL NOT be protected in transfer. Class I or
and Class
U.
Note that, even though the U message formats field values are slightly different,
OSCOAP complies with CoAP over unreliable transport [RFC7252] as well
as CoAP over reliable transport [I-D.ietf-core-coap-tcp-tls].
4.1. CoAP Payload
The CoAP Payload SHALL be encrypted and integrity protected (Class
E), and thus is an inner message field.
The sending endpoint writes transferred in the payload header or
options part of the original CoAP OSCORE message
into which is visible to proxies.
Message fields not visible to proxies, i.e., transported in the plaintext
ciphertext of the COSE object.
The receiving endpoint verifies and decrypts the COSE object, and
recreates the payload of are called "Inner" (Class E). Message
fields transferred in the original CoAP message.
4.2. CoAP Header
Many CoAP header fields are required or options part of the OSCORE
message, which is visible to be read and changed during a
normal proxies, are called "Outer" (Class I or
U).
CoAP message exchange fields are either Inner or when traversing Outer: Inner if the value is
intended for the destination endpoint, Outer if the value is intended
for a proxy proxy. An OSCORE message may contain both an Inner and thus cannot in
general be protected between the endpoints, e.g. an
Outer message field of certain CoAP message layer fields. Inner and Outer
message fields such as Message ID.
The are processed independently.
4.1. CoAP header field Code MUST be sent in plaintext to support
RESTful processing, but MUST be integrity protected (Class I) to
prevent an intermediary from changing, e.g. from GET to DELETE. Payload
The CoAP version number MUST be integrity protected to prevent potential
future version-based attacks (Class I). Note that while the version
number is not sent Payload, if present in each CoAP message over reliable transport
[I-D.ietf-core-coap-tcp-tls], its value is known to client and
server.
The other the original CoAP header fields message, SHALL neither be
encrypted and integrity protected nor
encrypted (Class U). All CoAP header fields are and is thus outer an Inner message
fields. field.
The sending endpoint SHALL copy writes the header fields from payload of the original CoAP message to
into the header of plaintext (Section 5.2) input to the OSCOAP message. COSE object. The
receiving endpoint SHALL copy the header fields from the OSCOAP message to the
header of the decrypted CoAP message. Both sender verifies and receiver
include decrypts the CoAP version number COSE object, and header field Code in
recreates the AAD payload of the COSE object (see Section 5.2).
4.3. original CoAP message.
4.2. CoAP Options
Most
A summary of how options are encrypted and integrity protected (Class E), and
thus inner message fields. But to allow certain proxy operations,
some options have outer values, i.e. are present as options in the
OSCOAP message. Certain options may have both an inner value and a
potentially different outer value, where the inner value is intended
for the destination endpoint and the outer value is intended for a
proxy.
A summary of how options are protected and processed is shown in Figure 4. Options within each class are protected and processed in a
similar way, but certain options
which require special processing as
indicated by a * processing, in Figure 4 particular those which may have
both Inner and described in the processing of the
respective option. Outer message fields, are labelled with asterisks.
+----+----------------+---+---+---+
| No.| Name | E | I | U |
+----+----------------+---+---+---+
| 1 | If-Match | x | | |
| 3 | Uri-Host | | | x |
| 4 | ETag | x | | |
| 5 | If-None-Match | x | | |
| 6 | Observe | | * | * |
| 7 | Uri-Port | | | x |
| 8 | Location-Path | x | | |
| 11 | Uri-Path | x | | |
| 12 | Content-Format | x | | |
| 14 | Max-Age | * | | * |
| 15 | Uri-Query | x | | |
| 17 | Accept | x | | |
| 20 | Location-Query | x | | |
| 23 | Block2 | * | | * |
| 27 | Block1 | * | | * |
| 28 | Size2 | * | | * |
| 35 | Proxy-Uri | * | | * |
| 39 | Proxy-Scheme | | | x |
| 60 | Size1 | * | | * |
+----+----------------+---+---+---+
E=Encrypt
E = Encrypt and Integrity Protect, I=Integrity Protect only,
U=Unprotected, *=Special (Inner)
I = Integrity Protect only (Outer)
U = Unprotected (Outer)
* = Special
Figure 4: Protection of CoAP Options
Unless specified otherwise,
Unknown CoAP options not listed in Figure 4 SHALL be encrypted and integrity protected and processed as class E
options. (and no special
processing). Specifications of new CoAP options SHOULD define how
they are processed with OSCOAP. New OSCORE. A new COAP options option SHOULD be of class
E and
SHOULD NOT have outer values unless a forwarding it requires proxy needs to read
that option value. If a certain option has both inner and outer
values, the two values SHOULD NOT be the same.
4.3.1. Class E processing.
4.2.1. Inner Options
For options
When using OSCORE, Inner option message fields (marked in class column E (see of
Figure 4) the option value are sent in the
original CoAP message, if present, SHALL be encrypted and integrity
protected between the endpoints. Hence the actions resulting from
the use of such options is a way analogous to communicating in a protected
manner directly with the other endpoint. For example, a client using an
If-Match option will not be served by a proxy.
The sending endpoint SHALL write the class E Inner option from message fields
present in the original CoAP message into the plaintext of the COSE object.
Except for
object Section 5.2, and then remove the special options (* in Figure 4), Inner option message fields
from the OSCORE message.
The processing of Inner option message fields by the receiving
endpoint is specified in Section 7.2 and Section 7.4.
4.2.2. Outer Options
Outer option message fields (marked in column U or I of Figure 4) are
used to support proxy operations.
The sending endpoint SHALL NOT use include the Outer option message field
present in the original message in the outer options part of class E. However, note that an
intermediary may, legitimately or not, add, change or remove the
value OSCORE
message. All Outer option message fields, including Object-Security,
SHALL be encoded as described in Section 3.1 of an outer option.
Except for [RFC7252], where the special options,
delta is the difference to the previously included Outer option
message field.
The processing of Outer options by the receiving endpoint SHALL discard
any outer options is
specified in Section 7.2 and Section 7.4.
A procedure for integrity-protection-only of class E from the OSCOAP Class I option message and SHALL write
the
fields is specified in Section 5.3.
Note: There are currently no Class E I option message fields defined.
4.2.3. Special Options
Some options present require special processing, marked with an asterisk '*'
in Figure 4. An asterisk in the plaintext of columns E and U indicate that the COSE object into
option may be added as an Inner and/or Outer message by the decrypted CoAP message.
4.3.1.1. sending
endpoint; the processing is specified in this section.
4.2.3.1. Max-Age
An inner
The Inner Max-Age option, like other class E options, option is used as to specify the freshness (as defined
in [RFC7252] [RFC7252]) of the resource, end-to-end from the server to the
client, taking into account that it the option is not accessible to
proxies.
Since OSCOAP binds CoAP responses to requests, a cached response
would not The Inner Max-Age SHALL be possible processed by OSCORE as specified
in Section 4.2.1.
The Outer Max-Age option is used to use for any other request. To avoid unnecessary caching, a server MAY add an outer caching of
OSCORE responses at OSCORE unaware intermediary nodes. A server MAY
set a Class U Max-Age option with value zero to OSCOAP Observe responses
(see Section 5.6.1 of [RFC7252]). [RFC7252]) which is then processed according to
Section 4.2.2. The
outer Outer Max-Age option is value SHALL be discarded by
the OSCORE client.
Non-Observe OSCORE responses do not integrity protected.
4.3.1.2. need to include a Max-Age option
since the responses are non-cacheable by construction (see
Section 4.3).
4.2.3.2. The Block Options
Blockwise [RFC7959] is an optional feature. An implementation MAY
comply with
support [RFC7252] and the Object-Security option without
implementing supporting
[RFC7959]. The Block options (Block1, Block2, Size1 and Size2) MAY be either
only inner options, only outer options are used to secure message
fragmentation end-to-end (Inner options) or both inner for proxies to fragment
the OSCORE message for the next hop (Outer options). Inner and outer
options. Outer
block processing may have different performance properties depending
on the underlying transport. The inner integrity of the message can be
verified end-to-end both in case of Inner and outer options Outer Blockwise
provided all blocks are processed independently.
4.3.1.2.1. received (see Section 4.2.3.2.2).
4.2.3.2.1. Inner Block Options
The inner Block options are used for endpoint-to-endpoint secure
fragmentation of payload into blocks and protection of information
about the fragmentation (block number, block size, last block). In
this case, the sending CoAP endpoint fragments the MAY fragment a CoAP message as defined in
[RFC7959] before the message is processed by OSCOAP. OSCORE. In this case
the Block options SHALL be processed by OSCORE as Inner options
(Section 4.2.1). The receiving CoAP endpoint first processes SHALL process the OSCOAP
OSCORE message according to Section 4.2.1 before processing blockwise
as defined in [RFC7959].
Applications using OSCOAP with inner Block options MUST specify a
security policy defining a maximum unfragmented message size for
inner Block options such that messages exceeding this size SHALL be
fragmented by the sending endpoint.
For blockwise request operations (using Block1) the client using Block1, an endpoint MUST use
and process
comply with the Request-Tag as processing defined in Section 3 of
[I-D.amsuess-core-repeat-request-tag]. In particular, the rules in
section 3.3.1 of [I-D.amsuess-core-repeat-request-tag] MUST be
followed, which guarantee that a specific request body is assembled
only from the corresponding request blocks.
For blockwise response operations (using Block2) the server using Block2, an endpoint MUST use
and process
comply with the ETag as processing defined in Section 4 of
[I-D.amsuess-core-repeat-request-tag].
4.3.1.2.2.
4.2.3.2.2. Outer Block Options
A CoAP proxy may do block fragmentation on any CoAP
Proxies MAY fragment an OSCORE message
(including OSCOAP messages) as defined in [RFC7959], and thereby
decompose it into multiple blocks using outer Block options. The
outer block [RFC7959], which then
introduces Outer Block options not generated by the sending endpoint.
Note that the Outer Block options are thus neither encrypted nor integrity
protected.
To allow multiple concurrent request operations to the same server
(not only same resource), As a consequence, a CoAP proxy should use can maliciously inject block
fragments indefinitely, since the receiving endpoint needs to receive
the last block (see [RFC7959]) to be able to compose the OSCORE
message and process verify its integrity. Therefore, applications supporting
OSCORE and [RFC7959] MUST specify a security policy defining a
maximum unfragmented message size (MAX_UNFRAGMENTED_SIZE) considering
the
Request-Tag as specified in section 3.3.2 maximum size of
[I-D.amsuess-core-repeat-request-tag]; an OSCOAP server that supports
outer message which can be handled by the endpoints.
Messages exceeding this size SHOULD be fragmented by the sending
endpoint using Inner Block options MUST support the Request-Tag option. (Section 4.2.3.2.1).
An endpoint receiving an OSCOAP OSCORE message with an outer Outer Block option
SHALL first process this option according to [RFC7959], until all
blocks of the OSCOAP OSCORE message have been received, or the cumulated
message size of the blocks exceeds the maximum unfragmented message
size. In the latter case the message SHALL be discarded. MAX_UNFRAGMENTED_SIZE. In the
former case, the processing of the OSCOAP OSCORE message continues as
defined in this document.
4.3.2. Class I Options
A Class I option is an outer option and hence visible in the options
part of the OSCOAP message. Except for special options described in In the subsections, for options in Class I (see Figure 4) latter case the option
value message SHALL be integrity protected between
discarded.
To allow multiple concurrent request operations to the endpoints, see
(Section 5.2). Unless otherwise specified, same server
(not only same resource), a CoAP proxy SHOULD follow the Request-Tag
processing specified in section 3.3.2 of
[I-D.amsuess-core-repeat-request-tag].
4.2.3.3. Proxy-Uri
Proxy-Uri, when present, is split by OSCORE into class U options and
class E options, which are processed accordingly. When Proxy-Uri is
used in the original CoAP message, Uri-* are not present [RFC7252].
The sending endpoint SHALL encode first decompose the Class I options in Proxy-Uri value of the OSCOAP
original CoAP message as described
in Section 4.3.4.
4.3.2.1. Observe
Observe [RFC7641] is into the Proxy-Scheme, Uri-Host, Uri-Port, Uri-
Path, and Uri-Query options (if present) according to section 6.4 of
[RFC7252].
Uri-Path and Uri-Query are class E options and SHALL be protected and
processed as Inner options (Section 4.2.1).
The Proxy-Uri option of the OSCORE message SHALL be set to the
composition of Proxy-Scheme, Uri-Host and Uri-Port options (if
present) as specified in section 6.5 of [RFC7252], and processed as
an Outer option of Class U (Section 4.2.2).
Note that replacing the Proxy-Uri value with the Proxy-Scheme and
Uri-* options works by design for all CoAP URIs (see Section 6 of
[RFC7252]. OSCORE-aware HTTP servers should not use the userinfo
component of the HTTP URI (as defined in section 3.2.1. of
[RFC3986]), so that this type of replacement is possible in the
presence of CoAP-to-HTTP proxies. In other documents specifying
cross-protocol proxying behavior using different URI structures, it
is expected that the authors will create Uri-* options that allow
decomposing the Proxy-Uri, and specify in which OSCORE class they
belong.
An example of how Proxy-Uri is processed is given here. Assume that
the original CoAP message contains:
o Proxy-Uri = "coap://example.com/resource?q=1"
During OSCORE processing, Proxy-Uri is split into:
o Proxy-Scheme = "coap"
o Uri-Host = "example.com"
o Uri-Port = "5683"
o Uri-Path = "resource"
o Uri-Query = "q=1"
Uri-Path and Uri-Query follow the processing defined in
Section 4.2.1, and are thus encrypted and transported in the COSE
object. The remaining options are composed into the Proxy-Uri
included in the options part of the OSCORE message, which has value:
o Proxy-Uri = "coap://example.com"
See Section 6.1 and 12.6 of [RFC7252] for more information.
4.2.3.4. Observe
Observe [RFC7641] is an optional feature. An implementation MAY
support [RFC7252] and the Object-Security option without supporting
[RFC7641]. The Observe option as used here targets the requirements
on forwarding of [I-D.hartke-core-e2e-security-reqs]
(Section 2.2.1.2).
In order for a an OSCORE-unaware proxy to support forwarding of Observe messages,
messages ([RFC7641]), there
must SHALL be an Outer Observe option option, i.e.,
present in the options part of the OSCOAP
message ([RFC7641]), so Observe must have an outer value:
o OSCORE message. The Observe option processing of
the original CoAP request SHALL be encoded
in the OSCOAP request as Code for Observe messages is described in Section 4.3.4. 4.3.
To secure the order of the notifications, responses with the Observe
option client SHALL be integrity protected in the following way:
o maintain a
Notification Number for each Observation it registers. The Observe option SHALL be included in
Notification Number is a non-negative integer containing the external_aad largest
Partial IV of the
response (see successfully received notifications for the
associated Observe registration, see Section 5.2), with value set 6.4. The Notification
Number is initialized to the 3 least
significant bytes Partial IV of the Sequence Number first successfully
received notification response to the registration request. In
contrast to [RFC7641], the received Partial IV MUST always be
compared with the Notification Number, which thus MUST NOT be
forgotten after 128 seconds.
If the verification fails, the client SHALL stop processing the
response, and in the case of CON respond with an empty ACK. The
client MAY ignore the response. Observe option value.
The Observe option in the CoAP request SHALL NOT be integrity
protected, since it may be legitimately removed by
a proxy. If the Observe option is removed from a CoAP request by a
proxy, then the server can still verify the request (as a non-Observe
request), and produce a non-Observe response. If the OSCOAP OSCORE client
receives a response to an Observe request without an outer Observe
value, then it MUST verify the response as a non-Observe response, i.e. not
include response.
(The reverse case is covered in the Sequence Number verification of the response response, see
Section 7.)
4.3. CoAP Header
Most CoAP header fields are required to be read and/or changed by
CoAP proxies and thus cannot in general be protected end-to-end
between the external_aad.
4.3.3. Class U Options
Options endpoints. As mentioned in Class U have outer values Section 1, OSCORE protects
the CoAP Request/Response layer only, and not the Messaging Layer
(Section 2 of [RFC7252]), so fields such as Type and Message ID are used
not protected with OSCORE.
The CoAP header field Code is protected by OSCORE. Code SHALL be
encrypted and integrity protected (Class E) to support forward
proxy operations. Unless otherwise specified, prevent an
intermediary from eavesdropping or manipulating the Code (e.g.,
changing from GET to DELETE).
The sending endpoint SHALL encode write the Class U options in Code of the options part original CoAP
message into the plaintext of the COSE object Section 5.2. After
that, the Outer Code of the OSCOAP OSCORE message as described SHALL be set to 0.02
(POST) for requests and to 2.04 (Changed) for responses, except for
Observe messages. For Observe messages, the Outer Code of the OSCORE
message SHALL be set to 0.05 (FETCH) for requests and to 2.05
(Content) for responses. This exception allows OSCORE to be
compliant with the Observe processing in Section 4.3.4.
4.3.3.1. Uri-Host, Uri-Port, OSCORE-unaware proxies. The
choice of POST and Proxy-Scheme FETCH ([RFC8132]) allows all OSCORE messages to
have payload.
The sending receiving endpoint SHALL copy Uri-Host, Uri-Port, and Proxy-Scheme
from discard the original CoAP Code in the OSCORE message to
and write the options part Code of the OSCOAP
message. When Uri-Host, Uri-Port, or Proxy-Scheme options are
present, Proxy-Uri is not used [RFC7252].
4.3.3.2. Proxy-Uri
Proxy-Uri, when present, is split by OSCOAP into class U options and
class E options, which are processed accordingly. When Proxy-Uri is
used Plaintext in the original COSE object (Section 5.2)
into the decrypted CoAP message, Uri-* message.
The other CoAP header fields are not present [RFC7252]. Unprotected (Class U). The sending
endpoint SHALL first decompose the Proxy-Uri value write all other header fields of the original CoAP message
into the Proxy-Scheme, Uri-Host, Uri-Port, Uri-
Path and Uri-Query options (if present) according to section 6.4 header of
[RFC7252].
Uri-Path and Uri-Query are class E options and MUST be protected and
processed as if obtained the OSCORE message. The receiving endpoint SHALL
write the header fields from the original received OSCORE message into the
header of the decrypted CoAP message, see
Section 4.3.1. message.
5. The value of COSE Object
This section defines how to use COSE [RFC8152] to wrap and protect
data in the Proxy-Uri option of original message. OSCORE uses the OSCOAP message MUST be
replaced with Proxy-Scheme, Uri-Host and Uri-Port options (if
present) composed according to section 6.5 of [RFC7252] and MUST be
processed as a class U option, see Section 4.3.3.
An example of how Proxy-Uri is processed is given here. Assume that
the original CoAP message contains:
o Proxy-Uri = "coap://example.com/resource?q=1"
During OSCOAP processing, Proxy-Uri is split into:
o Proxy-Scheme = "coap"
o Uri-Host = "example.com"
o Uri-Port = "5863"
o Uri-Path = "resource"
o Uri-Query = "q=1"
Uri-Path and Uri-Query follow the processing defined in
Section 4.3.1, and are thus encrypted and transported in the COSE
object. The remaining options are composed into the Proxy-Uri
included in the options part of the OSCOAP message, which has value:
o Proxy-Uri = "coap://example.com"
4.3.4. Outer Options in the OSCOAP Message
All options with outer values present in the OSCOAP message,
including the Object-Security option, SHALL be encoded as described
in Section 3.1 of [RFC7252], where the delta is the difference to the
previously included outer option value.
5. The COSE Object
This section defines how to use COSE [I-D.ietf-cose-msg] to wrap and
protect data in the original CoAP message. OSCOAP uses the untagged
COSE_Encrypt0 structure untagged COSE_Encrypt0
structure with an Authenticated Encryption with Additional Data
(AEAD) algorithm. The key lengths, IV lengths, length, nonce length, and
maximum sequence number Sender Sequence Number are algorithm dependent.
The AEAD algorithm AES-CCM-64-64-128 AES-CCM-16-64-128 defined in Section 10.2 of
[I-D.ietf-cose-msg]
[RFC8152] is mandatory to implement. For AES-CCM-64-64-128 AES-CCM-16-64-128 the
length of Sender Key and Recipient Key is 128 bits, the length of
nonce, Sender IV,
nonce and Recipient Common IV is 7 13 bytes. The maximum Sender Sequence Number
is specified in Section 10.
The nonce is constructed as described in Section 3.1 of
[I-D.ietf-cose-msg], i.e. 11.
We denote by padding Plaintext the partial IV (Sequence Number
in network byte order) with zeroes data that is encrypted and XORing it with the Context IV
(Sender IV or Recipient IV), with integrity
protected, and by Additional Authenticated Data (AAD) the following addition: The most
significant bit in the first byte of the Context IV SHALL be flipped
for responses, in case there is a unique response (not Observe). In
this way, the same sequence number can be reused for requests and
corresponding responses, which reduces the size of the responses in
the most common case. For detailed processing instructions, see
Section 7.
We denote by Plaintext the data that is encrypted and integrity
protected, and by Additional Authenticated Data (AAD) the data that
is integrity protected only. data that
is integrity protected only.
The COSE Object SHALL be a COSE_Encrypt0 object with fields defined
as follows
o The "protected" field is empty.
o The "unprotected" field includes:
* The "Partial IV" parameter. The value is set to the Sender
Sequence Number. The Partial IV All leading zeroes SHALL be of minimum length needed to
encode removed when
encoding the sequence number. Partial IV, i.e. the first byte (if any) SHALL
never be zero. This parameter SHALL be present in requests.
In case of Observe (Section 4.3.2.1) 4.2.3.4) the Partial IV SHALL be
present in the response, responses, and otherwise the Partial IV SHALL NOT be
present in the response. responses.
* The "kid" parameter. The value is set to the Sender ID (see
Section 3). All leading zeroes SHALL be removed when encoding
the Partial IV, i.e. the first byte (if any) SHALL never be
zero. This parameter SHALL be present in requests and SHALL
NOT be present in responses.
o The "ciphertext" field is computed from the secret key (Sender Key
or Recipient Key), Nonce (see Section 5.1), Plaintext (see
Section 5.1) 5.2), and the Additional Authenticated Data (AAD) (see
Section 5.2) 5.3) following Section 5.2 of [I-D.ietf-cose-msg]. [RFC8152].
The encryption process is described in Section 5.3 of
[I-D.ietf-cose-msg]. [RFC8152].
5.1. Nonce
The nonce is constructed by left-padding the Partial IV (in network
byte order) with zeroes to exactly 5 bytes, left-padding the Sender
ID of the endpoint that generated the Partial IV (in network byte
order) with zeroes to exactly nonce length - 5 bytes, concatenating
the padded Partial IV with the padded ID, and then XORing with the
Common IV.
When observe is not used, the request and the response uses the same
nonce. In this way, the Partial IV does not have to be sent in
responses, which reduces the size. For processing instructions, see
Section 7.
+--------------------------+--+--+--+--+--+
| ID of PIV generator | Partial IV |---+
+--------------------------+--+--+--+--+--+ |
|
+-----------------------------------------+ |
| Common IV |->(+)
+-----------------------------------------+ |
|
+-----------------------------------------+ |
| Nonce |<--+
+-----------------------------------------+
Figure 5: AEAD Nonce Formation
5.2. Plaintext
The Plaintext is formatted as a CoAP message without Header (see
Figure 5) 6) consisting of:
o all Class E the Code of the original CoAP message as defined in Section 3 of
[RFC7252]; and
o all Inner option values message fields (see Section 4.3.1 4.2.1) present in the
original CoAP message (see Section 4.3). 4.2). The options are encoded
as described in Section 3.1 of [RFC7252], where the delta is the
difference to the previously included Class E option; and
o the Payload of original CoAP message, if present, and in that case
prefixed by the one-byte Payload Marker (0xFF).
0 1 2 3
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
| Code | Class E options (if any) ...
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|1 1 1 1 1 1 1 1| Payload (if any) ...
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
(only if there
is payload)
Figure 5: 6: Plaintext
5.2.
5.3. Additional Authenticated Data
The external_aad SHALL be a CBOR array as defined below:
external_aad = [
ver : uint,
code
version : uint,
options : bstr,
alg : int,
request_kid : bstr,
request_seq
request_piv : bstr,
options : bstr
]
where:
o ver: version: contains the CoAP OSCORE version number, as defined in Section 3 of
[RFC7252].
o code: contains is the CoAP Code of the original CoAP message, as
defined in Section 3 of [RFC7252].
o options: contains the Class I options Section 4.3.2 present in the
original CoAP message encoded as described in Section 3.1 number. Implementations of
[RFC7252], where the delta is the difference
this specification MUST set this field to the previously
included class I option 1. Other values are
reserved for future versions.
o alg: contains the AEAD Algorithm from the security context used
for the exchange (see Section 3.1).
o request_kid: contains the value of the 'kid' in the COSE object of
the request (see Section 5).
o request_seq: request_piv: contains the value of the 'Partial IV' in the COSE
object of the request (see Section 5).
o options: contains the (non-special) Class I options (see
Section 4.2.2) present in the original CoAP message encoded as
described in Section 3.1 of [RFC7252], where the delta is the
difference to the previously included class I option.
6. Sequence Numbers, Replay, Message Binding, and Freshness
Sequence numbers
6.1. Message Binding
In order to prevent response delay and replay window are initialized as defined mismatch attacks
[I-D.mattsson-core-coap-actuators] from on-path attackers and
compromised proxies, OSCORE binds responses to the request by
including the request's ID (Sender ID or Recipient ID) and Partial IV
in
Section 3.2.2.
6.1. the AAD of the response. The server therefore needs to store the
request's ID (Sender ID or Recipient ID) and Partial IV until all
responses have been sent.
6.2. AEAD Nonce Uniqueness
An AEAD nonce MUST NOT be used more than once per AEAD key. In order
to assure unique nonces, each Sender Context contains a Sender
Sequence Number used to protect requests, and - in case of Observe -
responses. If messages are processed concurrently, the operation of
reading and increasing the Sender Sequence Number MUST be atomic.
The maximum sequence number Sender Sequence Number is algorithm dependent, see
Section 10. 11. If the Sender Sequence Number exceeds the maximum sequence
number, maximum, the
endpoint MUST NOT process any more messages with the given Sender
Context. The endpoint SHOULD acquire a new security context (and
consequently inform the other endpoint) before this happens. The
latter is out of scope of this document.
6.2. Replay Protection
In order to protect from replay of messages, each Recipient Context
contains a Replay Window used
6.3. Freshness
For requests, OSCORE provides weak absolute freshness as the only
guarantee is that the request is not older than the security context.
For applications having stronger demands on request freshness (e.g.,
control of actuators), OSCORE needs to verify request, be augmented with mechanisms
providing freshness [I-D.amsuess-core-repeat-request-tag].
For responses, the message binding guarantees that a response is not
older than its request. For responses without Observe, this gives
strong absolute freshness. For responses with Observe, the absolute
freshness gets weaker with time, and - it is RECOMMENDED that the
client regularly restart the observation.
For requests, and responses with Observe, OSCORE also provides
relative freshness in case the sense that the received Partial IV allows a
recipient to determine the relative order of
Observe - responses.
6.4. Replay Protection
In order to protect from replay of requests, the server's Recipient
Context includes a Replay Window. A receiving endpoint server SHALL verify that a
Sequence Number (Partial IV)
Partial IV received in the COSE object has not been received before in the Recipient Context. For requests, if before.
If this verification fails and the message received is a CON message,
the server SHALL respond with a 4.00 Bad Request 5.03 Service Unavailable error message.
message with the inner Max-Age option set to 0. The diagnostic
payload MAY contain the "Replay protection failed" string.
For responses, if this verification fails and the message received is
a CON message, the client SHALL respond with an empty ACK and stop
processing the response. The size
and type of the Replay Window depends on the use case and lower
protocol layers. In case of reliable and ordered transport from
endpoint to endpoint, the recipient server MAY just store the last received sequence number
Partial IV and require that newly received Sequence
Numbers Partial IVs equals the
last received Sequence Number Partial IV + 1.
6.3. Sequence Number and Replay Window State
To prevent reuse of
Responses to non-Observe requests are protected against replay as
they are cryptographically bound to the Nonce/Sequence Number with request.
In the same key, or
from accepting replayed messages, case of Observe, a node needs to handle client receiving a notification SHALL
verify that the
situation of suddenly losing sequence number Partial IV of a received notification is greater than
the Notification Number bound to that Observe registration. If the
verification fails, the client SHALL stop processing the response,
and replay window state in RAM, e.g. as the case of CON respond with an empty ACK. If the
verification succeeds, the client SHALL overwrite the corresponding
Notification Number with the received Partial IV.
If messages are processed concurrently, the Partial IV needs to be
validated a result second time after decryption and before updating the
replay protection data. The operation of validating the Partial IV
and updating the replay protection data MUST be atomic.
6.5. Losing Part of the Context State
To prevent reuse of the Nonce with the same key, or from accepting
replayed messages, a node needs to handle the situation of losing
rapidly changing parts of the context, such as the request Token,
Sender Sequence Number, Replay Window, and Nofitifcation Numbers.
These are typically stored in RAM and therefore lost in the case of
an unplanned reboot.
After boot, a node MAY reject to use existing security contexts from
before it booted and MAY establish a new security context with each
party it communicates, e.g. using EDHOC
[I-D.selander-ace-cose-ecdhe]. communicates. However, establishing a fresh security
context may have a non-negligible cost in terms of e.g. of, e.g., power
consumption.
If
After boot, a node MAY use a partly persistently stored security context is to be used after reboot,
context, but then the node MUST NOT reuse a previous Sender Sequence
Number and MUST NOT accept previously accepted messages.
6.3.1. The Basic Case Some ways
to achieve this is described below:
6.5.1. Sequence Number
To prevent reuse of Sender Sequence Number, the Numbers, a node MAY perform the
following procedure during normal operations:
o Before sending Each time the Sender Sequence Number is evenly divisible by K,
where K is a message, positive integer, store the client stores Sender Sequence Number in
persistent memory a
sequence number associated to the stored security context higher
than any sequence number which has been or are being sent using
this security context. memory. After boot, the client does not use any
lower sequence number in a request than what was persistently node initiates the Sender
Sequence Number to the value stored with that security context.
* in persistent memory + K - 1.
Storing to persistent memory can be costly. Instead of storing
a sequence number for each request, the client may store Seq +
K to persistent memory every K requests, where Seq is the
current sequence number and The value K > 1. This is gives a
trade-off between the number of storage operations and efficient
use of sequence
numbers. Sender Sequence Numbers.
6.5.2. Replay Window
To prevent accepting replay of previously received messages, requests, the node
server MAY perform the following procedure: procedure after boot:
o After boot, before verifying a message using a security context
stored before boot, the server synchronizes the replay window so
that no old messages are being accepted. The server uses the
Repeat option [I-D.amsuess-core-repeat-request-tag] for
synchronizing the replay window: For each stored security context, the first time after boot the
server receives an OSCOAP OSCORE request,
it generates a pseudo-random nonce and responds with the server uses the Repeat
option set [I-D.amsuess-core-repeat-request-tag] to the nonce as described in
[I-D.amsuess-core-repeat-request-tag]. If the server receives get a
repeated OSCOAP request containing the Repeat option with
verifiable freshness and uses that to synchronize the same
nonce, and if replay
window. If the server can verify the fresh request, then the sequence
number obtained Partial
IV in the repeated message fresh request is set as the lower limit of the replay
window.
6.3.2. The
6.5.3. Replay Protection of Observe Case Notifications
To prevent reuse of Sequence Number in case accepting replay of Observe, previously received notification
responses, the node client MAY perform the following procedure during normal operations: after boot:
o Before sending a notification, the server stores in persistent
memory a sequence number associated The client rejects notifications bound to the stored security context
higher than any sequence number for which a notification has been
or are being sent earlier
registration, removes all Notification Numbers and re-register
using this security context. After boot, Observe.
7. Processing
This section describes the
server does not use any lower sequence number in an Observe
response than what was persistently stored with that security
context.
* Storing to persistent memory can be costly. Instead of storing OSCORE message processing.
7.1. Protecting the Request
Given a sequence number for each notification, CoAP request, the server may store
Seq + K client SHALL perform the following steps to persistent memory every K requests, where Seq is the
current sequence number and K > 1. This is a trade-off between
the number of storage operations and efficient use of sequence
numbers.
Note that a client MAY continue an ongoing observation after reboot
using a stored security context. With Observe, the client can only
verify the order of the notifications, as they may be delayed. If
the client wants to synchronize with a server resource it MAY restart
an observation.
6.4. Freshness
For responses without Observe, OSCOAP provides absolute freshness.
For requests, and responses with Observe, OSCOAP provides relative
freshness in the sense that the sequence numbers allows a recipient
to determine the relative order of messages.
For applications having stronger demands on freshness (e.g. control
of actuators), OSCOAP needs to be augmented with mechanisms providing
absolute freshness [I-D.mattsson-core-coap-actuators].
6.5. Delay and Mismatch Attacks
In order to prevent response delay and mismatch attacks
[I-D.mattsson-core-coap-actuators] from on-path attackers and
compromised proxies, OSCOAP binds responses to the request by
including the request's ID (Sender ID or Recipient ID) and sequence
number in the AAD of the response. The server therefore needs to
store the request's ID (Sender ID or Recipient ID) and sequence
number until all responses have been sent.
7. Processing
7.1. Protecting the Request
Given a CoAP request, the client SHALL perform the following steps to
create an OSCOAP request:
1. Retrieve
create an OSCORE request:
1. Retrieve the Sender Context associated with the target resource.
2. Compose the Additional Authenticated Data, as described in
Section 5.
3. Compose Compute the AEAD nonce by XORing from the Context Sender ID, Common IV, and Partial
IV (Sender IV) with
the partial IV (Sequence Sequence Number in network byte order). Then (in one
atomic operation, see Section 6.2) increment the Sender Sequence
Number by one.
4. Encrypt the COSE object using the Sender Key. Compress the COSE
Object as specified in Section 8.
5. Format the OSCOAP OSCORE message according to Section 4. The Object-
Security option is added, see Section 4.3.4. 4.2.2.
6. Store the association Token - Security Context. The client SHALL
be able to find the Recipient Context from the Token in the
response.
7. Increment the Sequence Number by one.
7.2. Verifying the Request
A server receiving a request containing the Object-Security option
SHALL perform the following steps:
1. Process outer Block options according to [RFC7959], until all
blocks of the request have been received, see Section 4.3.1.2. 4.2.3.2.
2. Decompress Discard the COSE Object (Section 8) message Code and retrieve the Recipient
Context associated all non-special Inner option
message fields (marked with the 'x' in column E of Figure 4) present
in the received message. For example, an If-Match Outer option
is discarded, but an Uri-Host Outer option is not discarded.
3. Decompress the COSE Object (Section 8) and retrieve the
Recipient Context associated with the Recipient ID in the 'kid'
parameter. If the request is a NON message and either the
decompression or the COSE message fails to decode, or the server
fails to retrieve a Recipient Context with Recipient ID
corresponding to the 'kid' parameter received, then the server
SHALL stop processing the request. If the request is a CON
message, and:
* either the decompression or the COSE message fails to decode,
the server SHALL respond with a 4.02 Bad Option error
message. The diagnostic payload SHOULD contain the string
"Failed to decode COSE".
* the server fails to retrieve a Recipient Context with
Recipient ID corresponding to the 'kid' parameter received,
the server SHALL respond with a 4.01 Unauthorized error
message. The diagnostic payload MAY contain the string
"Security context not found".
If the request is a NON message and either the decompression or the
COSE message fails to decode, or the server fails to retrieve a
Recipient Context with Recipient ID corresponding to the 'kid'
parameter received, then the server SHALL stop processing the
request.
1.
4. Verify the Sequence Number in the 'Partial IV' parameter, parameter using the Replay Window, as
described in Section 6.
2.
5. Compose the Additional Authenticated Data, as described in
Section 5.
3. Compose
6. Compute the AEAD nonce by XORing from the Context IV (Recipient IV)
with Recipient ID, Common IV, and the padded
'Partial IV' parameter, received in the COSE Object.
4.
7. Decrypt the COSE object using the Recipient Key.
* If decryption fails, the server MUST stop processing the
request and, if the request is a CON message, the server MUST
respond with a 4.00 Bad Request error message. The
diagnostic payload MAY contain the "Decryption failed"
string.
* If decryption succeeds, update the Recipient Replay Window, as
described in Section 6.
5.
8. For each decrypted option, check if the option is also present
as an Outer option: if it is, discard the Outer. For example:
the message contains a Max-Age Inner and a Max-Age Outer option.
The Outer Max-Age is discarded.
9. Add decrypted code, options and payload to the decrypted request,
processing the E options as described in (Section 4).
request. The Object-Security option is removed.
6.
10. The decrypted CoAP request is processed according to [RFC7252]
7.3. Protecting the Response
Given a CoAP response, the server SHALL perform the following steps
to create an OSCOAP response: OSCORE response. Note that CoAP error responses derived
from CoAP processing (point 10. in Section 7.2) are protected, as
well as successful CoAP responses, while the OSCORE errors (point 3.,
4., 7. in Section 7.2) do not follow the processing below, but are
sent as simple CoAP responses, without OSCORE processing.
1. Retrieve the Sender Context in the Security Context used to
verify the request.
2. Compose the Additional Authenticated Data, as described in
Section 5.
3. Compose Compute the AEAD nonce
* If Observe is not used, compose the AEAD nonce by XORing the
Context IV (Sender IV with the most significant bit in the
first byte flipped) with the padded Partial IV parameter from the request. request is used.
* If Observe is used, compose Compute the AEAD nonce by XORing the
Context IV (Sender IV) with from the Sender ID,
Common IV, and Partial IV of the response
(Sequence (Sender Sequence Number in network
byte order). Then (in one atomic operation, see Section 6.2)
increment the Sender Sequence Number by one.
4. Encrypt the COSE object using the Sender Key. Compress the COSE
Object as specified in Section 8.
5. Format the OSCOAP OSCORE message according to Section 4. The Object-
Security option is added, see Section 4.3.4.
6. If Observe is used, increment the Sequence Number by one. 4.2.2.
7.4. Verifying the Response
A client receiving a response containing the Object-Security option
SHALL perform the following steps:
1. Process outer Block options according to [RFC7959], until all
blocks of the OSCOAP OSCORE message have been received, see
Section 4.3.1.2. 4.2.3.2.
2. Discard the message Code and all non-special Class E options
from the message. For example, ETag Outer option is discarded,
Max-Age Outer option is not discarded.
3. Retrieve the Recipient Context associated with the Token.
Decompress the COSE Object (Section 8). If the response is a CON
message and either the
decompression or the COSE message fails to decode, then the client SHALL send an empty ACK back and stop
processing the response. If the response is a NON message and
any of the previous conditions appear, then the client SHALL
simply stop processing the response.
1. go to
11.
4. For Observe notifications, verify the Sequence Number in the received 'Partial IV'
parameter against the corresponding Notification Number as
described in Section 6.
2. If the client receives a notification
for which no Observe request was sent, then go to 11.
5. Compose the Additional Authenticated Data, as described in
Section 5.
3. Compose
6. Compute the AEAD nonce
* If the Observe option is not present in the response, compose the AEAD
nonce by XORing the Context IV (Recipient IV with the
the most significant bit in the first byte flipped) with the
padded Partial IV parameter from the request. request is used.
* If the Observe option is present in the response, compose compute the
AEAD nonce by XORing from the Context IV (Recipient IV) with Recipient ID, Common IV, and the
padded Partial IV parameter from 'Partial
IV' parameter, received in the response.
4. COSE Object.
7. Decrypt the COSE object using the Recipient Key.
* If decryption fails, the client MUST stop processing the
response and, if the response is a CON message, the client
MUST respond with an empty ACK back. then go to 11.
* If decryption succeeds and Observe is used, update the
Recipient Replay Window,
corresponding Notification Number, as described in Section 6.
5. Add
8. For each decrypted option, check if the option is also present
as an Outer option: if it is, discard the Outer. For example:
the message contains a Max-Age Inner and a Max-Age Outer option.
The Outer Max-Age is discarded.
9. Add decrypted code, options or and payload to the decrypted response
overwriting any outer E options (see Section 4).
request. The Object-
Security Object-Security option is removed.
* If Observe is used, replace the Observe value with the 3 least
significant bytes in the sequence number.
6.
10. The decrypted CoAP response is processed according to [RFC7252]
11. (Optional) In case any of the previous erroneous conditions
apply: if the response is a CON message, then the client SHALL
send an empty ACK back and stop processing the response; if the
response is a ACK or a NON message, then the client SHALL simply
stop processing the response.
8. OSCOAP OSCORE Compression
The Concise Binary Object Representation (CBOR) [RFC7049] combines
very small message sizes with extensibility. The CBOR Object Signing
and Encryption (COSE) [I-D.ietf-cose-msg] [RFC8152] uses CBOR to create compact encoding
of signed and encrypted data. COSE is however constructed to support
a large number of different stateless use cases, and is not fully
optimized for use as a stateful security protocol, leading to a
larger than necessary message expansion. In this section section, we define
a simple stateless compression mechanism for OSCOAP, OSCORE called the
"compressed COSE object", which significantly reduces the per-packet
overhead.
8.1. Encoding of the Object-Security Option Value
The value of the Object-Security option SHALL be encoded contain the OSCORE flag
byte and the kid parameter as follows:
0 1 2 3
0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
|0 0 0|h|k| n | kid (if any) ...
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Figure 7: Object-Security Value
o The first byte MUST encode (= the OSCORE flag byte) encodes a set of flags and
the length of the Partial IV parameter.
* The three least significant bits bits, n, encode the Partial IV size.
length + 1. If their value is 0, n = 0 then the Partial IV is not present in the
compressed message. COSE object. The value n = 7 is reserved.
* The fourth least significant bit is the kid flag, k: it is set
to 1 if the kid is present in the compressed message. COSE object.
* The fifth-eighth fifth least significant bits (= most bit is the Context Hint flag, h: it
is set to 1 if the compressed COSE object contains a Context
Hint, see Section 8.3.
* The sixth-eighth least significant
half-byte) bits are reserved and SHALL
be set to zero when not in use.
o The following n remaining bytes (n being the value of the Partial IV size in
the first byte) encode the value of the Partial IV, if the Partial
IV is present (size not 0).
o The following byte encodes the size of the kid parameter, if the
kid is present (flag bit set to 1)
o The following m bytes (m given by the previous byte) encode encode the value of the kid, if the kid is
present (flag bit set to (k = 1)
o The remainining bytes encode the ciphertext.
The presence of Partial IV and kid in requests and responses is
specified in Section 5, and summarized in Figure 6.
7 6 5 4 3 2 1 0
+-+-+-+-+-+-+-+-+ k: kid flag bit
|0 0 0 0|k|pivsz| pivsz: Partial IV size (3 bits)
+-+-+-+-+-+-+-+-+
+-------+---------+------------+-----------+
| | Request 8.
+--------------------------+-----+-----+
| Resp with- | Resp with k | n |
+--------------------------+-----+-----+
| Request | out observe| observe 1 |
+-------+---------+------------+-----------+ > 0 | k
| 1 Response without Observe | 0 | 0 |
| pivsz | > 0 Response with Observe | 0 | > 0 |
+-------+---------+------------+-----------+
+--------------------------+-----+-----+
Figure 6: Flag 8: Presence of data fields in OSCORE flag byte for OSCOAP compression
8.2. Examples
This section provides examples Encoding of COSE Objects before and after
OSCOAP compression.
8.2.1. Example: Request
Before compression:
[
h'',
{ 4:h'25', 6:h'05' },
h'aea0155667924dff8a24e4cb35b9'
]
0x83 40 a2 04 41 25 06 41 05 4e ae a0 15 56 67 92
4d ff 8a 24 e4 cb 35 b9 (24 bytes)
After compression:
First byte: 0b00001001 the OSCORE Payload
The payload of the OSCORE message SHALL be encoded as follows:
o The first n - 1 bytes encode the value of the Partial IV, if the
Partial IV is present (n > 0).
o The following 1 byte encode the length of the Context Hint
(Section 8.3), s, if the Context Hint flag is set (h = 0x09
0x09 05 01 25 ae a0 15 56 67 92 4d ff 8a 24 e4 cb
35 b9 (18 bytes)
8.2.2. Example: Response (without Observe)
Before compression:
[
h'',
{},
h'aea0155667924dff8a24e4cb35b9'
] 1).
o The following s bytes encode the Context Hint, if the Context Hint
flag is set (h = 1).
o The remaining bytes encode the ciphertext.
8.3. Context Hint
For certain use cases, e.g. deployments where the same Recipient ID
is used with multiple contexts, it is necessary or favorable for the
sending endpoint to provide a Context Hint in order for the receiving
endpoint to retrieve the recipient context. The Context Hint is
implicitly integrity protected, as a manipulation leads to the wrong
or no context being retrieved resulting in a verification error.
Examples:
o If the sending endpoint has an identifier in some other namespace
which can be used by the recipient endpoint to retrieve or
establish the security context, then that identifier can be used
as Context Hint.
o In case of a group communication scenario
[I-D.tiloca-core-multicast-oscoap], if the recipient endpoint
belongs to multiple groups, involving the same endpoints, then a
group identifier can be used as Context Hint to enable the
receiving endpoint to find the right group security context.
8.4. Compression Examples
This section provides examples of COSE Objects before and after
OSCORE compression.
8.4.1. Example: Request
Before compression:
[
h'',
{ 4:h'25', 6:h'05' },
h'aea0155667924dff8a24e4cb35b9'
]
0x83 40 a0 a2 04 41 25 06 41 05 4e ae a0 15 56 67 92
4d ff 8a 24 e4 cb 35 b9 (18 (24 bytes)
After compression:
First
Flag byte: 0b00000000 0b00001010 = 0x00
0x00 0x0a
Option Value: 0a 25 (2 bytes)
Payload: 05 ae a0 15 56 67 92 4d ff 8a 24 e4 cb 35 b9 (15 bytes)
8.2.3.
8.4.2. Example: Response (with Observe) Request 2
Before compression:
[
h'',
{ 6:h'07' 4:h'00', 6:h'00' },
h'aea0155667924dff8a24e4cb35b9'
]
0x83 40 a1 a2 04 41 00 06 41 07 00 4e ae a0 15 56 67 92
4d ff 8a 24 e4 cb 35 b9 (21 (24 bytes)
After compression:
First
Flag byte: 0b00000001 0b00001001 = 0x01
0x01 07 0x09
Option Value: 09 (1 bytes)
Payload: ae a0 15 56 67 92 4d ff 8a 24 e4 cb 35 b9
(16 (14 bytes)
9. Web Linking
The use of OSCOAP MAY be indicated by a target attribute "osc" in a
web link [RFC5988] to a CoAP resource. This attribute is a hint
indicating that the destination of that link is to be accessed using
OSCOAP. Note that this
8.4.3. Example: Response (without Observe)
Before compression:
[
h'',
{},
h'aea0155667924dff8a24e4cb35b9'
]
0x83 40 a0 4e ae a0 15 56 67 92 4d ff 8a 24 e4 cb
35 b9 (18 bytes)
After compression:
Flag byte: 0b00000000 = 0x00
Option Value: (0 bytes)
Payload: ae a0 15 56 67 92 4d ff 8a 24 e4 cb 35 b9 (14 bytes)
8.4.4. Example: Response (with Observe)
Before compression:
[
h'',
{ 6:h'07' },
h'aea0155667924dff8a24e4cb35b9'
]
0x83 40 a1 06 41 07 4e ae a0 15 56 67 92 4d ff
8a 24 e4 cb 35 b9 (21 bytes)
After compression:
Flag byte: 0b00000010 = 0x02
Option Value: 02 (1 bytes)
Payload: 07 ae a0 15 56 67 92 4d ff 8a 24 e4 cb 35 b9 (15 bytes)
9. Web Linking
The use of OSCORE MAY be indicated by a target attribute "osc" in a
web link [RFC5988] to a resource. This attribute is a hint
indicating that the destination of that link is to be accessed using
OSCORE. Note that this is simply a hint, it does not include any
security context material or any other information required to run
OSCOAP.
OSCORE.
A value MUST NOT be given for the "osc" attribute; any present value
MUST be ignored by parsers. The "osc" attribute MUST NOT appear more
than once in a given link-value; occurrences after the first MUST be
ignored by parsers.
10. Security Considerations
In scenarios Proxy Operations
RFC 7252 defines operations for a CoAP-to-CoAP proxy (see Section 5.7
of [RFC7252]) and for proxying between CoAP and HTTP (Section 10 of
[RFC7252]). A more detailed description of the HTTP-to-CoAP mapping
is provided by [RFC8075]. This section describes the operations of
OSCORE-aware proxies.
10.1. CoAP-to-CoAP Forwarding Proxy
OSCORE is designed to work with intermediary nodes such as legacy CoAP-to-CoAP forward proxies or brokers,
transport layer security such
[RFC7252], but OSCORE-aware proxies provide certain simplifications
as DTLS only protects data hop-by-hop.
As a consequence the intermediary nodes can read and modify
information. specified in this section.
The trust model where all intermediate nodes targeted proxy operations are
considered trustworthy specified in Section 2.2.1 of
[I-D.hartke-core-e2e-security-reqs]. In particular caching is problematic, not only from
disabled since the CoAP response is only applicable to the original
client's CoAP request. An OSCORE-aware proxy SHALL NOT cache a privacy
perspective, but also from
response to a security perspective, as request with an Object-Security option. As a
consequence, the
intermediaries are free to delete resources on sensors search for cache hits and falsify
commands to actuators (such CoAP freshness/Max-Age
processing can be omitted.
Proxy processing of the (Outer) Proxy-Uri option is as "unlock door", "start fire alarm",
"raise bridge"). Even defined in
[RFC7252].
Proxy processing of the rare cases, where all (Outer) Block options is as defined in
[RFC7959] and [I-D.amsuess-core-repeat-request-tag].
Proxy processing of the owners (Outer) Observe option is as defined in
[RFC7641]. OSCORE-aware proxies MAY look at the Partial IV value
instead of the
intermediary nodes are fully trusted, attacks Outer Observe option.
10.2. HTTP-to-CoAP Translation Proxy
Section 10.2 of [RFC7252] and data breaches make
such [RFC8075] specify the behavior of an architecture brittle.
DTLS protects hop-by-hop
HTTP-to-CoAP proxy. As requested in Section 1 of [RFC8075], this
section describes the entire CoAP message, including header,
options, and payload. OSCOAP protects end-to-end HTTP mapping for the payload, OSCORE protocol extension
of CoAP.
The presence of the Object-Security option, both in requests and
all information
responses, is expressed in an HTTP header field named Object-Security
in the options and header, that mapped request or response. The value of the field is not required for
forwarding (see Section 4). DTLS and OSCOAP can be combined, thereby
enabling end-to-end security the
value of CoAP payload, the Object-Security option Section 8.1 in combination with
hop-by-hop protection base64url encoding
(Section 5 of the entire CoAP message, during transport
between end-point and intermediary node. [RFC4648]) without padding (see [RFC7515] Appendix C
for implementation notes for this encoding). The CoAP message layer, however, cannot be protected end-to-end
through intermediary devices since value of the parameters Type and Message
ID, as well as Token and Token Length may be changed by a proxy.
Moreover, messages that are not possible to verify should for
security reasons not always be acknowledged but in some cases be
silently dropped. This would not comply with CoAP message layer, but
does not have an impact on
payload is the application layer security solution,
since message layer OSCORE payload Section 8.2, also base64url-encoded
without padding.
Example:
Mapping and notation here is excluded from that.
The use based on "Simple Form" (Section 5.4.1.1
of COSE [RFC8075]).
[HTTP request -- Before object security processing]
GET http://proxy.url/hc/?target_uri=coap://device.url/orders HTTP/1.1
[HTTP request -- HTTP Client to Proxy]
POST http://proxy.url/hc/?target_uri=coap://device.url/ HTTP/1.1
Object-Security: 0b 25
Body: 09 07 01 13 61 f7 0f d2 97 b1 [binary]
[CoAP request -- Proxy to protect CoAP messages as specified in this
document requires an established security context. The method Server]
POST coap://device.url/
Object-Security: 0b 25
Payload: 09 07 01 13 61 f7 0f d2 97 b1 [binary]
[CoAP response -- CoAP Server to
establish the Proxy]
2.04 Changed
Object-Security: [empty]
Payload: 00 31 d1 fc f6 70 fb 0c 1d d5 ... [binary]
[HTTP response -- Proxy to HTTP Client]
HTTP/1.1 200 OK
Object-Security: [empty]
Body: 00 31 d1 fc f6 70 fb 0c 1d d5 ... [binary]
[HTTP response -- After object security context described processing]
HTTP/1.1 200 OK
Body: Exterminate! Exterminate!
Note that the HTTP Status Code 200 in Section 3.2 the next-to-last message is based on a
common shared secret material in client and server, which may be
obtained e.g. by using EDHOC [I-D.selander-ace-cose-ecdhe] or the ACE
framework [I-D.ietf-ace-oauth-authz]. An OSCOAP profile
mapping of ACE is
described in [I-D.seitz-ace-oscoap-profile].
The mandatory-to-implement AEAD algorithm AES-CCM-64-64-128 is
selected for broad applicability CoAP Code 2.04 (Changed), whereas the HTTP Status Code 200
in terms of the last message size (2^64
blocks) and maximum number of messages (2^56). Compatibility with
CCM* is achieved by using the algorithm AES-CCM-16-64-128
[I-D.ietf-cose-msg].
Most AEAD algorithms require a unique nonce for each message, for
which mapping of the sequence numbers in CoAP Code 2.05 (Content),
which was encrypted within the compressed COSE message field "Partial IV" is
used. If object carried in the recipient accepts any sequence number larger than
Body of the
one previously received, then HTTP response.
10.3. CoAP-to-HTTP Translation Proxy
Section 10.1 of [RFC7252] describes the problem behavior of sequence number
synchronization is avoided. With reliable transport it may be
defined that only messages with sequence number which are equal to
previous sequence number + 1 are accepted. The alternatives to
sequence numbers have their issues: very constrained devices may a CoAP-to-HTTP
proxy. RFC 8075 [RFC8075] does not
be able to support accurate time, or to generate cover this direction in any more
detail and store large
numbers so an example instantiation of random nonces. The requirement to change key at counter
wrap is a complication, but it also forces the user Section 10.1 of this
specification [RFC7252]
is used below.
Example:
[CoAP request -- Before object security processing]
GET coap://proxy.url/
Proxy-Uri=http://device.url/orders
[CoAP request -- CoAP Client to think about implementing key renewal.
The maximum sequence number Proxy]
POST coap://proxy.url/
Proxy-Uri=http://device.url/
Object-Security: 0b 25
Payload: 09 07 01 13 61 f7 0f d2 97 b1 [binary]
[HTTP request -- Proxy to guarantee nonce uniqueness
(Section 6.1) is algorithm dependent. Using AES_CCM, with HTTP Server]
POST http://device.url/ HTTP/1.1
Object-Security: 0b 25
Body: 09 07 01 13 61 f7 0f d2 97 b1 [binary]
[HTTP response -- HTTP Server to Proxy]
HTTP/1.1 200 OK
Object-Security: [empty]
Body: 00 31 d1 fc f6 70 fb 0c 1d d5 ... [binary]
[CoAP response -- CoAP Server to Proxy]
2.04 Changed
Object-Security: [empty]
Payload: 00 31 d1 fc f6 70 fb 0c 1d d5 ... [binary]
[CoAP response -- After object security processing]
2.05 Content
Payload: Exterminate! Exterminate!
Note that the
maximum sequence number SHALL be 2^(min(nonce length in bits, 56) -
1) - 1. The "-1" HTTP Code 2.04 (Changed) in the exponent stems from next-to-last message is
the same partial IV and
flipped bit mapping of IV (Section 5) is used HTTP Status Code 200, whereas the CoAP Code 2.05
(Content) in request and response. The
compression algorithm (Section 8) assumes that the partial IV is 56
bits or less (which last message is the reason for min(,) value that was encrypted within
the compressed COSE object carried in the exponent).
The inner block options enable Body of the sender to split large messages
into OSCOAP-protected blocks HTTP response.
11. Security Considerations
In scenarios with intermediary nodes such that as proxies or brokers,
transport layer security such as (D)TLS only protects data hop-by-
hop. As a consequence, the receiving node intermediary nodes can verify
blocks before having received the complete message. read and modify
information. The outer block
options allow for arbitrary proxy fragmentation operations that
cannot be verified by the endpoints, trust model where all intermediate nodes are
considered trustworthy is problematic, not only from a privacy
perspective, but can by policy be restricted also from a security perspective, as the
intermediaries are free to delete resources on sensors and falsify
commands to actuators (such as "unlock door", "start fire alarm",
"raise bridge"). Even in size since the encrypted options allow for secure fragmentation of
very large messages. A maximum message size (above which rare cases, where all the sending
endpoint fragments owners of the message
intermediary nodes are fully trusted, attacks and data breaches make
such an architecture brittle.
(D)TLS protects hop-by-hop the receiving endpoint discards
the entire message, if complying to including header,
options, and payload. OSCORE protects end-to-end the policy) may be obtained as part of
normal resource discovery.
Applications need to use a padding scheme if payload, and
all information in the content of a message options and header, that is not required for
proxy operations (see Section 4). (D)TLS and OSCORE can be determined solely from the length combined,
thereby enabling end-to-end security of the payload. As an
example, message payload, in
combination with hop-by-hop protection of the strings "YES" entire message, during
transport between end-point and "NO" intermediary node. The message
layer, however, cannot be protected end-to-end through intermediary
devices since, even if encrypted can be
distinguished from each other as there is no padding supplied by the
current set of encryption algorithms. Some information can protocol itself isn't translated, the
parameters Type, Message ID, Token, and Token Length may be
determined even from looking at boundary conditions. An example changed
by a proxy.
The use of
this would be returning an integer between 0 and 100 where lengths of
1, 2 and 3 will provide information about where in the range things
are. Three different methods COSE to deal with this are: 1) ensure that
all protect messages are as specified in this document
requires an established security context. The method to establish
the same length. For example using 0 security context described in Section 3.2 is based on a common
shared secret material in client and 1 instead server, which may be obtained,
e.g., by using the ACE framework [I-D.ietf-ace-oauth-authz]. An
OSCORE profile of 'yes' and 'no'. 2) Use ACE is described in [I-D.seitz-ace-oscoap-profile].
Most AEAD algorithms require a character unique nonce for each message, for
which the sender sequence numbers in the COSE message field "Partial
IV" is not part of used. If the
responses to pad to a fixed length. For example, pad with a space to
three characters. 3) Use recipient accepts any sequence number larger
than the PKCS #7 style padding scheme where m
bytes are appended each having one previously received, then the value of m. For example,
appending a 0 to "YES" and two 1's to "NO". This style problem of padding
means sequence number
synchronization is avoided. With reliable transport, it may be
defined that all values need only messages with sequence number which are equal to be padded.
11. Privacy Considerations
Privacy threats executed through intermediate nodes
previous sequence number + 1 are considerably
reduced by means of OSCOAP. End-to-end integrity protection accepted. The alternatives to
sequence numbers have their issues: very constrained devices may not
be able to support accurate time, or to generate and
encryption store large
numbers of CoAP random nonces. The requirement to change key at counter
wrap is a complication, but it also forces the user of this
specification to think about implementing key renewal.
The maximum sender sequence number is dependent on the AEAD
algorithm. The maximum sender sequence number SHALL be 2^40 - 1, or
any algorithm specific lower limit. The compression mechanism
(Section 8) assumes that the Partial IV is 40 bits or less. The
mandatory-to-implement AEAD algorithm AES-CCM-16-64-128 is selected
for compatibility with CCM*.
The inner block options enable the sender to split large messages
into OSCORE-protected blocks such that the receiving node can verify
blocks before having received the complete message. The outer block
options allow for arbitrary proxy fragmentation operations that
cannot be verified by the endpoints, but can by policy be restricted
in size since the encrypted options allow for secure fragmentation of
very large messages. A maximum message size (above which the sending
endpoint fragments the message and the receiving endpoint discards
the message, if complying to the policy) may be obtained as part of
normal resource discovery.
12. Privacy Considerations
Privacy threats executed through intermediate nodes are considerably
reduced by means of OSCORE. End-to-end integrity protection and
encryption of the message payload and all options that are not used
for
forwarding, proxy operations, provide mitigation against attacks on sensor
and actuator communication, which may have a direct impact on the
personal sphere.
The unprotected options (Figure 4) may reveal privacy sensitive
information. In particular Uri-Host SHOULD NOT contain privacy
sensitive information.
CoAP headers sent in plaintext allow for example matching of CON and
ACK (CoAP Message Identifier), matching of request and responses
(Token) and traffic analysis.
Using the mechanisms described in Section 6.3 reveals 6.5 may reveal when a
device goes through a reboot. This can be mitigated by the device
storing the precise state of sender sequence number and recipient replay window
on a clean shutdown.
12. IANA Considerations
Note to RFC Editor: Please replace all occurrences
The length of "[[this
document]]" with message fields can reveal information about the RFC number of this specification.
12.1. CoAP Option Numbers Registry
The Object-Security option is added
message. Applications may use a padding scheme to protect against
traffic analysis. As an example, the CoAP Option Numbers strings "YES" and "NO" even if
encrypted can be distinguished from each other as there is no padding
supplied by the current set of encryption algorithms. Some
information can be determined even from looking at boundary
conditions. An example of this would be returning an integer between
0 and 100 where lengths of 1, 2 and 3 will provide information about
where in the range things are. Three different methods to deal with
this are: 1) ensure that all messages are the same length. For
example, using 0 and 1 instead of 'yes' and 'no'. 2) Use a character
which is not part of the responses to pad to a fixed length. For
example, pad with a space to three characters. 3) Use the PKCS #7
style padding scheme where m bytes are appended each having the value
of m. For example, appending a 0 to "YES" and two 1's to "NO". This
style of padding means that all values need to be padded. Similar
arguments apply to other message fields such as resource names.
13. IANA Considerations
Note to RFC Editor: Please replace all occurrences of "[[this
document]]" with the RFC number of this specification.
13.1. CoAP Option Numbers Registry
The Object-Security option is added to the CoAP Option Numbers
registry:
+--------+-----------------+-------------------+
| Number | Name | Reference |
+--------+-----------------+-------------------+
| TBD | Object-Security | [[this document]] |
+--------+-----------------+-------------------+
12.2. Media Type
13.2. Header Field Registrations
The "application/oscon" media type HTTP header field Object-Security is added to the Media Types Message Headers
registry:
Type name: application
Subtype name: oscon
Required parameters: N/A
Optional parameters: N/A
Encoding considerations: binary
Security considerations: See Appendix C of this document.
Interoperability considerations: N/A
Published specification:
+-------------------+----------+----------+-------------------+
| Header Field Name | Protocol | Status | Reference |
+-------------------+----------+----------+-------------------+
| Object-Security | http | standard | [[this document]] (this document)
Applications that use this media type: To be identified
Fragment identifier considerations: N/A
Additional information:
* Magic number(s): N/A
* File extension(s): N/A
* Macintosh file type code(s): N/A
Person & email address to contact for further information:
Goeran Selander <[email protected]>
Intended usage: COMMON
Restrictions on usage: N/A
Author: Goeran Selander, [email protected]
12.3. CoAP Content Format Registration
The "application/oscon" content format is added to the CoAP Content
Format registry:
+-------------------+----------+-----+-------------------+
| Media type | Encoding | ID | Reference |
+-------------------+----------+-----+-------------------+
| application/oscon | - | TBD | [[this document]] |
+-------------------+----------+-----+-------------------+
13. Acknowledgments
The following individuals provided input to |
+-------------------+----------+----------+-------------------+
14. Acknowledgments
The following individuals provided input to this document: Christian
Amsuess, Tobias Andersson, Carsten Bormann, Joakim Brorsson, Thomas
Fossati, Martin Gunnarsson, Klaus Hartke, Jim Schaad, Dave Thaler,
Marco Tiloca, and Malisa Vučinić.
Ludwig Seitz and Goeran Selander worked on this document as part of
the CelticPlus project CyberWI, with funding from Vinnova.
14.
15. References
14.1.
15.1. Normative References
[I-D.amsuess-core-repeat-request-tag]
Amsuess, C., Mattsson, J., and G. Selander, "Repeat And
Request-Tag", draft-amsuess-core-repeat-request-tag-00
(work in progress), July 2017.
[I-D.ietf-cose-msg]
Schaad, J., "CBOR Object Signing and Encryption (COSE)",
draft-ietf-cose-msg-24 (work in progress), November 2016.
[RFC2119] Bradner, S., "Key words for use in RFCs to Indicate
Requirement Levels", BCP 14, RFC 2119,
DOI 10.17487/RFC2119, March 1997,
<http://www.rfc-editor.org/info/rfc2119>.
<https://www.rfc-editor.org/info/rfc2119>.
[RFC4648] Josefsson, S., "The Base16, Base32, and Base64 Data
Encodings", RFC 4648, DOI 10.17487/RFC4648, October 2006,
<https://www.rfc-editor.org/info/rfc4648>.
[RFC5988] Nottingham, M., "Web Linking", RFC 5988,
DOI 10.17487/RFC5988, October 2010,
<http://www.rfc-editor.org/info/rfc5988>.
<https://www.rfc-editor.org/info/rfc5988>.
[RFC6347] Rescorla, E. and N. Modadugu, "Datagram Transport Layer
Security Version 1.2", RFC 6347, DOI 10.17487/RFC6347,
January 2012, <http://www.rfc-editor.org/info/rfc6347>. <https://www.rfc-editor.org/info/rfc6347>.
[RFC7049] Bormann, C. and P. Hoffman, "Concise Binary Object
Representation (CBOR)", RFC 7049, DOI 10.17487/RFC7049,
October 2013, <http://www.rfc-editor.org/info/rfc7049>. <https://www.rfc-editor.org/info/rfc7049>.
[RFC7252] Shelby, Z., Hartke, K., and C. Bormann, "The Constrained
Application Protocol (CoAP)", RFC 7252,
DOI 10.17487/RFC7252, June 2014,
<http://www.rfc-editor.org/info/rfc7252>.
<https://www.rfc-editor.org/info/rfc7252>.
[RFC7641] Hartke, K., "Observing Resources in the Constrained
Application Protocol (CoAP)", RFC 7641,
DOI 10.17487/RFC7641, September 2015,
<http://www.rfc-editor.org/info/rfc7641>.
<https://www.rfc-editor.org/info/rfc7641>.
[RFC7959] Bormann, C. and Z. Shelby, Ed., "Block-Wise Transfers in
the Constrained Application Protocol (CoAP)", RFC 7959,
DOI 10.17487/RFC7959, August 2016,
<http://www.rfc-editor.org/info/rfc7959>.
14.2.
<https://www.rfc-editor.org/info/rfc7959>.
[RFC8075] Castellani, A., Loreto, S., Rahman, A., Fossati, T., and
E. Dijk, "Guidelines for Mapping Implementations: HTTP to
the Constrained Application Protocol (CoAP)", RFC 8075,
DOI 10.17487/RFC8075, February 2017,
<https://www.rfc-editor.org/info/rfc8075>.
[RFC8132] van der Stok, P., Bormann, C., and A. Sehgal, "PATCH and
FETCH Methods for the Constrained Application Protocol
(CoAP)", RFC 8132, DOI 10.17487/RFC8132, April 2017,
<https://www.rfc-editor.org/info/rfc8132>.
[RFC8152] Schaad, J., "CBOR Object Signing and Encryption (COSE)",
RFC 8152, DOI 10.17487/RFC8152, July 2017,
<https://www.rfc-editor.org/info/rfc8152>.
15.2. Informative References
[I-D.bormann-6lo-coap-802-15-ie]
Bormann, C., "Constrained Application Protocol (CoAP) over
IEEE 802.15.4 Information Element for IETF", draft-
bormann-6lo-coap-802-15-ie-00 (work in progress), April
2016.
[I-D.greevenbosch-appsawg-cbor-cddl]
Birkholz, H., Vigano, C., and C. Bormann, "CBOR "Concise data
definition language (CDDL): a notational convention to
express CBOR data structures", draft-greevenbosch-appsawg-
cbor-cddl-10
cbor-cddl-11 (work in progress), March July 2017.
[I-D.hartke-core-e2e-security-reqs]
Selander, G., Palombini, F., and K. Hartke, "Requirements
for CoAP End-To-End Security", draft-hartke-core-e2e-
security-reqs-02
security-reqs-03 (work in progress), January July 2017.
[I-D.ietf-ace-oauth-authz]
Seitz, L., Selander, G., Wahlstroem, E., Erdtman, S., and
H. Tschofenig, "Authentication and Authorization for
Constrained Environments (ACE)", draft-ietf-ace-oauth-
authz-06
authz-07 (work in progress), March August 2017.
[I-D.ietf-core-coap-tcp-tls]
Bormann, C., Lemay, S., Tschofenig, H., Hartke, K.,
Silverajan, B., and B. Raymor, "CoAP (Constrained
Application Protocol) over TCP, TLS, and WebSockets",
draft-ietf-core-coap-tcp-tls-09 (work in progress), May
2017.
[I-D.mattsson-core-coap-actuators]
Mattsson, J., Fornehed, J., Selander, G., and F.
Palombini, "Controlling Actuators with CoAP", draft-
mattsson-core-coap-actuators-02 (work in progress),
November 2016.
[I-D.seitz-ace-oscoap-profile]
Seitz, L., Gunnarsson, M., and F. Palombini, F., and M. Gunnarsson, "OSCOAP
profile of ACE", draft-seitz-ace-oscoap-profile-03 (work
in progress), June 2017.
[I-D.selander-ace-cose-ecdhe]
Selander, G., Mattsson, J., the Authentication and F. Palombini, "Ephemeral
Diffie-Hellman Over COSE (EDHOC)", draft-selander-ace-
cose-ecdhe-06 Authorization for
Constrained Environments Framework", draft-seitz-ace-
oscoap-profile-04 (work in progress), April July 2017.
[I-D.tiloca-core-multicast-oscoap]
Tiloca, M., Selander, G., and F. Palombini, "Secure group
communication for CoAP", draft-tiloca-core-multicast-
oscoap-01
oscoap-03 (work in progress), March July 2017.
[RFC3986] Berners-Lee, T., Fielding, R., and L. Masinter, "Uniform
Resource Identifier (URI): Generic Syntax", STD 66,
RFC 3986, DOI 10.17487/RFC3986, January 2005,
<https://www.rfc-editor.org/info/rfc3986>.
[RFC5869] Krawczyk, H. and P. Eronen, "HMAC-based Extract-and-Expand
Key Derivation Function (HKDF)", RFC 5869,
DOI 10.17487/RFC5869, May 2010,
<http://www.rfc-editor.org/info/rfc5869>.
<https://www.rfc-editor.org/info/rfc5869>.
[RFC7228] Bormann, C., Ersue, M., and A. Keranen, "Terminology for
Constrained-Node Networks", RFC 7228,
DOI 10.17487/RFC7228, May 2014,
<http://www.rfc-editor.org/info/rfc7228>.
<https://www.rfc-editor.org/info/rfc7228>.
[RFC7515] Jones, M., Bradley, J., and N. Sakimura, "JSON Web
Signature (JWS)", RFC 7515, DOI 10.17487/RFC7515, May
2015, <https://www.rfc-editor.org/info/rfc7515>.
Appendix A. Test Vectors
TODO: This section needs to be updated.
Appendix B. Examples
This section gives examples of OSCOAP. OSCORE. The message exchanges are
made, based on the assumption that there is a security context
established between client and server. For simplicity, these
examples only indicate the content of the messages without going into
detail of the COSE message format.
B.1. Secure Access to Sensor
This example targets the scenario in Section 3.1 of
[I-D.hartke-core-e2e-security-reqs] and illustrates a client
requesting the alarm status from a server.
Client Proxy Server
| | |
+----->|
+------>| | Code: 0.01 (GET) 0.02 (POST)
| GET POST | | Token: 0x8c
| | | Object-Security: [kid:5f, seq:42, [kid:5f]
| | | {Uri-Path:"alarm_status"}] Payload: [Partial IV:42,
| | | Payload: - {Code:0.01,
| | | Uri-Path:"alarm_status"}]
| | +----->| |
| +------>| Code: 0.01 (GET) 0.02 (POST)
| | GET POST | Token: 0x7b
| | | Object-Security: [kid:5f, seq:42, [kid:5f]
| | | Payload: [Partial IV:42,
| {Uri-Path:"alarm_status"}] | | {Code:0.01,
| | Payload: - | Uri-Path:"alarm_status"}]
| | | |<-----+
| |<------+ Code: 2.05 (Content) 2.04 (Changed)
| | 2.05 2.04 | Token: 0x7b
| | | Object-Security: -
| | | Payload: [{"OFF"}] [{Code:2.05, "OFF"}]
| | |
|<-----+
|<------+ | Code: 2.05 (Content) 2.04 (Changed)
| 2.05 2.04 | | Token: 0x8c
| | | Object-Security: -
| | | Payload: [{"OFF"}] [{Code:2.05, "OFF"}]
| | |
Figure 7: 9: Secure Access to Sensor. Square brackets [ ... ] indicate
a COSE object. Curly brackets { ... } indicate encrypted data.
Since the method (GET) doesn't allow payload, the Object-Security
option carries the COSE object as its value. Since the response code
(Content) allows payload, the COSE object is carried as the CoAP
payload.
The COSE header of the request contains an identifier (5f),
indicating which security context was used to protect the message and
a sequence number (42). The option Uri-Path ("alarm_status") and
payload ("OFF") are encrypted.
The server verifies that the sequence number has not been received
before. The client verifies that the response is bound to the
request.
B.2. Secure Subscribe to Sensor
This example targets the scenario in Section 3.2 of
[I-D.hartke-core-e2e-security-reqs] and illustrates a client
requesting subscription to a blood sugar measurement resource (GET
/glucose), first receiving the value 220 mg/dl and then a second
value 180 mg/dl.
Client Proxy Server
| | |
+----->| | Code: 0.01 (GET)
| GET | | Token: 0x83
| | | Observe: 0
| | | Object-Security: [kid:ca, seq:15,
| | | {Uri-Path:"glucose"}]
| | | Payload: -
| | |
| +----->| Code: 0.01 (GET)
| | GET | Token: 0xbe
| | | Observe: 0
| | | Object-Security: [kid:ca, seq:15,
| | | {Uri-Path:"glucose"}]
| | | Payload: -
| | |
| |<-----+ Code: 2.05 (Content)
| | 2.05 | Token: 0xbe
| | | Observe: 000032
| | | Object-Security: -
| | | Payload: [seq:32, {Content-Format:0, "220"}]
| | |
|<-----+ | Code: 2.05 (Content)
| 2.05 | | Token: 0x83
| | | Observe: 000032
| | | Object-Security: -
| | | Payload: [seq:32, {Content-Format:0, "220"}]
... ... ...
| | |
| |<-----+ Code: 2.05 (Content)
| | 2.05 | Token: 0xbe
| | | Observe: 000036
| | | Object-Security: -
| | | Payload: [seq:36, {Content-Format:0, "180"}]
| | |
|<-----+ | Code: 2.05 (Content)
| 2.05 | | Token: 0x83
| | | Observe: 000036
| | | Object-Security: -
| | | Payload: [seq:36, {Content-Format:0, "180"}]
| | |
Figure 8: Secure Subscribe to Sensor. Square brackets [ ... ]
indicate a COSE object. Curly brackets { ... } indicate encrypted
data.
Since the method (GET) doesn't allow payload, the Object-Security
option carries the COSE object as its value. Since the response code
(Content) allows payload, the COSE object is carried as the CoAP
payload.
The COSE header of the request contains an identifier (ca),
indicating the security context used to protect the message and a
Sequence Number (15). The COSE header of the responses contains
sequence numbers (32 and 36). The options Content-Format (0) and the
payload ("220" and "180"), are encrypted. The Observe option is
integrity protected. The shown Observe values (000032 and 000036)
are the ones that the client will see after OSCOAP processing.
The server verifies that the sequence number has not been received
before. The client verifies that the sequence number has not been
received before and that the responses are bound to the request.
Appendix C. Object Security of Content (OSCON)
TODO: This section needs to be updated.
OSCOAP protects message exchanges end-to-end between a certain client
and a certain server, targeting the security requirements for forward
proxy of [I-D.hartke-core-e2e-security-reqs]. In contrast, many use
cases require one and the same message to be protected for, and
verified by, multiple endpoints, see caching proxy section of
[I-D.hartke-core-e2e-security-reqs]. Those security requirements can
be addressed by protecting essentially the payload/content of
individual messages using the COSE format ([I-D.ietf-cose-msg]),
rather than the entire request/response message exchange. This is
referred to as Object Security of Content (OSCON).
OSCON transforms a CoAP message into an "OSCON message" in the
following way: the payload of the original CoAP message is wrapped by
a COSE object, which replaces the payload and this then becomes the
OSCON message.
The original payload shall be the plaintext/payload of the COSE
object. The 'protected' field of the COSE object 'Headers' shall
include the context identifier, both for requests and responses. If
the original CoAP message includes a Content-Format option, then the
COSE object shall include a protected 'content type' field, whose
value is set to the original message Content-Format value. The
Content-Format option of the OSCOON message shall be replaced with
"application/oscon" (Section 12)
The COSE object shall be protected (encrypted) and verified
(decrypted) as described in ([I-D.ietf-cose-msg]).
Most AEAD algorithms require a unique nonce for each message.
Sequence numbers for partial IV as specified for OSCOAP may be used
for replay protection as described in Section 6. The use of time
stamps in the COSE header parameter 'operation time'
[I-D.ietf-cose-msg] for freshness may be used.
OSCON shall not be used in cases where CoAP header fields (such as
Code or Version) or CoAP options need to be integrity protected or
encrypted. OSCON shall not be used in cases which require a secure
binding between request and response.
a COSE object. Curly brackets { ... } indicate encrypted data.
The scenarios request/response Codes are encrypted by OSCORE and only dummy
Codes (POST/Changed) are visible in Sections 3.3 - 3.5 of
[I-D.hartke-core-e2e-security-reqs] assume multiple recipients for a
particular content. In this case the use header of symmetric keys does not
provide data origin authentication. Therefore the COSE object should
in general be protected with a digital signature.
C.1. Overhead OSCON
In general there are four different kinds of modes that need to be
supported: message authentication code, digital signature,
authenticated encryption, and symmetric encryption + digital
signature. OSCORE message.
The use of digital signature is necessary for
applications with many legitimate recipients of a given message, option Uri-Path ("alarm_status") and
where data origin authentication is required.
To distinguish between these different cases, the tagged structures
of COSE payload ("OFF") are used (see Section 2 of [I-D.ietf-cose-msg]).
encrypted.
The sizes of COSE messages for selected algorithms are detailed in
this section.
The size of the header is shown separately from the size of the MAC/
signature. A 4-byte Context Identifier and a 1-byte Sequence Number
are request contains an identifier (5f),
indicating which security context was used throughout all examples, with these values:
o Cid: 0xa1534e3c
o Seq: 0xa3
For each scheme, we indicate to protect the fixed length of these two parameters
("Cid+Seq" column) message and of the Tag ("MAC"/"SIG"/"TAG").
a Partial IV (42).
The "Message
OH" column shows the total expansions of the CoAP message size, while server verifies that the "COSE OH" column is calculated from Partial IV has not been received before.
The client verifies that the previous columns.
Overhead incurring from CBOR encoding response is also included in bound to the COSE
overhead count.
To make it easier request.
B.2. Secure Subscribe to read, COSE objects are represented using CBOR's
diagnostic notation rather than a binary dump.
C.2. MAC Only Sensor
This example is based on HMAC-SHA256, with truncation to 8 bytes
(HMAC 256/64).
Since the key is implicitly known by the recipient, targets the
COSE_Mac0_Tagged structure is used (Section 6.2 of
[I-D.ietf-cose-msg]).
The object scenario in COSE encoding gives:
996( # COSE_Mac0_Tagged
[
h'a20444a1534e3c0641a3', # protected:
{04:h'a1534e3c',
06:h'a3'}
{}, # unprotected
h'', # payload
MAC # truncated 8-byte MAC
]
)
This COSE object encodes Section 3.2 of
[I-D.hartke-core-e2e-security-reqs] and illustrates a client
requesting subscription to a total size of 26 bytes.
Figure 9 summarizes these results.
+------------------+-----+-----+---------+------------+ blood sugar measurement resource (GET
/glucose), first receiving the value 220 mg/dl and then a second
value 180 mg/dl.
Client Proxy Server
| Structure | Tid | MAC
+------>| | COSE OH Code: 0.05 (FETCH)
| Message OH FETCH |
+------------------+-----+-----+---------+------------+ | COSE_Mac0_Tagged Token: 0x83
| 5 B | 8 B | 13 B Observe: 0
| 26 B |
+------------------+-----+-----+---------+------------+
Figure 9: Message overhead for a 5-byte Tid using HMAC 256/64
C.3. Signature Only
This example is based on ECDSA, with a signature of 64 bytes.
Since only one signature is used, the COSE_Sign1_Tagged structure is
used (Section 4.2 of [I-D.ietf-cose-msg]).
The object in COSE encoding gives:
997( # COSE_Sign1_Tagged
[
h'a20444a1534e3c0641a3', # protected:
{04:h'a1534e3c',
06:h'a3'}
{}, # unprotected
h'', # payload
SIG # 64-byte signature
]
)
This COSE object encodes to a total size of 83 bytes.
Figure 10 summarizes these results.
+-------------------+-----+------+---------+------------+ | Structure Object-Security: [kid:ca]
| Tid | SIG | COSE OH Payload: [Partial IV:15,
| Message OH |
+-------------------+-----+------+---------+------------+ | COSE_Sign1_Tagged {Code:0.01,
| 5 B | 64 B | 14 B Uri-Path:"glucose"}]
| | |
| +------>| Code: 0.05 (FETCH)
| | FETCH | Token: 0xbe
| | | Observe: 0
| | | Object-Security: [kid:ca]
| | | Payload: [Partial IV:15,
| | | {Code:0.01,
| | | Uri-Path:"glucose"}]
| | |
| |<------+ Code: 2.05 (Content)
| | 2.05 | Token: 0xbe
| | | Observe: 7
| | | Object-Security: -
| | | Payload: [Partial IV:32,
| | | {Code:2.05,
| | | Content-Format:0, "220"}]
| | |
|<------+ | Code: 2.05 (Content)
| 2.05 | | Token: 0x83
| | | Observe: 7
| | | Object-Security: -
| | | Payload: [Partial IV:32,
| 83 bytes |
+-------------------+-----+------+---------+------------+
Figure 10: Message overhead for a 5-byte Tid using 64 byte ECDSA
signature.
C.4. Authenticated Encryption with Additional Data (AEAD)
This example is based on AES-CCM with the Tag truncated to 8 bytes.
Since the key is implicitly known by the recipient, the
COSE_Encrypt0_Tagged structure is used (Section 5.2 of
[I-D.ietf-cose-msg]).
The object in COSE encoding gives:
993( # COSE_Encrypt0_Tagged
[
h'a20444a1534e3c0641a3', # protected:
{04:h'a1534e3c',
06:h'a3'}
{}, # unprotected
ciphertext # ciphertext including truncated 8-byte TAG
]
)
This COSE object encodes to a total size of 25 bytes.
Figure 11 summarizes these results.
+----------------------+-----+-----+---------+------------+ | Structure {Code:2.05,
| Tid | TAG | COSE OH Content-Format:0, "220"}]
... ... ...
| Message OH |
+----------------------+-----+-----+---------+------------+ | COSE_Encrypt0_Tagged
| 5 B |<------+ Code: 2.05 (Content)
| | 2.05 | Token: 0xbe
| | | Observe: 8 B
| 12 B | 25 bytes |
+----------------------+-----+-----+---------+------------+
Figure 11: Message overhead for a 5-byte Tid using AES_128_CCM_8.
C.5. Symmetric Encryption with Asymmetric Signature (SEAS)
This example is based on AES-CCM and ECDSA with 64 bytes signature.
The same assumption on the security context as in Appendix C.4. COSE
defines the field 'counter signature w/o headers' that is used here
to sign a COSE_Encrypt0_Tagged message (see Section 3 of
[I-D.ietf-cose-msg]).
The object in COSE encoding gives:
993( # COSE_Encrypt0_Tagged
[
h'a20444a1534e3c0641a3', # protected:
{04:h'a1534e3c',
06:h'a3'}
{9:SIG}, # unprotected:
09: 64 bytes signature
ciphertext # ciphertext including truncated 8-byte TAG
]
)
This COSE object encodes to a total size of 92 bytes.
Figure 12 summarizes these results.
+----------------------+-----+-----+------+---------+------------+ Object-Security: -
| Structure | Tid | TAG Payload: [Partial IV:36,
| SIG | COSE OH | Message OH {Code:2.05,
|
+----------------------+-----+-----+------+---------+------------+ | COSE_Encrypt0_Tagged | 5 B Content-Format:0, "180"}]
| | |
|<------+ | Code: 2.05 (Content)
| 2.05 | | Token: 0x83
| | | Observe: 8 B
| 64 B | 15 B | 92 B Object-Security: -
| | | Payload: [Partial IV:36,
| | | {Code:2.05,
| | | Content-Format:0, "180"}]
| | |
+----------------------+-----+-----+------+---------+------------+
Figure 12: Message overhead for 10: Secure Subscribe to Sensor. Square brackets [ ... ]
indicate a 5-byte Tid using AES-CCM
countersigned with ECDSA. COSE object. Curly brackets { ... } indicate encrypted
data.
The request/response Codes are encrypted by OSCORE and only dummy
Codes (FETCH/Content) are visible in the header of the OSCORE
message. The options Content-Format (0) and the payload ("220" and
"180"), are encrypted.
The COSE header of the request contains an identifier (ca),
indicating the security context used to protect the message and a
Partial IV (15). The COSE headers of the responses contains Partial
IVs (32 and 36).
The server verifies that the Partial IV has not been received before.
The client verifies that the responses are bound to the request and
that the Partial IVs are greater than any Partial IV previously
received in a response bound to the request.
Authors' Addresses
Goeran Selander
Ericsson AB
Email: [email protected]
John Mattsson
Ericsson AB
Email: [email protected]
Francesca Palombini
Ericsson AB
Email: [email protected]
Ludwig Seitz
SICS Swedish ICT
Email: [email protected]
|
{
"url": "https://tools.ietf.org/wg/core/draft-ietf-core-object-security/draft-ietf-core-object-security-05-from-04.wdiff.html",
"source_domain": "tools.ietf.org",
"snapshot_id": "crawl=CC-MAIN-2020-16",
"warc_metadata": {
"Content-Length": "221013",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PLYZPDE3A55JAOLRQCRF5CC6HJBOVSA2",
"WARC-Concurrent-To": "<urn:uuid:e91ec436-1781-43b9-b5f4-7a696bd33723>",
"WARC-Date": "2020-04-07T04:50:54Z",
"WARC-IP-Address": "64.170.98.42",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LFDK3DUF6IFTC7YT6RQVFGOJ76IBUHLJ",
"WARC-Record-ID": "<urn:uuid:c8aaedfb-e8cc-4865-a216-b2df97443427>",
"WARC-Target-URI": "https://tools.ietf.org/wg/core/draft-ietf-core-object-security/draft-ietf-core-object-security-05-from-04.wdiff.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1f0f4a44-7a0a-4c4f-9c12-f68033a2b916>"
},
"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-235.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
1,
74,
147,
220,
301,
374,
447,
515,
588,
589,
627,
727,
781,
782,
791,
792,
875,
914,
967,
1037,
1107,
1157,
1234,
1308,
1390,
1483,
1551,
1621,
1622,
1642,
1643,
1708,
1744,
1745,
1814,
1880,
1952,
2059,
2060,
2133,
2205,
2271,
2333,
2334,
2395,
2396,
2413,
2414,
2481,
2524,
2525,
2590,
2631,
2673,
2741,
2805,
2878,
2950,
3020,
3087,
3131,
3132,
3150,
3151,
3224,
3301,
3378,
3451,
3524,
3617,
3690,
3768,
3841,
3923,
4008,
4085,
4173,
4246,
4323,
4400,
4492,
4529,
4606,
4692,
4745,
4802,
4860,
4933,
5010,
5087,
5164,
5241,
5318,
5403,
5487,
5570,
5621,
5666,
5731,
5774,
5827,
5881,
5928,
5985,
6048,
6103,
6168,
6217,
6288,
6339,
6396,
6439,
6504,
6534,
6607,
6644,
6717,
6768,
6829,
6868,
6935,
6964,
7037,
7076,
7147,
7191,
7258,
7319,
7364,
7422,
7465,
7519,
7576,
7622,
7691,
7763,
7836,
7913,
7914,
7931,
7932,
8000,
8068,
8141,
8174,
8240,
8283,
8338,
8413,
8485,
8557,
8653,
8731,
8786,
8787,
8864,
8897,
8983,
9001,
9079,
9148,
9218,
9291,
9364,
9433,
9502,
9563,
9605,
9676,
9743,
9802,
9892,
9952,
9999,
10073,
10142,
10143,
10174,
10175,
10248,
10344,
10473,
10510,
10530,
10632,
10703,
10782,
10860,
10935,
10986,
10987,
10997,
10998,
11060,
11095,
11165,
11238,
11312,
11406,
11476,
11527,
11598,
11671,
11743,
11817,
11897,
11987,
12085,
12171,
12258,
12325,
12434,
12514,
12559,
12560,
12625,
12688,
12769,
12857,
12953,
13016,
13096,
13158,
13238,
13326,
13433,
13495,
13558,
13620,
13682,
13683,
13729,
13730,
13757,
13758,
13830,
13925,
13948,
14050,
14132,
14212,
14268,
14309,
14380,
14429,
14430,
14496,
14507,
14508,
14581,
14634,
14714,
14830,
14900,
14969,
15036,
15091,
15092,
15110,
15111,
15182,
15254,
15322,
15391,
15414,
15415,
15482,
15554,
15615,
15685,
15699,
15700,
15773,
15807,
15886,
15887,
15923,
15924,
15999,
16022,
16103,
16170,
16237,
16264,
16265,
16337,
16352,
16353,
16426,
16489,
16567,
16640,
16713,
16781,
16853,
16926,
16994,
16995,
17051,
17052,
17099,
17100,
17168,
17237,
17309,
17382,
17454,
17455,
17525,
17595,
17664,
17679,
17680,
17751,
17818,
17889,
17927,
17928,
18026,
18091,
18121,
18202,
18254,
18320,
18398,
18462,
18507,
18508,
18582,
18622,
18623,
18700,
18751,
18833,
18873,
18874,
19030,
19103,
19160,
19230,
19277,
19356,
19357,
19385,
19465,
19532,
19602,
19670,
19740,
19807,
19824,
19825,
19895,
19967,
20037,
20106,
20157,
20158,
20183,
20184,
20253,
20323,
20394,
20448,
20449,
20581,
20652,
20724,
20794,
20824,
20825,
20859,
20860,
20932,
21013,
21082,
21122,
21123,
21194,
21265,
21335,
21406,
21414,
21415,
21485,
21553,
21626,
21697,
21768,
21841,
21914,
21957,
21958,
22016,
22017,
22076,
22135,
22207,
22266,
22324,
22383,
22437,
22488,
22546,
22604,
22660,
22733,
22795,
22866,
22936,
23016,
23095,
23146,
23197,
23248,
23299,
23300,
23364,
23365,
23422,
23423,
23521,
23592,
23611,
23612,
23682,
23737,
23738,
23806,
23879,
23940,
23941,
24011,
24077,
24135,
24136,
24193,
24194,
24308,
24356,
24401,
24459,
24460,
24465,
24466,
24554,
24591,
24592,
24686,
24769,
24841,
24863,
24864,
24941,
25009,
25073,
25131,
25132,
25203,
25303,
25338,
25407,
25456,
25457,
25517,
25518,
25583,
25689,
25719,
25720,
25791,
25837,
25923,
25995,
26017,
26018,
26097,
26169,
26233,
26291,
26292,
26385,
26401,
26417,
26418,
26491,
26561,
26598,
26599,
26699,
26760,
26793,
26864,
26929,
26962,
26963,
27030,
27103,
27175,
27247,
27318,
27392,
27449,
27450,
27513,
27514,
27585,
27655,
27671,
27672,
27692,
27693,
27709,
27710,
27729,
27730,
27801,
27866,
27894,
27895,
27928,
27929,
28033,
28034,
28052,
28053,
28090,
28091,
28127,
28128,
28161,
28162,
28196,
28197,
28270,
28291,
28292,
28358,
28422,
28494,
28531,
28603,
28727,
28825,
28890,
28957,
28988,
28989,
29067,
29068,
29135,
29201,
29291,
29359,
29432,
29448,
29449,
29499,
29500,
29510,
29511,
29558,
29559,
29607,
29608,
29650,
29651,
29666,
29699,
29720,
29743,
29766,
29774,
29775,
29783,
29784,
29794,
29795,
29837,
29838,
29873,
29940,
29980,
29981,
30009,
30010,
30076,
30097,
30098,
30188,
30212,
30288,
30302,
30303,
30354,
30355,
30427,
30500,
30578,
30643,
30676,
30677,
30731,
30732,
30798,
30865,
30960,
31016,
31059,
31126,
31199,
31232,
31316,
31389,
31410,
31497,
31567,
31637,
31690,
31691,
31763,
31832,
31904,
31942,
31943,
32011,
32092,
32161,
32162,
32196,
32197,
32207,
32208,
32280,
32401,
32465,
32532,
32604,
32677,
32742,
32808,
32821,
32822,
32840,
32923,
32968,
33038,
33039,
33089,
33090,
33134,
33135,
33209,
33278,
33321,
33381,
33382,
33478,
33495,
33622,
33741,
33814,
33876,
33888,
33983,
33984,
34024,
34107,
34191,
34274,
34293,
34294,
34358,
34436,
34494,
34495,
34545,
34546,
34620,
34621,
34671,
34672,
34766,
34785,
34867,
34920,
34988,
35070,
35122,
35183,
35253,
35331,
35344,
35353,
35354,
35439,
35512,
35577,
35578,
35597,
35598,
35668,
35711,
35712,
35780,
35832,
35869,
35870,
35947,
35981,
35982,
36051,
36118,
36170,
36171,
36189,
36190,
36260,
36321,
36371,
36378,
36379,
36476,
36549,
36635,
36690,
36768,
36806,
36807,
36843,
36844,
36910,
36978,
37053,
37054,
37130,
37202,
37289,
37355,
37366,
37367,
37438,
37479,
37566,
37584,
37689,
37782,
37864,
37940,
38022,
38089,
38090,
38118,
38119,
38138,
38139,
38147,
38148,
38229,
38299,
38369,
38440,
38512,
38582,
38592,
38593,
38731,
38767,
38806,
38882,
38935,
39008,
39009,
39061,
39113,
39165,
39217,
39269,
39321,
39373,
39427,
39479,
39531,
39583,
39635,
39687,
39739,
39791,
39843,
39895,
39947,
39999,
40051,
40103,
40155,
40207,
40208,
40226,
40227,
40305,
40346,
40398,
40439,
40468,
40469,
40525,
40526,
40557,
40558,
40673,
40701,
40771,
40865,
40874,
40958,
41026,
41076,
41077,
41105,
41106,
41128,
41129,
41144,
41145,
41229,
41275,
41346,
41416,
41494,
41570,
41620,
41621,
41702,
41781,
41782,
41796,
41900,
41928,
41929,
41995,
42052,
42053,
42075,
42076,
42149,
42186,
42187,
42264,
42360,
42428,
42444,
42517,
42585,
42586,
42638,
42705,
42723,
42724,
42799,
42823,
42868,
42869,
42980,
42987,
43026,
43027,
43100,
43101,
43125,
43126,
43206,
43306,
43393,
43394,
43411,
43469,
43470,
43488,
43489,
43501,
43502,
43614,
43692,
43763,
43775,
43776,
43844,
43927,
43948,
43949,
44083,
44155,
44231,
44316,
44339,
44400,
44422,
44423,
44483,
44484,
44526,
44588,
44605,
44606,
44634,
44635,
44705,
44720,
44780,
44807,
44888,
44957,
45039,
45112,
45130,
45202,
45277,
45356,
45408,
45409,
45454,
45455,
45487,
45488,
45556,
45626,
45697,
45793,
45871,
45938,
46028,
46101,
46129,
46130,
46199,
46267,
46338,
46377,
46378,
46475,
46490,
46559,
46630,
46696,
46767,
46814,
46815,
46913,
46928,
46990,
47032,
47033,
47044,
47045,
47077,
47078,
47133,
47134,
47176,
47244,
47313,
47350,
47423,
47501,
47515,
47516,
47586,
47687,
47760,
47827,
47908,
47974,
48047,
48054,
48115,
48188,
48244,
48312,
48408,
48409,
48492,
48561,
48637,
48708,
48800,
48873,
48902,
48903,
48927,
48928,
49000,
49154,
49208,
49222,
49223,
49296,
49355,
49427,
49471,
49513,
49514,
49534,
49535,
49607,
49679,
49750,
49751,
49857,
49895,
49916,
49917,
49935,
49936,
50008,
50080,
50094,
50095,
50168,
50215,
50216,
50282,
50348,
50419,
50466,
50467,
50536,
50605,
50674,
50736,
50803,
50871,
50942,
51011,
51080,
51091,
51092,
51164,
51203,
51204,
51256,
51310,
51311,
51339,
51340,
51371,
51372,
51396,
51397,
51425,
51426,
51450,
51451,
51510,
51579,
51645,
51717,
51718,
51757,
51758,
51821,
51822,
51840,
51841,
51909,
51980,
52052,
52108,
52130,
52131,
52216,
52247,
52302,
52347,
52408,
52409,
52464,
52510,
52603,
52604,
52676,
52744,
52745,
52761,
52860,
52945,
52966,
53030,
53122,
53162,
53239,
53306,
53371,
53436,
53468,
53469,
53536,
53604,
53661,
53662,
53727,
53781,
53852,
53925,
54003,
54073,
54152,
54173,
54271,
54286,
54287,
54305,
54306,
54375,
54442,
54471,
54472,
54496,
54497,
54589,
54658,
54734,
54764,
54765,
54834,
54900,
54961,
55028,
55061,
55062,
55167,
55236,
55323,
55394,
55467,
55532,
55596,
55655,
55656,
55715,
55798,
55815,
55816,
55898,
55962,
56011,
56077,
56122,
56123,
56143,
56144,
56216,
56288,
56348,
56399,
56400,
56495,
56608,
56659,
56737,
56751,
56752,
56824,
56902,
56980,
57025,
57052,
57053,
57082,
57083,
57153,
57246,
57311,
57382,
57435,
57436,
57508,
57547,
57548,
57600,
57601,
57655,
57656,
57684,
57685,
57716,
57717,
57741,
57742,
57770,
57771,
57795,
57796,
57855,
57924,
57990,
58062,
58063,
58102,
58103,
58147,
58148,
58212,
58283,
58356,
58399,
58400,
58420,
58421,
58493,
58565,
58615,
58682,
58759,
58834,
58835,
58920,
58943,
59028,
59097,
59118,
59202,
59233,
59234,
59293,
59326,
59327,
59393,
59488,
59535,
59625,
59697,
59769,
59838,
59909,
59977,
59991,
59992,
60059,
60130,
60172,
60204,
60205,
60276,
60290,
60291,
60329,
60330,
60370,
60371,
60440,
60539,
60568,
60654,
60724,
60803,
60890,
60935,
60936,
61006,
61078,
61147,
61217,
61255,
61256,
61329,
61394,
61468,
61549,
61550,
61607,
61642,
61643,
61655,
61656,
61727,
61798,
61867,
61938,
62008,
62022,
62023,
62095,
62162,
62234,
62248,
62249,
62306,
62367,
62428,
62489,
62550,
62612,
62673,
62734,
62795,
62856,
62913,
62914,
62967,
62968,
62984,
62985,
63053,
63084,
63085,
63169,
63190,
63191,
63277,
63355,
63426,
63490,
63491,
63564,
63618,
63619,
63687,
63757,
63828,
63883,
63954,
64001,
64072,
64093,
64113,
64114,
64165,
64166,
64171,
64172,
64208,
64209,
64269,
64270,
64290,
64308,
64319,
64341,
64363,
64380,
64406,
64424,
64450,
64471,
64476,
64477,
64487,
64488,
64577,
64594,
64595,
64666,
64707,
64708,
64781,
64873,
64924,
64987,
65038,
65074,
65075,
65145,
65187,
65188,
65261,
65296,
65297,
65381,
65426,
65427,
65490,
65559,
65627,
65687,
65688,
65749,
65750,
65770,
65771,
65793,
65794,
65894,
65959,
66024,
66097,
66103,
66121,
66122,
66193,
66262,
66291,
66292,
66320,
66321,
66394,
66460,
66532,
66604,
66673,
66674,
66756,
66835,
66859,
66928,
66997,
67066,
67110,
67111,
67135,
67136,
67207,
67240,
67241,
67257,
67258,
67327,
67400,
67472,
67559,
67621,
67622,
67694,
67764,
67836,
67905,
67950,
67951,
68017,
68095,
68143,
68167,
68168,
68192,
68193,
68264,
68350,
68382,
68505,
68578,
68670,
68737,
68799,
68872,
68942,
68980,
69047,
69115,
69210,
69265,
69299,
69348,
69349,
69395,
69396,
69419,
69420,
69489,
69568,
69569,
69592,
69707,
69726,
69828,
69899,
69969,
70063,
70134,
70187,
70188,
70258,
70333,
70404,
70463,
70464,
70503,
70504,
70574,
70643,
70712,
70781,
70852,
70876,
70877,
70949,
71020,
71063,
71151,
71226,
71242,
71243,
71249,
71250,
71354,
71426,
71486,
71487,
71521,
71560,
71561,
71585,
71586,
71669,
71718,
71719,
71804,
71900,
71926,
71997,
72067,
72145,
72239,
72309,
72310,
72348,
72418,
72490,
72557,
72629,
72700,
72722,
72765,
72766,
72788,
72789,
72872,
72941,
72942,
73012,
73083,
73151,
73213,
73317,
73365,
73451,
73535,
73610,
73674,
73739,
73766,
73843,
73873,
73960,
73974,
73975,
73987,
73988,
74044,
74045,
74154,
74258,
74259,
74328,
74441,
74513,
74545,
74614,
74671,
74672,
74687,
74688,
74718,
74784,
74852,
74867,
74868,
74968,
74969,
74998,
74999,
75084,
75198,
75271,
75343,
75361,
75362,
75433,
75504,
75574,
75647,
75666,
75667,
75683,
75684,
75754,
75824,
75895,
75943,
75944,
76015,
76088,
76146,
76147,
76180,
76181,
76240,
76305,
76370,
76441,
76510,
76577,
76623,
76624,
76639,
76640,
76669,
76670,
76743,
76772,
76773,
76789,
76818,
76819,
76891,
76892,
76958,
76976,
76977,
77077,
77104,
77190,
77262,
77284,
77285,
77356,
77397,
77398,
77475,
77534,
77535,
77608,
77675,
77692,
77693,
77738,
77739,
77767,
77768,
77838,
77876,
77877,
77947,
78027,
78028,
78124,
78179,
78256,
78328,
78397,
78398,
78462,
78534,
78601,
78674,
78738,
78809,
78877,
78899,
78900,
78973,
79038,
79108,
79144,
79145,
79210,
79281,
79348,
79415,
79456,
79457,
79528,
79595,
79661,
79726,
79738,
79739,
79745,
79746,
79850,
79882,
79883,
79889,
79890,
79957,
79976,
79977,
79992,
79993,
80069,
80121,
80182,
80183,
80189,
80190,
80247,
80248,
80316,
80389,
80452,
80518,
80537,
80538,
80612,
80647,
80648,
80654,
80655,
80726,
80797,
80870,
80910,
80911,
80985,
81046,
81103,
81104,
81110,
81111,
81182,
81183,
81213,
81214,
81285,
81375,
81444,
81517,
81587,
81648,
81649,
81716,
81743,
81744,
81810,
81828,
81829,
81868,
81869,
81940,
82009,
82111,
82112,
82187,
82245,
82297,
82352,
82424,
82479,
82480,
82551,
82592,
82593,
82670,
82722,
82723,
82795,
82796,
82825,
82826,
82897,
82935,
82936,
83006,
83074,
83108,
83109,
83178,
83250,
83297,
83298,
83364,
83438,
83468,
83581,
83651,
83719,
83763,
83764,
83776,
83788,
83789,
83880,
83947,
83979,
83980,
84025,
84087,
84088,
84155,
84174,
84175,
84190,
84191,
84222,
84223,
84305,
84370,
84441,
84514,
84515,
84596,
84701,
84753,
84805,
84806,
84825,
84826,
84883,
84884,
84952,
85021,
85083,
85084,
85150,
85185,
85258,
85259,
85270,
85271,
85342,
85413,
85486,
85526,
85527,
85604,
85660,
85690,
85741,
85742,
85815,
85867,
85868,
85874,
85875,
85947,
85948,
86016,
86087,
86159,
86232,
86270,
86271,
86302,
86303,
86373,
86446,
86538,
86611,
86680,
86747,
86827,
86901,
86973,
86986,
86987,
87038,
87039,
87123,
87165,
87166,
87234,
87304,
87375,
87418,
87489,
87490,
87544,
87545,
87630,
87676,
87677,
87756,
87847,
87919,
87920,
87992,
88068,
88069,
88168,
88238,
88270,
88271,
88315,
88363,
88404,
88405,
88488,
88561,
88595,
88596,
88667,
88708,
88709,
88818,
88857,
88858,
88909,
88910,
88977,
89032,
89033,
89063,
89111,
89175,
89206,
89207,
89263,
89295,
89296,
89354,
89433,
89491,
89564,
89632,
89695,
89766,
89822,
89880,
89881,
89977,
89978,
89993,
89994,
90071,
90094,
90095,
90120,
90121,
90144,
90145,
90150,
90158,
90183,
90218,
90223,
90224,
90277,
90315,
90316,
90338,
90339,
90384,
90385,
90451,
90452,
90523,
90560,
90561,
90626,
90692,
90693,
90746,
90766,
90767,
90811,
90812,
90835,
90836,
90841,
90849,
90856,
90891,
90900,
90901,
90974,
91001,
91002,
91051,
91052,
91071,
91072,
91143,
91215,
91288,
91356,
91428,
91496,
91497,
91510,
91511,
91583,
91648,
91719,
91742,
91743,
91791,
91859,
91930,
91995,
92062,
92063,
92090,
92091,
92158,
92181,
92182,
92207,
92208,
92231,
92232,
92237,
92245,
92270,
92305,
92310,
92311,
92367,
92409,
92431,
92432,
92441,
92442,
92485,
92486,
92499,
92500,
92533,
92534,
92602,
92603,
92610,
92611,
92662,
92663,
92686,
92687,
92692,
92700,
92733,
92768,
92773,
92774,
92833,
92875,
92876,
92898,
92899,
92908,
92909,
92952,
92953,
92969,
92970,
93000,
93001,
93055,
93073,
93074,
93090,
93091,
93162,
93230,
93302,
93329,
93330,
93374,
93375,
93398,
93399,
93404,
93412,
93419,
93454,
93459,
93460,
93513,
93533,
93534,
93556,
93557,
93589,
93590,
93617,
93618,
93683,
93684,
93725,
93726,
93749,
93750,
93755,
93763,
93779,
93814,
93819,
93820,
93870,
93902,
93903,
93925,
93926,
93958,
93959,
93989,
93990,
94058,
94059,
94075,
94076,
94147,
94210,
94282,
94351,
94421,
94432,
94443,
94444,
94516,
94589,
94661,
94684,
94685,
94714,
94715,
94749,
94750,
94823,
94894,
94966,
95037,
95062,
95063,
95100,
95101,
95211,
95244,
95315,
95357,
95420,
95463,
95464,
95542,
95598,
95691,
95762,
95837,
95867,
95955,
95975,
96067,
96121,
96151,
96152,
96245,
96282,
96296,
96297,
96385,
96441,
96442,
96516,
96585,
96603,
96674,
96675,
96713,
96714,
96766,
96833,
96834,
96862,
96931,
96995,
97104,
97116,
97117,
97185,
97204,
97277,
97384,
97457,
97493,
97578,
97622,
97681,
97778,
97891,
97970,
98038,
98103,
98171,
98244,
98274,
98329,
98403,
98423,
98424,
98436,
98437,
98489,
98490,
98541,
98564,
98565,
98618,
98619,
98692,
98693,
98733,
98734,
98802,
98828,
98876,
98877,
98947,
99021,
99022,
99049,
99075,
99126,
99127,
99161,
99185,
99186,
99202,
99230,
99285,
99286,
99327,
99328,
99347,
99375,
99427,
99428,
99499,
99500,
99519,
99554,
99555,
99647,
99715,
99788,
99848,
99869,
99917,
99918,
99984,
100079,
100122,
100192,
100253,
100277,
100278,
100347,
100417,
100497,
100582,
100597,
100645,
100646,
100684,
100685,
100764,
100830,
100900,
100967,
101050,
101089,
101174,
101200,
101299,
101375,
101402,
101420,
101421,
101433,
101434,
101489,
101490,
101517,
101557,
101558,
101631,
101632,
101670,
101671,
101699,
101733,
101761,
101814,
101815,
101871,
101946,
101947,
101985,
102013,
102063,
102064,
102107,
102108,
102129,
102159,
102213,
102214,
102257,
102258,
102276,
102306,
102363,
102364,
102419,
102420,
102438,
102478,
102479,
102496,
102567,
102664,
102691,
102789,
102832,
102903,
102996,
103052,
103053,
103130,
103177,
103178,
103207,
103208,
103281,
103351,
103427,
103498,
103531,
103598,
103683,
103749,
103838,
103908,
103977,
104073,
104168,
104212,
104284,
104317,
104318,
104380,
104437,
104529,
104559,
104560,
104621,
104713,
104820,
104883,
104915,
105001,
105073,
105144,
105187,
105259,
105360,
105423,
105499,
105514,
105515,
105529,
105602,
105673,
105749,
105807,
105877,
105981,
106062,
106130,
106227,
106228,
106307,
106379,
106415,
106488,
106562,
106611,
106705,
106783,
106808,
106875,
106972,
106973,
107001,
107002,
107057,
107106,
107201,
107273,
107329,
107355,
107431,
107494,
107552,
107553,
107616,
107688,
107754,
107822,
107893,
107925,
107926,
107995,
108067,
108139,
108206,
108278,
108351,
108424,
108494,
108565,
108595,
108596,
108624,
108625,
108697,
108765,
108836,
108843,
108921,
108990,
109010,
109011,
109078,
109145,
109171,
109172,
109244,
109312,
109345,
109346,
109425,
109495,
109578,
109602,
109603,
109628,
109629,
109683,
109684,
109709,
109811,
109812,
109848,
109849,
109888,
109958,
110050,
110123,
110186,
110249,
110322,
110394,
110466,
110533,
110605,
110674,
110743,
110816,
110889,
110959,
111026,
111027,
111052,
111053,
111118,
111176,
111177,
111213,
111214,
111280,
111293,
111294,
111356,
111418,
111480,
111542,
111604,
111605,
111623,
111624,
111658,
111659,
111775,
111788,
111789,
111819,
111820,
111847,
111848,
111880,
111881,
111913,
111914,
111953,
111954,
112019,
112020,
112064,
112065,
112097,
112098,
112168,
112238,
112308,
112392,
112393,
112456,
112457,
112504,
112505,
112536,
112537,
112567,
112568,
112600,
112601,
112643,
112644,
112710,
112766,
112767,
112797,
112798,
112832,
112833,
112893,
112894,
112934,
112935,
113006,
113026,
113027,
113094,
113161,
113228,
113295,
113362,
113363,
113384,
113385,
113434,
113504,
113505,
113526,
113527,
113599,
113670,
113740,
113787,
113788,
113859,
113921,
113922,
113926,
113927,
113943,
113944,
113950,
113951,
113979,
113980,
114021,
114091,
114160,
114205,
114206,
114229,
114300,
114372,
114373,
114439,
114492,
114540,
114596,
114653,
114654,
114720,
114792,
114849,
114850,
114905,
114955,
115011,
115068,
115069,
115139,
115208,
115321,
115322,
115387,
115457,
115570,
115571,
115642,
115696,
115743,
115799,
115856,
115857,
115923,
115977,
116029,
116085,
116142,
116143,
116214,
116284,
116333,
116389,
116390,
116396,
116453,
116454,
116525,
116597,
116667,
116718,
116775,
116776,
116847,
116916,
116983,
117040,
117041,
117112,
117169,
117226,
117227,
117257,
117258,
117294,
117367,
117433,
117503,
117523,
117524,
117564,
117640,
117709,
117782,
117809,
117873,
117874,
117913,
117985,
118053,
118084,
118154,
118155,
118185,
118257,
118324,
118393,
118416,
118478,
118479,
118511,
118577,
118641,
118709,
118779,
118799,
118800,
118838,
118901,
118968,
119034,
119063,
119064,
119098,
119188,
119259,
119298,
119299,
119332,
119422,
119491,
119537,
119605,
119674,
119675,
119713,
119785,
119853,
119877,
119938,
119939,
120010,
120076,
120136,
120193,
120194,
120267,
120324,
120370,
120426,
120483,
120484,
120555,
120607,
120653,
120709,
120766,
120767,
120832,
120900,
120963,
120964,
120990,
120991,
121034,
121035,
121057,
121058,
121135,
121201,
121266,
121339,
121377,
121378,
121408,
121409,
121464,
121528,
121574,
121575,
121603,
121629,
121647,
121713,
121765,
121834,
121938,
122012,
122082,
122122,
122188,
122240,
122309,
122368,
122468,
122557,
122597,
122670,
122723,
122768,
122842,
122868,
122886,
122959,
123012,
123057,
123131,
123157,
123158,
123233,
123303,
123304,
123373,
123446,
123514,
123526,
123527,
123590,
123663,
123732,
123766,
123767,
123837,
123903,
123915,
123916,
123949,
123950,
124005,
124069,
124139,
124207,
124227,
124228,
124251,
124271,
124319,
124361,
124400,
124454,
124514,
124553,
124573,
124621,
124663,
124702,
124756,
124816,
124855,
124875,
124927,
124969,
125013,
125052,
125125,
125145,
125197,
125239,
125283,
125322,
125395,
125416,
125436,
125488,
125530,
125574,
125613,
125686,
125706,
125758,
125800,
125844,
125883,
125956,
125976,
125977,
126046,
126117,
126158,
126159,
126228,
126301,
126369,
126381,
126382,
126445,
126514,
126582,
126655,
126723,
126793,
126859,
126860,
126930,
127000,
127068,
127069,
127117,
127118,
127161,
127162,
127235,
127308,
127380,
127447,
127512,
127585,
127650,
127718,
127788,
127842,
127843,
127909,
127982,
128053,
128071,
128072,
128139,
128208,
128280,
128352,
128421,
128488,
128558,
128594,
128595,
128658,
128712,
128713,
128778,
128849,
128918,
128974,
129024,
129025,
129095,
129165,
129236,
129277,
129347,
129348,
129427,
129488,
129560,
129639,
129712,
129765,
129766,
129787,
129788,
129858,
129920,
129984,
130014,
130063,
130168,
130217,
130218,
130289,
130365,
130379,
130380,
130450,
130467,
130468,
130540,
130612,
130656,
130746,
130747,
130769,
130770,
130786,
130787,
130871,
130937,
130959,
130960,
130976,
131151,
131201,
131202,
131290,
131309,
131310,
131340,
131341,
131415,
131465,
131466,
131488,
131489,
131557,
131575,
131576,
131643,
131697,
131722,
131723,
131770,
131771,
131831,
131847,
131901,
131961,
132015,
132070,
132121,
132185,
132201,
132215,
132216,
132259,
132323,
132379,
132380,
132418,
132419,
132523,
132591,
132611,
132612,
132640,
132688,
132752,
132781,
132894,
132954,
132980,
133046,
133047,
133116,
133117,
133138,
133139,
133204,
133205,
133277,
133323,
133324,
133362,
133363,
133425,
133442,
133497,
133558,
133613,
133669,
133721,
133783,
133800,
133815,
133816,
133873,
133874,
133913,
133914,
134029,
134105,
134134,
134256,
134337,
134363,
134419,
134467,
134512,
134564,
134623,
134678,
134743,
134769,
134827,
134875,
134920,
134965,
135024,
135079,
135149,
135175,
135233,
135281,
135326,
135371,
135430,
135458,
135525,
135526,
135596,
135639,
135640,
135699,
135700,
135771,
135772,
135831,
135889,
135914,
135915,
135953,
135954,
136006,
136010,
136052,
136100,
136142,
136185,
136258,
136262,
136264,
136265,
136322,
136323,
136362,
136363,
136484,
136570,
136597,
136626,
136723,
136785,
136833,
136880,
136923,
136991,
136992,
137063,
137064,
137124,
137125,
137196,
137269,
137340,
137400,
137425,
137426,
137464,
137465,
137517,
137521,
137563,
137611,
137653,
137697,
137752,
137825,
137829,
137831,
137832,
137889,
137890,
137929,
137930,
138020,
138103,
138181,
138191,
138347,
138373,
138431,
138479,
138526,
138591,
138650,
138705,
138775,
138801,
138872,
138873,
138968,
139008,
139115,
139156,
139157,
139226,
139291,
139362,
139388,
139389,
139452,
139521,
139593,
139613,
139614,
139687,
139758,
139825,
139873,
139874,
139893,
139894,
139913,
139928,
139929,
139967,
139968,
139985,
140000,
140001,
140038,
140039,
140062,
140077,
140078,
140121,
140137,
140157,
140158
],
"line_end_idx": [
1,
74,
147,
220,
301,
374,
447,
515,
588,
589,
627,
727,
781,
782,
791,
792,
875,
914,
967,
1037,
1107,
1157,
1234,
1308,
1390,
1483,
1551,
1621,
1622,
1642,
1643,
1708,
1744,
1745,
1814,
1880,
1952,
2059,
2060,
2133,
2205,
2271,
2333,
2334,
2395,
2396,
2413,
2414,
2481,
2524,
2525,
2590,
2631,
2673,
2741,
2805,
2878,
2950,
3020,
3087,
3131,
3132,
3150,
3151,
3224,
3301,
3378,
3451,
3524,
3617,
3690,
3768,
3841,
3923,
4008,
4085,
4173,
4246,
4323,
4400,
4492,
4529,
4606,
4692,
4745,
4802,
4860,
4933,
5010,
5087,
5164,
5241,
5318,
5403,
5487,
5570,
5621,
5666,
5731,
5774,
5827,
5881,
5928,
5985,
6048,
6103,
6168,
6217,
6288,
6339,
6396,
6439,
6504,
6534,
6607,
6644,
6717,
6768,
6829,
6868,
6935,
6964,
7037,
7076,
7147,
7191,
7258,
7319,
7364,
7422,
7465,
7519,
7576,
7622,
7691,
7763,
7836,
7913,
7914,
7931,
7932,
8000,
8068,
8141,
8174,
8240,
8283,
8338,
8413,
8485,
8557,
8653,
8731,
8786,
8787,
8864,
8897,
8983,
9001,
9079,
9148,
9218,
9291,
9364,
9433,
9502,
9563,
9605,
9676,
9743,
9802,
9892,
9952,
9999,
10073,
10142,
10143,
10174,
10175,
10248,
10344,
10473,
10510,
10530,
10632,
10703,
10782,
10860,
10935,
10986,
10987,
10997,
10998,
11060,
11095,
11165,
11238,
11312,
11406,
11476,
11527,
11598,
11671,
11743,
11817,
11897,
11987,
12085,
12171,
12258,
12325,
12434,
12514,
12559,
12560,
12625,
12688,
12769,
12857,
12953,
13016,
13096,
13158,
13238,
13326,
13433,
13495,
13558,
13620,
13682,
13683,
13729,
13730,
13757,
13758,
13830,
13925,
13948,
14050,
14132,
14212,
14268,
14309,
14380,
14429,
14430,
14496,
14507,
14508,
14581,
14634,
14714,
14830,
14900,
14969,
15036,
15091,
15092,
15110,
15111,
15182,
15254,
15322,
15391,
15414,
15415,
15482,
15554,
15615,
15685,
15699,
15700,
15773,
15807,
15886,
15887,
15923,
15924,
15999,
16022,
16103,
16170,
16237,
16264,
16265,
16337,
16352,
16353,
16426,
16489,
16567,
16640,
16713,
16781,
16853,
16926,
16994,
16995,
17051,
17052,
17099,
17100,
17168,
17237,
17309,
17382,
17454,
17455,
17525,
17595,
17664,
17679,
17680,
17751,
17818,
17889,
17927,
17928,
18026,
18091,
18121,
18202,
18254,
18320,
18398,
18462,
18507,
18508,
18582,
18622,
18623,
18700,
18751,
18833,
18873,
18874,
19030,
19103,
19160,
19230,
19277,
19356,
19357,
19385,
19465,
19532,
19602,
19670,
19740,
19807,
19824,
19825,
19895,
19967,
20037,
20106,
20157,
20158,
20183,
20184,
20253,
20323,
20394,
20448,
20449,
20581,
20652,
20724,
20794,
20824,
20825,
20859,
20860,
20932,
21013,
21082,
21122,
21123,
21194,
21265,
21335,
21406,
21414,
21415,
21485,
21553,
21626,
21697,
21768,
21841,
21914,
21957,
21958,
22016,
22017,
22076,
22135,
22207,
22266,
22324,
22383,
22437,
22488,
22546,
22604,
22660,
22733,
22795,
22866,
22936,
23016,
23095,
23146,
23197,
23248,
23299,
23300,
23364,
23365,
23422,
23423,
23521,
23592,
23611,
23612,
23682,
23737,
23738,
23806,
23879,
23940,
23941,
24011,
24077,
24135,
24136,
24193,
24194,
24308,
24356,
24401,
24459,
24460,
24465,
24466,
24554,
24591,
24592,
24686,
24769,
24841,
24863,
24864,
24941,
25009,
25073,
25131,
25132,
25203,
25303,
25338,
25407,
25456,
25457,
25517,
25518,
25583,
25689,
25719,
25720,
25791,
25837,
25923,
25995,
26017,
26018,
26097,
26169,
26233,
26291,
26292,
26385,
26401,
26417,
26418,
26491,
26561,
26598,
26599,
26699,
26760,
26793,
26864,
26929,
26962,
26963,
27030,
27103,
27175,
27247,
27318,
27392,
27449,
27450,
27513,
27514,
27585,
27655,
27671,
27672,
27692,
27693,
27709,
27710,
27729,
27730,
27801,
27866,
27894,
27895,
27928,
27929,
28033,
28034,
28052,
28053,
28090,
28091,
28127,
28128,
28161,
28162,
28196,
28197,
28270,
28291,
28292,
28358,
28422,
28494,
28531,
28603,
28727,
28825,
28890,
28957,
28988,
28989,
29067,
29068,
29135,
29201,
29291,
29359,
29432,
29448,
29449,
29499,
29500,
29510,
29511,
29558,
29559,
29607,
29608,
29650,
29651,
29666,
29699,
29720,
29743,
29766,
29774,
29775,
29783,
29784,
29794,
29795,
29837,
29838,
29873,
29940,
29980,
29981,
30009,
30010,
30076,
30097,
30098,
30188,
30212,
30288,
30302,
30303,
30354,
30355,
30427,
30500,
30578,
30643,
30676,
30677,
30731,
30732,
30798,
30865,
30960,
31016,
31059,
31126,
31199,
31232,
31316,
31389,
31410,
31497,
31567,
31637,
31690,
31691,
31763,
31832,
31904,
31942,
31943,
32011,
32092,
32161,
32162,
32196,
32197,
32207,
32208,
32280,
32401,
32465,
32532,
32604,
32677,
32742,
32808,
32821,
32822,
32840,
32923,
32968,
33038,
33039,
33089,
33090,
33134,
33135,
33209,
33278,
33321,
33381,
33382,
33478,
33495,
33622,
33741,
33814,
33876,
33888,
33983,
33984,
34024,
34107,
34191,
34274,
34293,
34294,
34358,
34436,
34494,
34495,
34545,
34546,
34620,
34621,
34671,
34672,
34766,
34785,
34867,
34920,
34988,
35070,
35122,
35183,
35253,
35331,
35344,
35353,
35354,
35439,
35512,
35577,
35578,
35597,
35598,
35668,
35711,
35712,
35780,
35832,
35869,
35870,
35947,
35981,
35982,
36051,
36118,
36170,
36171,
36189,
36190,
36260,
36321,
36371,
36378,
36379,
36476,
36549,
36635,
36690,
36768,
36806,
36807,
36843,
36844,
36910,
36978,
37053,
37054,
37130,
37202,
37289,
37355,
37366,
37367,
37438,
37479,
37566,
37584,
37689,
37782,
37864,
37940,
38022,
38089,
38090,
38118,
38119,
38138,
38139,
38147,
38148,
38229,
38299,
38369,
38440,
38512,
38582,
38592,
38593,
38731,
38767,
38806,
38882,
38935,
39008,
39009,
39061,
39113,
39165,
39217,
39269,
39321,
39373,
39427,
39479,
39531,
39583,
39635,
39687,
39739,
39791,
39843,
39895,
39947,
39999,
40051,
40103,
40155,
40207,
40208,
40226,
40227,
40305,
40346,
40398,
40439,
40468,
40469,
40525,
40526,
40557,
40558,
40673,
40701,
40771,
40865,
40874,
40958,
41026,
41076,
41077,
41105,
41106,
41128,
41129,
41144,
41145,
41229,
41275,
41346,
41416,
41494,
41570,
41620,
41621,
41702,
41781,
41782,
41796,
41900,
41928,
41929,
41995,
42052,
42053,
42075,
42076,
42149,
42186,
42187,
42264,
42360,
42428,
42444,
42517,
42585,
42586,
42638,
42705,
42723,
42724,
42799,
42823,
42868,
42869,
42980,
42987,
43026,
43027,
43100,
43101,
43125,
43126,
43206,
43306,
43393,
43394,
43411,
43469,
43470,
43488,
43489,
43501,
43502,
43614,
43692,
43763,
43775,
43776,
43844,
43927,
43948,
43949,
44083,
44155,
44231,
44316,
44339,
44400,
44422,
44423,
44483,
44484,
44526,
44588,
44605,
44606,
44634,
44635,
44705,
44720,
44780,
44807,
44888,
44957,
45039,
45112,
45130,
45202,
45277,
45356,
45408,
45409,
45454,
45455,
45487,
45488,
45556,
45626,
45697,
45793,
45871,
45938,
46028,
46101,
46129,
46130,
46199,
46267,
46338,
46377,
46378,
46475,
46490,
46559,
46630,
46696,
46767,
46814,
46815,
46913,
46928,
46990,
47032,
47033,
47044,
47045,
47077,
47078,
47133,
47134,
47176,
47244,
47313,
47350,
47423,
47501,
47515,
47516,
47586,
47687,
47760,
47827,
47908,
47974,
48047,
48054,
48115,
48188,
48244,
48312,
48408,
48409,
48492,
48561,
48637,
48708,
48800,
48873,
48902,
48903,
48927,
48928,
49000,
49154,
49208,
49222,
49223,
49296,
49355,
49427,
49471,
49513,
49514,
49534,
49535,
49607,
49679,
49750,
49751,
49857,
49895,
49916,
49917,
49935,
49936,
50008,
50080,
50094,
50095,
50168,
50215,
50216,
50282,
50348,
50419,
50466,
50467,
50536,
50605,
50674,
50736,
50803,
50871,
50942,
51011,
51080,
51091,
51092,
51164,
51203,
51204,
51256,
51310,
51311,
51339,
51340,
51371,
51372,
51396,
51397,
51425,
51426,
51450,
51451,
51510,
51579,
51645,
51717,
51718,
51757,
51758,
51821,
51822,
51840,
51841,
51909,
51980,
52052,
52108,
52130,
52131,
52216,
52247,
52302,
52347,
52408,
52409,
52464,
52510,
52603,
52604,
52676,
52744,
52745,
52761,
52860,
52945,
52966,
53030,
53122,
53162,
53239,
53306,
53371,
53436,
53468,
53469,
53536,
53604,
53661,
53662,
53727,
53781,
53852,
53925,
54003,
54073,
54152,
54173,
54271,
54286,
54287,
54305,
54306,
54375,
54442,
54471,
54472,
54496,
54497,
54589,
54658,
54734,
54764,
54765,
54834,
54900,
54961,
55028,
55061,
55062,
55167,
55236,
55323,
55394,
55467,
55532,
55596,
55655,
55656,
55715,
55798,
55815,
55816,
55898,
55962,
56011,
56077,
56122,
56123,
56143,
56144,
56216,
56288,
56348,
56399,
56400,
56495,
56608,
56659,
56737,
56751,
56752,
56824,
56902,
56980,
57025,
57052,
57053,
57082,
57083,
57153,
57246,
57311,
57382,
57435,
57436,
57508,
57547,
57548,
57600,
57601,
57655,
57656,
57684,
57685,
57716,
57717,
57741,
57742,
57770,
57771,
57795,
57796,
57855,
57924,
57990,
58062,
58063,
58102,
58103,
58147,
58148,
58212,
58283,
58356,
58399,
58400,
58420,
58421,
58493,
58565,
58615,
58682,
58759,
58834,
58835,
58920,
58943,
59028,
59097,
59118,
59202,
59233,
59234,
59293,
59326,
59327,
59393,
59488,
59535,
59625,
59697,
59769,
59838,
59909,
59977,
59991,
59992,
60059,
60130,
60172,
60204,
60205,
60276,
60290,
60291,
60329,
60330,
60370,
60371,
60440,
60539,
60568,
60654,
60724,
60803,
60890,
60935,
60936,
61006,
61078,
61147,
61217,
61255,
61256,
61329,
61394,
61468,
61549,
61550,
61607,
61642,
61643,
61655,
61656,
61727,
61798,
61867,
61938,
62008,
62022,
62023,
62095,
62162,
62234,
62248,
62249,
62306,
62367,
62428,
62489,
62550,
62612,
62673,
62734,
62795,
62856,
62913,
62914,
62967,
62968,
62984,
62985,
63053,
63084,
63085,
63169,
63190,
63191,
63277,
63355,
63426,
63490,
63491,
63564,
63618,
63619,
63687,
63757,
63828,
63883,
63954,
64001,
64072,
64093,
64113,
64114,
64165,
64166,
64171,
64172,
64208,
64209,
64269,
64270,
64290,
64308,
64319,
64341,
64363,
64380,
64406,
64424,
64450,
64471,
64476,
64477,
64487,
64488,
64577,
64594,
64595,
64666,
64707,
64708,
64781,
64873,
64924,
64987,
65038,
65074,
65075,
65145,
65187,
65188,
65261,
65296,
65297,
65381,
65426,
65427,
65490,
65559,
65627,
65687,
65688,
65749,
65750,
65770,
65771,
65793,
65794,
65894,
65959,
66024,
66097,
66103,
66121,
66122,
66193,
66262,
66291,
66292,
66320,
66321,
66394,
66460,
66532,
66604,
66673,
66674,
66756,
66835,
66859,
66928,
66997,
67066,
67110,
67111,
67135,
67136,
67207,
67240,
67241,
67257,
67258,
67327,
67400,
67472,
67559,
67621,
67622,
67694,
67764,
67836,
67905,
67950,
67951,
68017,
68095,
68143,
68167,
68168,
68192,
68193,
68264,
68350,
68382,
68505,
68578,
68670,
68737,
68799,
68872,
68942,
68980,
69047,
69115,
69210,
69265,
69299,
69348,
69349,
69395,
69396,
69419,
69420,
69489,
69568,
69569,
69592,
69707,
69726,
69828,
69899,
69969,
70063,
70134,
70187,
70188,
70258,
70333,
70404,
70463,
70464,
70503,
70504,
70574,
70643,
70712,
70781,
70852,
70876,
70877,
70949,
71020,
71063,
71151,
71226,
71242,
71243,
71249,
71250,
71354,
71426,
71486,
71487,
71521,
71560,
71561,
71585,
71586,
71669,
71718,
71719,
71804,
71900,
71926,
71997,
72067,
72145,
72239,
72309,
72310,
72348,
72418,
72490,
72557,
72629,
72700,
72722,
72765,
72766,
72788,
72789,
72872,
72941,
72942,
73012,
73083,
73151,
73213,
73317,
73365,
73451,
73535,
73610,
73674,
73739,
73766,
73843,
73873,
73960,
73974,
73975,
73987,
73988,
74044,
74045,
74154,
74258,
74259,
74328,
74441,
74513,
74545,
74614,
74671,
74672,
74687,
74688,
74718,
74784,
74852,
74867,
74868,
74968,
74969,
74998,
74999,
75084,
75198,
75271,
75343,
75361,
75362,
75433,
75504,
75574,
75647,
75666,
75667,
75683,
75684,
75754,
75824,
75895,
75943,
75944,
76015,
76088,
76146,
76147,
76180,
76181,
76240,
76305,
76370,
76441,
76510,
76577,
76623,
76624,
76639,
76640,
76669,
76670,
76743,
76772,
76773,
76789,
76818,
76819,
76891,
76892,
76958,
76976,
76977,
77077,
77104,
77190,
77262,
77284,
77285,
77356,
77397,
77398,
77475,
77534,
77535,
77608,
77675,
77692,
77693,
77738,
77739,
77767,
77768,
77838,
77876,
77877,
77947,
78027,
78028,
78124,
78179,
78256,
78328,
78397,
78398,
78462,
78534,
78601,
78674,
78738,
78809,
78877,
78899,
78900,
78973,
79038,
79108,
79144,
79145,
79210,
79281,
79348,
79415,
79456,
79457,
79528,
79595,
79661,
79726,
79738,
79739,
79745,
79746,
79850,
79882,
79883,
79889,
79890,
79957,
79976,
79977,
79992,
79993,
80069,
80121,
80182,
80183,
80189,
80190,
80247,
80248,
80316,
80389,
80452,
80518,
80537,
80538,
80612,
80647,
80648,
80654,
80655,
80726,
80797,
80870,
80910,
80911,
80985,
81046,
81103,
81104,
81110,
81111,
81182,
81183,
81213,
81214,
81285,
81375,
81444,
81517,
81587,
81648,
81649,
81716,
81743,
81744,
81810,
81828,
81829,
81868,
81869,
81940,
82009,
82111,
82112,
82187,
82245,
82297,
82352,
82424,
82479,
82480,
82551,
82592,
82593,
82670,
82722,
82723,
82795,
82796,
82825,
82826,
82897,
82935,
82936,
83006,
83074,
83108,
83109,
83178,
83250,
83297,
83298,
83364,
83438,
83468,
83581,
83651,
83719,
83763,
83764,
83776,
83788,
83789,
83880,
83947,
83979,
83980,
84025,
84087,
84088,
84155,
84174,
84175,
84190,
84191,
84222,
84223,
84305,
84370,
84441,
84514,
84515,
84596,
84701,
84753,
84805,
84806,
84825,
84826,
84883,
84884,
84952,
85021,
85083,
85084,
85150,
85185,
85258,
85259,
85270,
85271,
85342,
85413,
85486,
85526,
85527,
85604,
85660,
85690,
85741,
85742,
85815,
85867,
85868,
85874,
85875,
85947,
85948,
86016,
86087,
86159,
86232,
86270,
86271,
86302,
86303,
86373,
86446,
86538,
86611,
86680,
86747,
86827,
86901,
86973,
86986,
86987,
87038,
87039,
87123,
87165,
87166,
87234,
87304,
87375,
87418,
87489,
87490,
87544,
87545,
87630,
87676,
87677,
87756,
87847,
87919,
87920,
87992,
88068,
88069,
88168,
88238,
88270,
88271,
88315,
88363,
88404,
88405,
88488,
88561,
88595,
88596,
88667,
88708,
88709,
88818,
88857,
88858,
88909,
88910,
88977,
89032,
89033,
89063,
89111,
89175,
89206,
89207,
89263,
89295,
89296,
89354,
89433,
89491,
89564,
89632,
89695,
89766,
89822,
89880,
89881,
89977,
89978,
89993,
89994,
90071,
90094,
90095,
90120,
90121,
90144,
90145,
90150,
90158,
90183,
90218,
90223,
90224,
90277,
90315,
90316,
90338,
90339,
90384,
90385,
90451,
90452,
90523,
90560,
90561,
90626,
90692,
90693,
90746,
90766,
90767,
90811,
90812,
90835,
90836,
90841,
90849,
90856,
90891,
90900,
90901,
90974,
91001,
91002,
91051,
91052,
91071,
91072,
91143,
91215,
91288,
91356,
91428,
91496,
91497,
91510,
91511,
91583,
91648,
91719,
91742,
91743,
91791,
91859,
91930,
91995,
92062,
92063,
92090,
92091,
92158,
92181,
92182,
92207,
92208,
92231,
92232,
92237,
92245,
92270,
92305,
92310,
92311,
92367,
92409,
92431,
92432,
92441,
92442,
92485,
92486,
92499,
92500,
92533,
92534,
92602,
92603,
92610,
92611,
92662,
92663,
92686,
92687,
92692,
92700,
92733,
92768,
92773,
92774,
92833,
92875,
92876,
92898,
92899,
92908,
92909,
92952,
92953,
92969,
92970,
93000,
93001,
93055,
93073,
93074,
93090,
93091,
93162,
93230,
93302,
93329,
93330,
93374,
93375,
93398,
93399,
93404,
93412,
93419,
93454,
93459,
93460,
93513,
93533,
93534,
93556,
93557,
93589,
93590,
93617,
93618,
93683,
93684,
93725,
93726,
93749,
93750,
93755,
93763,
93779,
93814,
93819,
93820,
93870,
93902,
93903,
93925,
93926,
93958,
93959,
93989,
93990,
94058,
94059,
94075,
94076,
94147,
94210,
94282,
94351,
94421,
94432,
94443,
94444,
94516,
94589,
94661,
94684,
94685,
94714,
94715,
94749,
94750,
94823,
94894,
94966,
95037,
95062,
95063,
95100,
95101,
95211,
95244,
95315,
95357,
95420,
95463,
95464,
95542,
95598,
95691,
95762,
95837,
95867,
95955,
95975,
96067,
96121,
96151,
96152,
96245,
96282,
96296,
96297,
96385,
96441,
96442,
96516,
96585,
96603,
96674,
96675,
96713,
96714,
96766,
96833,
96834,
96862,
96931,
96995,
97104,
97116,
97117,
97185,
97204,
97277,
97384,
97457,
97493,
97578,
97622,
97681,
97778,
97891,
97970,
98038,
98103,
98171,
98244,
98274,
98329,
98403,
98423,
98424,
98436,
98437,
98489,
98490,
98541,
98564,
98565,
98618,
98619,
98692,
98693,
98733,
98734,
98802,
98828,
98876,
98877,
98947,
99021,
99022,
99049,
99075,
99126,
99127,
99161,
99185,
99186,
99202,
99230,
99285,
99286,
99327,
99328,
99347,
99375,
99427,
99428,
99499,
99500,
99519,
99554,
99555,
99647,
99715,
99788,
99848,
99869,
99917,
99918,
99984,
100079,
100122,
100192,
100253,
100277,
100278,
100347,
100417,
100497,
100582,
100597,
100645,
100646,
100684,
100685,
100764,
100830,
100900,
100967,
101050,
101089,
101174,
101200,
101299,
101375,
101402,
101420,
101421,
101433,
101434,
101489,
101490,
101517,
101557,
101558,
101631,
101632,
101670,
101671,
101699,
101733,
101761,
101814,
101815,
101871,
101946,
101947,
101985,
102013,
102063,
102064,
102107,
102108,
102129,
102159,
102213,
102214,
102257,
102258,
102276,
102306,
102363,
102364,
102419,
102420,
102438,
102478,
102479,
102496,
102567,
102664,
102691,
102789,
102832,
102903,
102996,
103052,
103053,
103130,
103177,
103178,
103207,
103208,
103281,
103351,
103427,
103498,
103531,
103598,
103683,
103749,
103838,
103908,
103977,
104073,
104168,
104212,
104284,
104317,
104318,
104380,
104437,
104529,
104559,
104560,
104621,
104713,
104820,
104883,
104915,
105001,
105073,
105144,
105187,
105259,
105360,
105423,
105499,
105514,
105515,
105529,
105602,
105673,
105749,
105807,
105877,
105981,
106062,
106130,
106227,
106228,
106307,
106379,
106415,
106488,
106562,
106611,
106705,
106783,
106808,
106875,
106972,
106973,
107001,
107002,
107057,
107106,
107201,
107273,
107329,
107355,
107431,
107494,
107552,
107553,
107616,
107688,
107754,
107822,
107893,
107925,
107926,
107995,
108067,
108139,
108206,
108278,
108351,
108424,
108494,
108565,
108595,
108596,
108624,
108625,
108697,
108765,
108836,
108843,
108921,
108990,
109010,
109011,
109078,
109145,
109171,
109172,
109244,
109312,
109345,
109346,
109425,
109495,
109578,
109602,
109603,
109628,
109629,
109683,
109684,
109709,
109811,
109812,
109848,
109849,
109888,
109958,
110050,
110123,
110186,
110249,
110322,
110394,
110466,
110533,
110605,
110674,
110743,
110816,
110889,
110959,
111026,
111027,
111052,
111053,
111118,
111176,
111177,
111213,
111214,
111280,
111293,
111294,
111356,
111418,
111480,
111542,
111604,
111605,
111623,
111624,
111658,
111659,
111775,
111788,
111789,
111819,
111820,
111847,
111848,
111880,
111881,
111913,
111914,
111953,
111954,
112019,
112020,
112064,
112065,
112097,
112098,
112168,
112238,
112308,
112392,
112393,
112456,
112457,
112504,
112505,
112536,
112537,
112567,
112568,
112600,
112601,
112643,
112644,
112710,
112766,
112767,
112797,
112798,
112832,
112833,
112893,
112894,
112934,
112935,
113006,
113026,
113027,
113094,
113161,
113228,
113295,
113362,
113363,
113384,
113385,
113434,
113504,
113505,
113526,
113527,
113599,
113670,
113740,
113787,
113788,
113859,
113921,
113922,
113926,
113927,
113943,
113944,
113950,
113951,
113979,
113980,
114021,
114091,
114160,
114205,
114206,
114229,
114300,
114372,
114373,
114439,
114492,
114540,
114596,
114653,
114654,
114720,
114792,
114849,
114850,
114905,
114955,
115011,
115068,
115069,
115139,
115208,
115321,
115322,
115387,
115457,
115570,
115571,
115642,
115696,
115743,
115799,
115856,
115857,
115923,
115977,
116029,
116085,
116142,
116143,
116214,
116284,
116333,
116389,
116390,
116396,
116453,
116454,
116525,
116597,
116667,
116718,
116775,
116776,
116847,
116916,
116983,
117040,
117041,
117112,
117169,
117226,
117227,
117257,
117258,
117294,
117367,
117433,
117503,
117523,
117524,
117564,
117640,
117709,
117782,
117809,
117873,
117874,
117913,
117985,
118053,
118084,
118154,
118155,
118185,
118257,
118324,
118393,
118416,
118478,
118479,
118511,
118577,
118641,
118709,
118779,
118799,
118800,
118838,
118901,
118968,
119034,
119063,
119064,
119098,
119188,
119259,
119298,
119299,
119332,
119422,
119491,
119537,
119605,
119674,
119675,
119713,
119785,
119853,
119877,
119938,
119939,
120010,
120076,
120136,
120193,
120194,
120267,
120324,
120370,
120426,
120483,
120484,
120555,
120607,
120653,
120709,
120766,
120767,
120832,
120900,
120963,
120964,
120990,
120991,
121034,
121035,
121057,
121058,
121135,
121201,
121266,
121339,
121377,
121378,
121408,
121409,
121464,
121528,
121574,
121575,
121603,
121629,
121647,
121713,
121765,
121834,
121938,
122012,
122082,
122122,
122188,
122240,
122309,
122368,
122468,
122557,
122597,
122670,
122723,
122768,
122842,
122868,
122886,
122959,
123012,
123057,
123131,
123157,
123158,
123233,
123303,
123304,
123373,
123446,
123514,
123526,
123527,
123590,
123663,
123732,
123766,
123767,
123837,
123903,
123915,
123916,
123949,
123950,
124005,
124069,
124139,
124207,
124227,
124228,
124251,
124271,
124319,
124361,
124400,
124454,
124514,
124553,
124573,
124621,
124663,
124702,
124756,
124816,
124855,
124875,
124927,
124969,
125013,
125052,
125125,
125145,
125197,
125239,
125283,
125322,
125395,
125416,
125436,
125488,
125530,
125574,
125613,
125686,
125706,
125758,
125800,
125844,
125883,
125956,
125976,
125977,
126046,
126117,
126158,
126159,
126228,
126301,
126369,
126381,
126382,
126445,
126514,
126582,
126655,
126723,
126793,
126859,
126860,
126930,
127000,
127068,
127069,
127117,
127118,
127161,
127162,
127235,
127308,
127380,
127447,
127512,
127585,
127650,
127718,
127788,
127842,
127843,
127909,
127982,
128053,
128071,
128072,
128139,
128208,
128280,
128352,
128421,
128488,
128558,
128594,
128595,
128658,
128712,
128713,
128778,
128849,
128918,
128974,
129024,
129025,
129095,
129165,
129236,
129277,
129347,
129348,
129427,
129488,
129560,
129639,
129712,
129765,
129766,
129787,
129788,
129858,
129920,
129984,
130014,
130063,
130168,
130217,
130218,
130289,
130365,
130379,
130380,
130450,
130467,
130468,
130540,
130612,
130656,
130746,
130747,
130769,
130770,
130786,
130787,
130871,
130937,
130959,
130960,
130976,
131151,
131201,
131202,
131290,
131309,
131310,
131340,
131341,
131415,
131465,
131466,
131488,
131489,
131557,
131575,
131576,
131643,
131697,
131722,
131723,
131770,
131771,
131831,
131847,
131901,
131961,
132015,
132070,
132121,
132185,
132201,
132215,
132216,
132259,
132323,
132379,
132380,
132418,
132419,
132523,
132591,
132611,
132612,
132640,
132688,
132752,
132781,
132894,
132954,
132980,
133046,
133047,
133116,
133117,
133138,
133139,
133204,
133205,
133277,
133323,
133324,
133362,
133363,
133425,
133442,
133497,
133558,
133613,
133669,
133721,
133783,
133800,
133815,
133816,
133873,
133874,
133913,
133914,
134029,
134105,
134134,
134256,
134337,
134363,
134419,
134467,
134512,
134564,
134623,
134678,
134743,
134769,
134827,
134875,
134920,
134965,
135024,
135079,
135149,
135175,
135233,
135281,
135326,
135371,
135430,
135458,
135525,
135526,
135596,
135639,
135640,
135699,
135700,
135771,
135772,
135831,
135889,
135914,
135915,
135953,
135954,
136006,
136010,
136052,
136100,
136142,
136185,
136258,
136262,
136264,
136265,
136322,
136323,
136362,
136363,
136484,
136570,
136597,
136626,
136723,
136785,
136833,
136880,
136923,
136991,
136992,
137063,
137064,
137124,
137125,
137196,
137269,
137340,
137400,
137425,
137426,
137464,
137465,
137517,
137521,
137563,
137611,
137653,
137697,
137752,
137825,
137829,
137831,
137832,
137889,
137890,
137929,
137930,
138020,
138103,
138181,
138191,
138347,
138373,
138431,
138479,
138526,
138591,
138650,
138705,
138775,
138801,
138872,
138873,
138968,
139008,
139115,
139156,
139157,
139226,
139291,
139362,
139388,
139389,
139452,
139521,
139593,
139613,
139614,
139687,
139758,
139825,
139873,
139874,
139893,
139894,
139913,
139928,
139929,
139967,
139968,
139985,
140000,
140001,
140038,
140039,
140062,
140077,
140078,
140121,
140137,
140157,
140158,
140182
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 140182,
"ccnet_original_nlines": 3149,
"rps_doc_curly_bracket": 0.0005992199876345694,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23998062312602997,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06317044049501419,
"rps_doc_frac_lines_end_with_ellipsis": 0.0015872999792918563,
"rps_doc_frac_no_alph_words": 0.3327994644641876,
"rps_doc_frac_unique_words": 0.10808529704809189,
"rps_doc_mean_word_length": 5.1842122077941895,
"rps_doc_num_sentences": 1892,
"rps_doc_symbol_to_word_ratio": 0.0018623400246724486,
"rps_doc_unigram_entropy": 6.061004161834717,
"rps_doc_word_count": 17773,
"rps_doc_frac_chars_dupe_10grams": 0.15974776446819305,
"rps_doc_frac_chars_dupe_5grams": 0.36773785948753357,
"rps_doc_frac_chars_dupe_6grams": 0.3009583353996277,
"rps_doc_frac_chars_dupe_7grams": 0.25903254747390747,
"rps_doc_frac_chars_dupe_8grams": 0.2135252207517624,
"rps_doc_frac_chars_dupe_9grams": 0.1835596263408661,
"rps_doc_frac_chars_top_2gram": 0.007217360194772482,
"rps_doc_frac_chars_top_3gram": 0.0055025601759552956,
"rps_doc_frac_chars_top_4gram": 0.004341269843280315,
"rps_doc_books_importance": -13033.505859375,
"rps_doc_books_importance_length_correction": -13033.505859375,
"rps_doc_openwebtext_importance": -7536.41650390625,
"rps_doc_openwebtext_importance_length_correction": -7536.41650390625,
"rps_doc_wikipedia_importance": -5156.7099609375,
"rps_doc_wikipedia_importance_length_correction": -5156.7099609375
},
"fasttext": {
"dclm": 0.07808107137680054,
"english": 0.7975060343742371,
"fineweb_edu_approx": 2.1149210929870605,
"eai_general_math": 0.7997547388076782,
"eai_open_web_math": 0.42513054609298706,
"eai_web_code": 0.9740249514579773
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "2",
"label": "Academic/Research"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"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": "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
|
-4,890,829,519,346,466,000 |
fbpx
Web Development in a Nutshell and Why You Should Study it
Since the internet became accessible to the public in the 1990’s, it has become a staple in society. Consequently, having a presence in the world wide web can open a lot of opportunities. In an increasingly interconnected age, having a website can do wonders for your goals regardless if you’re promoting a business, spreading awareness about a certain advocacy and the like.
Websites are made possible through web development. According to Techterms, web development refers to building, creating, and maintaining websites. It includes aspects such as web design, web publishing, web programming, and database management. In simple terms, web development refers to all the work that goes into making a website.
What’s on the Web?
Web design on the web
What’s so special about having your own website anyway? Well, the fact of the matter is that the internet isn’t going anywhere. As per Statista, there are 3.97 billion global users of the internet as of 2019, more than half of the world’s population, and this number is expected to increase in the years to come.
The internet has become an invaluable portal for a variety of reasons. First of all, It has become a platform for people to connect with others wherever they are in the world. The significance of this function has been magnified exponentially by the COVID-19 pandemic. It has become an avenue to conduct research in a more efficient and accessible manner, saving people a lot of time and effort.
To add to this, the internet has paved the way for education, not just in an academic setup, but in general. The internet provides a plethora of information on anything and everything under the sun. Lastly, the internet has become an avenue for entertainment, which has helped people cope significantly amid the ongoing pandemic.
Whatever your reason is for being on the internet, the common denominator among these is that they require a website, and each website requires a website developer.
Why Study Web Development?
Studying Web design
What are the opportunities in web development anyway? In a world that has been bridged together by the internet, there are a lot of great reasons why studying web development is so valuable, such as:
1. The high demand. The demand for web developers continues to rise, especially now that going online has become the safest way for shopping, information and entertainment. Businesses are always on the lookout for good quality web developers to help their companies thrive and survive, and it is expected that this trend will continue in the years to come.
1. Work flexibility. Once you’ve learned how to develop compelling websites, you have the option to work full-time, part-time or even freelance. You can even become your own boss. The possibilities are endless! Whatever your preference for working is, you have a lot of viable options if you’re an expert in web design.
1. Good compensation. The monetary compensation for designing websites is high. A lot of organizations pay a huge sum of money for the development of sophisticated websites. In this day and age where everything seems to get expensive by the day, it’s a great career choice that can pave the way for a comfortable life.
1. Qualification. While having a degree in Computer Science is certainly a plus, you don’t need a college degree in order to be a web design expert. You’re hired based on your knowledge of web development, and portfolio of previous work.
1. Sense of fulfillment. You have the potential to make a lot of amazing things happen if you’re skilled in web design. Whether it’s promoting a good cause or advocating for a passion project, developing websites can be a platform to a lot of great things.
It should be noted, however, that as the internet and the world of web design evolves, so must web developers in order to stay relevant. Web developers should keep themselves up to date with the latest trends and concepts in order to service their clients better.
Before you delve into the world of opportunities of web design, you need to learn the process of web development. While there are a lot of resources to help you get started, a great way to do so is through a Web Design Course.
A great place to learn design websites is CIIT Philippines. An academic institution that promotes high quality, industry-based teaching, CIIT Philippines offers a Web Design Course that will equip students with valuable skills such as web design, web programming, and WordPress.
CIIT Philippines’ teaching staff consists mostly of active industry pros who share first-rate knowledge and skills, ensuring students will learn from experts who can walk the talk. Along with them, CIIT Philippines always improves its programs to make them more relevant to current trade needs, giving students a competitive edge to advance their careers. The possibilities are endless, so jumpstart your journey to learning about web design today.
|
{
"url": "https://www.ciit.edu.ph/web-development-in-a-nutshell-and-why-you-should-study-it/",
"source_domain": "www.ciit.edu.ph",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "230801",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FYFSRBGCLIOFRDJAPKTQBJ2MESZW7TNH",
"WARC-Concurrent-To": "<urn:uuid:63cd51b2-9c31-4f88-81c9-5e409253bea0>",
"WARC-Date": "2022-01-27T08:07:16Z",
"WARC-IP-Address": "216.104.46.213",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CLN7TVYILW4SBUSKBWAZQU5ES4BJL3RX",
"WARC-Record-ID": "<urn:uuid:0ec6f900-940c-4cb9-bd0c-fe530ac4a000>",
"WARC-Target-URI": "https://www.ciit.edu.ph/web-development-in-a-nutshell-and-why-you-should-study-it/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f778a52e-dec0-42be-9f40-906c5a3b0248>"
},
"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-24\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,
5,
6,
64,
65,
442,
443,
779,
780,
799,
800,
822,
823,
1137,
1138,
1535,
1536,
1866,
1867,
2033,
2034,
2061,
2062,
2082,
2083,
2284,
2285,
2645,
2968,
3290,
3531,
3791,
3792,
4057,
4058,
4286,
4287,
4567,
4568
],
"line_end_idx": [
5,
6,
64,
65,
442,
443,
779,
780,
799,
800,
822,
823,
1137,
1138,
1535,
1536,
1866,
1867,
2033,
2034,
2061,
2062,
2082,
2083,
2284,
2285,
2645,
2968,
3290,
3531,
3791,
3792,
4057,
4058,
4286,
4287,
4567,
4568,
5016
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5016,
"ccnet_original_nlines": 38,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42813143134117126,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007186859846115112,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13655030727386475,
"rps_doc_frac_unique_words": 0.4194711446762085,
"rps_doc_mean_word_length": 4.849759578704834,
"rps_doc_num_sentences": 54,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.160126209259033,
"rps_doc_word_count": 832,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03469641134142876,
"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.026765799149870872,
"rps_doc_frac_chars_top_3gram": 0.011895909905433655,
"rps_doc_frac_chars_top_4gram": 0.005947960074990988,
"rps_doc_books_importance": -432.5502624511719,
"rps_doc_books_importance_length_correction": -432.5502624511719,
"rps_doc_openwebtext_importance": -249.66212463378906,
"rps_doc_openwebtext_importance_length_correction": -249.66212463378906,
"rps_doc_wikipedia_importance": -205.59295654296875,
"rps_doc_wikipedia_importance_length_correction": -205.59295654296875
},
"fasttext": {
"dclm": 0.43283915519714355,
"english": 0.9434305429458618,
"fineweb_edu_approx": 2.3502919673919678,
"eai_general_math": 0.024683300405740738,
"eai_open_web_math": 0.13657301664352417,
"eai_web_code": 0.03679174184799194
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.019",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "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": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,319,929,679,839,743,000 |
Fix: Gears 5 Error GW502 and GW503
Gears 5 is one of the third-person shooter video games, developed by The Coalition and published by Xbox Game Studios. It has been released for Xbox One, Xbox Series X|S, and Windows platforms. It has a wide range of maps, multiple gaming characters, new weapons, a bunch of special rewards, etc. Though the game has been rated quite well, it’s needless to say that Gears 5 includes plenty of errors too. Recently, some of the Gears 5 PC players are encountering Error GW502 and GW503 that causing issues with the game startup or gameplay. If you’re also one of them, make sure to check out the guide below.
It seems that plenty of Gears 5 errors are happening due to the graphics card-related issue for the Windows users whatsoever. Plenty of reports are coming out that there is nothing wrong with the game or any other thing except for PC configuration and graphics card issue. Now, the graphics card issue can vary depending on the particular error code something like the graphics card isn’t meeting the system requirement or an outdated graphics card or GPU stopped working or even not detected, etc.
Fix: Gears 5 Error GW502 and GW503
Fix: Gears 5 Error GW502 and GW503
Talking about both the GW502 and GW503 errors, it appears on the Windows system & both the errors are related to your graphics card issue.
GW502: This error indicates that the graphics card has stopped responding and was reset by the Windows OS.
GW503: It means that the current graphics card was not detected by the Gears 5 game.
Advertisements
According to the Gears 5 Techtest page, both the errors can be fixed by simply restarting your Windows PC/Laptop. It can possible that your graphics card may be in an unstable state and causing such issues. Additionally, updating the graphics driver to the latest version will also help a lot. However, if your graphics driver is running the latest version, try reducing the in-game graphics settings for optimal performance.
1. Reboot Your Computer
By simply rebooting the PC/Laptop, you’ll be ready to play your Gears 5 game again because sometimes any system glitch or graphics card stability issues can take place. So, click on the Start menu > Go to the Power menu > Select Restart. Once restarted, check whether the problem has been fixed or not.
2. Update Graphics Driver
If you’re using the Nvidia graphics card then update the GeForce Experience app on your PC from the Nvidia official site here. But if you’re using the AMD graphics card on your system, then update the latest AMD Drivers from here.
3. Try Reducing Visual Settings
Try to always reduce or lower the in-game graphics/visual settings to enhance the gaming performance along with the FPS count. A better FPS count will always provide a better gaming experience although you have to lower the graphics settings to low or medium. However, most of the PC gamers always want a stunning visual treat from their games but end up with lags, stutters, crashes, etc.
That’s it, guys. We hope this guide was useful. For further queries, you can comment below.
Leave a Reply
Your email address will not be published. Required fields are marked *
This site uses Akismet to reduce spam. Learn how your comment data is processed.
|
{
"url": "https://www.getdroidtips.com/fix-gears-5-error-gw502-gw503/",
"source_domain": "www.getdroidtips.com",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "173556",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IJE5MRXB5NERFV5JXH5E53L25ZWFLWCY",
"WARC-Concurrent-To": "<urn:uuid:3821b143-7805-47d4-8077-9eefa61f1a05>",
"WARC-Date": "2023-03-21T10:08:37Z",
"WARC-IP-Address": "104.26.4.73",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5T7332JP4NVGI3HQINV3Z4I5MXY3P7HU",
"WARC-Record-ID": "<urn:uuid:b90463ff-53a9-4052-b040-aabc556ce9f6>",
"WARC-Target-URI": "https://www.getdroidtips.com/fix-gears-5-error-gw502-gw503/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:687f1e83-9a31-4c51-9b73-b16a536c17a1>"
},
"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-195\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,
35,
36,
644,
645,
1144,
1145,
1180,
1181,
1216,
1217,
1356,
1357,
1464,
1465,
1550,
1551,
1566,
1567,
1993,
1994,
2018,
2019,
2322,
2323,
2349,
2350,
2581,
2582,
2614,
2615,
3005,
3006,
3098,
3099,
3113,
3114,
3185,
3186
],
"line_end_idx": [
35,
36,
644,
645,
1144,
1145,
1180,
1181,
1216,
1217,
1356,
1357,
1464,
1465,
1550,
1551,
1566,
1567,
1993,
1994,
2018,
2019,
2322,
2323,
2349,
2350,
2581,
2582,
2614,
2615,
3005,
3006,
3098,
3099,
3113,
3114,
3185,
3186,
3266
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3266,
"ccnet_original_nlines": 38,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38109755516052246,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.041158538311719894,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14786584675312042,
"rps_doc_frac_unique_words": 0.4578096866607666,
"rps_doc_mean_word_length": 4.685816764831543,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.0624895095825195,
"rps_doc_word_count": 557,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.031034480780363083,
"rps_doc_frac_chars_dupe_6grams": 0.031034480780363083,
"rps_doc_frac_chars_dupe_7grams": 0.031034480780363083,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.050574708729982376,
"rps_doc_frac_chars_top_3gram": 0.02490421012043953,
"rps_doc_frac_chars_top_4gram": 0.027586210519075394,
"rps_doc_books_importance": -299.1686706542969,
"rps_doc_books_importance_length_correction": -299.1686706542969,
"rps_doc_openwebtext_importance": -151.1055145263672,
"rps_doc_openwebtext_importance_length_correction": -151.1055145263672,
"rps_doc_wikipedia_importance": -121.6584701538086,
"rps_doc_wikipedia_importance_length_correction": -121.6584701538086
},
"fasttext": {
"dclm": 0.03262782096862793,
"english": 0.9269915223121643,
"fineweb_edu_approx": 1.2266968488693237,
"eai_general_math": 0.0026925199199467897,
"eai_open_web_math": 0.030061839148402214,
"eai_web_code": 0.00020403000235091895
}
}
|
{
"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": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.