id
int64 | text
string | metadata
dict | line_start_n_end_idx
dict | quality_signals
dict | eai_taxonomy
dict | pid
string |
|---|---|---|---|---|---|---|
-8,447,298,152,779,581,000 |
Fix all crashed tables in MySQL
Have randomly crashed tables in your MySQL server and want to fix them all? This isn't the way to do it safely, but it's effective (if not very time consuming and CPU intense).
% mysqlcheck --auto-repair -A -urootusername -prootpassword
Just run the command mysqlcheck --auto-repair -A and add the credentials for a user that has privileges on all databases. Beware, there can be dire consequences. But, run a snapshot on your server and run this command if you want a quick fix.
|
{
"url": "http://www.jasonn.com/content/fix-all-crashed-tables-mysql",
"source_domain": "www.jasonn.com",
"snapshot_id": "crawl=CC-MAIN-2013-20",
"warc_metadata": {
"Content-Length": "9824",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Y2H7YPOUK6OONCNG24CI6SWCH3NATBZS",
"WARC-Concurrent-To": "<urn:uuid:681e17f6-0187-4643-81d1-b60d3ab3ce7f>",
"WARC-Date": "2013-05-19T15:03:16Z",
"WARC-IP-Address": "184.73.193.32",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:4KJICEHHG3CXUFOEAWIWW6K6EQL4XRI6",
"WARC-Record-ID": "<urn:uuid:4f70f370-b444-4146-98b0-d1c852582009>",
"WARC-Target-URI": "http://www.jasonn.com/content/fix-all-crashed-tables-mysql",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3666c0d9-36a9-4cbe-9fb6-649f04af62b0>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-60-113-184.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2013-20\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for Spring 2013\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
32,
33,
210,
211,
271,
272
],
"line_end_idx": [
32,
33,
210,
211,
271,
272,
514
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 514,
"ccnet_original_nlines": 6,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.38738739490509033,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027027029544115067,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18018017709255219,
"rps_doc_frac_unique_words": 0.6551724076271057,
"rps_doc_mean_word_length": 4.609195232391357,
"rps_doc_num_sentences": 5,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.9191250801086426,
"rps_doc_word_count": 87,
"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.06483791023492813,
"rps_doc_frac_chars_top_3gram": 0.07481297105550766,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -58.683170318603516,
"rps_doc_books_importance_length_correction": -69.71900939941406,
"rps_doc_openwebtext_importance": -24.134206771850586,
"rps_doc_openwebtext_importance_length_correction": -35.170047760009766,
"rps_doc_wikipedia_importance": -28.995912551879883,
"rps_doc_wikipedia_importance_length_correction": -40.03175354003906
},
"fasttext": {
"dclm": 0.039977848529815674,
"english": 0.8041205406188965,
"fineweb_edu_approx": 1.3829278945922852,
"eai_general_math": 0.8588266372680664,
"eai_open_web_math": 0.24815255403518677,
"eai_web_code": 0.25537604093551636
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.746",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
739,447,985,112,112,500 |
/[CvsGraph]/cvsgraph/configure
ViewVC logotype
Annotate of /cvsgraph/configure
Parent Directory Parent Directory | Revision Log Revision Log | View Revision Graph Revision Graph
Revision 1.15.4.2 - (show annotations)
Wed May 21 11:31:12 2008 UTC (9 years, 10 months ago) by bertho
Branch: automake-dev1
CVS Tags: source_automake_dev1_20080521, merge_head_20080521
Changes since 1.15.4.1: +3117 -2641 lines
- Update to automake 1.10
- Add libjpeg check
- Fix define names for libgd in code
1 #! /bin/sh
2 # Guess values for system-dependent variables and create Makefiles.
3 # Generated by GNU Autoconf 2.61 for cvsgraph 1.7.0.
4 #
5 # Report bugs to <[email protected]>.
6 #
7 # Copyright (C) 1992, 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2001,
8 # 2002, 2003, 2004, 2005, 2006 Free Software Foundation, Inc.
9 # This configure script is free software; the Free Software Foundation
10 # gives unlimited permission to copy, distribute and modify it.
11 ## --------------------- ##
12 ## M4sh Initialization. ##
13 ## --------------------- ##
14
15 # Be more Bourne compatible
16 DUALCASE=1; export DUALCASE # for MKS sh
17 if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then
18 emulate sh
19 NULLCMD=:
20 # Zsh 3.x and 4.x performs word splitting on ${1+"$@"}, which
21 # is contrary to our usage. Disable this feature.
22 alias -g '${1+"$@"}'='"$@"'
23 setopt NO_GLOB_SUBST
24 else
25 case `(set -o) 2>/dev/null` in
26 *posix*) set -o posix ;;
27 esac
28
29 fi
30
31
32
33
34 # PATH needs CR
35 # Avoid depending upon Character Ranges.
36 as_cr_letters='abcdefghijklmnopqrstuvwxyz'
37 as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
38 as_cr_Letters=$as_cr_letters$as_cr_LETTERS
39 as_cr_digits='0123456789'
40 as_cr_alnum=$as_cr_Letters$as_cr_digits
41
42 # The user is always right.
43 if test "${PATH_SEPARATOR+set}" != set; then
44 echo "#! /bin/sh" >conf$$.sh
45 echo "exit 0" >>conf$$.sh
46 chmod +x conf$$.sh
47 if (PATH="/nonexistent;."; conf$$.sh) >/dev/null 2>&1; then
48 PATH_SEPARATOR=';'
49 else
50 PATH_SEPARATOR=:
51 fi
52 rm -f conf$$.sh
53 fi
54
55 # Support unset when possible.
56 if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then
57 as_unset=unset
58 else
59 as_unset=false
60 fi
61
62
63 # IFS
64 # We need space, tab and new line, in precisely that order. Quoting is
65 # there to prevent editors from complaining about space-tab.
66 # (If _AS_PATH_WALK were called with IFS unset, it would disable word
67 # splitting by setting IFS to empty value.)
68 as_nl='
69 '
70 IFS=" "" $as_nl"
71
72 # Find who we are. Look in the path if we contain no directory separator.
73 case $0 in
74 *[\\/]* ) as_myself=$0 ;;
75 *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
76 for as_dir in $PATH
77 do
78 IFS=$as_save_IFS
79 test -z "$as_dir" && as_dir=.
80 test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
81 done
82 IFS=$as_save_IFS
83
84 ;;
85 esac
86 # We did not find ourselves, most probably we were run as `sh COMMAND'
87 # in which case we are not to be found in the path.
88 if test "x$as_myself" = x; then
89 as_myself=$0
90 fi
91 if test ! -f "$as_myself"; then
92 echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
93 { (exit 1); exit 1; }
94 fi
95
96 # Work around bugs in pre-3.0 UWIN ksh.
97 for as_var in ENV MAIL MAILPATH
98 do ($as_unset $as_var) >/dev/null 2>&1 && $as_unset $as_var
99 done
100 PS1='$ '
101 PS2='> '
102 PS4='+ '
103
104 # NLS nuisances.
105 for as_var in \
106 LANG LANGUAGE LC_ADDRESS LC_ALL LC_COLLATE LC_CTYPE LC_IDENTIFICATION \
107 LC_MEASUREMENT LC_MESSAGES LC_MONETARY LC_NAME LC_NUMERIC LC_PAPER \
108 LC_TELEPHONE LC_TIME
109 do
110 if (set +x; test -z "`(eval $as_var=C; export $as_var) 2>&1`"); then
111 eval $as_var=C; export $as_var
112 else
113 ($as_unset $as_var) >/dev/null 2>&1 && $as_unset $as_var
114 fi
115 done
116
117 # Required to use basename.
118 if expr a : '\(a\)' >/dev/null 2>&1 &&
119 test "X`expr 00001 : '.*\(...\)'`" = X001; then
120 as_expr=expr
121 else
122 as_expr=false
123 fi
124
125 if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
126 as_basename=basename
127 else
128 as_basename=false
129 fi
130
131
132 # Name of the executable.
133 as_me=`$as_basename -- "$0" ||
134 $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
135 X"$0" : 'X\(//\)$' \| \
136 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
137 echo X/"$0" |
138 sed '/^.*\/\([^/][^/]*\)\/*$/{
139 s//\1/
140 q
141 }
142 /^X\/\(\/\/\)$/{
143 s//\1/
144 q
145 }
146 /^X\/\(\/\).*/{
147 s//\1/
148 q
149 }
150 s/.*/./; q'`
151
152 # CDPATH.
153 $as_unset CDPATH
154
155
156 if test "x$CONFIG_SHELL" = x; then
157 if (eval ":") 2>/dev/null; then
158 as_have_required=yes
159 else
160 as_have_required=no
161 fi
162
163 if test $as_have_required = yes && (eval ":
164 (as_func_return () {
165 (exit \$1)
166 }
167 as_func_success () {
168 as_func_return 0
169 }
170 as_func_failure () {
171 as_func_return 1
172 }
173 as_func_ret_success () {
174 return 0
175 }
176 as_func_ret_failure () {
177 return 1
178 }
179
180 exitcode=0
181 if as_func_success; then
182 :
183 else
184 exitcode=1
185 echo as_func_success failed.
186 fi
187
188 if as_func_failure; then
189 exitcode=1
190 echo as_func_failure succeeded.
191 fi
192
193 if as_func_ret_success; then
194 :
195 else
196 exitcode=1
197 echo as_func_ret_success failed.
198 fi
199
200 if as_func_ret_failure; then
201 exitcode=1
202 echo as_func_ret_failure succeeded.
203 fi
204
205 if ( set x; as_func_ret_success y && test x = \"\$1\" ); then
206 :
207 else
208 exitcode=1
209 echo positional parameters were not saved.
210 fi
211
212 test \$exitcode = 0) || { (exit 1); exit 1; }
213
214 (
215 as_lineno_1=\$LINENO
216 as_lineno_2=\$LINENO
217 test \"x\$as_lineno_1\" != \"x\$as_lineno_2\" &&
218 test \"x\`expr \$as_lineno_1 + 1\`\" = \"x\$as_lineno_2\") || { (exit 1); exit 1; }
219 ") 2> /dev/null; then
220 :
221 else
222 as_candidate_shells=
223 as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
224 for as_dir in /bin$PATH_SEPARATOR/usr/bin$PATH_SEPARATOR$PATH
225 do
226 IFS=$as_save_IFS
227 test -z "$as_dir" && as_dir=.
228 case $as_dir in
229 /*)
230 for as_base in sh bash ksh sh5; do
231 as_candidate_shells="$as_candidate_shells $as_dir/$as_base"
232 done;;
233 esac
234 done
235 IFS=$as_save_IFS
236
237
238 for as_shell in $as_candidate_shells $SHELL; do
239 # Try only shells that exist, to save several forks.
240 if { test -f "$as_shell" || test -f "$as_shell.exe"; } &&
241 { ("$as_shell") 2> /dev/null <<\_ASEOF
242 if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then
243 emulate sh
244 NULLCMD=:
245 # Zsh 3.x and 4.x performs word splitting on ${1+"$@"}, which
246 # is contrary to our usage. Disable this feature.
247 alias -g '${1+"$@"}'='"$@"'
248 setopt NO_GLOB_SUBST
249 else
250 case `(set -o) 2>/dev/null` in
251 *posix*) set -o posix ;;
252 esac
253
254 fi
255
256
257 :
258 _ASEOF
259 }; then
260 CONFIG_SHELL=$as_shell
261 as_have_required=yes
262 if { "$as_shell" 2> /dev/null <<\_ASEOF
263 if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then
264 emulate sh
265 NULLCMD=:
266 # Zsh 3.x and 4.x performs word splitting on ${1+"$@"}, which
267 # is contrary to our usage. Disable this feature.
268 alias -g '${1+"$@"}'='"$@"'
269 setopt NO_GLOB_SUBST
270 else
271 case `(set -o) 2>/dev/null` in
272 *posix*) set -o posix ;;
273 esac
274
275 fi
276
277
278 :
279 (as_func_return () {
280 (exit $1)
281 }
282 as_func_success () {
283 as_func_return 0
284 }
285 as_func_failure () {
286 as_func_return 1
287 }
288 as_func_ret_success () {
289 return 0
290 }
291 as_func_ret_failure () {
292 return 1
293 }
294
295 exitcode=0
296 if as_func_success; then
297 :
298 else
299 exitcode=1
300 echo as_func_success failed.
301 fi
302
303 if as_func_failure; then
304 exitcode=1
305 echo as_func_failure succeeded.
306 fi
307
308 if as_func_ret_success; then
309 :
310 else
311 exitcode=1
312 echo as_func_ret_success failed.
313 fi
314
315 if as_func_ret_failure; then
316 exitcode=1
317 echo as_func_ret_failure succeeded.
318 fi
319
320 if ( set x; as_func_ret_success y && test x = "$1" ); then
321 :
322 else
323 exitcode=1
324 echo positional parameters were not saved.
325 fi
326
327 test $exitcode = 0) || { (exit 1); exit 1; }
328
329 (
330 as_lineno_1=$LINENO
331 as_lineno_2=$LINENO
332 test "x$as_lineno_1" != "x$as_lineno_2" &&
333 test "x`expr $as_lineno_1 + 1`" = "x$as_lineno_2") || { (exit 1); exit 1; }
334
335 _ASEOF
336 }; then
337 break
338 fi
339
340 fi
341
342 done
343
344 if test "x$CONFIG_SHELL" != x; then
345 for as_var in BASH_ENV ENV
346 do ($as_unset $as_var) >/dev/null 2>&1 && $as_unset $as_var
347 done
348 export CONFIG_SHELL
349 exec "$CONFIG_SHELL" "$as_myself" ${1+"$@"}
350 fi
351
352
353 if test $as_have_required = no; then
354 echo This script requires a shell more modern than all the
355 echo shells that I found on your system. Please install a
356 echo modern shell, or manually run the script under such a
357 echo shell if you do have one.
358 { (exit 1); exit 1; }
359 fi
360
361
362 fi
363
364 fi
365
366
367
368 (eval "as_func_return () {
369 (exit \$1)
370 }
371 as_func_success () {
372 as_func_return 0
373 }
374 as_func_failure () {
375 as_func_return 1
376 }
377 as_func_ret_success () {
378 return 0
379 }
380 as_func_ret_failure () {
381 return 1
382 }
383
384 exitcode=0
385 if as_func_success; then
386 :
387 else
388 exitcode=1
389 echo as_func_success failed.
390 fi
391
392 if as_func_failure; then
393 exitcode=1
394 echo as_func_failure succeeded.
395 fi
396
397 if as_func_ret_success; then
398 :
399 else
400 exitcode=1
401 echo as_func_ret_success failed.
402 fi
403
404 if as_func_ret_failure; then
405 exitcode=1
406 echo as_func_ret_failure succeeded.
407 fi
408
409 if ( set x; as_func_ret_success y && test x = \"\$1\" ); then
410 :
411 else
412 exitcode=1
413 echo positional parameters were not saved.
414 fi
415
416 test \$exitcode = 0") || {
417 echo No shell found that supports shell functions.
418 echo Please tell [email protected] about your system,
419 echo including any error possibly output before this
420 echo message
421 }
422
423
424
425 as_lineno_1=$LINENO
426 as_lineno_2=$LINENO
427 test "x$as_lineno_1" != "x$as_lineno_2" &&
428 test "x`expr $as_lineno_1 + 1`" = "x$as_lineno_2" || {
429
430 # Create $as_me.lineno as a copy of $as_myself, but with $LINENO
431 # uniformly replaced by the line number. The first 'sed' inserts a
432 # line-number line after each line using $LINENO; the second 'sed'
433 # does the real work. The second script uses 'N' to pair each
434 # line-number line with the line containing $LINENO, and appends
435 # trailing '-' during substitution so that $LINENO is not a special
436 # case at line end.
437 # (Raja R Harinath suggested sed '=', and Paul Eggert wrote the
438 # scripts with optimization help from Paolo Bonzini. Blame Lee
439 # E. McMahon (1931-1989) for sed's syntax. :-)
440 sed -n '
441 p
442 /[$]LINENO/=
443 ' <$as_myself |
444 sed '
445 s/[$]LINENO.*/&-/
446 t lineno
447 b
448 :lineno
449 N
450 :loop
451 s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/
452 t loop
453 s/-\n.*//
454 ' >$as_me.lineno &&
455 chmod +x "$as_me.lineno" ||
456 { echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2
457 { (exit 1); exit 1; }; }
458
459 # Don't try to exec as it changes $[0], causing all sort of problems
460 # (the dirname of $[0] is not the place where we might find the
461 # original and so on. Autoconf is especially sensitive to this).
462 . "./$as_me.lineno"
463 # Exit status is that of the last command.
464 exit
465 }
466
467
468 if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
469 as_dirname=dirname
470 else
471 as_dirname=false
472 fi
473
474 ECHO_C= ECHO_N= ECHO_T=
475 case `echo -n x` in
476 -n*)
477 case `echo 'x\c'` in
478 *c*) ECHO_T=' ';; # ECHO_T is single tab character.
479 *) ECHO_C='\c';;
480 esac;;
481 *)
482 ECHO_N='-n';;
483 esac
484
485 if expr a : '\(a\)' >/dev/null 2>&1 &&
486 test "X`expr 00001 : '.*\(...\)'`" = X001; then
487 as_expr=expr
488 else
489 as_expr=false
490 fi
491
492 rm -f conf$$ conf$$.exe conf$$.file
493 if test -d conf$$.dir; then
494 rm -f conf$$.dir/conf$$.file
495 else
496 rm -f conf$$.dir
497 mkdir conf$$.dir
498 fi
499 echo >conf$$.file
500 if ln -s conf$$.file conf$$ 2>/dev/null; then
501 as_ln_s='ln -s'
502 # ... but there are two gotchas:
503 # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
504 # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
505 # In both cases, we have to default to `cp -p'.
506 ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
507 as_ln_s='cp -p'
508 elif ln conf$$.file conf$$ 2>/dev/null; then
509 as_ln_s=ln
510 else
511 as_ln_s='cp -p'
512 fi
513 rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
514 rmdir conf$$.dir 2>/dev/null
515
516 if mkdir -p . 2>/dev/null; then
517 as_mkdir_p=:
518 else
519 test -d ./-p && rmdir ./-p
520 as_mkdir_p=false
521 fi
522
523 if test -x / >/dev/null 2>&1; then
524 as_test_x='test -x'
525 else
526 if ls -dL / >/dev/null 2>&1; then
527 as_ls_L_option=L
528 else
529 as_ls_L_option=
530 fi
531 as_test_x='
532 eval sh -c '\''
533 if test -d "$1"; then
534 test -d "$1/.";
535 else
536 case $1 in
537 -*)set "./$1";;
538 esac;
539 case `ls -ld'$as_ls_L_option' "$1" 2>/dev/null` in
540 ???[sx]*):;;*)false;;esac;fi
541 '\'' sh
542 '
543 fi
544 as_executable_p=$as_test_x
545
546 # Sed expression to map a string onto a valid CPP name.
547 as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
548
549 # Sed expression to map a string onto a valid variable name.
550 as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
551
552
553
554 exec 7<&0 </dev/null 6>&1
555
556 # Name of the host.
557 # hostname on some systems (SVR3.2, Linux) returns a bogus exit status,
558 # so uname gets run too.
559 ac_hostname=`(hostname || uname -n) 2>/dev/null | sed 1q`
560
561 #
562 # Initializations.
563 #
564 ac_default_prefix=/usr/local
565 ac_clean_files=
566 ac_config_libobj_dir=.
567 LIBOBJS=
568 cross_compiling=no
569 subdirs=
570 MFLAGS=
571 MAKEFLAGS=
572 SHELL=${CONFIG_SHELL-/bin/sh}
573
574 # Identity of this package.
575 PACKAGE_NAME='cvsgraph'
576 PACKAGE_TARNAME='cvsgraph'
577 PACKAGE_VERSION='1.7.0'
578 PACKAGE_STRING='cvsgraph 1.7.0'
579 PACKAGE_BUGREPORT='[email protected]'
580
581 ac_unique_file="README"
582 # Factoring default headers for most tests.
583 ac_includes_default="\
584 #include <stdio.h>
585 #ifdef HAVE_SYS_TYPES_H
586 # include <sys/types.h>
587 #endif
588 #ifdef HAVE_SYS_STAT_H
589 # include <sys/stat.h>
590 #endif
591 #ifdef STDC_HEADERS
592 # include <stdlib.h>
593 # include <stddef.h>
594 #else
595 # ifdef HAVE_STDLIB_H
596 # include <stdlib.h>
597 # endif
598 #endif
599 #ifdef HAVE_STRING_H
600 # if !defined STDC_HEADERS && defined HAVE_MEMORY_H
601 # include <memory.h>
602 # endif
603 # include <string.h>
604 #endif
605 #ifdef HAVE_STRINGS_H
606 # include <strings.h>
607 #endif
608 #ifdef HAVE_INTTYPES_H
609 # include <inttypes.h>
610 #endif
611 #ifdef HAVE_STDINT_H
612 # include <stdint.h>
613 #endif
614 #ifdef HAVE_UNISTD_H
615 # include <unistd.h>
616 #endif"
617
618 ac_subst_vars='SHELL
619 PATH_SEPARATOR
620 PACKAGE_NAME
621 PACKAGE_TARNAME
622 PACKAGE_VERSION
623 PACKAGE_STRING
624 PACKAGE_BUGREPORT
625 exec_prefix
626 prefix
627 program_transform_name
628 bindir
629 sbindir
630 libexecdir
631 datarootdir
632 datadir
633 sysconfdir
634 sharedstatedir
635 localstatedir
636 includedir
637 oldincludedir
638 docdir
639 infodir
640 htmldir
641 dvidir
642 pdfdir
643 psdir
644 libdir
645 localedir
646 mandir
647 DEFS
648 ECHO_C
649 ECHO_N
650 ECHO_T
651 LIBS
652 build_alias
653 host_alias
654 target_alias
655 INSTALL_PROGRAM
656 INSTALL_SCRIPT
657 INSTALL_DATA
658 am__isrc
659 CYGPATH_W
660 PACKAGE
661 VERSION
662 ACLOCAL
663 AUTOCONF
664 AUTOMAKE
665 AUTOHEADER
666 MAKEINFO
667 install_sh
668 STRIP
669 INSTALL_STRIP_PROGRAM
670 mkdir_p
671 AWK
672 SET_MAKE
673 am__leading_dot
674 AMTAR
675 am__tar
676 am__untar
677 CC
678 CFLAGS
679 LDFLAGS
680 CPPFLAGS
681 ac_ct_CC
682 EXEEXT
683 OBJEXT
684 DEPDIR
685 am__include
686 am__quote
687 AMDEP_TRUE
688 AMDEP_FALSE
689 AMDEPBACKSLASH
690 CCDEPMODE
691 am__fastdepCC_TRUE
692 am__fastdepCC_FALSE
693 LEX
694 LEX_OUTPUT_ROOT
695 LEXLIB
696 YACC
697 YFLAGS
698 ac_prog_pkg_config
699 GDLIB_CONFIG
700 GD_CFLAGS
701 GD_LDFLAGS
702 GD_LIBS
703 CPP
704 GREP
705 EGREP
706 LIBOBJS
707 LTLIBOBJS'
708 ac_subst_files=''
709 ac_precious_vars='build_alias
710 host_alias
711 target_alias
712 CC
713 CFLAGS
714 LDFLAGS
715 LIBS
716 CPPFLAGS
717 YACC
718 YFLAGS
719 CPP'
720
721
722 # Initialize some variables set by options.
723 ac_init_help=
724 ac_init_version=false
725 # The variables have the same names as the options, with
726 # dashes changed to underlines.
727 cache_file=/dev/null
728 exec_prefix=NONE
729 no_create=
730 no_recursion=
731 prefix=NONE
732 program_prefix=NONE
733 program_suffix=NONE
734 program_transform_name=s,x,x,
735 silent=
736 site=
737 srcdir=
738 verbose=
739 x_includes=NONE
740 x_libraries=NONE
741
742 # Installation directory options.
743 # These are left unexpanded so users can "make install exec_prefix=/foo"
744 # and all the variables that are supposed to be based on exec_prefix
745 # by default will actually change.
746 # Use braces instead of parens because sh, perl, etc. also accept them.
747 # (The list follows the same order as the GNU Coding Standards.)
748 bindir='${exec_prefix}/bin'
749 sbindir='${exec_prefix}/sbin'
750 libexecdir='${exec_prefix}/libexec'
751 datarootdir='${prefix}/share'
752 datadir='${datarootdir}'
753 sysconfdir='${prefix}/etc'
754 sharedstatedir='${prefix}/com'
755 localstatedir='${prefix}/var'
756 includedir='${prefix}/include'
757 oldincludedir='/usr/include'
758 docdir='${datarootdir}/doc/${PACKAGE_TARNAME}'
759 infodir='${datarootdir}/info'
760 htmldir='${docdir}'
761 dvidir='${docdir}'
762 pdfdir='${docdir}'
763 psdir='${docdir}'
764 libdir='${exec_prefix}/lib'
765 localedir='${datarootdir}/locale'
766 mandir='${datarootdir}/man'
767
768 ac_prev=
769 ac_dashdash=
770 for ac_option
771 do
772 # If the previous option needs an argument, assign it.
773 if test -n "$ac_prev"; then
774 eval $ac_prev=\$ac_option
775 ac_prev=
776 continue
777 fi
778
779 case $ac_option in
780 *=*) ac_optarg=`expr "X$ac_option" : '[^=]*=\(.*\)'` ;;
781 *) ac_optarg=yes ;;
782 esac
783
784 # Accept the important Cygnus configure options, so we can diagnose typos.
785
786 case $ac_dashdash$ac_option in
787 --)
788 ac_dashdash=yes ;;
789
790 -bindir | --bindir | --bindi | --bind | --bin | --bi)
791 ac_prev=bindir ;;
792 -bindir=* | --bindir=* | --bindi=* | --bind=* | --bin=* | --bi=*)
793 bindir=$ac_optarg ;;
794
795 -build | --build | --buil | --bui | --bu)
796 ac_prev=build_alias ;;
797 -build=* | --build=* | --buil=* | --bui=* | --bu=*)
798 build_alias=$ac_optarg ;;
799
800 -cache-file | --cache-file | --cache-fil | --cache-fi \
801 | --cache-f | --cache- | --cache | --cach | --cac | --ca | --c)
802 ac_prev=cache_file ;;
803 -cache-file=* | --cache-file=* | --cache-fil=* | --cache-fi=* \
804 | --cache-f=* | --cache-=* | --cache=* | --cach=* | --cac=* | --ca=* | --c=*)
805 cache_file=$ac_optarg ;;
806
807 --config-cache | -C)
808 cache_file=config.cache ;;
809
810 -datadir | --datadir | --datadi | --datad)
811 ac_prev=datadir ;;
812 -datadir=* | --datadir=* | --datadi=* | --datad=*)
813 datadir=$ac_optarg ;;
814
815 -datarootdir | --datarootdir | --datarootdi | --datarootd | --dataroot \
816 | --dataroo | --dataro | --datar)
817 ac_prev=datarootdir ;;
818 -datarootdir=* | --datarootdir=* | --datarootdi=* | --datarootd=* \
819 | --dataroot=* | --dataroo=* | --dataro=* | --datar=*)
820 datarootdir=$ac_optarg ;;
821
822 -disable-* | --disable-*)
823 ac_feature=`expr "x$ac_option" : 'x-*disable-\(.*\)'`
824 # Reject names that are not valid shell variable names.
825 expr "x$ac_feature" : ".*[^-._$as_cr_alnum]" >/dev/null &&
826 { echo "$as_me: error: invalid feature name: $ac_feature" >&2
827 { (exit 1); exit 1; }; }
828 ac_feature=`echo $ac_feature | sed 's/[-.]/_/g'`
829 eval enable_$ac_feature=no ;;
830
831 -docdir | --docdir | --docdi | --doc | --do)
832 ac_prev=docdir ;;
833 -docdir=* | --docdir=* | --docdi=* | --doc=* | --do=*)
834 docdir=$ac_optarg ;;
835
836 -dvidir | --dvidir | --dvidi | --dvid | --dvi | --dv)
837 ac_prev=dvidir ;;
838 -dvidir=* | --dvidir=* | --dvidi=* | --dvid=* | --dvi=* | --dv=*)
839 dvidir=$ac_optarg ;;
840
841 -enable-* | --enable-*)
842 ac_feature=`expr "x$ac_option" : 'x-*enable-\([^=]*\)'`
843 # Reject names that are not valid shell variable names.
844 expr "x$ac_feature" : ".*[^-._$as_cr_alnum]" >/dev/null &&
845 { echo "$as_me: error: invalid feature name: $ac_feature" >&2
846 { (exit 1); exit 1; }; }
847 ac_feature=`echo $ac_feature | sed 's/[-.]/_/g'`
848 eval enable_$ac_feature=\$ac_optarg ;;
849
850 -exec-prefix | --exec_prefix | --exec-prefix | --exec-prefi \
851 | --exec-pref | --exec-pre | --exec-pr | --exec-p | --exec- \
852 | --exec | --exe | --ex)
853 ac_prev=exec_prefix ;;
854 -exec-prefix=* | --exec_prefix=* | --exec-prefix=* | --exec-prefi=* \
855 | --exec-pref=* | --exec-pre=* | --exec-pr=* | --exec-p=* | --exec-=* \
856 | --exec=* | --exe=* | --ex=*)
857 exec_prefix=$ac_optarg ;;
858
859 -gas | --gas | --ga | --g)
860 # Obsolete; use --with-gas.
861 with_gas=yes ;;
862
863 -help | --help | --hel | --he | -h)
864 ac_init_help=long ;;
865 -help=r* | --help=r* | --hel=r* | --he=r* | -hr*)
866 ac_init_help=recursive ;;
867 -help=s* | --help=s* | --hel=s* | --he=s* | -hs*)
868 ac_init_help=short ;;
869
870 -host | --host | --hos | --ho)
871 ac_prev=host_alias ;;
872 -host=* | --host=* | --hos=* | --ho=*)
873 host_alias=$ac_optarg ;;
874
875 -htmldir | --htmldir | --htmldi | --htmld | --html | --htm | --ht)
876 ac_prev=htmldir ;;
877 -htmldir=* | --htmldir=* | --htmldi=* | --htmld=* | --html=* | --htm=* \
878 | --ht=*)
879 htmldir=$ac_optarg ;;
880
881 -includedir | --includedir | --includedi | --included | --include \
882 | --includ | --inclu | --incl | --inc)
883 ac_prev=includedir ;;
884 -includedir=* | --includedir=* | --includedi=* | --included=* | --include=* \
885 | --includ=* | --inclu=* | --incl=* | --inc=*)
886 includedir=$ac_optarg ;;
887
888 -infodir | --infodir | --infodi | --infod | --info | --inf)
889 ac_prev=infodir ;;
890 -infodir=* | --infodir=* | --infodi=* | --infod=* | --info=* | --inf=*)
891 infodir=$ac_optarg ;;
892
893 -libdir | --libdir | --libdi | --libd)
894 ac_prev=libdir ;;
895 -libdir=* | --libdir=* | --libdi=* | --libd=*)
896 libdir=$ac_optarg ;;
897
898 -libexecdir | --libexecdir | --libexecdi | --libexecd | --libexec \
899 | --libexe | --libex | --libe)
900 ac_prev=libexecdir ;;
901 -libexecdir=* | --libexecdir=* | --libexecdi=* | --libexecd=* | --libexec=* \
902 | --libexe=* | --libex=* | --libe=*)
903 libexecdir=$ac_optarg ;;
904
905 -localedir | --localedir | --localedi | --localed | --locale)
906 ac_prev=localedir ;;
907 -localedir=* | --localedir=* | --localedi=* | --localed=* | --locale=*)
908 localedir=$ac_optarg ;;
909
910 -localstatedir | --localstatedir | --localstatedi | --localstated \
911 | --localstate | --localstat | --localsta | --localst | --locals)
912 ac_prev=localstatedir ;;
913 -localstatedir=* | --localstatedir=* | --localstatedi=* | --localstated=* \
914 | --localstate=* | --localstat=* | --localsta=* | --localst=* | --locals=*)
915 localstatedir=$ac_optarg ;;
916
917 -mandir | --mandir | --mandi | --mand | --man | --ma | --m)
918 ac_prev=mandir ;;
919 -mandir=* | --mandir=* | --mandi=* | --mand=* | --man=* | --ma=* | --m=*)
920 mandir=$ac_optarg ;;
921
922 -nfp | --nfp | --nf)
923 # Obsolete; use --without-fp.
924 with_fp=no ;;
925
926 -no-create | --no-create | --no-creat | --no-crea | --no-cre \
927 | --no-cr | --no-c | -n)
928 no_create=yes ;;
929
930 -no-recursion | --no-recursion | --no-recursio | --no-recursi \
931 | --no-recurs | --no-recur | --no-recu | --no-rec | --no-re | --no-r)
932 no_recursion=yes ;;
933
934 -oldincludedir | --oldincludedir | --oldincludedi | --oldincluded \
935 | --oldinclude | --oldinclud | --oldinclu | --oldincl | --oldinc \
936 | --oldin | --oldi | --old | --ol | --o)
937 ac_prev=oldincludedir ;;
938 -oldincludedir=* | --oldincludedir=* | --oldincludedi=* | --oldincluded=* \
939 | --oldinclude=* | --oldinclud=* | --oldinclu=* | --oldincl=* | --oldinc=* \
940 | --oldin=* | --oldi=* | --old=* | --ol=* | --o=*)
941 oldincludedir=$ac_optarg ;;
942
943 -prefix | --prefix | --prefi | --pref | --pre | --pr | --p)
944 ac_prev=prefix ;;
945 -prefix=* | --prefix=* | --prefi=* | --pref=* | --pre=* | --pr=* | --p=*)
946 prefix=$ac_optarg ;;
947
948 -program-prefix | --program-prefix | --program-prefi | --program-pref \
949 | --program-pre | --program-pr | --program-p)
950 ac_prev=program_prefix ;;
951 -program-prefix=* | --program-prefix=* | --program-prefi=* \
952 | --program-pref=* | --program-pre=* | --program-pr=* | --program-p=*)
953 program_prefix=$ac_optarg ;;
954
955 -program-suffix | --program-suffix | --program-suffi | --program-suff \
956 | --program-suf | --program-su | --program-s)
957 ac_prev=program_suffix ;;
958 -program-suffix=* | --program-suffix=* | --program-suffi=* \
959 | --program-suff=* | --program-suf=* | --program-su=* | --program-s=*)
960 program_suffix=$ac_optarg ;;
961
962 -program-transform-name | --program-transform-name \
963 | --program-transform-nam | --program-transform-na \
964 | --program-transform-n | --program-transform- \
965 | --program-transform | --program-transfor \
966 | --program-transfo | --program-transf \
967 | --program-trans | --program-tran \
968 | --progr-tra | --program-tr | --program-t)
969 ac_prev=program_transform_name ;;
970 -program-transform-name=* | --program-transform-name=* \
971 | --program-transform-nam=* | --program-transform-na=* \
972 | --program-transform-n=* | --program-transform-=* \
973 | --program-transform=* | --program-transfor=* \
974 | --program-transfo=* | --program-transf=* \
975 | --program-trans=* | --program-tran=* \
976 | --progr-tra=* | --program-tr=* | --program-t=*)
977 program_transform_name=$ac_optarg ;;
978
979 -pdfdir | --pdfdir | --pdfdi | --pdfd | --pdf | --pd)
980 ac_prev=pdfdir ;;
981 -pdfdir=* | --pdfdir=* | --pdfdi=* | --pdfd=* | --pdf=* | --pd=*)
982 pdfdir=$ac_optarg ;;
983
984 -psdir | --psdir | --psdi | --psd | --ps)
985 ac_prev=psdir ;;
986 -psdir=* | --psdir=* | --psdi=* | --psd=* | --ps=*)
987 psdir=$ac_optarg ;;
988
989 -q | -quiet | --quiet | --quie | --qui | --qu | --q \
990 | -silent | --silent | --silen | --sile | --sil)
991 silent=yes ;;
992
993 -sbindir | --sbindir | --sbindi | --sbind | --sbin | --sbi | --sb)
994 ac_prev=sbindir ;;
995 -sbindir=* | --sbindir=* | --sbindi=* | --sbind=* | --sbin=* \
996 | --sbi=* | --sb=*)
997 sbindir=$ac_optarg ;;
998
999 -sharedstatedir | --sharedstatedir | --sharedstatedi \
1000 | --sharedstated | --sharedstate | --sharedstat | --sharedsta \
1001 | --sharedst | --shareds | --shared | --share | --shar \
1002 | --sha | --sh)
1003 ac_prev=sharedstatedir ;;
1004 -sharedstatedir=* | --sharedstatedir=* | --sharedstatedi=* \
1005 | --sharedstated=* | --sharedstate=* | --sharedstat=* | --sharedsta=* \
1006 | --sharedst=* | --shareds=* | --shared=* | --share=* | --shar=* \
1007 | --sha=* | --sh=*)
1008 sharedstatedir=$ac_optarg ;;
1009
1010 -site | --site | --sit)
1011 ac_prev=site ;;
1012 -site=* | --site=* | --sit=*)
1013 site=$ac_optarg ;;
1014
1015 -srcdir | --srcdir | --srcdi | --srcd | --src | --sr)
1016 ac_prev=srcdir ;;
1017 -srcdir=* | --srcdir=* | --srcdi=* | --srcd=* | --src=* | --sr=*)
1018 srcdir=$ac_optarg ;;
1019
1020 -sysconfdir | --sysconfdir | --sysconfdi | --sysconfd | --sysconf \
1021 | --syscon | --sysco | --sysc | --sys | --sy)
1022 ac_prev=sysconfdir ;;
1023 -sysconfdir=* | --sysconfdir=* | --sysconfdi=* | --sysconfd=* | --sysconf=* \
1024 | --syscon=* | --sysco=* | --sysc=* | --sys=* | --sy=*)
1025 sysconfdir=$ac_optarg ;;
1026
1027 -target | --target | --targe | --targ | --tar | --ta | --t)
1028 ac_prev=target_alias ;;
1029 -target=* | --target=* | --targe=* | --targ=* | --tar=* | --ta=* | --t=*)
1030 target_alias=$ac_optarg ;;
1031
1032 -v | -verbose | --verbose | --verbos | --verbo | --verb)
1033 verbose=yes ;;
1034
1035 -version | --version | --versio | --versi | --vers | -V)
1036 ac_init_version=: ;;
1037
1038 -with-* | --with-*)
1039 ac_package=`expr "x$ac_option" : 'x-*with-\([^=]*\)'`
1040 # Reject names that are not valid shell variable names.
1041 expr "x$ac_package" : ".*[^-._$as_cr_alnum]" >/dev/null &&
1042 { echo "$as_me: error: invalid package name: $ac_package" >&2
1043 { (exit 1); exit 1; }; }
1044 ac_package=`echo $ac_package | sed 's/[-.]/_/g'`
1045 eval with_$ac_package=\$ac_optarg ;;
1046
1047 -without-* | --without-*)
1048 ac_package=`expr "x$ac_option" : 'x-*without-\(.*\)'`
1049 # Reject names that are not valid shell variable names.
1050 expr "x$ac_package" : ".*[^-._$as_cr_alnum]" >/dev/null &&
1051 { echo "$as_me: error: invalid package name: $ac_package" >&2
1052 { (exit 1); exit 1; }; }
1053 ac_package=`echo $ac_package | sed 's/[-.]/_/g'`
1054 eval with_$ac_package=no ;;
1055
1056 --x)
1057 # Obsolete; use --with-x.
1058 with_x=yes ;;
1059
1060 -x-includes | --x-includes | --x-include | --x-includ | --x-inclu \
1061 | --x-incl | --x-inc | --x-in | --x-i)
1062 ac_prev=x_includes ;;
1063 -x-includes=* | --x-includes=* | --x-include=* | --x-includ=* | --x-inclu=* \
1064 | --x-incl=* | --x-inc=* | --x-in=* | --x-i=*)
1065 x_includes=$ac_optarg ;;
1066
1067 -x-libraries | --x-libraries | --x-librarie | --x-librari \
1068 | --x-librar | --x-libra | --x-libr | --x-lib | --x-li | --x-l)
1069 ac_prev=x_libraries ;;
1070 -x-libraries=* | --x-libraries=* | --x-librarie=* | --x-librari=* \
1071 | --x-librar=* | --x-libra=* | --x-libr=* | --x-lib=* | --x-li=* | --x-l=*)
1072 x_libraries=$ac_optarg ;;
1073
1074 -*) { echo "$as_me: error: unrecognized option: $ac_option
1075 Try \`$0 --help' for more information." >&2
1076 { (exit 1); exit 1; }; }
1077 ;;
1078
1079 *=*)
1080 ac_envvar=`expr "x$ac_option" : 'x\([^=]*\)='`
1081 # Reject names that are not valid shell variable names.
1082 expr "x$ac_envvar" : ".*[^_$as_cr_alnum]" >/dev/null &&
1083 { echo "$as_me: error: invalid variable name: $ac_envvar" >&2
1084 { (exit 1); exit 1; }; }
1085 eval $ac_envvar=\$ac_optarg
1086 export $ac_envvar ;;
1087
1088 *)
1089 # FIXME: should be removed in autoconf 3.0.
1090 echo "$as_me: WARNING: you should use --build, --host, --target" >&2
1091 expr "x$ac_option" : ".*[^-._$as_cr_alnum]" >/dev/null &&
1092 echo "$as_me: WARNING: invalid host type: $ac_option" >&2
1093 : ${build_alias=$ac_option} ${host_alias=$ac_option} ${target_alias=$ac_option}
1094 ;;
1095
1096 esac
1097 done
1098
1099 if test -n "$ac_prev"; then
1100 ac_option=--`echo $ac_prev | sed 's/_/-/g'`
1101 { echo "$as_me: error: missing argument to $ac_option" >&2
1102 { (exit 1); exit 1; }; }
1103 fi
1104
1105 # Be sure to have absolute directory names.
1106 for ac_var in exec_prefix prefix bindir sbindir libexecdir datarootdir \
1107 datadir sysconfdir sharedstatedir localstatedir includedir \
1108 oldincludedir docdir infodir htmldir dvidir pdfdir psdir \
1109 libdir localedir mandir
1110 do
1111 eval ac_val=\$$ac_var
1112 case $ac_val in
1113 [\\/$]* | ?:[\\/]* ) continue;;
1114 NONE | '' ) case $ac_var in *prefix ) continue;; esac;;
1115 esac
1116 { echo "$as_me: error: expected an absolute directory name for --$ac_var: $ac_val" >&2
1117 { (exit 1); exit 1; }; }
1118 done
1119
1120 # There might be people who depend on the old broken behavior: `$host'
1121 # used to hold the argument of --host etc.
1122 # FIXME: To remove some day.
1123 build=$build_alias
1124 host=$host_alias
1125 target=$target_alias
1126
1127 # FIXME: To remove some day.
1128 if test "x$host_alias" != x; then
1129 if test "x$build_alias" = x; then
1130 cross_compiling=maybe
1131 echo "$as_me: WARNING: If you wanted to set the --build type, don't use --host.
1132 If a cross compiler is detected then cross compile mode will be used." >&2
1133 elif test "x$build_alias" != "x$host_alias"; then
1134 cross_compiling=yes
1135 fi
1136 fi
1137
1138 ac_tool_prefix=
1139 test -n "$host_alias" && ac_tool_prefix=$host_alias-
1140
1141 test "$silent" = yes && exec 6>/dev/null
1142
1143
1144 ac_pwd=`pwd` && test -n "$ac_pwd" &&
1145 ac_ls_di=`ls -di .` &&
1146 ac_pwd_ls_di=`cd "$ac_pwd" && ls -di .` ||
1147 { echo "$as_me: error: Working directory cannot be determined" >&2
1148 { (exit 1); exit 1; }; }
1149 test "X$ac_ls_di" = "X$ac_pwd_ls_di" ||
1150 { echo "$as_me: error: pwd does not report name of working directory" >&2
1151 { (exit 1); exit 1; }; }
1152
1153
1154 # Find the source files, if location was not specified.
1155 if test -z "$srcdir"; then
1156 ac_srcdir_defaulted=yes
1157 # Try the directory containing this script, then the parent directory.
1158 ac_confdir=`$as_dirname -- "$0" ||
1159 $as_expr X"$0" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
1160 X"$0" : 'X\(//\)[^/]' \| \
1161 X"$0" : 'X\(//\)$' \| \
1162 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
1163 echo X"$0" |
1164 sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
1165 s//\1/
1166 q
1167 }
1168 /^X\(\/\/\)[^/].*/{
1169 s//\1/
1170 q
1171 }
1172 /^X\(\/\/\)$/{
1173 s//\1/
1174 q
1175 }
1176 /^X\(\/\).*/{
1177 s//\1/
1178 q
1179 }
1180 s/.*/./; q'`
1181 srcdir=$ac_confdir
1182 if test ! -r "$srcdir/$ac_unique_file"; then
1183 srcdir=..
1184 fi
1185 else
1186 ac_srcdir_defaulted=no
1187 fi
1188 if test ! -r "$srcdir/$ac_unique_file"; then
1189 test "$ac_srcdir_defaulted" = yes && srcdir="$ac_confdir or .."
1190 { echo "$as_me: error: cannot find sources ($ac_unique_file) in $srcdir" >&2
1191 { (exit 1); exit 1; }; }
1192 fi
1193 ac_msg="sources are in $srcdir, but \`cd $srcdir' does not work"
1194 ac_abs_confdir=`(
1195 cd "$srcdir" && test -r "./$ac_unique_file" || { echo "$as_me: error: $ac_msg" >&2
1196 { (exit 1); exit 1; }; }
1197 pwd)`
1198 # When building in place, set srcdir=.
1199 if test "$ac_abs_confdir" = "$ac_pwd"; then
1200 srcdir=.
1201 fi
1202 # Remove unnecessary trailing slashes from srcdir.
1203 # Double slashes in file names in object file debugging info
1204 # mess up M-x gdb in Emacs.
1205 case $srcdir in
1206 */) srcdir=`expr "X$srcdir" : 'X\(.*[^/]\)' \| "X$srcdir" : 'X\(.*\)'`;;
1207 esac
1208 for ac_var in $ac_precious_vars; do
1209 eval ac_env_${ac_var}_set=\${${ac_var}+set}
1210 eval ac_env_${ac_var}_value=\$${ac_var}
1211 eval ac_cv_env_${ac_var}_set=\${${ac_var}+set}
1212 eval ac_cv_env_${ac_var}_value=\$${ac_var}
1213 done
1214
1215 #
1216 # Report the --help message.
1217 #
1218 if test "$ac_init_help" = "long"; then
1219 # Omit some internal or obsolete options to make the list less imposing.
1220 # This message is too long to be a string in the A/UX 3.1 sh.
1221 cat <<_ACEOF
1222 \`configure' configures cvsgraph 1.7.0 to adapt to many kinds of systems.
1223
1224 Usage: $0 [OPTION]... [VAR=VALUE]...
1225
1226 To assign environment variables (e.g., CC, CFLAGS...), specify them as
1227 VAR=VALUE. See below for descriptions of some of the useful variables.
1228
1229 Defaults for the options are specified in brackets.
1230
1231 Configuration:
1232 -h, --help display this help and exit
1233 --help=short display options specific to this package
1234 --help=recursive display the short help of all the included packages
1235 -V, --version display version information and exit
1236 -q, --quiet, --silent do not print \`checking...' messages
1237 --cache-file=FILE cache test results in FILE [disabled]
1238 -C, --config-cache alias for \`--cache-file=config.cache'
1239 -n, --no-create do not create output files
1240 --srcdir=DIR find the sources in DIR [configure dir or \`..']
1241
1242 Installation directories:
1243 --prefix=PREFIX install architecture-independent files in PREFIX
1244 [$ac_default_prefix]
1245 --exec-prefix=EPREFIX install architecture-dependent files in EPREFIX
1246 [PREFIX]
1247
1248 By default, \`make install' will install all the files in
1249 \`$ac_default_prefix/bin', \`$ac_default_prefix/lib' etc. You can specify
1250 an installation prefix other than \`$ac_default_prefix' using \`--prefix',
1251 for instance \`--prefix=\$HOME'.
1252
1253 For better control, use the options below.
1254
1255 Fine tuning of the installation directories:
1256 --bindir=DIR user executables [EPREFIX/bin]
1257 --sbindir=DIR system admin executables [EPREFIX/sbin]
1258 --libexecdir=DIR program executables [EPREFIX/libexec]
1259 --sysconfdir=DIR read-only single-machine data [PREFIX/etc]
1260 --sharedstatedir=DIR modifiable architecture-independent data [PREFIX/com]
1261 --localstatedir=DIR modifiable single-machine data [PREFIX/var]
1262 --libdir=DIR object code libraries [EPREFIX/lib]
1263 --includedir=DIR C header files [PREFIX/include]
1264 --oldincludedir=DIR C header files for non-gcc [/usr/include]
1265 --datarootdir=DIR read-only arch.-independent data root [PREFIX/share]
1266 --datadir=DIR read-only architecture-independent data [DATAROOTDIR]
1267 --infodir=DIR info documentation [DATAROOTDIR/info]
1268 --localedir=DIR locale-dependent data [DATAROOTDIR/locale]
1269 --mandir=DIR man documentation [DATAROOTDIR/man]
1270 --docdir=DIR documentation root [DATAROOTDIR/doc/cvsgraph]
1271 --htmldir=DIR html documentation [DOCDIR]
1272 --dvidir=DIR dvi documentation [DOCDIR]
1273 --pdfdir=DIR pdf documentation [DOCDIR]
1274 --psdir=DIR ps documentation [DOCDIR]
1275 _ACEOF
1276
1277 cat <<\_ACEOF
1278
1279 Program names:
1280 --program-prefix=PREFIX prepend PREFIX to installed program names
1281 --program-suffix=SUFFIX append SUFFIX to installed program names
1282 --program-transform-name=PROGRAM run sed PROGRAM on installed program names
1283 _ACEOF
1284 fi
1285
1286 if test -n "$ac_init_help"; then
1287 case $ac_init_help in
1288 short | recursive ) echo "Configuration of cvsgraph 1.7.0:";;
1289 esac
1290 cat <<\_ACEOF
1291
1292 Optional Features:
1293 --disable-FEATURE do not include FEATURE (same as --enable-FEATURE=no)
1294 --enable-FEATURE[=ARG] include FEATURE [ARG=yes]
1295 --disable-dependency-tracking speeds up one-time build
1296 --enable-dependency-tracking do not reject slow dependency extractors
1297
1298 Optional Packages:
1299 --with-PACKAGE[=ARG] use PACKAGE [ARG=yes]
1300 --without-PACKAGE do not use PACKAGE (same as --with-PACKAGE=no)
1301 --with-gd(=DIR) use the gd library (in DIR)
1302
1303 Some influential environment variables:
1304 CC C compiler command
1305 CFLAGS C compiler flags
1306 LDFLAGS linker flags, e.g. -L<lib dir> if you have libraries in a
1307 nonstandard directory <lib dir>
1308 LIBS libraries to pass to the linker, e.g. -l<library>
1309 CPPFLAGS C/C++/Objective C preprocessor flags, e.g. -I<include dir> if
1310 you have headers in a nonstandard directory <include dir>
1311 YACC The `Yet Another C Compiler' implementation to use. Defaults to
1312 the first program found out of: `bison -y', `byacc', `yacc'.
1313 YFLAGS The list of arguments that will be passed by default to $YACC.
1314 This script will default YFLAGS to the empty string to avoid a
1315 default value of `-d' given by some make applications.
1316 CPP C preprocessor
1317
1318 Use these variables to override the choices made by `configure' or to help
1319 it to find libraries and programs with nonstandard names/locations.
1320
1321 Report bugs to <[email protected]>.
1322 _ACEOF
1323 ac_status=$?
1324 fi
1325
1326 if test "$ac_init_help" = "recursive"; then
1327 # If there are subdirs, report their specific --help.
1328 for ac_dir in : $ac_subdirs_all; do test "x$ac_dir" = x: && continue
1329 test -d "$ac_dir" || continue
1330 ac_builddir=.
1331
1332 case "$ac_dir" in
1333 .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
1334 *)
1335 ac_dir_suffix=/`echo "$ac_dir" | sed 's,^\.[\\/],,'`
1336 # A ".." for each directory in $ac_dir_suffix.
1337 ac_top_builddir_sub=`echo "$ac_dir_suffix" | sed 's,/[^\\/]*,/..,g;s,/,,'`
1338 case $ac_top_builddir_sub in
1339 "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
1340 *) ac_top_build_prefix=$ac_top_builddir_sub/ ;;
1341 esac ;;
1342 esac
1343 ac_abs_top_builddir=$ac_pwd
1344 ac_abs_builddir=$ac_pwd$ac_dir_suffix
1345 # for backward compatibility:
1346 ac_top_builddir=$ac_top_build_prefix
1347
1348 case $srcdir in
1349 .) # We are building in place.
1350 ac_srcdir=.
1351 ac_top_srcdir=$ac_top_builddir_sub
1352 ac_abs_top_srcdir=$ac_pwd ;;
1353 [\\/]* | ?:[\\/]* ) # Absolute name.
1354 ac_srcdir=$srcdir$ac_dir_suffix;
1355 ac_top_srcdir=$srcdir
1356 ac_abs_top_srcdir=$srcdir ;;
1357 *) # Relative name.
1358 ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
1359 ac_top_srcdir=$ac_top_build_prefix$srcdir
1360 ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
1361 esac
1362 ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
1363
1364 cd "$ac_dir" || { ac_status=$?; continue; }
1365 # Check for guested configure.
1366 if test -f "$ac_srcdir/configure.gnu"; then
1367 echo &&
1368 $SHELL "$ac_srcdir/configure.gnu" --help=recursive
1369 elif test -f "$ac_srcdir/configure"; then
1370 echo &&
1371 $SHELL "$ac_srcdir/configure" --help=recursive
1372 else
1373 echo "$as_me: WARNING: no configuration information is in $ac_dir" >&2
1374 fi || ac_status=$?
1375 cd "$ac_pwd" || { ac_status=$?; break; }
1376 done
1377 fi
1378
1379 test -n "$ac_init_help" && exit $ac_status
1380 if $ac_init_version; then
1381 cat <<\_ACEOF
1382 cvsgraph configure 1.7.0
1383 generated by GNU Autoconf 2.61
1384
1385 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2001,
1386 2002, 2003, 2004, 2005, 2006 Free Software Foundation, Inc.
1387 This configure script is free software; the Free Software Foundation
1388 gives unlimited permission to copy, distribute and modify it.
1389 _ACEOF
1390 exit
1391 fi
1392 cat >config.log <<_ACEOF
1393 This file contains any messages produced by compilers while
1394 running configure, to aid debugging if configure makes a mistake.
1395
1396 It was created by cvsgraph $as_me 1.7.0, which was
1397 generated by GNU Autoconf 2.61. Invocation command line was
1398
1399 $ $0 $@
1400
1401 _ACEOF
1402 exec 5>>config.log
1403 {
1404 cat <<_ASUNAME
1405 ## --------- ##
1406 ## Platform. ##
1407 ## --------- ##
1408
1409 hostname = `(hostname || uname -n) 2>/dev/null | sed 1q`
1410 uname -m = `(uname -m) 2>/dev/null || echo unknown`
1411 uname -r = `(uname -r) 2>/dev/null || echo unknown`
1412 uname -s = `(uname -s) 2>/dev/null || echo unknown`
1413 uname -v = `(uname -v) 2>/dev/null || echo unknown`
1414
1415 /usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null || echo unknown`
1416 /bin/uname -X = `(/bin/uname -X) 2>/dev/null || echo unknown`
1417
1418 /bin/arch = `(/bin/arch) 2>/dev/null || echo unknown`
1419 /usr/bin/arch -k = `(/usr/bin/arch -k) 2>/dev/null || echo unknown`
1420 /usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null || echo unknown`
1421 /usr/bin/hostinfo = `(/usr/bin/hostinfo) 2>/dev/null || echo unknown`
1422 /bin/machine = `(/bin/machine) 2>/dev/null || echo unknown`
1423 /usr/bin/oslevel = `(/usr/bin/oslevel) 2>/dev/null || echo unknown`
1424 /bin/universe = `(/bin/universe) 2>/dev/null || echo unknown`
1425
1426 _ASUNAME
1427
1428 as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
1429 for as_dir in $PATH
1430 do
1431 IFS=$as_save_IFS
1432 test -z "$as_dir" && as_dir=.
1433 echo "PATH: $as_dir"
1434 done
1435 IFS=$as_save_IFS
1436
1437 } >&5
1438
1439 cat >&5 <<_ACEOF
1440
1441
1442 ## ----------- ##
1443 ## Core tests. ##
1444 ## ----------- ##
1445
1446 _ACEOF
1447
1448
1449 # Keep a trace of the command line.
1450 # Strip out --no-create and --no-recursion so they do not pile up.
1451 # Strip out --silent because we don't want to record it for future runs.
1452 # Also quote any args containing shell meta-characters.
1453 # Make two passes to allow for proper duplicate-argument suppression.
1454 ac_configure_args=
1455 ac_configure_args0=
1456 ac_configure_args1=
1457 ac_must_keep_next=false
1458 for ac_pass in 1 2
1459 do
1460 for ac_arg
1461 do
1462 case $ac_arg in
1463 -no-create | --no-c* | -n | -no-recursion | --no-r*) continue ;;
1464 -q | -quiet | --quiet | --quie | --qui | --qu | --q \
1465 | -silent | --silent | --silen | --sile | --sil)
1466 continue ;;
1467 *\'*)
1468 ac_arg=`echo "$ac_arg" | sed "s/'/'\\\\\\\\''/g"` ;;
1469 esac
1470 case $ac_pass in
1471 1) ac_configure_args0="$ac_configure_args0 '$ac_arg'" ;;
1472 2)
1473 ac_configure_args1="$ac_configure_args1 '$ac_arg'"
1474 if test $ac_must_keep_next = true; then
1475 ac_must_keep_next=false # Got value, back to normal.
1476 else
1477 case $ac_arg in
1478 *=* | --config-cache | -C | -disable-* | --disable-* \
1479 | -enable-* | --enable-* | -gas | --g* | -nfp | --nf* \
1480 | -q | -quiet | --q* | -silent | --sil* | -v | -verb* \
1481 | -with-* | --with-* | -without-* | --without-* | --x)
1482 case "$ac_configure_args0 " in
1483 "$ac_configure_args1"*" '$ac_arg' "* ) continue ;;
1484 esac
1485 ;;
1486 -* ) ac_must_keep_next=true ;;
1487 esac
1488 fi
1489 ac_configure_args="$ac_configure_args '$ac_arg'"
1490 ;;
1491 esac
1492 done
1493 done
1494 $as_unset ac_configure_args0 || test "${ac_configure_args0+set}" != set || { ac_configure_args0=; export ac_configure_args0; }
1495 $as_unset ac_configure_args1 || test "${ac_configure_args1+set}" != set || { ac_configure_args1=; export ac_configure_args1; }
1496
1497 # When interrupted or exit'd, cleanup temporary files, and complete
1498 # config.log. We remove comments because anyway the quotes in there
1499 # would cause problems or look ugly.
1500 # WARNING: Use '\'' to represent an apostrophe within the trap.
1501 # WARNING: Do not start the trap code with a newline, due to a FreeBSD 4.0 bug.
1502 trap 'exit_status=$?
1503 # Save into config.log some information that might help in debugging.
1504 {
1505 echo
1506
1507 cat <<\_ASBOX
1508 ## ---------------- ##
1509 ## Cache variables. ##
1510 ## ---------------- ##
1511 _ASBOX
1512 echo
1513 # The following way of writing the cache mishandles newlines in values,
1514 (
1515 for ac_var in `(set) 2>&1 | sed -n '\''s/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'\''`; do
1516 eval ac_val=\$$ac_var
1517 case $ac_val in #(
1518 *${as_nl}*)
1519 case $ac_var in #(
1520 *_cv_*) { echo "$as_me:$LINENO: WARNING: Cache variable $ac_var contains a newline." >&5
1521 echo "$as_me: WARNING: Cache variable $ac_var contains a newline." >&2;} ;;
1522 esac
1523 case $ac_var in #(
1524 _ | IFS | as_nl) ;; #(
1525 *) $as_unset $ac_var ;;
1526 esac ;;
1527 esac
1528 done
1529 (set) 2>&1 |
1530 case $as_nl`(ac_space='\'' '\''; set) 2>&1` in #(
1531 *${as_nl}ac_space=\ *)
1532 sed -n \
1533 "s/'\''/'\''\\\\'\'''\''/g;
1534 s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\''\\2'\''/p"
1535 ;; #(
1536 *)
1537 sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p"
1538 ;;
1539 esac |
1540 sort
1541 )
1542 echo
1543
1544 cat <<\_ASBOX
1545 ## ----------------- ##
1546 ## Output variables. ##
1547 ## ----------------- ##
1548 _ASBOX
1549 echo
1550 for ac_var in $ac_subst_vars
1551 do
1552 eval ac_val=\$$ac_var
1553 case $ac_val in
1554 *\'\''*) ac_val=`echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
1555 esac
1556 echo "$ac_var='\''$ac_val'\''"
1557 done | sort
1558 echo
1559
1560 if test -n "$ac_subst_files"; then
1561 cat <<\_ASBOX
1562 ## ------------------- ##
1563 ## File substitutions. ##
1564 ## ------------------- ##
1565 _ASBOX
1566 echo
1567 for ac_var in $ac_subst_files
1568 do
1569 eval ac_val=\$$ac_var
1570 case $ac_val in
1571 *\'\''*) ac_val=`echo "$ac_val" | sed "s/'\''/'\''\\\\\\\\'\'''\''/g"`;;
1572 esac
1573 echo "$ac_var='\''$ac_val'\''"
1574 done | sort
1575 echo
1576 fi
1577
1578 if test -s confdefs.h; then
1579 cat <<\_ASBOX
1580 ## ----------- ##
1581 ## confdefs.h. ##
1582 ## ----------- ##
1583 _ASBOX
1584 echo
1585 cat confdefs.h
1586 echo
1587 fi
1588 test "$ac_signal" != 0 &&
1589 echo "$as_me: caught signal $ac_signal"
1590 echo "$as_me: exit $exit_status"
1591 } >&5
1592 rm -f core *.core core.conftest.* &&
1593 rm -f -r conftest* confdefs* conf$$* $ac_clean_files &&
1594 exit $exit_status
1595 ' 0
1596 for ac_signal in 1 2 13 15; do
1597 trap 'ac_signal='$ac_signal'; { (exit 1); exit 1; }' $ac_signal
1598 done
1599 ac_signal=0
1600
1601 # confdefs.h avoids OS command line length limits that DEFS can exceed.
1602 rm -f -r conftest* confdefs.h
1603
1604 # Predefined preprocessor variables.
1605
1606 cat >>confdefs.h <<_ACEOF
1607 #define PACKAGE_NAME "$PACKAGE_NAME"
1608 _ACEOF
1609
1610
1611 cat >>confdefs.h <<_ACEOF
1612 #define PACKAGE_TARNAME "$PACKAGE_TARNAME"
1613 _ACEOF
1614
1615
1616 cat >>confdefs.h <<_ACEOF
1617 #define PACKAGE_VERSION "$PACKAGE_VERSION"
1618 _ACEOF
1619
1620
1621 cat >>confdefs.h <<_ACEOF
1622 #define PACKAGE_STRING "$PACKAGE_STRING"
1623 _ACEOF
1624
1625
1626 cat >>confdefs.h <<_ACEOF
1627 #define PACKAGE_BUGREPORT "$PACKAGE_BUGREPORT"
1628 _ACEOF
1629
1630
1631 # Let the site file select an alternate cache file if it wants to.
1632 # Prefer explicitly selected file to automatically selected ones.
1633 if test -n "$CONFIG_SITE"; then
1634 set x "$CONFIG_SITE"
1635 elif test "x$prefix" != xNONE; then
1636 set x "$prefix/share/config.site" "$prefix/etc/config.site"
1637 else
1638 set x "$ac_default_prefix/share/config.site" \
1639 "$ac_default_prefix/etc/config.site"
1640 fi
1641 shift
1642 for ac_site_file
1643 do
1644 if test -r "$ac_site_file"; then
1645 { echo "$as_me:$LINENO: loading site script $ac_site_file" >&5
1646 echo "$as_me: loading site script $ac_site_file" >&6;}
1647 sed 's/^/| /' "$ac_site_file" >&5
1648 . "$ac_site_file"
1649 fi
1650 done
1651
1652 if test -r "$cache_file"; then
1653 # Some versions of bash will fail to source /dev/null (special
1654 # files actually), so we avoid doing that.
1655 if test -f "$cache_file"; then
1656 { echo "$as_me:$LINENO: loading cache $cache_file" >&5
1657 echo "$as_me: loading cache $cache_file" >&6;}
1658 case $cache_file in
1659 [\\/]* | ?:[\\/]* ) . "$cache_file";;
1660 *) . "./$cache_file";;
1661 esac
1662 fi
1663 else
1664 { echo "$as_me:$LINENO: creating cache $cache_file" >&5
1665 echo "$as_me: creating cache $cache_file" >&6;}
1666 >$cache_file
1667 fi
1668
1669 # Check that the precious variables saved in the cache have kept the same
1670 # value.
1671 ac_cache_corrupted=false
1672 for ac_var in $ac_precious_vars; do
1673 eval ac_old_set=\$ac_cv_env_${ac_var}_set
1674 eval ac_new_set=\$ac_env_${ac_var}_set
1675 eval ac_old_val=\$ac_cv_env_${ac_var}_value
1676 eval ac_new_val=\$ac_env_${ac_var}_value
1677 case $ac_old_set,$ac_new_set in
1678 set,)
1679 { echo "$as_me:$LINENO: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&5
1680 echo "$as_me: error: \`$ac_var' was set to \`$ac_old_val' in the previous run" >&2;}
1681 ac_cache_corrupted=: ;;
1682 ,set)
1683 { echo "$as_me:$LINENO: error: \`$ac_var' was not set in the previous run" >&5
1684 echo "$as_me: error: \`$ac_var' was not set in the previous run" >&2;}
1685 ac_cache_corrupted=: ;;
1686 ,);;
1687 *)
1688 if test "x$ac_old_val" != "x$ac_new_val"; then
1689 { echo "$as_me:$LINENO: error: \`$ac_var' has changed since the previous run:" >&5
1690 echo "$as_me: error: \`$ac_var' has changed since the previous run:" >&2;}
1691 { echo "$as_me:$LINENO: former value: $ac_old_val" >&5
1692 echo "$as_me: former value: $ac_old_val" >&2;}
1693 { echo "$as_me:$LINENO: current value: $ac_new_val" >&5
1694 echo "$as_me: current value: $ac_new_val" >&2;}
1695 ac_cache_corrupted=:
1696 fi;;
1697 esac
1698 # Pass precious variables to config.status.
1699 if test "$ac_new_set" = set; then
1700 case $ac_new_val in
1701 *\'*) ac_arg=$ac_var=`echo "$ac_new_val" | sed "s/'/'\\\\\\\\''/g"` ;;
1702 *) ac_arg=$ac_var=$ac_new_val ;;
1703 esac
1704 case " $ac_configure_args " in
1705 *" '$ac_arg' "*) ;; # Avoid dups. Use of quotes ensures accuracy.
1706 *) ac_configure_args="$ac_configure_args '$ac_arg'" ;;
1707 esac
1708 fi
1709 done
1710 if $ac_cache_corrupted; then
1711 { echo "$as_me:$LINENO: error: changes in the environment can compromise the build" >&5
1712 echo "$as_me: error: changes in the environment can compromise the build" >&2;}
1713 { { echo "$as_me:$LINENO: error: run \`make distclean' and/or \`rm $cache_file' and start over" >&5
1714 echo "$as_me: error: run \`make distclean' and/or \`rm $cache_file' and start over" >&2;}
1715 { (exit 1); exit 1; }; }
1716 fi
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742 ac_ext=c
1743 ac_cpp='$CPP $CPPFLAGS'
1744 ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
1745 ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
1746 ac_compiler_gnu=$ac_cv_c_compiler_gnu
1747
1748
1749 am__api_version='1.10'
1750
1751 ac_aux_dir=
1752 for ac_dir in "$srcdir" "$srcdir/.." "$srcdir/../.."; do
1753 if test -f "$ac_dir/install-sh"; then
1754 ac_aux_dir=$ac_dir
1755 ac_install_sh="$ac_aux_dir/install-sh -c"
1756 break
1757 elif test -f "$ac_dir/install.sh"; then
1758 ac_aux_dir=$ac_dir
1759 ac_install_sh="$ac_aux_dir/install.sh -c"
1760 break
1761 elif test -f "$ac_dir/shtool"; then
1762 ac_aux_dir=$ac_dir
1763 ac_install_sh="$ac_aux_dir/shtool install -c"
1764 break
1765 fi
1766 done
1767 if test -z "$ac_aux_dir"; then
1768 { { echo "$as_me:$LINENO: error: cannot find install-sh or install.sh in \"$srcdir\" \"$srcdir/..\" \"$srcdir/../..\"" >&5
1769 echo "$as_me: error: cannot find install-sh or install.sh in \"$srcdir\" \"$srcdir/..\" \"$srcdir/../..\"" >&2;}
1770 { (exit 1); exit 1; }; }
1771 fi
1772
1773 # These three variables are undocumented and unsupported,
1774 # and are intended to be withdrawn in a future Autoconf release.
1775 # They can cause serious problems if a builder's source tree is in a directory
1776 # whose full name contains unusual characters.
1777 ac_config_guess="$SHELL $ac_aux_dir/config.guess" # Please don't use this var.
1778 ac_config_sub="$SHELL $ac_aux_dir/config.sub" # Please don't use this var.
1779 ac_configure="$SHELL $ac_aux_dir/configure" # Please don't use this var.
1780
1781
1782 # Find a good install program. We prefer a C program (faster),
1783 # so one script is as good as another. But avoid the broken or
1784 # incompatible versions:
1785 # SysV /etc/install, /usr/sbin/install
1786 # SunOS /usr/etc/install
1787 # IRIX /sbin/install
1788 # AIX /bin/install
1789 # AmigaOS /C/install, which installs bootblocks on floppy discs
1790 # AIX 4 /usr/bin/installbsd, which doesn't work without a -g flag
1791 # AFS /usr/afsws/bin/install, which mishandles nonexistent args
1792 # SVR4 /usr/ucb/install, which tries to use the nonexistent group "staff"
1793 # OS/2's system install, which has a completely different semantic
1794 # ./install, which can be erroneously created by make from ./install.sh.
1795 { echo "$as_me:$LINENO: checking for a BSD-compatible install" >&5
1796 echo $ECHO_N "checking for a BSD-compatible install... $ECHO_C" >&6; }
1797 if test -z "$INSTALL"; then
1798 if test "${ac_cv_path_install+set}" = set; then
1799 echo $ECHO_N "(cached) $ECHO_C" >&6
1800 else
1801 as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
1802 for as_dir in $PATH
1803 do
1804 IFS=$as_save_IFS
1805 test -z "$as_dir" && as_dir=.
1806 # Account for people who put trailing slashes in PATH elements.
1807 case $as_dir/ in
1808 ./ | .// | /cC/* | \
1809 /etc/* | /usr/sbin/* | /usr/etc/* | /sbin/* | /usr/afsws/bin/* | \
1810 ?:\\/os2\\/install\\/* | ?:\\/OS2\\/INSTALL\\/* | \
1811 /usr/ucb/* ) ;;
1812 *)
1813 # OSF1 and SCO ODT 3.0 have their own names for install.
1814 # Don't use installbsd from OSF since it installs stuff as root
1815 # by default.
1816 for ac_prog in ginstall scoinst install; do
1817 for ac_exec_ext in '' $ac_executable_extensions; do
1818 if { test -f "$as_dir/$ac_prog$ac_exec_ext" && $as_test_x "$as_dir/$ac_prog$ac_exec_ext"; }; then
1819 if test $ac_prog = install &&
1820 grep dspmsg "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
1821 # AIX install. It has an incompatible calling convention.
1822 :
1823 elif test $ac_prog = install &&
1824 grep pwplus "$as_dir/$ac_prog$ac_exec_ext" >/dev/null 2>&1; then
1825 # program-specific install script used by HP pwplus--don't use.
1826 :
1827 else
1828 ac_cv_path_install="$as_dir/$ac_prog$ac_exec_ext -c"
1829 break 3
1830 fi
1831 fi
1832 done
1833 done
1834 ;;
1835 esac
1836 done
1837 IFS=$as_save_IFS
1838
1839
1840 fi
1841 if test "${ac_cv_path_install+set}" = set; then
1842 INSTALL=$ac_cv_path_install
1843 else
1844 # As a last resort, use the slow shell script. Don't cache a
1845 # value for INSTALL within a source directory, because that will
1846 # break other packages using the cache if that directory is
1847 # removed, or if the value is a relative name.
1848 INSTALL=$ac_install_sh
1849 fi
1850 fi
1851 { echo "$as_me:$LINENO: result: $INSTALL" >&5
1852 echo "${ECHO_T}$INSTALL" >&6; }
1853
1854 # Use test -z because SunOS4 sh mishandles braces in ${var-val}.
1855 # It thinks the first close brace ends the variable substitution.
1856 test -z "$INSTALL_PROGRAM" && INSTALL_PROGRAM='${INSTALL}'
1857
1858 test -z "$INSTALL_SCRIPT" && INSTALL_SCRIPT='${INSTALL}'
1859
1860 test -z "$INSTALL_DATA" && INSTALL_DATA='${INSTALL} -m 644'
1861
1862 { echo "$as_me:$LINENO: checking whether build environment is sane" >&5
1863 echo $ECHO_N "checking whether build environment is sane... $ECHO_C" >&6; }
1864 # Just in case
1865 sleep 1
1866 echo timestamp > conftest.file
1867 # Do `set' in a subshell so we don't clobber the current shell's
1868 # arguments. Must try -L first in case configure is actually a
1869 # symlink; some systems play weird games with the mod time of symlinks
1870 # (eg FreeBSD returns the mod time of the symlink's containing
1871 # directory).
1872 if (
1873 set X `ls -Lt $srcdir/configure conftest.file 2> /dev/null`
1874 if test "$*" = "X"; then
1875 # -L didn't work.
1876 set X `ls -t $srcdir/configure conftest.file`
1877 fi
1878 rm -f conftest.file
1879 if test "$*" != "X $srcdir/configure conftest.file" \
1880 && test "$*" != "X conftest.file $srcdir/configure"; then
1881
1882 # If neither matched, then we have a broken ls. This can happen
1883 # if, for instance, CONFIG_SHELL is bash and it inherits a
1884 # broken ls alias from the environment. This has actually
1885 # happened. Such a system could not be considered "sane".
1886 { { echo "$as_me:$LINENO: error: ls -t appears to fail. Make sure there is not a broken
1887 alias in your environment" >&5
1888 echo "$as_me: error: ls -t appears to fail. Make sure there is not a broken
1889 alias in your environment" >&2;}
1890 { (exit 1); exit 1; }; }
1891 fi
1892
1893 test "$2" = conftest.file
1894 )
1895 then
1896 # Ok.
1897 :
1898 else
1899 { { echo "$as_me:$LINENO: error: newly created file is older than distributed files!
1900 Check your system clock" >&5
1901 echo "$as_me: error: newly created file is older than distributed files!
1902 Check your system clock" >&2;}
1903 { (exit 1); exit 1; }; }
1904 fi
1905 { echo "$as_me:$LINENO: result: yes" >&5
1906 echo "${ECHO_T}yes" >&6; }
1907 test "$program_prefix" != NONE &&
1908 program_transform_name="s&^&$program_prefix&;$program_transform_name"
1909 # Use a double $ so make ignores it.
1910 test "$program_suffix" != NONE &&
1911 program_transform_name="s&\$&$program_suffix&;$program_transform_name"
1912 # Double any \ or $. echo might interpret backslashes.
1913 # By default was `s,x,x', remove it if useless.
1914 cat <<\_ACEOF >conftest.sed
1915 s/[\\$]/&&/g;s/;s,x,x,$//
1916 _ACEOF
1917 program_transform_name=`echo $program_transform_name | sed -f conftest.sed`
1918 rm -f conftest.sed
1919
1920 # expand $ac_aux_dir to an absolute path
1921 am_aux_dir=`cd $ac_aux_dir && pwd`
1922
1923 test x"${MISSING+set}" = xset || MISSING="\${SHELL} $am_aux_dir/missing"
1924 # Use eval to expand $SHELL
1925 if eval "$MISSING --run true"; then
1926 am_missing_run="$MISSING --run "
1927 else
1928 am_missing_run=
1929 { echo "$as_me:$LINENO: WARNING: \`missing' script is too old or missing" >&5
1930 echo "$as_me: WARNING: \`missing' script is too old or missing" >&2;}
1931 fi
1932
1933 { echo "$as_me:$LINENO: checking for a thread-safe mkdir -p" >&5
1934 echo $ECHO_N "checking for a thread-safe mkdir -p... $ECHO_C" >&6; }
1935 if test -z "$MKDIR_P"; then
1936 if test "${ac_cv_path_mkdir+set}" = set; then
1937 echo $ECHO_N "(cached) $ECHO_C" >&6
1938 else
1939 as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
1940 for as_dir in $PATH$PATH_SEPARATOR/opt/sfw/bin
1941 do
1942 IFS=$as_save_IFS
1943 test -z "$as_dir" && as_dir=.
1944 for ac_prog in mkdir gmkdir; do
1945 for ac_exec_ext in '' $ac_executable_extensions; do
1946 { test -f "$as_dir/$ac_prog$ac_exec_ext" && $as_test_x "$as_dir/$ac_prog$ac_exec_ext"; } || continue
1947 case `"$as_dir/$ac_prog$ac_exec_ext" --version 2>&1` in #(
1948 'mkdir (GNU coreutils) '* | \
1949 'mkdir (coreutils) '* | \
1950 'mkdir (fileutils) '4.1*)
1951 ac_cv_path_mkdir=$as_dir/$ac_prog$ac_exec_ext
1952 break 3;;
1953 esac
1954 done
1955 done
1956 done
1957 IFS=$as_save_IFS
1958
1959 fi
1960
1961 if test "${ac_cv_path_mkdir+set}" = set; then
1962 MKDIR_P="$ac_cv_path_mkdir -p"
1963 else
1964 # As a last resort, use the slow shell script. Don't cache a
1965 # value for MKDIR_P within a source directory, because that will
1966 # break other packages using the cache if that directory is
1967 # removed, or if the value is a relative name.
1968 test -d ./--version && rmdir ./--version
1969 MKDIR_P="$ac_install_sh -d"
1970 fi
1971 fi
1972 { echo "$as_me:$LINENO: result: $MKDIR_P" >&5
1973 echo "${ECHO_T}$MKDIR_P" >&6; }
1974
1975 mkdir_p="$MKDIR_P"
1976 case $mkdir_p in
1977 [\\/$]* | ?:[\\/]*) ;;
1978 */*) mkdir_p="\$(top_builddir)/$mkdir_p" ;;
1979 esac
1980
1981 for ac_prog in gawk mawk nawk awk
1982 do
1983 # Extract the first word of "$ac_prog", so it can be a program name with args.
1984 set dummy $ac_prog; ac_word=$2
1985 { echo "$as_me:$LINENO: checking for $ac_word" >&5
1986 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; }
1987 if test "${ac_cv_prog_AWK+set}" = set; then
1988 echo $ECHO_N "(cached) $ECHO_C" >&6
1989 else
1990 if test -n "$AWK"; then
1991 ac_cv_prog_AWK="$AWK" # Let the user override the test.
1992 else
1993 as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
1994 for as_dir in $PATH
1995 do
1996 IFS=$as_save_IFS
1997 test -z "$as_dir" && as_dir=.
1998 for ac_exec_ext in '' $ac_executable_extensions; do
1999 if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
2000 ac_cv_prog_AWK="$ac_prog"
2001 echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
2002 break 2
2003 fi
2004 done
2005 done
2006 IFS=$as_save_IFS
2007
2008 fi
2009 fi
2010 AWK=$ac_cv_prog_AWK
2011 if test -n "$AWK"; then
2012 { echo "$as_me:$LINENO: result: $AWK" >&5
2013 echo "${ECHO_T}$AWK" >&6; }
2014 else
2015 { echo "$as_me:$LINENO: result: no" >&5
2016 echo "${ECHO_T}no" >&6; }
2017 fi
2018
2019
2020 test -n "$AWK" && break
2021 done
2022
2023 { echo "$as_me:$LINENO: checking whether ${MAKE-make} sets \$(MAKE)" >&5
2024 echo $ECHO_N "checking whether ${MAKE-make} sets \$(MAKE)... $ECHO_C" >&6; }
2025 set x ${MAKE-make}; ac_make=`echo "$2" | sed 's/+/p/g; s/[^a-zA-Z0-9_]/_/g'`
2026 if { as_var=ac_cv_prog_make_${ac_make}_set; eval "test \"\${$as_var+set}\" = set"; }; then
2027 echo $ECHO_N "(cached) $ECHO_C" >&6
2028 else
2029 cat >conftest.make <<\_ACEOF
2030 SHELL = /bin/sh
2031 all:
2032 @echo '@@@%%%=$(MAKE)=@@@%%%'
2033 _ACEOF
2034 # GNU make sometimes prints "make[1]: Entering...", which would confuse us.
2035 case `${MAKE-make} -f conftest.make 2>/dev/null` in
2036 *@@@%%%=?*=@@@%%%*)
2037 eval ac_cv_prog_make_${ac_make}_set=yes;;
2038 *)
2039 eval ac_cv_prog_make_${ac_make}_set=no;;
2040 esac
2041 rm -f conftest.make
2042 fi
2043 if eval test \$ac_cv_prog_make_${ac_make}_set = yes; then
2044 { echo "$as_me:$LINENO: result: yes" >&5
2045 echo "${ECHO_T}yes" >&6; }
2046 SET_MAKE=
2047 else
2048 { echo "$as_me:$LINENO: result: no" >&5
2049 echo "${ECHO_T}no" >&6; }
2050 SET_MAKE="MAKE=${MAKE-make}"
2051 fi
2052
2053 rm -rf .tst 2>/dev/null
2054 mkdir .tst 2>/dev/null
2055 if test -d .tst; then
2056 am__leading_dot=.
2057 else
2058 am__leading_dot=_
2059 fi
2060 rmdir .tst 2>/dev/null
2061
2062 if test "`cd $srcdir && pwd`" != "`pwd`"; then
2063 # Use -I$(srcdir) only when $(srcdir) != ., so that make's output
2064 # is not polluted with repeated "-I."
2065 am__isrc=' -I$(srcdir)'
2066 # test to see if srcdir already configured
2067 if test -f $srcdir/config.status; then
2068 { { echo "$as_me:$LINENO: error: source directory already configured; run \"make distclean\" there first" >&5
2069 echo "$as_me: error: source directory already configured; run \"make distclean\" there first" >&2;}
2070 { (exit 1); exit 1; }; }
2071 fi
2072 fi
2073
2074 # test whether we have cygpath
2075 if test -z "$CYGPATH_W"; then
2076 if (cygpath --version) >/dev/null 2>/dev/null; then
2077 CYGPATH_W='cygpath -w'
2078 else
2079 CYGPATH_W=echo
2080 fi
2081 fi
2082
2083
2084 # Define the identity of the package.
2085 PACKAGE='cvsgraph'
2086 VERSION='1.7.0'
2087
2088
2089 cat >>confdefs.h <<_ACEOF
2090 #define PACKAGE "$PACKAGE"
2091 _ACEOF
2092
2093
2094 cat >>confdefs.h <<_ACEOF
2095 #define VERSION "$VERSION"
2096 _ACEOF
2097
2098 # Some tools Automake needs.
2099
2100 ACLOCAL=${ACLOCAL-"${am_missing_run}aclocal-${am__api_version}"}
2101
2102
2103 AUTOCONF=${AUTOCONF-"${am_missing_run}autoconf"}
2104
2105
2106 AUTOMAKE=${AUTOMAKE-"${am_missing_run}automake-${am__api_version}"}
2107
2108
2109 AUTOHEADER=${AUTOHEADER-"${am_missing_run}autoheader"}
2110
2111
2112 MAKEINFO=${MAKEINFO-"${am_missing_run}makeinfo"}
2113
2114 install_sh=${install_sh-"\$(SHELL) $am_aux_dir/install-sh"}
2115
2116 # Installed binaries are usually stripped using `strip' when the user
2117 # run `make install-strip'. However `strip' might not be the right
2118 # tool to use in cross-compilation environments, therefore Automake
2119 # will honor the `STRIP' environment variable to overrule this program.
2120 if test "$cross_compiling" != no; then
2121 if test -n "$ac_tool_prefix"; then
2122 # Extract the first word of "${ac_tool_prefix}strip", so it can be a program name with args.
2123 set dummy ${ac_tool_prefix}strip; ac_word=$2
2124 { echo "$as_me:$LINENO: checking for $ac_word" >&5
2125 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; }
2126 if test "${ac_cv_prog_STRIP+set}" = set; then
2127 echo $ECHO_N "(cached) $ECHO_C" >&6
2128 else
2129 if test -n "$STRIP"; then
2130 ac_cv_prog_STRIP="$STRIP" # Let the user override the test.
2131 else
2132 as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
2133 for as_dir in $PATH
2134 do
2135 IFS=$as_save_IFS
2136 test -z "$as_dir" && as_dir=.
2137 for ac_exec_ext in '' $ac_executable_extensions; do
2138 if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
2139 ac_cv_prog_STRIP="${ac_tool_prefix}strip"
2140 echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
2141 break 2
2142 fi
2143 done
2144 done
2145 IFS=$as_save_IFS
2146
2147 fi
2148 fi
2149 STRIP=$ac_cv_prog_STRIP
2150 if test -n "$STRIP"; then
2151 { echo "$as_me:$LINENO: result: $STRIP" >&5
2152 echo "${ECHO_T}$STRIP" >&6; }
2153 else
2154 { echo "$as_me:$LINENO: result: no" >&5
2155 echo "${ECHO_T}no" >&6; }
2156 fi
2157
2158
2159 fi
2160 if test -z "$ac_cv_prog_STRIP"; then
2161 ac_ct_STRIP=$STRIP
2162 # Extract the first word of "strip", so it can be a program name with args.
2163 set dummy strip; ac_word=$2
2164 { echo "$as_me:$LINENO: checking for $ac_word" >&5
2165 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; }
2166 if test "${ac_cv_prog_ac_ct_STRIP+set}" = set; then
2167 echo $ECHO_N "(cached) $ECHO_C" >&6
2168 else
2169 if test -n "$ac_ct_STRIP"; then
2170 ac_cv_prog_ac_ct_STRIP="$ac_ct_STRIP" # Let the user override the test.
2171 else
2172 as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
2173 for as_dir in $PATH
2174 do
2175 IFS=$as_save_IFS
2176 test -z "$as_dir" && as_dir=.
2177 for ac_exec_ext in '' $ac_executable_extensions; do
2178 if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
2179 ac_cv_prog_ac_ct_STRIP="strip"
2180 echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
2181 break 2
2182 fi
2183 done
2184 done
2185 IFS=$as_save_IFS
2186
2187 fi
2188 fi
2189 ac_ct_STRIP=$ac_cv_prog_ac_ct_STRIP
2190 if test -n "$ac_ct_STRIP"; then
2191 { echo "$as_me:$LINENO: result: $ac_ct_STRIP" >&5
2192 echo "${ECHO_T}$ac_ct_STRIP" >&6; }
2193 else
2194 { echo "$as_me:$LINENO: result: no" >&5
2195 echo "${ECHO_T}no" >&6; }
2196 fi
2197
2198 if test "x$ac_ct_STRIP" = x; then
2199 STRIP=":"
2200 else
2201 case $cross_compiling:$ac_tool_warned in
2202 yes:)
2203 { echo "$as_me:$LINENO: WARNING: In the future, Autoconf will not detect cross-tools
2204 whose name does not start with the host triplet. If you think this
2205 configuration is useful to you, please write to [email protected]." >&5
2206 echo "$as_me: WARNING: In the future, Autoconf will not detect cross-tools
2207 whose name does not start with the host triplet. If you think this
2208 configuration is useful to you, please write to [email protected]." >&2;}
2209 ac_tool_warned=yes ;;
2210 esac
2211 STRIP=$ac_ct_STRIP
2212 fi
2213 else
2214 STRIP="$ac_cv_prog_STRIP"
2215 fi
2216
2217 fi
2218 INSTALL_STRIP_PROGRAM="\$(install_sh) -c -s"
2219
2220 # We need awk for the "check" target. The system "awk" is bad on
2221 # some platforms.
2222 # Always define AMTAR for backward compatibility.
2223
2224 AMTAR=${AMTAR-"${am_missing_run}tar"}
2225
2226 am__tar='${AMTAR} chof - "$$tardir"'; am__untar='${AMTAR} xf -'
2227
2228
2229
2230
2231
2232
2233 ac_config_headers="$ac_config_headers config.h"
2234
2235 ac_config_files="$ac_config_files Makefile contrib/Makefile cvsgraph.1 cvsgraph.conf.5 cvsgraph.spec contrib/mkimage.php contrib/cvsgraphwrapper.php"
2236
2237
2238 with_gd=yes
2239
2240
2241
2242 # Checks for programs.
2243 ac_ext=c
2244 ac_cpp='$CPP $CPPFLAGS'
2245 ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
2246 ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
2247 ac_compiler_gnu=$ac_cv_c_compiler_gnu
2248 if test -n "$ac_tool_prefix"; then
2249 # Extract the first word of "${ac_tool_prefix}gcc", so it can be a program name with args.
2250 set dummy ${ac_tool_prefix}gcc; ac_word=$2
2251 { echo "$as_me:$LINENO: checking for $ac_word" >&5
2252 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; }
2253 if test "${ac_cv_prog_CC+set}" = set; then
2254 echo $ECHO_N "(cached) $ECHO_C" >&6
2255 else
2256 if test -n "$CC"; then
2257 ac_cv_prog_CC="$CC" # Let the user override the test.
2258 else
2259 as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
2260 for as_dir in $PATH
2261 do
2262 IFS=$as_save_IFS
2263 test -z "$as_dir" && as_dir=.
2264 for ac_exec_ext in '' $ac_executable_extensions; do
2265 if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
2266 ac_cv_prog_CC="${ac_tool_prefix}gcc"
2267 echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
2268 break 2
2269 fi
2270 done
2271 done
2272 IFS=$as_save_IFS
2273
2274 fi
2275 fi
2276 CC=$ac_cv_prog_CC
2277 if test -n "$CC"; then
2278 { echo "$as_me:$LINENO: result: $CC" >&5
2279 echo "${ECHO_T}$CC" >&6; }
2280 else
2281 { echo "$as_me:$LINENO: result: no" >&5
2282 echo "${ECHO_T}no" >&6; }
2283 fi
2284
2285
2286 fi
2287 if test -z "$ac_cv_prog_CC"; then
2288 ac_ct_CC=$CC
2289 # Extract the first word of "gcc", so it can be a program name with args.
2290 set dummy gcc; ac_word=$2
2291 { echo "$as_me:$LINENO: checking for $ac_word" >&5
2292 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; }
2293 if test "${ac_cv_prog_ac_ct_CC+set}" = set; then
2294 echo $ECHO_N "(cached) $ECHO_C" >&6
2295 else
2296 if test -n "$ac_ct_CC"; then
2297 ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test.
2298 else
2299 as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
2300 for as_dir in $PATH
2301 do
2302 IFS=$as_save_IFS
2303 test -z "$as_dir" && as_dir=.
2304 for ac_exec_ext in '' $ac_executable_extensions; do
2305 if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
2306 ac_cv_prog_ac_ct_CC="gcc"
2307 echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
2308 break 2
2309 fi
2310 done
2311 done
2312 IFS=$as_save_IFS
2313
2314 fi
2315 fi
2316 ac_ct_CC=$ac_cv_prog_ac_ct_CC
2317 if test -n "$ac_ct_CC"; then
2318 { echo "$as_me:$LINENO: result: $ac_ct_CC" >&5
2319 echo "${ECHO_T}$ac_ct_CC" >&6; }
2320 else
2321 { echo "$as_me:$LINENO: result: no" >&5
2322 echo "${ECHO_T}no" >&6; }
2323 fi
2324
2325 if test "x$ac_ct_CC" = x; then
2326 CC=""
2327 else
2328 case $cross_compiling:$ac_tool_warned in
2329 yes:)
2330 { echo "$as_me:$LINENO: WARNING: In the future, Autoconf will not detect cross-tools
2331 whose name does not start with the host triplet. If you think this
2332 configuration is useful to you, please write to [email protected]." >&5
2333 echo "$as_me: WARNING: In the future, Autoconf will not detect cross-tools
2334 whose name does not start with the host triplet. If you think this
2335 configuration is useful to you, please write to [email protected]." >&2;}
2336 ac_tool_warned=yes ;;
2337 esac
2338 CC=$ac_ct_CC
2339 fi
2340 else
2341 CC="$ac_cv_prog_CC"
2342 fi
2343
2344 if test -z "$CC"; then
2345 if test -n "$ac_tool_prefix"; then
2346 # Extract the first word of "${ac_tool_prefix}cc", so it can be a program name with args.
2347 set dummy ${ac_tool_prefix}cc; ac_word=$2
2348 { echo "$as_me:$LINENO: checking for $ac_word" >&5
2349 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; }
2350 if test "${ac_cv_prog_CC+set}" = set; then
2351 echo $ECHO_N "(cached) $ECHO_C" >&6
2352 else
2353 if test -n "$CC"; then
2354 ac_cv_prog_CC="$CC" # Let the user override the test.
2355 else
2356 as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
2357 for as_dir in $PATH
2358 do
2359 IFS=$as_save_IFS
2360 test -z "$as_dir" && as_dir=.
2361 for ac_exec_ext in '' $ac_executable_extensions; do
2362 if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
2363 ac_cv_prog_CC="${ac_tool_prefix}cc"
2364 echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
2365 break 2
2366 fi
2367 done
2368 done
2369 IFS=$as_save_IFS
2370
2371 fi
2372 fi
2373 CC=$ac_cv_prog_CC
2374 if test -n "$CC"; then
2375 { echo "$as_me:$LINENO: result: $CC" >&5
2376 echo "${ECHO_T}$CC" >&6; }
2377 else
2378 { echo "$as_me:$LINENO: result: no" >&5
2379 echo "${ECHO_T}no" >&6; }
2380 fi
2381
2382
2383 fi
2384 fi
2385 if test -z "$CC"; then
2386 # Extract the first word of "cc", so it can be a program name with args.
2387 set dummy cc; ac_word=$2
2388 { echo "$as_me:$LINENO: checking for $ac_word" >&5
2389 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; }
2390 if test "${ac_cv_prog_CC+set}" = set; then
2391 echo $ECHO_N "(cached) $ECHO_C" >&6
2392 else
2393 if test -n "$CC"; then
2394 ac_cv_prog_CC="$CC" # Let the user override the test.
2395 else
2396 ac_prog_rejected=no
2397 as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
2398 for as_dir in $PATH
2399 do
2400 IFS=$as_save_IFS
2401 test -z "$as_dir" && as_dir=.
2402 for ac_exec_ext in '' $ac_executable_extensions; do
2403 if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
2404 if test "$as_dir/$ac_word$ac_exec_ext" = "/usr/ucb/cc"; then
2405 ac_prog_rejected=yes
2406 continue
2407 fi
2408 ac_cv_prog_CC="cc"
2409 echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
2410 break 2
2411 fi
2412 done
2413 done
2414 IFS=$as_save_IFS
2415
2416 if test $ac_prog_rejected = yes; then
2417 # We found a bogon in the path, so make sure we never use it.
2418 set dummy $ac_cv_prog_CC
2419 shift
2420 if test $# != 0; then
2421 # We chose a different compiler from the bogus one.
2422 # However, it has the same basename, so the bogon will be chosen
2423 # first if we set CC to just the basename; use the full file name.
2424 shift
2425 ac_cv_prog_CC="$as_dir/$ac_word${1+' '}$@"
2426 fi
2427 fi
2428 fi
2429 fi
2430 CC=$ac_cv_prog_CC
2431 if test -n "$CC"; then
2432 { echo "$as_me:$LINENO: result: $CC" >&5
2433 echo "${ECHO_T}$CC" >&6; }
2434 else
2435 { echo "$as_me:$LINENO: result: no" >&5
2436 echo "${ECHO_T}no" >&6; }
2437 fi
2438
2439
2440 fi
2441 if test -z "$CC"; then
2442 if test -n "$ac_tool_prefix"; then
2443 for ac_prog in cl.exe
2444 do
2445 # Extract the first word of "$ac_tool_prefix$ac_prog", so it can be a program name with args.
2446 set dummy $ac_tool_prefix$ac_prog; ac_word=$2
2447 { echo "$as_me:$LINENO: checking for $ac_word" >&5
2448 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; }
2449 if test "${ac_cv_prog_CC+set}" = set; then
2450 echo $ECHO_N "(cached) $ECHO_C" >&6
2451 else
2452 if test -n "$CC"; then
2453 ac_cv_prog_CC="$CC" # Let the user override the test.
2454 else
2455 as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
2456 for as_dir in $PATH
2457 do
2458 IFS=$as_save_IFS
2459 test -z "$as_dir" && as_dir=.
2460 for ac_exec_ext in '' $ac_executable_extensions; do
2461 if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
2462 ac_cv_prog_CC="$ac_tool_prefix$ac_prog"
2463 echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
2464 break 2
2465 fi
2466 done
2467 done
2468 IFS=$as_save_IFS
2469
2470 fi
2471 fi
2472 CC=$ac_cv_prog_CC
2473 if test -n "$CC"; then
2474 { echo "$as_me:$LINENO: result: $CC" >&5
2475 echo "${ECHO_T}$CC" >&6; }
2476 else
2477 { echo "$as_me:$LINENO: result: no" >&5
2478 echo "${ECHO_T}no" >&6; }
2479 fi
2480
2481
2482 test -n "$CC" && break
2483 done
2484 fi
2485 if test -z "$CC"; then
2486 ac_ct_CC=$CC
2487 for ac_prog in cl.exe
2488 do
2489 # Extract the first word of "$ac_prog", so it can be a program name with args.
2490 set dummy $ac_prog; ac_word=$2
2491 { echo "$as_me:$LINENO: checking for $ac_word" >&5
2492 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; }
2493 if test "${ac_cv_prog_ac_ct_CC+set}" = set; then
2494 echo $ECHO_N "(cached) $ECHO_C" >&6
2495 else
2496 if test -n "$ac_ct_CC"; then
2497 ac_cv_prog_ac_ct_CC="$ac_ct_CC" # Let the user override the test.
2498 else
2499 as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
2500 for as_dir in $PATH
2501 do
2502 IFS=$as_save_IFS
2503 test -z "$as_dir" && as_dir=.
2504 for ac_exec_ext in '' $ac_executable_extensions; do
2505 if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
2506 ac_cv_prog_ac_ct_CC="$ac_prog"
2507 echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
2508 break 2
2509 fi
2510 done
2511 done
2512 IFS=$as_save_IFS
2513
2514 fi
2515 fi
2516 ac_ct_CC=$ac_cv_prog_ac_ct_CC
2517 if test -n "$ac_ct_CC"; then
2518 { echo "$as_me:$LINENO: result: $ac_ct_CC" >&5
2519 echo "${ECHO_T}$ac_ct_CC" >&6; }
2520 else
2521 { echo "$as_me:$LINENO: result: no" >&5
2522 echo "${ECHO_T}no" >&6; }
2523 fi
2524
2525
2526 test -n "$ac_ct_CC" && break
2527 done
2528
2529 if test "x$ac_ct_CC" = x; then
2530 CC=""
2531 else
2532 case $cross_compiling:$ac_tool_warned in
2533 yes:)
2534 { echo "$as_me:$LINENO: WARNING: In the future, Autoconf will not detect cross-tools
2535 whose name does not start with the host triplet. If you think this
2536 configuration is useful to you, please write to [email protected]." >&5
2537 echo "$as_me: WARNING: In the future, Autoconf will not detect cross-tools
2538 whose name does not start with the host triplet. If you think this
2539 configuration is useful to you, please write to [email protected]." >&2;}
2540 ac_tool_warned=yes ;;
2541 esac
2542 CC=$ac_ct_CC
2543 fi
2544 fi
2545
2546 fi
2547
2548
2549 test -z "$CC" && { { echo "$as_me:$LINENO: error: no acceptable C compiler found in \$PATH
2550 See \`config.log' for more details." >&5
2551 echo "$as_me: error: no acceptable C compiler found in \$PATH
2552 See \`config.log' for more details." >&2;}
2553 { (exit 1); exit 1; }; }
2554
2555 # Provide some information about the compiler.
2556 echo "$as_me:$LINENO: checking for C compiler version" >&5
2557 ac_compiler=`set X $ac_compile; echo $2`
2558 { (ac_try="$ac_compiler --version >&5"
2559 case "(($ac_try" in
2560 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
2561 *) ac_try_echo=$ac_try;;
2562 esac
2563 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
2564 (eval "$ac_compiler --version >&5") 2>&5
2565 ac_status=$?
2566 echo "$as_me:$LINENO: \$? = $ac_status" >&5
2567 (exit $ac_status); }
2568 { (ac_try="$ac_compiler -v >&5"
2569 case "(($ac_try" in
2570 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
2571 *) ac_try_echo=$ac_try;;
2572 esac
2573 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
2574 (eval "$ac_compiler -v >&5") 2>&5
2575 ac_status=$?
2576 echo "$as_me:$LINENO: \$? = $ac_status" >&5
2577 (exit $ac_status); }
2578 { (ac_try="$ac_compiler -V >&5"
2579 case "(($ac_try" in
2580 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
2581 *) ac_try_echo=$ac_try;;
2582 esac
2583 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
2584 (eval "$ac_compiler -V >&5") 2>&5
2585 ac_status=$?
2586 echo "$as_me:$LINENO: \$? = $ac_status" >&5
2587 (exit $ac_status); }
2588
2589 cat >conftest.$ac_ext <<_ACEOF
2590 /* confdefs.h. */
2591 _ACEOF
2592 cat confdefs.h >>conftest.$ac_ext
2593 cat >>conftest.$ac_ext <<_ACEOF
2594 /* end confdefs.h. */
2595
2596 int
2597 main ()
2598 {
2599
2600 ;
2601 return 0;
2602 }
2603 _ACEOF
2604 ac_clean_files_save=$ac_clean_files
2605 ac_clean_files="$ac_clean_files a.out a.exe b.out"
2606 # Try to create an executable without -o first, disregard a.out.
2607 # It will help us diagnose broken compilers, and finding out an intuition
2608 # of exeext.
2609 { echo "$as_me:$LINENO: checking for C compiler default output file name" >&5
2610 echo $ECHO_N "checking for C compiler default output file name... $ECHO_C" >&6; }
2611 ac_link_default=`echo "$ac_link" | sed 's/ -o *conftest[^ ]*//'`
2612 #
2613 # List of possible output files, starting from the most likely.
2614 # The algorithm is not robust to junk in `.', hence go to wildcards (a.*)
2615 # only as a last resort. b.out is created by i960 compilers.
2616 ac_files='a_out.exe a.exe conftest.exe a.out conftest a.* conftest.* b.out'
2617 #
2618 # The IRIX 6 linker writes into existing files which may not be
2619 # executable, retaining their permissions. Remove them first so a
2620 # subsequent execution test works.
2621 ac_rmfiles=
2622 for ac_file in $ac_files
2623 do
2624 case $ac_file in
2625 *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.o | *.obj ) ;;
2626 * ) ac_rmfiles="$ac_rmfiles $ac_file";;
2627 esac
2628 done
2629 rm -f $ac_rmfiles
2630
2631 if { (ac_try="$ac_link_default"
2632 case "(($ac_try" in
2633 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
2634 *) ac_try_echo=$ac_try;;
2635 esac
2636 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
2637 (eval "$ac_link_default") 2>&5
2638 ac_status=$?
2639 echo "$as_me:$LINENO: \$? = $ac_status" >&5
2640 (exit $ac_status); }; then
2641 # Autoconf-2.13 could set the ac_cv_exeext variable to `no'.
2642 # So ignore a value of `no', otherwise this would lead to `EXEEXT = no'
2643 # in a Makefile. We should not override ac_cv_exeext if it was cached,
2644 # so that the user can short-circuit this test for compilers unknown to
2645 # Autoconf.
2646 for ac_file in $ac_files ''
2647 do
2648 test -f "$ac_file" || continue
2649 case $ac_file in
2650 *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.o | *.obj )
2651 ;;
2652 [ab].out )
2653 # We found the default executable, but exeext='' is most
2654 # certainly right.
2655 break;;
2656 *.* )
2657 if test "${ac_cv_exeext+set}" = set && test "$ac_cv_exeext" != no;
2658 then :; else
2659 ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'`
2660 fi
2661 # We set ac_cv_exeext here because the later test for it is not
2662 # safe: cross compilers may not add the suffix if given an `-o'
2663 # argument, so we may need to know it at that point already.
2664 # Even if this section looks crufty: it has the advantage of
2665 # actually working.
2666 break;;
2667 * )
2668 break;;
2669 esac
2670 done
2671 test "$ac_cv_exeext" = no && ac_cv_exeext=
2672
2673 else
2674 ac_file=''
2675 fi
2676
2677 { echo "$as_me:$LINENO: result: $ac_file" >&5
2678 echo "${ECHO_T}$ac_file" >&6; }
2679 if test -z "$ac_file"; then
2680 echo "$as_me: failed program was:" >&5
2681 sed 's/^/| /' conftest.$ac_ext >&5
2682
2683 { { echo "$as_me:$LINENO: error: C compiler cannot create executables
2684 See \`config.log' for more details." >&5
2685 echo "$as_me: error: C compiler cannot create executables
2686 See \`config.log' for more details." >&2;}
2687 { (exit 77); exit 77; }; }
2688 fi
2689
2690 ac_exeext=$ac_cv_exeext
2691
2692 # Check that the compiler produces executables we can run. If not, either
2693 # the compiler is broken, or we cross compile.
2694 { echo "$as_me:$LINENO: checking whether the C compiler works" >&5
2695 echo $ECHO_N "checking whether the C compiler works... $ECHO_C" >&6; }
2696 # FIXME: These cross compiler hacks should be removed for Autoconf 3.0
2697 # If not cross compiling, check that we can run a simple program.
2698 if test "$cross_compiling" != yes; then
2699 if { ac_try='./$ac_file'
2700 { (case "(($ac_try" in
2701 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
2702 *) ac_try_echo=$ac_try;;
2703 esac
2704 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
2705 (eval "$ac_try") 2>&5
2706 ac_status=$?
2707 echo "$as_me:$LINENO: \$? = $ac_status" >&5
2708 (exit $ac_status); }; }; then
2709 cross_compiling=no
2710 else
2711 if test "$cross_compiling" = maybe; then
2712 cross_compiling=yes
2713 else
2714 { { echo "$as_me:$LINENO: error: cannot run C compiled programs.
2715 If you meant to cross compile, use \`--host'.
2716 See \`config.log' for more details." >&5
2717 echo "$as_me: error: cannot run C compiled programs.
2718 If you meant to cross compile, use \`--host'.
2719 See \`config.log' for more details." >&2;}
2720 { (exit 1); exit 1; }; }
2721 fi
2722 fi
2723 fi
2724 { echo "$as_me:$LINENO: result: yes" >&5
2725 echo "${ECHO_T}yes" >&6; }
2726
2727 rm -f a.out a.exe conftest$ac_cv_exeext b.out
2728 ac_clean_files=$ac_clean_files_save
2729 # Check that the compiler produces executables we can run. If not, either
2730 # the compiler is broken, or we cross compile.
2731 { echo "$as_me:$LINENO: checking whether we are cross compiling" >&5
2732 echo $ECHO_N "checking whether we are cross compiling... $ECHO_C" >&6; }
2733 { echo "$as_me:$LINENO: result: $cross_compiling" >&5
2734 echo "${ECHO_T}$cross_compiling" >&6; }
2735
2736 { echo "$as_me:$LINENO: checking for suffix of executables" >&5
2737 echo $ECHO_N "checking for suffix of executables... $ECHO_C" >&6; }
2738 if { (ac_try="$ac_link"
2739 case "(($ac_try" in
2740 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
2741 *) ac_try_echo=$ac_try;;
2742 esac
2743 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
2744 (eval "$ac_link") 2>&5
2745 ac_status=$?
2746 echo "$as_me:$LINENO: \$? = $ac_status" >&5
2747 (exit $ac_status); }; then
2748 # If both `conftest.exe' and `conftest' are `present' (well, observable)
2749 # catch `conftest.exe'. For instance with Cygwin, `ls conftest' will
2750 # work properly (i.e., refer to `conftest.exe'), while it won't with
2751 # `rm'.
2752 for ac_file in conftest.exe conftest conftest.*; do
2753 test -f "$ac_file" || continue
2754 case $ac_file in
2755 *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf | *.o | *.obj ) ;;
2756 *.* ) ac_cv_exeext=`expr "$ac_file" : '[^.]*\(\..*\)'`
2757 break;;
2758 * ) break;;
2759 esac
2760 done
2761 else
2762 { { echo "$as_me:$LINENO: error: cannot compute suffix of executables: cannot compile and link
2763 See \`config.log' for more details." >&5
2764 echo "$as_me: error: cannot compute suffix of executables: cannot compile and link
2765 See \`config.log' for more details." >&2;}
2766 { (exit 1); exit 1; }; }
2767 fi
2768
2769 rm -f conftest$ac_cv_exeext
2770 { echo "$as_me:$LINENO: result: $ac_cv_exeext" >&5
2771 echo "${ECHO_T}$ac_cv_exeext" >&6; }
2772
2773 rm -f conftest.$ac_ext
2774 EXEEXT=$ac_cv_exeext
2775 ac_exeext=$EXEEXT
2776 { echo "$as_me:$LINENO: checking for suffix of object files" >&5
2777 echo $ECHO_N "checking for suffix of object files... $ECHO_C" >&6; }
2778 if test "${ac_cv_objext+set}" = set; then
2779 echo $ECHO_N "(cached) $ECHO_C" >&6
2780 else
2781 cat >conftest.$ac_ext <<_ACEOF
2782 /* confdefs.h. */
2783 _ACEOF
2784 cat confdefs.h >>conftest.$ac_ext
2785 cat >>conftest.$ac_ext <<_ACEOF
2786 /* end confdefs.h. */
2787
2788 int
2789 main ()
2790 {
2791
2792 ;
2793 return 0;
2794 }
2795 _ACEOF
2796 rm -f conftest.o conftest.obj
2797 if { (ac_try="$ac_compile"
2798 case "(($ac_try" in
2799 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
2800 *) ac_try_echo=$ac_try;;
2801 esac
2802 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
2803 (eval "$ac_compile") 2>&5
2804 ac_status=$?
2805 echo "$as_me:$LINENO: \$? = $ac_status" >&5
2806 (exit $ac_status); }; then
2807 for ac_file in conftest.o conftest.obj conftest.*; do
2808 test -f "$ac_file" || continue;
2809 case $ac_file in
2810 *.$ac_ext | *.xcoff | *.tds | *.d | *.pdb | *.xSYM | *.bb | *.bbg | *.map | *.inf ) ;;
2811 *) ac_cv_objext=`expr "$ac_file" : '.*\.\(.*\)'`
2812 break;;
2813 esac
2814 done
2815 else
2816 echo "$as_me: failed program was:" >&5
2817 sed 's/^/| /' conftest.$ac_ext >&5
2818
2819 { { echo "$as_me:$LINENO: error: cannot compute suffix of object files: cannot compile
2820 See \`config.log' for more details." >&5
2821 echo "$as_me: error: cannot compute suffix of object files: cannot compile
2822 See \`config.log' for more details." >&2;}
2823 { (exit 1); exit 1; }; }
2824 fi
2825
2826 rm -f conftest.$ac_cv_objext conftest.$ac_ext
2827 fi
2828 { echo "$as_me:$LINENO: result: $ac_cv_objext" >&5
2829 echo "${ECHO_T}$ac_cv_objext" >&6; }
2830 OBJEXT=$ac_cv_objext
2831 ac_objext=$OBJEXT
2832 { echo "$as_me:$LINENO: checking whether we are using the GNU C compiler" >&5
2833 echo $ECHO_N "checking whether we are using the GNU C compiler... $ECHO_C" >&6; }
2834 if test "${ac_cv_c_compiler_gnu+set}" = set; then
2835 echo $ECHO_N "(cached) $ECHO_C" >&6
2836 else
2837 cat >conftest.$ac_ext <<_ACEOF
2838 /* confdefs.h. */
2839 _ACEOF
2840 cat confdefs.h >>conftest.$ac_ext
2841 cat >>conftest.$ac_ext <<_ACEOF
2842 /* end confdefs.h. */
2843
2844 int
2845 main ()
2846 {
2847 #ifndef __GNUC__
2848 choke me
2849 #endif
2850
2851 ;
2852 return 0;
2853 }
2854 _ACEOF
2855 rm -f conftest.$ac_objext
2856 if { (ac_try="$ac_compile"
2857 case "(($ac_try" in
2858 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
2859 *) ac_try_echo=$ac_try;;
2860 esac
2861 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
2862 (eval "$ac_compile") 2>conftest.er1
2863 ac_status=$?
2864 grep -v '^ *+' conftest.er1 >conftest.err
2865 rm -f conftest.er1
2866 cat conftest.err >&5
2867 echo "$as_me:$LINENO: \$? = $ac_status" >&5
2868 (exit $ac_status); } && {
2869 test -z "$ac_c_werror_flag" ||
2870 test ! -s conftest.err
2871 } && test -s conftest.$ac_objext; then
2872 ac_compiler_gnu=yes
2873 else
2874 echo "$as_me: failed program was:" >&5
2875 sed 's/^/| /' conftest.$ac_ext >&5
2876
2877 ac_compiler_gnu=no
2878 fi
2879
2880 rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
2881 ac_cv_c_compiler_gnu=$ac_compiler_gnu
2882
2883 fi
2884 { echo "$as_me:$LINENO: result: $ac_cv_c_compiler_gnu" >&5
2885 echo "${ECHO_T}$ac_cv_c_compiler_gnu" >&6; }
2886 GCC=`test $ac_compiler_gnu = yes && echo yes`
2887 ac_test_CFLAGS=${CFLAGS+set}
2888 ac_save_CFLAGS=$CFLAGS
2889 { echo "$as_me:$LINENO: checking whether $CC accepts -g" >&5
2890 echo $ECHO_N "checking whether $CC accepts -g... $ECHO_C" >&6; }
2891 if test "${ac_cv_prog_cc_g+set}" = set; then
2892 echo $ECHO_N "(cached) $ECHO_C" >&6
2893 else
2894 ac_save_c_werror_flag=$ac_c_werror_flag
2895 ac_c_werror_flag=yes
2896 ac_cv_prog_cc_g=no
2897 CFLAGS="-g"
2898 cat >conftest.$ac_ext <<_ACEOF
2899 /* confdefs.h. */
2900 _ACEOF
2901 cat confdefs.h >>conftest.$ac_ext
2902 cat >>conftest.$ac_ext <<_ACEOF
2903 /* end confdefs.h. */
2904
2905 int
2906 main ()
2907 {
2908
2909 ;
2910 return 0;
2911 }
2912 _ACEOF
2913 rm -f conftest.$ac_objext
2914 if { (ac_try="$ac_compile"
2915 case "(($ac_try" in
2916 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
2917 *) ac_try_echo=$ac_try;;
2918 esac
2919 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
2920 (eval "$ac_compile") 2>conftest.er1
2921 ac_status=$?
2922 grep -v '^ *+' conftest.er1 >conftest.err
2923 rm -f conftest.er1
2924 cat conftest.err >&5
2925 echo "$as_me:$LINENO: \$? = $ac_status" >&5
2926 (exit $ac_status); } && {
2927 test -z "$ac_c_werror_flag" ||
2928 test ! -s conftest.err
2929 } && test -s conftest.$ac_objext; then
2930 ac_cv_prog_cc_g=yes
2931 else
2932 echo "$as_me: failed program was:" >&5
2933 sed 's/^/| /' conftest.$ac_ext >&5
2934
2935 CFLAGS=""
2936 cat >conftest.$ac_ext <<_ACEOF
2937 /* confdefs.h. */
2938 _ACEOF
2939 cat confdefs.h >>conftest.$ac_ext
2940 cat >>conftest.$ac_ext <<_ACEOF
2941 /* end confdefs.h. */
2942
2943 int
2944 main ()
2945 {
2946
2947 ;
2948 return 0;
2949 }
2950 _ACEOF
2951 rm -f conftest.$ac_objext
2952 if { (ac_try="$ac_compile"
2953 case "(($ac_try" in
2954 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
2955 *) ac_try_echo=$ac_try;;
2956 esac
2957 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
2958 (eval "$ac_compile") 2>conftest.er1
2959 ac_status=$?
2960 grep -v '^ *+' conftest.er1 >conftest.err
2961 rm -f conftest.er1
2962 cat conftest.err >&5
2963 echo "$as_me:$LINENO: \$? = $ac_status" >&5
2964 (exit $ac_status); } && {
2965 test -z "$ac_c_werror_flag" ||
2966 test ! -s conftest.err
2967 } && test -s conftest.$ac_objext; then
2968 :
2969 else
2970 echo "$as_me: failed program was:" >&5
2971 sed 's/^/| /' conftest.$ac_ext >&5
2972
2973 ac_c_werror_flag=$ac_save_c_werror_flag
2974 CFLAGS="-g"
2975 cat >conftest.$ac_ext <<_ACEOF
2976 /* confdefs.h. */
2977 _ACEOF
2978 cat confdefs.h >>conftest.$ac_ext
2979 cat >>conftest.$ac_ext <<_ACEOF
2980 /* end confdefs.h. */
2981
2982 int
2983 main ()
2984 {
2985
2986 ;
2987 return 0;
2988 }
2989 _ACEOF
2990 rm -f conftest.$ac_objext
2991 if { (ac_try="$ac_compile"
2992 case "(($ac_try" in
2993 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
2994 *) ac_try_echo=$ac_try;;
2995 esac
2996 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
2997 (eval "$ac_compile") 2>conftest.er1
2998 ac_status=$?
2999 grep -v '^ *+' conftest.er1 >conftest.err
3000 rm -f conftest.er1
3001 cat conftest.err >&5
3002 echo "$as_me:$LINENO: \$? = $ac_status" >&5
3003 (exit $ac_status); } && {
3004 test -z "$ac_c_werror_flag" ||
3005 test ! -s conftest.err
3006 } && test -s conftest.$ac_objext; then
3007 ac_cv_prog_cc_g=yes
3008 else
3009 echo "$as_me: failed program was:" >&5
3010 sed 's/^/| /' conftest.$ac_ext >&5
3011
3012
3013 fi
3014
3015 rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
3016 fi
3017
3018 rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
3019 fi
3020
3021 rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
3022 ac_c_werror_flag=$ac_save_c_werror_flag
3023 fi
3024 { echo "$as_me:$LINENO: result: $ac_cv_prog_cc_g" >&5
3025 echo "${ECHO_T}$ac_cv_prog_cc_g" >&6; }
3026 if test "$ac_test_CFLAGS" = set; then
3027 CFLAGS=$ac_save_CFLAGS
3028 elif test $ac_cv_prog_cc_g = yes; then
3029 if test "$GCC" = yes; then
3030 CFLAGS="-g -O2"
3031 else
3032 CFLAGS="-g"
3033 fi
3034 else
3035 if test "$GCC" = yes; then
3036 CFLAGS="-O2"
3037 else
3038 CFLAGS=
3039 fi
3040 fi
3041 { echo "$as_me:$LINENO: checking for $CC option to accept ISO C89" >&5
3042 echo $ECHO_N "checking for $CC option to accept ISO C89... $ECHO_C" >&6; }
3043 if test "${ac_cv_prog_cc_c89+set}" = set; then
3044 echo $ECHO_N "(cached) $ECHO_C" >&6
3045 else
3046 ac_cv_prog_cc_c89=no
3047 ac_save_CC=$CC
3048 cat >conftest.$ac_ext <<_ACEOF
3049 /* confdefs.h. */
3050 _ACEOF
3051 cat confdefs.h >>conftest.$ac_ext
3052 cat >>conftest.$ac_ext <<_ACEOF
3053 /* end confdefs.h. */
3054 #include <stdarg.h>
3055 #include <stdio.h>
3056 #include <sys/types.h>
3057 #include <sys/stat.h>
3058 /* Most of the following tests are stolen from RCS 5.7's src/conf.sh. */
3059 struct buf { int x; };
3060 FILE * (*rcsopen) (struct buf *, struct stat *, int);
3061 static char *e (p, i)
3062 char **p;
3063 int i;
3064 {
3065 return p[i];
3066 }
3067 static char *f (char * (*g) (char **, int), char **p, ...)
3068 {
3069 char *s;
3070 va_list v;
3071 va_start (v,p);
3072 s = g (p, va_arg (v,int));
3073 va_end (v);
3074 return s;
3075 }
3076
3077 /* OSF 4.0 Compaq cc is some sort of almost-ANSI by default. It has
3078 function prototypes and stuff, but not '\xHH' hex character constants.
3079 These don't provoke an error unfortunately, instead are silently treated
3080 as 'x'. The following induces an error, until -std is added to get
3081 proper ANSI mode. Curiously '\x00'!='x' always comes out true, for an
3082 array size at least. It's necessary to write '\x00'==0 to get something
3083 that's true only with -std. */
3084 int osf4_cc_array ['\x00' == 0 ? 1 : -1];
3085
3086 /* IBM C 6 for AIX is almost-ANSI by default, but it replaces macro parameters
3087 inside strings and character constants. */
3088 #define FOO(x) 'x'
3089 int xlc6_cc_array[FOO(a) == 'x' ? 1 : -1];
3090
3091 int test (int i, double x);
3092 struct s1 {int (*f) (int a);};
3093 struct s2 {int (*f) (double a);};
3094 int pairnames (int, char **, FILE *(*)(struct buf *, struct stat *, int), int, int);
3095 int argc;
3096 char **argv;
3097 int
3098 main ()
3099 {
3100 return f (e, argv, 0) != argv[0] || f (e, argv, 1) != argv[1];
3101 ;
3102 return 0;
3103 }
3104 _ACEOF
3105 for ac_arg in '' -qlanglvl=extc89 -qlanglvl=ansi -std \
3106 -Ae "-Aa -D_HPUX_SOURCE" "-Xc -D__EXTENSIONS__"
3107 do
3108 CC="$ac_save_CC $ac_arg"
3109 rm -f conftest.$ac_objext
3110 if { (ac_try="$ac_compile"
3111 case "(($ac_try" in
3112 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
3113 *) ac_try_echo=$ac_try;;
3114 esac
3115 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
3116 (eval "$ac_compile") 2>conftest.er1
3117 ac_status=$?
3118 grep -v '^ *+' conftest.er1 >conftest.err
3119 rm -f conftest.er1
3120 cat conftest.err >&5
3121 echo "$as_me:$LINENO: \$? = $ac_status" >&5
3122 (exit $ac_status); } && {
3123 test -z "$ac_c_werror_flag" ||
3124 test ! -s conftest.err
3125 } && test -s conftest.$ac_objext; then
3126 ac_cv_prog_cc_c89=$ac_arg
3127 else
3128 echo "$as_me: failed program was:" >&5
3129 sed 's/^/| /' conftest.$ac_ext >&5
3130
3131
3132 fi
3133
3134 rm -f core conftest.err conftest.$ac_objext
3135 test "x$ac_cv_prog_cc_c89" != "xno" && break
3136 done
3137 rm -f conftest.$ac_ext
3138 CC=$ac_save_CC
3139
3140 fi
3141 # AC_CACHE_VAL
3142 case "x$ac_cv_prog_cc_c89" in
3143 x)
3144 { echo "$as_me:$LINENO: result: none needed" >&5
3145 echo "${ECHO_T}none needed" >&6; } ;;
3146 xno)
3147 { echo "$as_me:$LINENO: result: unsupported" >&5
3148 echo "${ECHO_T}unsupported" >&6; } ;;
3149 *)
3150 CC="$CC $ac_cv_prog_cc_c89"
3151 { echo "$as_me:$LINENO: result: $ac_cv_prog_cc_c89" >&5
3152 echo "${ECHO_T}$ac_cv_prog_cc_c89" >&6; } ;;
3153 esac
3154
3155
3156 ac_ext=c
3157 ac_cpp='$CPP $CPPFLAGS'
3158 ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
3159 ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
3160 ac_compiler_gnu=$ac_cv_c_compiler_gnu
3161 DEPDIR="${am__leading_dot}deps"
3162
3163 ac_config_commands="$ac_config_commands depfiles"
3164
3165
3166 am_make=${MAKE-make}
3167 cat > confinc << 'END'
3168 am__doit:
3169 @echo done
3170 .PHONY: am__doit
3171 END
3172 # If we don't find an include directive, just comment out the code.
3173 { echo "$as_me:$LINENO: checking for style of include used by $am_make" >&5
3174 echo $ECHO_N "checking for style of include used by $am_make... $ECHO_C" >&6; }
3175 am__include="#"
3176 am__quote=
3177 _am_result=none
3178 # First try GNU make style include.
3179 echo "include confinc" > confmf
3180 # We grep out `Entering directory' and `Leaving directory'
3181 # messages which can occur if `w' ends up in MAKEFLAGS.
3182 # In particular we don't look at `^make:' because GNU make might
3183 # be invoked under some other name (usually "gmake"), in which
3184 # case it prints its new name instead of `make'.
3185 if test "`$am_make -s -f confmf 2> /dev/null | grep -v 'ing directory'`" = "done"; then
3186 am__include=include
3187 am__quote=
3188 _am_result=GNU
3189 fi
3190 # Now try BSD make style include.
3191 if test "$am__include" = "#"; then
3192 echo '.include "confinc"' > confmf
3193 if test "`$am_make -s -f confmf 2> /dev/null`" = "done"; then
3194 am__include=.include
3195 am__quote="\""
3196 _am_result=BSD
3197 fi
3198 fi
3199
3200
3201 { echo "$as_me:$LINENO: result: $_am_result" >&5
3202 echo "${ECHO_T}$_am_result" >&6; }
3203 rm -f confinc confmf
3204
3205 # Check whether --enable-dependency-tracking was given.
3206 if test "${enable_dependency_tracking+set}" = set; then
3207 enableval=$enable_dependency_tracking;
3208 fi
3209
3210 if test "x$enable_dependency_tracking" != xno; then
3211 am_depcomp="$ac_aux_dir/depcomp"
3212 AMDEPBACKSLASH='\'
3213 fi
3214 if test "x$enable_dependency_tracking" != xno; then
3215 AMDEP_TRUE=
3216 AMDEP_FALSE='#'
3217 else
3218 AMDEP_TRUE='#'
3219 AMDEP_FALSE=
3220 fi
3221
3222
3223
3224 depcc="$CC" am_compiler_list=
3225
3226 { echo "$as_me:$LINENO: checking dependency style of $depcc" >&5
3227 echo $ECHO_N "checking dependency style of $depcc... $ECHO_C" >&6; }
3228 if test "${am_cv_CC_dependencies_compiler_type+set}" = set; then
3229 echo $ECHO_N "(cached) $ECHO_C" >&6
3230 else
3231 if test -z "$AMDEP_TRUE" && test -f "$am_depcomp"; then
3232 # We make a subdir and do the tests there. Otherwise we can end up
3233 # making bogus files that we don't know about and never remove. For
3234 # instance it was reported that on HP-UX the gcc test will end up
3235 # making a dummy file named `D' -- because `-MD' means `put the output
3236 # in D'.
3237 mkdir conftest.dir
3238 # Copy depcomp to subdir because otherwise we won't find it if we're
3239 # using a relative directory.
3240 cp "$am_depcomp" conftest.dir
3241 cd conftest.dir
3242 # We will build objects and dependencies in a subdirectory because
3243 # it helps to detect inapplicable dependency modes. For instance
3244 # both Tru64's cc and ICC support -MD to output dependencies as a
3245 # side effect of compilation, but ICC will put the dependencies in
3246 # the current directory while Tru64 will put them in the object
3247 # directory.
3248 mkdir sub
3249
3250 am_cv_CC_dependencies_compiler_type=none
3251 if test "$am_compiler_list" = ""; then
3252 am_compiler_list=`sed -n 's/^#*\([a-zA-Z0-9]*\))$/\1/p' < ./depcomp`
3253 fi
3254 for depmode in $am_compiler_list; do
3255 # Setup a source with many dependencies, because some compilers
3256 # like to wrap large dependency lists on column 80 (with \), and
3257 # we should not choose a depcomp mode which is confused by this.
3258 #
3259 # We need to recreate these files for each test, as the compiler may
3260 # overwrite some of them when testing with obscure command lines.
3261 # This happens at least with the AIX C compiler.
3262 : > sub/conftest.c
3263 for i in 1 2 3 4 5 6; do
3264 echo '#include "conftst'$i'.h"' >> sub/conftest.c
3265 # Using `: > sub/conftst$i.h' creates only sub/conftst1.h with
3266 # Solaris 8's {/usr,}/bin/sh.
3267 touch sub/conftst$i.h
3268 done
3269 echo "${am__include} ${am__quote}sub/conftest.Po${am__quote}" > confmf
3270
3271 case $depmode in
3272 nosideeffect)
3273 # after this tag, mechanisms are not by side-effect, so they'll
3274 # only be used when explicitly requested
3275 if test "x$enable_dependency_tracking" = xyes; then
3276 continue
3277 else
3278 break
3279 fi
3280 ;;
3281 none) break ;;
3282 esac
3283 # We check with `-c' and `-o' for the sake of the "dashmstdout"
3284 # mode. It turns out that the SunPro C++ compiler does not properly
3285 # handle `-M -o', and we need to detect this.
3286 if depmode=$depmode \
3287 source=sub/conftest.c object=sub/conftest.${OBJEXT-o} \
3288 depfile=sub/conftest.Po tmpdepfile=sub/conftest.TPo \
3289 $SHELL ./depcomp $depcc -c -o sub/conftest.${OBJEXT-o} sub/conftest.c \
3290 >/dev/null 2>conftest.err &&
3291 grep sub/conftst1.h sub/conftest.Po > /dev/null 2>&1 &&
3292 grep sub/conftst6.h sub/conftest.Po > /dev/null 2>&1 &&
3293 grep sub/conftest.${OBJEXT-o} sub/conftest.Po > /dev/null 2>&1 &&
3294 ${MAKE-make} -s -f confmf > /dev/null 2>&1; then
3295 # icc doesn't choke on unknown options, it will just issue warnings
3296 # or remarks (even with -Werror). So we grep stderr for any message
3297 # that says an option was ignored or not supported.
3298 # When given -MP, icc 7.0 and 7.1 complain thusly:
3299 # icc: Command line warning: ignoring option '-M'; no argument required
3300 # The diagnosis changed in icc 8.0:
3301 # icc: Command line remark: option '-MP' not supported
3302 if (grep 'ignoring option' conftest.err ||
3303 grep 'not supported' conftest.err) >/dev/null 2>&1; then :; else
3304 am_cv_CC_dependencies_compiler_type=$depmode
3305 break
3306 fi
3307 fi
3308 done
3309
3310 cd ..
3311 rm -rf conftest.dir
3312 else
3313 am_cv_CC_dependencies_compiler_type=none
3314 fi
3315
3316 fi
3317 { echo "$as_me:$LINENO: result: $am_cv_CC_dependencies_compiler_type" >&5
3318 echo "${ECHO_T}$am_cv_CC_dependencies_compiler_type" >&6; }
3319 CCDEPMODE=depmode=$am_cv_CC_dependencies_compiler_type
3320
3321 if
3322 test "x$enable_dependency_tracking" != xno \
3323 && test "$am_cv_CC_dependencies_compiler_type" = gcc3; then
3324 am__fastdepCC_TRUE=
3325 am__fastdepCC_FALSE='#'
3326 else
3327 am__fastdepCC_TRUE='#'
3328 am__fastdepCC_FALSE=
3329 fi
3330
3331
3332
3333 for ac_prog in flex lex
3334 do
3335 # Extract the first word of "$ac_prog", so it can be a program name with args.
3336 set dummy $ac_prog; ac_word=$2
3337 { echo "$as_me:$LINENO: checking for $ac_word" >&5
3338 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; }
3339 if test "${ac_cv_prog_LEX+set}" = set; then
3340 echo $ECHO_N "(cached) $ECHO_C" >&6
3341 else
3342 if test -n "$LEX"; then
3343 ac_cv_prog_LEX="$LEX" # Let the user override the test.
3344 else
3345 as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
3346 for as_dir in $PATH
3347 do
3348 IFS=$as_save_IFS
3349 test -z "$as_dir" && as_dir=.
3350 for ac_exec_ext in '' $ac_executable_extensions; do
3351 if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
3352 ac_cv_prog_LEX="$ac_prog"
3353 echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
3354 break 2
3355 fi
3356 done
3357 done
3358 IFS=$as_save_IFS
3359
3360 fi
3361 fi
3362 LEX=$ac_cv_prog_LEX
3363 if test -n "$LEX"; then
3364 { echo "$as_me:$LINENO: result: $LEX" >&5
3365 echo "${ECHO_T}$LEX" >&6; }
3366 else
3367 { echo "$as_me:$LINENO: result: no" >&5
3368 echo "${ECHO_T}no" >&6; }
3369 fi
3370
3371
3372 test -n "$LEX" && break
3373 done
3374 test -n "$LEX" || LEX=":"
3375
3376 if test "x$LEX" != "x:"; then
3377 cat >conftest.l <<_ACEOF
3378 %%
3379 a { ECHO; }
3380 b { REJECT; }
3381 c { yymore (); }
3382 d { yyless (1); }
3383 e { yyless (input () != 0); }
3384 f { unput (yytext[0]); }
3385 . { BEGIN INITIAL; }
3386 %%
3387 #ifdef YYTEXT_POINTER
3388 extern char *yytext;
3389 #endif
3390 int
3391 main (void)
3392 {
3393 return ! yylex () + ! yywrap ();
3394 }
3395 _ACEOF
3396 { (ac_try="$LEX conftest.l"
3397 case "(($ac_try" in
3398 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
3399 *) ac_try_echo=$ac_try;;
3400 esac
3401 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
3402 (eval "$LEX conftest.l") 2>&5
3403 ac_status=$?
3404 echo "$as_me:$LINENO: \$? = $ac_status" >&5
3405 (exit $ac_status); }
3406 { echo "$as_me:$LINENO: checking lex output file root" >&5
3407 echo $ECHO_N "checking lex output file root... $ECHO_C" >&6; }
3408 if test "${ac_cv_prog_lex_root+set}" = set; then
3409 echo $ECHO_N "(cached) $ECHO_C" >&6
3410 else
3411
3412 if test -f lex.yy.c; then
3413 ac_cv_prog_lex_root=lex.yy
3414 elif test -f lexyy.c; then
3415 ac_cv_prog_lex_root=lexyy
3416 else
3417 { { echo "$as_me:$LINENO: error: cannot find output from $LEX; giving up" >&5
3418 echo "$as_me: error: cannot find output from $LEX; giving up" >&2;}
3419 { (exit 1); exit 1; }; }
3420 fi
3421 fi
3422 { echo "$as_me:$LINENO: result: $ac_cv_prog_lex_root" >&5
3423 echo "${ECHO_T}$ac_cv_prog_lex_root" >&6; }
3424 LEX_OUTPUT_ROOT=$ac_cv_prog_lex_root
3425
3426 if test -z "${LEXLIB+set}"; then
3427 { echo "$as_me:$LINENO: checking lex library" >&5
3428 echo $ECHO_N "checking lex library... $ECHO_C" >&6; }
3429 if test "${ac_cv_lib_lex+set}" = set; then
3430 echo $ECHO_N "(cached) $ECHO_C" >&6
3431 else
3432
3433 ac_save_LIBS=$LIBS
3434 ac_cv_lib_lex='none needed'
3435 for ac_lib in '' -lfl -ll; do
3436 LIBS="$ac_lib $ac_save_LIBS"
3437 cat >conftest.$ac_ext <<_ACEOF
3438 `cat $LEX_OUTPUT_ROOT.c`
3439 _ACEOF
3440 rm -f conftest.$ac_objext conftest$ac_exeext
3441 if { (ac_try="$ac_link"
3442 case "(($ac_try" in
3443 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
3444 *) ac_try_echo=$ac_try;;
3445 esac
3446 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
3447 (eval "$ac_link") 2>conftest.er1
3448 ac_status=$?
3449 grep -v '^ *+' conftest.er1 >conftest.err
3450 rm -f conftest.er1
3451 cat conftest.err >&5
3452 echo "$as_me:$LINENO: \$? = $ac_status" >&5
3453 (exit $ac_status); } && {
3454 test -z "$ac_c_werror_flag" ||
3455 test ! -s conftest.err
3456 } && test -s conftest$ac_exeext &&
3457 $as_test_x conftest$ac_exeext; then
3458 ac_cv_lib_lex=$ac_lib
3459 else
3460 echo "$as_me: failed program was:" >&5
3461 sed 's/^/| /' conftest.$ac_ext >&5
3462
3463
3464 fi
3465
3466 rm -f core conftest.err conftest.$ac_objext conftest_ipa8_conftest.oo \
3467 conftest$ac_exeext conftest.$ac_ext
3468 test "$ac_cv_lib_lex" != 'none needed' && break
3469 done
3470 LIBS=$ac_save_LIBS
3471
3472 fi
3473 { echo "$as_me:$LINENO: result: $ac_cv_lib_lex" >&5
3474 echo "${ECHO_T}$ac_cv_lib_lex" >&6; }
3475 test "$ac_cv_lib_lex" != 'none needed' && LEXLIB=$ac_cv_lib_lex
3476 fi
3477
3478
3479 { echo "$as_me:$LINENO: checking whether yytext is a pointer" >&5
3480 echo $ECHO_N "checking whether yytext is a pointer... $ECHO_C" >&6; }
3481 if test "${ac_cv_prog_lex_yytext_pointer+set}" = set; then
3482 echo $ECHO_N "(cached) $ECHO_C" >&6
3483 else
3484 # POSIX says lex can declare yytext either as a pointer or an array; the
3485 # default is implementation-dependent. Figure out which it is, since
3486 # not all implementations provide the %pointer and %array declarations.
3487 ac_cv_prog_lex_yytext_pointer=no
3488 ac_save_LIBS=$LIBS
3489 LIBS="$LEXLIB $ac_save_LIBS"
3490 cat >conftest.$ac_ext <<_ACEOF
3491 #define YYTEXT_POINTER 1
3492 `cat $LEX_OUTPUT_ROOT.c`
3493 _ACEOF
3494 rm -f conftest.$ac_objext conftest$ac_exeext
3495 if { (ac_try="$ac_link"
3496 case "(($ac_try" in
3497 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
3498 *) ac_try_echo=$ac_try;;
3499 esac
3500 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
3501 (eval "$ac_link") 2>conftest.er1
3502 ac_status=$?
3503 grep -v '^ *+' conftest.er1 >conftest.err
3504 rm -f conftest.er1
3505 cat conftest.err >&5
3506 echo "$as_me:$LINENO: \$? = $ac_status" >&5
3507 (exit $ac_status); } && {
3508 test -z "$ac_c_werror_flag" ||
3509 test ! -s conftest.err
3510 } && test -s conftest$ac_exeext &&
3511 $as_test_x conftest$ac_exeext; then
3512 ac_cv_prog_lex_yytext_pointer=yes
3513 else
3514 echo "$as_me: failed program was:" >&5
3515 sed 's/^/| /' conftest.$ac_ext >&5
3516
3517
3518 fi
3519
3520 rm -f core conftest.err conftest.$ac_objext conftest_ipa8_conftest.oo \
3521 conftest$ac_exeext conftest.$ac_ext
3522 LIBS=$ac_save_LIBS
3523
3524 fi
3525 { echo "$as_me:$LINENO: result: $ac_cv_prog_lex_yytext_pointer" >&5
3526 echo "${ECHO_T}$ac_cv_prog_lex_yytext_pointer" >&6; }
3527 if test $ac_cv_prog_lex_yytext_pointer = yes; then
3528
3529 cat >>confdefs.h <<\_ACEOF
3530 #define YYTEXT_POINTER 1
3531 _ACEOF
3532
3533 fi
3534 rm -f conftest.l $LEX_OUTPUT_ROOT.c
3535
3536 fi
3537 for ac_prog in 'bison -y' byacc
3538 do
3539 # Extract the first word of "$ac_prog", so it can be a program name with args.
3540 set dummy $ac_prog; ac_word=$2
3541 { echo "$as_me:$LINENO: checking for $ac_word" >&5
3542 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; }
3543 if test "${ac_cv_prog_YACC+set}" = set; then
3544 echo $ECHO_N "(cached) $ECHO_C" >&6
3545 else
3546 if test -n "$YACC"; then
3547 ac_cv_prog_YACC="$YACC" # Let the user override the test.
3548 else
3549 as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
3550 for as_dir in $PATH
3551 do
3552 IFS=$as_save_IFS
3553 test -z "$as_dir" && as_dir=.
3554 for ac_exec_ext in '' $ac_executable_extensions; do
3555 if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
3556 ac_cv_prog_YACC="$ac_prog"
3557 echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
3558 break 2
3559 fi
3560 done
3561 done
3562 IFS=$as_save_IFS
3563
3564 fi
3565 fi
3566 YACC=$ac_cv_prog_YACC
3567 if test -n "$YACC"; then
3568 { echo "$as_me:$LINENO: result: $YACC" >&5
3569 echo "${ECHO_T}$YACC" >&6; }
3570 else
3571 { echo "$as_me:$LINENO: result: no" >&5
3572 echo "${ECHO_T}no" >&6; }
3573 fi
3574
3575
3576 test -n "$YACC" && break
3577 done
3578 test -n "$YACC" || YACC="yacc"
3579
3580 # Extract the first word of "pkg-config", so it can be a program name with args.
3581 set dummy pkg-config; ac_word=$2
3582 { echo "$as_me:$LINENO: checking for $ac_word" >&5
3583 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; }
3584 if test "${ac_cv_path_ac_prog_pkg_config+set}" = set; then
3585 echo $ECHO_N "(cached) $ECHO_C" >&6
3586 else
3587 case $ac_prog_pkg_config in
3588 [\\/]* | ?:[\\/]*)
3589 ac_cv_path_ac_prog_pkg_config="$ac_prog_pkg_config" # Let the user override the test with a path.
3590 ;;
3591 *)
3592 as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
3593 for as_dir in $PATH
3594 do
3595 IFS=$as_save_IFS
3596 test -z "$as_dir" && as_dir=.
3597 for ac_exec_ext in '' $ac_executable_extensions; do
3598 if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
3599 ac_cv_path_ac_prog_pkg_config="$as_dir/$ac_word$ac_exec_ext"
3600 echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
3601 break 2
3602 fi
3603 done
3604 done
3605 IFS=$as_save_IFS
3606
3607 ;;
3608 esac
3609 fi
3610 ac_prog_pkg_config=$ac_cv_path_ac_prog_pkg_config
3611 if test -n "$ac_prog_pkg_config"; then
3612 { echo "$as_me:$LINENO: result: $ac_prog_pkg_config" >&5
3613 echo "${ECHO_T}$ac_prog_pkg_config" >&6; }
3614 else
3615 { echo "$as_me:$LINENO: result: no" >&5
3616 echo "${ECHO_T}no" >&6; }
3617 fi
3618
3619
3620
3621
3622 { echo "$as_me:$LINENO: checking for sqrt in -lm" >&5
3623 echo $ECHO_N "checking for sqrt in -lm... $ECHO_C" >&6; }
3624 if test "${ac_cv_lib_m_sqrt+set}" = set; then
3625 echo $ECHO_N "(cached) $ECHO_C" >&6
3626 else
3627 ac_check_lib_save_LIBS=$LIBS
3628 LIBS="-lm $LIBS"
3629 cat >conftest.$ac_ext <<_ACEOF
3630 /* confdefs.h. */
3631 _ACEOF
3632 cat confdefs.h >>conftest.$ac_ext
3633 cat >>conftest.$ac_ext <<_ACEOF
3634 /* end confdefs.h. */
3635
3636 /* Override any GCC internal prototype to avoid an error.
3637 Use char because int might match the return type of a GCC
3638 builtin and then its argument prototype would still apply. */
3639 #ifdef __cplusplus
3640 extern "C"
3641 #endif
3642 char sqrt ();
3643 int
3644 main ()
3645 {
3646 return sqrt ();
3647 ;
3648 return 0;
3649 }
3650 _ACEOF
3651 rm -f conftest.$ac_objext conftest$ac_exeext
3652 if { (ac_try="$ac_link"
3653 case "(($ac_try" in
3654 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
3655 *) ac_try_echo=$ac_try;;
3656 esac
3657 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
3658 (eval "$ac_link") 2>conftest.er1
3659 ac_status=$?
3660 grep -v '^ *+' conftest.er1 >conftest.err
3661 rm -f conftest.er1
3662 cat conftest.err >&5
3663 echo "$as_me:$LINENO: \$? = $ac_status" >&5
3664 (exit $ac_status); } && {
3665 test -z "$ac_c_werror_flag" ||
3666 test ! -s conftest.err
3667 } && test -s conftest$ac_exeext &&
3668 $as_test_x conftest$ac_exeext; then
3669 ac_cv_lib_m_sqrt=yes
3670 else
3671 echo "$as_me: failed program was:" >&5
3672 sed 's/^/| /' conftest.$ac_ext >&5
3673
3674 ac_cv_lib_m_sqrt=no
3675 fi
3676
3677 rm -f core conftest.err conftest.$ac_objext conftest_ipa8_conftest.oo \
3678 conftest$ac_exeext conftest.$ac_ext
3679 LIBS=$ac_check_lib_save_LIBS
3680 fi
3681 { echo "$as_me:$LINENO: result: $ac_cv_lib_m_sqrt" >&5
3682 echo "${ECHO_T}$ac_cv_lib_m_sqrt" >&6; }
3683 if test $ac_cv_lib_m_sqrt = yes; then
3684 cat >>confdefs.h <<_ACEOF
3685 #define HAVE_LIBM 1
3686 _ACEOF
3687
3688 LIBS="-lm $LIBS"
3689
3690 fi
3691
3692
3693
3694 { echo "$as_me:$LINENO: checking for FT_Load_Glyph in -lfreetype" >&5
3695 echo $ECHO_N "checking for FT_Load_Glyph in -lfreetype... $ECHO_C" >&6; }
3696 if test "${ac_cv_lib_freetype_FT_Load_Glyph+set}" = set; then
3697 echo $ECHO_N "(cached) $ECHO_C" >&6
3698 else
3699 ac_check_lib_save_LIBS=$LIBS
3700 LIBS="-lfreetype $LIBS"
3701 cat >conftest.$ac_ext <<_ACEOF
3702 /* confdefs.h. */
3703 _ACEOF
3704 cat confdefs.h >>conftest.$ac_ext
3705 cat >>conftest.$ac_ext <<_ACEOF
3706 /* end confdefs.h. */
3707
3708 /* Override any GCC internal prototype to avoid an error.
3709 Use char because int might match the return type of a GCC
3710 builtin and then its argument prototype would still apply. */
3711 #ifdef __cplusplus
3712 extern "C"
3713 #endif
3714 char FT_Load_Glyph ();
3715 int
3716 main ()
3717 {
3718 return FT_Load_Glyph ();
3719 ;
3720 return 0;
3721 }
3722 _ACEOF
3723 rm -f conftest.$ac_objext conftest$ac_exeext
3724 if { (ac_try="$ac_link"
3725 case "(($ac_try" in
3726 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
3727 *) ac_try_echo=$ac_try;;
3728 esac
3729 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
3730 (eval "$ac_link") 2>conftest.er1
3731 ac_status=$?
3732 grep -v '^ *+' conftest.er1 >conftest.err
3733 rm -f conftest.er1
3734 cat conftest.err >&5
3735 echo "$as_me:$LINENO: \$? = $ac_status" >&5
3736 (exit $ac_status); } && {
3737 test -z "$ac_c_werror_flag" ||
3738 test ! -s conftest.err
3739 } && test -s conftest$ac_exeext &&
3740 $as_test_x conftest$ac_exeext; then
3741 ac_cv_lib_freetype_FT_Load_Glyph=yes
3742 else
3743 echo "$as_me: failed program was:" >&5
3744 sed 's/^/| /' conftest.$ac_ext >&5
3745
3746 ac_cv_lib_freetype_FT_Load_Glyph=no
3747 fi
3748
3749 rm -f core conftest.err conftest.$ac_objext conftest_ipa8_conftest.oo \
3750 conftest$ac_exeext conftest.$ac_ext
3751 LIBS=$ac_check_lib_save_LIBS
3752 fi
3753 { echo "$as_me:$LINENO: result: $ac_cv_lib_freetype_FT_Load_Glyph" >&5
3754 echo "${ECHO_T}$ac_cv_lib_freetype_FT_Load_Glyph" >&6; }
3755 if test $ac_cv_lib_freetype_FT_Load_Glyph = yes; then
3756 cat >>confdefs.h <<_ACEOF
3757 #define HAVE_LIBFREETYPE 1
3758 _ACEOF
3759
3760 LIBS="-lfreetype $LIBS"
3761
3762 fi
3763
3764 if test "$ac_cv_lib_freetype_FT_Load_Glyph" != "yes"
3765 then
3766
3767 { echo "$as_me:$LINENO: checking for TT_Load_Glyph in -lttf" >&5
3768 echo $ECHO_N "checking for TT_Load_Glyph in -lttf... $ECHO_C" >&6; }
3769 if test "${ac_cv_lib_ttf_TT_Load_Glyph+set}" = set; then
3770 echo $ECHO_N "(cached) $ECHO_C" >&6
3771 else
3772 ac_check_lib_save_LIBS=$LIBS
3773 LIBS="-lttf $LIBS"
3774 cat >conftest.$ac_ext <<_ACEOF
3775 /* confdefs.h. */
3776 _ACEOF
3777 cat confdefs.h >>conftest.$ac_ext
3778 cat >>conftest.$ac_ext <<_ACEOF
3779 /* end confdefs.h. */
3780
3781 /* Override any GCC internal prototype to avoid an error.
3782 Use char because int might match the return type of a GCC
3783 builtin and then its argument prototype would still apply. */
3784 #ifdef __cplusplus
3785 extern "C"
3786 #endif
3787 char TT_Load_Glyph ();
3788 int
3789 main ()
3790 {
3791 return TT_Load_Glyph ();
3792 ;
3793 return 0;
3794 }
3795 _ACEOF
3796 rm -f conftest.$ac_objext conftest$ac_exeext
3797 if { (ac_try="$ac_link"
3798 case "(($ac_try" in
3799 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
3800 *) ac_try_echo=$ac_try;;
3801 esac
3802 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
3803 (eval "$ac_link") 2>conftest.er1
3804 ac_status=$?
3805 grep -v '^ *+' conftest.er1 >conftest.err
3806 rm -f conftest.er1
3807 cat conftest.err >&5
3808 echo "$as_me:$LINENO: \$? = $ac_status" >&5
3809 (exit $ac_status); } && {
3810 test -z "$ac_c_werror_flag" ||
3811 test ! -s conftest.err
3812 } && test -s conftest$ac_exeext &&
3813 $as_test_x conftest$ac_exeext; then
3814 ac_cv_lib_ttf_TT_Load_Glyph=yes
3815 else
3816 echo "$as_me: failed program was:" >&5
3817 sed 's/^/| /' conftest.$ac_ext >&5
3818
3819 ac_cv_lib_ttf_TT_Load_Glyph=no
3820 fi
3821
3822 rm -f core conftest.err conftest.$ac_objext conftest_ipa8_conftest.oo \
3823 conftest$ac_exeext conftest.$ac_ext
3824 LIBS=$ac_check_lib_save_LIBS
3825 fi
3826 { echo "$as_me:$LINENO: result: $ac_cv_lib_ttf_TT_Load_Glyph" >&5
3827 echo "${ECHO_T}$ac_cv_lib_ttf_TT_Load_Glyph" >&6; }
3828 if test $ac_cv_lib_ttf_TT_Load_Glyph = yes; then
3829 cat >>confdefs.h <<_ACEOF
3830 #define HAVE_LIBTTF 1
3831 _ACEOF
3832
3833 LIBS="-lttf $LIBS"
3834
3835 fi
3836
3837 fi
3838
3839 # find out what the GD library uses
3840
3841
3842 # Check whether --with-gd was given.
3843 if test "${with_gd+set}" = set; then
3844 withval=$with_gd;
3845 else
3846 with_gd=yes
3847 fi
3848
3849
3850
3851 # Extract the first word of "gdlib-config", so it can be a program name with args.
3852 set dummy gdlib-config; ac_word=$2
3853 { echo "$as_me:$LINENO: checking for $ac_word" >&5
3854 echo $ECHO_N "checking for $ac_word... $ECHO_C" >&6; }
3855 if test "${ac_cv_path_GDLIB_CONFIG+set}" = set; then
3856 echo $ECHO_N "(cached) $ECHO_C" >&6
3857 else
3858 case $GDLIB_CONFIG in
3859 [\\/]* | ?:[\\/]*)
3860 ac_cv_path_GDLIB_CONFIG="$GDLIB_CONFIG" # Let the user override the test with a path.
3861 ;;
3862 *)
3863 as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
3864 as_dummy="$with_gd/bin:$PATH"
3865 for as_dir in $as_dummy
3866 do
3867 IFS=$as_save_IFS
3868 test -z "$as_dir" && as_dir=.
3869 for ac_exec_ext in '' $ac_executable_extensions; do
3870 if { test -f "$as_dir/$ac_word$ac_exec_ext" && $as_test_x "$as_dir/$ac_word$ac_exec_ext"; }; then
3871 ac_cv_path_GDLIB_CONFIG="$as_dir/$ac_word$ac_exec_ext"
3872 echo "$as_me:$LINENO: found $as_dir/$ac_word$ac_exec_ext" >&5
3873 break 2
3874 fi
3875 done
3876 done
3877 IFS=$as_save_IFS
3878
3879 ;;
3880 esac
3881 fi
3882 GDLIB_CONFIG=$ac_cv_path_GDLIB_CONFIG
3883 if test -n "$GDLIB_CONFIG"; then
3884 { echo "$as_me:$LINENO: result: $GDLIB_CONFIG" >&5
3885 echo "${ECHO_T}$GDLIB_CONFIG" >&6; }
3886 else
3887 { echo "$as_me:$LINENO: result: no" >&5
3888 echo "${ECHO_T}no" >&6; }
3889 fi
3890
3891
3892 if test -n "$GDLIB_CONFIG"; then
3893 GD_CFLAGS=`$GDLIB_CONFIG --cflags`
3894 GD_LDFLAGS=`$GDLIB_CONFIG --ldflags`
3895 GD_LIBS=`$GDLIB_CONFIG --libs`
3896 elif test -d "$with_gd"; then
3897 GD_CFLAGS="-I$with_gd/include"
3898 GD_LDFLAGS="-L$with_gd/lib"
3899 { echo "$as_me:$LINENO: checking for inflateReset in -lz" >&5
3900 echo $ECHO_N "checking for inflateReset in -lz... $ECHO_C" >&6; }
3901 if test "${ac_cv_lib_z_inflateReset+set}" = set; then
3902 echo $ECHO_N "(cached) $ECHO_C" >&6
3903 else
3904 ac_check_lib_save_LIBS=$LIBS
3905 LIBS="-lz $LIBS"
3906 cat >conftest.$ac_ext <<_ACEOF
3907 /* confdefs.h. */
3908 _ACEOF
3909 cat confdefs.h >>conftest.$ac_ext
3910 cat >>conftest.$ac_ext <<_ACEOF
3911 /* end confdefs.h. */
3912
3913 /* Override any GCC internal prototype to avoid an error.
3914 Use char because int might match the return type of a GCC
3915 builtin and then its argument prototype would still apply. */
3916 #ifdef __cplusplus
3917 extern "C"
3918 #endif
3919 char inflateReset ();
3920 int
3921 main ()
3922 {
3923 return inflateReset ();
3924 ;
3925 return 0;
3926 }
3927 _ACEOF
3928 rm -f conftest.$ac_objext conftest$ac_exeext
3929 if { (ac_try="$ac_link"
3930 case "(($ac_try" in
3931 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
3932 *) ac_try_echo=$ac_try;;
3933 esac
3934 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
3935 (eval "$ac_link") 2>conftest.er1
3936 ac_status=$?
3937 grep -v '^ *+' conftest.er1 >conftest.err
3938 rm -f conftest.er1
3939 cat conftest.err >&5
3940 echo "$as_me:$LINENO: \$? = $ac_status" >&5
3941 (exit $ac_status); } && {
3942 test -z "$ac_c_werror_flag" ||
3943 test ! -s conftest.err
3944 } && test -s conftest$ac_exeext &&
3945 $as_test_x conftest$ac_exeext; then
3946 ac_cv_lib_z_inflateReset=yes
3947 else
3948 echo "$as_me: failed program was:" >&5
3949 sed 's/^/| /' conftest.$ac_ext >&5
3950
3951 ac_cv_lib_z_inflateReset=no
3952 fi
3953
3954 rm -f core conftest.err conftest.$ac_objext conftest_ipa8_conftest.oo \
3955 conftest$ac_exeext conftest.$ac_ext
3956 LIBS=$ac_check_lib_save_LIBS
3957 fi
3958 { echo "$as_me:$LINENO: result: $ac_cv_lib_z_inflateReset" >&5
3959 echo "${ECHO_T}$ac_cv_lib_z_inflateReset" >&6; }
3960 if test $ac_cv_lib_z_inflateReset = yes; then
3961 GD_LIBS="-lz"
3962 fi
3963
3964 { echo "$as_me:$LINENO: checking for png_check_sig in -lpng" >&5
3965 echo $ECHO_N "checking for png_check_sig in -lpng... $ECHO_C" >&6; }
3966 if test "${ac_cv_lib_png_png_check_sig+set}" = set; then
3967 echo $ECHO_N "(cached) $ECHO_C" >&6
3968 else
3969 ac_check_lib_save_LIBS=$LIBS
3970 LIBS="-lpng $GD_LIBS $LIBS"
3971 cat >conftest.$ac_ext <<_ACEOF
3972 /* confdefs.h. */
3973 _ACEOF
3974 cat confdefs.h >>conftest.$ac_ext
3975 cat >>conftest.$ac_ext <<_ACEOF
3976 /* end confdefs.h. */
3977
3978 /* Override any GCC internal prototype to avoid an error.
3979 Use char because int might match the return type of a GCC
3980 builtin and then its argument prototype would still apply. */
3981 #ifdef __cplusplus
3982 extern "C"
3983 #endif
3984 char png_check_sig ();
3985 int
3986 main ()
3987 {
3988 return png_check_sig ();
3989 ;
3990 return 0;
3991 }
3992 _ACEOF
3993 rm -f conftest.$ac_objext conftest$ac_exeext
3994 if { (ac_try="$ac_link"
3995 case "(($ac_try" in
3996 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
3997 *) ac_try_echo=$ac_try;;
3998 esac
3999 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
4000 (eval "$ac_link") 2>conftest.er1
4001 ac_status=$?
4002 grep -v '^ *+' conftest.er1 >conftest.err
4003 rm -f conftest.er1
4004 cat conftest.err >&5
4005 echo "$as_me:$LINENO: \$? = $ac_status" >&5
4006 (exit $ac_status); } && {
4007 test -z "$ac_c_werror_flag" ||
4008 test ! -s conftest.err
4009 } && test -s conftest$ac_exeext &&
4010 $as_test_x conftest$ac_exeext; then
4011 ac_cv_lib_png_png_check_sig=yes
4012 else
4013 echo "$as_me: failed program was:" >&5
4014 sed 's/^/| /' conftest.$ac_ext >&5
4015
4016 ac_cv_lib_png_png_check_sig=no
4017 fi
4018
4019 rm -f core conftest.err conftest.$ac_objext conftest_ipa8_conftest.oo \
4020 conftest$ac_exeext conftest.$ac_ext
4021 LIBS=$ac_check_lib_save_LIBS
4022 fi
4023 { echo "$as_me:$LINENO: result: $ac_cv_lib_png_png_check_sig" >&5
4024 echo "${ECHO_T}$ac_cv_lib_png_png_check_sig" >&6; }
4025 if test $ac_cv_lib_png_png_check_sig = yes; then
4026 GD_LIBS="-lpng $GD_LIBS"
4027 fi
4028
4029 { echo "$as_me:$LINENO: checking for jpeg_CreateCompress in -ljpeg" >&5
4030 echo $ECHO_N "checking for jpeg_CreateCompress in -ljpeg... $ECHO_C" >&6; }
4031 if test "${ac_cv_lib_jpeg_jpeg_CreateCompress+set}" = set; then
4032 echo $ECHO_N "(cached) $ECHO_C" >&6
4033 else
4034 ac_check_lib_save_LIBS=$LIBS
4035 LIBS="-ljpeg $GD_LIBS $LIBS"
4036 cat >conftest.$ac_ext <<_ACEOF
4037 /* confdefs.h. */
4038 _ACEOF
4039 cat confdefs.h >>conftest.$ac_ext
4040 cat >>conftest.$ac_ext <<_ACEOF
4041 /* end confdefs.h. */
4042
4043 /* Override any GCC internal prototype to avoid an error.
4044 Use char because int might match the return type of a GCC
4045 builtin and then its argument prototype would still apply. */
4046 #ifdef __cplusplus
4047 extern "C"
4048 #endif
4049 char jpeg_CreateCompress ();
4050 int
4051 main ()
4052 {
4053 return jpeg_CreateCompress ();
4054 ;
4055 return 0;
4056 }
4057 _ACEOF
4058 rm -f conftest.$ac_objext conftest$ac_exeext
4059 if { (ac_try="$ac_link"
4060 case "(($ac_try" in
4061 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
4062 *) ac_try_echo=$ac_try;;
4063 esac
4064 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
4065 (eval "$ac_link") 2>conftest.er1
4066 ac_status=$?
4067 grep -v '^ *+' conftest.er1 >conftest.err
4068 rm -f conftest.er1
4069 cat conftest.err >&5
4070 echo "$as_me:$LINENO: \$? = $ac_status" >&5
4071 (exit $ac_status); } && {
4072 test -z "$ac_c_werror_flag" ||
4073 test ! -s conftest.err
4074 } && test -s conftest$ac_exeext &&
4075 $as_test_x conftest$ac_exeext; then
4076 ac_cv_lib_jpeg_jpeg_CreateCompress=yes
4077 else
4078 echo "$as_me: failed program was:" >&5
4079 sed 's/^/| /' conftest.$ac_ext >&5
4080
4081 ac_cv_lib_jpeg_jpeg_CreateCompress=no
4082 fi
4083
4084 rm -f core conftest.err conftest.$ac_objext conftest_ipa8_conftest.oo \
4085 conftest$ac_exeext conftest.$ac_ext
4086 LIBS=$ac_check_lib_save_LIBS
4087 fi
4088 { echo "$as_me:$LINENO: result: $ac_cv_lib_jpeg_jpeg_CreateCompress" >&5
4089 echo "${ECHO_T}$ac_cv_lib_jpeg_jpeg_CreateCompress" >&6; }
4090 if test $ac_cv_lib_jpeg_jpeg_CreateCompress = yes; then
4091 GD_LIBS="-ljpeg $GD_LIBS"
4092 fi
4093
4094 fi
4095
4096 save_CFLAGS="$CFLAGS"
4097 CFLAGS="$GD_CFLAGS $CFLAGS"
4098 save_LDFLAGS="$LDFLAGS"
4099 LDFLAGS="$GD_LDFLAGS $LDFLAGS"
4100 save_LIBS="$LIBS"
4101 LIBS="$GD_LIBS $LIBS"
4102
4103 { echo "$as_me:$LINENO: checking for gdImageCreate in -lgd" >&5
4104 echo $ECHO_N "checking for gdImageCreate in -lgd... $ECHO_C" >&6; }
4105 if test "${ac_cv_lib_gd_gdImageCreate+set}" = set; then
4106 echo $ECHO_N "(cached) $ECHO_C" >&6
4107 else
4108 ac_check_lib_save_LIBS=$LIBS
4109 LIBS="-lgd $GD_LIBS $LIBS"
4110 cat >conftest.$ac_ext <<_ACEOF
4111 /* confdefs.h. */
4112 _ACEOF
4113 cat confdefs.h >>conftest.$ac_ext
4114 cat >>conftest.$ac_ext <<_ACEOF
4115 /* end confdefs.h. */
4116
4117 /* Override any GCC internal prototype to avoid an error.
4118 Use char because int might match the return type of a GCC
4119 builtin and then its argument prototype would still apply. */
4120 #ifdef __cplusplus
4121 extern "C"
4122 #endif
4123 char gdImageCreate ();
4124 int
4125 main ()
4126 {
4127 return gdImageCreate ();
4128 ;
4129 return 0;
4130 }
4131 _ACEOF
4132 rm -f conftest.$ac_objext conftest$ac_exeext
4133 if { (ac_try="$ac_link"
4134 case "(($ac_try" in
4135 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
4136 *) ac_try_echo=$ac_try;;
4137 esac
4138 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
4139 (eval "$ac_link") 2>conftest.er1
4140 ac_status=$?
4141 grep -v '^ *+' conftest.er1 >conftest.err
4142 rm -f conftest.er1
4143 cat conftest.err >&5
4144 echo "$as_me:$LINENO: \$? = $ac_status" >&5
4145 (exit $ac_status); } && {
4146 test -z "$ac_c_werror_flag" ||
4147 test ! -s conftest.err
4148 } && test -s conftest$ac_exeext &&
4149 $as_test_x conftest$ac_exeext; then
4150 ac_cv_lib_gd_gdImageCreate=yes
4151 else
4152 echo "$as_me: failed program was:" >&5
4153 sed 's/^/| /' conftest.$ac_ext >&5
4154
4155 ac_cv_lib_gd_gdImageCreate=no
4156 fi
4157
4158 rm -f core conftest.err conftest.$ac_objext conftest_ipa8_conftest.oo \
4159 conftest$ac_exeext conftest.$ac_ext
4160 LIBS=$ac_check_lib_save_LIBS
4161 fi
4162 { echo "$as_me:$LINENO: result: $ac_cv_lib_gd_gdImageCreate" >&5
4163 echo "${ECHO_T}$ac_cv_lib_gd_gdImageCreate" >&6; }
4164 if test $ac_cv_lib_gd_gdImageCreate = yes; then
4165
4166
4167 cat >>confdefs.h <<\_ACEOF
4168 #define HAVE_GD 1
4169 _ACEOF
4170
4171 { echo "$as_me:$LINENO: checking for gdImageGif in -lgd" >&5
4172 echo $ECHO_N "checking for gdImageGif in -lgd... $ECHO_C" >&6; }
4173 if test "${ac_cv_lib_gd_gdImageGif+set}" = set; then
4174 echo $ECHO_N "(cached) $ECHO_C" >&6
4175 else
4176 ac_check_lib_save_LIBS=$LIBS
4177 LIBS="-lgd "$GD_LIBS" $LIBS"
4178 cat >conftest.$ac_ext <<_ACEOF
4179 /* confdefs.h. */
4180 _ACEOF
4181 cat confdefs.h >>conftest.$ac_ext
4182 cat >>conftest.$ac_ext <<_ACEOF
4183 /* end confdefs.h. */
4184
4185 /* Override any GCC internal prototype to avoid an error.
4186 Use char because int might match the return type of a GCC
4187 builtin and then its argument prototype would still apply. */
4188 #ifdef __cplusplus
4189 extern "C"
4190 #endif
4191 char gdImageGif ();
4192 int
4193 main ()
4194 {
4195 return gdImageGif ();
4196 ;
4197 return 0;
4198 }
4199 _ACEOF
4200 rm -f conftest.$ac_objext conftest$ac_exeext
4201 if { (ac_try="$ac_link"
4202 case "(($ac_try" in
4203 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
4204 *) ac_try_echo=$ac_try;;
4205 esac
4206 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
4207 (eval "$ac_link") 2>conftest.er1
4208 ac_status=$?
4209 grep -v '^ *+' conftest.er1 >conftest.err
4210 rm -f conftest.er1
4211 cat conftest.err >&5
4212 echo "$as_me:$LINENO: \$? = $ac_status" >&5
4213 (exit $ac_status); } && {
4214 test -z "$ac_c_werror_flag" ||
4215 test ! -s conftest.err
4216 } && test -s conftest$ac_exeext &&
4217 $as_test_x conftest$ac_exeext; then
4218 ac_cv_lib_gd_gdImageGif=yes
4219 else
4220 echo "$as_me: failed program was:" >&5
4221 sed 's/^/| /' conftest.$ac_ext >&5
4222
4223 ac_cv_lib_gd_gdImageGif=no
4224 fi
4225
4226 rm -f core conftest.err conftest.$ac_objext conftest_ipa8_conftest.oo \
4227 conftest$ac_exeext conftest.$ac_ext
4228 LIBS=$ac_check_lib_save_LIBS
4229 fi
4230 { echo "$as_me:$LINENO: result: $ac_cv_lib_gd_gdImageGif" >&5
4231 echo "${ECHO_T}$ac_cv_lib_gd_gdImageGif" >&6; }
4232 if test $ac_cv_lib_gd_gdImageGif = yes; then
4233
4234 cat >>confdefs.h <<\_ACEOF
4235 #define HAVE_GD_GIF 1
4236 _ACEOF
4237
4238 fi
4239
4240 { echo "$as_me:$LINENO: checking for gdImageJpeg in -lgd" >&5
4241 echo $ECHO_N "checking for gdImageJpeg in -lgd... $ECHO_C" >&6; }
4242 if test "${ac_cv_lib_gd_gdImageJpeg+set}" = set; then
4243 echo $ECHO_N "(cached) $ECHO_C" >&6
4244 else
4245 ac_check_lib_save_LIBS=$LIBS
4246 LIBS="-lgd "$GD_LIBS" $LIBS"
4247 cat >conftest.$ac_ext <<_ACEOF
4248 /* confdefs.h. */
4249 _ACEOF
4250 cat confdefs.h >>conftest.$ac_ext
4251 cat >>conftest.$ac_ext <<_ACEOF
4252 /* end confdefs.h. */
4253
4254 /* Override any GCC internal prototype to avoid an error.
4255 Use char because int might match the return type of a GCC
4256 builtin and then its argument prototype would still apply. */
4257 #ifdef __cplusplus
4258 extern "C"
4259 #endif
4260 char gdImageJpeg ();
4261 int
4262 main ()
4263 {
4264 return gdImageJpeg ();
4265 ;
4266 return 0;
4267 }
4268 _ACEOF
4269 rm -f conftest.$ac_objext conftest$ac_exeext
4270 if { (ac_try="$ac_link"
4271 case "(($ac_try" in
4272 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
4273 *) ac_try_echo=$ac_try;;
4274 esac
4275 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
4276 (eval "$ac_link") 2>conftest.er1
4277 ac_status=$?
4278 grep -v '^ *+' conftest.er1 >conftest.err
4279 rm -f conftest.er1
4280 cat conftest.err >&5
4281 echo "$as_me:$LINENO: \$? = $ac_status" >&5
4282 (exit $ac_status); } && {
4283 test -z "$ac_c_werror_flag" ||
4284 test ! -s conftest.err
4285 } && test -s conftest$ac_exeext &&
4286 $as_test_x conftest$ac_exeext; then
4287 ac_cv_lib_gd_gdImageJpeg=yes
4288 else
4289 echo "$as_me: failed program was:" >&5
4290 sed 's/^/| /' conftest.$ac_ext >&5
4291
4292 ac_cv_lib_gd_gdImageJpeg=no
4293 fi
4294
4295 rm -f core conftest.err conftest.$ac_objext conftest_ipa8_conftest.oo \
4296 conftest$ac_exeext conftest.$ac_ext
4297 LIBS=$ac_check_lib_save_LIBS
4298 fi
4299 { echo "$as_me:$LINENO: result: $ac_cv_lib_gd_gdImageJpeg" >&5
4300 echo "${ECHO_T}$ac_cv_lib_gd_gdImageJpeg" >&6; }
4301 if test $ac_cv_lib_gd_gdImageJpeg = yes; then
4302
4303 cat >>confdefs.h <<\_ACEOF
4304 #define HAVE_GD_JPEG 1
4305 _ACEOF
4306
4307 fi
4308
4309 { echo "$as_me:$LINENO: checking for gdImagePng in -lgd" >&5
4310 echo $ECHO_N "checking for gdImagePng in -lgd... $ECHO_C" >&6; }
4311 if test "${ac_cv_lib_gd_gdImagePng+set}" = set; then
4312 echo $ECHO_N "(cached) $ECHO_C" >&6
4313 else
4314 ac_check_lib_save_LIBS=$LIBS
4315 LIBS="-lgd "$GD_LIBS" $LIBS"
4316 cat >conftest.$ac_ext <<_ACEOF
4317 /* confdefs.h. */
4318 _ACEOF
4319 cat confdefs.h >>conftest.$ac_ext
4320 cat >>conftest.$ac_ext <<_ACEOF
4321 /* end confdefs.h. */
4322
4323 /* Override any GCC internal prototype to avoid an error.
4324 Use char because int might match the return type of a GCC
4325 builtin and then its argument prototype would still apply. */
4326 #ifdef __cplusplus
4327 extern "C"
4328 #endif
4329 char gdImagePng ();
4330 int
4331 main ()
4332 {
4333 return gdImagePng ();
4334 ;
4335 return 0;
4336 }
4337 _ACEOF
4338 rm -f conftest.$ac_objext conftest$ac_exeext
4339 if { (ac_try="$ac_link"
4340 case "(($ac_try" in
4341 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
4342 *) ac_try_echo=$ac_try;;
4343 esac
4344 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
4345 (eval "$ac_link") 2>conftest.er1
4346 ac_status=$?
4347 grep -v '^ *+' conftest.er1 >conftest.err
4348 rm -f conftest.er1
4349 cat conftest.err >&5
4350 echo "$as_me:$LINENO: \$? = $ac_status" >&5
4351 (exit $ac_status); } && {
4352 test -z "$ac_c_werror_flag" ||
4353 test ! -s conftest.err
4354 } && test -s conftest$ac_exeext &&
4355 $as_test_x conftest$ac_exeext; then
4356 ac_cv_lib_gd_gdImagePng=yes
4357 else
4358 echo "$as_me: failed program was:" >&5
4359 sed 's/^/| /' conftest.$ac_ext >&5
4360
4361 ac_cv_lib_gd_gdImagePng=no
4362 fi
4363
4364 rm -f core conftest.err conftest.$ac_objext conftest_ipa8_conftest.oo \
4365 conftest$ac_exeext conftest.$ac_ext
4366 LIBS=$ac_check_lib_save_LIBS
4367 fi
4368 { echo "$as_me:$LINENO: result: $ac_cv_lib_gd_gdImagePng" >&5
4369 echo "${ECHO_T}$ac_cv_lib_gd_gdImagePng" >&6; }
4370 if test $ac_cv_lib_gd_gdImagePng = yes; then
4371
4372 cat >>confdefs.h <<\_ACEOF
4373 #define HAVE_GD_PNG 1
4374 _ACEOF
4375
4376 fi
4377
4378 { echo "$as_me:$LINENO: checking for gdImagePngEx in -lgd" >&5
4379 echo $ECHO_N "checking for gdImagePngEx in -lgd... $ECHO_C" >&6; }
4380 if test "${ac_cv_lib_gd_gdImagePngEx+set}" = set; then
4381 echo $ECHO_N "(cached) $ECHO_C" >&6
4382 else
4383 ac_check_lib_save_LIBS=$LIBS
4384 LIBS="-lgd "$GD_LIBS" $LIBS"
4385 cat >conftest.$ac_ext <<_ACEOF
4386 /* confdefs.h. */
4387 _ACEOF
4388 cat confdefs.h >>conftest.$ac_ext
4389 cat >>conftest.$ac_ext <<_ACEOF
4390 /* end confdefs.h. */
4391
4392 /* Override any GCC internal prototype to avoid an error.
4393 Use char because int might match the return type of a GCC
4394 builtin and then its argument prototype would still apply. */
4395 #ifdef __cplusplus
4396 extern "C"
4397 #endif
4398 char gdImagePngEx ();
4399 int
4400 main ()
4401 {
4402 return gdImagePngEx ();
4403 ;
4404 return 0;
4405 }
4406 _ACEOF
4407 rm -f conftest.$ac_objext conftest$ac_exeext
4408 if { (ac_try="$ac_link"
4409 case "(($ac_try" in
4410 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
4411 *) ac_try_echo=$ac_try;;
4412 esac
4413 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
4414 (eval "$ac_link") 2>conftest.er1
4415 ac_status=$?
4416 grep -v '^ *+' conftest.er1 >conftest.err
4417 rm -f conftest.er1
4418 cat conftest.err >&5
4419 echo "$as_me:$LINENO: \$? = $ac_status" >&5
4420 (exit $ac_status); } && {
4421 test -z "$ac_c_werror_flag" ||
4422 test ! -s conftest.err
4423 } && test -s conftest$ac_exeext &&
4424 $as_test_x conftest$ac_exeext; then
4425 ac_cv_lib_gd_gdImagePngEx=yes
4426 else
4427 echo "$as_me: failed program was:" >&5
4428 sed 's/^/| /' conftest.$ac_ext >&5
4429
4430 ac_cv_lib_gd_gdImagePngEx=no
4431 fi
4432
4433 rm -f core conftest.err conftest.$ac_objext conftest_ipa8_conftest.oo \
4434 conftest$ac_exeext conftest.$ac_ext
4435 LIBS=$ac_check_lib_save_LIBS
4436 fi
4437 { echo "$as_me:$LINENO: result: $ac_cv_lib_gd_gdImagePngEx" >&5
4438 echo "${ECHO_T}$ac_cv_lib_gd_gdImagePngEx" >&6; }
4439 if test $ac_cv_lib_gd_gdImagePngEx = yes; then
4440
4441 cat >>confdefs.h <<\_ACEOF
4442 #define HAVE_GD_PNGEX 1
4443 _ACEOF
4444
4445 fi
4446
4447 { echo "$as_me:$LINENO: checking for gdImageFilledArc in -lgd" >&5
4448 echo $ECHO_N "checking for gdImageFilledArc in -lgd... $ECHO_C" >&6; }
4449 if test "${ac_cv_lib_gd_gdImageFilledArc+set}" = set; then
4450 echo $ECHO_N "(cached) $ECHO_C" >&6
4451 else
4452 ac_check_lib_save_LIBS=$LIBS
4453 LIBS="-lgd "$GD_LIBS" $LIBS"
4454 cat >conftest.$ac_ext <<_ACEOF
4455 /* confdefs.h. */
4456 _ACEOF
4457 cat confdefs.h >>conftest.$ac_ext
4458 cat >>conftest.$ac_ext <<_ACEOF
4459 /* end confdefs.h. */
4460
4461 /* Override any GCC internal prototype to avoid an error.
4462 Use char because int might match the return type of a GCC
4463 builtin and then its argument prototype would still apply. */
4464 #ifdef __cplusplus
4465 extern "C"
4466 #endif
4467 char gdImageFilledArc ();
4468 int
4469 main ()
4470 {
4471 return gdImageFilledArc ();
4472 ;
4473 return 0;
4474 }
4475 _ACEOF
4476 rm -f conftest.$ac_objext conftest$ac_exeext
4477 if { (ac_try="$ac_link"
4478 case "(($ac_try" in
4479 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
4480 *) ac_try_echo=$ac_try;;
4481 esac
4482 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
4483 (eval "$ac_link") 2>conftest.er1
4484 ac_status=$?
4485 grep -v '^ *+' conftest.er1 >conftest.err
4486 rm -f conftest.er1
4487 cat conftest.err >&5
4488 echo "$as_me:$LINENO: \$? = $ac_status" >&5
4489 (exit $ac_status); } && {
4490 test -z "$ac_c_werror_flag" ||
4491 test ! -s conftest.err
4492 } && test -s conftest$ac_exeext &&
4493 $as_test_x conftest$ac_exeext; then
4494 ac_cv_lib_gd_gdImageFilledArc=yes
4495 else
4496 echo "$as_me: failed program was:" >&5
4497 sed 's/^/| /' conftest.$ac_ext >&5
4498
4499 ac_cv_lib_gd_gdImageFilledArc=no
4500 fi
4501
4502 rm -f core conftest.err conftest.$ac_objext conftest_ipa8_conftest.oo \
4503 conftest$ac_exeext conftest.$ac_ext
4504 LIBS=$ac_check_lib_save_LIBS
4505 fi
4506 { echo "$as_me:$LINENO: result: $ac_cv_lib_gd_gdImageFilledArc" >&5
4507 echo "${ECHO_T}$ac_cv_lib_gd_gdImageFilledArc" >&6; }
4508 if test $ac_cv_lib_gd_gdImageFilledArc = yes; then
4509
4510 cat >>confdefs.h <<\_ACEOF
4511 #define HAVE_GD_FILLEDARC 1
4512 _ACEOF
4513
4514 fi
4515
4516
4517 if test "$ac_cv_lib_freetype_FT_Load_Glyph" = "yes"
4518 then
4519 { echo "$as_me:$LINENO: checking for gdImageStringFT in -lgd" >&5
4520 echo $ECHO_N "checking for gdImageStringFT in -lgd... $ECHO_C" >&6; }
4521 if test "${ac_cv_lib_gd_gdImageStringFT+set}" = set; then
4522 echo $ECHO_N "(cached) $ECHO_C" >&6
4523 else
4524 ac_check_lib_save_LIBS=$LIBS
4525 LIBS="-lgd "$GD_LIBS" $LIBS"
4526 cat >conftest.$ac_ext <<_ACEOF
4527 /* confdefs.h. */
4528 _ACEOF
4529 cat confdefs.h >>conftest.$ac_ext
4530 cat >>conftest.$ac_ext <<_ACEOF
4531 /* end confdefs.h. */
4532
4533 /* Override any GCC internal prototype to avoid an error.
4534 Use char because int might match the return type of a GCC
4535 builtin and then its argument prototype would still apply. */
4536 #ifdef __cplusplus
4537 extern "C"
4538 #endif
4539 char gdImageStringFT ();
4540 int
4541 main ()
4542 {
4543 return gdImageStringFT ();
4544 ;
4545 return 0;
4546 }
4547 _ACEOF
4548 rm -f conftest.$ac_objext conftest$ac_exeext
4549 if { (ac_try="$ac_link"
4550 case "(($ac_try" in
4551 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
4552 *) ac_try_echo=$ac_try;;
4553 esac
4554 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
4555 (eval "$ac_link") 2>conftest.er1
4556 ac_status=$?
4557 grep -v '^ *+' conftest.er1 >conftest.err
4558 rm -f conftest.er1
4559 cat conftest.err >&5
4560 echo "$as_me:$LINENO: \$? = $ac_status" >&5
4561 (exit $ac_status); } && {
4562 test -z "$ac_c_werror_flag" ||
4563 test ! -s conftest.err
4564 } && test -s conftest$ac_exeext &&
4565 $as_test_x conftest$ac_exeext; then
4566 ac_cv_lib_gd_gdImageStringFT=yes
4567 else
4568 echo "$as_me: failed program was:" >&5
4569 sed 's/^/| /' conftest.$ac_ext >&5
4570
4571 ac_cv_lib_gd_gdImageStringFT=no
4572 fi
4573
4574 rm -f core conftest.err conftest.$ac_objext conftest_ipa8_conftest.oo \
4575 conftest$ac_exeext conftest.$ac_ext
4576 LIBS=$ac_check_lib_save_LIBS
4577 fi
4578 { echo "$as_me:$LINENO: result: $ac_cv_lib_gd_gdImageStringFT" >&5
4579 echo "${ECHO_T}$ac_cv_lib_gd_gdImageStringFT" >&6; }
4580 if test $ac_cv_lib_gd_gdImageStringFT = yes; then
4581
4582 cat >>confdefs.h <<\_ACEOF
4583 #define HAVE_GD_STRINGFT 1
4584 _ACEOF
4585
4586 fi
4587
4588 fi
4589 if test "$ac_cv_lib_ttf_TT_Load_Glyph" = "yes"
4590 then
4591 { echo "$as_me:$LINENO: checking for gdImageStringTTF in -lgd" >&5
4592 echo $ECHO_N "checking for gdImageStringTTF in -lgd... $ECHO_C" >&6; }
4593 if test "${ac_cv_lib_gd_gdImageStringTTF+set}" = set; then
4594 echo $ECHO_N "(cached) $ECHO_C" >&6
4595 else
4596 ac_check_lib_save_LIBS=$LIBS
4597 LIBS="-lgd "$GD_LIBS" $LIBS"
4598 cat >conftest.$ac_ext <<_ACEOF
4599 /* confdefs.h. */
4600 _ACEOF
4601 cat confdefs.h >>conftest.$ac_ext
4602 cat >>conftest.$ac_ext <<_ACEOF
4603 /* end confdefs.h. */
4604
4605 /* Override any GCC internal prototype to avoid an error.
4606 Use char because int might match the return type of a GCC
4607 builtin and then its argument prototype would still apply. */
4608 #ifdef __cplusplus
4609 extern "C"
4610 #endif
4611 char gdImageStringTTF ();
4612 int
4613 main ()
4614 {
4615 return gdImageStringTTF ();
4616 ;
4617 return 0;
4618 }
4619 _ACEOF
4620 rm -f conftest.$ac_objext conftest$ac_exeext
4621 if { (ac_try="$ac_link"
4622 case "(($ac_try" in
4623 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
4624 *) ac_try_echo=$ac_try;;
4625 esac
4626 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
4627 (eval "$ac_link") 2>conftest.er1
4628 ac_status=$?
4629 grep -v '^ *+' conftest.er1 >conftest.err
4630 rm -f conftest.er1
4631 cat conftest.err >&5
4632 echo "$as_me:$LINENO: \$? = $ac_status" >&5
4633 (exit $ac_status); } && {
4634 test -z "$ac_c_werror_flag" ||
4635 test ! -s conftest.err
4636 } && test -s conftest$ac_exeext &&
4637 $as_test_x conftest$ac_exeext; then
4638 ac_cv_lib_gd_gdImageStringTTF=yes
4639 else
4640 echo "$as_me: failed program was:" >&5
4641 sed 's/^/| /' conftest.$ac_ext >&5
4642
4643 ac_cv_lib_gd_gdImageStringTTF=no
4644 fi
4645
4646 rm -f core conftest.err conftest.$ac_objext conftest_ipa8_conftest.oo \
4647 conftest$ac_exeext conftest.$ac_ext
4648 LIBS=$ac_check_lib_save_LIBS
4649 fi
4650 { echo "$as_me:$LINENO: result: $ac_cv_lib_gd_gdImageStringTTF" >&5
4651 echo "${ECHO_T}$ac_cv_lib_gd_gdImageStringTTF" >&6; }
4652 if test $ac_cv_lib_gd_gdImageStringTTF = yes; then
4653
4654 cat >>confdefs.h <<\_ACEOF
4655 #define HAVE_GD_STRINGTTF 1
4656 _ACEOF
4657
4658 fi
4659
4660 fi
4661 GD_LIBS="-lgd $GD_LIBS"
4662
4663 fi
4664
4665
4666 CFLAGS="$save_CFLAGS"
4667 LDFLAGS="$save_LDFLAGS"
4668 if test -n "$GDLIB_CONFIG"; then
4669 LIBS="$GD_LIBS"
4670 else
4671 LIBS="$GD_LIBS $LIBS"
4672 fi
4673
4674
4675
4676
4677
4678 # Checks for header files.
4679 ac_ext=c
4680 ac_cpp='$CPP $CPPFLAGS'
4681 ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
4682 ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
4683 ac_compiler_gnu=$ac_cv_c_compiler_gnu
4684 { echo "$as_me:$LINENO: checking how to run the C preprocessor" >&5
4685 echo $ECHO_N "checking how to run the C preprocessor... $ECHO_C" >&6; }
4686 # On Suns, sometimes $CPP names a directory.
4687 if test -n "$CPP" && test -d "$CPP"; then
4688 CPP=
4689 fi
4690 if test -z "$CPP"; then
4691 if test "${ac_cv_prog_CPP+set}" = set; then
4692 echo $ECHO_N "(cached) $ECHO_C" >&6
4693 else
4694 # Double quotes because CPP needs to be expanded
4695 for CPP in "$CC -E" "$CC -E -traditional-cpp" "/lib/cpp"
4696 do
4697 ac_preproc_ok=false
4698 for ac_c_preproc_warn_flag in '' yes
4699 do
4700 # Use a header file that comes with gcc, so configuring glibc
4701 # with a fresh cross-compiler works.
4702 # Prefer <limits.h> to <assert.h> if __STDC__ is defined, since
4703 # <limits.h> exists even on freestanding compilers.
4704 # On the NeXT, cc -E runs the code through the compiler's parser,
4705 # not just through cpp. "Syntax error" is here to catch this case.
4706 cat >conftest.$ac_ext <<_ACEOF
4707 /* confdefs.h. */
4708 _ACEOF
4709 cat confdefs.h >>conftest.$ac_ext
4710 cat >>conftest.$ac_ext <<_ACEOF
4711 /* end confdefs.h. */
4712 #ifdef __STDC__
4713 # include <limits.h>
4714 #else
4715 # include <assert.h>
4716 #endif
4717 Syntax error
4718 _ACEOF
4719 if { (ac_try="$ac_cpp conftest.$ac_ext"
4720 case "(($ac_try" in
4721 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
4722 *) ac_try_echo=$ac_try;;
4723 esac
4724 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
4725 (eval "$ac_cpp conftest.$ac_ext") 2>conftest.er1
4726 ac_status=$?
4727 grep -v '^ *+' conftest.er1 >conftest.err
4728 rm -f conftest.er1
4729 cat conftest.err >&5
4730 echo "$as_me:$LINENO: \$? = $ac_status" >&5
4731 (exit $ac_status); } >/dev/null && {
4732 test -z "$ac_c_preproc_warn_flag$ac_c_werror_flag" ||
4733 test ! -s conftest.err
4734 }; then
4735 :
4736 else
4737 echo "$as_me: failed program was:" >&5
4738 sed 's/^/| /' conftest.$ac_ext >&5
4739
4740 # Broken: fails on valid input.
4741 continue
4742 fi
4743
4744 rm -f conftest.err conftest.$ac_ext
4745
4746 # OK, works on sane cases. Now check whether nonexistent headers
4747 # can be detected and how.
4748 cat >conftest.$ac_ext <<_ACEOF
4749 /* confdefs.h. */
4750 _ACEOF
4751 cat confdefs.h >>conftest.$ac_ext
4752 cat >>conftest.$ac_ext <<_ACEOF
4753 /* end confdefs.h. */
4754 #include <ac_nonexistent.h>
4755 _ACEOF
4756 if { (ac_try="$ac_cpp conftest.$ac_ext"
4757 case "(($ac_try" in
4758 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
4759 *) ac_try_echo=$ac_try;;
4760 esac
4761 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
4762 (eval "$ac_cpp conftest.$ac_ext") 2>conftest.er1
4763 ac_status=$?
4764 grep -v '^ *+' conftest.er1 >conftest.err
4765 rm -f conftest.er1
4766 cat conftest.err >&5
4767 echo "$as_me:$LINENO: \$? = $ac_status" >&5
4768 (exit $ac_status); } >/dev/null && {
4769 test -z "$ac_c_preproc_warn_flag$ac_c_werror_flag" ||
4770 test ! -s conftest.err
4771 }; then
4772 # Broken: success on invalid input.
4773 continue
4774 else
4775 echo "$as_me: failed program was:" >&5
4776 sed 's/^/| /' conftest.$ac_ext >&5
4777
4778 # Passes both tests.
4779 ac_preproc_ok=:
4780 break
4781 fi
4782
4783 rm -f conftest.err conftest.$ac_ext
4784
4785 done
4786 # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped.
4787 rm -f conftest.err conftest.$ac_ext
4788 if $ac_preproc_ok; then
4789 break
4790 fi
4791
4792 done
4793 ac_cv_prog_CPP=$CPP
4794
4795 fi
4796 CPP=$ac_cv_prog_CPP
4797 else
4798 ac_cv_prog_CPP=$CPP
4799 fi
4800 { echo "$as_me:$LINENO: result: $CPP" >&5
4801 echo "${ECHO_T}$CPP" >&6; }
4802 ac_preproc_ok=false
4803 for ac_c_preproc_warn_flag in '' yes
4804 do
4805 # Use a header file that comes with gcc, so configuring glibc
4806 # with a fresh cross-compiler works.
4807 # Prefer <limits.h> to <assert.h> if __STDC__ is defined, since
4808 # <limits.h> exists even on freestanding compilers.
4809 # On the NeXT, cc -E runs the code through the compiler's parser,
4810 # not just through cpp. "Syntax error" is here to catch this case.
4811 cat >conftest.$ac_ext <<_ACEOF
4812 /* confdefs.h. */
4813 _ACEOF
4814 cat confdefs.h >>conftest.$ac_ext
4815 cat >>conftest.$ac_ext <<_ACEOF
4816 /* end confdefs.h. */
4817 #ifdef __STDC__
4818 # include <limits.h>
4819 #else
4820 # include <assert.h>
4821 #endif
4822 Syntax error
4823 _ACEOF
4824 if { (ac_try="$ac_cpp conftest.$ac_ext"
4825 case "(($ac_try" in
4826 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
4827 *) ac_try_echo=$ac_try;;
4828 esac
4829 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
4830 (eval "$ac_cpp conftest.$ac_ext") 2>conftest.er1
4831 ac_status=$?
4832 grep -v '^ *+' conftest.er1 >conftest.err
4833 rm -f conftest.er1
4834 cat conftest.err >&5
4835 echo "$as_me:$LINENO: \$? = $ac_status" >&5
4836 (exit $ac_status); } >/dev/null && {
4837 test -z "$ac_c_preproc_warn_flag$ac_c_werror_flag" ||
4838 test ! -s conftest.err
4839 }; then
4840 :
4841 else
4842 echo "$as_me: failed program was:" >&5
4843 sed 's/^/| /' conftest.$ac_ext >&5
4844
4845 # Broken: fails on valid input.
4846 continue
4847 fi
4848
4849 rm -f conftest.err conftest.$ac_ext
4850
4851 # OK, works on sane cases. Now check whether nonexistent headers
4852 # can be detected and how.
4853 cat >conftest.$ac_ext <<_ACEOF
4854 /* confdefs.h. */
4855 _ACEOF
4856 cat confdefs.h >>conftest.$ac_ext
4857 cat >>conftest.$ac_ext <<_ACEOF
4858 /* end confdefs.h. */
4859 #include <ac_nonexistent.h>
4860 _ACEOF
4861 if { (ac_try="$ac_cpp conftest.$ac_ext"
4862 case "(($ac_try" in
4863 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
4864 *) ac_try_echo=$ac_try;;
4865 esac
4866 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
4867 (eval "$ac_cpp conftest.$ac_ext") 2>conftest.er1
4868 ac_status=$?
4869 grep -v '^ *+' conftest.er1 >conftest.err
4870 rm -f conftest.er1
4871 cat conftest.err >&5
4872 echo "$as_me:$LINENO: \$? = $ac_status" >&5
4873 (exit $ac_status); } >/dev/null && {
4874 test -z "$ac_c_preproc_warn_flag$ac_c_werror_flag" ||
4875 test ! -s conftest.err
4876 }; then
4877 # Broken: success on invalid input.
4878 continue
4879 else
4880 echo "$as_me: failed program was:" >&5
4881 sed 's/^/| /' conftest.$ac_ext >&5
4882
4883 # Passes both tests.
4884 ac_preproc_ok=:
4885 break
4886 fi
4887
4888 rm -f conftest.err conftest.$ac_ext
4889
4890 done
4891 # Because of `break', _AC_PREPROC_IFELSE's cleaning code was skipped.
4892 rm -f conftest.err conftest.$ac_ext
4893 if $ac_preproc_ok; then
4894 :
4895 else
4896 { { echo "$as_me:$LINENO: error: C preprocessor \"$CPP\" fails sanity check
4897 See \`config.log' for more details." >&5
4898 echo "$as_me: error: C preprocessor \"$CPP\" fails sanity check
4899 See \`config.log' for more details." >&2;}
4900 { (exit 1); exit 1; }; }
4901 fi
4902
4903 ac_ext=c
4904 ac_cpp='$CPP $CPPFLAGS'
4905 ac_compile='$CC -c $CFLAGS $CPPFLAGS conftest.$ac_ext >&5'
4906 ac_link='$CC -o conftest$ac_exeext $CFLAGS $CPPFLAGS $LDFLAGS conftest.$ac_ext $LIBS >&5'
4907 ac_compiler_gnu=$ac_cv_c_compiler_gnu
4908
4909
4910 { echo "$as_me:$LINENO: checking for grep that handles long lines and -e" >&5
4911 echo $ECHO_N "checking for grep that handles long lines and -e... $ECHO_C" >&6; }
4912 if test "${ac_cv_path_GREP+set}" = set; then
4913 echo $ECHO_N "(cached) $ECHO_C" >&6
4914 else
4915 # Extract the first word of "grep ggrep" to use in msg output
4916 if test -z "$GREP"; then
4917 set dummy grep ggrep; ac_prog_name=$2
4918 if test "${ac_cv_path_GREP+set}" = set; then
4919 echo $ECHO_N "(cached) $ECHO_C" >&6
4920 else
4921 ac_path_GREP_found=false
4922 # Loop through the user's path and test for each of PROGNAME-LIST
4923 as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
4924 for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin
4925 do
4926 IFS=$as_save_IFS
4927 test -z "$as_dir" && as_dir=.
4928 for ac_prog in grep ggrep; do
4929 for ac_exec_ext in '' $ac_executable_extensions; do
4930 ac_path_GREP="$as_dir/$ac_prog$ac_exec_ext"
4931 { test -f "$ac_path_GREP" && $as_test_x "$ac_path_GREP"; } || continue
4932 # Check for GNU ac_path_GREP and select it if it is found.
4933 # Check for GNU $ac_path_GREP
4934 case `"$ac_path_GREP" --version 2>&1` in
4935 *GNU*)
4936 ac_cv_path_GREP="$ac_path_GREP" ac_path_GREP_found=:;;
4937 *)
4938 ac_count=0
4939 echo $ECHO_N "0123456789$ECHO_C" >"conftest.in"
4940 while :
4941 do
4942 cat "conftest.in" "conftest.in" >"conftest.tmp"
4943 mv "conftest.tmp" "conftest.in"
4944 cp "conftest.in" "conftest.nl"
4945 echo 'GREP' >> "conftest.nl"
4946 "$ac_path_GREP" -e 'GREP$' -e '-(cannot match)-' < "conftest.nl" >"conftest.out" 2>/dev/null || break
4947 diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break
4948 ac_count=`expr $ac_count + 1`
4949 if test $ac_count -gt ${ac_path_GREP_max-0}; then
4950 # Best one so far, save it but keep looking for a better one
4951 ac_cv_path_GREP="$ac_path_GREP"
4952 ac_path_GREP_max=$ac_count
4953 fi
4954 # 10*(2^10) chars as input seems more than enough
4955 test $ac_count -gt 10 && break
4956 done
4957 rm -f conftest.in conftest.tmp conftest.nl conftest.out;;
4958 esac
4959
4960
4961 $ac_path_GREP_found && break 3
4962 done
4963 done
4964
4965 done
4966 IFS=$as_save_IFS
4967
4968
4969 fi
4970
4971 GREP="$ac_cv_path_GREP"
4972 if test -z "$GREP"; then
4973 { { echo "$as_me:$LINENO: error: no acceptable $ac_prog_name could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" >&5
4974 echo "$as_me: error: no acceptable $ac_prog_name could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" >&2;}
4975 { (exit 1); exit 1; }; }
4976 fi
4977
4978 else
4979 ac_cv_path_GREP=$GREP
4980 fi
4981
4982
4983 fi
4984 { echo "$as_me:$LINENO: result: $ac_cv_path_GREP" >&5
4985 echo "${ECHO_T}$ac_cv_path_GREP" >&6; }
4986 GREP="$ac_cv_path_GREP"
4987
4988
4989 { echo "$as_me:$LINENO: checking for egrep" >&5
4990 echo $ECHO_N "checking for egrep... $ECHO_C" >&6; }
4991 if test "${ac_cv_path_EGREP+set}" = set; then
4992 echo $ECHO_N "(cached) $ECHO_C" >&6
4993 else
4994 if echo a | $GREP -E '(a|b)' >/dev/null 2>&1
4995 then ac_cv_path_EGREP="$GREP -E"
4996 else
4997 # Extract the first word of "egrep" to use in msg output
4998 if test -z "$EGREP"; then
4999 set dummy egrep; ac_prog_name=$2
5000 if test "${ac_cv_path_EGREP+set}" = set; then
5001 echo $ECHO_N "(cached) $ECHO_C" >&6
5002 else
5003 ac_path_EGREP_found=false
5004 # Loop through the user's path and test for each of PROGNAME-LIST
5005 as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
5006 for as_dir in $PATH$PATH_SEPARATOR/usr/xpg4/bin
5007 do
5008 IFS=$as_save_IFS
5009 test -z "$as_dir" && as_dir=.
5010 for ac_prog in egrep; do
5011 for ac_exec_ext in '' $ac_executable_extensions; do
5012 ac_path_EGREP="$as_dir/$ac_prog$ac_exec_ext"
5013 { test -f "$ac_path_EGREP" && $as_test_x "$ac_path_EGREP"; } || continue
5014 # Check for GNU ac_path_EGREP and select it if it is found.
5015 # Check for GNU $ac_path_EGREP
5016 case `"$ac_path_EGREP" --version 2>&1` in
5017 *GNU*)
5018 ac_cv_path_EGREP="$ac_path_EGREP" ac_path_EGREP_found=:;;
5019 *)
5020 ac_count=0
5021 echo $ECHO_N "0123456789$ECHO_C" >"conftest.in"
5022 while :
5023 do
5024 cat "conftest.in" "conftest.in" >"conftest.tmp"
5025 mv "conftest.tmp" "conftest.in"
5026 cp "conftest.in" "conftest.nl"
5027 echo 'EGREP' >> "conftest.nl"
5028 "$ac_path_EGREP" 'EGREP$' < "conftest.nl" >"conftest.out" 2>/dev/null || break
5029 diff "conftest.out" "conftest.nl" >/dev/null 2>&1 || break
5030 ac_count=`expr $ac_count + 1`
5031 if test $ac_count -gt ${ac_path_EGREP_max-0}; then
5032 # Best one so far, save it but keep looking for a better one
5033 ac_cv_path_EGREP="$ac_path_EGREP"
5034 ac_path_EGREP_max=$ac_count
5035 fi
5036 # 10*(2^10) chars as input seems more than enough
5037 test $ac_count -gt 10 && break
5038 done
5039 rm -f conftest.in conftest.tmp conftest.nl conftest.out;;
5040 esac
5041
5042
5043 $ac_path_EGREP_found && break 3
5044 done
5045 done
5046
5047 done
5048 IFS=$as_save_IFS
5049
5050
5051 fi
5052
5053 EGREP="$ac_cv_path_EGREP"
5054 if test -z "$EGREP"; then
5055 { { echo "$as_me:$LINENO: error: no acceptable $ac_prog_name could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" >&5
5056 echo "$as_me: error: no acceptable $ac_prog_name could be found in $PATH$PATH_SEPARATOR/usr/xpg4/bin" >&2;}
5057 { (exit 1); exit 1; }; }
5058 fi
5059
5060 else
5061 ac_cv_path_EGREP=$EGREP
5062 fi
5063
5064
5065 fi
5066 fi
5067 { echo "$as_me:$LINENO: result: $ac_cv_path_EGREP" >&5
5068 echo "${ECHO_T}$ac_cv_path_EGREP" >&6; }
5069 EGREP="$ac_cv_path_EGREP"
5070
5071
5072 { echo "$as_me:$LINENO: checking for ANSI C header files" >&5
5073 echo $ECHO_N "checking for ANSI C header files... $ECHO_C" >&6; }
5074 if test "${ac_cv_header_stdc+set}" = set; then
5075 echo $ECHO_N "(cached) $ECHO_C" >&6
5076 else
5077 cat >conftest.$ac_ext <<_ACEOF
5078 /* confdefs.h. */
5079 _ACEOF
5080 cat confdefs.h >>conftest.$ac_ext
5081 cat >>conftest.$ac_ext <<_ACEOF
5082 /* end confdefs.h. */
5083 #include <stdlib.h>
5084 #include <stdarg.h>
5085 #include <string.h>
5086 #include <float.h>
5087
5088 int
5089 main ()
5090 {
5091
5092 ;
5093 return 0;
5094 }
5095 _ACEOF
5096 rm -f conftest.$ac_objext
5097 if { (ac_try="$ac_compile"
5098 case "(($ac_try" in
5099 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
5100 *) ac_try_echo=$ac_try;;
5101 esac
5102 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
5103 (eval "$ac_compile") 2>conftest.er1
5104 ac_status=$?
5105 grep -v '^ *+' conftest.er1 >conftest.err
5106 rm -f conftest.er1
5107 cat conftest.err >&5
5108 echo "$as_me:$LINENO: \$? = $ac_status" >&5
5109 (exit $ac_status); } && {
5110 test -z "$ac_c_werror_flag" ||
5111 test ! -s conftest.err
5112 } && test -s conftest.$ac_objext; then
5113 ac_cv_header_stdc=yes
5114 else
5115 echo "$as_me: failed program was:" >&5
5116 sed 's/^/| /' conftest.$ac_ext >&5
5117
5118 ac_cv_header_stdc=no
5119 fi
5120
5121 rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
5122
5123 if test $ac_cv_header_stdc = yes; then
5124 # SunOS 4.x string.h does not declare mem*, contrary to ANSI.
5125 cat >conftest.$ac_ext <<_ACEOF
5126 /* confdefs.h. */
5127 _ACEOF
5128 cat confdefs.h >>conftest.$ac_ext
5129 cat >>conftest.$ac_ext <<_ACEOF
5130 /* end confdefs.h. */
5131 #include <string.h>
5132
5133 _ACEOF
5134 if (eval "$ac_cpp conftest.$ac_ext") 2>&5 |
5135 $EGREP "memchr" >/dev/null 2>&1; then
5136 :
5137 else
5138 ac_cv_header_stdc=no
5139 fi
5140 rm -f conftest*
5141
5142 fi
5143
5144 if test $ac_cv_header_stdc = yes; then
5145 # ISC 2.0.2 stdlib.h does not declare free, contrary to ANSI.
5146 cat >conftest.$ac_ext <<_ACEOF
5147 /* confdefs.h. */
5148 _ACEOF
5149 cat confdefs.h >>conftest.$ac_ext
5150 cat >>conftest.$ac_ext <<_ACEOF
5151 /* end confdefs.h. */
5152 #include <stdlib.h>
5153
5154 _ACEOF
5155 if (eval "$ac_cpp conftest.$ac_ext") 2>&5 |
5156 $EGREP "free" >/dev/null 2>&1; then
5157 :
5158 else
5159 ac_cv_header_stdc=no
5160 fi
5161 rm -f conftest*
5162
5163 fi
5164
5165 if test $ac_cv_header_stdc = yes; then
5166 # /bin/cc in Irix-4.0.5 gets non-ANSI ctype macros unless using -ansi.
5167 if test "$cross_compiling" = yes; then
5168 :
5169 else
5170 cat >conftest.$ac_ext <<_ACEOF
5171 /* confdefs.h. */
5172 _ACEOF
5173 cat confdefs.h >>conftest.$ac_ext
5174 cat >>conftest.$ac_ext <<_ACEOF
5175 /* end confdefs.h. */
5176 #include <ctype.h>
5177 #include <stdlib.h>
5178 #if ((' ' & 0x0FF) == 0x020)
5179 # define ISLOWER(c) ('a' <= (c) && (c) <= 'z')
5180 # define TOUPPER(c) (ISLOWER(c) ? 'A' + ((c) - 'a') : (c))
5181 #else
5182 # define ISLOWER(c) \
5183 (('a' <= (c) && (c) <= 'i') \
5184 || ('j' <= (c) && (c) <= 'r') \
5185 || ('s' <= (c) && (c) <= 'z'))
5186 # define TOUPPER(c) (ISLOWER(c) ? ((c) | 0x40) : (c))
5187 #endif
5188
5189 #define XOR(e, f) (((e) && !(f)) || (!(e) && (f)))
5190 int
5191 main ()
5192 {
5193 int i;
5194 for (i = 0; i < 256; i++)
5195 if (XOR (islower (i), ISLOWER (i))
5196 || toupper (i) != TOUPPER (i))
5197 return 2;
5198 return 0;
5199 }
5200 _ACEOF
5201 rm -f conftest$ac_exeext
5202 if { (ac_try="$ac_link"
5203 case "(($ac_try" in
5204 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
5205 *) ac_try_echo=$ac_try;;
5206 esac
5207 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
5208 (eval "$ac_link") 2>&5
5209 ac_status=$?
5210 echo "$as_me:$LINENO: \$? = $ac_status" >&5
5211 (exit $ac_status); } && { ac_try='./conftest$ac_exeext'
5212 { (case "(($ac_try" in
5213 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
5214 *) ac_try_echo=$ac_try;;
5215 esac
5216 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
5217 (eval "$ac_try") 2>&5
5218 ac_status=$?
5219 echo "$as_me:$LINENO: \$? = $ac_status" >&5
5220 (exit $ac_status); }; }; then
5221 :
5222 else
5223 echo "$as_me: program exited with status $ac_status" >&5
5224 echo "$as_me: failed program was:" >&5
5225 sed 's/^/| /' conftest.$ac_ext >&5
5226
5227 ( exit $ac_status )
5228 ac_cv_header_stdc=no
5229 fi
5230 rm -f core *.core core.conftest.* gmon.out bb.out conftest$ac_exeext conftest.$ac_objext conftest.$ac_ext
5231 fi
5232
5233
5234 fi
5235 fi
5236 { echo "$as_me:$LINENO: result: $ac_cv_header_stdc" >&5
5237 echo "${ECHO_T}$ac_cv_header_stdc" >&6; }
5238 if test $ac_cv_header_stdc = yes; then
5239
5240 cat >>confdefs.h <<\_ACEOF
5241 #define STDC_HEADERS 1
5242 _ACEOF
5243
5244 fi
5245
5246 # On IRIX 5.3, sys/types and inttypes.h are conflicting.
5247
5248
5249
5250
5251
5252
5253
5254
5255
5256 for ac_header in sys/types.h sys/stat.h stdlib.h string.h memory.h strings.h \
5257 inttypes.h stdint.h unistd.h
5258 do
5259 as_ac_Header=`echo "ac_cv_header_$ac_header" | $as_tr_sh`
5260 { echo "$as_me:$LINENO: checking for $ac_header" >&5
5261 echo $ECHO_N "checking for $ac_header... $ECHO_C" >&6; }
5262 if { as_var=$as_ac_Header; eval "test \"\${$as_var+set}\" = set"; }; then
5263 echo $ECHO_N "(cached) $ECHO_C" >&6
5264 else
5265 cat >conftest.$ac_ext <<_ACEOF
5266 /* confdefs.h. */
5267 _ACEOF
5268 cat confdefs.h >>conftest.$ac_ext
5269 cat >>conftest.$ac_ext <<_ACEOF
5270 /* end confdefs.h. */
5271 $ac_includes_default
5272
5273 #include <$ac_header>
5274 _ACEOF
5275 rm -f conftest.$ac_objext
5276 if { (ac_try="$ac_compile"
5277 case "(($ac_try" in
5278 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
5279 *) ac_try_echo=$ac_try;;
5280 esac
5281 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
5282 (eval "$ac_compile") 2>conftest.er1
5283 ac_status=$?
5284 grep -v '^ *+' conftest.er1 >conftest.err
5285 rm -f conftest.er1
5286 cat conftest.err >&5
5287 echo "$as_me:$LINENO: \$? = $ac_status" >&5
5288 (exit $ac_status); } && {
5289 test -z "$ac_c_werror_flag" ||
5290 test ! -s conftest.err
5291 } && test -s conftest.$ac_objext; then
5292 eval "$as_ac_Header=yes"
5293 else
5294 echo "$as_me: failed program was:" >&5
5295 sed 's/^/| /' conftest.$ac_ext >&5
5296
5297 eval "$as_ac_Header=no"
5298 fi
5299
5300 rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
5301 fi
5302 ac_res=`eval echo '${'$as_ac_Header'}'`
5303 { echo "$as_me:$LINENO: result: $ac_res" >&5
5304 echo "${ECHO_T}$ac_res" >&6; }
5305 if test `eval echo '${'$as_ac_Header'}'` = yes; then
5306 cat >>confdefs.h <<_ACEOF
5307 #define `echo "HAVE_$ac_header" | $as_tr_cpp` 1
5308 _ACEOF
5309
5310 fi
5311
5312 done
5313
5314
5315
5316
5317
5318 for ac_header in getopt.h sys/wait.h gd.h
5319 do
5320 as_ac_Header=`echo "ac_cv_header_$ac_header" | $as_tr_sh`
5321 if { as_var=$as_ac_Header; eval "test \"\${$as_var+set}\" = set"; }; then
5322 { echo "$as_me:$LINENO: checking for $ac_header" >&5
5323 echo $ECHO_N "checking for $ac_header... $ECHO_C" >&6; }
5324 if { as_var=$as_ac_Header; eval "test \"\${$as_var+set}\" = set"; }; then
5325 echo $ECHO_N "(cached) $ECHO_C" >&6
5326 fi
5327 ac_res=`eval echo '${'$as_ac_Header'}'`
5328 { echo "$as_me:$LINENO: result: $ac_res" >&5
5329 echo "${ECHO_T}$ac_res" >&6; }
5330 else
5331 # Is the header compilable?
5332 { echo "$as_me:$LINENO: checking $ac_header usability" >&5
5333 echo $ECHO_N "checking $ac_header usability... $ECHO_C" >&6; }
5334 cat >conftest.$ac_ext <<_ACEOF
5335 /* confdefs.h. */
5336 _ACEOF
5337 cat confdefs.h >>conftest.$ac_ext
5338 cat >>conftest.$ac_ext <<_ACEOF
5339 /* end confdefs.h. */
5340 $ac_includes_default
5341 #include <$ac_header>
5342 _ACEOF
5343 rm -f conftest.$ac_objext
5344 if { (ac_try="$ac_compile"
5345 case "(($ac_try" in
5346 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
5347 *) ac_try_echo=$ac_try;;
5348 esac
5349 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
5350 (eval "$ac_compile") 2>conftest.er1
5351 ac_status=$?
5352 grep -v '^ *+' conftest.er1 >conftest.err
5353 rm -f conftest.er1
5354 cat conftest.err >&5
5355 echo "$as_me:$LINENO: \$? = $ac_status" >&5
5356 (exit $ac_status); } && {
5357 test -z "$ac_c_werror_flag" ||
5358 test ! -s conftest.err
5359 } && test -s conftest.$ac_objext; then
5360 ac_header_compiler=yes
5361 else
5362 echo "$as_me: failed program was:" >&5
5363 sed 's/^/| /' conftest.$ac_ext >&5
5364
5365 ac_header_compiler=no
5366 fi
5367
5368 rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
5369 { echo "$as_me:$LINENO: result: $ac_header_compiler" >&5
5370 echo "${ECHO_T}$ac_header_compiler" >&6; }
5371
5372 # Is the header present?
5373 { echo "$as_me:$LINENO: checking $ac_header presence" >&5
5374 echo $ECHO_N "checking $ac_header presence... $ECHO_C" >&6; }
5375 cat >conftest.$ac_ext <<_ACEOF
5376 /* confdefs.h. */
5377 _ACEOF
5378 cat confdefs.h >>conftest.$ac_ext
5379 cat >>conftest.$ac_ext <<_ACEOF
5380 /* end confdefs.h. */
5381 #include <$ac_header>
5382 _ACEOF
5383 if { (ac_try="$ac_cpp conftest.$ac_ext"
5384 case "(($ac_try" in
5385 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
5386 *) ac_try_echo=$ac_try;;
5387 esac
5388 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
5389 (eval "$ac_cpp conftest.$ac_ext") 2>conftest.er1
5390 ac_status=$?
5391 grep -v '^ *+' conftest.er1 >conftest.err
5392 rm -f conftest.er1
5393 cat conftest.err >&5
5394 echo "$as_me:$LINENO: \$? = $ac_status" >&5
5395 (exit $ac_status); } >/dev/null && {
5396 test -z "$ac_c_preproc_warn_flag$ac_c_werror_flag" ||
5397 test ! -s conftest.err
5398 }; then
5399 ac_header_preproc=yes
5400 else
5401 echo "$as_me: failed program was:" >&5
5402 sed 's/^/| /' conftest.$ac_ext >&5
5403
5404 ac_header_preproc=no
5405 fi
5406
5407 rm -f conftest.err conftest.$ac_ext
5408 { echo "$as_me:$LINENO: result: $ac_header_preproc" >&5
5409 echo "${ECHO_T}$ac_header_preproc" >&6; }
5410
5411 # So? What about this header?
5412 case $ac_header_compiler:$ac_header_preproc:$ac_c_preproc_warn_flag in
5413 yes:no: )
5414 { echo "$as_me:$LINENO: WARNING: $ac_header: accepted by the compiler, rejected by the preprocessor!" >&5
5415 echo "$as_me: WARNING: $ac_header: accepted by the compiler, rejected by the preprocessor!" >&2;}
5416 { echo "$as_me:$LINENO: WARNING: $ac_header: proceeding with the compiler's result" >&5
5417 echo "$as_me: WARNING: $ac_header: proceeding with the compiler's result" >&2;}
5418 ac_header_preproc=yes
5419 ;;
5420 no:yes:* )
5421 { echo "$as_me:$LINENO: WARNING: $ac_header: present but cannot be compiled" >&5
5422 echo "$as_me: WARNING: $ac_header: present but cannot be compiled" >&2;}
5423 { echo "$as_me:$LINENO: WARNING: $ac_header: check for missing prerequisite headers?" >&5
5424 echo "$as_me: WARNING: $ac_header: check for missing prerequisite headers?" >&2;}
5425 { echo "$as_me:$LINENO: WARNING: $ac_header: see the Autoconf documentation" >&5
5426 echo "$as_me: WARNING: $ac_header: see the Autoconf documentation" >&2;}
5427 { echo "$as_me:$LINENO: WARNING: $ac_header: section \"Present But Cannot Be Compiled\"" >&5
5428 echo "$as_me: WARNING: $ac_header: section \"Present But Cannot Be Compiled\"" >&2;}
5429 { echo "$as_me:$LINENO: WARNING: $ac_header: proceeding with the preprocessor's result" >&5
5430 echo "$as_me: WARNING: $ac_header: proceeding with the preprocessor's result" >&2;}
5431 { echo "$as_me:$LINENO: WARNING: $ac_header: in the future, the compiler will take precedence" >&5
5432 echo "$as_me: WARNING: $ac_header: in the future, the compiler will take precedence" >&2;}
5433 ( cat <<\_ASBOX
5434 ## ------------------------------------ ##
5435 ## Report this to [email protected] ##
5436 ## ------------------------------------ ##
5437 _ASBOX
5438 ) | sed "s/^/$as_me: WARNING: /" >&2
5439 ;;
5440 esac
5441 { echo "$as_me:$LINENO: checking for $ac_header" >&5
5442 echo $ECHO_N "checking for $ac_header... $ECHO_C" >&6; }
5443 if { as_var=$as_ac_Header; eval "test \"\${$as_var+set}\" = set"; }; then
5444 echo $ECHO_N "(cached) $ECHO_C" >&6
5445 else
5446 eval "$as_ac_Header=\$ac_header_preproc"
5447 fi
5448 ac_res=`eval echo '${'$as_ac_Header'}'`
5449 { echo "$as_me:$LINENO: result: $ac_res" >&5
5450 echo "${ECHO_T}$ac_res" >&6; }
5451
5452 fi
5453 if test `eval echo '${'$as_ac_Header'}'` = yes; then
5454 cat >>confdefs.h <<_ACEOF
5455 #define `echo "HAVE_$ac_header" | $as_tr_cpp` 1
5456 _ACEOF
5457
5458 fi
5459
5460 done
5461
5462
5463 # Checks for typedefs, structures, and compiler characteristics.
5464 { echo "$as_me:$LINENO: checking for an ANSI C-conforming const" >&5
5465 echo $ECHO_N "checking for an ANSI C-conforming const... $ECHO_C" >&6; }
5466 if test "${ac_cv_c_const+set}" = set; then
5467 echo $ECHO_N "(cached) $ECHO_C" >&6
5468 else
5469 cat >conftest.$ac_ext <<_ACEOF
5470 /* confdefs.h. */
5471 _ACEOF
5472 cat confdefs.h >>conftest.$ac_ext
5473 cat >>conftest.$ac_ext <<_ACEOF
5474 /* end confdefs.h. */
5475
5476 int
5477 main ()
5478 {
5479 /* FIXME: Include the comments suggested by Paul. */
5480 #ifndef __cplusplus
5481 /* Ultrix mips cc rejects this. */
5482 typedef int charset[2];
5483 const charset cs;
5484 /* SunOS 4.1.1 cc rejects this. */
5485 char const *const *pcpcc;
5486 char **ppc;
5487 /* NEC SVR4.0.2 mips cc rejects this. */
5488 struct point {int x, y;};
5489 static struct point const zero = {0,0};
5490 /* AIX XL C 1.02.0.0 rejects this.
5491 It does not let you subtract one const X* pointer from another in
5492 an arm of an if-expression whose if-part is not a constant
5493 expression */
5494 const char *g = "string";
5495 pcpcc = &g + (g ? g-g : 0);
5496 /* HPUX 7.0 cc rejects these. */
5497 ++pcpcc;
5498 ppc = (char**) pcpcc;
5499 pcpcc = (char const *const *) ppc;
5500 { /* SCO 3.2v4 cc rejects this. */
5501 char *t;
5502 char const *s = 0 ? (char *) 0 : (char const *) 0;
5503
5504 *t++ = 0;
5505 if (s) return 0;
5506 }
5507 { /* Someone thinks the Sun supposedly-ANSI compiler will reject this. */
5508 int x[] = {25, 17};
5509 const int *foo = &x[0];
5510 ++foo;
5511 }
5512 { /* Sun SC1.0 ANSI compiler rejects this -- but not the above. */
5513 typedef const int *iptr;
5514 iptr p = 0;
5515 ++p;
5516 }
5517 { /* AIX XL C 1.02.0.0 rejects this saying
5518 "k.c", line 2.27: 1506-025 (S) Operand must be a modifiable lvalue. */
5519 struct s { int j; const int *ap[3]; };
5520 struct s *b; b->j = 5;
5521 }
5522 { /* ULTRIX-32 V3.1 (Rev 9) vcc rejects this */
5523 const int foo = 10;
5524 if (!foo) return 0;
5525 }
5526 return !cs[0] && !zero.x;
5527 #endif
5528
5529 ;
5530 return 0;
5531 }
5532 _ACEOF
5533 rm -f conftest.$ac_objext
5534 if { (ac_try="$ac_compile"
5535 case "(($ac_try" in
5536 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
5537 *) ac_try_echo=$ac_try;;
5538 esac
5539 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
5540 (eval "$ac_compile") 2>conftest.er1
5541 ac_status=$?
5542 grep -v '^ *+' conftest.er1 >conftest.err
5543 rm -f conftest.er1
5544 cat conftest.err >&5
5545 echo "$as_me:$LINENO: \$? = $ac_status" >&5
5546 (exit $ac_status); } && {
5547 test -z "$ac_c_werror_flag" ||
5548 test ! -s conftest.err
5549 } && test -s conftest.$ac_objext; then
5550 ac_cv_c_const=yes
5551 else
5552 echo "$as_me: failed program was:" >&5
5553 sed 's/^/| /' conftest.$ac_ext >&5
5554
5555 ac_cv_c_const=no
5556 fi
5557
5558 rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
5559 fi
5560 { echo "$as_me:$LINENO: result: $ac_cv_c_const" >&5
5561 echo "${ECHO_T}$ac_cv_c_const" >&6; }
5562 if test $ac_cv_c_const = no; then
5563
5564 cat >>confdefs.h <<\_ACEOF
5565 #define const
5566 _ACEOF
5567
5568 fi
5569
5570 { echo "$as_me:$LINENO: checking for inline" >&5
5571 echo $ECHO_N "checking for inline... $ECHO_C" >&6; }
5572 if test "${ac_cv_c_inline+set}" = set; then
5573 echo $ECHO_N "(cached) $ECHO_C" >&6
5574 else
5575 ac_cv_c_inline=no
5576 for ac_kw in inline __inline__ __inline; do
5577 cat >conftest.$ac_ext <<_ACEOF
5578 /* confdefs.h. */
5579 _ACEOF
5580 cat confdefs.h >>conftest.$ac_ext
5581 cat >>conftest.$ac_ext <<_ACEOF
5582 /* end confdefs.h. */
5583 #ifndef __cplusplus
5584 typedef int foo_t;
5585 static $ac_kw foo_t static_foo () {return 0; }
5586 $ac_kw foo_t foo () {return 0; }
5587 #endif
5588
5589 _ACEOF
5590 rm -f conftest.$ac_objext
5591 if { (ac_try="$ac_compile"
5592 case "(($ac_try" in
5593 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
5594 *) ac_try_echo=$ac_try;;
5595 esac
5596 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
5597 (eval "$ac_compile") 2>conftest.er1
5598 ac_status=$?
5599 grep -v '^ *+' conftest.er1 >conftest.err
5600 rm -f conftest.er1
5601 cat conftest.err >&5
5602 echo "$as_me:$LINENO: \$? = $ac_status" >&5
5603 (exit $ac_status); } && {
5604 test -z "$ac_c_werror_flag" ||
5605 test ! -s conftest.err
5606 } && test -s conftest.$ac_objext; then
5607 ac_cv_c_inline=$ac_kw
5608 else
5609 echo "$as_me: failed program was:" >&5
5610 sed 's/^/| /' conftest.$ac_ext >&5
5611
5612
5613 fi
5614
5615 rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
5616 test "$ac_cv_c_inline" != no && break
5617 done
5618
5619 fi
5620 { echo "$as_me:$LINENO: result: $ac_cv_c_inline" >&5
5621 echo "${ECHO_T}$ac_cv_c_inline" >&6; }
5622
5623
5624 case $ac_cv_c_inline in
5625 inline | yes) ;;
5626 *)
5627 case $ac_cv_c_inline in
5628 no) ac_val=;;
5629 *) ac_val=$ac_cv_c_inline;;
5630 esac
5631 cat >>confdefs.h <<_ACEOF
5632 #ifndef __cplusplus
5633 #define inline $ac_val
5634 #endif
5635 _ACEOF
5636 ;;
5637 esac
5638
5639 { echo "$as_me:$LINENO: checking for size_t" >&5
5640 echo $ECHO_N "checking for size_t... $ECHO_C" >&6; }
5641 if test "${ac_cv_type_size_t+set}" = set; then
5642 echo $ECHO_N "(cached) $ECHO_C" >&6
5643 else
5644 cat >conftest.$ac_ext <<_ACEOF
5645 /* confdefs.h. */
5646 _ACEOF
5647 cat confdefs.h >>conftest.$ac_ext
5648 cat >>conftest.$ac_ext <<_ACEOF
5649 /* end confdefs.h. */
5650 $ac_includes_default
5651 typedef size_t ac__type_new_;
5652 int
5653 main ()
5654 {
5655 if ((ac__type_new_ *) 0)
5656 return 0;
5657 if (sizeof (ac__type_new_))
5658 return 0;
5659 ;
5660 return 0;
5661 }
5662 _ACEOF
5663 rm -f conftest.$ac_objext
5664 if { (ac_try="$ac_compile"
5665 case "(($ac_try" in
5666 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
5667 *) ac_try_echo=$ac_try;;
5668 esac
5669 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
5670 (eval "$ac_compile") 2>conftest.er1
5671 ac_status=$?
5672 grep -v '^ *+' conftest.er1 >conftest.err
5673 rm -f conftest.er1
5674 cat conftest.err >&5
5675 echo "$as_me:$LINENO: \$? = $ac_status" >&5
5676 (exit $ac_status); } && {
5677 test -z "$ac_c_werror_flag" ||
5678 test ! -s conftest.err
5679 } && test -s conftest.$ac_objext; then
5680 ac_cv_type_size_t=yes
5681 else
5682 echo "$as_me: failed program was:" >&5
5683 sed 's/^/| /' conftest.$ac_ext >&5
5684
5685 ac_cv_type_size_t=no
5686 fi
5687
5688 rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
5689 fi
5690 { echo "$as_me:$LINENO: result: $ac_cv_type_size_t" >&5
5691 echo "${ECHO_T}$ac_cv_type_size_t" >&6; }
5692 if test $ac_cv_type_size_t = yes; then
5693 :
5694 else
5695
5696 cat >>confdefs.h <<_ACEOF
5697 #define size_t unsigned int
5698 _ACEOF
5699
5700 fi
5701
5702 { echo "$as_me:$LINENO: checking whether time.h and sys/time.h may both be included" >&5
5703 echo $ECHO_N "checking whether time.h and sys/time.h may both be included... $ECHO_C" >&6; }
5704 if test "${ac_cv_header_time+set}" = set; then
5705 echo $ECHO_N "(cached) $ECHO_C" >&6
5706 else
5707 cat >conftest.$ac_ext <<_ACEOF
5708 /* confdefs.h. */
5709 _ACEOF
5710 cat confdefs.h >>conftest.$ac_ext
5711 cat >>conftest.$ac_ext <<_ACEOF
5712 /* end confdefs.h. */
5713 #include <sys/types.h>
5714 #include <sys/time.h>
5715 #include <time.h>
5716
5717 int
5718 main ()
5719 {
5720 if ((struct tm *) 0)
5721 return 0;
5722 ;
5723 return 0;
5724 }
5725 _ACEOF
5726 rm -f conftest.$ac_objext
5727 if { (ac_try="$ac_compile"
5728 case "(($ac_try" in
5729 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
5730 *) ac_try_echo=$ac_try;;
5731 esac
5732 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
5733 (eval "$ac_compile") 2>conftest.er1
5734 ac_status=$?
5735 grep -v '^ *+' conftest.er1 >conftest.err
5736 rm -f conftest.er1
5737 cat conftest.err >&5
5738 echo "$as_me:$LINENO: \$? = $ac_status" >&5
5739 (exit $ac_status); } && {
5740 test -z "$ac_c_werror_flag" ||
5741 test ! -s conftest.err
5742 } && test -s conftest.$ac_objext; then
5743 ac_cv_header_time=yes
5744 else
5745 echo "$as_me: failed program was:" >&5
5746 sed 's/^/| /' conftest.$ac_ext >&5
5747
5748 ac_cv_header_time=no
5749 fi
5750
5751 rm -f core conftest.err conftest.$ac_objext conftest.$ac_ext
5752 fi
5753 { echo "$as_me:$LINENO: result: $ac_cv_header_time" >&5
5754 echo "${ECHO_T}$ac_cv_header_time" >&6; }
5755 if test $ac_cv_header_time = yes; then
5756
5757 cat >>confdefs.h <<\_ACEOF
5758 #define TIME_WITH_SYS_TIME 1
5759 _ACEOF
5760
5761 fi
5762
5763
5764 # Checks for library functions.
5765
5766
5767
5768 for ac_func in memset strdup strtol
5769 do
5770 as_ac_var=`echo "ac_cv_func_$ac_func" | $as_tr_sh`
5771 { echo "$as_me:$LINENO: checking for $ac_func" >&5
5772 echo $ECHO_N "checking for $ac_func... $ECHO_C" >&6; }
5773 if { as_var=$as_ac_var; eval "test \"\${$as_var+set}\" = set"; }; then
5774 echo $ECHO_N "(cached) $ECHO_C" >&6
5775 else
5776 cat >conftest.$ac_ext <<_ACEOF
5777 /* confdefs.h. */
5778 _ACEOF
5779 cat confdefs.h >>conftest.$ac_ext
5780 cat >>conftest.$ac_ext <<_ACEOF
5781 /* end confdefs.h. */
5782 /* Define $ac_func to an innocuous variant, in case <limits.h> declares $ac_func.
5783 For example, HP-UX 11i <limits.h> declares gettimeofday. */
5784 #define $ac_func innocuous_$ac_func
5785
5786 /* System header to define __stub macros and hopefully few prototypes,
5787 which can conflict with char $ac_func (); below.
5788 Prefer <limits.h> to <assert.h> if __STDC__ is defined, since
5789 <limits.h> exists even on freestanding compilers. */
5790
5791 #ifdef __STDC__
5792 # include <limits.h>
5793 #else
5794 # include <assert.h>
5795 #endif
5796
5797 #undef $ac_func
5798
5799 /* Override any GCC internal prototype to avoid an error.
5800 Use char because int might match the return type of a GCC
5801 builtin and then its argument prototype would still apply. */
5802 #ifdef __cplusplus
5803 extern "C"
5804 #endif
5805 char $ac_func ();
5806 /* The GNU C library defines this for functions which it implements
5807 to always fail with ENOSYS. Some functions are actually named
5808 something starting with __ and the normal name is an alias. */
5809 #if defined __stub_$ac_func || defined __stub___$ac_func
5810 choke me
5811 #endif
5812
5813 int
5814 main ()
5815 {
5816 return $ac_func ();
5817 ;
5818 return 0;
5819 }
5820 _ACEOF
5821 rm -f conftest.$ac_objext conftest$ac_exeext
5822 if { (ac_try="$ac_link"
5823 case "(($ac_try" in
5824 *\"* | *\`* | *\\*) ac_try_echo=\$ac_try;;
5825 *) ac_try_echo=$ac_try;;
5826 esac
5827 eval "echo \"\$as_me:$LINENO: $ac_try_echo\"") >&5
5828 (eval "$ac_link") 2>conftest.er1
5829 ac_status=$?
5830 grep -v '^ *+' conftest.er1 >conftest.err
5831 rm -f conftest.er1
5832 cat conftest.err >&5
5833 echo "$as_me:$LINENO: \$? = $ac_status" >&5
5834 (exit $ac_status); } && {
5835 test -z "$ac_c_werror_flag" ||
5836 test ! -s conftest.err
5837 } && test -s conftest$ac_exeext &&
5838 $as_test_x conftest$ac_exeext; then
5839 eval "$as_ac_var=yes"
5840 else
5841 echo "$as_me: failed program was:" >&5
5842 sed 's/^/| /' conftest.$ac_ext >&5
5843
5844 eval "$as_ac_var=no"
5845 fi
5846
5847 rm -f core conftest.err conftest.$ac_objext conftest_ipa8_conftest.oo \
5848 conftest$ac_exeext conftest.$ac_ext
5849 fi
5850 ac_res=`eval echo '${'$as_ac_var'}'`
5851 { echo "$as_me:$LINENO: result: $ac_res" >&5
5852 echo "${ECHO_T}$ac_res" >&6; }
5853 if test `eval echo '${'$as_ac_var'}'` = yes; then
5854 cat >>confdefs.h <<_ACEOF
5855 #define `echo "HAVE_$ac_func" | $as_tr_cpp` 1
5856 _ACEOF
5857
5858 fi
5859 done
5860
5861
5862 cat >confcache <<\_ACEOF
5863 # This file is a shell script that caches the results of configure
5864 # tests run on this system so they can be shared between configure
5865 # scripts and configure runs, see configure's option --config-cache.
5866 # It is not useful on other systems. If it contains results you don't
5867 # want to keep, you may remove or edit it.
5868 #
5869 # config.status only pays attention to the cache file if you give it
5870 # the --recheck option to rerun configure.
5871 #
5872 # `ac_cv_env_foo' variables (set or unset) will be overridden when
5873 # loading this file, other *unset* `ac_cv_foo' will be assigned the
5874 # following values.
5875
5876 _ACEOF
5877
5878 # The following way of writing the cache mishandles newlines in values,
5879 # but we know of no workaround that is simple, portable, and efficient.
5880 # So, we kill variables containing newlines.
5881 # Ultrix sh set writes to stderr and can't be redirected directly,
5882 # and sets the high bit in the cache file unless we assign to the vars.
5883 (
5884 for ac_var in `(set) 2>&1 | sed -n 's/^\([a-zA-Z_][a-zA-Z0-9_]*\)=.*/\1/p'`; do
5885 eval ac_val=\$$ac_var
5886 case $ac_val in #(
5887 *${as_nl}*)
5888 case $ac_var in #(
5889 *_cv_*) { echo "$as_me:$LINENO: WARNING: Cache variable $ac_var contains a newline." >&5
5890 echo "$as_me: WARNING: Cache variable $ac_var contains a newline." >&2;} ;;
5891 esac
5892 case $ac_var in #(
5893 _ | IFS | as_nl) ;; #(
5894 *) $as_unset $ac_var ;;
5895 esac ;;
5896 esac
5897 done
5898
5899 (set) 2>&1 |
5900 case $as_nl`(ac_space=' '; set) 2>&1` in #(
5901 *${as_nl}ac_space=\ *)
5902 # `set' does not quote correctly, so add quotes (double-quote
5903 # substitution turns \\\\ into \\, and sed turns \\ into \).
5904 sed -n \
5905 "s/'/'\\\\''/g;
5906 s/^\\([_$as_cr_alnum]*_cv_[_$as_cr_alnum]*\\)=\\(.*\\)/\\1='\\2'/p"
5907 ;; #(
5908 *)
5909 # `set' quotes correctly as required by POSIX, so do not add quotes.
5910 sed -n "/^[_$as_cr_alnum]*_cv_[_$as_cr_alnum]*=/p"
5911 ;;
5912 esac |
5913 sort
5914 ) |
5915 sed '
5916 /^ac_cv_env_/b end
5917 t clear
5918 :clear
5919 s/^\([^=]*\)=\(.*[{}].*\)$/test "${\1+set}" = set || &/
5920 t end
5921 s/^\([^=]*\)=\(.*\)$/\1=${\1=\2}/
5922 :end' >>confcache
5923 if diff "$cache_file" confcache >/dev/null 2>&1; then :; else
5924 if test -w "$cache_file"; then
5925 test "x$cache_file" != "x/dev/null" &&
5926 { echo "$as_me:$LINENO: updating cache $cache_file" >&5
5927 echo "$as_me: updating cache $cache_file" >&6;}
5928 cat confcache >$cache_file
5929 else
5930 { echo "$as_me:$LINENO: not updating unwritable cache $cache_file" >&5
5931 echo "$as_me: not updating unwritable cache $cache_file" >&6;}
5932 fi
5933 fi
5934 rm -f confcache
5935
5936 test "x$prefix" = xNONE && prefix=$ac_default_prefix
5937 # Let make expand exec_prefix.
5938 test "x$exec_prefix" = xNONE && exec_prefix='${prefix}'
5939
5940 DEFS=-DHAVE_CONFIG_H
5941
5942 ac_libobjs=
5943 ac_ltlibobjs=
5944 for ac_i in : $LIBOBJS; do test "x$ac_i" = x: && continue
5945 # 1. Remove the extension, and $U if already installed.
5946 ac_script='s/\$U\././;s/\.o$//;s/\.obj$//'
5947 ac_i=`echo "$ac_i" | sed "$ac_script"`
5948 # 2. Prepend LIBOBJDIR. When used with automake>=1.10 LIBOBJDIR
5949 # will be set to the directory where LIBOBJS objects are built.
5950 ac_libobjs="$ac_libobjs \${LIBOBJDIR}$ac_i\$U.$ac_objext"
5951 ac_ltlibobjs="$ac_ltlibobjs \${LIBOBJDIR}$ac_i"'$U.lo'
5952 done
5953 LIBOBJS=$ac_libobjs
5954
5955 LTLIBOBJS=$ac_ltlibobjs
5956
5957
5958 if test -z "${AMDEP_TRUE}" && test -z "${AMDEP_FALSE}"; then
5959 { { echo "$as_me:$LINENO: error: conditional \"AMDEP\" was never defined.
5960 Usually this means the macro was only invoked conditionally." >&5
5961 echo "$as_me: error: conditional \"AMDEP\" was never defined.
5962 Usually this means the macro was only invoked conditionally." >&2;}
5963 { (exit 1); exit 1; }; }
5964 fi
5965 if test -z "${am__fastdepCC_TRUE}" && test -z "${am__fastdepCC_FALSE}"; then
5966 { { echo "$as_me:$LINENO: error: conditional \"am__fastdepCC\" was never defined.
5967 Usually this means the macro was only invoked conditionally." >&5
5968 echo "$as_me: error: conditional \"am__fastdepCC\" was never defined.
5969 Usually this means the macro was only invoked conditionally." >&2;}
5970 { (exit 1); exit 1; }; }
5971 fi
5972
5973 : ${CONFIG_STATUS=./config.status}
5974 ac_clean_files_save=$ac_clean_files
5975 ac_clean_files="$ac_clean_files $CONFIG_STATUS"
5976 { echo "$as_me:$LINENO: creating $CONFIG_STATUS" >&5
5977 echo "$as_me: creating $CONFIG_STATUS" >&6;}
5978 cat >$CONFIG_STATUS <<_ACEOF
5979 #! $SHELL
5980 # Generated by $as_me.
5981 # Run this file to recreate the current configuration.
5982 # Compiler output produced by configure, useful for debugging
5983 # configure, is in config.log if it exists.
5984
5985 debug=false
5986 ac_cs_recheck=false
5987 ac_cs_silent=false
5988 SHELL=\${CONFIG_SHELL-$SHELL}
5989 _ACEOF
5990
5991 cat >>$CONFIG_STATUS <<\_ACEOF
5992 ## --------------------- ##
5993 ## M4sh Initialization. ##
5994 ## --------------------- ##
5995
5996 # Be more Bourne compatible
5997 DUALCASE=1; export DUALCASE # for MKS sh
5998 if test -n "${ZSH_VERSION+set}" && (emulate sh) >/dev/null 2>&1; then
5999 emulate sh
6000 NULLCMD=:
6001 # Zsh 3.x and 4.x performs word splitting on ${1+"$@"}, which
6002 # is contrary to our usage. Disable this feature.
6003 alias -g '${1+"$@"}'='"$@"'
6004 setopt NO_GLOB_SUBST
6005 else
6006 case `(set -o) 2>/dev/null` in
6007 *posix*) set -o posix ;;
6008 esac
6009
6010 fi
6011
6012
6013
6014
6015 # PATH needs CR
6016 # Avoid depending upon Character Ranges.
6017 as_cr_letters='abcdefghijklmnopqrstuvwxyz'
6018 as_cr_LETTERS='ABCDEFGHIJKLMNOPQRSTUVWXYZ'
6019 as_cr_Letters=$as_cr_letters$as_cr_LETTERS
6020 as_cr_digits='0123456789'
6021 as_cr_alnum=$as_cr_Letters$as_cr_digits
6022
6023 # The user is always right.
6024 if test "${PATH_SEPARATOR+set}" != set; then
6025 echo "#! /bin/sh" >conf$$.sh
6026 echo "exit 0" >>conf$$.sh
6027 chmod +x conf$$.sh
6028 if (PATH="/nonexistent;."; conf$$.sh) >/dev/null 2>&1; then
6029 PATH_SEPARATOR=';'
6030 else
6031 PATH_SEPARATOR=:
6032 fi
6033 rm -f conf$$.sh
6034 fi
6035
6036 # Support unset when possible.
6037 if ( (MAIL=60; unset MAIL) || exit) >/dev/null 2>&1; then
6038 as_unset=unset
6039 else
6040 as_unset=false
6041 fi
6042
6043
6044 # IFS
6045 # We need space, tab and new line, in precisely that order. Quoting is
6046 # there to prevent editors from complaining about space-tab.
6047 # (If _AS_PATH_WALK were called with IFS unset, it would disable word
6048 # splitting by setting IFS to empty value.)
6049 as_nl='
6050 '
6051 IFS=" "" $as_nl"
6052
6053 # Find who we are. Look in the path if we contain no directory separator.
6054 case $0 in
6055 *[\\/]* ) as_myself=$0 ;;
6056 *) as_save_IFS=$IFS; IFS=$PATH_SEPARATOR
6057 for as_dir in $PATH
6058 do
6059 IFS=$as_save_IFS
6060 test -z "$as_dir" && as_dir=.
6061 test -r "$as_dir/$0" && as_myself=$as_dir/$0 && break
6062 done
6063 IFS=$as_save_IFS
6064
6065 ;;
6066 esac
6067 # We did not find ourselves, most probably we were run as `sh COMMAND'
6068 # in which case we are not to be found in the path.
6069 if test "x$as_myself" = x; then
6070 as_myself=$0
6071 fi
6072 if test ! -f "$as_myself"; then
6073 echo "$as_myself: error: cannot find myself; rerun with an absolute file name" >&2
6074 { (exit 1); exit 1; }
6075 fi
6076
6077 # Work around bugs in pre-3.0 UWIN ksh.
6078 for as_var in ENV MAIL MAILPATH
6079 do ($as_unset $as_var) >/dev/null 2>&1 && $as_unset $as_var
6080 done
6081 PS1='$ '
6082 PS2='> '
6083 PS4='+ '
6084
6085 # NLS nuisances.
6086 for as_var in \
6087 LANG LANGUAGE LC_ADDRESS LC_ALL LC_COLLATE LC_CTYPE LC_IDENTIFICATION \
6088 LC_MEASUREMENT LC_MESSAGES LC_MONETARY LC_NAME LC_NUMERIC LC_PAPER \
6089 LC_TELEPHONE LC_TIME
6090 do
6091 if (set +x; test -z "`(eval $as_var=C; export $as_var) 2>&1`"); then
6092 eval $as_var=C; export $as_var
6093 else
6094 ($as_unset $as_var) >/dev/null 2>&1 && $as_unset $as_var
6095 fi
6096 done
6097
6098 # Required to use basename.
6099 if expr a : '\(a\)' >/dev/null 2>&1 &&
6100 test "X`expr 00001 : '.*\(...\)'`" = X001; then
6101 as_expr=expr
6102 else
6103 as_expr=false
6104 fi
6105
6106 if (basename -- /) >/dev/null 2>&1 && test "X`basename -- / 2>&1`" = "X/"; then
6107 as_basename=basename
6108 else
6109 as_basename=false
6110 fi
6111
6112
6113 # Name of the executable.
6114 as_me=`$as_basename -- "$0" ||
6115 $as_expr X/"$0" : '.*/\([^/][^/]*\)/*$' \| \
6116 X"$0" : 'X\(//\)$' \| \
6117 X"$0" : 'X\(/\)' \| . 2>/dev/null ||
6118 echo X/"$0" |
6119 sed '/^.*\/\([^/][^/]*\)\/*$/{
6120 s//\1/
6121 q
6122 }
6123 /^X\/\(\/\/\)$/{
6124 s//\1/
6125 q
6126 }
6127 /^X\/\(\/\).*/{
6128 s//\1/
6129 q
6130 }
6131 s/.*/./; q'`
6132
6133 # CDPATH.
6134 $as_unset CDPATH
6135
6136
6137
6138 as_lineno_1=$LINENO
6139 as_lineno_2=$LINENO
6140 test "x$as_lineno_1" != "x$as_lineno_2" &&
6141 test "x`expr $as_lineno_1 + 1`" = "x$as_lineno_2" || {
6142
6143 # Create $as_me.lineno as a copy of $as_myself, but with $LINENO
6144 # uniformly replaced by the line number. The first 'sed' inserts a
6145 # line-number line after each line using $LINENO; the second 'sed'
6146 # does the real work. The second script uses 'N' to pair each
6147 # line-number line with the line containing $LINENO, and appends
6148 # trailing '-' during substitution so that $LINENO is not a special
6149 # case at line end.
6150 # (Raja R Harinath suggested sed '=', and Paul Eggert wrote the
6151 # scripts with optimization help from Paolo Bonzini. Blame Lee
6152 # E. McMahon (1931-1989) for sed's syntax. :-)
6153 sed -n '
6154 p
6155 /[$]LINENO/=
6156 ' <$as_myself |
6157 sed '
6158 s/[$]LINENO.*/&-/
6159 t lineno
6160 b
6161 :lineno
6162 N
6163 :loop
6164 s/[$]LINENO\([^'$as_cr_alnum'_].*\n\)\(.*\)/\2\1\2/
6165 t loop
6166 s/-\n.*//
6167 ' >$as_me.lineno &&
6168 chmod +x "$as_me.lineno" ||
6169 { echo "$as_me: error: cannot create $as_me.lineno; rerun with a POSIX shell" >&2
6170 { (exit 1); exit 1; }; }
6171
6172 # Don't try to exec as it changes $[0], causing all sort of problems
6173 # (the dirname of $[0] is not the place where we might find the
6174 # original and so on. Autoconf is especially sensitive to this).
6175 . "./$as_me.lineno"
6176 # Exit status is that of the last command.
6177 exit
6178 }
6179
6180
6181 if (as_dir=`dirname -- /` && test "X$as_dir" = X/) >/dev/null 2>&1; then
6182 as_dirname=dirname
6183 else
6184 as_dirname=false
6185 fi
6186
6187 ECHO_C= ECHO_N= ECHO_T=
6188 case `echo -n x` in
6189 -n*)
6190 case `echo 'x\c'` in
6191 *c*) ECHO_T=' ';; # ECHO_T is single tab character.
6192 *) ECHO_C='\c';;
6193 esac;;
6194 *)
6195 ECHO_N='-n';;
6196 esac
6197
6198 if expr a : '\(a\)' >/dev/null 2>&1 &&
6199 test "X`expr 00001 : '.*\(...\)'`" = X001; then
6200 as_expr=expr
6201 else
6202 as_expr=false
6203 fi
6204
6205 rm -f conf$$ conf$$.exe conf$$.file
6206 if test -d conf$$.dir; then
6207 rm -f conf$$.dir/conf$$.file
6208 else
6209 rm -f conf$$.dir
6210 mkdir conf$$.dir
6211 fi
6212 echo >conf$$.file
6213 if ln -s conf$$.file conf$$ 2>/dev/null; then
6214 as_ln_s='ln -s'
6215 # ... but there are two gotchas:
6216 # 1) On MSYS, both `ln -s file dir' and `ln file dir' fail.
6217 # 2) DJGPP < 2.04 has no symlinks; `ln -s' creates a wrapper executable.
6218 # In both cases, we have to default to `cp -p'.
6219 ln -s conf$$.file conf$$.dir 2>/dev/null && test ! -f conf$$.exe ||
6220 as_ln_s='cp -p'
6221 elif ln conf$$.file conf$$ 2>/dev/null; then
6222 as_ln_s=ln
6223 else
6224 as_ln_s='cp -p'
6225 fi
6226 rm -f conf$$ conf$$.exe conf$$.dir/conf$$.file conf$$.file
6227 rmdir conf$$.dir 2>/dev/null
6228
6229 if mkdir -p . 2>/dev/null; then
6230 as_mkdir_p=:
6231 else
6232 test -d ./-p && rmdir ./-p
6233 as_mkdir_p=false
6234 fi
6235
6236 if test -x / >/dev/null 2>&1; then
6237 as_test_x='test -x'
6238 else
6239 if ls -dL / >/dev/null 2>&1; then
6240 as_ls_L_option=L
6241 else
6242 as_ls_L_option=
6243 fi
6244 as_test_x='
6245 eval sh -c '\''
6246 if test -d "$1"; then
6247 test -d "$1/.";
6248 else
6249 case $1 in
6250 -*)set "./$1";;
6251 esac;
6252 case `ls -ld'$as_ls_L_option' "$1" 2>/dev/null` in
6253 ???[sx]*):;;*)false;;esac;fi
6254 '\'' sh
6255 '
6256 fi
6257 as_executable_p=$as_test_x
6258
6259 # Sed expression to map a string onto a valid CPP name.
6260 as_tr_cpp="eval sed 'y%*$as_cr_letters%P$as_cr_LETTERS%;s%[^_$as_cr_alnum]%_%g'"
6261
6262 # Sed expression to map a string onto a valid variable name.
6263 as_tr_sh="eval sed 'y%*+%pp%;s%[^_$as_cr_alnum]%_%g'"
6264
6265
6266 exec 6>&1
6267
6268 # Save the log message, to keep $[0] and so on meaningful, and to
6269 # report actual input values of CONFIG_FILES etc. instead of their
6270 # values after options handling.
6271 ac_log="
6272 This file was extended by cvsgraph $as_me 1.7.0, which was
6273 generated by GNU Autoconf 2.61. Invocation command line was
6274
6275 CONFIG_FILES = $CONFIG_FILES
6276 CONFIG_HEADERS = $CONFIG_HEADERS
6277 CONFIG_LINKS = $CONFIG_LINKS
6278 CONFIG_COMMANDS = $CONFIG_COMMANDS
6279 $ $0 $@
6280
6281 on `(hostname || uname -n) 2>/dev/null | sed 1q`
6282 "
6283
6284 _ACEOF
6285
6286 cat >>$CONFIG_STATUS <<_ACEOF
6287 # Files that config.status was made for.
6288 config_files="$ac_config_files"
6289 config_headers="$ac_config_headers"
6290 config_commands="$ac_config_commands"
6291
6292 _ACEOF
6293
6294 cat >>$CONFIG_STATUS <<\_ACEOF
6295 ac_cs_usage="\
6296 \`$as_me' instantiates files from templates according to the
6297 current configuration.
6298
6299 Usage: $0 [OPTIONS] [FILE]...
6300
6301 -h, --help print this help, then exit
6302 -V, --version print version number and configuration settings, then exit
6303 -q, --quiet do not print progress messages
6304 -d, --debug don't remove temporary files
6305 --recheck update $as_me by reconfiguring in the same conditions
6306 --file=FILE[:TEMPLATE]
6307 instantiate the configuration file FILE
6308 --header=FILE[:TEMPLATE]
6309 instantiate the configuration header FILE
6310
6311 Configuration files:
6312 $config_files
6313
6314 Configuration headers:
6315 $config_headers
6316
6317 Configuration commands:
6318 $config_commands
6319
6320 Report bugs to <[email protected]>."
6321
6322 _ACEOF
6323 cat >>$CONFIG_STATUS <<_ACEOF
6324 ac_cs_version="\\
6325 cvsgraph config.status 1.7.0
6326 configured by $0, generated by GNU Autoconf 2.61,
6327 with options \\"`echo "$ac_configure_args" | sed 's/^ //; s/[\\""\`\$]/\\\\&/g'`\\"
6328
6329 Copyright (C) 2006 Free Software Foundation, Inc.
6330 This config.status script is free software; the Free Software Foundation
6331 gives unlimited permission to copy, distribute and modify it."
6332
6333 ac_pwd='$ac_pwd'
6334 srcdir='$srcdir'
6335 INSTALL='$INSTALL'
6336 MKDIR_P='$MKDIR_P'
6337 _ACEOF
6338
6339 cat >>$CONFIG_STATUS <<\_ACEOF
6340 # If no file are specified by the user, then we need to provide default
6341 # value. By we need to know if files were specified by the user.
6342 ac_need_defaults=:
6343 while test $# != 0
6344 do
6345 case $1 in
6346 --*=*)
6347 ac_option=`expr "X$1" : 'X\([^=]*\)='`
6348 ac_optarg=`expr "X$1" : 'X[^=]*=\(.*\)'`
6349 ac_shift=:
6350 ;;
6351 *)
6352 ac_option=$1
6353 ac_optarg=$2
6354 ac_shift=shift
6355 ;;
6356 esac
6357
6358 case $ac_option in
6359 # Handling of the options.
6360 -recheck | --recheck | --rechec | --reche | --rech | --rec | --re | --r)
6361 ac_cs_recheck=: ;;
6362 --version | --versio | --versi | --vers | --ver | --ve | --v | -V )
6363 echo "$ac_cs_version"; exit ;;
6364 --debug | --debu | --deb | --de | --d | -d )
6365 debug=: ;;
6366 --file | --fil | --fi | --f )
6367 $ac_shift
6368 CONFIG_FILES="$CONFIG_FILES $ac_optarg"
6369 ac_need_defaults=false;;
6370 --header | --heade | --head | --hea )
6371 $ac_shift
6372 CONFIG_HEADERS="$CONFIG_HEADERS $ac_optarg"
6373 ac_need_defaults=false;;
6374 --he | --h)
6375 # Conflict between --help and --header
6376 { echo "$as_me: error: ambiguous option: $1
6377 Try \`$0 --help' for more information." >&2
6378 { (exit 1); exit 1; }; };;
6379 --help | --hel | -h )
6380 echo "$ac_cs_usage"; exit ;;
6381 -q | -quiet | --quiet | --quie | --qui | --qu | --q \
6382 | -silent | --silent | --silen | --sile | --sil | --si | --s)
6383 ac_cs_silent=: ;;
6384
6385 # This is an error.
6386 -*) { echo "$as_me: error: unrecognized option: $1
6387 Try \`$0 --help' for more information." >&2
6388 { (exit 1); exit 1; }; } ;;
6389
6390 *) ac_config_targets="$ac_config_targets $1"
6391 ac_need_defaults=false ;;
6392
6393 esac
6394 shift
6395 done
6396
6397 ac_configure_extra_args=
6398
6399 if $ac_cs_silent; then
6400 exec 6>/dev/null
6401 ac_configure_extra_args="$ac_configure_extra_args --silent"
6402 fi
6403
6404 _ACEOF
6405 cat >>$CONFIG_STATUS <<_ACEOF
6406 if \$ac_cs_recheck; then
6407 echo "running CONFIG_SHELL=$SHELL $SHELL $0 "$ac_configure_args \$ac_configure_extra_args " --no-create --no-recursion" >&6
6408 CONFIG_SHELL=$SHELL
6409 export CONFIG_SHELL
6410 exec $SHELL "$0"$ac_configure_args \$ac_configure_extra_args --no-create --no-recursion
6411 fi
6412
6413 _ACEOF
6414 cat >>$CONFIG_STATUS <<\_ACEOF
6415 exec 5>>config.log
6416 {
6417 echo
6418 sed 'h;s/./-/g;s/^.../## /;s/...$/ ##/;p;x;p;x' <<_ASBOX
6419 ## Running $as_me. ##
6420 _ASBOX
6421 echo "$ac_log"
6422 } >&5
6423
6424 _ACEOF
6425 cat >>$CONFIG_STATUS <<_ACEOF
6426 #
6427 # INIT-COMMANDS
6428 #
6429 AMDEP_TRUE="$AMDEP_TRUE" ac_aux_dir="$ac_aux_dir"
6430
6431 _ACEOF
6432
6433 cat >>$CONFIG_STATUS <<\_ACEOF
6434
6435 # Handling of arguments.
6436 for ac_config_target in $ac_config_targets
6437 do
6438 case $ac_config_target in
6439 "config.h") CONFIG_HEADERS="$CONFIG_HEADERS config.h" ;;
6440 "Makefile") CONFIG_FILES="$CONFIG_FILES Makefile" ;;
6441 "contrib/Makefile") CONFIG_FILES="$CONFIG_FILES contrib/Makefile" ;;
6442 "cvsgraph.1") CONFIG_FILES="$CONFIG_FILES cvsgraph.1" ;;
6443 "cvsgraph.conf.5") CONFIG_FILES="$CONFIG_FILES cvsgraph.conf.5" ;;
6444 "cvsgraph.spec") CONFIG_FILES="$CONFIG_FILES cvsgraph.spec" ;;
6445 "contrib/mkimage.php") CONFIG_FILES="$CONFIG_FILES contrib/mkimage.php" ;;
6446 "contrib/cvsgraphwrapper.php") CONFIG_FILES="$CONFIG_FILES contrib/cvsgraphwrapper.php" ;;
6447 "depfiles") CONFIG_COMMANDS="$CONFIG_COMMANDS depfiles" ;;
6448
6449 *) { { echo "$as_me:$LINENO: error: invalid argument: $ac_config_target" >&5
6450 echo "$as_me: error: invalid argument: $ac_config_target" >&2;}
6451 { (exit 1); exit 1; }; };;
6452 esac
6453 done
6454
6455
6456 # If the user did not use the arguments to specify the items to instantiate,
6457 # then the envvar interface is used. Set only those that are not.
6458 # We use the long form for the default assignment because of an extremely
6459 # bizarre bug on SunOS 4.1.3.
6460 if $ac_need_defaults; then
6461 test "${CONFIG_FILES+set}" = set || CONFIG_FILES=$config_files
6462 test "${CONFIG_HEADERS+set}" = set || CONFIG_HEADERS=$config_headers
6463 test "${CONFIG_COMMANDS+set}" = set || CONFIG_COMMANDS=$config_commands
6464 fi
6465
6466 # Have a temporary directory for convenience. Make it in the build tree
6467 # simply because there is no reason against having it here, and in addition,
6468 # creating and moving files from /tmp can sometimes cause problems.
6469 # Hook for its removal unless debugging.
6470 # Note that there is a small window in which the directory will not be cleaned:
6471 # after its creation but before its name has been assigned to `$tmp'.
6472 $debug ||
6473 {
6474 tmp=
6475 trap 'exit_status=$?
6476 { test -z "$tmp" || test ! -d "$tmp" || rm -fr "$tmp"; } && exit $exit_status
6477 ' 0
6478 trap '{ (exit 1); exit 1; }' 1 2 13 15
6479 }
6480 # Create a (secure) tmp directory for tmp files.
6481
6482 {
6483 tmp=`(umask 077 && mktemp -d "./confXXXXXX") 2>/dev/null` &&
6484 test -n "$tmp" && test -d "$tmp"
6485 } ||
6486 {
6487 tmp=./conf$$-$RANDOM
6488 (umask 077 && mkdir "$tmp")
6489 } ||
6490 {
6491 echo "$me: cannot create a temporary directory in ." >&2
6492 { (exit 1); exit 1; }
6493 }
6494
6495 #
6496 # Set up the sed scripts for CONFIG_FILES section.
6497 #
6498
6499 # No need to generate the scripts if there are no CONFIG_FILES.
6500 # This happens for instance when ./config.status config.h
6501 if test -n "$CONFIG_FILES"; then
6502
6503 _ACEOF
6504
6505
6506
6507 ac_delim='%!_!# '
6508 for ac_last_try in false false false false false :; do
6509 cat >conf$$subs.sed <<_ACEOF
6510 SHELL!$SHELL$ac_delim
6511 PATH_SEPARATOR!$PATH_SEPARATOR$ac_delim
6512 PACKAGE_NAME!$PACKAGE_NAME$ac_delim
6513 PACKAGE_TARNAME!$PACKAGE_TARNAME$ac_delim
6514 PACKAGE_VERSION!$PACKAGE_VERSION$ac_delim
6515 PACKAGE_STRING!$PACKAGE_STRING$ac_delim
6516 PACKAGE_BUGREPORT!$PACKAGE_BUGREPORT$ac_delim
6517 exec_prefix!$exec_prefix$ac_delim
6518 prefix!$prefix$ac_delim
6519 program_transform_name!$program_transform_name$ac_delim
6520 bindir!$bindir$ac_delim
6521 sbindir!$sbindir$ac_delim
6522 libexecdir!$libexecdir$ac_delim
6523 datarootdir!$datarootdir$ac_delim
6524 datadir!$datadir$ac_delim
6525 sysconfdir!$sysconfdir$ac_delim
6526 sharedstatedir!$sharedstatedir$ac_delim
6527 localstatedir!$localstatedir$ac_delim
6528 includedir!$includedir$ac_delim
6529 oldincludedir!$oldincludedir$ac_delim
6530 docdir!$docdir$ac_delim
6531 infodir!$infodir$ac_delim
6532 htmldir!$htmldir$ac_delim
6533 dvidir!$dvidir$ac_delim
6534 pdfdir!$pdfdir$ac_delim
6535 psdir!$psdir$ac_delim
6536 libdir!$libdir$ac_delim
6537 localedir!$localedir$ac_delim
6538 mandir!$mandir$ac_delim
6539 DEFS!$DEFS$ac_delim
6540 ECHO_C!$ECHO_C$ac_delim
6541 ECHO_N!$ECHO_N$ac_delim
6542 ECHO_T!$ECHO_T$ac_delim
6543 LIBS!$LIBS$ac_delim
6544 build_alias!$build_alias$ac_delim
6545 host_alias!$host_alias$ac_delim
6546 target_alias!$target_alias$ac_delim
6547 INSTALL_PROGRAM!$INSTALL_PROGRAM$ac_delim
6548 INSTALL_SCRIPT!$INSTALL_SCRIPT$ac_delim
6549 INSTALL_DATA!$INSTALL_DATA$ac_delim
6550 am__isrc!$am__isrc$ac_delim
6551 CYGPATH_W!$CYGPATH_W$ac_delim
6552 PACKAGE!$PACKAGE$ac_delim
6553 VERSION!$VERSION$ac_delim
6554 ACLOCAL!$ACLOCAL$ac_delim
6555 AUTOCONF!$AUTOCONF$ac_delim
6556 AUTOMAKE!$AUTOMAKE$ac_delim
6557 AUTOHEADER!$AUTOHEADER$ac_delim
6558 MAKEINFO!$MAKEINFO$ac_delim
6559 install_sh!$install_sh$ac_delim
6560 STRIP!$STRIP$ac_delim
6561 INSTALL_STRIP_PROGRAM!$INSTALL_STRIP_PROGRAM$ac_delim
6562 mkdir_p!$mkdir_p$ac_delim
6563 AWK!$AWK$ac_delim
6564 SET_MAKE!$SET_MAKE$ac_delim
6565 am__leading_dot!$am__leading_dot$ac_delim
6566 AMTAR!$AMTAR$ac_delim
6567 am__tar!$am__tar$ac_delim
6568 am__untar!$am__untar$ac_delim
6569 CC!$CC$ac_delim
6570 CFLAGS!$CFLAGS$ac_delim
6571 LDFLAGS!$LDFLAGS$ac_delim
6572 CPPFLAGS!$CPPFLAGS$ac_delim
6573 ac_ct_CC!$ac_ct_CC$ac_delim
6574 EXEEXT!$EXEEXT$ac_delim
6575 OBJEXT!$OBJEXT$ac_delim
6576 DEPDIR!$DEPDIR$ac_delim
6577 am__include!$am__include$ac_delim
6578 am__quote!$am__quote$ac_delim
6579 AMDEP_TRUE!$AMDEP_TRUE$ac_delim
6580 AMDEP_FALSE!$AMDEP_FALSE$ac_delim
6581 AMDEPBACKSLASH!$AMDEPBACKSLASH$ac_delim
6582 CCDEPMODE!$CCDEPMODE$ac_delim
6583 am__fastdepCC_TRUE!$am__fastdepCC_TRUE$ac_delim
6584 am__fastdepCC_FALSE!$am__fastdepCC_FALSE$ac_delim
6585 LEX!$LEX$ac_delim
6586 LEX_OUTPUT_ROOT!$LEX_OUTPUT_ROOT$ac_delim
6587 LEXLIB!$LEXLIB$ac_delim
6588 YACC!$YACC$ac_delim
6589 YFLAGS!$YFLAGS$ac_delim
6590 ac_prog_pkg_config!$ac_prog_pkg_config$ac_delim
6591 GDLIB_CONFIG!$GDLIB_CONFIG$ac_delim
6592 GD_CFLAGS!$GD_CFLAGS$ac_delim
6593 GD_LDFLAGS!$GD_LDFLAGS$ac_delim
6594 GD_LIBS!$GD_LIBS$ac_delim
6595 CPP!$CPP$ac_delim
6596 GREP!$GREP$ac_delim
6597 EGREP!$EGREP$ac_delim
6598 LIBOBJS!$LIBOBJS$ac_delim
6599 LTLIBOBJS!$LTLIBOBJS$ac_delim
6600 _ACEOF
6601
6602 if test `sed -n "s/.*$ac_delim\$/X/p" conf$$subs.sed | grep -c X` = 90; then
6603 break
6604 elif $ac_last_try; then
6605 { { echo "$as_me:$LINENO: error: could not make $CONFIG_STATUS" >&5
6606 echo "$as_me: error: could not make $CONFIG_STATUS" >&2;}
6607 { (exit 1); exit 1; }; }
6608 else
6609 ac_delim="$ac_delim!$ac_delim _$ac_delim!! "
6610 fi
6611 done
6612
6613 ac_eof=`sed -n '/^CEOF[0-9]*$/s/CEOF/0/p' conf$$subs.sed`
6614 if test -n "$ac_eof"; then
6615 ac_eof=`echo "$ac_eof" | sort -nru | sed 1q`
6616 ac_eof=`expr $ac_eof + 1`
6617 fi
6618
6619 cat >>$CONFIG_STATUS <<_ACEOF
6620 cat >"\$tmp/subs-1.sed" <<\CEOF$ac_eof
6621 /@[a-zA-Z_][a-zA-Z_0-9]*@/!b end
6622 _ACEOF
6623 sed '
6624 s/[,\\&]/\\&/g; s/@/@|#_!!_#|/g
6625 s/^/s,@/; s/!/@,|#_!!_#|/
6626 :n
6627 t n
6628 s/'"$ac_delim"'$/,g/; t
6629 s/$/\\/; p
6630 N; s/^.*\n//; s/[,\\&]/\\&/g; s/@/@|#_!!_#|/g; b n
6631 ' >>$CONFIG_STATUS <conf$$subs.sed
6632 rm -f conf$$subs.sed
6633 cat >>$CONFIG_STATUS <<_ACEOF
6634 :end
6635 s/|#_!!_#|//g
6636 CEOF$ac_eof
6637 _ACEOF
6638
6639
6640 # VPATH may cause trouble with some makes, so we remove $(srcdir),
6641 # ${srcdir} and @srcdir@ from VPATH if srcdir is ".", strip leading and
6642 # trailing colons and then remove the whole line if VPATH becomes empty
6643 # (actually we leave an empty line to preserve line numbers).
6644 if test "x$srcdir" = x.; then
6645 ac_vpsub='/^[ ]*VPATH[ ]*=/{
6646 s/:*\$(srcdir):*/:/
6647 s/:*\${srcdir}:*/:/
6648 s/:*@srcdir@:*/:/
6649 s/^\([^=]*=[ ]*\):*/\1/
6650 s/:*$//
6651 s/^[^=]*=[ ]*$//
6652 }'
6653 fi
6654
6655 cat >>$CONFIG_STATUS <<\_ACEOF
6656 fi # test -n "$CONFIG_FILES"
6657
6658
6659 for ac_tag in :F $CONFIG_FILES :H $CONFIG_HEADERS :C $CONFIG_COMMANDS
6660 do
6661 case $ac_tag in
6662 :[FHLC]) ac_mode=$ac_tag; continue;;
6663 esac
6664 case $ac_mode$ac_tag in
6665 :[FHL]*:*);;
6666 :L* | :C*:*) { { echo "$as_me:$LINENO: error: Invalid tag $ac_tag." >&5
6667 echo "$as_me: error: Invalid tag $ac_tag." >&2;}
6668 { (exit 1); exit 1; }; };;
6669 :[FH]-) ac_tag=-:-;;
6670 :[FH]*) ac_tag=$ac_tag:$ac_tag.in;;
6671 esac
6672 ac_save_IFS=$IFS
6673 IFS=:
6674 set x $ac_tag
6675 IFS=$ac_save_IFS
6676 shift
6677 ac_file=$1
6678 shift
6679
6680 case $ac_mode in
6681 :L) ac_source=$1;;
6682 :[FH])
6683 ac_file_inputs=
6684 for ac_f
6685 do
6686 case $ac_f in
6687 -) ac_f="$tmp/stdin";;
6688 *) # Look for the file first in the build tree, then in the source tree
6689 # (if the path is not absolute). The absolute path cannot be DOS-style,
6690 # because $ac_f cannot contain `:'.
6691 test -f "$ac_f" ||
6692 case $ac_f in
6693 [\\/$]*) false;;
6694 *) test -f "$srcdir/$ac_f" && ac_f="$srcdir/$ac_f";;
6695 esac ||
6696 { { echo "$as_me:$LINENO: error: cannot find input file: $ac_f" >&5
6697 echo "$as_me: error: cannot find input file: $ac_f" >&2;}
6698 { (exit 1); exit 1; }; };;
6699 esac
6700 ac_file_inputs="$ac_file_inputs $ac_f"
6701 done
6702
6703 # Let's still pretend it is `configure' which instantiates (i.e., don't
6704 # use $as_me), people would be surprised to read:
6705 # /* config.h. Generated by config.status. */
6706 configure_input="Generated from "`IFS=:
6707 echo $* | sed 's|^[^:]*/||;s|:[^:]*/|, |g'`" by configure."
6708 if test x"$ac_file" != x-; then
6709 configure_input="$ac_file. $configure_input"
6710 { echo "$as_me:$LINENO: creating $ac_file" >&5
6711 echo "$as_me: creating $ac_file" >&6;}
6712 fi
6713
6714 case $ac_tag in
6715 *:-:* | *:-) cat >"$tmp/stdin";;
6716 esac
6717 ;;
6718 esac
6719
6720 ac_dir=`$as_dirname -- "$ac_file" ||
6721 $as_expr X"$ac_file" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
6722 X"$ac_file" : 'X\(//\)[^/]' \| \
6723 X"$ac_file" : 'X\(//\)$' \| \
6724 X"$ac_file" : 'X\(/\)' \| . 2>/dev/null ||
6725 echo X"$ac_file" |
6726 sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
6727 s//\1/
6728 q
6729 }
6730 /^X\(\/\/\)[^/].*/{
6731 s//\1/
6732 q
6733 }
6734 /^X\(\/\/\)$/{
6735 s//\1/
6736 q
6737 }
6738 /^X\(\/\).*/{
6739 s//\1/
6740 q
6741 }
6742 s/.*/./; q'`
6743 { as_dir="$ac_dir"
6744 case $as_dir in #(
6745 -*) as_dir=./$as_dir;;
6746 esac
6747 test -d "$as_dir" || { $as_mkdir_p && mkdir -p "$as_dir"; } || {
6748 as_dirs=
6749 while :; do
6750 case $as_dir in #(
6751 *\'*) as_qdir=`echo "$as_dir" | sed "s/'/'\\\\\\\\''/g"`;; #(
6752 *) as_qdir=$as_dir;;
6753 esac
6754 as_dirs="'$as_qdir' $as_dirs"
6755 as_dir=`$as_dirname -- "$as_dir" ||
6756 $as_expr X"$as_dir" : 'X\(.*[^/]\)//*[^/][^/]*/*$' \| \
6757 X"$as_dir" : 'X\(//\)[^/]' \| \
6758 X"$as_dir" : 'X\(//\)$' \| \
6759 X"$as_dir" : 'X\(/\)' \| . 2>/dev/null ||
6760 echo X"$as_dir" |
6761 sed '/^X\(.*[^/]\)\/\/*[^/][^/]*\/*$/{
6762 s//\1/
6763 q
6764 }
6765 /^X\(\/\/\)[^/].*/{
6766 s//\1/
6767 q
6768 }
6769 /^X\(\/\/\)$/{
6770 s//\1/
6771 q
6772 }
6773 /^X\(\/\).*/{
6774 s//\1/
6775 q
6776 }
6777 s/.*/./; q'`
6778 test -d "$as_dir" && break
6779 done
6780 test -z "$as_dirs" || eval "mkdir $as_dirs"
6781 } || test -d "$as_dir" || { { echo "$as_me:$LINENO: error: cannot create directory $as_dir" >&5
6782 echo "$as_me: error: cannot create directory $as_dir" >&2;}
6783 { (exit 1); exit 1; }; }; }
6784 ac_builddir=.
6785
6786 case "$ac_dir" in
6787 .) ac_dir_suffix= ac_top_builddir_sub=. ac_top_build_prefix= ;;
6788 *)
6789 ac_dir_suffix=/`echo "$ac_dir" | sed 's,^\.[\\/],,'`
6790 # A ".." for each directory in $ac_dir_suffix.
6791 ac_top_builddir_sub=`echo "$ac_dir_suffix" | sed 's,/[^\\/]*,/..,g;s,/,,'`
6792 case $ac_top_builddir_sub in
6793 "") ac_top_builddir_sub=. ac_top_build_prefix= ;;
6794 *) ac_top_build_prefix=$ac_top_builddir_sub/ ;;
6795 esac ;;
6796 esac
6797 ac_abs_top_builddir=$ac_pwd
6798 ac_abs_builddir=$ac_pwd$ac_dir_suffix
6799 # for backward compatibility:
6800 ac_top_builddir=$ac_top_build_prefix
6801
6802 case $srcdir in
6803 .) # We are building in place.
6804 ac_srcdir=.
6805 ac_top_srcdir=$ac_top_builddir_sub
6806 ac_abs_top_srcdir=$ac_pwd ;;
6807 [\\/]* | ?:[\\/]* ) # Absolute name.
6808 ac_srcdir=$srcdir$ac_dir_suffix;
6809 ac_top_srcdir=$srcdir
6810 ac_abs_top_srcdir=$srcdir ;;
6811 *) # Relative name.
6812 ac_srcdir=$ac_top_build_prefix$srcdir$ac_dir_suffix
6813 ac_top_srcdir=$ac_top_build_prefix$srcdir
6814 ac_abs_top_srcdir=$ac_pwd/$srcdir ;;
6815 esac
6816 ac_abs_srcdir=$ac_abs_top_srcdir$ac_dir_suffix
6817
6818
6819 case $ac_mode in
6820 :F)
6821 #
6822 # CONFIG_FILE
6823 #
6824
6825 case $INSTALL in
6826 [\\/$]* | ?:[\\/]* ) ac_INSTALL=$INSTALL ;;
6827 *) ac_INSTALL=$ac_top_build_prefix$INSTALL ;;
6828 esac
6829 ac_MKDIR_P=$MKDIR_P
6830 case $MKDIR_P in
6831 [\\/$]* | ?:[\\/]* ) ;;
6832 */*) ac_MKDIR_P=$ac_top_build_prefix$MKDIR_P ;;
6833 esac
6834 _ACEOF
6835
|
{
"url": "http://www.akhphd.au.dk/~bertho/cvsgraph/viewvc.cgi/CvsGraph/cvsgraph/configure?view=markup&pathrev=merge_head_20080521",
"source_domain": "www.akhphd.au.dk",
"snapshot_id": "crawl=CC-MAIN-2018-13",
"warc_metadata": {
"Content-Length": "1048810",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OTWWZCD3YHFQD7TEKKPRT4GMNS6FIUVN",
"WARC-Concurrent-To": "<urn:uuid:eca87a29-99a2-4c59-901c-692013912b17>",
"WARC-Date": "2018-03-20T13:42:57Z",
"WARC-IP-Address": "192.38.44.47",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:IDDCYYYE4GZP2QY6UWQWKGUZS7CQZ4OJ",
"WARC-Record-ID": "<urn:uuid:3cd2dbc4-b6e0-4ac3-a9c2-d85a7f3b04c5>",
"WARC-Target-URI": "http://www.akhphd.au.dk/~bertho/cvsgraph/viewvc.cgi/CvsGraph/cvsgraph/configure?view=markup&pathrev=merge_head_20080521",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:18f49811-5fe6-4081-9208-dc062ccd04e9>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-142-190-243.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-13\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for March 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
31,
47,
48,
80,
81,
180,
181,
182,
221,
285,
307,
368,
410,
436,
456,
493,
506,
576,
631,
635,
679,
683,
755,
819,
892,
959,
990,
1020,
1051,
1054,
1085,
1129,
1202,
1216,
1229,
1294,
1347,
1378,
1402,
1410,
1444,
1472,
1480,
1483,
1489,
1492,
1495,
1498,
1501,
1520,
1564,
1610,
1656,
1702,
1731,
1774,
1777,
1808,
1856,
1888,
1917,
1939,
2002,
2024,
2032,
2052,
2058,
2077,
2083,
2086,
2120,
2181,
2199,
2207,
2225,
2231,
2234,
2237,
2246,
2320,
2384,
2457,
2504,
2515,
2520,
2540,
2543,
2620,
2634,
2663,
2707,
2730,
2736,
2756,
2789,
2846,
2854,
2874,
2877,
2883,
2891,
2965,
3020,
3055,
3071,
3077,
3112,
3198,
3223,
3229,
3232,
3275,
3310,
3373,
3381,
3394,
3407,
3420,
3424,
3445,
3465,
3541,
3614,
3639,
3646,
3719,
3754,
3763,
3824,
3831,
3840,
3844,
3876,
3919,
3971,
3988,
3997,
4015,
4022,
4026,
4110,
4135,
4144,
4166,
4173,
4177,
4181,
4211,
4246,
4295,
4323,
4364,
4382,
4417,
4428,
4434,
4440,
4461,
4472,
4478,
4484,
4504,
4515,
4521,
4527,
4544,
4548,
4562,
4583,
4587,
4591,
4630,
4666,
4691,
4700,
4724,
4731,
4735,
4783,
4808,
4823,
4829,
4854,
4875,
4881,
4906,
4927,
4933,
4962,
4975,
4981,
5010,
5023,
5029,
5033,
5048,
5077,
5083,
5092,
5107,
5140,
5147,
5151,
5180,
5195,
5231,
5238,
5242,
5275,
5281,
5290,
5305,
5342,
5349,
5353,
5386,
5401,
5441,
5448,
5452,
5518,
5524,
5533,
5548,
5595,
5602,
5606,
5656,
5660,
5666,
5691,
5716,
5769,
5857,
5883,
5889,
5898,
5923,
5965,
6031,
6038,
6059,
6093,
6113,
6121,
6160,
6224,
6235,
6244,
6253,
6274,
6278,
6282,
6334,
6391,
6453,
6496,
6570,
6585,
6599,
6665,
6719,
6751,
6776,
6785,
6820,
6849,
6858,
6862,
6869,
6873,
6877,
6883,
6894,
6906,
6933,
6958,
7002,
7076,
7091,
7105,
7171,
7225,
7257,
7282,
7291,
7326,
7355,
7364,
7368,
7375,
7379,
7383,
7389,
7414,
7428,
7434,
7459,
7480,
7486,
7511,
7532,
7538,
7567,
7580,
7586,
7615,
7628,
7634,
7638,
7653,
7682,
7688,
7697,
7712,
7745,
7752,
7756,
7785,
7800,
7836,
7843,
7847,
7880,
7886,
7895,
7910,
7947,
7954,
7958,
7991,
8006,
8046,
8053,
8057,
8120,
8126,
8135,
8150,
8197,
8204,
8208,
8257,
8261,
8267,
8291,
8315,
8362,
8442,
8446,
8457,
8469,
8479,
8486,
8490,
8497,
8501,
8510,
8514,
8554,
8585,
8649,
8658,
8682,
8730,
8737,
8741,
8745,
8786,
8849,
8911,
8974,
9009,
9035,
9042,
9046,
9050,
9057,
9061,
9068,
9072,
9076,
9080,
9111,
9126,
9132,
9157,
9178,
9184,
9209,
9230,
9236,
9265,
9278,
9284,
9313,
9326,
9332,
9336,
9351,
9380,
9386,
9395,
9410,
9443,
9450,
9454,
9483,
9498,
9534,
9541,
9545,
9578,
9584,
9593,
9608,
9645,
9652,
9656,
9689,
9704,
9744,
9751,
9755,
9821,
9827,
9836,
9851,
9898,
9905,
9909,
9940,
9995,
10052,
10109,
10126,
10132,
10136,
10140,
10144,
10168,
10192,
10239,
10298,
10302,
10371,
10442,
10513,
10579,
10648,
10720,
10744,
10812,
10879,
10930,
10943,
10949,
10966,
10986,
10996,
11018,
11031,
11037,
11049,
11055,
11065,
11121,
11132,
11146,
11170,
11202,
11288,
11317,
11321,
11394,
11462,
11531,
11555,
11602,
11611,
11617,
11621,
11625,
11702,
11725,
11734,
11755,
11762,
11766,
11794,
11818,
11827,
11852,
11908,
11929,
11940,
11947,
11965,
11974,
11978,
12021,
12073,
12090,
12099,
12117,
12124,
12128,
12168,
12200,
12233,
12242,
12263,
12284,
12291,
12313,
12363,
12383,
12420,
12484,
12561,
12613,
12685,
12705,
12754,
12769,
12778,
12798,
12805,
12868,
12901,
12905,
12941,
12958,
12967,
12998,
13019,
13026,
13030,
13069,
13093,
13102,
13140,
13161,
13170,
13190,
13197,
13213,
13233,
13259,
13279,
13288,
13303,
13323,
13333,
13388,
13421,
13433,
13439,
13446,
13477,
13481,
13541,
13626,
13630,
13695,
13753,
13757,
13761,
13765,
13795,
13799,
13823,
13899,
13928,
13990,
13994,
14000,
14023,
14029,
14062,
14082,
14109,
14122,
14145,
14158,
14170,
14185,
14219,
14223,
14255,
14283,
14314,
14342,
14378,
14424,
14428,
14456,
14504,
14531,
14554,
14582,
14610,
14621,
14648,
14675,
14686,
14710,
14735,
14760,
14770,
14796,
14821,
14833,
14844,
14869,
14925,
14950,
14962,
14987,
14998,
15024,
15050,
15061,
15088,
15115,
15126,
15151,
15176,
15187,
15212,
15237,
15249,
15253,
15278,
15297,
15314,
15334,
15354,
15373,
15395,
15411,
15422,
15449,
15460,
15472,
15487,
15503,
15515,
15530,
15549,
15567,
15582,
15600,
15611,
15623,
15635,
15646,
15657,
15667,
15678,
15692,
15703,
15712,
15723,
15734,
15745,
15754,
15770,
15785,
15802,
15822,
15841,
15858,
15871,
15885,
15897,
15909,
15921,
15934,
15947,
15962,
15975,
15990,
16000,
16026,
16038,
16046,
16059,
16079,
16089,
16101,
16115,
16122,
16133,
16145,
16158,
16171,
16182,
16193,
16204,
16220,
16234,
16249,
16265,
16284,
16298,
16321,
16345,
16353,
16373,
16384,
16393,
16404,
16427,
16444,
16458,
16473,
16485,
16493,
16502,
16512,
16524,
16539,
16561,
16595,
16610,
16627,
16634,
16645,
16657,
16666,
16679,
16688,
16699,
16708,
16712,
16716,
16764,
16782,
16808,
16869,
16905,
16930,
16951,
16966,
16984,
17000,
17024,
17048,
17082,
17094,
17104,
17116,
17129,
17149,
17170,
17174,
17212,
17289,
17362,
17401,
17477,
17546,
17578,
17612,
17652,
17686,
17715,
17746,
17781,
17815,
17850,
17883,
17934,
17968,
17992,
18015,
18038,
18060,
18092,
18130,
18162,
18166,
18179,
18196,
18214,
18221,
18280,
18312,
18342,
18355,
18368,
18375,
18379,
18402,
18462,
18486,
18495,
18499,
18578,
18582,
18617,
18625,
18648,
18652,
18710,
18732,
18802,
18827,
18831,
18877,
18904,
18960,
18990,
18994,
19054,
19122,
19148,
19216,
19298,
19327,
19331,
19356,
19387,
19391,
19438,
19461,
19516,
19542,
19546,
19623,
19661,
19688,
19760,
19819,
19849,
19853,
19883,
19941,
20001,
20064,
20130,
20159,
20212,
20246,
20250,
20299,
20321,
20380,
20405,
20409,
20467,
20489,
20559,
20584,
20588,
20616,
20676,
20736,
20799,
20865,
20894,
20947,
20990,
20994,
21060,
21126,
21155,
21182,
21256,
21332,
21367,
21397,
21401,
21432,
21464,
21484,
21488,
21528,
21553,
21607,
21637,
21691,
21717,
21721,
21756,
21782,
21825,
21854,
21858,
21929,
21952,
22029,
22043,
22069,
22073,
22145,
22188,
22214,
22296,
22347,
22376,
22380,
22444,
22467,
22543,
22569,
22573,
22616,
22638,
22689,
22714,
22718,
22790,
22825,
22851,
22933,
22974,
23003,
23007,
23073,
23098,
23174,
23202,
23206,
23278,
23348,
23377,
23457,
23537,
23569,
23573,
23637,
23659,
23737,
23762,
23766,
23791,
23825,
23843,
23847,
23914,
23943,
23964,
23968,
24036,
24110,
24134,
24138,
24210,
24281,
24326,
24355,
24435,
24516,
24571,
24603,
24607,
24671,
24693,
24771,
24796,
24800,
24876,
24926,
24956,
25021,
25096,
25129,
25133,
25209,
25259,
25289,
25354,
25429,
25462,
25466,
25523,
25580,
25633,
25682,
25727,
25768,
25816,
25854,
25915,
25976,
26033,
26086,
26135,
26180,
26234,
26275,
26279,
26337,
26359,
26429,
26454,
26458,
26504,
26525,
26581,
26605,
26609,
26667,
26720,
26738,
26742,
26813,
26836,
26903,
26927,
26953,
26957,
27016,
27085,
27147,
27168,
27199,
27265,
27342,
27414,
27439,
27473,
27478,
27507,
27528,
27563,
27587,
27592,
27651,
27674,
27745,
27771,
27776,
27849,
27900,
27927,
28010,
28071,
28101,
28106,
28171,
28200,
28279,
28311,
28316,
28378,
28398,
28403,
28465,
28491,
28496,
28521,
28580,
28641,
28705,
28772,
28802,
28856,
28898,
28903,
28934,
28993,
29054,
29118,
29185,
29215,
29269,
29302,
29307,
29317,
29348,
29367,
29372,
29445,
29489,
29516,
29599,
29651,
29681,
29686,
29751,
29820,
29848,
29921,
30002,
30033,
30038,
30102,
30151,
30181,
30189,
30194,
30204,
30256,
30317,
30378,
30445,
30475,
30508,
30534,
30539,
30547,
30596,
30670,
30733,
30796,
30881,
30889,
30894,
30904,
30914,
30919,
30952,
31001,
31065,
31095,
31103,
31108,
31157,
31235,
31301,
31365,
31394,
31402,
31429,
31450,
31487,
31548,
31558,
31650,
31680,
31690,
31695,
31771,
31819,
31853,
31877,
31899,
31925,
31930,
31964,
32003,
32042,
32069,
32154,
32234,
32289,
32314,
32322,
32330,
32335,
32356,
32414,
32419,
32465,
32470,
32475,
32517,
32545,
32593,
32665,
32695,
32740,
32819,
32849,
32854,
32859,
32920,
32952,
32981,
33057,
33097,
33153,
33185,
33214,
33256,
33274,
33318,
33330,
33337,
33344,
33369,
33381,
33388,
33395,
33415,
33427,
33434,
33441,
33460,
33472,
33479,
33486,
33504,
33528,
33578,
33593,
33601,
33611,
33639,
33647,
33697,
33766,
33848,
33878,
33886,
33956,
33979,
34067,
34097,
34108,
34152,
34201,
34215,
34223,
34279,
34345,
34378,
34399,
34477,
34487,
34528,
34577,
34622,
34674,
34722,
34732,
34737,
34744,
34778,
34785,
34829,
34907,
34974,
34992,
35071,
35076,
35118,
35123,
35199,
35275,
35280,
35337,
35342,
35362,
35405,
35464,
35538,
35594,
35658,
35719,
35782,
35830,
35897,
35902,
35933,
36003,
36029,
36104,
36118,
36123,
36186,
36265,
36345,
36383,
36388,
36436,
36441,
36491,
36540,
36599,
36659,
36724,
36804,
36873,
36927,
36981,
37048,
37124,
37197,
37254,
37318,
37372,
37436,
37483,
37528,
37573,
37616,
37628,
37633,
37652,
37657,
37677,
37748,
37818,
37899,
37911,
37919,
37924,
37962,
37989,
38056,
38066,
38085,
38090,
38114,
38190,
38244,
38304,
38379,
38384,
38408,
38456,
38526,
38575,
38580,
38625,
38652,
38681,
38752,
38789,
38849,
38925,
38988,
39062,
39128,
39203,
39271,
39331,
39355,
39360,
39440,
39513,
39518,
39563,
39575,
39593,
39601,
39606,
39655,
39714,
39788,
39823,
39842,
39847,
39870,
39939,
39947,
40005,
40057,
40137,
40171,
40226,
40279,
40292,
40302,
40335,
40378,
40413,
40455,
40460,
40481,
40517,
40534,
40574,
40608,
40650,
40688,
40715,
40749,
40774,
40831,
40878,
40920,
40930,
40982,
40987,
41036,
41072,
41121,
41134,
41190,
41237,
41250,
41302,
41312,
41388,
41412,
41458,
41468,
41476,
41481,
41529,
41560,
41579,
41609,
41645,
41650,
41723,
41788,
41862,
41929,
41941,
41951,
41959,
41989,
42054,
42125,
42130,
42186,
42251,
42256,
42269,
42274,
42286,
42310,
42317,
42337,
42358,
42379,
42400,
42405,
42467,
42524,
42581,
42638,
42695,
42700,
42775,
42842,
42847,
42906,
42979,
43064,
43139,
43204,
43277,
43344,
43349,
43363,
43368,
43411,
43436,
43444,
43466,
43501,
43527,
43537,
43559,
43564,
43575,
43580,
43602,
43607,
43612,
43635,
43658,
43681,
43686,
43698,
43703,
43708,
43749,
43821,
43899,
43960,
44035,
44059,
44084,
44109,
44138,
44162,
44170,
44186,
44194,
44215,
44285,
44344,
44398,
44415,
44426,
44484,
44494,
44516,
44578,
44586,
44642,
44687,
44745,
44755,
44776,
44836,
44897,
44958,
45018,
45054,
45110,
45120,
45128,
45164,
45174,
45182,
45236,
45244,
45254,
45264,
45274,
45406,
45538,
45543,
45616,
45689,
45731,
45800,
45885,
45911,
45986,
45993,
46003,
46008,
46027,
46055,
46083,
46111,
46123,
46133,
46210,
46217,
46308,
46335,
46359,
46376,
46400,
46494,
46575,
46585,
46609,
46637,
46666,
46679,
46689,
46699,
46717,
46772,
46800,
46814,
46847,
46926,
46937,
46945,
47001,
47009,
47021,
47031,
47038,
47048,
47053,
47072,
47101,
47130,
47159,
47171,
47181,
47215,
47223,
47250,
47271,
47349,
47359,
47395,
47412,
47422,
47427,
47467,
47486,
47517,
47548,
47579,
47591,
47601,
47636,
47644,
47671,
47692,
47770,
47780,
47816,
47833,
47843,
47851,
47856,
47889,
47908,
47931,
47954,
47977,
47989,
47999,
48019,
48029,
48037,
48068,
48113,
48151,
48162,
48204,
48265,
48288,
48297,
48333,
48402,
48412,
48429,
48434,
48511,
48546,
48551,
48593,
48598,
48629,
48671,
48683,
48688,
48693,
48724,
48772,
48784,
48789,
48794,
48825,
48873,
48885,
48890,
48895,
48926,
48972,
48984,
48989,
48994,
49025,
49077,
49089,
49094,
49099,
49171,
49242,
49279,
49305,
49346,
49411,
49421,
49473,
49515,
49523,
49534,
49556,
49564,
49602,
49670,
49730,
49769,
49792,
49800,
49810,
49815,
49851,
49919,
49967,
50003,
50063,
50115,
50140,
50183,
50211,
50221,
50229,
50239,
50300,
50353,
50371,
50379,
50384,
50463,
50477,
50507,
50548,
50595,
50639,
50688,
50734,
50771,
50782,
50880,
50970,
50999,
51010,
51094,
51170,
51199,
51209,
51217,
51269,
51357,
51437,
51497,
51549,
51610,
51663,
51689,
51699,
51709,
51758,
51797,
51822,
51898,
51936,
51946,
51982,
52053,
52113,
52123,
52131,
52141,
52175,
52268,
52353,
52458,
52553,
52583,
52591,
52596,
52601,
52606,
52611,
52616,
52621,
52626,
52631,
52636,
52641,
52646,
52651,
52656,
52661,
52666,
52671,
52676,
52681,
52686,
52691,
52696,
52701,
52706,
52711,
52716,
52730,
52759,
52823,
52918,
52961,
52966,
52971,
52999,
53004,
53021,
53083,
53126,
53150,
53197,
53208,
53253,
53277,
53324,
53335,
53376,
53400,
53451,
53462,
53470,
53480,
53516,
53644,
53762,
53792,
53800,
53805,
53868,
53938,
54022,
54074,
54158,
54238,
54316,
54321,
54326,
54394,
54462,
54492,
54536,
54566,
54592,
54616,
54685,
54756,
54825,
54904,
54976,
55054,
55126,
55202,
55235,
55288,
55329,
55339,
55382,
55407,
55415,
55437,
55472,
55541,
55563,
55589,
55661,
55718,
55739,
55747,
55809,
55878,
55897,
55946,
56003,
56106,
56141,
56211,
56274,
56281,
56318,
56388,
56457,
56464,
56474,
56532,
56545,
56553,
56561,
56571,
56581,
56589,
56599,
56609,
56631,
56636,
56641,
56649,
56702,
56735,
56745,
56811,
56881,
56946,
56998,
57026,
57034,
57042,
57093,
57130,
57135,
57205,
57276,
57340,
57345,
57407,
57412,
57477,
57482,
57559,
57640,
57660,
57673,
57709,
57779,
57847,
57923,
57991,
58010,
58020,
58085,
58115,
58138,
58189,
58197,
58222,
58281,
58344,
58349,
58418,
58482,
58545,
58608,
58701,
58737,
58818,
58856,
58886,
58894,
58899,
58930,
58937,
58947,
58958,
58965,
58975,
59065,
59099,
59177,
59213,
59243,
59251,
59297,
59329,
59368,
59443,
59485,
59524,
59600,
59660,
59713,
59746,
59777,
59789,
59870,
59894,
59899,
59945,
59985,
59990,
60068,
60101,
60142,
60180,
60190,
60211,
60294,
60369,
60377,
60382,
60452,
60526,
60559,
60610,
60651,
60661,
60704,
60756,
60764,
60786,
60821,
60858,
60915,
61021,
61085,
61120,
61151,
61182,
61233,
61248,
61258,
61268,
61278,
61288,
61310,
61315,
61323,
61328,
61379,
61415,
61425,
61491,
61561,
61626,
61678,
61724,
61757,
61765,
61773,
61824,
61861,
61866,
61890,
61912,
61940,
61989,
61999,
62004,
62043,
62051,
62135,
62171,
62227,
62287,
62336,
62377,
62387,
62416,
62477,
62487,
62530,
62555,
62563,
62585,
62620,
62677,
62780,
62811,
62878,
62891,
62899,
62909,
62919,
62941,
62946,
62954,
62962,
62987,
63016,
63063,
63096,
63106,
63151,
63182,
63190,
63195,
63200,
63229,
63239,
63244,
63322,
63404,
63486,
63582,
63623,
63633,
63667,
63688,
63698,
63733,
63745,
63826,
63883,
63908,
63955,
63963,
64009,
64019,
64044,
64052,
64115,
64161,
64193,
64208,
64218,
64263,
64294,
64328,
64336,
64341,
64370,
64398,
64425,
64448,
64458,
64481,
64489,
64517,
64522,
64574,
64645,
64688,
64717,
64765,
64809,
64924,
65029,
65059,
65067,
65075,
65080,
65116,
65151,
65208,
65236,
65246,
65266,
65274,
65282,
65287,
65292,
65335,
65359,
65380,
65385,
65390,
65421,
65453,
65465,
65470,
65475,
65506,
65538,
65550,
65555,
65589,
65594,
65664,
65669,
65674,
65728,
65733,
65738,
65811,
65816,
65821,
65881,
65886,
65891,
65945,
65950,
66015,
66020,
66095,
66167,
66240,
66317,
66361,
66401,
66499,
66549,
66605,
66665,
66716,
66757,
66767,
66798,
66863,
66873,
66916,
66941,
66949,
66971,
67006,
67063,
67166,
67213,
67280,
67293,
67301,
67311,
67321,
67343,
67348,
67356,
67364,
67393,
67424,
67473,
67508,
67518,
67563,
67594,
67602,
67607,
67612,
67620,
67662,
67686,
67767,
67800,
67856,
67916,
67973,
68014,
68024,
68061,
68138,
68148,
68191,
68216,
68224,
68246,
68281,
68338,
68441,
68477,
68544,
68557,
68565,
68575,
68585,
68607,
68612,
68620,
68628,
68669,
68706,
68761,
68802,
68812,
68857,
68888,
68896,
68901,
68940,
68955,
68965,
69011,
69022,
69112,
69184,
69260,
69340,
69412,
69490,
69517,
69527,
69551,
69559,
69569,
69600,
69608,
69613,
69621,
69671,
69676,
69746,
69769,
69824,
69829,
69872,
69877,
69946,
69951,
69956,
69961,
69966,
69971,
69976,
70029,
70034,
70189,
70194,
70199,
70216,
70221,
70226,
70231,
70259,
70273,
70302,
70366,
70461,
70504,
70544,
70640,
70688,
70744,
70804,
70852,
70893,
70903,
70931,
70990,
71000,
71043,
71068,
71076,
71098,
71133,
71190,
71293,
71335,
71402,
71415,
71423,
71433,
71443,
71465,
71470,
71478,
71486,
71509,
71537,
71583,
71615,
71625,
71670,
71701,
71709,
71714,
71719,
71727,
71766,
71784,
71863,
71894,
71950,
72010,
72064,
72105,
72115,
72149,
72220,
72230,
72273,
72298,
72306,
72328,
72363,
72420,
72523,
72554,
72621,
72634,
72642,
72652,
72662,
72684,
72689,
72697,
72705,
72740,
72774,
72826,
72864,
72874,
72919,
72950,
72958,
72963,
72999,
73010,
73020,
73066,
73077,
73167,
73239,
73315,
73395,
73467,
73545,
73572,
73582,
73600,
73608,
73618,
73643,
73651,
73656,
73684,
73724,
73819,
73866,
73922,
73982,
74030,
74071,
74081,
74109,
74168,
74178,
74221,
74246,
74254,
74276,
74311,
74368,
74471,
74512,
74579,
74592,
74600,
74610,
74620,
74642,
74647,
74655,
74663,
74686,
74714,
74760,
74792,
74802,
74847,
74878,
74886,
74891,
74896,
74904,
74912,
74940,
75018,
75048,
75104,
75164,
75212,
75253,
75263,
75291,
75350,
75360,
75385,
75428,
75453,
75461,
75483,
75518,
75575,
75678,
75744,
75770,
75784,
75792,
75816,
75883,
75896,
75904,
75914,
75924,
75946,
75951,
75994,
76061,
76091,
76102,
76129,
76186,
76256,
76328,
76339,
76387,
76395,
76403,
76411,
76419,
76442,
76470,
76516,
76548,
76558,
76603,
76634,
76642,
76647,
76652,
76660,
76688,
76728,
76755,
76763,
76862,
76913,
76969,
77029,
77077,
77118,
77128,
77156,
77215,
77225,
77268,
77293,
77301,
77323,
77358,
77415,
77518,
77563,
77630,
77643,
77651,
77661,
77671,
77693,
77698,
77706,
77714,
77737,
77765,
77811,
77843,
77853,
77898,
77929,
77937,
77942,
77947,
77975,
77985,
77993,
78021,
78039,
78066,
78074,
78158,
78194,
78250,
78310,
78364,
78405,
78415,
78449,
78520,
78530,
78573,
78598,
78606,
78628,
78663,
78720,
78823,
78859,
78926,
78939,
78947,
78957,
78967,
78989,
78994,
79002,
79010,
79045,
79079,
79131,
79169,
79179,
79224,
79255,
79263,
79268,
79273,
79307,
79317,
79322,
79358,
79369,
79379,
79425,
79436,
79526,
79598,
79674,
79754,
79826,
79904,
79931,
79941,
79959,
79967,
79975,
79980,
79988,
79993,
79998,
80094,
80140,
80207,
80255,
80285,
80290,
80342,
80406,
80452,
80496,
80521,
80569,
80599,
80609,
80665,
80711,
80729,
80778,
80804,
80841,
80866,
80914,
80944,
80954,
81010,
81049,
81067,
81116,
81142,
81179,
81204,
81252,
81282,
81292,
81348,
81387,
81405,
81454,
81480,
81485,
81521,
81544,
81556,
81595,
81632,
81659,
81664,
81673,
81686,
81693,
81698,
81705,
81720,
81727,
81739,
81780,
81836,
81906,
81985,
82003,
82086,
82173,
82243,
82250,
82319,
82398,
82464,
82545,
82552,
82621,
82692,
82732,
82749,
82779,
82787,
82809,
82915,
82960,
82970,
82980,
83003,
83008,
83045,
83070,
83118,
83148,
83158,
83214,
83250,
83268,
83317,
83349,
83415,
83492,
83568,
83645,
83662,
83695,
83703,
83739,
83761,
83864,
83872,
83888,
83950,
83974,
83987,
83998,
84070,
84088,
84142,
84150,
84219,
84288,
84354,
84420,
84445,
84458,
84467,
84480,
84490,
84500,
84548,
84553,
84563,
84579,
84587,
84592,
84643,
84680,
84713,
84757,
84797,
84802,
84877,
84923,
84986,
85034,
85066,
85074,
85079,
85108,
85113,
85192,
85244,
85316,
85392,
85468,
85539,
85584,
85614,
85642,
85690,
85720,
85730,
85786,
85813,
85831,
85880,
85915,
85939,
85949,
85995,
86020,
86030,
86100,
86151,
86197,
86255,
86306,
86354,
86384,
86392,
86400,
86408,
86454,
86486,
86491,
86542,
86583,
86662,
86714,
86788,
86866,
86925,
86970,
86975,
87044,
87117,
87146,
87171,
87219,
87249,
87259,
87315,
87343,
87361,
87410,
87442,
87520,
87594,
87668,
87681,
87738,
87774,
87796,
87902,
87962,
87975,
87992,
88002,
88012,
88022,
88122,
88168,
88256,
88304,
88334,
88342,
88347,
88380,
88436,
88478,
88483,
88511,
88537,
88560,
88630,
88704,
88751,
88792,
88802,
88838,
88861,
88873,
88912,
88949,
88976,
88981,
88990,
89003,
89010,
89015,
89022,
89037,
89044,
89056,
89091,
89123,
89148,
89196,
89226,
89236,
89292,
89323,
89341,
89390,
89422,
89481,
89518,
89540,
89632,
89686,
89699,
89709,
89719,
89729,
89773,
89813,
89818,
89910,
89956,
90036,
90084,
90114,
90122,
90127,
90178,
90186,
90242,
90284,
90310,
90333,
90416,
90503,
90558,
90599,
90609,
90645,
90668,
90680,
90719,
90756,
90783,
90788,
90797,
90810,
90817,
90839,
90853,
90865,
90870,
90877,
90892,
90899,
90911,
90942,
90974,
90999,
91047,
91077,
91087,
91143,
91184,
91202,
91249,
91273,
91299,
91348,
91379,
91415,
91443,
91487,
91512,
91522,
91566,
91606,
91611,
91635,
91643,
91648,
91714,
91757,
91762,
91770,
91834,
91884,
91935,
91969,
91997,
92063,
92133,
92183,
92224,
92234,
92279,
92305,
92329,
92346,
92382,
92405,
92417,
92456,
92493,
92520,
92525,
92534,
92547,
92554,
92559,
92566,
92581,
92588,
92600,
92631,
92663,
92688,
92736,
92766,
92776,
92832,
92873,
92891,
92938,
92962,
92988,
93037,
93068,
93104,
93132,
93176,
93201,
93211,
93255,
93295,
93300,
93315,
93351,
93374,
93386,
93425,
93462,
93489,
93494,
93503,
93516,
93523,
93528,
93535,
93550,
93557,
93569,
93600,
93632,
93657,
93705,
93735,
93745,
93801,
93842,
93860,
93907,
93931,
93957,
94006,
94037,
94073,
94101,
94145,
94152,
94162,
94206,
94246,
94251,
94296,
94313,
94349,
94372,
94384,
94423,
94460,
94487,
94492,
94501,
94514,
94521,
94526,
94533,
94548,
94555,
94567,
94598,
94630,
94655,
94703,
94733,
94743,
94799,
94840,
94858,
94905,
94929,
94955,
95004,
95035,
95071,
95099,
95143,
95168,
95178,
95222,
95262,
95267,
95272,
95280,
95285,
95351,
95359,
95364,
95430,
95438,
95443,
95509,
95554,
95562,
95621,
95666,
95709,
95737,
95781,
95813,
95834,
95844,
95861,
95869,
95879,
95911,
95929,
95939,
95952,
95960,
95968,
96044,
96124,
96176,
96217,
96227,
96253,
96273,
96309,
96332,
96344,
96383,
96420,
96447,
96472,
96496,
96524,
96551,
96629,
96657,
96716,
96743,
96758,
96770,
96777,
96795,
96802,
96866,
96873,
96887,
96903,
96924,
96956,
96973,
96988,
96995,
97000,
97073,
97149,
97227,
97299,
97374,
97451,
97487,
97534,
97539,
97623,
97671,
97695,
97743,
97748,
97781,
97817,
97856,
97946,
97961,
97979,
97988,
98001,
98008,
98076,
98083,
98098,
98105,
98117,
98178,
98231,
98239,
98269,
98300,
98332,
98357,
98405,
98435,
98445,
98501,
98542,
98560,
98607,
98631,
98657,
98706,
98737,
98773,
98801,
98845,
98876,
98886,
98930,
98970,
98975,
98980,
98988,
98993,
99042,
99092,
99102,
99130,
99150,
99155,
99163,
99183,
99218,
99226,
99280,
99323,
99333,
99387,
99430,
99438,
99471,
99532,
99582,
99592,
99597,
99602,
99616,
99645,
99709,
99804,
99847,
99884,
99889,
99944,
99949,
99954,
99980,
100008,
100023,
100039,
100061,
100070,
100143,
100224,
100309,
100330,
100346,
100367,
100408,
100445,
100509,
100570,
100640,
100708,
100762,
100855,
100880,
100896,
100916,
100924,
100963,
101003,
101043,
101110,
101136,
101156,
101176,
101184,
101192,
101197,
101202,
101256,
101296,
101322,
101327,
101388,
101449,
101493,
101501,
101506,
101563,
101601,
101625,
101633,
101690,
101707,
101728,
101738,
101758,
101776,
101784,
101789,
101794,
101799,
101834,
101839,
101909,
101983,
102053,
102094,
102104,
102165,
102237,
102310,
102381,
102457,
102471,
102495,
102569,
102604,
102639,
102660,
102732,
102802,
102873,
102945,
103014,
103032,
103047,
103052,
103098,
103142,
103216,
103224,
103266,
103335,
103405,
103475,
103482,
103556,
103627,
103681,
103705,
103735,
103790,
103858,
103893,
103920,
103930,
104006,
104011,
104033,
104052,
104121,
104167,
104224,
104238,
104248,
104259,
104267,
104275,
104295,
104305,
104374,
104447,
104498,
104525,
104586,
104645,
104722,
104756,
104817,
104878,
104949,
105003,
105076,
105149,
105206,
105262,
105339,
105380,
105440,
105488,
105558,
105608,
105619,
105627,
105635,
105645,
105650,
105661,
105686,
105696,
105742,
105750,
105755,
105763,
105842,
105907,
105967,
105972,
105980,
106030,
106095,
106120,
106149,
106159,
106187,
106213,
106221,
106226,
106231,
106236,
106265,
106273,
106357,
106393,
106449,
106509,
106558,
106599,
106609,
106638,
106699,
106709,
106752,
106777,
106785,
106807,
106842,
106899,
107002,
107033,
107100,
107113,
107121,
107131,
107141,
107163,
107168,
107176,
107184,
107209,
107238,
107285,
107318,
107328,
107373,
107404,
107412,
107417,
107422,
107451,
107461,
107492,
107497,
107532,
107562,
107570,
107587,
107606,
107628,
107651,
107686,
107716,
107742,
107750,
107777,
107803,
107815,
107824,
107841,
107848,
107886,
107893,
107905,
107938,
107963,
108011,
108041,
108051,
108107,
108142,
108160,
108209,
108235,
108299,
108367,
108421,
108462,
108472,
108477,
108508,
108540,
108572,
108603,
108613,
108696,
108769,
108799,
108807,
108815,
108878,
108927,
108969,
108974,
109012,
109067,
109126,
109174,
109215,
109225,
109230,
109254,
109287,
109322,
109356,
109392,
109422,
109434,
109484,
109513,
109538,
109586,
109616,
109626,
109682,
109720,
109738,
109785,
109809,
109835,
109884,
109915,
109951,
109979,
110019,
110060,
110087,
110097,
110141,
110181,
110186,
110191,
110199,
110204,
110281,
110322,
110375,
110385,
110409,
110414,
110422,
110479,
110522,
110591,
110599,
110604,
110609,
110680,
110755,
110819,
110860,
110870,
110948,
111022,
111099,
111137,
111161,
111195,
111231,
111261,
111291,
111303,
111353,
111382,
111407,
111455,
111485,
111495,
111551,
111589,
111607,
111654,
111678,
111704,
111753,
111784,
111820,
111848,
111888,
111929,
111968,
111978,
112022,
112062,
112067,
112072,
112080,
112085,
112162,
112203,
112227,
112232,
112240,
112313,
112372,
112428,
112433,
112465,
112495,
112507,
112512,
112520,
112561,
112566,
112574,
112611,
112619,
112703,
112739,
112795,
112855,
112905,
112946,
112956,
112986,
113049,
113059,
113102,
113127,
113135,
113157,
113192,
113249,
113352,
113384,
113451,
113464,
113472,
113482,
113492,
113514,
113519,
113527,
113535,
113562,
113592,
113640,
113674,
113684,
113729,
113760,
113768,
113773,
113778,
113808,
113818,
113854,
113859,
113945,
113983,
114039,
114099,
114163,
114204,
114214,
114247,
114271,
114374,
114382,
114390,
114433,
114458,
114466,
114488,
114523,
114580,
114683,
114749,
114816,
114829,
114837,
114847,
114857,
114879,
114884,
114892,
114902,
114910,
114965,
115009,
115071,
115119,
115129,
115174,
115205,
115213,
115218,
115223,
115228,
115233,
115292,
115355,
115406,
115447,
115457,
115491,
115513,
115549,
115572,
115584,
115623,
115660,
115687,
115692,
115755,
115818,
115885,
115909,
115925,
115937,
115956,
115965,
115978,
115985,
116006,
116013,
116028,
116035,
116047,
116097,
116126,
116151,
116199,
116229,
116239,
116295,
116333,
116351,
116398,
116422,
116448,
116497,
116528,
116564,
116592,
116632,
116673,
116699,
116709,
116753,
116793,
116798,
116823,
116831,
116836,
116913,
116954,
116988,
116996,
117056,
117102,
117145,
117176,
117201,
117213,
117218,
117240,
117245,
117253,
117258,
117263,
117268,
117343,
117422,
117489,
117530,
117540,
117574,
117603,
117639,
117662,
117674,
117713,
117750,
117777,
117782,
117845,
117908,
117975,
117999,
118015,
118027,
118055,
118064,
118077,
118084,
118114,
118121,
118136,
118143,
118155,
118205,
118234,
118259,
118307,
118337,
118347,
118403,
118441,
118459,
118506,
118530,
118556,
118605,
118636,
118672,
118700,
118740,
118781,
118823,
118833,
118877,
118917,
118922,
118963,
118971,
118976,
119053,
119094,
119128,
119136,
119212,
119274,
119333,
119364,
119396,
119408,
119413,
119442,
119447,
119455,
119460,
119518,
119528,
119533,
119603,
119677,
119739,
119780,
119790,
119824,
119848,
119884,
119907,
119919,
119958,
119995,
120022,
120027,
120090,
120153,
120220,
120244,
120260,
120272,
120300,
120309,
120322,
120329,
120359,
120366,
120381,
120388,
120400,
120450,
120479,
120504,
120552,
120582,
120592,
120648,
120686,
120704,
120751,
120775,
120801,
120850,
120881,
120917,
120945,
120985,
121026,
121063,
121073,
121117,
121157,
121162,
121198,
121206,
121211,
121288,
121329,
121363,
121371,
121442,
121499,
121553,
121584,
121611,
121623,
121628,
121652,
121657,
121665,
121670,
121678,
121683,
121724,
121729,
121734,
121776,
121818,
121841,
121851,
121868,
121876,
121881,
121886,
121891,
121979,
122019,
122075,
122135,
122193,
122234,
122244,
122271,
122295,
122386,
122394,
122402,
122445,
122480,
122509,
122517,
122539,
122574,
122631,
122734,
122794,
122861,
122874,
122882,
122892,
122902,
122924,
122929,
122937,
122947,
122955,
122998,
123036,
123092,
123134,
123144,
123189,
123220,
123228,
123233,
123238,
123276,
123316,
123358,
123394,
123429,
123465,
123498,
123565,
123636,
123695,
123736,
123746,
123780,
123802,
123838,
123861,
123873,
123912,
123949,
123976,
123981,
124044,
124107,
124174,
124198,
124214,
124226,
124253,
124262,
124275,
124282,
124311,
124318,
124333,
124340,
124352,
124402,
124431,
124456,
124504,
124534,
124544,
124600,
124638,
124656,
124703,
124727,
124753,
124802,
124833,
124869,
124897,
124937,
124978,
125012,
125022,
125066,
125106,
125111,
125144,
125152,
125157,
125234,
125275,
125309,
125317,
125385,
125439,
125490,
125509,
125517,
125522,
125592,
125666,
125728,
125769,
125779,
125813,
125846,
125882,
125905,
125917,
125956,
125993,
126020,
126025,
126088,
126151,
126218,
126242,
126258,
126270,
126298,
126307,
126320,
126327,
126357,
126364,
126379,
126386,
126398,
126448,
126477,
126502,
126550,
126580,
126590,
126646,
126684,
126702,
126749,
126773,
126799,
126848,
126879,
126915,
126943,
126983,
127024,
127061,
127071,
127115,
127155,
127160,
127196,
127204,
127209,
127286,
127327,
127361,
127369,
127440,
127497,
127551,
127581,
127589,
127594,
127671,
127752,
127821,
127862,
127872,
127906,
127940,
127976,
127999,
128011,
128050,
128087,
128114,
128119,
128182,
128245,
128312,
128336,
128352,
128364,
128398,
128407,
128420,
128427,
128463,
128470,
128485,
128492,
128504,
128554,
128583,
128608,
128656,
128686,
128696,
128752,
128790,
128808,
128855,
128879,
128905,
128954,
128985,
129021,
129049,
129089,
129130,
129174,
129184,
129228,
129268,
129273,
129316,
129324,
129329,
129406,
129447,
129481,
129489,
129567,
129631,
129692,
129723,
129731,
129736,
129744,
129749,
129776,
129809,
129838,
129874,
129897,
129924,
129929,
129998,
130071,
130132,
130173,
130183,
130217,
130249,
130285,
130308,
130320,
130359,
130396,
130423,
130428,
130491,
130554,
130621,
130645,
130661,
130673,
130701,
130710,
130723,
130730,
130760,
130767,
130782,
130789,
130801,
130851,
130880,
130905,
130953,
130983,
130993,
131049,
131087,
131105,
131152,
131176,
131202,
131251,
131282,
131318,
131346,
131386,
131427,
131463,
131473,
131517,
131557,
131562,
131597,
131605,
131610,
131687,
131728,
131762,
131770,
131840,
131896,
131949,
131954,
131959,
131991,
132014,
132026,
132031,
132097,
132167,
132225,
132266,
132276,
132310,
132344,
132380,
132403,
132415,
132454,
132491,
132518,
132523,
132586,
132649,
132716,
132740,
132756,
132768,
132793,
132802,
132815,
132822,
132849,
132856,
132871,
132878,
132890,
132940,
132969,
132994,
133042,
133072,
133082,
133138,
133176,
133194,
133241,
133265,
133291,
133340,
133371,
133407,
133435,
133475,
133516,
133549,
133559,
133603,
133643,
133648,
133680,
133688,
133693,
133770,
133811,
133845,
133853,
133920,
133973,
134023,
134028,
134060,
134087,
134099,
134104,
134112,
134117,
134184,
134255,
134314,
134355,
134365,
134399,
134433,
134469,
134492,
134504,
134543,
134580,
134607,
134612,
134675,
134738,
134805,
134829,
134845,
134857,
134883,
134892,
134905,
134912,
134940,
134947,
134962,
134969,
134981,
135031,
135060,
135085,
135133,
135163,
135173,
135229,
135267,
135285,
135332,
135356,
135382,
135431,
135462,
135498,
135526,
135566,
135607,
135641,
135651,
135695,
135735,
135740,
135773,
135781,
135786,
135863,
135904,
135938,
135946,
136014,
136068,
136119,
136124,
136156,
136184,
136196,
136201,
136209,
136214,
136280,
136350,
136408,
136449,
136459,
136493,
136527,
136563,
136586,
136598,
136637,
136674,
136701,
136706,
136769,
136832,
136899,
136923,
136939,
136951,
136976,
136985,
136998,
137005,
137032,
137039,
137054,
137061,
137073,
137123,
137152,
137177,
137225,
137255,
137265,
137321,
137359,
137377,
137424,
137448,
137474,
137523,
137554,
137590,
137618,
137658,
137699,
137732,
137742,
137786,
137826,
137831,
137863,
137871,
137876,
137953,
137994,
138028,
138036,
138103,
138156,
138206,
138211,
138243,
138270,
138282,
138287,
138295,
138300,
138368,
138440,
138500,
138541,
138551,
138585,
138619,
138655,
138678,
138690,
138729,
138766,
138793,
138798,
138861,
138924,
138991,
139015,
139031,
139043,
139070,
139079,
139092,
139099,
139128,
139135,
139150,
139157,
139169,
139219,
139248,
139273,
139321,
139351,
139361,
139417,
139455,
139473,
139520,
139544,
139570,
139619,
139650,
139686,
139714,
139754,
139795,
139830,
139840,
139884,
139924,
139929,
139963,
139971,
139976,
140053,
140094,
140128,
140136,
140205,
140260,
140312,
140317,
140349,
140378,
140390,
140395,
140403,
140408,
140480,
140556,
140620,
140661,
140671,
140705,
140739,
140775,
140798,
140810,
140849,
140886,
140913,
140918,
140981,
141044,
141111,
141135,
141151,
141163,
141194,
141203,
141216,
141223,
141256,
141263,
141278,
141285,
141297,
141347,
141376,
141401,
141449,
141479,
141489,
141545,
141583,
141601,
141648,
141672,
141698,
141747,
141778,
141814,
141842,
141882,
141923,
141962,
141972,
142016,
142056,
142061,
142099,
142107,
142112,
142189,
142230,
142264,
142272,
142345,
142404,
142460,
142465,
142497,
142530,
142542,
142547,
142555,
142560,
142565,
142622,
142632,
142703,
142778,
142841,
142882,
142892,
142926,
142960,
142996,
143019,
143031,
143070,
143107,
143134,
143139,
143202,
143265,
143332,
143356,
143372,
143384,
143414,
143423,
143436,
143443,
143475,
143482,
143497,
143504,
143516,
143566,
143595,
143620,
143668,
143698,
143708,
143764,
143802,
143820,
143867,
143891,
143917,
143966,
143997,
144033,
144061,
144101,
144142,
144180,
144190,
144234,
144274,
144279,
144316,
144324,
144329,
144406,
144447,
144481,
144489,
144561,
144619,
144674,
144679,
144711,
144743,
144755,
144760,
144768,
144773,
144781,
144833,
144843,
144915,
144991,
145055,
145096,
145106,
145140,
145174,
145210,
145233,
145245,
145284,
145321,
145348,
145353,
145416,
145479,
145546,
145570,
145586,
145598,
145629,
145638,
145651,
145658,
145691,
145698,
145713,
145720,
145732,
145782,
145811,
145836,
145884,
145914,
145924,
145980,
146018,
146036,
146083,
146107,
146133,
146182,
146213,
146249,
146277,
146317,
146358,
146397,
146407,
146451,
146491,
146496,
146534,
146542,
146547,
146624,
146665,
146699,
146707,
146780,
146839,
146895,
146900,
146932,
146965,
146977,
146982,
146990,
146995,
147003,
147032,
147037,
147045,
147050,
147055,
147082,
147111,
147149,
147170,
147180,
147207,
147215,
147220,
147225,
147230,
147235,
147240,
147272,
147286,
147315,
147379,
147474,
147517,
147590,
147667,
147717,
147764,
147774,
147782,
147811,
147860,
147901,
147911,
147965,
148027,
148035,
148060,
148102,
148110,
148177,
148219,
148288,
148345,
148416,
148488,
148524,
148547,
148559,
148598,
148635,
148662,
148683,
148709,
148720,
148746,
148758,
148776,
148788,
148833,
148858,
148906,
148936,
148946,
149002,
149056,
149074,
149121,
149145,
149171,
149220,
149262,
149321,
149349,
149362,
149369,
149379,
149423,
149463,
149468,
149505,
149519,
149527,
149532,
149573,
149578,
149648,
149680,
149716,
149739,
149751,
149790,
149827,
149854,
149887,
149899,
149944,
149969,
150017,
150047,
150057,
150113,
150167,
150185,
150232,
150256,
150282,
150331,
150373,
150432,
150460,
150473,
150514,
150528,
150538,
150582,
150622,
150627,
150653,
150674,
150685,
150693,
150698,
150739,
150744,
150754,
150829,
150870,
150899,
150910,
150918,
150923,
150933,
150958,
150963,
150971,
150996,
151006,
151031,
151039,
151086,
151119,
151144,
151186,
151194,
151261,
151303,
151372,
151429,
151500,
151572,
151608,
151631,
151643,
151682,
151719,
151746,
151767,
151793,
151804,
151830,
151842,
151860,
151872,
151917,
151942,
151990,
152020,
152030,
152086,
152140,
152158,
152205,
152229,
152255,
152304,
152346,
152405,
152433,
152446,
152453,
152463,
152507,
152547,
152552,
152589,
152603,
152611,
152616,
152657,
152662,
152732,
152764,
152800,
152823,
152835,
152874,
152911,
152938,
152971,
152983,
153028,
153053,
153101,
153131,
153141,
153197,
153251,
153269,
153316,
153340,
153366,
153415,
153457,
153516,
153544,
153557,
153598,
153612,
153622,
153666,
153706,
153711,
153737,
153758,
153769,
153777,
153782,
153823,
153828,
153838,
153913,
153954,
153983,
153990,
154000,
154081,
154127,
154196,
154244,
154274,
154282,
154287,
154301,
154330,
154394,
154489,
154532,
154537,
154542,
154625,
154712,
154762,
154803,
154813,
154880,
154910,
154953,
155003,
155044,
155054,
155084,
155155,
155198,
155251,
155259,
155281,
155316,
155351,
155408,
155457,
155533,
155597,
155632,
155678,
155690,
155750,
155758,
155774,
155827,
155840,
155848,
155901,
155938,
155974,
156008,
156115,
156179,
156214,
156269,
156335,
156372,
156404,
156412,
156467,
156503,
156513,
156576,
156586,
156591,
156596,
156632,
156642,
156652,
156657,
156667,
156689,
156694,
156699,
156707,
156712,
156741,
156771,
156894,
157007,
157037,
157045,
157050,
157060,
157087,
157095,
157100,
157105,
157113,
157172,
157217,
157246,
157251,
157256,
157309,
157366,
157417,
157458,
157468,
157518,
157556,
157566,
157628,
157659,
157697,
157748,
157789,
157799,
157830,
157901,
157944,
157997,
158005,
158027,
158062,
158092,
158149,
158199,
158277,
158342,
158378,
158425,
158437,
158500,
158508,
158524,
158577,
158590,
158598,
158651,
158688,
158724,
158759,
158843,
158907,
158942,
158998,
159064,
159103,
159136,
159144,
159199,
159235,
159245,
159308,
159318,
159323,
159328,
159365,
159375,
159385,
159390,
159400,
159422,
159427,
159432,
159440,
159445,
159476,
159507,
159630,
159743,
159773,
159781,
159786,
159796,
159825,
159833,
159838,
159843,
159851,
159859,
159919,
159965,
159996,
160001,
160006,
160073,
160144,
160196,
160237,
160247,
160283,
160306,
160318,
160357,
160394,
160421,
160446,
160471,
160496,
160520,
160525,
160534,
160547,
160554,
160559,
160566,
160581,
160588,
160600,
160631,
160663,
160688,
160736,
160766,
160776,
160832,
160873,
160891,
160938,
160962,
160988,
161037,
161068,
161104,
161132,
161176,
161203,
161213,
161257,
161297,
161302,
161328,
161336,
161341,
161407,
161412,
161456,
161523,
161559,
161582,
161594,
161633,
161670,
161697,
161722,
161727,
161739,
161788,
161831,
161838,
161848,
161874,
161882,
161903,
161908,
161916,
161921,
161965,
162032,
162068,
162091,
162103,
162142,
162179,
162206,
162231,
162236,
162248,
162297,
162338,
162345,
162355,
162381,
162389,
162410,
162415,
162423,
162428,
162472,
162548,
162592,
162599,
162609,
162645,
162668,
162680,
162719,
162756,
162783,
162807,
162832,
162866,
162918,
162982,
162993,
163020,
163055,
163092,
163128,
163187,
163199,
163204,
163260,
163269,
163282,
163289,
163301,
163332,
163372,
163408,
163423,
163438,
163445,
163457,
163487,
163516,
163541,
163589,
163619,
163629,
163685,
163713,
163731,
163780,
163841,
163869,
163917,
163947,
163957,
164013,
164040,
164058,
164107,
164142,
164149,
164159,
164221,
164265,
164305,
164310,
164335,
164361,
164369,
164480,
164488,
164493,
164498,
164506,
164514,
164575,
164622,
164666,
164671,
164703,
164731,
164743,
164748,
164756,
164761,
164823,
164828,
164833,
164838,
164843,
164848,
164853,
164858,
164863,
164868,
164952,
164986,
164994,
165057,
165115,
165177,
165256,
165297,
165307,
165343,
165366,
165378,
165417,
165454,
165481,
165507,
165512,
165539,
165551,
165582,
165614,
165639,
165687,
165717,
165727,
165783,
165824,
165842,
165889,
165913,
165939,
165988,
166019,
166055,
166083,
166127,
166157,
166167,
166211,
166251,
166256,
166285,
166293,
166298,
166364,
166372,
166417,
166467,
166503,
166561,
166592,
166645,
166657,
166662,
166670,
166675,
166685,
166690,
166695,
166700,
166705,
166710,
166757,
166765,
166828,
166907,
166965,
167027,
167106,
167147,
167155,
167200,
167250,
167286,
167296,
167329,
167393,
167461,
167497,
167520,
167532,
167571,
167608,
167635,
167661,
167688,
167700,
167731,
167763,
167788,
167836,
167866,
167876,
167932,
167973,
167991,
168038,
168062,
168088,
168137,
168168,
168204,
168232,
168276,
168304,
168314,
168358,
168398,
168403,
168430,
168438,
168443,
168509,
168571,
168619,
168624,
168654,
168717,
168784,
168820,
168843,
168855,
168894,
168931,
168958,
168985,
168997,
169042,
169067,
169115,
169145,
169155,
169211,
169265,
169283,
169330,
169354,
169380,
169429,
169471,
169530,
169558,
169571,
169598,
169608,
169652,
169692,
169697,
169723,
169731,
169736,
169777,
169838,
169885,
169890,
169925,
170001,
170016,
170127,
170230,
170323,
170408,
170435,
170443,
170459,
170545,
170623,
170718,
170805,
170891,
170969,
171067,
171157,
171254,
171343,
171447,
171543,
171564,
171612,
171660,
171708,
171720,
171762,
171770,
171780,
171838,
171900,
171979,
172020,
172030,
172076,
172084,
172129,
172179,
172215,
172220,
172228,
172286,
172317,
172370,
172382,
172387,
172395,
172400,
172410,
172415,
172420,
172490,
172564,
172642,
172690,
172731,
172741,
172777,
172800,
172812,
172851,
172888,
172915,
172920,
172929,
172942,
172949,
173007,
173032,
173072,
173101,
173124,
173164,
173195,
173212,
173258,
173289,
173334,
173374,
173445,
173509,
173528,
173559,
173592,
173630,
173644,
173671,
173711,
173751,
173765,
173821,
173826,
173841,
173863,
173870,
173949,
173974,
174003,
174015,
174022,
174094,
174124,
174141,
174151,
174158,
174206,
174282,
174326,
174354,
174361,
174414,
174439,
174464,
174471,
174502,
174514,
174519,
174526,
174541,
174548,
174560,
174591,
174623,
174648,
174696,
174726,
174736,
174792,
174833,
174851,
174898,
174922,
174948,
174997,
175028,
175064,
175092,
175136,
175159,
175169,
175213,
175253,
175258,
175280,
175288,
175293,
175359,
175367,
175424,
175467,
175506,
175511,
175543,
175562,
175574,
175579,
175587,
175592,
175646,
175704,
175753,
175794,
175804,
175827,
175876,
175912,
175935,
175947,
175986,
176023,
176050,
176075,
176099,
176151,
176189,
176201,
176206,
176218,
176249,
176281,
176306,
176354,
176384,
176394,
176450,
176491,
176509,
176556,
176580,
176606,
176655,
176686,
176722,
176750,
176794,
176821,
176831,
176875,
176915,
176920,
176925,
176933,
176938,
177004,
177047,
177057,
177062,
177070,
177128,
177172,
177177,
177182,
177211,
177233,
177241,
177270,
177289,
177322,
177332,
177363,
177388,
177416,
177428,
177440,
177448,
177458,
177463,
177517,
177575,
177627,
177668,
177678,
177714,
177737,
177749,
177788,
177825,
177852,
177878,
177913,
177922,
177935,
177942,
177972,
177987,
178020,
178035,
178042,
178057,
178064,
178076,
178107,
178139,
178164,
178212,
178242,
178252,
178308,
178349,
178367,
178414,
178438,
178464,
178513,
178544,
178580,
178608,
178652,
178679,
178689,
178733,
178773,
178778,
178804,
178812,
178817,
178883,
178891,
178952,
178999,
179043,
179050,
179060,
179065,
179096,
179129,
179141,
179146,
179154,
179159,
179253,
179351,
179403,
179444,
179454,
179490,
179513,
179525,
179564,
179601,
179628,
179656,
179683,
179706,
179711,
179720,
179733,
179740,
179766,
179781,
179788,
179803,
179810,
179822,
179853,
179885,
179910,
179958,
179988,
179998,
180054,
180095,
180113,
180160,
180184,
180210,
180259,
180290,
180326,
180354,
180398,
180425,
180435,
180479,
180519,
180524,
180550,
180558,
180563,
180629,
180637,
180698,
180745,
180789,
180794,
180826,
180860,
180872,
180877,
180885,
180890,
180895,
180932,
180937,
180942,
180947,
180988,
180996,
181052,
181108,
181168,
181244,
181285,
181295,
181331,
181354,
181366,
181405,
181442,
181469,
181556,
181621,
181662,
181667,
181743,
181797,
181864,
181922,
181927,
181948,
181974,
181985,
182011,
182023,
182028,
182049,
182054,
182117,
182180,
182247,
182271,
182287,
182299,
182322,
182395,
182462,
182530,
182592,
182606,
182618,
182623,
182632,
182645,
182652,
182677,
182684,
182699,
182706,
182718,
182768,
182797,
182822,
182870,
182900,
182910,
182966,
183004,
183022,
183069,
183093,
183119,
183168,
183199,
183235,
183263,
183303,
183344,
183371,
183381,
183425,
183465,
183470,
183496,
183504,
183509,
183586,
183627,
183635,
183677,
183727,
183763,
183818,
183849,
183900,
183912,
183917,
183925,
183935,
183940,
183945,
183975,
184047,
184119,
184193,
184268,
184316,
184323,
184397,
184445,
184452,
184524,
184597,
184622,
184627,
184639,
184644,
184721,
184798,
184848,
184920,
184997,
185004,
185089,
185116,
185140,
185157,
185181,
185275,
185356,
185366,
185390,
185418,
185447,
185460,
185470,
185480,
185485,
185503,
185552,
185580,
185647,
185713,
185727,
185748,
185821,
185832,
185840,
185914,
185970,
185978,
185990,
186000,
186009,
186020,
186044,
186057,
186069,
186130,
186141,
186180,
186203,
186270,
186306,
186350,
186411,
186464,
186496,
186506,
186582,
186650,
186658,
186666,
186687,
186692,
186750,
186786,
186847,
186852,
186878,
186883,
186900,
186919,
186982,
187043,
187091,
187135,
187204,
187273,
187336,
187396,
187406,
187431,
187436,
187465,
187470,
187475,
187541,
187620,
187691,
187758,
187831,
187861,
187869,
187951,
188038,
188109,
188184,
188257,
188287,
188295,
188300,
188340,
188381,
188434,
188492,
188542,
188576,
188591,
188619,
188679,
188746,
188795,
188800,
188817,
188842,
188866,
188901,
188913,
188918,
188954,
188987,
189019,
189052,
189057,
189090,
189136,
189211,
189227,
189242,
189309,
189364,
189397,
189423,
189433,
189469,
189499,
189509,
189514,
189522,
189527,
189532,
189537,
189542,
189563,
189609,
189657,
189705,
189753,
189784,
189829,
189834,
189867,
189917,
189951,
189982,
190006,
190071,
190095,
190105,
190127,
190135,
190156,
190164,
190169,
190205,
190268,
190288,
190298,
190318,
190326,
190331,
190336,
190347,
190423,
190489,
190564,
190613,
190626,
190633,
190655,
190660,
190739,
190755,
190786,
190832,
190857,
190865,
190887,
190922,
190981,
190991,
191013,
191018,
191026,
191036,
191112,
191169,
191206,
191224,
191232,
191269,
191357,
191384,
191392,
191397,
191442,
191479,
191544,
191554,
191568,
191582,
191596,
191601,
191623,
191644,
191721,
191795,
191821,
191829,
191903,
191939,
191949,
192011,
192019,
192029,
192034,
192067,
192111,
192164,
192182,
192192,
192211,
192219,
192224,
192309,
192335,
192345,
192368,
192376,
192381,
192386,
192417,
192453,
192503,
192532,
192574,
192593,
192629,
192641,
192648,
192655,
192677,
192689,
192696,
192703,
192724,
192736,
192743,
192750,
192768,
192773,
192788,
192810,
192815,
192820,
192825,
192850,
192875,
192923,
192983,
192988,
193058,
193130,
193202,
193269,
193339,
193412,
193437,
193506,
193574,
193626,
193640,
193647,
193665,
193686,
193697,
193720,
193734,
193741,
193754,
193761,
193772,
193829,
193841,
193856,
193881,
193914,
194001,
194031,
194036,
194110,
194179,
194249,
194274,
194322,
194332,
194339,
194344,
194349,
194427,
194451,
194461,
194483,
194491,
194496,
194525,
194550,
194560,
194586,
194643,
194665,
194677,
194685,
194704,
194714,
194719,
194763,
194816,
194834,
194844,
194863,
194871,
194876,
194917,
194950,
194984,
194994,
195016,
195038,
195046,
195069,
195120,
195141,
195179,
195244,
195322,
195375,
195448,
195469,
195519,
195535,
195545,
195566,
195574,
195638,
195672,
195677,
195714,
195732,
195742,
195774,
195796,
195804,
195809,
195849,
195874,
195884,
195923,
195945,
195955,
195976,
195984,
196001,
196022,
196049,
196070,
196080,
196096,
196117,
196128,
196184,
196218,
196231,
196238,
196246,
196278,
196283,
196344,
196430,
196435,
196501,
196560,
196565,
196570,
196585,
196590,
196661,
196733,
196771,
196785,
196849,
196914,
196919,
196953,
196991,
197025,
197065,
197078,
197083,
197137,
197144,
197149,
197161,
197166,
197201,
197247,
197284,
197325,
197368,
197373,
197385,
197390,
197426,
197446,
197512,
197540,
197545,
197580,
197585,
197628,
197706,
197754,
197800,
197869,
197897,
197942,
197972,
198019,
198024,
198050,
198069,
198074,
198102,
198123,
198128,
198157,
198179,
198184,
198229,
198234,
198246,
198281,
198304,
198338,
198393,
198482,
198487,
198542,
198620,
198688,
198693,
198715,
198737,
198761,
198785,
198797,
198802,
198838,
198915,
198985,
199009,
199033,
199041,
199057,
199069,
199113,
199159,
199175,
199183,
199191,
199209,
199227,
199247,
199255,
199265,
199270,
199294,
199326,
199404,
199428,
199501,
199537,
199587,
199603,
199638,
199653,
199698,
199728,
199771,
199786,
199835,
199865,
199882,
199926,
199975,
200024,
200056,
200083,
200117,
200176,
200243,
200266,
200271,
200296,
200352,
200401,
200434,
200439,
200489,
200520,
200525,
200535,
200546,
200556,
200561,
200591,
200596,
200624,
200646,
200711,
200719,
200724,
200736,
200771,
200801,
200930,
200955,
200980,
201073,
201081,
201086,
201098,
201134,
201158,
201165,
201175,
201237,
201264,
201276,
201296,
201307,
201312,
201324,
201359,
201366,
201387,
201394,
201449,
201454,
201466,
201471,
201507,
201512,
201542,
201590,
201598,
201629,
201691,
201749,
201823,
201885,
201957,
202025,
202105,
202201,
202265,
202270,
202352,
202421,
202453,
202463,
202473,
202478,
202483,
202565,
202636,
202715,
202750,
202782,
202850,
202924,
203001,
203009,
203014,
203091,
203173,
203246,
203292,
203377,
203452,
203467,
203474,
203484,
203510,
203593,
203602,
203646,
203653,
203707,
203712,
203719,
203785,
203823,
203833,
203840,
203866,
203899,
203909,
203916,
203978,
204005,
204012,
204017,
204024,
204080,
204087,
204092,
204161,
204224,
204262,
204267,
204279,
204284,
204289,
204294,
204317,
204377,
204411,
204438,
204483,
204524,
204571,
204618,
204663,
204714,
204753,
204782,
204843,
204872,
204903,
204940,
204979,
205010,
205047,
205092,
205135,
205172,
205215,
205244,
205275,
205306,
205335,
205364,
205391,
205420,
205455,
205484,
205509,
205538,
205567,
205596,
205621,
205660,
205697,
205738,
205785,
205830,
205871,
205904,
205939,
205970,
206001,
206032,
206065,
206098,
206135,
206168,
206205,
206232,
206291,
206322,
206345,
206378,
206425,
206452,
206483,
206518,
206539,
206568,
206599,
206632,
206665,
206694,
206723,
206752,
206791,
206826,
206863,
206902,
206947,
206982,
207035,
207090,
207113,
207160,
207189,
207214,
207243,
207296,
207337,
207372,
207409,
207440,
207463,
207488,
207515,
207546,
207581,
207593,
207598,
207680,
207691,
207720,
207793,
207856,
207886,
207896,
207946,
207954,
207964,
207969,
208032,
208064,
208114,
208145,
208153,
208158,
208193,
208237,
208275,
208287,
208298,
208335,
208366,
208374,
208383,
208412,
208428,
208484,
208524,
208550,
208585,
208595,
208614,
208631,
208643,
208648,
208653,
208725,
208802,
208879,
208946,
208981,
209015,
209040,
209065,
209088,
209117,
209130,
209152,
209160,
209168,
209173,
209209,
209243,
209248,
209253,
209328,
209336,
209357,
209399,
209409,
209438,
209456,
209533,
209587,
209619,
209645,
209686,
209696,
209718,
209729,
209748,
209770,
209781,
209797,
209808,
209813,
209835,
209859,
209871,
209892,
209906,
209914,
209933,
209961,
210038,
210115,
210156,
210180,
210199,
210221,
210279,
210292,
210365,
210428,
210460,
210470,
210514,
210524,
210529,
210606,
210661,
210712,
210757,
210822,
210859,
210909,
210961,
211005,
211013,
211018,
211039,
211077,
211087,
211095,
211105,
211110,
211152,
211214,
211252,
211287,
211335,
211359,
211403,
211415,
211422,
211429,
211454,
211466,
211473,
211480,
211500,
211512,
211519,
211526,
211545,
211557,
211564,
211571,
211589,
211613,
211637,
211665,
211675,
211745,
211759,
211776,
211800,
211867,
211893,
211903,
211938,
211979,
212040,
212077,
212111,
212158,
212181,
212225,
212237,
212244,
212251,
212276,
212288,
212295,
212302,
212322,
212334,
212341,
212348,
212367,
212379,
212386,
212393,
212411,
212443,
212453,
212502,
212603,
212668,
212701,
212720,
212725,
212748,
212817,
212825,
212883,
212935,
213015,
213049,
213104,
213157,
213170,
213180,
213213,
213256,
213291,
213333,
213338,
213359,
213395,
213412,
213452,
213486,
213528,
213566,
213593,
213627,
213652,
213709,
213756,
213798,
213808,
213860,
213865,
213870,
213892,
213901,
213908,
213927,
213934,
213939,
213961,
214010,
214061,
214071,
214096,
214118,
214147,
214200,
214210,
214222
],
"line_end_idx": [
31,
47,
48,
80,
81,
180,
181,
182,
221,
285,
307,
368,
410,
436,
456,
493,
506,
576,
631,
635,
679,
683,
755,
819,
892,
959,
990,
1020,
1051,
1054,
1085,
1129,
1202,
1216,
1229,
1294,
1347,
1378,
1402,
1410,
1444,
1472,
1480,
1483,
1489,
1492,
1495,
1498,
1501,
1520,
1564,
1610,
1656,
1702,
1731,
1774,
1777,
1808,
1856,
1888,
1917,
1939,
2002,
2024,
2032,
2052,
2058,
2077,
2083,
2086,
2120,
2181,
2199,
2207,
2225,
2231,
2234,
2237,
2246,
2320,
2384,
2457,
2504,
2515,
2520,
2540,
2543,
2620,
2634,
2663,
2707,
2730,
2736,
2756,
2789,
2846,
2854,
2874,
2877,
2883,
2891,
2965,
3020,
3055,
3071,
3077,
3112,
3198,
3223,
3229,
3232,
3275,
3310,
3373,
3381,
3394,
3407,
3420,
3424,
3445,
3465,
3541,
3614,
3639,
3646,
3719,
3754,
3763,
3824,
3831,
3840,
3844,
3876,
3919,
3971,
3988,
3997,
4015,
4022,
4026,
4110,
4135,
4144,
4166,
4173,
4177,
4181,
4211,
4246,
4295,
4323,
4364,
4382,
4417,
4428,
4434,
4440,
4461,
4472,
4478,
4484,
4504,
4515,
4521,
4527,
4544,
4548,
4562,
4583,
4587,
4591,
4630,
4666,
4691,
4700,
4724,
4731,
4735,
4783,
4808,
4823,
4829,
4854,
4875,
4881,
4906,
4927,
4933,
4962,
4975,
4981,
5010,
5023,
5029,
5033,
5048,
5077,
5083,
5092,
5107,
5140,
5147,
5151,
5180,
5195,
5231,
5238,
5242,
5275,
5281,
5290,
5305,
5342,
5349,
5353,
5386,
5401,
5441,
5448,
5452,
5518,
5524,
5533,
5548,
5595,
5602,
5606,
5656,
5660,
5666,
5691,
5716,
5769,
5857,
5883,
5889,
5898,
5923,
5965,
6031,
6038,
6059,
6093,
6113,
6121,
6160,
6224,
6235,
6244,
6253,
6274,
6278,
6282,
6334,
6391,
6453,
6496,
6570,
6585,
6599,
6665,
6719,
6751,
6776,
6785,
6820,
6849,
6858,
6862,
6869,
6873,
6877,
6883,
6894,
6906,
6933,
6958,
7002,
7076,
7091,
7105,
7171,
7225,
7257,
7282,
7291,
7326,
7355,
7364,
7368,
7375,
7379,
7383,
7389,
7414,
7428,
7434,
7459,
7480,
7486,
7511,
7532,
7538,
7567,
7580,
7586,
7615,
7628,
7634,
7638,
7653,
7682,
7688,
7697,
7712,
7745,
7752,
7756,
7785,
7800,
7836,
7843,
7847,
7880,
7886,
7895,
7910,
7947,
7954,
7958,
7991,
8006,
8046,
8053,
8057,
8120,
8126,
8135,
8150,
8197,
8204,
8208,
8257,
8261,
8267,
8291,
8315,
8362,
8442,
8446,
8457,
8469,
8479,
8486,
8490,
8497,
8501,
8510,
8514,
8554,
8585,
8649,
8658,
8682,
8730,
8737,
8741,
8745,
8786,
8849,
8911,
8974,
9009,
9035,
9042,
9046,
9050,
9057,
9061,
9068,
9072,
9076,
9080,
9111,
9126,
9132,
9157,
9178,
9184,
9209,
9230,
9236,
9265,
9278,
9284,
9313,
9326,
9332,
9336,
9351,
9380,
9386,
9395,
9410,
9443,
9450,
9454,
9483,
9498,
9534,
9541,
9545,
9578,
9584,
9593,
9608,
9645,
9652,
9656,
9689,
9704,
9744,
9751,
9755,
9821,
9827,
9836,
9851,
9898,
9905,
9909,
9940,
9995,
10052,
10109,
10126,
10132,
10136,
10140,
10144,
10168,
10192,
10239,
10298,
10302,
10371,
10442,
10513,
10579,
10648,
10720,
10744,
10812,
10879,
10930,
10943,
10949,
10966,
10986,
10996,
11018,
11031,
11037,
11049,
11055,
11065,
11121,
11132,
11146,
11170,
11202,
11288,
11317,
11321,
11394,
11462,
11531,
11555,
11602,
11611,
11617,
11621,
11625,
11702,
11725,
11734,
11755,
11762,
11766,
11794,
11818,
11827,
11852,
11908,
11929,
11940,
11947,
11965,
11974,
11978,
12021,
12073,
12090,
12099,
12117,
12124,
12128,
12168,
12200,
12233,
12242,
12263,
12284,
12291,
12313,
12363,
12383,
12420,
12484,
12561,
12613,
12685,
12705,
12754,
12769,
12778,
12798,
12805,
12868,
12901,
12905,
12941,
12958,
12967,
12998,
13019,
13026,
13030,
13069,
13093,
13102,
13140,
13161,
13170,
13190,
13197,
13213,
13233,
13259,
13279,
13288,
13303,
13323,
13333,
13388,
13421,
13433,
13439,
13446,
13477,
13481,
13541,
13626,
13630,
13695,
13753,
13757,
13761,
13765,
13795,
13799,
13823,
13899,
13928,
13990,
13994,
14000,
14023,
14029,
14062,
14082,
14109,
14122,
14145,
14158,
14170,
14185,
14219,
14223,
14255,
14283,
14314,
14342,
14378,
14424,
14428,
14456,
14504,
14531,
14554,
14582,
14610,
14621,
14648,
14675,
14686,
14710,
14735,
14760,
14770,
14796,
14821,
14833,
14844,
14869,
14925,
14950,
14962,
14987,
14998,
15024,
15050,
15061,
15088,
15115,
15126,
15151,
15176,
15187,
15212,
15237,
15249,
15253,
15278,
15297,
15314,
15334,
15354,
15373,
15395,
15411,
15422,
15449,
15460,
15472,
15487,
15503,
15515,
15530,
15549,
15567,
15582,
15600,
15611,
15623,
15635,
15646,
15657,
15667,
15678,
15692,
15703,
15712,
15723,
15734,
15745,
15754,
15770,
15785,
15802,
15822,
15841,
15858,
15871,
15885,
15897,
15909,
15921,
15934,
15947,
15962,
15975,
15990,
16000,
16026,
16038,
16046,
16059,
16079,
16089,
16101,
16115,
16122,
16133,
16145,
16158,
16171,
16182,
16193,
16204,
16220,
16234,
16249,
16265,
16284,
16298,
16321,
16345,
16353,
16373,
16384,
16393,
16404,
16427,
16444,
16458,
16473,
16485,
16493,
16502,
16512,
16524,
16539,
16561,
16595,
16610,
16627,
16634,
16645,
16657,
16666,
16679,
16688,
16699,
16708,
16712,
16716,
16764,
16782,
16808,
16869,
16905,
16930,
16951,
16966,
16984,
17000,
17024,
17048,
17082,
17094,
17104,
17116,
17129,
17149,
17170,
17174,
17212,
17289,
17362,
17401,
17477,
17546,
17578,
17612,
17652,
17686,
17715,
17746,
17781,
17815,
17850,
17883,
17934,
17968,
17992,
18015,
18038,
18060,
18092,
18130,
18162,
18166,
18179,
18196,
18214,
18221,
18280,
18312,
18342,
18355,
18368,
18375,
18379,
18402,
18462,
18486,
18495,
18499,
18578,
18582,
18617,
18625,
18648,
18652,
18710,
18732,
18802,
18827,
18831,
18877,
18904,
18960,
18990,
18994,
19054,
19122,
19148,
19216,
19298,
19327,
19331,
19356,
19387,
19391,
19438,
19461,
19516,
19542,
19546,
19623,
19661,
19688,
19760,
19819,
19849,
19853,
19883,
19941,
20001,
20064,
20130,
20159,
20212,
20246,
20250,
20299,
20321,
20380,
20405,
20409,
20467,
20489,
20559,
20584,
20588,
20616,
20676,
20736,
20799,
20865,
20894,
20947,
20990,
20994,
21060,
21126,
21155,
21182,
21256,
21332,
21367,
21397,
21401,
21432,
21464,
21484,
21488,
21528,
21553,
21607,
21637,
21691,
21717,
21721,
21756,
21782,
21825,
21854,
21858,
21929,
21952,
22029,
22043,
22069,
22073,
22145,
22188,
22214,
22296,
22347,
22376,
22380,
22444,
22467,
22543,
22569,
22573,
22616,
22638,
22689,
22714,
22718,
22790,
22825,
22851,
22933,
22974,
23003,
23007,
23073,
23098,
23174,
23202,
23206,
23278,
23348,
23377,
23457,
23537,
23569,
23573,
23637,
23659,
23737,
23762,
23766,
23791,
23825,
23843,
23847,
23914,
23943,
23964,
23968,
24036,
24110,
24134,
24138,
24210,
24281,
24326,
24355,
24435,
24516,
24571,
24603,
24607,
24671,
24693,
24771,
24796,
24800,
24876,
24926,
24956,
25021,
25096,
25129,
25133,
25209,
25259,
25289,
25354,
25429,
25462,
25466,
25523,
25580,
25633,
25682,
25727,
25768,
25816,
25854,
25915,
25976,
26033,
26086,
26135,
26180,
26234,
26275,
26279,
26337,
26359,
26429,
26454,
26458,
26504,
26525,
26581,
26605,
26609,
26667,
26720,
26738,
26742,
26813,
26836,
26903,
26927,
26953,
26957,
27016,
27085,
27147,
27168,
27199,
27265,
27342,
27414,
27439,
27473,
27478,
27507,
27528,
27563,
27587,
27592,
27651,
27674,
27745,
27771,
27776,
27849,
27900,
27927,
28010,
28071,
28101,
28106,
28171,
28200,
28279,
28311,
28316,
28378,
28398,
28403,
28465,
28491,
28496,
28521,
28580,
28641,
28705,
28772,
28802,
28856,
28898,
28903,
28934,
28993,
29054,
29118,
29185,
29215,
29269,
29302,
29307,
29317,
29348,
29367,
29372,
29445,
29489,
29516,
29599,
29651,
29681,
29686,
29751,
29820,
29848,
29921,
30002,
30033,
30038,
30102,
30151,
30181,
30189,
30194,
30204,
30256,
30317,
30378,
30445,
30475,
30508,
30534,
30539,
30547,
30596,
30670,
30733,
30796,
30881,
30889,
30894,
30904,
30914,
30919,
30952,
31001,
31065,
31095,
31103,
31108,
31157,
31235,
31301,
31365,
31394,
31402,
31429,
31450,
31487,
31548,
31558,
31650,
31680,
31690,
31695,
31771,
31819,
31853,
31877,
31899,
31925,
31930,
31964,
32003,
32042,
32069,
32154,
32234,
32289,
32314,
32322,
32330,
32335,
32356,
32414,
32419,
32465,
32470,
32475,
32517,
32545,
32593,
32665,
32695,
32740,
32819,
32849,
32854,
32859,
32920,
32952,
32981,
33057,
33097,
33153,
33185,
33214,
33256,
33274,
33318,
33330,
33337,
33344,
33369,
33381,
33388,
33395,
33415,
33427,
33434,
33441,
33460,
33472,
33479,
33486,
33504,
33528,
33578,
33593,
33601,
33611,
33639,
33647,
33697,
33766,
33848,
33878,
33886,
33956,
33979,
34067,
34097,
34108,
34152,
34201,
34215,
34223,
34279,
34345,
34378,
34399,
34477,
34487,
34528,
34577,
34622,
34674,
34722,
34732,
34737,
34744,
34778,
34785,
34829,
34907,
34974,
34992,
35071,
35076,
35118,
35123,
35199,
35275,
35280,
35337,
35342,
35362,
35405,
35464,
35538,
35594,
35658,
35719,
35782,
35830,
35897,
35902,
35933,
36003,
36029,
36104,
36118,
36123,
36186,
36265,
36345,
36383,
36388,
36436,
36441,
36491,
36540,
36599,
36659,
36724,
36804,
36873,
36927,
36981,
37048,
37124,
37197,
37254,
37318,
37372,
37436,
37483,
37528,
37573,
37616,
37628,
37633,
37652,
37657,
37677,
37748,
37818,
37899,
37911,
37919,
37924,
37962,
37989,
38056,
38066,
38085,
38090,
38114,
38190,
38244,
38304,
38379,
38384,
38408,
38456,
38526,
38575,
38580,
38625,
38652,
38681,
38752,
38789,
38849,
38925,
38988,
39062,
39128,
39203,
39271,
39331,
39355,
39360,
39440,
39513,
39518,
39563,
39575,
39593,
39601,
39606,
39655,
39714,
39788,
39823,
39842,
39847,
39870,
39939,
39947,
40005,
40057,
40137,
40171,
40226,
40279,
40292,
40302,
40335,
40378,
40413,
40455,
40460,
40481,
40517,
40534,
40574,
40608,
40650,
40688,
40715,
40749,
40774,
40831,
40878,
40920,
40930,
40982,
40987,
41036,
41072,
41121,
41134,
41190,
41237,
41250,
41302,
41312,
41388,
41412,
41458,
41468,
41476,
41481,
41529,
41560,
41579,
41609,
41645,
41650,
41723,
41788,
41862,
41929,
41941,
41951,
41959,
41989,
42054,
42125,
42130,
42186,
42251,
42256,
42269,
42274,
42286,
42310,
42317,
42337,
42358,
42379,
42400,
42405,
42467,
42524,
42581,
42638,
42695,
42700,
42775,
42842,
42847,
42906,
42979,
43064,
43139,
43204,
43277,
43344,
43349,
43363,
43368,
43411,
43436,
43444,
43466,
43501,
43527,
43537,
43559,
43564,
43575,
43580,
43602,
43607,
43612,
43635,
43658,
43681,
43686,
43698,
43703,
43708,
43749,
43821,
43899,
43960,
44035,
44059,
44084,
44109,
44138,
44162,
44170,
44186,
44194,
44215,
44285,
44344,
44398,
44415,
44426,
44484,
44494,
44516,
44578,
44586,
44642,
44687,
44745,
44755,
44776,
44836,
44897,
44958,
45018,
45054,
45110,
45120,
45128,
45164,
45174,
45182,
45236,
45244,
45254,
45264,
45274,
45406,
45538,
45543,
45616,
45689,
45731,
45800,
45885,
45911,
45986,
45993,
46003,
46008,
46027,
46055,
46083,
46111,
46123,
46133,
46210,
46217,
46308,
46335,
46359,
46376,
46400,
46494,
46575,
46585,
46609,
46637,
46666,
46679,
46689,
46699,
46717,
46772,
46800,
46814,
46847,
46926,
46937,
46945,
47001,
47009,
47021,
47031,
47038,
47048,
47053,
47072,
47101,
47130,
47159,
47171,
47181,
47215,
47223,
47250,
47271,
47349,
47359,
47395,
47412,
47422,
47427,
47467,
47486,
47517,
47548,
47579,
47591,
47601,
47636,
47644,
47671,
47692,
47770,
47780,
47816,
47833,
47843,
47851,
47856,
47889,
47908,
47931,
47954,
47977,
47989,
47999,
48019,
48029,
48037,
48068,
48113,
48151,
48162,
48204,
48265,
48288,
48297,
48333,
48402,
48412,
48429,
48434,
48511,
48546,
48551,
48593,
48598,
48629,
48671,
48683,
48688,
48693,
48724,
48772,
48784,
48789,
48794,
48825,
48873,
48885,
48890,
48895,
48926,
48972,
48984,
48989,
48994,
49025,
49077,
49089,
49094,
49099,
49171,
49242,
49279,
49305,
49346,
49411,
49421,
49473,
49515,
49523,
49534,
49556,
49564,
49602,
49670,
49730,
49769,
49792,
49800,
49810,
49815,
49851,
49919,
49967,
50003,
50063,
50115,
50140,
50183,
50211,
50221,
50229,
50239,
50300,
50353,
50371,
50379,
50384,
50463,
50477,
50507,
50548,
50595,
50639,
50688,
50734,
50771,
50782,
50880,
50970,
50999,
51010,
51094,
51170,
51199,
51209,
51217,
51269,
51357,
51437,
51497,
51549,
51610,
51663,
51689,
51699,
51709,
51758,
51797,
51822,
51898,
51936,
51946,
51982,
52053,
52113,
52123,
52131,
52141,
52175,
52268,
52353,
52458,
52553,
52583,
52591,
52596,
52601,
52606,
52611,
52616,
52621,
52626,
52631,
52636,
52641,
52646,
52651,
52656,
52661,
52666,
52671,
52676,
52681,
52686,
52691,
52696,
52701,
52706,
52711,
52716,
52730,
52759,
52823,
52918,
52961,
52966,
52971,
52999,
53004,
53021,
53083,
53126,
53150,
53197,
53208,
53253,
53277,
53324,
53335,
53376,
53400,
53451,
53462,
53470,
53480,
53516,
53644,
53762,
53792,
53800,
53805,
53868,
53938,
54022,
54074,
54158,
54238,
54316,
54321,
54326,
54394,
54462,
54492,
54536,
54566,
54592,
54616,
54685,
54756,
54825,
54904,
54976,
55054,
55126,
55202,
55235,
55288,
55329,
55339,
55382,
55407,
55415,
55437,
55472,
55541,
55563,
55589,
55661,
55718,
55739,
55747,
55809,
55878,
55897,
55946,
56003,
56106,
56141,
56211,
56274,
56281,
56318,
56388,
56457,
56464,
56474,
56532,
56545,
56553,
56561,
56571,
56581,
56589,
56599,
56609,
56631,
56636,
56641,
56649,
56702,
56735,
56745,
56811,
56881,
56946,
56998,
57026,
57034,
57042,
57093,
57130,
57135,
57205,
57276,
57340,
57345,
57407,
57412,
57477,
57482,
57559,
57640,
57660,
57673,
57709,
57779,
57847,
57923,
57991,
58010,
58020,
58085,
58115,
58138,
58189,
58197,
58222,
58281,
58344,
58349,
58418,
58482,
58545,
58608,
58701,
58737,
58818,
58856,
58886,
58894,
58899,
58930,
58937,
58947,
58958,
58965,
58975,
59065,
59099,
59177,
59213,
59243,
59251,
59297,
59329,
59368,
59443,
59485,
59524,
59600,
59660,
59713,
59746,
59777,
59789,
59870,
59894,
59899,
59945,
59985,
59990,
60068,
60101,
60142,
60180,
60190,
60211,
60294,
60369,
60377,
60382,
60452,
60526,
60559,
60610,
60651,
60661,
60704,
60756,
60764,
60786,
60821,
60858,
60915,
61021,
61085,
61120,
61151,
61182,
61233,
61248,
61258,
61268,
61278,
61288,
61310,
61315,
61323,
61328,
61379,
61415,
61425,
61491,
61561,
61626,
61678,
61724,
61757,
61765,
61773,
61824,
61861,
61866,
61890,
61912,
61940,
61989,
61999,
62004,
62043,
62051,
62135,
62171,
62227,
62287,
62336,
62377,
62387,
62416,
62477,
62487,
62530,
62555,
62563,
62585,
62620,
62677,
62780,
62811,
62878,
62891,
62899,
62909,
62919,
62941,
62946,
62954,
62962,
62987,
63016,
63063,
63096,
63106,
63151,
63182,
63190,
63195,
63200,
63229,
63239,
63244,
63322,
63404,
63486,
63582,
63623,
63633,
63667,
63688,
63698,
63733,
63745,
63826,
63883,
63908,
63955,
63963,
64009,
64019,
64044,
64052,
64115,
64161,
64193,
64208,
64218,
64263,
64294,
64328,
64336,
64341,
64370,
64398,
64425,
64448,
64458,
64481,
64489,
64517,
64522,
64574,
64645,
64688,
64717,
64765,
64809,
64924,
65029,
65059,
65067,
65075,
65080,
65116,
65151,
65208,
65236,
65246,
65266,
65274,
65282,
65287,
65292,
65335,
65359,
65380,
65385,
65390,
65421,
65453,
65465,
65470,
65475,
65506,
65538,
65550,
65555,
65589,
65594,
65664,
65669,
65674,
65728,
65733,
65738,
65811,
65816,
65821,
65881,
65886,
65891,
65945,
65950,
66015,
66020,
66095,
66167,
66240,
66317,
66361,
66401,
66499,
66549,
66605,
66665,
66716,
66757,
66767,
66798,
66863,
66873,
66916,
66941,
66949,
66971,
67006,
67063,
67166,
67213,
67280,
67293,
67301,
67311,
67321,
67343,
67348,
67356,
67364,
67393,
67424,
67473,
67508,
67518,
67563,
67594,
67602,
67607,
67612,
67620,
67662,
67686,
67767,
67800,
67856,
67916,
67973,
68014,
68024,
68061,
68138,
68148,
68191,
68216,
68224,
68246,
68281,
68338,
68441,
68477,
68544,
68557,
68565,
68575,
68585,
68607,
68612,
68620,
68628,
68669,
68706,
68761,
68802,
68812,
68857,
68888,
68896,
68901,
68940,
68955,
68965,
69011,
69022,
69112,
69184,
69260,
69340,
69412,
69490,
69517,
69527,
69551,
69559,
69569,
69600,
69608,
69613,
69621,
69671,
69676,
69746,
69769,
69824,
69829,
69872,
69877,
69946,
69951,
69956,
69961,
69966,
69971,
69976,
70029,
70034,
70189,
70194,
70199,
70216,
70221,
70226,
70231,
70259,
70273,
70302,
70366,
70461,
70504,
70544,
70640,
70688,
70744,
70804,
70852,
70893,
70903,
70931,
70990,
71000,
71043,
71068,
71076,
71098,
71133,
71190,
71293,
71335,
71402,
71415,
71423,
71433,
71443,
71465,
71470,
71478,
71486,
71509,
71537,
71583,
71615,
71625,
71670,
71701,
71709,
71714,
71719,
71727,
71766,
71784,
71863,
71894,
71950,
72010,
72064,
72105,
72115,
72149,
72220,
72230,
72273,
72298,
72306,
72328,
72363,
72420,
72523,
72554,
72621,
72634,
72642,
72652,
72662,
72684,
72689,
72697,
72705,
72740,
72774,
72826,
72864,
72874,
72919,
72950,
72958,
72963,
72999,
73010,
73020,
73066,
73077,
73167,
73239,
73315,
73395,
73467,
73545,
73572,
73582,
73600,
73608,
73618,
73643,
73651,
73656,
73684,
73724,
73819,
73866,
73922,
73982,
74030,
74071,
74081,
74109,
74168,
74178,
74221,
74246,
74254,
74276,
74311,
74368,
74471,
74512,
74579,
74592,
74600,
74610,
74620,
74642,
74647,
74655,
74663,
74686,
74714,
74760,
74792,
74802,
74847,
74878,
74886,
74891,
74896,
74904,
74912,
74940,
75018,
75048,
75104,
75164,
75212,
75253,
75263,
75291,
75350,
75360,
75385,
75428,
75453,
75461,
75483,
75518,
75575,
75678,
75744,
75770,
75784,
75792,
75816,
75883,
75896,
75904,
75914,
75924,
75946,
75951,
75994,
76061,
76091,
76102,
76129,
76186,
76256,
76328,
76339,
76387,
76395,
76403,
76411,
76419,
76442,
76470,
76516,
76548,
76558,
76603,
76634,
76642,
76647,
76652,
76660,
76688,
76728,
76755,
76763,
76862,
76913,
76969,
77029,
77077,
77118,
77128,
77156,
77215,
77225,
77268,
77293,
77301,
77323,
77358,
77415,
77518,
77563,
77630,
77643,
77651,
77661,
77671,
77693,
77698,
77706,
77714,
77737,
77765,
77811,
77843,
77853,
77898,
77929,
77937,
77942,
77947,
77975,
77985,
77993,
78021,
78039,
78066,
78074,
78158,
78194,
78250,
78310,
78364,
78405,
78415,
78449,
78520,
78530,
78573,
78598,
78606,
78628,
78663,
78720,
78823,
78859,
78926,
78939,
78947,
78957,
78967,
78989,
78994,
79002,
79010,
79045,
79079,
79131,
79169,
79179,
79224,
79255,
79263,
79268,
79273,
79307,
79317,
79322,
79358,
79369,
79379,
79425,
79436,
79526,
79598,
79674,
79754,
79826,
79904,
79931,
79941,
79959,
79967,
79975,
79980,
79988,
79993,
79998,
80094,
80140,
80207,
80255,
80285,
80290,
80342,
80406,
80452,
80496,
80521,
80569,
80599,
80609,
80665,
80711,
80729,
80778,
80804,
80841,
80866,
80914,
80944,
80954,
81010,
81049,
81067,
81116,
81142,
81179,
81204,
81252,
81282,
81292,
81348,
81387,
81405,
81454,
81480,
81485,
81521,
81544,
81556,
81595,
81632,
81659,
81664,
81673,
81686,
81693,
81698,
81705,
81720,
81727,
81739,
81780,
81836,
81906,
81985,
82003,
82086,
82173,
82243,
82250,
82319,
82398,
82464,
82545,
82552,
82621,
82692,
82732,
82749,
82779,
82787,
82809,
82915,
82960,
82970,
82980,
83003,
83008,
83045,
83070,
83118,
83148,
83158,
83214,
83250,
83268,
83317,
83349,
83415,
83492,
83568,
83645,
83662,
83695,
83703,
83739,
83761,
83864,
83872,
83888,
83950,
83974,
83987,
83998,
84070,
84088,
84142,
84150,
84219,
84288,
84354,
84420,
84445,
84458,
84467,
84480,
84490,
84500,
84548,
84553,
84563,
84579,
84587,
84592,
84643,
84680,
84713,
84757,
84797,
84802,
84877,
84923,
84986,
85034,
85066,
85074,
85079,
85108,
85113,
85192,
85244,
85316,
85392,
85468,
85539,
85584,
85614,
85642,
85690,
85720,
85730,
85786,
85813,
85831,
85880,
85915,
85939,
85949,
85995,
86020,
86030,
86100,
86151,
86197,
86255,
86306,
86354,
86384,
86392,
86400,
86408,
86454,
86486,
86491,
86542,
86583,
86662,
86714,
86788,
86866,
86925,
86970,
86975,
87044,
87117,
87146,
87171,
87219,
87249,
87259,
87315,
87343,
87361,
87410,
87442,
87520,
87594,
87668,
87681,
87738,
87774,
87796,
87902,
87962,
87975,
87992,
88002,
88012,
88022,
88122,
88168,
88256,
88304,
88334,
88342,
88347,
88380,
88436,
88478,
88483,
88511,
88537,
88560,
88630,
88704,
88751,
88792,
88802,
88838,
88861,
88873,
88912,
88949,
88976,
88981,
88990,
89003,
89010,
89015,
89022,
89037,
89044,
89056,
89091,
89123,
89148,
89196,
89226,
89236,
89292,
89323,
89341,
89390,
89422,
89481,
89518,
89540,
89632,
89686,
89699,
89709,
89719,
89729,
89773,
89813,
89818,
89910,
89956,
90036,
90084,
90114,
90122,
90127,
90178,
90186,
90242,
90284,
90310,
90333,
90416,
90503,
90558,
90599,
90609,
90645,
90668,
90680,
90719,
90756,
90783,
90788,
90797,
90810,
90817,
90839,
90853,
90865,
90870,
90877,
90892,
90899,
90911,
90942,
90974,
90999,
91047,
91077,
91087,
91143,
91184,
91202,
91249,
91273,
91299,
91348,
91379,
91415,
91443,
91487,
91512,
91522,
91566,
91606,
91611,
91635,
91643,
91648,
91714,
91757,
91762,
91770,
91834,
91884,
91935,
91969,
91997,
92063,
92133,
92183,
92224,
92234,
92279,
92305,
92329,
92346,
92382,
92405,
92417,
92456,
92493,
92520,
92525,
92534,
92547,
92554,
92559,
92566,
92581,
92588,
92600,
92631,
92663,
92688,
92736,
92766,
92776,
92832,
92873,
92891,
92938,
92962,
92988,
93037,
93068,
93104,
93132,
93176,
93201,
93211,
93255,
93295,
93300,
93315,
93351,
93374,
93386,
93425,
93462,
93489,
93494,
93503,
93516,
93523,
93528,
93535,
93550,
93557,
93569,
93600,
93632,
93657,
93705,
93735,
93745,
93801,
93842,
93860,
93907,
93931,
93957,
94006,
94037,
94073,
94101,
94145,
94152,
94162,
94206,
94246,
94251,
94296,
94313,
94349,
94372,
94384,
94423,
94460,
94487,
94492,
94501,
94514,
94521,
94526,
94533,
94548,
94555,
94567,
94598,
94630,
94655,
94703,
94733,
94743,
94799,
94840,
94858,
94905,
94929,
94955,
95004,
95035,
95071,
95099,
95143,
95168,
95178,
95222,
95262,
95267,
95272,
95280,
95285,
95351,
95359,
95364,
95430,
95438,
95443,
95509,
95554,
95562,
95621,
95666,
95709,
95737,
95781,
95813,
95834,
95844,
95861,
95869,
95879,
95911,
95929,
95939,
95952,
95960,
95968,
96044,
96124,
96176,
96217,
96227,
96253,
96273,
96309,
96332,
96344,
96383,
96420,
96447,
96472,
96496,
96524,
96551,
96629,
96657,
96716,
96743,
96758,
96770,
96777,
96795,
96802,
96866,
96873,
96887,
96903,
96924,
96956,
96973,
96988,
96995,
97000,
97073,
97149,
97227,
97299,
97374,
97451,
97487,
97534,
97539,
97623,
97671,
97695,
97743,
97748,
97781,
97817,
97856,
97946,
97961,
97979,
97988,
98001,
98008,
98076,
98083,
98098,
98105,
98117,
98178,
98231,
98239,
98269,
98300,
98332,
98357,
98405,
98435,
98445,
98501,
98542,
98560,
98607,
98631,
98657,
98706,
98737,
98773,
98801,
98845,
98876,
98886,
98930,
98970,
98975,
98980,
98988,
98993,
99042,
99092,
99102,
99130,
99150,
99155,
99163,
99183,
99218,
99226,
99280,
99323,
99333,
99387,
99430,
99438,
99471,
99532,
99582,
99592,
99597,
99602,
99616,
99645,
99709,
99804,
99847,
99884,
99889,
99944,
99949,
99954,
99980,
100008,
100023,
100039,
100061,
100070,
100143,
100224,
100309,
100330,
100346,
100367,
100408,
100445,
100509,
100570,
100640,
100708,
100762,
100855,
100880,
100896,
100916,
100924,
100963,
101003,
101043,
101110,
101136,
101156,
101176,
101184,
101192,
101197,
101202,
101256,
101296,
101322,
101327,
101388,
101449,
101493,
101501,
101506,
101563,
101601,
101625,
101633,
101690,
101707,
101728,
101738,
101758,
101776,
101784,
101789,
101794,
101799,
101834,
101839,
101909,
101983,
102053,
102094,
102104,
102165,
102237,
102310,
102381,
102457,
102471,
102495,
102569,
102604,
102639,
102660,
102732,
102802,
102873,
102945,
103014,
103032,
103047,
103052,
103098,
103142,
103216,
103224,
103266,
103335,
103405,
103475,
103482,
103556,
103627,
103681,
103705,
103735,
103790,
103858,
103893,
103920,
103930,
104006,
104011,
104033,
104052,
104121,
104167,
104224,
104238,
104248,
104259,
104267,
104275,
104295,
104305,
104374,
104447,
104498,
104525,
104586,
104645,
104722,
104756,
104817,
104878,
104949,
105003,
105076,
105149,
105206,
105262,
105339,
105380,
105440,
105488,
105558,
105608,
105619,
105627,
105635,
105645,
105650,
105661,
105686,
105696,
105742,
105750,
105755,
105763,
105842,
105907,
105967,
105972,
105980,
106030,
106095,
106120,
106149,
106159,
106187,
106213,
106221,
106226,
106231,
106236,
106265,
106273,
106357,
106393,
106449,
106509,
106558,
106599,
106609,
106638,
106699,
106709,
106752,
106777,
106785,
106807,
106842,
106899,
107002,
107033,
107100,
107113,
107121,
107131,
107141,
107163,
107168,
107176,
107184,
107209,
107238,
107285,
107318,
107328,
107373,
107404,
107412,
107417,
107422,
107451,
107461,
107492,
107497,
107532,
107562,
107570,
107587,
107606,
107628,
107651,
107686,
107716,
107742,
107750,
107777,
107803,
107815,
107824,
107841,
107848,
107886,
107893,
107905,
107938,
107963,
108011,
108041,
108051,
108107,
108142,
108160,
108209,
108235,
108299,
108367,
108421,
108462,
108472,
108477,
108508,
108540,
108572,
108603,
108613,
108696,
108769,
108799,
108807,
108815,
108878,
108927,
108969,
108974,
109012,
109067,
109126,
109174,
109215,
109225,
109230,
109254,
109287,
109322,
109356,
109392,
109422,
109434,
109484,
109513,
109538,
109586,
109616,
109626,
109682,
109720,
109738,
109785,
109809,
109835,
109884,
109915,
109951,
109979,
110019,
110060,
110087,
110097,
110141,
110181,
110186,
110191,
110199,
110204,
110281,
110322,
110375,
110385,
110409,
110414,
110422,
110479,
110522,
110591,
110599,
110604,
110609,
110680,
110755,
110819,
110860,
110870,
110948,
111022,
111099,
111137,
111161,
111195,
111231,
111261,
111291,
111303,
111353,
111382,
111407,
111455,
111485,
111495,
111551,
111589,
111607,
111654,
111678,
111704,
111753,
111784,
111820,
111848,
111888,
111929,
111968,
111978,
112022,
112062,
112067,
112072,
112080,
112085,
112162,
112203,
112227,
112232,
112240,
112313,
112372,
112428,
112433,
112465,
112495,
112507,
112512,
112520,
112561,
112566,
112574,
112611,
112619,
112703,
112739,
112795,
112855,
112905,
112946,
112956,
112986,
113049,
113059,
113102,
113127,
113135,
113157,
113192,
113249,
113352,
113384,
113451,
113464,
113472,
113482,
113492,
113514,
113519,
113527,
113535,
113562,
113592,
113640,
113674,
113684,
113729,
113760,
113768,
113773,
113778,
113808,
113818,
113854,
113859,
113945,
113983,
114039,
114099,
114163,
114204,
114214,
114247,
114271,
114374,
114382,
114390,
114433,
114458,
114466,
114488,
114523,
114580,
114683,
114749,
114816,
114829,
114837,
114847,
114857,
114879,
114884,
114892,
114902,
114910,
114965,
115009,
115071,
115119,
115129,
115174,
115205,
115213,
115218,
115223,
115228,
115233,
115292,
115355,
115406,
115447,
115457,
115491,
115513,
115549,
115572,
115584,
115623,
115660,
115687,
115692,
115755,
115818,
115885,
115909,
115925,
115937,
115956,
115965,
115978,
115985,
116006,
116013,
116028,
116035,
116047,
116097,
116126,
116151,
116199,
116229,
116239,
116295,
116333,
116351,
116398,
116422,
116448,
116497,
116528,
116564,
116592,
116632,
116673,
116699,
116709,
116753,
116793,
116798,
116823,
116831,
116836,
116913,
116954,
116988,
116996,
117056,
117102,
117145,
117176,
117201,
117213,
117218,
117240,
117245,
117253,
117258,
117263,
117268,
117343,
117422,
117489,
117530,
117540,
117574,
117603,
117639,
117662,
117674,
117713,
117750,
117777,
117782,
117845,
117908,
117975,
117999,
118015,
118027,
118055,
118064,
118077,
118084,
118114,
118121,
118136,
118143,
118155,
118205,
118234,
118259,
118307,
118337,
118347,
118403,
118441,
118459,
118506,
118530,
118556,
118605,
118636,
118672,
118700,
118740,
118781,
118823,
118833,
118877,
118917,
118922,
118963,
118971,
118976,
119053,
119094,
119128,
119136,
119212,
119274,
119333,
119364,
119396,
119408,
119413,
119442,
119447,
119455,
119460,
119518,
119528,
119533,
119603,
119677,
119739,
119780,
119790,
119824,
119848,
119884,
119907,
119919,
119958,
119995,
120022,
120027,
120090,
120153,
120220,
120244,
120260,
120272,
120300,
120309,
120322,
120329,
120359,
120366,
120381,
120388,
120400,
120450,
120479,
120504,
120552,
120582,
120592,
120648,
120686,
120704,
120751,
120775,
120801,
120850,
120881,
120917,
120945,
120985,
121026,
121063,
121073,
121117,
121157,
121162,
121198,
121206,
121211,
121288,
121329,
121363,
121371,
121442,
121499,
121553,
121584,
121611,
121623,
121628,
121652,
121657,
121665,
121670,
121678,
121683,
121724,
121729,
121734,
121776,
121818,
121841,
121851,
121868,
121876,
121881,
121886,
121891,
121979,
122019,
122075,
122135,
122193,
122234,
122244,
122271,
122295,
122386,
122394,
122402,
122445,
122480,
122509,
122517,
122539,
122574,
122631,
122734,
122794,
122861,
122874,
122882,
122892,
122902,
122924,
122929,
122937,
122947,
122955,
122998,
123036,
123092,
123134,
123144,
123189,
123220,
123228,
123233,
123238,
123276,
123316,
123358,
123394,
123429,
123465,
123498,
123565,
123636,
123695,
123736,
123746,
123780,
123802,
123838,
123861,
123873,
123912,
123949,
123976,
123981,
124044,
124107,
124174,
124198,
124214,
124226,
124253,
124262,
124275,
124282,
124311,
124318,
124333,
124340,
124352,
124402,
124431,
124456,
124504,
124534,
124544,
124600,
124638,
124656,
124703,
124727,
124753,
124802,
124833,
124869,
124897,
124937,
124978,
125012,
125022,
125066,
125106,
125111,
125144,
125152,
125157,
125234,
125275,
125309,
125317,
125385,
125439,
125490,
125509,
125517,
125522,
125592,
125666,
125728,
125769,
125779,
125813,
125846,
125882,
125905,
125917,
125956,
125993,
126020,
126025,
126088,
126151,
126218,
126242,
126258,
126270,
126298,
126307,
126320,
126327,
126357,
126364,
126379,
126386,
126398,
126448,
126477,
126502,
126550,
126580,
126590,
126646,
126684,
126702,
126749,
126773,
126799,
126848,
126879,
126915,
126943,
126983,
127024,
127061,
127071,
127115,
127155,
127160,
127196,
127204,
127209,
127286,
127327,
127361,
127369,
127440,
127497,
127551,
127581,
127589,
127594,
127671,
127752,
127821,
127862,
127872,
127906,
127940,
127976,
127999,
128011,
128050,
128087,
128114,
128119,
128182,
128245,
128312,
128336,
128352,
128364,
128398,
128407,
128420,
128427,
128463,
128470,
128485,
128492,
128504,
128554,
128583,
128608,
128656,
128686,
128696,
128752,
128790,
128808,
128855,
128879,
128905,
128954,
128985,
129021,
129049,
129089,
129130,
129174,
129184,
129228,
129268,
129273,
129316,
129324,
129329,
129406,
129447,
129481,
129489,
129567,
129631,
129692,
129723,
129731,
129736,
129744,
129749,
129776,
129809,
129838,
129874,
129897,
129924,
129929,
129998,
130071,
130132,
130173,
130183,
130217,
130249,
130285,
130308,
130320,
130359,
130396,
130423,
130428,
130491,
130554,
130621,
130645,
130661,
130673,
130701,
130710,
130723,
130730,
130760,
130767,
130782,
130789,
130801,
130851,
130880,
130905,
130953,
130983,
130993,
131049,
131087,
131105,
131152,
131176,
131202,
131251,
131282,
131318,
131346,
131386,
131427,
131463,
131473,
131517,
131557,
131562,
131597,
131605,
131610,
131687,
131728,
131762,
131770,
131840,
131896,
131949,
131954,
131959,
131991,
132014,
132026,
132031,
132097,
132167,
132225,
132266,
132276,
132310,
132344,
132380,
132403,
132415,
132454,
132491,
132518,
132523,
132586,
132649,
132716,
132740,
132756,
132768,
132793,
132802,
132815,
132822,
132849,
132856,
132871,
132878,
132890,
132940,
132969,
132994,
133042,
133072,
133082,
133138,
133176,
133194,
133241,
133265,
133291,
133340,
133371,
133407,
133435,
133475,
133516,
133549,
133559,
133603,
133643,
133648,
133680,
133688,
133693,
133770,
133811,
133845,
133853,
133920,
133973,
134023,
134028,
134060,
134087,
134099,
134104,
134112,
134117,
134184,
134255,
134314,
134355,
134365,
134399,
134433,
134469,
134492,
134504,
134543,
134580,
134607,
134612,
134675,
134738,
134805,
134829,
134845,
134857,
134883,
134892,
134905,
134912,
134940,
134947,
134962,
134969,
134981,
135031,
135060,
135085,
135133,
135163,
135173,
135229,
135267,
135285,
135332,
135356,
135382,
135431,
135462,
135498,
135526,
135566,
135607,
135641,
135651,
135695,
135735,
135740,
135773,
135781,
135786,
135863,
135904,
135938,
135946,
136014,
136068,
136119,
136124,
136156,
136184,
136196,
136201,
136209,
136214,
136280,
136350,
136408,
136449,
136459,
136493,
136527,
136563,
136586,
136598,
136637,
136674,
136701,
136706,
136769,
136832,
136899,
136923,
136939,
136951,
136976,
136985,
136998,
137005,
137032,
137039,
137054,
137061,
137073,
137123,
137152,
137177,
137225,
137255,
137265,
137321,
137359,
137377,
137424,
137448,
137474,
137523,
137554,
137590,
137618,
137658,
137699,
137732,
137742,
137786,
137826,
137831,
137863,
137871,
137876,
137953,
137994,
138028,
138036,
138103,
138156,
138206,
138211,
138243,
138270,
138282,
138287,
138295,
138300,
138368,
138440,
138500,
138541,
138551,
138585,
138619,
138655,
138678,
138690,
138729,
138766,
138793,
138798,
138861,
138924,
138991,
139015,
139031,
139043,
139070,
139079,
139092,
139099,
139128,
139135,
139150,
139157,
139169,
139219,
139248,
139273,
139321,
139351,
139361,
139417,
139455,
139473,
139520,
139544,
139570,
139619,
139650,
139686,
139714,
139754,
139795,
139830,
139840,
139884,
139924,
139929,
139963,
139971,
139976,
140053,
140094,
140128,
140136,
140205,
140260,
140312,
140317,
140349,
140378,
140390,
140395,
140403,
140408,
140480,
140556,
140620,
140661,
140671,
140705,
140739,
140775,
140798,
140810,
140849,
140886,
140913,
140918,
140981,
141044,
141111,
141135,
141151,
141163,
141194,
141203,
141216,
141223,
141256,
141263,
141278,
141285,
141297,
141347,
141376,
141401,
141449,
141479,
141489,
141545,
141583,
141601,
141648,
141672,
141698,
141747,
141778,
141814,
141842,
141882,
141923,
141962,
141972,
142016,
142056,
142061,
142099,
142107,
142112,
142189,
142230,
142264,
142272,
142345,
142404,
142460,
142465,
142497,
142530,
142542,
142547,
142555,
142560,
142565,
142622,
142632,
142703,
142778,
142841,
142882,
142892,
142926,
142960,
142996,
143019,
143031,
143070,
143107,
143134,
143139,
143202,
143265,
143332,
143356,
143372,
143384,
143414,
143423,
143436,
143443,
143475,
143482,
143497,
143504,
143516,
143566,
143595,
143620,
143668,
143698,
143708,
143764,
143802,
143820,
143867,
143891,
143917,
143966,
143997,
144033,
144061,
144101,
144142,
144180,
144190,
144234,
144274,
144279,
144316,
144324,
144329,
144406,
144447,
144481,
144489,
144561,
144619,
144674,
144679,
144711,
144743,
144755,
144760,
144768,
144773,
144781,
144833,
144843,
144915,
144991,
145055,
145096,
145106,
145140,
145174,
145210,
145233,
145245,
145284,
145321,
145348,
145353,
145416,
145479,
145546,
145570,
145586,
145598,
145629,
145638,
145651,
145658,
145691,
145698,
145713,
145720,
145732,
145782,
145811,
145836,
145884,
145914,
145924,
145980,
146018,
146036,
146083,
146107,
146133,
146182,
146213,
146249,
146277,
146317,
146358,
146397,
146407,
146451,
146491,
146496,
146534,
146542,
146547,
146624,
146665,
146699,
146707,
146780,
146839,
146895,
146900,
146932,
146965,
146977,
146982,
146990,
146995,
147003,
147032,
147037,
147045,
147050,
147055,
147082,
147111,
147149,
147170,
147180,
147207,
147215,
147220,
147225,
147230,
147235,
147240,
147272,
147286,
147315,
147379,
147474,
147517,
147590,
147667,
147717,
147764,
147774,
147782,
147811,
147860,
147901,
147911,
147965,
148027,
148035,
148060,
148102,
148110,
148177,
148219,
148288,
148345,
148416,
148488,
148524,
148547,
148559,
148598,
148635,
148662,
148683,
148709,
148720,
148746,
148758,
148776,
148788,
148833,
148858,
148906,
148936,
148946,
149002,
149056,
149074,
149121,
149145,
149171,
149220,
149262,
149321,
149349,
149362,
149369,
149379,
149423,
149463,
149468,
149505,
149519,
149527,
149532,
149573,
149578,
149648,
149680,
149716,
149739,
149751,
149790,
149827,
149854,
149887,
149899,
149944,
149969,
150017,
150047,
150057,
150113,
150167,
150185,
150232,
150256,
150282,
150331,
150373,
150432,
150460,
150473,
150514,
150528,
150538,
150582,
150622,
150627,
150653,
150674,
150685,
150693,
150698,
150739,
150744,
150754,
150829,
150870,
150899,
150910,
150918,
150923,
150933,
150958,
150963,
150971,
150996,
151006,
151031,
151039,
151086,
151119,
151144,
151186,
151194,
151261,
151303,
151372,
151429,
151500,
151572,
151608,
151631,
151643,
151682,
151719,
151746,
151767,
151793,
151804,
151830,
151842,
151860,
151872,
151917,
151942,
151990,
152020,
152030,
152086,
152140,
152158,
152205,
152229,
152255,
152304,
152346,
152405,
152433,
152446,
152453,
152463,
152507,
152547,
152552,
152589,
152603,
152611,
152616,
152657,
152662,
152732,
152764,
152800,
152823,
152835,
152874,
152911,
152938,
152971,
152983,
153028,
153053,
153101,
153131,
153141,
153197,
153251,
153269,
153316,
153340,
153366,
153415,
153457,
153516,
153544,
153557,
153598,
153612,
153622,
153666,
153706,
153711,
153737,
153758,
153769,
153777,
153782,
153823,
153828,
153838,
153913,
153954,
153983,
153990,
154000,
154081,
154127,
154196,
154244,
154274,
154282,
154287,
154301,
154330,
154394,
154489,
154532,
154537,
154542,
154625,
154712,
154762,
154803,
154813,
154880,
154910,
154953,
155003,
155044,
155054,
155084,
155155,
155198,
155251,
155259,
155281,
155316,
155351,
155408,
155457,
155533,
155597,
155632,
155678,
155690,
155750,
155758,
155774,
155827,
155840,
155848,
155901,
155938,
155974,
156008,
156115,
156179,
156214,
156269,
156335,
156372,
156404,
156412,
156467,
156503,
156513,
156576,
156586,
156591,
156596,
156632,
156642,
156652,
156657,
156667,
156689,
156694,
156699,
156707,
156712,
156741,
156771,
156894,
157007,
157037,
157045,
157050,
157060,
157087,
157095,
157100,
157105,
157113,
157172,
157217,
157246,
157251,
157256,
157309,
157366,
157417,
157458,
157468,
157518,
157556,
157566,
157628,
157659,
157697,
157748,
157789,
157799,
157830,
157901,
157944,
157997,
158005,
158027,
158062,
158092,
158149,
158199,
158277,
158342,
158378,
158425,
158437,
158500,
158508,
158524,
158577,
158590,
158598,
158651,
158688,
158724,
158759,
158843,
158907,
158942,
158998,
159064,
159103,
159136,
159144,
159199,
159235,
159245,
159308,
159318,
159323,
159328,
159365,
159375,
159385,
159390,
159400,
159422,
159427,
159432,
159440,
159445,
159476,
159507,
159630,
159743,
159773,
159781,
159786,
159796,
159825,
159833,
159838,
159843,
159851,
159859,
159919,
159965,
159996,
160001,
160006,
160073,
160144,
160196,
160237,
160247,
160283,
160306,
160318,
160357,
160394,
160421,
160446,
160471,
160496,
160520,
160525,
160534,
160547,
160554,
160559,
160566,
160581,
160588,
160600,
160631,
160663,
160688,
160736,
160766,
160776,
160832,
160873,
160891,
160938,
160962,
160988,
161037,
161068,
161104,
161132,
161176,
161203,
161213,
161257,
161297,
161302,
161328,
161336,
161341,
161407,
161412,
161456,
161523,
161559,
161582,
161594,
161633,
161670,
161697,
161722,
161727,
161739,
161788,
161831,
161838,
161848,
161874,
161882,
161903,
161908,
161916,
161921,
161965,
162032,
162068,
162091,
162103,
162142,
162179,
162206,
162231,
162236,
162248,
162297,
162338,
162345,
162355,
162381,
162389,
162410,
162415,
162423,
162428,
162472,
162548,
162592,
162599,
162609,
162645,
162668,
162680,
162719,
162756,
162783,
162807,
162832,
162866,
162918,
162982,
162993,
163020,
163055,
163092,
163128,
163187,
163199,
163204,
163260,
163269,
163282,
163289,
163301,
163332,
163372,
163408,
163423,
163438,
163445,
163457,
163487,
163516,
163541,
163589,
163619,
163629,
163685,
163713,
163731,
163780,
163841,
163869,
163917,
163947,
163957,
164013,
164040,
164058,
164107,
164142,
164149,
164159,
164221,
164265,
164305,
164310,
164335,
164361,
164369,
164480,
164488,
164493,
164498,
164506,
164514,
164575,
164622,
164666,
164671,
164703,
164731,
164743,
164748,
164756,
164761,
164823,
164828,
164833,
164838,
164843,
164848,
164853,
164858,
164863,
164868,
164952,
164986,
164994,
165057,
165115,
165177,
165256,
165297,
165307,
165343,
165366,
165378,
165417,
165454,
165481,
165507,
165512,
165539,
165551,
165582,
165614,
165639,
165687,
165717,
165727,
165783,
165824,
165842,
165889,
165913,
165939,
165988,
166019,
166055,
166083,
166127,
166157,
166167,
166211,
166251,
166256,
166285,
166293,
166298,
166364,
166372,
166417,
166467,
166503,
166561,
166592,
166645,
166657,
166662,
166670,
166675,
166685,
166690,
166695,
166700,
166705,
166710,
166757,
166765,
166828,
166907,
166965,
167027,
167106,
167147,
167155,
167200,
167250,
167286,
167296,
167329,
167393,
167461,
167497,
167520,
167532,
167571,
167608,
167635,
167661,
167688,
167700,
167731,
167763,
167788,
167836,
167866,
167876,
167932,
167973,
167991,
168038,
168062,
168088,
168137,
168168,
168204,
168232,
168276,
168304,
168314,
168358,
168398,
168403,
168430,
168438,
168443,
168509,
168571,
168619,
168624,
168654,
168717,
168784,
168820,
168843,
168855,
168894,
168931,
168958,
168985,
168997,
169042,
169067,
169115,
169145,
169155,
169211,
169265,
169283,
169330,
169354,
169380,
169429,
169471,
169530,
169558,
169571,
169598,
169608,
169652,
169692,
169697,
169723,
169731,
169736,
169777,
169838,
169885,
169890,
169925,
170001,
170016,
170127,
170230,
170323,
170408,
170435,
170443,
170459,
170545,
170623,
170718,
170805,
170891,
170969,
171067,
171157,
171254,
171343,
171447,
171543,
171564,
171612,
171660,
171708,
171720,
171762,
171770,
171780,
171838,
171900,
171979,
172020,
172030,
172076,
172084,
172129,
172179,
172215,
172220,
172228,
172286,
172317,
172370,
172382,
172387,
172395,
172400,
172410,
172415,
172420,
172490,
172564,
172642,
172690,
172731,
172741,
172777,
172800,
172812,
172851,
172888,
172915,
172920,
172929,
172942,
172949,
173007,
173032,
173072,
173101,
173124,
173164,
173195,
173212,
173258,
173289,
173334,
173374,
173445,
173509,
173528,
173559,
173592,
173630,
173644,
173671,
173711,
173751,
173765,
173821,
173826,
173841,
173863,
173870,
173949,
173974,
174003,
174015,
174022,
174094,
174124,
174141,
174151,
174158,
174206,
174282,
174326,
174354,
174361,
174414,
174439,
174464,
174471,
174502,
174514,
174519,
174526,
174541,
174548,
174560,
174591,
174623,
174648,
174696,
174726,
174736,
174792,
174833,
174851,
174898,
174922,
174948,
174997,
175028,
175064,
175092,
175136,
175159,
175169,
175213,
175253,
175258,
175280,
175288,
175293,
175359,
175367,
175424,
175467,
175506,
175511,
175543,
175562,
175574,
175579,
175587,
175592,
175646,
175704,
175753,
175794,
175804,
175827,
175876,
175912,
175935,
175947,
175986,
176023,
176050,
176075,
176099,
176151,
176189,
176201,
176206,
176218,
176249,
176281,
176306,
176354,
176384,
176394,
176450,
176491,
176509,
176556,
176580,
176606,
176655,
176686,
176722,
176750,
176794,
176821,
176831,
176875,
176915,
176920,
176925,
176933,
176938,
177004,
177047,
177057,
177062,
177070,
177128,
177172,
177177,
177182,
177211,
177233,
177241,
177270,
177289,
177322,
177332,
177363,
177388,
177416,
177428,
177440,
177448,
177458,
177463,
177517,
177575,
177627,
177668,
177678,
177714,
177737,
177749,
177788,
177825,
177852,
177878,
177913,
177922,
177935,
177942,
177972,
177987,
178020,
178035,
178042,
178057,
178064,
178076,
178107,
178139,
178164,
178212,
178242,
178252,
178308,
178349,
178367,
178414,
178438,
178464,
178513,
178544,
178580,
178608,
178652,
178679,
178689,
178733,
178773,
178778,
178804,
178812,
178817,
178883,
178891,
178952,
178999,
179043,
179050,
179060,
179065,
179096,
179129,
179141,
179146,
179154,
179159,
179253,
179351,
179403,
179444,
179454,
179490,
179513,
179525,
179564,
179601,
179628,
179656,
179683,
179706,
179711,
179720,
179733,
179740,
179766,
179781,
179788,
179803,
179810,
179822,
179853,
179885,
179910,
179958,
179988,
179998,
180054,
180095,
180113,
180160,
180184,
180210,
180259,
180290,
180326,
180354,
180398,
180425,
180435,
180479,
180519,
180524,
180550,
180558,
180563,
180629,
180637,
180698,
180745,
180789,
180794,
180826,
180860,
180872,
180877,
180885,
180890,
180895,
180932,
180937,
180942,
180947,
180988,
180996,
181052,
181108,
181168,
181244,
181285,
181295,
181331,
181354,
181366,
181405,
181442,
181469,
181556,
181621,
181662,
181667,
181743,
181797,
181864,
181922,
181927,
181948,
181974,
181985,
182011,
182023,
182028,
182049,
182054,
182117,
182180,
182247,
182271,
182287,
182299,
182322,
182395,
182462,
182530,
182592,
182606,
182618,
182623,
182632,
182645,
182652,
182677,
182684,
182699,
182706,
182718,
182768,
182797,
182822,
182870,
182900,
182910,
182966,
183004,
183022,
183069,
183093,
183119,
183168,
183199,
183235,
183263,
183303,
183344,
183371,
183381,
183425,
183465,
183470,
183496,
183504,
183509,
183586,
183627,
183635,
183677,
183727,
183763,
183818,
183849,
183900,
183912,
183917,
183925,
183935,
183940,
183945,
183975,
184047,
184119,
184193,
184268,
184316,
184323,
184397,
184445,
184452,
184524,
184597,
184622,
184627,
184639,
184644,
184721,
184798,
184848,
184920,
184997,
185004,
185089,
185116,
185140,
185157,
185181,
185275,
185356,
185366,
185390,
185418,
185447,
185460,
185470,
185480,
185485,
185503,
185552,
185580,
185647,
185713,
185727,
185748,
185821,
185832,
185840,
185914,
185970,
185978,
185990,
186000,
186009,
186020,
186044,
186057,
186069,
186130,
186141,
186180,
186203,
186270,
186306,
186350,
186411,
186464,
186496,
186506,
186582,
186650,
186658,
186666,
186687,
186692,
186750,
186786,
186847,
186852,
186878,
186883,
186900,
186919,
186982,
187043,
187091,
187135,
187204,
187273,
187336,
187396,
187406,
187431,
187436,
187465,
187470,
187475,
187541,
187620,
187691,
187758,
187831,
187861,
187869,
187951,
188038,
188109,
188184,
188257,
188287,
188295,
188300,
188340,
188381,
188434,
188492,
188542,
188576,
188591,
188619,
188679,
188746,
188795,
188800,
188817,
188842,
188866,
188901,
188913,
188918,
188954,
188987,
189019,
189052,
189057,
189090,
189136,
189211,
189227,
189242,
189309,
189364,
189397,
189423,
189433,
189469,
189499,
189509,
189514,
189522,
189527,
189532,
189537,
189542,
189563,
189609,
189657,
189705,
189753,
189784,
189829,
189834,
189867,
189917,
189951,
189982,
190006,
190071,
190095,
190105,
190127,
190135,
190156,
190164,
190169,
190205,
190268,
190288,
190298,
190318,
190326,
190331,
190336,
190347,
190423,
190489,
190564,
190613,
190626,
190633,
190655,
190660,
190739,
190755,
190786,
190832,
190857,
190865,
190887,
190922,
190981,
190991,
191013,
191018,
191026,
191036,
191112,
191169,
191206,
191224,
191232,
191269,
191357,
191384,
191392,
191397,
191442,
191479,
191544,
191554,
191568,
191582,
191596,
191601,
191623,
191644,
191721,
191795,
191821,
191829,
191903,
191939,
191949,
192011,
192019,
192029,
192034,
192067,
192111,
192164,
192182,
192192,
192211,
192219,
192224,
192309,
192335,
192345,
192368,
192376,
192381,
192386,
192417,
192453,
192503,
192532,
192574,
192593,
192629,
192641,
192648,
192655,
192677,
192689,
192696,
192703,
192724,
192736,
192743,
192750,
192768,
192773,
192788,
192810,
192815,
192820,
192825,
192850,
192875,
192923,
192983,
192988,
193058,
193130,
193202,
193269,
193339,
193412,
193437,
193506,
193574,
193626,
193640,
193647,
193665,
193686,
193697,
193720,
193734,
193741,
193754,
193761,
193772,
193829,
193841,
193856,
193881,
193914,
194001,
194031,
194036,
194110,
194179,
194249,
194274,
194322,
194332,
194339,
194344,
194349,
194427,
194451,
194461,
194483,
194491,
194496,
194525,
194550,
194560,
194586,
194643,
194665,
194677,
194685,
194704,
194714,
194719,
194763,
194816,
194834,
194844,
194863,
194871,
194876,
194917,
194950,
194984,
194994,
195016,
195038,
195046,
195069,
195120,
195141,
195179,
195244,
195322,
195375,
195448,
195469,
195519,
195535,
195545,
195566,
195574,
195638,
195672,
195677,
195714,
195732,
195742,
195774,
195796,
195804,
195809,
195849,
195874,
195884,
195923,
195945,
195955,
195976,
195984,
196001,
196022,
196049,
196070,
196080,
196096,
196117,
196128,
196184,
196218,
196231,
196238,
196246,
196278,
196283,
196344,
196430,
196435,
196501,
196560,
196565,
196570,
196585,
196590,
196661,
196733,
196771,
196785,
196849,
196914,
196919,
196953,
196991,
197025,
197065,
197078,
197083,
197137,
197144,
197149,
197161,
197166,
197201,
197247,
197284,
197325,
197368,
197373,
197385,
197390,
197426,
197446,
197512,
197540,
197545,
197580,
197585,
197628,
197706,
197754,
197800,
197869,
197897,
197942,
197972,
198019,
198024,
198050,
198069,
198074,
198102,
198123,
198128,
198157,
198179,
198184,
198229,
198234,
198246,
198281,
198304,
198338,
198393,
198482,
198487,
198542,
198620,
198688,
198693,
198715,
198737,
198761,
198785,
198797,
198802,
198838,
198915,
198985,
199009,
199033,
199041,
199057,
199069,
199113,
199159,
199175,
199183,
199191,
199209,
199227,
199247,
199255,
199265,
199270,
199294,
199326,
199404,
199428,
199501,
199537,
199587,
199603,
199638,
199653,
199698,
199728,
199771,
199786,
199835,
199865,
199882,
199926,
199975,
200024,
200056,
200083,
200117,
200176,
200243,
200266,
200271,
200296,
200352,
200401,
200434,
200439,
200489,
200520,
200525,
200535,
200546,
200556,
200561,
200591,
200596,
200624,
200646,
200711,
200719,
200724,
200736,
200771,
200801,
200930,
200955,
200980,
201073,
201081,
201086,
201098,
201134,
201158,
201165,
201175,
201237,
201264,
201276,
201296,
201307,
201312,
201324,
201359,
201366,
201387,
201394,
201449,
201454,
201466,
201471,
201507,
201512,
201542,
201590,
201598,
201629,
201691,
201749,
201823,
201885,
201957,
202025,
202105,
202201,
202265,
202270,
202352,
202421,
202453,
202463,
202473,
202478,
202483,
202565,
202636,
202715,
202750,
202782,
202850,
202924,
203001,
203009,
203014,
203091,
203173,
203246,
203292,
203377,
203452,
203467,
203474,
203484,
203510,
203593,
203602,
203646,
203653,
203707,
203712,
203719,
203785,
203823,
203833,
203840,
203866,
203899,
203909,
203916,
203978,
204005,
204012,
204017,
204024,
204080,
204087,
204092,
204161,
204224,
204262,
204267,
204279,
204284,
204289,
204294,
204317,
204377,
204411,
204438,
204483,
204524,
204571,
204618,
204663,
204714,
204753,
204782,
204843,
204872,
204903,
204940,
204979,
205010,
205047,
205092,
205135,
205172,
205215,
205244,
205275,
205306,
205335,
205364,
205391,
205420,
205455,
205484,
205509,
205538,
205567,
205596,
205621,
205660,
205697,
205738,
205785,
205830,
205871,
205904,
205939,
205970,
206001,
206032,
206065,
206098,
206135,
206168,
206205,
206232,
206291,
206322,
206345,
206378,
206425,
206452,
206483,
206518,
206539,
206568,
206599,
206632,
206665,
206694,
206723,
206752,
206791,
206826,
206863,
206902,
206947,
206982,
207035,
207090,
207113,
207160,
207189,
207214,
207243,
207296,
207337,
207372,
207409,
207440,
207463,
207488,
207515,
207546,
207581,
207593,
207598,
207680,
207691,
207720,
207793,
207856,
207886,
207896,
207946,
207954,
207964,
207969,
208032,
208064,
208114,
208145,
208153,
208158,
208193,
208237,
208275,
208287,
208298,
208335,
208366,
208374,
208383,
208412,
208428,
208484,
208524,
208550,
208585,
208595,
208614,
208631,
208643,
208648,
208653,
208725,
208802,
208879,
208946,
208981,
209015,
209040,
209065,
209088,
209117,
209130,
209152,
209160,
209168,
209173,
209209,
209243,
209248,
209253,
209328,
209336,
209357,
209399,
209409,
209438,
209456,
209533,
209587,
209619,
209645,
209686,
209696,
209718,
209729,
209748,
209770,
209781,
209797,
209808,
209813,
209835,
209859,
209871,
209892,
209906,
209914,
209933,
209961,
210038,
210115,
210156,
210180,
210199,
210221,
210279,
210292,
210365,
210428,
210460,
210470,
210514,
210524,
210529,
210606,
210661,
210712,
210757,
210822,
210859,
210909,
210961,
211005,
211013,
211018,
211039,
211077,
211087,
211095,
211105,
211110,
211152,
211214,
211252,
211287,
211335,
211359,
211403,
211415,
211422,
211429,
211454,
211466,
211473,
211480,
211500,
211512,
211519,
211526,
211545,
211557,
211564,
211571,
211589,
211613,
211637,
211665,
211675,
211745,
211759,
211776,
211800,
211867,
211893,
211903,
211938,
211979,
212040,
212077,
212111,
212158,
212181,
212225,
212237,
212244,
212251,
212276,
212288,
212295,
212302,
212322,
212334,
212341,
212348,
212367,
212379,
212386,
212393,
212411,
212443,
212453,
212502,
212603,
212668,
212701,
212720,
212725,
212748,
212817,
212825,
212883,
212935,
213015,
213049,
213104,
213157,
213170,
213180,
213213,
213256,
213291,
213333,
213338,
213359,
213395,
213412,
213452,
213486,
213528,
213566,
213593,
213627,
213652,
213709,
213756,
213798,
213808,
213860,
213865,
213870,
213892,
213901,
213908,
213927,
213934,
213939,
213961,
214010,
214061,
214071,
214096,
214118,
214147,
214200,
214210,
214222,
214226
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 214226,
"ccnet_original_nlines": 6850,
"rps_doc_curly_bracket": 0.006936599966138601,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.12135206907987595,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04761717841029167,
"rps_doc_frac_lines_end_with_ellipsis": 0.00029192998772487044,
"rps_doc_frac_no_alph_words": 0.551616370677948,
"rps_doc_frac_unique_words": 0.3622155487537384,
"rps_doc_mean_word_length": 5.354048252105713,
"rps_doc_num_sentences": 2270,
"rps_doc_symbol_to_word_ratio": 0.016782939434051514,
"rps_doc_unigram_entropy": 7.520562171936035,
"rps_doc_word_count": 26937,
"rps_doc_frac_chars_dupe_10grams": 0.049312859773635864,
"rps_doc_frac_chars_dupe_5grams": 0.22851575911045074,
"rps_doc_frac_chars_dupe_6grams": 0.15746557712554932,
"rps_doc_frac_chars_dupe_7grams": 0.11288846284151077,
"rps_doc_frac_chars_dupe_8grams": 0.08987533301115036,
"rps_doc_frac_chars_dupe_9grams": 0.07792846858501434,
"rps_doc_frac_chars_top_2gram": 0.02737445943057537,
"rps_doc_frac_chars_top_3gram": 0.011066270060837269,
"rps_doc_frac_chars_top_4gram": 0.0072111100889742374,
"rps_doc_books_importance": -24359.20703125,
"rps_doc_books_importance_length_correction": -24359.20703125,
"rps_doc_openwebtext_importance": -14256.1611328125,
"rps_doc_openwebtext_importance_length_correction": -14256.1611328125,
"rps_doc_wikipedia_importance": -10342.853515625,
"rps_doc_wikipedia_importance_length_correction": -10342.853515625
},
"fasttext": {
"dclm": 0.5105668902397156,
"english": 0.27922379970550537,
"fineweb_edu_approx": 2.3725430965423584,
"eai_general_math": 0.1776624321937561,
"eai_open_web_math": 0.22135329246520996,
"eai_web_code": 0.6306207180023193
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "22",
"label": "Truncated"
}
},
"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
|
3,784,855,689,126,330,400 |
Take the 2-minute tour ×
Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free.
In the Collection Interface I found a method named removeIf() that contains its implementation.
default boolean removeIf(Predicate<? super E> filter) {
Objects.requireNonNull(filter);
boolean removed = false;
final Iterator<E> each = iterator();
while (each.hasNext()) {
if (filter.test(each.next())) {
each.remove();
removed = true;
}
}
return removed;
}
I want to know if there is any way to define method body in an interface?
What is the default keyword and how does it work?
share|improve this question
2
see this post about the default zeroturnaround.com/rebellabs/java-8-explained-default-methods/… – emeraldjava Aug 17 '13 at 7:23
1
if i use default implementation then is it necessary to give implementation in its implemented calss. – Pawan mishra Aug 17 '13 at 7:36
3 Answers 3
Java 8 introduces “Default Method” or (Defender methods) new feature, which allows developer to add new methods to the interfaces without breaking the existing implementation of these interface. It provides flexibility to allow interface define implementation which will use as default in the situation where a concrete class fails to provide an implementation for that method.
public interface A {
default void foo(){
System.out.println("Calling A.foo()");
}
}
public class ClassAB implements A {
}
There is one common question that people ask about default methods when they hear about the new feature for the first time:
What if the class implements two interfaces and both those interfaces define a default method with the same signature?
Example to illustrate this situation:
public interface A {
default void foo(){
System.out.println("Calling A.foo()");
}
}
public interface B {
default void foo(){
System.out.println("Calling B.foo()");
}
}
public class ClassAB implements A, B {
}
This code fails to compile with the following result:
java: class Clazz inherits unrelated defaults for foo() from types A and B
To fix that, in Clazz, we have to resolve it manually by overriding the conflicting method:
public class Clazz implements A, B {
public void foo(){}
}
But what if we would like to call the default implementation of method foo() from interface A instead of implementing our own.
It is possible to refer to A#foo() as follows:
public class Clazz implements A, B {
public void foo(){
A.super.foo();
}
}
share|improve this answer
3
Thanks, really good exposition. You answered all my questions before I had a chance to ask them. – Jeff Hutchins Dec 4 '13 at 23:35
Very Nice explanation . Thank you very much. – user2045474 May 8 at 14:57
Those methods are called default methods. Default method or Defender method is one of the newly added features in Java 8.
They will be used to allow an interface method to provide an implementation used as default in the event that a concrete class doesn't provide an implementation for that method.
So, if you have an interface, with a default method:
public interface Hello {
default void sayHello() {
System.out.println("Hello");
}
}
The following class is perfectly valid:
public class HelloImpl implements Hello {
}
If you create an instance of HelloImpl:
Hello hello = new HelloImpl();
hello.sayHello(); // This will invoke the default method in interface
Useful Links:
share|improve this answer
So it is ok if a class implements an interface and not implement it's method? As far as Java7 is concerned which I am using this is not allowed. – Aniket Thakur Aug 17 '13 at 7:28
2
@AniketThakur. This is not allowed before Java 8. This feature is added in Java 8 only. You can avoid giving the implementation of default methods in your implementing class. – Rohit Jain Aug 17 '13 at 7:29
1
@PawanMishra. See my previous comment. No you don't need to provide implementation of default interface methods in implementing class. – Rohit Jain Aug 17 '13 at 7:36
1
@PawanMishra you can override it though. There is no restriction such as you need to use default implementation only. – Aniket Thakur Aug 17 '13 at 7:41
1
A forward step that will finally avoid being puzzled by multiple inheritance! – Xtreme Biker Mar 22 '14 at 13:15
I did a bit of research and i found the following. Hope this helps.
Existing problem
Normal interface methods are declared as abstract and must be defined in the class that implements the interface. This 'burdens' the class implementer with the responsibility to implement every declared method. More importantly, this also means that extending an interface is not possible after 'publication'. Otherwise, all implementers would have to adapt their implementation, breaking backwards source and binary compatibility.
Solution adopted in Java 8
To cope with these problems, one of the new features of JDK 8 is the possibility to extend existing interfaces with default methods. Default methods are not only declared, but also defined in the interface.
Important points to note
1. Implementers can choose not to implement default methods in implementing class.
2. Implementers can still override default methods, like regular non-final class methods can be overridden in subclasses.
3. Abstract classes can even (re)declare default methods as abstract, forcing subclasses to reimplement the method (sometimes called 're-abstraction').
share|improve this answer
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://stackoverflow.com/questions/18286235/what-is-the-default-implementation-of-method-defined-in-an-interface",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-35",
"warc_metadata": {
"Content-Length": "97239",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EHL4ZX5WLZMLXWEZEH2MACZNQXDXXUR7",
"WARC-Concurrent-To": "<urn:uuid:75ceb506-1a06-4061-8d85-0c30e16d43b5>",
"WARC-Date": "2015-08-28T23:26:11Z",
"WARC-IP-Address": "104.16.104.85",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:7R6QVHKG4SOO3RL3U23MMOR7BH2UMPA4",
"WARC-Record-ID": "<urn:uuid:0d3516b7-e1ce-4bae-9206-498260a98b0a>",
"WARC-Target-URI": "http://stackoverflow.com/questions/18286235/what-is-the-default-implementation-of-method-defined-in-an-interface",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8b7876e8-95e8-4450-8479-3345993688d1>"
},
"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,
25,
131,
132,
228,
229,
285,
323,
354,
398,
429,
471,
500,
530,
542,
550,
572,
576,
577,
651,
701,
702,
730,
734,
864,
868,
1005,
1006,
1018,
1019,
1397,
1398,
1419,
1443,
1489,
1495,
1497,
1498,
1534,
1536,
1537,
1661,
1662,
1781,
1782,
1820,
1821,
1844,
1870,
1919,
1927,
1929,
1930,
1951,
1975,
2022,
2028,
2030,
2031,
2032,
2071,
2072,
2076,
2077,
2131,
2132,
2207,
2208,
2300,
2301,
2338,
2362,
2364,
2365,
2492,
2493,
2540,
2541,
2578,
2601,
2623,
2629,
2631,
2657,
2661,
2794,
2799,
2874,
2875,
2997,
2998,
3176,
3177,
3230,
3231,
3256,
3286,
3323,
3329,
3331,
3332,
3372,
3373,
3415,
3416,
3418,
3419,
3459,
3460,
3491,
3562,
3563,
3577,
3578,
3604,
3609,
3790,
3794,
4002,
4006,
4174,
4178,
4332,
4336,
4450,
4451,
4519,
4520,
4537,
4538,
4970,
4971,
4998,
4999,
5206,
5207,
5232,
5233,
5318,
5442,
5596,
5622,
5623,
5635,
5636,
5638,
5646,
5647,
5725,
5726
],
"line_end_idx": [
25,
131,
132,
228,
229,
285,
323,
354,
398,
429,
471,
500,
530,
542,
550,
572,
576,
577,
651,
701,
702,
730,
734,
864,
868,
1005,
1006,
1018,
1019,
1397,
1398,
1419,
1443,
1489,
1495,
1497,
1498,
1534,
1536,
1537,
1661,
1662,
1781,
1782,
1820,
1821,
1844,
1870,
1919,
1927,
1929,
1930,
1951,
1975,
2022,
2028,
2030,
2031,
2032,
2071,
2072,
2076,
2077,
2131,
2132,
2207,
2208,
2300,
2301,
2338,
2362,
2364,
2365,
2492,
2493,
2540,
2541,
2578,
2601,
2623,
2629,
2631,
2657,
2661,
2794,
2799,
2874,
2875,
2997,
2998,
3176,
3177,
3230,
3231,
3256,
3286,
3323,
3329,
3331,
3332,
3372,
3373,
3415,
3416,
3418,
3419,
3459,
3460,
3491,
3562,
3563,
3577,
3578,
3604,
3609,
3790,
3794,
4002,
4006,
4174,
4178,
4332,
4336,
4450,
4451,
4519,
4520,
4537,
4538,
4970,
4971,
4998,
4999,
5206,
5207,
5232,
5233,
5318,
5442,
5596,
5622,
5623,
5635,
5636,
5638,
5646,
5647,
5725,
5726,
5816
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5816,
"ccnet_original_nlines": 149,
"rps_doc_curly_bracket": 0.0061898198910057545,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31183746457099915,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023851590231060982,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25176677107810974,
"rps_doc_frac_unique_words": 0.3936915993690491,
"rps_doc_mean_word_length": 5.125,
"rps_doc_num_sentences": 67,
"rps_doc_symbol_to_word_ratio": 0.0017667800420895219,
"rps_doc_unigram_entropy": 5.2484307289123535,
"rps_doc_word_count": 856,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.10553909093141556,
"rps_doc_frac_chars_dupe_6grams": 0.09026669710874557,
"rps_doc_frac_chars_dupe_7grams": 0.07385457307100296,
"rps_doc_frac_chars_dupe_8grams": 0.06382493674755096,
"rps_doc_frac_chars_dupe_9grams": 0.06382493674755096,
"rps_doc_frac_chars_top_2gram": 0.025529969483613968,
"rps_doc_frac_chars_top_3gram": 0.0095737399533391,
"rps_doc_frac_chars_top_4gram": 0.012309099547564983,
"rps_doc_books_importance": -535.9951782226562,
"rps_doc_books_importance_length_correction": -535.9951782226562,
"rps_doc_openwebtext_importance": -337.005615234375,
"rps_doc_openwebtext_importance_length_correction": -337.005615234375,
"rps_doc_wikipedia_importance": -229.26087951660156,
"rps_doc_wikipedia_importance_length_correction": -229.26087951660156
},
"fasttext": {
"dclm": 0.35658782720565796,
"english": 0.8457300662994385,
"fineweb_edu_approx": 2.248643636703491,
"eai_general_math": 0.15740150213241577,
"eai_open_web_math": 0.05692166090011597,
"eai_web_code": 0.018483759835362434
}
}
|
{
"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": "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": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,908,011,150,281,797,000 |
• 如果您觉得本站非常有看点，那么赶紧使用Ctrl+D 收藏吧
管理JavaFX菜单栏的运行时行为
java 来源：spacitron 3次浏览
我有一个BorderPane，我在其上放置了一个MenuBar。在BorderPane的中心，根据所选的MenuItem，我显示不同的AnchorPanes。到现在为止还挺好。管理JavaFX菜单栏的运行时行为
现在，我如何确保菜单更改行为以响应在子AnchorPane中选择的项目？因此，例如，如果用户选择“编辑”，会出现根据当前亮显的项目是否是一个用户账号，文件等
到目前为止，我做东西沿着这些路线不同的动作：
该BorderPane控制器：
public class MenuTest implements Initializable{
@FXML
private BorderPane borderPaneMain;
@FXML
private AnchorPane anchorPaneMain;
@FXML
private Menu menuEdit;
@FXML
private MenuItem itemEdit;
static String menuMode;
static String entityName;
public MenuTest(){
menuMode ="";
entityName = "";
}
@Override
public void initialize(URL arg0, ResourceBundle arg1) {
AnchorPane anchor;
try {
anchor = (AnchorPane) new FXMLLoader().load(getClass().getResource("views/MainView.fxml"));
borderPaneMain.setCenter(anchor);
} catch (IOException e) {
e.printStackTrace();
}
}
protected static void setMenuMode(String menuMd, String entityNm){
entityName = entityNm;
menuMode = menuMd;
}
@FXML
private void onEditClick(){
if(entityName.equals(AnchorTest.FILE)){
//Launches correct edit view
new FXMLLoader().load(getClass().getResource("views/EditFile.fxml"));
//Passes the name of the entity so that the controller can retrieve its data
FileEditController.setFile(entityName);
}else if(entityName.equals(AnchorTest.PERSON)){
new FXMLLoader().load(getClass().getResource("views/EditPerson.fxml"));
PersonEditController.setFile(entityName);
}
}
}
孩子AnchorPane控制器：
public class AnchorTest implements Initializable{
public static final String PERSON = "PERSON";
public static final String FILE = "FILE";
ObservableList<String> peopleList;
ObservableList<String> fileList;
@FXML
private ListView<String> listPeople;
@FXML
private ListView<String> listFiles;
@Override
public void initialize(URL location, ResourceBundle resources) {
peopleList = FXCollections.observableArrayList("Frank","Matin","Anne");
fileList = FXCollections.observableArrayList("hello.txt","holiday.jpg","cv.doc");
listPeople.setItems(peopleList);
listFiles.setItems(fileList);
}
@FXML
private void personSelected(){
MenuTest.setMenuMode(this.PERSON, listPeople.getSelectionModel().getSelectedItem());
}
@FXML
private void fileSelected(){
MenuTest.setMenuMode(this.FILE, listFiles.getSelectionModel().getSelectedItem());
}
}
但是我不知道，这是最好的解决方案，尤其是C考虑到if/elseif语句需要在添加新的元素类型及其相应的编辑选项时进行更改。那么有什么方法可以做得更好？
===========解决方案如下：
我想如果你的应用程序只有少数（2-4种）不同类型的“东西”，代表AnchorPane，那么你的方法就完全没问题。您的方法的替代方法是state pattern。在这种情况下，您当前选择的“项目类型”将是您的状态。
版权声明：本文转自网络文章，转载此文章仅为分享知识，如有侵权，请联系管理员进行删除。
喜欢 (0)
|
{
"url": "http://www.fixbbs.com/p/1191078.html",
"source_domain": "www.fixbbs.com",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "29496",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OBCFAGR6LSQESWZROLUO7EUXULRVUPLE",
"WARC-Concurrent-To": "<urn:uuid:f62179a8-dfd3-4286-bd83-ae933cba2dc4>",
"WARC-Date": "2020-11-25T16:00:56Z",
"WARC-IP-Address": "47.242.16.222",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:H7AC7O4WGN6HR7Z3RFFAWSGLG6NDVP4H",
"WARC-Record-ID": "<urn:uuid:8caf6e30-2a21-44cf-a591-81a30fe3281e>",
"WARC-Target-URI": "http://www.fixbbs.com/p/1191078.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5713767f-2dee-492d-9bc2-62390f3fb4b5>"
},
"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-64.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,
34,
35,
53,
54,
77,
78,
184,
185,
264,
265,
288,
289,
305,
306,
355,
362,
398,
405,
441,
448,
472,
479,
507,
508,
533,
560,
561,
581,
600,
622,
625,
626,
637,
694,
718,
729,
827,
867,
898,
925,
932,
935,
936,
1004,
1032,
1056,
1059,
1060,
1067,
1096,
1141,
1176,
1252,
1335,
1381,
1434,
1512,
1560,
1571,
1574,
1577,
1578,
1595,
1596,
1647,
1648,
1695,
1738,
1739,
1775,
1809,
1810,
1817,
1855,
1862,
1899,
1900,
1911,
1977,
2054,
2141,
2179,
2214,
2217,
2218,
2225,
2257,
2347,
2350,
2351,
2358,
2388,
2475,
2478,
2481,
2482,
2558,
2559,
2578,
2579,
2686,
2687,
2688,
2731
],
"line_end_idx": [
34,
35,
53,
54,
77,
78,
184,
185,
264,
265,
288,
289,
305,
306,
355,
362,
398,
405,
441,
448,
472,
479,
507,
508,
533,
560,
561,
581,
600,
622,
625,
626,
637,
694,
718,
729,
827,
867,
898,
925,
932,
935,
936,
1004,
1032,
1056,
1059,
1060,
1067,
1096,
1141,
1176,
1252,
1335,
1381,
1434,
1512,
1560,
1571,
1574,
1577,
1578,
1595,
1596,
1647,
1648,
1695,
1738,
1739,
1775,
1809,
1810,
1817,
1855,
1862,
1899,
1900,
1911,
1977,
2054,
2141,
2179,
2214,
2217,
2218,
2225,
2257,
2347,
2350,
2351,
2358,
2388,
2475,
2478,
2481,
2482,
2558,
2559,
2578,
2579,
2686,
2687,
2688,
2731,
2737
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2737,
"ccnet_original_nlines": 104,
"rps_doc_curly_bracket": 0.009499450214207172,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.04458599165081978,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.042462851852178574,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5116772651672363,
"rps_doc_frac_unique_words": 0.6242424249649048,
"rps_doc_mean_word_length": 12.630303382873535,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.378293514251709,
"rps_doc_word_count": 165,
"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.04750480130314827,
"rps_doc_frac_chars_top_3gram": 0.021593090146780014,
"rps_doc_frac_chars_top_4gram": 0.029750479385256767,
"rps_doc_books_importance": -136.729248046875,
"rps_doc_books_importance_length_correction": -136.729248046875,
"rps_doc_openwebtext_importance": -94.0302505493164,
"rps_doc_openwebtext_importance_length_correction": -94.0302505493164,
"rps_doc_wikipedia_importance": -86.21732330322266,
"rps_doc_wikipedia_importance_length_correction": -86.21732330322266
},
"fasttext": {
"dclm": 0.9722999930381775,
"english": 0.146352156996727,
"fineweb_edu_approx": 2.5485036373138428,
"eai_general_math": 0.014493639580905437,
"eai_open_web_math": 0.00198894995264709,
"eai_web_code": 0.8677947521209717
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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,342,631,317,655,684,000 |
Вопросы с тегом 'repository'
Может обращаться к хранилищу данных системы управления версиями, содержащей всю историю проекта, или к объекту, который передает данные между бизнес-уровнем приложения и его хранилищем данных.
13
ответов
Как переместить новый локальный ветвь в удаленный репозиторий Git и отслеживать его?
Я хочу иметь возможность сделать следующее: Создайте локальную ветвь на основе какой-либо другой (удаленной или локальной) ветки (через git branch или git checkout -b) Нажмите локальную ветвь в удаленный репозиторий (публикация), но сделайте это ...
задан 04 мая '10 в 15:58
8
ответов
Удалите файл из репозитория Git, не удаляя его из локальной файловой системы
В моем первоначальном коммите содержались файлы журнала. Я добавил *log в мой .gitignore, и теперь я хочу удалить файлы журнала из своего репозитория. git rm mylogfile.log удалит файл из репозитория, но также удалит его из локальной файловой сист...
задан 17 июля '09 в 17:56
15
ответов
Как вы клонируете репозиторий Git в определенную папку?
Выполнение команды git clone [email protected]:whatever создает каталог в моей текущей папке с именем any и отбрасывает содержимое репозитория Git в эту папку: /httpdocs/whatever/public Моя проблема в том, что мне нужно содержимое репозитория Git, ...
задан 16 марта '09 в 18:56
8
ответов
Нажмите тег в удаленный репозиторий с помощью Git?
Я клонировал удаленный репозиторий Git для своего ноутбука, затем я хотел добавить тег, чтобы запустить git tag mytag master Когда я запускаю git tag на моем ноутбуке, отображается тег mytag. Затем я хочу нажать это в удаленный репозиторий, поэт...
задан 04 марта '11 в 18:37
20
ответов
Как вы объедините два хранилища Git?
Рассмотрим следующий сценарий: Я разработал небольшой экспериментальный проект A в своем собственном репо Git. Он теперь созрел, и я бы хотел, чтобы A был частью более крупного проекта B, у которого есть собственный большой репозиторий. Теперь я хо...
задан 15 сент. '09 в 11:31
10
ответов
Как клонировать подкаталог только в репозитории Git?
У меня есть мой репозиторий Git, который в корне имеет два подкаталога: /finisht /static Когда это было в SVN, /finisht был извлечен в одном месте, а /static был удален в другом месте, например: svn co svn+ssh://[email protected]/home/admin/repo...
задан 01 марта '09 в 19:46
22
ответов
Как добавить локальные файлы jar в проект Maven?
Как добавить локальные файлы jar (еще не являющиеся частью репозитория Maven) непосредственно в источниках моей библиотеки проектов?
задан 10 февр. '11 в 13:03
10
ответов
Отрывать файлы от git временно
Я установил локальный git на моем компьютере. Когда я инициализировал git, я добавил предварительно скомпилированные библиотеки и двоичные файлы. Однако сейчас, во время моего развития, я не хочу периодически проверять эти файлы. Я не хочу удалять э...
задан 06 авг. '11 в 5:02
10
ответов
Как перемещать файлы из одного репозитория git в другой (не клон), сохраняя историю
Наши репозитории Git начинались как часть одного монстра SVN-репозитория, где каждый отдельный проект имел свое собственное дерево: project1/branches /tags /trunk project2/branches /tags /trunk Очевидно, было довол...
задан 02 сент. '09 в 5:04
13
ответов
Как мне обращаться с "пакетом ххх" недоступно (для R версии x.y.z)? Предупреждение?
Я попытался установить пакет, используя install.packages("foobarbaz") но получил предупреждение Warning message: package 'foobarbaz' is not available (for R version x.y.z) Почему R не считает, что пакет доступен? См. также эти вопросы, относя...
задан 08 сент. '14 в 13:11
19
ответов
Как подсчитать общие строки, измененные конкретным автором в репозитории Git?
Есть ли команда, которую я могу вызвать, которая будет подсчитывать строки, измененные конкретным автором в репозитории Git? Я знаю, что должны быть способы подсчитать количество коммитов, поскольку Github делает это для своего графика Impact.
задан 12 авг. '09 в 11:59
6
ответов
В чем разница между github и gist?
Какова цель сущности и как она отличается от обычного совместного использования/поддержки кода с помощью github?
задан 20 июля '11 в 22:41
9
ответов
Как переименовать репозиторий на GitHub?
Я хотел переименовать один из моих репозиториев в GitHub, но я испугался, когда большое красное предупреждение сказало: Мы не будем настраивать перенаправления из старого местоположения Вам нужно будет обновить локальные репозитории, чтобы указат...
задан 22 апр. '11 в 4:57
15
ответов
Найти драйвер Oracle JDBC в репозитории Maven
Я хочу добавить драйвер oracle jdbc в мой проект как зависимость (область выполнения) - ojdbc14. На сайте MVNrepository зависимость от POM: <dependency> <groupId>com.oracle</groupId> <artifactId>ojdbc14</artifactId...
задан 02 июля '09 в 17:55
3
ответов
Если я переделаю кого-то другого частного Github-репо в свою учетную запись, он появится на моем счете в качестве публичного репо?
Кто-то дал мне доступ к одному из своих частных репо на Github. То, что я хочу сделать, - это разветкить этот проект на мою собственную учетную запись, чтобы я мог использовать функцию запроса на Github. У меня есть только базовая учетная запись в G...
задан 09 марта '12 в 8:49
|
{
"url": "http://qaru.site/questions/tagged/repository",
"source_domain": "qaru.site",
"snapshot_id": "crawl=CC-MAIN-2018-30",
"warc_metadata": {
"Content-Length": "45128",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YYK4UOIBTGYP3EEJDS6BLDKKB7VPW2RH",
"WARC-Concurrent-To": "<urn:uuid:af0c889b-747b-4af5-8e78-b0c3faa35e16>",
"WARC-Date": "2018-07-16T04:34:33Z",
"WARC-IP-Address": "173.249.39.20",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VX55E6PYGN76FYBUXGDL4DP5Z26MV45M",
"WARC-Record-ID": "<urn:uuid:a67c6dea-9589-4085-8d1f-f8051f4315fd>",
"WARC-Target-URI": "http://qaru.site/questions/tagged/repository",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f1528074-c379-4ef4-ba5b-d9582c48b364>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-233-160-228.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,
29,
30,
223,
226,
234,
235,
320,
321,
571,
596,
598,
606,
607,
684,
685,
935,
961,
964,
972,
973,
1029,
1030,
1279,
1306,
1308,
1316,
1317,
1368,
1369,
1618,
1645,
1648,
1656,
1657,
1694,
1695,
1947,
1974,
1977,
1985,
1986,
2039,
2040,
2288,
2315,
2318,
2326,
2327,
2376,
2377,
2510,
2537,
2540,
2548,
2549,
2580,
2581,
2834,
2859,
2862,
2870,
2871,
2955,
2956,
3174,
3200,
3203,
3211,
3212,
3296,
3297,
3543,
3570,
3573,
3581,
3582,
3660,
3661,
3905,
3931,
3933,
3941,
3942,
3977,
3978,
4091,
4117,
4119,
4127,
4128,
4169,
4170,
4420,
4445,
4448,
4456,
4457,
4503,
4504,
4722,
4748,
4750,
4758,
4759,
4890,
4891,
5144
],
"line_end_idx": [
29,
30,
223,
226,
234,
235,
320,
321,
571,
596,
598,
606,
607,
684,
685,
935,
961,
964,
972,
973,
1029,
1030,
1279,
1306,
1308,
1316,
1317,
1368,
1369,
1618,
1645,
1648,
1656,
1657,
1694,
1695,
1947,
1974,
1977,
1985,
1986,
2039,
2040,
2288,
2315,
2318,
2326,
2327,
2376,
2377,
2510,
2537,
2540,
2548,
2549,
2580,
2581,
2834,
2859,
2862,
2870,
2871,
2955,
2956,
3174,
3200,
3203,
3211,
3212,
3296,
3297,
3543,
3570,
3573,
3581,
3582,
3660,
3661,
3905,
3931,
3933,
3941,
3942,
3977,
3978,
4091,
4117,
4119,
4127,
4128,
4169,
4170,
4420,
4445,
4448,
4456,
4457,
4503,
4504,
4722,
4748,
4750,
4758,
4759,
4890,
4891,
5144,
5169
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5169,
"ccnet_original_nlines": 107,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.017699120566248894,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02458209916949272,
"rps_doc_frac_lines_end_with_ellipsis": 0.1111111119389534,
"rps_doc_frac_no_alph_words": 0.8761062026023865,
"rps_doc_frac_unique_words": 0.5215123891830444,
"rps_doc_mean_word_length": 5.469361305236816,
"rps_doc_num_sentences": 60,
"rps_doc_symbol_to_word_ratio": 0.011799409985542297,
"rps_doc_unigram_entropy": 5.506119251251221,
"rps_doc_word_count": 767,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03671037033200264,
"rps_doc_frac_chars_dupe_6grams": 0.022884389385581017,
"rps_doc_frac_chars_dupe_7grams": 0.022884389385581017,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.021454110741615295,
"rps_doc_frac_chars_top_3gram": 0.021930869668722153,
"rps_doc_frac_chars_top_4gram": 0.013349230401217937,
"rps_doc_books_importance": -408.0173645019531,
"rps_doc_books_importance_length_correction": -408.0173645019531,
"rps_doc_openwebtext_importance": -212.73666381835938,
"rps_doc_openwebtext_importance_length_correction": -212.73666381835938,
"rps_doc_wikipedia_importance": -123.20890045166016,
"rps_doc_wikipedia_importance_length_correction": -123.20890045166016
},
"fasttext": {
"dclm": 0.7361183166503906,
"english": 0.00001123000038205646,
"fineweb_edu_approx": 2.064112424850464,
"eai_general_math": -0.00000763000025472138,
"eai_open_web_math": 0.198028564453125,
"eai_web_code": 0.3247491717338562
}
}
|
{
"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.778",
"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": "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
|
8,724,962,556,923,425,000 |
some experiments with Concise Method Bodies
Brian Goetz brian.goetz at oracle.com
Mon Oct 15 20:55:20 UTC 2018
For lambdas, is the difference between
() -> { throw E; }
and
() -> throw E;
which seems pretty harmless, but probably isn't worth much either. For
CMBs (bringing this back around to on-topic!), let's consider other
statement forms too, such as setters. I think drawing the line at
"statements needs braces" is probably a cleaner way to draw it. (Note
that methods whose bodies are a single, non-return statement gain even
less out of CMB, because there's no "return" to be elided.)
On 10/15/2018 4:36 PM, Remi Forax wrote:
> while throw is not an expression,
> currently the syntax "-> throw" is allowed in an expression switch but not allowed neither in a lambda and nor as a concise method body.
>
> I believe we should fix these discrepancies by allowing -> throw as part of a lambda or a CMB.
>
> Rémi
>
> ----- Mail original -----
>> De: "Brian Goetz" <brian.goetz at oracle.com>
>> À: "Aaron Scott-Boddendijk" <talden at gmail.com>, "Stuart Marks" <stuart.marks at oracle.com>
>> Cc: "amber-dev" <amber-dev at openjdk.java.net>
>> Envoyé: Lundi 15 Octobre 2018 22:17:44
>> Objet: Re: some experiments with Concise Method Bodies
>> Not surprisingly, we explored this ground, and decided we liked things
>> where they are.
>>
>> Your "instead of" example makes the alternative look worse than it is.
>> You could instead say:
>>
>> if (!condition)
>> throw new BadStuffException();
>> final Result result = goodPath();
>>
>> which isn't nearly as fussy, and is more clear, as it puts your preconditions up
>> front.
>>
>> In the run-up to switch expressions, we explored allowing `throw` to be an
>> expression, but that would lead to code for which the control flow is much
>> harder to read:
>>
>> if (isFoo(x) || isBar(y) || throw new NotFooExpression()) { ... }
>>
>> or
>>
>> if (methodWithSideEffect(x) && throw new UnrelatedException()) { /* dead */ }
>>
>> or, even
>>
>> m(3, 4, throw new XYZException(...))
>>
>> Now, you could say "Sure, I don't want all that, but I want it for ternary", and
>> that would be a reasonable opinion, but at this point the cost-benefit of the
>> incremental complexity starts to tilt the other way. Refactoring a ternary to
>> an if, as above, really isn't so bad -- and it is more clear. So we decided to
>> not create a special case for this.
>>
>>
>>
>>
>> On 10/15/2018 3:32 PM, Aaron Scott-Boddendijk wrote:
>>>> public boolean add(E e) -> throw new UnsupportedOperationException();
>>> This is similar to issues with flow-control. It would be nice to be able
>>> to do..
>>>
>>> final Result r = condition ? goodPath() : throw new BadStuffException();
>>> ...
>>>
>>> instead of...
>>>
>>> final Result;
>>> if (condition) {
>>> result = goodPath();
>>> } else {
>>> throw new BadStuffException();
>>> }
>>> ...
>>>
>>> Either branch of the ternary should be allowed to be a throw and, if both
>>> are throws the ternary is a Void expression (allowing for a concise 'which
>>> exception are we throwing').
>>>
>>> --
>>> Aaron Scott-Boddendijk
>>>
>>>
>>> On Tue, Oct 16, 2018 at 7:40 AM Stuart Marks <stuart.marks at oracle.com>
>>> wrote:
>>>
>>>> When I first saw the CMB proposal, I immediately thought "delegation" and
>>>> so I
>>>> thought it would be useful to see how CMB could be applied in this area.
>>>> The
>>>> example I chose was the implementation class for
>>>> Collections.unmodifiableCollection(), which returns an instance of a
>>>> wrapper
>>>> class [1] that delegates most (but not all) method calls to the backing
>>>> collection.
>>>>
>>>> I cloned the amber repo and updated to the concise-method-declarations
>>>> branch.
>>>> Building the JDK from this branch worked smoothly. Compiling "Hello,
>>>> world" worked:
>>>>
>>>> public class Concise {
>>>> public static void main(String[] args)
>>>> -> System.out.println("Hello, concise method bodies!");
>>>> }
>>>>
>>>> I took Collections$UnmodifiableCollection and extracted it into a
>>>> standalone
>>>> class UnmodColl1.java [2] and stripped out some extraneous stuff. I then
>>>> copied
>>>> it to UnmodColl2.java [3] and converted it to use CMB. Along the way I
>>>> made some
>>>> shortening transformations that didn't directly relate to CMB, so I
>>>> retrofitted
>>>> them back to UnmodColl1.java. The results are more-or-less diff-able.
>>>>
>>>> Observations:
>>>>
>>>> * I was able to use CMB for almost everything. These wrapper classes
>>>> consistent
>>>> almost entirely of one-liners, to which CMB can be directly applied.
>>>>
>>>> * The CMB version is a bit prettier. Lack of 'return' and braces reduces
>>>> visual
>>>> clutter, and in a few cases it enabled things to be moved onto a single
>>>> line,
>>>> reducing vertical space.
>>>>
>>>> * Note that these wrapper classes already bend the usual style rules for
>>>> braces
>>>> and statements of a method body, e.g., even in the original we have the
>>>> method
>>>>
>>>> public int size() {return c.size();}
>>>>
>>>> written on a single line. If the style were followed strictly, this would
>>>> be
>>>> written on three lines. There's a reason for this; writing all these
>>>> one-liners
>>>> in standard style would waste an egregious amount of vertical space. CMB
>>>> syntax
>>>> provides a much bigger win over standard style than over the non-standard,
>>>> compact style used in these Collections wrapper classes.
>>>>
>>>> On the other hand, while the non-standard, compact style does save
>>>> vertical
>>>> space, it's kind of annoying to deal with, because it's non-standard. In
>>>> my
>>>> opinion the tradeoff is in favor of the compact style. But CMB mostly
>>>> relieves
>>>> us of having to make this tradeoff at all.
>>>>
>>>> * None of these methods have javadoc, since this is a private
>>>> implementation class.
>>>>
>>>> * Many of the delegating methods can be written using the method reference
>>>> form:
>>>>
>>>> public int size() = c::size;
>>>>
>>>> This would produce a marginal improvement in the syntax, mostly by
>>>> removing the
>>>> need for a set of parens and the need to pass parameters explicitly. The
>>>> issue
>>>> of time-of-evaluation of the receiver mostly doesn't arise here, since the
>>>> delegate is a final field initialized by the constructor.
>>>>
>>>> * I tried to use CMB for the constructor, but I got an error message
>>>> saying it
>>>> was disallowed. No great loss, and makes some sense, I guess.
>>>>
>>>> * Many of the methods throw exceptions. I had a bit of a wrestling match
>>>> with
>>>> this. My first attempt was
>>>>
>>>> UnsupportedOperationException uoe() -> new
>>>> UnsupportedOperationException;
>>>> public boolean add(E e) -> throw uoe();
>>>>
>>>> But this doesn't work, because 'throw' isn't an expression, and the
>>>> concise body
>>>> is required to be an expression of the right type even though we know the
>>>> method
>>>> can never return normally. Of course, one can do this:
>>>>
>>>> public boolean add(E e) { throw uoe(); }
>>>>
>>>> but I wanted to use CMB. My next attempt was this:
>>>>
>>>> boolean throwUOE() { throw new UnsupportedOperationException(); }
>>>> public boolean add(E e) -> throwUOE();
>>>>
>>>> Now this works, but it's a hack. Most of the throwing methods happen to
>>>> return
>>>> boolean, so I was able to declare the helper method to return boolean as
>>>> well.
>>>> It can also be used for void-returning methods. But if I had needed to
>>>> delegate
>>>> several throwing methods that had different return types, I wouldn't be
>>>> able to
>>>> do this.
>>>>
>>>> I tried to use the method reference form to deal with the throwing
>>>> methods, but
>>>> that didn't work, since those methods all take different parameters.
>>>>
>>>> It would be nice if I could just do
>>>>
>>>> public boolean add(E e) -> throw new UnsupportedOperationException();
>>>>
>>>> or
>>>>
>>>> public boolean add(E e) -> throw uoe();
>>>>
>>>> where uoe() returns an exception instance.
>>>>
>>>> **
>>>>
>>>> Summary: it was fun playing with this feature. It seems to clean things up
>>>> a
>>>> little bit, and for classes that are all one-liner methods the little
>>>> savings
>>>> add up to a lot. The savings are incrementally greater compared to a
>>>> hypothetical wrapper class that uses the standard coding style. CMB
>>>> doesn't seem
>>>> to be a must-have feature, at least not yet, but it does seem to have some
>>>> potential.
>>>>
>>>> s'marks
>>>>
>>>>
>>>> [1]
>>>>
>>>> http://hg.openjdk.java.net/jdk/jdk11/file/1ddf9a99e4ad/src/java.base/share/classes/java/util/Collections.java#l1021
>>>>
>>>> [2] http://cr.openjdk.java.net/~smarks/amber/UnmodColl1.java
>>>>
>>>> [3] http://cr.openjdk.java.net/~smarks/amber/UnmodColl2.java
>>>>
More information about the amber-dev mailing list
|
{
"url": "https://mail.openjdk.java.net/pipermail/amber-dev/2018-October/003572.html",
"source_domain": "mail.openjdk.java.net",
"snapshot_id": "crawl=CC-MAIN-2019-26",
"warc_metadata": {
"Content-Length": "16674",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IMCAANKJGNQ4WJ7ODCZ2HY52NXPSUYHO",
"WARC-Concurrent-To": "<urn:uuid:5c9d9375-f630-4f06-9b55-42e925524d06>",
"WARC-Date": "2019-06-17T01:52:29Z",
"WARC-IP-Address": "137.254.56.64",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IITTAOV77ZJ2S6HEAQD5KHXKAF3HRAH6",
"WARC-Record-ID": "<urn:uuid:fd453e51-9a84-4531-bc11-46152123ceed>",
"WARC-Target-URI": "https://mail.openjdk.java.net/pipermail/amber-dev/2018-October/003572.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:80154b21-aa68-4a48-b951-22211e3a8624>"
},
"warc_info": "isPartOf: CC-MAIN-2019-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-147-84-78.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,
44,
45,
83,
112,
113,
114,
153,
154,
178,
182,
202,
203,
276,
345,
413,
485,
557,
617,
618,
659,
695,
834,
836,
933,
935,
942,
944,
972,
1021,
1119,
1170,
1212,
1270,
1344,
1363,
1366,
1440,
1466,
1469,
1493,
1536,
1578,
1581,
1665,
1675,
1678,
1756,
1834,
1853,
1856,
1930,
1933,
1939,
1942,
2028,
2031,
2043,
2046,
2091,
2094,
2178,
2259,
2341,
2424,
2463,
2466,
2469,
2472,
2475,
2531,
2612,
2690,
2702,
2706,
2789,
2803,
2807,
2825,
2829,
2853,
2880,
2915,
2934,
2979,
2991,
3005,
3009,
3087,
3166,
3199,
3203,
3210,
3237,
3241,
3245,
3323,
3334,
3338,
3417,
3427,
3505,
3514,
3568,
3642,
3655,
3732,
3749,
3754,
3830,
3843,
3917,
3937,
3942,
3977,
4032,
4108,
4122,
4127,
4198,
4214,
4292,
4304,
4380,
4395,
4468,
4485,
4560,
4565,
4584,
4589,
4663,
4679,
4753,
4758,
4836,
4848,
4925,
4936,
4966,
4971,
5049,
5061,
5138,
5150,
5155,
5204,
5209,
5288,
5296,
5370,
5386,
5464,
5476,
5556,
5618,
5623,
5695,
5709,
5787,
5795,
5870,
5884,
5932,
5937,
6004,
6031,
6036,
6116,
6127,
6132,
6173,
6178,
6250,
6268,
6346,
6357,
6437,
6500,
6505,
6579,
6594,
6661,
6666,
6744,
6754,
6786,
6791,
6846,
6882,
6934,
6939,
7012,
7030,
7109,
7121,
7181,
7186,
7239,
7244,
7300,
7305,
7383,
7434,
7439,
7516,
7528,
7606,
7617,
7693,
7707,
7784,
7797,
7811,
7816,
7888,
7906,
7980,
7985,
8026,
8031,
8113,
8118,
8126,
8131,
8183,
8188,
8236,
8241,
8249,
8254,
8334,
8341,
8416,
8429,
8503,
8576,
8594,
8674,
8690,
8695,
8708,
8713,
8718,
8727,
8732,
8853,
8858,
8924,
8929,
8995,
9000,
9001,
9002,
9003
],
"line_end_idx": [
44,
45,
83,
112,
113,
114,
153,
154,
178,
182,
202,
203,
276,
345,
413,
485,
557,
617,
618,
659,
695,
834,
836,
933,
935,
942,
944,
972,
1021,
1119,
1170,
1212,
1270,
1344,
1363,
1366,
1440,
1466,
1469,
1493,
1536,
1578,
1581,
1665,
1675,
1678,
1756,
1834,
1853,
1856,
1930,
1933,
1939,
1942,
2028,
2031,
2043,
2046,
2091,
2094,
2178,
2259,
2341,
2424,
2463,
2466,
2469,
2472,
2475,
2531,
2612,
2690,
2702,
2706,
2789,
2803,
2807,
2825,
2829,
2853,
2880,
2915,
2934,
2979,
2991,
3005,
3009,
3087,
3166,
3199,
3203,
3210,
3237,
3241,
3245,
3323,
3334,
3338,
3417,
3427,
3505,
3514,
3568,
3642,
3655,
3732,
3749,
3754,
3830,
3843,
3917,
3937,
3942,
3977,
4032,
4108,
4122,
4127,
4198,
4214,
4292,
4304,
4380,
4395,
4468,
4485,
4560,
4565,
4584,
4589,
4663,
4679,
4753,
4758,
4836,
4848,
4925,
4936,
4966,
4971,
5049,
5061,
5138,
5150,
5155,
5204,
5209,
5288,
5296,
5370,
5386,
5464,
5476,
5556,
5618,
5623,
5695,
5709,
5787,
5795,
5870,
5884,
5932,
5937,
6004,
6031,
6036,
6116,
6127,
6132,
6173,
6178,
6250,
6268,
6346,
6357,
6437,
6500,
6505,
6579,
6594,
6661,
6666,
6744,
6754,
6786,
6791,
6846,
6882,
6934,
6939,
7012,
7030,
7109,
7121,
7181,
7186,
7239,
7244,
7300,
7305,
7383,
7434,
7439,
7516,
7528,
7606,
7617,
7693,
7707,
7784,
7797,
7811,
7816,
7888,
7906,
7980,
7985,
8026,
8031,
8113,
8118,
8126,
8131,
8183,
8188,
8236,
8241,
8249,
8254,
8334,
8341,
8416,
8429,
8503,
8576,
8594,
8674,
8690,
8695,
8708,
8713,
8718,
8727,
8732,
8853,
8858,
8924,
8929,
8995,
9000,
9001,
9002,
9003,
9052
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9052,
"ccnet_original_nlines": 254,
"rps_doc_curly_bracket": 0.001988509902730584,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31440162658691406,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.026369169354438782,
"rps_doc_frac_lines_end_with_ellipsis": 0.0117647098377347,
"rps_doc_frac_no_alph_words": 0.3417849838733673,
"rps_doc_frac_unique_words": 0.3904052972793579,
"rps_doc_mean_word_length": 4.980148792266846,
"rps_doc_num_sentences": 96,
"rps_doc_symbol_to_word_ratio": 0.0030425998847931623,
"rps_doc_unigram_entropy": 5.524321556091309,
"rps_doc_word_count": 1209,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07972098141908646,
"rps_doc_frac_chars_dupe_6grams": 0.058462049812078476,
"rps_doc_frac_chars_dupe_7grams": 0.02790234051644802,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.011958150193095207,
"rps_doc_frac_chars_top_3gram": 0.016940709203481674,
"rps_doc_frac_chars_top_4gram": 0.017937220633029938,
"rps_doc_books_importance": -828.1116943359375,
"rps_doc_books_importance_length_correction": -828.1116943359375,
"rps_doc_openwebtext_importance": -492.03558349609375,
"rps_doc_openwebtext_importance_length_correction": -492.03558349609375,
"rps_doc_wikipedia_importance": -280.7265930175781,
"rps_doc_wikipedia_importance_length_correction": -280.7265930175781
},
"fasttext": {
"dclm": 0.02275538071990013,
"english": 0.9150718450546265,
"fineweb_edu_approx": 1.6313573122024536,
"eai_general_math": 0.7513596415519714,
"eai_open_web_math": 0.10188210010528564,
"eai_web_code": 0.07043111324310303
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,180,344,351,058,478,000 |
IT Answers » Virtualization security http://itknowledgeexchange.techtarget.com/itanswers Mon, 25 May 2015 08:29:51 +0000 en-US hourly 1 What is the best security tool out there to use to manage virtual machines? http://itknowledgeexchange.techtarget.com/itanswers/what-is-the-best-security-tool-out-there-to-use-to-manage-virtual-machines/ http://itknowledgeexchange.techtarget.com/itanswers/what-is-the-best-security-tool-out-there-to-use-to-manage-virtual-machines/#comments Wed, 22 Apr 2009 12:45:54 +0000 http://itknowledgeexchange.techtarget.com/itanswers/what-is-the-best-security-tool-out-there-to-use-to-manage-virtual-machines/feed/ 1 Are there any security implications of moving to virtualization in the data center? http://itknowledgeexchange.techtarget.com/itanswers/are-there-any-security-implications-of-moving-to-virtualization-in-the-data-center/ http://itknowledgeexchange.techtarget.com/itanswers/are-there-any-security-implications-of-moving-to-virtualization-in-the-data-center/#comments Fri, 24 Apr 2009 15:35:53 +0000 http://itknowledgeexchange.techtarget.com/itanswers/are-there-any-security-implications-of-moving-to-virtualization-in-the-data-center/feed/ 1 Multi-tenancy versus virtualization for cloud security http://itknowledgeexchange.techtarget.com/itanswers/multi-tenancy-versus-virtualization-for-cloud-security/ http://itknowledgeexchange.techtarget.com/itanswers/multi-tenancy-versus-virtualization-for-cloud-security/#comments Tue, 08 Feb 2011 19:46:33 +0000 In a cloud environment, multi-tenancy is something that has been questioned when it comes down to ensuring customers’ data security. Some have proposed virtualization as an alternative.
What is your take on multi-tenancy versus virtualization?
]]>
http://itknowledgeexchange.techtarget.com/itanswers/multi-tenancy-versus-virtualization-for-cloud-security/feed/ 2
Antivirus software for a virtual machine running Windows Server 2003 R2 http://itknowledgeexchange.techtarget.com/itanswers/antivirus-software-for-a-virtual-machine-running-windows-server-2003-r2/ http://itknowledgeexchange.techtarget.com/itanswers/antivirus-software-for-a-virtual-machine-running-windows-server-2003-r2/#comments Thu, 10 Feb 2011 18:15:00 +0000 What type of antivirus software should I put on a virtual machine running Windows Server 2003 R2?
]]>
http://itknowledgeexchange.techtarget.com/itanswers/antivirus-software-for-a-virtual-machine-running-windows-server-2003-r2/feed/ 7
ForeFront Features http://itknowledgeexchange.techtarget.com/itanswers/forefront-features/ http://itknowledgeexchange.techtarget.com/itanswers/forefront-features/#comments Wed, 14 Apr 2010 20:38:42 +0000 Can you elaborate just a bit on what features ForeFront delivers supporting Microsoft`s VDI strategy? Is it mostly on the compliance management and auditing side, or does it also contribute to alleviating anti-malware concerns? How do you diffirentiate Microsoft`s VDI from a security perspective from VMware or Citrix?
]]>
http://itknowledgeexchange.techtarget.com/itanswers/forefront-features/feed/ 0
Do you know of any cases when malware will detect a virtualized OS and exploit this fact? http://itknowledgeexchange.techtarget.com/itanswers/do-you-know-of-any-cases-when-malware-will-detect-a-virtualized-os-and-exploit-this-fact/ http://itknowledgeexchange.techtarget.com/itanswers/do-you-know-of-any-cases-when-malware-will-detect-a-virtualized-os-and-exploit-this-fact/#comments Mon, 22 Jun 2009 15:19:16 +0000 Do you know of any cases when malware will detect a virtualized OS and exploit this fact?
]]>
http://itknowledgeexchange.techtarget.com/itanswers/do-you-know-of-any-cases-when-malware-will-detect-a-virtualized-os-and-exploit-this-fact/feed/ 1
Our applications people are concerned with rogue guests affecting the performance of other guest and/or impacting the host. http://itknowledgeexchange.techtarget.com/itanswers/our-applications-people-are-concerned-with-rogue-guests-affecting-the-performance-of-other-guest-andor-impacting-the-host/ http://itknowledgeexchange.techtarget.com/itanswers/our-applications-people-are-concerned-with-rogue-guests-affecting-the-performance-of-other-guest-andor-impacting-the-host/#comments Thu, 17 Sep 2009 12:30:39 +0000 Our applications people are concerned with rogue guests affecting the performance of other guest and/or impacting the host. How do we alleviate their concerns? Is there a sepcific white-paper or technical artcile that addresses this issue?
This question is from the Microsoft Virtualization Live Chat which took place on August 27th.
]]>
http://itknowledgeexchange.techtarget.com/itanswers/our-applications-people-are-concerned-with-rogue-guests-affecting-the-performance-of-other-guest-andor-impacting-the-host/feed/ 0
Are there any special concerns that an organization should have around virtualization security that are unique to virtual machines? http://itknowledgeexchange.techtarget.com/itanswers/are-there-any-special-concerns-that-an-organization-should-have-around-virtualization-security-that-are-unique-to-virtual-machines/ http://itknowledgeexchange.techtarget.com/itanswers/are-there-any-special-concerns-that-an-organization-should-have-around-virtualization-security-that-are-unique-to-virtual-machines/#comments Thu, 20 Aug 2009 17:10:03 +0000 Are there any special concerns that an organization should have around virtualization security that are unique to virtual machines, or is it the same as physical machines? Why is Microsoft giving Hyper-V away for free?
This question is from the 7/30 Microsoft Virtualization Chat on ITKnowledgeExchange.com
]]>
http://itknowledgeexchange.techtarget.com/itanswers/are-there-any-special-concerns-that-an-organization-should-have-around-virtualization-security-that-are-unique-to-virtual-machines/feed/ 0
What are your biggest security fears related to storage virtualization? http://itknowledgeexchange.techtarget.com/itanswers/what-are-your-biggest-security-fears-related-to-storage-virtualization/ http://itknowledgeexchange.techtarget.com/itanswers/what-are-your-biggest-security-fears-related-to-storage-virtualization/#comments Mon, 13 Jul 2009 20:40:36 +0000 What do you perceive to be the biggest security flaws or threats related to storage virtualization today?
]]>
http://itknowledgeexchange.techtarget.com/itanswers/what-are-your-biggest-security-fears-related-to-storage-virtualization/feed/ 2
Virtual Machine Security http://itknowledgeexchange.techtarget.com/itanswers/security-5/ http://itknowledgeexchange.techtarget.com/itanswers/security-5/#comments Tue, 24 Mar 2009 18:40:48 +0000 http://itknowledgeexchange.techtarget.com/itanswers/security-5/feed/ 1
|
{
"url": "http://itknowledgeexchange.techtarget.com/itanswers/tag/virtualization/virtualization-security/feed/",
"source_domain": "itknowledgeexchange.techtarget.com",
"snapshot_id": "crawl=CC-MAIN-2015-22",
"warc_metadata": {
"Content-Length": "19401",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YTTEUIS4NCTISFIH3HY5E6IBKWKXAN4P",
"WARC-Concurrent-To": "<urn:uuid:957b98b4-97e9-4064-8ee5-411101233369>",
"WARC-Date": "2015-05-25T08:36:41Z",
"WARC-IP-Address": "206.19.49.161",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:VI3LQU3I2TXVONZTQN4KH2RSBYXDJC5S",
"WARC-Record-ID": "<urn:uuid:1c070855-b01a-49e0-a961-98ac16ca8adb>",
"WARC-Target-URI": "http://itknowledgeexchange.techtarget.com/itanswers/tag/virtualization/virtualization-security/feed/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:004aa1a7-8fd1-4cf7-9b1b-718343f88b89>"
},
"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,
1682,
1683,
1741,
1742,
1746,
1861,
2322,
2323,
2327,
2459,
2983,
2984,
2988,
3067,
3572,
3573,
3577,
3726,
4481,
4482,
4576,
4577,
4581,
4763,
5523,
5524,
5612,
5613,
5617,
5808,
6275,
6276,
6280,
6411
],
"line_end_idx": [
1682,
1683,
1741,
1742,
1746,
1861,
2322,
2323,
2327,
2459,
2983,
2984,
2988,
3067,
3572,
3573,
3577,
3726,
4481,
4482,
4576,
4577,
4581,
4763,
5523,
5524,
5612,
5613,
5617,
5808,
6275,
6276,
6280,
6411,
6675
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6675,
"ccnet_original_nlines": 34,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2154238373041153,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006373490206897259,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4333970844745636,
"rps_doc_frac_unique_words": 0.5076252818107605,
"rps_doc_mean_word_length": 12.032679557800293,
"rps_doc_num_sentences": 85,
"rps_doc_symbol_to_word_ratio": 0.006373490206897259,
"rps_doc_unigram_entropy": 5.1446685791015625,
"rps_doc_word_count": 459,
"rps_doc_frac_chars_dupe_10grams": 0.1042911484837532,
"rps_doc_frac_chars_dupe_5grams": 0.12674270570278168,
"rps_doc_frac_chars_dupe_6grams": 0.11913815140724182,
"rps_doc_frac_chars_dupe_7grams": 0.11913815140724182,
"rps_doc_frac_chars_dupe_8grams": 0.11913815140724182,
"rps_doc_frac_chars_dupe_9grams": 0.1042911484837532,
"rps_doc_frac_chars_top_2gram": 0.003621219890192151,
"rps_doc_frac_chars_top_3gram": 0.005975009873509407,
"rps_doc_frac_chars_top_4gram": 0.007966680452227592,
"rps_doc_books_importance": -790.4595947265625,
"rps_doc_books_importance_length_correction": -790.4595947265625,
"rps_doc_openwebtext_importance": -452.6530456542969,
"rps_doc_openwebtext_importance_length_correction": -452.6530456542969,
"rps_doc_wikipedia_importance": -274.1652526855469,
"rps_doc_wikipedia_importance_length_correction": -274.1652526855469
},
"fasttext": {
"dclm": 0.05532747879624367,
"english": 0.8027039766311646,
"fineweb_edu_approx": 1.6127351522445679,
"eai_general_math": 0.001818420016206801,
"eai_open_web_math": 0.060509320348501205,
"eai_web_code": 0.00005591000081039965
}
}
|
{
"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.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "1",
"label": "Truncated Snippets"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,855,775,404,687,653,000 |
Sep 122008
The Hyperlinked Society, the book I’ve referred to before, is a book which shares the common faults of printed versions of conferences. Though the very word “conference” suggests the possibility of a rich dialogue among participants, the printed version tends to suggest no attention paid to each other. Here, for instance, there are two chapters on maps and the Web — the second much better than the first — each covering much the same topics, but not noticeably referring to the other.
What makes all this more problematic than it might be is that the stated subject is poorly chosen. Hyperlinks are ways to move attention from one web page to another. They are vital for the web crawlers or spiders that allow search engines to work, and without them the web as it was about 20 years ago would never have come into being. But what about everything besides hyperlinks that go along with them? Compare this topic with having a conference on the effect of screw threads on society. It would be hard to imagine modern life without the use of screws, bolts, threaded pipes, and threaded jar caps, but, still, singling out this one invention used in so many different ways would not really get you too far. Watches and plumbing both relied on screw threads, but that connection is not very revealing about how watches or plumbing affected modern society.
Likewise, from the very first, the hyperlink was merely one link in the chain of inventions that have made the Web significant. Hyperlinks would not have been of much use had they not been preceded by the personal computer, the graphical user interface, the computer mouse, packet switching and the Internet backbone. Since Tim Berners-Lee came up with the Web framework, tens of thousands more software innovations have come pouring forth. These include browsers, bookmarks, bookmark bars, cookies, java, mp3’s, file sharing, php, SQL, pdf’s, web portals, blogging software, easy to use listservs, community sites (Craigslist), on-line auctions, a whole series of search engine algorithms, e-Bay, Amazon, Yahoo! and Google, WordPress, quicktime, social media, multiplayer games, Wikipedia and wikis in general, SecondLife, VOIP, cloud computing, etc. Plus the negatives such as computer viruses, worms, spam, phishing, etc. And all sorts of hardware innovations in connections to the Internet at both ends, such as cable modems, wi-fi, smart phones, digital cameras, search-engine server farms, and so considerably on. Some of this depended on the hyperlink, and some did not. Singling out this one invention leads only to murk.
Tighter and Stronger
Attention is basically not mentioned in the conference report, even though changing the direction of our attention is what selecting a hyperlink most universally does. It is much more fundamental to see the Web in terms of attention than in terms of the technical device of hyperlinks. As each new invention of software or any other form of expression is added via the Web, the resources that can be used or rearranged for future additions grow, and the more people will find some way to channel their attention through it, leading to still more inventions, which, not so incidentally, are modes of attention getting in their own right. As is also not said, as this goes on, the effect is that new modes of attention getting and attention paying are added. No matter what personal tastes, styles, predilections, attitudes, and forms of comfort someone has, some aspect of the Web is likely to be able to fit with them, to provide channels of attention highly suited to all that. And the fit will continue to get better and better. (Even those now not linked at all, with no computers or modems, for instance, will be pulled in through new hardware initiatives and inventions as well as more complelling software of all sorts.An interesting example of how the attraction increases and changes with new resources such as Facebook and Twitter and continuous updating of minor news of each person involved is offered in “I’m so Totally, Digitally Close to You,” by Clive Thompson in the NY Times.)
These reflections suggest a key prediction, not found in the book, of course. The Internet, which encompasses the Web and more, and its attendant devices and software together are like a single giant and growing Black Hole, pulling us all in faster and faster, and ending up much more attractive than all else. And just as light is not released by an ordinary black hole, attention is more and more tightly held through this all, where instant or very fast responses are the standard. (More than ever, traveling far away in space, say to Mars, would put one out of the loop, and probably unacceptably so. While the real worlds of the Internet expand to include all sorts of “virtual worlds,” the reality of the planets fades in importance. When we travel inward to virtual worlds, we find many others there; by comparison the planets are barren, devoid of anyone who can pay us attention, and far less evocative.)
But What About the “Real World”?
David Weinberger, at the end of his piece in the book, comments on people who fear that Web users will ignore “the ‘real’ world,” and then he adds a footnote to point out that he puts quotes around “real” because there is “only one world.” His point of course is that there is nothing unreal about the Web. I wouldn’t say it is much use to assert, for these purposes, that there is only one world, for each person has a certain horizon of attention the uniquely defines what, practically speaking is this person’s world. Seeing the Internet as black hole means that the parts of it that each person connects to more and more tightly is an increasing part of that person’s reality.
The word “real,” as in “get real” is of course often used pejoratively, to imply someone is not dealing with “reality.” Reality in that formulation can mean “economic reality — i.e. the old money economy — or simply material reality, as in, say, tables, chairs and breakfast cereal. But in fact reality for each person not only continually changes but is refracted an reflected through the minds of other people. The growing Internet is increasingly the channel of that refraction and reflection, that re-pointing of attention to what now becomes most real.
“Real,” then suggests a contrast with “unreal,” but the latter can mean ideal or abstract, as in mathematical truths, or wishful thoughts, hallucinations, paranoid fears, or simply works in progress, (not yet “realized”) or simply the so-called virtual worlds instantiated by such “games” as SecondLife. If each person has in effect her own world defined by the reaches of her attention, it will contain some elements of all of these, but the parts that can be viewed as real are the parts that cannot be changed purely by that person’s wishes or emotional changes without the intervention of others, but can be changed when others agree. Within the new black hole of the web, even mathematics (or religious truths) ceases to be purely an unchangeable ideal but rather depends on agreement among a circle of others. Some supposed “real world” entities, such as prices, lose a clear claim to reality, while other entities, like global warming, which cannot be individually perceived, increase in reality, because they emerge in a new consensus. We —or rather, some of us— are more and more in touch with aspects of the old “concrete reality” that we would be kept from were it not for the Net.
How that effects our psyches I will say more of in the next installment.
Leave a Reply
(required)
(required)
*
You may use these HTML tags and attributes: <a href="" title=""> <abbr title=""> <acronym title=""> <b> <blockquote cite=""> <cite> <code> <del datetime=""> <em> <i> <q cite=""> <strike> <strong>
|
{
"url": "http://goldhaber.org/the-web-as-black-hole/",
"source_domain": "goldhaber.org",
"snapshot_id": "crawl=CC-MAIN-2017-22",
"warc_metadata": {
"Content-Length": "79577",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:H7XKDYCNZSURFIROSXSTNU2CCCDJEZZB",
"WARC-Concurrent-To": "<urn:uuid:6038bcb8-fdd6-4c87-a34e-bbf57112aa63>",
"WARC-Date": "2017-05-24T15:32:01Z",
"WARC-IP-Address": "65.254.227.224",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IZVAOYAEZNX3GRHRFZWA36JEDCGKL72M",
"WARC-Record-ID": "<urn:uuid:8de72365-bdfa-46d8-912f-4085eb585b75>",
"WARC-Target-URI": "http://goldhaber.org/the-web-as-black-hole/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f678df91-d0ef-42b1-a00d-459063a4b04b>"
},
"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,
11,
13,
14,
503,
504,
1368,
1369,
2599,
2600,
2621,
2622,
4116,
4117,
5031,
5032,
5065,
5066,
5747,
5748,
6306,
6307,
7500,
7501,
7574,
7575,
7590,
7591,
7602,
7603,
7614,
7615,
7616,
7618,
7619
],
"line_end_idx": [
11,
13,
14,
503,
504,
1368,
1369,
2599,
2600,
2621,
2622,
4116,
4117,
5031,
5032,
5065,
5066,
5747,
5748,
6306,
6307,
7500,
7501,
7574,
7575,
7590,
7591,
7602,
7603,
7614,
7615,
7616,
7618,
7619,
7814
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7814,
"ccnet_original_nlines": 34,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.46037736535072327,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0050314501859247684,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16792452335357666,
"rps_doc_frac_unique_words": 0.447408527135849,
"rps_doc_mean_word_length": 4.75,
"rps_doc_num_sentences": 51,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.664079666137695,
"rps_doc_word_count": 1312,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.008664960041642189,
"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.010590500198304653,
"rps_doc_frac_chars_top_3gram": 0.005295250099152327,
"rps_doc_frac_chars_top_4gram": 0.005776640027761459,
"rps_doc_books_importance": -758.6693725585938,
"rps_doc_books_importance_length_correction": -758.6693725585938,
"rps_doc_openwebtext_importance": -387.4517822265625,
"rps_doc_openwebtext_importance_length_correction": -387.4517822265625,
"rps_doc_wikipedia_importance": -247.58837890625,
"rps_doc_wikipedia_importance_length_correction": -247.58837890625
},
"fasttext": {
"dclm": 0.07836788892745972,
"english": 0.9518193602561951,
"fineweb_edu_approx": 2.7294633388519287,
"eai_general_math": 0.6038210391998291,
"eai_open_web_math": 0.3137490749359131,
"eai_web_code": 0.2706327438354492
}
}
|
{
"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": "303.48",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social sciences — Dictionaries"
}
}
},
"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": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-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": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,014,355,304,308,220,000 |
Last Comment Bug 457801 - Implement -moz-placeholder pseudo-class
: Implement -moz-placeholder pseudo-class
Status: RESOLVED FIXED
: dev-doc-complete
Product: Core
Classification: Components
Component: CSS Parsing and Computation (show other bugs)
: Trunk
: All All
: P1 enhancement with 4 votes (vote)
: mozilla2.0b5
Assigned To: Mounir Lamouri (:mounir)
:
Mentors:
http://phroggy.com/placeholder.html
Depends on: 590418 609162 657861
Blocks: 457800 547224 551545 566348
Show dependency treegraph
Reported: 2008-09-29 19:34 PDT by Andy Lyttle
Modified: 2013-04-23 09:32 PDT (History)
29 users (show)
mounir: in‑testsuite+
See Also:
Crash Signature:
(edit)
QA Whiteboard:
Iteration: ---
Points: ---
Has Regression Range: ---
Has STR: ---
betaN+
Attachments
Patch - WIP (7.47 KB, patch)
2010-04-06 08:59 PDT, Mounir Lamouri (:mounir)
no flags Details | Diff | Review
Patch v1 (29.85 KB, patch)
2010-08-06 10:23 PDT, Mounir Lamouri (:mounir)
no flags Details | Diff | Review
Patch v2 (27.52 KB, patch)
2010-08-16 13:50 PDT, Mounir Lamouri (:mounir)
dbaron: review-
Details | Diff | Review
Patch v2.1 (9.27 KB, patch)
2010-08-22 19:37 PDT, Mounir Lamouri (:mounir)
no flags Details | Diff | Review
Patch v2.2 (33.60 KB, patch)
2010-08-22 19:38 PDT, Mounir Lamouri (:mounir)
dbaron: review+
Details | Diff | Review
Patch v2.3 (34.44 KB, patch)
2010-08-22 23:43 PDT, Mounir Lamouri (:mounir)
mounir: review+
Details | Diff | Review
Part 1 - Implement the pseudo-class (34.45 KB, patch)
2010-08-24 11:57 PDT, Mounir Lamouri (:mounir)
no flags Details | Diff | Review
Part 2 - Fix XUL textbox default placeholder style (2.96 KB, patch)
2010-08-24 12:01 PDT, Mounir Lamouri (:mounir)
no flags Details | Diff | Review
Part 2 (v1.1) - Fix XUL textbox default placeholder style (2.96 KB, patch)
2010-08-24 12:18 PDT, Mounir Lamouri (:mounir)
dao+bmo: review+
Details | Diff | Review
Fix :-moz-placeholder reftests. (1.33 KB, patch)
2010-08-24 16:58 PDT, Mounir Lamouri (:mounir)
no flags Details | Diff | Review
Description Andy Lyttle 2008-09-29 19:34:01 PDT
Gray is a good default when the background-color is white and text color is black, but when that's not the case, it may be appropriate to specify a color for the placeholder text.
I've also submitted this here:
https://bugs.webkit.org/show_bug.cgi?id=21227
Comment 1 Boris Zbarsky [:bz] (Out June 25-July 6) 2009-02-17 08:41:13 PST
What would the CSS property do when applied to other elements?
I'm not sure we want a whole bunch of per-element properties; a pseudo-element may make more sense here in some ways.
Comment 2 Mounir Lamouri (:mounir) 2010-02-12 09:03:33 PST
Indeed, I think we should do a pseudo element, like webkit.
However, I will write a patch with a pseudo element named -moz-placeholder for input and textarea.
Comment 3 d 2010-02-19 07:31:48 PST
I guess we would keep the same syntax as the one implemented in Webkit now?
Comment 4 David Baron :dbaron: ⌚️UTC-7 (review requests must explain patch) 2010-02-26 11:40:33 PST
Nominating for blocking1.9.3, since given that we've added support for placeholder, we should probably have a mechanism for styling it.
Comment 5 Dão Gottwald [:dao] 2010-02-27 05:26:32 PST
Why would this be a pseudo element rather than a pseudo class?
Comment 6 David Baron :dbaron: ⌚️UTC-7 (review requests must explain patch) 2010-02-27 10:17:09 PST
There was a long thread on pseudo-element vs. pseudo-class here:
http://lists.whatwg.org/pipermail/whatwg-whatwg.org/2010-February/thread.html#25190
I summarized my opinions in http://lists.whatwg.org/pipermail/whatwg-whatwg.org/2010-February/025209.html
Comment 7 Mounir Lamouri (:mounir) 2010-02-27 11:00:10 PST
My personal feeling is that the pseudo-class is not needed. I don't think there is a real need to style inputs regarding their placeholder attribute. Otherwise, we want to style the placeholder text.
Anyway, it would be better to move to a consensus before implementing something ?
Boris and David, as you took part of the discussion, what is your opinion ? Should I ask the www-style ml ?
Comment 8 d 2010-03-03 10:34:38 PST
Looks like we already have a psuedo-class called ":-moz-placeholder" (see bug 11011).
Comment 9 Boris Zbarsky [:bz] (Out June 25-July 6) 2010-03-03 10:40:08 PST
We can rename that if needed; it's purely internal.
Comment 10 Boris Zbarsky [:bz] (Out June 25-July 6) 2010-03-03 10:41:00 PST
I don't have a good answer to comment 7, really. David's opinion is linked to from comment 6.
Comment 11 Robert Kaiser (not working on stability any more) 2010-03-08 04:44:01 PST
(In reply to comment #7)
> My personal feeling is that the pseudo-class is not needed. I don't think there
> is a real need to style inputs regarding their placeholder attribute.
> Otherwise, we want to style the placeholder text.
There surely is a need for styling the placeholder text - esp. its color, as the textbox can get a different background color as well through CSS, so the color of the text rendered on it need to be styleable as well.
Comment 12 Mounir Lamouri (:mounir) 2010-03-08 06:57:07 PST
I've launch a discussion about it on www-style, see: http://lists.w3.org/Archives/Public/www-style/2010Mar/0095.html
If no consensus (or answers) come from this discussion, I will probably implement it via a pseudo-element. I found it better and it corresponds to the way Webkit implemented it.
Comment 13 Alfred Kayser 2010-03-30 02:05:33 PDT
Note, Bug 547224 - Remove the custom emptyText implementation, implement textbox.placeholder using the input field's native placeholder facility
is depending on this one, and actually uses -moz-placeholder (but later commented out). Without -moz-placeholder implemented, it is no longer possible to style the placeholder text (previously emptyText) in themes.
This is a kind of regression that should be fixed.
Comment 14 Mounir Lamouri (:mounir) 2010-04-06 08:59:26 PDT
Created attachment 437309 [details] [diff] [review]
Patch - WIP
This patch is a first try for -moz-placeholder pseudo-element but I got a lot of issues and I don't have any clue of why:
- default placeholder style is never used even if not overwritten by the pseudo-element ;
- placeholder text is never hidden ;
(I would say the classes are not applied)
- sometimes the placeholder text forgets the -moz-placeholder styling (when I unfocus) and it comes back when the mouse is hover ;
- this assertion pops up:
###!!! ASSERTION: scrollbars should not have been created: 'result.mHorizontal != NS_STYLE_OVERFLOW_VISIBLE && result.mHorizontal != NS_STYLE_OVERFLOW_CLIP && result.mVertical != NS_STYLE_OVERFLOW_VISIBLE && result.mVertical != NS_STYLE_OVERFLOW_CLIP', file /home/volkmar/projects/mozilla/mozilla-central/src/layout/generic/nsGfxScrollFrame.cpp, line 1936
As that's my first CSS patch, I'm a bit lost in the code base so if someone has any hint...
Comment 15 Boris Zbarsky [:bz] (Out June 25-July 6) 2010-04-06 09:04:51 PDT
Hmm. The issue with the approach you took is that you're clobbering the "correct" style context (the one that has the rules from forms.css, etc) with the pseudo-element style context.
If we want to make this a pseudo-element and keep using the anonymous-content infrastructure for it (where there's actually a real element), then we need to sort out how we want the pseudo-element rules to interact with the rules applied to the content itself. How do we want those to work?
The other option is to have anonymous content support a pseudo-element tag when resolving the style and then we can just move all the rules in forms.css into the pseudo-element block... except then the restriction rule will kill us.
Comment 16 Mounir Lamouri (:mounir) 2010-04-06 10:11:06 PDT
(In reply to comment #15)
> Hmm. The issue with the approach you took is that you're clobbering the
> "correct" style context (the one that has the rules from forms.css, etc) with
> the pseudo-element style context.
>
> If we want to make this a pseudo-element and keep using the anonymous-content
> infrastructure for it (where there's actually a real element), then we need to
> sort out how we want the pseudo-element rules to interact with the rules
> applied to the content itself. How do we want those to work?
If I get correctly your question, I would say, the pseudo-element rules should override the content rules because the pseudo-element rules are going to be restricted enough. But I'm not sure that's what you were asking.
Anyway, I've no idea how I can have both kind of rules used at the same time.
> The other option is to have anonymous content support a pseudo-element tag when
> resolving the style and then we can just move all the rules in forms.css into
> the pseudo-element block... except then the restriction rule will kill us.
Indeed, at the moment only 1 properties out of 6 will be accepted.
Comment 17 Boris Zbarsky [:bz] (Out June 25-July 6) 2010-04-06 10:20:58 PDT
> Anyway, I've no idea how I can have both kind of rules used at the same time.
You could resolve style for the pseudo-element, then grab those rules and use them to modify the style for the anonymous content. Not sure how to make the restriction rule thing work in that situation, though.
Comment 18 Mounir Lamouri (:mounir) 2010-04-07 05:29:37 PDT
I don't know how I can get those rules. I think I can add rules to the style context with |ResolveStyleByAddingRules| but how do I find the rules to add ? I can recreate them like like |BuildStyleRule| from nsStyleAnimation [1] but I do not think that is the best idea.
In addition, |ResolveStyleByAddingRules| will not be really helpful to hide the placeholder because I will have to remove a rule.
Some help would be really appreciated !
[1]http://mxr.mozilla.org/mozilla-central/source/layout/style/nsStyleAnimation.cpp#928
Comment 19 Boris Zbarsky [:bz] (Out June 25-July 6) 2010-04-07 05:37:10 PDT
> I don't know how I can get those rules.
Resolve a style context for the pseudo-element; then the relevant rules can be gotten off the style context's rulenode and its parents.
> In addition, |ResolveStyleByAddingRules| will not be really helpful to hide
> the placeholder because I will have to remove a rule.
Yeah, that's an issue.
> Some help would be really appreciated !
Basically, as long as we want to have both pseudo-element styles _and_ normal styles applying to the same node we're out of the "style system is designed to do this" field and into the woods. Help would involve style system design changes (which means pinning down exactly what you want to do) or finding another way to do this.
Here's a question. Does the pseudo-element style need to apply to the div in this case, or could it apply to a kid of the div?
Comment 20 Mounir Lamouri (:mounir) 2010-04-07 05:53:57 PDT
(In reply to comment #19)
> > I don't know how I can get those rules.
>
> Resolve a style context for the pseudo-element; then the relevant rules can be
> gotten off the style context's rulenode and its parents.
I can try that.
> > Some help would be really appreciated !
>
> Basically, as long as we want to have both pseudo-element styles _and_ normal
> styles applying to the same node we're out of the "style system is designed to
> do this" field and into the woods. Help would involve style system design
> changes (which means pinning down exactly what you want to do) or finding
> another way to do this.
I'm not looking to changes in the style system. Just to find a way to make that pseudo-element working.
> Here's a question. Does the pseudo-element style need to apply to the div in
> this case, or could it apply to a kid of the div?
The placeholder div has a kid which is a text node. It would be possible to apply the pseudo-element styling to the text node only ?
Comment 21 Boris Zbarsky [:bz] (Out June 25-July 6) 2010-04-07 06:35:55 PDT
Not without breaking more style system invariants, but it _would_ be possible to set up a DOM like:
<div><span>text</span></div>
and apply the pseudo-element styling to the <span>...
Comment 22 Mounir Lamouri (:mounir) 2010-04-08 17:03:09 PDT
If I do:
<div><span>text</span></div> or even <div><div>text</div></div>
Whatever is the style I try to apply to the span, it is not working. If I try to apply the pseudo element to the div and the content style to the span, I see the pseudo element style. The opposite shows the content style.
In addition, whit these changes, I got those asserts:
###!!! ASSERTION: pseudo type mismatch: 'aOldStyleContext->HasPseudoElementData() == aNewStyleContext->HasPseudoElementData()', file /home/volkmar/projects/mozilla/mozilla-central/src/layout/style/nsTransitionManager.cpp, line 401
###!!! ASSERTION: Some pres arena objects were not freed: 'mPresArenaAllocCount == 0', file /home/volkmar/projects/mozilla/mozilla-central/src/layout/base/nsPresShell.cpp, line 1533
If I do not try to set a style to the span, I do not get the asserts.
Another time, if you have an idea... ?
Comment 23 Boris Zbarsky [:bz] (Out June 25-July 6) 2010-04-08 19:16:11 PDT
> Whatever is the style I try to apply to the span, it is not working.
Did you also reparent the style context for the textnode?
The assert is expected given the "set the style context later" approach and harmless for us (only affects CSS transitions); in practice we'd need to somehow flag the pseudo-element on the anonymous content we hand over to the frame constructor.
Comment 24 Mounir Lamouri (:mounir) 2010-04-12 07:47:20 PDT
(In reply to comment #23)
> > Whatever is the style I try to apply to the span, it is not working.
>
> Did you also reparent the style context for the textnode?
I don't know how I should do that. I tried to set the parent pointer by getting it from GetParent() but it didn't changed anything.
I'm probably doing it the wrong way.
I'm also trying the solution you mentioned in comment 19 because it is probably better but when the page is loaded I got the content style and when I put the cursor on the text field, the style is changing for the pseudo element one. So, I still can't get both style working together.
I don't know why the style is changing when the cursor is on the text field. I got this warning when the style is changing:
###!!! ASSERTION: scrollbars should not have been created: 'result.mHorizontal
!= NS_STYLE_OVERFLOW_VISIBLE && result.mHorizontal != NS_STYLE_OVERFLOW_CLIP &&
result.mVertical != NS_STYLE_OVERFLOW_VISIBLE && result.mVertical !=
NS_STYLE_OVERFLOW_CLIP', file
/home/volkmar/projects/mozilla/mozilla-central/src/layout/generic/nsGfxScrollFrame.cpp,
line 1936
It comes from a reflow but I don't know if the reflow is a cause or a consequence of the style change.
By the way, I'm changing the style like this (in nsTextControlFrame::SetInitialChildList):
nsIFrame* phFrame = GetLastChild(nsnull);
nsCSSPseudoElements::Type pseudoType = nsCSSPseudoElements::ePseudo_mozPlaceholder;
nsRefPtr<nsStyleContext> newStyleContext;
nsStyleContext* curStyleContext;
newStyleContext = phFrame->PresContext()->PresShell()->StyleSet()->
ResolvePseudoElementStyle(phFrame->GetContent(), pseudoType, phFrame->GetParent()->GetStyleContext());
curStyleContext = phFrame->GetStyleContext();
nsRuleNode* ruleNode = curStyleContext->GetRuleNode();
nsCOMArray<nsIStyleRule> rules;
for (;ruleNode;) {
nsCOMPtr<nsICSSStyleRule> cssRule = do_QueryInterface(ruleNode->GetRule());
if (cssRule) {
nsAutoString cssText;
cssRule->GetCssText(cssText);
printf(" === Adding a rule: %s\n", NS_ConvertUTF16toUTF8(cssText).get());
} else {
printf(" === Adding non-css rule\n");
}
rules.AppendObject(ruleNode->GetRule());
ruleNode = ruleNode->GetParent();
}
newStyleContext = phFrame->PresContext()->PresShell()->StyleSet()->
ResolveStyleByAddingRules(newStyleContext, rules);
if (newStyleContext) {
phFrame->SetStyleContext(newStyleContext);
newStyleContext->AddRef();
}
Comment 25 Tantek Çelik 2010-06-03 11:12:30 PDT
While I do think both a pseudo-class for indicating an input element in the state of having nothing but a placeholder, and a pseudo-element for selecting the placholder text/background itself is useful, I tend to agree with Tab's summary:
http://lists.w3.org/Archives/Public/www-style/2010Mar/0158.html
Thus I think a pseudo-element has more well defined use cases and thus if we are only implementing one thing for this, we should implement:
::-moz-placeholder
using the Selectors convention of double-colons for pseudo-elements.
Which could be styled like
input::-moz-placeholder {color:#999; background-color:#fff}
However, Tab also makes the important comparison to the ::value pseudo-element.
[1] http://www.w3.org/TR/css3-ui/#pseudo-value
::value provides a more generally applicable solution across form elements (and use cases), and thus we could instead implement the already defined ::value pseudo-element *and* a new :-moz-placeholder pseudo-class.
For the use case of styling placeholder text then, that could styled as follows:
input:-moz-placeholder::value {color:#999; background-color:#fff}
This would also nicely address all the use cases raised on this thread so far.
Frankly I think this is better path forward because ::value will be useful on many more input/form elements than ::-moz-placeholder and I'd rather have the general ::value pseudo than have to create a bunch of new pseudo-elements for each input element type and attribute that we get from HTML5.
Comment 26 Mounir Lamouri (:mounir) 2010-06-03 11:16:09 PDT
Tantek, do you think the -moz-placeholder pseudo-element should be limited to some properties like first-line ?
Comment 27 Tantek Çelik 2010-06-03 11:48:20 PDT
Yes absolutely. ::first-line is a good starting point for figuring out the small subset of properties that should apply to ::value (or ::-moz-placeholder).
Comment 28 Damon Sicore (:damons) 2010-06-18 14:24:09 PDT
Bumping this to beta2 per beta re-triage with dbaron. If this should indeed block beta1, please re-nom.
Comment 29 Robert Kaiser (not working on stability any more) 2010-06-18 16:05:43 PDT
I hope work continues and we get it for final, currently, textboxes with placeholder look rather ugly or even unreadable in some custom themes, possibly even some system themes that have different color schemes.
Comment 30 Mike Beltzner [:beltzner, not reading bugmail] 2010-07-19 16:05:58 PDT
Moving to betaN - requires beta coverage, no specific beta milestone targetted at this time.
Comment 31 Mounir Lamouri (:mounir) 2010-08-05 04:31:48 PDT
(In reply to comment #25)
> While I do think both a pseudo-class for indicating an input element in the
> state of having nothing but a placeholder, and a pseudo-element for selecting
> the placholder text/background itself is useful, I tend to agree with Tab's
> summary:
>
> http://lists.w3.org/Archives/Public/www-style/2010Mar/0158.html
>
> Thus I think a pseudo-element has more well defined use cases and thus if we
> are only implementing one thing for this, we should implement:
>
> ::-moz-placeholder
>
> using the Selectors convention of double-colons for pseudo-elements.
>
> Which could be styled like
>
> input::-moz-placeholder {color:#999; background-color:#fff}
>
> However, Tab also makes the important comparison to the ::value pseudo-element.
>
> [1] http://www.w3.org/TR/css3-ui/#pseudo-value
>
> ::value provides a more generally applicable solution across form elements (and
> use cases), and thus we could instead implement the already defined ::value
> pseudo-element *and* a new :-moz-placeholder pseudo-class.
>
> For the use case of styling placeholder text then, that could styled as
> follows:
>
> input:-moz-placeholder::value {color:#999; background-color:#fff}
>
> This would also nicely address all the use cases raised on this thread so far.
>
> Frankly I think this is better path forward because ::value will be useful on
> many more input/form elements than ::-moz-placeholder and I'd rather have the
> general ::value pseudo than have to create a bunch of new pseudo-elements for
> each input element type and attribute that we get from HTML5.
I misread your comment the first time. I thought you agreed with ::placeholder but actually, it sounds you are more behind :placeholder.
I have to comments regarding your suggestion:
- I think I like the idea of the pseudo-class actually because it would let the authors style the input when the placeholder is shown. Which could be used to have a (very) light gray background when the placeholder is shown ala Aero for example.
- Do you have more documentation about ::value? I can't really get the exact meaning with http://www.w3.org/TR/css3-ui/#pseudo-value . I mean, I don't really get why we would need that in addition of the pseudo-class?
Given that David also prefer the pseudo-class solution maybe we could do that? I think it could be quite easier to implement too.
Comment 32 Tantek Çelik 2010-08-05 16:44:33 PDT
Yes, let's implement just the ::-moz-placeholder pseudo-class for these use cases, see how it works in practice and if there is any evidence of an additional need for a ::value pseudo-element or not.
Comment 33 Mounir Lamouri (:mounir) 2010-08-06 10:23:03 PDT
Created attachment 463588 [details] [diff] [review]
Patch v1
So, :-moz-placeholder is working if @placeholder is set (even if equals to the empty string), the element isn't focused and it's value is the empty string.
Comment 34 Anthony Ricaud (:rik) 2010-08-06 14:01:58 PDT
Although I like the additional functionality that a pseudo-class permits, I'm not sure the naming is clear. The pseudo-class name should convey a sense of state. The only alternative I can think of right now is :-moz-placeholder-visible.
Having a different name would also help authors differentiate our pseudo-class with the WebKit pseudo-element.
Comment 35 Boris Zbarsky [:bz] (Out June 25-July 6) 2010-08-12 00:03:46 PDT
This conflicts with the patch in bug 580575. Furthermore, to merge them you have to change all the places that use event state to use an unsigned int.... Perhaps ideally even an nsEventState typedef which will be PRUint32 for now and become PRUint64 once we need more states?
Comment 36 Boris Zbarsky [:bz] (Out June 25-July 6) 2010-08-12 00:06:16 PDT
Do we actually call Blur or Focus when the user clicks the control?
Comment 37 Mounir Lamouri (:mounir) 2010-08-16 13:50:59 PDT
Created attachment 466417 [details] [diff] [review]
Patch v2
Moving the review to dbaron given that Boris in on vacation this week.
For ::Blur and ::Focus issue mentioned by Boris in comment 36, I've just removed the code from there because it was not called when the focus/blur was coming from a click. Actually, IntrinsicState() is called multiple times when a focus is done. So, for the moment all tests pass without specific call to update content states. I don't think it would be easy to know when the element has been focused from nsHTMLInputElement but having that done from nsTextControlFrame should be easy. Let me know if you want me to add that David (or having tests succeeded is enough right now?).
About other Boris comment (comment 35), this bug will probably be landed before bug 580575 so I will probably do the merge in bug 580575. But in any case, I guess it's no big deal. For nsEventState type I agree but I would see that as a follow-up (of bug 580575 maybe?).
Comment 38 Mounir Lamouri (:mounir) 2010-08-17 13:06:30 PDT
(In reply to comment #37)
> For ::Blur and ::Focus issue mentioned by Boris in comment 36, I've just
> removed the code from there because it was not called when the focus/blur was
> coming from a click. Actually, IntrinsicState() is called multiple times when a
> focus is done. So, for the moment all tests pass without specific call to
> update content states. I don't think it would be easy to know when the element
> has been focused from nsHTMLInputElement but having that done from
> nsTextControlFrame should be easy. Let me know if you want me to add that David
> (or having tests succeeded is enough right now?).
I guess it can be easily done in ::PostHandleEVent too.
Comment 39 David Baron :dbaron: ⌚️UTC-7 (review requests must explain patch) 2010-08-21 22:55:02 PDT
I'm a little confused trying to understand this patch: I see calls to a PlaceholderApplies method, but I don't see that method in the tree or added in the patch.
Comment 40 David Baron :dbaron: ⌚️UTC-7 (review requests must explain patch) 2010-08-21 23:03:50 PDT
A few other comments:
Maybe you should handle the ContentStatesChanged notification in SetValueChanged for both elements, both because:
* it makes the code more consistent
* it looks like you're missing a codepath (nsHTMLInputElement::Reset) on the input element
It seems like you also need to set ContentStateChanged notifications for the placeholder state when the control's focus changes. (I'm not sure if there are situations currently where focus changes wouldn't cause restyling... but it still seems wrong, and could break if we optimize event state changes differently.)
I also need to figure out what the right thing to do when the placeholder attribute changes.
Finally, you'd need to send notifications when PlaceholderApplies() changes, whatever that does. (Were you thinking of factoring out the HasAttr(None, placeholder) calls into a method?)
Comment 41 David Baron :dbaron: ⌚️UTC-7 (review requests must explain patch) 2010-08-21 23:10:46 PDT
Yeah, I think you also just need to send ContentStatesChanged when the placeholder attribute changes.
Comment 42 David Baron :dbaron: ⌚️UTC-7 (review requests must explain patch) 2010-08-21 23:41:45 PDT
Sounds like PlaceholderApplies is in bug 553097.
That means that in AfterSetAttr, you need to add the placeholder event state to the really long list of event states that can potentially change when the type of a control changes.
Comment 43 David Baron :dbaron: ⌚️UTC-7 (review requests must explain patch) 2010-08-21 23:47:47 PDT
It's possible I'm getting some of this wrong and that bz will correct me, but I don't see any magic handling of IntrinsicState changes across attribute changes. I *think* we still need to send ContentStatesChanged notifications for when attribute changes cause changes in IntrinsicState.
Comment 44 David Baron :dbaron: ⌚️UTC-7 (review requests must explain patch) 2010-08-21 23:53:23 PDT
Ah, ok, there is such code in nsGenericElement::SetAttrAndNotify as Mounir points out. So you can ignore my comments about handling placeholder attribute changes.
That said, now I wonder why we have the big switch for handling of type changes in nsHTMLInputElement::AfterSetAttr. Maybe it's not needed anymore. But given that we have it, you should probably add this new state bit to the big constant; after all, it's just a constant.
But the issues with Reset and focus changes are still present. (Though I wonder if my suggestion would break a case in which aSetValueChanged is false... I think it might.)
Comment 45 Mounir Lamouri (:mounir) 2010-08-22 19:37:35 PDT
Created attachment 468205 [details] [diff] [review]
Patch v2.1
I've added the requested ContentStatesChanged calls:
- value change in ::OnValueChanged
- focus/blur in ::PostHandleEvent
- type change in ::AfterSetAttr
And I've added tests for type change and reset() call. All of them were passing without the changes...
Comment 46 Mounir Lamouri (:mounir) 2010-08-22 19:38:21 PDT
Created attachment 468206 [details] [diff] [review]
Patch v2.2
Damn, wrong file... :/
Comment 47 Mounir Lamouri (:mounir) 2010-08-22 19:40:37 PDT
And I've introduced PlaceholderApplies in this patch considering bug 553097 will not land for beta5 (and not have to) because it depends on a layout bug that no assignee yet. This removes the dependency.
Comment 48 David Baron :dbaron: ⌚️UTC-7 (review requests must explain patch) 2010-08-22 23:17:37 PDT
Comment on attachment 468206 [details] [diff] [review]
Patch v2.2
The focus check in PostHandleEvent should check HasAttr in both cases and PlaceholderApplies in the input case.
(Should the OnValueChanged also check PlaceholderApplies, or does it only get called for text controls?)
r=dbaron with that
Comment 49 Mounir Lamouri (:mounir) 2010-08-22 23:31:25 PDT
(In reply to comment #48)
> Comment on attachment 468206 [details] [diff] [review]
> Patch v2.2
>
> The focus check in PostHandleEvent should check HasAttr in both cases and
> PlaceholderApplies in the input case.
>
> (Should the OnValueChanged also check PlaceholderApplies, or does it only get
> called for text controls?)
Gasp. I'm stupid! By the way, OnValueChanged is a TextControlState method but it's called by radio elements for some reasons so, I'm going to add PlaceholderApplies in that.
> r=dbaron with that
Thank you for the review :)
Comment 50 Mounir Lamouri (:mounir) 2010-08-22 23:43:37 PDT
Created attachment 468247 [details] [diff] [review]
Patch v2.3
r=dbaron
Comment 51 Mounir Lamouri (:mounir) 2010-08-23 23:23:12 PDT
The try server do not like this patch. Some logs:
http://tinderbox.mozilla.org/showlog.cgi?log=MozillaTry/1282595957.1282596631.24315.gz
http://tinderbox.mozilla.org/showlog.cgi?log=MozillaTry/1282597903.1282598764.1306.gz
There are two kinds of failures:
- XUL textboxes don't have the default placeholder style. It looks like the state is correctly set (in ::IntrinsicState) for the input/textarea inside the XUL textbox but for I don't know why, the style doesn't apply...
- Some of my reftests are failing but not on my computer and the images I got from the try server doesn't show an obvious problem... I can't get how this patch can lead to that. I will investigate tomorrow.
Comment 52 David Baron :dbaron: ⌚️UTC-7 (review requests must explain patch) 2010-08-23 23:29:07 PDT
(In reply to comment #51)
> The try server do not like this patch. Some logs:
> http://tinderbox.mozilla.org/showlog.cgi?log=MozillaTry/1282595957.1282596631.24315.gz
> http://tinderbox.mozilla.org/showlog.cgi?log=MozillaTry/1282597903.1282598764.1306.gz
>
> There are two kinds of failures:
> - XUL textboxes don't have the default placeholder style. It looks like the
> state is correctly set (in ::IntrinsicState) for the input/textarea inside the
> XUL textbox but for I don't know why, the style doesn't apply...
Are you styling :-moz-placeholder on the input inside the textbox or on the textbox itself?
> - Some of my reftests are failing but not on my computer and the images I got
> from the try server doesn't show an obvious problem... I can't get how this
> patch can lead to that. I will investigate tomorrow.
layout/tools/reftest/reftest-analyzer.xhtml may help: it can load a log or take a part of a log and highlight the location of the differences. If you paste from a non-raw tinderbox log (i.e., one with "showlog.cgi?log=" not removed) you need to remove the NEXT ERROR stuff, though.
(Are the failures Win7 only?)
Comment 53 Mounir Lamouri (:mounir) 2010-08-23 23:39:02 PDT
(In reply to comment #52)
> (In reply to comment #51)
> > The try server do not like this patch. Some logs:
> > http://tinderbox.mozilla.org/showlog.cgi?log=MozillaTry/1282595957.1282596631.24315.gz
> > http://tinderbox.mozilla.org/showlog.cgi?log=MozillaTry/1282597903.1282598764.1306.gz
> >
> > There are two kinds of failures:
> > - XUL textboxes don't have the default placeholder style. It looks like the
> > state is correctly set (in ::IntrinsicState) for the input/textarea inside the
> > XUL textbox but for I don't know why, the style doesn't apply...
>
> Are you styling :-moz-placeholder on the input inside the textbox or on the
> textbox itself?
:-moz-placeholder is set in one place: layout/style/forms.css and it's something like: :-moz-any(input,textarea):-moz-placeholder { color: GrayText; }
Whitout this patch, the placeholder was styled directly using the anonymous div: input > .placeholder { color: GrayText; }
Now, an <input> or <textarea> will have a GrayText placeholder but a XUL textbox will have a dark one... I do not understand why XUL textbox are fine having the color set with input > .placeholder but not the pseudo-class.
> > - Some of my reftests are failing but not on my computer and the images I got
> > from the try server doesn't show an obvious problem... I can't get how this
> > patch can lead to that. I will investigate tomorrow.
>
> layout/tools/reftest/reftest-analyzer.xhtml may help: it can load a log or
> take a part of a log and highlight the location of the differences. If you
> paste from a non-raw tinderbox log (i.e., one with "showlog.cgi?log=" not
> removed) you need to remove the NEXT ERROR stuff, though.
Ok, will look at that. Thanks :)
> (Are the failures Win7 only?)
No, all platforms but not reproducible on mine. I'm wondering if it's related to the focus ring actually. It's just an idea but I don't have one and I'm wondering if the Fedora used by the try server have one. I also say that because I've tested on a Mac and one of the difference between both images was the size of the focus ring. But I really don't see the link between this and my patch so.. :/
Comment 54 Boris Zbarsky [:bz] (Out June 25-July 6) 2010-08-23 23:59:22 PDT
> :-moz-any(input,textarea):-moz-placeholder { color: GrayText; }
This is in the UA level.
Then there is a rule in the document level, coming from textbox.css, which explicitly sets the color of the textbox and another one which explicitly sets the color of the input inside it. I expect this overrides your rule; you can test by making your rule !important.
I suggest just changing textbox.css to have the rules you want in it... Sort of sad that we have to do that. I wonder why those color styles are there, exactly. Can we remove them?
The reason this used to work is that you were styling the anonymous div directly, so it no longer inherited the color from the input and the styling on the input no longer mattered.
Comment 55 David Baron :dbaron: ⌚️UTC-7 (review requests must explain patch) 2010-08-24 00:22:47 PDT
(In reply to comment #53)
> :-moz-placeholder is set in one place: layout/style/forms.css and it's
> something like: :-moz-any(input,textarea):-moz-placeholder { color: GrayText; }
Also, please don't use :-moz-any() here; use input:-moz-placeholder, textarea:-moz-placeholder so that the rules end up in the tag table. See https://developer.mozilla.org/en/CSS/Writing_Efficient_CSS .
Comment 56 Robert Kaiser (not working on stability any more) 2010-08-24 06:25:58 PDT
(In reply to comment #54)
> Then there is a rule in the document level, coming from textbox.css
Actually, I wonder, why isn't a color like that always set just in the theme? I thought that all colors for XUL elements should actually belong in the theme, i.e. textbox.css in this case. I guess for HTML, forms.css is right, though, as we don't have theming for content, only for chrome.
Comment 57 Mounir Lamouri (:mounir) 2010-08-24 11:57:53 PDT
Created attachment 468752 [details] [diff] [review]
Part 1 - Implement the pseudo-class
Comment 58 Mounir Lamouri (:mounir) 2010-08-24 11:58:33 PDT
Comment on attachment 468752 [details] [diff] [review]
Part 1 - Implement the pseudo-class
r=dbaron
Comment 59 Mounir Lamouri (:mounir) 2010-08-24 12:01:34 PDT
Created attachment 468754 [details] [diff] [review]
Part 2 - Fix XUL textbox default placeholder style
Comment 60 Mounir Lamouri (:mounir) 2010-08-24 12:18:37 PDT
Created attachment 468756 [details] [diff] [review]
Part 2 (v1.1) - Fix XUL textbox default placeholder style
Oups there were a typo... Thanks to aja on IRC :)
Comment 61 Dão Gottwald [:dao] 2010-08-24 13:47:17 PDT
Comment on attachment 468756 [details] [diff] [review]
Part 2 (v1.1) - Fix XUL textbox default placeholder style
There's a bunch of content and theme CSS that needs uncommenting: http://mxr.mozilla.org/mozilla-central/search?string=moz-placeholder
Comment 62 Mounir Lamouri (:mounir) 2010-08-24 13:48:36 PDT
(In reply to comment #61)
> Comment on attachment 468756 [details] [diff] [review]
> Part 2 (v1.1) - Fix XUL textbox default placeholder style
>
> There's a bunch of content and theme CSS that needs uncommenting:
> http://mxr.mozilla.org/mozilla-central/search?string=moz-placeholder
We can have that done in a follow-up I guess.
Comment 63 Mounir Lamouri (:mounir) 2010-08-24 16:58:53 PDT
Created attachment 468862 [details] [diff] [review]
Fix :-moz-placeholder reftests.
Looks like moz-appearance and background-color hates each other and for I don't know why, it was breaking my tests. The purpose of these tests isn't to check native widgets but the pseudo-class so I'm disabling that.
Comment 64 Robert O'Callahan (:roc) (Exited; email my personal email if necessary) 2010-08-24 20:19:57 PDT
When -moz-appearance is a value that is supported by the native theme, CSS borders and backgrounds for the element are completely disabled. This is intentional and lets authors provide a fallback style for cases when that -moz-appearance value is not supported.
Comment 65 Mounir Lamouri (:mounir) 2010-08-24 21:19:28 PDT
(In reply to comment #64)
> When -moz-appearance is a value that is supported by the native theme, CSS
> borders and backgrounds for the element are completely disabled. This is
> intentional and lets authors provide a fallback style for cases when that
> -moz-appearance value is not supported.
Yes, that is fine but if I have two input elements, one with green background and black color as soon as it loads and the other one has that set dynamically (per being subject to :-moz-placeholder pseudo-class), both of them will have the correct style but they will not look exactly the same. I wasn't able to found the reason and my only guess is there is a bug in the layout part when the style is changed. Or maybe this is done async and the reftests "capture" is done before the entire change. Whatever is the cause, because it doesn't sound related with :-moz-placeholder, I've chosen to just set -moz-appearance: none which is fixing my problem.
Roc, let me know if that sounds normal or not so I can open a bug if needed.
Comment 66 Robert O'Callahan (:roc) (Exited; email my personal email if necessary) 2010-08-24 21:44:04 PDT
Sounds like a bug.
Comment 68 Eric Shepherd [:sheppy] 2010-08-27 11:09:42 PDT
Is this replacing the existing :-moz-placeholder pseudo-class? Or did that get renamed? Need to clarify that point before I write this up.
Comment 69 Mounir Lamouri (:mounir) 2010-08-27 11:18:00 PDT
(In reply to comment #68)
> Is this replacing the existing :-moz-placeholder pseudo-class? Or did that get
> renamed? Need to clarify that point before I write this up.
I didn't see any trace of this pseudo-class in the current code base. No test and no obvious names in the code. I'm wondering if that is still used? Otherwise, the naming must be everything but logic.
Boris, do you know if that still exist?
Comment 70 Boris Zbarsky [:bz] (Out June 25-July 6) 2010-08-27 11:21:46 PDT
There was no existing moz-placeholder pseudo-class.
Comment 71 Mounir Lamouri (:mounir) 2010-08-27 11:23:32 PDT
(In reply to comment #70)
> There was no existing moz-placeholder pseudo-class.
Eh, then our dev doc was lying. Thank you for the quick answer :)
https://developer.mozilla.org/en/CSS/%3A-moz-placeholder
Comment 72 Boris Zbarsky [:bz] (Out June 25-July 6) 2010-08-27 11:33:44 PDT
Uh, what the heck? That and https://developer.mozilla.org/en/CSS/%3A-moz-alt-text are documenting the initial proposal from bug 11011, not what was actually implemented.
Comment 73 Eric Shepherd [:sheppy] 2010-08-27 12:15:36 PDT
Now documented here:
https://developer.mozilla.org/en/CSS/%3a-moz-placeholder
(Replacing the totally bogus doc that was there before)
And listed on Firefox 4 for developers.
Note You need to log in before you can comment on or make changes to this bug.
|
{
"url": "https://bugzilla.mozilla.org/show_bug.cgi?id=457801",
"source_domain": "bugzilla.mozilla.org",
"snapshot_id": "crawl=CC-MAIN-2016-26",
"warc_metadata": {
"Content-Length": "160084",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VXIMSJCXCNFZCYMVL5GDGRH53OABX2N7",
"WARC-Concurrent-To": "<urn:uuid:a33510c3-8d5f-4b24-834b-2c1475c8470c>",
"WARC-Date": "2016-07-02T05:50:40Z",
"WARC-IP-Address": "63.245.215.80",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:5EJDMGJTCVLXYIAUPS6SQXWOFRTZWMAT",
"WARC-Record-ID": "<urn:uuid:bee6ac1b-911c-4e12-96e9-79a167dd0e7d>",
"WARC-Target-URI": "https://bugzilla.mozilla.org/show_bug.cgi?id=457801",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:769fbd57-5a37-4ac5-aef6-c30156a5da81>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-164-35-72.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-26\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for June 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,
66,
108,
131,
150,
164,
191,
248,
256,
266,
303,
318,
356,
358,
367,
403,
436,
472,
500,
502,
548,
589,
605,
627,
637,
654,
661,
676,
691,
703,
729,
742,
749,
750,
751,
763,
792,
839,
872,
899,
946,
979,
1006,
1053,
1069,
1093,
1121,
1168,
1201,
1230,
1277,
1293,
1317,
1346,
1393,
1409,
1433,
1487,
1534,
1567,
1635,
1682,
1715,
1790,
1837,
1854,
1878,
1927,
1974,
2007,
2008,
2056,
2236,
2237,
2268,
2314,
2389,
2452,
2453,
2571,
2630,
2690,
2789,
2825,
2901,
3001,
3137,
3191,
3254,
3354,
3419,
3503,
3504,
3610,
3669,
3869,
3870,
3952,
3953,
4061,
4097,
4183,
4258,
4310,
4386,
4481,
4566,
4591,
4673,
4745,
4797,
4798,
5015,
5075,
5192,
5370,
5419,
5564,
5779,
5830,
5890,
5942,
5954,
5955,
6077,
6167,
6204,
6246,
6377,
6403,
6759,
6760,
6852,
6928,
7113,
7114,
7406,
7407,
7640,
7700,
7726,
7801,
7881,
7917,
7920,
8000,
8081,
8156,
8220,
8221,
8441,
8519,
8520,
8602,
8682,
8759,
8760,
8827,
8903,
8983,
8984,
9195,
9255,
9525,
9655,
9656,
9696,
9697,
9784,
9860,
9902,
9903,
10039,
10040,
10118,
10174,
10175,
10198,
10199,
10241,
10242,
10572,
10573,
10701,
10761,
10787,
10831,
10834,
10915,
10974,
10975,
10991,
10992,
11036,
11039,
11119,
11200,
11277,
11353,
11379,
11380,
11484,
11485,
11565,
11617,
11618,
11751,
11827,
11927,
11928,
11959,
11960,
12014,
12074,
12083,
12147,
12148,
12370,
12371,
12425,
12656,
12838,
12839,
12909,
12910,
12949,
13025,
13096,
13097,
13155,
13156,
13401,
13461,
13487,
13560,
13563,
13623,
13624,
13756,
13793,
13794,
14079,
14203,
14282,
14362,
14431,
14461,
14549,
14559,
14662,
14663,
14754,
14798,
14799,
14885,
14929,
14964,
14965,
15035,
15142,
15143,
15191,
15248,
15282,
15283,
15304,
15384,
15403,
15431,
15467,
15547,
15560,
15604,
15610,
15655,
15693,
15697,
15698,
15768,
15823,
15824,
15849,
15896,
15927,
15931,
15979,
16218,
16219,
16283,
16284,
16424,
16425,
16445,
16446,
16515,
16516,
16543,
16544,
16604,
16605,
16685,
16686,
16733,
16734,
16949,
16950,
17031,
17032,
17098,
17099,
17178,
17179,
17475,
17535,
17647,
17695,
17851,
17909,
18014,
18099,
18311,
18393,
18486,
18546,
18572,
18650,
18730,
18808,
18819,
18822,
18888,
18891,
18970,
19035,
19038,
19060,
19063,
19134,
19137,
19166,
19169,
19231,
19234,
19316,
19319,
19368,
19371,
19453,
19531,
19592,
19595,
19669,
19680,
19683,
19751,
19754,
19835,
19838,
19918,
19998,
20078,
20142,
20143,
20280,
20326,
20572,
20790,
20791,
20921,
20969,
21169,
21229,
21281,
21290,
21291,
21447,
21504,
21742,
21743,
21854,
21930,
22208,
22284,
22352,
22412,
22464,
22473,
22474,
22545,
22546,
23127,
23128,
23399,
23459,
23485,
23560,
23640,
23722,
23798,
23879,
23948,
24030,
24082,
24083,
24139,
24240,
24403,
24504,
24526,
24527,
24641,
24678,
24770,
24771,
25088,
25089,
25182,
25183,
25370,
25471,
25573,
25674,
25723,
25724,
25905,
26006,
26295,
26396,
26560,
26561,
26835,
26836,
27010,
27070,
27122,
27133,
27134,
27187,
27222,
27256,
27288,
27289,
27392,
27452,
27504,
27515,
27516,
27539,
27599,
27803,
27904,
27959,
27970,
27971,
28083,
28084,
28189,
28190,
28209,
28269,
28295,
28352,
28365,
28368,
28444,
28484,
28487,
28567,
28596,
28597,
28771,
28772,
28793,
28794,
28822,
28882,
28934,
28945,
28946,
28955,
29015,
29065,
29152,
29238,
29239,
29272,
29492,
29699,
29800,
29826,
29878,
29967,
30055,
30058,
30093,
30171,
30252,
30319,
30320,
30412,
30413,
30493,
30571,
30626,
30627,
30911,
30912,
30942,
31002,
31028,
31056,
31110,
31201,
31291,
31296,
31333,
31413,
31496,
31565,
31568,
31646,
31664,
31665,
31816,
31939,
32162,
32163,
32245,
32325,
32382,
32385,
32463,
32541,
32617,
32677,
32678,
32711,
32712,
32744,
32745,
33144,
33220,
33286,
33287,
33312,
33313,
33582,
33583,
33767,
33768,
33950,
34051,
34077,
34150,
34232,
34233,
34437,
34522,
34548,
34618,
34619,
34909,
34969,
35021,
35057,
35117,
35172,
35208,
35209,
35218,
35278,
35330,
35381,
35441,
35493,
35551,
35552,
35602,
35657,
35712,
35770,
35771,
35906,
35966,
35992,
36049,
36109,
36112,
36180,
36251,
36252,
36298,
36358,
36410,
36442,
36443,
36660,
36767,
37029,
37089,
37115,
37192,
37267,
37343,
37385,
37386,
38039,
38040,
38117,
38224,
38243,
38302,
38441,
38501,
38527,
38608,
38670,
38671,
38872,
38873,
38913,
38989,
39041,
39101,
39127,
39181,
39182,
39248,
39249,
39306,
39382,
39553,
39612,
39633,
39634,
39691,
39692,
39748,
39749,
39789,
39790
],
"line_end_idx": [
66,
108,
131,
150,
164,
191,
248,
256,
266,
303,
318,
356,
358,
367,
403,
436,
472,
500,
502,
548,
589,
605,
627,
637,
654,
661,
676,
691,
703,
729,
742,
749,
750,
751,
763,
792,
839,
872,
899,
946,
979,
1006,
1053,
1069,
1093,
1121,
1168,
1201,
1230,
1277,
1293,
1317,
1346,
1393,
1409,
1433,
1487,
1534,
1567,
1635,
1682,
1715,
1790,
1837,
1854,
1878,
1927,
1974,
2007,
2008,
2056,
2236,
2237,
2268,
2314,
2389,
2452,
2453,
2571,
2630,
2690,
2789,
2825,
2901,
3001,
3137,
3191,
3254,
3354,
3419,
3503,
3504,
3610,
3669,
3869,
3870,
3952,
3953,
4061,
4097,
4183,
4258,
4310,
4386,
4481,
4566,
4591,
4673,
4745,
4797,
4798,
5015,
5075,
5192,
5370,
5419,
5564,
5779,
5830,
5890,
5942,
5954,
5955,
6077,
6167,
6204,
6246,
6377,
6403,
6759,
6760,
6852,
6928,
7113,
7114,
7406,
7407,
7640,
7700,
7726,
7801,
7881,
7917,
7920,
8000,
8081,
8156,
8220,
8221,
8441,
8519,
8520,
8602,
8682,
8759,
8760,
8827,
8903,
8983,
8984,
9195,
9255,
9525,
9655,
9656,
9696,
9697,
9784,
9860,
9902,
9903,
10039,
10040,
10118,
10174,
10175,
10198,
10199,
10241,
10242,
10572,
10573,
10701,
10761,
10787,
10831,
10834,
10915,
10974,
10975,
10991,
10992,
11036,
11039,
11119,
11200,
11277,
11353,
11379,
11380,
11484,
11485,
11565,
11617,
11618,
11751,
11827,
11927,
11928,
11959,
11960,
12014,
12074,
12083,
12147,
12148,
12370,
12371,
12425,
12656,
12838,
12839,
12909,
12910,
12949,
13025,
13096,
13097,
13155,
13156,
13401,
13461,
13487,
13560,
13563,
13623,
13624,
13756,
13793,
13794,
14079,
14203,
14282,
14362,
14431,
14461,
14549,
14559,
14662,
14663,
14754,
14798,
14799,
14885,
14929,
14964,
14965,
15035,
15142,
15143,
15191,
15248,
15282,
15283,
15304,
15384,
15403,
15431,
15467,
15547,
15560,
15604,
15610,
15655,
15693,
15697,
15698,
15768,
15823,
15824,
15849,
15896,
15927,
15931,
15979,
16218,
16219,
16283,
16284,
16424,
16425,
16445,
16446,
16515,
16516,
16543,
16544,
16604,
16605,
16685,
16686,
16733,
16734,
16949,
16950,
17031,
17032,
17098,
17099,
17178,
17179,
17475,
17535,
17647,
17695,
17851,
17909,
18014,
18099,
18311,
18393,
18486,
18546,
18572,
18650,
18730,
18808,
18819,
18822,
18888,
18891,
18970,
19035,
19038,
19060,
19063,
19134,
19137,
19166,
19169,
19231,
19234,
19316,
19319,
19368,
19371,
19453,
19531,
19592,
19595,
19669,
19680,
19683,
19751,
19754,
19835,
19838,
19918,
19998,
20078,
20142,
20143,
20280,
20326,
20572,
20790,
20791,
20921,
20969,
21169,
21229,
21281,
21290,
21291,
21447,
21504,
21742,
21743,
21854,
21930,
22208,
22284,
22352,
22412,
22464,
22473,
22474,
22545,
22546,
23127,
23128,
23399,
23459,
23485,
23560,
23640,
23722,
23798,
23879,
23948,
24030,
24082,
24083,
24139,
24240,
24403,
24504,
24526,
24527,
24641,
24678,
24770,
24771,
25088,
25089,
25182,
25183,
25370,
25471,
25573,
25674,
25723,
25724,
25905,
26006,
26295,
26396,
26560,
26561,
26835,
26836,
27010,
27070,
27122,
27133,
27134,
27187,
27222,
27256,
27288,
27289,
27392,
27452,
27504,
27515,
27516,
27539,
27599,
27803,
27904,
27959,
27970,
27971,
28083,
28084,
28189,
28190,
28209,
28269,
28295,
28352,
28365,
28368,
28444,
28484,
28487,
28567,
28596,
28597,
28771,
28772,
28793,
28794,
28822,
28882,
28934,
28945,
28946,
28955,
29015,
29065,
29152,
29238,
29239,
29272,
29492,
29699,
29800,
29826,
29878,
29967,
30055,
30058,
30093,
30171,
30252,
30319,
30320,
30412,
30413,
30493,
30571,
30626,
30627,
30911,
30912,
30942,
31002,
31028,
31056,
31110,
31201,
31291,
31296,
31333,
31413,
31496,
31565,
31568,
31646,
31664,
31665,
31816,
31939,
32162,
32163,
32245,
32325,
32382,
32385,
32463,
32541,
32617,
32677,
32678,
32711,
32712,
32744,
32745,
33144,
33220,
33286,
33287,
33312,
33313,
33582,
33583,
33767,
33768,
33950,
34051,
34077,
34150,
34232,
34233,
34437,
34522,
34548,
34618,
34619,
34909,
34969,
35021,
35057,
35117,
35172,
35208,
35209,
35218,
35278,
35330,
35381,
35441,
35493,
35551,
35552,
35602,
35657,
35712,
35770,
35771,
35906,
35966,
35992,
36049,
36109,
36112,
36180,
36251,
36252,
36298,
36358,
36410,
36442,
36443,
36660,
36767,
37029,
37089,
37115,
37192,
37267,
37343,
37385,
37386,
38039,
38040,
38117,
38224,
38243,
38302,
38441,
38501,
38527,
38608,
38670,
38671,
38872,
38873,
38913,
38989,
39041,
39101,
39127,
39181,
39182,
39248,
39249,
39306,
39382,
39553,
39612,
39633,
39634,
39691,
39692,
39748,
39749,
39789,
39790,
39868
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 39868,
"ccnet_original_nlines": 640,
"rps_doc_curly_bracket": 0.0006019899738021195,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2894624173641205,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03394731134176254,
"rps_doc_frac_lines_end_with_ellipsis": 0.009360370226204395,
"rps_doc_frac_no_alph_words": 0.3434354364871979,
"rps_doc_frac_unique_words": 0.20194771885871887,
"rps_doc_mean_word_length": 5.221766471862793,
"rps_doc_num_sentences": 423,
"rps_doc_symbol_to_word_ratio": 0.006425360217690468,
"rps_doc_unigram_entropy": 5.950005531311035,
"rps_doc_word_count": 5853,
"rps_doc_frac_chars_dupe_10grams": 0.39976441860198975,
"rps_doc_frac_chars_dupe_5grams": 0.4636324942111969,
"rps_doc_frac_chars_dupe_6grams": 0.4425612688064575,
"rps_doc_frac_chars_dupe_7grams": 0.4331381022930145,
"rps_doc_frac_chars_dupe_8grams": 0.42695415019989014,
"rps_doc_frac_chars_dupe_9grams": 0.4097765386104584,
"rps_doc_frac_chars_top_2gram": 0.01743938960134983,
"rps_doc_frac_chars_top_3gram": 0.025488339364528656,
"rps_doc_frac_chars_top_4gram": 0.008376140147447586,
"rps_doc_books_importance": -4272.16552734375,
"rps_doc_books_importance_length_correction": -4272.16552734375,
"rps_doc_openwebtext_importance": -2334.68603515625,
"rps_doc_openwebtext_importance_length_correction": -2334.68603515625,
"rps_doc_wikipedia_importance": -2134.201171875,
"rps_doc_wikipedia_importance_length_correction": -2134.201171875
},
"fasttext": {
"dclm": 0.02583790011703968,
"english": 0.8749188184738159,
"fineweb_edu_approx": 1.3587757349014282,
"eai_general_math": 0.5139433741569519,
"eai_open_web_math": 0.3715040683746338,
"eai_web_code": 0.22139686346054077
}
}
|
{
"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.019",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-321,813,658,259,593,700 |
Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot
PerlMonks
Comment on
( #3333=superdoc: print w/ replies, xml ) Need Help??
I'm not sure I'd go with the operator overloading here. It does mean you have to keep a firm grasp on all the interfaces and remember what a variable is supposed to contain. It also makes spotting mistakes harder - if I have the wrong object in $current_token, $current_token->equals($token) may well have Perl complaining it can't find that method, while $current_token == $token will (more or less) quietly do the wrong thing.
I like overloading, but I believe it is very, very dangerous if used too readily. It's great when you're creating a class that shares characteristics with the basic data types, like writing a Math::Complex or something, where $a * $b ends up meaning exactly what I expect. Also, overloading stringification is very handy. I would be really hesitant to use it to represent more arbitrary semantics.
As for your example, I'd probably want something like this:
my $point = new Point(42, 42); my $start_point = $point->copy; $point->add_x(1) while $image->element_at($point)->color == RED; my $end_point = $point->copy; $image->draw_line($start_point, $end_point, BLACK);
Makeshifts last the longest.
In reply to Re^3: $bad_names eq $bad_design by Aristotle
in thread $bad_names eq $bad_design by Ovid
Title:
Use: <p> text here (a paragraph) </p>
and: <code> code here </code>
to format your post; it's "PerlMonks-approved HTML":
• Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
• Read Where should I post X? if you're not absolutely sure you're posting in the right place.
• Please read these before you post! —
• Posts may use any of the Perl Monks Approved HTML tags:
a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
• Outside of code tags, you may need to use entities for some characters:
For: Use:
& &
< <
> >
[ [
] ]
• Link using PerlMonks shortcuts! What shortcuts can I use for linking?
• See Writeup Formatting Tips and other pages linked from there for more info.
• Log In?
Username:
Password:
What's my password?
Create A New User
Chatterbox?
and the web crawler heard nothing...
How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (8)
As of 2014-08-22 21:04 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
The best computer themed movie is:
Results (165 votes), past polls
|
{
"url": "http://www.perlmonks.org/?parent=221619;node_id=3333",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2014-35",
"warc_metadata": {
"Content-Length": "21437",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WTDOIOS5NLXGDIL5UJPSTIHVIJZTM7QC",
"WARC-Concurrent-To": "<urn:uuid:f5b98cb0-73bf-401a-b3d5-14bda04774d1>",
"WARC-Date": "2014-08-22T21:04:46Z",
"WARC-IP-Address": "66.39.54.27",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:332RSI73DHWT6UFFQAC2FD7IESFBRAHQ",
"WARC-Record-ID": "<urn:uuid:9293e67a-66c3-49ab-9371-774c0dc48197>",
"WARC-Target-URI": "http://www.perlmonks.org/?parent=221619;node_id=3333",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:78bfaf77-1364-4b28-9304-683430abfebb>"
},
"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,
63,
90,
120,
122,
134,
135,
146,
147,
201,
202,
631,
632,
1030,
1031,
1091,
1092,
1302,
1303,
1332,
1333,
1334,
1391,
1435,
1436,
1443,
1482,
1513,
1566,
1567,
1568,
1569,
1692,
1789,
1830,
1890,
2156,
2232,
2258,
2270,
2281,
2292,
2304,
2316,
2390,
2471,
2483,
2497,
2511,
2512,
2536,
2558,
2574,
2615,
2616,
2658,
2675,
2722,
2753,
2767,
2784,
2800,
2815,
2835,
2836,
2877,
2878,
2879,
2880,
2881,
2882,
2883,
2884,
2885,
2886,
2887,
2888
],
"line_end_idx": [
63,
90,
120,
122,
134,
135,
146,
147,
201,
202,
631,
632,
1030,
1031,
1091,
1092,
1302,
1303,
1332,
1333,
1334,
1391,
1435,
1436,
1443,
1482,
1513,
1566,
1567,
1568,
1569,
1692,
1789,
1830,
1890,
2156,
2232,
2258,
2270,
2281,
2292,
2304,
2316,
2390,
2471,
2483,
2497,
2511,
2512,
2536,
2558,
2574,
2615,
2616,
2658,
2675,
2722,
2753,
2767,
2784,
2800,
2815,
2835,
2836,
2877,
2878,
2879,
2880,
2881,
2882,
2883,
2884,
2885,
2886,
2887,
2888,
2925
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2925,
"ccnet_original_nlines": 76,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2718023359775543,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.029069770127534866,
"rps_doc_frac_lines_end_with_ellipsis": 0.012987010180950165,
"rps_doc_frac_no_alph_words": 0.34302327036857605,
"rps_doc_frac_unique_words": 0.652466356754303,
"rps_doc_mean_word_length": 4.591928482055664,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0.005813950207084417,
"rps_doc_unigram_entropy": 5.43105936050415,
"rps_doc_word_count": 446,
"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.0068359398283064365,
"rps_doc_frac_chars_top_3gram": 0.01855468936264515,
"rps_doc_frac_chars_top_4gram": 0.02050781063735485,
"rps_doc_books_importance": -353.40570068359375,
"rps_doc_books_importance_length_correction": -353.40570068359375,
"rps_doc_openwebtext_importance": -192.37969970703125,
"rps_doc_openwebtext_importance_length_correction": -192.37969970703125,
"rps_doc_wikipedia_importance": -167.84140014648438,
"rps_doc_wikipedia_importance_length_correction": -167.84140014648438
},
"fasttext": {
"dclm": 0.08744431287050247,
"english": 0.8582513332366943,
"fineweb_edu_approx": 1.8506227731704712,
"eai_general_math": 0.011476459912955761,
"eai_open_web_math": 0.4258995056152344,
"eai_web_code": 0.0003396300016902387
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "6",
"label": "Indeterminate"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,213,640,994,439,926,000 |
WordPressのダッシュボードにウィジェットを追加する
dashboard
今回は、WordPressのダッシュボードにオリジナルウィジェットの追加方法をご紹介したいと思います。
ダッシュボードには、デフォルトの状態で、4つのウィジェットが表示されていると思うのですが、ここにオリジナルの【マイウィジェット】を追加したいと思います。
利用用途ですが、正直考えると色々とありすぎて一概には言えないのですが、WordPressで制作したクライントに向けての、【投稿の方法&利用方法】や【いつでも連絡出来るように担当した担当者の名前と連絡先】など利用方法はアイデア次第では色々なように使えると思います。
意外と実装すると便利な場面もあると思いますので、こんなことも出来るんだーぐらいの気持ちで見てもらえればいいかなと思います。
ダッシュボードにオリジナルウィジェットを実装方法
ダッシュボードにオリジナルのウィジェットを実装するには、【wp_add_dashboard_widget】関数を利用して追加します。
【wp_add_dashboard_widget】については、下記リンク先をご覧ください。
ダッシュボードウィジェット API
また、add_actionでwpdeshboard_setupをアクションフックすることでダッシュボードにオリジナルのウィジェットを表示しています。
今回は、簡単な文字のウィジェットを追加してみたいと思います。
下記コードを【functions.php】に貼り付けてください。
/*-------------------------------------------*/
/* ダッシュボードにオリジナルウィジェットを追加
/*-------------------------------------------*/
add_action( 'wp_dashboard_setup', 'my_dashboard_widget' );
function my_dashboard_widget() {
wp_add_dashboard_widget(
'my_widget', //ウィジェット スラッグ
'Glow-Factory', //ウィジェット タイトル
'my_widget_display' //ウィジェット コンテンツ
);
}
function my_widget_display() {
echo 'Glow Factory(グロウファクトリー)は、巷で流行のWordPressテーマ・テンプレートを無料版70%・有料版30%(と言いたいです)で配布・販売をしているWEBサイトです。ブログ・ビジネス・ポートフォリオ・レスポンシブ・ギャラリー・ネットショップにご利用いただける高品質のWordPressテーマ・テンプレートを配布・販売しております。';
}
上記コードを貼り付け終えたら、ダッシュボードを確認すると下記のように表示されていると思います。
dashboard
上記まで、ダッシュボードにオリジナルウィジェットを追加が出来ました。
RSS情報を表示するウィジェットをダッシュボードに表示し任意のURL変更フォームを設置
RSS情報表示し任意のURL変更フォーム実装する方法は、下記記事が大変わかりやすく参考にさせていただきました。
それでは、参考にさせていただきました実装方法をご紹介します。
ダッシュボードに任意のRSSを表示するには、【functions.php】に下記コードを貼り付けて下さい。
add_action( 'wp_dashboard_setup', 'my_dashboard_widget_rss' );
function my_dashboard_widget_rss() {
wp_add_dashboard_widget(
'my_widget_rss', //ウィジェット スラッグ
'Glow-Factory-RSS情報', //ウィジェット タイトル
'my_widget_display_rss', //ウィジェット コンテンツ
'dashboard_widget_rss_form' // (オプション) ウィジェットオプションフォームの送信を処理し、フォーム要素を表示する関数の名前
);
}
function my_widget_display_rss() {
?>
<?php
// dbからfeed urlを取得
$option = get_option('dashboard_widget_rss');
// $optionが真ならdbのurlを、falseの場合(初期状態)は任意のURLを利用
$rss_url = ($option) ? $option : 'http://glow-factory.com/feed/';
?>
<div class="widget">
<?php wp_widget_rss_output( array(
'url' => $rss_url,
'title' => 'Glow-Factory-RSS',
'items' => 5,
'show_summary' => 1,
'show_author' => 0,
'show_date' => 1
) );
?>
</div>
<?php
}
function dashboard_widget_rss_form() {
// POSTリクエストか？
if ( isset( $_POST['rss_url'] ) ) {
$feed_url = esc_url_raw( $_POST['rss_url'] ); // パラメータのエスケープ処理
update_option( 'dashboard_widget_rss', $rss_url ); // wp_optionsテーブルに保存
}
$rss_url = get_option( 'dashboard_widget_rss'); // dbからfeed urlを取得
?>
<label for="feed">
RSS URL: <input type="text" name="rss_url" id="rss_feed" value="<?php echo esc_url( $rss_url ); ?>" size="45" />
</label>
<?php
}
上記コードを貼り付けると、下記のようにRSS情報ウィジェットがダッシュボードに表示されます。
dashboard1
また、設定をクリックすると任意のURLを入力する送信フォームが表示されます。
dashboard2
コード側のRSSURLには、初期状態では、当サイトのURLを表示していますので、利用する場合は必ず変更して下さい。
こちらのダッシュボードにオリジナルウィジェットの実装を応用すれば、アイデア次第でとても便利な機能だと思いますし、WordPress人気記事表示プラグイン【Popular Posts】を利用すれば、その日の人気記事をダッシュボードに表示させすぐに確認も出来ますね。
人それぞれで、利用の仕方なども変わってくると思いますので、もし良かったら【こんな使い方してます。】ってのがありましたらコメントしてくれると嬉しいです。
Popular Postsを利用したその日の人気記事を表示するウィジェットの表示方法も書き終わったあとに気づきましたのでwww、この記事で【一応】後日記載したいと思います。
こちらの記事をシェアする
こちらの記事があなたのお役にたちましたら、シェアしていただけますと大変嬉しく今後のブログ更新の糧となりますのでどうぞよろしくお願いします。(^^♪
About
Glow-Facotryでは、無料・有料のWPテーマを配布・販売サイトです。また、Web関連やWPの記事・日常的(ゲームも)なことをブログを利用して発信して行きたいと思っております。
よかったら下記のフォローをお気軽にお願いします。
関連記事
コメント
コメントをどうぞ
メールアドレスが公開されることはありません。 * が付いている欄は必須項目です
PREVIOUS toolbar-0
【初心者記事】WordPressの管理ツールバーを非表示にする方法
NEXT wp-email-login
WordPressでユーザーがメールアドレスでログインする方法
|
{
"url": "http://glow-factory.com/blog_wp/wp-customize/dashboard-mywidget/",
"source_domain": "glow-factory.com",
"snapshot_id": "crawl=CC-MAIN-2017-13",
"warc_metadata": {
"Content-Length": "64479",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UFTPWGXOCS6YCJT2LZUCGGZW3ZKBNGMP",
"WARC-Concurrent-To": "<urn:uuid:d4b2d20b-dbcf-42cb-b685-29ba53e13795>",
"WARC-Date": "2017-03-23T12:21:30Z",
"WARC-IP-Address": "49.212.137.19",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:OQG43ZLS6WPVDGEXCDBZU4UTHENGLCQ4",
"WARC-Record-ID": "<urn:uuid:8171719b-3360-4dca-ae8d-a00f4b267fb7>",
"WARC-Target-URI": "http://glow-factory.com/blog_wp/wp-customize/dashboard-mywidget/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:42868d40-817d-4e0d-af89-18b37f09f83f>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-233-31-227.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-13\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for March 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
30,
31,
41,
42,
94,
171,
172,
304,
305,
367,
368,
393,
394,
461,
507,
508,
526,
527,
602,
633,
666,
667,
715,
741,
789,
848,
881,
907,
936,
967,
1003,
1007,
1009,
1010,
1041,
1228,
1230,
1231,
1279,
1280,
1290,
1291,
1326,
1327,
1371,
1372,
1428,
1429,
1460,
1514,
1515,
1578,
1615,
1641,
1674,
1711,
1752,
1832,
1836,
1838,
1839,
1874,
1878,
1889,
1910,
1958,
2007,
2075,
2079,
2085,
2110,
2116,
2155,
2182,
2221,
2243,
2272,
2300,
2326,
2335,
2342,
2353,
2360,
2362,
2363,
2402,
2404,
2423,
2463,
2534,
2610,
2616,
2619,
2690,
2696,
2699,
2718,
2831,
2840,
2846,
2848,
2849,
2896,
2897,
2908,
2909,
2948,
2949,
2960,
2961,
3019,
3020,
3152,
3228,
3229,
3316,
3317,
3330,
3331,
3405,
3406,
3412,
3413,
3505,
3530,
3531,
3536,
3537,
3542,
3543,
3552,
3553,
3593,
3594,
3613,
3614,
3648,
3649,
3669,
3670
],
"line_end_idx": [
30,
31,
41,
42,
94,
171,
172,
304,
305,
367,
368,
393,
394,
461,
507,
508,
526,
527,
602,
633,
666,
667,
715,
741,
789,
848,
881,
907,
936,
967,
1003,
1007,
1009,
1010,
1041,
1228,
1230,
1231,
1279,
1280,
1290,
1291,
1326,
1327,
1371,
1372,
1428,
1429,
1460,
1514,
1515,
1578,
1615,
1641,
1674,
1711,
1752,
1832,
1836,
1838,
1839,
1874,
1878,
1889,
1910,
1958,
2007,
2075,
2079,
2085,
2110,
2116,
2155,
2182,
2221,
2243,
2272,
2300,
2326,
2335,
2342,
2353,
2360,
2362,
2363,
2402,
2404,
2423,
2463,
2534,
2610,
2616,
2619,
2690,
2696,
2699,
2718,
2831,
2840,
2846,
2848,
2849,
2896,
2897,
2908,
2909,
2948,
2949,
2960,
2961,
3019,
3020,
3152,
3228,
3229,
3316,
3317,
3330,
3331,
3405,
3406,
3412,
3413,
3505,
3530,
3531,
3536,
3537,
3542,
3543,
3552,
3553,
3593,
3594,
3613,
3614,
3648,
3649,
3669,
3670,
3701
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3701,
"ccnet_original_nlines": 140,
"rps_doc_curly_bracket": 0.0032423699740320444,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.009310989640653133,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03724395111203194,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.7262569665908813,
"rps_doc_frac_unique_words": 0.7417218685150146,
"rps_doc_mean_word_length": 20.145694732666016,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.58815336227417,
"rps_doc_word_count": 151,
"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.01643655076622963,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -249.9810791015625,
"rps_doc_books_importance_length_correction": -249.9810791015625,
"rps_doc_openwebtext_importance": -131.35800170898438,
"rps_doc_openwebtext_importance_length_correction": -131.35800170898438,
"rps_doc_wikipedia_importance": -74.90267181396484,
"rps_doc_wikipedia_importance_length_correction": -74.90267181396484
},
"fasttext": {
"dclm": 0.9310657978057861,
"english": 0.0002655700081959367,
"fineweb_edu_approx": 2.323686122894287,
"eai_general_math": 0.005444290116429329,
"eai_open_web_math": 0.7148262858390808,
"eai_web_code": 0.4482731223106384
}
}
|
{
"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.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Cognitive science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,728,868,748,266,404,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 am trying to figure out a 'proper' way of sorting UTF-8 strings in Ruby on Rails.
In my application, I have a select box that is populated with countries. As my application is localized, each existing locale has a countries.yml file that relates a country's id to the localized name for that country. I can't sort the strings manually in the yml file because I need the ID to be consistent across all locales.
What I have done is create a ascii_name method which uses the unidecode gem to convert accented and non-latin characters to their ascii equivalent (for instance, "Afeganistão" would become "Afeganistao"), and then sort on that:
require 'unidecode'
class Country
def ascii_name
Unidecoder.decode(name).gsub("[?]", "").gsub(/`/, "'").strip
end
end
Country.all.sort_by(:&ascii_name)
However, there are obvious issues with this:
• It cannot properly sort non-latin locales, as there may not be a direct analogous latin character.
• It makes no distinction between a letter and all accented forms of that letter (so, for instance, A and Ä become interchangeable)
Does anyone know of a better way that I could sort my strings?
share|improve this question
add comment
7 Answers
up vote 4 down vote accepted
http://github.com/grosser/sort_alphabetical/tree/master
maybe this plugin may help
share|improve this answer
Thanks, that was exactly the sort of plugin I was looking for! – Daniel Vandersluis Aug 5 '09 at 18:08
This plugin relies on NFD decomposition en.wikipedia.org/wiki/Unicode_equivalence#Normal_forms and fails in some cases. Not all diacritic characters can be decomposed this way (for example Polish letter Ł can not). – skalee Sep 9 '10 at 11:18
@skalee Do you have any suggestion how to properly sort utf-8 strings with polish characters? – mdrozdziel Oct 5 '12 at 10:32
1
@acidburn2k If you are grabbing records from database, you probably want to fetch them sorted by db engine. See documentation for your RDBS and search for "collation". You can set collation you like the most for whole database, table or (AFAIR) even specify it in your query. In MySQL, the best collation for Polish is utf8_polish_ci. If you want to sort them in Ruby, follow this answer: stackoverflow.com/a/5472046/304175 – skalee Oct 5 '12 at 17:40
add comment
Ruby peforms string comparisons based on byte values of characters:
%w[à a e].sort
# => ["a", "e", "à"]
To properly collate strings according to locale, the ffi-icu gem could be used:
require "ffi-icu"
ICU::Collation.collate("it_IT", %w[à a e])
# => ["a", "à", "e"]
ICU::Collation.collate("de", %w[a s x ß])
# => ["a", "s", "ß", "x"]
As an alternative:
collator = ICU::Collation::Collator.new("it_IT")
%w[à a e].sort { |a, b| collator.compare(a, b) }
# => %w[a à e]
Update To test how strings should collate according to locale rules the ICU project provides this nice tool.
share|improve this answer
The only thing I don't like about "ffi-icu" is that it depends on "libicu". But I guess this is pretty ubiquitous on UNIX systems, right? – vrinek Jun 24 '13 at 19:44
Usually it is not installed by default, but it is available on almost any system. – toro2k Jun 25 '13 at 6:31
add comment
There are a couple of ways to go. You may want to convert the UTF strings to hex strings and then sort them:
s.split(//).collect { |x| x.unpack('U').to_s }.join
or you may use the library iconv. Read up on it and use it as appropriate (from dzone):
#add this to environment.rb
#call to_iso on any UTF8 string to get a ISO string back
#example : "Cédez le passage aux français".to_iso
class String
require 'iconv' #this line is not needed in rails !
def to_iso
Iconv.conv('ISO-8859-1', 'utf-8', self)
end
end
share|improve this answer
Hm, sorting by the hex value does seem to put my strings in the alphabetical order, but I don't really understand how it's working, can you explain that? Also, it's still sorting Á before A, which seems backwards to me. – Daniel Vandersluis Jun 11 '09 at 19:33
3
Also watch out: Unicode sorting depends on the locale! Different countries have a different order in their dictionary. – Rutger Nijlunsing Jun 11 '09 at 19:34
Well, converting to hex gives you an ordering that is better understood by sort functions. I would experiment a bit, by using hex values formatted to 2 or 3 decimal places. or even use decimal values for each character. I am not a big UTF user myself, but it appears from Rutger's comments that what you are trying to do does not have an exact answer. – Ryan Oberoi Jun 11 '09 at 19:48
@Rutger that's what I'm trying to figure out how to implement, I guess, and is another downfall of my current method (or sorting by character code) – Daniel Vandersluis Jun 11 '09 at 20:15
add comment
The only working solution I found so far (at least for Ruby 1.8 because Ruby 1.9 should handle Unicode better) is Unicode by Yoshida Masato. You can find Unicode.strcmp method there.
EDIT: Sorry, this solution uses NFD decomposition as well with all its limitations.
share|improve this answer
add comment
What you are trying to do is a very messy proposition. There is no way to do transparent transliteration on all Unicode characters because the meaning of digraphs changes from locale to locale, and strings can grow HUGE (if say you replace 10 Chinese symbols with theyr phonetic equivalents). Don't go there.
Why do you want transliterated names in the first place? For URLs? Browsers handle Unicode URLs decently now, so you are inventing a huge problem out of thin air. If you need IDs, preprocess your lists to include a stable numeric ID per country and use that as an identifier. Or save the English name of the country as identitifer (you can download locale-aware ISO country lists for free).
If you truly want good transliteration for Unicode (and this is not what you want in this case) see the IBM ICU libraries, there is a dormant gem for them.
share|improve this answer
add comment
The only solution I have found thus far is to use ActiveSupport::Inflector.transliterate(string) to replace the unicode characters with ASCII ones and sort:
Country.all.sort_by do |country|
ActiveSupport::Inflector.transliterate country.name
end
Now the only problem is that this equalizes "ä" with "a" (DIN 5007-1) and I end up with "Ägypten" before "Albanien" while I would expect it to be the other way around. Thankfully the transliteration is configurable about how to replace characters.
See documentation: http://api.rubyonrails.org/classes/ActiveSupport/Inflector.html#method-i-transliterate
share|improve this answer
Are you just looking for a method to transliterate strings or a method to sort strings according to a locale collation? – toro2k Jun 18 '13 at 15:00
The latest, sort strings by a locale collation. – vrinek Jun 18 '13 at 15:29
Even with proper collation (I supposed de_DE.UFT8) it is normal that Ägypten comes before Albanien. – toro2k Jun 18 '13 at 16:00
I know, but with the Austrian collation, I think "A" < "Ä" < "B". And ActiveSupport::Inflector does not support it by default. – vrinek Jun 18 '13 at 16:16
1
See this, you can test how strings are sorted depending on collation. – toro2k Jun 18 '13 at 18:13
add comment
Have you tried accessing the mb_chars method for each of your country strings? mb_chars is a proxy that ActiveSupport adds that defines Unicode safe versions of all the String methods. If the comparator is Unicode-aware then the sorting should work correctly.
share|improve this answer
The problem with using mb_chars is the same as sorting straight; because in the character set A-Z comes before Ä, accented characters will not sort into the correct location. – Daniel Vandersluis Jun 11 '09 at 20:21
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/982948/sorting-utf-8-strings-in-ror",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "100940",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:G6WIN6ZAP7NSXKX3GEYALYNIGERRBGEL",
"WARC-Concurrent-To": "<urn:uuid:6d5ab147-b308-425d-ae71-48b4d90ffbad>",
"WARC-Date": "2014-03-13T13:41:19Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:AXLZ4WTTD3RNU25KZHQNUWZ7CORKXNI6",
"WARC-Record-ID": "<urn:uuid:c260d471-3536-46a1-a145-e35ca22fd3d2>",
"WARC-Target-URI": "http://stackoverflow.com/questions/982948/sorting-utf-8-strings-in-ror",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:84d0f0ae-955d-4526-a64e-23c23d28e7b5>"
},
"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,
242,
243,
571,
572,
800,
801,
821,
822,
836,
853,
918,
924,
928,
929,
963,
964,
1009,
1010,
1113,
1247,
1248,
1311,
1312,
1340,
1352,
1353,
1363,
1364,
1393,
1394,
1450,
1451,
1478,
1479,
1505,
1507,
1611,
1613,
1857,
1859,
1986,
1990,
2443,
2455,
2456,
2524,
2525,
2540,
2561,
2562,
2642,
2643,
2661,
2662,
2705,
2726,
2727,
2769,
2795,
2796,
2815,
2816,
2865,
2914,
2929,
2930,
3039,
3040,
3066,
3068,
3236,
3238,
3349,
3361,
3362,
3471,
3472,
3524,
3525,
3613,
3614,
3642,
3699,
3749,
3750,
3763,
3817,
3830,
3874,
3880,
3884,
3910,
3912,
4174,
4178,
4338,
4340,
4727,
4729,
4919,
4931,
4932,
5115,
5116,
5200,
5201,
5227,
5239,
5240,
5549,
5550,
5941,
5942,
6098,
6099,
6125,
6137,
6138,
6295,
6296,
6329,
6383,
6387,
6388,
6636,
6637,
6743,
6744,
6770,
6772,
6922,
6924,
7002,
7004,
7134,
7136,
7293,
7297,
7397,
7409,
7410,
7670,
7671,
7697,
7699,
7916,
7928,
7929,
7941,
7942,
7944,
7952,
7953,
8031,
8032
],
"line_end_idx": [
25,
157,
158,
242,
243,
571,
572,
800,
801,
821,
822,
836,
853,
918,
924,
928,
929,
963,
964,
1009,
1010,
1113,
1247,
1248,
1311,
1312,
1340,
1352,
1353,
1363,
1364,
1393,
1394,
1450,
1451,
1478,
1479,
1505,
1507,
1611,
1613,
1857,
1859,
1986,
1990,
2443,
2455,
2456,
2524,
2525,
2540,
2561,
2562,
2642,
2643,
2661,
2662,
2705,
2726,
2727,
2769,
2795,
2796,
2815,
2816,
2865,
2914,
2929,
2930,
3039,
3040,
3066,
3068,
3236,
3238,
3349,
3361,
3362,
3471,
3472,
3524,
3525,
3613,
3614,
3642,
3699,
3749,
3750,
3763,
3817,
3830,
3874,
3880,
3884,
3910,
3912,
4174,
4178,
4338,
4340,
4727,
4729,
4919,
4931,
4932,
5115,
5116,
5200,
5201,
5227,
5239,
5240,
5549,
5550,
5941,
5942,
6098,
6099,
6125,
6137,
6138,
6295,
6296,
6329,
6383,
6387,
6388,
6636,
6637,
6743,
6744,
6770,
6772,
6922,
6924,
7002,
7004,
7134,
7136,
7293,
7297,
7397,
7409,
7410,
7670,
7671,
7697,
7699,
7916,
7928,
7929,
7941,
7942,
7944,
7952,
7953,
8031,
8032,
8122
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8122,
"ccnet_original_nlines": 158,
"rps_doc_curly_bracket": 0.0004924900131300092,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34611111879348755,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03222221881151199,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2727777659893036,
"rps_doc_frac_unique_words": 0.3854406177997589,
"rps_doc_mean_word_length": 4.770881175994873,
"rps_doc_num_sentences": 95,
"rps_doc_symbol_to_word_ratio": 0.005555559881031513,
"rps_doc_unigram_entropy": 5.615067958831787,
"rps_doc_word_count": 1305,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04545455053448677,
"rps_doc_frac_chars_dupe_6grams": 0.03517507016658783,
"rps_doc_frac_chars_dupe_7grams": 0.021040799096226692,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.020558949559926987,
"rps_doc_frac_chars_top_3gram": 0.02473497949540615,
"rps_doc_frac_chars_top_4gram": 0.007227750029414892,
"rps_doc_books_importance": -784.2211303710938,
"rps_doc_books_importance_length_correction": -784.2211303710938,
"rps_doc_openwebtext_importance": -508.3399658203125,
"rps_doc_openwebtext_importance_length_correction": -508.3399658203125,
"rps_doc_wikipedia_importance": -300.5717468261719,
"rps_doc_wikipedia_importance_length_correction": -300.5717468261719
},
"fasttext": {
"dclm": 0.06604623794555664,
"english": 0.8790026903152466,
"fineweb_edu_approx": 1.5135326385498047,
"eai_general_math": 0.15528714656829834,
"eai_open_web_math": 0.2185460329055786,
"eai_web_code": 0.006841599941253662
}
}
|
{
"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": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "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": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,238,607,329,149,608,000 |
Free
Free Ringtones – How to Get Them Free Everytime
How do you get a free ringtone? There are many ways. You can create one yourself. You can locate one of the many free ringtone sites that are online. The distinction that must be made is what is free, and what is a lure to get you into their site. However, most cell phone companies have a certain agenda when giving away these freebies click aici.
Most cell phone manufacturers and websites offer ringtones to mobile users free or at low cost. If a person has a Sprint or Nextel cell phone, they can download free ringtones. Many web sites claim to offer free ringtones, and most of them are legitimate, but there are a couple of issues that seekers of free ringtones should keep in mind.
Many sites that offer free ringtones do so not because they love the public and want to make sure their ringtone needs are met, but rather as a lure to draw them in for nefarious purposes. Many sites offer the ringtones free of charge; the ringtones can be downloaded by sending the specified code for the ringtone as an SMS to the ringtone provider. Nowadays, people need not worry of not being able to find the MP3 ringtone that they want among the different websites that offer free MP3 ringtones.
Your web search will yield thousands of ringtones – make sure, though, that the ones you’re choosing to download are actually free. By just following a few simple steps, you can download free ringtones off of the Internet. Adding to the increasing number of ringtones is the fact that most of these ringtones are available for free.
On the other hand, the global leader in cell phone manufacturers Nokia is offering more than 1200 free and user-friendly Nokia ringtones for their customers in keypress format. There are various ways for a cell phone user to download polyphonic ringtones to his handset, including the Internet, other cell phone users, ringtone providers, etc. Getting a free Hi-Fi ringtone for your cell phone is one of the latest and most fashionable things to do.
Once you submit you cell phone number to get your free ringtone you will be subscribed to their service. However, people who don’t find their favorite song on any song list of free MP3 ringtones, there is a way you can still get that MP3 ringtone they want. So what happens if you try to download free ringtones and they don’t work?
The search for free ringtones grows everyday but do they really exist. You can either buy ringtones or get them for free. You can have two choices for mp3 ringtones – you can buy them or you can create them yourself.
If you have problems installing the ringtones, there are websites which can assist you or help you in downloading them. Again, when placing an order or while downloading a free Hi-Fi ringtones, you should be very specific about which type of ringtone you need since there are many types and categories of free Hi-Fi ringtones. The free Christian ringtones are an easy way for people to spread the goodness of Christian music and songs.
Most people don’t realize how easy its becoming to get free ringtones. If you have T-Mobile or another carrier which blocks you from using the full data transferring capabilities of your phone, they can’t stop you from using bluetooth technology to get the ringtones to your phone. If you have the old phone type that plays simple, monotonous ringtones, you’ll have to buy the downloadable tone from a commercial source.
First, check your mobile phone to make sure it’s compatible with the type of tones that you want. Today, in the US mobile market, ringtones and ring back tones have become a very popular novelty for many users. Since ringtones are very popular and trendy these days, almost every mobile user is keen to get the latest ringtone.
Christian ringtones are popular all over the world. As the market has grown so have the ringtones. Typically, you only need to visit one of the hundreds of sites offering ringtones and help yourself to dozens of download available.
Once you’ve found it, you can download it by clicking on the ringtone of your choice. WAV is the computer file name is that is short for “wave” and is a type of audio formatting that can be stored on your personal computer. Today, the Hispanic and the Asian users in the mobile market have increased so fast that the ringtones trends vary from state to state depending upon the ethnicity of the population. However, regardless of anyone’s ethnic background, people love the word free, and especially the words “free ringtones”.
In conclusion, the key to fining a free ringtone is to always use your favorite search engine, place the word “free ringtones” in quotes, and search for an almost exact match. In this way, you will be able to find free ringtones online almost everyday, through perseverance and hard surfing everyday.
Leave a Reply
Your email address will not be published. Required fields are marked *
|
{
"url": "http://www.michaelkorsshoes.us.com/free-ringtones-get-free/",
"source_domain": "www.michaelkorsshoes.us.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "33204",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ITPUAUTZJ27GABRKCKECVH2CEMVPUTXI",
"WARC-Concurrent-To": "<urn:uuid:f7e9483c-ed0f-49c2-bbc3-302c96eb0aab>",
"WARC-Date": "2021-10-22T19:37:43Z",
"WARC-IP-Address": "172.67.189.29",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UKVHNQDFUIEDD3QFLOACIAOMGYMVOSES",
"WARC-Record-ID": "<urn:uuid:23e35f0c-580e-42a4-bcd5-9cacf4ff91f4>",
"WARC-Target-URI": "http://www.michaelkorsshoes.us.com/free-ringtones-get-free/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2de85af2-0b14-44f4-9777-9fe02618e9d1>"
},
"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-137\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
5,
6,
54,
55,
404,
405,
746,
747,
1248,
1249,
1582,
1583,
2033,
2034,
2367,
2368,
2585,
2586,
3022,
3023,
3444,
3445,
3773,
3774,
4006,
4007,
4535,
4536,
4837,
4838,
4852,
4853
],
"line_end_idx": [
5,
6,
54,
55,
404,
405,
746,
747,
1248,
1249,
1582,
1583,
2033,
2034,
2367,
2368,
2585,
2586,
3022,
3023,
3444,
3445,
3773,
3774,
4006,
4007,
4535,
4536,
4837,
4838,
4852,
4853,
4923
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4923,
"ccnet_original_nlines": 32,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.46303901076316833,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008213549852371216,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1088295727968216,
"rps_doc_frac_unique_words": 0.3729603588581085,
"rps_doc_mean_word_length": 4.616549968719482,
"rps_doc_num_sentences": 44,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.060189723968506,
"rps_doc_word_count": 858,
"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.03281999006867409,
"rps_doc_frac_chars_top_3gram": 0.006059079896658659,
"rps_doc_frac_chars_top_4gram": 0.012118149548768997,
"rps_doc_books_importance": -412.9560852050781,
"rps_doc_books_importance_length_correction": -412.9560852050781,
"rps_doc_openwebtext_importance": -200.2375030517578,
"rps_doc_openwebtext_importance_length_correction": -200.2375030517578,
"rps_doc_wikipedia_importance": -142.08151245117188,
"rps_doc_wikipedia_importance_length_correction": -142.08151245117188
},
"fasttext": {
"dclm": 0.04740775004029274,
"english": 0.940034031867981,
"fineweb_edu_approx": 1.552815318107605,
"eai_general_math": 0.0017522600246593356,
"eai_open_web_math": 0.09975051879882812,
"eai_web_code": 0.00028425001073628664
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.68",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "658.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": "1",
"label": "Factual"
}
},
"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": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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
|
-9,061,841,162,378,822,000 |
Sign up ×
Stack Overflow is a community of 4.7 million programmers, just like you, helping each other. Join them; it only takes a minute:
How does ldd knows it's depending on libc.so.6 ,not libc.so.5 or libc.so.7?
libc.so.6 => /lib64/libc.so.6 (0x00000034f4000000)
/lib64/ld-linux-x86-64.so.2 (0x00000034f3c00000)
share|improve this question
2 Answers 2
up vote 13 down vote accepted
It is recorded inside application binary itself (specified at compile time, more exactly at link step, done with ld):
$ readelf -d /bin/echo
Dynamic section at offset 0x5f1c contains 21 entries:
Tag Type Name/Value
0x00000001 (NEEDED) Shared library: [libc.so.6]
...
(there are some additional columns for how elf does store information in dynamic section. but you can see that libc.so.6 is hardcoded with .6 suffix because of SONAME)
or even without any knowledge of ELF file format:
$ strings /bin/echo |grep libc.so
libc.so.6
To find, how does linker find a library (it is done at final step of compilation), use gcc option -Wl,--verbose (this asks gcc to pass option --verbose to ld):
$ gcc a.c -Wl,--verbose
...
attempt to open /usr/lib/gcc/i686-pc-linux-gnu/4.4.4/libc.so failed
attempt to open /usr/lib/gcc/i686-pc-linux-gnu/4.4.4/libc.a failed
attempt to open /usr/lib/gcc/i686-pc-linux-gnu/4.4.4/libc.so failed
attempt to open /usr/lib/gcc/i686-pc-linux-gnu/4.4.4/libc.a failed
attempt to open /usr/lib/gcc/i686-pc-linux-gnu/4.4.4/../../../libc.so succeeded
opened script file /usr/lib/gcc/i686-pc-linux-gnu/4.4.4/../../../libc.so
opened script file /usr/lib/gcc/i686-pc-linux-gnu/4.4.4/../../../libc.so
attempt to open /lib/libc.so.6 succeeded
/lib/libc.so.6
Linker doesn't know anything about .digit suffix, it just iterate over all library search directories trying to open libLIBNAME.so and libLIBNAME.a, where LIBNAME is a string after -l option. ( -lc option is added by default).
First success is /usr/lib/libc.so which itself is not a library, but a linker script (text file). Here is content from typical libc.so script:
$ cat /usr/lib/libc.so
/* GNU ld script
Use the shared library, but some functions are only in
the static library, so try that secondarily. */
OUTPUT_FORMAT(elf32-i386)
GROUP ( /lib/libc.so.6 /usr/lib/libc_nonshared.a AS_NEEDED ( /lib/ld-linux.so.2 ) )
So, script /usr/lib/libc.so is found earlier than actual library, and this script says, what file will be linked, libc.so.6 in this case.
In more common case, lib___.so is symlink to some version like lib___.so.3.4.5 and there is SONAME field filled in lib___.so.3.4.5 which says to ld link not to lib___.so but to lib___.so.3.4 which is another symlink to lib___.so.3.4.5. The .3.4 name will be recorded in NEEDED field of binary.
share|improve this answer
What does 0x00000001 (NEEDED) mean? – compile-fan Apr 5 '11 at 15:56
Is it true that ldconfig will link libc.so.6 to the latest version of libc.so.6.x ,and link lib.so to the latest version of libc.so.x? And suppose lib.so links to lib.so.7,then binary generated by gcc -l lib.so ... will depend on lib.so.7,right? – compile-fan Apr 5 '11 at 16:05
1
+1 for editing your answer to contain so much useful information. This is a classic SO post. Thanks. – Don Wakefield Apr 5 '11 at 20:15
@osgx, how did you open the linker script in the first place? – compile-fan Apr 6 '11 at 14:26
@compile-fan, on my machine /usr/lib/libc.so was a text file, so I opened it with cat. On our machine, or with another library you should run gcc -Wl,--verbose to get how linker search for lib, and where are linker scripts. – osgx Apr 6 '11 at 15:02
http://www.sco.com/developers/gabi/latest/ch5.dynamic.html#dynamic_section
Has the meaning of each dynamic tags. The 1 indicates it is a DT_NEEDED tag meaning in this case the
typedef struct {
Elf32_Sword d_tag;
union {
Elf32_Word d_val;
Elf32_Addr d_ptr;
} d_un;
} Elf32_Dyn;
structure has d_val union valid and look up at an offset specified by thi union member in DT_STRTAB table to find the name of library that this binary/SO depends on.
share|improve this answer
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "http://stackoverflow.com/questions/5554343/understanding-ldd-output/10037007",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2015-48",
"warc_metadata": {
"Content-Length": "83851",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CJSOVYZFYLMP7VADFTDSPJMREI7LHOIF",
"WARC-Concurrent-To": "<urn:uuid:77337877-b65d-4fc2-a460-0050e1790f68>",
"WARC-Date": "2015-11-27T11:58:42Z",
"WARC-IP-Address": "104.16.33.249",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:4UJ34JVZHOFPYMNFMOYAFDN5GDEXVMGO",
"WARC-Record-ID": "<urn:uuid:f8be060b-5bc7-4215-8f65-68d78bbafa5d>",
"WARC-Target-URI": "http://stackoverflow.com/questions/5554343/understanding-ldd-output/10037007",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2e1674e0-22e9-4db1-90cf-f09ba4c2f12a>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-71-132-137.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-48\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for Nov 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
10,
138,
139,
215,
216,
267,
316,
344,
345,
357,
358,
388,
389,
507,
508,
531,
532,
586,
639,
708,
712,
713,
881,
882,
932,
933,
967,
977,
978,
1138,
1139,
1163,
1164,
1168,
1236,
1303,
1371,
1438,
1518,
1591,
1664,
1705,
1720,
1721,
1948,
1949,
2092,
2093,
2116,
2133,
2191,
2243,
2269,
2354,
2355,
2493,
2494,
2788,
2789,
2815,
2820,
2889,
2894,
3173,
3177,
3313,
3318,
3413,
3418,
3668,
3669,
3744,
3745,
3846,
3847,
3864,
3887,
3899,
3926,
3953,
3965,
3978,
3979,
4145,
4146,
4172,
4173,
4185,
4186,
4188,
4196,
4197,
4275,
4276
],
"line_end_idx": [
10,
138,
139,
215,
216,
267,
316,
344,
345,
357,
358,
388,
389,
507,
508,
531,
532,
586,
639,
708,
712,
713,
881,
882,
932,
933,
967,
977,
978,
1138,
1139,
1163,
1164,
1168,
1236,
1303,
1371,
1438,
1518,
1591,
1664,
1705,
1720,
1721,
1948,
1949,
2092,
2093,
2116,
2133,
2191,
2243,
2269,
2354,
2355,
2493,
2494,
2788,
2789,
2815,
2820,
2889,
2894,
3173,
3177,
3313,
3318,
3413,
3418,
3668,
3669,
3744,
3745,
3846,
3847,
3864,
3887,
3899,
3926,
3953,
3965,
3978,
3979,
4145,
4146,
4172,
4173,
4185,
4186,
4188,
4196,
4197,
4275,
4276,
4366
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4366,
"ccnet_original_nlines": 94,
"rps_doc_curly_bracket": 0.0009161700145341456,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.25951558351516724,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013840829953551292,
"rps_doc_frac_lines_end_with_ellipsis": 0.021052630618214607,
"rps_doc_frac_no_alph_words": 0.37197232246398926,
"rps_doc_frac_unique_words": 0.4680851101875305,
"rps_doc_mean_word_length": 5.18657922744751,
"rps_doc_num_sentences": 129,
"rps_doc_symbol_to_word_ratio": 0.0034602100495249033,
"rps_doc_unigram_entropy": 5.286832332611084,
"rps_doc_word_count": 611,
"rps_doc_frac_chars_dupe_10grams": 0.07794257253408432,
"rps_doc_frac_chars_dupe_5grams": 0.102556012570858,
"rps_doc_frac_chars_dupe_6grams": 0.08993373066186905,
"rps_doc_frac_chars_dupe_7grams": 0.07794257253408432,
"rps_doc_frac_chars_dupe_8grams": 0.07794257253408432,
"rps_doc_frac_chars_dupe_9grams": 0.07794257253408432,
"rps_doc_frac_chars_top_2gram": 0.013253389857709408,
"rps_doc_frac_chars_top_3gram": 0.02461344003677368,
"rps_doc_frac_chars_top_4gram": 0.023982329294085503,
"rps_doc_books_importance": -502.051025390625,
"rps_doc_books_importance_length_correction": -502.051025390625,
"rps_doc_openwebtext_importance": -246.9451904296875,
"rps_doc_openwebtext_importance_length_correction": -246.9451904296875,
"rps_doc_wikipedia_importance": -227.4288787841797,
"rps_doc_wikipedia_importance_length_correction": -227.4288787841797
},
"fasttext": {
"dclm": 0.2705305814743042,
"english": 0.7876285910606384,
"fineweb_edu_approx": 1.6111267805099487,
"eai_general_math": 0.007942380383610725,
"eai_open_web_math": 0.19443917274475098,
"eai_web_code": 0.0013988600112497807
}
}
|
{
"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.27",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "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
|
8,868,420,424,196,592,000 |
• Sample Page
• Archives
• Categories
• Archive for February, 2021
SAS dan Hadoop -1
2021 - 02.03
Hadoop
Hadoop adalah salah satu software open-source dari Apache yang di rancang untuk pemrograman secara kluster, bermanfaat untuk distribusi data dan memproses data berukuran besar atau big data. Jadi efisiensi dari pada memproses data menggunakan satu komputer, pemrosesan bisa digunakan beberapa komputer yang sudah terinstall hadoop. Penganalisisan data bisa dilakukan menggunakan data terdistribusi pada komputer yang telah terinstall hadoop, menghasilkan proses yang lebih efisien.
Kluster Hadoop terdiri dari ‘NameNode’, backup dari ‘NameNode’, dan beberapa node berisi data. Masing-masing node pada kluster memiliki memory, CPU, dan disk storage. Node pada kluster dapat ditambah kurangi sesuai kebutuhan.
Ada tiga komponen utama pada Hadoop yaitu, HDFS, Yarn, dan MapReduce. Komponen tersebut akan memproses pembacaan, penulisan, dan pemrosesan data secara otomatis. Berarti programmer dapat menulis progrram untuk mengolah data pada satu komputer dan terdistribusi melalui Hadoop.
Hadoop memiliki beberapa fitur utama yang membuatnya sangat menarik sebagai bagian dari solusi teknologi big data. Misalnya: sistem Hadoop mudah untuk digunakan, open-source, dan penyimpanan yang terdistribusi, menyebabkan biaya untuk operasional yang rendah. Data tereplikasi di beberapa node untuk membuatnya toleran terhadap kesalahan. Hadoop mendukung pemrosesan paralel, cocok untuk melakukan analisis pada volume data yang sangat besar. Dan Hadoop mudah diskalakan. Ini diskalakan dengan baik untuk menangani sejumlah besar data, dan mudah diperluas dengan menambahkan lebih banyak node penyimpanan ke dalam kluster.
SAS memiliki poin integrasi yang membuat penggunaan Hadoop tidak terlalu asing. Pernyataan LIBNAME, prosedur SAS, dan transformasi Data Integration Studio adalah beberapa contoh integrasi SAS yang dapat digunakan untuk berinteraksi dengan Hadoop.
HDFS
Ada tiga modul inti pada Hadoop:
• Hadoop Distributed File System, atau HDFS adalah sistem file virtual yang digunakan untuk mendistribusikan file di seluruh kluster Hadoop.
• YARN adalah sistem yang menangani permintaan pekerjaan, meluncurkan pekerjaan atau menempatkan permintaan pekerjaan dalam antrian, dan mengalokasikan penggunaan sumber daya dalam klaster.
• MapReduce adalah modul yang menyelesaikan pemrosesan data paralel terdistribusi dalam HDFS.
Setiap file dalam HDFS didistribusikan di seluruh node data Hadoop dalam bentuk blok. NameNode berisi informasi tentang di mana data berada di setiap DataNode. Meskipun tidak digambarkan dalam diagram, data direplikasi dalam HDFS untuk mendukung toleransi kesalahan. Secara default, setiap blok file dalam HDFS direplikasi pada tiga node data lainnya. Jika ada DataNode yang down, data cadangan tersedia untuk digunakan.
Salah satu cara pengguna dapat berinteraksi dengan HDFS adalah dengan mengirimkan perintah sistem file Hadoop dari prompt perintah Linux.
Contoh dari HDFS commands:
Map Reduce
Jika HDFS mengotomatiskan proses penyimpanan data terdistribusi, maka sistem MapReduce mengotomatiskan pemrosesan terdistribusi. Untuk setiap proses, sistem MapReduce mengoordinasikan serangkaian tugas yang dijalankan secara paralel di seluruh kluster. Proses MapReduce terjadi dalam tiga tahap: map, shuffle dan sort, dan reduce. Setiap proses melakukan operasi tertentu. Pada tahapan map menginisiasi pembacaan blok data dalam HDFS. Tahapan map juga menyelesaikan operasi perbaris data termasuk memfilter baris atau menghitung kolom baru dalam baris. Tahapan shuffle dan sort digunakan untuk mengurutkan dan mengelompokkan baris pada data yang diperlukan. Terakhir, tahapreduce digunakan untuk melakukan penghitungan akhir, termasuk menghitung statistik ringkasan dalam grup. Pada tahap reduce juga menulis hasil akhir data dalam bentuk HDFS.
|
{
"url": "https://sites.unpad.ac.id/hilyamisara/2021/02/",
"source_domain": "sites.unpad.ac.id",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "14561",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DANF6QTB6HBKHRKESJTS2WZIKCXHXUBA",
"WARC-Concurrent-To": "<urn:uuid:4d4ce1a1-ea5b-422a-a595-eb6219792262>",
"WARC-Date": "2021-02-27T12:46:54Z",
"WARC-IP-Address": "111.223.252.104",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:ZCLDFJJKKSWIXAQKHFB7AIFYLP4YO3W4",
"WARC-Record-ID": "<urn:uuid:499fef65-02b9-4b95-8e37-06ea741e8041>",
"WARC-Target-URI": "https://sites.unpad.ac.id/hilyamisara/2021/02/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:640eaaad-0fa5-4e76-83a5-60f39e6f87bc>"
},
"warc_info": "isPartOf: CC-MAIN-2021-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-215.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
16,
29,
44,
75,
76,
98,
99,
100,
117,
118,
129,
130,
616,
617,
847,
848,
854,
855,
1136,
1137,
1764,
1765,
2016,
2017,
2026,
2027,
2064,
2065,
2210,
2404,
2502,
2503,
2928,
2929,
3071,
3072,
3103,
3104,
3119,
3120
],
"line_end_idx": [
16,
29,
44,
75,
76,
98,
99,
100,
117,
118,
129,
130,
616,
617,
847,
848,
854,
855,
1136,
1137,
1764,
1765,
2016,
2017,
2026,
2027,
2064,
2065,
2210,
2404,
2502,
2503,
2928,
2929,
3071,
3072,
3103,
3104,
3119,
3120,
3968
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3968,
"ccnet_original_nlines": 40,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.0033222599886357784,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.031561460345983505,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.151162788271904,
"rps_doc_frac_unique_words": 0.4296724498271942,
"rps_doc_mean_word_length": 6.296724319458008,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.931149005889893,
"rps_doc_word_count": 519,
"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.013769890181720257,
"rps_doc_frac_chars_top_3gram": 0.009179930202662945,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -276.3717041015625,
"rps_doc_books_importance_length_correction": -276.3717041015625,
"rps_doc_openwebtext_importance": -177.10992431640625,
"rps_doc_openwebtext_importance_length_correction": -177.10992431640625,
"rps_doc_wikipedia_importance": -107.9071044921875,
"rps_doc_wikipedia_importance_length_correction": -107.9071044921875
},
"fasttext": {
"dclm": 0.3449445366859436,
"english": 0.0038589700125157833,
"fineweb_edu_approx": 2.3516547679901123,
"eai_general_math": -0.0000013100000160193304,
"eai_open_web_math": 0.7430639266967773,
"eai_web_code": 0.6173858046531677
}
}
|
{
"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.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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
257,810,185,015,210,850 |
back to article Firefox market share drops as IE makes slender gain
Mozilla’s Firefox has lost market share against Google’s young pretender Chrome browser for the third month in a row. According to NetMarketShare’s latest stats, Firefox's share of the global browser market slipped under 23 per cent in July. Meanwhile, Microsoft’s Internet Explorer saw its usage share rise a slender 0.42 per …
COMMENTS
This topic is closed for new posts.
Grenade
No need for Chromes size
The only problem with Chrome is its HUGE. There just can't be a justifiable reason for a 100MB plus install.
Opera is what 11/13mb while Firefox is around 33mb
0
0
Silver badge
WTF?
I think I speak for all of us here when I say:
Big, fat, hairy deal. 100MB? So what? What does 100MB of bandwidth or hard disk cost these days?
Seriously, what's the problem?
GJC
0
2
Unsurprising
FireFox just isn't very good these days. Its much slower than Opera 10.6, taking a very noticable time to scroll El Reg's front page back to the point I was looking at after I exit a story. Opera is there instantly.
Unlike Opera it crashes. Some movies (flash IIRC) just cause it to suddenly vanish and its PDF viewer seems to coredump regularly.
In case you're wondering: FireFox 3.5.11 under Fedora 12 on a Core Duo based Lenovo laptop.
3
3
Anonymous Coward
Come back and report the problems
How about upgrading to Firefox 3.6. There's really no point complaining that something isn't very good anymore if you're not using the latest version.
5
1
It is....
...the latest release in the Fedora distro, and yes I do upgrade the distro on a weekly basis.
The crashes and lethargy aren't recent. They've been integral to all FF 3.5 releases.
I was sufficiently pissed off with Opera 10's shortcomings prior to 10.6 to seriously consider moving to FF as my default browser, but the FF 3.5.x's sloth and the frequent helper crashes dissuaded me. This was fortunate, since Opera 10.6 has none of the deficiencies of FF or of the earlier Opera 10.x versions.
0
0
Unhappy
Stop the Merry-go-round
Some people don't have the time to be upgrading every week. You have to evaluate these things. One big problem is that every major update and a lot of minor ones (ie 3.5=>3.6) break extensions and if critical extensions aren't supported you can't move forward. I still run Firefox 1.5 and 2.0 in certain circumstances.
Mozilla has adopted an annoying pattern of taking things away recently too. Things like cookie file compatibility, the forms tab of Page Info, useful stuff. With a track record like that updating blindly is insanity.
I just found they've taken away the ability to globally install extensions via a command line option. There's still a way to do it but it requires a lot more investigation and time investment, not exactly what I'd call progress. Just the fact that they keep rearranging things for no obvious reason annoys me to no end.
2
1
Linux
3.5.11?
Cripes, the Fedora team are a little slow. Mandriva 2010.1 comes with 3.6.6. With eight (mainly text-based) tabs open, it's consuming 118 MiB - 107 for the main binary and 11 for the plugin container. I have 28 add-ons enabled and 2 disabled.
The only problems I've really noticed are the perennial memory leaks - after running it for a few days (putting the computer in standby between sessions) and opening several YouTube tabs, the memory usage can spiral (I once had it consuming over 800MB - I was starting to wonder why it was starting to be lethargic!) - but then that's probably my fault for running it into the ground. Startup takes about 12 seconds (about the same time as LiVES) but then again, there are 28 add-ons to load!), but Chrome takes ~6 seconds (including loading the Google homepage) on the first try and ~3 on subsequent occasions (as do the other Kebkit browsers - so it probably keeps a Webkit service running for a while after closure) and Thunderbird ~9 seconds (excluding checking my two accounts). GIMP and OpenOffice.org take ~8 seconds, and RPMDrake ~18 seconds. Which is my biggest bugbear about the OS. If you include the time it takes to log into Mandriva Control Centre ("Configure Your Computer") in the first place, you're looking at nearly 30s before you can search for and install software. And unless you know roughly what the package is called, you can't cheat by using a terminal and urpmi - besides which, the CLI doesn't allow you to browse the repositories.
0
0
Anonymous Coward
@mittfh
Thank you. Now that I've finally seen someone actually use "MiB" outside of Wikipedia I can die happy.
Out of interest, do you also say "initialism" instead of "acronym" and point out which words are a portmanteau, as you use them?
0
0
Paris Hilton
The Devil Is In The Details
My two penneth is that Firefox needs a complete re-design.
Even IE8 looks more up to date.
I know people are going to say how it looks doesn't matter. It does matter.
Firefox still looks like a slightly jazzed up IE6.
What's under the hood might be safer, more secure etc.
But if it looks like a bag of spanners, which it does, then it's going to lose out, which it is starting to do.
Paris - now tell me looks don't matter!
2
4
Big Deal?
Until fairly recently I would've been quite concerned about IE seemingly growing back market share at the expense of more "worthy" alternatives like Firefox, but nowadays with open standards prevalent across the web it's not such a big deal. As long the browser does the basics well, (renders correct html and css and is fast and stable) then who cares? Having said that I much prefer Firefox because of the wonderful plug-ins available (fire ftp, firebug etc.). Long may the competition continue!
0
0
J 3
Badgers
@Big Deal?
Yes, big deal.
Why do you think browsers are better about open standards nowadays? Because MS saw the error of their ways and decided to come to the light side of the Force?
And why do you think that if one browser reaches near-monopoly again (specially if it is a browser from some big company) it will not just do things as it wants, creating its own "standards" ? (again)
As long as NO browser gets too much of the market (how much exactly that cap would be, I don't know), then we can have a reasonable chance of things improving in the open standards department. Not to mention that they keep each other on their toes -- everyone would quite likely still be using IE6 or something only slightly made up for looks if it wasn't for the growth of non-MS browsers.
0
0
Thumb Up
That'd be because Chrome is lean and fast
Don't get me wrong, I love Firefox. But, on older, slower machines where I just want to do a quick Google search, it's Chrome every time because I don't want to wait 15 minutes for Firefox to start. Searching by typing the address bar is a big usability win, too.
As long as Google keep Chrome lean, fast and simple, they'll keep gaining market share.
1
1
Thumb Up
Best for non-tech users
I've been recommending Chrome for non-technical home users of Windows XP users for months now. These are people who will never master NoScript, but we CAN get them to browse with a non-admin account.
Chrome has a huge advantage here because the updater works even if you never log on as an admin. With Firefox, updating is a perennial pain. Site compatibility seems fine, and the secure Javascript model seems to give some of the advantages of NoScript.
1
1
Anonymous Coward
Lets see.
i.e. is being pushed hard on TV.
Safari - well everytime an i-device(tm) comes out, there's that reason, it's default
Google punts chrome everytime you go to the most popular search engine
And FF falls. And it is advertised where?
1
0
Paris Hilton
Lies, Lies, all Lies!!
That's what I would have called these stories only a few weeks ago.
Then, in half an hour of idleness, I simply and only, tried. Chrome.
Since then it's been up here. It renders faster, never crashed on me (recently, Firefox started to crash twice daily).
True, I miss the great add-ons of Firefox. No-Script, Downloadhelper, you just name them. Text search is horrible in Chrome. And it consumes giant amounts of RAM. But since I have 4 GB, it is just enough for Chrome to keep me more happy with Chrome.
IE8, though, is still lousy. At least here.
Paris, because there are always better alternatives
1
2
Bronze badge
"it is advertised where?"
- massively supported by the community.... and the summer hols means it is not being used that much, only a blip in its 25% share.... It will continue after hols! :)
0
0
WTF?
Please...
...don't ever run a business.
Run by the community is NOT the same as advertising and brand awareness (god I can't belive I typed that).
You can have a good product, but if people don't know about it, it won't sell.
And as for the holidays, what the fuck has that got to do with ANYTHING, please rationalise that bizzare statement. Do people suddenly stop using firefox because the suns out? Or is it only schools that use it. Please do explain your point!
0
0
FAIL
I run a business, a fairly successful one
And word of mouth from happy customers is the best publicity you could possibly have.
1
0
Silver badge
Happy
Being of a scientific bent....
....I once decided to test this word of mouth mantra, many years ago. I just happened at the time to have recently started an ISP with reasonably large ambitions, and I publicised it throughout the technical on-line community I was very active in, giving away a number of free accounts to seed the process. Everyone was very complimentary, and said nice things to all their friends, and sure enough I signed up a couple of hundred people in a few months.
Meanwhile, the Marketing Director was running a nationwide press advertising campaign, with ads in technical and non-technical publications, radio on London FM stations, and so on. They managed three thousand sign-ups in the same time.
So it appears you are wrong. Word of mouth is not the best advertising.
GJC
1
0
Silver badge
@Geoff Campbell
You forgot the important sign-ups/pound metric, which is of course more important. How costly was a national press campaign, compared with your word-of-mouth campaign?
0
0
Silver badge
Thumb Up
VFM
I forget the figures (this was 1995, it's all a bit of a blur....) but the advertising campaign paid for itself many times over within the first couple of months. We were starting from scratch, no subscribers whatsoever, had we relied upon pure word of mouth we'd've gone out of business.
GJC
0
0
Bronze badge
STILL waiting for a usable FF4 beta!!!
B2 still will not do addons - that includes adblock! :(
0
0
Pint
Yes you can
You can but you need an addon to install the addons and no I'm not joking
0
1
WTF?
Eh?
I installed Beta 2 a few days ago and my add-ons carried on working. I think they auto-updated in the usual way and that was that.
0
0
Happy
Keep using IE
I hope the majority of people keep using IE because it will remain the most targetted, by hackers, and I don't use it.
0
1
Unhappy
Nevermind market shares for FF, Chrome, IE7+
What I want to know is, why wont IE 6 hurry up and die already?*
http://www.netmarketshare.com/report.aspx?qprid=3&qpcustom=Microsoft+Internet+Explorer+6.0
*Yes, yes, I know, there's still companies out there dependent on one-off ActiveX controls on their internal network, but guh. Even MSFT wants to get rid of that albatross.
0
0
Coffee/keyboard
IE6 Lives On
Because MS never released 7 or 8 for NT and 2K. And yes, there are still a significant number of those OSs running.
0
0
Bronze badge
Coat
FF losing out? Not suprised
ver 3.6 has been a nightmare since the 3.6.4 update; flash was locking it up nearly every time; .5,.6,.7 made no difference and .8 made matters worse!!
Even on a brand new build ( first powered up today), FF3.6.8 has crashed 5-6 times, just from opening a new tab!!!
It was so bad on my old PC I switched to 4.0beta, which STILL had the flash issue.
Thankfully the first update fixed that.
And if 3.6.8 crashes on me again tonight 4.0beta will be back!!
Coat with empty pockets, no dosh left!!!
0
0
Black Helicopters
Mozilla have lost the plot
I think Mozilla have lost the plot these days, even the new beta version 4 is no better. It is a shame as I started to use Netscape and then changed to Firefox when Netscape was dropped. I now using Iron, which is a chrome clone, but without the Google spying bits, much faster than Firefox in start up and displaying pages.
Add ons are not as good, but I found some that does what I want.
Sorry Mozilla, but your browsers are now history on my computers, in fact I had Opera, safari, Firefox 3.6 and 4on my computer as well as Internet Exploder and I have now just got one browser installed and that is Iron.
Ok I know that Internet Exploder is still there and it is hidden.
0
0
Firefox too successful for its own good?
I wonder if FF is too successfull for its own good.
FF became popular 5 years ago because of three things: IE6 security issues, better standards support and great developer tools.
If you look at the browser market now the first two are largely non-issues now. IE8 is as secure as FF and its standards support is reasonable (still lacking but getting there). Likewise Opera, Safari and Chrome are all much the same to the non-technical user. So it boils down to things like branding, personal preferences and so on. 5 years ago I installed FF on all my relatives computers. Now I don't bother anymore. They are happy using IE8 and I have no real reason to tell them to use something else. FF gave MS a good kick up the arse and we are all the better for it, but there's no need to evangelise about it so much at this point.
I am also wondering whether, due to increased standards support, browsers are actually becoming irrelevant. Don't we all access the internet through smart phone apps and so on?
0
0
Flame
What did they expect?
Firefox was only really ever Netscape under the hood... Those who were there will remember that Netscape didn't just lose it's market share to due to a certain competitor's dominance, a good deal of it was down to Netscape being rubbish. That underlying rubbishness had to show through in FF at some point.
The only reasons FF was vaguely successful outside IT pro's the feeling they were sticking two fingers up to bill gates... Users don't really care about security or standards and the only thing hailed as new to FF was tabbed browsing (also lifted from Netscape).
* Flames, cos well, it is fire-fox...
0
0
IT Angle
Which IE?
There's a choice of three. All different. Lumping them all together is negligent.
0
0
Still a happy FF user
No stability issues, no extension issues. Sure it's a bit slower than the others but its improving, and it works the way I want it to. Plus, unlike a certain other browser, it doesn't spend half its time dialling home (didn't MS get slated six ways from Sunday for that...?).
And unlike some other punters here, I think I will reserve judgement on FF4 until it's actually finished.
1
0
Thumb Down
Strange, I don't see this declining trend for FF share
when I check StatCounter's worldwide stats (http://preview.tinyurl.com/2dv3o9o ) - FF seems to be holding its own with a market share of 31 - 32 %, IE declining slowly, with a current share of around 53 %, and Chrome increasing at a fairly rapid pace and now enjoying a market share worldwide of over 10 %. For the United States, which always occupies a privileged place in the affections of Reg bloggers, the respective shares are 53 %, 28 %, and 9 %. Perhaps it's time for a discussion on just whose statistics should be used as the basis for Reg articles and why....
Henri
0
0
Flame
This is fucking horrible!
What abysmal travesty of a situation would lead a person to migrate BACK to IE after leaving it?
I could really care less about who wins out between Firefox, Safari and Chrome. As long as IE dies in excruciating pain the result would be positive.
0
0
This topic is closed for new posts.
Forums
|
{
"url": "http://forums.theregister.co.uk/forum/1/2010/08/02/browser_market_share_july/",
"source_domain": "forums.theregister.co.uk",
"snapshot_id": "crawl=CC-MAIN-2014-52",
"warc_metadata": {
"Content-Length": "114973",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:XP3MDUZ76UDFWRIJEQEVMHU3VL6IUXDB",
"WARC-Concurrent-To": "<urn:uuid:d6624daa-975f-4125-879e-8deb922c9491>",
"WARC-Date": "2014-12-20T01:20:16Z",
"WARC-IP-Address": "50.57.15.204",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:JBPHVQEIOVZUARG3SMR3Z5CBQFCA624O",
"WARC-Record-ID": "<urn:uuid:55c48cdf-cdb7-4364-871b-145104faa2f4>",
"WARC-Target-URI": "http://forums.theregister.co.uk/forum/1/2010/08/02/browser_market_share_july/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:82b49d21-95f1-47a5-a614-1ca72c07cae6>"
},
"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,
68,
69,
398,
399,
408,
409,
445,
453,
454,
479,
480,
589,
590,
641,
642,
644,
646,
659,
664,
665,
712,
713,
810,
811,
842,
843,
847,
848,
850,
852,
853,
866,
867,
1083,
1084,
1215,
1216,
1308,
1309,
1311,
1313,
1330,
1331,
1365,
1366,
1517,
1518,
1520,
1522,
1523,
1533,
1534,
1629,
1630,
1716,
1717,
2030,
2031,
2033,
2035,
2043,
2044,
2068,
2069,
2388,
2389,
2606,
2607,
2927,
2928,
2930,
2932,
2938,
2939,
2947,
2948,
3191,
3192,
4452,
4453,
4455,
4457,
4474,
4475,
4483,
4484,
4587,
4588,
4717,
4718,
4720,
4722,
4735,
4736,
4764,
4765,
4824,
4825,
4857,
4858,
4934,
4935,
4986,
4987,
5042,
5043,
5155,
5156,
5196,
5197,
5199,
5201,
5202,
5212,
5213,
5711,
5712,
5714,
5716,
5720,
5728,
5729,
5740,
5741,
5756,
5757,
5916,
5917,
6118,
6119,
6510,
6511,
6513,
6515,
6524,
6525,
6567,
6568,
6832,
6833,
6921,
6922,
6924,
6926,
6935,
6936,
6960,
6961,
7161,
7162,
7416,
7417,
7419,
7421,
7438,
7439,
7449,
7450,
7483,
7484,
7569,
7570,
7641,
7642,
7684,
7685,
7687,
7689,
7702,
7703,
7726,
7727,
7795,
7796,
7865,
7866,
7985,
7986,
8236,
8237,
8281,
8282,
8334,
8335,
8337,
8339,
8352,
8353,
8379,
8380,
8546,
8547,
8549,
8551,
8556,
8557,
8567,
8568,
8598,
8599,
8706,
8707,
8786,
8787,
9028,
9029,
9031,
9033,
9038,
9039,
9081,
9082,
9168,
9169,
9171,
9173,
9186,
9192,
9193,
9224,
9225,
9680,
9681,
9917,
9918,
9990,
9991,
9995,
9996,
9998,
10000,
10013,
10014,
10030,
10031,
10199,
10200,
10202,
10204,
10217,
10226,
10227,
10231,
10232,
10521,
10522,
10526,
10527,
10529,
10531,
10544,
10545,
10584,
10585,
10641,
10642,
10644,
10646,
10651,
10652,
10664,
10665,
10739,
10740,
10742,
10744,
10749,
10750,
10754,
10755,
10886,
10887,
10889,
10891,
10897,
10898,
10912,
10913,
11032,
11033,
11035,
11037,
11045,
11046,
11091,
11092,
11157,
11158,
11249,
11250,
11423,
11424,
11426,
11428,
11444,
11445,
11458,
11459,
11575,
11576,
11578,
11580,
11593,
11598,
11599,
11627,
11628,
11780,
11781,
11896,
11897,
11980,
11981,
12021,
12022,
12086,
12087,
12128,
12129,
12131,
12133,
12151,
12152,
12179,
12180,
12505,
12506,
12571,
12572,
12792,
12793,
12859,
12860,
12862,
12864,
12865,
12906,
12907,
12959,
12960,
13088,
13089,
13732,
13733,
13910,
13911,
13913,
13915,
13921,
13922,
13944,
13945,
14252,
14253,
14516,
14517,
14555,
14556,
14558,
14560,
14569,
14570,
14580,
14581,
14663,
14664,
14666,
14668,
14669,
14691,
14692,
14968,
14969,
15075,
15076,
15078,
15080,
15091,
15092,
15147,
15148,
15718,
15719,
15725,
15726,
15728,
15730,
15736,
15737,
15763,
15764,
15861,
15862,
16012,
16013,
16015,
16017,
16053,
16054
],
"line_end_idx": [
68,
69,
398,
399,
408,
409,
445,
453,
454,
479,
480,
589,
590,
641,
642,
644,
646,
659,
664,
665,
712,
713,
810,
811,
842,
843,
847,
848,
850,
852,
853,
866,
867,
1083,
1084,
1215,
1216,
1308,
1309,
1311,
1313,
1330,
1331,
1365,
1366,
1517,
1518,
1520,
1522,
1523,
1533,
1534,
1629,
1630,
1716,
1717,
2030,
2031,
2033,
2035,
2043,
2044,
2068,
2069,
2388,
2389,
2606,
2607,
2927,
2928,
2930,
2932,
2938,
2939,
2947,
2948,
3191,
3192,
4452,
4453,
4455,
4457,
4474,
4475,
4483,
4484,
4587,
4588,
4717,
4718,
4720,
4722,
4735,
4736,
4764,
4765,
4824,
4825,
4857,
4858,
4934,
4935,
4986,
4987,
5042,
5043,
5155,
5156,
5196,
5197,
5199,
5201,
5202,
5212,
5213,
5711,
5712,
5714,
5716,
5720,
5728,
5729,
5740,
5741,
5756,
5757,
5916,
5917,
6118,
6119,
6510,
6511,
6513,
6515,
6524,
6525,
6567,
6568,
6832,
6833,
6921,
6922,
6924,
6926,
6935,
6936,
6960,
6961,
7161,
7162,
7416,
7417,
7419,
7421,
7438,
7439,
7449,
7450,
7483,
7484,
7569,
7570,
7641,
7642,
7684,
7685,
7687,
7689,
7702,
7703,
7726,
7727,
7795,
7796,
7865,
7866,
7985,
7986,
8236,
8237,
8281,
8282,
8334,
8335,
8337,
8339,
8352,
8353,
8379,
8380,
8546,
8547,
8549,
8551,
8556,
8557,
8567,
8568,
8598,
8599,
8706,
8707,
8786,
8787,
9028,
9029,
9031,
9033,
9038,
9039,
9081,
9082,
9168,
9169,
9171,
9173,
9186,
9192,
9193,
9224,
9225,
9680,
9681,
9917,
9918,
9990,
9991,
9995,
9996,
9998,
10000,
10013,
10014,
10030,
10031,
10199,
10200,
10202,
10204,
10217,
10226,
10227,
10231,
10232,
10521,
10522,
10526,
10527,
10529,
10531,
10544,
10545,
10584,
10585,
10641,
10642,
10644,
10646,
10651,
10652,
10664,
10665,
10739,
10740,
10742,
10744,
10749,
10750,
10754,
10755,
10886,
10887,
10889,
10891,
10897,
10898,
10912,
10913,
11032,
11033,
11035,
11037,
11045,
11046,
11091,
11092,
11157,
11158,
11249,
11250,
11423,
11424,
11426,
11428,
11444,
11445,
11458,
11459,
11575,
11576,
11578,
11580,
11593,
11598,
11599,
11627,
11628,
11780,
11781,
11896,
11897,
11980,
11981,
12021,
12022,
12086,
12087,
12128,
12129,
12131,
12133,
12151,
12152,
12179,
12180,
12505,
12506,
12571,
12572,
12792,
12793,
12859,
12860,
12862,
12864,
12865,
12906,
12907,
12959,
12960,
13088,
13089,
13732,
13733,
13910,
13911,
13913,
13915,
13921,
13922,
13944,
13945,
14252,
14253,
14516,
14517,
14555,
14556,
14558,
14560,
14569,
14570,
14580,
14581,
14663,
14664,
14666,
14668,
14669,
14691,
14692,
14968,
14969,
15075,
15076,
15078,
15080,
15091,
15092,
15147,
15148,
15718,
15719,
15725,
15726,
15728,
15730,
15736,
15737,
15763,
15764,
15861,
15862,
16012,
16013,
16015,
16017,
16053,
16054,
16060
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 16060,
"ccnet_original_nlines": 399,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 2,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.40242525935173035,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04173716902732849,
"rps_doc_frac_lines_end_with_ellipsis": 0.014999999664723873,
"rps_doc_frac_no_alph_words": 0.2019176483154297,
"rps_doc_frac_unique_words": 0.34955906867980957,
"rps_doc_mean_word_length": 4.3767194747924805,
"rps_doc_num_sentences": 230,
"rps_doc_symbol_to_word_ratio": 0.0042301202192902565,
"rps_doc_unigram_entropy": 6.051463603973389,
"rps_doc_word_count": 2835,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.008059320040047169,
"rps_doc_frac_chars_dupe_6grams": 0.004513219930231571,
"rps_doc_frac_chars_dupe_7grams": 0.004513219930231571,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.0033849100582301617,
"rps_doc_frac_chars_top_3gram": 0.0038684699684381485,
"rps_doc_frac_chars_top_4gram": 0.002740170108154416,
"rps_doc_books_importance": -1639.62939453125,
"rps_doc_books_importance_length_correction": -1639.62939453125,
"rps_doc_openwebtext_importance": -779.9190063476562,
"rps_doc_openwebtext_importance_length_correction": -779.9190063476562,
"rps_doc_wikipedia_importance": -571.102783203125,
"rps_doc_wikipedia_importance_length_correction": -571.102783203125
},
"fasttext": {
"dclm": 0.13614416122436523,
"english": 0.963695228099823,
"fineweb_edu_approx": 1.2474918365478516,
"eai_general_math": 0.14187347888946533,
"eai_open_web_math": 0.1894676685333252,
"eai_web_code": 0.04462403059005737
}
}
|
{
"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": "338.4",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Industries, Prices, and Microeconomics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,115,302,067,253,183,000 |
Like the blog? Get the book »
Joomla Beats WordPress?
Here are a few specific circumstances where elmalak feels that Jooma is better than WordPress. I understand some, disagree with others. I'm always interested in debates comparing different CMSs, but have never read anything that really nailed it. Largely I think people defend the one that they use the most and the one they feel most productive using. Hey, that's what I do.
Editor's note: 404 link removed.
© 2009–2020 Digging Into WordPress Powered by WordPress Monzilla Media shapeSpace
|
{
"url": "https://digwp.com/2010/06/joomla-beats-wordpress/",
"source_domain": "digwp.com",
"snapshot_id": "crawl=CC-MAIN-2020-40",
"warc_metadata": {
"Content-Length": "19863",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2NDWEE6WQW2WOMP6IIAD3WO5MXN4VD4P",
"WARC-Concurrent-To": "<urn:uuid:bb7dd38a-7f70-49e9-91d7-6d3244153764>",
"WARC-Date": "2020-09-27T20:26:57Z",
"WARC-IP-Address": "64.207.179.70",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3U6FHFWKN3HI2BDMQQK5JKZPAJFDEQLB",
"WARC-Record-ID": "<urn:uuid:9d12f273-37df-40b6-a0c9-be028ecc6ccd>",
"WARC-Target-URI": "https://digwp.com/2010/06/joomla-beats-wordpress/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bb4717b0-2c1c-4e15-9a55-1a6b892cc211>"
},
"warc_info": "isPartOf: CC-MAIN-2020-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-204.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,
30,
31,
55,
56,
432,
433,
466,
467
],
"line_end_idx": [
30,
31,
55,
56,
432,
433,
466,
467,
548
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 548,
"ccnet_original_nlines": 8,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.40366971492767334,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03669724985957146,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19266055524349213,
"rps_doc_frac_unique_words": 0.8426966071128845,
"rps_doc_mean_word_length": 4.955056190490723,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.215120315551758,
"rps_doc_word_count": 89,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02721088007092476,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -46.73109436035156,
"rps_doc_books_importance_length_correction": -60.440738677978516,
"rps_doc_openwebtext_importance": -27.469579696655273,
"rps_doc_openwebtext_importance_length_correction": -41.17922592163086,
"rps_doc_wikipedia_importance": -24.208267211914062,
"rps_doc_wikipedia_importance_length_correction": -37.917911529541016
},
"fasttext": {
"dclm": 0.08629083633422852,
"english": 0.9537594318389893,
"fineweb_edu_approx": 0.949280321598053,
"eai_general_math": 0.0018276600167155266,
"eai_open_web_math": 0.17905151844024658,
"eai_web_code": 0.0001707699993858114
}
}
|
{
"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.7",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "14",
"label": "Reviews/Critiques"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,870,037,539,596,910,000 |
Saturday
July 26, 2014
Homework Help: algerba
Posted by maria on Sunday, January 11, 2009 at 10:19pm.
what is the answer to 5(w-2)=15
Answer this Question
First Name:
School Subject:
Answer:
Related Questions
Algerba 1 - I have to put these intergers in order from least to greatest. 12, -...
algerba - simplify the expression -10xy - 15y / 5y -10xy -3y^2 is my answer ...
math (algerba 1) Please help! - x+y=0 3x+y=-4 Sovle each system of equation by ...
Algerba - 4x + 10 = 22
algerba - 3/4 + 7/10 + 4/15 = 3/11+ 9/11 +1/11 =
algerba - Quantity name Water adds Final acidity of water Unit Gallons Percent ...
algerba i - 2(7n-1)> or equal 3(5-n)
Am I doing Algerba right? - 6a for a = 3 and a = -4 So is it A. 6a = 6*3 = 18? B...
elementary algerba - add 3y-5 to y+16
trig and algerba - 6+7(t - 1) = 5(t + 7) + 8 what does t equal
Search
Members
|
{
"url": "http://www.jiskha.com/display.cgi?id=1231730367",
"source_domain": "www.jiskha.com",
"snapshot_id": "crawl=CC-MAIN-2014-23",
"warc_metadata": {
"Content-Length": "8130",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4WJCJJ6CNFFAVCCV22MVBYS3KI4J7I2Q",
"WARC-Concurrent-To": "<urn:uuid:04ee3752-82ca-429d-bd89-ac7d103eb683>",
"WARC-Date": "2014-07-26T09:13:30Z",
"WARC-IP-Address": "69.16.226.94",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:FSANA6ER3WZYPVI7V3RWEAMEGGRGJO5D",
"WARC-Record-ID": "<urn:uuid:72b3bc37-8757-49f6-a541-92d1f9a41976>",
"WARC-Target-URI": "http://www.jiskha.com/display.cgi?id=1231730367",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4183c1cb-9a96-4432-8d8d-352e654cee9a>"
},
"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,
9,
23,
24,
47,
48,
104,
105,
137,
138,
159,
160,
172,
188,
196,
197,
215,
216,
300,
380,
463,
486,
535,
618,
655,
739,
777,
840,
841,
848
],
"line_end_idx": [
9,
23,
24,
47,
48,
104,
105,
137,
138,
159,
160,
172,
188,
196,
197,
215,
216,
300,
380,
463,
486,
535,
618,
655,
739,
777,
840,
841,
848,
855
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 855,
"ccnet_original_nlines": 29,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.18875502049922943,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01606426015496254,
"rps_doc_frac_lines_end_with_ellipsis": 0.1666666716337204,
"rps_doc_frac_no_alph_words": 0.5100401639938354,
"rps_doc_frac_unique_words": 0.7535211443901062,
"rps_doc_mean_word_length": 4.084506988525391,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0.0200803205370903,
"rps_doc_unigram_entropy": 4.491744041442871,
"rps_doc_word_count": 142,
"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.027586210519075394,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -112.63908386230469,
"rps_doc_books_importance_length_correction": -112.63908386230469,
"rps_doc_openwebtext_importance": -55.41282653808594,
"rps_doc_openwebtext_importance_length_correction": -51.850128173828125,
"rps_doc_wikipedia_importance": -29.645496368408203,
"rps_doc_wikipedia_importance_length_correction": -29.645496368408203
},
"fasttext": {
"dclm": 0.6664642095565796,
"english": 0.8730668425559998,
"fineweb_edu_approx": 2.4608254432678223,
"eai_general_math": 0.033221129328012466,
"eai_open_web_math": 0.4667704701423645,
"eai_web_code": 0.0015476299449801445
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "372.7",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Elementary and Kindergarten"
}
}
},
"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": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "1",
"label": "Truncated Snippets"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,060,212,581,961,922,000 |
04-创建kubeconfig认证文件
本文档记录自己的学习历程！
创建 kubeconfig 文件
kubeletkube-proxy 等 Node 机器上的进程与 Master 机器的 kube-apiserver 进程通信时需要认证和授权；
kubernetes 1.4 开始支持由 kube-apiserver 为客户端生成 TLS 证书的 TLS Bootstrapping 功能，这样就不需要为每个客户端生成证书了；该功能当前仅支持为 kubelet 生成证书；
创建 TLS Bootstrapping Token
Token auth file
Token可以是任意的包涵128 bit的字符串，可以使用安全的随机数发生器生成
export BOOTSTRAP_TOKEN=$(head -c 16 /dev/urandom | od -An -t x | tr -d ' ')
cat > token.csv <<EOF
${BOOTSTRAP_TOKEN},kubelet-bootstrap,10001,"system:kubelet-bootstrap"
EOF
后三行是一句，直接复制上面的脚本运行即可。
将token.csv发到所有机器（Master 和 Node）的 /etc/kubernetes/ 目录。
# cp token.csv /etc/kubernetes/
# scp token.csv xxxx:/etc/kubernetes/
创建 kubelet bootstrapping kubeconfig 文件
# cd /etc/kubernetes
# export KUBE_APISERVER="https://192.168.1.121:6443"
# # 设置集群参数
# kubectl config set-cluster kubernetes \
--certificate-authority=/etc/kubernetes/ssl/ca.pem \
--embed-certs=true \
--server=${KUBE_APISERVER} \
--kubeconfig=bootstrap.kubeconfig
# # 设置客户端认证参数
# kubectl config set-credentials kubelet-bootstrap \
--token=${BOOTSTRAP_TOKEN} \
--kubeconfig=bootstrap.kubeconfig
# # 设置上下文参数
# kubectl config set-context default \
--cluster=kubernetes \
--user=kubelet-bootstrap \
--kubeconfig=bootstrap.kubeconfig
# # 设置默认上下文
# kubectl config use-context default --kubeconfig=bootstrap.kubeconfig
• --embed-certstrue 时表示将 certificate-authority 证书写入到生成的 bootstrap.kubeconfig 文件中；
• 设置客户端认证参数时没有指定秘钥和证书，后续由 kube-apiserver 自动生成；
创建 kube-proxy kubeconfig 文件
# export KUBE_APISERVER="https://192.168.1.121:6443"
# # 设置集群参数
# kubectl config set-cluster kubernetes \
--certificate-authority=/etc/kubernetes/ssl/ca.pem \
--embed-certs=true \
--server=${KUBE_APISERVER} \
--kubeconfig=kube-proxy.kubeconfig
# # 设置客户端认证参数
# kubectl config set-credentials kube-proxy \
--client-certificate=/etc/kubernetes/ssl/kube-proxy.pem \
--client-key=/etc/kubernetes/ssl/kube-proxy-key.pem \
--embed-certs=true \
--kubeconfig=kube-proxy.kubeconfig
# # 设置上下文参数
# kubectl config set-context default \
--cluster=kubernetes \
--user=kube-proxy \
--kubeconfig=kube-proxy.kubeconfig
3 # 设置默认上下文
# kubectl config use-context default --kubeconfig=kube-proxy.kubeconfig
• 设置集群参数和客户端认证参数时 --embed-certs 都为 true，这会将 certificate-authorityclient-certificateclient-key 指向的证书文件内容写入到生成的 kube-proxy.kubeconfig 文件中；
• kube-proxy.pem 证书中 CN 为 system:kube-proxykube-apiserver 预定义的 RoleBinding cluster-admin 将User system:kube-proxy 与 Role system:node-proxier 绑定，该 Role 授予了调用 kube-apiserver Proxy 相关 API 的权限；
分发 kubeconfig 文件
将两个 kubeconfig 文件分发到所有 Node 机器的 /etc/kubernetes/ 目录
# cp bootstrap.kubeconfig kube-proxy.kubeconfig /etc/kubernetes/
# scp bootstrap.kubeconfig kube-proxy.kubeconfig xxxx:/etc/kubernetes/
本文参与腾讯云自媒体分享计划，欢迎正在阅读的你也加入，一起分享。
发表于
我来说两句
0 条评论
登录 后参与评论
相关文章
来自专栏赵俊的Java专栏
搭建一个自己的私有云 + 离线下载站
1.9K4
来自专栏PHP在线
从输入url开始能做哪些优化
此文主要讲的事情是如何让用户快点看到首屏页面，其主要影响因素是延迟和解析渲染耗时。有关安全部分其实也是优化的一部分。我们着重说下网络部分。
1114
来自专栏云计算教程系列
如何在Ubuntu 18.04上为用户目录设置vsftpd
FTP是文件传输协议的缩写，是一种曾经广泛用于在客户端和服务器之间移动文件的网络协议。它已被更快，更安全，更方便的文件传输方式所取代。许多普通网民希望通过htt...
760
来自专栏cmazxiaoma的架构师之路
MyEclipse使用Git进行Push to Upstream报错 学习笔记
852
来自专栏Youngxj
emlog后台登录失败邮件通知
1173
来自专栏张戈的专栏
Linux系统编译安装Redis以及主从复制配置小记
Redis 的安装配置很简单，而且很早之前就装过 Redis，可这几天再次安装时居然又遗忘了一些细节，看来好记性不如烂笔头，还是在博客记录一下比较好，至少不用总...
2683
来自专栏散尽浮华
Nginx反向代理中使用proxy_redirect重定向url
在使用Nginx做反向代理功能时，有时会出现重定向的url不是我们想要的url，这时候就可以使用proxy_redirect进行url重定向设置了。proxy_...
1K5
来自专栏惨绿少年
SSH服务详解
第1章 SSH服务 1.1 SSH服务协议说明 SSH 是 Secure Shell Protocol 的简写，由 IETF 网络工作小组（Network Wo...
2200
来自专栏FreeBuf
Oracle数据库漏洞分析：无需用户名和密码进入你的数据库
摘要 一般性的数据库漏洞，都是在成功连接或登录数据库后实现入侵；本文介绍两个在2012年暴露的Oracle漏洞，通过这两种漏洞的结合，可以在不掌握用户名/密码...
2426
来自专栏优启梦
emlog后台登录失败邮件通知
前面说到emlog后台登录参数加密，下面我们说说如何给emlog添加后台登录失败邮件通知的功能，本次我们需要用到mail函数，当然也就是需要25端口发信，如果是...
61412
扫码关注云+社区
|
{
"url": "https://cloud.tencent.com/developer/article/1155609",
"source_domain": "cloud.tencent.com",
"snapshot_id": "crawl=CC-MAIN-2019-04",
"warc_metadata": {
"Content-Length": "69769",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DGVWGYXF7SE6QJWYYZ3MCHERPJ3XS2NU",
"WARC-Concurrent-To": "<urn:uuid:85774e32-8228-4196-8d84-3d2cbf86588d>",
"WARC-Date": "2019-01-24T02:37:06Z",
"WARC-IP-Address": "119.28.39.127",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CESFNYZTA4OKFKLPZRONQK22VGYRFFLO",
"WARC-Record-ID": "<urn:uuid:807c7398-4c3e-4423-97c6-fcbb50363e4f>",
"WARC-Target-URI": "https://cloud.tencent.com/developer/article/1155609",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9a2af442-1f8d-4945-9391-ac6b9262fd91>"
},
"warc_info": "isPartOf: CC-MAIN-2019-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-149-111-56.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,
20,
21,
35,
36,
53,
54,
127,
128,
242,
243,
270,
271,
287,
288,
329,
330,
406,
428,
498,
502,
503,
525,
526,
580,
581,
613,
651,
652,
691,
692,
713,
766,
777,
819,
874,
897,
928,
964,
978,
1031,
1062,
1098,
1110,
1149,
1174,
1203,
1239,
1251,
1322,
1406,
1455,
1456,
1484,
1485,
1538,
1549,
1591,
1646,
1669,
1700,
1737,
1751,
1797,
1857,
1913,
1936,
1973,
1985,
2024,
2049,
2071,
2108,
2120,
2192,
2331,
2522,
2523,
2540,
2541,
2593,
2594,
2659,
2730,
2731,
2764,
2765,
2769,
2770,
2776,
2777,
2783,
2792,
2793,
2798,
2799,
2813,
2814,
2833,
2834,
2840,
2850,
2851,
2866,
2867,
2937,
2938,
2943,
2955,
2956,
2986,
2987,
3071,
3072,
3076,
3097,
3098,
3138,
3139,
3143,
3155,
3156,
3172,
3173,
3178,
3188,
3189,
3216,
3217,
3301,
3302,
3307,
3316,
3317,
3350,
3351,
3435,
3436,
3440,
3449,
3450,
3458,
3459,
3543,
3544,
3549,
3561,
3562,
3592,
3593,
3676,
3677,
3682,
3690,
3691,
3707,
3708,
3792,
3793,
3799,
3800
],
"line_end_idx": [
20,
21,
35,
36,
53,
54,
127,
128,
242,
243,
270,
271,
287,
288,
329,
330,
406,
428,
498,
502,
503,
525,
526,
580,
581,
613,
651,
652,
691,
692,
713,
766,
777,
819,
874,
897,
928,
964,
978,
1031,
1062,
1098,
1110,
1149,
1174,
1203,
1239,
1251,
1322,
1406,
1455,
1456,
1484,
1485,
1538,
1549,
1591,
1646,
1669,
1700,
1737,
1751,
1797,
1857,
1913,
1936,
1973,
1985,
2024,
2049,
2071,
2108,
2120,
2192,
2331,
2522,
2523,
2540,
2541,
2593,
2594,
2659,
2730,
2731,
2764,
2765,
2769,
2770,
2776,
2777,
2783,
2792,
2793,
2798,
2799,
2813,
2814,
2833,
2834,
2840,
2850,
2851,
2866,
2867,
2937,
2938,
2943,
2955,
2956,
2986,
2987,
3071,
3072,
3076,
3097,
3098,
3138,
3139,
3143,
3155,
3156,
3172,
3173,
3178,
3188,
3189,
3216,
3217,
3301,
3302,
3307,
3316,
3317,
3350,
3351,
3435,
3436,
3440,
3449,
3450,
3458,
3459,
3543,
3544,
3549,
3561,
3562,
3592,
3593,
3676,
3677,
3682,
3690,
3691,
3707,
3708,
3792,
3793,
3799,
3800,
3808
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3808,
"ccnet_original_nlines": 160,
"rps_doc_curly_bracket": 0.002100839978083968,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.02403203956782818,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03070761077105999,
"rps_doc_frac_lines_end_with_ellipsis": 0.03726708143949509,
"rps_doc_frac_no_alph_words": 0.5887850522994995,
"rps_doc_frac_unique_words": 0.6842105388641357,
"rps_doc_mean_word_length": 11.515037536621094,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0.04806409031152725,
"rps_doc_unigram_entropy": 5.0193281173706055,
"rps_doc_word_count": 266,
"rps_doc_frac_chars_dupe_10grams": 0.09859614819288254,
"rps_doc_frac_chars_dupe_5grams": 0.15801501274108887,
"rps_doc_frac_chars_dupe_6grams": 0.1338557004928589,
"rps_doc_frac_chars_dupe_7grams": 0.09859614819288254,
"rps_doc_frac_chars_dupe_8grams": 0.09859614819288254,
"rps_doc_frac_chars_dupe_9grams": 0.09859614819288254,
"rps_doc_frac_chars_top_2gram": 0.03395364060997963,
"rps_doc_frac_chars_top_3gram": 0.0287299994379282,
"rps_doc_frac_chars_top_4gram": 0.03330069035291672,
"rps_doc_books_importance": -396.93768310546875,
"rps_doc_books_importance_length_correction": -396.93768310546875,
"rps_doc_openwebtext_importance": -178.2888946533203,
"rps_doc_openwebtext_importance_length_correction": -178.2888946533203,
"rps_doc_wikipedia_importance": -120.41300964355469,
"rps_doc_wikipedia_importance_length_correction": -120.41300964355469
},
"fasttext": {
"dclm": 0.18756955862045288,
"english": 0.03251035884022713,
"fineweb_edu_approx": 1.5832550525665283,
"eai_general_math": 0.3237752914428711,
"eai_open_web_math": 0.16689026355743408,
"eai_web_code": 0.765419602394104
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,961,198,127,244,264,000 |
devxlogo
Delete Files from SQL Server Local Machine
Delete Files from SQL Server Local Machine
Ever wanted to delete files from the local machine that your SQL Server database is running? You can do it using the extended stored procedure xp_cmdshell like this:
EXEC master..xp_cmdshell 'del C:file.txt'
But this requires the sysadmin option on the SQL Server and Admin role fromNT server. In most instances it is not preferable to give these privileges. So to delete files without requiring this access use the built-in SQL Server Automation APIs and the FileSystemObject:
DECLARE @hr intDECLARE @ole_FileSystem intEXEC @hr = sp_OACreate 'Scripting.FileSystemObject', @ole_FileSystem OUTEXEC @hr = sp_OAMethod @ole_FileSystem, 'DeleteFile', NULL, 'C:file.txt'EXEC @hr = sp_OADestroy @ole_FileSystem
devxblackblue
About Our Editorial Process
At DevX, we’re dedicated to tech entrepreneurship. Our team closely follows industry shifts, new products, AI breakthroughs, technology trends, and funding announcements. Articles undergo thorough editing to ensure accuracy and clarity, reflecting DevX’s style and supporting entrepreneurs in the tech sphere.
See our full editorial policy.
About Our Journalist
|
{
"url": "https://www.devx.com/tip-bank/14200/",
"source_domain": "www.devx.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "244100",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LJCHMTIG6QSACYEQSGA2GZSEDUKUF6AL",
"WARC-Concurrent-To": "<urn:uuid:fc09d402-1956-4883-8314-af0a4607a835>",
"WARC-Date": "2024-04-16T13:58:07Z",
"WARC-IP-Address": "172.67.213.166",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:F4ZZ5ITLLMPUNK7ET434YSITYURWTLQL",
"WARC-Record-ID": "<urn:uuid:63ff364b-67ee-43f8-8606-ada48cdc7d92>",
"WARC-Target-URI": "https://www.devx.com/tip-bank/14200/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ed423fe0-3bd1-4d6c-8ad0-afee26712fa6>"
},
"warc_info": "isPartOf: CC-MAIN-2024-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-82\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
9,
10,
53,
54,
97,
98,
264,
265,
308,
309,
579,
580,
822,
836,
837,
865,
866,
1176,
1177,
1208,
1209
],
"line_end_idx": [
9,
10,
53,
54,
97,
98,
264,
265,
308,
309,
579,
580,
822,
836,
837,
865,
866,
1176,
1177,
1208,
1209,
1229
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1229,
"ccnet_original_nlines": 21,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.21917808055877686,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05936073139309883,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2054794430732727,
"rps_doc_frac_unique_words": 0.6829268336296082,
"rps_doc_mean_word_length": 5.9817070960998535,
"rps_doc_num_sentences": 12,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.50388765335083,
"rps_doc_word_count": 164,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07339449971914291,
"rps_doc_frac_chars_dupe_6grams": 0.07339449971914291,
"rps_doc_frac_chars_dupe_7grams": 0.07339449971914291,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.0458715595304966,
"rps_doc_frac_chars_top_3gram": 0.0458715595304966,
"rps_doc_frac_chars_top_4gram": 0.03669724985957146,
"rps_doc_books_importance": -81.33740234375,
"rps_doc_books_importance_length_correction": -81.33740234375,
"rps_doc_openwebtext_importance": -45.963584899902344,
"rps_doc_openwebtext_importance_length_correction": -45.96356964111328,
"rps_doc_wikipedia_importance": -42.92934799194336,
"rps_doc_wikipedia_importance_length_correction": -42.92934799194336
},
"fasttext": {
"dclm": 0.03733712062239647,
"english": 0.7960477471351624,
"fineweb_edu_approx": 1.647385835647583,
"eai_general_math": 0.041818320751190186,
"eai_open_web_math": 0.2101973295211792,
"eai_web_code": 0.20377230644226074
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,956,874,491,031,082,000 |
you are viewing a single comment's thread.
view the rest of the comments →
[–]doenr 42 points43 points ago
sorry, this has been archived and can no longer be voted on
I understand that there is no (and never will be) a Dislike/Downvote button on Facebook. Because soon after introduction of that, 90% of my list would unfriend me.
What I would find interesting: A combination of non-anonymous "Likes" and anonymous "Dislikes".
[–]knudow 4 points5 points ago
sorry, this has been archived and can no longer be voted on
There was a "Show more of this friend" / "Show less of this friend" back in the day, but they removed it. Now you can only hide all.
|
{
"url": "http://www.reddit.com/r/reactiongifs/comments/1agkvf/when_im_on_facebook/c8x97nr?context=3",
"source_domain": "www.reddit.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "54108",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PVVMQSVIQPQB6PAOO5HH26RB64WE7B5D",
"WARC-Concurrent-To": "<urn:uuid:b0db738a-f898-482e-9e18-e433b507b5af>",
"WARC-Date": "2013-12-20T02:36:05Z",
"WARC-IP-Address": "23.3.105.66",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:XBVZ5IH6QRB6IGYNKOCUGMVHDCT235YA",
"WARC-Record-ID": "<urn:uuid:2b8ff226-a3c2-4cb8-b4c3-257be9e80b66>",
"WARC-Target-URI": "http://www.reddit.com/r/reactiongifs/comments/1agkvf/when_im_on_facebook/c8x97nr?context=3",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:302f6ba9-befa-40b0-a9d7-44dcfe2a92fd>"
},
"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,
43,
44,
76,
77,
109,
110,
170,
171,
335,
336,
432,
433,
464,
465,
525,
526
],
"line_end_idx": [
43,
44,
76,
77,
109,
110,
170,
171,
335,
336,
432,
433,
464,
465,
525,
526,
658
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 658,
"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.4383561611175537,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.020547950640320778,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21232877671718597,
"rps_doc_frac_unique_words": 0.6551724076271057,
"rps_doc_mean_word_length": 4.344827651977539,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.184228420257568,
"rps_doc_word_count": 116,
"rps_doc_frac_chars_dupe_10grams": 0.2222222238779068,
"rps_doc_frac_chars_dupe_5grams": 0.2222222238779068,
"rps_doc_frac_chars_dupe_6grams": 0.2222222238779068,
"rps_doc_frac_chars_dupe_7grams": 0.2222222238779068,
"rps_doc_frac_chars_dupe_8grams": 0.2222222238779068,
"rps_doc_frac_chars_dupe_9grams": 0.2222222238779068,
"rps_doc_frac_chars_top_2gram": 0.035714291036129,
"rps_doc_frac_chars_top_3gram": 0.055555559694767,
"rps_doc_frac_chars_top_4gram": 0.0714285671710968,
"rps_doc_books_importance": -74.1726303100586,
"rps_doc_books_importance_length_correction": -82.69225311279297,
"rps_doc_openwebtext_importance": -35.991024017333984,
"rps_doc_openwebtext_importance_length_correction": -44.510643005371094,
"rps_doc_wikipedia_importance": -14.056424140930176,
"rps_doc_wikipedia_importance_length_correction": -22.5760440826416
},
"fasttext": {
"dclm": 0.0837065577507019,
"english": 0.9652367234230042,
"fineweb_edu_approx": 0.9552834630012512,
"eai_general_math": 0.07738304138183594,
"eai_open_web_math": 0.2717106342315674,
"eai_web_code": 0.0000427999984822236
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "302.22",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": "Social psychology"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"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": "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
|
-1,826,748,608,403,000,600 |
The Big Four Banking Trojans
Banking trojans are like rats, you kick a trashcan and six of them go scurrying off in every direction. Most of them you’ll read about once and never again. But there is a big four of sorts that just never seem to go away: Carberp, Citadel, SpyEye, and especially Zeus.
trojans
Semantically speaking the problem with calling these things banking trojans, is that sometimes we catch them doing other bad stuff not related to the theft of financial information. It’s all very murky in the seedy underworld of cybercrime, but, semantics aside, each of these pieces of malicious software represents a real problem: they are damn good at stealing online and other banking information.
It’s a bit difficult to write a compelling story about a handful of different banking trojans seeing that they all do essentially the same thing, but nonetheless, here is a run down of the four most prolific ones in a rough reverse order of notoriety:
Carberp
The original version of Carberp was something of a typical Trojan. It was designed to steal users’ sensitive data, like online banking credentials or username-password combinations for other high-value sites. Carberp relayed the information it stole back to a command and control (C&C) server under its creator’s control. Simple and straightforward. The only tricky component was the complicated rootkit functionality, allowing the Trojan to remain unnoticed on the victim’s system. The next generation of Carberp added plug-ins: one that removed anti-malware software from infected machines and another that tried to kill off other pieces of malware should they exist.
Things got more interesting when its maintainers gave their trojan the ability to encrypt stolen data as it passed between affected machines and their C&C server. According to researchers, Carberp represented the first time that a piece of malware used a randomly generated cryptographic cipher rather than a static key.
At one point, Carberp started working in conjuncture with the most-notorious Blackhole exploit kit, generating an enormous uptick in infections. All was going well for Carberp and its authors. They had even managed to develop a Carberp module on Facebook that tried to trick users into handing over e-cash vouchers as part of a ransomware-type scam.
According to researchers, Carberp represented the first time that a piece of malware used a randomly generated cryptographic cipher rather than a static key.
From there, things went downhill a bit. Russian authorities nabbed eight men believed to be responsible for controlling the malware, but Carberp did not die. Since then there has been no shortage of Carberp sabotage attempts and arrests. At one point, criminals seeking to deploy the tool would have to pay $40,000 for access to it until its source code was released last year, giving nearly anyone with enough know-how access to the trojan.
Citadel
The Citadel trojan is a variation of the king of financial malware, Zeus. It emerged, along with a number of other one-off trojans, after the Zeus trojan’s source code leaked in 2011. Citadel’s initial noteworthiness has a lot to do with its creator’s novel adoption of the open the open-source development model that let anyone review its code and improve upon it (make it worse).
The group or groups of criminals responsible for Citadel developed a community of customers and contributors around the globe that would suggest new features for the malware, contributing code and modules as part of a criminal social network of sorts. Some of the most fascinating capabilities included AES encryption of configuration files and communications with the C&C server, an ability to evade tracking sites, the capacity to block access to security sites on victim machines, and a functionality that could record videos of victim activities.
The network of Citadel contributors continued adding newer and more dynamic features to the trojan, making it more adaptive and faster, until it became utilitarian that criminals began using it for all stripes of credential theft.
Citadel saw big success until Microsoft and a coalition of other companies launched an operation that would eventually disable some 88 percent of its infections.
SpyEye
The SpyEye trojan was supposed to be the banking trojan that would come to compete with Zeus. In the end, SpyEye was like all the men said to be heirs to Michael Jordan’s greatness. They had hype, they had potential, but they couldn’t take down the king. Zeus is the king, no doubt, but SpyEye made a fast disappearing splash.
At one point, parts of SpyEye botnet operation merged with Zeus’s into a meg-banking-botnet, but it would ultimately burn out without living up to the hype. It had its successes though. Attackers deployed SpyEye in an attack targeting Verizon’s online billing page pilfering users’ sensitive personal and financial information for more than a week without notice. It showed up on Amazon’s Simple Storage Service, using the cloud provider as a platform for attacks, it showed up on Android devices at one point, but a series of arrests and perhaps just a lack of effectiveness ended SpyEye’s run.
Three Baltic men were arrested in the summer of 2012 for using SpyEye to operate a highly organized banking information theft operation. In May of this year, an alleged SpyEye developer was arrested in Thailand and extradited to the United States, where he faces more than thirty counts of botnet and bank fraud related charge.
Since then, we haven’t heard a whole lot about SpyEye.
Zeus
And then there was Zeus. Aptly named for the king of the Grecian Gods, Zeus unparalleled in scope, use, and effectiveness. Since its source code was leaked in 2011, it seems that nearly every banking trojan has flavors of Zeus built into it. Among these, only Zeus is notorious enough to have its own Wikipedia page. There are 22 pages, each containing ten stories, on Threatpost (the site where all these hyperlinks go to) making reference to the Zeus trojan. You could write a Leo Tolstoy or Marcel Proust length novel about the shenanigans of the Zeus trojan, so it’s nearly impossible to briefly synopsize the threat, but we’ll throw out some highlights.
It burst onto the scene in 2007 after it was used in a credential-theft attack targeting the United States Department of Transportation. Since then Zeus has infected tens of millions of machines and resulted in the theft of hundreds of millions of dollars until its creator reportedly called it quits in 2011, publishing the malware’s source code online. Many hundreds or individuals served or are serving jail time for their involvement in Zeus-related scams.
It was among the first pieces of malware sold via license. Until its source code was made public, Zeus was the scourge of banks and corporations alike. The list of it’s victims is too long to list, but includes prominent banks, corporations, and government agencies.
Zeus is also known for innovative usage of mobile “younger brother” called ZitMo to circumvent popular two-factor authentication schemes with security code being provided via text message. SpyEye and Carber developed their respective mobile counterparts as well.
Banking malware aside, the Zeus trojan is among the most notorious of all malware, second only perhaps to Stuxnet.
The protection
Each malware in The Big Four share the same essential properties: it tries to evade detection by your antivirus, it intercepts keystrokes, browser data, stored files and basically everything that helps to sneak into your banking account and initiate an illegal money transfer. It even tries to install mobile malware on your smartphone, which enables criminals to steal one-time security codes, often used by banks to approve transactions. Among other types of malware, banking Trojans have the potential to inflict direct financial damage to their victims, that’s why modern protection software must include specific countermeasures against every aspect of the “banking” Trojan functionality. Kaspersky Lab has packaged these protection measures into Safe Money technology, which is implemented in recent versions of Kaspersky Internet Security – Multi-Device and Kaspersky PURE. Learn how to enable Safe Money with this tip.
Send to Kindle
|
{
"url": "https://blog.kaspersky.com/the-big-four-banking-trojans/",
"source_domain": "blog.kaspersky.com",
"snapshot_id": "crawl=CC-MAIN-2015-32",
"warc_metadata": {
"Content-Length": "58427",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:GO6HEHL2IP4NUJT7KHVPG33UCYLFWOEI",
"WARC-Concurrent-To": "<urn:uuid:832e7bbd-f83c-41e4-b4f5-1403fad890bf>",
"WARC-Date": "2015-08-02T18:23:08Z",
"WARC-IP-Address": "198.61.150.241",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:2444ZJH5IRY6MGBR7OF5RB4AEGPBUCOE",
"WARC-Record-ID": "<urn:uuid:683e7870-6b82-467a-afc9-385673c7c994>",
"WARC-Target-URI": "https://blog.kaspersky.com/the-big-four-banking-trojans/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bba510b7-5bac-470d-8981-b329c6ff8588>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-236-191-2.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-32\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for August 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
29,
30,
301,
302,
310,
311,
713,
714,
966,
967,
975,
976,
1647,
1648,
1969,
1970,
2320,
2321,
2479,
2480,
2922,
2923,
2931,
2932,
3314,
3315,
3866,
3867,
4098,
4099,
4261,
4262,
4269,
4270,
4597,
4598,
5194,
5195,
5523,
5524,
5579,
5580,
5585,
5586,
6245,
6246,
6707,
6708,
6975,
6976,
7239,
7240,
7355,
7356,
7371,
7372,
8299,
8300
],
"line_end_idx": [
29,
30,
301,
302,
310,
311,
713,
714,
966,
967,
975,
976,
1647,
1648,
1969,
1970,
2320,
2321,
2479,
2480,
2922,
2923,
2931,
2932,
3314,
3315,
3866,
3867,
4098,
4099,
4261,
4262,
4269,
4270,
4597,
4598,
5194,
5195,
5523,
5524,
5579,
5580,
5585,
5586,
6245,
6246,
6707,
6708,
6975,
6976,
7239,
7240,
7355,
7356,
7371,
7372,
8299,
8300,
8314
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8314,
"ccnet_original_nlines": 58,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41308531165122986,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005131490062922239,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12379731237888336,
"rps_doc_frac_unique_words": 0.4516853988170624,
"rps_doc_mean_word_length": 5.086891174316406,
"rps_doc_num_sentences": 60,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.70146369934082,
"rps_doc_word_count": 1335,
"rps_doc_frac_chars_dupe_10grams": 0.03887498006224632,
"rps_doc_frac_chars_dupe_5grams": 0.04505963996052742,
"rps_doc_frac_chars_dupe_6grams": 0.03887498006224632,
"rps_doc_frac_chars_dupe_7grams": 0.03887498006224632,
"rps_doc_frac_chars_dupe_8grams": 0.03887498006224632,
"rps_doc_frac_chars_dupe_9grams": 0.03887498006224632,
"rps_doc_frac_chars_top_2gram": 0.00515387998893857,
"rps_doc_frac_chars_top_3gram": 0.005890150088816881,
"rps_doc_frac_chars_top_4gram": 0.007068180013448,
"rps_doc_books_importance": -603.3800659179688,
"rps_doc_books_importance_length_correction": -603.3800659179688,
"rps_doc_openwebtext_importance": -401.13623046875,
"rps_doc_openwebtext_importance_length_correction": -401.13623046875,
"rps_doc_wikipedia_importance": -304.8864440917969,
"rps_doc_wikipedia_importance_length_correction": -304.8864440917969
},
"fasttext": {
"dclm": 0.15809136629104614,
"english": 0.9511566758155823,
"fineweb_edu_approx": 2.51263165473938,
"eai_general_math": 0.2393525242805481,
"eai_open_web_math": 0.19676542282104492,
"eai_web_code": 0.12119842320680618
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.822",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "363.25",
"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": "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": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-247,612,358,480,016,640 |
Directanswer.Ru - Info directanswer.ru
directanswer.ru receives about 720 unique visitors and 742 (1.03 per visitor) page views per day which should earn about $1.00/day from advertising revenue. Estimated site value is $494.69. According to Alexa Traffic Rank directanswer.ru is ranked number 648,754 in the world and 0.000144% of global Internet users visit it. Site is hosted in San Francisco, CA, 94107, United States and links to network IP address 104.27.175.191. This server doesn't support HTTPS and doesn't support HTTP/2.
About - directanswer.ru
Technologies used on Website
Currently Not Available
directanswer.ru Profile
Last update was 1233 days ago
loader
This can take up to 60 seconds. Please wait...
*HypeStat.com is not linking to, promoting or affiliated with directanswer.ru in any way. Only publicly available statistics data are displayed.
How popular is directanswer.ru?
720 daily visitors
Is this your site?
Verify your site's metrics.
Daily Unique Visitors:
720
Monthly Unique Visitors:
17,280
Pages per Visit:
1.03
Daily Pageviews:
742
Alexa Rank:
648,754 visit alexa
Alexa Reach:
0.000144% (of global internet users)
Avg. visit duration:
n/a
Bounce rate:
n/a
*All traffic values are estimates only.
Alexa Traffic Ranks
Search Traffic
Visitors by country
Users%Pageviews%Rank
Russian Federation 72.0%72.0%103855
Kazakhstan 13.4%13.7%42952
Ukraine 11.0%10.7%96994
Belarus 3.0%3.0%100834
Where do visitors go on this site?
Reach%Pageviews%PerUser
directanswer.ru
100.00%100.00%1.02
Competitive Data
SEMrush
Domain:
directanswer.ru
Rank:
(Rank based on keywords, cost and organic traffic)
n/a
Organic Keywords:
(Number of keywords in top 20 Google SERP)
0
Organic Traffic:
(Number of visitors coming from top 20 search results)
0
Organic Cost:
((How much need to spend if get same number of visitors from Google Adwords)
$0.00
Adwords Keywords:
(Keywords a website is buying in Google AdWords for ads that appear in paid search results)
0
Adwords Traffic:
(Number of visitors brought to the website via paid search results)
0
Adwords Cost:
(Estimated budget spent for buying keywords in Google AdWords for ads that appear in paid search results - monthly estimation)
$0.00
+ Moz Data
Domain Authority:
n/a
Page Authority:
n/a
MozRank:
n/a
+ How socially engaged is directanswer.ru?
Facebook:
0
Google +:
0
Linkedin:
0
Stumbles:
0
Buffer:
0
Pins:
0
+ Ad Experience Report
Summary of the ad experience rating of a site for a specific platform.
Desktop summary
Root domain:
directanswer.ru
Region:
(The Ad Standard region to which this site has been assigned.)
Pending
Ad filtering:
(Chrome is not filtering ads on your site.)
Off
Status:
(The status of the site that is reviewed for the Better Ads Standards.)
Not reviewed
Mobile summary
Region:
(The Ad Standard region to which this site has been assigned.)
Pending
Ad filtering:
(Chrome is not filtering ads on your site.)
Off
Status:
(The status of the site that is reviewed for the Better Ads Standards.)
Not reviewed
+ Abusive Experience Report
Root domain:
directanswer.ru
Enforcement:
(Chrome is not preventing your site from opening new windows or tabs.)
Off
Status:
(The status of the site reviewed for the abusive experiences.)
Not reviewed
+ How much directanswer.ru can earn?
Daily Revenue:
$1.00
Monthly Revenue:
$30.00
Yearly Revenue:
$365.00
*All earnings values are estimates only.
Daily earning by country
PageviewsEarning
Russian Federation 534$1.08
Ukraine 79$0.11
Kazakhstan 102$0.07
Belarus 22$0.03
How much money do directanswer.ru lose due to Adblock?
Daily Revenue Loss:
$0.08
Monthly Revenue Loss:
$2.53
Yearly Revenue Loss:
$30.81
Daily Pageviews Blocked:
48
Monthly Pageviews Blocked:
1,430
Yearly Pageviews Blocked:
17,393
*All earnings values are estimates only.
Daily revenue loss by country
BlockedLost Money
Russian Federation 32$0.07
Ukraine 10$0.01
Belarus 2$0.00
Kazakhstan 3$0.00
How much is directanswer.ru worth?
Website Value:
$494.69
+ Where is directanswer.ru hosted?
Server IP:
104.27.175.191
ASN:
AS13335
ISP:
Cloudflare Inc
Server Location:
San Francisco
CA
94107
United States
Other sites hosted on 104.27.175.191
+ How fast does directanswer.ru load?
Average Load Time:
n/a ms n/a % of sites are slower
Page Speed (Google PageSpeed Insights) - Desktop
Currently Not Available
Page Speed (Google PageSpeed Insights) - Mobile
Currently Not Available
Page Speed (Google PageSpeed Insights) - v2
Suggestions Summary
Use legible font sizes
The following text on your page renders in a way that may be difficult for some of your visitors to read. Use legible font sizes to provide a better user experience.
The following text fragments have a small font size. Increase the font size to make them more legible.
ГЛАВНАЯ renders only 5 pixels tall (13 CSS pixels) .
К НАИБОЛЕЕ РАС…ЛИЙСКИЙ (450), and 12 others render only 8 pixels tall (20 CSS pixels) .
20 Февраль 2014 and 12 others render only 5 pixels tall (12 CSS pixels) .
Вопросы к экза…ный принцип... and 12 others render only 7 pixels tall (18 CSS pixels) .
разное and 4 others render only 5 pixels tall (12 CSS pixels) .
Без рубрики / Комментарии 1 and 7 others render only 5 pixels tall (12 CSS pixels) .
1 renders only 5 pixels tall (14 CSS pixels).
and 3 others render only 5 pixels tall (14 CSS pixels).
Что европейски…екало в Китае? and 1 others render only 5 pixels tall (13 CSS pixels) .
Заполни таблиц…просветителей and 1 others render only 7 pixels tall (17 CSS pixels) .
Нарис про видатну людину renders only 7 pixels tall (18 CSS pixels) .
Орфограмма в слове боксер renders only 8 pixels tall (20 CSS pixels) .
Карта сайта: and 678 others render only 7 pixels tall (18 CSS pixels).
100 and 679 others render only 7 pixels tall (18 CSS pixels).
Size tap targets appropriately
Some of the links/buttons on your webpage may be too small for a user to easily tap on a touchscreen. Consider making these tap targets larger to provide a better user experience.
The following tap targets are close to other nearby tap targets and may need additional spacing around them.
The tap target <a href="http://directanswer.ru/page/2" class="inactive">2</a> and 3 others are close to other tap targets.
The tap target <a href="http://directa…-chlenami.html">10 предложений…одными членами</a> and 2 others are close to other tap targets .
The tap target <a href="http://directa…-7-rechen.html">5 речень про школу</a> and 1 others are close to other tap targets .
The tap target <a href="http://directa…iblioteci.html">Діалог у біблі…країнська мова</a> and 2 others are close to other tap targets .
The tap target <a href="http://directa…gite-pliz.html">Заполни таблиц…просветителей</a> and 2 others are close to other tap targets .
The tap target <a href="http://directa…u-lyudinu.html">Нарис про видатну людину</a> and 1 others are close to other tap targets .
The tap target <a href="http://directa…a-v-korne.html">Орфограмма в слове боксер</a> is close to 3 other tap targets .
The tap target <a href="http://directanswer.ru/" class="pluso-facebook"> is close to 1 other tap targets.
The tap target <a href="http://directanswer.ru/" class="pluso-moimir"> is close to 1 other tap targets.
The tap target <a href="http://directanswer.ru/" class="pluso-print"> is close to 2 other tap targets.
The tap target <a href="http://pluso.ru/" class="pluso-more"> is close to 2 other tap targets.
The tap target <a href="http://www.liv…ernet.ru/click"></a> and 682 others are close to other tap targets.
Eliminate render-blocking JavaScript and CSS in above-the-fold content
Your page has 5 blocking script resources and 1 blocking CSS resources. This causes a delay in rendering your page.
None of the above-the-fold content on your page could be rendered without waiting for the following resources to load. Try to defer or asynchronously load blocking resources, or inline the critical portions of those resources directly in the HTML.Remove render-blocking JavaScript:
http://directanswer.ru/wp-includes/js/jquery/jquery.js?ver=1.10.2
http://directanswer.ru/wp-includes/js/jquery/jquery-migrate.min.js?ver=1.2.1
http://directanswer.ru/wp-content/plugins/q2w3-fixed-widget/js/q2w3-fixed-widget.min.js?ver=4.0.6
http://directanswer.ru/wp-content/themes/clean_blog/js/jquery.tools.min.js?ver=1.2.7
http://directanswer.ru/wp-content/themes/clean_blog/js/script.js?ver=1.0
Optimize CSS Delivery of the following:
http://directanswer.ru/wp-content/themes/clean_blog/style.css?ver=2.1
Size content to viewport
The page content is too wide for the viewport, forcing the user to scroll horizontally. Size the page content to the viewport to provide a better user experience.
The page content is 1,080 CSS pixels wide, but the viewport is only 980 CSS pixels wide. The following elements fall outside the viewport:
The element <a href="http://directa…-chlenami.html">10 предложений…одными членами</a> falls outside the viewport.
The element <a href="http://directa…-7-rechen.html">5 речень про школу</a> falls outside the viewport.
The element <a href="http://directa…iblioteci.html">Діалог у біблі…країнська мова</a> falls outside the viewport.
The element <a href="http://directa…gite-pliz.html">Заполни таблиц…просветителей</a> falls outside the viewport.
The element <a href="http://directa…u-lyudinu.html">Нарис про видатну людину</a> falls outside the viewport.
The element <a href="http://directa…a-v-korne.html">Орфограмма в слове боксер</a> falls outside the viewport.
The element <a href="http://directa…rgumentov.html">Рост Москвы эт…рошо или плохо</a> falls outside the viewport.
The element <a href="http://directa…ix-kupcov.html">Что европейски…екало в Китае?</a> falls outside the viewport.
Configure the viewport
Your page does not have a viewport specified. This causes mobile devices to render your page as it would appear on a desktop browser, scaling it down to fit on a mobile screen. Configure a viewport to allow your page to render properly on all devices.
Configure a viewport for this page.
Leverage browser caching
Setting an expiry date or a maximum age in the HTTP headers for static resources instructs the browser to load previously downloaded resources from local disk rather than over the network.
Leverage browser caching for the following cacheable resources:
http://share.pluso.ru/img/plus.png (expiration not specified)
http://share.pluso.ru/img/pluso-like/square/big/04.png (expiration not specified)
http://t.insigit.com/nsapi/static/nsdk.js (expiration not specified)
http://front.facetz.net/collect_pluso.js (60 minutes)
https://mc.yandex.ru/metrika/watch.js (60 minutes)
http://ad.mail.ru/cm.gif?p=53&id=iqZhOZD2ShO2QhqIpF-_Og&rndx=1483908070486 (6 hours)
http://ad.mail.ru/cm.gif?p=53&id=iqZhOZD2ShO2QhqIpF-_Og&rndx=1483908070806 (6 hours)
http://ad.mail.ru/cm.gif?p=72&id=98faac782438b3e22c3cc358c83d27c44979d15b (6 hours)
http://kitbit.net/kb.js (6 hours)
Optimize images
Properly formatting and compressing images can save many bytes of data.
Optimize the following images to reduce their size by 20.1KiB (40% reduction).
Compressing http://share.pluso.ru/img/pluso-like/square/big/04.png could save 16.3KiB (36% reduction).
Compressing http://share.pluso.ru/img/plus.png could save 1.4KiB (56% reduction).
Compressing http://directanswer.ru/wp-content/themes/clean_blog/images/menu_link.png could save 868B (84% reduction).
Compressing http://directanswer.ru/wp-content/themes/clean_blog/images/line_post.png could save 858B (90% reduction).
Compressing http://directanswer.ru/wp-content/themes/clean_blog/images/line.png could save 852B (92% reduction).
Enable compression
Compressing resources with gzip or deflate can reduce the number of bytes sent over the network.
Enable compression for the following resources to reduce their transfer size by 856B (62% reduction).
Compressing http://profile-eu.exe.bid/sandbox/ could save 856B (62% reduction).
Prioritize visible content
You have the above-the-fold content properly prioritized. Learn more about prioritizing visible content.
Minify HTML
Your HTML is minified. Learn more about minifying HTML.
Avoid plugins
Your page does not appear to use plugins, which would prevent content from being usable on many platforms. Learn more about the importance of avoiding plugins.
Reduce server response time
Your server responded quickly. Learn more about server response time optimization.
Minify CSS
Your CSS is minified. Learn more about minifying CSS.
Avoid landing page redirects
Your page has no redirects. Learn more about avoiding landing page redirects.
Minify JavaScript
Your JavaScript content is minified. Learn more about minifying JavaScript.
Download optimized image, JavaScript, and CSS resources for this page.
+ Does directanswer.ru use compression?
directanswer.ru does not use compression.
Original size: n/a
Compressed size: n/a
File reduced by: n/a
+ Google Safe Browsing
This site is not currently listed as suspicious
MyWot.com Reputation Ratings
Trustworthiness:
50
Vendor reliability:
50
Privacy:
50
Child safety:
46
+ SSL Checker - SSL Certificate Verify
directanswer.ru does not support HTTPS
loader
Verifying SSL Support. Please wait...
+ Verify HTTP/2 Support
directanswer.ru does not support HTTP/2
loader
Verifying HTTP/2.0 Support. Please wait...
+ Site Categories (dmoz)
Currently Not Available
+ Http Header
HTTP/1.1 200 OK
Date: Sun, 08 Jan 2017 20:41:04 GMT
Content-Type: text/html; charset=UTF-8
Connection: close
Set-Cookie: __cfduid=d2ad34db735b107ce6a1a6c29267793981483908063; expires=Mon, 08-Jan-18 20:41:03 GMT; path=/; domain=.directanswer.ru; HttpOnly
Vary: Accept-Encoding
Last-Modified: Fri, 02 Sep 2016 15:49:50 GMT
Expires: Sun, 08 Jan 2017 17:41:20 GMT
Cache-Control: no-cache
X-Content-Type-Options: nosniff
Server: cloudflare-nginx
CF-RAY: 31e277d7b7aa09c4-ORD
+ DNS Lookup
Type Ip Target TTL
HINFO 3600
NS brenda.ns.cloudflare.com 3590
NS tim.ns.cloudflare.com 3590
+ Whois Lookup
Domain Created:
2014-01-28
Domain Age:
2 years 11 days
WhoIs:
whois lookup at whois.tcinet.ru...
% By submitting a query to RIPN's Whois Service
% you agree to abide by the following terms of use:
% http://www.ripn.net/about/servpol.html#3.2 (in Russian)
% http://www.ripn.net/about/en/servpol.html#3.2 (in English).
domain: DIRECTANSWER.RU
nserver: brenda.ns.cloudflare.com.
nserver: tim.ns.cloudflare.com.
state: REGISTERED, DELEGATED, VERIFIED
person: Private Person
registrar: R01-RU
admin-contact: https://partner.r01.ru/contact_admin.khtml
created: 2014.01.28
paid-till: 2018.01.28
free-date: 2018.02.28
source: TCI
Last updated on 2017.01.08 23:36:32 MSK
Last update was 1233 days ago
loader
This can take up to 60 seconds. Please wait...
*HypeStat.com is not linking to, promoting or affiliated with directanswer.ru in any way. Only publicly available statistics data are displayed.
WHAT WE RECOMMEND:
We are using the world's No. 1 Marketing Tool to grow our website. Activate your FREE trial today!
BrowserExtension
Install HypeStat extension in your browser to see statistics and technologies used with one click.
Hide/Remove your site data
• Use Show/Hide ESTIMATED data form to hide (Website worth, Daily ads revenue, Daily Visits, Daily Pageviews)
• Use Show/Hide WHOIS data form to hide whois data
• Use Remove form to remove all data
• If you have any problem with REMOVE/HIDE your data just drop an email at support (at) hypestat.com and we will remove/hide your site data manualy.
Make custom Widget for your website
Get the code now!
directanswer.ru widget
|
{
"url": "https://hypestat.com/info/directanswer.ru",
"source_domain": "hypestat.com",
"snapshot_id": "crawl=CC-MAIN-2020-24",
"warc_metadata": {
"Content-Length": "98305",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TKKCWZQZ7KVWHG4JG4N2KDVAHFGIJ3HI",
"WARC-Concurrent-To": "<urn:uuid:76b66275-952b-4eb6-aa38-60ba9d2cf305>",
"WARC-Date": "2020-05-26T10:10:01Z",
"WARC-IP-Address": "67.212.187.108",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:457CE7LUFHJ6FOGNZWY5O5J27TQYBADT",
"WARC-Record-ID": "<urn:uuid:4f6d5de0-c246-428e-8b7d-69dcb03aed3c>",
"WARC-Target-URI": "https://hypestat.com/info/directanswer.ru",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:14e692e3-e240-426f-a597-705aea5a93d1>"
},
"warc_info": "isPartOf: CC-MAIN-2020-24\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May/June 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-190.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,
39,
40,
533,
534,
558,
559,
560,
589,
590,
614,
615,
639,
640,
670,
677,
724,
725,
870,
871,
903,
904,
923,
942,
970,
993,
997,
1022,
1029,
1046,
1051,
1068,
1072,
1084,
1104,
1117,
1156,
1177,
1181,
1194,
1198,
1238,
1239,
1259,
1274,
1275,
1295,
1296,
1317,
1353,
1380,
1404,
1427,
1428,
1463,
1464,
1488,
1504,
1523,
1524,
1541,
1542,
1550,
1558,
1576,
1582,
1633,
1639,
1657,
1700,
1704,
1721,
1776,
1780,
1794,
1871,
1879,
1897,
1989,
1993,
2010,
2078,
2082,
2096,
2223,
2231,
2232,
2243,
2244,
2262,
2268,
2284,
2290,
2299,
2305,
2306,
2349,
2350,
2360,
2364,
2374,
2378,
2388,
2392,
2402,
2406,
2414,
2418,
2424,
2428,
2429,
2452,
2453,
2524,
2525,
2541,
2542,
2555,
2571,
2579,
2642,
2650,
2664,
2708,
2712,
2720,
2792,
2805,
2806,
2807,
2822,
2823,
2831,
2894,
2902,
2916,
2960,
2964,
2972,
3044,
3057,
3058,
3086,
3087,
3100,
3116,
3129,
3200,
3204,
3212,
3275,
3288,
3289,
3326,
3327,
3342,
3348,
3365,
3372,
3388,
3396,
3437,
3438,
3463,
3464,
3481,
3509,
3525,
3545,
3561,
3562,
3617,
3618,
3638,
3644,
3666,
3672,
3693,
3700,
3725,
3728,
3755,
3761,
3787,
3794,
3835,
3836,
3866,
3867,
3885,
3912,
3928,
3943,
3961,
3962,
3997,
3998,
4013,
4021,
4022,
4057,
4058,
4069,
4084,
4089,
4098,
4103,
4119,
4136,
4150,
4153,
4159,
4173,
4175,
4176,
4213,
4214,
4252,
4253,
4272,
4305,
4306,
4355,
4356,
4380,
4381,
4429,
4430,
4454,
4455,
4499,
4500,
4520,
4521,
4544,
4545,
4711,
4712,
4815,
4816,
4869,
4957,
5031,
5119,
5183,
5268,
5314,
5370,
5457,
5543,
5613,
5684,
5755,
5817,
5818,
5849,
5850,
6030,
6031,
6140,
6141,
6264,
6399,
6523,
6658,
6792,
6922,
7041,
7147,
7251,
7354,
7449,
7556,
7557,
7628,
7629,
7745,
7746,
8028,
8029,
8095,
8172,
8270,
8355,
8428,
8468,
8469,
8539,
8540,
8565,
8566,
8729,
8730,
8869,
8870,
8984,
9087,
9201,
9314,
9423,
9533,
9647,
9761,
9762,
9785,
9786,
10038,
10039,
10075,
10076,
10101,
10102,
10291,
10292,
10356,
10357,
10419,
10501,
10570,
10624,
10675,
10760,
10845,
10929,
10963,
10964,
10980,
10981,
11053,
11054,
11133,
11134,
11237,
11319,
11437,
11555,
11668,
11669,
11688,
11689,
11786,
11787,
11889,
11890,
11970,
11997,
12102,
12114,
12170,
12184,
12344,
12372,
12455,
12466,
12520,
12549,
12627,
12645,
12721,
12792,
12793,
12833,
12834,
12876,
12895,
12916,
12937,
12938,
12961,
12962,
13010,
13011,
13040,
13041,
13058,
13063,
13083,
13088,
13097,
13102,
13116,
13121,
13122,
13161,
13162,
13201,
13208,
13246,
13247,
13271,
13272,
13312,
13319,
13362,
13363,
13388,
13389,
13413,
13414,
13428,
13429,
13445,
13481,
13520,
13538,
13683,
13705,
13750,
13789,
13813,
13845,
13870,
13899,
13900,
13913,
13914,
13933,
13944,
13977,
14007,
14008,
14023,
14024,
14040,
14051,
14063,
14081,
14088,
14090,
14091,
14126,
14174,
14226,
14284,
14346,
14347,
14371,
14406,
14438,
14477,
14500,
14518,
14576,
14596,
14618,
14640,
14652,
14653,
14693,
14723,
14730,
14777,
14778,
14923,
14942,
15041,
15042,
15059,
15060,
15159,
15160,
15187,
15188,
15298,
15349,
15386,
15535,
15571,
15589
],
"line_end_idx": [
39,
40,
533,
534,
558,
559,
560,
589,
590,
614,
615,
639,
640,
670,
677,
724,
725,
870,
871,
903,
904,
923,
942,
970,
993,
997,
1022,
1029,
1046,
1051,
1068,
1072,
1084,
1104,
1117,
1156,
1177,
1181,
1194,
1198,
1238,
1239,
1259,
1274,
1275,
1295,
1296,
1317,
1353,
1380,
1404,
1427,
1428,
1463,
1464,
1488,
1504,
1523,
1524,
1541,
1542,
1550,
1558,
1576,
1582,
1633,
1639,
1657,
1700,
1704,
1721,
1776,
1780,
1794,
1871,
1879,
1897,
1989,
1993,
2010,
2078,
2082,
2096,
2223,
2231,
2232,
2243,
2244,
2262,
2268,
2284,
2290,
2299,
2305,
2306,
2349,
2350,
2360,
2364,
2374,
2378,
2388,
2392,
2402,
2406,
2414,
2418,
2424,
2428,
2429,
2452,
2453,
2524,
2525,
2541,
2542,
2555,
2571,
2579,
2642,
2650,
2664,
2708,
2712,
2720,
2792,
2805,
2806,
2807,
2822,
2823,
2831,
2894,
2902,
2916,
2960,
2964,
2972,
3044,
3057,
3058,
3086,
3087,
3100,
3116,
3129,
3200,
3204,
3212,
3275,
3288,
3289,
3326,
3327,
3342,
3348,
3365,
3372,
3388,
3396,
3437,
3438,
3463,
3464,
3481,
3509,
3525,
3545,
3561,
3562,
3617,
3618,
3638,
3644,
3666,
3672,
3693,
3700,
3725,
3728,
3755,
3761,
3787,
3794,
3835,
3836,
3866,
3867,
3885,
3912,
3928,
3943,
3961,
3962,
3997,
3998,
4013,
4021,
4022,
4057,
4058,
4069,
4084,
4089,
4098,
4103,
4119,
4136,
4150,
4153,
4159,
4173,
4175,
4176,
4213,
4214,
4252,
4253,
4272,
4305,
4306,
4355,
4356,
4380,
4381,
4429,
4430,
4454,
4455,
4499,
4500,
4520,
4521,
4544,
4545,
4711,
4712,
4815,
4816,
4869,
4957,
5031,
5119,
5183,
5268,
5314,
5370,
5457,
5543,
5613,
5684,
5755,
5817,
5818,
5849,
5850,
6030,
6031,
6140,
6141,
6264,
6399,
6523,
6658,
6792,
6922,
7041,
7147,
7251,
7354,
7449,
7556,
7557,
7628,
7629,
7745,
7746,
8028,
8029,
8095,
8172,
8270,
8355,
8428,
8468,
8469,
8539,
8540,
8565,
8566,
8729,
8730,
8869,
8870,
8984,
9087,
9201,
9314,
9423,
9533,
9647,
9761,
9762,
9785,
9786,
10038,
10039,
10075,
10076,
10101,
10102,
10291,
10292,
10356,
10357,
10419,
10501,
10570,
10624,
10675,
10760,
10845,
10929,
10963,
10964,
10980,
10981,
11053,
11054,
11133,
11134,
11237,
11319,
11437,
11555,
11668,
11669,
11688,
11689,
11786,
11787,
11889,
11890,
11970,
11997,
12102,
12114,
12170,
12184,
12344,
12372,
12455,
12466,
12520,
12549,
12627,
12645,
12721,
12792,
12793,
12833,
12834,
12876,
12895,
12916,
12937,
12938,
12961,
12962,
13010,
13011,
13040,
13041,
13058,
13063,
13083,
13088,
13097,
13102,
13116,
13121,
13122,
13161,
13162,
13201,
13208,
13246,
13247,
13271,
13272,
13312,
13319,
13362,
13363,
13388,
13389,
13413,
13414,
13428,
13429,
13445,
13481,
13520,
13538,
13683,
13705,
13750,
13789,
13813,
13845,
13870,
13899,
13900,
13913,
13914,
13933,
13944,
13977,
14007,
14008,
14023,
14024,
14040,
14051,
14063,
14081,
14088,
14090,
14091,
14126,
14174,
14226,
14284,
14346,
14347,
14371,
14406,
14438,
14477,
14500,
14518,
14576,
14596,
14618,
14640,
14652,
14653,
14693,
14723,
14730,
14777,
14778,
14923,
14942,
15041,
15042,
15059,
15060,
15159,
15160,
15187,
15188,
15298,
15349,
15386,
15535,
15571,
15589,
15611
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 15611,
"ccnet_original_nlines": 468,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.17695929110050201,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024646909907460213,
"rps_doc_frac_lines_end_with_ellipsis": 0.010660979896783829,
"rps_doc_frac_no_alph_words": 0.38604265451431274,
"rps_doc_frac_unique_words": 0.33545854687690735,
"rps_doc_mean_word_length": 5.977930545806885,
"rps_doc_num_sentences": 342,
"rps_doc_symbol_to_word_ratio": 0.009692610241472721,
"rps_doc_unigram_entropy": 5.868050575256348,
"rps_doc_word_count": 2039,
"rps_doc_frac_chars_dupe_10grams": 0.1074739471077919,
"rps_doc_frac_chars_dupe_5grams": 0.26482895016670227,
"rps_doc_frac_chars_dupe_6grams": 0.21379932761192322,
"rps_doc_frac_chars_dupe_7grams": 0.1940273940563202,
"rps_doc_frac_chars_dupe_8grams": 0.14586922526359558,
"rps_doc_frac_chars_dupe_9grams": 0.12617933750152588,
"rps_doc_frac_chars_top_2gram": 0.011813930235803127,
"rps_doc_frac_chars_top_3gram": 0.011813930235803127,
"rps_doc_frac_chars_top_4gram": 0.012798420153558254,
"rps_doc_books_importance": -1299.1082763671875,
"rps_doc_books_importance_length_correction": -1299.1082763671875,
"rps_doc_openwebtext_importance": -881.8964233398438,
"rps_doc_openwebtext_importance_length_correction": -881.8964233398438,
"rps_doc_wikipedia_importance": -447.7720642089844,
"rps_doc_wikipedia_importance_length_correction": -447.7720642089844
},
"fasttext": {
"dclm": 0.01922566071152687,
"english": 0.6578801274299622,
"fineweb_edu_approx": 1.5609174966812134,
"eai_general_math": 0.0005537900142371655,
"eai_open_web_math": 0.0448685884475708,
"eai_web_code": 0.001086589996702969
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.677",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "338.72",
"labels": {
"level_1": "Social sciences",
"level_2": "Economics",
"level_3": "Industries, Prices, and Microeconomics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "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
|
-3,334,500,757,278,360,000 |
Aptitude Question ID : 93926
Which of the following is greatest :
0.7 + \sqrt{0.16}, 1.02 - \frac{0.6}{24}, 1.2\times 0.83 and \sqrt{1.44}
[A]1.02 - \frac{0.6}{24}
[B]0.7 + \sqrt{0.16}
[C]\sqrt{1.44}
[D]1.2\times 0.83
\mathbf{\sqrt{1.44}}
\because 0.7 + \sqrt{0.16} = 0.7+0.4 = 1.1
and 1.02 - \frac{0.6}{24} = 1.02 - 0.025 = 0.995
and 1.2 \times 0.83 = 0.996
and \sqrt{1.44} = 1.2
Hence the greatest number =\sqrt{1.44}.
Advertisement
Comments
|
{
"url": "https://www.gktoday.in/aptitude/the-greatest-number-among-latex-0-7-sqrt0-16-latex-1-02-frac0-624s1-latex-1-2times-0-83s1-and-latex-sqrt1-44-is/",
"source_domain": "www.gktoday.in",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "40772",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HNSEGYHG6PEA237VDQGUBGOF6XTLHDBA",
"WARC-Concurrent-To": "<urn:uuid:67e6089e-80a6-4869-bdc9-3465925d843a>",
"WARC-Date": "2018-06-19T14:17:03Z",
"WARC-IP-Address": "104.25.43.30",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:ADJ4XYULEPGUP66QJE4G4UFF6BA5C3U6",
"WARC-Record-ID": "<urn:uuid:625d34de-3f82-4c91-858d-898ba981f397>",
"WARC-Target-URI": "https://www.gktoday.in/aptitude/the-greatest-number-among-latex-0-7-sqrt0-16-latex-1-02-frac0-624s1-latex-1-2times-0-83s1-and-latex-sqrt1-44-is/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ef403113-77d9-4d3a-8b00-bb27fe357bbc>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-154-11-100.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,
29,
30,
67,
140,
165,
186,
201,
219,
220,
241,
284,
333,
361,
383,
423,
424,
438,
439
],
"line_end_idx": [
29,
30,
67,
140,
165,
186,
201,
219,
220,
241,
284,
333,
361,
383,
423,
424,
438,
439,
447
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 447,
"ccnet_original_nlines": 18,
"rps_doc_curly_bracket": 0.06711409240961075,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.05000000074505806,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02500000037252903,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.8050000071525574,
"rps_doc_frac_unique_words": 0.6730769276618958,
"rps_doc_mean_word_length": 5.230769157409668,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.42106032371521,
"rps_doc_word_count": 52,
"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.06617646664381027,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -107.12303161621094,
"rps_doc_books_importance_length_correction": -107.44583129882812,
"rps_doc_openwebtext_importance": -66.55169677734375,
"rps_doc_openwebtext_importance_length_correction": -66.8744888305664,
"rps_doc_wikipedia_importance": -40.19293975830078,
"rps_doc_wikipedia_importance_length_correction": -40.5157356262207
},
"fasttext": {
"dclm": 0.9679818153381348,
"english": 0.6414942741394043,
"fineweb_edu_approx": 3.462790012359619,
"eai_general_math": 0.9037262797355652,
"eai_open_web_math": 0.8644534945487976,
"eai_web_code": 0.00117552001029253
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
},
"secondary": {
"code": "372.7",
"labels": {
"level_1": "Social sciences",
"level_2": "Education",
"level_3": "Education, Elementary and Kindergarten"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "-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": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,822,862,041,231,104,000 |
n1c9 n1c9 - 8 months ago 30
Javascript Question
How to target javascript element by it's onclick attribute via Selenium?
I'm working with a webpage that has a number of javascript buttons that are written like this:
<a href="javascript:;" onclick="addtocart('888%20B0007VBRUE%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20',$(this),0)" class="btn btn-lblue pull-right">
Selenium can execute javascript, but I'm not quite sure how to format the javascript query to trigger the individual buy buttons. I tried:
driver.execute_script("document.getElementById("test").onclick = "addtocart('888%20B0007VBRUE%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20',$(this),0)").click()
but this gives me the error
Message: document.getElementById(...) is null
. How can I change what I've tried to get it to work?
Answer
This is because you have not added an id of test to your <a> tag. Also it is generally not advisable to lookup an element based on the value of its onclick handler.
Fixed code:
<a href="javascript:;" id="test" onclick="addtocart('888%20B0007VBRUE%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20%20',$(this),0)" class="btn btn-lblue pull-right">
In addition, you need to switch one of your " for ' in driver.execute script, because each " terminates the preceding string.
Example:
driver.execute_script('document.getElementById("test"),$(this),0)').click()
|
{
"url": "https://codedump.io/share/OSfYeqKeqi92/1/how-to-target-javascript-element-by-it39s-onclick-attribute-via-selenium",
"source_domain": "codedump.io",
"snapshot_id": "crawl=CC-MAIN-2017-04",
"warc_metadata": {
"Content-Length": "26815",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FRHYBNQGUA634C7ESA256TF743GI67MW",
"WARC-Concurrent-To": "<urn:uuid:cfe0d2ba-578b-479f-b68c-c9bcd8db7567>",
"WARC-Date": "2017-01-20T11:00:15Z",
"WARC-IP-Address": "84.22.103.185",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:PPWVZF7EDMARSYRQYDHJBXBWH5RFHSVI",
"WARC-Record-ID": "<urn:uuid:993ec700-610e-4bcf-a153-eaa226cef08a>",
"WARC-Target-URI": "https://codedump.io/share/OSfYeqKeqi92/1/how-to-target-javascript-element-by-it39s-onclick-attribute-via-selenium",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:811a2fd0-c3f1-4d1c-9202-653ab42a43a5>"
},
"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,
28,
48,
49,
122,
123,
218,
219,
374,
375,
376,
515,
516,
680,
681,
682,
710,
756,
810,
811,
818,
819,
984,
985,
997,
998,
1163,
1164,
1290,
1291,
1300,
1301
],
"line_end_idx": [
28,
48,
49,
122,
123,
218,
219,
374,
375,
376,
515,
516,
680,
681,
682,
710,
756,
810,
811,
818,
819,
984,
985,
997,
998,
1163,
1164,
1290,
1291,
1300,
1301,
1376
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1376,
"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.21739129722118378,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021739130839705467,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4945652186870575,
"rps_doc_frac_unique_words": 0.6535947918891907,
"rps_doc_mean_word_length": 6.686274528503418,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0.0027173899579793215,
"rps_doc_unigram_entropy": 4.433115005493164,
"rps_doc_word_count": 153,
"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.009775170125067234,
"rps_doc_frac_chars_top_3gram": 0.1642228662967682,
"rps_doc_frac_chars_top_4gram": 0.1818181872367859,
"rps_doc_books_importance": -207.9285125732422,
"rps_doc_books_importance_length_correction": -207.92645263671875,
"rps_doc_openwebtext_importance": -116.67091369628906,
"rps_doc_openwebtext_importance_length_correction": -116.67091369628906,
"rps_doc_wikipedia_importance": -54.26393127441406,
"rps_doc_wikipedia_importance_length_correction": -53.40375900268555
},
"fasttext": {
"dclm": 0.6842253804206848,
"english": 0.15714393556118011,
"fineweb_edu_approx": 1.2636408805847168,
"eai_general_math": 0.4114263653755188,
"eai_open_web_math": 0.038783371448516846,
"eai_web_code": 0.2848881483078003
}
}
|
{
"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": "23",
"label": "Tutorial"
},
"secondary": {
"code": "18",
"label": "Q&A Forum"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,508,984,105,704,271,000 |
The Elegant release process is fully automated. To make this work, all commit message must adhere to a given set of rules.
Why Have Commit Message Rules?
From the semantic-release project:
semantic-release uses the commit messages to determine the type of changes in the codebase. Following formalized conventions for commit messages, semantic-release automatically determines the next semantic version number, generates a changelog and publishes the release.
What does that mean? It means that semantic-release parses the commit messages to arrive at a unbiased version number for a new release, and then creates that new release. This allows for a new release to be put together with little human involvement.
What are those rules?
The Elegant development team chose to use the Angular Commit Message Conventions as the baseline for the team’s commit message conventions.
Our conventions are largely derived from the Angular team’s guidelines as documented here.
Is There Something to Help Me With The Rules?
Reading, understanding, and then getting used to following guidelines may take time. Even then, if you are in a hurry, you can sometimes forget what the rules are. It’s only human.
Our team has found life easier since we started using Commitizen for Git commits. Our project includes configuration for Commitizen that automatically formats each commit message to conform to our guidelines by walking you through a series of prompts. When you finish those prompts, a new commit messages is authored for you with the information from those prompts, following all of the rules in the following sections on the Commit Message Format.
Tip
Use Commitizen for Git commits. It does make life easier. It automatically formats the commit message to conform to our guidelines.
Commit Message Format
Each line of the commit message must be shorter than 101 characters! This allows the message to be easier to read on GitHub as well as in various git tools.
Each commit message consists of a header, a body and a footer, as follows:
<header>
<BLANK LINE>
<body>
<BLANK LINE>
<footer>
The header is mandatory. It has a special format that includes a required type, an optional scope and a required subject:
<type>(<scope>): <subject>
Type
The type must be one of the following:
• feat: A new feature
• fix: A bug fix
• docs: Documentation only changes
• style: Changes that do not affect the meaning of the code (white-space, formatting, missing semi-colons, etc.)
• refactor: A code change that neither fixes a bug nor adds a feature
• perf: A code change that improves performance
• test: Adding missing or correcting existing tests
• chore: Changes to the build process or auxiliary tools and libraries such as documentation generation
• revert: A revert to a previous commit. See the section Revert Commits below.
Scope
The scope is intended to provide extra context on the changes included in the commit is for. This context should provide useful information to someone reading the commit log, including the reading of the commit log in the release notes.
For example, if you fix something in the authors blurb section, a scope of authors would be appropriate. If you are changing something with how the landing page works, a scope of landing page or home would be appropriate.
Subject
The subject part of the header must follow these rules:
1. always use the imperative, present tense: “change” not “changed”, “changes”, or “changing”
2. do not capitalize the first letter
3. no period (.) at the end of the line
What is Imperative mode?
Chris Beams, in his article on how to write a good commit message, gives a very good explanation of imperative mode.
Imperative mood just means “spoken or written as if giving a command or instruction”. A few examples:
1. Clean your room
2. Close the door
3. Take out the trash
The imperative can sound a little rude; that’s why we don’t often use it. But it’s perfect for Git commit subject lines.
Revert Commits
If the commit reverts a previous commit, it must be specified with the revert type, followed by the complete header of the reverted commit as the subject. The body of the commit must start with the text: This reverts commit <hash>., where the hash is the SHA of the commit being reverted.
Body
The body of the commit message must follow these rules:
1. always use the imperative, present tense: “change” not “changed”, “changes”, or “changing”
2. include your motivation for the change and how it contrasts with the previous behavior
Breaking changes
All breaking changes have to be mentioned in the body with the description of the change, justification and migration notes. The body must be prefixed with the text BREAKING CHANGE:.
The following example is from the Elegant project repository. After the required prefix, it describes the problem it is solving, and why it was needed. In retrospect, while it does mention that LANDING_PAGE_ABOUT is no longer used, it should have gone into more detail on where to look up information on what was replacing it.
feat(home): write about me in markdown, reST or asciidoc
BREAKING CHANGE: Previously LANDING_PAGE_ABOUT was a dictionary that contained html tags. We used it
to create landing page. But users have demanded from the very beginning to be able to write the
landing page in markdown. This patch adds this feature. But in order to use it, you have to update
your configuration.
Closes #85
Referencing issues
Closed bugs should be listed on a separate line in the footer prefixed with the Closes keyword.
Closes #234
If your commit closes multiple issues, list them on the same line separated by a comma.
Closes #123, #245, #992
If your commit affects an issue, but does not fix it completely, use the “Updates” keyword
Updates #234
Correct Message Format Examples
The following are commits from our own repository that shows how Elegant has used these guidelines.
New Features
feat(monetization): add BestAzon support
feat(Chinese): add better font support for Chinese language
feat(footer): make external links Nofollow
Fixes
fix(reST): indents in line blocks is not preserved
fix(gist): embedded Github gist are not laid out correctly
Documentation
docs(add): metadata variables
docs(add): release notes for 3.0.0
docs(update): change category of reading-time article
docs(update): set author information
Miscellaneous
chore(livereload): use es2015 syntax for gulp configuration
ci(docs): use sitemap plugin in production only
ci(docs): add default tasks.py file
refactor: move Google and Bing claims to their individual files
Incorrect Message Format Examples
This commit message starts with a capital letter and ends with a period
doc(changes): Rewrite of multi-part plugin per issue 308.
This commit message does not use imperative mode.
docs(change): updating status doc to reflect current state
Like this post? Share on: TwitterFacebookEmail
Talha Mansoor Avatar Talha Mansoor is the creator and lead developer of Elegant theme.
Jack De Winter ever evolving, ever learning
Published
Last Updated
Category
Contributing
Stay in Touch
Get New Release Alert
|
{
"url": "https://elegant.oncrashreboot.com/git-commit-guidelines",
"source_domain": "elegant.oncrashreboot.com",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "30924",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EXATRS4XUMSWRH4FLGDNCHF7UMEBQ7VQ",
"WARC-Concurrent-To": "<urn:uuid:9918161d-3328-48cd-b012-acbc1177783a>",
"WARC-Date": "2022-05-25T10:06:23Z",
"WARC-IP-Address": "52.203.36.44",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:QRYTI52QZJZP2IYEL2642B7VQH4DHM3G",
"WARC-Record-ID": "<urn:uuid:048fc7e5-8c35-4020-b8e2-50e99feda849>",
"WARC-Target-URI": "https://elegant.oncrashreboot.com/git-commit-guidelines",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ca95631b-50db-4a6b-8cd2-2c7dbbbb51f0>"
},
"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-61\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,
123,
124,
155,
156,
191,
192,
463,
464,
716,
717,
739,
740,
880,
881,
972,
973,
1019,
1020,
1201,
1202,
1651,
1652,
1656,
1657,
1789,
1790,
1812,
1813,
1970,
1971,
2046,
2047,
2056,
2069,
2076,
2089,
2098,
2099,
2221,
2222,
2249,
2250,
2255,
2256,
2295,
2296,
2320,
2339,
2376,
2491,
2563,
2613,
2667,
2773,
2854,
2855,
2861,
2862,
3099,
3100,
3322,
3323,
3331,
3332,
3388,
3389,
3485,
3525,
3567,
3592,
3593,
3710,
3711,
3813,
3814,
3835,
3855,
3879,
3880,
4001,
4002,
4017,
4018,
4307,
4308,
4313,
4314,
4370,
4371,
4467,
4559,
4560,
4577,
4578,
4761,
4762,
5089,
5090,
5147,
5148,
5249,
5345,
5444,
5464,
5465,
5476,
5477,
5496,
5497,
5593,
5594,
5606,
5607,
5695,
5696,
5720,
5721,
5812,
5813,
5826,
5827,
5859,
5860,
5960,
5961,
5974,
5975,
6016,
6076,
6119,
6120,
6126,
6127,
6178,
6237,
6238,
6252,
6253,
6283,
6318,
6372,
6409,
6410,
6424,
6425,
6485,
6533,
6569,
6633,
6634,
6668,
6669,
6741,
6742,
6800,
6801,
6851,
6852,
6911,
6912,
6959,
6960,
6961,
7048,
7092,
7093,
7103,
7104,
7117,
7118,
7127,
7128,
7141,
7142,
7156,
7157
],
"line_end_idx": [
123,
124,
155,
156,
191,
192,
463,
464,
716,
717,
739,
740,
880,
881,
972,
973,
1019,
1020,
1201,
1202,
1651,
1652,
1656,
1657,
1789,
1790,
1812,
1813,
1970,
1971,
2046,
2047,
2056,
2069,
2076,
2089,
2098,
2099,
2221,
2222,
2249,
2250,
2255,
2256,
2295,
2296,
2320,
2339,
2376,
2491,
2563,
2613,
2667,
2773,
2854,
2855,
2861,
2862,
3099,
3100,
3322,
3323,
3331,
3332,
3388,
3389,
3485,
3525,
3567,
3592,
3593,
3710,
3711,
3813,
3814,
3835,
3855,
3879,
3880,
4001,
4002,
4017,
4018,
4307,
4308,
4313,
4314,
4370,
4371,
4467,
4559,
4560,
4577,
4578,
4761,
4762,
5089,
5090,
5147,
5148,
5249,
5345,
5444,
5464,
5465,
5476,
5477,
5496,
5497,
5593,
5594,
5606,
5607,
5695,
5696,
5720,
5721,
5812,
5813,
5826,
5827,
5859,
5860,
5960,
5961,
5974,
5975,
6016,
6076,
6119,
6120,
6126,
6127,
6178,
6237,
6238,
6252,
6253,
6283,
6318,
6372,
6409,
6410,
6424,
6425,
6485,
6533,
6569,
6633,
6634,
6668,
6669,
6741,
6742,
6800,
6801,
6851,
6852,
6911,
6912,
6959,
6960,
6961,
7048,
7092,
7093,
7103,
7104,
7117,
7118,
7127,
7128,
7141,
7142,
7156,
7157,
7178
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7178,
"ccnet_original_nlines": 176,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3493543863296509,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012195119634270668,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17503586411476135,
"rps_doc_frac_unique_words": 0.39737990498542786,
"rps_doc_mean_word_length": 4.979912757873535,
"rps_doc_num_sentences": 69,
"rps_doc_symbol_to_word_ratio": 0.0043041598983109,
"rps_doc_unigram_entropy": 5.457769870758057,
"rps_doc_word_count": 1145,
"rps_doc_frac_chars_dupe_10grams": 0.03402315080165863,
"rps_doc_frac_chars_dupe_5grams": 0.058400560170412064,
"rps_doc_frac_chars_dupe_6grams": 0.04700104892253876,
"rps_doc_frac_chars_dupe_7grams": 0.04700104892253876,
"rps_doc_frac_chars_dupe_8grams": 0.03402315080165863,
"rps_doc_frac_chars_dupe_9grams": 0.03402315080165863,
"rps_doc_frac_chars_top_2gram": 0.03191863000392914,
"rps_doc_frac_chars_top_3gram": 0.009645739570260048,
"rps_doc_frac_chars_top_4gram": 0.006664330139756203,
"rps_doc_books_importance": -634.1473999023438,
"rps_doc_books_importance_length_correction": -634.1473999023438,
"rps_doc_openwebtext_importance": -361.32586669921875,
"rps_doc_openwebtext_importance_length_correction": -361.32586669921875,
"rps_doc_wikipedia_importance": -245.3865509033203,
"rps_doc_wikipedia_importance_length_correction": -245.3865509033203
},
"fasttext": {
"dclm": 0.06438732147216797,
"english": 0.8515095710754395,
"fineweb_edu_approx": 2.380481481552124,
"eai_general_math": 0.16021305322647095,
"eai_open_web_math": 0.25612926483154297,
"eai_web_code": 0.29875802993774414
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,100,054,044,407,650,000 |
Are 144hz Monitors Worth it?
Are 144hz Monitors Worth it, and Does Refresh Rate Matter?
If we look at the gaming monitor industry now 144hz monitor are gaining immense popularity due to the mainstream availability of these monitor at a relatively low price. The injection of a fast refresh rate like 144hz into panels that previously were only capable of 75hz like IPS panels has also contributed to the increase in demand for these 144hz gaming monitors.
With the counterless praises of the 144hz refresh rate by experienced members of the gaming community, confusion is also brewing in the minds of first-time buyers of 144hz monitors. The most common skeptic is around the worth of 144hz monitors and this has lead to many debates all branching from the same question of, “are 144hz monitors worth it?”
There are also countless misconceptions about the 144hz refresh rate many of them branching from the misinformation consumers are fed. Let us address them first so we can provide a better and concrete answer to our initial query.
Does Refresh Rate Matter?
The most frequently asked question among new buyers of 144hz monitors and rightfully so because these 144hz monitor demand a premium and they should know whether they are worth it or not. To simply put refresh rate is plays a key role in the smoothness of the monitor and high refresh rate monitors can deliver a more engaging and consistent experience regardless of the game you are playing.
With a high refresh rate, you also get a faster screen transition compared to 60hz which is highly beneficial in fast-paced FPS games such as CSGO, COD, Valorant, etc. Besides this higher refresh rate also helps in countering any screen tear and generally also provides better input lag performance.
This all is possible because screens with a higher refresh rate such as 144hz can refresh their pixels 144 times in a second while a 60hz screen can only perform the same action 60 times in a second. This shorter refresh interval provides more split-second information on the screen for the user to comprehend.
Do You Need 144fps for 144hz?
Another common question with countless answers. Our take on this is while it is necessary to have sound system specification for you to fully enjoy 144hz gaming but still constant 144fps is not a requirement and you would be fine with some drops in frames or even slightly lower frames, to begin with.
Granted this was true a while back that for 144hz gaming 144fps are needed but now with the inclusion of G-Sync and FreeSync in most newer monitors it is not a necessity anymore. People recommended 144fps because after all low fps on 144hz would cause considerable screen tearing but the aforementioned technologies have solved this issue by syncing the frames with the refresh rate of the monitor, therefore, eliminating any form of screen tearing. With that all said and the misconceptions cleared let us move to the main topic of this article.
Are 144hz Monitors Worth it?
Well if you look from a factual point of view then 144hz monitors are 100% worth it because they are superior to lower refresh rate monitors in all regards. The technology has also advanced to the point where you can get high resolution IPS monitors with 144hz refresh rate which was unheard of when the technology first came into the market and now even tier 1 brand like Asus and BenQ are hopping on the high resolution, high refresh rate train.
Facts aside when we look from a personal level it is understandable why some people do not find use in high refresh rate especially the gamers that predominantly play story games that are graphic and level oriented rather than being motion and aim-oriented. In stark contrast gamers who play fast-paced games rave about the benefit of 144hz.
Which is better of the both for you is the question you should be asking yourself rather than pondering on the question of are 144hz gaming monitors worth it. On a factual level, 144hz gaming monitors are definitely worth it but that is only if you can get use out of it. Nothing is more disappointing than getting a new product and not using its benefits.
Conclusion
In the end, we would just like to say that regardless of the technology you should base the purchase decision on your need and use case. Choose a product that provides more value to your gaming setup and 144hz gaming monitors are no exception. Hope this article provided you with a clearer answer to are gaming monitors worth it question.
Share this post:
Similar Posts
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.how2pc.com/are-144hz-monitors-worth-it/",
"source_domain": "www.how2pc.com",
"snapshot_id": "crawl=CC-MAIN-2021-43",
"warc_metadata": {
"Content-Length": "191064",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZBPREVG4VNQ4EF7BO4BXTXUZTWY3JQFO",
"WARC-Concurrent-To": "<urn:uuid:7fd36f32-3c59-4ebe-993a-636e2c4f29d5>",
"WARC-Date": "2021-10-24T19:30:35Z",
"WARC-IP-Address": "104.21.51.47",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MXXHEZORYHKRVOCF3OI2DW6G3WP6XZAQ",
"WARC-Record-ID": "<urn:uuid:7ba83d61-2b73-4e0b-a584-d8962f93b1d5>",
"WARC-Target-URI": "https://www.how2pc.com/are-144hz-monitors-worth-it/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:db4478cd-bdd9-4f4b-8fe0-a994fe4996d3>"
},
"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-74\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,
29,
30,
89,
90,
458,
459,
809,
810,
1040,
1041,
1067,
1068,
1461,
1462,
1762,
1763,
2074,
2075,
2105,
2106,
2408,
2409,
2956,
2957,
2986,
2987,
3435,
3436,
3778,
3779,
4136,
4137,
4148,
4149,
4488,
4489,
4506,
4507,
4521,
4522,
4536,
4537,
4608,
4609
],
"line_end_idx": [
29,
30,
89,
90,
458,
459,
809,
810,
1040,
1041,
1067,
1068,
1461,
1462,
1762,
1763,
2074,
2075,
2105,
2106,
2408,
2409,
2956,
2957,
2986,
2987,
3435,
3436,
3778,
3779,
4136,
4137,
4148,
4149,
4488,
4489,
4506,
4507,
4521,
4522,
4536,
4537,
4608,
4609,
4689
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4689,
"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.47635525465011597,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006920420099049807,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.07151096314191818,
"rps_doc_frac_unique_words": 0.41594022512435913,
"rps_doc_mean_word_length": 4.740971565246582,
"rps_doc_num_sentences": 35,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.181534767150879,
"rps_doc_word_count": 803,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.01812450960278511,
"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.04334120824933052,
"rps_doc_frac_chars_top_3gram": 0.0197005495429039,
"rps_doc_frac_chars_top_4gram": 0.016548460349440575,
"rps_doc_books_importance": -426.7494201660156,
"rps_doc_books_importance_length_correction": -426.7494201660156,
"rps_doc_openwebtext_importance": -234.24044799804688,
"rps_doc_openwebtext_importance_length_correction": -234.24044799804688,
"rps_doc_wikipedia_importance": -218.89321899414062,
"rps_doc_wikipedia_importance_length_correction": -218.89321899414062
},
"fasttext": {
"dclm": 0.3716903328895569,
"english": 0.9530156850814819,
"fineweb_edu_approx": 1.9748109579086304,
"eai_general_math": 0.049591898918151855,
"eai_open_web_math": 0.1358993649482727,
"eai_web_code": 0.0025407699868083
}
}
|
{
"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": "794.816",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"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": "14",
"label": "Reviews/Critiques"
}
},
"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": "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": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-9,198,304,788,644,308,000 |
ProgressBarComponent
Represents the Kendo UI ProgressBar component for Angular.
@Component({
selector: 'my-app',
template: `
<kendo-progressbar [value]="value">
</kendo-progressbar>
`
})
class AppComponent {
public value = 50;
}
Selector
kendo-progressbar
Export Name
Accessible in templates as #kendoProgressBarInstance="kendoProgressBar"
Inputs
animation boolean | ProgressBarAnimation
The animation configuration of the ProgressBar.
Defaults to false.
disabled boolean
If set to true, the ProgressBar will be disabled
(see example).
It will still allow you to change its value.
Defaults to false.
emptyCssClass string | string[] | Set<string> | {[key: string]: any}
The CSS classes that will be rendered on the inner element which represents the empty portion of the progress bar
(see example).
Supports the type of values that are supported by ngClass.
emptyCssStyle {[key: string]: string}
The CSS styles that will be rendered on the inner element which represents the empty portion of the progress bar
(see example).
Supports the type of values that are supported by ngStyle.
indeterminate boolean
Sets the indeterminate state of the ProgressBar.
Defaults to false.
label boolean | LabelSettings
Determines whether the status label will be visible.
Defaults to true—the label will be visible and displayed with the default
LabelSettings having its position set to end and its format set to value.
max number
The maximum value of the ProgressBar.
Defaults to 100.
min number
The minimum value of the ProgressBar.
Defaults to 0.
orientation ProgressBarOrientation
Defines the orientation of the ProgressBar
(see example).
Defaults to horizontal.
progressCssClass string | string[] | Set<string> | {[key: string]: any}
The CSS classes that will be rendered on the inner element which represents the full portion of the progress bar
(see example).
Supports the type of values that are supported by ngClass.
progressCssStyle {[key: string]: string}
The CSS styles that will be rendered on the inner element which represents the full portion of the progress bar
(see example).
Supports the type of values that are supported by ngStyle.
reverse boolean
If set to true, the ProgressBar will be reversed
(see example).
Defaults to false.
value number
The value of the ProgressBar.
Has to be between min and max.
Defaults to 0.
Events
animationEnd EventEmitter<AnimationEndEvent>
Fires when the animation which indicates the latest value change is completed.
|
{
"url": "https://www.telerik.com/kendo-angular-ui/components/progressbars/api/ProgressBarComponent/",
"source_domain": "www.telerik.com",
"snapshot_id": "crawl=CC-MAIN-2020-40",
"warc_metadata": {
"Content-Length": "98449",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TXESETME4WAXKC2WXWHNQ5DPOOXIL34I",
"WARC-Concurrent-To": "<urn:uuid:bafa444b-dd01-4210-a9ee-336df8cea557>",
"WARC-Date": "2020-09-26T14:31:52Z",
"WARC-IP-Address": "50.56.19.112",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:TQ3FZU2VU7R5UBQLEC4AD2HEFZCUFYDT",
"WARC-Record-ID": "<urn:uuid:dfb9721d-760c-48ab-acc7-355e89440d30>",
"WARC-Target-URI": "https://www.telerik.com/kendo-angular-ui/components/progressbars/api/ProgressBarComponent/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:03330fc8-47e9-47ed-b7c1-f4aa1114bbb9>"
},
"warc_info": "isPartOf: CC-MAIN-2020-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-137.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
21,
22,
81,
82,
95,
118,
133,
176,
204,
209,
212,
233,
256,
258,
259,
268,
269,
287,
288,
300,
301,
373,
374,
381,
382,
423,
424,
472,
491,
492,
509,
510,
559,
574,
619,
638,
639,
708,
709,
823,
838,
897,
898,
936,
937,
1050,
1065,
1124,
1125,
1147,
1148,
1197,
1216,
1217,
1247,
1248,
1301,
1375,
1449,
1450,
1461,
1462,
1500,
1517,
1518,
1529,
1530,
1568,
1583,
1584,
1619,
1620,
1663,
1678,
1702,
1703,
1775,
1776,
1889,
1904,
1963,
1964,
2005,
2006,
2118,
2133,
2192,
2193,
2209,
2210,
2259,
2274,
2293,
2294,
2307,
2308,
2338,
2369,
2384,
2385,
2392,
2393,
2438,
2439
],
"line_end_idx": [
21,
22,
81,
82,
95,
118,
133,
176,
204,
209,
212,
233,
256,
258,
259,
268,
269,
287,
288,
300,
301,
373,
374,
381,
382,
423,
424,
472,
491,
492,
509,
510,
559,
574,
619,
638,
639,
708,
709,
823,
838,
897,
898,
936,
937,
1050,
1065,
1124,
1125,
1147,
1148,
1197,
1216,
1217,
1247,
1248,
1301,
1375,
1449,
1450,
1461,
1462,
1500,
1517,
1518,
1529,
1530,
1568,
1583,
1584,
1619,
1620,
1663,
1678,
1702,
1703,
1775,
1776,
1889,
1904,
1963,
1964,
2005,
2006,
2118,
2133,
2192,
2193,
2209,
2210,
2259,
2274,
2293,
2294,
2307,
2308,
2338,
2369,
2384,
2385,
2392,
2393,
2438,
2439,
2517
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2517,
"ccnet_original_nlines": 104,
"rps_doc_curly_bracket": 0.004767579957842827,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.33698031306266785,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.010940919630229473,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22319474816322327,
"rps_doc_frac_unique_words": 0.3467048704624176,
"rps_doc_mean_word_length": 5.6446990966796875,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0.0021881801076233387,
"rps_doc_unigram_entropy": 4.278043270111084,
"rps_doc_word_count": 349,
"rps_doc_frac_chars_dupe_10grams": 0.3553299605846405,
"rps_doc_frac_chars_dupe_5grams": 0.4568527936935425,
"rps_doc_frac_chars_dupe_6grams": 0.4568527936935425,
"rps_doc_frac_chars_dupe_7grams": 0.39390861988067627,
"rps_doc_frac_chars_dupe_8grams": 0.39390861988067627,
"rps_doc_frac_chars_dupe_9grams": 0.39390861988067627,
"rps_doc_frac_chars_top_2gram": 0.025380710139870644,
"rps_doc_frac_chars_top_3gram": 0.04873095825314522,
"rps_doc_frac_chars_top_4gram": 0.04873095825314522,
"rps_doc_books_importance": -211.4449462890625,
"rps_doc_books_importance_length_correction": -211.4449462890625,
"rps_doc_openwebtext_importance": -111.11815643310547,
"rps_doc_openwebtext_importance_length_correction": -111.11815643310547,
"rps_doc_wikipedia_importance": -91.40757751464844,
"rps_doc_wikipedia_importance_length_correction": -91.40757751464844
},
"fasttext": {
"dclm": 0.08380811661481857,
"english": 0.6780455708503723,
"fineweb_edu_approx": 2.108837842941284,
"eai_general_math": 0.545524537563324,
"eai_open_web_math": 0.3642590641975403,
"eai_web_code": 0.9949935674667358
}
}
|
{
"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": "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": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,715,005,789,378,669,300 |
Sehion Retreat Centre
Whether or not you are on the lookout for an enormous flat-display screen TELEVISION for the living room or a smaller one for the bedroom, Finest Purchase has a television for you. This might prove to be a essential breakthrough in Philo Farnsworth’s invention of the television in 1927. Certainly, in keeping with one survey, it was solely within the 1990s that the spread of television transmitters, television sets, and electrical energy made it attainable for half of the individuals on the planet to watch television.
The Humber College of Media Studies HD TV Mobile is a multi-digital camera television facility used for distant broadcast television production. US Patent: 1,773,980 A: Television System by Philo T. Farnsworth, August 26, 1930. The introduction of GE ‘s comparatively compact and light-weight Porta-Colour set within the spring of 1966 made watching coloration television a extra versatile and handy proposition.
On the other hand, there are additionally studies by Andre Gosselin, Jacques de Guise and Man Paquette in 1997 that show that watching television doesn’t cause viewers to be fearful, however even cause them to be happier and more optimistic about life.
In the end, the restore man additionally gave me his direct number so I may simply name him if one thing goes improper they usually said they would electronic mail me some form of ticket for the work accomplished. They are fascinated and intoxicated by the meaningless entertainment that’s churned out on TELEVISION. They laze around in entrance of the television and gape at the display.
Usually all the extensively day-to-day used websites have joined with the properly recognized television manufacturing manufacturers. Though this isn’t all the time the case, the television director will be considered more as someone who molds the present into the package requested by the producer, versus someone who stamps their very own really feel on the production.
• Partner links
|
{
"url": "http://www.unblockedgamespage.com/sehion-retreat-centre.html",
"source_domain": "www.unblockedgamespage.com",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "37315",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WXXIIV6IZRQLE5LPPAHYT4EP622VCN7E",
"WARC-Concurrent-To": "<urn:uuid:32b9a946-b24c-4ed7-8d4c-697ef128f554>",
"WARC-Date": "2021-01-26T22:16:08Z",
"WARC-IP-Address": "162.213.253.67",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HFOKO3V3LZA6KL5I5GLNAGWQD4RIHL5G",
"WARC-Record-ID": "<urn:uuid:d3d56c3d-f77f-496c-88c7-995407514605>",
"WARC-Target-URI": "http://www.unblockedgamespage.com/sehion-retreat-centre.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2ef90037-a65d-4ef0-b977-8319dea9d4c5>"
},
"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-233.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,
22,
23,
546,
547,
960,
961,
1214,
1215,
1604,
1605,
1977,
1978
],
"line_end_idx": [
22,
23,
546,
547,
960,
961,
1214,
1215,
1604,
1605,
1977,
1978,
1995
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1995,
"ccnet_original_nlines": 12,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4065040647983551,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024390239268541336,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13550135493278503,
"rps_doc_frac_unique_words": 0.6455696225166321,
"rps_doc_mean_word_length": 5.177215099334717,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.919617652893066,
"rps_doc_word_count": 316,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.012224939651787281,
"rps_doc_frac_chars_top_3gram": 0.01833740994334221,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -128.28086853027344,
"rps_doc_books_importance_length_correction": -128.28086853027344,
"rps_doc_openwebtext_importance": -78.79280853271484,
"rps_doc_openwebtext_importance_length_correction": -78.79280853271484,
"rps_doc_wikipedia_importance": -48.395076751708984,
"rps_doc_wikipedia_importance_length_correction": -48.395076751708984
},
"fasttext": {
"dclm": 0.02980596013367176,
"english": 0.9619548320770264,
"fineweb_edu_approx": 1.5831573009490967,
"eai_general_math": 0.03040534071624279,
"eai_open_web_math": 0.21079540252685547,
"eai_web_code": 0.0012542599579319358
}
}
|
{
"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": "791.83",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"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": "6",
"label": "Promotional/Advertisement"
}
},
"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": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,029,456,052,703,675,000 |
This documentation is about a version that is out of support, here is the latest documentation version.
How about downloading a newer, supported version?
Transitions
Transitions connect all objects permitting the sequence flow to execute from start to end.
Overview
In Bonita Studio, transitions represent sequence flow. Transition arrows are used to connect all objects, allowing the sequence flow to move from the start to the end of a process.
In addition to connecting elements in a process, transitions are used to define the direction of flow between these elements.
If a transition is not present between process elements, the sequence flow will stop. The flow is broken and the process will not reach its termination.
Sequence flow must start and end within a single process. Transitions cannot cross from one pool to another. It is best practice to label the conditions on transitions so they are easily understood in the process diagram.
Some elements, such as tasks and gateways, can have multiple outputs connecting to other elements. These multiple outputs need to be managed to create an order of flow. They can be configured using conditions to determine which path the flow should take, given the state of the process case (e.g. data variables).
To configure a transition, select it in the process diagram and go to the Details panel, General tab. You can configure the following:
• The name and a description of the transition. The name is used to label the transition in the diagram.
• The condition under which this transition is taken. There are three ways to specify this:
Condition expression
Click the crayon icon to open the Expression editor. Select the expression type and enter the expression. The most useful type of expression for a transition is a comparison. A comparison expression uses logical operators on variables, parameters, or constants to determine whether the transition is taken.
Condition decision table
For complex or multi-stage conditions, use a decision table. A decision table is a sequence of conditions, one condition in each row of the table. The rows are evaluated in order. Each condition is a comparison expression.
Comparison expressions in a decision table
Default transition
If you make a transition the default, this flow is taken if no other outgoing transition from the element meets the conditions defined in an expression or decision table defined for that transition. We recommend that you always specify a default transition.
|
{
"url": "https://documentation.bonitasoft.com/bonita/7.7/transitions",
"source_domain": "documentation.bonitasoft.com",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "56370",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:D6MOEEUXWOHONANNX7NCM7G2ID4WZP4W",
"WARC-Concurrent-To": "<urn:uuid:801cd9c9-c2a1-45c1-a459-b2eaa4487126>",
"WARC-Date": "2022-06-28T09:50:29Z",
"WARC-IP-Address": "34.196.254.27",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YURKPERL5XM2T23F3HGHXBS5FSRZMN67",
"WARC-Record-ID": "<urn:uuid:61def7f2-1d1b-488e-a0c3-ae2b5af634ac>",
"WARC-Target-URI": "https://documentation.bonitasoft.com/bonita/7.7/transitions",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fb73f06c-9e7f-4188-a6fc-be868278fa02>"
},
"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-180\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,
104,
105,
155,
156,
168,
169,
260,
261,
270,
271,
452,
578,
731,
732,
954,
955,
1269,
1270,
1405,
1406,
1513,
1514,
1608,
1609,
1630,
1631,
1938,
1939,
1964,
1965,
2188,
2189,
2232,
2233,
2252,
2253
],
"line_end_idx": [
104,
105,
155,
156,
168,
169,
260,
261,
270,
271,
452,
578,
731,
732,
954,
955,
1269,
1270,
1405,
1406,
1513,
1514,
1608,
1609,
1630,
1631,
1938,
1939,
1964,
1965,
2188,
2189,
2232,
2233,
2252,
2253,
2510
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2510,
"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.4175824224948883,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004395599942654371,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11428570747375488,
"rps_doc_frac_unique_words": 0.40694788098335266,
"rps_doc_mean_word_length": 5.052109241485596,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.557907581329346,
"rps_doc_word_count": 403,
"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.029469549655914307,
"rps_doc_frac_chars_top_3gram": 0.02210216037929058,
"rps_doc_frac_chars_top_4gram": 0.01669940911233425,
"rps_doc_books_importance": -237.28094482421875,
"rps_doc_books_importance_length_correction": -237.28094482421875,
"rps_doc_openwebtext_importance": -113.88477325439453,
"rps_doc_openwebtext_importance_length_correction": -113.88477325439453,
"rps_doc_wikipedia_importance": -73.95869445800781,
"rps_doc_wikipedia_importance_length_correction": -73.95869445800781
},
"fasttext": {
"dclm": 0.22890138626098633,
"english": 0.8804962635040283,
"fineweb_edu_approx": 2.9523277282714844,
"eai_general_math": 0.9891616106033325,
"eai_open_web_math": 0.3799954652786255,
"eai_web_code": 0.8335543274879456
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "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
|
-6,471,679,496,376,598,000 |
How to change "Appointments" to "Lessons" in Buddypress?
Hello! I need to change just one word. I tried using the Ultimate Branding plugin to effect a text change, but it just created a recurring redirect. In the Buddypress profile menu, "Appointments" will appear so a user can change/edit their own appointments. I want to change this to "Lessons". This is the only place that needs to be changed, since I've customized all emails and such. Is there a safe way to do this that won't cause conflicts? I have a lot of plugins. Thanks!
• Michael Bissett
Hey @Emerald, hope you're doing well today! :slight_smile:
Once thing you can do here, is take the language file that's located in appointments/languages (it'll be called appointments.pot), download that, and open it in a program like this:
http://poedit.net/
Once you download that, you'll be wanting to open the .pot file you downloaded earlier, and note the entries that you're wanting to change. Do not add the wording changes to the "Source Text" section, add them as translations.
After going to Catalog -> Properties & making sure that the language is set to English (United States) there, you'll want to go File -> Save As..., and save the file as appointments-en_US.po. Please note, a file with a .mo extension will be saved as well.
Once you've done this, upload both appointments-en_US.po & appointments-en_US.mo to wp-content/languages/plugins.
And now you should be good to go! Hope this helps! :slight_smile:
Regards,
Michael
Thank NAME, for their help.
Let NAME know exactly why they deserved these points.
Gift a custom amount of points.
|
{
"url": "https://premium.wpmudev.org/forums/topic/how-to-change-appointments-to-lessons-in-buddypress",
"source_domain": "premium.wpmudev.org",
"snapshot_id": "crawl=CC-MAIN-2018-47",
"warc_metadata": {
"Content-Length": "88860",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NWC4J3ZYXRUMV5OZ476RNCULFHERGCYA",
"WARC-Concurrent-To": "<urn:uuid:e73241f1-0811-40d5-884e-0fb69e61fa8b>",
"WARC-Date": "2018-11-14T13:08:35Z",
"WARC-IP-Address": "104.16.24.10",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:H3MRV2ZZG7QNEJGKWZWP7CO6HFNV2ZVF",
"WARC-Record-ID": "<urn:uuid:d3e7ee39-f785-42d2-beef-d52d6558bff9>",
"WARC-Target-URI": "https://premium.wpmudev.org/forums/topic/how-to-change-appointments-to-lessons-in-buddypress",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:eefff4d0-fd57-4e62-8f9b-13462522b24a>"
},
"warc_info": "isPartOf: CC-MAIN-2018-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-141-253-120.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
57,
58,
536,
537,
557,
558,
621,
622,
808,
809,
832,
833,
1064,
1065,
1325,
1326,
1444,
1445,
1515,
1516,
1529,
1541,
1542,
1570,
1571,
1625,
1626
],
"line_end_idx": [
57,
58,
536,
537,
557,
558,
621,
622,
808,
809,
832,
833,
1064,
1065,
1325,
1326,
1444,
1445,
1515,
1516,
1529,
1541,
1542,
1570,
1571,
1625,
1626,
1657
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1657,
"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.3739837408065796,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0189701896160841,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23306232690811157,
"rps_doc_frac_unique_words": 0.5900382995605469,
"rps_doc_mean_word_length": 4.762452125549316,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0.002710029948502779,
"rps_doc_unigram_entropy": 4.732023239135742,
"rps_doc_word_count": 261,
"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.02574416995048523,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -141.50018310546875,
"rps_doc_books_importance_length_correction": -128.0258026123047,
"rps_doc_openwebtext_importance": -79.44752502441406,
"rps_doc_openwebtext_importance_length_correction": -79.44752502441406,
"rps_doc_wikipedia_importance": -52.94409942626953,
"rps_doc_wikipedia_importance_length_correction": -41.0710563659668
},
"fasttext": {
"dclm": 0.07947105169296265,
"english": 0.9551075100898743,
"fineweb_edu_approx": 1.0408824682235718,
"eai_general_math": 0.48250120878219604,
"eai_open_web_math": 0.30438560247421265,
"eai_web_code": 0.37064313888549805
}
}
|
{
"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": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,123,210,255,279,086,000 |
We use cookies to give you the best experience on our website. If you continue to browse, then you agree to our privacy policy and cookie policy. (Last updated on: November 16, 2018).
Unfortunately, activation email could not send to your email. Please try again.
Syncfusion Feedback
Overview
The Xamarin.Forms area chart is like a line chart that represents time-dependent data and shows the trends at equal intervals, but it fills the area. It can be configured with numerical, category, date time, or logarithmic axis for the graph.
Beautiful Xamarin.Forms Area Charts
Key features
Shows the Xamarin.Forms vertical area chart
Vertical chart
Rotate the area chart to plot data in the vertical direction and view data from a different perspective.
The Xamarin.Forms area chart shows the empty or null point support
Empty or null data point
The Xamarin.Forms area chart handles empty or null data points elegantly.
Shows the customizable area chart in Xamarin.Forms
Customization
Customize the color and border of the area chart using built-in APIs to make it visually unique.
Xamarin.Forms chart shows the marker support in area chart
Marker
Marks data points with built-in shapes such as circles, rectangles, ellipses, vertical lines, horizontal lines, diamonds, triangles, and pentagons. In addition to these shapes, use images to make the point more attractive.
Xamarin.Forms chart shows the multiple axis support
Multiple axes
Use multiple axes to plot different data sets that widely vary from one other.
Code example
<?xml version="1.0" encoding="utf-8" ?>
<ContentPage xmlns="http://xamarin.com/schemas/2014/forms"
xmlns:x="http://schemas.microsoft.com/winfx/2009/xaml"
xmlns:local="clr-namespace:ChartExample"
xmlns:chart="clr-namespace:Syncfusion.SfChart.XForms;assembly=Syncfusion.SfChart.XForms"
x:Class="ChartExample.MainPage">
<ContentPage.BindingContext>
<local:ViewModel/>
</ContentPage.BindingContext>
<chart:SfChart>
<chart:SfChart.PrimaryAxis>
<chart:CategoryAxis/>
</chart:SfChart.PrimaryAxis>
<chart:SfChart.SecondaryAxis>
<chart:NumericalAxis/>
</chart:SfChart.SecondaryAxis>
<chart:AreaSeries ItemsSource="{Binding Data}" XBindingPath="Month" YBindingPath="Target"/>
</chart:SfChart>
</ContentPage>
public class Model
{
public string Month { get; set; }
public double Target { get; set; }
public Model(string xValue, double yValue)
{
Month = xValue;
Target = yValue;
}
}
public class ViewModel
{
public ObservableCollection<Model> Data { get; set; }
public ViewModel()
{
Data = new ObservableCollection<Model>()
{
new Model("Jan", 50),
new Model("Feb", 70),
new Model("Mar", 65),
new Model("Apr", 57),
new Model("May", 48),
};
}
}
Learning resources
Navigate to GitHub code used to configure the Xamarin.Forms area chart
GitHub Code
The Xamarin.Forms area chart configuration code is available in GitHub.
Navigate to the options available in User Guide to customize the Xamarin.Forms area chart
Area Chart User Guide
Learn available options to customize the Xamarin.Forms area chart.
Navigate to the API references documentation of Xamarin.Forms area chart
Area Chart API Reference
Explore the Xamarin.Forms area chart APIs.
145+ XAMARIN UI CONTROLS
ALL CONTROLS
• Xamarin.Forms
• Xamarin.Android
• Xamarin.iOS
Scroll up icon
Warning Icon You are using an outdated version of Internet Explorer that may not display all features of this and other websites. Upgrade to Internet Explorer 8 or newer for a better experience.Close Icon
|
{
"url": "https://www.syncfusion.com/xamarin-ui-controls/xamarin-charts/chart-types/area-chart",
"source_domain": "www.syncfusion.com",
"snapshot_id": "crawl=CC-MAIN-2019-35",
"warc_metadata": {
"Content-Length": "169446",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EDVNPQMA4FHCL5ORNUW4YUFV67XSUL3K",
"WARC-Concurrent-To": "<urn:uuid:89fef38d-6e55-4736-a9b2-c5e2d6386e4d>",
"WARC-Date": "2019-08-19T21:48:17Z",
"WARC-IP-Address": "52.226.172.80",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NSUGI6QWCH5YE2VIKQQCSFURR3EFSA5Y",
"WARC-Record-ID": "<urn:uuid:cbabe2b5-0484-4dc1-8098-afe9eec99434>",
"WARC-Target-URI": "https://www.syncfusion.com/xamarin-ui-controls/xamarin-charts/chart-types/area-chart",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:01aa8ed0-f298-4654-8581-5692809ad4ae>"
},
"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-10.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,
184,
264,
284,
285,
286,
295,
296,
539,
540,
576,
577,
578,
591,
592,
636,
637,
652,
653,
758,
759,
826,
827,
852,
853,
927,
928,
979,
980,
994,
995,
1092,
1093,
1152,
1153,
1160,
1161,
1384,
1385,
1437,
1438,
1452,
1453,
1532,
1533,
1534,
1547,
1548,
1588,
1647,
1715,
1769,
1871,
1917,
1918,
1951,
1978,
2012,
2013,
2033,
2034,
2070,
2104,
2141,
2142,
2180,
2215,
2254,
2255,
2355,
2356,
2377,
2378,
2393,
2412,
2414,
2452,
2453,
2492,
2493,
2540,
2546,
2570,
2595,
2601,
2603,
2604,
2627,
2629,
2687,
2688,
2711,
2717,
2766,
2776,
2810,
2844,
2878,
2912,
2947,
2958,
2964,
2966,
2967,
2986,
2987,
3058,
3059,
3071,
3072,
3144,
3145,
3235,
3236,
3258,
3259,
3326,
3327,
3400,
3401,
3426,
3427,
3470,
3471,
3472,
3497,
3498,
3511,
3529,
3549,
3565,
3580,
3581
],
"line_end_idx": [
184,
264,
284,
285,
286,
295,
296,
539,
540,
576,
577,
578,
591,
592,
636,
637,
652,
653,
758,
759,
826,
827,
852,
853,
927,
928,
979,
980,
994,
995,
1092,
1093,
1152,
1153,
1160,
1161,
1384,
1385,
1437,
1438,
1452,
1453,
1532,
1533,
1534,
1547,
1548,
1588,
1647,
1715,
1769,
1871,
1917,
1918,
1951,
1978,
2012,
2013,
2033,
2034,
2070,
2104,
2141,
2142,
2180,
2215,
2254,
2255,
2355,
2356,
2377,
2378,
2393,
2412,
2414,
2452,
2453,
2492,
2493,
2540,
2546,
2570,
2595,
2601,
2603,
2604,
2627,
2629,
2687,
2688,
2711,
2717,
2766,
2776,
2810,
2844,
2878,
2912,
2947,
2958,
2964,
2966,
2967,
2986,
2987,
3058,
3059,
3071,
3072,
3144,
3145,
3235,
3236,
3258,
3259,
3326,
3327,
3400,
3401,
3426,
3427,
3470,
3471,
3472,
3497,
3498,
3511,
3529,
3549,
3565,
3580,
3581,
3785
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3785,
"ccnet_original_nlines": 132,
"rps_doc_curly_bracket": 0.004755610134452581,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1841004192829132,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009762899950146675,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.29986053705215454,
"rps_doc_frac_unique_words": 0.502293586730957,
"rps_doc_mean_word_length": 6.309633255004883,
"rps_doc_num_sentences": 53,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.9306230545043945,
"rps_doc_word_count": 436,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03962196037173271,
"rps_doc_frac_chars_dupe_6grams": 0.02544528990983963,
"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.05234460160136223,
"rps_doc_frac_chars_top_3gram": 0.06870228797197342,
"rps_doc_frac_chars_top_4gram": 0.06979279965162277,
"rps_doc_books_importance": -276.8222351074219,
"rps_doc_books_importance_length_correction": -276.8222351074219,
"rps_doc_openwebtext_importance": -153.319580078125,
"rps_doc_openwebtext_importance_length_correction": -153.319580078125,
"rps_doc_wikipedia_importance": -119.69763946533203,
"rps_doc_wikipedia_importance_length_correction": -119.69763946533203
},
"fasttext": {
"dclm": 0.038053449243307114,
"english": 0.6217252612113953,
"fineweb_edu_approx": 1.7302961349487305,
"eai_general_math": 0.004246530123054981,
"eai_open_web_math": 0.05474787950515747,
"eai_web_code": 0.07242423295974731
}
}
|
{
"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": "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
|
-5,462,689,289,955,350,000 |
Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
PerlMonks
Re: Re: Secure Session ID values
by hatter (Pilgrim)
on Nov 20, 2001 at 21:43 UTC ( #126560=note: print w/ replies, xml ) Need Help??
in reply to Re: Secure Session ID values
in thread Secure Session ID values
Certainly for unix-only apps this is a good choice for a session ID expect in really extenuating circumstances, but like others have suggested, you should combine it with a checksum. The uniqueness of time().$$ is good, but as with any user-supplied data (in this case, the users browser supplies it back to the server) you need to add something so that a malicious remote user can't fake the session of another user. A vaguely common (though not bulletproof) method would be to combine the two values with a 3rd secret value, in some mathematical way (eg ($$ * $secret) + $time) then take the modulus of that and another secret.
Something like $checksum = (($$ * $secret) + $time) % $someprime
When you need to access a users session, take their $$ and $time from the cookie, do the same maths on them, and verify that the calculated checksum is the same as the one in the users cookie.
the hatter
Comment on Re: Re: Secure Session ID values
Re: Re: Re: Secure Session ID values
by uwevoelker (Pilgrim) on Nov 20, 2001 at 22:55 UTC
I also do this:
I have a mysql-table with id (autoincrement), random, time, user and so on. When an user gets a new session I create a random number and the user gets the random number together with the id back. So if he alters the id or random, the session entry can not found in the database. The field time is for timeout and user stores the user id (or whatever you want).
To delete outdated session I do: "DELETE FROM session WHERE time < $time" and $time is time()-$expire (expiration time in seconds).
Log In?
Username:
Password:
What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://126560]
help
Chatterbox?
and the web crawler heard nothing...
How do I use this? | Other CB clients
Other Users?
Others imbibing at the Monastery: (7)
As of 2014-09-20 17:40 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
How do you remember the number of days in each month?
Results (160 votes), past polls
|
{
"url": "http://www.perlmonks.org/?node_id=126560",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2014-41",
"warc_metadata": {
"Content-Length": "19609",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RYKJJCHL4VCTNC2RRU3BPIGKA76Q2RMI",
"WARC-Concurrent-To": "<urn:uuid:a77cd0ad-73d3-4ad0-af85-38f7d6555d23>",
"WARC-Date": "2014-09-20T17:42:43Z",
"WARC-IP-Address": "216.92.34.251",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:SRGDHHG6FDRKZOL4RCHL5GZ2A7IT55AF",
"WARC-Record-ID": "<urn:uuid:10ad506d-32a6-42ec-b41e-2b9b3057f198>",
"WARC-Target-URI": "http://www.perlmonks.org/?node_id=126560",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ca8d50cb-26a1-42b2-bd06-3db8273bce66>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-196-40-205.us-west-1.compute.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-41\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for September 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
63,
95,
97,
109,
110,
143,
144,
164,
245,
246,
247,
288,
323,
324,
954,
955,
1020,
1021,
1214,
1215,
1226,
1227,
1228,
1272,
1309,
1362,
1382,
1747,
1748,
1884,
1885,
1893,
1903,
1913,
1914,
1934,
1952,
1965,
1978,
2008,
2013,
2025,
2062,
2063,
2101,
2114,
2152,
2179,
2189,
2202,
2214,
2225,
2243,
2244,
2302,
2303,
2304,
2305,
2306,
2307,
2308,
2309,
2310,
2311,
2312,
2313
],
"line_end_idx": [
63,
95,
97,
109,
110,
143,
144,
164,
245,
246,
247,
288,
323,
324,
954,
955,
1020,
1021,
1214,
1215,
1226,
1227,
1228,
1272,
1309,
1362,
1382,
1747,
1748,
1884,
1885,
1893,
1903,
1913,
1914,
1934,
1952,
1965,
1978,
2008,
2013,
2025,
2062,
2063,
2101,
2114,
2152,
2179,
2189,
2202,
2214,
2225,
2243,
2244,
2302,
2303,
2304,
2305,
2306,
2307,
2308,
2309,
2310,
2311,
2312,
2313,
2348
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2348,
"ccnet_original_nlines": 66,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3134615421295166,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03846153989434242,
"rps_doc_frac_lines_end_with_ellipsis": 0.014925369992852211,
"rps_doc_frac_no_alph_words": 0.253846138715744,
"rps_doc_frac_unique_words": 0.4948979616165161,
"rps_doc_mean_word_length": 4.471938610076904,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0.003846149891614914,
"rps_doc_unigram_entropy": 4.852421283721924,
"rps_doc_word_count": 392,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08100398629903793,
"rps_doc_frac_chars_dupe_6grams": 0.06788363307714462,
"rps_doc_frac_chars_dupe_7grams": 0.030804339796304703,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.030804339796304703,
"rps_doc_frac_chars_top_3gram": 0.04278380051255226,
"rps_doc_frac_chars_top_4gram": 0.05989731848239899,
"rps_doc_books_importance": -200.18736267089844,
"rps_doc_books_importance_length_correction": -200.18736267089844,
"rps_doc_openwebtext_importance": -131.03697204589844,
"rps_doc_openwebtext_importance_length_correction": -131.03697204589844,
"rps_doc_wikipedia_importance": -56.64417266845703,
"rps_doc_wikipedia_importance_length_correction": -56.64417266845703
},
"fasttext": {
"dclm": 0.04476827010512352,
"english": 0.850861668586731,
"fineweb_edu_approx": 1.3655672073364258,
"eai_general_math": 0.09843981266021729,
"eai_open_web_math": 0.2704474925994873,
"eai_web_code": 0.01262259017676115
}
}
|
{
"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": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "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,632,717,678,099,453,400 |
RadioBOSS 6.1 [beta]
This option doesn't work properly sometimes, I guess we'll remove it in the future. Anyway, there's little point in streaming silence.
That would be a pity because for a lot of broadcaster it is a great help because it avoided the listener stay connected to the stream and a transmission from the stream title continues This is used at shoutcast 2 to detect the image from the moderator.
Is there a way to mass edit song tags?
If it does not exist, can it be added?
I downloaded an album by an artist with 21 tracks that was missing only the genre tag.
I used Track Tool to edit tags, but I had to do the same task 21 times, even though I selected the 21 songs, RadioBoss only edits 1.
Is there a way to mass edit song tags?
If it does not exist, can it be added?
I downloaded an album by an artist with 21 tracks that was missing only the genre tag.
I used Track Tool to edit tags, but I had to do the same task 21 times, even though I selected the 21 songs, RadioBoss only edits 1.
Add these files to the library
Mark these files there
Right-click on one of the files and choose Track Properties
Now enter the desired genre and press OK
Or use MP3Tag https://www.mp3tag.de/en/index.html
Attachments
• genre 1.jpg
genre 1.jpg
160.9 KB · Views: 280
• genre 2.jpg
genre 2.jpg
474.3 KB · Views: 281
Last edited:
Hi
The duration in the library is definitely not right
Maybe because so much songs are in the database?
Database is mysql
RadioBOSS is 6.1.0.5
Attachments
• duration.jpg
duration.jpg
18 KB · Views: 281
I have seen other users previously report that the connection to the server was closed and then restarted
It had never happened to me before, but today I noticed that several times, they are random micro cuts of a few seconds.
Example:
23:47:12 Server connection closed (output 1) Restarting...
23:47:15 Connected to server! (output 1)
The duration in the library is definitely not right
Maybe because so much songs are in the database?
What the correct duration should be? It shows duration 29 days and about 3 hours in your case, it's not correct?
It had never happened to me before, but today I noticed that several times, they are random micro cuts of a few seconds.
Typically it means that the server disconnected the source for some reason, or it's some sort of problem with internet connection. RadioBOSS just notifies about it, it's not causing it.
Can you in Track properties make to select the empty field for Rating.
For now, I can only do that in the Track Tool. But it would also be good in Track Properties if I want to reset more songs.
It's possible in the music library - the very first option is empty rating.
In the Music library > Edit > Track properties - it's not possible set empty rating. When I want from a number set to empty it can not be applyed. After OK there always remains the number.
In Track Tool it's possible set to empty, but not in Track properties!
Can you fix this.
Me podrian ayudar amigos del foro, descargue la version beta de radio boss y no puedo activar el plugin Vst Jb Broadcaster. Probe con otros plugins vst y pasa lo mismo no lo reconoce el radio boss. Saben el porque y cual seria la solucion. Gracias
Is it normal for it to take 14 seconds for RB to open?
Before it was opened in 4 seconds maximum.
OS: Windows 11 pro x64 21H2 build 22000.376
Processor: Intel (R) Pentium (R) CPU G4560 @ 3.50GHz 3.50 GHz
RAM memory: 16 GB
Back
Top
|
{
"url": "https://www.djsoft.net/community/threads/radioboss-6-1-beta.7537/page-12",
"source_domain": "www.djsoft.net",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "159824",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RNMMUF5QR2QNLOJDRMWGTAPUNB3SA66L",
"WARC-Concurrent-To": "<urn:uuid:8c3357cd-e723-4163-af7d-0a73fd166f0f>",
"WARC-Date": "2024-06-19T13:01:41Z",
"WARC-IP-Address": "192.99.182.128",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NE67DB72BCE2N45DHPXPGBVSJGDDLLVZ",
"WARC-Record-ID": "<urn:uuid:c849f231-de53-4e67-be41-b1ebc606daf6>",
"WARC-Target-URI": "https://www.djsoft.net/community/threads/radioboss-6-1-beta.7537/page-12",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d060c5a0-560e-4d51-b3dc-6f020e71ea34>"
},
"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-37\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
21,
22,
157,
410,
412,
451,
490,
577,
710,
712,
751,
790,
877,
1010,
1041,
1064,
1124,
1165,
1215,
1217,
1218,
1230,
1231,
1247,
1263,
1289,
1305,
1321,
1347,
1360,
1363,
1415,
1464,
1482,
1503,
1505,
1506,
1518,
1519,
1536,
1553,
1576,
1682,
1683,
1804,
1805,
1814,
1873,
1914,
1916,
1968,
2017,
2130,
2131,
2252,
2438,
2440,
2511,
2635,
2637,
2713,
2902,
2973,
2991,
2993,
3241,
3242,
3244,
3299,
3342,
3386,
3448,
3466,
3468,
3473
],
"line_end_idx": [
21,
22,
157,
410,
412,
451,
490,
577,
710,
712,
751,
790,
877,
1010,
1041,
1064,
1124,
1165,
1215,
1217,
1218,
1230,
1231,
1247,
1263,
1289,
1305,
1321,
1347,
1360,
1363,
1415,
1464,
1482,
1503,
1505,
1506,
1518,
1519,
1536,
1553,
1576,
1682,
1683,
1804,
1805,
1814,
1873,
1914,
1916,
1968,
2017,
2130,
2131,
2252,
2438,
2440,
2511,
2635,
2637,
2713,
2902,
2973,
2991,
2993,
3241,
3242,
3244,
3299,
3342,
3386,
3448,
3466,
3468,
3473,
3476
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3476,
"ccnet_original_nlines": 75,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34922680258750916,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03737112879753113,
"rps_doc_frac_lines_end_with_ellipsis": 0.013157890178263187,
"rps_doc_frac_no_alph_words": 0.21262887120246887,
"rps_doc_frac_unique_words": 0.4426751732826233,
"rps_doc_mean_word_length": 4.24840784072876,
"rps_doc_num_sentences": 54,
"rps_doc_symbol_to_word_ratio": 0.001288659987039864,
"rps_doc_unigram_entropy": 5.2040605545043945,
"rps_doc_word_count": 628,
"rps_doc_frac_chars_dupe_10grams": 0.30284857749938965,
"rps_doc_frac_chars_dupe_5grams": 0.30284857749938965,
"rps_doc_frac_chars_dupe_6grams": 0.30284857749938965,
"rps_doc_frac_chars_dupe_7grams": 0.30284857749938965,
"rps_doc_frac_chars_dupe_8grams": 0.30284857749938965,
"rps_doc_frac_chars_dupe_9grams": 0.30284857749938965,
"rps_doc_frac_chars_top_2gram": 0.014992499724030495,
"rps_doc_frac_chars_top_3gram": 0.008995500393211842,
"rps_doc_frac_chars_top_4gram": 0.008245879784226418,
"rps_doc_books_importance": -341.478515625,
"rps_doc_books_importance_length_correction": -341.478515625,
"rps_doc_openwebtext_importance": -201.59754943847656,
"rps_doc_openwebtext_importance_length_correction": -201.59754943847656,
"rps_doc_wikipedia_importance": -146.91403198242188,
"rps_doc_wikipedia_importance_length_correction": -146.91403198242188
},
"fasttext": {
"dclm": 0.4317072629928589,
"english": 0.9089175462722778,
"fineweb_edu_approx": 1.1745214462280273,
"eai_general_math": 0.12173044681549072,
"eai_open_web_math": 0.26788824796676636,
"eai_web_code": 0.0185965895652771
}
}
|
{
"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": "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": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,313,534,903,645,348,000 |
import re # Regular Expressions import datetime # Datum/Zeit # Erklärungen zu diesem Code gibt es auch als Video hier: # https://web.microsoftstream.com/video/01abb9d3-d4ae-4fbd-9dfd-86313dba7610 # und für Datensparsame und solche ohne BLDSG-Account auch hier: # https://fginfo.ksbg.ch/~ivo/videos/informatik/vierte-klasse/daten-extraktion-youtube-watchtime-aggregation.mp4 # Daten einlesen # Entweder vollständiger Pfad zur Datei oder (wie z.B. C:\Users\Hansli\Desktop\watch-history.html) oder # nur Dateiname, wenn die Datei im gleichen Verzeichnis wie das Pythonprogramm liegt. f = open("jan14-history.html", "r") html = f.read() # Alles einlesen f.close() # Datei schliessen # Datum der Form 09.02.2012, 14:15:59 MEZ daten = re.findall(r"(\d{2})\.(\d{2})\.(\d{4}), (\d{2}):(\d{2}):(\d{2}) MEZ", html) #Erste 3 Einträge zur Kontrolle ausgeben print(daten[0:3]) # Resultat, das am Schluss geschrieben werden soll csv = "" # Comma separated values anzahl = [0 for i in range(24)] # Wie viele Kontrollausgaben? debug = 10 # Alle Einträge durchgehen, d enthält jeweils den nächsten Eintrag for d in daten: # Einträge in Zahlen umwandeln # Monat plus die anderen Einträge (ohne AM/PM) in Zahlen umgewandelt # Die Zeichenkette "42" ist nicht das gleiche wie die Zahl 42. e = [int(x) for x in d] if debug>0: # Ausgabe zur Kontrolle, sollte folgendes Format Produzieren print(e) # [1, 6, 2021, 21, 23, 12] debug -= 1 # Um 1 vermindern # Datum daraus generieren (macht die Datumsmanipulation einfacher). # Jahr, Monat, Tag, Stunde, Minute, Sekunde datum = datetime.datetime(e[2], e[1], e[0], e[3], e[4], e[5]) if debug>0: # Ausgabe zur Kontrolle, produziert folgendes Format print(datum) # 2021-01-06 21:23:12 debug -= 1 # Um 1 vermindern # Wochentag (Mo=0, Di=1, ..., So=6) # Sämtliche Methoden für datetime-Objekte sind hier beschrieben: https://docs.python.org/3/library/datetime.html#datetime-objects hour = datum.hour anzahl[hour] += 1 # Anzahl für diesen Wochentag um 1 erhöhen. # Formatierte Ausgabe des Datums, siehe https://www.w3schools.com/python/python_datetime.asp # \n heisst neue Zeile. # csv += datum.strftime("%Y-%m-%d %H:%M:%S\n") #Das Format soll so angepasst werden, damit die Tabellenkalkulation dann damit umgehen kann. csv = "" for i in range(24): csv += str(i)+"," csv += "\n" for a in anzahl: csv += str(a)+"," csv+="\n" # Kontrolle print(csv) # Ausgabe in Datei schreiben f = open("resultat.csv", "w") f.write(csv) f.close()
|
{
"url": "https://fginfo.ksbg.ch/dokuwiki/lib/exe/fetch.php?media=lehrkraefte:blc:informatik:glf4-20:youtube-date-extractor-europe-aggregator-by-hour.py",
"source_domain": "fginfo.ksbg.ch",
"snapshot_id": "crawl=CC-MAIN-2021-39",
"warc_metadata": {
"Content-Length": "3498",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:REGYKJMVEMBEVZN5OQEH3A2JLGQMPZAQ",
"WARC-Concurrent-To": "<urn:uuid:b474168f-28c8-4fbc-8b01-7b9f7e289979>",
"WARC-Date": "2021-09-22T04:50:40Z",
"WARC-IP-Address": "83.150.5.190",
"WARC-Identified-Payload-Type": "text/plain",
"WARC-Payload-Digest": "sha1:323XPJOM4IPCAWX52MU2CSCLUWC6AJ6E",
"WARC-Record-ID": "<urn:uuid:b5742950-3364-4c96-9c6d-36ced26f7b03>",
"WARC-Target-URI": "https://fginfo.ksbg.ch/dokuwiki/lib/exe/fetch.php?media=lehrkraefte:blc:informatik:glf4-20:youtube-date-extractor-europe-aggregator-by-hour.py",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6cd93b8d-1bad-4406-8dac-61772b39eee7>"
},
"warc_info": "isPartOf: CC-MAIN-2021-39\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-150\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": [
2444
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2444,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.004909980110824108,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.095238097012043,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.016897080466151237,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4746543765068054,
"rps_doc_frac_unique_words": 0.6774193644523621,
"rps_doc_mean_word_length": 6.376344203948975,
"rps_doc_num_sentences": 37,
"rps_doc_symbol_to_word_ratio": 0.059907831251621246,
"rps_doc_unigram_entropy": 5.05216121673584,
"rps_doc_word_count": 279,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0517144501209259,
"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.020236089825630188,
"rps_doc_frac_chars_top_3gram": 0.006745359860360622,
"rps_doc_frac_chars_top_4gram": 0.014614949934184551,
"rps_doc_books_importance": -344.2342834472656,
"rps_doc_books_importance_length_correction": -344.2342834472656,
"rps_doc_openwebtext_importance": -214.985107421875,
"rps_doc_openwebtext_importance_length_correction": -214.985107421875,
"rps_doc_wikipedia_importance": -147.0560760498047,
"rps_doc_wikipedia_importance_length_correction": -147.0560760498047
},
"fasttext": {
"dclm": 0.9451749324798584,
"english": 0.03626267984509468,
"fineweb_edu_approx": 2.429861068725586,
"eai_general_math": 0.9832698106765747,
"eai_open_web_math": 0.32908695936203003,
"eai_web_code": 0.9972233176231384
}
}
|
{
"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": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,465,426,520,794,394,000 |
Programming With Jon Logo
Programming with Jon
Android Development Part II
June 5th, 2020
Soul Collector
I created the game Soul Collector which happens to be an endless runner. I would say it's kind of like Flappy Bird when it comes to game mechanics as you tap on the screen and the character floats upward. The more you tap on the screen the further up the character will float. Once you stop tapping the character will start to drop slowly towards the ground. Unlike in Flappy Bird however your character can hit the ground. The only way to lose is to get hit by the flaming skulls flying your way. I had a lot of fun developing the game and as I promised in my last post I will be going over the some of the development process. Hope you enjoy.
Setup
The setup for the game is pretty straight forward. I needed to use something that would make the development of Android apps some what easy. I needed to find a game engine that would work on Android that was easy to use and setup. And I needed to figure out what language to use. The following sections will go into more detail on the individual tools used.
Android Studio
I used Android Studio since it is the number one choice for developing Android apps and games. It has a really good interface which allows you to drag and drop the elements for each view/scene that the users of your app will see. It supports both Kotlin and Java. Since it is developed and maintained by JetBrains it made sense to use it for the project. I also really liked how easy it was to setup and how comfortable it felt using it. It was very much like using IntelliJ but with a more focused Android environment. If that feature is available in IntelliJ I wasn't able to find it and didn't want to take too long figuring out how to convert IntelliJ for Android development. If you are coming from IntelliJ and don't already use IntelliJ for Android development you will feel right at home with the layout of Android Studio.
libGdx
This is a game engine that allows you to create cross platform games for Android, HTML, iOS, PC, and macOS. The engine is really awesome to use because it's not like Unity or Unreal in the sense that you have to download the game engine and swap back and forth between your IDE environment and the game environment. The below picture will show you how I set up the game using libGdx.
[object Object]
The picture shows how you would set up your game. You give the game a name, the name of the package (if you are familiar with Java then you will know what a package is), the game class which must be in camelCase but also start with a capital letter, and finally the path to your Android SDK(Android Studio makes finding this really easy). The other settings are check boxes for what platform you want to create the game for. For my project I only chose Android. Box2d is the physics engine used which is a very arcade like physics system. It's perfect for most games. If you are developing a FPS game or perhaps a really sophisticated ARPG then I would suggest choosing the Bullet option. Once you are finished click the generate button and the project will be generated for you and then you will be able to open it in Android Studio(or whichever IDE you are using).
The Language of Choice: Java
The language I chose was Java. The reason is that libGDX supports Java and has all kinds of really helpful and useful documentation on how to do just about everything you can think of with examples in Java. I am not all that familiar with Kotlin yet so I didn't want to go down the road of trying to convert what I saw in Java to Kotlin. I also wasn't sure whether Kotlin was a supported language for the engine. Java has been the go-to language for Android development and there are a lot of resources to help you if you get stuck. I figured I would pick the language that would be the easier of the two to implement with all the docs and helpful communities around that support Android development with Java.
Game Idea
I had the tools installed and the project setup. Now it was just a matter of taking the idea I had and actually implementing it. The code wasn't too hard to figure out. I've been working with Java building microservices for a while now and have some experience building games with other languages. The most recent game I created was with TypeScript and Phaser. Which helped me realize that the game engines that exist, by this I mean not Unity or Unreal Engine, have three main methods/functions that are used to build the game.
Project Structure
The structure that libGDX uses is a bit different from you might be used to in normal Android development. When you open the project you will see two folders one says android the other core. The assets will go under android -> assets and the code you write will be under core -> java -> <Insert package name> -> NameOfGameClass. It's not a drastic change in the way things are done but you won't be using the android folder like you might be used to.
Create Method
The create method is used to preload your assets for the game. These assets include the art, sound, buttons, etc that you are using for your game. While the game is loading up the create method is getting these assets ready for the game to use. You will use this method to load in all of your games assets.
Render Method
The render method is where all of the logic for the game will go. This handles the touch controls for the player. The gameplay aspects of each different object as well as handling the score and game over. This is where the brunt of your code will go.
Dispose Method
The dispose method is the method that you will use to kill the game. Once the player is finished with your game this is the method that is called to quit the game.
That's pretty much all there is to libGDX. The engine is setup through a GUI form that then generates the project files for you. Then you open the project up in your IDE of choice and start coding the business logic in the correct method. Add your assets to the assets folder and you are good to go.
Testing the Game
It's a good idea to test your app. Whether it's a game or an actual app. Testing it to make sure that it functions in the way you expect is a really great habit to form. I did not do TDD as I am accustomed to doing with other Java projects I work on but clicking the play button after implementing a couple lines of code and making sure that it worked the way I intended it to made me feel better about the code I wrote. I will be creating another app here soon that will focus on TDD for Android.
Conclusion
That's it. You can download the game and play it on your Android device. There are two versions. A paid for app that will remove the ads and the free version that will have ads. I look forward to hearing any feedback on the game. If anything is missing or you find bugs please feel free to write to me. You can contact me here
Created by Jonathan Reeves, © 2020
|
{
"url": "https://www.programmingwithjon.com/blog/android2/",
"source_domain": "www.programmingwithjon.com",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "18984",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OXJDLEBDOTAHHBIBINJOSJ56KDGBJOJJ",
"WARC-Concurrent-To": "<urn:uuid:ca69aa60-57f3-42a5-a44e-5ba5a874ca93>",
"WARC-Date": "2020-10-24T19:51:00Z",
"WARC-IP-Address": "159.65.216.232",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IQTVYUZSMHXEJPQ7B2NGUH44ZSN4ZNQT",
"WARC-Record-ID": "<urn:uuid:e303cf5f-a728-4218-aa13-bb89b5203aea>",
"WARC-Target-URI": "https://www.programmingwithjon.com/blog/android2/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8f83d947-949d-4f0d-abc2-bc6c80177b53>"
},
"warc_info": "isPartOf: CC-MAIN-2020-45\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-43.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,
26,
27,
48,
49,
77,
78,
93,
94,
109,
110,
755,
756,
762,
763,
1121,
1122,
1137,
1138,
1969,
1970,
1977,
1978,
2362,
2363,
2379,
2380,
3247,
3248,
3277,
3278,
3989,
3990,
4000,
4001,
4530,
4531,
4549,
4550,
5001,
5002,
5016,
5017,
5324,
5325,
5339,
5340,
5591,
5592,
5607,
5608,
5772,
5773,
6073,
6074,
6091,
6092,
6590,
6591,
6602,
6603,
6930,
6931
],
"line_end_idx": [
26,
27,
48,
49,
77,
78,
93,
94,
109,
110,
755,
756,
762,
763,
1121,
1122,
1137,
1138,
1969,
1970,
1977,
1978,
2362,
2363,
2379,
2380,
3247,
3248,
3277,
3278,
3989,
3990,
4000,
4001,
4530,
4531,
4549,
4550,
5001,
5002,
5016,
5017,
5324,
5325,
5339,
5340,
5591,
5592,
5607,
5608,
5772,
5773,
6073,
6074,
6091,
6092,
6590,
6591,
6602,
6603,
6930,
6931,
6965
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6965,
"ccnet_original_nlines": 62,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.5027855038642883,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03203342854976654,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.08426184207201004,
"rps_doc_frac_unique_words": 0.32459521293640137,
"rps_doc_mean_word_length": 4.247494220733643,
"rps_doc_num_sentences": 74,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.191157817840576,
"rps_doc_word_count": 1297,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.011980400420725346,
"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.02541295997798443,
"rps_doc_frac_chars_top_3gram": 0.007260850165039301,
"rps_doc_frac_chars_top_4gram": 0.003993470221757889,
"rps_doc_books_importance": -710.0699462890625,
"rps_doc_books_importance_length_correction": -710.0699462890625,
"rps_doc_openwebtext_importance": -495.4394836425781,
"rps_doc_openwebtext_importance_length_correction": -495.4394836425781,
"rps_doc_wikipedia_importance": -371.3604736328125,
"rps_doc_wikipedia_importance_length_correction": -371.3604736328125
},
"fasttext": {
"dclm": 0.020503880456089973,
"english": 0.9652800559997559,
"fineweb_edu_approx": 1.3941006660461426,
"eai_general_math": 0.22724735736846924,
"eai_open_web_math": 0.07826340198516846,
"eai_web_code": 0.23168915510177612
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"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": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,066,513,013,597,432,000 |
Excel Forum
Close Window
Free Ebook
Get Your Free Excel
ebook!
Top 15 Excel Tutorials
Instant Access!
E-mail:
Excel Shortcut- Switch To Previous Sheet
I wanted a shortcut that moved between the last two sheets selected.
Similar to how Alt+Tab works with windows.
example: I have Sheet1 until Sheet 10, I work in Sheet2 then I switch my work to Sheet10, I want to back to Sheet2 quickly by using shortcut. Not use CTRL + PageUp because it just move to one previous sheet from Sheet10 to Sheet9.
Its really helpful if we have many sheet & need to work quickly.
Thanks
Free Excel Help Forum
- Ask any question about Excel and have it answered in no time.
Similar Excel Tutorials
Quickly Switch the Columns and Rows of a Data Set in Excel
How to switch a data set in Excel so that the columns become rows and the rows become columns. This will save you ...
Quickly Clear all Formatting in Excel
How to remove all formatting from cells at once in Excel. This includes removing any and all types of formatting b ...
Manually Calculate Formulas and Functions in Excel
How to force Excel to recalculate all formulas and functions without editing or entering any data. This works grea ...
Stop Formula Calculation in Excel - Increase Worksheet Performance
I'll show you how to stop formulas and functions from performing their calculations and updating in Excel. This ma ...
Helpful Excel Macros
Name Worksheets Based on Cell Contents
- This macro allows you to have your worksheets named by whatever is in a particular cell within a worksheet. This means
Reverse Row or Column Order in a Worksheet
- This macro reverses the order of a selected row or column in excel. It will completely reverse the data.
Excel Macro that Searches Entire Workbook and Returns All Matches
- This is the ultimate Lookup Macro for Excel. It will search every worksheet in the workbook and return all of the mat
Excel Macro to Save a Specific Worksheet as a New File
- This Excel Macro allows you to save a specific worksheet within the Excel Workbook to its own new file. You will be a
Replace Formulas with Values (For The Entire Workbook)
- This macro will convert every formula in an entire workbook into its respective value. This is basically a quick way to
Similar Topics
Hi all! Can anyone tell me the shortcut for Delete, Shift cells up? I have checked through Google but could not find the shortcut.
Thanks!
Hi Excel experts,
I am working on a worksheet, and would like to have an entire row transferred to another worksheet based upon a certain cell's value.
Having searched through the many solved threads on this site, I attempted to customize some of the code to my worksheet. Not being proficient in Macro/VBA, I failed. I figured I would ask for help, and see if anyone can provide what I am looking for.
Basically, I am attempting to construct a "work in process" file, and would like all completed work to be deleted from the work in process sheet, and transferred to a sheet that contains a running list of all work completed.
Attached is an example of what I am working on. I would like Column Q (Status) to determine if a row can be moved to a sheet that contains the list of all work completed, and eliminated from the original sheet. Once Status is updated to "Complete", it would be helpful to be able to run a macro/click a button that would perform the transfer.
Can anyone assist?
Thanks!
I have a problem sometimes. I will click on a cell to add information.
The cell turns blue and then wherever I move, it highlights those to.
No matter where I go on the page. If I Alt-Tab and work in another
program on my computer, that excel page keeps highlighting wherever
I move even in those other programs (I know this sounds confusing).
When I return to excel thousands and thousands of cells are blue.
The biggest problem is that the highlighting won't turn off, no matter
what. I can't select anything from the tool bars, do any work on the sheet or close the program.
I can close it only with the task manager but when I open it again,
the cursor is still stuck in the highlighting mode and won't perform any
other functions.
Do you think this is a problem with my computer, the excel program? I have changed my mouse and this didn't help.
Is there some shortcut to turn off this highlight feature other than restarting
my computer. Which is the only current way I can get rid of it.
Thanks for any advice,
I was wondering if anyone could help me out please?!?!
I need to have a cell on Sheet2 display the TEXT from a cell on Sheet1, is his possible??
Example:
Sheet1, Cell A1 contains a clients name and I would like to have Sheet2, Sheet3, Sheet4 etc... Display that clients name in a cell of my choosing (could be a different cell on each Sheet) automatically after entering it once on Sheet1, cell A1.
I thought this was possible but I can't seem to figure it out. I haven't done any real Excel work in quite a long time but I thought I had done this before a long time ago!! Any help would be GREATLY appreciated!! Thanks in advance...
P.S. If I use autosum to do this it just displays the number 0, obviously, since it is trying to add numbers...
I uploaded a copy of the spreadsheet, What I would like to happen is have the text from Sheet1,D4 automatically be placed in Sheet2,A1 and Sheet3, B2. Hope this helps
-Aric
I have a Workbook with 2 sheets, the first one is the data entry and the second one contains all the calculations and confidential info.
I have one staff member that does the data entry but I don't want them to see the 2nd sheet. I know I can hide the sheet then protect the entire workbook which does work, but is there an easier way so that the second person doesn't have to keep hiding/unhiding the 2nd sheet?
It would be perfect if when you tried to click on Sheet2, it asked for a password.
Cheers
Jase
Hi, I'm trying to get some macros to combine data from two open workbooks, and I can't figure out the commands to switch from the active workbook to the other open workbook and back. I'm new to VBA and just learning the ropes. All I can figure out is how to switch to another workbook with an exact name. If I record the macro to go to a recent file, for example Window > 1 (filename), the code that I get in VBA is Windows("filename").Activate. This doesn't translate to when I have two different workbooks with different filenames open.
Make sense? I'm a bit confused myself. Maybe just a list of basic workbook-switching techniques or commands would be useful.
- Michael
Hello Everybody,
I am hoping for some assistance. Here is what I have....
I am trying to get counts of certain values.
This is in the same workbook but different sheets.
On sheet 1 is where my formula lies. In a cell, I want it to look at sheet 2 column B and look for instances of "A", then I want it to look in the same row it found "A" and look at the value in column "N" and evaluate if there is an amount. If there isn't skip it and don't count it, if there is a value count it if it falls within a given range.
An example of the formula is below...what am I missing?
=COUNTIF(Sheet2!B:B,(VLOOKUP(A,Sheet2!B:N,13,FALSE)=0:500))
=COUNTIF(Sheet2!B:B,(VLOOKUP(A,Sheet2!B:N,13,FALSE)=501:1000))
Thank you in advance for your assistance.
I have a sheet with a list of names on and I've noticed that when I use ctrl+F to use the find function, even when I know i have entered the correct name it still will not work. I have identifed times when I know the name is there on the sheet, but the find function says "Excel cannot find the data you are searching for"
Im unable to put any pics up as my work pc has java disable so photobucket ect won't work but has anyone else come across this problem and how did you rectify it? A search macro perhaps?
This is probably an easy question for most of you, but it's killing me. I tried searching before I posted this, but the suggestions given didn't seem to work for me.
I need to look up data from a cell on one Excel sheet, compare it to a list on a 2nd sheet and when they equal, take a value from a different column on the 2nd sheet and drop it back on the 1st sheet. Since that's a horrible explanation, let me try explaining it this way:
Sheet 1
Column A has a long list of code type 1s
Column E has a long list of code type 2s
Sheet 2
Cell C2 has code 1
Cell E2 needs code 2
I know it should take an index/match function, but nothing I try is working. What I'm trying is the following formula in Cell E2 of sheet 2:
=INDEX('Sheet 1'!A:A,MATCH(C2,'Sheet 1"!E:E,0),5)
But all I get is no result. What's driving me bonkers is that if I copy everything over to a single sheet, that formula works fine.
Posted this on the Ozgrid forums, but haven't gotten any help yet, so I thought I'd try here too!
I've been having a strange problem lately. I have a fairly lengthy macro that works perfectly most of the time. Occasionally it will run as expected but as soon as the macro ends, excel becomes unresponsive to mouse-clicks. When I click anywhere (trying to select a cell, or an excel menu item...clicking anywhere in excel) I'll get the a 'ding' system sound and nothing will happen. BUT, if I use the keyboard arrow keys, I can see that the active cell selection moves accordingly. Then it gets really strange - when I have a cell highlighted and press any key to input text, it gets duplicated. So if I press "s' it will input "ss" into the cell, and then when I press enter it will auto-move to the next cell down, but nothing ends up getting saved into the previous cell.
I don't understand what's going on at all. I can't think of anything in my macro that would have these kinds of effects. I've made sure that screenupdating is turned back on at the end of every procedure. If I go into the VBE, I can manually run procedures and they all work fine. The only way I've been able to get back to normal is by force closing excel altogether and re-opening. Any ideas?
______________________
Still having trouble, and the same thing is happening with this workbook on two different computers, so I don't think it's a hardware, or OS specific issue. When it gets locked up like this, I can still do anything in the VBE (edits cells, run macros, etc.) with no problems. If I'm in the excel window, I can click alt on the keyboard and the shortcut keys for the menu come up, but I can't go deeper than that by clicking the letter shortcuts, they do nothing. If I use the delete key to delete the contents of a cell, then it gets deleted. But if I type anything else (numbers, letters, or symbols) then it types 2 instances of the key every time, yet when I hit enter, nothing changes in the cell. I also can't really bring focus to the excel window if something else (ie. the VBE) is on top of it, clicking into the excel window just gives the little system 'ding' sound and nothing happens.
If I hit the save button in the VBE (since I can't click anything in the excel window), then it seems to snap out of it and go back to normal. I tried searching for anything simmilar to this and can't find anything...
Any help would be much appreciated. This is driving me nuts!
Let's say, if two fields in one column has been filled with numerical
increament, i.e. A1 is 2 and A2 is 4. Now I want to fill the whole column
with this increament pattern till row A20. One thing we will all do is to
left click on the fill handle and drag it down to row A20. But if the task is
to fill to row 500, the mouse draging sometime won't be easy to locate the
row. I am wondering anyone can help me to find the keyboard shortcut
equivalent to that drag fill handle action.
Thanks
Hey there,
I have been tasked with introducing userforms into an excel sheet and tbh I'm quite amazed that excel has this capability of adding userforms to excel sheets.
Anyway, I have 2 columns of data in an excel sheet and I wish to add this to a userform so that the userform displays the 2 columns beside each other with headings, like a table. The user should then be able to select a particular row and insert it into the specified cell.
I would also like the user to select a row on the table and then be able to bring up another table depending on the row selected...basically so that the user can draw deeper into the information that they require.
I have an example excel sheet where I have 2 sheets. One sheet is the user entry sheet called User Entry Screen. the next sheet is the tables sheet where my tables are held. Once the user selects the cell shown in the example sheet, it should then bring up the user form. the user then, depending on which item clicked, then gets shown the next window with a table and info on it. then user should then be able to select an item and the cells on the user entry screen would then get populated.
Personally I think this is a really tricky challenge and any help with doing this would be extremely appreciated.
I'll post up further comments as I am trying to work my way through it!
Thanks,
Jag
Hi folks,
Hoping someone can help me quickly as I'm pulling my hair out and have a deadline getting too close.
Been trailing the net and this board but can't work out how to do a simple variance.
How do I work out the difference between two numbers - including negatives.
If the numbers are all positive, it's fine as it's simply a case of A - B = C which is your difference. However, that doesn't work if B is negative.
I need a formula that would give the following:
First Number / Second Number / Difference
1 / 5 / 4
1 / -5 / -6
-1 / 5 / 6
-1 / -5 / -4
-5 / -1 / 4
Hopefully there's a simple function I've been missing.
Thanks in advance, R
Hi there, longtime user firsttime poster. Looking for some help as I am a non-expert with macros. Here's what I'm trying to do:
We have to submit things to a certain regulatory body and we usually enter tasks in as soon as they come, do the submission, and then keep a record of that submission.
So, I have a workbook with two sheets, one is "TO DO", the other is "ARCHIVE". Both sheets have the same columns and everything. I am looking for a macro that will automatically cut a (row) from the TO DO sheet and paste it in into the ARCHIVE sheet once it is done, then delete the cut row from the TO DO list so it stays topped up.
The trigger for archiving is the columns M and N which are titled "Complete ?" and each has a validation drop down that says "YES". When both cells in columns M and N have the YES in them, I would like the macro to make the above mentioned actions.
I ran a search on the forums and found something similar, but not quite what I was looking for.
Any help?
Hello, I'm trying to count the number of times a name appears across multiple worksheets but I can't seem to figure it out.
I have 6 sheets to count and all the names are in column A (from A1:A100) on each sheet. The names are not in a particular order.
On sheet 7 I want to have a cell beside each persons name that counts the number of times their name appeared on the other 6 sheets.
For example Sheet 7 (called total) would have
Joe 5 (where 5 is the outcome of the formula I'm looking for to count all the times "Joe" appears on sheets 1-6).
I have it counting per sheet with =COUNTIF(A1:A130,"name") but this is not quite what I am looking for.
Thanks in advance for any advice.
Edit: I am using Excel 2007 w/ windows XP
Hi there,
I'm very new to Excel, and I'm having trouble figuring a few things out. Hopefully this will be very easy for you guys!
In Sheet 1, I have a column of cells that I would like to also appear in Sheet 2. If I add a new row to the column in Sheet 1, I would also like it to be updated automatically in Sheet 2. Currently, I can get it to show the contents of individual cells from Sheet 1 in Sheet 2 by using this formula in the formula bar for each cell in Sheet 2:
=Sheet1!A3 (or whichever cell it is)
That's fine, but I'd like to just have a formula that will reproduce the entire column (ie. without a fixed range, as new rows are going to be added to the column).
If anyone could point me in the right direction, I'd be very very grateful. Thanks.
Hi,
This is a very basic question, but i have been struggling for hours, so I must ask.
I I trying to simply fill a combobox on a userform from a named range on a sheet, I want to populate the combobox as soon as the userform starts. (I launch the userform from a button on the sheet) Where must I place the code? and will this code work?
Code:
Sub Button1_Click()
Set UserForm1.combobox1.List = Sheets("Sheet1").Range("MyRange")
UserForm1.Show
End Sub
I am very new to vba, so please excuse my ignorance,
any help would be greatly appreciated
regards
jim
A previous poster explained what I also need; there were no responses,
so I thought I would try again.
Does anyone know of an Excel template--or a small stand-alone
program--that will calculate the interest/principal breakdown when
payments are varied in amount and frequency? Free or low-cost, please.
I need one that will work on my Mac/Office 2004. I will need to print
out periodic reports.
Here is the way the previous poster described it:
"Excel template: Loan Amortization for random/irregular payments,
figures days
between payment dates.
I have a loan with a variable beginning balance and irregular payments
with
annual large payment. (based on collections)
Would like to enter payment and date.
then Excel would figure days since last payment, interest amount,
principal
amount, Ending Principal balance.
And total interest paid, total pricipal paid
If I change the starting principal, excel would recalculate all
entries."
Thanks very much.
Hi all,
I hope you can help me with what I would like to do. I've searched and searched and not come up with anything yet!!
I have one sheet which is my 'data' sheet with a number of columns, one of which is a date which may be repeated.
I then want to use another sheet with two cells where two dates can be entered and a button which allows you to copy the rows of data from the data sheet which have dates between the two specified originally. The list in the data sheet may not be in date order although I could update a macro to do this for me if needed. I would also like to do it so that if "ALL" is typed in the date fields, it pulls over ALL the data. (Or something similar)
Any help you can give would be much appreciated.
Cheers,
Kevin
Thought I'd append my experience of the above problem - you can find all sorts of references to it everywhere.
My problem was that a userform defined with Excel at work (containing DT pickers) gave the message in the title when opening it at home. I had a light-bulb moment and wondered whether there was a difference in the version numbers for MSCOMCT2.OCX at work and at home. Turned out the work version was newer. I then copied the MSCOMCT2.* files from work, made a backup of them at home and copied those from work to my C-drive (Windows XP - c:\windows\system32\ ).
No luck. I then rebooted the machine - still no luck.
Then, finally I unregistered the old DLL via
Code:
regsvr32 /u c:\windows\system32\MSCOMCT2.OCX
(not sure if this was necessary, but I didn't think it could hurt). Reregistered the DLL via
Code:
regsvr32 c:\windows\system32\MSCOMCT2.OCX
and what do you know - it worked.
Summa summarum - it could be an idea to check whether the two machines have different version numbers for the MSCOMCT2.OCX files.
we can open an hperlink with the click of the mouse on the link.
but how to open hyperlink with the keyboard... any shortcut...
regards,
nishith
Hi peeps
I want to combine data from several worksheets into one worksheet.
For example, I have data in Sheet1 (Columns A,B,C), data in Sheet2 (Columns A,B,C), data in Sheet3 (Columns A,B,C) all with varying amounts of rows. (All the rows contain text data).
I need to combine all of the data from the 3 sheets into a single sheet, Sheet4 (Columns A,B,C), eliminating the empty rows.
I've been looking into this for a while, and can't find anything that really helps. Anyone got any pointers of what to look into?
Any help will be beautiful.
Cheers
Hi,
Someone once showed me how if you have a a reference to a cell in one sheet
you could double click on the cell and it would jump to the referenced cell
in the reference cell's sheet.
For example.
Cell With Reference Referenced Cell in other
Sheet
A1 <--double click sheet1 cell A1 takes you to --> =Sheet2!A1
Hello,
Is there a way to create a second worksheet that is based on data from an original sheet that will automatically update when you ADD ROWS to the original sheet?
Linking values between sheets is easy... but I need to be able to set a designated area on my A sheet that I can add rows into which will automatically be added to my B sheet.
Does anyone know of a function that I can apply for this?
I'm trying to come up with a solution to calculate the man hours and days worked over multiple sheets.
I have a file that has 8 sheets. the first seven sheets are the days of the week and the 8th sheet is where I want to calculate the hours.
The days of the week consists of "Name" "Date" Hours"
The 8th sheet consists of "Name", "Days of the week in their own column (7 columns in total)", "Total Hours" and "Total Days Worked"
Now... each day is always a different group and what I'm hoping for is to create a formula that can grab each name with their hours and throw them into the 8th sheet. So when the end of the week is done I have all the Employees weekly hours and days worked all finished.
I hope this makes sense. This file is to track about 100 employees that are on a rotational work schedule.
I have attached a sample file.
Thanks in advance for your help.
|
{
"url": "http://www.excelcommand.com/excel-help/excel-how-to.php?i=195114",
"source_domain": "www.excelcommand.com",
"snapshot_id": "crawl=CC-MAIN-2017-17",
"warc_metadata": {
"Content-Length": "102758",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:K2EOF7JAK3SRTDB4P2AGB3NLWTOZ6YET",
"WARC-Concurrent-To": "<urn:uuid:eb8676b3-90f2-4124-83a9-e4e5748f0bad>",
"WARC-Date": "2017-04-25T22:12:25Z",
"WARC-IP-Address": "216.92.113.237",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:WYPP6YKMDPDSRKFPI4USYP7DSDR24L6T",
"WARC-Record-ID": "<urn:uuid:d5cf8556-e8a9-4d63-925c-d35b0db24ce3>",
"WARC-Target-URI": "http://www.excelcommand.com/excel-help/excel-how-to.php?i=195114",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:239cd11a-acf0-46f7-b7d3-c9a1f424172a>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-145-167-34.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-17\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for April 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
12,
28,
39,
59,
66,
89,
105,
113,
114,
155,
156,
225,
226,
269,
270,
501,
566,
567,
574,
575,
576,
598,
599,
663,
664,
688,
689,
748,
866,
904,
1023,
1074,
1193,
1260,
1379,
1380,
1401,
1402,
1441,
1562,
1605,
1712,
1778,
1898,
1953,
2073,
2128,
2250,
2251,
2266,
2267,
2268,
2269,
2270,
2271,
2272,
2273,
2274,
2275,
2406,
2407,
2415,
2416,
2434,
2568,
2569,
2820,
2821,
3046,
3047,
3390,
3391,
3410,
3411,
3419,
3420,
3421,
3492,
3562,
3629,
3697,
3765,
3831,
3832,
3833,
3904,
4001,
4069,
4142,
4159,
4160,
4274,
4354,
4418,
4419,
4442,
4443,
4444,
4499,
4500,
4590,
4591,
4600,
4601,
4846,
4847,
5082,
5083,
5195,
5196,
5363,
5364,
5370,
5371,
5372,
5509,
5785,
5868,
5875,
5880,
5881,
5882,
6421,
6422,
6547,
6548,
6558,
6559,
6560,
6577,
6578,
6635,
6636,
6681,
6682,
6733,
7080,
7081,
7137,
7138,
7198,
7261,
7262,
7304,
7305,
7306,
7629,
7630,
7817,
7818,
7819,
7985,
7986,
8259,
8260,
8268,
8309,
8350,
8351,
8359,
8378,
8399,
8400,
8541,
8542,
8592,
8593,
8725,
8726,
8727,
8825,
8826,
9602,
9603,
9998,
9999,
10022,
10023,
10920,
10921,
11139,
11140,
11201,
11202,
11203,
11273,
11347,
11421,
11499,
11574,
11643,
11687,
11688,
11695,
11696,
11697,
11698,
11709,
11710,
11869,
11870,
12144,
12145,
12359,
12360,
12854,
12855,
12969,
12970,
13042,
13043,
13051,
13052,
13056,
13057,
13058,
13068,
13069,
13170,
13171,
13256,
13257,
13333,
13334,
13483,
13484,
13532,
13533,
13575,
13585,
13597,
13608,
13621,
13633,
13634,
13689,
13690,
13711,
13712,
13713,
13841,
13842,
14010,
14011,
14345,
14346,
14595,
14596,
14692,
14693,
14703,
14704,
14705,
14829,
14830,
14831,
14961,
14962,
15095,
15096,
15142,
15143,
15257,
15258,
15362,
15363,
15397,
15398,
15399,
15441,
15442,
15443,
15453,
15454,
15574,
15575,
15919,
15920,
15957,
15958,
16123,
16124,
16208,
16209,
16210,
16214,
16215,
16299,
16300,
16551,
16557,
16558,
16578,
16643,
16658,
16666,
16667,
16668,
16721,
16759,
16760,
16768,
16772,
16773,
16774,
16845,
16877,
16878,
16940,
17007,
17078,
17148,
17170,
17171,
17221,
17287,
17300,
17323,
17394,
17399,
17444,
17482,
17548,
17558,
17592,
17637,
17701,
17711,
17712,
17730,
17731,
17732,
17733,
17734,
17742,
17743,
17859,
17860,
17974,
17975,
18421,
18422,
18471,
18472,
18480,
18481,
18487,
18488,
18489,
18600,
18601,
19063,
19064,
19118,
19163,
19169,
19170,
19215,
19216,
19217,
19310,
19316,
19317,
19359,
19360,
19361,
19395,
19396,
19526,
19527,
19528,
19593,
19594,
19657,
19658,
19667,
19668,
19676,
19677,
19678,
19687,
19688,
19755,
19756,
19939,
19940,
20065,
20066,
20196,
20197,
20225,
20226,
20233,
20234,
20235,
20236,
20240,
20241,
20317,
20393,
20424,
20425,
20438,
20439,
20484,
20490,
20552,
20553,
20554,
20555,
20562,
20563,
20724,
20725,
20901,
20902,
20960,
20961,
20962,
21065,
21066,
21205,
21206,
21260,
21261,
21394,
21395,
21666,
21667,
21774,
21775,
21806,
21807
],
"line_end_idx": [
12,
28,
39,
59,
66,
89,
105,
113,
114,
155,
156,
225,
226,
269,
270,
501,
566,
567,
574,
575,
576,
598,
599,
663,
664,
688,
689,
748,
866,
904,
1023,
1074,
1193,
1260,
1379,
1380,
1401,
1402,
1441,
1562,
1605,
1712,
1778,
1898,
1953,
2073,
2128,
2250,
2251,
2266,
2267,
2268,
2269,
2270,
2271,
2272,
2273,
2274,
2275,
2406,
2407,
2415,
2416,
2434,
2568,
2569,
2820,
2821,
3046,
3047,
3390,
3391,
3410,
3411,
3419,
3420,
3421,
3492,
3562,
3629,
3697,
3765,
3831,
3832,
3833,
3904,
4001,
4069,
4142,
4159,
4160,
4274,
4354,
4418,
4419,
4442,
4443,
4444,
4499,
4500,
4590,
4591,
4600,
4601,
4846,
4847,
5082,
5083,
5195,
5196,
5363,
5364,
5370,
5371,
5372,
5509,
5785,
5868,
5875,
5880,
5881,
5882,
6421,
6422,
6547,
6548,
6558,
6559,
6560,
6577,
6578,
6635,
6636,
6681,
6682,
6733,
7080,
7081,
7137,
7138,
7198,
7261,
7262,
7304,
7305,
7306,
7629,
7630,
7817,
7818,
7819,
7985,
7986,
8259,
8260,
8268,
8309,
8350,
8351,
8359,
8378,
8399,
8400,
8541,
8542,
8592,
8593,
8725,
8726,
8727,
8825,
8826,
9602,
9603,
9998,
9999,
10022,
10023,
10920,
10921,
11139,
11140,
11201,
11202,
11203,
11273,
11347,
11421,
11499,
11574,
11643,
11687,
11688,
11695,
11696,
11697,
11698,
11709,
11710,
11869,
11870,
12144,
12145,
12359,
12360,
12854,
12855,
12969,
12970,
13042,
13043,
13051,
13052,
13056,
13057,
13058,
13068,
13069,
13170,
13171,
13256,
13257,
13333,
13334,
13483,
13484,
13532,
13533,
13575,
13585,
13597,
13608,
13621,
13633,
13634,
13689,
13690,
13711,
13712,
13713,
13841,
13842,
14010,
14011,
14345,
14346,
14595,
14596,
14692,
14693,
14703,
14704,
14705,
14829,
14830,
14831,
14961,
14962,
15095,
15096,
15142,
15143,
15257,
15258,
15362,
15363,
15397,
15398,
15399,
15441,
15442,
15443,
15453,
15454,
15574,
15575,
15919,
15920,
15957,
15958,
16123,
16124,
16208,
16209,
16210,
16214,
16215,
16299,
16300,
16551,
16557,
16558,
16578,
16643,
16658,
16666,
16667,
16668,
16721,
16759,
16760,
16768,
16772,
16773,
16774,
16845,
16877,
16878,
16940,
17007,
17078,
17148,
17170,
17171,
17221,
17287,
17300,
17323,
17394,
17399,
17444,
17482,
17548,
17558,
17592,
17637,
17701,
17711,
17712,
17730,
17731,
17732,
17733,
17734,
17742,
17743,
17859,
17860,
17974,
17975,
18421,
18422,
18471,
18472,
18480,
18481,
18487,
18488,
18489,
18600,
18601,
19063,
19064,
19118,
19163,
19169,
19170,
19215,
19216,
19217,
19310,
19316,
19317,
19359,
19360,
19361,
19395,
19396,
19526,
19527,
19528,
19593,
19594,
19657,
19658,
19667,
19668,
19676,
19677,
19678,
19687,
19688,
19755,
19756,
19939,
19940,
20065,
20066,
20196,
20197,
20225,
20226,
20233,
20234,
20235,
20236,
20240,
20241,
20317,
20393,
20424,
20425,
20438,
20439,
20484,
20490,
20552,
20553,
20554,
20555,
20562,
20563,
20724,
20725,
20901,
20902,
20960,
20961,
20962,
21065,
21066,
21205,
21206,
21260,
21261,
21394,
21395,
21666,
21667,
21774,
21775,
21806,
21807,
21839
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 21839,
"ccnet_original_nlines": 433,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.44810545444488525,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06280890107154846,
"rps_doc_frac_lines_end_with_ellipsis": 0.020737329497933388,
"rps_doc_frac_no_alph_words": 0.15547776222229004,
"rps_doc_frac_unique_words": 0.22630657255649567,
"rps_doc_mean_word_length": 4.200300216674805,
"rps_doc_num_sentences": 247,
"rps_doc_symbol_to_word_ratio": 0.003294890047982335,
"rps_doc_unigram_entropy": 5.683592796325684,
"rps_doc_word_count": 3999,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.034172769635915756,
"rps_doc_frac_chars_dupe_6grams": 0.01285944040864706,
"rps_doc_frac_chars_dupe_7grams": 0.009049230255186558,
"rps_doc_frac_chars_dupe_8grams": 0.003095790045335889,
"rps_doc_frac_chars_dupe_9grams": 0.003095790045335889,
"rps_doc_frac_chars_top_2gram": 0.008334820158779621,
"rps_doc_frac_chars_top_3gram": 0.003214860102161765,
"rps_doc_frac_chars_top_4gram": 0.0028576499316841364,
"rps_doc_books_importance": -2071.91796875,
"rps_doc_books_importance_length_correction": -2071.91796875,
"rps_doc_openwebtext_importance": -1354.8787841796875,
"rps_doc_openwebtext_importance_length_correction": -1354.8787841796875,
"rps_doc_wikipedia_importance": -1115.443115234375,
"rps_doc_wikipedia_importance_length_correction": -1115.443115234375
},
"fasttext": {
"dclm": 0.09346616268157959,
"english": 0.9549576044082642,
"fineweb_edu_approx": 1.363450288772583,
"eai_general_math": 0.8543699383735657,
"eai_open_web_math": 0.2279687523841858,
"eai_web_code": 0.8882856965065002
}
}
|
{
"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": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
7,978,878,490,635,398,000 |
Yuansfer DOCS
Search…
⌃K
Cancel
post
https://mapi.yuansfer.com/app-data-search/v3
/cancel
Cancel
Response
Parameter
Type
Description
result
object
The result of the refund.
ret_msg
string
The response return message.
ret_code
string
The response return code. For more details, see here.
Result Object
Parameter
Type
Description
amount
number
The transaction amount.
currency
string
The supported transaction currency "USD" "CNY".
reference
string
The Invoice Number of the transaction in the merchant's system.
status
string
The status of the refund.
transactionNo
string
The Transaction ID in the Yuansfer system.
cURL
PHP
Java
Go
curl -XPOST -H "Content-type: application/json" -d '{
"merchantNo": "200043",
"storeNo": "300014",
"verifySign": "dd81f7781603bec48ae2c6a9ac758bf2",
"transactionNo": "297553638301777927",
}' 'https://mapi.yuansfer.com/app-data-search/v3/cancel'
<?php
function transCancel()
{
$url = 'https://mapi.yuansfer.yunkeguan.com/app-data-search/v3/cancel';
$token = '59600f2a9ad644c6a9570233560cc94e';
$params = [
'merchantNo' => '200043',
'storeNo' => '300014',
'transactionNo' => '297553565108438359'
];
ksort($params, SORT_STRING);
$str = '';
foreach ($params as $k => $v) {
$str .= $k . '=' . $v . '&';
}
$params['verifySign'] = md5($str . md5($token));
echo 'verifySign:', $params['verifySign'];
echo "\n";
$ch = curl_init($url);
curl_setopt_array($ch, array(
CURLOPT_RETURNTRANSFER => true,
CURLOPT_HEADER => false,
CURLOPT_POST => true,
CURLOPT_POSTFIELDS => http_build_query($params),
));
$result = curl_exec($ch);
curl_exec($ch);
echo $result;
echo "\n";
return json_decode($result, true);
}
transCancel();
?>
public static void transactionCancel(String transactionNo) {
String url = DOMAIN_URL + TRANSACTION_CANCEL;
Map<String, Object> params = new TreeMap<String, Object>();
params.put("merchantNo", MERCHANT_NO);
params.put("storeNo", STORE_NO);
if (StringUtils.isNotEmpty(STORE_ADMIN_NO)) {
params.put("storeAdminNo", STORE_ADMIN_NO);
}
params.put("transactionNo", transactionNo);
String verifySign = verifySignHelper.getYuansferVerifySign(params, YUANSFER_TOKEN);
params.put("verifySign", verifySign);
String ret = HttpClientUtils.post(url, null, params);
System.out.println("---transaction reverse----");
System.out.println(ret);
}
|
{
"url": "https://docs.yuansfer.com/api-reference-v3/transaction-revert/cancel",
"source_domain": "docs.yuansfer.com",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "373088",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:F72BFAJHXFQ4HXXLQWQ2LLMIMYNEOYRV",
"WARC-Concurrent-To": "<urn:uuid:6af5d415-6ca3-4d37-bf9d-fa3037c0827a>",
"WARC-Date": "2023-02-05T10:35:59Z",
"WARC-IP-Address": "104.18.6.238",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YMZXVGGFYE7EQDQ47FDGCJBZG6RGIQNY",
"WARC-Record-ID": "<urn:uuid:7b8e7ef3-809f-4797-b582-b29306d3713b>",
"WARC-Target-URI": "https://docs.yuansfer.com/api-reference-v3/transaction-revert/cancel",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:08fbb28b-1eda-431a-ab9d-118ab7dc06ef>"
},
"warc_info": "isPartOf: CC-MAIN-2023-06\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January/February 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-197\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
14,
22,
25,
26,
33,
34,
39,
84,
92,
99,
108,
118,
123,
135,
142,
149,
175,
183,
190,
219,
228,
235,
289,
290,
304,
305,
315,
320,
332,
339,
346,
370,
379,
386,
434,
444,
451,
515,
522,
529,
555,
569,
576,
619,
624,
628,
633,
636,
690,
714,
735,
785,
824,
881,
887,
910,
912,
984,
1029,
1041,
1067,
1090,
1130,
1133,
1162,
1173,
1205,
1234,
1236,
1285,
1328,
1339,
1362,
1392,
1424,
1449,
1471,
1520,
1524,
1550,
1566,
1580,
1591,
1626,
1628,
1643,
1646,
1707,
1753,
1813,
1852,
1885,
1931,
1975,
1977,
2021,
2105,
2143,
2197,
2247,
2272
],
"line_end_idx": [
14,
22,
25,
26,
33,
34,
39,
84,
92,
99,
108,
118,
123,
135,
142,
149,
175,
183,
190,
219,
228,
235,
289,
290,
304,
305,
315,
320,
332,
339,
346,
370,
379,
386,
434,
444,
451,
515,
522,
529,
555,
569,
576,
619,
624,
628,
633,
636,
690,
714,
735,
785,
824,
881,
887,
910,
912,
984,
1029,
1041,
1067,
1090,
1130,
1133,
1162,
1173,
1205,
1234,
1236,
1285,
1328,
1339,
1362,
1392,
1424,
1449,
1471,
1520,
1524,
1550,
1566,
1580,
1591,
1626,
1628,
1643,
1646,
1707,
1753,
1813,
1852,
1885,
1931,
1975,
1977,
2021,
2105,
2143,
2197,
2247,
2272,
2273
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2273,
"ccnet_original_nlines": 101,
"rps_doc_curly_bracket": 0.004399470053613186,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.05942622944712639,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04098360985517502,
"rps_doc_frac_lines_end_with_ellipsis": 0.009803920052945614,
"rps_doc_frac_no_alph_words": 0.4795081913471222,
"rps_doc_frac_unique_words": 0.5939086079597473,
"rps_doc_mean_word_length": 8.502537727355957,
"rps_doc_num_sentences": 35,
"rps_doc_symbol_to_word_ratio": 0.002049179980531335,
"rps_doc_unigram_entropy": 4.512161731719971,
"rps_doc_word_count": 197,
"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.03223881125450134,
"rps_doc_frac_chars_top_3gram": 0.028656719252467155,
"rps_doc_frac_chars_top_4gram": 0.027462689206004143,
"rps_doc_books_importance": -194.22711181640625,
"rps_doc_books_importance_length_correction": -194.22711181640625,
"rps_doc_openwebtext_importance": -128.43565368652344,
"rps_doc_openwebtext_importance_length_correction": -128.43565368652344,
"rps_doc_wikipedia_importance": -97.48914337158203,
"rps_doc_wikipedia_importance_length_correction": -97.48914337158203
},
"fasttext": {
"dclm": 0.8091226816177368,
"english": 0.3622302711009979,
"fineweb_edu_approx": 3.3145909309387207,
"eai_general_math": 0.048420850187540054,
"eai_open_web_math": 0.017788469791412354,
"eai_web_code": 0.6104226112365723
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.85",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-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
|
-4,549,725,866,144,897,000 |
AppleTV
Discussion in 'iPod' started by AtHomeBoy_2000, Jan 9, 2007.
1. AtHomeBoy_2000 macrumors 6502a
AtHomeBoy_2000
Joined:
Feb 3, 2005
#1
I didnt see any threads about this in here. your thoughts?
2. flopticalcube macrumors G4
flopticalcube
Joined:
Sep 7, 2006
Location:
In the velcro closure of America's Hat
#2
Underwhelmed. Yet another box to sit under my TV. I could get a long VGA cable from my MB and do the same thing. iPhone looks good but JUNE! The only impressive item is the Airport Extreme but it didn't even get a mention.
3. iW00t macrumors 68040
iW00t
Joined:
Nov 7, 2006
Location:
Defenders of Apple Guild
#3
The AppleTV is overengineered and under featured.
So it actually has its own dedicated Intel processor and hard drive, but who cares?! It only support 2 video formats!
Pfft.
Can't wait for some Linux fanboi to hack one of these and produce a new open source firmware with more functionality.
4. matticus008 macrumors 68040
matticus008
Joined:
Jan 16, 2005
Location:
Bay Area, CA
#4
Slim chance of that. The Linux gang can't handle HD hardware yet--and the Apple TV outputs over component or HDMI (i.e. it requires at least an EDTV; no analog SDTVs are supported). Given the fact that it's ready to go as a full HD set-top box, it's actually quite cheap, if you're willing to accept the limitations of the formats it can play.
It is NOT a Slingbox. If you're just looking to pipe some video output to your TV, this isn't it. This doesn't require you wasting desktop space or using your computer's keyboard/mouse/remote to work through it. At the very least, it's a portable iTunes client with full digital and HD support, which is WELL worth the price of an iPod.
5. thejakill macrumors 6502
thejakill
Joined:
Sep 8, 2005
#5
lately i've been watching movies that i ripped and transferred to my ipod. i connect the ipod to the tv and it looks pretty good. not as good as DVD, but good enough for me. i like that i can keep lots of movies in my 60 gig hard drive.
for music, i use my bose quiet comfort 2 headphones. for pix, the macbook screen is good enough for me.
now, i could spend 300 bucks and get all these together on my tv. not sure if it's worth it.
6. macphin macrumors member
Joined:
Feb 26, 2006
#6
does anyone know, can apple tv play radio which are in my iTunes? this is really important to me, because I often listen radio on my mac, but it would be cool to do that on my music center?
why does it have an optical audio out? Is it only for stereo? I thought that optical audio does 5.1 out?
Share This Page
|
{
"url": "https://forums.macrumors.com/threads/appletv.267905/",
"source_domain": "forums.macrumors.com",
"snapshot_id": "crawl=CC-MAIN-2017-26",
"warc_metadata": {
"Content-Length": "151298",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:R3PPWFZMO24KQRIDWYRE46SLJ7A4RFFH",
"WARC-Concurrent-To": "<urn:uuid:a8e4665a-a425-4621-b515-bf9fde4bde86>",
"WARC-Date": "2017-06-22T20:52:05Z",
"WARC-IP-Address": "162.254.116.239",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MZUOAHGEHAZ545SRCJU5D427QW3VQJER",
"WARC-Record-ID": "<urn:uuid:e11afd15-6d90-446a-8a0a-a868379069d6>",
"WARC-Target-URI": "https://forums.macrumors.com/threads/appletv.267905/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:eacc5a58-c5bd-4c62-bc82-a20e086f58a4>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-145-169-209.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
8,
9,
70,
71,
107,
108,
127,
128,
140,
156,
163,
226,
232,
264,
265,
283,
284,
296,
312,
326,
369,
376,
603,
609,
636,
637,
647,
648,
660,
676,
690,
719,
726,
780,
781,
903,
904,
914,
915,
1037,
1043,
1076,
1077,
1093,
1094,
1106,
1123,
1137,
1154,
1161,
1509,
1510,
1851,
1857,
1887,
1888,
1902,
1903,
1915,
1931,
1938,
2179,
2180,
2288,
2289,
2386,
2392,
2422,
2423,
2435,
2452,
2459,
2653,
2654,
2763,
2769,
2770
],
"line_end_idx": [
8,
9,
70,
71,
107,
108,
127,
128,
140,
156,
163,
226,
232,
264,
265,
283,
284,
296,
312,
326,
369,
376,
603,
609,
636,
637,
647,
648,
660,
676,
690,
719,
726,
780,
781,
903,
904,
914,
915,
1037,
1043,
1076,
1077,
1093,
1094,
1106,
1123,
1137,
1154,
1161,
1509,
1510,
1851,
1857,
1887,
1888,
1902,
1903,
1915,
1931,
1938,
2179,
2180,
2288,
2289,
2386,
2392,
2422,
2423,
2435,
2452,
2459,
2653,
2654,
2763,
2769,
2770,
2785
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2785,
"ccnet_original_nlines": 77,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.39115646481513977,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03401361033320427,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2312925159931183,
"rps_doc_frac_unique_words": 0.5460385680198669,
"rps_doc_mean_word_length": 4.229122161865234,
"rps_doc_num_sentences": 43,
"rps_doc_symbol_to_word_ratio": 0.010204079560935497,
"rps_doc_unigram_entropy": 5.228303909301758,
"rps_doc_word_count": 467,
"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.006075949873775244,
"rps_doc_frac_chars_top_3gram": 0.013164560310542583,
"rps_doc_frac_chars_top_4gram": 0.01518987026065588,
"rps_doc_books_importance": -288.6614685058594,
"rps_doc_books_importance_length_correction": -288.6614685058594,
"rps_doc_openwebtext_importance": -187.42581176757812,
"rps_doc_openwebtext_importance_length_correction": -187.42581176757812,
"rps_doc_wikipedia_importance": -134.07762145996094,
"rps_doc_wikipedia_importance_length_correction": -134.07762145996094
},
"fasttext": {
"dclm": 0.04992460831999779,
"english": 0.9538520574569702,
"fineweb_edu_approx": 1.0705480575561523,
"eai_general_math": 0.015880169346928596,
"eai_open_web_math": 0.14815974235534668,
"eai_web_code": 0.0004949599970132113
}
}
|
{
"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.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,504,578,735,332,347,600 |
Date Filter
(merrillbeth) #1
I can't seem to get this date filter to work:
"logstash.version"=>"6.1.0"
Elasticsearch 5.6.3
filter{
grok {
patterns_dir => ["/etc/logstash/patterns"]
match => [ "message", "%{LOGTIMESTAMP:logTimestamp}" ]
}
date {
locale => "en"
match => ["logTimestamp", "MMM D HH:mm:ss"]
target => "logTimestamp"
}
}
Log entry is like so:
{
"_index": "logstash-2018.02.02",
"_type": "doc",
"_id": "AWFT0dubiPn6kkLXSbjY",
"_score": 1,
"_source": {
"logTimestamp": "Feb 1 23:52:34",
"@version": "1",
"message": "{"@timestamp":"2018-02-01T23:52:34.763Z","@metadata":
{"beat":"filebeat","type":"doc","version":"6.1.0","topic":"Capsule_logs"},"source":"/data_0/logs/company/sandbox-dal-9-data.company.com/postgresql343/postgresql343.log","offset":12112324,"message":"Feb 1 23:52:34 bluemix-sandbox-dal-9-data.company.com postgresql343: haproxy_status.23 | 2018/02/01 23:52:34 hastatus response time 12.295422ms; cmd time 12.26587ms; response code 503","tags":["postgresql"],"prospector":{"type":"log"},"beat":{"name":"syslog.internal","hostname":"syslog.internal","version":"6.1.0"}}",
"@timestamp": "2018-02-02T00:01:57.337Z",
"tags": [
"_dateparsefailure"
]
},
"fields": {
"@timestamp": [
1517529717337
]
}
}
I want to use the timestamp for the logs found in the message. Why do I keep getting the _dateparsefailure ? The grok pattern works and logTimestamp gets dumped into kibana as a string.
Thanks!
(Erik W) #2
Try "en-US" or "en_US" for locale.
(merrillbeth) #3
That causes the date filter to ignore the logTimestamp and match the @timestamp attribute.
(Erik W) #4
Are you using a JDBC input filter? Related Issue?
(Magnus Bäck) #5
When the date filter can't parse a string it'll log clues about what it's having problems with.
match => ["logTimestamp", "MMM D HH:mm:ss"]
"D" is day-of-year. Use "d" instead. I think you'll also need to specify a second pattern with "dd" instead of "d".
(merrillbeth) #6
Hi. I've tried this as well but am still having the issue where the match string now matches the Time attribute rather than the log timestamp. My current config looks like so:
input {
kafka {
bootstrap_servers => "kafka02.company.net:9093"
topics => ["Capsule_logs"]
}
}
filter{
grok {
patterns_dir => ["/etc/logstash/patterns"]
match => [ "message", "%{LOGTIMESTAMP:logTimestamp}" ]
}
date {
timezone => "UTC"
match => ["logTimestamp", "MMM d HH:mm:ss"]
target => "logTimestamp"
}
}
output {
elasticsearch {
hosts => ["https://user:password.deployment-logs.company.com:17825/"]
ssl => true
ssl_certificate_verification => true
}
}
I tried the locale parameter which caused a dateparse error. I realize once this is working I'll have to add an additional match parameter for dd.
Thanks!
(merrillbeth) #7
Hey. That's a good thought. I've updated the GH issue.
(Magnus Bäck) #8
I've tried this as well but am still having the issue where the match string now matches the Time attribute rather than the log timestamp.
What do you mean? Please show examples instead of describing the results.
(merrillbeth) #9
filter:
filter{
grok {
patterns_dir => ["/etc/logstash/patterns"]
match => [ "message", "%{LOGTIMESTAMP:logTimestamp}"]
}
date {
match => ["logTimestamp", "MMM dd HH:mm:ss"]
target => "logTimestamp"
}
}
Pattern:
LOGTIMESTAMP %{MONTH} +%{MONTHDAY} %{TIME}
LogSample:
{"@timestamp":"2018-02-12T20:53:59.319Z","@metadata":{"beat":"filebeat","type":"doc","version":"6.1.0","topic":"Capsule_logs"},"message":"Feb 12 16:46:59 server.company.com mongodb315: mongos.24 | 2018-02-12T16:46:59.472+0000 I SHARDING [Balancer] distributed lock with ts: 5a81c503a6805c4336799218' unlocked.","tags":["mongodb"],"prospector":{"type":"log"},"beat":{"name":"syslog.internal","hostname":"syslog.internal","version":"6.1.0"},"source":"/data_0/logs/compose/server.company.com/mongodb315/mongodb315.log","offset":1337412}
logTimestamp is matched:
"logTimestamp": "Feb 12 16:46:59"
But with a _dateparsefailure. I don't understand why the date filter fails to match even though the patterns match.
(Magnus Bäck) #10
If the date filter fails it'll log a message that points to the error.
(merrillbeth) #11
With Logstash logging set to debug. In the logs what I see is:
[2018-02-13T00:16:11,475][DEBUG][logstash.pipeline ] output received {"event"=>{"tags"=>["_dateparsefailure"], "message"=>"{"@timestamp":"2018-02-13T00:16:07.784Z","@metadata":{"beat":"filebeat","type":"doc","version":"6.1.0","topic":"Capsule_logs"},"source":"/data_0/logs/company.com/postgresql463/postgresql463.log","offset":8754897,"message":"Feb 12 23:25:22 company.com postgresql463: postgres.24 | Updating the TTL for primary.","tags":["postgresql"],"prospector":{"type":"log"},"beat":{"name":"syslog.internal","hostname":"syslog.internal","version":"6.1.0"}}", "@version"=>"1", "@timestamp"=>2018-02-13T00:16:10.933Z, "logTimestamp"=>"Feb 12 23:25:22"}}
The logTimestamp is being set but the event is being tagged with a dateparsefailure. I don't see anything specifically noting why this is happening, just that it is happening.
(system) #12
This topic was automatically closed 28 days after the last reply. New replies are no longer allowed.
|
{
"url": "https://discuss.elastic.co/t/date-filter/118128",
"source_domain": "discuss.elastic.co",
"snapshot_id": "crawl=CC-MAIN-2018-51",
"warc_metadata": {
"Content-Length": "23981",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DQKWS26CLFTKSK3L6VPFCDASYRBSK6UF",
"WARC-Concurrent-To": "<urn:uuid:efe609a7-4f56-4970-85f5-0e5626fc6b19>",
"WARC-Date": "2018-12-16T15:53:23Z",
"WARC-IP-Address": "64.71.168.217",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LMXL6GR42CFKJUE3EIRKNZRB2YCQWYIW",
"WARC-Record-ID": "<urn:uuid:1c1b2b8e-ad7d-48b4-ab17-9cb2ea3dd26f>",
"WARC-Target-URI": "https://discuss.elastic.co/t/date-filter/118128",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b708e935-cd33-41b6-99b9-5d36a048330d>"
},
"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-168-82-48.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,
12,
13,
14,
31,
32,
78,
79,
107,
127,
135,
142,
185,
240,
242,
249,
264,
308,
333,
335,
337,
338,
360,
362,
395,
411,
442,
455,
468,
502,
519,
585,
586,
1103,
1145,
1155,
1175,
1177,
1180,
1192,
1208,
1222,
1224,
1226,
1228,
1229,
1415,
1416,
1424,
1425,
1426,
1438,
1439,
1474,
1475,
1476,
1493,
1494,
1585,
1586,
1587,
1599,
1600,
1650,
1651,
1652,
1669,
1670,
1766,
1767,
1811,
1812,
1928,
1929,
1930,
1947,
1948,
2124,
2132,
2140,
2188,
2215,
2217,
2219,
2220,
2228,
2235,
2278,
2333,
2335,
2336,
2347,
2373,
2426,
2459,
2465,
2467,
2468,
2477,
2493,
2563,
2575,
2612,
2614,
2616,
2617,
2764,
2765,
2773,
2774,
2775,
2792,
2793,
2848,
2849,
2850,
2867,
2868,
3007,
3008,
3082,
3083,
3084,
3101,
3102,
3110,
3118,
3125,
3168,
3222,
3224,
3231,
3276,
3301,
3303,
3305,
3306,
3315,
3316,
3359,
3360,
3371,
3905,
3906,
3931,
3932,
3966,
3967,
4083,
4084,
4085,
4103,
4104,
4175,
4176,
4177,
4195,
4196,
4259,
4920,
4921,
5097,
5098,
5099,
5112,
5113
],
"line_end_idx": [
12,
13,
14,
31,
32,
78,
79,
107,
127,
135,
142,
185,
240,
242,
249,
264,
308,
333,
335,
337,
338,
360,
362,
395,
411,
442,
455,
468,
502,
519,
585,
586,
1103,
1145,
1155,
1175,
1177,
1180,
1192,
1208,
1222,
1224,
1226,
1228,
1229,
1415,
1416,
1424,
1425,
1426,
1438,
1439,
1474,
1475,
1476,
1493,
1494,
1585,
1586,
1587,
1599,
1600,
1650,
1651,
1652,
1669,
1670,
1766,
1767,
1811,
1812,
1928,
1929,
1930,
1947,
1948,
2124,
2132,
2140,
2188,
2215,
2217,
2219,
2220,
2228,
2235,
2278,
2333,
2335,
2336,
2347,
2373,
2426,
2459,
2465,
2467,
2468,
2477,
2493,
2563,
2575,
2612,
2614,
2616,
2617,
2764,
2765,
2773,
2774,
2775,
2792,
2793,
2848,
2849,
2850,
2867,
2868,
3007,
3008,
3082,
3083,
3084,
3101,
3102,
3110,
3118,
3125,
3168,
3222,
3224,
3231,
3276,
3301,
3303,
3305,
3306,
3315,
3316,
3359,
3360,
3371,
3905,
3906,
3931,
3932,
3966,
3967,
4083,
4084,
4085,
4103,
4104,
4175,
4176,
4177,
4195,
4196,
4259,
4920,
4921,
5097,
5098,
5099,
5112,
5113,
5213
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5213,
"ccnet_original_nlines": 165,
"rps_doc_curly_bracket": 0.013811619952321053,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.14064915478229523,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04095827043056488,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5030912160873413,
"rps_doc_frac_unique_words": 0.5039370059967041,
"rps_doc_mean_word_length": 7.226377964019775,
"rps_doc_num_sentences": 88,
"rps_doc_symbol_to_word_ratio": 0.009273570030927658,
"rps_doc_unigram_entropy": 5.136836528778076,
"rps_doc_word_count": 508,
"rps_doc_frac_chars_dupe_10grams": 0.061018798500299454,
"rps_doc_frac_chars_dupe_5grams": 0.17243258655071259,
"rps_doc_frac_chars_dupe_6grams": 0.1509125530719757,
"rps_doc_frac_chars_dupe_7grams": 0.1509125530719757,
"rps_doc_frac_chars_dupe_8grams": 0.1263960748910904,
"rps_doc_frac_chars_dupe_9grams": 0.061018798500299454,
"rps_doc_frac_chars_top_2gram": 0.01634432002902031,
"rps_doc_frac_chars_top_3gram": 0.02179243043065071,
"rps_doc_frac_chars_top_4gram": 0.03268864005804062,
"rps_doc_books_importance": -657.3263549804688,
"rps_doc_books_importance_length_correction": -657.3263549804688,
"rps_doc_openwebtext_importance": -323.2994384765625,
"rps_doc_openwebtext_importance_length_correction": -323.2994384765625,
"rps_doc_wikipedia_importance": -274.8098449707031,
"rps_doc_wikipedia_importance_length_correction": -274.8098449707031
},
"fasttext": {
"dclm": 0.8608313798904419,
"english": 0.7082669734954834,
"fineweb_edu_approx": 0.9195256233215332,
"eai_general_math": 0.2950327396392822,
"eai_open_web_math": 0.18217158317565918,
"eai_web_code": 0.8463706970214844
}
}
|
{
"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": "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": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
5,070,470,238,027,066,000 |
Connect public, paid and private patent data with Google Patents Public Datasets
Natural language processing for a location-based services system
Download PDF
Info
Publication number
US7437295B2
US7437295B2 US10131898 US13189802A US7437295B2 US 7437295 B2 US7437295 B2 US 7437295B2 US 10131898 US10131898 US 10131898 US 13189802 A US13189802 A US 13189802A US 7437295 B2 US7437295 B2 US 7437295B2
Authority
US
Grant status
Grant
Patent type
Prior art keywords
application
remote
terminal
request
location
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active, expires
Application number
US10131898
Other versions
US20040243417A9 (en )
US20020161587A1 (en )
Inventor
Ashton F. Pitts, III
Stephen L. Dempsen
Vinny Wai-yan Che
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Accenture Global Services Ltd
Original Assignee
Accenture LLP
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Grant date
Links
Images
Classifications
• GPHYSICS
• G06COMPUTING; CALCULATING; COUNTING
• G06FELECTRICAL DIGITAL DATA PROCESSING
• G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
• G06F17/30Information retrieval; Database structures therefor ; File system structures therefor
• G06F17/30286Information retrieval; Database structures therefor ; File system structures therefor in structured data stores
• G06F17/30386Retrieval requests
• G06F17/30424Query processing
• G06F17/30427Query translation
• G06F17/3043Translation of natural language queries to structured queries
• GPHYSICS
• G06COMPUTING; CALCULATING; COUNTING
• G06FELECTRICAL DIGITAL DATA PROCESSING
• G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
• G06F17/30Information retrieval; Database structures therefor ; File system structures therefor
• G06F17/3061Information retrieval; Database structures therefor ; File system structures therefor of unstructured textual data
• G06F17/30634Querying
• G06F17/30657Query processing
• G06F17/30675Query execution
• G06F17/30684Query execution using natural language analysis
• GPHYSICS
• G06COMPUTING; CALCULATING; COUNTING
• G06FELECTRICAL DIGITAL DATA PROCESSING
• G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
• G06F17/30Information retrieval; Database structures therefor ; File system structures therefor
• G06F17/30861Retrieval from the Internet, e.g. browsers
• G06F17/30864Retrieval from the Internet, e.g. browsers by querying, e.g. search engines or meta-search engines, crawling techniques, push systems
• G06F17/3087Spatially dependent indexing and retrieval, e.g. location dependent results to queries
• GPHYSICS
• G06COMPUTING; CALCULATING; COUNTING
• G06QDATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
• G06Q10/00Administration; Management
• G06Q10/06Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
• GPHYSICS
• G06COMPUTING; CALCULATING; COUNTING
• G06QDATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
• G06Q30/00Commerce, e.g. shopping or e-commerce
• G06Q30/02Marketing, e.g. market research and analysis, surveying, promotions, advertising, buyer profiling, customer management or rewards; Price estimation or determination
• GPHYSICS
• G10MUSICAL INSTRUMENTS; ACOUSTICS
• G10LSPEECH ANALYSIS OR SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING; SPEECH OR AUDIO CODING OR DECODING
• G10L15/00Speech recognition
• G10L15/08Speech classification or search
• G10L15/18Speech classification or search using natural language modelling
• G10L15/1822Parsing for meaning understanding
• HELECTRICITY
• H04ELECTRIC COMMUNICATION TECHNIQUE
• H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
• H04L67/00Network-specific arrangements or communication protocols supporting networked applications
• H04L67/18Network-specific arrangements or communication protocols supporting networked applications in which the network application is adapted for the location of the user terminal
• HELECTRICITY
• H04ELECTRIC COMMUNICATION TECHNIQUE
• H04MTELEPHONIC COMMUNICATION
• H04M3/00Automatic or semi-automatic exchanges
• H04M3/42Systems providing special services or facilities to subscribers
• H04M3/42204Arrangements at the exchange for service or number selection by voice
• HELECTRICITY
• H04ELECTRIC COMMUNICATION TECHNIQUE
• H04MTELEPHONIC COMMUNICATION
• H04M3/00Automatic or semi-automatic exchanges
• H04M3/42Systems providing special services or facilities to subscribers
• H04M3/42348Location-based services which utilize the location information of a target
• HELECTRICITY
• H04ELECTRIC COMMUNICATION TECHNIQUE
• H04MTELEPHONIC COMMUNICATION
• H04M3/00Automatic or semi-automatic exchanges
• H04M3/42Systems providing special services or facilities to subscribers
• H04M3/487Arrangements for providing information services, e.g. recorded voice services, time announcements
• H04M3/493Interactive information services, e.g. directory enquiries ; Arrangements therefor, e.g. interactive voice response [IVR] systems or voice portals
• H04M3/4936Speech interaction details
• HELECTRICITY
• H04ELECTRIC COMMUNICATION TECHNIQUE
• H04WWIRELESS COMMUNICATIONS NETWORKS
• H04W4/00Mobile application services or facilities specially adapted for wireless communication networks
• H04W4/02Mobile application Services making use of the location of users or terminals, e.g. OMA SUPL, OMA MLP or 3GPP LCS
• HELECTRICITY
• H04ELECTRIC COMMUNICATION TECHNIQUE
• H04WWIRELESS COMMUNICATIONS NETWORKS
• H04W4/00Mobile application services or facilities specially adapted for wireless communication networks
• H04W4/20Signalling of application services or auxiliary data signalling, i.e. transmitting data via a non-traffic channel
• GPHYSICS
• G10MUSICAL INSTRUMENTS; ACOUSTICS
• G10LSPEECH ANALYSIS OR SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING; SPEECH OR AUDIO CODING OR DECODING
• G10L15/00Speech recognition
• G10L15/26Speech to text systems
• GPHYSICS
• G10MUSICAL INSTRUMENTS; ACOUSTICS
• G10LSPEECH ANALYSIS OR SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING; SPEECH OR AUDIO CODING OR DECODING
• G10L15/00Speech recognition
• G10L15/28Constructional details of speech recognition systems
• G10L15/30Distributed recognition, e.g. in client-server systems, for mobile phones or network applications
• HELECTRICITY
• H04ELECTRIC COMMUNICATION TECHNIQUE
• H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
• H04L67/00Network-specific arrangements or communication protocols supporting networked applications
• H04L67/30Network-specific arrangements or communication protocols supporting networked applications involving profiles
• H04L67/306User profiles
• HELECTRICITY
• H04ELECTRIC COMMUNICATION TECHNIQUE
• H04MTELEPHONIC COMMUNICATION
• H04M2201/00Electronic components, circuits, software, systems or apparatus used in telephone systems
• H04M2201/40Electronic components, circuits, software, systems or apparatus used in telephone systems using speech recognition
• HELECTRICITY
• H04ELECTRIC COMMUNICATION TECHNIQUE
• H04MTELEPHONIC COMMUNICATION
• H04M2207/00Type of exchange or network, i.e. telephonic medium, in which the telephonic communication takes place
• H04M2207/18Type of exchange or network, i.e. telephonic medium, in which the telephonic communication takes place wireless networks
• HELECTRICITY
• H04ELECTRIC COMMUNICATION TECHNIQUE
• H04MTELEPHONIC COMMUNICATION
• H04M2242/00Special services or facilities
• H04M2242/15Information service where the information is dependent on the location of the subscriber
• HELECTRICITY
• H04ELECTRIC COMMUNICATION TECHNIQUE
• H04MTELEPHONIC COMMUNICATION
• H04M2242/00Special services or facilities
• H04M2242/30Determination of the location of a subscriber
Abstract
A method and system for providing natural language processing in a communication system is disclosed. A voice request is generated with a remote terminal that is transmitted to a base station. A speech recognition application is then used to identify a plurality of words that are contained in the voice request. After the words are identified, a grammar associated with each word is also identified. Once the grammars have been identified, each word is categorized into a respective grammar category. A structured response is then generated to the voice request with a response generation application.
Description
This application is a continuation-in-part of U.S. application Ser. No. 09/946,111, filed Sep. 4, 2001, now U.S. Pat. No. 6,994,447, issued Sep. 13, 2005. This application claims the benefit of the filing date under 35 U.S.C. §119(e) of U.S. Provisional Application Ser. No. 60/286,916, filed Apr. 27, 2001. In addition, the following commonly owned patents and patent applications, some of which are incorporated by reference in the present application, are related to this application: U.S. patent application Ser. No. 10/133,536, filed Apr. 26, 2002. entitled ADVERTISING CAMPAIGN BUSINESS LISTING MANAGEMENT FOR A LOCATION-BASED SERVICES SYSTEM; U.S. Pat. No. 6,848,542 B2, issued Feb. 1, 2005, entitled METHOD FOR PASSIVE MINING OF USAGE INFORMATION IN A LOCATION-BASED SERVICES SYSTEM: U.S. patent application Ser. No. 10/133,118, filed Apr. 26, 2002, entitled ROUTING CALL FAILURES IN A LOCATION-BASED SERVICES SYSTEM: U.S. patent application Ser. No. 10/134,405, entitled TRACKING PURCHASES IN A LOCATION-BASED SERVICES SYSTEM: and U.S. patent application Ser. No. 11/007,761, filed Dec. 8, 2004, entitled PASSIVE MINING OF USAGE INFORMATION IN A LOCATION-BASED SERVICES SYSTEM.
FIELD OF THE INVENTION
The present invention relates generally to a natural language processing application and, more particularly, to providing an enhanced natural language processing application for interpreting structured requests for products and services in a location-based services system.
BACKGROUND OF THE INVENTION
Wireless communication devices have recently evolved from a technology used by an elite segment of the population to a technology that is used by the masses. In the year 2000, it has been estimated that well over 100 million people in the United States alone subscribed to at least one type of wireless communication service. Worldwide, the number of wireless communication device users has reached a staggering number and is growing all of the time. In the near future, it is envisioned that almost everyone will own or use some sort of wireless communication device that is capable of performing a variety of functions.
In addition to traditional wireless communication devices, many different types of portable electronic devices are in use today. In particular, notebook computers, palm-top computers, and personal digital assistants (PDA) are commonplace. The use of wireless communication devices is widespread and it is expected that in the near future combined mobile telephone/PDA devices will be widely used by the masses. Currently, most of these devices are only used by a small segment of the population due, in large part, to the fact that there are a limited number of applications and services available for such devices.
The Internet has become a widely used medium for providing business information in a variety of forms that are targeted to various types of individuals and businesses. Generally speaking, one of the problems associated with searching for business information on specific products and services using the Internet is being able to locate relevant business information for products and services that are available in a geographic area that is located near the user. As such, a need exists for a way to provide a broad range of business information and content to wireless communication devices and workstations that are based on the respective geographic location of the communication device at the time the information is requested.
In addition, most users of wireless communication devices would like the ability to use natural language when requesting information and content. Typical speech recognition applications require a developer to create an all-encompassing grammar that itemizes each possible way a person could utter any given concept or request. While this enables a system to recognize content contained in an utterance, it places a significant burden on the developer both before and after the system is deployed. As such, a need exists for a natural language processing application that does not require significant setup and maintenance. Additionally, due to the various speech patterns and utterances, it is currently impossible to obtain a near 100% successful recognition of utterances. While current speech recognition engines are tuned to interpret sound, they cannot interpret meaning or understanding of context.
SUMMARY OF THE PRESENT INVENTION
A preferred embodiment of the present invention discloses a method of providing natural language processing in a communication system. In this preferred embodiment, a voice request is generated with a remote terminal that is transmitted to a base station. Once the voice request is sent to the base station, each word contained in the voice request is identified with a speech recognition application. After the words are identified with the speech reconition application, a grammar that is associated with each word is identified with a natural language processing application. Once the words and their associated grammars have been identified, each word is categorized into a respective grammar category. A structured response to the voice request is then generated with a response generation application.
In this preferred embodiment of the present invention, a structured request is generated by the natural language processing application that is based on the categorization of the words into grammar categories as well as the identification of the words. After the structured request is generated, it is transmitted to a response generation application that searches for matches to the structured request in a database of products and services. Another aspect of the present invention involves the narrowing of structured responses that are generated by the response generation application to a specific geographic area in which the remote terminal is located. As such, a user of the remote terminal does not receive responses to voice requests that are for products or services that are not located in a geographic region near the user. For example, a person in Atlanta, Georgia does not particularly care if a retail store in California is running a special on an item that he or she is interested in purchasing near his/her geographic location.
As generally set forth above, the voice request is a request for a particular product or service. As used herein, the term “product” should be broadly construed to also include services. In the preferred embodiment, the structured responses that are generated to respond to the voice requests may either take the form of voice responses or text messages that may include images and/or sound files. After the voice response or the text message is generated, it is transmitted to the remote terminal so that the user of the remote terminal can interact with the structured response.
Coupling a natural language processing application to the location-based services system helps to bridge the gap between speech recognition and processing structured requests by improving speech recognition not only through the recognition of “utterances” but by also inferring the correct question and resulting answer trough the use of natural language. Natural language processing improves user experience by inferring, through the use of linguistics, the word(s) that were not recognized, thus enabling the resulting application to retrieve a more relevant answer.
Another preferred embodiment of the present invention discloses a wireless communication system with natural language processing. In this embodiment of the present invention, a remote terminal is connected to a base station, wherein a user of the remote terminal is capable of generating a voice request that is transmitted to the base station. Once the voice request reaches the base station, it is preferentially transmitted to a speech recognition application that is connected to the base station. During operation, the speech recognition application identifies each word contained in the voice request. After the words are identified by the speech recognition application, a natural language processing application that is connected to the speech recognition application generates a structured request that is based on the words contained in the voice request. A response generation application is connected to the natural language processing application and is responsible for generating a structured response to the structured request.
In this preferred embodiment of the present invention, the natural language processing application categorizes the words contained in the voice request into a respective one of a plurality of grammar categories. Once the words are placed in the grammar categories, they are used by the response generation application to locate a product identified in the voice request, thereby responding to the structured request. The structured response can be transmitted to the remote terminal as a voice response or a text message. If a voice response is used, a voice synthesis application that is connected to the response generation application generates the voice response, which is based on the structured response that is generated by the response generation application.
Further objects and advantages of the present invention will be apparent from the following description, reference being made to the accompanying drawings wherein preferred embodiments of the invention are clearly illustrated.
BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 illustrates a preferred embodiment of the location-based services system.
FIG. 2 is a flow chart illustrating the process steps performed by the location-based application server when processing structured requests.
FIG. 3 illustrates the varying ways user requests may be made and provided as an input to the speech recognition application.
FIG. 4 illustrates the grammars associated with the words of the user requests depicted in FIG. 3.
FIG. 5 illustrates how the grammars from the user requests generalize down to a set of grammars.
FIG. 6 illustrates the grammar categories for which each word falls into from the user requests depicted in FIG. 3.
DETAILED DESCRIPTION OF THE PRESENTLY PREFERRED EMBODIMENTS OF THE INVENTION
The preferred embodiment of the present invention is used in a location-based services system that provides content to communication devices through a variety of communication networks. Referring to FIG. 1, the preferred location-based services system 10 takes advantage of the geographic location of a remote terminal 12 to provide geographically targeted services to the remote terminal 12. Remote terminals 12 that subscribe to the location-based services system 10 are capable of receiving information from a broad range of business and service providers that are located in a geographic region that is close to the remote terminal 12 and, thus, the user.
As illustrated in FIG. 1, one preferred embodiment of the location-based services system 10 includes a remote terminal 12 that is connected to a wireless communication system 14 using one of several available and commonly used communication protocols. As illustrated, the remote terminal 12 is connected to a base station 16 of the wireless communication system 14, which transmits and receives radio signals to the remote terminal 12 during operation. Those skilled in the art would recognize that although only one base station 16 is illustrated in FIG. 1, several base stations 16 are actually used to make-up the preferred wireless communication system 14. Ideally, the preferred wireless communication system 14 would cover a wide geographic region, such as, by way of example only, the entire United States.
In the preferred embodiment of the present invention, the remote terminal 12 is capable of sending a digital input signal to the base station 16. The term digital input signal should be broadly construed to include voice signals that are generated by a user of the remote terminal 12. Preferentially, the wireless communication system 14 is a digital communication system that uses one of several different methods of providing wireless digital communication between the remote terminals 12 and the base stations 16. The wireless communication system 14 can use frequency division duplexing (FDD) or time division duplexing (TDD) to allocate for the two directions of transmission between the remote terminal 12 and the base station 16.
In order to provide multiple access methods to the remote terminals 12, which refers to the method of creating multiple channels for each transmission direction, one of several different types of multiple access methods may be used in the present invention. Three preferred types of multiple access methods that might be used include: frequency division multiple access (FDMA); time division multiple access (TDMA); and/or code division multiple access (CDMA). Those skilled in the art would recognize that the present invention could readily be adapted to take advantage of other multiple access methods as well.
As further illustrated in FIG. 1, in the preferred embodiment of the present invention the base station 16 of the wireless communication system 14 is connected to a public switched telephone network (PSTN) 18 by a public switch 20. As known to those skilled in the art, the PSTN 18 is a worldwide voice telephone network that is used to allow various communication devices to communicate with each other. Although the preferred PSTN 18 is a digital system, the present invention may be adapted for use on analog systems as well to accommodate geographic regions that might be underdeveloped or not serviced by a digital system.
The public switch 20 transfers the voice signals that are received from the base station 16 to a private branch exchange (PBX) 22. The public switch 20 is connected to the PBX 22, which, as generally known in the art, is a telephone switching system that is used to interconnect various telephone extensions to each other. In the preferred embodiment of the present invention, the PBX 22 uses all-digital methods for switching and is capable of supporting digital remote terminals and telephones and analog remote terminals and telephones. As set forth in greater detail below, in the preferred embodiment, the PBX 22 is connected to a server of the location-based services system 10, which is a form of a digital remote terminal.
Referring to FIG. 1, in this embodiment of the present invention, the PBX 22 is connected to at least one speech recognition sewer 24. The speech recognition server 24 contains at least one speech recognition application that is operable to recognize the respective words that are contained in the voice signals that are received from the PBX 22. As set forth in greater detail below, a resulting output is generated by the speech recognition application that is used by a natural language processing application.
The speech recognition server 24 is connected to at least one natural language processing server 26 that includes at least one natural language processing application that processes the identified words contained in the voice signals to ascertain the meaning of the words that are contained in the voice signals. As such, during operation, the speech recognition server 24 identifies or recognizes the particular words that are contained in the voice signals and the natural language processing server 26 interprets the meaning of the recognized words of the voice signals that are originally generated from the remote terminal 12. The natural language processing application may be located on the speech recognition server 24 in other embodiments of the present invention, but, in an effort to increase the level of performance, would preferentially be located on a separate server or a separate set of servers.
The natural language processing server 26 is connected to at least one location-based application server 28. As set forth in detail below, the location-based application server 28 is programmed to provide responsive information to the remote terminals 12 that has been requested by a respective user of the remote terminal 12. Generally speaking, the location-based application server 28 is used to retrieve and pass on location-based information to the remote terminals 12 in various data formats. The type of information provided to the remote terminals 12 varies depending on the specific nature of the information that has been requested from the user and the geographic location of the remote terminal 12.
During operation, after the meaning of the words in the voice signals are interpreted, the natural language processing server 26 is programmed to create a structured request that is sent to the location-based application server 28. In response to the structured request, the location-based application server 28 generates a structured response that is sent to the remote terminal 12. As set forth in greater detail below, the exact nature of the information sent in the structured response depends on the specific request that is made by a particular user of the remote terminal 12.
If an analog voice signal is used, although not illustrated in FIG. 1, at least one digital signal processor server could be used to convert the analog signal into a digital signal that the speech recognition server 24 can process and interpret using the speech recognition applications. In this respective embodiment, the digital signal processor server is preferentially connected between the speech recognition server 24 and the PBX 22. Those skilled in the art would recognize that the speech recognition server 24 might also be designed to perform the functions of the digital signal processor server in other embodiments of the present invention.
Each remote terminal 12 also sends a unique remote terminal identifier to the base station 16 while communicating with the base station 16 of the wireless communication system 14. The remote terminal identifier is preferentially attached to each voice signal as it passes through the location-based services system 10 so that the system can keep track of which respective remote terminal 12 is supposed to receive the information that has been requested. Those skilled in the art would recognize that various identification methods might be used to keep track of specific remote terminals 12 using the location-based services system 10.
As further illustrated in FIG. 1, the location-based application server 28 is also connected to a location gateway server 30, which is, in turn, connected to the base station 16 of the wireless communication system 14. The location gateway server 30 is used by the location-based application server 28 to retrieve a geographic indicator that is associated with each respective remote terminal 12. As such, while a respective remote terminal 12 is connected to the wireless communication system 14, the location-based application server 28 is capable of determining the respective geographic location of the remote terminal 12 so that geographically targeted responses and information can be provided to the remote terminal 12.
As illustrated in FIG. 1, the location gateway server 30 is preferentially connected to the base station 16 of the wireless communication system 14 using a network connection 32, which may be a private network connection or an Internet connection in alternative embodiments of the present invention. The geographic indicator may be generated by the remote terminal 12 or the base station 16 and is preferentially transmitted to the location-based application server 28 when a user of the remote terminal 12 is accessing the location-based services system 10. The geographic indicator is preferentially transmitted to the location-based application server 28 with the remote terminal identifier so that the location-based application server 28 can associate each respective remote terminal 12 with a particular geographic location.
In the preferred embodiment of the present invention, the geographic indicator may be preset by a user of the remote terminal 12, automatically generated by a GPS located in the remote terminal 12 or generated by a specialized geographic determination application running on the base station 16. In addition, the present invention may advantageously take advantage of an enhanced 911 system of the wireless communication system 14 to generate the geographic indicator. In another embodiment of this invention, the geographic indicator may originate from a combination of these sources and/or systems (i.e., it could come from a GPS-assisted network that uses GPS and devices on the network). The geographic indicator may automatically be sent to the location-based application server 28 as soon as a respective remote terminal 12 connects to the wireless communication system 14; however, in alternative embodiments of the present invention, the geographic indicator is only sent when a respective remote terminal is sending a structured request to the location-based application server 28. As the geographic location of the remote terminal 12 changes, the geographic indicator is updated and the updated information can continuously be sent to the location-based application server 28.
As further illustrated in FIG. 1, at least one voice synthesis server 33 is connected to the location-based application server 28 and the PBX 22. For voice-related applications of the location-based services system 10, the voice synthesis server 33 is used to generate voice responses that are based on the structured responses that are generated in response to the structure requests that are received by the location-based application server 28. Voice synthesis applications on the voice synthesis server 33 are used to transform the structured responses into voice response. In the preferred embodiment, the PBX 22 is used to transmit the voice responses to the PSTN 18, which, in turn, transmits the voice response to the base station 16, which ultimately transmits the voice response on to the remote terminal 12. In alternative embodiments of the present invention, the voice synthesis server 33 may be connected directly to respective base stations 16 of the wireless communication system 14.
Referring to FIG. 1, in yet another preferred embodiment of the location-based services system 10, a second remote terminal 40 is connected to a subscriber portal web server 44 through a network connection 42. The network connection 42 may be a private network connection or an Internet connection. As illustrated, the subscriber portal web server 44 is also connected to the location-based application server 28. During operation, the second remote terminal 40 is programmed to receive structured requests that are sent to the location-based application server 28 and, likewise, the location-based application server 28 is programmed to generate structured responses that are sent to the second remote terminal 40.
The second remote terminal 40 and the location-based application server 28 preferentially communicate with each other using standard web-based protocols that are commonly used in various Internet-based applications. In this embodiment of the present invention, a user accesses the subscriber portal web server 44 through the second remote terminal 40, which is preferentially a computer workstation. As a subscriber to the location-based services system 10, the second remote terminal 40 is assigned a predetermined geographic indicator. The geographic indicator is used by the location-based application server 28 to target services and business content to the second remote terminal 40 that are based on the geographic location of the second remote terminal 40.
The user of the second remote terminal 40 may be given the option of setting the geographic indicator to a desired geographic location, which may or may not be the exact geographic location of the second remote terminal 40. For example, if the user is traveling to another city that evening and wants to access location-based services in that particular city, an option can be provided allowing the second remote terminal 40 to designate that particular city.
In this preferred embodiment of the present invention, the second remote terminal 40 is preferentially a computer workstation that includes multimedia capabilities and includes a microphone and a sound card. As known to those skilled in the art, this allows the second remote terminal 40 to generate sound through a speaker system and receive voice signals through the microphone. Although not specifically illustrated in FIG. 1, this could allow the subscriber portal web server 44 to be connected to the speech recognition server 24 so that voice signals sent from the second remote terminal 40 could be processed similar to the method used to process voice signals received from wireless remote terminal 12.
As further illustrated in FIG. 1, the preferred location-based services system 10 is also capable of leveraging data that is preferentially grouped in four logical data groupings 52. These logical data groupings include profile data files 54, business data files 56, additional data files 58 and usage data files 60. The data files 54-60 contain detailed information on various items and services that are used by the location-based services system 10, which is set forth in detail below. The data files 54-60 can be located on the location-based application server 28, but are preferentially maintained on separate servers.
The profile data files 54 contain a group of logical entities that contain relevant information concerning each consumer of the location-based services system 10. These logical entities include, but are not specifically limited to the following items: consumer name; consumer phone number; consumer identification; consumer password; consumer home address; consumer home phone number; consumer email address; consumer pager number; consumer service subscriptions (detailing the consumers chosen level of participation in one or more services); consumer privacy preferences (detailing information denoting the willingness to share a consumers private data with others based on data type, requester, service, etc.); consumer service preferences (detailing any specific saved information that is relevant to any of the services which a consumer may use, such as: named locations (such as the address for a consumers work location, or the address(es) of a consumers friend(s); named interests or preferences regarding hobbies, news topic interest, sports, music, preferred brands or chains, banking information and other demographic information. (such as NBA basketball, Jazz music, Italian food, favorite clothing brands or chains, banking information, etc.)); and preferred asynchronous communication method (such as email or pager) listed by service and/or service/content provider.
The business data files 56 are composed of a group of logical entities containing all relevant information regarding the businesses listed within the location-based services system 10, including but not limited to: business name; business phone number; business text description; business audio description; business video description; business and/or product images; business identification; business password; business category or categories; advertising participation level; advertising campaign information such as: parameters that define target market; campaign identification code; advertising content and special deals/discounts; saved data mining/reporting parameters; brands sold; brands serviced; product types sold; services provided, product types serviced; product models sold; product models serviced; product model prices; and service prices and inventory list (by brand, product type and product model).
The additional data files 58 contains a group of logical entities that generally includes any additional content that is capable of being leveraged by the location-based services system 10, possibly including, but not limited to: business ratings (via external evaluation services); weather conditions; driving directions; maps; traffic Although not specifically illustrated, the residential telephone number and address listings may be provided by local telephone companies through a residential listing server that is connected to the location-based application server 28.
The usage data files 60 contains a group of logical entities that generally includes all recorded information regarding consumer transactions from remote terminals 12, 40, possibly including, but not limited to: consumer identification (or a unique hash of consumer identification); date; time; service used; request type; search criteria; matched data purchases made, and actions taken. Those skilled in the art would recognize that several other types of usage data might be stored in the usage data files 60.
As generally set forth above, users of the location-based services system 10 are given the ability to search, via a remote terminal 12, 40, for a business that will satisfy specific purchase or service requirements using multiple access methods (voice, wireless application protocol or web application protocol). The location-based application server 28 is programmed to handle a variety of structured requests and is capable of generating a variety of structured responses in the same format (i.e.—voice, wireless application protocol or web application protocol) that the structured request was received by the location-based application server 28.
Some of the structured request parameters that are capable of being used for the business services provided by the location-based services system 10 include (but are not necessarily limited to) one or more of the following: product type; service type; business name; business category; product name (or model name); product brand; price level; business or service ratings (i.e. external evaluation from a rating service such as AAA); whether special deals are provided; location (auto-location (locating nearest ATM for instance), predefined locations, or consumer-specified locations); hours of operation; availability of service (for example: availability of a open table at a specified time at a restaurant); and company specified within favorites for a category (i.e., name of favorite coffee house franchise). Those skilled in the art would recognize that a variety of structured request parameters might be used in the present invention.
As briefly set forth above, the location-based services system 10 provides a consumer using a remote terminal 12, 40 with access to products and services in a designated geographic area through multiple access methods such as voice, wireless application protocols (such as WAP and cHTML) and web protocols (such as Java and HTML). The present invention encompasses the full lifecycle of the location-based services system 10 including delivery and maintenance, which includes content management, consumer management, content delivery, advertising management, advertising reporting, advertising delivery, usage tracking, usage mining and reporting, billing and settlements.
The preferred location-based services system 10 is capable of providing location-based services to consumers through remote terminals 12, 40 and is managed by various content providers through the use of respective business remote terminals 46. The services that are provided through the location-based services system 10 preferentially includes an enhanced directory assistance service and an enhanced business service that is delivered through a speech recognition capability, wireless application protocol capability and/or web application capability
In order to access the enhanced directory assistance services or the business services, the user of the remote terminal 12 preferentially enters a predetermined key sequence (e.g.—by pressing 411) on the keypad of the remote terminal 12 or by pressing a specially designed key on the remote terminal 12. If the remote terminal is not connected to the base station 16 already, when the enhanced directory assistance services or business services are selected, the remote terminal 12 establishes a connection with the base station 16 of the wireless communication system 14, which acts as a gateway to the location-based services system 10.
In another embodiment, in order to select one of the respective services, the user of the remote terminal 12 is given the option of using voice commands, but as previously set forth may also use keypad inputs on the remote terminal 12 to select the desired services as well. Those skilled in the art should recognize that the enhanced directory assistance services and the business services do not necessarily have to be provided through the same access method and that a keypad-based menu system may be used until the appropriate time occurs for the user to input a voice signal containing a request for information.
By way of example only, if the enhanced directory assistance services are selected by a user of the remote terminal 12, either the base station 16, the location-based application server 28 or remote terminal 12 can be programmed to generate a search parameter request that is audibly generated on the remote terminal 12. In the embodiment being discussed, the search parameter request is sent in the form of a voice signal that prompts the user to state the first and last name of the person they are looking for. In addition, the search parameter request could also include an option that might prompt to user to also state the geographic area where the person is located. As should be apparent from the discussion above, since the location-based services system 10 includes speech recognition applications, those skilled in the art should recognize that the entire process of entering the search parameter request may be done by voice signals generated on the remote terminals 12.
In response to the search parameter request that is generated on the remote terminal 12, the user preferentially provides a vocal response to the remote terminal that is transmitted to the base station 16. The vocal response preferentially includes a first name response and a last name response (and possibly a detailed geographic information response for non-local listings) of the particular person the user is looking to retrieve information on. The vocal response to the search parameter request, which preferentially also includes a unique remote terminal identifier that is associated with each respective remote terminal 12, is then sent from the remote terminal 12 to the base station 16. The base station 16 transmits the voice response to the PSTN 18, which then routes the vocal response, together with the remote terminal identifier, to the PBX 22.
The PBX 22 transmits the vocal, response and the remote terminal identifier as inputs to speech recognition applications and natural language processing applications that are located on servers 24, 26, which in turn, respectively transform the vocal response and the remote terminal identifier into a structured residential listing request that is sent to the location-based application server 28. As set forth in detail above, the speech recognition applications analyze the vocal responses for the purposes of making a determination of the identity of particular words contained in the vocal responses. Any detailed geographic information provided by the user is also added to the structured residential listing request that is sent to the location-based application server 28.
As illustrated in FIG. 2, the structured residential listing request is used as an input to a residential finder application 62 located on the location-based application server 28. In other embodiments of the present invention, the residential finder application is referred to as business/services finder application 62 and response generation application 62. During operation, the residential finder application 62 interprets the structured residential listing request and uses at least one data access routine 64 to locate and retrieve the specific information requested by the structure residential listing request from a respective database file 54-58. Those skilled in the art should recognize that several database servers may be connected to the location-based application server 28 that are used to store various forms of information and content that is provided to users by the location-based services system 10 in varying types of formats, which will be set forth in greater detail below.
In the preferred embodiment of the present invention, the residential finder application 62 matches up the structured residential listing request with the geographic indicator of the remote terminal 12. If no geographic information is contained in the structured response, the residential finder application 62 conducts a search of the profile data files 54 and the additional data files 58 with data access routines 64 targeted within a predetermined area based on the geographic location of remote terminal 12. If geographic information is included in the vocal response, the residential finder application 62 conducts a search within the geographic area specified by the user. As set forth above, in the preferred embodiment of the present invention the residential listing database files are stored under the additional data files 58 by way of example only and should not be construed as a limitation of the present invention.
The residential finder application 62 preferentially also searches the profile data files 54 so that if the identity of the person contained in the structured residential request is identified as a subscriber of the location-based services system 10, a remote terminal 12 telephone number and/or an email address may also be added to the response that is provided to the user requesting the desired information. If the located person does turn out to be a subscriber of the location-based services system 10, other embodiments of the present invention allow the subscriber to create a personalized response that is stored in a database file and is provided in response to residential listing requests that identify them.
In addition to receiving the structured residential listing requests, the residential finder application 62 obtains a geographic indicator and a remote terminal identifier associated with the remote terminal 12. This allows the system to default to the geographic location of the remote terminal 12 to conduct the search, as set forth above. For instance, if the remote terminal 12 is located in Atlanta, Georgia, the residential finder application 62 will know this from the geographic indicator and will only search listings in the Atlanta area.
Once the appropriate data is located by the residential finder application 62 that is responsive to the structured residential listing request, which in the present example would preferentially include at least one telephone number and/or the address of the person(s) named in the voice signal, the residential finder application 62 is operable to generate a structured residential response that is sent to voice synthesis server 33. As set forth in detail above, the voice synthesis server 33 is programmed to transform the structured residential response into a voice response signal with voice synthesis applications located on the voice synthesis server 33.
As set forth briefly above, the voice response that are generated by the voice synthesis server 33 can include the name, address, residential telephone number, mobile number and/or email address of the particular person for which the user has requested a residential listing. For those instances where the structured residential responses include more than one residential listing, the residential listing finder application 62 is preferentially programmed to generate a structured residential response that provides the multiple listing results in a predetermined organized listing arrangement.
The predetermined organized listing arrangement is preferentially set up so that the user of the remote terminal 12 is capable of interacting with the listings provided in the voice response through the use of a keypad input or by voice signals that are spoken into the remote terminal 12 by the user. Preferentially, the information is organized and presented to the user of the remote terminal 12 based on the address of the particular people identified by the residential finder application 62; however, those skilled in the art would recognize that other alternatives of presenting and organizing the results exist (i.e., ranking the results in geographic order) are capable of being used in varying embodiments of the present invention.
If the person for whom information has been requested is designated as being unlisted or unavailable, the location-based application server 28 is preferentially programmed to generate a structured residential response that contains a message that indicates that the requested information is unlisted or unavailable. As such, in this particular embodiment of the present invention, the location-based application server 28 sends the structured residential response to the voice synthesis server 33, which generates a voice signal that is sent to the remote terminal 12 informing the user that requested the residential listing that the requested residential listing it unlisted or unavailable.
As briefly set forth above, another preferred embodiment of the location-based services system 10 is capable of providing business services to the remote terminal 12, which are provided to the remote terminal 12 based on the geographic location of the remote terminal 12. If the user of the remote terminal 12 selects the business services option instead of the enhanced directory assistance services option, a variety of information services are capable of being delivered to the user through the location-based services system 10. During operation, the business services are provided to the remote terminal 12 through similar access methods that the residential listing services are provided to the remote terminal 12. In addition to being able to obtain the address and telephone number of local businesses, various other forms of business information is capable of being transmitted to the remote terminal 12 by the location-based services system 10.
As generally set forth above and in greater detail below, some of the preferred structured business request parameters that are capable of being processed by the business services of the location-based services system 10 include (but are not necessarily limited to) one or more of the following parameters: product/service types; business names; business category; product name (or model name); product brands; price level; business or service ratings (e.g.—external evaluation from a rating service such as AAA); whether special deals or offers are being provided; auto-location of predefined services (e.g.—locating the nearest ATM for instance); hours of operation; availability of service (e.g.—availability of a open table at a specified time at a restaurant); and/or business information specified within a user defined favorites category (e.g.—name of favorite coffee house franchise, favorite clothing brands, favorite restaurants).
In this preferred embodiment of the present invention, once a user of the remote terminal 12 gains access to the business services provided by the location-based services system 10, he/she is prompted by a voice signal requesting the user to state his/her respective business request. In response to the prompt for a business request, the user states a vocal response that is received by the remote terminal 12 that contains a request for a predetermined type of business content. The exact nature and content of the vocal response will vary, depending on the specific type of business/service information that is being requested by the user of the remote terminal 12. As set forth above and below, the preferred embodiment of the present invention includes natural language processing applications that are used to interpret the meaning and context of the words contained in the vocal response, thereby allowing the user of the remote terminal 12 to make a request using requests that are spoken using statements commonly used in everyday conversations.
By way of example only, let's say that a respective user of the remote terminal 12 wants to obtain business information related to determining the location of a favorite local fast-food restaurant. As such, the user's vocal response that is received by the remote terminal 12 might contain a voice signal that includes a request for business information that could be phrased something along the lines of the following statement: “What is the address of a Burger King restaurant that is close to my present location?” As previously set forth, this preferred embodiment of the present invention is capable of interpreting this request using natural language processing applications to generate a structured response.
As with the residential services, in this embodiment of the present invention, the vocal response that is provided by the user of the remote terminal 12 is transmitted from the remote terminal 12 to the base station 16 of the wireless communication system 14, which, in turn, is operable to transmit the vocal response to the PSTN 18 that transmits the vocal response to the PBX 22. The vocal response is then sent from the PBX 22 to the speech recognition server 24 where it is processed with speech recognition applications to determine the identity or recognize the respective words that are contained in the vocal response from the user containing a business information request. Although not illustrated, in an alternative embodiment of the present invention, the base station 16 is directly connected to the speech recognition server 24, thereby allowing the base station 16 to directly transmit vocal response to the speech recognition server 24.
After the words contained in the vocal response have been recognized using speech recognition applications, a respective output is generated by the speech recognition applications, which is used as an input to natural language processing applications. As set forth in detail above, the natural language processing applications determine the meaning and context of the words contained in the vocal response that is received by the remote terminal 12. Referring once again to FIG. 2, once the meaning and context of the recognized words contained in the vocal response have been determined, the natural language application is programmed to generate a structured business request that is sent to the location-based application server 28. The location-based application server 28 includes at least one business/services finder application 62 that is operable to process the structured business request by retrieving the requested information.
As set forth in detail above, the remote terminal 12 also sends a remote terminal identifier with the vocal response that is preferentially integrated in some manner with the structured business request that is ultimately generated and sent to the location-based application server 28. In addition, in this preferred embodiment of the present invention as well as others, a geographic indicator and a remote terminal identifier associated with the respective remote terminal 12 making the structured business request is also obtained or has already been obtained by the location-based application server 28. As illustrated in FIG. 2, the geographic indicator and the structured business request are used by the business/services finder application 62 to generate a structured business response that is responsive to the structured business request.
In our current example, the preferred business/services finder application 62 uses the geographic indicator of the remote terminal 12 to determine which particular Burger King location is closest to remote terminal 12. A mapping routine within the business/services finder application 62 compares the geographic location of the remote terminal 12 with the respective geographic locations of Burger King restaurants retrieved by the structured business request and makes the determination of which location is closest to the remote terminal 12, which can be based on the distance of the remote terminal 12 from each respective location. As illustrated in FIG. 2, this is accomplished by a data access routine 64 that accesses the appropriate information from the business data files 56, which preferentially contains a database of business listings, addresses, products and/or services provided.
After the appropriate information is located, the location-based application server 28 is programmed to generate a structured business response that is sent to the voice synthesis server 33. The voice synthesis server 33 converts the structured business response into a voice signal that is then sent to remote terminal 12. In this example, the structured business response would contain the address of the Burger King that is closest to remote terminal 12, which has been determined by the location-based application server 28 based on the geographic location of remote terminal 12.
In yet another example of this embodement of the present invention, a user of the business services might request information on a retail store that sells a specific product or provides a specific service. For instance, a user might state: “Who sells or provides product/service (stating the particular product/service desired)?” After the speech recognition application and the natural language processing application interpret and transform the request into a structured business request the business/services finder application 62 uses the geographic indicator of remote terminal 12 to narrow the structured business request to retrieve business information contained within a predefined geographic area in which the remote terminal 12 is located. If more than one business sells the item or provides the requested service, the business/services finder application 62 is programmed to generate a structured business response that is sent to voice synthesis server 33 containing a listing of the respective businesses meeting the desired criteria. For a more detailed description of the location-based services system 10, refer to U.S. application Ser. No. 09/946.111, which is incorporated herein by reference in its entirety.
Referring to FIGS. 1 and 3, yet another preferred embodiment of the present invention discloses a method and system for providing enhanced natural language processing in a location-based services system 10. One embodiment of this invention enhances natural language processing by building and leveraging a grammar database that is organized based on parts of speech and intended purpose. This embodiment of the present invention provides a natural language processing application that is located on the natural language processing servers 26 that allows users of the remote terminals 12 to request information in many natural ways, without requiring the significant setup and maintenance that is required in menu-driven implementations. In the present preferred embodiment, altering the mechanism and structures of the grammars that are typically defined in a speech recognition system enables this capability.
As illustrated in FIG. 3, several different methods are set forth for verbally requesting if there are any specials or discounts on a digital video disc (DVD) player. Those skilled in the art should recognize that the requests set forth in FIG. 3 are intended to serve as an example only and that several other types of product or service requests may be made by consumers. As such, the various requests for specials or discounts on DVD players set forth in FIG. 3 should be viewed in an illustrative sense and by no means should be construed as a limitation of the present invention. The preferred embodiment of the present invention is designed to handle any type of consumer request for products or services.
The first voice request 100 illustrated in FIG. 3 is set forth as “Do you have any specials on DVD players?” The second voice request 102 is set forth as “Do you have any discounts on DVD players?” The third voice request 104 is set forth as “Do you have any DVD players on sale?” While these three requests 100-104 are somewhat different, they represent some of the varying methods for which a consumer would use natural language to ask a human salesperson in a store or over the telephone for specials on DVD players or any other type of product or service. As set forth in detail below, the present invention discloses a natural language processing application that is designed to handle the varying ways in which consumers request information, so that users of remote terminals 12 can use natural language when requesting information on products or services while using the location-based services system 10.
Each of the requests 100-104 in FIG. 3 has a particular word structure that is associated with the request 100-104, which can be referred to as a part of speech or a grammar. Parts of speech refer to how words are classified according to their particular function in sentences for the purpose of grammatical analysis. In the preferred embodiment of the present invention, during operation, the natural language processing application that is located on the natural language processing server 26 divides each spoken request into one of eight parts of speech or grammars. The eight parts of speech or grammars into which each verbal request is preferentially broken down include: nouns, adjectives, adverbs, prepositions, conjunctions, pronouns, verbs and interjections. Most major languages use the above-referenced eight parts of speech or grammars and, as such, the present natural language processing application is versatile for application in almost any spoken language. For the purpose of the present invention, it is worthwhile to note the function of these grammars and how they are used by the natural language processing application.
A noun is a word that is usually used to denote a thing, place, person, quality, or action. In a sentence, a noun is the subject or object of action expressed by a verb or as the object of a preposition. In some languages, nouns and verbs can sometimes take the same form. In the present preferred embodiment, the natural language processing application uses the identified nouns from verbal requests 100-104 to determine the thing or object that a user of the remote terminal 12 is requesting. As such, referring to FIG. 4, in our present example, the terms specials, DVD, players, discounts and sale are viewed by the natural language processing application as the nouns of the requests 100-104. During operation, the preferred location-based services 10 will use these terms to locate the product being requested by a user of the remote terminal 12.
An adjective is a part of speech that modifies, or qualifies, a noun or pronoun, in one of three forms of comparative degree. The three forms of comparative degree an adjective can modify or qualify a noun or pronoun are: positive (e.g., cheap), comparative (e.g., cheaper), or superlative (e.g., cheapest). The natural language processing application will generally use the adjectives contained in the verbal requests 100-104 to generate structured requests that narrow the search that is conducted for a particular product or service. For example, if a request for “the cheapest DVD player” is received, the preferred embodiment will exclude high-priced or top-of-the-line DVD players from the structured responses that are provided to a user of the remote terminal.
An adverb is a part of speech that modifies a verb (purchase inexpensively), an adjective (a very cheap DVD player), or another adverb (purchase very inexpensively). Adverbs may indicate place or direction (where, whence), time (still, immediately), degree (very, inexpensive), manner (thus, and words ending in ly, such as locally), and belief or doubt (perhaps, no). Like adjectives, adverbs may be also be comparative (reasonably, most wisely). As set forth above in relation to adjectives, the natural language processing application will also use the adverbs identified in verbal requests 100-104 to limit or narrow the structured request that is generated and sent to the response generation application 62.
Prepositions are words that combine with a noun or a pronoun to form a phrase. In languages such as Latin or German, prepositions change the form of the noun or pronoun to the objective case or to the possessive case. Conjunctions are the words that connect sentences, clauses, phrases, or words, and sometimes paragraphs. Coordinate conjunctions (e.g., and, but, or, however) are used to join independent clauses, or parts of a sentence; subordinate conjunctions introduce subordinate clauses (where, when, because, if, since, whether). Again, prepositions and conjunctions are used by the natural language processing application to formulate structured requests that are more targeted to the specific requests of users of remote terminals 12 so that the results are more accurate. For example, if a user states that they want “specials on steak dinners or seafood dinners,” the natural language processing application will generate a structured request for specials on those two particular types of dinners.
A pronoun is an identifying word that is used instead of a noun and inflected in the same way that nouns are when spoken. In English, there are several different types of pronouns. Personal pronouns consist of: I, you, he/she/it, we, you and they. Demonstrative pronouns are this, that, and such. Who and which are interrogative pronouns when introducing questions and when introducing clauses, they are relative pronouns. In the preferred embodiment of the present invention, although pronouns are identified and categorized, they are preferentially ignored by the natural language processing application, as they provide little value for the purposes of generating a structured request that is sent to the response generation application 62. However, other embodiments may use pronouns in generating structured requests.
Verbs are words that express some form of action. In English grammar, verbs have three moods: the indicative, which expresses actuality; the subjunctive, which expresses contingency; and the imperative, which expresses command (I ran; I might run; Run!). Like nouns, the natural language processing application uses the identified verbs from the verbal requests 100-104 to determine the type of action that the user is requesting to undertake. For example, a verb in a verbal request 100-104 like “purchase” or “buy” will indicate to the response generation application that processes the request that the user is looking to buy a particular item. As such, the natural language processing application will generate structured requests that generate results based on the type of action being requested.
Referring to FIG. 4, each of the requests 100-104 illustrated in FIG. 3 has a particular grammar structure associated with the words contained in each respective request 100-104. While some requests will leverage the same word structure to convey a similar concept or request, other requests will leverage a different word structure to convey a similar concept or request. During operation, the preferred natural language processing application breaks up each request 100-104 into individual parts of speech where the most common words in each part are reused and only the words specific to the request have to be created in a grammar database.
Although not specifically illustrated, in some embodiments, the grammar database is used by the response generation application 62 to locate similar types of requests 100-104 that have been made by users of the remote terminals 12. The response generation application 62 can also keep track of prior structured responses that were made to similar requests 100-104. As such, the grammar database can be built up over time to include almost any type of request 100-104 for a particular product or service, thereby eliminating the need for the response generation application 62 to search the business data files 56 every time a request 100-104 is made. In this preferred embodiment, the grammar database is located in the data files 52. Those skilled in the art would recognize that the grammar database could be located in other locations as well.
As illustrated in FIG. 5, each of the requests 100-104 set forth in FIG. 3 generalizes into a predetermined set of grammars that are associated with each request 100-104. Referring to FIG. 6, during operation the words contained in each request 100-104 are broken down or generalized into sub-grammar categories with each word falling into a particular category based on its grammatical use in the request 100-104. Once the sub-grammar categories are created, the preferred natural language processing application uses these values to generate a structured request that is processed by the response generation application 62 (see FIG. 2).
In the embodiment being discussed, the response generation application 62 uses these values to search the grammar database for marches that contain words falling into the same grammar category. If an exact match is not made, the response generation application 62 searches the business data files 56 and generates a structured response that is presented to the user of the remote terminal 12 using one of several methods set forth above in relation to other embodiments of the present invention presentation. Once the response generation application 62 has retrieved the proper listing from the business data files 56, the response generation application 62 will update the grammar database if an exact match was not found so that future requests matching that criterion can generate responses with a higher degree of accuracy and speed.
Referring to FIG. 6, each of the requests 100-104 has been broken down into sub-grammar categories to illustrate how the preferred natural language processing application functions during normal operation. As illustrated, there are two words that are located in the “verb” category: “Do” and “have,” while there are four implicitly identified words and five explicitly identified words found in the noun category: “specials,” “DVD,” “players,” discounts,” “sale,” “special,” “player,” “discount” and “sales”. The preferred natural language processing application automatically associates plural forms of words with singular forms of words that are located in the “noun” sub-grammar category so that the search that is conducted for resulting matches will encompass a broader search thereby yielding more reliable results.
Referring once again to FIG. 1 in yet another preferred embodiment of the present invention, when a user of the remote terminal 12 generates a voice request 100-104, it is transmitted to the base station 16, which, in turn, transmits it to the speech recognition server 24. As previously set forth, the speech recognition server 24 uses speech recognition applications that are programmed to recognize or identify the words that are contained in the voice request 100-104. After the words contained in the voice request 100-104 have been identified, a grammar associated with each word is also identified by the natural language processing applications located on the natural language processing server 26. Once the grammars have been identified for each respective word, the natural language processing application categorizes each word into a respective grammar category.
After the words are categorized by the natural language processing application, a structured request is generated by the natural language processing application that is sent to location-based application server 28. The response generation application 62, which is preferentially located on the location-based application server 28, uses this structured request to locate the product or service being requested. The response generation application 62 uses the structured request as an input to a search engine that searches for matches to the products or services being requested in the business data file 56. Once a match is located by the response generation application 62, a structured response to the voice request is generated by the response generation application 62.
In one preferred embodiment of the present invention, the structured response is sent to the voice synthesis server 33, which transforms the structured response into a voice response that is sent to the remote terminal 12. As with other embodiments of the present invention, if multiple listings are located, the voice response can be generated in the form of a menu thereby allowing the user of the remote terminal 12 to interact with the listing of located items. The user of the remote terminal 12 can use an input device, such as a pointer or keypad, to interact with the listings, or the user may be provided to use his/her voice to interact with the listings in other embodiments. In yet another preferred embodiment of the present invention, the structured response is generated as a text message that is sent to the remote terminal 12. Preferentially, the text message is sent to the remote terminal 12 using a wireless application protocol. In yet other embodiments, the text message may also be accompanied by image files or sound files.
While the invention has been described in its currently best-known modes of operation and embodiments, other modes, embodiments and advantages of the present invention will be apparent to those skilled in the art and are contemplated herein.
Claims (27)
1. A method of providing natural language processing in a communication system, comprising the steps of:
receiving a non-predefined voice request for business information related to a product, and a geographic location;
identifying a plurality of words contained in said non-predefined voice request for information with a speech recognition application;
identifying a grammar associated with each said word, wherein said grammar is selected from a group of grammars consisting of a noun, an adjective, an adverb, a preposition, a conjunction, a pronoun, a verb, and an interjection;
categorizing each said word into a respective grammar category;
generating a structured request based on said geographic location and said categorization of said words which comprises ignoring each said word that is identified as a pronoun, limiting the structured request based on a meaning of at least one of said words that is identified as a noun, and restricting the structured request for each said word that is identified as a conjunction;
searching a grammar database for a similar request that contains words in the same grammar category as said structured request;
when said similar request is not found in said grammar database, searching a plurality of business data files for information to be used in a structured response, wherein said business data files include product and service related information of a plurality of different businesses;
updating said grammar database to include said structured request and said structured response to avoid a future search of said business data files for a similar structured request; and
generating said structured response to said non-predefined voice request for information with a response generation application.
2. The method of claim 1, further comprising the step of narrowing said structured response to a geographic area in which a remote terminal is located based on said received geographic location.
3. The method of claim 1, wherein said voice request contains a request for a particular product.
4. The method of claim 1, wherein said structured response is generated as a voice response.
5. The method of claim 1, wherein said structured response is generated as a text message.
6. The method of claim 1, further comprises the step of transmitting said structured response to a remote terminal.
7. The method of claim 1, wherein categorizing each said word into a respective grammar category comprises categorizing each said word into one of a plurality of grammar categories based on a grammatical use of each said word in said non-predefined voice request, the grammar categories being noun, adjective, adverb, preposition, conjunction, pronoun, verb, and interjection.
8. The method of claim 1, wherein searching comprises searching based on said structured request and said geographic location.
9. The method of claim 1, wherein receiving said non-predefined voice request for business information related to a product comprises receiving said geographic location at about the same time as said non-predefined voice request for business information is received.
10. The method of claim 1, wherein receiving said non-predefined voice request for business information related to a product comprises receiving said geographic location prior to receipt of said non-predefined voice request for business information.
11. A wireless communication system with natural language processing, comprising:
a speech recognition application configured to receive a non-predefined voice request for information from a remote terminal, wherein said speech recognition application is operable to identify a plurality of words contained in said non-predefined voice request for information;
a natural language processing application connected to said speech recognition application, wherein said natural language processing application is operable to generate a structured request based on said words contained in said non-predefined voice request for information and a geographic location of said remote terminal;
wherein said natural language processing application is operable to categorize said words contained in said non-predefined voice request for information into a respective one of a plurality of grammar categories;
wherein said words in said grammar categories and said geographic location are useable by a response generation application connected to said natural language processing application to locate in a grammar database a product identified in said non-predefined voice request for information;
wherein said response generation application is further operable to retrieve said product identified in said non-predefined voice request for information, based on said geographic location, from a plurality of business data files when said product is not locatable in said grammar database; and
wherein said response generation application is further operable to update said grammar database with said retrieved product, and generate a structured response to said structured request.
12. The wireless communication system of claim 11, further comprising a voice synthesis application connected to said response generation application for transforming said structured response into a voice response.
13. The wireless communication system of claim 11, wherein said non-predefined voice request for information contains a request for a particular product.
14. The wireless communication system of claim 11, wherein said structured response is generated as a text message that is sent to said remote terminal.
15. The wireless communication system of claim 11, wherein said geographic location is generatable with said remote terminal.
16. The wireless communication system of claim 15, wherein said geographic location is pre-settable with said remote terminal to a desired geographic location.
17. The wireless communication system of claim 11, wherein said geographic location is generatable with a base station in communication with said remote terminal.
18. The wireless communication system of claim 11, wherein said response generation application is operable to search said grammar database for the same words in the same grammar categories to locate said product in said grammar database.
19. A method of providing natural language processing in a location-based services system, comprising the steps of:
receiving a non-predefined voice request for information from a remote terminal, and a geographic location of said remote terminal;
identifying a plurality of words contained in said non-predefined voice request for information with a speech recognition application;
identifying a grammar associated with each said word;
categorizing each said word into a respective grammar category based on grammatical use;
generating a structured request based on said categorization of said words;
searching for matches to each said categorized word in said structured request in a grammar database with a response generation application, said grammar database organized based on parts of speech into a plurality of grammar categories each containing a plurality of words that are searchable for matches to each said categorized word that are in said respective grammar category;
searching for matches to each said categorized word in a database of products with said response generation application only when there are no matches found in said grammar database, said database of products containing business data files businesses listed within said location-based services system;
generating a structured response to said non-predefined voice request for information with said response generation application, wherein said structured response is geographically targeted based on said geographic location of said remote terminal; and
in response to matches to each said categorized word in said database of products, updating said grammar database to include said structure request and said structured response to avoid a future search in said database of products for a similar structured request.
20. The method of claim 19, wherein said non-predefined voice request for information contains a request for a particular product.
21. The method of claim 19, wherein the grammar is selected from a group of grammars consisting of a noun, an adjective, an adverb, a preposition, a conjunction, a pronoun, a verb and an interjection.
22. The method of claim 19, wherein said structured response is generated as a voice response.
23. The method of claim 19, wherein said structured response is generated as a text message.
24. The method of claim 17 further comprises the step of transmitting said structured response to said remote terminal.
25. The method of claim 19, wherein categorizing each said word into a respective grammar category comprises categorizing each said word into one of a plurality of grammar categories based on a grammatical use of each said word in said non-predefined voice request, the grammmar categories being noun, adjective, adverb, preposition, conjunction, pronoun, verb, and interjection.
26. The method of claim 19, wherein receiving said non-predefined voice request comprises receiving said geographic location at about the same time as said non-predefined voice request for information.
27. The method of claim 19, wherein receiving said non-predefined voice request comprises receiving said geographic location prior to receipt of said non-predefined voice request.
US10131898 2001-04-27 2002-04-25 Natural language processing for a location-based services system Active 2023-06-30 US7437295B2 (en)
Priority Applications (3)
Application Number Priority Date Filing Date Title
US28691601 true 2001-04-27 2001-04-27
US09946111 US6944447B2 (en) 2001-04-27 2001-09-04 Location-based services
US10131898 US7437295B2 (en) 2001-04-27 2002-04-25 Natural language processing for a location-based services system
Applications Claiming Priority (18)
Application Number Priority Date Filing Date Title
US10131898 US7437295B2 (en) 2001-04-27 2002-04-25 Natural language processing for a location-based services system
CA 2783713 CA2783713C (en) 2001-04-27 2002-04-26 Location-based services
PCT/US2002/013243 WO2002088880A3 (en) 2001-04-27 2002-04-26 Location-based services
CA 2783576 CA2783576C (en) 2001-04-27 2002-04-26 Location-based services
EP20110164128 EP2378480B1 (en) 2001-04-27 2002-04-26 Passive mining of usage information in a location based services system
KR20057021138A KR100718617B1 (en) 2001-04-27 2002-04-26 A method for providing advertising effectiveness searching capability, a method for providing predictive modeling, a method for searching usage information, and a system to predict advertising effectiveness
CA 2444521 CA2444521C (en) 2001-04-27 2002-04-26 Location-based services
EP20090006059 EP2113909B1 (en) 2001-04-27 2002-04-26 Location-based services
EP20020725826 EP1391127B1 (en) 2001-04-27 2002-04-26 Location-based services
JP2002586115A JP4727129B2 (en) 2001-04-27 2002-04-26 Location-based services
KR20037014101A KR100585347B1 (en) 2001-04-27 2002-04-26 A method of providing location-based services and a location-based services system
KR20077020832A KR100870798B1 (en) 2001-04-27 2002-04-26 Natural language processing for a location-based services system
EP20110164131 EP2372698B1 (en) 2001-04-27 2002-04-26 Routing call failures in a location-based services system
CA 2783808 CA2783808C (en) 2001-04-27 2002-04-26 Location-based services
KR20067005986A KR100798574B1 (en) 2001-04-27 2002-04-26 Advertising campaign and business listing for a location-based services system
CA 2742308 CA2742308C (en) 2001-04-27 2002-04-26 Location-based services
JP2007107349A JP5124160B2 (en) 2001-04-27 2007-04-16 System to predict the advertising effect
JP2011004545A JP5227429B2 (en) 2001-04-27 2011-01-13 Natural language processing for the service system based on the position
Related Parent Applications (1)
Application Number Title Priority Date Filing Date
US09946111 Continuation-In-Part US6944447B2 (en) 2001-04-27 2001-09-04 Location-based services
Publications (3)
Publication Number Publication Date
US20020161587A1 true US20020161587A1 (en) 2002-10-31
US20040243417A9 true US20040243417A9 (en) 2004-12-02
US7437295B2 true US7437295B2 (en) 2008-10-14
Family
ID=27384215
Family Applications (1)
Application Number Title Priority Date Filing Date
US10131898 Active 2023-06-30 US7437295B2 (en) 2001-04-27 2002-04-25 Natural language processing for a location-based services system
Country Status (6)
Country Link
US (1) US7437295B2 (en)
JP (1) JP5124160B2 (en)
KR (3) KR100718617B1 (en)
CA (1) CA2444521C (en)
EP (1) EP1391127B1 (en)
WO (1) WO2002088880A3 (en)
Cited By (35)
* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050080771A1 (en) * 2003-10-14 2005-04-14 Fish Edmund J. Search enhancement system with information from a selected source
US20050234727A1 (en) * 2001-07-03 2005-10-20 Leo Chiu Method and apparatus for adapting a voice extensible markup language-enabled voice system for natural speech recognition and system response
US20050288935A1 (en) * 2004-06-28 2005-12-29 Yun-Wen Lee Integrated dialogue system and method thereof
US20070203735A1 (en) * 2006-02-28 2007-08-30 Commonwealth Intellectual Property Holdings, Inc. Transaction Enabled Information System
US20070203736A1 (en) * 2006-02-28 2007-08-30 Commonwealth Intellectual Property Holdings, Inc. Interactive 411 Directory Assistance
US20080091443A1 (en) * 2006-10-13 2008-04-17 Brian Strope Business listing search
US20080306924A1 (en) * 2007-06-05 2008-12-11 Paolini Michael A Mobile telephone object lookup and identification
US20090228281A1 (en) * 2008-03-07 2009-09-10 Google Inc. Voice Recognition Grammar Selection Based on Context
US20100042400A1 (en) * 2005-12-21 2010-02-18 Hans-Ulrich Block Method for Triggering at Least One First and Second Background Application via a Universal Language Dialog System
US20100076955A1 (en) * 2006-12-19 2010-03-25 Koninklijke Kpn N.V. The Hague, The Netherlands Data network service based on profiling client-addresses
US20100138402A1 (en) * 2008-12-02 2010-06-03 Chacha Search, Inc. Method and system for improving utilization of human searchers
US7860519B2 (en) 2001-04-27 2010-12-28 Accenture Global Services Limited Location-based services system
US20110047139A1 (en) * 2006-10-13 2011-02-24 Google Inc. Business Listing Search
US20110093265A1 (en) * 2009-10-16 2011-04-21 Amanda Stent Systems and Methods for Creating and Using Geo-Centric Language Models
US20110106617A1 (en) * 2009-10-29 2011-05-05 Chacha Search, Inc. Method and system of processing a query using human assistants
US7970648B2 (en) 2001-04-27 2011-06-28 Accenture Global Services Limited Advertising campaign and business listing management for a location-based services system
US8073920B2 (en) 2001-10-03 2011-12-06 Accenture Global Services Limited Service authorizer
US8379830B1 (en) 2006-05-22 2013-02-19 Convergys Customer Management Delaware Llc System and method for automated customer service with contingent live interaction
US20130103404A1 (en) * 2011-10-21 2013-04-25 GM Global Technology Operations LLC Mobile voice platform architecture
US20130197907A1 (en) * 2011-10-18 2013-08-01 GM Global Technology Operations LLC Services identification and initiation for a speech-based interface to a mobile device
US20130197915A1 (en) * 2011-10-18 2013-08-01 GM Global Technology Operations LLC Speech-based user interface for a mobile device
US8527421B2 (en) 2001-10-03 2013-09-03 Accenture Global Services Limited Virtual customer database
US20140032574A1 (en) * 2012-07-23 2014-01-30 Emdadur R. Khan Natural language understanding using brain-like approach: semantic engine using brain-like approach (sebla) derives semantics of words and sentences
US8738437B2 (en) 2001-04-27 2014-05-27 Accenture Global Services Limited Passive mining of usage information in a location-based services system
US8768379B2 (en) 2007-04-08 2014-07-01 Enhanced Geographic Llc Systems and methods to recommend businesses to a user of a wireless device based on a location history associated with the user
US20140324431A1 (en) * 2013-04-25 2014-10-30 Sensory, Inc. System, Method, and Apparatus for Location-Based Context Driven Voice Recognition
US8938392B2 (en) * 2007-02-27 2015-01-20 Nuance Communications, Inc. Configuring a speech engine for a multimodal application based on location
US8954325B1 (en) * 2004-03-22 2015-02-10 Rockstar Consortium Us Lp Speech recognition in automated information services systems
US9081860B2 (en) 2008-08-22 2015-07-14 Google Inc. Integration of device location into search
US9208783B2 (en) 2007-02-27 2015-12-08 Nuance Communications, Inc. Altering behavior of a multimodal application based on location
US9239987B1 (en) 2015-06-01 2016-01-19 Accenture Global Services Limited Trigger repeat order notifications
US9326088B2 (en) 2011-10-21 2016-04-26 GM Global Technology Operations LLC Mobile voice platform architecture with remote service interfaces
US9436967B2 (en) 2012-03-14 2016-09-06 Accenture Global Services Limited System for providing extensible location-based services
US9734254B2 (en) 2015-01-13 2017-08-15 Bank Of America Corporation Method and apparatus for automatic completion of an entry into an input field
US9858614B2 (en) 2015-04-16 2018-01-02 Accenture Global Services Limited Future order throttling
Families Citing this family (130)
* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6944447B2 (en) 2001-04-27 2005-09-13 Accenture Llp Location-based services
US7519529B1 (en) * 2001-06-29 2009-04-14 Microsoft Corporation System and methods for inferring informational goals and preferred level of detail of results in response to questions posed to an automated information-retrieval or question-answering service
EP1708470B1 (en) 2001-10-03 2012-05-16 Accenture Global Services Limited Multi-modal callback system
US7640006B2 (en) * 2001-10-03 2009-12-29 Accenture Global Services Gmbh Directory assistance with multi-modal messaging
EP1466435A4 (en) 2002-01-08 2011-05-18 Seven Networks Inc Secure transport for mobile communication network
US7398209B2 (en) 2002-06-03 2008-07-08 Voicebox Technologies, Inc. Systems and methods for responding to natural language speech utterance
US7693720B2 (en) 2002-07-15 2010-04-06 Voicebox Technologies, Inc. Mobile systems and methods for responding to natural language speech utterance
US7242949B2 (en) * 2003-04-11 2007-07-10 Fareastone Telecommunications Co., Ltd. Multimedia information and information inquiry download service
KR100766776B1 (en) 2003-06-17 2007-10-17 주식회사 케이티 Method of user information abstracting for wireless LAN system
GB0321736D0 (en) * 2003-09-17 2003-10-15 Vextra Net Ltd Method and system for processing knowledge
US9203974B2 (en) 2003-10-06 2015-12-01 Yellowpages.Com Llc Methods and apparatuses for offline selection of pay-per-call advertisers
US8538768B2 (en) 2005-02-16 2013-09-17 Ingenio Llc Methods and apparatuses for delivery of advice to mobile/wireless devices
US7366683B2 (en) 2003-10-06 2008-04-29 Utbk, Inc. Methods and apparatuses for offline selection of pay-per-call advertisers
US8140389B2 (en) 2003-10-06 2012-03-20 Utbk, Inc. Methods and apparatuses for pay for deal advertisements
WO2005109288A3 (en) * 2004-05-04 2007-06-28 Utbk Inc Methods and apparatuses for offline selection of pay-per-call advertisers
US7428497B2 (en) * 2003-10-06 2008-09-23 Utbk, Inc. Methods and apparatuses for pay-per-call advertising in mobile/wireless applications
US9202220B2 (en) 2003-10-06 2015-12-01 Yellowpages.Com Llc Methods and apparatuses to provide application programming interface for retrieving pay per call advertisements
US7505568B2 (en) * 2004-02-10 2009-03-17 Call Genie Inc. Method and system of providing personal and business information
JP2007256297A (en) * 2004-03-18 2007-10-04 Nec Corp Speech processing method and communication system, and communication terminal and server and program
US7424442B2 (en) 2004-05-04 2008-09-09 Utbk, Inc. Method and apparatus to allocate and recycle telephone numbers in a call-tracking system
US20050261904A1 (en) * 2004-05-20 2005-11-24 Anuraag Agrawal System and method for voice recognition using user location information
US8010082B2 (en) 2004-10-20 2011-08-30 Seven Networks, Inc. Flexible billing architecture
WO2006045102A3 (en) 2004-10-20 2008-11-13 Seven Networks Inc Method and apparatus for intercepting events in a communication system
US7706781B2 (en) 2004-11-22 2010-04-27 Seven Networks International Oy Data security in a mobile e-mail service
FI117152B (en) 2004-12-03 2006-06-30 Seven Networks Internat Oy The introduction of mobile e-mail settings
US7752633B1 (en) 2005-03-14 2010-07-06 Seven Networks, Inc. Cross-platform event engine
US8438633B1 (en) 2005-04-21 2013-05-07 Seven Networks, Inc. Flexible real-time inbox access
US7796742B1 (en) 2005-04-21 2010-09-14 Seven Networks, Inc. Systems and methods for simplified provisioning
WO2006136660A1 (en) 2005-06-21 2006-12-28 Seven Networks International Oy Maintaining an ip connection in a mobile network
US7917468B2 (en) 2005-08-01 2011-03-29 Seven Networks, Inc. Linking of personal information management data
US8069166B2 (en) 2005-08-01 2011-11-29 Seven Networks, Inc. Managing user-to-user contact with inferred presence information
US8468126B2 (en) 2005-08-01 2013-06-18 Seven Networks, Inc. Publishing data in an information community
US7853563B2 (en) 2005-08-01 2010-12-14 Seven Networks, Inc. Universal data aggregation
US7640160B2 (en) 2005-08-05 2009-12-29 Voicebox Technologies, Inc. Systems and methods for responding to natural language speech utterance
US7620549B2 (en) 2005-08-10 2009-11-17 Voicebox Technologies, Inc. System and method of supporting adaptive misrecognition in conversational speech
US7949529B2 (en) 2005-08-29 2011-05-24 Voicebox Technologies, Inc. Mobile systems and methods of supporting natural language human-machine interactions
EP1934971A4 (en) 2005-08-31 2010-10-27 Voicebox Technologies Inc Dynamic speech sharpening
WO2007068986A3 (en) * 2005-12-16 2007-08-02 Antun Caric Device and procedure for managing short lived and free created content for value added telecomunication services
EP1974561A2 (en) * 2005-12-27 2008-10-01 Dyuna Blue Ltd. Content distribution for mobile phones
US7599861B2 (en) 2006-03-02 2009-10-06 Convergys Customer Management Group, Inc. System and method for closed loop decisionmaking in an automated care system
WO2007108788A3 (en) * 2006-03-13 2009-06-11 Answers Corp Method and system for answer extraction
US7809663B1 (en) 2006-05-22 2010-10-05 Convergys Cmg Utah, Inc. System and method for supporting the utilization of machine language
US7769395B2 (en) 2006-06-20 2010-08-03 Seven Networks, Inc. Location-based operations and messaging
US8239286B2 (en) * 2006-06-29 2012-08-07 Microsoft Corporation Medium and system for location-based E-commerce for mobile communication devices
US7937402B2 (en) * 2006-07-10 2011-05-03 Nec (China) Co., Ltd. Natural language based location query system, keyword based location query system and a natural language and keyword based location query system
CN101136028B (en) 2006-07-10 2012-07-04 日电（中国）有限公司 Position enquiring system based on free-running speech and position enquiring system based on key words
US7774808B2 (en) 2006-08-01 2010-08-10 Att Knowledge Ventures, L.P. Method and apparatus for distributing geographically restricted video data in an internet protocol television (IPTV) system
US8073681B2 (en) 2006-10-16 2011-12-06 Voicebox Technologies, Inc. System and method for a cooperative conversational voice user interface
US8509411B2 (en) * 2006-11-06 2013-08-13 Nokia Corporation Managing group of location based triggers
US8213426B2 (en) 2007-01-30 2012-07-03 At&T Ip I, Lp Method and system for multicasting targeted advertising data
US7818176B2 (en) 2007-02-06 2010-10-19 Voicebox Technologies, Inc. System and method for selecting and presenting advertisements based on natural language processing of voice-based input
KR100926655B1 (en) * 2007-04-24 2009-11-17 (주)한국 네트인 Integrated Trading System and Method over the Internet
US8693494B2 (en) 2007-06-01 2014-04-08 Seven Networks, Inc. Polling
US8805425B2 (en) 2007-06-01 2014-08-12 Seven Networks, Inc. Integrated messaging
US8838476B2 (en) 2007-09-07 2014-09-16 Yp Interactive Llc Systems and methods to provide information and connect people for real time communications
US8364181B2 (en) 2007-12-10 2013-01-29 Seven Networks, Inc. Electronic-mail filtering for mobile devices
US8140335B2 (en) 2007-12-11 2012-03-20 Voicebox Technologies, Inc. System and method for providing a natural language voice user interface in an integrated voice navigation services environment
US8793305B2 (en) 2007-12-13 2014-07-29 Seven Networks, Inc. Content delivery to a mobile device from a content service
US9002828B2 (en) 2007-12-13 2015-04-07 Seven Networks, Inc. Predictive content delivery
US8386260B2 (en) * 2007-12-31 2013-02-26 Motorola Mobility Llc Methods and apparatus for implementing distributed multi-modal applications
US8107921B2 (en) 2008-01-11 2012-01-31 Seven Networks, Inc. Mobile virtual network operator
US8862657B2 (en) 2008-01-25 2014-10-14 Seven Networks, Inc. Policy based content service
US20090193338A1 (en) 2008-01-28 2009-07-30 Trevor Fiatal Reducing network and battery consumption during content delivery and playback
US20090234726A1 (en) * 2008-03-12 2009-09-17 Microsoft Corporation Automobile location based advertising
US8589161B2 (en) 2008-05-27 2013-11-19 Voicebox Technologies, Inc. System and method for an integrated, multi-modal, multi-device natural language voice services environment
US9305548B2 (en) 2008-05-27 2016-04-05 Voicebox Technologies Corporation System and method for an integrated, multi-modal, multi-device natural language voice services environment
US8787947B2 (en) 2008-06-18 2014-07-22 Seven Networks, Inc. Application discovery on mobile devices
US8078158B2 (en) 2008-06-26 2011-12-13 Seven Networks, Inc. Provisioning applications for a mobile device
US8260619B1 (en) 2008-08-22 2012-09-04 Convergys Cmg Utah, Inc. Method and system for creating natural language understanding grammars
US8155672B2 (en) 2008-09-16 2012-04-10 Avaya Inc. Scalable geo-location event processing
US8909759B2 (en) 2008-10-10 2014-12-09 Seven Networks, Inc. Bandwidth measurement
US8855665B2 (en) * 2008-12-17 2014-10-07 Avaya Inc. Location privacy enforcement in a location-based services platform
JP2010191963A (en) * 2009-02-17 2010-09-02 Accenture Global Services Gmbh Internet marketing channel optimization
US8326637B2 (en) 2009-02-20 2012-12-04 Voicebox Technologies, Inc. System and method for processing multi-modal device interactions in a natural language voice services environment
US20100318588A1 (en) * 2009-06-12 2010-12-16 Avaya Inc. Spatial-Temporal Event Correlation for Location-Based Services
US9171541B2 (en) 2009-11-10 2015-10-27 Voicebox Technologies Corporation System and method for hybrid processing in a natural language voice services environment
WO2011059997A1 (en) 2009-11-10 2011-05-19 Voicebox Technologies, Inc. System and method for providing a natural language content dedication service
US8437773B2 (en) 2009-12-09 2013-05-07 Qualcomm Incorporated Hierarchical information dissemination for location based systems
US9043731B2 (en) 2010-03-30 2015-05-26 Seven Networks, Inc. 3D mobile user interface with configurable workspace management
US9043433B2 (en) 2010-07-26 2015-05-26 Seven Networks, Inc. Mobile network traffic coordination across multiple applications
US9077630B2 (en) 2010-07-26 2015-07-07 Seven Networks, Inc. Distributed implementation of dynamic wireless traffic policy
US8838783B2 (en) 2010-07-26 2014-09-16 Seven Networks, Inc. Distributed caching for resource and mobile network traffic management
WO2012018556A3 (en) 2010-07-26 2012-08-09 Michael Luna Mobile application traffic optimization
WO2012061437A1 (en) 2010-11-01 2012-05-10 Michael Luna Cache defeat detection and caching of content addressed by identifiers intended to defeat cache
GB201307556D0 (en) 2010-11-01 2013-06-12 Seven Networks Inc Caching adapted for mobile application behavior and network conditions
WO2012060995A3 (en) 2010-11-01 2012-07-12 Michael Luna Distributed caching in a wireless network of content delivered for a mobile application over a long-held request
US8843153B2 (en) 2010-11-01 2014-09-23 Seven Networks, Inc. Mobile traffic categorization and policy for network use optimization while preserving user experience
US9330196B2 (en) 2010-11-01 2016-05-03 Seven Networks, Llc Wireless traffic management system cache optimization using http headers
US9060032B2 (en) 2010-11-01 2015-06-16 Seven Networks, Inc. Selective data compression by a distributed traffic management system to reduce mobile data traffic and signaling traffic
WO2012061430A3 (en) 2010-11-01 2012-06-28 Michael Luna Distributed management of keep-alive message signaling for mobile network resource conservation and optimization
WO2012060997A3 (en) 2010-11-01 2012-07-19 Michael Luna Application and network-based long poll request detection and cacheability assessment therefor
US8484314B2 (en) 2010-11-01 2013-07-09 Seven Networks, Inc. Distributed caching in a wireless network of content delivered for a mobile application over a long-held request
GB201309234D0 (en) 2010-11-22 2013-07-03 Seven Networks Inc Optimization of resource polling internvals to satisfy mobile device requests
WO2012071283A1 (en) 2010-11-22 2012-05-31 Michael Luna Aligning data transfer to optimize connections established for transmission over a wireless network
CN103403747A (en) * 2010-11-29 2013-11-20 金吉特有限责任公司 Engagement and payment processing platform
GB201311949D0 (en) 2011-01-07 2013-08-14 Seven Networks Inc System and method for reduction of mobile network traffic used for domain name system (DNS) queries
EP2700019A4 (en) 2011-04-19 2015-01-28 Seven Networks Inc Social caching for device resource sharing and management
WO2012149434A3 (en) 2011-04-27 2013-01-24 Seven Networks, Inc. Detecting and preserving state for satisfying application requests in a distributed proxy and cache system
US8832228B2 (en) 2011-04-27 2014-09-09 Seven Networks, Inc. System and method for making requests on behalf of a mobile device based on atomic processes for mobile network traffic relief
US9239800B2 (en) 2011-07-27 2016-01-19 Seven Networks, Llc Automatic generation and distribution of policy information regarding malicious mobile traffic in a wireless network
US8934414B2 (en) 2011-12-06 2015-01-13 Seven Networks, Inc. Cellular or WiFi mobile traffic optimization based on public or private network destination
US8868753B2 (en) 2011-12-06 2014-10-21 Seven Networks, Inc. System of redundantly clustered machines to provide failover mechanisms for mobile traffic management and network resource conservation
US9277443B2 (en) 2011-12-07 2016-03-01 Seven Networks, Llc Radio-awareness of mobile device for sending server-side control signals using a wireless network optimized transport protocol
GB2498064A (en) 2011-12-07 2013-07-03 Seven Networks Inc Distributed content caching mechanism using a network operator proxy
WO2013090821A1 (en) 2011-12-14 2013-06-20 Seven Networks, Inc. Hierarchies and categories for management and deployment of policies for distributed wireless traffic optimization
US20130159511A1 (en) 2011-12-14 2013-06-20 Seven Networks, Inc. System and method for generating a report to a network operator by distributing aggregation of data
WO2013090834A1 (en) 2011-12-14 2013-06-20 Seven Networks, Inc. Operation modes for mobile traffic optimization and concurrent management of optimized and non-optimized traffic
EP2801236A4 (en) 2012-01-05 2015-10-21 Seven Networks Inc Detection and management of user interactions with foreground applications on a mobile device in distributed caching
WO2013116856A1 (en) 2012-02-02 2013-08-08 Seven Networks, Inc. Dynamic categorization of applications for network access in a mobile network
WO2013116852A1 (en) 2012-02-03 2013-08-08 Seven Networks, Inc. User as an end point for profiling and optimizing the delivery of content and data in a wireless network
US8812695B2 (en) 2012-04-09 2014-08-19 Seven Networks, Inc. Method and system for management of a virtual network connection without heartbeat messages
US8775631B2 (en) 2012-07-13 2014-07-08 Seven Networks, Inc. Dynamic bandwidth adjustment for browsing or streaming activity in a wireless network based on prediction of user behavior when interacting with mobile applications
KR101304452B1 (en) * 2012-07-30 2013-09-04 주식회사 더존정보보호서비스 A cloud system for document management using location
JP6019968B2 (en) * 2012-09-10 2016-11-02 株式会社リコー Reporting system, report generation device and program
US9161258B2 (en) 2012-10-24 2015-10-13 Seven Networks, Llc Optimized and selective management of policy deployment to mobile clients in a congested network to prevent further aggravation of network congestion
US9307493B2 (en) 2012-12-20 2016-04-05 Seven Networks, Llc Systems and methods for application management of mobile device radio state promotion and demotion
US9241314B2 (en) 2013-01-23 2016-01-19 Seven Networks, Llc Mobile device with application or context aware fast dormancy
US8874761B2 (en) 2013-01-25 2014-10-28 Seven Networks, Inc. Signaling optimization in a wireless network for traffic utilizing proprietary and non-proprietary protocols
US8750123B1 (en) 2013-03-11 2014-06-10 Seven Networks, Inc. Mobile device equipped with mobile network congestion recognition to make intelligent decisions regarding connecting to an operator network
US20140279007A1 (en) * 2013-03-14 2014-09-18 Robert Bosch Gmbh Method for personalized context-aware, and privacy preserving real-time brokerage for advertising
US9065765B2 (en) 2013-07-22 2015-06-23 Seven Networks, Inc. Proxy server associated with a mobile carrier for enhancing mobile traffic management in a mobile network
US9666187B1 (en) * 2013-07-25 2017-05-30 Google Inc. Model for enabling service providers to address voice-activated commands
WO2015073923A1 (en) * 2013-11-14 2015-05-21 Chalk Media Holdings (Dba Chalk Digital) Methods and apparatus for generating a location-conscious mobile banner
US20150237470A1 (en) * 2014-02-14 2015-08-20 Apple Inc. Personal Geofence
US9319442B2 (en) * 2014-05-28 2016-04-19 Cisco Technology, Inc. Real-time agent for actionable ad-hoc collaboration in an existing collaboration session
US9843894B2 (en) 2014-05-30 2017-12-12 Apple Inc. Determining a size of a significant user location
US9626703B2 (en) 2014-09-16 2017-04-18 Voicebox Technologies Corporation Voice commerce
EP3207467A1 (en) 2014-10-15 2017-08-23 VoiceBox Technologies Corporation System and method for providing follow-up responses to prior natural language inputs of a user
WO2017029855A1 (en) * 2015-08-17 2017-02-23 ソーシャル ギア プライベート リミテッド Advertisement management system and advertisement management device
US20170249956A1 (en) * 2016-02-29 2017-08-31 International Business Machines Corporation Inferring User Intentions Based on User Conversation Data and Spatio-Temporal Data
Citations (123)
* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6181927B2 (en)
US4586160A (en) * 1982-04-07 1986-04-29 Tokyo Shibaura Denki Kabushiki Kaisha Method and apparatus for analyzing the syntactic structure of a sentence
US4791281A (en) 1986-10-16 1988-12-13 C.P.C. Investment Trust Encoding and decoding system
US5343493A (en) 1993-03-16 1994-08-30 Hughes Aircraft Company Personal assistance system and method for use with a cellular communication system
US5559707A (en) 1994-06-24 1996-09-24 Delorme Publishing Company Computer aided routing system
US5625668A (en) 1994-04-12 1997-04-29 Trimble Navigation Limited Position reporting cellular telephone
US5682525A (en) 1995-01-11 1997-10-28 Civix Corporation System and methods for remotely accessing a selected group of items of interest from a database
WO1997050002A1 (en) 1996-06-27 1997-12-31 Motorola Inc. Location determination in a communication system
US5717923A (en) 1994-11-03 1998-02-10 Intel Corporation Method and apparatus for dynamically customizing electronic information to individual end users
EP0837406A2 (en) 1996-08-02 1998-04-22 Symbol Technologies Inc. Data retrieval system and method
US5764731A (en) 1994-10-13 1998-06-09 Yablon; Jay R. Enhanced system for transferring, storing and using signaling information in a switched telephone network
US5774860A (en) * 1994-06-27 1998-06-30 U S West Technologies, Inc. Adaptive knowledge base of complex information through interactive voice dialogue
US5794204A (en) * 1995-06-22 1998-08-11 Seiko Epson Corporation Interactive speech recognition combining speaker-independent and speaker-specific word recognition, and having a response-creation capability
US5794235A (en) * 1996-04-12 1998-08-11 International Business Machines Corporation System and method for dynamic retrieval of relevant information by monitoring active data streams
US5804803A (en) 1996-04-02 1998-09-08 International Business Machines Corporation Mechanism for retrieving information using data encoded on an object
US5809471A (en) * 1996-03-07 1998-09-15 Ibm Corporation Retrieval of additional information not found in interactive TV or telephony signal by application using dynamically extracted vocabulary
WO1998049641A1 (en) 1997-04-29 1998-11-05 Mci Worldcom, Inc. System and method for automated lead generation and client contact management for a sales and marketing platform
US5860063A (en) * 1997-07-11 1999-01-12 At&T Corp Automated meaningful phrase clustering
JPH1146193A (en) 1997-07-28 1999-02-16 Yoichi Ishizuka Information server
JPH1165434A (en) 1997-08-13 1999-03-05 Hitachi Ltd Information provision system, information output method at terminal, mobile information terminal and information provision device
JPH1169404A (en) 1997-08-26 1999-03-09 Hitachi Ltd Area information service system and method
WO1999014743A1 (en) 1997-09-17 1999-03-25 Unisys Corporation System and method using natural language understanding for speech control application
JPH1182755A (en) 1997-09-03 1999-03-26 Mitsubishi Heavy Ind Ltd Fluid seal device
US5905246A (en) 1996-10-31 1999-05-18 Fajkowski; Peter W. Method and apparatus for coupon management and redemption
US5924070A (en) * 1997-06-06 1999-07-13 International Business Machines Corporation Corporate voice dialing with shared directories
US5963940A (en) * 1995-08-16 1999-10-05 Syracuse University Natural language information retrieval system and method
WO1999062013A1 (en) 1998-05-22 1999-12-02 Media Market Makers Ltd. Advertising system
JP2000067047A (en) 1998-08-24 2000-03-03 Toshiba Corp Interactive controller and method therefor
US6049711A (en) 1995-08-23 2000-04-11 Teletrac, Inc. Method and apparatus for providing location-based information services
WO2000021232A2 (en) 1998-10-02 2000-04-13 International Business Machines Corporation Conversational browser and conversational systems
WO2000029982A1 (en) 1998-11-12 2000-05-25 Bip Bottnia Internet Provider Ab Method for identifying a user of a network
US6073112A (en) 1996-07-19 2000-06-06 Geerlings; Huib Computer system for merchant communication to customers
US6076099A (en) 1997-09-09 2000-06-13 Chen; Thomas C. H. Method for configurable intelligent-agent-based wireless communication system
US6091956A (en) 1997-06-12 2000-07-18 Hollenberg; Dennis D. Situation information system
WO2000046792A1 (en) 1999-02-04 2000-08-10 Soliloquy, Inc. System and method for bilateral communication between a user and a system
US6112174A (en) * 1996-11-13 2000-08-29 Hitachi, Ltd. Recognition dictionary system structure and changeover method of speech recognition system for car navigation
US6125342A (en) * 1997-11-18 2000-09-26 L & H Applications Usa, Inc. Pronoun semantic analysis system and method
JP2000268042A (en) 1999-03-15 2000-09-29 Toshiba Corp Device and method for natural language interaction
JP2001004387A (en) 1999-06-23 2001-01-12 Toyota Motor Corp Portable terminal equipment and on-vehicle information processor
US6181927B1 (en) 1997-02-18 2001-01-30 Nortel Networks Corporation Sponsored call and cell service
US6185535B1 (en) * 1998-10-16 2001-02-06 Telefonaktiebolaget Lm Ericsson (Publ) Voice control of a user interface to service applications
JP2001043479A (en) 1999-07-30 2001-02-16 Kyocera Corp Road guide system and its guide method
JP2001057593A (en) 1999-06-09 2001-02-27 Adc Technology Kk Telephone repeater with advertisement
US6195641B1 (en) * 1998-03-27 2001-02-27 International Business Machines Corp. Network universal spoken language vocabulary
US6199099B1 (en) 1999-03-05 2001-03-06 Ac Properties B.V. System, method and article of manufacture for a mobile communication network utilizing a distributed communication network
US6202023B1 (en) 1996-08-22 2001-03-13 Go2 Systems, Inc. Internet based geographic location referencing system and method
JP2001101000A (en) 1999-09-29 2001-04-13 Toshiba Corp Device and method for natural language conversation
US6219696B1 (en) 1997-08-01 2001-04-17 Siemens Corporate Research, Inc. System for providing targeted internet information to mobile agents
US6233559B1 (en) * 1998-04-01 2001-05-15 Motorola, Inc. Speech control of multiple applications using applets
US6236977B1 (en) 1999-01-04 2001-05-22 Realty One, Inc. Computer implemented marketing system
US6243684B1 (en) 1999-02-19 2001-06-05 Usada, Inc. Directory assistance system and method utilizing a speech recognition system and a live operator
US6246672B1 (en) 1998-04-28 2001-06-12 International Business Machines Corp. Singlecast interactive radio system
US6250557B1 (en) 1998-08-25 2001-06-26 Telefonaktiebolaget Lm Ericsson (Publ) Methods and arrangements for a smart card wallet and uses thereof
US6301560B1 (en) * 1998-01-05 2001-10-09 Microsoft Corporation Discrete speech recognition system with ballooning active grammar
US6301480B1 (en) 1997-09-05 2001-10-09 @Track Communications, Inc. System and method for communicating using a voice network and a data network
US6308151B1 (en) * 1999-05-14 2001-10-23 International Business Machines Corp. Method and system using a speech recognition system to dictate a body of text in response to an available body of text
US6317718B1 (en) 1999-02-26 2001-11-13 Accenture Properties (2) B.V. System, method and article of manufacture for location-based filtering for shopping agent in the physical world
US20010044309A1 (en) 1997-01-08 2001-11-22 Abraham Bar Internet distributed real-time wireless location database
US6336098B1 (en) 1997-12-11 2002-01-01 International Business Machines Corp. Method for electronic distribution and redemption of coupons on the world wide web
US20020004745A1 (en) 2000-05-26 2002-01-10 Bascobert Michael R. Method for automated direct marketing
US20020029172A1 (en) 2000-04-20 2002-03-07 I'anson Colin Shopping assistance method and service system
US6360167B1 (en) 1999-01-29 2002-03-19 Magellan Dis, Inc. Vehicle navigation system with location-based multi-media annotation
US20020035568A1 (en) 2000-04-28 2002-03-21 Benthin Mark Louis Method and apparatus supporting dynamically adaptive user interactions in a multimodal communication system
US20020036654A1 (en) 2000-06-23 2002-03-28 Evans Jon C. System and method for computer-created advertisements
US20020040297A1 (en) 2000-09-29 2002-04-04 Professorq, Inc. Natural-language voice-activated personal assistant
US6370514B1 (en) 1999-08-02 2002-04-09 Marc A. Messner Method for marketing and redeeming vouchers for use in online purchases
US20020046084A1 (en) 1999-10-08 2002-04-18 Scott A. Steele Remotely configurable multimedia entertainment and information system with location based advertising
US6418199B1 (en) * 1997-12-05 2002-07-09 Jeffrey Perrone Voice control of a server
US6418216B1 (en) 1998-06-09 2002-07-09 International Business Machines Corporation Caller-controller barge-in telephone service
US20020090934A1 (en) 2000-11-22 2002-07-11 Mitchelmore Eliott R.D. Content and application delivery and management platform system and method
US6424945B1 (en) * 1999-12-15 2002-07-23 Nokia Corporation Voice packet data network browsing for mobile terminals system and method using a dual-mode wireless connection
US6434524B1 (en) * 1998-09-09 2002-08-13 One Voice Technologies, Inc. Object interactive user interface using speech recognition and natural language processing
US6434526B1 (en) * 1998-06-29 2002-08-13 International Business Machines Corporation Network application software services containing a speech recognition capability
US6452498B2 (en) 1995-06-06 2002-09-17 Wayport, Inc. System and method for providing geographic-based advertising
US20020133477A1 (en) 2001-03-05 2002-09-19 Glenn Abel Method for profile-based notice and broadcast of multimedia content
US6460036B1 (en) 1994-11-29 2002-10-01 Pinpoint Incorporated System and method for providing customized electronic newspapers and target advertisements
US20020143550A1 (en) * 2001-03-27 2002-10-03 Takashi Nakatsuyama Voice recognition shopping system
US6466796B1 (en) 1999-04-01 2002-10-15 Lucent Technologies Inc. System for providing location based service to a wireless telephone set in a telephone system
US20020161647A1 (en) 2001-04-27 2002-10-31 Gailey Michael L. Tracking purchases in a location-based services system
US20020161646A1 (en) 2001-04-27 2002-10-31 Gailey Michael L. Advertising campaign and business listing management for a location-based services system
US20020160772A1 (en) 2001-04-27 2002-10-31 Gailey Michael L. Routing call failures in a location-based services system
US20020161625A1 (en) 2001-02-23 2002-10-31 Valassis Communications, Inc. Online media planning system
US20020166127A1 (en) 1999-12-15 2002-11-07 Hitachi America, Ltd. System and method for providing advertisements in a wireless terminal
US6493671B1 (en) * 1998-10-02 2002-12-10 Motorola, Inc. Markup language for interactive services to notify a user of an event and methods thereof
US6502076B1 (en) 1999-06-01 2002-12-31 Ncr Corporation System and methods for determining and displaying product promotions
US6501833B2 (en) * 1995-05-26 2002-12-31 Speechworks International, Inc. Method and apparatus for dynamic adaptation of a large vocabulary speech recognition system and for use of constraints from a database in a large vocabulary speech recognition system
US6510417B1 (en) * 2000-03-21 2003-01-21 America Online, Inc. System and method for voice access to internet-based information
US6513052B1 (en) 1999-12-15 2003-01-28 Imation Corp. Targeted advertising over global computer networks
US20030041050A1 (en) 2001-04-16 2003-02-27 Greg Smith System and method for web-based marketing and campaign management
US6535854B2 (en) * 1997-10-23 2003-03-18 Sony International (Europe) Gmbh Speech recognition control of remotely controllable devices in a home network environment
US6535743B1 (en) 1998-07-29 2003-03-18 Minorplanet Systems Usa, Inc. System and method for providing directions using a communication network
US20030065749A1 (en) 2001-10-03 2003-04-03 Gailey Michael L. Service authorizer
US20030065620A1 (en) 2001-10-03 2003-04-03 Gailey Michael L. Virtual customer database
US6560456B1 (en) 1999-05-24 2003-05-06 Openwave Systems, Inc. System and method for providing subscriber-initiated information over the short message service (SMS) or a microbrowser
US20030135853A1 (en) 1999-03-08 2003-07-17 Phillip Y. Goldman System and method of inserting advertisements into an information retrieval system display
US6606745B2 (en) 2000-10-12 2003-08-12 Frank S. Maggio Method and system for communicating advertising and entertainment content and gathering consumer information
US20030154126A1 (en) 2002-02-11 2003-08-14 Gehlot Narayan L. System and method for identifying and offering advertising over the internet according to a generated recipient profile
US6614885B2 (en) 1998-08-14 2003-09-02 Intervoice Limited Partnership System and method for operating a highly distributed interactive voice response system
US20030182131A1 (en) * 2002-03-25 2003-09-25 Arnold James F. Method and apparatus for providing speech-driven routing between spoken language applications
US6647257B2 (en) 1998-01-21 2003-11-11 Leap Wireless International, Inc. System and method for providing targeted messages based on wireless mobile location
US6757544B2 (en) 2001-08-15 2004-06-29 Motorola, Inc. System and method for determining a location relevant to a communication device and/or its associated user
US6760426B2 (en) 2001-01-05 2004-07-06 Sprint Communications Company, L.P. Method and system for handling operator calls in a communication network
US20040166832A1 (en) 2001-10-03 2004-08-26 Accenture Global Services Gmbh Directory assistance with multi-modal messaging
US6792096B2 (en) 2002-04-11 2004-09-14 Sbc Technology Resources, Inc. Directory assistance dialog with configuration switches to switch from automated speech recognition to operator-assisted dialog
US6834195B2 (en) 2000-04-04 2004-12-21 Carl Brock Brandenberg Method and apparatus for scheduling presentation of digital content on a personal communication device
US6848542B2 (en) 2001-04-27 2005-02-01 Accenture Llp Method for passive mining of usage information in a location-based services system
US6850766B2 (en) 2000-04-26 2005-02-01 Wirenix, Inc. Voice activated wireless locator service
US6859777B2 (en) * 1994-11-14 2005-02-22 Siemens Aktiengesellschaft Hypertext navigation system controlled by spoken words
US6898571B1 (en) 2000-10-10 2005-05-24 Jordan Duvac Advertising enhancement using the internet
US6901366B1 (en) * 1999-08-26 2005-05-31 Matsushita Electric Industrial Co., Ltd. System and method for assessing TV-related information over the internet
US6907119B2 (en) 2001-03-08 2005-06-14 Qwest Communications International, Inc. Automated business directory assistance
US6937995B1 (en) 1997-11-14 2005-08-30 Concept Shopping, Inc. Method and system for distributing and reconciling electronic promotions
US6937986B2 (en) * 2000-12-28 2005-08-30 Comverse, Inc. Automatic dynamic speech recognition vocabulary based on external sources of information
US6961706B2 (en) 2000-10-12 2005-11-01 Pioneer Corporation Speech recognition method and apparatus
US6970830B1 (en) 1999-12-29 2005-11-29 General Electric Capital Corporation Methods and systems for analyzing marketing campaigns
US6996531B2 (en) 2001-03-30 2006-02-07 Comverse Ltd. Automated database assistance using a telephone for a speech based or text based multimedia communication mode
US7006983B1 (en) 2000-02-16 2006-02-28 Walker Digital, Llc Method and system for processing a rebate
US7020609B2 (en) * 1995-04-10 2006-03-28 Texas Instruments Incorporated Voice activated apparatus for accessing information on the World Wide Web
US7028072B1 (en) 1999-07-16 2006-04-11 Unicast Communications Corporation Method and apparatus for dynamically constructing customized advertisements
US7050977B1 (en) * 1999-11-12 2006-05-23 Phoenix Solutions, Inc. Speech-enabled server for internet website and method
US7130630B1 (en) 2000-12-19 2006-10-31 Bellsouth Intellectual Property Corporation Location query service for wireless networks
US7233655B2 (en) 2001-10-03 2007-06-19 Accenture Global Services Gmbh Multi-modal callback
US7254384B2 (en) 2001-10-03 2007-08-07 Accenture Global Services Gmbh Multi-modal messaging
Family Cites Families (3)
* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3485253B2 (en) * 1999-06-18 2004-01-13 インターナショナル・ビジネス・マシーンズ・コーポレーション An information processing method, an information terminal support server, a storage medium storing an information processing program
KR100385442B1 (en) * 2000-02-29 2003-05-27 이만균 System for processing a voice internet command language
KR20000063874A (en) * 2000-08-08 2000-11-06 정홍선 Mobile Commerce System : MCS
Patent Citations (130)
* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6181927B2 (en)
US4586160A (en) * 1982-04-07 1986-04-29 Tokyo Shibaura Denki Kabushiki Kaisha Method and apparatus for analyzing the syntactic structure of a sentence
US4791281A (en) 1986-10-16 1988-12-13 C.P.C. Investment Trust Encoding and decoding system
US5343493A (en) 1993-03-16 1994-08-30 Hughes Aircraft Company Personal assistance system and method for use with a cellular communication system
US5625668A (en) 1994-04-12 1997-04-29 Trimble Navigation Limited Position reporting cellular telephone
US5559707A (en) 1994-06-24 1996-09-24 Delorme Publishing Company Computer aided routing system
US5774860A (en) * 1994-06-27 1998-06-30 U S West Technologies, Inc. Adaptive knowledge base of complex information through interactive voice dialogue
US5764731A (en) 1994-10-13 1998-06-09 Yablon; Jay R. Enhanced system for transferring, storing and using signaling information in a switched telephone network
US5717923A (en) 1994-11-03 1998-02-10 Intel Corporation Method and apparatus for dynamically customizing electronic information to individual end users
US6859777B2 (en) * 1994-11-14 2005-02-22 Siemens Aktiengesellschaft Hypertext navigation system controlled by spoken words
US6460036B1 (en) 1994-11-29 2002-10-01 Pinpoint Incorporated System and method for providing customized electronic newspapers and target advertisements
US6408307B1 (en) 1995-01-11 2002-06-18 Civix-Ddi, Llc System and methods for remotely accessing a selected group of items of interest from a database
US5682525A (en) 1995-01-11 1997-10-28 Civix Corporation System and methods for remotely accessing a selected group of items of interest from a database
US7020609B2 (en) * 1995-04-10 2006-03-28 Texas Instruments Incorporated Voice activated apparatus for accessing information on the World Wide Web
US6501833B2 (en) * 1995-05-26 2002-12-31 Speechworks International, Inc. Method and apparatus for dynamic adaptation of a large vocabulary speech recognition system and for use of constraints from a database in a large vocabulary speech recognition system
US6452498B2 (en) 1995-06-06 2002-09-17 Wayport, Inc. System and method for providing geographic-based advertising
US5794204A (en) * 1995-06-22 1998-08-11 Seiko Epson Corporation Interactive speech recognition combining speaker-independent and speaker-specific word recognition, and having a response-creation capability
US5963940A (en) * 1995-08-16 1999-10-05 Syracuse University Natural language information retrieval system and method
US6049711A (en) 1995-08-23 2000-04-11 Teletrac, Inc. Method and apparatus for providing location-based information services
US5809471A (en) * 1996-03-07 1998-09-15 Ibm Corporation Retrieval of additional information not found in interactive TV or telephony signal by application using dynamically extracted vocabulary
US5804803A (en) 1996-04-02 1998-09-08 International Business Machines Corporation Mechanism for retrieving information using data encoded on an object
US5794235A (en) * 1996-04-12 1998-08-11 International Business Machines Corporation System and method for dynamic retrieval of relevant information by monitoring active data streams
WO1997050002A1 (en) 1996-06-27 1997-12-31 Motorola Inc. Location determination in a communication system
US6073112A (en) 1996-07-19 2000-06-06 Geerlings; Huib Computer system for merchant communication to customers
EP0837406A2 (en) 1996-08-02 1998-04-22 Symbol Technologies Inc. Data retrieval system and method
US6202023B1 (en) 1996-08-22 2001-03-13 Go2 Systems, Inc. Internet based geographic location referencing system and method
US5905246A (en) 1996-10-31 1999-05-18 Fajkowski; Peter W. Method and apparatus for coupon management and redemption
US6112174A (en) * 1996-11-13 2000-08-29 Hitachi, Ltd. Recognition dictionary system structure and changeover method of speech recognition system for car navigation
US20010044309A1 (en) 1997-01-08 2001-11-22 Abraham Bar Internet distributed real-time wireless location database
US6181927B1 (en) 1997-02-18 2001-01-30 Nortel Networks Corporation Sponsored call and cell service
WO1998049641A1 (en) 1997-04-29 1998-11-05 Mci Worldcom, Inc. System and method for automated lead generation and client contact management for a sales and marketing platform
US5924070A (en) * 1997-06-06 1999-07-13 International Business Machines Corporation Corporate voice dialing with shared directories
US6091956A (en) 1997-06-12 2000-07-18 Hollenberg; Dennis D. Situation information system
US5860063A (en) * 1997-07-11 1999-01-12 At&T Corp Automated meaningful phrase clustering
JPH1146193A (en) 1997-07-28 1999-02-16 Yoichi Ishizuka Information server
US6219696B1 (en) 1997-08-01 2001-04-17 Siemens Corporate Research, Inc. System for providing targeted internet information to mobile agents
JPH1165434A (en) 1997-08-13 1999-03-05 Hitachi Ltd Information provision system, information output method at terminal, mobile information terminal and information provision device
JPH1169404A (en) 1997-08-26 1999-03-09 Hitachi Ltd Area information service system and method
JPH1182755A (en) 1997-09-03 1999-03-26 Mitsubishi Heavy Ind Ltd Fluid seal device
US6301480B1 (en) 1997-09-05 2001-10-09 @Track Communications, Inc. System and method for communicating using a voice network and a data network
US6076099A (en) 1997-09-09 2000-06-13 Chen; Thomas C. H. Method for configurable intelligent-agent-based wireless communication system
JP2001516905A (en) 1997-09-17 2001-10-02 ユニシス コーポレイシヨン The system and method using a natural language understanding for voice control applications
WO1999014743A1 (en) 1997-09-17 1999-03-25 Unisys Corporation System and method using natural language understanding for speech control application
US6535854B2 (en) * 1997-10-23 2003-03-18 Sony International (Europe) Gmbh Speech recognition control of remotely controllable devices in a home network environment
US6937995B1 (en) 1997-11-14 2005-08-30 Concept Shopping, Inc. Method and system for distributing and reconciling electronic promotions
US6125342A (en) * 1997-11-18 2000-09-26 L & H Applications Usa, Inc. Pronoun semantic analysis system and method
US6418199B1 (en) * 1997-12-05 2002-07-09 Jeffrey Perrone Voice control of a server
US6336098B1 (en) 1997-12-11 2002-01-01 International Business Machines Corp. Method for electronic distribution and redemption of coupons on the world wide web
US6301560B1 (en) * 1998-01-05 2001-10-09 Microsoft Corporation Discrete speech recognition system with ballooning active grammar
US6647257B2 (en) 1998-01-21 2003-11-11 Leap Wireless International, Inc. System and method for providing targeted messages based on wireless mobile location
US6195641B1 (en) * 1998-03-27 2001-02-27 International Business Machines Corp. Network universal spoken language vocabulary
US6233559B1 (en) * 1998-04-01 2001-05-15 Motorola, Inc. Speech control of multiple applications using applets
US6246672B1 (en) 1998-04-28 2001-06-12 International Business Machines Corp. Singlecast interactive radio system
WO1999062013A1 (en) 1998-05-22 1999-12-02 Media Market Makers Ltd. Advertising system
US6418216B1 (en) 1998-06-09 2002-07-09 International Business Machines Corporation Caller-controller barge-in telephone service
US6434526B1 (en) * 1998-06-29 2002-08-13 International Business Machines Corporation Network application software services containing a speech recognition capability
US6535743B1 (en) 1998-07-29 2003-03-18 Minorplanet Systems Usa, Inc. System and method for providing directions using a communication network
US6614885B2 (en) 1998-08-14 2003-09-02 Intervoice Limited Partnership System and method for operating a highly distributed interactive voice response system
JP2000067047A (en) 1998-08-24 2000-03-03 Toshiba Corp Interactive controller and method therefor
US6250557B1 (en) 1998-08-25 2001-06-26 Telefonaktiebolaget Lm Ericsson (Publ) Methods and arrangements for a smart card wallet and uses thereof
US6434524B1 (en) * 1998-09-09 2002-08-13 One Voice Technologies, Inc. Object interactive user interface using speech recognition and natural language processing
US6493671B1 (en) * 1998-10-02 2002-12-10 Motorola, Inc. Markup language for interactive services to notify a user of an event and methods thereof
WO2000021232A2 (en) 1998-10-02 2000-04-13 International Business Machines Corporation Conversational browser and conversational systems
US6185535B1 (en) * 1998-10-16 2001-02-06 Telefonaktiebolaget Lm Ericsson (Publ) Voice control of a user interface to service applications
WO2000029982A1 (en) 1998-11-12 2000-05-25 Bip Bottnia Internet Provider Ab Method for identifying a user of a network
US6236977B1 (en) 1999-01-04 2001-05-22 Realty One, Inc. Computer implemented marketing system
US6360167B1 (en) 1999-01-29 2002-03-19 Magellan Dis, Inc. Vehicle navigation system with location-based multi-media annotation
WO2000046792A1 (en) 1999-02-04 2000-08-10 Soliloquy, Inc. System and method for bilateral communication between a user and a system
JP2002536755A (en) 1999-02-04 2002-10-29 ソリロクイ インコーポレイテッド Mutual communication system and method between users and the system
US6243684B1 (en) 1999-02-19 2001-06-05 Usada, Inc. Directory assistance system and method utilizing a speech recognition system and a live operator
US6317718B1 (en) 1999-02-26 2001-11-13 Accenture Properties (2) B.V. System, method and article of manufacture for location-based filtering for shopping agent in the physical world
US6199099B1 (en) 1999-03-05 2001-03-06 Ac Properties B.V. System, method and article of manufacture for a mobile communication network utilizing a distributed communication network
US20030135853A1 (en) 1999-03-08 2003-07-17 Phillip Y. Goldman System and method of inserting advertisements into an information retrieval system display
JP2000268042A (en) 1999-03-15 2000-09-29 Toshiba Corp Device and method for natural language interaction
US6466899B1 (en) 1999-03-15 2002-10-15 Kabushiki Kaisha Toshiba Natural language dialogue apparatus and method
US6466796B1 (en) 1999-04-01 2002-10-15 Lucent Technologies Inc. System for providing location based service to a wireless telephone set in a telephone system
US6308151B1 (en) * 1999-05-14 2001-10-23 International Business Machines Corp. Method and system using a speech recognition system to dictate a body of text in response to an available body of text
US6560456B1 (en) 1999-05-24 2003-05-06 Openwave Systems, Inc. System and method for providing subscriber-initiated information over the short message service (SMS) or a microbrowser
US6502076B1 (en) 1999-06-01 2002-12-31 Ncr Corporation System and methods for determining and displaying product promotions
JP2001057593A (en) 1999-06-09 2001-02-27 Adc Technology Kk Telephone repeater with advertisement
JP2001004387A (en) 1999-06-23 2001-01-12 Toyota Motor Corp Portable terminal equipment and on-vehicle information processor
US6427115B1 (en) 1999-06-23 2002-07-30 Toyota Jidosha Kabushiki Kaisha Portable terminal and on-vehicle information processing device
US7028072B1 (en) 1999-07-16 2006-04-11 Unicast Communications Corporation Method and apparatus for dynamically constructing customized advertisements
JP2001043479A (en) 1999-07-30 2001-02-16 Kyocera Corp Road guide system and its guide method
US6370514B1 (en) 1999-08-02 2002-04-09 Marc A. Messner Method for marketing and redeeming vouchers for use in online purchases
US6901366B1 (en) * 1999-08-26 2005-05-31 Matsushita Electric Industrial Co., Ltd. System and method for assessing TV-related information over the internet
JP2001101000A (en) 1999-09-29 2001-04-13 Toshiba Corp Device and method for natural language conversation
US20020046084A1 (en) 1999-10-08 2002-04-18 Scott A. Steele Remotely configurable multimedia entertainment and information system with location based advertising
US7050977B1 (en) * 1999-11-12 2006-05-23 Phoenix Solutions, Inc. Speech-enabled server for internet website and method
US6513052B1 (en) 1999-12-15 2003-01-28 Imation Corp. Targeted advertising over global computer networks
US20020166127A1 (en) 1999-12-15 2002-11-07 Hitachi America, Ltd. System and method for providing advertisements in a wireless terminal
US6424945B1 (en) * 1999-12-15 2002-07-23 Nokia Corporation Voice packet data network browsing for mobile terminals system and method using a dual-mode wireless connection
US6970830B1 (en) 1999-12-29 2005-11-29 General Electric Capital Corporation Methods and systems for analyzing marketing campaigns
US7006983B1 (en) 2000-02-16 2006-02-28 Walker Digital, Llc Method and system for processing a rebate
US6510417B1 (en) * 2000-03-21 2003-01-21 America Online, Inc. System and method for voice access to internet-based information
US6834195B2 (en) 2000-04-04 2004-12-21 Carl Brock Brandenberg Method and apparatus for scheduling presentation of digital content on a personal communication device
US20020029172A1 (en) 2000-04-20 2002-03-07 I'anson Colin Shopping assistance method and service system
US6850766B2 (en) 2000-04-26 2005-02-01 Wirenix, Inc. Voice activated wireless locator service
US20020035568A1 (en) 2000-04-28 2002-03-21 Benthin Mark Louis Method and apparatus supporting dynamically adaptive user interactions in a multimodal communication system
US20020004745A1 (en) 2000-05-26 2002-01-10 Bascobert Michael R. Method for automated direct marketing
US20020036654A1 (en) 2000-06-23 2002-03-28 Evans Jon C. System and method for computer-created advertisements
US20020040297A1 (en) 2000-09-29 2002-04-04 Professorq, Inc. Natural-language voice-activated personal assistant
US6898571B1 (en) 2000-10-10 2005-05-24 Jordan Duvac Advertising enhancement using the internet
US6606745B2 (en) 2000-10-12 2003-08-12 Frank S. Maggio Method and system for communicating advertising and entertainment content and gathering consumer information
US6961706B2 (en) 2000-10-12 2005-11-01 Pioneer Corporation Speech recognition method and apparatus
US20020090934A1 (en) 2000-11-22 2002-07-11 Mitchelmore Eliott R.D. Content and application delivery and management platform system and method
US7130630B1 (en) 2000-12-19 2006-10-31 Bellsouth Intellectual Property Corporation Location query service for wireless networks
US6937986B2 (en) * 2000-12-28 2005-08-30 Comverse, Inc. Automatic dynamic speech recognition vocabulary based on external sources of information
US6760426B2 (en) 2001-01-05 2004-07-06 Sprint Communications Company, L.P. Method and system for handling operator calls in a communication network
US20020161625A1 (en) 2001-02-23 2002-10-31 Valassis Communications, Inc. Online media planning system
US20020133477A1 (en) 2001-03-05 2002-09-19 Glenn Abel Method for profile-based notice and broadcast of multimedia content
US6907119B2 (en) 2001-03-08 2005-06-14 Qwest Communications International, Inc. Automated business directory assistance
US20020143550A1 (en) * 2001-03-27 2002-10-03 Takashi Nakatsuyama Voice recognition shopping system
US6996531B2 (en) 2001-03-30 2006-02-07 Comverse Ltd. Automated database assistance using a telephone for a speech based or text based multimedia communication mode
US20030041050A1 (en) 2001-04-16 2003-02-27 Greg Smith System and method for web-based marketing and campaign management
US20050102180A1 (en) 2001-04-27 2005-05-12 Accenture Llp Passive mining of usage information in a location-based services system
US6848542B2 (en) 2001-04-27 2005-02-01 Accenture Llp Method for passive mining of usage information in a location-based services system
US20020160772A1 (en) 2001-04-27 2002-10-31 Gailey Michael L. Routing call failures in a location-based services system
US20020161647A1 (en) 2001-04-27 2002-10-31 Gailey Michael L. Tracking purchases in a location-based services system
US6944447B2 (en) 2001-04-27 2005-09-13 Accenture Llp Location-based services
US20020161646A1 (en) 2001-04-27 2002-10-31 Gailey Michael L. Advertising campaign and business listing management for a location-based services system
US6757544B2 (en) 2001-08-15 2004-06-29 Motorola, Inc. System and method for determining a location relevant to a communication device and/or its associated user
US20030065749A1 (en) 2001-10-03 2003-04-03 Gailey Michael L. Service authorizer
US7254384B2 (en) 2001-10-03 2007-08-07 Accenture Global Services Gmbh Multi-modal messaging
US20040166832A1 (en) 2001-10-03 2004-08-26 Accenture Global Services Gmbh Directory assistance with multi-modal messaging
US20030065620A1 (en) 2001-10-03 2003-04-03 Gailey Michael L. Virtual customer database
US7233655B2 (en) 2001-10-03 2007-06-19 Accenture Global Services Gmbh Multi-modal callback
US20030154126A1 (en) 2002-02-11 2003-08-14 Gehlot Narayan L. System and method for identifying and offering advertising over the internet according to a generated recipient profile
US20030182131A1 (en) * 2002-03-25 2003-09-25 Arnold James F. Method and apparatus for providing speech-driven routing between spoken language applications
US6792096B2 (en) 2002-04-11 2004-09-14 Sbc Technology Resources, Inc. Directory assistance dialog with configuration switches to switch from automated speech recognition to operator-assisted dialog
Non-Patent Citations (2)
* Cited by examiner, † Cited by third party
Title
"The Risks Digest," ACM Committee on Computers and Public Policy, Peter G. Neumann, moderator, vol. 21, Issue 5, Sep. 2000, http://catless.ncl.ac.uk/Risks/21.05.html.
Akiyama, T., Niwa, M. Watanabe, M., Tomikashi, M., Konishi, T., Itoh, Y., "Constructing a Natural Language Interface of Car Navigation Systems," Collection of Reports Produced to the Information Processing Academy, vol. 99, No. ITS-2, pp. 53-60, published by the Information Processing Academy on Jun. 1999; (Translation - Abstract only)
Cited By (58)
* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7860519B2 (en) 2001-04-27 2010-12-28 Accenture Global Services Limited Location-based services system
US8738437B2 (en) 2001-04-27 2014-05-27 Accenture Global Services Limited Passive mining of usage information in a location-based services system
US7970648B2 (en) 2001-04-27 2011-06-28 Accenture Global Services Limited Advertising campaign and business listing management for a location-based services system
US20050234727A1 (en) * 2001-07-03 2005-10-20 Leo Chiu Method and apparatus for adapting a voice extensible markup language-enabled voice system for natural speech recognition and system response
US20110106527A1 (en) * 2001-07-03 2011-05-05 Apptera, Inc. Method and Apparatus for Adapting a Voice Extensible Markup Language-enabled Voice System for Natural Speech Recognition and System Response
US8073920B2 (en) 2001-10-03 2011-12-06 Accenture Global Services Limited Service authorizer
US8527421B2 (en) 2001-10-03 2013-09-03 Accenture Global Services Limited Virtual customer database
US7640232B2 (en) * 2003-10-14 2009-12-29 Aol Llc Search enhancement system with information from a selected source
US20050080771A1 (en) * 2003-10-14 2005-04-14 Fish Edmund J. Search enhancement system with information from a selected source
US8954325B1 (en) * 2004-03-22 2015-02-10 Rockstar Consortium Us Lp Speech recognition in automated information services systems
US20050288935A1 (en) * 2004-06-28 2005-12-29 Yun-Wen Lee Integrated dialogue system and method thereof
US20100042400A1 (en) * 2005-12-21 2010-02-18 Hans-Ulrich Block Method for Triggering at Least One First and Second Background Application via a Universal Language Dialog System
US8494862B2 (en) * 2005-12-21 2013-07-23 Siemens Enterprise Communications Gmbh & Co. Kg Method for triggering at least one first and second background application via a universal language dialog system
US20070203735A1 (en) * 2006-02-28 2007-08-30 Commonwealth Intellectual Property Holdings, Inc. Transaction Enabled Information System
US20070203736A1 (en) * 2006-02-28 2007-08-30 Commonwealth Intellectual Property Holdings, Inc. Interactive 411 Directory Assistance
US9549065B1 (en) 2006-05-22 2017-01-17 Convergys Customer Management Delaware Llc System and method for automated customer service with contingent live interaction
US8379830B1 (en) 2006-05-22 2013-02-19 Convergys Customer Management Delaware Llc System and method for automated customer service with contingent live interaction
US8831930B2 (en) 2006-10-13 2014-09-09 Google Inc. Business listing search
US9460712B1 (en) * 2006-10-13 2016-10-04 Google Inc. Business listing search
US20080091443A1 (en) * 2006-10-13 2008-04-17 Brian Strope Business listing search
US20110047139A1 (en) * 2006-10-13 2011-02-24 Google Inc. Business Listing Search
US8041568B2 (en) * 2006-10-13 2011-10-18 Google Inc. Business listing search
US20100076955A1 (en) * 2006-12-19 2010-03-25 Koninklijke Kpn N.V. The Hague, The Netherlands Data network service based on profiling client-addresses
US8938392B2 (en) * 2007-02-27 2015-01-20 Nuance Communications, Inc. Configuring a speech engine for a multimodal application based on location
US9208783B2 (en) 2007-02-27 2015-12-08 Nuance Communications, Inc. Altering behavior of a multimodal application based on location
US8892126B2 (en) 2007-04-08 2014-11-18 Enhanced Geographic Llc Systems and methods to determine the name of a physical business location visited by a user of a wireless device based on location information and the time of day
US9008691B2 (en) 2007-04-08 2015-04-14 Enhanced Geographic Llc Systems and methods to provide an advertisement relating to a recommended business to a user of a wireless device based on a location history of visited physical named locations associated with the user
US8996035B2 (en) 2007-04-08 2015-03-31 Enhanced Geographic Llc Mobile advertisement with social component for geo-social networking system
US9521524B2 (en) 2007-04-08 2016-12-13 Enhanced Geographic Llc Specific methods that improve the functionality of a location based service system by determining and verifying the branded name of an establishment visited by a user of a wireless device based on approximate geographic location coordinate data received by the system from the wireless device
US9076165B2 (en) 2007-04-08 2015-07-07 Enhanced Geographic Llc Systems and methods to determine the name of a physical business location visited by a user of a wireless device and verify the authenticity of reviews of the physical business location
US9277366B2 (en) 2007-04-08 2016-03-01 Enhanced Geographic Llc Systems and methods to determine a position within a physical location visited by a user of a wireless device using Bluetooth® transmitters configured to transmit identification numbers and transmitter identification data
US8768379B2 (en) 2007-04-08 2014-07-01 Enhanced Geographic Llc Systems and methods to recommend businesses to a user of a wireless device based on a location history associated with the user
US8774839B2 (en) 2007-04-08 2014-07-08 Enhanced Geographic Llc Confirming a venue of user location
US20080306924A1 (en) * 2007-06-05 2008-12-11 Paolini Michael A Mobile telephone object lookup and identification
US20140195234A1 (en) * 2008-03-07 2014-07-10 Google Inc. Voice Recognition Grammar Selection Based on Content
US8527279B2 (en) * 2008-03-07 2013-09-03 Google Inc. Voice recognition grammar selection based on context
US8255224B2 (en) * 2008-03-07 2012-08-28 Google Inc. Voice recognition grammar selection based on context
US20090228281A1 (en) * 2008-03-07 2009-09-10 Google Inc. Voice Recognition Grammar Selection Based on Context
US9858921B2 (en) * 2008-03-07 2018-01-02 Google Inc. Voice recognition grammar selection based on context
US9081860B2 (en) 2008-08-22 2015-07-14 Google Inc. Integration of device location into search
US20100138402A1 (en) * 2008-12-02 2010-06-03 Chacha Search, Inc. Method and system for improving utilization of human searchers
US20110093265A1 (en) * 2009-10-16 2011-04-21 Amanda Stent Systems and Methods for Creating and Using Geo-Centric Language Models
US8255217B2 (en) * 2009-10-16 2012-08-28 At&T Intellectual Property I, Lp Systems and methods for creating and using geo-centric language models
US20110106617A1 (en) * 2009-10-29 2011-05-05 Chacha Search, Inc. Method and system of processing a query using human assistants
US9159322B2 (en) * 2011-10-18 2015-10-13 GM Global Technology Operations LLC Services identification and initiation for a speech-based interface to a mobile device
US9183835B2 (en) * 2011-10-18 2015-11-10 GM Global Technology Operations LLC Speech-based user interface for a mobile device
US20130197915A1 (en) * 2011-10-18 2013-08-01 GM Global Technology Operations LLC Speech-based user interface for a mobile device
US20130197907A1 (en) * 2011-10-18 2013-08-01 GM Global Technology Operations LLC Services identification and initiation for a speech-based interface to a mobile device
US20130103404A1 (en) * 2011-10-21 2013-04-25 GM Global Technology Operations LLC Mobile voice platform architecture
US9326088B2 (en) 2011-10-21 2016-04-26 GM Global Technology Operations LLC Mobile voice platform architecture with remote service interfaces
US9436967B2 (en) 2012-03-14 2016-09-06 Accenture Global Services Limited System for providing extensible location-based services
US9773286B2 (en) 2012-03-14 2017-09-26 Accenture Global Services Limited System for providing extensible location-based services
US20140032574A1 (en) * 2012-07-23 2014-01-30 Emdadur R. Khan Natural language understanding using brain-like approach: semantic engine using brain-like approach (sebla) derives semantics of words and sentences
US20140324431A1 (en) * 2013-04-25 2014-10-30 Sensory, Inc. System, Method, and Apparatus for Location-Based Context Driven Voice Recognition
US9734254B2 (en) 2015-01-13 2017-08-15 Bank Of America Corporation Method and apparatus for automatic completion of an entry into an input field
US9858614B2 (en) 2015-04-16 2018-01-02 Accenture Global Services Limited Future order throttling
US9760833B2 (en) 2015-06-01 2017-09-12 Accenture Global Services Limited Trigger repeat order notifications
US9239987B1 (en) 2015-06-01 2016-01-19 Accenture Global Services Limited Trigger repeat order notifications
Also Published As
Publication number Publication date Type
CA2444521A1 (en) 2002-11-07 application
KR100718617B1 (en) 2007-05-16 grant
EP1391127B1 (en) 2012-04-04 grant
KR100870798B1 (en) 2008-11-27 grant
KR20070098957A (en) 2007-10-05 application
EP1391127A2 (en) 2004-02-25 application
JP2007265422A (en) 2007-10-11 application
CA2444521C (en) 2011-07-26 grant
EP1391127A4 (en) 2007-11-28 application
KR20050119216A (en) 2005-12-20 application
KR20060058726A (en) 2006-05-30 application
US20040243417A9 (en) 2004-12-02 application
KR100798574B1 (en) 2006-05-30 grant
JP5124160B2 (en) 2013-01-23 grant
WO2002088880A3 (en) 2003-05-22 application
US20020161587A1 (en) 2002-10-31 application
WO2002088880A2 (en) 2002-11-07 application
Similar Documents
Publication Publication Date Title
US7519536B2 (en) System and method for providing network coordinated conversational services
US6721705B2 (en) Robust voice browser system and voice activated device controller
US6985933B1 (en) Method and system for increasing ease-of-use and bandwidth utilization in wireless devices
US7039165B1 (en) System and method for personalizing an interactive voice broadcast of a voice service based on automatic number identification
US7334050B2 (en) Voice applications and voice-based interface
US7328155B2 (en) Method and system for speech recognition using grammar weighted based upon location information
US7502738B2 (en) Systems and methods for responding to natural language speech utterance
US8005680B2 (en) Method for personalization of a service
US20020010000A1 (en) Knowledge-based information retrieval system and method for wireless communication device
US20030120626A1 (en) Voice-enabled, consumer transaction system
US6192338B1 (en) Natural language knowledge servers as network resources
US20090055175A1 (en) Continuous speech transcription performance indication
US8706503B2 (en) Intent deduction based on previous user interactions with voice assistant
US7522711B1 (en) Delivery of audio driving directions via a telephone interface
US20090125499A1 (en) Machine-moderated mobile social networking for managing queries
US20110112921A1 (en) System and method for providing a natural language content dedication service
US20080065486A1 (en) Personalized audio controlled shopping information service for a mobile device
US20030078779A1 (en) Interactive voice response system
US20100217604A1 (en) System and method for processing multi-modal device interactions in a natural language voice services environment
US20020193997A1 (en) System, method and computer program product for dynamic billing using tags in a speech recognition framework
US20090327263A1 (en) Background contextual conversational search
EP2575128A2 (en) Using context information to facilitate processing of commands in a virtual assistant
US20070174258A1 (en) Targeted mobile device advertisements
US7254384B2 (en) Multi-modal messaging
US20100106497A1 (en) Internal and external speech recognition use with a mobile communication facility
Legal Events
Date Code Title Description
AS Assignment
Owner name: ACCENTURE LLP, ILLINOIS
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:PITTS III, ASHTON F.;DEMPSEN, STEPHEN L.;CHE, VINNY WAI-YAN;REEL/FRAME:012836/0558;SIGNING DATES FROM 20020423 TO 20020424
Owner name: ACCENTURE LLP, ILLINOIS
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:PITTS III, ASHTON F.;DEMPSEN, STEPHEN L.;CHE, VINNY WAI-YAN;SIGNING DATES FROM 20020423 TO 20020424;REEL/FRAME:012836/0558
CC Certificate of correction
AS Assignment
Owner name: ACCENTURE GLOBAL SERVICES GMBH, SWITZERLAND
Free format text: CONFIRMATORY ASSIGNMENT;ASSIGNOR:ACCENTURE LLP;REEL/FRAME:024946/0971
Effective date: 20100831
AS Assignment
Owner name: ACCENTURE GLOBAL SERVICES LIMITED, IRELAND
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:ACCENTURE GLOBAL SERVICES GMBH;REEL/FRAME:025700/0287
Effective date: 20100901
FPAY Fee payment
Year of fee payment: 4
FPAY Fee payment
Year of fee payment: 8
|
{
"url": "https://patents.google.com/patent/US7437295",
"source_domain": "patents.google.com",
"snapshot_id": "crawl=CC-MAIN-2018-09",
"warc_metadata": {
"Content-Length": "515631",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WO6BVBAUGZWI3RAWMZ4ZFUX3OJB3I2F2",
"WARC-Concurrent-To": "<urn:uuid:07f0996c-82ea-4d81-9429-dec0fc4e2d80>",
"WARC-Date": "2018-02-22T23:04:58Z",
"WARC-IP-Address": "172.217.7.174",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HFQGROFXGORSYZQW6YI4XENXR4HAFOLI",
"WARC-Record-ID": "<urn:uuid:20206b50-b61c-437d-be57-7f2883cd08f1>",
"WARC-Target-URI": "https://patents.google.com/patent/US7437295",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3e65d66c-0b58-4c4a-baad-1112955bf442>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-149-106-156.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,
81,
82,
147,
148,
161,
162,
167,
168,
187,
199,
401,
411,
414,
427,
433,
445,
464,
476,
483,
492,
500,
509,
524,
715,
731,
750,
761,
776,
798,
820,
829,
850,
869,
887,
1060,
1090,
1108,
1122,
1313,
1325,
1342,
1353,
1354,
1360,
1361,
1368,
1369,
1385,
1386,
1401,
1443,
1488,
1603,
1704,
1834,
1871,
1906,
1942,
2021,
2036,
2078,
2123,
2238,
2339,
2471,
2498,
2533,
2567,
2633,
2648,
2690,
2735,
2850,
2951,
3012,
3164,
3268,
3283,
3325,
3637,
3679,
3874,
3889,
3931,
4243,
4296,
4476,
4491,
4531,
4654,
4688,
4735,
4815,
4866,
4885,
4927,
5005,
5111,
5299,
5318,
5360,
5395,
5447,
5525,
5612,
5631,
5673,
5708,
5760,
5838,
5930,
5949,
5991,
6026,
6078,
6156,
6269,
6431,
6474,
6493,
6535,
6578,
6688,
6815,
6834,
6876,
6919,
7029,
7157,
7172,
7212,
7335,
7369,
7407,
7422,
7462,
7585,
7619,
7687,
7800,
7819,
7861,
7939,
8045,
8170,
8200,
8219,
8261,
8296,
8403,
8535,
8554,
8596,
8631,
8751,
8889,
8908,
8950,
8985,
9033,
9139,
9158,
9200,
9235,
9283,
9346,
9347,
9356,
9357,
9960,
9961,
9973,
9974,
11161,
11162,
11185,
11186,
11460,
11461,
11489,
11490,
12112,
12113,
12729,
12730,
13461,
13462,
14367,
14368,
14401,
14402,
15210,
15211,
16257,
16258,
16839,
16840,
17409,
17410,
18453,
18454,
19222,
19223,
19450,
19451,
19485,
19486,
19567,
19568,
19710,
19711,
19837,
19838,
19937,
19938,
20035,
20036,
20152,
20153,
20230,
20231,
20891,
20892,
21706,
21707,
22444,
22445,
23059,
23060,
23688,
23689,
24420,
24421,
24935,
24936,
25849,
25850,
26561,
26562,
27145,
27146,
27799,
27800,
28437,
28438,
29165,
29166,
29997,
29998,
31285,
31286,
32286,
32287,
33003,
33004,
33768,
33769,
34229,
34230,
34941,
34942,
35567,
35568,
36950,
36951,
37871,
37872,
38447,
38448,
38960,
38961,
39612,
39613,
40557,
40558,
41231,
41232,
41786,
41787,
42426,
42427,
43045,
43046,
44029,
44030,
44892,
44893,
45673,
45674,
46674,
46675,
47606,
47607,
48328,
48329,
48877,
48878,
49540,
49541,
50137,
50138,
50880,
50881,
51574,
51575,
52530,
52531,
53472,
53473,
54528,
54529,
55245,
55246,
56200,
56201,
57141,
57142,
57991,
57992,
58887,
58888,
59472,
59473,
60703,
60704,
61615,
61616,
62328,
62329,
63242,
63243,
64386,
64387,
65240,
65241,
66010,
66011,
66725,
66726,
67736,
67737,
68560,
68561,
69363,
69364,
70009,
70010,
70857,
70858,
71497,
71498,
72336,
72337,
73159,
73160,
74034,
74035,
74810,
74811,
75859,
75860,
76102,
76103,
76115,
76116,
76221,
76336,
76471,
76700,
76764,
77147,
77275,
77559,
77745,
77874,
78069,
78167,
78260,
78351,
78467,
78844,
78971,
79238,
79488,
79570,
79849,
80173,
80386,
80675,
80970,
81159,
81374,
81528,
81681,
81807,
81967,
82130,
82369,
82485,
82617,
82752,
82806,
82895,
82971,
83353,
83655,
83907,
84172,
84303,
84504,
84599,
84692,
84812,
85192,
85394,
85574,
85707,
85708,
85734,
85735,
85786,
85824,
85898,
86013,
86014,
86050,
86051,
86102,
86217,
86290,
86374,
86447,
86572,
86835,
86908,
86985,
87062,
87139,
87278,
87399,
87510,
87583,
87718,
87791,
87885,
88011,
88012,
88044,
88045,
88096,
88191,
88192,
88209,
88210,
88246,
88299,
88352,
88397,
88398,
88405,
88406,
88418,
88419,
88443,
88444,
88495,
88628,
88629,
88648,
88649,
88662,
88686,
88710,
88736,
88759,
88783,
88810,
88811,
88825,
88826,
88870,
88935,
89061,
89256,
89359,
89493,
89625,
89707,
89820,
89930,
90107,
90257,
90385,
90489,
90570,
90699,
90827,
90990,
91082,
91246,
91362,
91530,
91659,
91758,
91968,
92113,
92304,
92445,
92589,
92717,
92811,
92942,
93050,
93191,
93320,
93465,
93562,
93563,
93597,
93598,
93642,
93707,
93784,
94040,
94141,
94261,
94369,
94508,
94654,
94799,
94912,
95011,
95144,
95269,
95393,
95499,
95626,
95763,
95934,
96056,
96209,
96348,
96481,
96571,
96703,
96815,
96922,
97010,
97102,
97210,
97333,
97441,
97566,
97670,
97757,
97896,
98044,
98196,
98287,
98456,
98552,
98710,
98807,
98940,
99040,
99184,
99392,
99547,
99739,
99878,
99979,
100093,
100280,
100388,
100456,
100537,
100686,
100791,
100985,
101104,
101192,
101331,
101423,
101512,
101647,
101752,
101926,
102106,
102206,
102312,
102447,
102536,
102618,
102737,
102851,
103032,
103151,
103313,
103461,
103588,
103712,
103837,
103959,
104090,
104185,
104336,
104467,
104635,
104798,
104930,
105112,
105280,
105430,
105603,
105741,
105896,
105991,
106151,
106267,
106437,
106624,
106800,
106952,
107148,
107334,
107460,
107638,
107802,
107978,
108153,
108294,
108462,
108614,
108839,
108951,
109055,
109264,
109422,
109543,
109712,
109912,
110073,
110239,
110365,
110522,
110596,
110749,
110849,
110937,
111105,
111239,
111411,
111412,
111428,
111429,
111473,
111538,
111555,
111706,
111797,
111942,
112037,
112140,
112292,
112397,
112549,
112646,
112805,
112955,
113161,
113343,
113494,
113688,
113862,
113951,
114025,
114206,
114300,
114447,
114529,
114645,
114777,
114894,
114980,
115077,
115201,
115337,
115455,
115565,
115700,
115789,
115921,
116085,
116198,
116303,
116427,
116526,
116664,
116757,
116854,
116978,
117159,
117281,
117387,
117527,
117637,
117731,
117879,
117992,
118136,
118265,
118409,
118607,
118788,
118901,
119061,
119163,
119266,
119393,
119563,
119673,
119785,
119912,
120073,
120156,
120284,
120426,
120597,
120758,
120924,
121038,
121160,
121312,
121411,
121569,
121685,
121836,
121955,
122057,
122192,
122338,
122462,
122718,
122845,
122949,
123069,
123233,
123375,
123455,
123542,
123724,
123877,
124041,
124222,
124379,
124534,
124691,
124852,
125000,
125122,
125320,
125485,
125621,
125715,
125838,
125933,
126088,
126208,
126343,
126488,
126587,
126717,
126881,
126982,
127128,
127278,
127397,
127525,
127616,
127708,
127709,
127735,
127736,
127780,
127845,
128049,
128152,
128229,
128230,
128253,
128254,
128298,
128363,
128380,
128531,
128622,
128767,
128870,
128965,
129115,
129274,
129426,
129549,
129701,
129851,
130003,
130149,
130405,
130519,
130725,
130842,
130966,
131160,
131311,
131493,
131598,
131708,
131805,
131927,
132043,
132207,
132320,
132419,
132593,
132725,
132814,
132903,
132977,
133117,
133298,
133392,
133474,
133618,
133753,
133900,
134047,
134211,
134346,
134459,
134542,
134702,
134831,
134988,
135112,
135222,
135335,
135421,
135549,
135715,
135857,
136014,
136111,
136255,
136416,
136562,
136698,
136836,
136954,
137048,
137175,
137307,
137433,
137581,
137762,
137943,
138096,
138201,
138312,
138470,
138668,
138850,
138974,
139071,
139195,
139329,
139479,
139572,
139699,
139854,
139960,
140121,
140240,
140344,
140479,
140650,
140780,
140881,
141008,
141173,
141276,
141370,
141540,
141642,
141752,
141864,
141959,
142123,
142222,
142364,
142492,
142637,
142785,
142887,
143009,
143129,
143228,
143392,
143512,
143641,
143777,
143896,
144012,
144089,
144240,
144401,
144481,
144573,
144695,
144782,
144873,
145054,
145209,
145407,
145408,
145433,
145434,
145478,
145484,
145651,
145989,
145990,
146004,
146005,
146049,
146114,
146218,
146363,
146526,
146721,
146921,
147013,
147112,
147227,
147353,
147481,
147584,
147761,
147964,
148098,
148230,
148394,
148558,
148633,
148710,
148792,
148873,
148950,
149100,
149244,
149375,
149601,
149867,
150006,
150362,
150611,
150896,
151087,
151186,
151299,
151409,
151515,
151621,
151731,
151837,
151931,
152059,
152188,
152333,
152461,
152625,
152750,
152879,
153047,
153163,
153304,
153433,
153562,
153772,
153913,
154058,
154155,
154263,
154371,
154372,
154390,
154391,
154432,
154472,
154508,
154542,
154578,
154621,
154661,
154703,
154736,
154776,
154819,
154862,
154906,
154942,
154976,
155019,
155063,
155106,
155107,
155125,
155126,
155161,
155254,
155337,
155445,
155589,
155651,
155764,
155853,
155910,
156021,
156085,
156158,
156234,
156325,
156405,
156490,
156589,
156689,
156744,
156879,
157009,
157074,
157177,
157236,
157275,
157378,
157379,
157392,
157393,
157421,
157435,
157436,
157472,
157473,
157657,
157658,
157694,
157695,
157879,
157880,
157909,
157923,
157924,
157980,
157981,
158069,
158070,
158095,
158096,
158110,
158111,
158166,
158167,
158281,
158282,
158307,
158308,
158325,
158326,
158349,
158350,
158367,
158368
],
"line_end_idx": [
81,
82,
147,
148,
161,
162,
167,
168,
187,
199,
401,
411,
414,
427,
433,
445,
464,
476,
483,
492,
500,
509,
524,
715,
731,
750,
761,
776,
798,
820,
829,
850,
869,
887,
1060,
1090,
1108,
1122,
1313,
1325,
1342,
1353,
1354,
1360,
1361,
1368,
1369,
1385,
1386,
1401,
1443,
1488,
1603,
1704,
1834,
1871,
1906,
1942,
2021,
2036,
2078,
2123,
2238,
2339,
2471,
2498,
2533,
2567,
2633,
2648,
2690,
2735,
2850,
2951,
3012,
3164,
3268,
3283,
3325,
3637,
3679,
3874,
3889,
3931,
4243,
4296,
4476,
4491,
4531,
4654,
4688,
4735,
4815,
4866,
4885,
4927,
5005,
5111,
5299,
5318,
5360,
5395,
5447,
5525,
5612,
5631,
5673,
5708,
5760,
5838,
5930,
5949,
5991,
6026,
6078,
6156,
6269,
6431,
6474,
6493,
6535,
6578,
6688,
6815,
6834,
6876,
6919,
7029,
7157,
7172,
7212,
7335,
7369,
7407,
7422,
7462,
7585,
7619,
7687,
7800,
7819,
7861,
7939,
8045,
8170,
8200,
8219,
8261,
8296,
8403,
8535,
8554,
8596,
8631,
8751,
8889,
8908,
8950,
8985,
9033,
9139,
9158,
9200,
9235,
9283,
9346,
9347,
9356,
9357,
9960,
9961,
9973,
9974,
11161,
11162,
11185,
11186,
11460,
11461,
11489,
11490,
12112,
12113,
12729,
12730,
13461,
13462,
14367,
14368,
14401,
14402,
15210,
15211,
16257,
16258,
16839,
16840,
17409,
17410,
18453,
18454,
19222,
19223,
19450,
19451,
19485,
19486,
19567,
19568,
19710,
19711,
19837,
19838,
19937,
19938,
20035,
20036,
20152,
20153,
20230,
20231,
20891,
20892,
21706,
21707,
22444,
22445,
23059,
23060,
23688,
23689,
24420,
24421,
24935,
24936,
25849,
25850,
26561,
26562,
27145,
27146,
27799,
27800,
28437,
28438,
29165,
29166,
29997,
29998,
31285,
31286,
32286,
32287,
33003,
33004,
33768,
33769,
34229,
34230,
34941,
34942,
35567,
35568,
36950,
36951,
37871,
37872,
38447,
38448,
38960,
38961,
39612,
39613,
40557,
40558,
41231,
41232,
41786,
41787,
42426,
42427,
43045,
43046,
44029,
44030,
44892,
44893,
45673,
45674,
46674,
46675,
47606,
47607,
48328,
48329,
48877,
48878,
49540,
49541,
50137,
50138,
50880,
50881,
51574,
51575,
52530,
52531,
53472,
53473,
54528,
54529,
55245,
55246,
56200,
56201,
57141,
57142,
57991,
57992,
58887,
58888,
59472,
59473,
60703,
60704,
61615,
61616,
62328,
62329,
63242,
63243,
64386,
64387,
65240,
65241,
66010,
66011,
66725,
66726,
67736,
67737,
68560,
68561,
69363,
69364,
70009,
70010,
70857,
70858,
71497,
71498,
72336,
72337,
73159,
73160,
74034,
74035,
74810,
74811,
75859,
75860,
76102,
76103,
76115,
76116,
76221,
76336,
76471,
76700,
76764,
77147,
77275,
77559,
77745,
77874,
78069,
78167,
78260,
78351,
78467,
78844,
78971,
79238,
79488,
79570,
79849,
80173,
80386,
80675,
80970,
81159,
81374,
81528,
81681,
81807,
81967,
82130,
82369,
82485,
82617,
82752,
82806,
82895,
82971,
83353,
83655,
83907,
84172,
84303,
84504,
84599,
84692,
84812,
85192,
85394,
85574,
85707,
85708,
85734,
85735,
85786,
85824,
85898,
86013,
86014,
86050,
86051,
86102,
86217,
86290,
86374,
86447,
86572,
86835,
86908,
86985,
87062,
87139,
87278,
87399,
87510,
87583,
87718,
87791,
87885,
88011,
88012,
88044,
88045,
88096,
88191,
88192,
88209,
88210,
88246,
88299,
88352,
88397,
88398,
88405,
88406,
88418,
88419,
88443,
88444,
88495,
88628,
88629,
88648,
88649,
88662,
88686,
88710,
88736,
88759,
88783,
88810,
88811,
88825,
88826,
88870,
88935,
89061,
89256,
89359,
89493,
89625,
89707,
89820,
89930,
90107,
90257,
90385,
90489,
90570,
90699,
90827,
90990,
91082,
91246,
91362,
91530,
91659,
91758,
91968,
92113,
92304,
92445,
92589,
92717,
92811,
92942,
93050,
93191,
93320,
93465,
93562,
93563,
93597,
93598,
93642,
93707,
93784,
94040,
94141,
94261,
94369,
94508,
94654,
94799,
94912,
95011,
95144,
95269,
95393,
95499,
95626,
95763,
95934,
96056,
96209,
96348,
96481,
96571,
96703,
96815,
96922,
97010,
97102,
97210,
97333,
97441,
97566,
97670,
97757,
97896,
98044,
98196,
98287,
98456,
98552,
98710,
98807,
98940,
99040,
99184,
99392,
99547,
99739,
99878,
99979,
100093,
100280,
100388,
100456,
100537,
100686,
100791,
100985,
101104,
101192,
101331,
101423,
101512,
101647,
101752,
101926,
102106,
102206,
102312,
102447,
102536,
102618,
102737,
102851,
103032,
103151,
103313,
103461,
103588,
103712,
103837,
103959,
104090,
104185,
104336,
104467,
104635,
104798,
104930,
105112,
105280,
105430,
105603,
105741,
105896,
105991,
106151,
106267,
106437,
106624,
106800,
106952,
107148,
107334,
107460,
107638,
107802,
107978,
108153,
108294,
108462,
108614,
108839,
108951,
109055,
109264,
109422,
109543,
109712,
109912,
110073,
110239,
110365,
110522,
110596,
110749,
110849,
110937,
111105,
111239,
111411,
111412,
111428,
111429,
111473,
111538,
111555,
111706,
111797,
111942,
112037,
112140,
112292,
112397,
112549,
112646,
112805,
112955,
113161,
113343,
113494,
113688,
113862,
113951,
114025,
114206,
114300,
114447,
114529,
114645,
114777,
114894,
114980,
115077,
115201,
115337,
115455,
115565,
115700,
115789,
115921,
116085,
116198,
116303,
116427,
116526,
116664,
116757,
116854,
116978,
117159,
117281,
117387,
117527,
117637,
117731,
117879,
117992,
118136,
118265,
118409,
118607,
118788,
118901,
119061,
119163,
119266,
119393,
119563,
119673,
119785,
119912,
120073,
120156,
120284,
120426,
120597,
120758,
120924,
121038,
121160,
121312,
121411,
121569,
121685,
121836,
121955,
122057,
122192,
122338,
122462,
122718,
122845,
122949,
123069,
123233,
123375,
123455,
123542,
123724,
123877,
124041,
124222,
124379,
124534,
124691,
124852,
125000,
125122,
125320,
125485,
125621,
125715,
125838,
125933,
126088,
126208,
126343,
126488,
126587,
126717,
126881,
126982,
127128,
127278,
127397,
127525,
127616,
127708,
127709,
127735,
127736,
127780,
127845,
128049,
128152,
128229,
128230,
128253,
128254,
128298,
128363,
128380,
128531,
128622,
128767,
128870,
128965,
129115,
129274,
129426,
129549,
129701,
129851,
130003,
130149,
130405,
130519,
130725,
130842,
130966,
131160,
131311,
131493,
131598,
131708,
131805,
131927,
132043,
132207,
132320,
132419,
132593,
132725,
132814,
132903,
132977,
133117,
133298,
133392,
133474,
133618,
133753,
133900,
134047,
134211,
134346,
134459,
134542,
134702,
134831,
134988,
135112,
135222,
135335,
135421,
135549,
135715,
135857,
136014,
136111,
136255,
136416,
136562,
136698,
136836,
136954,
137048,
137175,
137307,
137433,
137581,
137762,
137943,
138096,
138201,
138312,
138470,
138668,
138850,
138974,
139071,
139195,
139329,
139479,
139572,
139699,
139854,
139960,
140121,
140240,
140344,
140479,
140650,
140780,
140881,
141008,
141173,
141276,
141370,
141540,
141642,
141752,
141864,
141959,
142123,
142222,
142364,
142492,
142637,
142785,
142887,
143009,
143129,
143228,
143392,
143512,
143641,
143777,
143896,
144012,
144089,
144240,
144401,
144481,
144573,
144695,
144782,
144873,
145054,
145209,
145407,
145408,
145433,
145434,
145478,
145484,
145651,
145989,
145990,
146004,
146005,
146049,
146114,
146218,
146363,
146526,
146721,
146921,
147013,
147112,
147227,
147353,
147481,
147584,
147761,
147964,
148098,
148230,
148394,
148558,
148633,
148710,
148792,
148873,
148950,
149100,
149244,
149375,
149601,
149867,
150006,
150362,
150611,
150896,
151087,
151186,
151299,
151409,
151515,
151621,
151731,
151837,
151931,
152059,
152188,
152333,
152461,
152625,
152750,
152879,
153047,
153163,
153304,
153433,
153562,
153772,
153913,
154058,
154155,
154263,
154371,
154372,
154390,
154391,
154432,
154472,
154508,
154542,
154578,
154621,
154661,
154703,
154736,
154776,
154819,
154862,
154906,
154942,
154976,
155019,
155063,
155106,
155107,
155125,
155126,
155161,
155254,
155337,
155445,
155589,
155651,
155764,
155853,
155910,
156021,
156085,
156158,
156234,
156325,
156405,
156490,
156589,
156689,
156744,
156879,
157009,
157074,
157177,
157236,
157275,
157378,
157379,
157392,
157393,
157421,
157435,
157436,
157472,
157473,
157657,
157658,
157694,
157695,
157879,
157880,
157909,
157923,
157924,
157980,
157981,
158069,
158070,
158095,
158096,
158110,
158111,
158166,
158167,
158281,
158282,
158307,
158308,
158325,
158326,
158349,
158350,
158367,
158368,
158390
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 158390,
"ccnet_original_nlines": 1080,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.22400744259357452,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04461558908224106,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.32110607624053955,
"rps_doc_frac_unique_words": 0.14500324428081512,
"rps_doc_mean_word_length": 6.016363143920898,
"rps_doc_num_sentences": 793,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 6.287754535675049,
"rps_doc_word_count": 21634,
"rps_doc_frac_chars_dupe_10grams": 0.3746139407157898,
"rps_doc_frac_chars_dupe_5grams": 0.5878931879997253,
"rps_doc_frac_chars_dupe_6grams": 0.5265523195266724,
"rps_doc_frac_chars_dupe_7grams": 0.47356289625167847,
"rps_doc_frac_chars_dupe_8grams": 0.4410562515258789,
"rps_doc_frac_chars_dupe_9grams": 0.4060526490211487,
"rps_doc_frac_chars_top_2gram": 0.006645769812166691,
"rps_doc_frac_chars_top_3gram": 0.01106347981840372,
"rps_doc_frac_chars_top_4gram": 0.010072370059788227,
"rps_doc_books_importance": -16305.7822265625,
"rps_doc_books_importance_length_correction": -16305.7822265625,
"rps_doc_openwebtext_importance": -8684.6171875,
"rps_doc_openwebtext_importance_length_correction": -8684.6171875,
"rps_doc_wikipedia_importance": -6709.41357421875,
"rps_doc_wikipedia_importance_length_correction": -6709.41357421875
},
"fasttext": {
"dclm": 0.04492586851119995,
"english": 0.8327877521514893,
"fineweb_edu_approx": 1.8025918006896973,
"eai_general_math": 0.0011904200073331594,
"eai_open_web_math": 0.02519536018371582,
"eai_web_code": 0.0008876299834810197
}
}
|
{
"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": "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": "-1",
"label": "Abstain"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v1": {
"primary": {
"code": "11",
"label": "Legal/Regulatory"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,108,328,454,338,129,000 |
tag:blogger.com,1999:blog-6489132071705064276.post6326613600566872058..comments2017-07-06T11:25:03.597+10:00Comments on Random Technical Stuff: Amped Wireless AP600EX / SR600EX BackdoorRobert Davidsonhttp://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-6489132071705064276.post-19819390896116173602016-05-27T12:24:05.654+10:002016-05-27T12:24:05.654+10:00Hi Patrick, From memory it was a simple cross-fla...Hi Patrick,<br /><br />From memory it was a simple cross-flash through the web interface. This may or may not still be the case with later firmware releases.<br /><br />Regards,<br />Rob.<br />Robert Davidsonhttps://www.blogger.com/profile/[email protected]:blogger.com,1999:blog-6489132071705064276.post-34078141985622538642016-05-27T12:14:53.140+10:002016-05-27T12:14:53.140+10:00I have the SR600EX and want to cross-flash it with...I have the SR600EX and want to cross-flash it with the AP600EX firmware. Is this a straight forward upgrade or does it require a special approach/technique? Tx!Patrick Trumbullhttps://www.blogger.com/profile/[email protected]
|
{
"url": "http://rmdavidson.blogspot.com/feeds/6326613600566872058/comments/default",
"source_domain": "rmdavidson.blogspot.com",
"snapshot_id": "crawl=CC-MAIN-2017-39",
"warc_metadata": {
"Content-Length": "5684",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KIFX7UAZU5AYBA64YOSVXNUUEPKCDRXG",
"WARC-Concurrent-To": "<urn:uuid:b91fc550-e49c-4064-a46c-342979e95814>",
"WARC-Date": "2017-09-20T18:12:26Z",
"WARC-IP-Address": "216.58.217.65",
"WARC-Identified-Payload-Type": "application/atom+xml",
"WARC-Payload-Digest": "sha1:LX2F2EJEZX5LYT7MGCFHJUN636L57VHB",
"WARC-Record-ID": "<urn:uuid:414b6cfa-f3b0-41cf-9b99-e8cbb45acf66>",
"WARC-Target-URI": "http://rmdavidson.blogspot.com/feeds/6326613600566872058/comments/default",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:044dba93-3633-48a8-96b5-055b3f094ede>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-141-78-225.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-39\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for September 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0
],
"line_end_idx": [
1168
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1168,
"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.1666666716337204,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.043478261679410934,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.49275362491607666,
"rps_doc_frac_unique_words": 0.6511628031730652,
"rps_doc_mean_word_length": 11.139534950256348,
"rps_doc_num_sentences": 30,
"rps_doc_symbol_to_word_ratio": 0.0072463802061975,
"rps_doc_unigram_entropy": 3.884281635284424,
"rps_doc_word_count": 86,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.11899790912866592,
"rps_doc_frac_chars_dupe_6grams": 0.11899790912866592,
"rps_doc_frac_chars_dupe_7grams": 0.07306888699531555,
"rps_doc_frac_chars_dupe_8grams": 0.07306888699531555,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02087683044373989,
"rps_doc_frac_chars_top_3gram": 0.025052189826965332,
"rps_doc_frac_chars_top_4gram": 0.031315241008996964,
"rps_doc_books_importance": -65.17987823486328,
"rps_doc_books_importance_length_correction": -65.17987823486328,
"rps_doc_openwebtext_importance": -45.915374755859375,
"rps_doc_openwebtext_importance_length_correction": -45.20541763305664,
"rps_doc_wikipedia_importance": -23.816722869873047,
"rps_doc_wikipedia_importance_length_correction": -23.816722869873047
},
"fasttext": {
"dclm": 0.39830732345581055,
"english": 0.6313536763191223,
"fineweb_edu_approx": 1.7194596529006958,
"eai_general_math": 0.02215523086488247,
"eai_open_web_math": 0.21079939603805542,
"eai_web_code": 0.057412270456552505
}
}
|
{
"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.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": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "3",
"label": "Incoherent Flow"
}
},
"document_type_v2": {
"primary": {
"code": "5",
"label": "Comment Section"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-6,626,526,170,992,781,000 |
Uploaded image for project: 'Minecraft: Java Edition'
1. Minecraft: Java Edition
2. MC-87992
teleporting long distances doesnt load chunks
XMLWordPrintable
Details
• Bug
• Status: Resolved
• Resolution: Fixed
• Minecraft 15w36c, Minecraft 15w36d, Minecraft 15w37a, Minecraft 15w38a
• Minecraft 15w45a
• None
• multiplayer, singleplayer
• Community Consensus
Description
title says all,
Teleporting at least 276 blocks into negative Z axis makes the world chunks unable to load, reloading that world fixes this problem,
Redstone seems to work in those non-loaded chunks, however, area teleport command blocks in unloaded chunks only teleport players away that have those chunks loaded,
Map in attachments,
EDIT: the above bug is fixed in 15w37a, however it has been replaced by a new set of bugs, and i have the feeling they are caused by the same chunk glitch in 15w36d,
What i mean is, now, whenever a player is teleported:
If multiple people are teleported together, at least one client crashes/gets kicked off the server,
Player positions are not updated(area command blocks dont trigger.
One or several chunks can be missing.
Players sometimes become invisible.
Etc,
Attachments
1. 2015-09-06_18.55.52.png
2015-09-06_18.55.52.png
412 kB
2. 2015-09-06_18.55.58.png
2015-09-06_18.55.58.png
695 kB
3. 2015-09-07_16.05.13.png
2015-09-07_16.05.13.png
105 kB
4. 2015-09-07_16.05.34.png
2015-09-07_16.05.34.png
197 kB
5. client.log
1 kB
6. Client crash.png
Client crash.png
18 kB
7. Client crash.txt
70 kB
8. QTM - Lag World.zip
2.63 MB
9. server.log
96 kB
10. server on client crash.txt
5 kB
Issue Links
Activity
People
Unassigned Unassigned
jodi850 jodi850
Votes:
1 Vote for this issue
Watchers:
2 Start watching this issue
Dates
Created:
Updated:
Resolved:
CHK:
|
{
"url": "https://bugs.mojang.com/browse/MC-87992",
"source_domain": "bugs.mojang.com",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "119225",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZKUS7F2J5CM7X5SPTC4P2T6FRQJLJW2R",
"WARC-Concurrent-To": "<urn:uuid:a93e93b6-5a2c-4609-8624-5646a0db59ac>",
"WARC-Date": "2022-09-29T06:03:26Z",
"WARC-IP-Address": "20.82.141.145",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RNJR5IWWM7FD4D2BH7UNK7VZTIJCV4RG",
"WARC-Record-ID": "<urn:uuid:080c78ee-9342-4fde-8a89-468eb8675816>",
"WARC-Target-URI": "https://bugs.mojang.com/browse/MC-87992",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a96ea44d-cb41-477c-8ae9-f9adda7a37c2>"
},
"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-28\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
54,
83,
97,
98,
144,
145,
166,
167,
175,
176,
186,
209,
233,
310,
333,
344,
376,
402,
403,
419,
420,
442,
581,
582,
754,
755,
781,
782,
954,
955,
1015,
1121,
1194,
1238,
1280,
1291,
1292,
1310,
1311,
1346,
1380,
1397,
1432,
1466,
1483,
1518,
1552,
1569,
1604,
1638,
1655,
1677,
1692,
1720,
1747,
1763,
1791,
1807,
1838,
1856,
1878,
1894,
1933,
1948,
1949,
1969,
1970,
1989,
1990,
2009,
2010,
2046,
2076,
2097,
2133,
2157,
2199,
2200,
2220,
2221,
2246,
2271,
2297
],
"line_end_idx": [
54,
83,
97,
98,
144,
145,
166,
167,
175,
176,
186,
209,
233,
310,
333,
344,
376,
402,
403,
419,
420,
442,
581,
582,
754,
755,
781,
782,
954,
955,
1015,
1121,
1194,
1238,
1280,
1291,
1292,
1310,
1311,
1346,
1380,
1397,
1432,
1466,
1483,
1518,
1552,
1569,
1604,
1638,
1655,
1677,
1692,
1720,
1747,
1763,
1791,
1807,
1838,
1856,
1878,
1894,
1933,
1948,
1949,
1969,
1970,
1989,
1990,
2009,
2010,
2046,
2076,
2097,
2133,
2157,
2199,
2200,
2220,
2221,
2246,
2271,
2297,
2317
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2317,
"ccnet_original_nlines": 83,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.17307691276073456,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014423079788684845,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.42548078298568726,
"rps_doc_frac_unique_words": 0.6488549709320068,
"rps_doc_mean_word_length": 5.3015265464782715,
"rps_doc_num_sentences": 48,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.941208362579346,
"rps_doc_word_count": 262,
"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.018718499690294266,
"rps_doc_frac_chars_top_3gram": 0.028797699138522148,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -224.49624633789062,
"rps_doc_books_importance_length_correction": -224.49624633789062,
"rps_doc_openwebtext_importance": -117.87985229492188,
"rps_doc_openwebtext_importance_length_correction": -117.87985229492188,
"rps_doc_wikipedia_importance": -95.43946838378906,
"rps_doc_wikipedia_importance_length_correction": -95.43946838378906
},
"fasttext": {
"dclm": 0.13655823469161987,
"english": 0.8011497855186462,
"fineweb_edu_approx": 1.6839436292648315,
"eai_general_math": 0.012100639753043652,
"eai_open_web_math": 0.3699617385864258,
"eai_web_code": 0.015367689542472363
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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
|
1,120,187,217,114,378,200 |
阅读 1125
关于位运算看这个就够了
1：背景
从现代计算机中所有的数据二进制的形式存储在设备中。即0、1两种状态，计算机对二进制数据进行的运算(+、-、*、/)都是叫位运算，即将符号位共同参与运算的运算。
我们每一种语言最终都会通过编译器转换成机器语言来执行，所以直接使用底层的语言就不需要便编译器的转换工作从而得到更高的执行效率，当然可读性可能会降低，这也是为什么汇编在大部分情况下有更快的速度。项目中合理的运用位运算能提高我们代码的执行效率。
在iOS系统中位运算多见于枚举中，其他地方很少见，因为位运算是底层的计算机语言，而在iOS开发中不管是Objective—C还是Swift都属于高级的编程语言，大量的位运算都被苹果封装了起来，我们只关心调用的接口不用关心内部的实现。
typedef NS_OPTIONS(NSUInteger, NSLayoutFormatOptions) {
NSLayoutFormatAlignAllLeft = (1 << NSLayoutAttributeLeft),
NSLayoutFormatAlignAllRight = (1 << NSLayoutAttributeRight),
NSLayoutFormatAlignAllTop = (1 << NSLayoutAttributeTop),
NSLayoutFormatAlignAllBottom = (1 << NSLayoutAttributeBottom),
NSLayoutFormatAlignAllLeading = (1 << NSLayoutAttributeLeading),
NSLayoutFormatAlignAllTrailing = (1 << NSLayoutAttributeTrailing),
.
.
.
.
}
复制代码
10：计算机计算原理
####加法和乘法
举一个简单的例子来看下CPU是如何进行计算的，比如这行代码
int a = 35;
int b = 47;
int c = a + b;
复制代码
计算两个数的和，因为在计算机中都是以二进制来进行运算，所以上面我们所给的int变量会在机器内部先转换为二进制在进行相加
35: 0 0 1 0 0 0 1 1
47: 0 0 1 0 1 1 1 1
————————————————————
82: 0 1 0 1 0 0 1 0
复制代码
再来看下乘法，执行如下的代码
int a = 3;
int b = 2;
int c = a * b;
3: 0 0 0 0 0 0 1 1 * 2
————————————————————
6: 0 0 0 0 0 1 1 0
*********************************************
int a = 3;
int b = 4;
int c = a * b;
3: 0 0 0 0 0 0 1 1 * 4
————————————————————
12: 0 0 0 0 1 1 0 0
*********************************************
int a = 3;
int b = 8;
int c = a * b;
3: 0 0 0 0 0 0 1 1 * 8
————————————————————
24: 0 0 0 1 1 0 0 0
复制代码
通过以上运算可以看出当用a乘b，且如果b满足2^N的时候 就相当于把a的二进制数据向左移动N位，放到代码中 我们可以这样来写 a << N,所以上面3 * 2、3 * 4、3 * 8其实是可以写成3<<1、3<<2、3<<3，运算结果都是一样的。
那假如相乘的两个数都不满足2^N怎么办呢？其实这个时候编译器会将其中一个数拆分成多个满足2^N的数相加的情况，打个比方
int a = 15; int a = 15
int b = 13; => int b = (4 + 8 + 1)
int c = a * b; int c = a * b
复制代码
最后其实执行相乘运算就会变成这样 15 * 4 + 15 * 8 + 15 * 1，按照上文说的移位来转换为位运算就会变成15 << 2 + 15 << 3 + 15 << 0
####减法和除法 减法也是与加法同理只不过计算机内减法操作就是加上一个数的负数形式，且在操作系统中都是以补码的形式进行操作(因为正数的源码补码反码都与本身相同)。首先, 因为人脑可以知道第一位是符号位, 在计算的时候我们会根据符号位, 选择对真值区域的加减. 但是对于计算机, 加减乘数已经是最基础的运算, 要设计的尽量简单. 计算机辨别"符号位"显然会让计算机的基础电路设计变得十分复杂! 于是人们想出了将符号位也参与运算的方法. 我们知道, 根据运算法则减去一个正数等于加上一个负数, 即: 1-1 = 1 + (-1) = 0 , 所以机器可以只有加法而没有减法, 这样计算机运算的设计就更简单了.
除法的话其实和乘法原理相同，不过乘法是左移而除法是右移，但是除法的计算量要比乘法大得多，其大部分的消耗都在拆分数值，和处理小数的步骤上，所以如果我们在进行生成变量的时候如果遇到多位的小数我们尽量把他换成string的形式，这也是为什么浮点运算会消耗大量的时钟周期(操作系统中每进行一个移位或者加法运算的过程所消耗的时间就是一个时钟周期，3.0GHz频率的CPU可以在一秒执行运算3.010241024*1024个时钟周期)
11：位运算符
使用的运算符包括下面：
含义 运算符 例子
左移 << 0011 => 0110
右移 >> 0110 => 0011
按位或 0011
------- => 1011
1011
按位与 & 0011
------- => 1011
1011
按位取反 ~ 0011 => 1100
按位异或 (相同为零不同为一) ^ 0011
------- => 1000
1011
100：颜色转换
背景
上面说了iOS中经常见到的位运算的地方是在枚举中，那么颜色转换应该是除了枚举之外第二比较常用位运算的场景。打个比方设计师再给我们出设计稿的时候通常会在设计稿上按照16进制的样子给我们标色值。但是iOS中的UIColor并不支持使用十六进制的数据来初始化。所以我们需要将十六进制的色值转换为UIColor。
原理分析
UIColor中通常是用传入RGB的数值来初始化，而且每个颜色的取值范围是十进制下的0~255，而设计同学又给的是十六进制数据，所以在操作系统中需要把这两种进制的数据统一成二进制来进行计算，这就用到了位运算。这里用一个十六进制的色值来举例子比如0xffa131我们要转换就要先理解其组成
• 0x或者0X：十六进制的标识符，表示这个后面是个十六进制的数值，对数值本身没有任何意义
• ff 颜色中的R值,转换为二进制为 1111 1111
• a1 颜色中的G值,转换为二进制为 1010 0001
• 31 颜色中的B值,转换为二进制为 0011 0001
• 上述色彩值转换为二进制后为1111 1111 1010 0001 0011 0001(每一位十六进制的对应4位二进制，如果位数不够记得高位补零)
通常来讲十六进制的颜色是按照上面的RGB的顺序排列的，但是并不固定，有时候可能会在其中加A(Alpha)值，具体情况按照设计为准，本文以通用情况举例。
综上，我们只需把对应位的值转换为10进制然后/255.0f就可得到RGB色彩值，从而转换为UIColor
####转换代码 先列出代码，后续解析
- (UIColor *)colorWithHex:(long)hexColor alpha:(float)opacity
{
//将传入的十六进制颜色0xffa131 转换为UIColor
float red = ((hexColor & 0xFF0000) >> 16)/255.0f;
float green = ((hexColor & 0xFF00) >> 8)/255.0f;
float blue = (hexColor & 0xFF)/255.0f;
return [UIColor colorWithRed:red green:green blue:blue alpha:opacity];
}
复制代码
大概原理可以看出将RGB每个值都解析出来然后变成UIColor，先拿第一步转换红色值来说，我们按照运算顺序一步步来讲(默认将参数代入，用0xffa131代替hexColor)
• 0xffa131 & 0xFF0000
我们知道红色值是前两位也就是ff，所以这一步我们既然要取出红色值就要把其他位全部置零来排除干扰，这步操作便是如此，在计算机系统内是二进制来实现的，即：
1111 1111 1010 0001 0011 0001
------------------------------------------- => & => 1111 1111 0000 0000 0000
1111 1111 0000 0000 0000 0000
这部操作做完后可以看出将除了R值之外的G值B值全部置零了，但是离最终结果还差点，因为0xFF是1111 1111，而我们的结果后面多出了16个0，所以便有了第二步操作
• >> 16
将上一步得到的结果右移16位即得到0000 0000 0000 0000 1111 1111高位的零可以忽略，这也是最终的结果
• / 255.0f
这一步应该都知道UIColor中传入的数值范围在0~1，所以我们要做下转换
• 后续的G值和B值都是一样的，只是大家注意位数就可以了，值得注意的是两个二进制数进行位运算一定保证两个数的位数相同，位数不够的那个数高位要用0补齐
101：枚举
关于枚举中使用位运算我们之前也讲过，下面我们自己来写一个枚举(伪代码)
typedef NS_OPTIONS(NSUInteger, TestOptions) {
TestOptionOne = 1 << 0, （000001)
TestOptionTwo = 1 << 1, (000010)
TestOptionThree = 1 << 2, (000100)
TestOptionFour = 1 << 3, (001000)
TestOptionFive = 1 << 4, (010000)
TestOptionSix = 1 << 5, (100000)
.
.
.
.
复制代码
• 解析 上面的枚举我后面用括号表明了位移后对应的二进制的值。这样写枚举的好处是我可以对其中选项多选比如TestOptionOne | TestOptionTwo （000001 | 000010 => 000011） 或者有其他的自定义组合。
110：加密
在iOS中我们可以利用异或来进行加解密，异或的特性如下
A ^ B = C => C ^ A = B => C ^ B = A
复制代码
上文我们可以把A认为是需要加密的数据，B认为是密钥 C是加密后的数据 比如:
#include <stdio.h>
main()
{
char a[]="MyPassword"; /*要加密的密码*/
char b[]="cryptographic"; /*密钥*/
int i;
/*加密代码*/
for(i=0;a[i]!='\0';i++)
a[i]=a[i]^b[i];
printf("You Password encrypted: %s\n",a);
/*解密代码*/
for(i=0;a[i]!='\0';i++)
a[i]=a[i]^b[i];
printf("You Password: %s\n",a);
}
复制代码
111：其他应用
• 记得iOS总有一道面试题在不使用第三个变量的情况下交换两个变量的值，这里用到异或的上面加解密中的特性。我有x、y两个个变量，做如下位运算操作
void exchange(int x , int y)
{
x ^= y;
y ^= x;
x ^= y;
}
复制代码
• 判断一个数的奇偶性，其实我们可以用**%2**来判断，代码量不高，但是之前讲过，除法运算的时钟周期非常多，所以代码虽然不多并不代表效率高，我们可以用如下运算来完成:
void test(int x)
{
if (x&1) {
printf("奇数");
} else {
printf("偶数");
}
}
复制代码
原理很简单，因为二进制是满二进一，一旦超过1就会变0并进一位，这时候和00001做**&**操作一定会为0，反之不为零。这样写效率会更高。
• 计算两个数的平均值，通常我们都是（x+y）/2,先不考虑效率问题，这样还会引起一个其他的问题，那就是x+y的值很有可能溢出大于INT_MAX，所以我们采用位运算的办法来解决即可：
int average(int x, int y)
{
return (x&y)+((x^y)>>1);
}
复制代码
1000：总结
其实位运算的应用远远不止这些，在算法方面适当的使用还是很有帮助的。参考文章文章
关注下面的标签，发现更多相似文章
评论
说说你的看法
|
{
"url": "https://juejin.im/post/5a5886bef265da3e38496fd5",
"source_domain": "juejin.im",
"snapshot_id": "crawl=CC-MAIN-2018-39",
"warc_metadata": {
"Content-Length": "68585",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EZHS2MIGNXIOI3OXPULAA4F5WQGJY25X",
"WARC-Concurrent-To": "<urn:uuid:cf1216d4-f608-4af1-88ff-a913e5c35399>",
"WARC-Date": "2018-09-19T00:22:30Z",
"WARC-IP-Address": "61.133.6.61",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NH4V53D4PQONILMG5TFYTE4WAAAO4UD6",
"WARC-Record-ID": "<urn:uuid:b5068c49-a6bf-4d87-a20d-56145d061e85>",
"WARC-Target-URI": "https://juejin.im/post/5a5886bef265da3e38496fd5",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:aacc4d4f-c65e-42ae-a69a-57abea68b5d7>"
},
"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-51-154-251.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,
9,
21,
22,
27,
28,
108,
109,
230,
231,
348,
349,
405,
468,
533,
594,
661,
730,
801,
803,
805,
807,
809,
815,
820,
821,
832,
833,
843,
844,
874,
875,
887,
899,
914,
915,
920,
921,
981,
982,
1003,
1024,
1045,
1066,
1067,
1072,
1073,
1088,
1089,
1100,
1111,
1126,
1127,
1153,
1174,
1194,
1195,
1241,
1242,
1253,
1264,
1279,
1280,
1306,
1327,
1348,
1349,
1395,
1396,
1407,
1418,
1433,
1434,
1460,
1481,
1502,
1503,
1508,
1509,
1633,
1634,
1694,
1695,
1721,
1765,
1797,
1798,
1803,
1804,
1893,
1894,
2198,
2199,
2411,
2412,
2420,
2421,
2433,
2434,
2444,
2463,
2482,
2491,
2507,
2512,
2523,
2539,
2544,
2564,
2587,
2603,
2608,
2609,
2618,
2619,
2622,
2623,
2776,
2777,
2782,
2783,
2927,
2928,
2976,
2977,
3009,
3010,
3042,
3043,
3075,
3076,
3153,
3154,
3230,
3231,
3284,
3285,
3305,
3306,
3368,
3370,
3403,
3405,
3459,
3512,
3555,
3630,
3632,
3637,
3638,
3726,
3727,
3751,
3752,
3832,
3866,
3947,
3981,
4069,
4070,
4080,
4081,
4149,
4150,
4163,
4164,
4206,
4207,
4284,
4285,
4292,
4293,
4329,
4330,
4376,
4421,
4426,
4470,
4475,
4517,
4522,
4564,
4565,
4607,
4608,
4650,
4652,
4654,
4656,
4658,
4659,
4664,
4789,
4790,
4797,
4798,
4826,
4827,
4864,
4869,
4870,
4909,
4910,
4929,
4936,
4938,
4982,
5022,
5032,
5044,
5071,
5087,
5132,
5144,
5171,
5187,
5222,
5225,
5227,
5232,
5233,
5242,
5243,
5318,
5348,
5351,
5364,
5377,
5390,
5393,
5398,
5485,
5502,
5504,
5519,
5541,
5554,
5576,
5582,
5584,
5589,
5590,
5660,
5661,
5755,
5782,
5788,
5818,
5821,
5826,
5827,
5835,
5836,
5876,
5877,
5894,
5897
],
"line_end_idx": [
8,
9,
21,
22,
27,
28,
108,
109,
230,
231,
348,
349,
405,
468,
533,
594,
661,
730,
801,
803,
805,
807,
809,
815,
820,
821,
832,
833,
843,
844,
874,
875,
887,
899,
914,
915,
920,
921,
981,
982,
1003,
1024,
1045,
1066,
1067,
1072,
1073,
1088,
1089,
1100,
1111,
1126,
1127,
1153,
1174,
1194,
1195,
1241,
1242,
1253,
1264,
1279,
1280,
1306,
1327,
1348,
1349,
1395,
1396,
1407,
1418,
1433,
1434,
1460,
1481,
1502,
1503,
1508,
1509,
1633,
1634,
1694,
1695,
1721,
1765,
1797,
1798,
1803,
1804,
1893,
1894,
2198,
2199,
2411,
2412,
2420,
2421,
2433,
2434,
2444,
2463,
2482,
2491,
2507,
2512,
2523,
2539,
2544,
2564,
2587,
2603,
2608,
2609,
2618,
2619,
2622,
2623,
2776,
2777,
2782,
2783,
2927,
2928,
2976,
2977,
3009,
3010,
3042,
3043,
3075,
3076,
3153,
3154,
3230,
3231,
3284,
3285,
3305,
3306,
3368,
3370,
3403,
3405,
3459,
3512,
3555,
3630,
3632,
3637,
3638,
3726,
3727,
3751,
3752,
3832,
3866,
3947,
3981,
4069,
4070,
4080,
4081,
4149,
4150,
4163,
4164,
4206,
4207,
4284,
4285,
4292,
4293,
4329,
4330,
4376,
4421,
4426,
4470,
4475,
4517,
4522,
4564,
4565,
4607,
4608,
4650,
4652,
4654,
4656,
4658,
4659,
4664,
4789,
4790,
4797,
4798,
4826,
4827,
4864,
4869,
4870,
4909,
4910,
4929,
4936,
4938,
4982,
5022,
5032,
5044,
5071,
5087,
5132,
5144,
5171,
5187,
5222,
5225,
5227,
5232,
5233,
5242,
5243,
5318,
5348,
5351,
5364,
5377,
5390,
5393,
5398,
5485,
5502,
5504,
5519,
5541,
5554,
5576,
5582,
5584,
5589,
5590,
5660,
5661,
5755,
5782,
5788,
5818,
5821,
5826,
5827,
5835,
5836,
5876,
5877,
5894,
5897,
5903
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5903,
"ccnet_original_nlines": 257,
"rps_doc_curly_bracket": 0.002879889914765954,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.07100085914134979,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022241229191422462,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.7861419916152954,
"rps_doc_frac_unique_words": 0.44279661774635315,
"rps_doc_mean_word_length": 9.016948699951172,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0.011120620183646679,
"rps_doc_unigram_entropy": 4.5155253410339355,
"rps_doc_word_count": 472,
"rps_doc_frac_chars_dupe_10grams": 0.0105733098462224,
"rps_doc_frac_chars_dupe_5grams": 0.03759397938847542,
"rps_doc_frac_chars_dupe_6grams": 0.020206769928336143,
"rps_doc_frac_chars_dupe_7grams": 0.015977440401911736,
"rps_doc_frac_chars_dupe_8grams": 0.0105733098462224,
"rps_doc_frac_chars_dupe_9grams": 0.0105733098462224,
"rps_doc_frac_chars_top_2gram": 0.015037589706480503,
"rps_doc_frac_chars_top_3gram": 0.014097739942371845,
"rps_doc_frac_chars_top_4gram": 0.011278199963271618,
"rps_doc_books_importance": -572.4616088867188,
"rps_doc_books_importance_length_correction": -572.4616088867188,
"rps_doc_openwebtext_importance": -276.1720886230469,
"rps_doc_openwebtext_importance_length_correction": -276.1720886230469,
"rps_doc_wikipedia_importance": -173.70809936523438,
"rps_doc_wikipedia_importance_length_correction": -173.70809936523438
},
"fasttext": {
"dclm": 0.8852682709693909,
"english": 0.022481320425868034,
"fineweb_edu_approx": 3.3415181636810303,
"eai_general_math": 0.8105800747871399,
"eai_open_web_math": 0.2586408853530884,
"eai_web_code": 0.8440923690795898
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,269,666,657,222,755,000 |
Questions
Answer for:
windows server 2003 remote desktop
Message 17 of 16
View entire thread
+
0 Votes
gdeangelis
Collapse -
Have you logged in from the console and examined CPU and running tasks? Any new software, or changes recently ? I'd look at getting it off the network entirely for the same amount of time it would take to have issues normally, then access it from a laptop and a crossover cable. Like Rob mentioned above, you can at least isolate the problem. A good scan might turn up some goodies too! Anyone leaving term sessions up and running? This can chew up CPU. Also, when you boot the server, do you see any errors reported in post like CPU or memory? Maybe a fan failure?
|
{
"url": "http://www.techrepublic.com/forums/questions/windows-server-2003-remote-desktop/post-68a2b70e-d1a5-11e2-bc00-02911874f8c8/",
"source_domain": "www.techrepublic.com",
"snapshot_id": "crawl=CC-MAIN-2015-40",
"warc_metadata": {
"Content-Length": "70626",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5CFWNCIOJGPSZA3TEMPSJCBLQSJN7T63",
"WARC-Concurrent-To": "<urn:uuid:63203bf0-6537-4335-867a-65aff7454dc1>",
"WARC-Date": "2015-10-07T03:06:44Z",
"WARC-IP-Address": "23.3.13.26",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:R2HIV4SCSHIJFSAN6VOC5PFH6SNENUFW",
"WARC-Record-ID": "<urn:uuid:abc2cb99-a4d6-4ea0-92e3-520fc0dea0c2>",
"WARC-Target-URI": "http://www.techrepublic.com/forums/questions/windows-server-2003-remote-desktop/post-68a2b70e-d1a5-11e2-bc00-02911874f8c8/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6a21797c-58cc-4159-bddb-81ec5709ff77>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-137-6-227.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-40\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for September 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
10,
11,
23,
24,
59,
60,
77,
78,
97,
99,
107,
118,
129,
130
],
"line_end_idx": [
10,
11,
23,
24,
59,
60,
77,
78,
97,
99,
107,
118,
129,
130,
695
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 695,
"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.4195804297924042,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03496503084897995,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1538461446762085,
"rps_doc_frac_unique_words": 0.75,
"rps_doc_mean_word_length": 4.403225898742676,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.407331943511963,
"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.03663003817200661,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -59.21795654296875,
"rps_doc_books_importance_length_correction": -61.7734375,
"rps_doc_openwebtext_importance": -39.92426300048828,
"rps_doc_openwebtext_importance_length_correction": -42.47974395751953,
"rps_doc_wikipedia_importance": -34.312782287597656,
"rps_doc_wikipedia_importance_length_correction": -36.868263244628906
},
"fasttext": {
"dclm": 0.02051324024796486,
"english": 0.9189561605453491,
"fineweb_edu_approx": 2.0999228954315186,
"eai_general_math": 0.24979209899902344,
"eai_open_web_math": 0.2558983564376831,
"eai_web_code": 0.009306189604103565
}
}
|
{
"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.162",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,868,999,020,731,600,000 |
Home » Why is root login via SSH so bad that everyone advises to disable it?
Why is root login via SSH so bad that everyone advises to disable it?
Solutons:
Why root over SSH is bad
There are a lot of bots out there which try to log in to your computer over SSH.
These bots work the following way.
They execute something like ssh root@$IP and then they try standard passwords like “root” or “password123”.
They do this as long as they can, until they find the right password.
On a world wide accessible server you can see a lot of log entries in your log files. I can go up to 20 per minute or more.
When the attackers have luck (or enough time), and find a password, they would have root access and that would mean you are in trouble.
But when you disallow root to log in over SSH, the bot needs first to guess a user name and then the matching password.
So lets say the list of plausible passwords has N entries and the list of plausible users is M entries large. The bot has a set of N*M entries to test, so this makes it a little bit harder for the bot compared to the root case where it is only a set of size N.
Some people will say that this additional M isn’t a real gain in security and I agree that it is only a small security enhancement. But I think of this more as these little padlocks which are in itself not secure, but they hinder a lot of people from easy access. This of course is only valid if your machine has no other standard user names, like tor or apache.
The better reason to not allow root is that root can do a lot more damage on the machine than a standard user can do. So, if by dumb luck they find your password, the whole system is lost while with a standard user account you only could manipulate the files of that user(which is still very bad).
In the comments it was mentioned that a normal user could have the right to use sudo and if this user’s password would be guessed the system is totally lost too.
In summary I would say that it doesn’t matter which user’s password an attacker gets. When they guess one password you can’t trust the system anymore. An attacker could use the rights of that user to execute commands with sudo, the attacker could also exploit a weakness in your system and gain root privileges. If an attacker had access to your system you can’t trust it anymore.
The thing to remember here is that every user in your system that is allowed to log in via SSH is an additional weakness.
By disabling root you remove one obvious weakness.
Why passwords over SSH are bad
The reason to disable passwords is really simple.
• Users choose bad passwords!
The whole idea of trying passwords only works when the passwords are guessable.
So when a user has the password “pw123” your system becomes insecure.
Another problem with passwords chosen by people is that their passwords are never truly random because that would then be hard to remember.
Also it is the case that users tend to reuse their passwords, using it to log into Facebook or their Gmail accounts and for your server.
So when a hacker gets this user’s Facebook account password he could get into your server. The user could easily lose it through phishing or the Facebook server might get hacked.
But when you use a certificate to log in, the user doesn’t choose his password.
The certificate is based on a random string which is very long from 1024 Bits up to 4096 Bits (~ 128 – 512 character password).
Additionally this certificate is only there to log into your server and isn’t used with any outside services.
Monitoring root access
The comment from @Philip Couling which should have been an answer:
There’s an administrative reason for disabling root. On commercial servers you always want to control access by person. root is never a person. Even if you allow some users to have root access, you should force them to login via their own user and then su – or sudo -i so that their actual login can be recorded. This makes revoking all access to an individual much simpler so that even if they have the root password they can’t do anything with it. – Philip Couling
I would also add that it allows the team to enforce the principle of least privilege, with a proper sudo configuration (but writing one sounds easier then it is). This enables the team to distribute uncritical better, without giving away the key to the castle.
Links
http://bsdly.blogspot.de/2013/10/the-hail-mary-cloud-and-lessons-learned.html
This article comes from the comments and I wanted to give it a bit more prominent position, since it goes a little bit deeper into the matter of botnets that try to log in via SSH, how they do it, how the log files look like and what one can do to stop them. It’s been written by Peter Hansteen.
These could be some of the reasons why direct root login should not be allowed.
• Bruteforce attempts. Direct root login could result on more damage on a successfull bruteforce attack.
• Missconfiguration on “passwordless” SSH keys(human error happens) could expose your machine to the internet
But this is just the TIP of the iceberg. You need to configure other restrictions and configurations like:
• Change the default port(22)
• Strong Passwords and Passphrase
• Disable Host-Based Authentication
• Create a List of allowed users
• Configure idle Timeout
• Force SSHv2 protocol
• Disable Empty Passwords
• Use fail2ban as a measure agains bruteforce
• Log everything
• Configure SSH Keys, and trust only on public keys at .ssh/authorized_keys
You’re right that root username and X+Y symbol password is cryptographically at least as secure as an X symbol username + Y symbol password. In fact it is even more secure, cause people’s names are easy to guess (bots may just try john, mike, bill, etc… and btw: that’s what many of them do instead of trying root). And you’re especially out of luck if it’s a targeted attack, cause if someone wants to break a company’s server it wouldn’t be a problem to find out the name (nick) of the sysadmin.
And as soon as the attacker has access to the account the sysadmin uses for ssh logins (and then uses su or sudo to do his tasks) he can infect that user’s session with a program which will send the attacker root password when the sysadmin types that the next time.
It’s any type of root logins which are (or should be) considered bad practices from security point of view. The “normal” user login -> su/sudo chain adds an audit trail. In plain english: it makes it possible to find out who did what.
A special case may be the one, where only one person has root access. In that case using the additional “normal” user won’t add much value (at least I never could see that value). But anyway – you’re supposed to have a simple user on the system anyway (for non-administrative tasks, running wget, etc 😉 ).
Related Solutions
Joining bash arguments into single string with spaces
[*] I believe that this does what you want. It will put all the arguments in one string, separated by spaces, with single quotes around all: str="'$*'" $* produces all the scripts arguments separated by the first character of $IFS which, by default, is a space....
AddTransient, AddScoped and AddSingleton Services Differences
TL;DR Transient objects are always different; a new instance is provided to every controller and every service. Scoped objects are the same within a request, but different across different requests. Singleton objects are the same for every object and every...
How to download package not install it with apt-get command?
Use --download-only: sudo apt-get install --download-only pppoe This will download pppoe and any dependencies you need, and place them in /var/cache/apt/archives. That way a subsequent apt-get install pppoe will be able to complete without any extra downloads....
What defines the maximum size for a command single argument?
Answers Definitely not a bug. The parameter which defines the maximum size for one argument is MAX_ARG_STRLEN. There is no documentation for this parameter other than the comments in binfmts.h: /* * These are the maximum length and maximum number of strings...
Bulk rename, change prefix
I'd say the simplest it to just use the rename command which is common on many Linux distributions. There are two common versions of this command so check its man page to find which one you have: ## rename from Perl (common in Debian systems -- Ubuntu, Mint,...
Output from ls has newlines but displays on a single line. Why?
When you pipe the output, ls acts differently. This fact is hidden away in the info documentation: If standard output is a terminal, the output is in columns (sorted vertically) and control characters are output as question marks; otherwise, the output is...
mv: Move file only if destination does not exist
mv -vn file1 file2. This command will do what you want. You can skip -v if you want. -v makes it verbose - mv will tell you that it moved file if it moves it(useful, since there is possibility that file will not be moved) -n moves only if file2 does not exist....
Is it possible to store and query JSON in SQLite?
SQLite 3.9 introduced a new extension (JSON1) that allows you to easily work with JSON data . Also, it introduced support for indexes on expressions, which (in my understanding) should allow you to define indexes on your JSON data as well. PostgreSQL has some...
Combining tail && journalctl
You could use: journalctl -u service-name -f -f, --follow Show only the most recent journal entries, and continuously print new entries as they are appended to the journal. Here I've added "service-name" to distinguish this answer from others; you substitute...
how can shellshock be exploited over SSH?
One example where this can be exploited is on servers with an authorized_keys forced command. When adding an entry to ~/.ssh/authorized_keys, you can prefix the line with command="foo" to force foo to be run any time that ssh public key is used. With this...
Why doesn’t the tilde (~) expand inside double quotes?
The reason, because inside double quotes, tilde ~ has no special meaning, it's treated as literal. POSIX defines Double-Quotes as: Enclosing characters in double-quotes ( "" ) shall preserve the literal value of all characters within the double-quotes, with the...
What is GNU Info for?
GNU Info was designed to offer documentation that was comprehensive, hyperlinked, and possible to output to multiple formats. Man pages were available, and they were great at providing printed output. However, they were designed such that each man page had a...
Set systemd service to execute after fstab mount
a CIFS network location is mounted via /etc/fstab to /mnt/ on boot-up. No, it is not. Get this right, and the rest falls into place naturally. The mount is handled by a (generated) systemd mount unit that will be named something like mnt-wibble.mount. You can...
Merge two video clips into one, placing them next to each other
To be honest, using the accepted answer resulted in a lot of dropped frames for me. However, using the hstack filter_complex produced perfectly fluid output: ffmpeg -i left.mp4 -i right.mp4 -filter_complex hstack output.mp4 ffmpeg -i input1.mp4 -i input2.mp4...
How portable are /dev/stdin, /dev/stdout and /dev/stderr?
It's been available on Linux back into its prehistory. It is not POSIX, although many actual shells (including AT&T ksh and bash) will simulate it if it's not present in the OS; note that this simulation only works at the shell level (i.e. redirection or...
How can I increase the number of inodes in an ext4 filesystem?
It seems that you have a lot more files than normal expectation. I don't know whether there is a solution to change the inode table size dynamically. I'm afraid that you need to back-up your data, and create new filesystem, and restore your data. To create new...
Why doesn’t cp have a progress bar like wget?
The tradition in unix tools is to display messages only if something goes wrong. I think this is both for design and practical reasons. The design is intended to make it obvious when something goes wrong: you get an error message, and it's not drowned in...
|
{
"url": "https://hackerthink.com/solutions/why-is-root-login-via-ssh-so-bad-that-everyone-advises-to-disable-it/",
"source_domain": "hackerthink.com",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "239541",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O7JKBPBAONTKHGB3QN3M5WDOH2CY26K6",
"WARC-Concurrent-To": "<urn:uuid:6a891705-d749-46e2-aae4-b849e9423c13>",
"WARC-Date": "2021-12-05T06:05:17Z",
"WARC-IP-Address": "149.28.220.87",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CL7NPSYIWGZX5LZEUSDEXQMBCOKRBIPM",
"WARC-Record-ID": "<urn:uuid:218610fd-28da-42c8-a1dd-9461dd9e62e2>",
"WARC-Target-URI": "https://hackerthink.com/solutions/why-is-root-login-via-ssh-so-bad-that-everyone-advises-to-disable-it/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:847c62ef-acfc-4408-95b3-310ef45d130b>"
},
"warc_info": "isPartOf: CC-MAIN-2021-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-99\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
77,
78,
148,
149,
159,
160,
161,
186,
187,
268,
303,
304,
412,
482,
606,
607,
743,
744,
864,
1125,
1126,
1489,
1490,
1788,
1789,
1951,
1952,
2333,
2334,
2456,
2507,
2508,
2539,
2540,
2590,
2591,
2623,
2624,
2704,
2774,
2914,
2915,
3052,
3231,
3232,
3312,
3440,
3550,
3551,
3574,
3575,
3642,
3643,
4110,
4111,
4372,
4373,
4379,
4380,
4458,
4459,
4755,
4756,
4836,
4837,
4944,
5056,
5057,
5164,
5165,
5197,
5233,
5271,
5306,
5333,
5358,
5386,
5434,
5453,
5531,
5532,
6030,
6031,
6297,
6298,
6533,
6534,
6840,
6841,
6859,
6860,
6914,
6915,
7180,
7181,
7243,
7244,
7504,
7505,
7566,
7567,
7831,
7832,
7893,
7894,
8155,
8156,
8183,
8184,
8446,
8447,
8511,
8512,
8771,
8772,
8821,
8822,
9086,
9087,
9137,
9138,
9401,
9402,
9431,
9432,
9694,
9695,
9737,
9738,
9997,
9998,
10053,
10054,
10319,
10320,
10342,
10343,
10605,
10606,
10655,
10656,
10919,
10920,
10984,
10985,
11247,
11248,
11306,
11307,
11565,
11566,
11629,
11630,
11894,
11895,
11941,
11942
],
"line_end_idx": [
77,
78,
148,
149,
159,
160,
161,
186,
187,
268,
303,
304,
412,
482,
606,
607,
743,
744,
864,
1125,
1126,
1489,
1490,
1788,
1789,
1951,
1952,
2333,
2334,
2456,
2507,
2508,
2539,
2540,
2590,
2591,
2623,
2624,
2704,
2774,
2914,
2915,
3052,
3231,
3232,
3312,
3440,
3550,
3551,
3574,
3575,
3642,
3643,
4110,
4111,
4372,
4373,
4379,
4380,
4458,
4459,
4755,
4756,
4836,
4837,
4944,
5056,
5057,
5164,
5165,
5197,
5233,
5271,
5306,
5333,
5358,
5386,
5434,
5453,
5531,
5532,
6030,
6031,
6297,
6298,
6533,
6534,
6840,
6841,
6859,
6860,
6914,
6915,
7180,
7181,
7243,
7244,
7504,
7505,
7566,
7567,
7831,
7832,
7893,
7894,
8155,
8156,
8183,
8184,
8446,
8447,
8511,
8512,
8771,
8772,
8821,
8822,
9086,
9087,
9137,
9138,
9401,
9402,
9431,
9432,
9694,
9695,
9737,
9738,
9997,
9998,
10053,
10054,
10319,
10320,
10342,
10343,
10605,
10606,
10655,
10656,
10919,
10920,
10984,
10985,
11247,
11248,
11306,
11307,
11565,
11566,
11629,
11630,
11894,
11895,
11941,
11942,
12199
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 12199,
"ccnet_original_nlines": 157,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.43732917308807373,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021085510030388832,
"rps_doc_frac_lines_end_with_ellipsis": 0.10759493708610535,
"rps_doc_frac_no_alph_words": 0.15736040472984314,
"rps_doc_frac_unique_words": 0.3381020426750183,
"rps_doc_mean_word_length": 4.565569877624512,
"rps_doc_num_sentences": 131,
"rps_doc_symbol_to_word_ratio": 0.007809449918568134,
"rps_doc_unigram_entropy": 5.796684741973877,
"rps_doc_word_count": 2097,
"rps_doc_frac_chars_dupe_10grams": 0.011489450000226498,
"rps_doc_frac_chars_dupe_5grams": 0.019218720495700836,
"rps_doc_frac_chars_dupe_6grams": 0.011489450000226498,
"rps_doc_frac_chars_dupe_7grams": 0.011489450000226498,
"rps_doc_frac_chars_dupe_8grams": 0.011489450000226498,
"rps_doc_frac_chars_dupe_9grams": 0.011489450000226498,
"rps_doc_frac_chars_top_2gram": 0.0036557300481945276,
"rps_doc_frac_chars_top_3gram": 0.0036557300481945276,
"rps_doc_frac_chars_top_4gram": 0.002924589905887842,
"rps_doc_books_importance": -1187.8883056640625,
"rps_doc_books_importance_length_correction": -1187.8883056640625,
"rps_doc_openwebtext_importance": -716.867431640625,
"rps_doc_openwebtext_importance_length_correction": -716.867431640625,
"rps_doc_wikipedia_importance": -605.7954711914062,
"rps_doc_wikipedia_importance_length_correction": -605.7954711914062
},
"fasttext": {
"dclm": 0.14206385612487793,
"english": 0.9333120584487915,
"fineweb_edu_approx": 2.084152936935425,
"eai_general_math": 0.7812485098838806,
"eai_open_web_math": 0.23767811059951782,
"eai_web_code": 0.7766390442848206
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.822",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "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": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,996,612,406,934,053,000 |
SOLVED: Suggestions For Troubleshooting A Slow Linux Server.
If you have a slow linux server troubleshooter, the guide below can help you.
Step One: Update Ubuntu.A few steps: Managing startup applications.Step 3: Find the best mirrors for software updates.Step 4: Enable proprietary drivers.Step 5: Install preload.Step 6: Use apt-fast instead of apt-get.Step 10: Reduce system overheating.
she
If you’ve dealt with the system administrator long enough, you’ve seen the horrendous “server slow” incidents. Again, for a long time, this kind of injury left a hole in my stomach. How the hell can you fix something so subjective? A typical “slow” user might just be stuck because other processes (including unscheduled ones) are running and consuming more parameters than usual, or they might just be there having a server problem.
When I started working as a solid system administrator, I immediately answered: “I need more information about this.” Well, usually the user can’t provide more information because these people don’t know what’s going on behind the scenes or how to explain what they’re seeing other than “that’s definitely slow”. I am yesI answer the user, the number of things.Login
Yes
A Huge Number Of Things You Can Discover By Logging Into A Host. Can You Connect At All? Is The Connection Faulty? Or The ssh Command Already Has Three Levels Of Debugging, Each Providing A Ton Of Information Before You Even Log In. To Enable Debugging, Simply Add The -v Option To v. For Example, A Level 3 Debug That I Could Exclusively Use Would Probably Be:
[~]$ -vvv Ssh Hostname.domain.com
3″ “big” (aka CPU, RAM And Disk I/O)
Now let’s look at the two main causes of server slowdown: CPU, RAM, and disk I/O. CPU usage can lead to an overall slowdown in its host and difficulty in completing existing tasks in a timely manner. Some of the tools I use when analyzing CPU are Andsar top.CPU
Check The Use Of A Fitted Top
The top utility gives you a real-time overview of what’s happening on the server as well. According toThe default start time top shows almost all CPU activity:
This view can be changed by pressing the number key 1, and usually more detailed information about the usage values of each CPU is added:
In this view, you should monitor the load average (displayed on the right side of the top row) and the value of all of the following parameters for each processor:
• us: This fee is the amount of CPU used by user processes.
• sy: This percentage indicates the amount of CPU consumed by system processes.
• id: represents the idle percentage of each processor.
• linux server slow troubleshooting
Any of these three values can give you a pretty good real-time indication of whether processors are associated with user handlers or system processes.
You’ll need your own information to really explain average deliveries. For this reason, in this article I will speak in general terms. The three load averages, from left to right, represent one-minute, five-minutemorning and additional 15-minute averages. Generally speaking, if you find that your one-minute average exceeds the number of associated physical CPUs you have, then the particular system most likely has a CPU hang.
Note. For more information on Last Everyday and why some people think this number is stupid, check out Brendan Gregg’s detailed research.
Test All Specific Big Three With Sar
Why is my server slow?
The reasons for slow servers are usually web hosting considerations. You may be experiencing a slow website because your site is hosted on a free internet host. You are using low-quality hosting with poor content. Or your site needs a hosting account with enhanced features and big money, such as VPS.
For historical CPU performance data, I rely on the sar command provided by the sysstat package. Most web versions of Linux have sysstat installed by default, but if it’s safe to do so, you can add it using your distribution’s package manager. The sar application collects system data every 10 hours using a cron job located in /etc/cron.d/sysstat (CentOS 7.6). This is what all the “big three” check with sar.
Note. If you’re just setting up sar according to this description, give the command some time to collect data.
Commandsar -u provides information about all processors in the system, starting at midnight:
As with top, here you need to directly check %user, %system, % iowait and hence %idle. This information may indicate how long ago the machine had problems.
How do I troubleshoot a slow web server?
Clean up your website code. Remove unnecessary elements such as spaces, comments, and line breaks.Check your current PHP version.MySQL Server: Look for slow queries.Analyze videos from slow sites.Speed up your site.Check if you are satisfied.
In general, some sar commands can provide a lot of information. Since this article is obviously giving a quick overview of what’s happening on the server, make sure you play man sar for more details in this article.
To test memory performance, I use sar -r which gives the person memory usage data for that day:
The focus of RAM input is %memused and %commit. A few words about the %commit field: this field can show more than 100% because the Linux kernel regularly overwrites RAM. If %commit consistently exceeds 100%, this may indicate that the system needs more RAM.
How do I fix a slow running Linux server problem?
Step 1: Check for I/O slowdown and CPU idle time.Step 2: I/O latency is low and idle hours are low: check the value CPU user time.Step 3: I/O latency is cheaper and idle time is longer.Step 4: I/O wait is high: Check swap usage.Stage 5: The use of change is great.Step 6: Adjust low usage.
For disk I/O performance, I use sar -d, which prints your computer’s I/O output with just the name of the guitar. To get device names use sar -dP:
linux server slow troubleshooting
For information about this type of output, see
LÖST: Förslag För Felsökning Av En Långsam Linux-server.
OPGELOST: Suggesties Voor Het Oplossen Van Problemen Met Een Trage Linux-server.
РЕШЕНО: предложения по устранению неполадок с медленным сервером Linux.
ROZWIĄZANE: Sugestie Dotyczące Rozwiązywania Problemów Z Powolnym Serwerem Linux.
RÉSOLU : Suggestions Pour Dépanner Un Serveur Linux Lent.
해결: 느린 Linux 서버 문제 해결을 위한 제안.
BEHOBEN: Vorschläge Zur Fehlerbehebung Bei Einem Langsamen Linux-Server.
RESOLVIDO: Sugestões Para Solucionar Problemas De Um Servidor Linux Lento.
SOLUCIONADO: Sugerencias Para Solucionar Problemas De Un Servidor Linux Lento.
RISOLTO: Suggerimenti Per La Risoluzione Dei Problemi Di Un Server Linux Lento.
|
{
"url": "https://daemonbase.com/en/linux-server-slow-troubleshooting/",
"source_domain": "daemonbase.com",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "54322",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FOW2JKON4G4G5VVJSPXNO2RP5C2NDDWC",
"WARC-Concurrent-To": "<urn:uuid:6b413590-5fe9-42b3-8c1e-16d623cd4ad5>",
"WARC-Date": "2022-09-27T00:53:48Z",
"WARC-IP-Address": "104.21.38.150",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BW5XOPUTGJYJ5COCLJBLYZZU5UXS4Y5Y",
"WARC-Record-ID": "<urn:uuid:af56d480-4d32-4f1b-9e94-ac94041fe84e>",
"WARC-Target-URI": "https://daemonbase.com/en/linux-server-slow-troubleshooting/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4743c125-5513-434b-91fb-3c44a565fa5c>"
},
"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,
61,
62,
140,
141,
394,
395,
399,
400,
834,
835,
1202,
1203,
1207,
1208,
1570,
1571,
1605,
1606,
1643,
1644,
1906,
1907,
1937,
1938,
2098,
2099,
2239,
2240,
2404,
2405,
2467,
2549,
2607,
2645,
2646,
2803,
2804,
3237,
3238,
3380,
3381,
3422,
3423,
3450,
3451,
3757,
3758,
4172,
4173,
4288,
4289,
4386,
4387,
4547,
4548,
4593,
4594,
4843,
4844,
5064,
5065,
5165,
5166,
5429,
5430,
5484,
5485,
5779,
5780,
5931,
5932,
5970,
5971,
6022,
6023,
6084,
6169,
6245,
6331,
6393,
6427,
6504,
6583,
6666
],
"line_end_idx": [
61,
62,
140,
141,
394,
395,
399,
400,
834,
835,
1202,
1203,
1207,
1208,
1570,
1571,
1605,
1606,
1643,
1644,
1906,
1907,
1937,
1938,
2098,
2099,
2239,
2240,
2404,
2405,
2467,
2549,
2607,
2645,
2646,
2803,
2804,
3237,
3238,
3380,
3381,
3422,
3423,
3450,
3451,
3757,
3758,
4172,
4173,
4288,
4289,
4386,
4387,
4547,
4548,
4593,
4594,
4843,
4844,
5064,
5065,
5165,
5166,
5429,
5430,
5484,
5485,
5779,
5780,
5931,
5932,
5970,
5971,
6022,
6023,
6084,
6169,
6245,
6331,
6393,
6427,
6504,
6583,
6666,
6749
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6749,
"ccnet_original_nlines": 84,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.29250720143318176,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04899134859442711,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2010086476802826,
"rps_doc_frac_unique_words": 0.4834558665752411,
"rps_doc_mean_word_length": 4.885110378265381,
"rps_doc_num_sentences": 83,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.728717803955078,
"rps_doc_word_count": 1088,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.019190970808267593,
"rps_doc_frac_chars_dupe_6grams": 0.01354657020419836,
"rps_doc_frac_chars_dupe_7grams": 0.01354657020419836,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.004703669808804989,
"rps_doc_frac_chars_top_3gram": 0.0037629399448633194,
"rps_doc_frac_chars_top_4gram": 0.006020700093358755,
"rps_doc_books_importance": -707.5228271484375,
"rps_doc_books_importance_length_correction": -707.5228271484375,
"rps_doc_openwebtext_importance": -315.0723571777344,
"rps_doc_openwebtext_importance_length_correction": -315.0723571777344,
"rps_doc_wikipedia_importance": -222.69651794433594,
"rps_doc_wikipedia_importance_length_correction": -222.69651794433594
},
"fasttext": {
"dclm": 0.0779792070388794,
"english": 0.8011229038238525,
"fineweb_edu_approx": 2.4989054203033447,
"eai_general_math": 0.18886148929595947,
"eai_open_web_math": 0.20296519994735718,
"eai_web_code": 0.3625684976577759
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-3,850,787,739,159,548,400 |
Gossamer Forum
Home : Products : Links 2.0 : Discussions :
Password Modify Help
Quote Reply
Password Modify Help
Hi,
I tried to install the Password Modify v1.0 for Links v2.0 from the Resources in Links : Modifications section.
But didnt have good luck.
i followed the instructions until i came to the point where it starts with:
In your site_html.pl you will have a lot of litle changes.
1) In your sub site_html_add_form you will have to add this option to the user:
There is no user section or i'm misunderstanding this. I mean where do i even place this?
Then in the part 2 section it says to create a sub called site_html_modify_first but it says he's not putting all the code there.
Whats all or the rest of the code?
Then in part 3 it says to change all the $in{'xxx'} to $rec{'xxx'}
but i couldnt even find it
All help is appreciated
Thanks
Ibrahim
Quote Reply
Re: Password Modify Help In reply to
1) You will have to add a field in your links.def file for the Password Field. Read the FAQ in the Resource Center for adding fields to your existing links.db file.
2) You will have to add an input field for the Password field in sub site_html_add_form if you are using the site_html.pl. If not, then you will have to add the input field in the add template files:
add_form.html
add_error.html
3) Your sub site_html_modify_first should look like the following in the site_html_templates.pl file:
Code:
sub site_html_modify_first {
#---------------------------------------------------------
# Modify Access Form
&html_print_headers;
print &load_cgi_template ('modify_first.html', { %globals
});
}
4) In the sub site_html_modify_form, change the $in{'Category'} to $rec{'Category'}.
Hope this helps.
BTW: Since this question regards a Mod that you installed, you should post this type of question in the LINKS MODIFICATION FORUM.
Wink
Regards,
------------------
Eliot Lee....
Former Handle: Eliot
* Check Resource Center
* Search Forums
|
{
"url": "https://www.gossamer-threads.com/forum/?do=post_view_printable;post=80377",
"source_domain": "www.gossamer-threads.com",
"snapshot_id": "crawl=CC-MAIN-2022-05",
"warc_metadata": {
"Content-Length": "15787",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:P2SCHNWKSZALXMGBXVJOCWZL45HZ4LM5",
"WARC-Concurrent-To": "<urn:uuid:1f50b58d-4043-4a36-b870-617a2b5fce10>",
"WARC-Date": "2022-01-27T03:37:57Z",
"WARC-IP-Address": "52.24.251.32",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:2SFMS2QMOUPMZUYAFBKMMQC2QRKS3P32",
"WARC-Record-ID": "<urn:uuid:9fe9a63b-2aa8-45e4-8ed0-ec86f80fd069>",
"WARC-Target-URI": "https://www.gossamer-threads.com/forum/?do=post_view_printable;post=80377",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:686c1120-3679-4114-9d19-8abf99d52e6a>"
},
"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-184\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,
15,
59,
60,
81,
82,
94,
115,
119,
120,
232,
233,
259,
260,
336,
337,
396,
476,
477,
567,
568,
698,
699,
734,
735,
802,
829,
830,
854,
855,
862,
870,
882,
919,
1084,
1085,
1285,
1286,
1300,
1315,
1316,
1418,
1419,
1425,
1454,
1513,
1534,
1535,
1556,
1614,
1618,
1620,
1621,
1706,
1707,
1724,
1725,
1855,
1856,
1861,
1862,
1871,
1872,
1891,
1905,
1926,
1950
],
"line_end_idx": [
15,
59,
60,
81,
82,
94,
115,
119,
120,
232,
233,
259,
260,
336,
337,
396,
476,
477,
567,
568,
698,
699,
734,
735,
802,
829,
830,
854,
855,
862,
870,
882,
919,
1084,
1085,
1285,
1286,
1300,
1315,
1316,
1418,
1419,
1425,
1454,
1513,
1534,
1535,
1556,
1614,
1618,
1620,
1621,
1706,
1707,
1724,
1725,
1855,
1856,
1861,
1862,
1871,
1872,
1891,
1905,
1926,
1950,
1965
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1965,
"ccnet_original_nlines": 66,
"rps_doc_curly_bracket": 0.006106869783252478,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36523929238319397,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017632240429520607,
"rps_doc_frac_lines_end_with_ellipsis": 0.014925369992852211,
"rps_doc_frac_no_alph_words": 0.2191435843706131,
"rps_doc_frac_unique_words": 0.4802631735801697,
"rps_doc_mean_word_length": 4.7039475440979,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0.007556680124253035,
"rps_doc_unigram_entropy": 4.585374355316162,
"rps_doc_word_count": 304,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0447552390396595,
"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.03846153989434242,
"rps_doc_frac_chars_top_4gram": 0.0363636389374733,
"rps_doc_books_importance": -143.5215606689453,
"rps_doc_books_importance_length_correction": -143.5215606689453,
"rps_doc_openwebtext_importance": -62.59074783325195,
"rps_doc_openwebtext_importance_length_correction": -62.59074783325195,
"rps_doc_wikipedia_importance": -31.427349090576172,
"rps_doc_wikipedia_importance_length_correction": -31.427349090576172
},
"fasttext": {
"dclm": 0.023262079805135727,
"english": 0.7748586535453796,
"fineweb_edu_approx": 1.3788597583770752,
"eai_general_math": 0.09019041061401367,
"eai_open_web_math": 0.25394994020462036,
"eai_web_code": 0.008499800227582455
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-8,744,519,338,135,628,000 |
84
I want to validate a URL and display message. Below is my code:
$("#pageUrl").keydown(function(){
$(".status").show();
var url = $("#pageUrl").val();
if(isValidURL(url)){
$.ajax({
type: "POST",
url: "demo.php",
data: "pageUrl="+ url,
success: function(msg){
if(msg == 1 ){
$(".status").html('<img src="images/success.gif"/><span><strong>SiteID:</strong>12345678901234456</span>');
}else{
$(".status").html('<img src="images/failure.gif"/>');
}
}
});
}else{
$(".status").html('<img src="images/failure.gif"/>');
}
});
function isValidURL(url){
var RegExp = /(ftp|http|https):\/\/(\w+:{0,1}\w*@)?(\S+)(:[0-9]+)?(\/|\/([\w#!:.?+=&%@!\-\/]))?/;
if(RegExp.test(url)){
return true;
}else{
return false;
}
}
My problem is now it will show an error message even when entering a proper URL until it matches regular expression, and it return true even if the URL is something like "http://wwww".
I appreciate your suggestions.
7
• 3
Don't forget to also add a server-side checking as javascript checking can easily be hacked.
– Randell
Aug 20, 2009 at 4:03
• It should be relatively easy to find a more reliable regex for URL matching (in javascript). On a side note, I would recommend not to capitalize variables (such as RegExp in your example) unless they are constructors/namespaces (which your variable isn't). Also don't forget that RegExp#test already returns boolean so you really don't need that if/else; just do - return re.test(url).
– kangax
Aug 20, 2009 at 4:14
• 5
Note: The url "wwww"; is a valid url. You could have a host named wwww
– kanngard
Aug 20, 2009 at 6:02
• The Jquery plugin Validation validates URL too. docs.jquery.com/Plugins/Validation/Methods/url
– Codler
Aug 22, 2010 at 21:50
• 2
Google's Closure Library has a URL validator in the goog.string.linkify namespace which you can rip out from the source here: code.google.com/p/closure-library/source/browse/closure/goog/… Look at findFirstUrl().
– Technetium
Jun 20, 2012 at 16:43
19 Answers 19
69
Someone mentioned the Jquery Validation plugin, seems overkill if you just want to validate the url, here is the line of regex from the plugin:
return this.optional(element) || /^(https?|ftp):\/\/(((([a-z]|\d|-|\.|_|~|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])|(%[\da-f]{2})|[!\$&'\(\)\*\+,;=]|:)*@)?(((\d|[1-9]\d|1\d\d|2[0-4]\d|25[0-5])\.(\d|[1-9]\d|1\d\d|2[0-4]\d|25[0-5])\.(\d|[1-9]\d|1\d\d|2[0-4]\d|25[0-5])\.(\d|[1-9]\d|1\d\d|2[0-4]\d|25[0-5]))|((([a-z]|\d|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])|(([a-z]|\d|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])([a-z]|\d|-|\.|_|~|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])*([a-z]|\d|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])))\.)+(([a-z]|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])|(([a-z]|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])([a-z]|\d|-|\.|_|~|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])*([a-z]|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])))\.?)(:\d*)?)(\/((([a-z]|\d|-|\.|_|~|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])|(%[\da-f]{2})|[!\$&'\(\)\*\+,;=]|:|@)+(\/(([a-z]|\d|-|\.|_|~|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])|(%[\da-f]{2})|[!\$&'\(\)\*\+,;=]|:|@)*)*)?)?(\?((([a-z]|\d|-|\.|_|~|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])|(%[\da-f]{2})|[!\$&'\(\)\*\+,;=]|:|@)|[\uE000-\uF8FF]|\/|\?)*)?(\#((([a-z]|\d|-|\.|_|~|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])|(%[\da-f]{2})|[!\$&'\(\)\*\+,;=]|:|@)|\/|\?)*)?$/i.test(value);
Here is where they got it from: http://projects.scottsplayground.com/iri/
Pointed out by @nhahtdh This has been updated to:
// Copyright (c) 2010-2013 Diego Perini, MIT licensed
// https://gist.github.com/dperini/729294
// see also https://mathiasbynens.be/demo/url-regex
// modified to allow protocol-relative URLs
return this.optional( element ) || /^(?:(?:(?:https?|ftp):)?\/\/)(?:\S+(?::\S*)?@)?(?:(?!(?:10|127)(?:\.\d{1,3}){3})(?!(?:169\.254|192\.168)(?:\.\d{1,3}){2})(?!172\.(?:1[6-9]|2\d|3[0-1])(?:\.\d{1,3}){2})(?:[1-9]\d?|1\d\d|2[01]\d|22[0-3])(?:\.(?:1?\d{1,2}|2[0-4]\d|25[0-5])){2}(?:\.(?:[1-9]\d?|1\d\d|2[0-4]\d|25[0-4]))|(?:(?:[a-z\u00a1-\uffff0-9]-*)*[a-z\u00a1-\uffff0-9]+)(?:\.(?:[a-z\u00a1-\uffff0-9]-*)*[a-z\u00a1-\uffff0-9]+)*(?:\.(?:[a-z\u00a1-\uffff]{2,})).?)(?::\d{2,5})?(?:[/?#]\S*)?$/i.test( value );
source: https://github.com/jzaefferer/jquery-validation/blob/c1db10a34c0847c28a5bd30e3ee1117e137ca834/src/core.js#L1349
7
• The jQuery Validation's approach allows for underscores ("_") in domain names. As far as I've found out it is not allowed in domain names. Only hyphens are allowed ("-"). PHP's filter_var($url, FILTER_VALIDATE_URL) seems to NOT allow underscores in domain names, for example.
– Vladius
Nov 11, 2013 at 14:45
• The \u00A0-\uD7FF range is overly broad. The quote characters like ” (\u201D) are in that range. For example, if first splitting on whitespace, the end of a quoted sentence may be 'this.”' If this isn't technically a false positive, it typically would be in practice if using this regex for identifying a url.
– MetaThis
Dec 27, 2013 at 23:18
• 2
The regex above has been replaced by Diego Perini's regex in the source of jQuery Validation: github.com/jzaefferer/jquery-validation/blob/master/src/…
– nhahtdh
Oct 7, 2015 at 10:37
• 1
The regex has moved to line 1306 - github.com/jzaefferer/jquery-validation/blob/master/src/… Jan 27, 2016 at 0:38
• 2
@Kousha: www.google.com is not a valid URL, so it should fail the test. Nov 8, 2016 at 1:21
48
It's not practical to parse URLs using regex. A full implementation of the RFC1738 rules would result in an enormously long regex (assuming it's even possible). Certainly your current expression fails many valid URLs, and passes invalid ones.
Instead:
a. use a proper URL parser that actually follows the real rules. (I don't know of one for JavaScript; it would probably be overkill. You could do it on the server side though). Or,
b. just trim away any leading or trailing spaces, then check it has one of your preferred schemes on the front (typically ‘http://’ or ‘https://’), and leave it at that. Or,
c. attempt to use the URL and see what lies at the end, for example by sending it am HTTP HEAD request from the server-side. If you get a 404 or connection error, it's probably wrong.
it return true even if url is something like "http://wwww".
Well, that is indeed a perfectly valid URL.
If you want to check whether a hostname such as ‘wwww’ actually exists, you have no choice but to look it up in the DNS. Again, this would be server-side code.
2
33
function validateURL(textval) {
var urlregex = /^(https?|ftp):\/\/([a-zA-Z0-9.-]+(:[a-zA-Z0-9.&%$-]+)*@)*((25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9][0-9]?)(\.(25[0-5]|2[0-4][0-9]|1[0-9]{2}|[1-9]?[0-9])){3}|([a-zA-Z0-9-]+\.)*[a-zA-Z0-9-]+\.(com|edu|gov|int|mil|net|org|biz|arpa|info|name|pro|aero|coop|museum|[a-zA-Z]{2}))(:[0-9]+)*(\/($|[a-zA-Z0-9.,?'\\+&%$#=~_-]+))*$/;
return urlregex.test(textval);
}
This can return true for URLs like:
http://stackoverflow.com/questions/1303872/url-validation-using-javascript
or:
http://regexlib.com/DisplayPatterns.aspx?cattabindex=1&categoryId=2
6
• 2
Why the RegExp constructor? A literal is fine here. Why assign the object to a variable? function validateURL(textval) { return /^(http...$/.test(textval) } is slightly shorter and clearer. Sep 15, 2011 at 0:03
• 7
[...&...] will not do what you expect. A character class doesn't allow for strings.
– genio
Nov 1, 2011 at 18:23
• This URL doesn't pass validation even though it's legal: uk.reuters.com/article/2013/02/25/… (remove 20130225 from the end and it's valid)
– ytoledano
Mar 5, 2013 at 10:16
• asdf.asdf is returning true with this one. Why?
– Raza Ahmed
May 17, 2014 at 14:34
• It all depends on what you understand by "valid URL". All examples you have given will work (considered valid) when pasted to browser address bar and will most likely fail (considered invalid), when used as value of <a href="">.
– trejder
Jun 8, 2015 at 13:47
16
I written also a URL validation function base on rfc1738 and rfc3986 to check http and https urls. I try to hold this modular, so it can be better maintained and adapted to own requirements.
The RegExp in one line is show at end of this post.
The RegExp accept HTTP and HTTPS URLs with some international domain or IPv4 number. IPv6 is not supported yet.
window.isValidURL = (function() {// wrapped in self calling function to prevent global pollution
//URL pattern based on rfc1738 and rfc3986
var rg_pctEncoded = "%[0-9a-fA-F]{2}";
var rg_protocol = "(http|https):\\/\\/";
var rg_userinfo = "([a-zA-Z0-9$\\-_.+!*'(),;:&=]|" + rg_pctEncoded + ")+" + "@";
var rg_decOctet = "(25[0-5]|2[0-4][0-9]|[0-1][0-9][0-9]|[1-9][0-9]|[0-9])"; // 0-255
var rg_ipv4address = "(" + rg_decOctet + "(\\." + rg_decOctet + "){3}" + ")";
var rg_hostname = "([a-zA-Z0-9\\-\\u00C0-\\u017F]+\\.)+([a-zA-Z]{2,})";
var rg_port = "[0-9]+";
var rg_hostport = "(" + rg_ipv4address + "|localhost|" + rg_hostname + ")(:" + rg_port + ")?";
// chars sets
// safe = "$" | "-" | "_" | "." | "+"
// extra = "!" | "*" | "'" | "(" | ")" | ","
// hsegment = *[ alpha | digit | safe | extra | ";" | ":" | "@" | "&" | "=" | escape ]
var rg_pchar = "a-zA-Z0-9$\\-_.+!*'(),;:@&=";
var rg_segment = "([" + rg_pchar + "]|" + rg_pctEncoded + ")*";
var rg_path = rg_segment + "(\\/" + rg_segment + ")*";
var rg_query = "\\?" + "([" + rg_pchar + "/?]|" + rg_pctEncoded + ")*";
var rg_fragment = "\\#" + "([" + rg_pchar + "/?]|" + rg_pctEncoded + ")*";
var rgHttpUrl = new RegExp(
"^"
+ rg_protocol
+ "(" + rg_userinfo + ")?"
+ rg_hostport
+ "(\\/"
+ "(" + rg_path + ")?"
+ "(" + rg_query + ")?"
+ "(" + rg_fragment + ")?"
+ ")?"
+ "$"
);
// export public function
return function (url) {
if (rgHttpUrl.test(url)) {
return true;
} else {
return false;
}
};
})();
RegExp in one line:
var rg = /^(http|https):\/\/(([a-zA-Z0-9$\-_.+!*'(),;:&=]|%[0-9a-fA-F]{2})+@)?(((25[0-5]|2[0-4][0-9]|[0-1][0-9][0-9]|[1-9][0-9]|[0-9])(\.(25[0-5]|2[0-4][0-9]|[0-1][0-9][0-9]|[1-9][0-9]|[0-9])){3})|localhost|([a-zA-Z0-9\-\u00C0-\u017F]+\.)+([a-zA-Z]{2,}))(:[0-9]+)?(\/(([a-zA-Z0-9$\-_.+!*'(),;:@&=]|%[0-9a-fA-F]{2})*(\/([a-zA-Z0-9$\-_.+!*'(),;:@&=]|%[0-9a-fA-F]{2})*)*)?(\?([a-zA-Z0-9$\-_.+!*'(),;:@&=\/?]|%[0-9a-fA-F]{2})*)?(\#([a-zA-Z0-9$\-_.+!*'(),;:@&=\/?]|%[0-9a-fA-F]{2})*)?)?$/;
1
• 3
This is great! Very helpful that you broke it down into different parts - I wouldn't want to just blindly trust a massive regex.
– Jason
Sep 26, 2014 at 14:23
13
In a similar situation I got away with this:
someUtils.validateURL = function(url) {
var parser = document.createElement('a');
try {
parser.href = url;
return !!parser.hostname;
} catch (e) {
return false;
}
};
i.e. why invent the wheel if browsers can do it for you? But, of course, this will only work in the browser.
there are various parts of parsed URL exactly how browser would interpret it:
parser.protocol; // => "http:"
parser.hostname; // => "example.com"
parser.port; // => "8080"
parser.pathname; // => "/path/"
parser.search; // => "?search=test"
parser.hash; // => "#hash"
parser.host; // => "example.com:3000"
Using these you can improve your validating function depending on the requirements. The only drawback is that it will accept relative URLs and use current page server's host and port. But you can use it for your advantage, by re-assembling the URL from parts and always passing it in full to your AJAX service.
What validateURL won't accept is invalid URL, e.g. http:\:8883 will return false, but :1234 is valid and is interpreted as http://pagehost.example.com/:1234 i.e. as a relative path.
UPDATE
This approach is no longer working with Chrome and other WebKit browsers. Even when URL is invalid, hostname is filled with some value, e.g. taken from base. It still helps to parse parts of URL, but will not allow to validate one.
Possible better no-own-parser approach is to use var parsedURL = new URL(url) and catch exceptions. See e.g. URL API. Supported by all major browsers and NodeJS, although still marked experimental.
2
• 3
This will return TRUE for <script>alert();</script>
– Subin
May 13, 2016 at 19:24
• 2
@Subin In modern browsers the approach in this answer is no longer working. Thanks for bringing attention to it. In fact, hostname is filled no matter what string you pass.
– Alex Pakka
May 13, 2016 at 19:41
8
best regex I found from http://angularjs.org/
var urlregex = /^(ftp|http|https):\/\/(\w+:{0,1}\w*@)?(\S+)(:[0-9]+)?(\/|\/([\w#!:.?+=&%@!\-\/]))?$/;
1
• If i test this:---- /^(ftp|http|https):\/\/(\w+:{0,1}\w*@)?(\S+)(:[0-9]+)?(\/|\/([\w#!:.?+=&%@!\-\/]))?$/.test('abc.com.com.com') It return true value. I think it should be allow only 2 .com in url.
– Abhishek
Dec 9, 2016 at 7:42
5
This is what worked for me:
function validateURL(value) {
return /^(https?|ftp):\/\/(((([a-z]|\d|-|\.|_|~|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])|(%[\da-f]{2})|[!\$&'\(\)\*\+,;=]|:)*@)?(((\d|[1-9]\d|1\d\d|2[0-4]\d|25[0-5])\.(\d|[1-9]\d|1\d\d|2[0-4]\d|25[0-5])\.(\d|[1-9]\d|1\d\d|2[0-4]\d|25[0-5])\.(\d|[1-9]\d|1\d\d|2[0-4]\d|25[0-5]))|((([a-z]|\d|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])|(([a-z]|\d|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])([a-z]|\d|-|\.|_|~|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])*([a-z]|\d|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])))\.)+(([a-z]|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])|(([a-z]|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])([a-z]|\d|-|\.|_|~|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])*([a-z]|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])))\.?)(:\d*)?)(\/((([a-z]|\d|-|\.|_|~|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])|(%[\da-f]{2})|[!\$&'\(\)\*\+,;=]|:|@)+(\/(([a-z]|\d|-|\.|_|~|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])|(%[\da-f]{2})|[!\$&'\(\)\*\+,;=]|:|@)*)*)?)?(\?((([a-z]|\d|-|\.|_|~|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])|(%[\da-f]{2})|[!\$&'\(\)\*\+,;=]|:|@)|[\uE000-\uF8FF]|\/|\?)*)?(\#((([a-z]|\d|-|\.|_|~|[\u00A0-\uD7FF\uF900-\uFDCF\uFDF0-\uFFEF])|(%[\da-f]{2})|[!\$&'\(\)\*\+,;=]|:|@)|\/|\?)*)?$/i.test(value);
}
from there is is just a matter of calling the function to get a true or false back:
validateURL(urltovalidate);
1
• Heads up, this will fail for ip addresses. Oct 26, 2014 at 21:20
5
I know it's quite an old question but since it does not have any accepted answer, I suggest you to use the URI.js framework: https://github.com/medialize/URI.js
You can use it to check for malformed URI using a try/catch block:
function isValidURL(url)
{
try {
(new URI(url));
return true;
}
catch (e) {
// Malformed URI
return false;
}
}
Of course it will consider something like "%@" as a well formed relative URI... So I suggest you read the URI.js API to perform more checks, for example if you want to make sure that the user entered a well formed absolute URL you may do like this:
function isValidURL(url)
{
try {
var uri = new URI(url);
// URI has a scheme and a host
return (!!uri.scheme() && !!uri.host());
}
catch (e) {
// Malformed URI
return false;
}
}
2
• it fails on htt://localhost:86/asdfghjkl Jul 23, 2020 at 23:07
• Your URL is valid, so the test returns true. I guess what you want to do is check that the protocol is http(s), then just add a !!uri.scheme().match(/^http(s?)$/) to the test.
– Romain
Jul 26, 2020 at 8:25
2
Import in an npm package like
https://www.npmjs.com/package/valid-url
and use it to validate your url.
1
• The github issues gives to think that the library lacks quality
– jose920405
Jul 21, 2017 at 15:22
2
You can use the URL API that is recently standard. Browser support is sketchy at best, see the link. new URL(str) is guaranteed to throw TypeError for invalid URLs.
As stated above, http://wwww is a valid URL.
1
If you're looking for a more reliable regex, check out RegexLib. Here's the page you'd probably be interested in:
http://regexlib.com/Search.aspx?k=url
As for the error messages showing while the person is still typing, change the event from keydown to blur and then it will only check once the person moves to the next element.
1
var RegExp = (/^HTTP|HTTP|http(s)?:\/\/(www\.)?[A-Za-z0-9]+([\-\.]{1}[A-Za-z0-9]+)*\.[A-Za-z]{2,40}(:[0-9]{1,40})?(\/.*)?$/);
1
My solution:
function isValidUrl(t)
{
return t.match(/^(http|https|ftp):\/\/(([A-Z0-9][A-Z0-9_-]*)(\.[A-Z0-9][A-Z0-9_-]*)+)(:(\d+))?\/?/i)
}
1
The URL API can be used to validate the structure of a URL string.
An error is thrown when trying to serialise an invalid URL string into a URL object. This could be abstracted into a helper function (Typescript snippet below):
function isValidURL(URL: string) : boolean {
try {
new URL(string);
return true;
} catch (err) { return false; }
}
isValidURL('https://www.google.com'); // returns true
isValidURL('localhost:3000'); // returns true
isValidURL('not-a-valid-url'); // returns false
isValidURL('google.com'); // returns false (see footnote)
If you strictly want HTTP / web links to be valid, we can simply add a condition to the return statement:
...
const url = new URL(string);
return url.protocol === 'https:' || url.protocol === 'http:';
...
Granted, this approach comes with a few caveats:
• No support for the URL API in Internet Explorer (could be fixed with a polyfill)
• Without additional checks, URLs without either a protocol or port are seen as invalid (e.g. google.com is invalid but google.com:3000 is OK). This may be an unintended behaviour for some usecases.
0
Demo : http://jsbin.com/uzimeb/1/edit
function checkURL(value) {
var urlregex = new RegExp("^(http|https|ftp)\://([a-zA-Z0-9\.\-]+(\:[a-zA-Z0-9\.&%\$\-]+)*@)*((25[0-5]|2[0-4][0-9]|[0-1]{1}[0-9]{2}|[1-9]{1}[0-9]{1}|[1-9])\.(25[0-5]|2[0-4][0-9]|[0-1]{1}[0-9]{2}|[1-9]{1}[0-9]{1}|[1-9]|0)\.(25[0-5]|2[0-4][0-9]|[0-1]{1}[0-9]{2}|[1-9]{1}[0-9]{1}|[1-9]|0)\.(25[0-5]|2[0-4][0-9]|[0-1]{1}[0-9]{2}|[1-9]{1}[0-9]{1}|[0-9])|([a-zA-Z0-9\-]+\.)*[a-zA-Z0-9\-]+\.(com|edu|gov|int|mil|net|org|biz|arpa|info|name|pro|aero|coop|museum|[a-zA-Z]{2}))(\:[0-9]+)*(/($|[a-zA-Z0-9\.\,\?\'\\\+&%\$#\=~_\-]+))*$");
if (urlregex.test(value)) {
return (true);
}
return (false);
}
0
I have found a great resource for comparing different solutions: https://mathiasbynens.be/demo/url-regex
According to that page, only solution from diegoperini passes all tests. Here is that regex:
_^(?:(?:https?|ftp)://)(?:\S+(?::\S*)?@)?(?:(?!10(?:\.\d{1,3}){3})(?!127(?:\.\d{1,3}){3})(?!169\.254(?:\.\d{1,3}){2})(?!192\.168(?:\.\d{1,3}){2})(?!172\.(?:1[6-9]|2\d|3[0-1])(?:\.\d{1,3}){2})(?:[1-9]\d?|1\d\d|2[01]\d|22[0-3])(?:\.(?:1?\d{1,2}|2[0-4]\d|25[0-5])){2}(?:\.(?:[1-9]\d?|1\d\d|2[0-4]\d|25[0-4]))|(?:(?:[a-z\x{00a1}-\x{ffff}0-9]+-?)*[a-z\x{00a1}-\x{ffff}0-9]+)(?:\.(?:[a-z\x{00a1}-\x{ffff}0-9]+-?)*[a-z\x{00a1}-\x{ffff}0-9]+)*(?:\.(?:[a-z\x{00a1}-\x{ffff}]{2,})))(?::\d{2,5})?(?:/[^\s]*)?$_iuS
0
I checked a lot of url validators in google and no one works for me. For example I'd like to see valid on links like 'aa.com'. I like silly check for dot sign in string.
function isValidUri(str) {
var dotIndex = str.indexOf('.');
return (dotIndex > 0 && dotIndex < str.length - 2);
}
It should not stay on beginning and end of string (for now we don't have top level domain names with one character).
-1
Here's a regular expression which might fit the bill (it's very long):
/^(?:\u0066\u0069\u006C\u0065\u003A\u002F{2}(?:\u002F{2}(?:(?:[\u0041-\u005A\u0061-\u007A\u0030-\u0039\u002D\u002E\u005F\u007E\u0021\u0024\u0026\u0027\u0028\u0029\u002A\u002B\u002C\u003B\u003D]|\u0025[\u0030-\u0039\u0041-\u0046\u0061-\u0066][\u0030-\u0039\u0041-\u0046\u0061-\u0066])*\u0040)?(?:\u005B(?:(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A){6}(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}|(?:(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035])\u002E){3}(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035]))|\u003A{2}(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A){5}(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}|(?:(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035])\u002E){3}(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035]))|(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4})?\u003A{2}(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A){4}(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}|(?:(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035])\u002E){3}(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035]))|(?:(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A)?[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4})?\u003A{2}(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A){3}(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}|(?:(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035])\u002E){3}(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035]))|(?:(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A){0,2}[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4})?\u003A{2}(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A){2}(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}|(?:(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035])\u002E){3}(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035]))|(?:(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A){0,3}[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4})?\u003A{2}[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}|(?:(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035])\u002E){3}(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035]))|(?:(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A){0,4}[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4})?\u003A{2}(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}|(?:(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035])\u002E){3}(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035]))|(?:(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A){0,5}[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4})?\u003A{2}[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}|(?:(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A){0,6}[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4})?\u003A{2})\u005D|(?:(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035])\u002E){3}(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035])|(?:[\u0041-\u005A\u0061-\u007A\u0030-\u0039](?:(?:[\u0041-\u005A\u0061-\u007A\u0030-\u0039\u002D]+)?[\u0041-\u005A\u0061-\u007A\u0030-\u0039])?|(?:[\u0041-\u005A\u0061-\u007A\u0030-\u0039](?:(?:[\u0041-\u005A\u0061-\u007A\u0030-\u0039\u002D]+)?[\u0041-\u005A\u0061-\u007A\u0030-\u0039])?\u002E)+[\u0041-\u005A\u0061-\u007A\u0030-\u0039](?:(?:[\u0041-\u005A\u0061-\u007A\u0030-\u0039\u002D]+)?[\u0041-\u005A\u0061-\u007A\u0030-\u0039])?))(?:\u003A(?:\u0030-\u0035\u0030-\u0039{0,4}|\u0036\u0030-\u0034\u0030-\u0039{3}|\u0036\u0035\u0030-\u0034\u0030-\u0039{2}|\u0036\u0035\u0035\u0030-\u0032\u0030-\u0039|\u0036\u0035\u0035\u0033\u0030-\u0035))?(?:\u002F(?:[\u0041-\u005A\u0061-\u007A\u0030-\u0039\u002D\u002E\u005F\u007E\u0021\u0024\u0026\u0027\u0028\u0029\u002A\u002B\u002C\u003B\u003D\u003A\u0040]|\u0025[\u0030-\u0039\u0041-\u0046\u0061-\u0066][\u0030-\u0039\u0041-\u0046\u0061-\u0066])*)*|\u002F(?:(?:[\u0041-\u005A\u0061-\u007A\u0030-\u0039\u002D\u002E\u005F\u007E\u0021\u0024\u0026\u0027\u0028\u0029\u002A\u002B\u002C\u003B\u003D\u003A\u0040]|\u0025[\u0030-\u0039\u0041-\u0046\u0061-\u0066][\u0030-\u0039\u0041-\u0046\u0061-\u0066])+(?:\u002F(?:[\u0041-\u005A\u0061-\u007A\u0030-\u0039\u002D\u002E\u005F\u007E\u0021\u0024\u0026\u0027\u0028\u0029\u002A\u002B\u002C\u003B\u003D\u003A\u0040]|\u0025[\u0030-\u0039\u0041-\u0046\u0061-\u0066][\u0030-\u0039\u0041-\u0046\u0061-\u0066])*)*)?|(?:[\u0041-\u005A\u0061-\u007A\u0030-\u0039\u002D\u002E\u005F\u007E\u0021\u0024\u0026\u0027\u0028\u0029\u002A\u002B\u002C\u003B\u003D\u003A\u0040]|\u0025[\u0030-\u0039\u0041-\u0046\u0061-\u0066][\u0030-\u0039\u0041-\u0046\u0061-\u0066])+(?:\u002F(?:[\u0041-\u005A\u0061-\u007A\u0030-\u0039\u002D\u002E\u005F\u007E\u0021\u0024\u0026\u0027\u0028\u0029\u002A\u002B\u002C\u003B\u003D\u003A\u0040]|\u0025[\u0030-\u0039\u0041-\u0046\u0061-\u0066][\u0030-\u0039\u0041-\u0046\u0061-\u0066])*)*)|[\u0041-\u005A\u0061-\u007A][\u0041-\u005A\u0061-\u007A\u0030-\u0039\u002B\u002D\u002E]*\u003A(?:\u002F{2}(?:(?:[\u0041-\u005A\u0061-\u007A\u0030-\u0039\u002D\u002E\u005F\u007E\u0021\u0024\u0026\u0027\u0028\u0029\u002A\u002B\u002C\u003B\u003D]|\u0025[\u0030-\u0039\u0041-\u0046\u0061-\u0066][\u0030-\u0039\u0041-\u0046\u0061-\u0066])*\u0040)?(?:\u005B(?:(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A){6}(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}|(?:(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035])\u002E){3}(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035]))|\u003A{2}(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A){5}(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}|(?:(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035])\u002E){3}(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035]))|(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4})?\u003A{2}(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A){4}(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}|(?:(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035])\u002E){3}(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035]))|(?:(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A)?[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4})?\u003A{2}(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A){3}(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}|(?:(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035])\u002E){3}(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035]))|(?:(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A){0,2}[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4})?\u003A{2}(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A){2}(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}|(?:(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035])\u002E){3}(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035]))|(?:(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A){0,3}[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4})?\u003A{2}[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}|(?:(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035])\u002E){3}(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035]))|(?:(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A){0,4}[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4})?\u003A{2}(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}|(?:(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035])\u002E){3}(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035]))|(?:(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A){0,5}[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4})?\u003A{2}[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}|(?:(?:[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4}\u003A){0,6}[\u0030-\u0039\u0041-\u0046\u0061-\u0066]{1,4})?\u003A{2})\u005D|(?:(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035])\u002E){3}(?:[\u0030-\u0039]|[\u0031-\u0039][\u0030-\u0039]|\u0031[\u0030-\u0039]{2}|\u0032[\u0030-\u0034][\u0030-\u0039]|\u0032\u0035[\u0030-\u0035])|(?:[\u0041-\u005A\u0061-\u007A\u0030-\u0039](?:(?:[\u0041-\u005A\u0061-\u007A\u0030-\u0039\u002D]+)?[\u0041-\u005A\u0061-\u007A\u0030-\u0039])?|(?:[\u0041-\u005A\u0061-\u007A\u0030-\u0039](?:(?:[\u0041-\u005A\u0061-\u007A\u0030-\u0039\u002D]+)?[\u0041-\u005A\u0061-\u007A\u0030-\u0039])?\u002E)+[\u0041-\u005A\u0061-\u007A\u0030-\u0039](?:(?:[\u0041-\u005A\u0061-\u007A\u0030-\u0039\u002D]+)?[\u0041-\u005A\u0061-\u007A\u0030-\u0039])?))(?:\u003A(?:\u0030-\u0035\u0030-\u0039{0,4}|\u0036\u0030-\u0034\u0030-\u0039{3}|\u0036\u0035\u0030-\u0034\u0030-\u0039{2}|\u0036\u0035\u0035\u0030-\u0032\u0030-\u0039|\u0036\u0035\u0035\u0033\u0030-\u0035))?(?:\u002F(?:[\u0041-\u005A\u0061-\u007A\u0030-\u0039\u002D\u002E\u005F\u007E\u0021\u0024\u0026\u0027\u0028\u0029\u002A\u002B\u002C\u003B\u003D\u003A\u0040]|\u0025[\u0030-\u0039\u0041-\u0046\u0061-\u0066][\u0030-\u0039\u0041-\u0046\u0061-\u0066])*)*|\u002F(?:(?:[\u0041-\u005A\u0061-\u007A\u0030-\u0039\u002D\u002E\u005F\u007E\u0021\u0024\u0026\u0027\u0028\u0029\u002A\u002B\u002C\u003B\u003D\u003A\u0040]|\u0025[\u0030-\u0039\u0041-\u0046\u0061-\u0066][\u0030-\u0039\u0041-\u0046\u0061-\u0066])+(?:\u002F(?:[\u0041-\u005A\u0061-\u007A\u0030-\u0039\u002D\u002E\u005F\u007E\u0021\u0024\u0026\u0027\u0028\u0029\u002A\u002B\u002C\u003B\u003D\u003A\u0040]|\u0025[\u0030-\u0039\u0041-\u0046\u0061-\u0066][\u0030-\u0039\u0041-\u0046\u0061-\u0066])*)*)?|(?:[\u0041-\u005A\u0061-\u007A\u0030-\u0039\u002D\u002E\u005F\u007E\u0021\u0024\u0026\u0027\u0028\u0029\u002A\u002B\u002C\u003B\u003D\u003A\u0040]|\u0025[\u0030-\u0039\u0041-\u0046\u0061-\u0066][\u0030-\u0039\u0041-\u0046\u0061-\u0066])+(?:\u002F(?:[\u0041-\u005A\u0061-\u007A\u0030-\u0039\u002D\u002E\u005F\u007E\u0021\u0024\u0026\u0027\u0028\u0029\u002A\u002B\u002C\u003B\u003D\u003A\u0040]|\u0025[\u0030-\u0039\u0041-\u0046\u0061-\u0066][\u0030-\u0039\u0041-\u0046\u0061-\u0066])*)*)(?:\u003F(?:[\u0041-\u005A\u0061-\u007A\u0030-\u0039\u002D\u002E\u005F\u007E\u0021\u0024\u0026\u0027\u0028\u0029\u002A\u002B\u002C\u003B\u003D\u003A\u0040\u002F\u003F]|\u0025[\u0030-\u0039\u0041-\u0046\u0061-\u0066][\u0030-\u0039\u0041-\u0046\u0061-\u0066])*)?(?:\u0023(?:[\u0041-\u005A\u0061-\u007A\u0030-\u0039\u002D\u002E\u005F\u007E\u0021\u0024\u0026\u0027\u0028\u0029\u002A\u002B\u002C\u003B\u003D\u003A\u0040\u002F\u003F]|\u0025[\u0030-\u0039\u0041-\u0046\u0061-\u0066][\u0030-\u0039\u0041-\u0046\u0061-\u0066])*)?)$/
There are some caveats to its usage, namely it does not validate URIs which contain additional information after the user name (e.g. "username:password"). Also, only IPv6 addresses can be contained within the IP literal syntax and the "IPvFuture" syntax is currently ignored and will not validate against this regular expression. Port numbers are also constrained to be between 0 and 65,535. Also, only the file scheme can use triple slashes (e.g. "file:///etc/sysconfig") and can ignore both the query and fragment parts of a URI. Finally, it is geared towards regular URIs and not IRIs, hence the extensive focus on the ASCII character set.
This regular expression could be expanded upon, but it's already complex and long enough as it is. I also cannot guarantee it's going to be "100% accurate" or "bug free", but it should correctly validate URIs for all schemes.
You will need to do additional verification for any scheme-specific requirements or do URI normalization as this regular expression will validate a very broad range of URIs.
-2
Try edit your isValidURL function as follows:
function isValidURL(url) {
var encodedURL = encodeURIComponent(url);
var isValid = false;
$.ajax({
url: "http://query.yahooapis.com/v1/public/yql?q=select%20*%20from%20html%20where%20url%3D%22" + encodedURL + "%22&format=json",
type: "get",
async: false,
dataType: "json",
success: function(data) {
isValid = data.query.results != null;
},
error: function(){
isValid = false;
}
});
return isValid;
}
This should do the trick.
3
• since ajax is async, isValid would return always false, right?
– chepe263
Jun 25, 2014 at 16:49
• No. Ajax is async, but take a look at the call. It specifies "async: false".
– Ohad
Jun 26, 2014 at 19:38
• Synchronous calls are best avoided because of their performance implications. Also problematic is that the function here will return incorrect results if your network is down. In addition, it will also leak all your urls to yahoo. Jul 18, 2018 at 17:38
Your Answer
By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy
Not the answer you're looking for? Browse other questions tagged or ask your own question.
|
{
"url": "https://stackoverflow.com/questions/1303872/trying-to-validate-url-using-javascript",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "444212",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VZ7527YRHFRWVGD5MFTB5X5IMJ5LN4HG",
"WARC-Concurrent-To": "<urn:uuid:077ad57f-bef6-49f6-97ae-2f4ec9c7c78b>",
"WARC-Date": "2022-05-24T12:29:00Z",
"WARC-IP-Address": "151.101.129.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:E2NFJL3MCDQA4TJ4U7ZU3IYPE77Z6HIW",
"WARC-Record-ID": "<urn:uuid:fa19140c-878b-4288-8dac-8ea59635902b>",
"WARC-Target-URI": "https://stackoverflow.com/questions/1303872/trying-to-validate-url-using-javascript",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:479d7bd7-f8bc-4eca-9e92-3cf535fe548b>"
},
"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-26\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,
3,
4,
68,
69,
103,
132,
171,
172,
201,
202,
219,
245,
274,
309,
345,
376,
504,
527,
601,
619,
633,
649,
650,
669,
670,
744,
758,
759,
767,
768,
769,
795,
897,
898,
924,
945,
956,
978,
984,
987,
988,
1173,
1174,
1205,
1206,
1208,
1214,
1311,
1325,
1350,
1740,
1753,
1778,
1784,
1859,
1874,
1899,
1998,
2011,
2037,
2043,
2260,
2277,
2303,
2304,
2318,
2319,
2322,
2323,
2467,
2468,
3704,
3705,
3779,
3780,
3830,
3831,
3893,
3943,
4003,
4055,
4572,
4573,
4693,
4694,
4696,
4976,
4990,
5016,
5330,
5345,
5371,
5377,
5533,
5547,
5572,
5578,
5696,
5702,
5798,
5801,
5802,
6045,
6046,
6055,
6056,
6237,
6238,
6412,
6413,
6597,
6598,
6658,
6659,
6703,
6704,
6864,
6865,
6867,
6870,
6902,
7239,
7274,
7276,
7277,
7313,
7314,
7389,
7390,
7394,
7395,
7463,
7465,
7471,
7686,
7692,
7784,
7796,
7821,
7964,
7980,
8005,
8057,
8074,
8100,
8333,
8347,
8372,
8375,
8376,
8567,
8568,
8620,
8621,
8733,
8734,
8831,
8832,
8880,
8923,
8968,
8969,
9054,
9055,
9144,
9226,
9302,
9330,
9331,
9430,
9431,
9449,
9501,
9559,
9656,
9706,
9774,
9775,
9834,
9910,
9989,
9990,
10023,
10035,
10057,
10092,
10114,
10131,
10162,
10194,
10229,
10244,
10258,
10265,
10266,
10296,
10324,
10359,
10384,
10401,
10427,
10437,
10444,
10450,
10451,
10471,
10472,
10957,
10959,
10965,
11098,
11110,
11136,
11139,
11140,
11185,
11186,
11226,
11272,
11282,
11309,
11343,
11361,
11383,
11389,
11392,
11393,
11502,
11503,
11581,
11582,
11613,
11650,
11680,
11712,
11750,
11781,
11823,
11824,
12135,
12136,
12318,
12319,
12326,
12327,
12559,
12560,
12758,
12759,
12761,
12767,
12823,
12835,
12861,
12867,
13044,
13061,
13087,
13089,
13090,
13136,
13137,
13239,
13240,
13242,
13445,
13460,
13484,
13486,
13487,
13515,
13516,
13546,
14760,
14766,
14767,
14851,
14852,
14880,
14882,
14951,
14953,
14954,
15115,
15116,
15183,
15184,
15209,
15211,
15221,
15245,
15266,
15272,
15288,
15313,
15335,
15341,
15343,
15344,
15593,
15594,
15619,
15621,
15631,
15663,
15702,
15751,
15757,
15773,
15798,
15820,
15826,
15828,
15830,
15897,
16077,
16090,
16115,
16117,
16118,
16148,
16149,
16189,
16190,
16223,
16224,
16226,
16294,
16311,
16337,
16339,
16340,
16505,
16506,
16551,
16552,
16554,
16555,
16669,
16670,
16708,
16709,
16886,
16887,
16889,
17015,
17017,
17018,
17031,
17032,
17055,
17057,
17162,
17164,
17166,
17167,
17234,
17235,
17396,
17397,
17442,
17452,
17477,
17498,
17534,
17536,
17537,
17591,
17637,
17685,
17743,
17744,
17850,
17851,
17855,
17888,
17954,
17958,
17959,
18008,
18009,
18094,
18295,
18297,
18298,
18336,
18337,
18364,
18901,
18933,
18956,
18962,
18982,
18984,
18986,
18987,
19092,
19093,
19186,
19187,
19690,
19692,
19693,
19863,
19864,
19891,
19926,
19980,
19982,
19983,
20100,
20101,
20104,
20105,
20176,
20177,
33644,
33645,
34288,
34289,
34515,
34516,
34690,
34691,
34694,
34695,
34741,
34742,
34769,
34815,
34840,
34841,
34854,
34989,
35008,
35028,
35052,
35084,
35130,
35139,
35164,
35189,
35197,
35205,
35206,
35226,
35228,
35229,
35255,
35256,
35258,
35325,
35340,
35366,
35447,
35458,
35484,
35741,
35742,
35754,
35755,
35855,
35856
],
"line_end_idx": [
3,
4,
68,
69,
103,
132,
171,
172,
201,
202,
219,
245,
274,
309,
345,
376,
504,
527,
601,
619,
633,
649,
650,
669,
670,
744,
758,
759,
767,
768,
769,
795,
897,
898,
924,
945,
956,
978,
984,
987,
988,
1173,
1174,
1205,
1206,
1208,
1214,
1311,
1325,
1350,
1740,
1753,
1778,
1784,
1859,
1874,
1899,
1998,
2011,
2037,
2043,
2260,
2277,
2303,
2304,
2318,
2319,
2322,
2323,
2467,
2468,
3704,
3705,
3779,
3780,
3830,
3831,
3893,
3943,
4003,
4055,
4572,
4573,
4693,
4694,
4696,
4976,
4990,
5016,
5330,
5345,
5371,
5377,
5533,
5547,
5572,
5578,
5696,
5702,
5798,
5801,
5802,
6045,
6046,
6055,
6056,
6237,
6238,
6412,
6413,
6597,
6598,
6658,
6659,
6703,
6704,
6864,
6865,
6867,
6870,
6902,
7239,
7274,
7276,
7277,
7313,
7314,
7389,
7390,
7394,
7395,
7463,
7465,
7471,
7686,
7692,
7784,
7796,
7821,
7964,
7980,
8005,
8057,
8074,
8100,
8333,
8347,
8372,
8375,
8376,
8567,
8568,
8620,
8621,
8733,
8734,
8831,
8832,
8880,
8923,
8968,
8969,
9054,
9055,
9144,
9226,
9302,
9330,
9331,
9430,
9431,
9449,
9501,
9559,
9656,
9706,
9774,
9775,
9834,
9910,
9989,
9990,
10023,
10035,
10057,
10092,
10114,
10131,
10162,
10194,
10229,
10244,
10258,
10265,
10266,
10296,
10324,
10359,
10384,
10401,
10427,
10437,
10444,
10450,
10451,
10471,
10472,
10957,
10959,
10965,
11098,
11110,
11136,
11139,
11140,
11185,
11186,
11226,
11272,
11282,
11309,
11343,
11361,
11383,
11389,
11392,
11393,
11502,
11503,
11581,
11582,
11613,
11650,
11680,
11712,
11750,
11781,
11823,
11824,
12135,
12136,
12318,
12319,
12326,
12327,
12559,
12560,
12758,
12759,
12761,
12767,
12823,
12835,
12861,
12867,
13044,
13061,
13087,
13089,
13090,
13136,
13137,
13239,
13240,
13242,
13445,
13460,
13484,
13486,
13487,
13515,
13516,
13546,
14760,
14766,
14767,
14851,
14852,
14880,
14882,
14951,
14953,
14954,
15115,
15116,
15183,
15184,
15209,
15211,
15221,
15245,
15266,
15272,
15288,
15313,
15335,
15341,
15343,
15344,
15593,
15594,
15619,
15621,
15631,
15663,
15702,
15751,
15757,
15773,
15798,
15820,
15826,
15828,
15830,
15897,
16077,
16090,
16115,
16117,
16118,
16148,
16149,
16189,
16190,
16223,
16224,
16226,
16294,
16311,
16337,
16339,
16340,
16505,
16506,
16551,
16552,
16554,
16555,
16669,
16670,
16708,
16709,
16886,
16887,
16889,
17015,
17017,
17018,
17031,
17032,
17055,
17057,
17162,
17164,
17166,
17167,
17234,
17235,
17396,
17397,
17442,
17452,
17477,
17498,
17534,
17536,
17537,
17591,
17637,
17685,
17743,
17744,
17850,
17851,
17855,
17888,
17954,
17958,
17959,
18008,
18009,
18094,
18295,
18297,
18298,
18336,
18337,
18364,
18901,
18933,
18956,
18962,
18982,
18984,
18986,
18987,
19092,
19093,
19186,
19187,
19690,
19692,
19693,
19863,
19864,
19891,
19926,
19980,
19982,
19983,
20100,
20101,
20104,
20105,
20176,
20177,
33644,
33645,
34288,
34289,
34515,
34516,
34690,
34691,
34694,
34695,
34741,
34742,
34769,
34815,
34840,
34841,
34854,
34989,
35008,
35028,
35052,
35084,
35130,
35139,
35164,
35189,
35197,
35205,
35206,
35226,
35228,
35229,
35255,
35256,
35258,
35325,
35340,
35366,
35447,
35458,
35484,
35741,
35742,
35754,
35755,
35855,
35856,
35946
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 35946,
"ccnet_original_nlines": 463,
"rps_doc_curly_bracket": 0.015523280017077923,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1297602355480194,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.014507349580526352,
"rps_doc_frac_lines_end_with_ellipsis": 0.006465519778430462,
"rps_doc_frac_no_alph_words": 0.5172274708747864,
"rps_doc_frac_unique_words": 0.364876389503479,
"rps_doc_mean_word_length": 9.744671821594238,
"rps_doc_num_sentences": 528,
"rps_doc_symbol_to_word_ratio": 0.002518639899790287,
"rps_doc_unigram_entropy": 5.973453521728516,
"rps_doc_word_count": 2346,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.008573549799621105,
"rps_doc_frac_chars_dupe_6grams": 0.0025370700750499964,
"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.0043742600828409195,
"rps_doc_frac_chars_top_3gram": 0.001574730034917593,
"rps_doc_frac_chars_top_4gram": 0.0014435099437832832,
"rps_doc_books_importance": -4819.060546875,
"rps_doc_books_importance_length_correction": -4819.060546875,
"rps_doc_openwebtext_importance": -2503.403076171875,
"rps_doc_openwebtext_importance_length_correction": -2503.403076171875,
"rps_doc_wikipedia_importance": -1598.2530517578125,
"rps_doc_wikipedia_importance_length_correction": -1598.2530517578125
},
"fasttext": {
"dclm": 0.14211148023605347,
"english": 0.4322618544101715,
"fineweb_edu_approx": 1.5599007606506348,
"eai_general_math": 0.46462661027908325,
"eai_open_web_math": 0.1835695505142212,
"eai_web_code": 0.35197824239730835
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,605,423,532,569,999,000 |
v1.0
The linear, alphabetic sense of the keyboard causes very slow processing and an unmusical approach to navigating the keys. To be fluent, we need to know instantly and effortlessly where all the sounds live in the keyboard map. This document and video introduce you to the most musical and efficient way to map the keys fluently.
|
{
"url": "https://playpianofluently.com/introduction-to-keyboard-mapping/",
"source_domain": "playpianofluently.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "140726",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:IABTLHYIQY7UQ6H5PAHVT55JEIIPHQK3",
"WARC-Concurrent-To": "<urn:uuid:4a2d053d-8e55-4ba7-afc0-288d1a2ec564>",
"WARC-Date": "2024-05-19T15:32:30Z",
"WARC-IP-Address": "209.124.66.8",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LZQAWOMGVVQ2SNHFNISEXFFCIBVMTW5I",
"WARC-Record-ID": "<urn:uuid:62be511c-8f38-4068-a24c-77f8b2afa493>",
"WARC-Target-URI": "https://playpianofluently.com/introduction-to-keyboard-mapping/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6a3c3054-5df0-4103-b456-28da4ca0b46f>"
},
"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-241\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,
6,
335,
336
],
"line_end_idx": [
5,
6,
335,
336,
337
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 337,
"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.4375,
"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.109375,
"rps_doc_frac_unique_words": 0.719298243522644,
"rps_doc_mean_word_length": 4.754385948181152,
"rps_doc_num_sentences": 4,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.492654323577881,
"rps_doc_word_count": 57,
"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.08118081092834473,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -34.8925666809082,
"rps_doc_books_importance_length_correction": -34.8925666809082,
"rps_doc_openwebtext_importance": -19.814178466796875,
"rps_doc_openwebtext_importance_length_correction": -19.814178466796875,
"rps_doc_wikipedia_importance": -17.11450958251953,
"rps_doc_wikipedia_importance_length_correction": -17.11450958251953
},
"fasttext": {
"dclm": 0.06742352247238159,
"english": 0.8950046300888062,
"fineweb_edu_approx": 2.060253620147705,
"eai_general_math": 0.6189783811569214,
"eai_open_web_math": 0.11446917057037354,
"eai_web_code": 0.02102453075349331
}
}
|
{
"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": "781.2",
"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": "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": "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
|
-481,456,158,517,161,200 |
Dismiss
Announcing Stack Overflow Documentation
We started with Q&A. Technical documentation is next, and we need your help.
Whether you're a beginner or an experienced developer, you can contribute.
Sign up and start helping → Learn more about Documentation →
Can someone tell what a decimal variable cannot do but at the same time double can do?
Also what is that double cant do but decimal can?
I was having trouble with finding power of (sqroot 5) to more than 2000000
e.g. (3 + root(5) )raise to 300000 ...here what can be used while using binomial expansion ?
Can I use double / decimal ? What's the main difference?
Note : I want to preserve last 3 decimal place before decimal point in the answer to the 100% accuracy.
share|improve this question
2
Ever read the spec? – Andreas Niedermair Mar 18 '12 at 7:55
2
Neither double nor decimal are in any way suitable for the kind of heavy-duty math calculation you describe. Double is good for representing the height of a building; decimal is good for representing the cost of a building; neither have a precision or range necessary for the kind of algebraic manipulation you want. Consider using Waterloo Maple or Mathematica or some other special-purpose math system. – Eric Lippert Mar 18 '12 at 15:51
@Eric lippert , thanks much. Actually i was solving google code jam puzzle (link ) and i went into trouble of calculating this heavy duty math ops. Is there is any langguage which can directly (without any nasty logic of truncating decimal places ..etc..) calculate this heavy math ? Is c# not suitable for this operations ? – Dhananjay Mar 19 '12 at 3:54
In brief:
• Decimal is a decimal floating point type, so it can represent exact decimal values, e.g. 0.1. It has a fairly high precision, but a relatively limited range. It's implemented in software, so is relatively slow.
• Single/Double are binary floating point types, so they can only represent exactly numbers which can be represented exactly in binary - which doesn't include the decimal value 0.1, for example. They have relatively low precision, but a large range. It's usually implemented in hardware, so is very fast.
Additionally float/double have representations for positive and negative infinity, and "not a number" - decimal doesn't have any of this.
See my articles on binary floating point and decimal floating point for more information.
share|improve this answer
And Decimal is more precise, because it is larger - it can hold more info (96 bits of data vs 53 for double). It's also a lot slower. – Mr Lister Mar 18 '12 at 8:08
1
That's why I said Decimal has a fairly high precision, and Float/Double have a relatively low precision. Will edit around speed though. – Jon Skeet Mar 18 '12 at 8:09
@Jon skeet , thanks for quick and meaninful reply. Your statement tells exactly the difference between float and decimal but it will be great if you can elaborate with an example the situation where to use decimal (other than o.1 example). In the case of calculating the value of (3+root 5) raise to 300000 and where i want to have last 3 decimal numbers before decimal point (e.g. 23434888.42343 here i want 888 to be 100% accurate) – Dhananjay Mar 18 '12 at 8:36
@dnkulkarni: Generally, you use double for scientific calculations for natural values (e.g. height, speed etc) and decimal for business calculations for artificial values - primarily money - where you really can have exactly $0.01, for example. There are various other Stack Overflow questions around this too. – Jon Skeet Mar 18 '12 at 8:51
1
@MrLister: Well, the number of bits used for the mantissa. You could have a type which is the same size as double, with a smaller range but more precision, by adjusting how many bits are used for what. But yes, I agree that the "decimal is exact, double is approximate" posters usually don't know what they're talking about :) – Jon Skeet Mar 18 '12 at 9:28
decimal.MaxValue = 79,228,162,514,264,337,593,543,950,335
double.MaxValue = 1.7976931348623157E+308
(5.24) ^ 300000 = ???
I don't think you can easily raise 5 to the power of 300000 without using a math library that is more cleaver than double....
share|improve this answer
decimal is base 10 which means he can represend 0.1 as 0.1
double is a base 2 - binary - which means he cant. ( its infinite numbers of 0,1)
double can store much bigger numbers than decimal
decimal is more accurate.,
share|improve this answer
1
Why did you say "infinite"? You shouldn't have. – Mr Lister Mar 18 '12 at 8:03
@MrLister try to siaply 0.1 with binary. the example was about the 0.1 – Royi Namir Mar 18 '12 at 8:33
Yes, but "infinite" is wrong. You can express any double value with a finite number of decimals. Even if the number of decimals may be in the hundreds. – Mr Lister Mar 18 '12 at 9:20
@MrLister Royi was saying that double cannot represent 0.1 exactly, because the binary representation of one tenth is an infinitely-repeating sequence. Every binary fraction can be finitely represented as a decimal, but not vice versa. – phoog Mar 19 '12 at 15:24
@phoog - Until he will try - he wont understand this is how 0.1 is represented in float/double : ( base 2 ) :0.00011001100110011001100110011001..........mathsisfun.com/binary-decimal-hexadecimal-converter.html – Royi Namir Mar 19 '12 at 15:26
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/9756835/what-is-that-decimal-cant-do-but-double-can-and-vice-versa",
"source_domain": "stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2016-30",
"warc_metadata": {
"Content-Length": "101775",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MBMJ2VL6YJW4GPEH7T6CBXIUD3FUWMT7",
"WARC-Concurrent-To": "<urn:uuid:ce8a21ad-0f90-4dd4-ba53-b397a166d62d>",
"WARC-Date": "2016-07-27T21:29:16Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:HI5CFOEGMSO2IFWWVENFHWG3RHXTKPDW",
"WARC-Record-ID": "<urn:uuid:0fa54a86-50eb-4597-aa88-42a41b4bf8cd>",
"WARC-Target-URI": "http://stackoverflow.com/questions/9756835/what-is-that-decimal-cant-do-but-double-can-and-vice-versa",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:fb91b56e-0565-4fec-8aea-5c49cb97cc4c>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-27-174.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-30\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for July 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
8,
48,
49,
126,
127,
202,
203,
264,
265,
352,
353,
403,
404,
479,
480,
573,
574,
631,
632,
736,
737,
765,
769,
829,
833,
1273,
1278,
1634,
1635,
1645,
1646,
1861,
2168,
2169,
2307,
2308,
2398,
2399,
2425,
2430,
2595,
2599,
2766,
2771,
3236,
3241,
3583,
3587,
3945,
4003,
4004,
4046,
4047,
4069,
4070,
4196,
4197,
4223,
4224,
4283,
4284,
4366,
4367,
4417,
4418,
4445,
4446,
4472,
4476,
4555,
4560,
4663,
4668,
4851,
4856,
5120,
5125,
5368,
5369,
5381,
5382,
5384,
5392,
5393,
5471,
5472
],
"line_end_idx": [
8,
48,
49,
126,
127,
202,
203,
264,
265,
352,
353,
403,
404,
479,
480,
573,
574,
631,
632,
736,
737,
765,
769,
829,
833,
1273,
1278,
1634,
1635,
1645,
1646,
1861,
2168,
2169,
2307,
2308,
2398,
2399,
2425,
2430,
2595,
2599,
2766,
2771,
3236,
3241,
3583,
3587,
3945,
4003,
4004,
4046,
4047,
4069,
4070,
4196,
4197,
4223,
4224,
4283,
4284,
4366,
4367,
4417,
4418,
4445,
4446,
4472,
4476,
4555,
4560,
4663,
4668,
4851,
4856,
5120,
5125,
5368,
5369,
5381,
5382,
5384,
5392,
5393,
5471,
5472,
5562
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5562,
"ccnet_original_nlines": 86,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 4,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3541835844516754,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007311129942536354,
"rps_doc_frac_lines_end_with_ellipsis": 0.011494250036776066,
"rps_doc_frac_no_alph_words": 0.3030056953430176,
"rps_doc_frac_unique_words": 0.39715537428855896,
"rps_doc_mean_word_length": 4.675054550170898,
"rps_doc_num_sentences": 80,
"rps_doc_symbol_to_word_ratio": 0.004874090198427439,
"rps_doc_unigram_entropy": 5.373642921447754,
"rps_doc_word_count": 914,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.047273579984903336,
"rps_doc_frac_chars_dupe_6grams": 0.025274980813264847,
"rps_doc_frac_chars_dupe_7grams": 0.025274980813264847,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.012169440276920795,
"rps_doc_frac_chars_top_3gram": 0.01638193055987358,
"rps_doc_frac_chars_top_4gram": 0.021062489598989487,
"rps_doc_books_importance": -439.9526672363281,
"rps_doc_books_importance_length_correction": -439.9526672363281,
"rps_doc_openwebtext_importance": -314.96636962890625,
"rps_doc_openwebtext_importance_length_correction": -314.96636962890625,
"rps_doc_wikipedia_importance": -199.44119262695312,
"rps_doc_wikipedia_importance_length_correction": -199.44119262695312
},
"fasttext": {
"dclm": 0.8672587275505066,
"english": 0.8946879506111145,
"fineweb_edu_approx": 1.9544554948806763,
"eai_general_math": 0.5456615686416626,
"eai_open_web_math": 0.5054352879524231,
"eai_web_code": 0.0036148400977253914
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "512",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,495,984,941,183,367,000 |
MyGrad’s Tensor
Tensor is the most critical piece of MyGrad. It is a numpy-array-like object capable of serving as a node in a computational graph that supports back-propagation of derivatives via the chain rule.
You can effectively do a drop-in replacement of a numpy array with a Tensor for all basic mathematical operations. This includes basic and advanced indexing, broadcasting, sums over axes, etc; it will simply just work.
>>> import mygrad as mg # note that we replace numpy with mygrad here
>>> x = mg.arange(9).reshape(3, 3)
>>> x
Tensor([[0, 1, 2],
[3, 4, 5],
[6, 7, 8]])
>>> y = x[x == 4] ** 2
>>> y
Tensor([16], dtype=int32)
Thus MyGrad users can spend their time mastering numpy and their skills will transfer seamlessly when using this autograd library.
Creating a Tensor
Tensor can be passed any “array-like” object of numerical data. This includes numbers, sequences (e.g. lists), nested sequences, numpy-ndarrays, and other mygrad-tensors. mygrad also provides familiar numpy-style tensor-creation functions (e.g. arange(), linspace(), etc.)
>>> import mygrad as mg
>>> mg.tensor(2.3) # creating a 0-dimensional tensor
Tensor(2.3)
>>> mg.tensor(np.array([1.2, 3.0])) # casting a numpy-array to a tensor
Tensor([1.2, 3.0])
>>> mg.tensor([[1, 2], [3, 4]]) # creating a 2-dimensional tensor from lists
Tensor([[1, 2],
[3, 4]])
>>> mg.arange(4) # using numpy-style tensor creation functions
Tensor([0, 1, 2, 3])
Integer-valued tensors are treated as constants
>>> mg.astensor(1, dtype=np.int8).constant
True
By default, float-valued tensors are not treated as constants
>>> mg.astensor(1, dtype=np.float32).constant
False
Forward and Back-Propagation
Let’s construct a computational graph consisting of two zero-dimensional tensors, x and y, which are used to compute an output tensor, . This is a “forward pass imperative” style for creating a computational graph - the graph is constructed as we carry out the forward-pass computation.
>>> x = Tensor(3.0)
>>> y = Tensor(2.0)
>>> = 2 * x + y ** 2
Invoking ℒ.backward() signals the computational graph to compute the total-derivative of with respect to each one of its dependent variables. I.e. x.grad will store dℒ/dx and y.grad will store dℒ/dy. Thus we have back-propagated a gradient from through our graph.
Each tensor of derivatives is computed elementwise. That is, if x = Tensor(x0, x1, x2), then dℒ/dx represents [dℒ/d(x0), dℒ/d(x1), dℒ/d(x2)]
>>> .backward() # computes dℒ/dx and dℒ/dy
>>> x.grad # dℒ/dx
array(6.0)
>>> y.grad # dℒ/dy
array(4.0)
>>> .grad
array(1.0) # dℒ/dℒ
Once the gradients are computed, the computational graph containing x, y, and is cleared automatically. Additionally, involving any of these tensors in a new computational graph will automatically null their gradients.
>>> 2 * x
>>> x.grad is None
True
Or, you can use the null_grad() method to manually clear a tensor’s gradient
>>> y.null_grad()
Tensor(2.)
>>> y.grad is None
True
Accessing the Underlying NumPy Array
Tensor is a thin wrapper on numpy.ndarray. A tensor’s underlying numpy-array can be accessed via .data. This returns a direct reference to the numpy array.
>>> x = mg.tensor([1, 2])
>>> x.data
array([1, 2])
>>> import numpy as np
>>> np.asarray(x)
array([1, 2])
Producing a “View” of a Tensor
MyGrad’s tensors exhibit the same view semantics and memory-sharing relationships as NumPy arrays. I.e. any (non-scalar) tensor produced via basic indexing will share memory with its parent.
>>> x = mg.tensor([1., 2., 3., 4.])
>>> y = x[:2] # the view: Tensor([1., 2.])
>>> y.base is x
True
>>> np.shares_memory(x, y)
True
Mutating shared data will propagate through views:
>>> y *= -1
>>> x
Tensor([-1., -2., 3., 4.])
>>> y
Tensor([-1., -2.])
And this view relationship will also manifest between the tensors’ gradients
>>> (x ** 2).backward()
>>> x.grad
array([-2., -4., 6., 8.])
>>> y.grad
array([-2., -4.])
Documentation for mygrad.Tensor
Contents:
Tensor.astype(dtype[, casting, copy, constant])
Copy of the tensor with the specified dtype.
Tensor.backward([grad])
Trigger backpropagation and compute the derivatives of this tensor.
Tensor.base
A reference to the base tensor that the present tensor is a view of.
Tensor.clear_graph()
Removes the current tensor – and tensors above it – from their shared computational graph.
Tensor.constant
If True, this tensor is a constant; it will not propagate any gradient.
Tensor.copy(*[, constant])
Produces a copy of self with copy.creator=None.
Tensor.creator
The Operation instance that produced self.
Tensor.dtype
Data-type of the tensor’s elements.
Tensor.grad
Returns the derivative of with respect to this tensor.
Tensor.item()
Copy an element of a tensor to a standard Python scalar and return it.
Tensor.ndim
Number of tensor dimensions.
Tensor.null_grad(*[, _clear_view_info])
Sets this tensor’s gradient to be None.
Tensor.null_gradients([clear_graph])
**Deprecated: Tensors will automatically have their computational graphs cleared during backprop.
Tensor.shape
Tuple of tensor dimension-sizes.
Tensor.size
Number of elements in the tensor.
Tensor.T
Same as self.transpose(), except that self is returned if self.ndim < 2 and a view of the underlying data is utilized whenever possible.
|
{
"url": "https://mygrad.readthedocs.io/en/latest/tensor.html",
"source_domain": "mygrad.readthedocs.io",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "37631",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QFCZU66HDOICPHV2KI4IBZIE4SWAMY7G",
"WARC-Concurrent-To": "<urn:uuid:d23d2239-d85c-413f-8b8d-c167deeb54e0>",
"WARC-Date": "2022-06-28T23:42:46Z",
"WARC-IP-Address": "104.17.32.82",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CYY6RVHT6EL5GE3OA3CNYYJXGHJO52PQ",
"WARC-Record-ID": "<urn:uuid:d30728c7-aa52-4487-855e-e342f6c6fdc9>",
"WARC-Target-URI": "https://mygrad.readthedocs.io/en/latest/tensor.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:7cb4b901-3c12-4477-82c9-9d5e0fe93597>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-246\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
16,
17,
214,
215,
434,
435,
506,
541,
547,
566,
585,
605,
628,
634,
660,
661,
792,
793,
811,
812,
1085,
1086,
1110,
1164,
1176,
1249,
1268,
1346,
1362,
1378,
1444,
1465,
1466,
1514,
1515,
1558,
1563,
1564,
1626,
1627,
1673,
1679,
1680,
1709,
1710,
1997,
1998,
2018,
2038,
2060,
2061,
2325,
2326,
2467,
2468,
2512,
2532,
2543,
2563,
2574,
2584,
2604,
2605,
2824,
2825,
2835,
2854,
2859,
2860,
2937,
2938,
2956,
2967,
2986,
2991,
2992,
3029,
3030,
3186,
3187,
3213,
3224,
3238,
3261,
3279,
3293,
3294,
3325,
3326,
3517,
3518,
3554,
3598,
3614,
3619,
3646,
3651,
3652,
3703,
3704,
3716,
3722,
3751,
3757,
3776,
3777,
3854,
3855,
3879,
3890,
3918,
3929,
3947,
3948,
3980,
3981,
3991,
3992,
4040,
4041,
4086,
4087,
4111,
4112,
4180,
4181,
4193,
4194,
4263,
4264,
4285,
4286,
4377,
4378,
4394,
4395,
4467,
4468,
4495,
4496,
4544,
4545,
4560,
4561,
4604,
4605,
4618,
4619,
4655,
4656,
4668,
4669,
4724,
4725,
4739,
4740,
4811,
4812,
4824,
4825,
4854,
4855,
4895,
4896,
4936,
4937,
4974,
4975,
5073,
5074,
5087,
5088,
5121,
5122,
5134,
5135,
5169,
5170,
5179,
5180
],
"line_end_idx": [
16,
17,
214,
215,
434,
435,
506,
541,
547,
566,
585,
605,
628,
634,
660,
661,
792,
793,
811,
812,
1085,
1086,
1110,
1164,
1176,
1249,
1268,
1346,
1362,
1378,
1444,
1465,
1466,
1514,
1515,
1558,
1563,
1564,
1626,
1627,
1673,
1679,
1680,
1709,
1710,
1997,
1998,
2018,
2038,
2060,
2061,
2325,
2326,
2467,
2468,
2512,
2532,
2543,
2563,
2574,
2584,
2604,
2605,
2824,
2825,
2835,
2854,
2859,
2860,
2937,
2938,
2956,
2967,
2986,
2991,
2992,
3029,
3030,
3186,
3187,
3213,
3224,
3238,
3261,
3279,
3293,
3294,
3325,
3326,
3517,
3518,
3554,
3598,
3614,
3619,
3646,
3651,
3652,
3703,
3704,
3716,
3722,
3751,
3757,
3776,
3777,
3854,
3855,
3879,
3890,
3918,
3929,
3947,
3948,
3980,
3981,
3991,
3992,
4040,
4041,
4086,
4087,
4111,
4112,
4180,
4181,
4193,
4194,
4263,
4264,
4285,
4286,
4377,
4378,
4394,
4395,
4467,
4468,
4495,
4496,
4544,
4545,
4560,
4561,
4604,
4605,
4618,
4619,
4655,
4656,
4668,
4669,
4724,
4725,
4739,
4740,
4811,
4812,
4824,
4825,
4854,
4855,
4895,
4896,
4936,
4937,
4974,
4975,
5073,
5074,
5087,
5088,
5121,
5122,
5134,
5135,
5169,
5170,
5179,
5180,
5316
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5316,
"ccnet_original_nlines": 180,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.23630672693252563,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0046948399394750595,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.38732394576072693,
"rps_doc_frac_unique_words": 0.4484679698944092,
"rps_doc_mean_word_length": 5.349582195281982,
"rps_doc_num_sentences": 129,
"rps_doc_symbol_to_word_ratio": 0.00782473012804985,
"rps_doc_unigram_entropy": 5.2333173751831055,
"rps_doc_word_count": 718,
"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.032803960144519806,
"rps_doc_frac_chars_top_3gram": 0.0039052299689501524,
"rps_doc_frac_chars_top_4gram": 0.008331160061061382,
"rps_doc_books_importance": -608.3521728515625,
"rps_doc_books_importance_length_correction": -608.3521728515625,
"rps_doc_openwebtext_importance": -350.2954406738281,
"rps_doc_openwebtext_importance_length_correction": -350.2954406738281,
"rps_doc_wikipedia_importance": -322.738525390625,
"rps_doc_wikipedia_importance_length_correction": -322.738525390625
},
"fasttext": {
"dclm": 0.17337965965270996,
"english": 0.7406427264213562,
"fineweb_edu_approx": 1.7735012769699097,
"eai_general_math": 0.9921003580093384,
"eai_open_web_math": 0.47282445430755615,
"eai_web_code": 0.9780537486076355
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "512",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "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": "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,789,298,903,963,711,000 |
Filippo
45 Reputation
3 Badges
4 years, 145 days
MaplePrimes Activity
These are replies submitted by Filippo
@Kitonum Thanks
@tomleslie
As you said, it failed, however thanks for the suggetsion.
Actually, reading the name of the program is Maple 2015, but they always referred to it as Maple15 for reasons unknown to me. I was able to open it after discoverign the existence of Maple Player.
@Joe Riel My bad, it is Maple 2015, however they always refer to it as Maple 15.
Thanks for the answer, but how do I open the file with SQLite (if you don't have time to explain a link to a page that shows how to do it would be fine)? I searched on the internet but only found ways to open .db files
Edit: I found a way to open it after dicovering the existence of Maple Player, thanks for the support anyway.
Page 1 of 1
|
{
"url": "https://www.mapleprimes.com/users/Filippo/replies",
"source_domain": "www.mapleprimes.com",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "73342",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6PXNP3K5W3MS53EGGUDL32BUROEKYYBC",
"WARC-Concurrent-To": "<urn:uuid:f8086cc1-f1ff-40a5-92a8-074de751cad4>",
"WARC-Date": "2024-09-17T11:37:40Z",
"WARC-IP-Address": "199.71.183.11",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NFUZXY5GMSTZ5HKRJP4GWCQLQILLRIJP",
"WARC-Record-ID": "<urn:uuid:e9a19c86-988a-4bd5-a343-733bde261d62>",
"WARC-Target-URI": "https://www.mapleprimes.com/users/Filippo/replies",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b5c16e1c-785f-4bba-8588-903bc28f3ebb>"
},
"warc_info": "isPartOf: CC-MAIN-2024-38\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-209\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,
8,
9,
23,
24,
33,
34,
52,
53,
74,
75,
76,
115,
116,
132,
133,
145,
146,
205,
206,
404,
405,
486,
487,
706,
707,
709,
710,
820,
821,
833
],
"line_end_idx": [
8,
9,
23,
24,
33,
34,
52,
53,
74,
75,
76,
115,
116,
132,
133,
145,
146,
205,
206,
404,
405,
486,
487,
706,
707,
709,
710,
820,
821,
833,
834
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 834,
"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.4325842559337616,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02247191034257412,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17977528274059296,
"rps_doc_frac_unique_words": 0.6000000238418579,
"rps_doc_mean_word_length": 4.116128921508789,
"rps_doc_num_sentences": 8,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.271641731262207,
"rps_doc_word_count": 155,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07836990803480148,
"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.04231974855065346,
"rps_doc_frac_chars_top_3gram": 0.05642633140087128,
"rps_doc_frac_chars_top_4gram": 0.0407523512840271,
"rps_doc_books_importance": -80.08204650878906,
"rps_doc_books_importance_length_correction": -80.08204650878906,
"rps_doc_openwebtext_importance": -42.04670333862305,
"rps_doc_openwebtext_importance_length_correction": -41.32039260864258,
"rps_doc_wikipedia_importance": -26.19685173034668,
"rps_doc_wikipedia_importance_length_correction": -26.19685173034668
},
"fasttext": {
"dclm": 0.05171686038374901,
"english": 0.9561829566955566,
"fineweb_edu_approx": 1.4938008785247803,
"eai_general_math": 0.9304487705230713,
"eai_open_web_math": 0.48384684324264526,
"eai_web_code": 0.006506029982119799
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
851,443,342,112,621,200 |
Commit e2954383 authored by Tomek Mrugalski's avatar Tomek Mrugalski 🛰
Browse files
[3171] AllocEngine work: increasePrefix() added, prefix_len passed around
parent 7759a99d
......@@ -58,7 +58,7 @@ AllocEngine::IterativeAllocator::IterativeAllocator(Lease::Type lease_type)
}
isc::asiolink::IOAddress
AllocEngine::IterativeAllocator::increaseAddress(const isc::asiolink::IOAddress& addr) {
AllocEngine::IterativeAllocator::increaseAddress(const isc::asiolink::IOAddress& addr) const {
// Get a buffer holding an address.
const std::vector<uint8_t>& vec = addr.toBytes();
// Get the address length.
......@@ -85,6 +85,52 @@ AllocEngine::IterativeAllocator::increaseAddress(const isc::asiolink::IOAddress&
return (IOAddress::fromBytes(addr.getFamily(), packed));
}
isc::asiolink::IOAddress
AllocEngine::IterativeAllocator::increasePrefix(const isc::asiolink::IOAddress& prefix,
uint8_t prefix_len) const {
if (!prefix.isV6()) {
isc_throw(BadValue, "Prefix operations are for IPv6 only");
}
// Get a buffer holding an address.
const std::vector<uint8_t>& vec = prefix.toBytes();
if (prefix_len < 1 || prefix_len > 128) {
isc_throw(BadValue, "Cannot increase prefix: invalid prefix length: "
<< prefix_len);
}
// Explanation what happens here: http://www.youtube.com/watch?v=NFQCYpIHLNQ
uint8_t n_bytes = (prefix_len - 1)/8;
uint8_t n_bits = 8 - (prefix_len - n_bytes*8);
uint8_t mask = 1 << n_bits;
uint8_t packed[V6ADDRESS_LEN];
// Copy the address. It must be V6, but we already checked that.
std::memcpy(packed, &vec[0], V6ADDRESS_LEN);
// Increase last byte that is in prefix
if (packed[n_bytes] + uint16_t(mask) < 256u) {
packed[n_bytes] += mask;
return (IOAddress::fromBytes(AF_INET6, packed));
}
// Overflow (done on uint8_t, but the sum is greater than 255)
packed[n_bytes] += mask;
// Start increasing the least significant byte
for (int i = n_bytes - 1; i >= 0; --i) {
++packed[i];
// If we haven't overflowed (0xff->0x0) the next byte, then we are done
if (packed[i] != 0) {
break;
}
}
return (IOAddress::fromBytes(AF_INET6, packed));
}
isc::asiolink::IOAddress
AllocEngine::IterativeAllocator::pickAddress(const SubnetPtr& subnet,
......@@ -261,8 +307,10 @@ AllocEngine::allocateAddress6(const Subnet6Ptr& subnet,
}
// check if the hint is in pool and is available
if (subnet->inPool(hint)) {
// This is equivalent of subnet->inPool(hint), but returns the pool
Pool6Ptr pool = boost::dynamic_pointer_cast<Pool6>(subnet->getPool(type, hint, false));
if (pool) {
/// @todo: We support only one hint for now
Lease6Ptr lease = LeaseMgrFactory::instance().getLease6(type, hint);
if (!lease) {
......@@ -270,10 +318,9 @@ AllocEngine::allocateAddress6(const Subnet6Ptr& subnet,
/// implemented
// the hint is valid and not currently used, let's create a lease for it
/// @todo: We support only one lease per ia for now
lease = createLease6(subnet, duid, iaid, hint, type, fwd_dns_update,
rev_dns_update, hostname, callout_handle,
fake_allocation);
lease = createLease6(subnet, duid, iaid, hint, pool->getLength(),
type, fwd_dns_update, rev_dns_update,
hostname, callout_handle, fake_allocation);
// It can happen that the lease allocation failed (we could have lost
// the race condition. That means that the hint is lo longer usable and
......@@ -288,6 +335,7 @@ AllocEngine::allocateAddress6(const Subnet6Ptr& subnet,
if (lease->expired()) {
/// We found a lease and it is expired, so we can reuse it
lease = reuseExpiredLease(lease, subnet, duid, iaid,
pool->getLength(),
fwd_dns_update, rev_dns_update,
hostname, callout_handle,
fake_allocation);
......@@ -324,13 +372,24 @@ AllocEngine::allocateAddress6(const Subnet6Ptr& subnet,
/// @todo: check if the address is reserved once we have host support
/// implemented
// The first step is to find out prefix length. It is 128 for
// non-PD leases.
uint8_t prefix_len = 128;
if (type == Lease::TYPE_PD) {
Pool6Ptr pool = boost::dynamic_pointer_cast<Pool6>(
subnet->getPool(type, candidate, false));
prefix_len = pool->getLength();
}
Lease6Ptr existing = LeaseMgrFactory::instance().getLease6(type,
candidate);
if (!existing) {
// there's no existing lease for selected candidate, so it is
// free. Let's allocate it.
Lease6Ptr lease = createLease6(subnet, duid, iaid, candidate,
type, fwd_dns_update,
prefix_len, type, fwd_dns_update,
rev_dns_update, hostname,
callout_handle, fake_allocation);
if (lease) {
......@@ -345,9 +404,9 @@ AllocEngine::allocateAddress6(const Subnet6Ptr& subnet,
} else {
if (existing->expired()) {
existing = reuseExpiredLease(existing, subnet, duid, iaid,
fwd_dns_update, rev_dns_update,
hostname, callout_handle,
fake_allocation);
prefix_len, fwd_dns_update,
rev_dns_update, hostname,
callout_handle, fake_allocation);
Lease6Collection collection;
collection.push_back(existing);
return (collection);
......@@ -621,6 +680,7 @@ Lease6Ptr AllocEngine::reuseExpiredLease(Lease6Ptr& expired,
const Subnet6Ptr& subnet,
const DuidPtr& duid,
uint32_t iaid,
uint8_t prefix_len,
const bool fwd_dns_update,
const bool rev_dns_update,
const std::string& hostname,
......@@ -631,6 +691,10 @@ Lease6Ptr AllocEngine::reuseExpiredLease(Lease6Ptr& expired,
isc_throw(BadValue, "Attempt to recycle lease that is still valid");
}
if (expired->type_ != Lease::TYPE_PD) {
prefix_len = 128; // non-PD lease types must be always /128
}
// address, lease type and prefixlen (0) stay the same
expired->iaid_ = iaid;
expired->duid_ = duid;
......@@ -644,6 +708,7 @@ Lease6Ptr AllocEngine::reuseExpiredLease(Lease6Ptr& expired,
expired->hostname_ = hostname;
expired->fqdn_fwd_ = fwd_dns_update;
expired->fqdn_rev_ = rev_dns_update;
expired->prefixlen_ = prefix_len;
/// @todo: log here that the lease was reused (there's ticket #2524 for
/// logging in libdhcpsrv)
......@@ -779,6 +844,7 @@ Lease6Ptr AllocEngine::createLease6(const Subnet6Ptr& subnet,
const DuidPtr& duid,
uint32_t iaid,
const IOAddress& addr,
uint8_t prefix_len,
Lease::Type type,
const bool fwd_dns_update,
const bool rev_dns_update,
......@@ -788,7 +854,8 @@ Lease6Ptr AllocEngine::createLease6(const Subnet6Ptr& subnet,
Lease6Ptr lease(new Lease6(type, addr, duid, iaid,
subnet->getPreferred(), subnet->getValid(),
subnet->getT1(), subnet->getT2(), subnet->getID()));
subnet->getT1(), subnet->getT2(), subnet->getID(),
prefix_len));
lease->fqdn_fwd_ = fwd_dns_update;
lease->fqdn_rev_ = rev_dns_update;
......
......@@ -124,13 +124,30 @@ protected:
pickAddress(const SubnetPtr& subnet,
const DuidPtr& duid,
const isc::asiolink::IOAddress& hint);
private:
protected:
/// @brief returns an address by one
/// @brief returns an address increased by one
///
/// This method works for both IPv4 and IPv6 addresses.
///
/// @param addr address to be increased
/// @return address increased by one
isc::asiolink::IOAddress increaseAddress(const isc::asiolink::IOAddress& addr);
isc::asiolink::IOAddress
increaseAddress(const isc::asiolink::IOAddress& addr) const;
/// @brief returns the next prefix
///
/// This method works for IPv6 addresses only. It increase
/// specified prefix by a given prefix_len. For example, 2001:db8::
/// increased by prefix length /32 will become 2001:db9::. This method
/// is used to iterate over IPv6 prefix pools
///
/// @param prefix prefix to be increased
/// @param prefix_len length of the prefix to be increased
/// @return result prefix
isc::asiolink::IOAddress
increasePrefix(const isc::asiolink::IOAddress& prefix,
uint8_t prefix_len) const;
};
/// @brief Address/prefix allocator that gets an address based on a hash
......@@ -381,6 +398,7 @@ private:
/// @param iaid IAID from the IA_NA container the client sent to us
/// @param addr an address that was selected and is confirmed to be
/// available
/// @param prefix_len lenght of the prefix (for PD only)
/// @param type lease type (IA, TA or PD)
/// @param fwd_dns_update A boolean value which indicates that server takes
/// responsibility for the forward DNS Update for this lease
......@@ -398,8 +416,8 @@ private:
/// became unavailable)
Lease6Ptr createLease6(const Subnet6Ptr& subnet, const DuidPtr& duid,
uint32_t iaid, const isc::asiolink::IOAddress& addr,
Lease::Type type, const bool fwd_dns_update,
const bool rev_dns_update,
uint8_t prefix_len, Lease::Type type,
const bool fwd_dns_update, const bool rev_dns_update,
const std::string& hostname,
const isc::hooks::CalloutHandlePtr& callout_handle,
bool fake_allocation = false);
......@@ -445,6 +463,7 @@ private:
/// @param subnet subnet the lease is allocated from
/// @param duid client's DUID
/// @param iaid IAID from the IA_NA container the client sent to us
/// @param prefix_len prefix length (for PD leases)
/// @param fwd_dns_update A boolean value which indicates that server takes
/// responsibility for the forward DNS Update for this lease
/// (if true).
......@@ -460,7 +479,7 @@ private:
/// @throw BadValue if trying to recycle lease that is still valid
Lease6Ptr reuseExpiredLease(Lease6Ptr& expired, const Subnet6Ptr& subnet,
const DuidPtr& duid, uint32_t iaid,
const bool fwd_dns_update,
uint8_t prefix_len, const bool fwd_dns_update,
const bool rev_dns_update,
const std::string& hostname,
const isc::hooks::CalloutHandlePtr& callout_handle,
......
......@@ -289,7 +289,7 @@ struct Lease6 : public Lease {
/// @param prefixlen An address prefix length.
Lease6(Type type, const isc::asiolink::IOAddress& addr, DuidPtr duid,
uint32_t iaid, uint32_t preferred, uint32_t valid, uint32_t t1,
uint32_t t2, SubnetID subnet_id, uint8_t prefixlen = 0);
uint32_t t2, SubnetID subnet_id, uint8_t prefixlen = 128);
/// @brief Constructor, including FQDN data.
///
......
......@@ -168,7 +168,8 @@ const PoolCollection& Subnet::getPools(Lease::Type type) const {
}
}
PoolPtr Subnet::getPool(Lease::Type type, isc::asiolink::IOAddress hint) {
PoolPtr Subnet::getPool(Lease::Type type, isc::asiolink::IOAddress hint,
bool anypool /* true */) {
// check if the type is valid (and throw if it isn't)
checkType(type);
......@@ -195,7 +196,7 @@ PoolPtr Subnet::getPool(Lease::Type type, isc::asiolink::IOAddress hint) {
pool != pools->end(); ++pool) {
// if we won't find anything better, then let's just use the first pool
if (!candidate) {
if (anypool && !candidate) {
candidate = *pool;
}
......
......@@ -277,10 +277,17 @@ public:
/// If there is no pool that the address belongs to (hint is invalid), other
/// pool of specified type will be returned.
///
/// With anypool set to true, this is means give me a pool, preferably
/// the one that addr belongs to. With anypool set to false, it means
/// give me a pool that addr belongs to (or NULL if here is no such pool)
///
/// @param type pool type that the pool is looked for
/// @param addr address that the returned pool should cover (optional)
/// @param anypool other pool may be returned as well, not only the one
/// that addr belongs to
/// @return found pool (or NULL)
PoolPtr getPool(Lease::Type type, isc::asiolink::IOAddress addr);
PoolPtr getPool(Lease::Type type, isc::asiolink::IOAddress addr,
bool anypool = true);
/// @brief Returns a pool without any address specified
///
......
......@@ -65,6 +65,16 @@ public:
using AllocEngine::Allocator;
using AllocEngine::IterativeAllocator;
using AllocEngine::getAllocator;
class NakedIterativeAllocator: public AllocEngine::IterativeAllocator {
public:
NakedIterativeAllocator(Lease::Type type)
:IterativeAllocator(type) {
}
using AllocEngine::IterativeAllocator::increaseAddress;
using AllocEngine::IterativeAllocator::increasePrefix;
};
};
/// @brief Used in Allocation Engine tests for IPv6
......@@ -125,12 +135,30 @@ public:
EXPECT_EQ(subnet_->getPreferred(), lease->preferred_lft_);
EXPECT_EQ(subnet_->getT1(), lease->t1_);
EXPECT_EQ(subnet_->getT2(), lease->t2_);
EXPECT_EQ(0, lease->prefixlen_); // this is IA_NA, not IA_PD
EXPECT_EQ(128, lease->prefixlen_); // this is IA_NA, not IA_PD
EXPECT_TRUE(false == lease->fqdn_fwd_);
EXPECT_TRUE(false == lease->fqdn_rev_);
EXPECT_TRUE(*lease->duid_ == *duid_);
// @todo: check cltt
}
}
/// @brief checks if specified address is increased properly
/// @param alloc IterativeAllocator that is tested
/// @param input address to be increased
/// @param exp_output expected address after increase
void
checkAddrIncrease(NakedAllocEngine::NakedIterativeAllocator& alloc,
std::string input, std::string exp_output) {
EXPECT_EQ(exp_output, alloc.increaseAddress(IOAddress(input)).toText());
}
void
checkPrefixIncrease(NakedAllocEngine::NakedIterativeAllocator& alloc,
std::string input, uint8_t prefix_len,
std::string exp_output) {
EXPECT_EQ(exp_output, alloc.increasePrefix(IOAddress(input), prefix_len)
.toText());
}
virtual ~AllocEngine6Test() {
factory_.destroy();
......@@ -423,6 +451,71 @@ TEST_F(AllocEngine6Test, IterativeAllocator) {
}
}
// This test verifies that the allocator iterates over addresses properly
TEST_F(AllocEngine6Test, IterativeAllocatorAddrStep) {
NakedAllocEngine::NakedIterativeAllocator alloc(Lease::TYPE_NA);
// Let's pick the first address
IOAddress addr1 = alloc.pickAddress(subnet_, duid_, IOAddress("2001:db8:1::10"));
// Check that we can indeed pick the first address from the pool
EXPECT_EQ("2001:db8:1::10", addr1.toText());
// Check that addresses can be increased properly
checkAddrIncrease(alloc, "2001:db8::9", "2001:db8::a");
checkAddrIncrease(alloc, "2001:db8::f", "2001:db8::10");
checkAddrIncrease(alloc, "2001:db8::10", "2001:db8::11");
checkAddrIncrease(alloc, "2001:db8::ff", "2001:db8::100");
checkAddrIncrease(alloc, "2001:db8::ffff", "2001:db8::1:0");
checkAddrIncrease(alloc, "::", "::1");
checkAddrIncrease(alloc, "ffff:ffff:ffff:ffff:ffff:ffff:ffff:ffff", "::");
// Check that prefixes can be increased properly
// For /128 prefix, increasePrefix should work the same as addressIncrease
checkPrefixIncrease(alloc, "2001:db8::9", 128, "2001:db8::a");
checkPrefixIncrease(alloc, "2001:db8::f", 128, "2001:db8::10");
checkPrefixIncrease(alloc, "2001:db8::10", 128, "2001:db8::11");
checkPrefixIncrease(alloc, "2001:db8::ff", 128, "2001:db8::100");
checkPrefixIncrease(alloc, "2001:db8::ffff", 128, "2001:db8::1:0");
checkPrefixIncrease(alloc, "::", 128, "::1");
checkPrefixIncrease(alloc, "ffff:ffff:ffff:ffff:ffff:ffff:ffff:ffff", 128, "::");
// Check that /64 prefixes can be generated
checkPrefixIncrease(alloc, "2001:db8::", 64, "2001:db8:0:1::");
// Check that prefix length not divisible by 8 are working
checkPrefixIncrease(alloc, "2001:db8::", 128, "2001:db8::1");
checkPrefixIncrease(alloc, "2001:db8::", 127, "2001:db8::2");
checkPrefixIncrease(alloc, "2001:db8::", 126, "2001:db8::4");
checkPrefixIncrease(alloc, "2001:db8::", 125, "2001:db8::8");
checkPrefixIncrease(alloc, "2001:db8::", 124, "2001:db8::10");
checkPrefixIncrease(alloc, "2001:db8::", 123, "2001:db8::20");
checkPrefixIncrease(alloc, "2001:db8::", 122, "2001:db8::40");
checkPrefixIncrease(alloc, "2001:db8::", 121, "2001:db8::80");
checkPrefixIncrease(alloc, "2001:db8::", 120, "2001:db8::100");
// These are not really useful cases, because there are bits set
// int the last (128 - prefix_len) bits. Nevertheless, it shows
// that the algorithm is working even in such cases
checkPrefixIncrease(alloc, "2001:db8::1", 128, "2001:db8::2");
checkPrefixIncrease(alloc, "2001:db8::1", 127, "2001:db8::3");
checkPrefixIncrease(alloc, "2001:db8::1", 126, "2001:db8::5");
checkPrefixIncrease(alloc, "2001:db8::1", 125, "2001:db8::9");
checkPrefixIncrease(alloc, "2001:db8::1", 124, "2001:db8::11");
checkPrefixIncrease(alloc, "2001:db8::1", 123, "2001:db8::21");
checkPrefixIncrease(alloc, "2001:db8::1", 122, "2001:db8::41");
checkPrefixIncrease(alloc, "2001:db8::1", 121, "2001:db8::81");
checkPrefixIncrease(alloc, "2001:db8::1", 120, "2001:db8::101");
// Let's try out couple real life scenarios
checkPrefixIncrease(alloc, "2001:db8:1:abcd::", 64, "2001:db8:1:abce::");
checkPrefixIncrease(alloc, "2001:db8:1:abcd::", 60, "2001:db8:1:abdd::");
checkPrefixIncrease(alloc, "2001:db8:1:abcd::", 56, "2001:db8:1:accd::");
checkPrefixIncrease(alloc, "2001:db8:1:abcd::", 52, "2001:db8:1:bbcd::");
}
// This test verifies that the iterative allocator really walks over all addresses
// in all pools in specified subnet. It also must not pick the same address twice
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment
|
{
"url": "https://gitlab.isc.org/isc-projects/kea/-/commit/e295438305b351d4959001113670c6455f4a0abb",
"source_domain": "gitlab.isc.org",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "749910",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YYEEZDMA4ZXALRBM2H7JZIDBB52COYEJ",
"WARC-Concurrent-To": "<urn:uuid:ee22df52-d3c7-4977-88bb-9e0ec5bc11b9>",
"WARC-Date": "2021-08-03T23:09:19Z",
"WARC-IP-Address": "149.20.1.108",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:X4DV6RF4UXMNN4CVOOTUJ2QEW4PCQ4FC",
"WARC-Record-ID": "<urn:uuid:fdf5f092-55c0-4f72-bd38-a5477dcfc5ea>",
"WARC-Target-URI": "https://gitlab.isc.org/isc-projects/kea/-/commit/e295438305b351d4959001113670c6455f4a0abb",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a3b64eb6-7626-4508-9b55-3b422e33e382>"
},
"warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-169.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,
71,
84,
85,
159,
160,
176,
276,
278,
303,
392,
487,
523,
573,
600,
706,
763,
765,
790,
878,
906,
928,
988,
990,
1026,
1078,
1120,
1190,
1206,
1208,
1285,
1323,
1370,
1398,
1429,
1494,
1539,
1579,
1626,
1651,
1700,
1702,
1765,
1790,
1837,
1878,
1891,
1963,
1985,
1992,
1994,
1996,
2045,
2047,
2072,
2142,
2225,
2227,
2276,
2304,
2372,
2460,
2472,
2516,
2585,
2599,
2682,
2698,
2771,
2823,
2892,
2934,
2952,
3018,
3056,
3100,
3170,
3242,
3324,
3348,
3407,
3460,
3479,
3511,
3537,
3555,
3639,
3709,
3725,
3787,
3805,
3831,
3861,
3913,
3955,
3987,
3989,
4054,
4066,
4083,
4145,
4173,
4235,
4257,
4291,
4317,
4351,
4364,
4446,
4455,
4482,
4541,
4573,
4599,
4617,
4645,
4671,
4705,
4734,
4766,
4787,
4874,
4900,
4921,
4936,
4956,
4983,
5010,
5039,
5127,
5196,
5198,
5238,
5298,
5300,
5355,
5378,
5401,
5488,
5519,
5556,
5593,
5627,
5699,
5726,
5814,
5835,
5850,
5873,
5893,
5911,
5938,
5965,
6053,
6104,
6148,
6201,
6252,
6266,
6301,
6336,
6343,
6382,
6419,
6440,
6479,
6488,
6499,
6536,
6583,
6587,
6643,
6647,
6687,
6724,
6804,
6829,
6890,
6925,
6929,
6988,
7056,
7127,
7173,
7177,
7218,
7277,
7303,
7328,
7383,
7410,
7413,
7486,
7521,
7589,
7657,
7671,
7728,
7770,
7846,
7907,
7942,
7966,
8036,
8089,
8134,
8161,
8199,
8253,
8282,
8334,
8365,
8400,
8453,
8483,
8551,
8603,
8679,
8740,
8755,
8790,
8857,
8931,
8967,
8994,
9041,
9068,
9097,
9149,
9156,
9213,
9260,
9330,
9394,
9451,
9510,
9555,
9559,
9566,
9657,
9659,
9661,
9736,
9809,
9836,
9890,
9907,
10008,
10040,
10112,
10130,
10159,
10178,
10180,
10187,
10223,
10300,
10345,
10349,
10420,
10490,
10564,
10568,
10622,
10693,
10765,
10790,
10823,
10889,
10954,
10976,
11032,
11036,
11043,
11076,
11106,
11145,
11178,
11250,
11258,
11300,
11328,
11330,
11386,
11441,
11444,
11447,
11499,
11535,
11594,
11635,
11676,
11737,
11800,
11840,
11880,
11918,
11939,
11941,
11943,
12004,
12055,
12096,
12150,
12155,
12223,
12268,
12341,
12343,
12348,
12418,
12457,
12483,
12556,
12568,
12570,
12600,
12620,
12694,
12696,
12698,
12772,
12827,
12892,
12924,
13006,
13071,
13116,
13166,
13222,
13279,
13337,
13396,
13457,
13496,
13571,
13620,
13695,
13758,
13822,
13887,
13953,
14021,
14067,
14149,
14193,
14257,
14316,
14378,
14440,
14502,
14564,
14627,
14690,
14753,
14816,
14880,
14945,
15009,
15061,
15124,
15187,
15250,
15313,
15377,
15441,
15505,
15569,
15634,
15678,
15752,
15826,
15900,
15974,
15976,
16059,
16141,
16148,
16170,
16178,
16249,
16284
],
"line_end_idx": [
71,
84,
85,
159,
160,
176,
276,
278,
303,
392,
487,
523,
573,
600,
706,
763,
765,
790,
878,
906,
928,
988,
990,
1026,
1078,
1120,
1190,
1206,
1208,
1285,
1323,
1370,
1398,
1429,
1494,
1539,
1579,
1626,
1651,
1700,
1702,
1765,
1790,
1837,
1878,
1891,
1963,
1985,
1992,
1994,
1996,
2045,
2047,
2072,
2142,
2225,
2227,
2276,
2304,
2372,
2460,
2472,
2516,
2585,
2599,
2682,
2698,
2771,
2823,
2892,
2934,
2952,
3018,
3056,
3100,
3170,
3242,
3324,
3348,
3407,
3460,
3479,
3511,
3537,
3555,
3639,
3709,
3725,
3787,
3805,
3831,
3861,
3913,
3955,
3987,
3989,
4054,
4066,
4083,
4145,
4173,
4235,
4257,
4291,
4317,
4351,
4364,
4446,
4455,
4482,
4541,
4573,
4599,
4617,
4645,
4671,
4705,
4734,
4766,
4787,
4874,
4900,
4921,
4936,
4956,
4983,
5010,
5039,
5127,
5196,
5198,
5238,
5298,
5300,
5355,
5378,
5401,
5488,
5519,
5556,
5593,
5627,
5699,
5726,
5814,
5835,
5850,
5873,
5893,
5911,
5938,
5965,
6053,
6104,
6148,
6201,
6252,
6266,
6301,
6336,
6343,
6382,
6419,
6440,
6479,
6488,
6499,
6536,
6583,
6587,
6643,
6647,
6687,
6724,
6804,
6829,
6890,
6925,
6929,
6988,
7056,
7127,
7173,
7177,
7218,
7277,
7303,
7328,
7383,
7410,
7413,
7486,
7521,
7589,
7657,
7671,
7728,
7770,
7846,
7907,
7942,
7966,
8036,
8089,
8134,
8161,
8199,
8253,
8282,
8334,
8365,
8400,
8453,
8483,
8551,
8603,
8679,
8740,
8755,
8790,
8857,
8931,
8967,
8994,
9041,
9068,
9097,
9149,
9156,
9213,
9260,
9330,
9394,
9451,
9510,
9555,
9559,
9566,
9657,
9659,
9661,
9736,
9809,
9836,
9890,
9907,
10008,
10040,
10112,
10130,
10159,
10178,
10180,
10187,
10223,
10300,
10345,
10349,
10420,
10490,
10564,
10568,
10622,
10693,
10765,
10790,
10823,
10889,
10954,
10976,
11032,
11036,
11043,
11076,
11106,
11145,
11178,
11250,
11258,
11300,
11328,
11330,
11386,
11441,
11444,
11447,
11499,
11535,
11594,
11635,
11676,
11737,
11800,
11840,
11880,
11918,
11939,
11941,
11943,
12004,
12055,
12096,
12150,
12155,
12223,
12268,
12341,
12343,
12348,
12418,
12457,
12483,
12556,
12568,
12570,
12600,
12620,
12694,
12696,
12698,
12772,
12827,
12892,
12924,
13006,
13071,
13116,
13166,
13222,
13279,
13337,
13396,
13457,
13496,
13571,
13620,
13695,
13758,
13822,
13887,
13953,
14021,
14067,
14149,
14193,
14257,
14316,
14378,
14440,
14502,
14564,
14627,
14690,
14753,
14816,
14880,
14945,
15009,
15061,
15124,
15187,
15250,
15313,
15377,
15441,
15505,
15569,
15634,
15678,
15752,
15826,
15900,
15974,
15976,
16059,
16141,
16148,
16170,
16178,
16249,
16284,
16313
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 16313,
"ccnet_original_nlines": 381,
"rps_doc_curly_bracket": 0.0036780498921871185,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.11863946169614792,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011972789652645588,
"rps_doc_frac_lines_end_with_ellipsis": 0.015706809237599373,
"rps_doc_frac_no_alph_words": 0.5004081726074219,
"rps_doc_frac_unique_words": 0.33125388622283936,
"rps_doc_mean_word_length": 7.327510833740234,
"rps_doc_num_sentences": 73,
"rps_doc_symbol_to_word_ratio": 0.016598640009760857,
"rps_doc_unigram_entropy": 5.606451034545898,
"rps_doc_word_count": 1603,
"rps_doc_frac_chars_dupe_10grams": 0.061978548765182495,
"rps_doc_frac_chars_dupe_5grams": 0.1923207938671112,
"rps_doc_frac_chars_dupe_6grams": 0.1301719695329666,
"rps_doc_frac_chars_dupe_7grams": 0.09807594120502472,
"rps_doc_frac_chars_dupe_8grams": 0.09296782314777374,
"rps_doc_frac_chars_dupe_9grams": 0.07968670129776001,
"rps_doc_frac_chars_top_2gram": 0.008428400382399559,
"rps_doc_frac_chars_top_3gram": 0.01634599082171917,
"rps_doc_frac_chars_top_4gram": 0.022986549884080887,
"rps_doc_books_importance": -1142.4781494140625,
"rps_doc_books_importance_length_correction": -1142.4781494140625,
"rps_doc_openwebtext_importance": -626.9163818359375,
"rps_doc_openwebtext_importance_length_correction": -626.9163818359375,
"rps_doc_wikipedia_importance": -325.1860046386719,
"rps_doc_wikipedia_importance_length_correction": -325.1860046386719
},
"fasttext": {
"dclm": 0.49654513597488403,
"english": 0.5618672966957092,
"fineweb_edu_approx": 2.3646016120910645,
"eai_general_math": 0.446220338344574,
"eai_open_web_math": 0.4677198529243469,
"eai_web_code": 0.035545289516448975
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "1",
"label": "Leftover HTML"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
8,281,096,049,094,188,000 |
TechSpot
Neverending Restart when booting into linux
Linux
By PHATMAN5050
Mar 31, 2002
1. I've decided to hookup my brother's old rig, its an Intel Celeron 166mhz, or maybe just an Intel Pentium I or something, but its 166mhz. Anyways, the computer will boot and go through the Hewlett Packard screen and then it has the LILO os chooser which ijust let it go to Linux and it runs through and says 'Loading linux........... and then it does uncompressed linux.....' really quickly and then the computer restarts and it goes through all of this again, over and over again. Any ideas? Btw, i dont have anything plugged, no keyboard or mouse or anything, just the monitor. Could that be the reason?
2. svtcobra
svtcobra TechSpot Paladin Posts: 875
Try plugging the keyboard and mouse..Linux may be rebooting to "hopefully" see the devices on the reboot.
3. PHATMAN5050
PHATMAN5050 TS Rookie Topic Starter Posts: 645
No, that would be too logical and easy i suppose. Unfortunately that didn't work, although i hoped it would have...
4. Mictlantecuhtli
Mictlantecuhtli TS Evangelist Posts: 4,919 +10
Does the machine start in single-user mode? You can get there by entering linux 1 at LILO prompt. Check /var/log/messages and /var/log/syslog for possible reasons (with less command, for example). If single-user mode doesn't work, you could try booting from a floppy or put the harddisk to another machine which can read ext2 partitions.
5. Phantasm66
Phantasm66 TS Rookie Posts: 6,504 +6
Or boot from the installation CD and type "linux rescue" at the boot: prompt.... Your system is then mounted under /mnt/sysimage, the rest of the file system is inside a RAM drive....
6. PHATMAN5050
PHATMAN5050 TS Rookie Topic Starter Posts: 645
Do you think that an Intel Celeron 166mhz with 64mb is too slow to run Linux Redhat 7.2? I have another computer, its a PIII 550mhz without a PSU and whenever i try and use another psu in there it doesn't turn on, so it may or may not work...Hopefully that intel celeron can run it :)
7. Mictlantecuhtli
Mictlantecuhtli TS Evangelist Posts: 4,919 +10
I've never heard of Celeron 166. I think it's just Pentium 166 (possibly with MMX) or a typo, Celeron-266. Anyway, it's not too slow to run RH7.2, at least not in text mode :)
8. PHATMAN5050
PHATMAN5050 TS Rookie Topic Starter Posts: 645
yeah ur right, i think its a Pentium 166 not a celeron but im positive its a 166. You think it would cause it to restart if i dont run it in text mode?
9. Phantasm66
Phantasm66 TS Rookie Posts: 6,504 +6
Nope, you should still be able to run X Windows, albeit slowly and not very nicely.
Note Mictlantecuhtli 's post:
Post the contents of these files if possible.
Boot from the Linux CD, at first boot: prompt enter
linux rescue
once booted, your systems should be mounted under /mnt/sysimage
mount another partiton or floppy disk and copy these files onto it.
Post the files here (if they appear to contain anything suspicious towards the end....)
Topic Status:
Not open for further replies.
Similar Topics
Add New Comment
TechSpot Members
Login or sign up for free,
it takes about 30 seconds.
You may also...
Get complete access to the TechSpot community. Join thousands of technology enthusiasts that contribute and share knowledge in our forum. Get a private inbox, upload your own photo gallery and more.
|
{
"url": "http://www.techspot.com/community/topics/neverending-restart-when-booting-into-linux.1008/",
"source_domain": "www.techspot.com",
"snapshot_id": "crawl=CC-MAIN-2015-22",
"warc_metadata": {
"Content-Length": "64365",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:USERI7JOVBQLH2DIZGV5PCRJQRFUK72A",
"WARC-Concurrent-To": "<urn:uuid:1f95be76-f2f7-41eb-832e-dec3235b9fa4>",
"WARC-Date": "2015-05-30T06:53:39Z",
"WARC-IP-Address": "184.173.241.66",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:ENIBJE4S7UII4JXWBCYV46KY74I6PGAM",
"WARC-Record-ID": "<urn:uuid:9c2c7ddc-dbca-499c-bcc5-3d22558b4f53>",
"WARC-Target-URI": "http://www.techspot.com/community/topics/neverending-restart-when-booting-into-linux.1008/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:4cc9150b-0b94-464b-b74f-e45ff18ae3d7>"
},
"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,
9,
10,
54,
55,
61,
76,
89,
699,
705,
719,
720,
761,
762,
872,
878,
895,
896,
947,
948,
1068,
1074,
1095,
1096,
1149,
1150,
1492,
1498,
1514,
1515,
1558,
1559,
1747,
1753,
1770,
1771,
1822,
1823,
2112,
2118,
2139,
2140,
2193,
2194,
2374,
2380,
2397,
2398,
2449,
2450,
2606,
2612,
2628,
2629,
2672,
2673,
2761,
2762,
2796,
2797,
2847,
2848,
2904,
2905,
2922,
2923,
2991,
2992,
3064,
3065,
3157,
3163,
3177,
3207,
3208,
3223,
3224,
3240,
3241,
3258,
3285,
3312,
3328,
3329,
3330
],
"line_end_idx": [
9,
10,
54,
55,
61,
76,
89,
699,
705,
719,
720,
761,
762,
872,
878,
895,
896,
947,
948,
1068,
1074,
1095,
1096,
1149,
1150,
1492,
1498,
1514,
1515,
1558,
1559,
1747,
1753,
1770,
1771,
1822,
1823,
2112,
2118,
2139,
2140,
2193,
2194,
2374,
2380,
2397,
2398,
2449,
2450,
2606,
2612,
2628,
2629,
2672,
2673,
2761,
2762,
2796,
2797,
2847,
2848,
2904,
2905,
2922,
2923,
2991,
2992,
3064,
3065,
3157,
3163,
3177,
3207,
3208,
3223,
3224,
3240,
3241,
3258,
3285,
3312,
3328,
3329,
3330,
3528
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3528,
"ccnet_original_nlines": 84,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37062937021255493,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04055944085121155,
"rps_doc_frac_lines_end_with_ellipsis": 0.03529411926865578,
"rps_doc_frac_no_alph_words": 0.2237762212753296,
"rps_doc_frac_unique_words": 0.4902998208999634,
"rps_doc_mean_word_length": 4.585537910461426,
"rps_doc_num_sentences": 44,
"rps_doc_symbol_to_word_ratio": 0.013986010104417801,
"rps_doc_unigram_entropy": 5.2557244300842285,
"rps_doc_word_count": 567,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.127692312002182,
"rps_doc_frac_chars_dupe_6grams": 0.127692312002182,
"rps_doc_frac_chars_dupe_7grams": 0.127692312002182,
"rps_doc_frac_chars_dupe_8grams": 0.05769231170415878,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.015384620055556297,
"rps_doc_frac_chars_top_3gram": 0.027692310512065887,
"rps_doc_frac_chars_top_4gram": 0.03461537882685661,
"rps_doc_books_importance": -313.9638671875,
"rps_doc_books_importance_length_correction": -313.9638671875,
"rps_doc_openwebtext_importance": -221.06297302246094,
"rps_doc_openwebtext_importance_length_correction": -221.06297302246094,
"rps_doc_wikipedia_importance": -125.76453399658203,
"rps_doc_wikipedia_importance_length_correction": -125.76453399658203
},
"fasttext": {
"dclm": 0.029389800503849983,
"english": 0.8666619658470154,
"fineweb_edu_approx": 1.7700395584106445,
"eai_general_math": 0.03870493173599243,
"eai_open_web_math": 0.27613818645477295,
"eai_web_code": 0.0005815000040456653
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,600,148,770,950,047,500 |
Hi,
The following example proves that we can not query for objects which have been newly added. The result of the query below gives a count = 0. Is it true that DO4 does not see the objects in the cache? If true, how do we get these (without persisting the data to the DB)?
Regards Paul Sinnema Diartis AG
private static void TestQueryForNewCreated(Domain domain)
{
// Opens the Session with DisconnectedState attached and Connect() executed
ModelContext context = ModelContext.Instance;
CommunicationKindType type = new CommunicationKindType();
type.Z_IsDefault = true;
var q = from comm in Query.All<CommunicationKindType>()
where comm.Z_IsDefault
select comm;
var result = q.ToList();
}
Updated at 13.07.2010 16:41:36
Do you use attached DisconnectedState (this isn't clear from the sample)? If yes, this is correct: we never flush the changes automatically in this case, but queries you run always hit the real DB.
Hi Alex,
You could have read it from the comment in the example :o (// Opens the Session with DisconnectedState attached and Connect() executed)
What about the second question? How do we get them without persisting the data to the DB? If there's no way to get them this will lead to unwanted results. We don't want to persist anything until all data is correct.
Take for instance a real KLIB (our application) example.
Some of our lists use LINQ queries to refresh their content (the query is handed over as a parameter and kept inside the list for later use). This construction will become impossible if the data in the cache is never found. Any Add() would not be noticed by the list. IMHO the Cache should be transparent to LINQ or in other words, any entities added to the DisconnectedState should become visible in LINQ Queries that are executed against it.
Regards Paul Sinnema Diartis AG
Updated at 13.07.2010 19:46:19
Hi Alex,
Well, the code does run, but it only returns the same rows already fetched using a DB query. In the Example below q1 and q2 both return the same amount of rows (in my case each 3 rows). When I don't execute q1 then no rows are returned.
What I also see is that after executing 'new CommunicationKindType();' the Versions collection in the DisconnectedState has a count of zero (0).
private static void TestQueryForNewCreated(Domain domain)
{
// Opens the Session with DisconnectedState attached and Connect() executed
ModelContext context = ModelContext.Instance;
AbstractEntity.AddStamps = false; // just some code to prevent stamping during SaveChanges()
CommunicationKindType type = new CommunicationKindType();
type.Z_IsDefault = true;
type.Z_NameLanguageString1 = "English";
type.Z_NameLanguageString2 = "German";
type.Z_NameLanguageString3 = "French";
type.Z_NameLanguageString4 = "Italian";
type.Z_Attribute = "SomeTest";
type.Z_CreatedBy = 0;
type.Z_CreatedOn = DateTime.Now;
type.Z_ChangedBy = 0;
type.Z_ChangedOn = DateTime.Now;
var q1 = from comm in Query.All<CommunicationKindType>()
where comm.Z_IsDefault
select comm;
var result = q1.ToList();
var q2 = from comm in context.KLIBSession.DisconnectedState.AllCached<CommunicationKindType>()
where comm.Z_IsDefault
select comm;
result = q2.ToList();
ModelContext.Instance.SaveChanges();
// Also closes the Session
ModelContext.Instance.Dispose();
}
Regards Paul Sinnema Diartis AG
Updated at 14.07.2010 8:20:33
Hi Alex,
I still don't get it completely. Are you telling me that locally added entities don't show up in the DisconnectedState.Versions and there is no way we can get all of them (remote and local together) without persisting the Data to the DB? You must be kidding me. So there's no way we can get all of the cached entities including the freshly added ones without persisting the data to the DB?
IMHO that is a flaw in DO4's architecture. Can you explain to me what the concept is behind this, because I'm totally missing the point.
The cache should be totally transparent for fetches and changes, meaning that any Entities in the cache together with the changes made to the cache (this includes all CRUD actions) are all visible at anytime (without persisting the data to the DB, i.e. totally local). The DisconnectedState is completely useless, to us, when we can not see all CRUD changes in it at any given time. It would mean that in order to see all the changes, any CRUD action should immediatly be persisted to the DB. This will absolutely lead to inconsistent data.
We could maintain a manual transaction and only commit/rollback at times we wanted, but, even with optimistic locking, that would cause many locks in the DB, which in turn would lead to unwanted deadlock situations (coffee-break syndrom).
[Andres Rohr]Or, another solution for us would be if we could call a special 'ApplyChanges()' call that plays back the changes, of the DisconnectedState, to the Session (or Domain cache) without going to the DB. So a LINQ query would see the changes too.
Regards Paul Sinnema Diartis AG.
Updated at 15.07.2010 6:10:49
Alex,
Somehow I've got the feeling that several topics are related. We've got:
• the issue with the Batched Queries which now give a problem during the refresh of list: viewtopic.php?f=29&t=6020&start=0. Here we now get a Version mismatch 'Version of entity with key 'CorrespondenceLanguage, (1)' differs from the expected one.'
• the issue where new entities don't show up in the DisconnectedState.Versions viewtopic.php?f=29&t=6014
• and last but not least we've got the issue you've been working on last night which we call 'Object Reference Changed' issue
Could it be that we get the 'Version mismatch' because of the 'Object Reference Changed' or 'Disconnected.Versions' problem?
Regards Paul
Updated at 15.07.2010 6:47:48
Alex,
On the Version issue. I had added a Guid to the AbstractEntity (our 1 and only HierarchyRoot element). After setting the MergeMode to PreferSource, I got an Exception saying that a conversion from Guid to string was not possible. Maybe a hint on where the problem lies?
Regards Paul
Updated at 15.07.2010 11:11:03
at Xtensive.Storage.DisconnectedState.RegisterState(Key key, Tuple tuple, VersionInfo version, MergeMode mergeMode) at Xtensive.Storage.DisconnectedState.RegisterState(Key key, Tuple tuple) at Xtensive.Storage.Disconnected.DisconnectedSessionHandler.RegisterEntityState(Key key, Tuple tuple) at Xtensive.Storage.Linq.Materialization.ItemMaterializationContext.Materialize(Int32 entityIndex, Int32 typeIdIndex, TypeInfo type, Pair1[] entityColumns, Tuple tuple) at lambda_method(Closure , Object[] , Tuple , ItemMaterializationContext ) at Xtensive.Core.DelegateBindExtensions.<>c__DisplayClassa4.<bind>b9(T2 arg2, T3 arg3) at Xtensive.Storage.Linq.Materialization.MaterializationHelper.<>cDisplayClass41.<Materialize>b__3(Tuple tuple) at System.Linq.Enumerable.WhereSelectEnumerableIterator2.MoveNext() at Xtensive.Core.EnumerableExtensions.<batch>d__201.MoveNext() at Xtensive.Core.EnumerableExtensions.<ApplyBeforeAndAfter>d__281.MoveNext() at System.Collections.Generic.List1..ctor(IEnumerable1 collection) at System.Linq.Enumerable.ToListTSource in C:\KLIB2\trunk\KLIB\KLIBDatabase\ObservableEntityList.cs:line 164 at Diartis.KLIB.Model.CorrespondenceLanguage.get_CorrespondenceLanguageList() in C:\KLIB2\trunk\KLIB\KLIBDatabase\Generated\CorrespondenceLanguage.Generated.cs:line 83 at Diartis.KLIB.KLIBViewModel.VMCorrespondenceLanguage.get_AllVMCorrespondenceLanguageList() in C:\KLIB2\trunk\KLIB\KLIBViewModel\VMCorrespondenceLanguage.Generated.cs:line 43
Updated at 22.07.2010 12:20:31
We still have some problems with this (I think it belongs in this thread). During the ApplyChanges() we now get the following exception:
Entity with Key = 'DossierContactingCause, (-3)' does not exist.
Stacktrace:
> Xtensive.Storage.dll!Xtensive.Storage.Query.Single(Xtensive.Storage.Session session, Xtensive.Storage.Key key) Line 397 C#
Xtensive.Storage.dll!Xtensive.Storage.Operations.EntityFieldSetOperation.Execute(Xtensive.Storage.Operations.OperationExecutionContext context) Line 65 + 0xf bytes C#
Xtensive.Storage.dll!Xtensive.Storage.OperationLog.Replay(Xtensive.Storage.Session session) Line 74 + 0x2d bytes C#
Xtensive.Storage.dll!Xtensive.Storage.DisconnectedState.ApplyChanges(Xtensive.Storage.Session targetSession) Line 207 + 0x4c bytes C#
Xtensive.Storage.dll!Xtensive.Storage.DisconnectedState.ApplyChanges() Line 184 + 0x28 bytes C#
KLIBDatabase.dll!Diartis.KLIB.Model.ModelContext.SaveChanges() Line 363 + 0x30 bytes C#
KLIBViewModel.dll!Diartis.KLIB.KLIBViewModel.VMContext.SaveChanges() Line 84 + 0x1c bytes C#
KLIBBase.dll!Diartis.KLIB.KLIBContext.SaveChanges() Line 289 + 0x21 bytes C#
KLIBBase.dll!Diartis.KLIB.KLIBContext.OnSave(object target, System.Windows.Input.ExecutedRoutedEventArgs e) Line 101 + 0x1c bytes C#
PresentationCore.dll!System.Windows.Input.CommandBinding.OnExecuted(object sender, System.Windows.Input.ExecutedRoutedEventArgs e) + 0xe2 bytes
PresentationCore.dll!System.Windows.Input.CommandManager.ExecuteCommandBinding(object sender, System.Windows.Input.ExecutedRoutedEventArgs e, System.Windows.Input.CommandBinding commandBinding) + 0xd2 bytes
PresentationCore.dll!System.Windows.Input.CommandManager.FindCommandBinding(System.Windows.Input.CommandBindingCollection commandBindings, object sender, System.Windows.RoutedEventArgs e, System.Windows.Input.ICommand command, bool execute) + 0x100 bytes
PresentationCore.dll!System.Windows.Input.CommandManager.FindCommandBinding(object sender, System.Windows.RoutedEventArgs e, System.Windows.Input.ICommand command, bool execute) + 0x234 bytes
PresentationCore.dll!System.Windows.Input.CommandManager.OnExecuted(object sender, System.Windows.Input.ExecutedRoutedEventArgs e) + 0x3a bytes
PresentationCore.dll!System.Windows.RoutedEventArgs.InvokeHandler(System.Delegate handler, object target) + 0x53 bytes
PresentationCore.dll!System.Windows.EventRoute.InvokeHandlersImpl(object source, System.Windows.RoutedEventArgs args, bool reRaised) + 0x271 bytes
PresentationCore.dll!System.Windows.UIElement.RaiseEventImpl(System.Windows.DependencyObject sender, System.Windows.RoutedEventArgs args) + 0x14e bytes
PresentationCore.dll!System.Windows.Input.RoutedCommand.ExecuteImpl(object parameter, System.Windows.IInputElement target, bool userInitiated) + 0x17f bytes
KLIBControlLibrary.dll!Diartis.KLIB.KLIBControlLibrary.StandardControls.KLIBTabControl.KLIBTabControlSelectionChanged(object sender, System.Windows.Controls.SelectionChangedEventArgs e) Line 63 + 0x42 bytes C#
This thread was imported from our support forum. The original discussion may contain more detailed answer.
asked Jul 13 '10 at 13:39
Paul%20Sinnema's gravatar image
Paul Sinnema
261878896
Do you use attached DisconnectedState (this isn't clear from the sample)?
If yes, this is correct: we never flush the changes automatically in this case, but queries you run always hit the real DB.
(Jul 13 '10 at 13:39) Alex Yakunin Alex%20Yakunin's gravatar image
One Answer:
First of all, the solution: DisconnectedState.Versions allows you to get all pairs of Key and VersionInfo objects it caches. So nearly this method will return all the objects of type T cached in DisconnectedState:
public IEnumerable<T> AllCached<T>(this DisconnectedState disconnectedState)
where T: class, IEntity
{
var keys = disconnectedState.Versions.Select(pair => pair.Key);
var entities =
from key in keys
let entity = Query.SingleOrDefault<T>(key)
where entity!=null && !entity.IsRemoved
select entity;
return entities;
}
I didn't tested it, so there might be non-essential mistakes. That's the point you must (or can) use in this case instead of Query.All<t>(). This implies such "queries" will be evaluated via LINQ to IEnumerable, but this should be acceptable for relatively small data sets you have on the client.
I also should explain why we can't do this automatically for queries, when DisconnectedState is attached: it is much more that just "merging" the results of local and remote queries. Results of many remote operations simply can't be "merged" to produce the right final result - e.g. this can't be done in case there is any aggregation or .GroupBy(). As far as I can judge, the only way to produce the right result is to perform almost the whole calculation on the client (= fetch almost the whole database and "crunch" the data here), which is definitely not what you would expect.
So we decided to do what we really can do well: run the query remotely and bring all the data to the client. It will be merged into DisconnectedState, and exposes with the changes it caches. But these changes won't affect on remote query result. At least, the behavior we have here is fully clear.
See also: viewtopic.php?f=29&t=6011#p15187
Yes, suggested method should return only the objects already fetched into the DisconnectedState, since it relies on info about versions of Entities cached in DisconnectedState.
So there is no silver bullet: you have two storages, one is actually a "diff" above another, i.e. ActualStorage = DisconnectedStorage.ApplyChangesTo(RemoteStorage). Two storages on this schema are real (DisconnectedStorage and RemoteStorage), but one is virtual represenation we provide for you. And you'd like to run a query over ActualStorage, that actually doesn't exist - so to run a query there, we must either build its full view locally (not acceptable), or transform RemoteStorage to it (by applying the changes). There is no other way to run a query over this storage.
Some simplest queries (e.g. using just filtering) can be executed in "remote query + local refinement" fashion, but generally that's a case you can implement by your own. LiveQuery described in another post targets exactly this problem: run the query once (e.g. remotely), bind the result to UI and see how it is changing when you modify the entities locally.
> Are you telling me that locally added entities don't show up in the DisconnectedState.Versions
Hmm... They should. I misunderstood you - I though you're trying to get them via Query.All<t>().
Probably, that's a bug here (i.e. only fetched versions are exposed there) - I gave you the code, but I didn't try it myself. I'll check this today.
> The cache should be totally transparent for fetches and changes, meaning that any Entities in the cache together with the changes made to the cache
That's exactly the case we have. Of course, except direct LINQ queries to the storage - they work remotely, and thus return result based on remote data, although we expose all the entities returned by such queries already with your modifications.
> [Andres Rohr]Or, another solution for us would be if we could call a special 'ApplyChanges()' call that plays back the changes, of the DisconnectedState, to the Session (or Domain cache) without going to the DB. So a LINQ query would see the changes too.
Actually, you already can do this:
• Open one more Session
• Open a transaction there
• Replay a copy of operation log there
• Run your query, serialize the keys of entities you got // If this suits for you; shortly we'll allow you to serialize generally any graph with entities in "by ref" mode
• Rollback the transaction.
The last issue isn't fixed yet - needs further evaluation.
But:
• DisconnectedState now implements IEnumerable<entity>
• We added DisconnectedState.All<t>() method returning sequence of all the entities of the specified type it caches (except removed ones, of course - although this info is cached as well).
• DisconnectedState.GetPersistenceState(Key key) and DisconnectedState.AttPersistenceStates() were added
• Now Session is capable of remapping Entity keys cached inside it. OperationLog uses this feature on Replay; you can invoke it manually via DirectStateAccessor.Get(session).RemapEntityKeys(KeyMapping keyMapping) method.
The cause is:
• when top-level operation is being logged by DisconnectedState (DS), nested ones aren't (we intentionally prevent this, since the topmost operation, when replayed, must lead to execution of the whole chain)
• but in your case a new entity is created inside it (as result of event handler invocation), and we don't log this operation; so DO can't figure out how to deal with further updates of properties of newly created entity: it doesn't know how it was created (no such entry in log), and thus can't associate a new entity with old key. Imagine: When DS is attached:
• Create Entity #-1 -> Logged
• Create Entity #-2 -> not logged, since top-level operation still continues, and its reply will anyway lead to this one
• Update Entity #-1 -> Logged
• Update Entity #-2 -> Logged
When replaying this, the following happens:
• Create Entity #-1, new key is #100, remember it for further key remapping
• Create Entity #101 - this operaton is "induced" by the above one, nothing is logged in key remapping list
• Update Entity #-1 - key is remapped to #100, because there is info for this, operation completes successfully.
• Update Entity #-2 -> key isn't remapped, since there is no info for this. FAIL. Btw, strange we didn't implement support for this yet. I.e. the case is known for me, I immediately remembered we had special support for this in v3.X - there was Offline layer operating nearly the same way.
The solution we'll use here will be nearly the same - i.e. you should give identifying names to entities created inside topmost operations:
var newCustomerA = ...;
newCustomerA.IdentifyAs("CustomerA");
var newCustomerB = ...;
newCustomerB.IdentifyAs("CustomerB");
var newOrder = ...; // No .IdentifyAs, so it will be automatically uniquely identified in scope of current operation, e.g. as "Entity#1"
These names will be used to establish mappings between old and new keys of same named entities.
answered Jul 13 '10 at 17:07
Alex%20Yakunin's gravatar image
Alex Yakunin
29714412
Could you publish the stack trace?
(Jul 13 '10 at 17:07) Alex Yakunin Alex%20Yakunin's gravatar image
I here from my team, I'm not the only one that is unable to find newly added Entities.
(Jul 13 '10 at 17:07) Paul Sinnema Paul%20Sinnema's gravatar image
Hmmmmm.
Just removed the Guid (didn't need it anymore). The Version Mismatch remains.
Regards Paul
(Jul 13 '10 at 17:07) Paul Sinnema Paul%20Sinnema's gravatar image
Your answer
Please start posting your answer anonymously - your answer will be saved within the current session and published after you log in or create a new account. Please try to give a substantial answer, for discussions, please use comments and please do remember to vote (after you log in)!
toggle preview
Subscription:
Once you sign in you will be able to subscribe for any updates here
Tags:
×573
Asked: Jul 13 '10 at 13:39
Seen: 4,306 times
Last updated: Jul 13 '10 at 13:39
powered by OSQA
|
{
"url": "http://support.x-tensive.com/question/2304/newly-added-objects-are-not-found-in-queries",
"source_domain": "support.x-tensive.com",
"snapshot_id": "crawl=CC-MAIN-2019-09",
"warc_metadata": {
"Content-Length": "48171",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O6YDSV6UXCHHDLLY6TCQVOV4HRNJUV46",
"WARC-Concurrent-To": "<urn:uuid:1bc0f82b-b020-420e-ac03-a97136b0a812>",
"WARC-Date": "2019-02-19T05:02:31Z",
"WARC-IP-Address": "207.38.86.148",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:3TYY5JBK7PCK5TJMK3NNUMHGIT3IUPGX",
"WARC-Record-ID": "<urn:uuid:9b7de3e8-ab54-40cc-bc73-45be314439f5>",
"WARC-Target-URI": "http://support.x-tensive.com/question/2304/newly-added-objects-are-not-found-in-queries",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:74c0170d-d64f-4ead-adf7-3e15729625ed>"
},
"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-142-55-37.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,
4,
5,
275,
276,
308,
309,
367,
377,
465,
523,
524,
594,
595,
632,
633,
701,
744,
777,
778,
815,
825,
826,
857,
858,
1056,
1057,
1066,
1067,
1203,
1204,
1421,
1422,
1479,
1480,
1924,
1925,
1957,
1958,
1959,
1990,
1991,
2000,
2001,
2238,
2239,
2384,
2385,
2443,
2453,
2541,
2599,
2600,
2705,
2706,
2776,
2777,
2814,
2866,
2917,
2968,
3020,
3021,
3064,
3065,
3099,
3144,
3178,
3223,
3224,
3293,
3337,
3371,
3372,
3410,
3411,
3518,
3561,
3594,
3595,
3629,
3630,
3679,
3680,
3719,
3764,
3774,
3775,
3807,
3808,
3809,
3839,
3840,
3849,
3850,
4240,
4241,
4378,
4379,
4920,
4921,
5160,
5161,
5416,
5417,
5450,
5451,
5452,
5482,
5483,
5489,
5490,
5563,
5564,
5816,
5923,
6051,
6052,
6177,
6178,
6191,
6192,
6193,
6223,
6224,
6230,
6231,
6501,
6502,
6515,
6516,
6517,
6548,
6549,
8012,
8013,
8014,
8045,
8046,
8183,
8184,
8249,
8250,
8262,
8263,
8390,
8561,
8684,
8823,
8926,
9021,
9120,
9203,
9342,
9491,
9704,
9965,
10162,
10311,
10436,
10589,
10746,
10911,
11126,
11127,
11234,
11235,
11261,
11262,
11294,
11295,
11308,
11318,
11319,
11393,
11394,
11518,
11519,
11586,
11587,
11599,
11600,
11814,
11815,
11892,
11918,
11920,
11986,
12004,
12025,
12072,
12116,
12135,
12154,
12156,
12157,
12454,
12455,
13037,
13038,
13336,
13337,
13380,
13381,
13382,
13559,
13560,
14138,
14139,
14499,
14500,
14501,
14598,
14599,
14696,
14697,
14846,
14847,
14848,
14998,
14999,
15246,
15247,
15248,
15505,
15506,
15541,
15542,
15568,
15569,
15598,
15599,
15640,
15641,
15814,
15815,
15845,
15846,
15847,
15906,
15907,
15912,
15913,
15970,
15971,
16162,
16163,
16270,
16271,
16494,
16495,
16496,
16510,
16511,
16721,
16722,
17087,
17088,
17122,
17247,
17248,
17282,
17283,
17317,
17318,
17366,
17367,
17447,
17559,
17560,
17677,
17678,
17972,
17973,
18113,
18114,
18138,
18176,
18200,
18238,
18375,
18376,
18472,
18473,
18502,
18503,
18535,
18536,
18549,
18558,
18559,
18594,
18595,
18662,
18663,
18750,
18751,
18818,
18819,
18827,
18828,
18906,
18907,
18920,
18921,
18988,
19000,
19285,
19300,
19301,
19315,
19316,
19384,
19385,
19391,
19392,
19397,
19398,
19425,
19426,
19444,
19445,
19479,
19480
],
"line_end_idx": [
4,
5,
275,
276,
308,
309,
367,
377,
465,
523,
524,
594,
595,
632,
633,
701,
744,
777,
778,
815,
825,
826,
857,
858,
1056,
1057,
1066,
1067,
1203,
1204,
1421,
1422,
1479,
1480,
1924,
1925,
1957,
1958,
1959,
1990,
1991,
2000,
2001,
2238,
2239,
2384,
2385,
2443,
2453,
2541,
2599,
2600,
2705,
2706,
2776,
2777,
2814,
2866,
2917,
2968,
3020,
3021,
3064,
3065,
3099,
3144,
3178,
3223,
3224,
3293,
3337,
3371,
3372,
3410,
3411,
3518,
3561,
3594,
3595,
3629,
3630,
3679,
3680,
3719,
3764,
3774,
3775,
3807,
3808,
3809,
3839,
3840,
3849,
3850,
4240,
4241,
4378,
4379,
4920,
4921,
5160,
5161,
5416,
5417,
5450,
5451,
5452,
5482,
5483,
5489,
5490,
5563,
5564,
5816,
5923,
6051,
6052,
6177,
6178,
6191,
6192,
6193,
6223,
6224,
6230,
6231,
6501,
6502,
6515,
6516,
6517,
6548,
6549,
8012,
8013,
8014,
8045,
8046,
8183,
8184,
8249,
8250,
8262,
8263,
8390,
8561,
8684,
8823,
8926,
9021,
9120,
9203,
9342,
9491,
9704,
9965,
10162,
10311,
10436,
10589,
10746,
10911,
11126,
11127,
11234,
11235,
11261,
11262,
11294,
11295,
11308,
11318,
11319,
11393,
11394,
11518,
11519,
11586,
11587,
11599,
11600,
11814,
11815,
11892,
11918,
11920,
11986,
12004,
12025,
12072,
12116,
12135,
12154,
12156,
12157,
12454,
12455,
13037,
13038,
13336,
13337,
13380,
13381,
13382,
13559,
13560,
14138,
14139,
14499,
14500,
14501,
14598,
14599,
14696,
14697,
14846,
14847,
14848,
14998,
14999,
15246,
15247,
15248,
15505,
15506,
15541,
15542,
15568,
15569,
15598,
15599,
15640,
15641,
15814,
15815,
15845,
15846,
15847,
15906,
15907,
15912,
15913,
15970,
15971,
16162,
16163,
16270,
16271,
16494,
16495,
16496,
16510,
16511,
16721,
16722,
17087,
17088,
17122,
17247,
17248,
17282,
17283,
17317,
17318,
17366,
17367,
17447,
17559,
17560,
17677,
17678,
17972,
17973,
18113,
18114,
18138,
18176,
18200,
18238,
18375,
18376,
18472,
18473,
18502,
18503,
18535,
18536,
18549,
18558,
18559,
18594,
18595,
18662,
18663,
18750,
18751,
18818,
18819,
18827,
18828,
18906,
18907,
18920,
18921,
18988,
19000,
19285,
19300,
19301,
19315,
19316,
19384,
19385,
19391,
19392,
19397,
19398,
19425,
19426,
19444,
19445,
19479,
19480,
19495
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 19495,
"ccnet_original_nlines": 323,
"rps_doc_curly_bracket": 0.00030777000938542187,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.30017852783203125,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023208370432257652,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2938025891780853,
"rps_doc_frac_unique_words": 0.31628477573394775,
"rps_doc_mean_word_length": 6.124795436859131,
"rps_doc_num_sentences": 410,
"rps_doc_symbol_to_word_ratio": 0.0066309599205851555,
"rps_doc_unigram_entropy": 5.893156051635742,
"rps_doc_word_count": 2444,
"rps_doc_frac_chars_dupe_10grams": 0.11156389862298965,
"rps_doc_frac_chars_dupe_5grams": 0.1853163242340088,
"rps_doc_frac_chars_dupe_6grams": 0.16079898178577423,
"rps_doc_frac_chars_dupe_7grams": 0.1494421809911728,
"rps_doc_frac_chars_dupe_8grams": 0.11570578813552856,
"rps_doc_frac_chars_dupe_9grams": 0.11570578813552856,
"rps_doc_frac_chars_top_2gram": 0.005344380158931017,
"rps_doc_frac_chars_top_3gram": 0.0037410599179565907,
"rps_doc_frac_chars_top_4gram": 0.00480993976816535,
"rps_doc_books_importance": -2008.624755859375,
"rps_doc_books_importance_length_correction": -2008.624755859375,
"rps_doc_openwebtext_importance": -1113.1187744140625,
"rps_doc_openwebtext_importance_length_correction": -1113.1187744140625,
"rps_doc_wikipedia_importance": -658.2083740234375,
"rps_doc_wikipedia_importance_length_correction": -658.2083740234375
},
"fasttext": {
"dclm": 0.07738853245973587,
"english": 0.8246480226516724,
"fineweb_edu_approx": 1.6655662059783936,
"eai_general_math": 0.7526760697364807,
"eai_open_web_math": 0.23748070001602173,
"eai_web_code": 0.5882234573364258
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "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": "4",
"label": "Advanced Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,877,573,960,775,299,000 |
Autonomous Identity 2021.8.1
Data Preparation
Once you have deployed Autonomous Identity, you can prepare your dataset into a format that meets the schema.
The initial step is to obtain the data as agreed upon between ForgeRock and your company. The files contain a subset of user attributes from the HR database and entitlement metadata required for the analysis. Only the attributes necessary for analysis are used.
There are a number of steps that must be carried out before your production entitlement data is input into Autonomous Identity. The summary of these steps are outlined below:
Data Collection
Typically, the raw client data is not in a form that meets the Autonomous Identity schema. For example, a unique user identifier can have multiple names, such as user_id, account_id, user_key, or key. Similarly, entitlement columns can have several names, such as access_point, privilege_name, or entitlement.
To get the correct format, here are some general rules:
• Submit the raw client data in .csv file format. The data can be in a single file or multiple files. Data includes application attributes, entitlement assignments, entitlements decriptions, and identities data.
• Duplicate values should be removed.
• Add optional columns for additional training attributes, for example, MANAGERS_MANAGER and MANAGER_FLAG. You can add these additional attributes to the schema using the Autonomous Identity UI. For more information, see Set Entity Definitions.
• Make a note of those attributes that differ from the Autonomous Identity schema, which is presented below. This is crucial for setting up your attribute mappings. For more information, see Set Attribute Mappings.
CSV Files and Schema
The required attributes for the schema are as follows:
CSV Files Schema
Files Schema
applications.csv
This file depends on the attributes that the client wants to include. Here are some required columns:
• app_id. Specifies the applications’s unique ID.
• app_name. Specifies the applications’s name.
• app_owner_id. Specifies the ID of the application’s owner.
assignments.csv
• user_id. Specifies the unique user ID to which the entitlement is assigned.
• ent_id. Specifies the entitlements’s unique ID.
entitlements.csv
• ent_id. Specifies the entitlements’s unique ID.
• ent_name. Specifies the entitlement name.
• ent_owner_id. Specifies the entitlement’s owner.
• app_id. Specifies the applications’s unique ID.
identities.csv
• usr_id. Specifies the user’s unique ID.
• user_name. Specifies a human readable username. For example, John Smith.
• usr_manager_id. Specifies the user’s manager ID.
Copyright © 2010-2022 ForgeRock, all rights reserved.
|
{
"url": "https://backstage.forgerock.com/docs/autonomous-identity/2021.8.1/admin-guide/chap-data-preparation.html",
"source_domain": "backstage.forgerock.com",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "24867",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VSC4DGC37RTJEKUCKTEGV6M4R4ASA6VE",
"WARC-Concurrent-To": "<urn:uuid:d8e6b4ef-2ae5-4a33-bc44-3699c9c567b4>",
"WARC-Date": "2024-09-17T11:13:39Z",
"WARC-IP-Address": "34.117.63.190",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BIV44EEMX2PLDAYUT2QC773EUAL26DYJ",
"WARC-Record-ID": "<urn:uuid:f151b7c4-ace4-479d-b2b0-d1b6a9061764>",
"WARC-Target-URI": "https://backstage.forgerock.com/docs/autonomous-identity/2021.8.1/admin-guide/chap-data-preparation.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:520ed680-3f0c-4c26-b654-6f36ba7bf4a5>"
},
"warc_info": "isPartOf: CC-MAIN-2024-38\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-192\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,
29,
30,
47,
48,
158,
159,
421,
422,
597,
598,
614,
615,
925,
926,
982,
983,
1197,
1198,
1238,
1239,
1486,
1487,
1704,
1705,
1726,
1727,
1782,
1783,
1800,
1813,
1814,
1831,
1832,
1934,
1935,
1987,
1988,
2037,
2038,
2101,
2102,
2118,
2119,
2199,
2200,
2252,
2253,
2270,
2271,
2323,
2324,
2370,
2371,
2424,
2425,
2477,
2478,
2493,
2494,
2538,
2539,
2616,
2617,
2670,
2671
],
"line_end_idx": [
29,
30,
47,
48,
158,
159,
421,
422,
597,
598,
614,
615,
925,
926,
982,
983,
1197,
1198,
1238,
1239,
1486,
1487,
1704,
1705,
1726,
1727,
1782,
1783,
1800,
1813,
1814,
1831,
1832,
1934,
1935,
1987,
1988,
2037,
2038,
2101,
2102,
2118,
2119,
2199,
2200,
2252,
2253,
2270,
2271,
2323,
2324,
2370,
2371,
2424,
2425,
2477,
2478,
2493,
2494,
2538,
2539,
2616,
2617,
2670,
2671,
2724
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2724,
"ccnet_original_nlines": 65,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3027888536453247,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027888450771570206,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21912351250648499,
"rps_doc_frac_unique_words": 0.43467336893081665,
"rps_doc_mean_word_length": 5.4321608543396,
"rps_doc_num_sentences": 52,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.682357311248779,
"rps_doc_word_count": 398,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09620721638202667,
"rps_doc_frac_chars_dupe_6grams": 0.07400555163621902,
"rps_doc_frac_chars_dupe_7grams": 0.07400555163621902,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.06105457991361618,
"rps_doc_frac_chars_top_3gram": 0.029139690101146698,
"rps_doc_frac_chars_top_4gram": 0.01480111014097929,
"rps_doc_books_importance": -221.3330841064453,
"rps_doc_books_importance_length_correction": -221.3330841064453,
"rps_doc_openwebtext_importance": -133.01608276367188,
"rps_doc_openwebtext_importance_length_correction": -133.01608276367188,
"rps_doc_wikipedia_importance": -105.82376098632812,
"rps_doc_wikipedia_importance_length_correction": -105.82376098632812
},
"fasttext": {
"dclm": 0.020384669303894043,
"english": 0.8072170615196228,
"fineweb_edu_approx": 2.6358354091644287,
"eai_general_math": 0.18743681907653809,
"eai_open_web_math": 0.16368520259857178,
"eai_web_code": 0.5201898217201233
}
}
|
{
"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": "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
|
4,842,390,449,743,408,000 |
Join us and get access to thousands of tutorials and a community of expert Pythonistas.
Unlock This Lesson
This lesson is for members only. Join us and get access to thousands of tutorials and a community of expert Pythonistas.
Unlock This Lesson
Sets
In this lesson, you’ll learn about sets. Sets are unsorted collections that allows for adding, removing, and checking membership in constant time. They do not allow duplicates. Here’s an example:
Python
>>> s = set()
>>> s.add('h')
>>> s.add('h')
>>> s.add('i')
>>> s
{'h', 'i'} # Could appear in any order
>>> set("hello")
{'e', 'h', 'l', 'o'}
If you want to learn more, check out Sets in Python.
You also heard about Big O analysis, which is a way to analyze the speed and memory usage of a function or block of code. See Wikipedia Time complexity for more information.
00:00 Let’s start this section off with a very useful data structure, the set. Sets are an unordered collection that can only contain unique values. Before I show you an example of a set, let’s look at a solution not using a set and see why sets are better.
00:15 Here’s a function count_unique() that takes in a string and counts the number of unique characters in s. So if we call count_unique() with the string "aabb", it’ll return 2, because there are two unique characters, and then if we have "abcdef" it will return 6, because are no duplicates.
00:31 Let’s solve this using a list. We will have seen_charactersor, I guess seen_c is better because it’s a shorter variable name, so you don’t have to type as much—which will be the characters that we’ve already seen in our string, and then at the very end, we’ll take the length of that. So, for c in s: if c not in seen_c: seen_c.append(c).
00:54 Then, return len(seen_c). I will run this using the built-in doctest module. This will look at the functions in the file, look at the docstring, look at the doctests, run them, and compare the output of the code that you wrote to the result, here.
01:09 If they are different, it will fail. And if they are the same, then it will return nothing. So, we run this, and it does nothing, which means our code worked.
01:19 You’ll learn about the doctest module more in-depth in a couple of videos. Let’s take a look at the Big O analysis of our code.
01:26 So, seen_c, instantiating a list, is constant time—I guess, there’s just constant time. for c in s will be O(n) time, where n is the length
01:36 of s. if c not in seen_c—okay. This is where it gets a little tricky. You might be thinking, “Okay, this is constant time,” because seen_c is always going to have a list—and we’re going to look inside that list—but you have to think about as s gets longer, does the length of seen_c get longer? Well, yes. Right here, seen_c only had 1 or 2 elements. Here, it could have up to 6.
02:00 So really, this line of code takes O(n) time, and that’s because as s grows, seen_c grows at some sort of proportion to that length.
02:10 So the final run time will be O(n * n), because you’re doing something that
02:16 takes O(n) time, O(n) times. This will be n * n, which is n squared. You can think of it like this. So, when we execute this for loop, c is the first character in s. We check
02:30 if c not in seen_c. Well, this is going to take zero calls, because seen_c is empty, so it won’t even have to loop through anything in seen_c.
02:40 Then, we go to the second character. Then, you have to loop through seen_c, compare it to the first element, check if they’re equal. Then, when we go to the second character—well, it depends.
02:50 If it’s all just the same character repeated, then you’ll still find it in seen_c, and that will only take one time. But most of the case, you’re not going to just have a string that’s all one character.
03:00 You might have a couple duplicates, then a single character, and more duplicates, or maybe the duplicates will be all spread out. And so seen_c will most likely have two elements.
03:11 Then, when you go to the fourth character, then you have to loop through seen_c, which most likely will have 3 characters already in it. Maybe it could have 2, because maybe you had found a duplicate beforehand, but either way—3 or 2, or something like that.
03:26 And then, when you get to the next character, it will be 4 or 3. And this sequence will go all the way n - 1, because once you get to the very last character, you will have to search through n - 1 values in seen_c.
03:41 So this sequence adds up to something—I’ll use, like, a curly—
03:48 something that is roughly n^2. I think it’s like (n^2 + 1) / 2, or something? But we only care about the largest polynomial, which will always be n^2.
04:00 So, sure. “Best case,” you could tell the interviewer, “Hey, best case, you have all repeated elements, so seen_c will only contain 1 character, so this will always take constant time and you’ll only take n time.
04:12 But for most cases, seen_c will be proportional to the length of s, which is n.” Okay. I know that was sort of a tangent, but it’s really important to see why we need to use sets.
04:23 So, let’s rewrite all this using a set.
04:27 Here, we’ll have seen_c—it will still be a variable that we will create, but it will be a set. So, sets are—again—an unordered collection of unique values.
04:36 So whenever any question talks about unique characters or getting rid of duplicates, your first instinct should be, “I need to use a set.”
04:44 So, let’s loop through s. if c not in seen_csame code there—seen_c.add(c), and then return len(seen_c). So let’s save it, just make sure it works. It works! So doing the Big O analysis—O(1) time, O(n) time—didn’t change.
05:08 Now, this changed. So, to check membership in a set will always be O(1) time. That is because sets are similar to dictionaries, and so they hash the value and it can check if a value exists in O(1) time.
05:21 .add() also always takes O(1) time. So, the runtime now will always be O(n), and this is no matter what our string is. I’m going to show you one way to clean this code up even further by using set comprehensions.
05:33 Set comprehensions are exactly the same as list comprehensions, but because they’re sets, it will remove duplicates. Let’s comment this out. Let’s just add some lines, so you can sort of see the difference between the two, and then return len() of a list comprehension {c for c in s}.
05:54 Cool. So, this looped through each character in s, and then added c into our set, and then took the len(). So, the runtime would still be O(n), but this is objectively much cleaner than writing five lines of code.
06:06 There’s also one more solution that takes advantage of the fact that the set constructor can take in an iterable. return len(set(s))so, s is a string, and strings are iterable, and this will convert the iterable to a set, and then take the len().
06:22 The runtime is still O(n), because this is the same as this code, except a little bit cleaner. There’s many more use cases of sets, and I’ll link a Real Python video below that will go into those details. In the next video, you’ll learn about generators, which are a great way to save memory in Python.
Avatar image for James Uejio
James Uejio RP Team on April 27, 2020
If you want to learn more, here is a Real Python walkthrough video on sets: Sets in Python
I also talk about Big-O analysis which is a way to analyze the speed and memory usage of a function or block of code. See Wikipedia Time complexity for more information.
Avatar image for drawdoowmij
drawdoowmij on May 3, 2020
Great information on Sets James – thanks!
Avatar image for Abhishek
Abhishek on May 10, 2020
Nice lesson James.
I have a question. Wouldn’t seen_c have an upper bound at 26, meaning all characters are already encountered at least once and the runtime would then be 26 * n which is essentially O(n)?
Thanks for your efforts, learning a lot!
Avatar image for James Uejio
James Uejio RP Team on June 27, 2020
Hi @Abhishek you’re absolutely right, I can’t believe I missed that. I’m so used to dealing with numbers that it slipped my mind. If you for example had a list of numbers, then it would be O(n^2) but with only letters, you’re right it would be O(n)
Avatar image for Gino Mempin
Gino Mempin on July 4, 2020
It might be good to show timeit outputs for simple examples:
In [4]: def count_unique_1(s):
...: seen_c = []
...: for c in s:
...: if c not in seen_c:
...: seen_c.append(c)
...: return len(seen_c)
In [5]: def count_unique_2(s):
...: seen_c = set()
...: for c in s:
...: if c not in seen_c:
...: seen_c.add(c)
...: return len(seen_c)
In [6]: def count_unique_3(s):
...: return len({c for c in s})
In [7]: %%timeit
...: count_unique_1("abcdef"*1000)
...:
448 µs ± 1.34 µs per loop (mean ± std. dev. of 7 runs, 1000 loops each)
In [8]: %%timeit
...: count_unique_2("abcdef"*1000)
...:
184 µs ± 1.99 µs per loop (mean ± std. dev. of 7 runs, 10000 loops each)
In [9]: %%timeit
...: count_unique_3("abcdef"*1000)
...:
139 µs ± 458 ns per loop (mean ± std. dev. of 7 runs, 10000 loops each)
Avatar image for James Uejio
James Uejio RP Team on July 11, 2020
Hi Gino, thank you for posting that great example! Hopefully people will see it.
Avatar image for nhojman
nhojman on Oct. 28, 2020
Thanks for a great tutorial James!
A short note, wouldn’t it be an even cleaner approach to write the below instead of the set comprehension?
def count_unique(s):
return len(set(s))
Avatar image for nhojman
nhojman on Oct. 28, 2020
Please excuse my previous comment - I didn’t watch the video to the end. My bad!
Avatar image for James Uejio
James Uejio RP Team on Oct. 30, 2020
No problem Nick! Glad you’re thinking ahead. Thanks for kind words :).
Avatar image for avinashk2
avinashk2 on April 11, 2021
Why above timeit comment gave slower time for set than list? I mean count unique1 is faster than count unique2.
Avatar image for James Uejio
James Uejio RP Team on April 11, 2021
@avinashk2 I believe count_unique_1 is 450 µs per loop and count_unique_2 is 184 µs per loop so count_unique_1 is slower.
Become a Member to join the conversation.
|
{
"url": "https://realpython.com/lessons/sets/",
"source_domain": "realpython.com",
"snapshot_id": "CC-MAIN-2024-26",
"warc_metadata": {
"Content-Length": "94192",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5CTNVNO3WE7FOGPCZDNZHSSQ57TYRLLY",
"WARC-Concurrent-To": "<urn:uuid:7c3195fa-57da-451c-b4cc-61551ea8a24d>",
"WARC-Date": "2024-06-16T08:09:43Z",
"WARC-IP-Address": "104.22.17.171",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SOLANFN4IDSE2GRQPOFEZ7QCXM3B3XBC",
"WARC-Record-ID": "<urn:uuid:5bddcf8e-c588-4f50-8d13-20f9daaa5a65>",
"WARC-Target-URI": "https://realpython.com/lessons/sets/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:83a66f5e-462b-46b7-b1bc-ce83a6c3f970>"
},
"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-246\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,
88,
89,
108,
109,
230,
231,
250,
251,
256,
257,
453,
454,
461,
475,
490,
505,
520,
526,
565,
582,
603,
604,
657,
658,
832,
833,
1091,
1092,
1387,
1388,
1733,
1734,
1988,
1989,
2154,
2155,
2289,
2290,
2436,
2437,
2823,
2824,
2963,
2964,
3046,
3047,
3228,
3229,
3378,
3379,
3577,
3578,
3788,
3789,
3975,
3976,
4241,
4242,
4463,
4464,
4533,
4534,
4691,
4692,
4911,
4912,
5098,
5099,
5145,
5146,
5308,
5309,
5454,
5455,
5682,
5683,
5893,
5894,
6113,
6114,
6405,
6406,
6626,
6627,
6880,
6881,
7190,
7191,
7220,
7221,
7259,
7260,
7351,
7352,
7522,
7523,
7552,
7553,
7580,
7581,
7623,
7624,
7650,
7651,
7676,
7677,
7696,
7697,
7884,
7885,
7926,
7927,
7956,
7957,
7994,
7995,
8244,
8245,
8274,
8275,
8303,
8304,
8365,
8366,
8398,
8423,
8448,
8485,
8523,
8555,
8556,
8588,
8616,
8641,
8678,
8713,
8745,
8746,
8778,
8818,
8819,
8837,
8876,
8886,
8958,
8959,
8977,
9016,
9026,
9099,
9100,
9118,
9157,
9202,
9274,
9303,
9304,
9341,
9342,
9423,
9424,
9449,
9450,
9475,
9476,
9511,
9512,
9619,
9620,
9641,
9664,
9689,
9690,
9715,
9716,
9797,
9798,
9827,
9828,
9865,
9866,
9937,
9938,
9965,
9966,
9994,
9995,
10107,
10108,
10137,
10138,
10176,
10177,
10299,
10300
],
"line_end_idx": [
88,
89,
108,
109,
230,
231,
250,
251,
256,
257,
453,
454,
461,
475,
490,
505,
520,
526,
565,
582,
603,
604,
657,
658,
832,
833,
1091,
1092,
1387,
1388,
1733,
1734,
1988,
1989,
2154,
2155,
2289,
2290,
2436,
2437,
2823,
2824,
2963,
2964,
3046,
3047,
3228,
3229,
3378,
3379,
3577,
3578,
3788,
3789,
3975,
3976,
4241,
4242,
4463,
4464,
4533,
4534,
4691,
4692,
4911,
4912,
5098,
5099,
5145,
5146,
5308,
5309,
5454,
5455,
5682,
5683,
5893,
5894,
6113,
6114,
6405,
6406,
6626,
6627,
6880,
6881,
7190,
7191,
7220,
7221,
7259,
7260,
7351,
7352,
7522,
7523,
7552,
7553,
7580,
7581,
7623,
7624,
7650,
7651,
7676,
7677,
7696,
7697,
7884,
7885,
7926,
7927,
7956,
7957,
7994,
7995,
8244,
8245,
8274,
8275,
8303,
8304,
8365,
8366,
8398,
8423,
8448,
8485,
8523,
8555,
8556,
8588,
8616,
8641,
8678,
8713,
8745,
8746,
8778,
8818,
8819,
8837,
8876,
8886,
8958,
8959,
8977,
9016,
9026,
9099,
9100,
9118,
9157,
9202,
9274,
9303,
9304,
9341,
9342,
9423,
9424,
9449,
9450,
9475,
9476,
9511,
9512,
9619,
9620,
9641,
9664,
9689,
9690,
9715,
9716,
9797,
9798,
9827,
9828,
9865,
9866,
9937,
9938,
9965,
9966,
9994,
9995,
10107,
10108,
10137,
10138,
10176,
10177,
10299,
10300,
10341
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10341,
"ccnet_original_nlines": 195,
"rps_doc_curly_bracket": 0.0007736199768260121,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.418967604637146,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01760704070329666,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2713085114955902,
"rps_doc_frac_unique_words": 0.2917127013206482,
"rps_doc_mean_word_length": 4.18729305267334,
"rps_doc_num_sentences": 143,
"rps_doc_symbol_to_word_ratio": 0.0072028799913823605,
"rps_doc_unigram_entropy": 5.54618501663208,
"rps_doc_word_count": 1810,
"rps_doc_frac_chars_dupe_10grams": 0.10595065355300903,
"rps_doc_frac_chars_dupe_5grams": 0.14223511517047882,
"rps_doc_frac_chars_dupe_6grams": 0.13418656587600708,
"rps_doc_frac_chars_dupe_7grams": 0.12890882790088654,
"rps_doc_frac_chars_dupe_8grams": 0.12890882790088654,
"rps_doc_frac_chars_dupe_9grams": 0.11888112127780914,
"rps_doc_frac_chars_top_2gram": 0.015965169295668602,
"rps_doc_frac_chars_top_3gram": 0.020319299772381783,
"rps_doc_frac_chars_top_4gram": 0.0055416300892829895,
"rps_doc_books_importance": -788.4737548828125,
"rps_doc_books_importance_length_correction": -788.4737548828125,
"rps_doc_openwebtext_importance": -515.6788940429688,
"rps_doc_openwebtext_importance_length_correction": -515.6788940429688,
"rps_doc_wikipedia_importance": -265.9822082519531,
"rps_doc_wikipedia_importance_length_correction": -265.9822082519531
},
"fasttext": {
"dclm": 0.07201653718948364,
"english": 0.8990530967712402,
"fineweb_edu_approx": 1.8556652069091797,
"eai_general_math": 0.8853320479393005,
"eai_open_web_math": 0.3495824337005615,
"eai_web_code": 0.4662996530532837
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,509,183,985,831,042,600 |
Resultados da pesquisa a pedido "scala-cats"
1 a resposta
Como usar o Scala Cats Validated da maneira correta?
A seguir é o meu caso de uso Estou usandoGato [https://typelevel.org/cats/] para validação da minha configuração. Meu arquivo de configuração está em json.Serialize meu arquivo de configuração para minha classe de casoConfig usando ...
1 a resposta
Maneira simples de aplicar uma lista de funções a um valor
Suponha que eu tenha uma lista de funçõesList[A => B] e precisa de uma função que retorneList[B] para um determinado valor do tipoA: def foo[A, B](fs: List[A => B]): A => List[B] = a => fs.map(_.apply(a))Existe algum mais simples (talvez ...
1 a resposta
Doobie e DB acessam a composição em uma transação
Livro Doobie [https://tpolecat.github.io/doobie/docs/17-FAQ.html#how-do-i-do-several-things-in-the-same-transaction] diz que é uma boa prática retornar o ConnectionIO da sua camada de repositório. Ele oferece a capacidade de encadear chamadas e ...
1 a resposta
Como sequenciar com gatos Scala sem um alias de tipo (consulte Pastando gatos)
eu estava lendoPastoreio de gatos [http://eed3si9n.com/herding-cats/Traverse.html] O exemplo final noPágina transversal [http://eed3si9n.com/herding-cats/Traverse.html]no seqüenciamento Lista de qualquer um falhou para mim. no exemplo, eles ...
2 a resposta
Limites para o parâmetro de tipo de FunctionK
estou a usarcats FreeMonad [https://typelevel.org/cats/datatypes/freemonad.html] . Aqui está uma versão simplificada da álgebra: sealed trait Op[A] object Op { final case class Get[T](name: String) extends Op[T] type OpF[A] = Free[Op, A] def ...
1 a resposta
Falsos erros ao usar a biblioteca de gatos no IntelliJ
Estou usando a biblioteca Scala de gatos e o IntelliJ IDE parece estar lutando com o uso de implícitos: Aqui está um exemplo simples: import cats.std.all._ import cats.Traverse.ops._ def useSequence[A](ls : List[Option[A]]) : Option[List[A]] = ...
1 a resposta
Efeitos Scala Cats - IO Async Shift - Como funciona?
Aqui estão alguns códigos de gatos Scala usando oIO Monad [https://github.com/typelevel/cats-effect]: import java.util.concurrent.{ExecutorService, Executors} import cats.effect.IO import scala.concurrent.{ExecutionContext, ...
|
{
"url": "https://techfeed.net/pt/tag/scala-cats/",
"source_domain": "techfeed.net",
"snapshot_id": "crawl=CC-MAIN-2021-25",
"warc_metadata": {
"Content-Length": "40661",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PWKWCDKDLX3HJYXNFMZKHSEL4N3OOIUK",
"WARC-Concurrent-To": "<urn:uuid:e6639167-edae-4620-ab4b-d932a18e96a1>",
"WARC-Date": "2021-06-21T01:57:30Z",
"WARC-IP-Address": "172.67.223.203",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XV6ZIOG5TAA6JTAKISBKLK56DPXP7MLF",
"WARC-Record-ID": "<urn:uuid:fb95d3ac-e11a-423f-a1ae-c26ac94cefb5>",
"WARC-Target-URI": "https://techfeed.net/pt/tag/scala-cats/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:06826e77-11e1-459a-ad8a-3ed03587c492>"
},
"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-98.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,
45,
46,
59,
60,
113,
114,
350,
351,
364,
365,
424,
425,
667,
668,
681,
682,
732,
733,
982,
983,
996,
997,
1076,
1077,
1322,
1323,
1336,
1337,
1383,
1384,
1630,
1631,
1644,
1645,
1700,
1701,
1949,
1950,
1963,
1964,
2017,
2018
],
"line_end_idx": [
45,
46,
59,
60,
113,
114,
350,
351,
364,
365,
424,
425,
667,
668,
681,
682,
732,
733,
982,
983,
996,
997,
1076,
1077,
1322,
1323,
1336,
1337,
1383,
1384,
1630,
1631,
1644,
1645,
1700,
1701,
1949,
1950,
1963,
1964,
2017,
2018,
2245
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2245,
"ccnet_original_nlines": 42,
"rps_doc_curly_bracket": 0.0017817399930208921,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.0923076868057251,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.046153850853443146,
"rps_doc_frac_lines_end_with_ellipsis": 0.1627907007932663,
"rps_doc_frac_no_alph_words": 0.3076923191547394,
"rps_doc_frac_unique_words": 0.5586206912994385,
"rps_doc_mean_word_length": 6.051723957061768,
"rps_doc_num_sentences": 40,
"rps_doc_symbol_to_word_ratio": 0.015384620055556297,
"rps_doc_unigram_entropy": 4.704366207122803,
"rps_doc_word_count": 290,
"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.03589744120836258,
"rps_doc_frac_chars_top_3gram": 0.034188028424978256,
"rps_doc_frac_chars_top_4gram": 0.01595441997051239,
"rps_doc_books_importance": -247.3147430419922,
"rps_doc_books_importance_length_correction": -247.3147430419922,
"rps_doc_openwebtext_importance": -135.90792846679688,
"rps_doc_openwebtext_importance_length_correction": -135.90792846679688,
"rps_doc_wikipedia_importance": -120.64273071289062,
"rps_doc_wikipedia_importance_length_correction": -120.64273071289062
},
"fasttext": {
"dclm": 0.4335249662399292,
"english": 0.027454329654574394,
"fineweb_edu_approx": 1.4035037755966187,
"eai_general_math": 0.0010963099775835872,
"eai_open_web_math": 0.17855316400527954,
"eai_web_code": 0.7827972769737244
}
}
|
{
"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": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "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
|
863,722,131,327,161,300 |
summaryrefslogtreecommitdiffstats
path: root/xlators/cluster
Commit message (Expand)AuthorAgeFilesLines
...
* cluster/ec: fix EIO error for concurrent writes on sparse filesXavi Hernandez2019-07-241-9/+17
* (multiple files) use dict_allocate_and_serialize() where applicable.Yaniv Kaul2019-07-222-41/+9
* dht: log getxattr failure for node-uuid at "DEBUG"Susant Palai2019-07-181-2/+5
* cluster/ec: skip updating ctx->loc again when ec_fix_open/opendirKinglong Mee2019-07-172-10/+14
* cluster/ec: inherit healing from lock when it has infoKinglong Mee2019-07-161-2/+3
* dht-common.h: reorder variables to reduce padding.Yaniv Kaul2019-07-151-73/+81
* Fix spelling errorsAravinda VK2019-07-141-1/+1
* cluster/ta: Notify the clients only if there are pending healskarthik-us2019-07-124-22/+69
* cluster/afr: Fix incorrect reporting of gfid & type mismatchkarthik-us2019-07-122-2/+23
* cluster/dht: Fixed a memleak in dht_rename_cbkN Balachandran2019-07-021-11/+33
* [RFC] change get_real_filename implementation to use ENOATTR instead of ENOENTMichael Adam2019-06-261-4/+4
* cluster/ec: Prevent double pre-op xattropsPranith Kumar K2019-06-221-6/+7
* ec-heal: check file's gfid when deleting stale nameKinglong Mee2019-06-201-1/+11
* afr/read: Implement latency based read child selectionMohammed Rafi KC2019-06-203-27/+98
* cluster/dht: Strip out dht xattrsN Balachandran2019-06-191-0/+2
* afr/fini: Free local_pool data during an afr finiMohammed Rafi KC2019-06-171-0/+6
* clang-scan: resolve warningAmar Tumballi2019-06-151-4/+0
* multiple files: another attempt to remove includesYaniv Kaul2019-06-1431-95/+7
* Cluster/afr: Don't treat all bricks having metadata pending as split-brainkarthik-us2019-06-102-3/+3
* ec/fini: Fix race between xlator cleanup and on going async fopMohammed Rafi KC2019-06-086-15/+56
* cluster/dht: Fix directory perms during selfhealN Balachandran2019-06-051-3/+5
* Fix some "Null pointer dereference" coverity issuesXavi Hernandez2019-05-262-0/+13
* cluster/ec: honor contention notifications for partially acquired locksXavi Hernandez2019-05-251-1/+1
* cluster/dht: Lookup all files when processing directoryN Balachandran2019-05-231-6/+6
* ec/fini: Fix race with ec_fini and ec_notifyMohammed Rafi KC2019-05-213-0/+13
* afr/frame: Destroy frame after afr_selfheal_entry_granularMohammed Rafi KC2019-05-211-3/+8
* ec/shd: Cleanup self heal daemon resources during ec finiMohammed Rafi KC2019-05-135-13/+122
* afr: thin-arbiter lock release fixesRavishankar N2019-05-103-47/+93
* afr: log before attempting data self-heal.Ravishankar N2019-05-081-0/+3
* dht: Custom xattrs are not healed in case of add-brickroot2019-05-081-8/+1
* afr : fix Coverity CID 1398627Rinku Kothiya2019-05-071-2/+9
* cluster/ec: fix shd healer wait timeoutKinglong Mee2019-05-062-1/+2
* cluster/ec: Reopen shouldn't happen with O_TRUNCPranith Kumar K2019-05-051-1/+1
* cluster/dht: Refactor dht lookup functionsN Balachandran2019-04-251-74/+30
* cluster/ec: fix fd reopenXavi Hernandez2019-04-2314-274/+328
* cluster/afr: Set lk-owner before inodelk/entrylk/lkPranith Kumar K2019-04-222-19/+23
* cluster/afr: Remove local from owners_list on failure of lock-acquisitionPranith Kumar K2019-04-154-18/+14
* Replace memdup() with gf_memdup()Vijay Bellur2019-04-121-1/+1
* ec: fix truncate lock to cover the write in tuncate cleanKinglong Mee2019-04-121-2/+6
* cluster/afr: Thin-arbiter SHD fixeskarthik-us2019-04-122-13/+13
* cluster/dht: refactor dht lookup functionsN Balachandran2019-04-052-124/+119
* cluster/afr: Invalidate inode on change of split-brain-choicePranith Kumar K2019-04-051-4/+1
* cluster/ec: Fix handling of heal info cases without locksAshish Pandey2019-04-041-25/+17
* cluster/afr: Send inodelk/entrylk with non-zero lk-ownerPranith Kumar K2019-04-022-12/+48
* afr: thin-arbiter read txn fixesRavishankar N2019-03-293-22/+37
* cluster/ec: Don't enqueue an entry if it is already healingAshish Pandey2019-03-275-30/+127
* afr: add client-pid to all gf_event() callsRavishankar N2019-03-276-15/+28
* cluster/afr: Remove un-used variables related to pumpPranith Kumar K2019-03-261-3/+0
* cluster/afr : TA: Return actual error code in case of failureAshish Pandey2019-03-141-6/+6
* dht: NULL check before setting error flagMohammed Rafi KC2019-03-121-1/+2
|
{
"url": "http://git.gluster.org/cgit/glusterfs.git/log/xlators/cluster?id=7dc4122b84c93cfa6355002fa651a806706e4990&ofs=50",
"source_domain": "git.gluster.org",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "25671",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:I2BDJFYVFW27LFRXC4CGL4QROVQQ43F5",
"WARC-Concurrent-To": "<urn:uuid:a05a33d6-fe67-4940-8463-92104333c2a1>",
"WARC-Date": "2021-12-03T13:19:21Z",
"WARC-IP-Address": "8.43.85.171",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PSJEXZCKGGODEHIZQDQU7FBFXLAWQOUA",
"WARC-Record-ID": "<urn:uuid:4b85a406-d7a9-4c0c-a6de-c7e3ec80f65f>",
"WARC-Target-URI": "http://git.gluster.org/cgit/glusterfs.git/log/xlators/cluster?id=7dc4122b84c93cfa6355002fa651a806706e4990&ofs=50",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6ef94279-e9c1-4ef4-bd11-40d06df5a331>"
},
"warc_info": "isPartOf: CC-MAIN-2021-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-235\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
34,
61,
104,
108,
205,
303,
384,
482,
567,
648,
697,
790,
880,
961,
1070,
1146,
1229,
1320,
1386,
1470,
1529,
1610,
1713,
1813,
1894,
1979,
2083,
2171,
2251,
2344,
2439,
2509,
2583,
2660,
2722,
2792,
2874,
2951,
3014,
3101,
3210,
3274,
3362,
3428,
3507,
3602,
3693,
3785,
3851,
3945,
4022,
4109,
4202
],
"line_end_idx": [
34,
61,
104,
108,
205,
303,
384,
482,
567,
648,
697,
790,
880,
961,
1070,
1146,
1229,
1320,
1386,
1470,
1529,
1610,
1713,
1813,
1894,
1979,
2083,
2171,
2251,
2344,
2439,
2509,
2583,
2660,
2722,
2792,
2874,
2951,
3014,
3101,
3210,
3274,
3362,
3428,
3507,
3602,
3693,
3785,
3851,
3945,
4022,
4109,
4202,
4277
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4277,
"ccnet_original_nlines": 53,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08224298804998398,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025233639404177666,
"rps_doc_frac_lines_end_with_ellipsis": 0.018518520519137383,
"rps_doc_frac_no_alph_words": 0.5448598265647888,
"rps_doc_frac_unique_words": 0.6811594367027283,
"rps_doc_mean_word_length": 8.094202995300293,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0.000934579991735518,
"rps_doc_unigram_entropy": 5.397495269775391,
"rps_doc_word_count": 414,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.022082960233092308,
"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.01432408019900322,
"rps_doc_frac_chars_top_3gram": 0.0077588800340890884,
"rps_doc_frac_chars_top_4gram": 0.01611459068953991,
"rps_doc_books_importance": -618.5241088867188,
"rps_doc_books_importance_length_correction": -618.5241088867188,
"rps_doc_openwebtext_importance": -314.93145751953125,
"rps_doc_openwebtext_importance_length_correction": -314.93145751953125,
"rps_doc_wikipedia_importance": -264.1686096191406,
"rps_doc_wikipedia_importance_length_correction": -264.1686096191406
},
"fasttext": {
"dclm": 0.8534355163574219,
"english": 0.5189356803894043,
"fineweb_edu_approx": 0.8864333033561707,
"eai_general_math": 0.11991614103317261,
"eai_open_web_math": 0.12858092784881592,
"eai_web_code": 0.9901957511901855
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "5",
"label": "Indeterminate"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,443,736,929,801,849,600 |
What Is Dynamic Data Structure of Assembler?
//
Angela Bailey
What Is Dynamic Data Structure of Assembler?
Assembler is a low-level programming language that directly interacts with the hardware of a computer. It is used to write programs that can be executed by the computer’s processor. Assembler programs are written using mnemonic codes that represent specific machine instructions.
In assembler programming, data structures play a crucial role in organizing and manipulating data efficiently. One type of data structure commonly used in assembler is the dynamic data structure.
Understanding Dynamic Data Structure
A dynamic data structure is a type of data structure whose size can change dynamically during program execution. Unlike static data structures, which have a fixed size determined at compile time, dynamic data structures can grow or shrink as needed.
Dynamic data structures are particularly useful when dealing with situations where the amount of data to be stored is unknown beforehand or may change over time. They provide flexibility and efficient memory utilization.
Advantages of Dynamic Data Structure
• Efficient Memory Allocation: Dynamic data structures allocate memory dynamically, allowing for efficient memory utilization. Memory is allocated only when needed, reducing wastage.
• Flexible Size: Dynamic data structures can grow or shrink as required, making them suitable for scenarios where the amount of data varies or is uncertain.
• Ease of Insertion and Deletion: With dynamic data structures, inserting or deleting elements can be done seamlessly without requiring extensive reshuffling of existing elements.
Common Dynamic Data Structures in Assembler
Assembler supports various dynamic data structures that are commonly used in programming. Some popular examples include:
• Linked Lists: Linked lists are a collection of elements, each containing a value and a reference to the next element. They provide efficient insertion and deletion at any position.
• Stacks: Stacks follow the Last-In-First-Out (LIFO) principle.
They allow easy insertion and removal of elements from one end (top) of the stack.
• Queues: Queues follow the First-In-First-Out (FIFO) principle. They allow easy insertion at one end (rear) and removal at the other end (front) of the queue.
• Trees: Trees are hierarchical data structures with a root node and child nodes. They enable efficient searching, insertion, and deletion operations.
Conclusion
The dynamic data structure in assembler programming provides flexibility, efficient memory utilization, and ease of manipulation for varying or uncertain amounts of data. By understanding and utilizing dynamic data structures effectively, programmers can optimize their assembler programs for better performance.
In conclusion, dynamic data structures are an essential component of assembler programming that allows for efficient organization and manipulation of data during program execution.
Discord Server - Web Server - Private Server - DNS Server - Object-Oriented Programming - Scripting - Data Types - Data Structures
Privacy Policy
|
{
"url": "https://serverlogic3.com/what-is-dynamic-data-structure-of-assembler/",
"source_domain": "serverlogic3.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "73947",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JYRCCGUD2BOCGFGWKYIDT5IXQRV2KQNT",
"WARC-Concurrent-To": "<urn:uuid:c7c09a68-12ae-410f-a179-e1623d3c87b8>",
"WARC-Date": "2024-04-20T04:01:46Z",
"WARC-IP-Address": "143.244.183.16",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XS2GZMNS4UFZQVTPAEUCD5FJEX7XPDUU",
"WARC-Record-ID": "<urn:uuid:c3f95d5f-5cdb-4e00-94e0-373205f9a1f6>",
"WARC-Target-URI": "https://serverlogic3.com/what-is-dynamic-data-structure-of-assembler/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:795233f8-f27f-4ffe-a508-8e2fb5d32e40>"
},
"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-159\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
45,
46,
49,
50,
64,
65,
110,
111,
391,
392,
588,
589,
626,
627,
877,
878,
1099,
1100,
1137,
1138,
1323,
1482,
1664,
1665,
1709,
1710,
1831,
1832,
2017,
2083,
2084,
2171,
2172,
2334,
2487,
2488,
2499,
2500,
2813,
2814,
2995,
2996,
3127,
3128
],
"line_end_idx": [
45,
46,
49,
50,
64,
65,
110,
111,
391,
392,
588,
589,
626,
627,
877,
878,
1099,
1100,
1137,
1138,
1323,
1482,
1664,
1665,
1709,
1710,
1831,
1832,
2017,
2083,
2084,
2171,
2172,
2334,
2487,
2488,
2499,
2500,
2813,
2814,
2995,
2996,
3127,
3128,
3142
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3142,
"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.2744360864162445,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.007518799975514412,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1560150384902954,
"rps_doc_frac_unique_words": 0.4384787380695343,
"rps_doc_mean_word_length": 5.758389472961426,
"rps_doc_num_sentences": 28,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.76607608795166,
"rps_doc_word_count": 447,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0979020968079567,
"rps_doc_frac_chars_dupe_6grams": 0.05827505886554718,
"rps_doc_frac_chars_dupe_7grams": 0.05827505886554718,
"rps_doc_frac_chars_dupe_8grams": 0.029526030644774437,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.0683760717511177,
"rps_doc_frac_chars_top_3gram": 0.07342656701803207,
"rps_doc_frac_chars_top_4gram": 0.013209009543061256,
"rps_doc_books_importance": -197.6752166748047,
"rps_doc_books_importance_length_correction": -197.6752166748047,
"rps_doc_openwebtext_importance": -106.02869415283203,
"rps_doc_openwebtext_importance_length_correction": -106.02869415283203,
"rps_doc_wikipedia_importance": -98.12728881835938,
"rps_doc_wikipedia_importance_length_correction": -98.12728881835938
},
"fasttext": {
"dclm": 0.434303343296051,
"english": 0.8758416175842285,
"fineweb_edu_approx": 3.4175758361816406,
"eai_general_math": 0.7390127778053284,
"eai_open_web_math": 0.2345011830329895,
"eai_web_code": 0.8997200727462769
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
1,418,561,533,160,436,500 |
Digital Picture Exchange
From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Digital Picture Exchange
Filename extension .dpx
Developed by SMPTE
Initial release 1.0 / 18 February 1994; 24 years ago (1994-02-18)
Latest release
2.0
(2003; 15 years ago (2003))
Type of format Image file formats
Extended from Cineon
Standard ST 268:2003[1]
Open format? non-free SMPTE standard, 17 pages, USD 120
Website www.smpte.org
Digital Picture Exchange (DPX) is a common file format for digital intermediate and visual effects work and is an ANSI/SMPTE standard (268M-2003).[2] The file format is most commonly used to represent the density of each colour channel of a scanned negative film in an uncompressed "logarithmic" image where the gamma of the original camera negative is preserved as taken by a film scanner. For this reason, DPX is the worldwide-chosen format for still frames storage in most Digital Intermediate post-production facilities and film labs. Other common video formats are supported as well (see below), from video to purely digital ones, making DPX a file format suitable for almost any raster digital imaging applications. DPX provides, in fact, a great deal of flexibility in storing colour information, colour spaces and colour planes for exchange between production facilities. Multiple forms of packing and alignment are possible. The DPX Specification allows for a wide variety of metadata to further clarify information stored (and storable) within each file.
The DPX file format was originally derived from the Kodak Cineon open file format (.cin file extension) used for digital images generated by Kodak's original film scanner. The original DPX (version 1.0) specifications are part of SMPTE 268M-1994.[3] The specification was later improved and its latest version (2.0) is published by SMPTE as ANSI/SMPTE 268M-2003.
Metadata and Standard Flexibility[edit]
SMPTE Specifications dictate a mild number of compulsory metadata, like image resolution, color space details (channel depth, colorimetric metric, etc.), number of planes/subimages, as well as original filename and creation date/time, creator's name, project name, copyright information, and so on.
Furthermore, a couple of industry-specific metadata areas are present: Motion-Picture and Television ones. They are either used only if the picture has enough embedded information relevant to that specific industry, otherwise are left "empty". For example, Motion-Picture-specific metadata include perforation-exact film KeyKode (if the image comes from a film scan), camera shutter angle, slate information and frame positioning within a frame sequence. On the other side, Television metadata include full SMPTE time code, video overscan and field information, and signal/colour level information.
At last, a third, variable-size metadata area, which is user-definable, exists. Third-party applications/software occasionally use this area to store additional information; for example, when the DPX stores images with technical specifications far away from the original standard (like pictures coded in the CIE XYZ color space, or Bayer-patterned raw frames from specific digital cameras like the Arriflex D-21).
Support[edit]
XnView can read FFmpeg pix_fmt=abgr DPX images. ImageMagick supports DPX.[4] The C++ source of a DPX library is available.[5] DjV[6] and vooya[7] support DPX sequences.
See also[edit]
References[edit]
1. ^ "ST 268:2003 For File Format for Digital Moving-Picture Exchange (DPX), Version 2.0". SMPTE. doi:10.5594/S9781614824152. ISBN 978-1-61482-415-2. (Subscription required (help)).
2. ^ James D. Murray; William vanRyper (April 1996). "Encyclopedia of Graphics File Formats" (Second ed.). O'Reilly. ISBN 1-56592-161-5. Retrieved 2014-02-27.
3. ^ "Cineon Image File Format Draft". Cineon. Retrieved 2014-03-01.
4. ^ "ImageMagick Motion Picture Formats". ImageMagick. Retrieved 2014-03-01.
5. ^ SMPTE DPX v2 Image Format reader/writer C++ library (2009)
6. ^ DJV Imaging
7. ^ vooya raw sequence player
|
{
"url": "https://wikivisually.com/wiki/Digital_Picture_Exchange",
"source_domain": "wikivisually.com",
"snapshot_id": "crawl=CC-MAIN-2018-43",
"warc_metadata": {
"Content-Length": "144239",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:42V5OSWBHBNNXSNEQ7WBSQCTPROTSZMG",
"WARC-Concurrent-To": "<urn:uuid:e5299057-ac1b-4741-986f-df9a818ec33d>",
"WARC-Date": "2018-10-24T00:45:04Z",
"WARC-IP-Address": "54.68.64.217",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XLOH5LHOEB3FZ3RWCKTBO3HQRP7JW7HG",
"WARC-Record-ID": "<urn:uuid:2900eef2-a4ae-4b2a-9464-4b2e053dc68a>",
"WARC-Target-URI": "https://wikivisually.com/wiki/Digital_Picture_Exchange",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:867be523-ae3b-45ef-9fce-6ea9c5f82e8b>"
},
"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-164-201-98.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,
25,
26,
64,
98,
123,
147,
166,
232,
247,
251,
279,
313,
334,
358,
414,
436,
437,
1502,
1503,
1866,
1867,
1907,
1908,
2207,
2208,
2807,
2808,
3222,
3223,
3237,
3238,
3407,
3408,
3423,
3424,
3441,
3442,
3627,
3789,
3861,
3942,
4008,
4027
],
"line_end_idx": [
25,
26,
64,
98,
123,
147,
166,
232,
247,
251,
279,
313,
334,
358,
414,
436,
437,
1502,
1503,
1866,
1867,
1907,
1908,
2207,
2208,
2807,
2808,
3222,
3223,
3237,
3238,
3407,
3408,
3423,
3424,
3441,
3442,
3627,
3789,
3861,
3942,
4008,
4027,
4059
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4059,
"ccnet_original_nlines": 43,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.20332936942577362,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05112960934638977,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.31985729932785034,
"rps_doc_frac_unique_words": 0.5341506004333496,
"rps_doc_mean_word_length": 5.6427321434021,
"rps_doc_num_sentences": 58,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.309418678283691,
"rps_doc_word_count": 571,
"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.021725639700889587,
"rps_doc_frac_chars_top_3gram": 0.02048416994512081,
"rps_doc_frac_chars_top_4gram": 0.012414650060236454,
"rps_doc_books_importance": -415.71282958984375,
"rps_doc_books_importance_length_correction": -415.71282958984375,
"rps_doc_openwebtext_importance": -248.28199768066406,
"rps_doc_openwebtext_importance_length_correction": -248.28199768066406,
"rps_doc_wikipedia_importance": -220.3073272705078,
"rps_doc_wikipedia_importance_length_correction": -220.3073272705078
},
"fasttext": {
"dclm": 0.08165228366851807,
"english": 0.767298698425293,
"fineweb_edu_approx": 2.5077261924743652,
"eai_general_math": 0.05815654993057251,
"eai_open_web_math": 0.14771437644958496,
"eai_web_code": 0.014871950261294842
}
}
|
{
"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": "778.92",
"labels": {
"level_1": "Arts",
"level_2": "Photography",
"level_3": "Cinematography"
}
}
},
"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": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,770,563,204,424,871,000 |
Export (0) Print
Expand All
SpriteFont Class
Represents a font texture.
Namespace: Microsoft.Xna.Framework.Graphics
Assembly: Microsoft.Xna.Framework (in microsoft.xna.framework.dll)
public sealed class SpriteFont
To load a SpriteFont, click Sprite Font on the Add New Item menu. This adds an XML file to your project describing how to build a texture map for your font. At build time, XNA Game Studio creates a texture with the image of the characters of the font you specify, with the specified font point size.
At run time, load the font using ContentManager.Load, and pass it to SpriteBatch.DrawString when drawing text.
Bb464165.note(en-US,XNAGameStudio.20).gifNote
As with most types of software, font files are licensed rather than sold. Font licenses vary from vendor to vendor, but most don't allow redistribution of the fonts, and that includes redistribution of reproductions such as bitmaps containing the rasterized character set. This is even true of many of the licenses covering fonts that Microsoft supplies with applications and Windows. Be careful, therefore, to ensure that you have the required license rights to redistribute any font you include as a bitmap containing the rasterized character set in your game!
Xbox 360, Windows XP SP2, Windows Vista
Community Additions
ADD
Show:
© 2015 Microsoft
|
{
"url": "https://msdn.microsoft.com/en-us/library/microsoft.xna.framework.graphics.spritefont(v=xnagamestudio.20).aspx",
"source_domain": "msdn.microsoft.com",
"snapshot_id": "crawl=CC-MAIN-2015-11",
"warc_metadata": {
"Content-Length": "47656",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JWDUTC4Y5SHLTQBVRQ73EQXZKIF32ARJ",
"WARC-Concurrent-To": "<urn:uuid:f4afac91-17fe-4eeb-9bb0-ec584b8a10ae>",
"WARC-Date": "2015-03-05T03:20:55Z",
"WARC-IP-Address": "157.56.148.19",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:NS4SAHIDUGICJ3S6ZOZ7H42JT5E3MX35",
"WARC-Record-ID": "<urn:uuid:4dd4b2b4-6b04-48b1-b0b7-7ebff773b8a6>",
"WARC-Target-URI": "https://msdn.microsoft.com/en-us/library/microsoft.xna.framework.graphics.spritefont(v=xnagamestudio.20).aspx",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a780fe05-ff4f-4615-9827-0015c01de9ca>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-28-5-156.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-11\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for February 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
17,
28,
29,
46,
47,
74,
75,
119,
186,
187,
218,
219,
519,
520,
631,
632,
678,
1241,
1242,
1282,
1283,
1303,
1304,
1308,
1314
],
"line_end_idx": [
17,
28,
29,
46,
47,
74,
75,
119,
186,
187,
218,
219,
519,
520,
631,
632,
678,
1241,
1242,
1282,
1283,
1303,
1304,
1308,
1314,
1330
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1330,
"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.29230770468711853,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023076919838786125,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19230769574642181,
"rps_doc_frac_unique_words": 0.6363636255264282,
"rps_doc_mean_word_length": 5.439393997192383,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.582745552062988,
"rps_doc_word_count": 198,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06499536335468292,
"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.018570100888609886,
"rps_doc_frac_chars_top_3gram": 0.04271123185753822,
"rps_doc_frac_chars_top_4gram": 0.05942432954907417,
"rps_doc_books_importance": -130.6141815185547,
"rps_doc_books_importance_length_correction": -130.6141815185547,
"rps_doc_openwebtext_importance": -87.66455841064453,
"rps_doc_openwebtext_importance_length_correction": -87.66455841064453,
"rps_doc_wikipedia_importance": -83.8515396118164,
"rps_doc_wikipedia_importance_length_correction": -83.85037994384766
},
"fasttext": {
"dclm": 0.03136610984802246,
"english": 0.8073129653930664,
"fineweb_edu_approx": 2.372908592224121,
"eai_general_math": 0.13710564374923706,
"eai_open_web_math": 0.1490526795387268,
"eai_web_code": 0.04795128107070923
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-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": "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,522,062,631,055,110,700 |
Class: NamespacesController
Inherits:
ApplicationController show all
Includes:
DataControllerConfiguration::SharedDataControllerConfiguration
Defined in:
app/controllers/namespaces_controller.rb
Instance Method Summary collapse
Methods included from DataControllerConfiguration::SharedDataControllerConfiguration
#set_is_shared_data_model
Methods included from RequestType
#json_request?
Methods included from LogRecent
#log_user_recent_route
Methods included from Cookies
#digest_cookie, #digested_cookie_exists?
Methods included from Whitelist
#whitelist_constantize
Methods included from ProjectsHelper
#invalid_object, #project_link, #project_matches, #project_tag, #projects_list, #projects_search_form
Methods included from Api::Intercept
#intercept_api
Methods included from TokenAuthentication
#intercept_project, #intercept_user, #intercept_user_or_project, #project_token_authenticate, #token_authenticate
Instance Method Details
#autocompleteObject
79
80
81
# File 'app/controllers/namespaces_controller.rb', line 79
def autocomplete
@namespaces = Queries::Namespace::Autocomplete.new(params.require(:term)).all
end
#batch_loadObject
93
94
# File 'app/controllers/namespaces_controller.rb', line 93
def batch_load
end
#batch_paramsObject (private)
134
135
136
# File 'app/controllers/namespaces_controller.rb', line 134
def batch_params
params.permit(:file, :import_level).merge(user_id: sessions_current_user_id, project_id: sessions_current_project_id).to_h.symbolize_keys
end
#createObject
POST /namespaces POST /namespaces.json
29
30
31
32
33
34
35
36
37
38
39
40
41
# File 'app/controllers/namespaces_controller.rb', line 29
def create
@namespace = Namespace.new(namespace_params)
respond_to do |format|
if @namespace.save
format.html { redirect_to @namespace, notice: "Namespace '#{@namespace.name}' was successfully created." }
format.json { render action: 'show', status: :created, location: @namespace }
else
format.html { render action: 'new' }
format.json { render json: @namespace.errors, status: :unprocessable_entity }
end
end
end
#create_simple_batch_loadObject
107
108
109
110
111
112
113
114
115
116
117
118
119
120
# File 'app/controllers/namespaces_controller.rb', line 107
def create_simple_batch_load
if params[:file] && digested_cookie_exists?(params[:file].tempfile, :Simple_namespaces_md5)
@result = BatchLoad::Import::Namespaces::SimpleInterpreter.new(**batch_params)
if @result.create
flash[:notice] = "Successfully proccessed file, #{@result.total_records_created} namespaces were created."
render 'namespaces/batch_load/simple/create' and return
else
flash[:alert] = 'Batch import failed.'
end
else
flash[:alert] = 'File to batch upload must be supplied.'
end
render :batch_load
end
#destroyObject
DELETE /namespaces/1 DELETE /namespaces/1.json
59
60
61
62
63
64
65
# File 'app/controllers/namespaces_controller.rb', line 59
def destroy
@namespace.destroy
respond_to do |format|
format.html { redirect_to namespaces_url }
format.json { head :no_content }
end
end
#downloadObject
GET /namespaces/download
84
85
86
# File 'app/controllers/namespaces_controller.rb', line 84
def download
send_data Export::Download.generate_csv(Namespace.all), type: 'text', filename: "namespaces_#{DateTime.now}.csv"
end
#editObject
GET /namespaces/1/edit
24
25
# File 'app/controllers/namespaces_controller.rb', line 24
def edit
end
#indexObject
GET /namespaces GET /namespaces.json
8
9
10
11
# File 'app/controllers/namespaces_controller.rb', line 8
def index
@recent_objects = Namespace.order(updated_at: :desc).limit(10)
render '/shared/data/all/index'
end
#listObject
67
68
69
# File 'app/controllers/namespaces_controller.rb', line 67
def list
@namespaces = Namespace.order(:id).page(params[:page]) #.per(10) #.per(3)
end
#namespace_paramsObject (private)
130
131
132
# File 'app/controllers/namespaces_controller.rb', line 130
def namespace_params
params.require(:namespace).permit(:institution, :name, :short_name, :verbatim_short_name, :delimiter)
end
#newObject
GET /namespaces/new
19
20
21
# File 'app/controllers/namespaces_controller.rb', line 19
def new
@namespace = Namespace.new
end
#preview_simple_batch_loadObject
96
97
98
99
100
101
102
103
104
105
# File 'app/controllers/namespaces_controller.rb', line 96
def preview_simple_batch_load
if params[:file]
@result = BatchLoad::Import::Namespaces::SimpleInterpreter.new(**batch_params)
digest_cookie(params[:file].tempfile, :Simple_namespaces_md5)
render 'namespaces/batch_load/simple/preview'
else
flash[:notice] = 'No file provided!'
redirect_to action: :batch_load
end
end
#searchObject
71
72
73
74
75
76
77
# File 'app/controllers/namespaces_controller.rb', line 71
def search
if params[:id].blank?
redirect_to namespace_path, notice: 'You must select an item from the list with a click or tab press before clicking show.'
else
redirect_to namespace_path(params[:id])
end
end
#select_optionsObject
GET /namespaces/select_options?klass=CollectionObject
89
90
91
# File 'app/controllers/namespaces_controller.rb', line 89
def select_options
@namespaces = Namespace.select_optimized(sessions_current_user_id, sessions_current_project_id, params.require(:klass))
end
#set_namespaceObject (private)
125
126
127
128
# File 'app/controllers/namespaces_controller.rb', line 125
def set_namespace
@namespace = Namespace.find(params[:id])
@recent_object = @namespace
end
#showObject
GET /namespaces/1 GET /namespaces/1.json
15
16
# File 'app/controllers/namespaces_controller.rb', line 15
def show
end
#updateObject
PATCH/PUT /namespaces/1 PATCH/PUT /namespaces/1.json
45
46
47
48
49
50
51
52
53
54
55
# File 'app/controllers/namespaces_controller.rb', line 45
def update
respond_to do |format|
if @namespace.update(namespace_params)
format.html { redirect_to @namespace, notice: 'Namespace was successfully updated.' }
format.json { head :no_content }
else
format.html { render action: 'edit' }
format.json { render json: @namespace.errors, status: :unprocessable_entity }
end
end
end
|
{
"url": "https://www.rubydoc.info/github/SpeciesFileGroup/taxonworks/NamespacesController",
"source_domain": "www.rubydoc.info",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "52712",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:S3VYONMY5LP7JCKOQDO5PHVDXKMQUNIO",
"WARC-Concurrent-To": "<urn:uuid:c5ace76c-a39b-4fca-803b-4ef969731189>",
"WARC-Date": "2020-07-06T18:35:00Z",
"WARC-IP-Address": "172.67.166.201",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:TTPJGZBBUUAAS4MRG2WXINIG2KR437CM",
"WARC-Record-ID": "<urn:uuid:22beb063-76bd-4e47-b002-226f8f63617f>",
"WARC-Target-URI": "https://www.rubydoc.info/github/SpeciesFileGroup/taxonworks/NamespacesController",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a39880c7-cc1f-4c53-bc51-3377bf8270c3>"
},
"warc_info": "isPartOf: CC-MAIN-2020-29\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-33.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,
28,
29,
39,
70,
80,
143,
155,
196,
197,
230,
231,
316,
317,
343,
344,
378,
379,
394,
395,
427,
428,
451,
452,
482,
483,
524,
525,
557,
558,
581,
582,
619,
620,
722,
723,
760,
761,
776,
777,
819,
820,
934,
935,
959,
960,
980,
981,
982,
985,
988,
991,
1050,
1051,
1068,
1148,
1152,
1153,
1171,
1172,
1173,
1176,
1179,
1238,
1239,
1254,
1258,
1259,
1289,
1290,
1291,
1295,
1299,
1303,
1363,
1364,
1381,
1521,
1525,
1526,
1540,
1541,
1580,
1581,
1582,
1585,
1588,
1591,
1594,
1597,
1600,
1603,
1606,
1609,
1612,
1615,
1618,
1621,
1680,
1681,
1692,
1739,
1740,
1765,
1788,
1901,
1985,
1994,
2037,
2121,
2129,
2135,
2139,
2140,
2172,
2173,
2174,
2178,
2182,
2186,
2190,
2194,
2198,
2202,
2206,
2210,
2214,
2218,
2222,
2226,
2230,
2290,
2291,
2320,
2414,
2497,
2519,
2632,
2694,
2703,
2748,
2756,
2763,
2824,
2830,
2851,
2855,
2856,
2871,
2872,
2919,
2920,
2921,
2924,
2927,
2930,
2933,
2936,
2939,
2942,
3001,
3002,
3014,
3035,
3060,
3107,
3144,
3150,
3154,
3155,
3171,
3172,
3197,
3198,
3199,
3202,
3205,
3208,
3267,
3268,
3281,
3396,
3400,
3401,
3413,
3414,
3437,
3438,
3439,
3442,
3445,
3504,
3505,
3514,
3518,
3519,
3532,
3533,
3570,
3571,
3572,
3574,
3576,
3579,
3582,
3640,
3641,
3651,
3716,
3750,
3754,
3755,
3767,
3768,
3769,
3772,
3775,
3778,
3837,
3838,
3847,
3923,
3927,
3928,
3962,
3963,
3964,
3968,
3972,
3976,
4036,
4037,
4058,
4162,
4166,
4167,
4178,
4179,
4199,
4200,
4201,
4204,
4207,
4210,
4269,
4270,
4278,
4307,
4311,
4312,
4345,
4346,
4347,
4350,
4353,
4356,
4359,
4363,
4367,
4371,
4375,
4379,
4383,
4442,
4443,
4474,
4494,
4577,
4643,
4693,
4700,
4741,
4778,
4784,
4788,
4789,
4803,
4804,
4805,
4808,
4811,
4814,
4817,
4820,
4823,
4826,
4885,
4886,
4897,
4921,
5049,
5056,
5100,
5106,
5110,
5111,
5133,
5134,
5188,
5189,
5190,
5193,
5196,
5199,
5258,
5259,
5278,
5400,
5404,
5405,
5436,
5437,
5438,
5442,
5446,
5450,
5454,
5514,
5515,
5533,
5576,
5606,
5610,
5611,
5623,
5624,
5665,
5666,
5667,
5670,
5673,
5732,
5733,
5742,
5746,
5747,
5761,
5762,
5815,
5816,
5817,
5820,
5823,
5826,
5829,
5832,
5835,
5838,
5841,
5844,
5847,
5850,
5909,
5910,
5921,
5946,
5989,
6081,
6120,
6129,
6173,
6257,
6265,
6271
],
"line_end_idx": [
28,
29,
39,
70,
80,
143,
155,
196,
197,
230,
231,
316,
317,
343,
344,
378,
379,
394,
395,
427,
428,
451,
452,
482,
483,
524,
525,
557,
558,
581,
582,
619,
620,
722,
723,
760,
761,
776,
777,
819,
820,
934,
935,
959,
960,
980,
981,
982,
985,
988,
991,
1050,
1051,
1068,
1148,
1152,
1153,
1171,
1172,
1173,
1176,
1179,
1238,
1239,
1254,
1258,
1259,
1289,
1290,
1291,
1295,
1299,
1303,
1363,
1364,
1381,
1521,
1525,
1526,
1540,
1541,
1580,
1581,
1582,
1585,
1588,
1591,
1594,
1597,
1600,
1603,
1606,
1609,
1612,
1615,
1618,
1621,
1680,
1681,
1692,
1739,
1740,
1765,
1788,
1901,
1985,
1994,
2037,
2121,
2129,
2135,
2139,
2140,
2172,
2173,
2174,
2178,
2182,
2186,
2190,
2194,
2198,
2202,
2206,
2210,
2214,
2218,
2222,
2226,
2230,
2290,
2291,
2320,
2414,
2497,
2519,
2632,
2694,
2703,
2748,
2756,
2763,
2824,
2830,
2851,
2855,
2856,
2871,
2872,
2919,
2920,
2921,
2924,
2927,
2930,
2933,
2936,
2939,
2942,
3001,
3002,
3014,
3035,
3060,
3107,
3144,
3150,
3154,
3155,
3171,
3172,
3197,
3198,
3199,
3202,
3205,
3208,
3267,
3268,
3281,
3396,
3400,
3401,
3413,
3414,
3437,
3438,
3439,
3442,
3445,
3504,
3505,
3514,
3518,
3519,
3532,
3533,
3570,
3571,
3572,
3574,
3576,
3579,
3582,
3640,
3641,
3651,
3716,
3750,
3754,
3755,
3767,
3768,
3769,
3772,
3775,
3778,
3837,
3838,
3847,
3923,
3927,
3928,
3962,
3963,
3964,
3968,
3972,
3976,
4036,
4037,
4058,
4162,
4166,
4167,
4178,
4179,
4199,
4200,
4201,
4204,
4207,
4210,
4269,
4270,
4278,
4307,
4311,
4312,
4345,
4346,
4347,
4350,
4353,
4356,
4359,
4363,
4367,
4371,
4375,
4379,
4383,
4442,
4443,
4474,
4494,
4577,
4643,
4693,
4700,
4741,
4778,
4784,
4788,
4789,
4803,
4804,
4805,
4808,
4811,
4814,
4817,
4820,
4823,
4826,
4885,
4886,
4897,
4921,
5049,
5056,
5100,
5106,
5110,
5111,
5133,
5134,
5188,
5189,
5190,
5193,
5196,
5199,
5258,
5259,
5278,
5400,
5404,
5405,
5436,
5437,
5438,
5442,
5446,
5450,
5454,
5514,
5515,
5533,
5576,
5606,
5610,
5611,
5623,
5624,
5665,
5666,
5667,
5670,
5673,
5732,
5733,
5742,
5746,
5747,
5761,
5762,
5815,
5816,
5817,
5820,
5823,
5826,
5829,
5832,
5835,
5838,
5841,
5844,
5847,
5850,
5909,
5910,
5921,
5946,
5989,
6081,
6120,
6129,
6173,
6257,
6265,
6271,
6274
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6274,
"ccnet_original_nlines": 363,
"rps_doc_curly_bracket": 0.004144090227782726,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.04713805019855499,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013468010351061821,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5042087435722351,
"rps_doc_frac_unique_words": 0.5495327115058899,
"rps_doc_mean_word_length": 8.758878707885742,
"rps_doc_num_sentences": 84,
"rps_doc_symbol_to_word_ratio": 0.049663301557302475,
"rps_doc_unigram_entropy": 5.18541145324707,
"rps_doc_word_count": 535,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04822877049446106,
"rps_doc_frac_chars_dupe_6grams": 0.029449420049786568,
"rps_doc_frac_chars_dupe_7grams": 0.029449420049786568,
"rps_doc_frac_chars_dupe_8grams": 0.029449420049786568,
"rps_doc_frac_chars_dupe_9grams": 0.029449420049786568,
"rps_doc_frac_chars_top_2gram": 0.15364916622638702,
"rps_doc_frac_chars_top_3gram": 0.1690140813589096,
"rps_doc_frac_chars_top_4gram": 0.008109260350465775,
"rps_doc_books_importance": -546.6556396484375,
"rps_doc_books_importance_length_correction": -546.6556396484375,
"rps_doc_openwebtext_importance": -295.018798828125,
"rps_doc_openwebtext_importance_length_correction": -295.018798828125,
"rps_doc_wikipedia_importance": -255.15574645996094,
"rps_doc_wikipedia_importance_length_correction": -255.15574645996094
},
"fasttext": {
"dclm": 0.6777455806732178,
"english": 0.24101687967777252,
"fineweb_edu_approx": 1.7194780111312866,
"eai_general_math": 0.9413260221481323,
"eai_open_web_math": 0.10549557209014893,
"eai_web_code": 0.6532464623451233
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "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": "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": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,058,559,080,510,459,600 |
Thread Rating:
• 0 Vote(s) - 0 Average
• 1
• 2
• 3
• 4
• 5
Tile set and Theme
#1
New tileset can be added by creating a new tileset file at the hex folder. It will appear automatically at the client setting graphic pull down menu. What about adding a new theme? The existing themes; snow, grass, Mars, lunar etc, are they hard coded? I modified an existing tileset by adding a new theme section for superimposing images but it doesn't work. Help.
Reply
#2
Themes can be added to hexes when you create boards. The theme of the hex in the board will be used to match it to a theme from a tileset. You can basically use any string, it just matches the theme string in the board to a theme string in the tileset. Does that make sense?
Reply
#3
Yup. It make sense. But I was asking how I can create a brand new theme. :p Sorry for my bad English.
Reply
#4
(10-17-2015, 06:32 PM)SirMegaV link Wrote: I was asking how I can create a brand new theme.
(10-17-2015, 04:57 PM)Arlith link Wrote: You can basically use any string, it just matches the theme string in the board to a theme string in the tileset.
There's really no creating a theme. It's just whatever theme is used in the board file will get matched to a theme in the tileset. There's no definition of a theme. If you set a theme on a hex in the board, it will create an affinity for that theme in the tileset (if it exists). Themes are just used to decide what image to use on the hex. Theme matches will rate higher.
Reply
#5
(10-17-2015, 11:32 PM)Arlith link Wrote: There's really no creating a theme. It's just whatever theme is used in the board file will get matched to a theme in the tileset. There's no definition of a theme. If you set a theme on a hex in the board, it will create an affinity for that theme in the tileset (if it exists). Themes are just used to decide what image to use on the hex. Theme matches will rate higher.
I wrote something like this.
base * "" "space" "Customs - SirMegaV - Space/Space-01.gif;Customs - SirMegaV - Space/Space-02.gif;Customs - SirMegaV - Space/Space-03.gif;Customs - SirMegaV - Space/Space-04.gif;Customs - SirMegaV - Space/Space-05.gif;Customs - SirMegaV - Space/Space-06.gif;Customs - SirMegaV - Space/Space-07.gif;Customs - SirMegaV - Space/Space-08.gif;Customs - SirMegaV - Space/Space-09.gif;Customs - SirMegaV - Space/Space-10.gif"
super * "smoke:1" "space" "Customs - SirMegaV - Space/Asteriod-01.gif;Customs - SirMegaV - Space/Asteriod-02.gif;Customs - SirMegaV - Space/Asteriod-03.gif;Customs - SirMegaV - Space/Asteriod-04.gif;Customs - SirMegaV - Space/Asteriod-05.gif;"
The <base * "" "space"> is showing properly.. but <super * "smoke:1" "space"> when the hex is <smoke:1> refuse to show my image. Arg.....
Reply
#6
Hmmm, it seems lile that should work, I guess I'll have to look at the code to see if I see anything.
Reply
#7
Thanks. What I was trying to do is to replace the normal plain hex to space hex, which worked, light smoke to asteroid, which is not working, and smoke 2 to planet hex, after asteroid. Hope you can help me find out why it's not working. Btw, my space theme codes are located at the bottom most of the atmospheric tileset.
Reply
#8
It may help if you attach your tileset file and a board file.
Reply
#9
I'm currently away at the moment. I will post the files this Friday.
Reply
#10
(10-19-2015, 10:13 AM)Arlith link Wrote: It may help if you attach your tileset file and a board file.
I'm back. I'm attaching the new hexes and modified tileset. The 'space' was replaced properly and at the center, the smoke is suppose to show asteroid. Hope that you can help.
Attached Files
.rar Space.rar (Size: 95.15 KB / Downloads: 2)
Reply
#11
Forgot about the board...
Attached Files
.board A Space - 50x50.board (Size: 56.52 KB / Downloads: 2)
Reply
#12
Alright, this is kind of dumb, but the issue is order. For supers, once a terrain feature has found a match, that terrain feature is removed and no more matches will be found for that terrain feature. Because of this, that means that your themed super entries *must* proceed the unthemed super entries, otherwise things won't work.
I doubt this is really documented anywhere, and is basically just a weird gotcha. The code could maybe be improved by I'm somewhat reluctant to change it (it's part of a fundamental operation in the rendering pipeline).
edit: Just to be clear, all you need to do is take your "SirMegaV" section, and place it at the top of the file instead of the bottom (right after the file header).
Reply
#13
(10-24-2015, 01:31 PM)Arlith link Wrote: edit: Just to be clear, all you need to do is take your "SirMegaV" section, and place it at the top of the file instead of the bottom (right after the file header).
Thanks Arlith. I managed to do it after following your instructions. Attached is what I was trying to achieve. Please ignore the unit symbols.
Attached Files Thumbnail(s)
Reply
#14
That looks cool.
Reply
Possibly Related Threads…
Thread Author Replies Views Last Post
low res tile sets? bfshadow 0 1,182 02-27-2011, 07:59 PM
Last Post: bfshadow
Forum Jump:
Users browsing this thread: 1 Guest(s)
|
{
"url": "https://forum.megamek.org/showthread.php?tid=2020&pid=14393",
"source_domain": "forum.megamek.org",
"snapshot_id": "crawl=CC-MAIN-2019-51",
"warc_metadata": {
"Content-Length": "69576",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CKNLFZ5FBF2VNRLIS5RZO2XB6XD7AOW6",
"WARC-Concurrent-To": "<urn:uuid:ede2debb-d6cf-491a-8762-931b3fdeed3a>",
"WARC-Date": "2019-12-15T16:11:15Z",
"WARC-IP-Address": "165.22.36.162",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:2MDCY7TGKK4NIUXMIG7BQTKGNLBMH2GT",
"WARC-Record-ID": "<urn:uuid:bc8c950f-c23a-4e8e-9c7f-1ae4aafb4be9>",
"WARC-Target-URI": "https://forum.megamek.org/showthread.php?tid=2020&pid=14393",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:01e23974-56e5-413b-96b9-9e8bd8747ead>"
},
"warc_info": "isPartOf: CC-MAIN-2019-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-121.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,
16,
42,
48,
54,
60,
66,
72,
91,
94,
460,
466,
469,
747,
753,
756,
858,
864,
867,
959,
1114,
1115,
1493,
1499,
1502,
1921,
1922,
1951,
1952,
2372,
2373,
2617,
2618,
2756,
2762,
2765,
2867,
2873,
2876,
3198,
3204,
3207,
3269,
3275,
3278,
3347,
3353,
3357,
3460,
3461,
3637,
3638,
3639,
3654,
3703,
3709,
3713,
3739,
3740,
3741,
3756,
3819,
3825,
3829,
4163,
4164,
4385,
4386,
4551,
4557,
4561,
4767,
4768,
4911,
4912,
4913,
4941,
4945,
4951,
4955,
4972,
4978,
4979,
4980,
5006,
5044,
5103,
5123,
5124,
5136,
5137,
5138
],
"line_end_idx": [
1,
16,
42,
48,
54,
60,
66,
72,
91,
94,
460,
466,
469,
747,
753,
756,
858,
864,
867,
959,
1114,
1115,
1493,
1499,
1502,
1921,
1922,
1951,
1952,
2372,
2373,
2617,
2618,
2756,
2762,
2765,
2867,
2873,
2876,
3198,
3204,
3207,
3269,
3275,
3278,
3347,
3353,
3357,
3460,
3461,
3637,
3638,
3639,
3654,
3703,
3709,
3713,
3739,
3740,
3741,
3756,
3819,
3825,
3829,
4163,
4164,
4385,
4386,
4551,
4557,
4561,
4767,
4768,
4911,
4912,
4913,
4941,
4945,
4951,
4955,
4972,
4978,
4979,
4980,
5006,
5044,
5103,
5123,
5124,
5136,
5137,
5138,
5176
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5176,
"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.2992985248565674,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021044429391622543,
"rps_doc_frac_lines_end_with_ellipsis": 0.032258059829473495,
"rps_doc_frac_no_alph_words": 0.31566640734672546,
"rps_doc_frac_unique_words": 0.35822635889053345,
"rps_doc_mean_word_length": 4.534422397613525,
"rps_doc_num_sentences": 81,
"rps_doc_symbol_to_word_ratio": 0.013250189833343029,
"rps_doc_unigram_entropy": 5.12514591217041,
"rps_doc_word_count": 857,
"rps_doc_frac_chars_dupe_10grams": 0.3015954792499542,
"rps_doc_frac_chars_dupe_5grams": 0.3098301589488983,
"rps_doc_frac_chars_dupe_6grams": 0.3015954792499542,
"rps_doc_frac_chars_dupe_7grams": 0.3015954792499542,
"rps_doc_frac_chars_dupe_8grams": 0.3015954792499542,
"rps_doc_frac_chars_dupe_9grams": 0.3015954792499542,
"rps_doc_frac_chars_top_2gram": 0.018013380467891693,
"rps_doc_frac_chars_top_3gram": 0.018013380467891693,
"rps_doc_frac_chars_top_4gram": 0.016469379886984825,
"rps_doc_books_importance": -528.7124633789062,
"rps_doc_books_importance_length_correction": -528.7124633789062,
"rps_doc_openwebtext_importance": -349.58685302734375,
"rps_doc_openwebtext_importance_length_correction": -349.58685302734375,
"rps_doc_wikipedia_importance": -233.46966552734375,
"rps_doc_wikipedia_importance_length_correction": -233.46966552734375
},
"fasttext": {
"dclm": 0.09799153357744217,
"english": 0.873920202255249,
"fineweb_edu_approx": 1.3986988067626953,
"eai_general_math": 0.06032240018248558,
"eai_open_web_math": 0.09123837947845459,
"eai_web_code": 0.007522759959101677
}
}
|
{
"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": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,267,029,463,269,946,600 |
Find a file
Thomas Goyne fde4a7815d Make the subtitle edit box auto-commit all changes
This happens to fix most of the undo issues, as it's now much harder to
have uncommitted changes to the file.
Closes #355 and #586.
Originally committed to SVN as r4699.
2010-07-20 03:11:11 +00:00
aegisub Make the subtitle edit box auto-commit all changes 2010-07-20 03:11:11 +00:00
contrib Fix a memory leak in csri caused by csri_wrap_insts never being freed. 2010-02-26 00:18:33 +00:00
devel Forgot to add rpath info for the osx builds. 2010-01-26 14:06:49 +00:00
docs Add new buttons, commit changes to modified buttons. 2009-08-21 23:10:43 +00:00
|
{
"url": "https://git.0x0.st/mia/Aegisub/src/commit/fde4a7815d4c13911bf15f9aa5d4a25ee09d7b3f",
"source_domain": "git.0x0.st",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "47839",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RUXPGKKSJPR2HXPWV3PS3CCBJVDMSPIM",
"WARC-Concurrent-To": "<urn:uuid:d10eb900-9b9b-4c0e-a186-cce633c40699>",
"WARC-Date": "2024-08-13T18:01:29Z",
"WARC-IP-Address": "168.119.145.117",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XL5LDOQZSIIIKRMHGQIBRWNHEUSLBTN4",
"WARC-Record-ID": "<urn:uuid:2eb40be5-fa37-4913-80c2-dc216f922ca2>",
"WARC-Target-URI": "https://git.0x0.st/mia/Aegisub/src/commit/fde4a7815d4c13911bf15f9aa5d4a25ee09d7b3f",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3b56a118-4db9-4c5a-883b-1840b6c6634c>"
},
"warc_info": "isPartOf: CC-MAIN-2024-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-208\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,
12,
87,
159,
197,
198,
220,
221,
259,
286,
372,
478,
556
],
"line_end_idx": [
12,
87,
159,
197,
198,
220,
221,
259,
286,
372,
478,
556,
640
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 640,
"ccnet_original_nlines": 12,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.20930233597755432,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005813950207084417,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.49418604373931885,
"rps_doc_frac_unique_words": 0.7029703259468079,
"rps_doc_mean_word_length": 4.881187915802002,
"rps_doc_num_sentences": 7,
"rps_doc_symbol_to_word_ratio": 0.01162790972739458,
"rps_doc_unigram_entropy": 4.102266788482666,
"rps_doc_word_count": 101,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.17038540542125702,
"rps_doc_frac_chars_dupe_6grams": 0.17038540542125702,
"rps_doc_frac_chars_dupe_7grams": 0.17038540542125702,
"rps_doc_frac_chars_dupe_8grams": 0.17038540542125702,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.028397569432854652,
"rps_doc_frac_chars_top_3gram": 0.06085193157196045,
"rps_doc_frac_chars_top_4gram": 0.07707910984754562,
"rps_doc_books_importance": -95.62378692626953,
"rps_doc_books_importance_length_correction": -106.33915710449219,
"rps_doc_openwebtext_importance": -42.893890380859375,
"rps_doc_openwebtext_importance_length_correction": -53.60926818847656,
"rps_doc_wikipedia_importance": -23.007732391357422,
"rps_doc_wikipedia_importance_length_correction": -33.72311019897461
},
"fasttext": {
"dclm": 0.06602734327316284,
"english": 0.834847629070282,
"fineweb_edu_approx": 1.1717839241027832,
"eai_general_math": 0.07653213292360306,
"eai_open_web_math": 0.2681974172592163,
"eai_web_code": 0.006083790212869644
}
}
|
{
"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": "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": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "22",
"label": "Truncated"
}
},
"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": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,161,420,150,408,732,000 |
Tag Archives: WebAudio
Using createjs WebAudio with Phonegap (Cordova)
One of the things I hate about Phonegap (Cordova) is the audio support. Every time I worked on a project that required heavy audio usage not a single plugin worked fine
Cordova Media plugin is good for recording audio but when you try to play multiple audio files it leaks into memory and the OS stops your app. It also tends to break after using the recording feature. I’ve also tried the Native Audio plugin and although it’s much better it has its issues with features not working.
The createjs team released a new soundjs plugin called CordovaAudioPlugin. It did work for some time but because it is using Cordova Media it had the same issues. With newer version of the Cordova Media plugin it just causes your app to crash (04.2016, soundjs version 0.6.2).
Honestly, with the WebAudio browser support, I don’t think we need plugins for playing audio. WebAudio does the job nicely for mobile and desktop.
Continue reading Using createjs WebAudio with Phonegap (Cordova)
|
{
"url": "https://avladov.com/tag/webaudio",
"source_domain": "avladov.com",
"snapshot_id": "crawl=CC-MAIN-2019-13",
"warc_metadata": {
"Content-Length": "32799",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:G5PUBQUOT6CHAPEI45XY53STDRFSOKBG",
"WARC-Concurrent-To": "<urn:uuid:63c4bc04-2fc5-4550-9cfc-3ed6843cd1e7>",
"WARC-Date": "2019-03-19T00:26:09Z",
"WARC-IP-Address": "91.196.124.127",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WEWAOQX3MHRFRMUHFA64YDPIIDRTBJJC",
"WARC-Record-ID": "<urn:uuid:97d219fb-c90a-4332-9d00-7f8e1a2424a6>",
"WARC-Target-URI": "https://avladov.com/tag/webaudio",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e6e7e4ad-9889-456d-a78d-8f452356e2c5>"
},
"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-143-92-167.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,
23,
24,
72,
73,
242,
243,
559,
560,
837,
838,
985
],
"line_end_idx": [
23,
24,
72,
73,
242,
243,
559,
560,
837,
838,
985,
1049
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1049,
"ccnet_original_nlines": 11,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36538460850715637,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.024038460105657578,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14903846383094788,
"rps_doc_frac_unique_words": 0.5909090638160706,
"rps_doc_mean_word_length": 4.801136493682861,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.387706756591797,
"rps_doc_word_count": 176,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09467455744743347,
"rps_doc_frac_chars_dupe_6grams": 0.09467455744743347,
"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.05325444042682648,
"rps_doc_frac_chars_top_3gram": 0.049704138189554214,
"rps_doc_frac_chars_top_4gram": 0.05917159840464592,
"rps_doc_books_importance": -98.24776458740234,
"rps_doc_books_importance_length_correction": -98.24776458740234,
"rps_doc_openwebtext_importance": -64.84513854980469,
"rps_doc_openwebtext_importance_length_correction": -52.1682014465332,
"rps_doc_wikipedia_importance": -53.662574768066406,
"rps_doc_wikipedia_importance_length_correction": -53.662574768066406
},
"fasttext": {
"dclm": 0.02163814939558506,
"english": 0.9141812324523926,
"fineweb_edu_approx": 1.259092926979065,
"eai_general_math": 0.03310281038284302,
"eai_open_web_math": 0.02599531039595604,
"eai_web_code": 0.05573970079421997
}
}
|
{
"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.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "5",
"label": "Evaluate"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "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": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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,983,502,862,120,258,000 |
Samsung J710F Galaxy J7 (2016) is a useful device that everyone should love to have. But sometimes you feel your Samsung J710F Galaxy J7 (2016) is freezing and you want to boost your Samsung mobile phone performance effectively.
Here in this article, we will discuss how you can factory reset the Samsung J710F Galaxy J7 (2016) and wipe all the data on your Samsung J710F Galaxy J7 (2016).
This article will show you how you can easily restore defaults on your Samsung J710F Galaxy J7 (2016) mobile.
Make sure you properly backup your Samsung J710F Galaxy J7 (2016), before proceeding with these steps on your mobile phone. Everything on your phone including files, photographs, videos, games, and APK files will be erased by proceeding with these steps on your Samsung J710F Galaxy J7 (2016). As a result, your Samsung J710F Galaxy J7 (2016) mobile phone will run faster and you will see its performance is improved.
You can follow the process on any Samsung mobile to boost its performance effectively.
How to factory reset in Samsung J710F Galaxy J7 (2016)?
Let’s jump into a direct step-by-step tutorial on how to restore defaults in Samsung J710F Galaxy J7 (2016).
Follow the steps information below to reset your Samsung J710F Galaxy J7 (2016):
Step 1: Go to your Samsung J710F Galaxy J7 (2016)’s “Settings.”
Step 2: Go to the “General Management” option
Step 3: Select “Reset” > “Factory Data Reset” option
Step 4: Select “Reset Button” > Tap on the “Delete all button” to confirm factory reset!
Perfect, You have successfully factory reset your Samsung J710F Galaxy J7 (2016) mobile phone.
How to Hard Reset Your Samsung J710F Galaxy J7 (2016)?
Another option is to hard reset. If you see a blank screen on your device and you still want to reset your Samsung J710F Galaxy J7 (2016), you can use the hard reset option on your mobile.
Follow the step-by-step guide to Hard reset your Samsung J710F Galaxy J7 (2016):
Step 1: Press the “Volume Down” + “Power” button on your Samsung J710F Galaxy J7 (2016) for a few seconds.
Step 2: Hold “Volume Up” + “Power key” together for a couple of seconds.
Step 3: Leave the pressed button when you see a “Samsung Galaxy logo” on the screen.
Step 4: Now, Use the Volume keys to navigate to “the Wipe data/factory reset” option on your Samsung J710F Galaxy J7 (2016) & confirm with the “Power button”.
Wipe data/factory reset samsung mobile phone
Step 5: Now, select “Factory data reset” from the options and accept it using the “Power key.”
Step 6: Finally, use the “Power button” to choose “Reboot system now.”
Congratulations! You have successfully done a hard reset process on your Samsung J710F Galaxy J7 (2016).
We hope this article posted here about step-by-step information on how to factory reset the Samsung J710F Galaxy J7 (2016) has helped you.
If you have any questions about anything corresponding to Samsung J710F Galaxy J7 (2016), feel free to share your opinions in the comments below.
Amazing Offer Available
Mukesh Chauhan
Mukesh Chauhan is an Engineering Student, who loves to write about technology and gadgets. Currently he is studying and working as an Editor on Theandroidportal.com
|
{
"url": "https://www.theandroidportal.com/how-to-factory-reset-samsung-j710f-galaxy-j7-2016/",
"source_domain": "www.theandroidportal.com",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "176416",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LWCJNNOBKDQMOJJNKKPEA6ZPQGRG5WGW",
"WARC-Concurrent-To": "<urn:uuid:1caf99a7-e3db-40d5-9ec5-09505f9a912d>",
"WARC-Date": "2024-04-25T06:50:31Z",
"WARC-IP-Address": "191.101.104.246",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NJESBS2IK7UT2ZJY7YCO55NZBLCYHSCT",
"WARC-Record-ID": "<urn:uuid:a3510fdb-88a6-4a0f-8424-6a049ecca288>",
"WARC-Target-URI": "https://www.theandroidportal.com/how-to-factory-reset-samsung-j710f-galaxy-j7-2016/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5bc51602-5152-4d2c-9ff2-25c25e12c613>"
},
"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-192\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,
229,
230,
391,
392,
502,
503,
921,
922,
1009,
1010,
1066,
1067,
1176,
1177,
1258,
1259,
1323,
1324,
1370,
1371,
1424,
1425,
1514,
1515,
1610,
1611,
1666,
1667,
1856,
1857,
1938,
1939,
2046,
2047,
2120,
2121,
2206,
2207,
2366,
2367,
2412,
2413,
2508,
2509,
2580,
2581,
2686,
2687,
2826,
2827,
2973,
2974,
2998,
3013
],
"line_end_idx": [
229,
230,
391,
392,
502,
503,
921,
922,
1009,
1010,
1066,
1067,
1176,
1177,
1258,
1259,
1323,
1324,
1370,
1371,
1424,
1425,
1514,
1515,
1610,
1611,
1666,
1667,
1856,
1857,
1938,
1939,
2046,
2047,
2120,
2121,
2206,
2207,
2366,
2367,
2412,
2413,
2508,
2509,
2580,
2581,
2686,
2687,
2826,
2827,
2973,
2974,
2998,
3013,
3177
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3177,
"ccnet_original_nlines": 54,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.289552241563797,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06417910009622574,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23880596458911896,
"rps_doc_frac_unique_words": 0.350943386554718,
"rps_doc_mean_word_length": 4.7320756912231445,
"rps_doc_num_sentences": 29,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.583612442016602,
"rps_doc_word_count": 530,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.29625198245048523,
"rps_doc_frac_chars_dupe_6grams": 0.2771132290363312,
"rps_doc_frac_chars_dupe_7grams": 0.20135566592216492,
"rps_doc_frac_chars_dupe_8grams": 0.1251993626356125,
"rps_doc_frac_chars_dupe_9grams": 0.04824560880661011,
"rps_doc_frac_chars_top_2gram": 0.10047847032546997,
"rps_doc_frac_chars_top_3gram": 0.15071770548820496,
"rps_doc_frac_chars_top_4gram": 0.16746410727500916,
"rps_doc_books_importance": -316.7349853515625,
"rps_doc_books_importance_length_correction": -316.7349853515625,
"rps_doc_openwebtext_importance": -204.5874481201172,
"rps_doc_openwebtext_importance_length_correction": -204.5874481201172,
"rps_doc_wikipedia_importance": -128.5076446533203,
"rps_doc_wikipedia_importance_length_correction": -128.5076446533203
},
"fasttext": {
"dclm": 0.03823297843337059,
"english": 0.7859182357788086,
"fineweb_edu_approx": 1.0903453826904297,
"eai_general_math": 0.001329899998381734,
"eai_open_web_math": 0.05839085951447487,
"eai_web_code": 0.0010931500000879169
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.164",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "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,822,009,556,214,749,000 |
How can we help?
How to install the Auvik collector from a bash script
Follow
The following instructions are for advanced users. If you’d rather install the Auvik collector from an OVA file, please follow these steps.
When the Auvik collector is installed from a bash script, it takes over the system on which it’s installed—the system will be rendered useless. For that reason, the bash script must be run against a dedicated, stand-alone virtual machine and never on an existing Ubuntu desktop or server.
1. Register for a trial.
2. Add a new client.
3. Have a supported virtualization platform ready. Desktop virtualization platforms such as Oracle VirtualBox, VMware Fusion, or VMware Workstation are fine for quick use, but aren’t recommended or supported for enterprise implementations.
Virtualization Platforms
Host Operating Systems
Commercial cloud* (e.g., Amazon AWS EC2, Microsoft Azure)
N/A
Microsoft Hyper-V
Windows Server
Citrix Xen
N/A
VMware ESX / ESXi 5.5+ (Download here)
NA (barebones hypervisor)
1. Sign into your Auvik account and access a new client.
To install the Auvik collector in a commercial cloud environment, such as Amazon AWS or Microsoft Azure, follow these steps first.
It’s assumed that you know how to set up and configure an Ubuntu 18.04 LTS server. All of this can be completed in four easy steps.
1. Download the LTS Ubuntu iso
2. Create a new Linux Ubuntu virtual machine
3. Install and configure Ubuntu
4. Run the collector bash installation script
1. Downloading the LTS Ubuntu iso
Download a Trusty Ubuntu iso image from one of these two sources. The collector should be installed on Ubuntu 18.04.
2. Create a Linux Ubuntu virtual machine
If you’re looking to deploy the Auvik collector in a commercial cloud environment like Amazon Web Services (AWS) or Microsoft Azure, follow these steps to deploy Ubuntu.
When creating the Linux Ubuntu virtual machine, here a few requirements to keep in mind. You’ll need:
1. One virtual CPU
2. At least 2GB of RAM
3. At least 8GB of available disk space
Once your virtual machine is ready, continue to Step 3.
3. Installing and configuring Ubuntu
During Ubuntu installation, if you’re asked to provide an IP address for the virtual machine, this address will be the DHCP address associated with the Auvik collector If you like, you can change the address after the collector has been installed.
If you don’t set an IP address for the virtual machine during Ubuntu installation, locate the new machine’s IP address by running the following: ifconfig. Note the inet addr. You’ll need it in Step 4.
Make sure you install OpenSSH Server. You can do this during Ubuntu installation or afterwards. If doing it after the Ubuntu installation, log in as the Ubuntu server user, then run the following command:
sudo apt-get update
sudo apt-get install openssh-server openssh-client
4. Run the Auvik collector bash script
To execute the script, you’ll need:
1. From a window external to the virtual machine, connect via SSH:
• Mac users: Open a terminal window and execute ssh UBUNTUUSER@IPADDRESS Accept the SSH key. When requested, enter the user’s password.
• Windows users: Start PuTTY. In the host name field, enter the IP address for the virtual machine. Ensure the port is 22 and SSH is selected. Click Open. When requested, enter the username and password.
2. Copy and paste the following command:
sudo bash -c "rm -rf ./auvik_installer install.sh && umask 0022 && curl --verbose --location-trusted --header \"Accept: text/plain\" --user EMAIL https://DOMAINPREFIX.my.auvik.com/agents/installer > install.sh && grep -wq __ARCHIVE_BELOW__ install.sh && chmod 0755 install.sh && bash -x ./install.sh 2>&1 | tee /tmp/install.log"
Be sure to edit the following parameters within the command:
• EMAIL should be the email address associated with your Auvik account.
• DOMAINPREFIX should be the Auvik domain prefix (e.g., sample is the prefix for https://sample.my.auvik.com/agents/installer) for the client where the collector is being installed.
1. When requested, enter the password for the Ubuntu user. When asked for the password for the email address set in the command, enter the API key.
2. Downloading and installing the Auvik collector takes about 10 minutes. After that’s done, reboot the Ubuntu virtual machine from the external command line by executing: sudo reboot
3. Ensure the IP address of the collector remains static. There are two ways to ensure this:
• Set up a DHCP reservation for the virtual machine’s MAC address in your DHCP server.
• Configure the collector to use a static IP address that lies outside of your DHCP pool. Option 1 on the collector’s console window will help you configure a static IP.
Was this article helpful?
9 out of 11 found this helpful
Have more questions? Submit a request
Powered by Zendesk
|
{
"url": "https://support.auvik.com/hc/en-us/articles/204822246-How-to-install-the-Auvik-collector-from-a-bash-script",
"source_domain": "support.auvik.com",
"snapshot_id": "crawl=CC-MAIN-2019-35",
"warc_metadata": {
"Content-Length": "45213",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VOK7BEQ4E2XPORTY6SI5XYQGPRXK7FXT",
"WARC-Concurrent-To": "<urn:uuid:67a5d237-1ab9-49ef-a342-476c52e5f4bc>",
"WARC-Date": "2019-08-23T20:27:43Z",
"WARC-IP-Address": "104.16.55.111",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CUWWKMV3OFLBT4XTJEJRCLRVN3DJO4SE",
"WARC-Record-ID": "<urn:uuid:f8d1dfab-dd17-4393-8aa0-5ccd735592d1>",
"WARC-Target-URI": "https://support.auvik.com/hc/en-us/articles/204822246-How-to-install-the-Auvik-collector-from-a-bash-script",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:dcf0ce5d-a4d8-4028-9b6d-6548a81302e5>"
},
"warc_info": "isPartOf: CC-MAIN-2019-35\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-32.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
17,
18,
72,
73,
80,
81,
221,
222,
511,
512,
539,
562,
804,
805,
830,
831,
854,
855,
913,
914,
918,
919,
937,
938,
953,
954,
965,
966,
970,
971,
1010,
1011,
1037,
1038,
1097,
1098,
1229,
1230,
1362,
1363,
1396,
1443,
1477,
1525,
1526,
1560,
1561,
1678,
1679,
1720,
1721,
1891,
1892,
1994,
1995,
2016,
2041,
2083,
2084,
2140,
2141,
2178,
2179,
2427,
2428,
2629,
2630,
2835,
2836,
2856,
2907,
2908,
2947,
2948,
2984,
2985,
3056,
3198,
3408,
3455,
3456,
3785,
3786,
3847,
3848,
3926,
4114,
4264,
4450,
4545,
4636,
4810,
4811,
4813,
4814,
4840,
4871,
4909
],
"line_end_idx": [
17,
18,
72,
73,
80,
81,
221,
222,
511,
512,
539,
562,
804,
805,
830,
831,
854,
855,
913,
914,
918,
919,
937,
938,
953,
954,
965,
966,
970,
971,
1010,
1011,
1037,
1038,
1097,
1098,
1229,
1230,
1362,
1363,
1396,
1443,
1477,
1525,
1526,
1560,
1561,
1678,
1679,
1720,
1721,
1891,
1892,
1994,
1995,
2016,
2041,
2083,
2084,
2140,
2141,
2178,
2179,
2427,
2428,
2629,
2630,
2835,
2836,
2856,
2907,
2908,
2947,
2948,
2984,
2985,
3056,
3198,
3408,
3455,
3456,
3785,
3786,
3847,
3848,
3926,
4114,
4264,
4450,
4545,
4636,
4810,
4811,
4813,
4814,
4840,
4871,
4909,
4927
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4927,
"ccnet_original_nlines": 98,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.30285152792930603,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04129793867468834,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22910520434379578,
"rps_doc_frac_unique_words": 0.39225804805755615,
"rps_doc_mean_word_length": 4.947096824645996,
"rps_doc_num_sentences": 84,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.193394184112549,
"rps_doc_word_count": 775,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08346375077962875,
"rps_doc_frac_chars_dupe_6grams": 0.06598851829767227,
"rps_doc_frac_chars_dupe_7grams": 0.05842462182044983,
"rps_doc_frac_chars_dupe_8grams": 0.02399582974612713,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.03651538863778114,
"rps_doc_frac_chars_top_3gram": 0.035472091287374496,
"rps_doc_frac_chars_top_4gram": 0.018779339268803596,
"rps_doc_books_importance": -537.3057250976562,
"rps_doc_books_importance_length_correction": -537.3057250976562,
"rps_doc_openwebtext_importance": -294.8381042480469,
"rps_doc_openwebtext_importance_length_correction": -294.8381042480469,
"rps_doc_wikipedia_importance": -218.9021453857422,
"rps_doc_wikipedia_importance_length_correction": -218.9021453857422
},
"fasttext": {
"dclm": 0.04694646969437599,
"english": 0.7583847045898438,
"fineweb_edu_approx": 2.4682884216308594,
"eai_general_math": 0.03126538172364235,
"eai_open_web_math": 0.05660843849182129,
"eai_web_code": 0.06861793994903564
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.028",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,928,958,992,701,606,000 |
PHPDeveloper.org http://www.phpdeveloper.org Up-to-the Minute PHP News, views and community en-us Wed, 01 Oct 2014 03:22:50 -0500 30 <![CDATA[MegaLeecher.net: Decoding CAPTCHA using PHP | Hypertext Preprocessor]]> http://www.phpdeveloper.org/news/5535 http://www.phpdeveloper.org/news/5535 Just when you thought you were safe with the little CAPTCHA graphic on your site, something like this comes along - a method for decoding CAPTCHA images using only PHP.
This example shows a simple method of decoding "CAPTCHA" (Completely Automated Public Turing test to tell Computers and Humans Apart) correctly into usable variables for processing. There is no 100% guarantee that it would successfully decode the CAPTCHA (Maybe about 90% or more) but it is a start.
Their example pulls an image with overlapping characters to be parsed by their PHP script (needing the GD2 extension). They start off by taking the image into a graphic editor and breaking up the characters to create a "pixel library" of the letters (A-Z) and numbers (0-9) that service uses. This is then used by the PHP script to locate what letters/numbers might be present in the image.
They include in upload form to allow users to give it a try as well as a sample pixel library for the full series of letters/numbers and their points.
]]>
Wed, 07 Jun 2006 06:38:31 -0500
|
{
"url": "http://phpdeveloper.org/feed/tag/pixel",
"source_domain": "phpdeveloper.org",
"snapshot_id": "crawl=CC-MAIN-2014-41",
"warc_metadata": {
"Content-Length": "2279",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O6XY535YH53CKWLND7NEHACO5RH62DAN",
"WARC-Concurrent-To": "<urn:uuid:77275b45-62ff-49ae-be82-f1a81d922e31>",
"WARC-Date": "2014-10-01T08:17:14Z",
"WARC-IP-Address": "67.207.139.253",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:HA7IU4H3AS32QTWZI3VJWPWFXXW3TJOL",
"WARC-Record-ID": "<urn:uuid:cd5c1967-48d0-4d21-8305-d7255e564730>",
"WARC-Target-URI": "http://phpdeveloper.org/feed/tag/pixel",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2acf0e02-5b0c-45e7-89a9-6ed40744fdd5>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-234-18-248.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-41\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for September 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
459,
460,
760,
761,
1152,
1153,
1304,
1305,
1309
],
"line_end_idx": [
459,
460,
760,
761,
1152,
1153,
1304,
1305,
1309,
1340
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1340,
"ccnet_original_nlines": 9,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31972789764404297,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0476190485060215,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.27210885286331177,
"rps_doc_frac_unique_words": 0.6601941585540771,
"rps_doc_mean_word_length": 5.116504669189453,
"rps_doc_num_sentences": 17,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.711064338684082,
"rps_doc_word_count": 206,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.04269450157880783,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -121.83497619628906,
"rps_doc_books_importance_length_correction": -121.83496856689453,
"rps_doc_openwebtext_importance": -75.38862609863281,
"rps_doc_openwebtext_importance_length_correction": -75.38862609863281,
"rps_doc_wikipedia_importance": -55.807098388671875,
"rps_doc_wikipedia_importance_length_correction": -55.80097961425781
},
"fasttext": {
"dclm": 0.02801126055419445,
"english": 0.9052610993385315,
"fineweb_edu_approx": 2.6205480098724365,
"eai_general_math": 0.08959043025970459,
"eai_open_web_math": 0.1517583727836609,
"eai_web_code": 0.04972118139266968
}
}
|
{
"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": "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
|
7,322,577,531,351,697,000 |
1
Удаление сообщений в режиме "сообщения"
Topic: Удаление сообщений в режиме "сообщения"
Здравия желаю всем.
Можно ли удалять сообщения скопом за определенный промежуток времени, а не по одному как реализовано сейчас?
Я имею ввиду в режиме просмотра сырых данных - сообщения.
Ситуация:
Есть девайс, который ездил где-то с отключенной симкой внутри, при этом данные накапливал в черный ящик, так как не было возможности отправить сообщения - достался по наследству конторе, которая хочет его замониторить. Так вот при добавлении его на сервис, обеспечении его сим-картой и перепрошивки, из черного ящика данного девайса посыпалась всякая лажа (это про данные); Желательно убрать эту информацию, чтоб клиент не сильно испугался.
Спасибо за внимание.
2
Удаление сообщений в режиме "сообщения"
Re: Удаление сообщений в режиме "сообщения"
mishkan, я так понимаю контроллер уже все данные из чёрного ящика выслал. В таком случае можно предложить вариант, просто удалить объект и создать новый. А если в старом объекте накопились нормальные сообщения, то их можно экспортировать в новый объект.
|
{
"url": "https://forum.wialon.com/viewtopic.php?id=584",
"source_domain": "forum.wialon.com",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "24367",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7DOE2U5JYMN37QGMXDYYSRXZLWM5CDI6",
"WARC-Concurrent-To": "<urn:uuid:c6bfbf10-969e-4147-911a-828a00260edf>",
"WARC-Date": "2022-08-14T06:06:30Z",
"WARC-IP-Address": "193.193.165.141",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LXPQ3O5H6TGZ4SJ5DN3T4ZAZMHBTCXVW",
"WARC-Record-ID": "<urn:uuid:4b9065aa-a0d2-4659-8031-84fa6939bb7b>",
"WARC-Target-URI": "https://forum.wialon.com/viewtopic.php?id=584",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:86547a55-6d2a-437c-9c77-158e4b00f415>"
},
"warc_info": "isPartOf: CC-MAIN-2022-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-209\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
3,
43,
44,
91,
92,
112,
221,
279,
289,
730,
751,
752,
754,
755,
795,
796,
840,
841
],
"line_end_idx": [
2,
3,
43,
44,
91,
92,
112,
221,
279,
289,
730,
751,
752,
754,
755,
795,
796,
840,
841,
1094
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1094,
"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,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015228429809212685,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.9847715497016907,
"rps_doc_frac_unique_words": 0.7088607549667358,
"rps_doc_mean_word_length": 5.734177112579346,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.510211944580078,
"rps_doc_word_count": 158,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1501103788614273,
"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.03863134980201721,
"rps_doc_frac_chars_top_3gram": 0.08388520777225494,
"rps_doc_frac_chars_top_4gram": 0.11037527769804001,
"rps_doc_books_importance": -62.08858871459961,
"rps_doc_books_importance_length_correction": -62.08858871459961,
"rps_doc_openwebtext_importance": -41.2958869934082,
"rps_doc_openwebtext_importance_length_correction": -31.891395568847656,
"rps_doc_wikipedia_importance": -26.175640106201172,
"rps_doc_wikipedia_importance_length_correction": -26.175640106201172
},
"fasttext": {
"dclm": 0.6560296416282654,
"english": 0,
"fineweb_edu_approx": 2.072868585586548,
"eai_general_math": -0.000009780000254977494,
"eai_open_web_math": 0.35256290435791016,
"eai_web_code": 0.40456777811050415
}
}
|
{
"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": "-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": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-9,191,691,487,297,858,000 |
jump to navigation
Counting the Cost #3 May 22, 2009
Posted by mwidlake in performance.
Tags: , ,
trackback
I’m sorry for the delay, I will now continue to look at the fastest way to count the rows in a table and what we can learn from it.
Today I will show you how you could potentially add a bitmap index to greatly speed up the count.
I’ve got a new test script that you can run that does most of the steps below. You can get it from here.
See this first posting for the details of setting up the table and showing that select count(*), count(1) and count(pk) all take the same amount of time and do the same work internally and it probably matters not one jot which you use.
See the second posting for what happens when you select count (column_name) from a table and why I think it is a poor idea to use it to count the number of rows in a table.
Previously I had shown that Oracle chooses to use primary key index to count the number of rows in a table – which has been the fastest way so far.
Oracle will actually use the smallest index it can to count the number of rows. Generally, the smallest index you can create is a bitmap index, as it is stored in such a compact manner. Just take my word on it.
OK, I suppose I better give some supporting evidence rather than just my word.
This is the table:
Name Null? Type
--------------------------------------- --------
ID NOT NULL NUMBER
NUM_1 NUMBER
ID_2 VARCHAR2(41)
NUM_2 NUMBER
NUM_3 NUMBER
NUM_4 NUMBER
VC_1 VARCHAR2(50)
VC_2 VARCHAR2(50)
VC_3 VARCHAR2(250)
These are the sizes of the table and indexes on the table. The column used/leaf takes into account empty blocks in a table and just the leaf blocks in an index, which are the blocks scanned in a full scan:
USED/
SEGMENT TYPE BLOCKS LEAF SIZE_K
--------- -------- ------- ----- ------
TEST_1 TABLE 1152 1079 9,216
T_PK INDEX 48 41 384 Primary key on ID
T_UQ INDEX 56 47 448 Unique idx on ID2
T_NONUQ INDEX 48 39 384 nonunique on NUM
T_SPARSE INDEX 8 4 64 on NUM4, 95% null
I am now going to create a simple bitmap index on NUM_3, a non-mandatory column but it does have a non-null value in every row.
Now to do something that can make counts faster, add a nice, compact bitmap index.
create bitmap index t_bm on test_1(num_3);
Index created.
Elapsed: 00:00:00.04
test102>analyze table test_1 compute statistics;
Table analyzed.
Elapsed: 00:00:00.29
I’ve gathered stats again so that the CBO knows about the index. Let’s start with a count of the column. We would expect that to use the new index.
— count on the indexed column
select count(num_3) from test_1;
COUNT(NUM_3)
————
19999
Execution Plan
———————————————————-
Plan hash value: 864032431
————————————————————————————–
| Id | Operation | Name | Rows | Bytes | Cost (%CPU)| Time |
————————————————————————————–
| 0 | SELECT STATEMENT | | 1 | 2 | 5 (0)| 00:00:01 |
| 1 | SORT AGGREGATE | | 1 | 2 | | |
| 2 | BITMAP CONVERSION TO ROWIDS | | 19999 | 39998 | 5 (0)| 00:00:01 |
| 3 | BITMAP INDEX FAST FULL SCAN| T_BM | | | | |
————————————————————————————–
Statistics
———————————————————-
1 recursive calls
0 db block gets
10 consistent gets
0 physical reads
As you can see, the CBO is using the new index and the cost has dropped down to 5 {please note, this is the estimated cost, but it is accurate in this case. I might do a blog entry on testing changes in very quick statements}. Consistent Gets is down to 10.
Let’s compare that to what was previously the fastest way to count the records, count(*) {or count(1) {or count(pk)}}, which had a cost of 11 and 46 consistent gets.
COUNT(*)
———-
19999
———————————————————————-
| Id | Operation | Name | Rows | Cost (%CPU)| Time |
———————————————————————-
| 0 | SELECT STATEMENT | | 1 | 11 (0)| 00:00:01 |
| 1 | SORT AGGREGATE | | 1 | | |
| 2 | INDEX FAST FULL SCAN| T_PK | 19999 | 11 (0)| 00:00:01 |
———————————————————————-
Statistics
———————————————————-
0 recursive calls
0 db block gets
46 consistent gets
0 physical reads
How big is the new index?
SEGMENT TYPE BLOCKS LEAF SIZE_K
---------- ------- ------- ----- --------
T_BM INDEX 16 5 128
T_PK INDEX 48 41 384
I’ll run the count of NUM_3 a second time to get rid of any parse overhead.
select count(num_3) from test_1;
COUNT(NUM_3)
————
19999
Execution Plan
Plan hash value: 864032431
————————————————————————————–
| Id | Operation | Name | Rows | Bytes | Cost (%CPU)| Time |
————————————————————————————–
| 0 | SELECT STATEMENT | | 1 | 2 | 5 (0)| 00:00:01 |
| 1 | SORT AGGREGATE | | 1 | 2 | | |
| 2 | BITMAP CONVERSION TO ROWIDS | | 19999 | 39998 | 5 (0)| 00:00:01 |
| 3 | BITMAP INDEX FAST FULL SCAN| T_BM | | | | |
————————————————————————————–
Statistics
———————————————————-
0 recursive calls
0 db block gets
10 consistent gets
The bitmap index has 5 leaf blocks, a cost of 5 and there are 10 consistent gets.
The primary key has 41 leaf blocks, a cost of 11 and 46 consistent gets.
{Don’t worry too much about the relationship between blocks, costs and consistent gets, I’ll cover that in a later posting}
Bitmap indexes are unlike normal Oracle indexes in that they also index nulls. Thus a count (*) on the table can be answered by the CBO by using the smaller bitmap index. Here is the proof (second run only shown)
— traditional count(*)
select count(*) from test_1;
COUNT(*)
———-
19999
Execution Plan
———————————————————-
Plan hash value: 1066692852
——————————————————————————
| Id | Operation | Name | Rows | Cost (%CPU)| Time |
——————————————————————————
| 0 | SELECT STATEMENT | | 1 | 5 (0)| 00:00:01 |
| 1 | SORT AGGREGATE | | 1 | | |
| 2 | BITMAP CONVERSION COUNT | | 19999 | 5 (0)| 00:00:01 |
| 3 | BITMAP INDEX FAST FULL SCAN| T_BM | | | |
——————————————————————————
Statistics
———————————————————-
0 recursive calls
0 db block gets
10 consistent gets
We see the same stats and cost, but look carefully and you will see that the Plan Hash Value is different and the plan is slightly different. The BITMAP CONVERSION TO ROWIDS has become a BITMAP CONVERSION COUNT. This is because, when we said count(NUM_3) we were asking for a count of NON-NULL values for column NUM_3, so the CBO had to handle that. Count(*) just wants to know how many rows there are.
{I am not sure exactly is being done by the conversion to rowids in this case as the CBO has no need to visit the table. It should be able to just ignore the bitmap for null values. Maybe it does so but this is how Explain Plan reports the activity. Maybe I should ask Jonathan Lewis :-)}
Here are just two quick proofs that select count (PK) and count (1) will both use this smaller index:
— count on pk column
select count(id) from test_1;
COUNT(ID)
———-
19999
Execution Plan
———————————————————-
Plan hash value: 1066692852
——————————————————————————
| Id | Operation | Name | Rows | Cost (%CPU)| Time |
——————————————————————————
| 0 | SELECT STATEMENT | | 1 | 5 (0)| 00:00:01 |
| 1 | SORT AGGREGATE | | 1 | | |
| 2 | BITMAP CONVERSION COUNT | | 19999 | 5 (0)| 00:00:01 |
| 3 | BITMAP INDEX FAST FULL SCAN| T_BM | | | |
——————————————————————————
Statistics
———————————————————-
1 recursive calls
0 db block gets
10 consistent gets
— count on a static value
select count(1) from test_1;
COUNT(1)
———-
19999
Execution Plan
———————————————————-
Plan hash value: 1066692852
——————————————————————————
| Id | Operation | Name | Rows | Cost (%CPU)| Time |
——————————————————————————
| 0 | SELECT STATEMENT | | 1 | 5 (0)| 00:00:01 |
| 1 | SORT AGGREGATE | | 1 | | |
| 2 | BITMAP CONVERSION COUNT | | 19999 | 5 (0)| 00:00:01 |
| 3 | BITMAP INDEX FAST FULL SCAN| T_BM | | | |
——————————————————————————
Statistics
———————————————————-
1 recursive calls
0 db block gets
10 consistent gets
Finally for this post (and I know, I do go on a bit) I will show that the CBO will use the bitmap to count the number of values in a column that it knows is mandatory – presumably someone in the Oracle Optimisation team recognised that such a count is counting the number of rows, so just count the number of rows the quickest way possible (which is to use the smallest index which is on a mandatory column or is a bitmap index, I suspect).
First, a count on a column that is NOT mandatory, which has a unique index on it. The CBO uses the supporting index:-
–count on a non-pk unique column
select count(id_2) from test_1;
COUNT(ID_2)
———–
19999
Execution Plan
———————————————————-
Plan hash value: 341132572
——————————————————————————
| Id | Operation | Name | Rows | Bytes | Cost (%CPU)| Time |
——————————————————————————
| 0 | SELECT STATEMENT | | 1 | 6 | 12 (0)| 00:00:01 |
| 1 | SORT AGGREGATE | | 1 | 6 | | |
| 2 | INDEX FAST FULL SCAN| T_UQ | 19999 | 117K| 12 (0)| 00:00:01 |
——————————————————————————
Statistics
———————————————————-
0 recursive calls
0 db block gets
52 consistent gets
0 physical reads
Cost of 12, 52 consistent gets. Now let us make the column mandatory, analyze the table and select count (NUM_2) again {I show the second run only, as the first run has the parse overhead}
alter table test_1
modify num_2 not null;
Table altered.
test102>analyze table test_1 compute statistics;
Table analyzed.
select count(num_2) from test_1;
COUNT(NUM_2)
————
19999
Execution Plan
———————————————————-
Plan hash value: 1066692852
——————————————————————————
| Id | Operation | Name | Rows | Cost (%CPU)| Time |
——————————————————————————
| 0 | SELECT STATEMENT | | 1 | 5 (0)| 00:00:01 |
| 1 | SORT AGGREGATE | | 1 | | |
| 2 | BITMAP CONVERSION COUNT | | 19999 | 5 (0)| 00:00:01 |
| 3 | BITMAP INDEX FAST FULL SCAN| T_BM | | | |
——————————————————————————
Statistics
———————————————————-
0 recursive calls
0 db block gets
10 consistent gets
0 physical reads
And there we go, a cost of 5, consistent gets of 10 and the same plan/plan hash value as count(*).
I still would not select count(column) as a general rule UNLESS I wanted to count non-null values of that column, but the CBO will step in and use the most efficient way it can to count the rows in a table, if it can identify that counting all the rows is what you really want to do.
I’ve managed to write a lot and learn a lot from a very, very simple statement!
My next post will be on even faster ways of {sort of} getting the number of rows in a table.
Advertisements
Comments»
1. PdV - May 23, 2009
Fascination stuff.
Just out of the blue, I’m thinking: The fastest way to keep count of something is to have an object (index?) that is guaranteed to “know” of all the rows.
Unless you are thinking of a running-total-trigger or an MVIEW with count(1) in it. If it is at all possible, that would be a bit of a stunt, just for keeping count.
But not sure if it would be efficient (on commit…).
2. Counting the Cost #4 – The speedy way « Martin Widlake’s Yet Another Oracle Blog - May 26, 2009
[…] are used when you count a single column in a table and why it is not always a good idea. The third post shows how Oracle will use the smallest index it can to select count(*) and in particular how a […]
Leave a Reply
Fill in your details below or click an icon to log in:
WordPress.com Logo
You are commenting using your WordPress.com account. Log Out / Change )
Google+ photo
You are commenting using your Google+ account. Log Out / Change )
Twitter picture
You are commenting using your Twitter account. Log Out / Change )
Facebook photo
You are commenting using your Facebook account. Log Out / Change )
w
Connecting to %s
%d bloggers like this:
|
{
"url": "https://mwidlake.wordpress.com/2009/05/22/counting-the-cost/?like=1&source=post_flair&_wpnonce=317f4d0876",
"source_domain": "mwidlake.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2018-22",
"warc_metadata": {
"Content-Length": "82152",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OONPC6AOVB6GUP5JBJ5MQKOUHSQB5JLH",
"WARC-Concurrent-To": "<urn:uuid:78e9874f-9183-40d7-bb10-5e1112a85f45>",
"WARC-Date": "2018-05-21T14:47:47Z",
"WARC-IP-Address": "192.0.78.12",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:3CE5DIKEVVPFS7NN6TC5ZXK3VI2LLQ3C",
"WARC-Record-ID": "<urn:uuid:633ae933-666d-4077-a8a4-05863c8a8072>",
"WARC-Target-URI": "https://mwidlake.wordpress.com/2009/05/22/counting-the-cost/?like=1&source=post_flair&_wpnonce=317f4d0876",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e22003c3-ad98-4b41-88d5-9168ab5c5b08>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-31-118-222.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-22\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for May 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
19,
20,
54,
55,
90,
100,
110,
111,
243,
244,
342,
343,
448,
449,
685,
686,
859,
860,
1008,
1009,
1220,
1221,
1300,
1319,
1320,
1367,
1418,
1466,
1516,
1574,
1624,
1674,
1724,
1782,
1840,
1899,
1900,
2106,
2107,
2158,
2200,
2240,
2283,
2351,
2419,
2482,
2550,
2551,
2679,
2680,
2763,
2764,
2807,
2822,
2843,
2844,
2893,
2909,
2930,
2931,
3079,
3080,
3110,
3143,
3144,
3157,
3162,
3168,
3169,
3184,
3205,
3232,
3262,
3323,
3353,
3406,
3443,
3515,
3565,
3595,
3596,
3607,
3628,
3646,
3662,
3681,
3698,
3699,
3957,
3958,
4124,
4125,
4134,
4139,
4145,
4146,
4171,
4224,
4249,
4299,
4332,
4394,
4419,
4420,
4431,
4452,
4470,
4486,
4505,
4522,
4523,
4549,
4550,
4592,
4634,
4687,
4741,
4742,
4818,
4819,
4852,
4853,
4866,
4871,
4877,
4878,
4893,
4920,
4950,
5011,
5041,
5094,
5131,
5203,
5253,
5283,
5284,
5295,
5316,
5334,
5350,
5369,
5370,
5452,
5525,
5526,
5650,
5651,
5864,
5865,
5888,
5917,
5918,
5927,
5932,
5938,
5939,
5954,
5975,
6003,
6030,
6083,
6110,
6159,
6192,
6252,
6300,
6327,
6328,
6339,
6360,
6378,
6394,
6413,
6414,
6817,
7106,
7107,
7209,
7210,
7231,
7261,
7262,
7272,
7277,
7283,
7284,
7299,
7320,
7348,
7375,
7428,
7455,
7504,
7537,
7597,
7645,
7672,
7673,
7684,
7705,
7723,
7739,
7758,
7759,
7785,
7814,
7815,
7824,
7829,
7835,
7836,
7851,
7872,
7900,
7927,
7980,
8007,
8056,
8089,
8149,
8197,
8224,
8225,
8236,
8257,
8275,
8291,
8310,
8311,
8752,
8753,
8871,
8872,
8905,
8937,
8938,
8950,
8955,
8961,
8962,
8977,
8998,
9025,
9052,
9113,
9140,
9194,
9231,
9299,
9326,
9327,
9338,
9359,
9377,
9393,
9412,
9429,
9430,
9619,
9620,
9639,
9662,
9663,
9678,
9679,
9728,
9729,
9745,
9746,
9779,
9780,
9793,
9798,
9804,
9805,
9820,
9841,
9869,
9896,
9949,
9976,
10025,
10058,
10118,
10166,
10193,
10194,
10205,
10226,
10244,
10260,
10279,
10296,
10297,
10396,
10680,
10681,
10761,
10762,
10855,
10856,
10871,
10872,
10882,
10883,
10905,
10906,
10925,
11080,
11246,
11298,
11299,
11398,
11399,
11606,
11607,
11608,
11622,
11623,
11678,
11679,
11698,
11699,
11772,
11773,
11787,
11788,
11855,
11856,
11872,
11873,
11940,
11941,
11956,
11957,
12025,
12026,
12028,
12029,
12046,
12047
],
"line_end_idx": [
19,
20,
54,
55,
90,
100,
110,
111,
243,
244,
342,
343,
448,
449,
685,
686,
859,
860,
1008,
1009,
1220,
1221,
1300,
1319,
1320,
1367,
1418,
1466,
1516,
1574,
1624,
1674,
1724,
1782,
1840,
1899,
1900,
2106,
2107,
2158,
2200,
2240,
2283,
2351,
2419,
2482,
2550,
2551,
2679,
2680,
2763,
2764,
2807,
2822,
2843,
2844,
2893,
2909,
2930,
2931,
3079,
3080,
3110,
3143,
3144,
3157,
3162,
3168,
3169,
3184,
3205,
3232,
3262,
3323,
3353,
3406,
3443,
3515,
3565,
3595,
3596,
3607,
3628,
3646,
3662,
3681,
3698,
3699,
3957,
3958,
4124,
4125,
4134,
4139,
4145,
4146,
4171,
4224,
4249,
4299,
4332,
4394,
4419,
4420,
4431,
4452,
4470,
4486,
4505,
4522,
4523,
4549,
4550,
4592,
4634,
4687,
4741,
4742,
4818,
4819,
4852,
4853,
4866,
4871,
4877,
4878,
4893,
4920,
4950,
5011,
5041,
5094,
5131,
5203,
5253,
5283,
5284,
5295,
5316,
5334,
5350,
5369,
5370,
5452,
5525,
5526,
5650,
5651,
5864,
5865,
5888,
5917,
5918,
5927,
5932,
5938,
5939,
5954,
5975,
6003,
6030,
6083,
6110,
6159,
6192,
6252,
6300,
6327,
6328,
6339,
6360,
6378,
6394,
6413,
6414,
6817,
7106,
7107,
7209,
7210,
7231,
7261,
7262,
7272,
7277,
7283,
7284,
7299,
7320,
7348,
7375,
7428,
7455,
7504,
7537,
7597,
7645,
7672,
7673,
7684,
7705,
7723,
7739,
7758,
7759,
7785,
7814,
7815,
7824,
7829,
7835,
7836,
7851,
7872,
7900,
7927,
7980,
8007,
8056,
8089,
8149,
8197,
8224,
8225,
8236,
8257,
8275,
8291,
8310,
8311,
8752,
8753,
8871,
8872,
8905,
8937,
8938,
8950,
8955,
8961,
8962,
8977,
8998,
9025,
9052,
9113,
9140,
9194,
9231,
9299,
9326,
9327,
9338,
9359,
9377,
9393,
9412,
9429,
9430,
9619,
9620,
9639,
9662,
9663,
9678,
9679,
9728,
9729,
9745,
9746,
9779,
9780,
9793,
9798,
9804,
9805,
9820,
9841,
9869,
9896,
9949,
9976,
10025,
10058,
10118,
10166,
10193,
10194,
10205,
10226,
10244,
10260,
10279,
10296,
10297,
10396,
10680,
10681,
10761,
10762,
10855,
10856,
10871,
10872,
10882,
10883,
10905,
10906,
10925,
11080,
11246,
11298,
11299,
11398,
11399,
11606,
11607,
11608,
11622,
11623,
11678,
11679,
11698,
11699,
11772,
11773,
11787,
11788,
11855,
11856,
11872,
11873,
11940,
11941,
11956,
11957,
12025,
12026,
12028,
12029,
12046,
12047,
12069
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 12069,
"ccnet_original_nlines": 342,
"rps_doc_curly_bracket": 0.0011599999852478504,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2796039581298828,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08712870627641678,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3635643720626831,
"rps_doc_frac_unique_words": 0.2513691186904907,
"rps_doc_mean_word_length": 4.604052543640137,
"rps_doc_num_sentences": 65,
"rps_doc_symbol_to_word_ratio": 0.001980199944227934,
"rps_doc_unigram_entropy": 5.365288734436035,
"rps_doc_word_count": 1826,
"rps_doc_frac_chars_dupe_10grams": 0.25490662455558777,
"rps_doc_frac_chars_dupe_5grams": 0.3940763473510742,
"rps_doc_frac_chars_dupe_6grams": 0.35613179206848145,
"rps_doc_frac_chars_dupe_7grams": 0.33971691131591797,
"rps_doc_frac_chars_dupe_8grams": 0.3004639148712158,
"rps_doc_frac_chars_dupe_9grams": 0.28178900480270386,
"rps_doc_frac_chars_top_2gram": 0.01332223042845726,
"rps_doc_frac_chars_top_3gram": 0.011419059708714485,
"rps_doc_frac_chars_top_4gram": 0.018080169335007668,
"rps_doc_books_importance": -1441.7088623046875,
"rps_doc_books_importance_length_correction": -1441.7088623046875,
"rps_doc_openwebtext_importance": -900.6449584960938,
"rps_doc_openwebtext_importance_length_correction": -900.6449584960938,
"rps_doc_wikipedia_importance": -739.0441284179688,
"rps_doc_wikipedia_importance_length_correction": -739.0441284179688
},
"fasttext": {
"dclm": 0.9804090857505798,
"english": 0.7719377875328064,
"fineweb_edu_approx": 1.5892187356948853,
"eai_general_math": 0.136583149433136,
"eai_open_web_math": 0.12884372472763062,
"eai_web_code": 0.4765772819519043
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.756",
"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": "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": "16",
"label": "Personal Blog"
},
"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
|
2,110,863,010,480,354,800 |
0
javaでCSVファイル出力処理にて時々以下のエラーが発生しています。（週に1回ぐらいペースで）
なぜ時々だけ java.io.FileNotFoundException エラーが発生しているのでしょうか？
対策方法があれば教えていただけないでしょうか？
エラーメッセージ
java.io.FileNotFoundException: \\d\output\test.csv
(プロセスはファイルにアクセスできません。別のプロセスが使用中です。)
ソース (※下記処理がサンプルコードでfor文の中で繰り返して処理を行っています）
public int execute(String... args) throws Exception {
// ////////////
// 初期処理 //
// ////////////
// プロパティファイル取得
batchProperty = getBatchProp();
// ログ出力用
Logger logger = getLogger();
// バッチ開始ログ出力
logger.log(INFO, batchProperty.getProperty("I001"));
try {
// CSVのファイル名
String fileName = "test.csv";
// CSV出力先ディレクトリ取得
String csvDir = "D:\\batch\\output\\";
File csvDirectory = new File(csvDir);
// CSVディレクトリ存在チェック
if (!csvDirectory.exists()) {
// 指定されたディレクトリがない場合、エラー
logger.log(ERROR, MessageFormat.format(
"E001", "指定されたディレクトリ(" + csvDir +")が存在しません。"));
// バッチ終了ログ出力
return 9;
}
// /////////////////////////
// 物件件数リスト取得処理 //
// /////////////////////////
// 物件件数リスト格納用リスト
List<BukkenCntCsvInfo> targetList = new ArrayList<BukkenCntCsvInfo>();
// 物件件数リストの取得
targetList = outputBukkenCntCsvService.selectBukkenCntList("city", "1");
// ////////////////////
// CSVファイル作成処理 //
// ////////////////////
// CSVファイルヘッダ行設定処理
createCsvHeader(csvDir + fileName, "city");
// CSV作成件数リセット
csvCount = 0;
// 取得した処理対象を1行ずつ処理
for (BukkenCntCsvInfo elements : targetList) {
// CSV作成件数カウント
csvCount++;
// CSVファイル作成処理
createCsv(elements, csvDir + fileName, "1");
}
} catch (IOException e) {
e.printStackTrace();
return 9;
} catch (Exception e) {
e.printStackTrace();
return 9;
}
return 1;
}
/**
* CSVファイルヘッダ行設定処理
*
* @throws IOException
*/
private void createCsvHeader(String createFile, String listSb)
throws IOException {
// 出力内容の設定
PrintWriter bukkenCntInfo = new PrintWriter(new BufferedWriter(
new OutputStreamWriter(new FileOutputStream(createFile, false),
"SJIS")));
bukkenCntInfo.print("\"");
bukkenCntInfo.print("都道府県名");
bukkenCntInfo.print("\"");
bukkenCntInfo.print(",");
bukkenCntInfo.print("\"");
bukkenCntInfo.print("物件件数");
bukkenCntInfo.print("\"");
bukkenCntInfo.println();
bukkenCntInfo.close();
}
/**
* CSVファイルデータ設定処理
*
* @throws IOException
*/
private void createCsv(BukkenCntCsvInfo target, String createFile, String listSb)
throws IOException {
// 出力内容の設定
PrintWriter bukkenCntInfo = new PrintWriter(new BufferedWriter(
new OutputStreamWriter(new FileOutputStream(createFile, true),
"SJIS")));
bukkenCntInfo.print("\"");
bukkenCntInfo.print(target.sTodoufukenName);
bukkenCntInfo.print("\"");
bukkenCntInfo.print(",");
bukkenCntInfo.print("\"");
bukkenCntInfo.print(target.nCount);
bukkenCntInfo.print("\"");
bukkenCntInfo.println();
bukkenCntInfo.close();
}
| この質問を改善する | |
• 質問時はコードの一部分だけを抜き出すのではなく、他の人が再現できるように動作するコードを提示してください。エラーの内容から察するに、for 文も含めたコードを眺めないと問題箇所が正しく把握できないような気がします。 / 参考: 再現可能な短いサンプルコードの書き方 – cubick 2月26日 7:33
• @cubick ご指摘ありがとうございます。コードを再び記載しました。問題になっているのがcreateCsvメソッド（CSVファイルデータ設定処理）かと思います。よろしくお願いします。 – カイン 2月26日 8:02
• 1
ファイルを作るとセキュリティソフトがリアルタイム検索しますが、それと競合しているのではないかと妄想。 – 774RR 2月26日 9:24
• あとは、メッセージを素直に取ると、たまたま同じ出力ファイル名になってしまうプロセスが複数同時に動作してしまったとか。 – kunif 2月26日 9:51
• close()処理がbukkenCntInoに対してしか明示的に行われていないため、PrintWriter以外のBufferedWriter,OutputStreamWriter,FileOutputStreamのclose処理がループ中に間に合わない場合があるのではないでしょうか。try-with-resource文を使ってbukkenCntInfoの生成処理を書いてみてはどうでしょう。 – Sugiyama Koichi 2月27日 7:16
0
解決するか自信がないですが、close()処理を呼ばなくても自動で行うように、ということでtry-with-resourecesで書いてみます。
private void createCsv(BukkenCntCsvInfo target, String createFile, String listSb)
throws IOException {
// 出力内容の設定
try (PrintWriter bukkenCntInfo = new PrintWriter(new BufferedWriter(
new OutputStreamWriter(new FileOutputStream(createFile, true),
"SJIS")))) {
bukkenCntInfo.print("\"");
bukkenCntInfo.print(target.sTodoufukenName);
bukkenCntInfo.print("\"");
bukkenCntInfo.print(",");
bukkenCntInfo.print("\"");
bukkenCntInfo.print(target.nCount);
bukkenCntInfo.print("\"");
bukkenCntInfo.println();
} catch (Exception e) {
throw e;
}
}
| この回答を改善する | |
0
はじめまして、こんにちは。
まず前提ですが、このエラーはJavaによるものではなくWindowsが戻しているものとなります。
文章のとおり他のプロセスが、ファイルハンドルを開いているため
ファイルを開くことができないのが原因です。これにはいろいろな原因が考えられます。
• 正常にファイルが閉じられていない
• 途中でプロセスが止まったので開いたままになっている
• 共有経由で他のユーザーやウィルス対策などのツールがファイルを開いている
これを回避するには以下の手段が考えられると思います
• きちんとファイルを閉じる
=> ただしコメントでふれらている通りどうしようもないケースもあります
• 出力ファイル名を日付や現在時刻などを利用して毎回変える
=> ファイル名が変化するので共有している場合問題になるかもしれません
• 同時アクセスを制御できるようなシステム上に処理をくみ上げる
=> サーブレットでCSVを出力してメモリサーバーに保持、共有はURLを介して行うなど
| この回答を改善する | |
回答
“回答を投稿”をクリックすることで利用規約プライバシーポリシー、及びクッキーポリシーに同意したものとみなされます。
求めていた回答ではありませんか？ のタグが付いた他の質問を参照するか、自分で質問をする
|
{
"url": "https://ja.stackoverflow.com/questions/63369/java-io-filenotfoundexception-%E3%83%97%E3%83%AD%E3%82%BB%E3%82%B9%E3%81%AF%E3%83%95%E3%82%A1%E3%82%A4%E3%83%AB%E3%81%AB%E3%82%A2%E3%82%AF%E3%82%BB%E3%82%B9%E3%81%A7%E3%81%8D%E3%81%BE%E3%81%9B%E3%82%93-%E5%88%A5%E3%81%AE%E3%83%97%E3%83%AD%E3%82%BB%E3%82%B9%E3%81%8C%E4%BD%BF%E7%94%A8%E4%B8%AD%E3%81%A7%E3%81%99",
"source_domain": "ja.stackoverflow.com",
"snapshot_id": "crawl=CC-MAIN-2020-50",
"warc_metadata": {
"Content-Length": "165646",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OKPZR7XQ7X2UH37VNL2DNUMQNBIG25UA",
"WARC-Concurrent-To": "<urn:uuid:359626ef-e99d-4d17-8602-a7f4765fe4e1>",
"WARC-Date": "2020-12-01T21:58:48Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HFWAFXVLNE3ML3TZPSDOA6ZPLWN6BCYA",
"WARC-Record-ID": "<urn:uuid:597b4325-72dd-45bb-9ce8-d2fdede04ff3>",
"WARC-Target-URI": "https://ja.stackoverflow.com/questions/63369/java-io-filenotfoundexception-%E3%83%97%E3%83%AD%E3%82%BB%E3%82%B9%E3%81%AF%E3%83%95%E3%82%A1%E3%82%A4%E3%83%AB%E3%81%AB%E3%82%A2%E3%82%AF%E3%82%BB%E3%82%B9%E3%81%A7%E3%81%8D%E3%81%BE%E3%81%9B%E3%82%93-%E5%88%A5%E3%81%AE%E3%83%97%E3%83%AD%E3%82%BB%E3%82%B9%E3%81%8C%E4%BD%BF%E7%94%A8%E4%B8%AD%E3%81%A7%E3%81%99",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8d9093b6-a339-41ac-8444-84aed8ad46ad>"
},
"warc_info": "isPartOf: CC-MAIN-2020-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-29.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
3,
52,
53,
108,
132,
133,
142,
143,
194,
231,
232,
274,
275,
333,
334,
358,
377,
401,
402,
425,
465,
466,
483,
520,
521,
542,
603,
604,
618,
619,
652,
702,
740,
799,
857,
858,
897,
947,
995,
1059,
1139,
1176,
1210,
1232,
1233,
1282,
1320,
1369,
1370,
1407,
1498,
1499,
1533,
1626,
1627,
1671,
1709,
1753,
1754,
1793,
1857,
1858,
1893,
1927,
1928,
1967,
2034,
2073,
2109,
2110,
2149,
2218,
2240,
2241,
2275,
2308,
2342,
2343,
2375,
2408,
2430,
2431,
2441,
2459,
2465,
2466,
2474,
2497,
2504,
2531,
2539,
2606,
2639,
2640,
2659,
2731,
2811,
2846,
2881,
2919,
2954,
2988,
3023,
3060,
3095,
3128,
3159,
3165,
3166,
3174,
3196,
3203,
3230,
3238,
3324,
3357,
3358,
3377,
3449,
3528,
3563,
3564,
3599,
3652,
3687,
3721,
3756,
3800,
3835,
3868,
3899,
3905,
3921,
4078,
4192,
4198,
4272,
4354,
4584,
4586,
4587,
4660,
4661,
4743,
4772,
4773,
4788,
4861,
4936,
4969,
4970,
5005,
5058,
5093,
5127,
5162,
5206,
5241,
5274,
5302,
5319,
5325,
5327,
5343,
5345,
5346,
5360,
5361,
5410,
5441,
5482,
5483,
5504,
5534,
5574,
5575,
5601,
5602,
5619,
5659,
5691,
5731,
5765,
5813,
5829,
5830,
5833,
5834,
5892,
5893
],
"line_end_idx": [
2,
3,
52,
53,
108,
132,
133,
142,
143,
194,
231,
232,
274,
275,
333,
334,
358,
377,
401,
402,
425,
465,
466,
483,
520,
521,
542,
603,
604,
618,
619,
652,
702,
740,
799,
857,
858,
897,
947,
995,
1059,
1139,
1176,
1210,
1232,
1233,
1282,
1320,
1369,
1370,
1407,
1498,
1499,
1533,
1626,
1627,
1671,
1709,
1753,
1754,
1793,
1857,
1858,
1893,
1927,
1928,
1967,
2034,
2073,
2109,
2110,
2149,
2218,
2240,
2241,
2275,
2308,
2342,
2343,
2375,
2408,
2430,
2431,
2441,
2459,
2465,
2466,
2474,
2497,
2504,
2531,
2539,
2606,
2639,
2640,
2659,
2731,
2811,
2846,
2881,
2919,
2954,
2988,
3023,
3060,
3095,
3128,
3159,
3165,
3166,
3174,
3196,
3203,
3230,
3238,
3324,
3357,
3358,
3377,
3449,
3528,
3563,
3564,
3599,
3652,
3687,
3721,
3756,
3800,
3835,
3868,
3899,
3905,
3921,
4078,
4192,
4198,
4272,
4354,
4584,
4586,
4587,
4660,
4661,
4743,
4772,
4773,
4788,
4861,
4936,
4969,
4970,
5005,
5058,
5093,
5127,
5162,
5206,
5241,
5274,
5302,
5319,
5325,
5327,
5343,
5345,
5346,
5360,
5361,
5410,
5441,
5482,
5483,
5504,
5534,
5574,
5575,
5601,
5602,
5619,
5659,
5691,
5731,
5765,
5813,
5829,
5830,
5833,
5834,
5892,
5893,
5936
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5936,
"ccnet_original_nlines": 191,
"rps_doc_curly_bracket": 0.003706200048327446,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.04055944085121155,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03076923079788685,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.6265734434127808,
"rps_doc_frac_unique_words": 0.5492424368858337,
"rps_doc_mean_word_length": 13.79924201965332,
"rps_doc_num_sentences": 47,
"rps_doc_symbol_to_word_ratio": 0.0013986000558361411,
"rps_doc_unigram_entropy": 4.674645900726318,
"rps_doc_word_count": 264,
"rps_doc_frac_chars_dupe_10grams": 0.25336259603500366,
"rps_doc_frac_chars_dupe_5grams": 0.25336259603500366,
"rps_doc_frac_chars_dupe_6grams": 0.25336259603500366,
"rps_doc_frac_chars_dupe_7grams": 0.25336259603500366,
"rps_doc_frac_chars_dupe_8grams": 0.25336259603500366,
"rps_doc_frac_chars_dupe_9grams": 0.25336259603500366,
"rps_doc_frac_chars_top_2gram": 0.059291791170835495,
"rps_doc_frac_chars_top_3gram": 0.018116939812898636,
"rps_doc_frac_chars_top_4gram": 0.02305792085826397,
"rps_doc_books_importance": -263.9239196777344,
"rps_doc_books_importance_length_correction": -263.9239196777344,
"rps_doc_openwebtext_importance": -194.33010864257812,
"rps_doc_openwebtext_importance_length_correction": -194.33010864257812,
"rps_doc_wikipedia_importance": -140.6656036376953,
"rps_doc_wikipedia_importance_length_correction": -140.6656036376953
},
"fasttext": {
"dclm": 0.5508390069007874,
"english": 0.003914690110832453,
"fineweb_edu_approx": 2.0393059253692627,
"eai_general_math": 0.05151188001036644,
"eai_open_web_math": 0.0454641617834568,
"eai_web_code": 0.43005669116973877
}
}
|
{
"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": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-88,830,808,368,614,200 |
NearestTo
NearestTo[x]
is an operator form that yields Nearest[elems,x] when applied to a list elems.
NearestTo[x,n]
is an operator form that yields Nearest[elems,x,n] when applied to a list elems.
NearestTo[x,{n,r}]
is an operator form that yields Nearest[elems,x,{n,r}] when applied to a list elems.
Details and Options
• NearestTo works for a variety of data, including numerical, geospatial, textual and visual, as well as dates and times.
• NearestTo[x][elems] is equivalent to NearestTo[elems,x].
• NearestTo[x,nr][elems] is equivalent to NearestTo[elems,x,nr], where nr is an integer n or a pair {n,r}.
• NearestTo[x][nf] for a NearestFunction object nf is equivalent to nf[x].
• NearestTo[x,nr][nf] for a NearestFunction object nf is equivalent to nf[x,nr], where nr is an integer n or a pair {n,r}.
Examples
open allclose all
Basic Examples (4)
Find the element nearest to 20:
Find the 3 elements nearest to 20:
Find which element is nearest to {2,3} in 2D:
Find nearest colors:
Find nearest strings:
Scope (6)
Give the 3 nearest elements:
Give the elements within radius 2:
Give at most 3 nearest elements within radius 2:
Apply NearestTo to a NearestFunction expression:
The same result can be obtained by direct application of nf:
Return the index for the nearest string:
Return an Association giving the string element, index and distance:
Find the 3 elements nearest to 20, simultaneously reporting the elements and their distance to 20:
Find which element is nearest to {2,3} in 2D and return the appropriate label:
Compute the same result using an Association:
Find the element whose density is closest to a given value:
Options (1)
DistanceFunction (1)
By default, normal Euclidean distance is used for points:
Use the ManhattanDistance, which sums the length of each side:
The ChessboardDistance only takes into account the dimension with the largest separation:
Applications (3)
Find nearest words in a dictionary:
Find the nearest image partition to a subimage:
Take the polygon of Mexico:
Compute the nearest of the points of that polygon from your current geo location:
Draw the geodesic from your location to that point:
Properties & Relations (2)
In the case of a tie, all nearest elements are returned in order:
NearestTo[x][elems] effectively reverses the order of the first two arguments of Nearest:
Introduced in 2018
(11.3)
|
{
"url": "https://reference.wolfram.com/language/ref/NearestTo.html",
"source_domain": "reference.wolfram.com",
"snapshot_id": "crawl=CC-MAIN-2020-34",
"warc_metadata": {
"Content-Length": "101457",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BOB3RM73CALXTSAN3LTB6O5KDTMZ7TMY",
"WARC-Concurrent-To": "<urn:uuid:875d009c-8ec6-4d1f-b99b-eb5b277121e8>",
"WARC-Date": "2020-08-13T12:00:33Z",
"WARC-IP-Address": "140.177.205.163",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:R66GMOTBBAYTW2SVB3MGPXCNRHGQTHR4",
"WARC-Record-ID": "<urn:uuid:c6f446e1-7a83-4168-85d4-c7d8f32d3a30>",
"WARC-Target-URI": "https://reference.wolfram.com/language/ref/NearestTo.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6852b621-feec-444f-b57c-18ee72cbc2f7>"
},
"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-39.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,
10,
11,
24,
25,
104,
105,
120,
121,
202,
203,
222,
223,
308,
309,
329,
330,
454,
515,
624,
701,
826,
827,
836,
837,
855,
856,
876,
877,
909,
910,
945,
946,
992,
993,
1014,
1015,
1037,
1038,
1049,
1050,
1079,
1080,
1115,
1116,
1165,
1166,
1215,
1216,
1277,
1278,
1319,
1320,
1389,
1390,
1489,
1490,
1569,
1570,
1616,
1617,
1677,
1678,
1691,
1692,
1714,
1715,
1773,
1774,
1837,
1838,
1928,
1929,
1947,
1948,
1984,
1985,
2033,
2034,
2062,
2063,
2145,
2146,
2198,
2199,
2227,
2228,
2294,
2295,
2385,
2386,
2405
],
"line_end_idx": [
10,
11,
24,
25,
104,
105,
120,
121,
202,
203,
222,
223,
308,
309,
329,
330,
454,
515,
624,
701,
826,
827,
836,
837,
855,
856,
876,
877,
909,
910,
945,
946,
992,
993,
1014,
1015,
1037,
1038,
1049,
1050,
1079,
1080,
1115,
1116,
1165,
1166,
1215,
1216,
1277,
1278,
1319,
1320,
1389,
1390,
1489,
1490,
1569,
1570,
1616,
1617,
1677,
1678,
1691,
1692,
1714,
1715,
1773,
1774,
1837,
1838,
1928,
1929,
1947,
1948,
1984,
1985,
2033,
2034,
2062,
2063,
2145,
2146,
2198,
2199,
2227,
2228,
2294,
2295,
2385,
2386,
2405,
2412
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2412,
"ccnet_original_nlines": 91,
"rps_doc_curly_bracket": 0.004975120071321726,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3282732367515564,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.003795070108026266,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2751423120498657,
"rps_doc_frac_unique_words": 0.44324323534965515,
"rps_doc_mean_word_length": 5,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.620960235595703,
"rps_doc_word_count": 370,
"rps_doc_frac_chars_dupe_10grams": 0.07027027010917664,
"rps_doc_frac_chars_dupe_5grams": 0.22108107805252075,
"rps_doc_frac_chars_dupe_6grams": 0.22108107805252075,
"rps_doc_frac_chars_dupe_7grams": 0.14162161946296692,
"rps_doc_frac_chars_dupe_8grams": 0.11459459364414215,
"rps_doc_frac_chars_dupe_9grams": 0.07027027010917664,
"rps_doc_frac_chars_top_2gram": 0.00972972996532917,
"rps_doc_frac_chars_top_3gram": 0.030270269140601158,
"rps_doc_frac_chars_top_4gram": 0.02594595029950142,
"rps_doc_books_importance": -234.1808319091797,
"rps_doc_books_importance_length_correction": -234.1808319091797,
"rps_doc_openwebtext_importance": -122.27686309814453,
"rps_doc_openwebtext_importance_length_correction": -122.27686309814453,
"rps_doc_wikipedia_importance": -149.8089141845703,
"rps_doc_wikipedia_importance_length_correction": -149.8089141845703
},
"fasttext": {
"dclm": 0.9454488158226013,
"english": 0.8359565138816833,
"fineweb_edu_approx": 2.6732852458953857,
"eai_general_math": 0.9954111576080322,
"eai_open_web_math": 0.47417718172073364,
"eai_web_code": 0.7525528073310852
}
}
|
{
"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",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Arithmetic"
}
}
},
"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": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-9,034,714,304,539,580,000 |
function.cpp 2.56 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11
#include "function.h"
#include <string>
#include <iostream>
#include <fstream>
#include <limits>
#include <algorithm>
#include <cmath>
#define one_pi 0.31830988618
12 13 14 15 16
ALTA_DLL_EXPORT function* provide_function()
{
return new shifted_gamma_function();
}
17 18 19 20 21 22 23 24 25 26
// Overload the function operator
vec shifted_gamma_function::operator()(const vec& x) const
{
return value(x);
}
vec shifted_gamma_function::value(const vec& x) const
{
// shading
vec lv(3); lv[0] = x[0]; lv[1] = x[1]; lv[2] = x[2];
vec n(3); n[0] = 0.0; n[1] = 0.0; n[2] = 1.0;
27
vec ev(3); ev[0] = x[3]; ev[1] = x[4]; ev[2] = x[5];
28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75
vec halfVector = normalize(lv + ev);
double v_h = dot(ev, halfVector);
double n_h = dot(n, halfVector);
double n_l = dot(n, lv);
double inLight = 1.0;
if (n_l < 0.0) inLight = 0.0;
double n_v = dot(n, ev);
return one_pi * inLight * (n_l * rho_d + rho_s *
D(alpha, p, n_h, K_ap) * G1(n_l) * G1 (n_v) *
Fresnel(F_0, F_1, v_h));
}
//! Load function specific files
void shifted_gamma_function::load(const std::string& filename)
{
}
//! Save the current function to a specific file type
void shifted_gamma_function::save(const std::string& filename, const arguments& args) const
{
}
//! Number of parameters to this non-linear function
int shifted_gamma_function::nbParameters() const
{
}
//! Get the vector of parameters for the function
vec shifted_gamma_function::parameters() const
{
}
//! Update the vector of parameters for the function
void shifted_gamma_function::setParameters(const vec& p)
{
}
//! Obtain the derivatives of the function with respect to the
//! parameters.
vec shifted_gamma_function::parametersJacobian(const vec& x) const
{
}
vec shifted_gamma_function::Fresnel(const vec& F0, const vec& F1, double V_H) const
{
76 77 78 79 80
vec F(dimY());
for(int i=0; i<dimY(); ++i) {
F[i] = F0[i] - V_H*F1[i] + (1.0 - F0[i])*pow(1.0 - V_H, 5.0);
}
return F;
81 82 83 84 85 86 87 88
}
vec shifted_gamma_function::D(const vec& _alpha, const vec& _p,
double cos_h, const vec& _K) const
{
double cos2 = cos_h*cos_h;
double tan2 = (1.-cos2)/cos2;
89 90 91 92 93 94 95 96 97 98
vec D(dimY());
for(int i=0; i<dimY(); ++i) {
const double ax = _alpha[i] + tan2/_alpha[i];
const double exp_pow = exp(-ax) / pow(ax, _p[i]);
const double P22 = exp_pow;
D[i] = P22 * (one_pi / (cos2 * cos2)) * _K[i];
}
return D;
99 100 101 102 103
}
vec shifted_gamma_function::G1(double theta) const
{
vec exp_shc(3);
104 105 106 107 108 109
vec G1(dimY());
for(int i=0; i<dimY(); ++i)
{
const double exp_shc = exp(sh_c[i] * pow(std::max<double>(acos(theta) - sh_theta0[i],0.), sh_k[i]));
G1[i] = 1.0 + sh_lambda[i] * (1.0 - exp_shc);
}
110
}
|
{
"url": "https://gitlab.inria.fr/alta/alta/-/blame/362c57776ff465bb356ca62ff8ac65ec98acbff4/sources/plugins/nonlinear_function_sgd/function.cpp",
"source_domain": "gitlab.inria.fr",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "162919",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VVL7AL6GNRIHFVUFRMUXGVMA6HNBBN77",
"WARC-Concurrent-To": "<urn:uuid:d25a7f58-8fa4-49e6-bcdf-f6d8a21f6cf4>",
"WARC-Date": "2021-12-08T04:31:14Z",
"WARC-IP-Address": "128.93.193.23",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CGKCPWIKDFKTR7PLETRTT7SGO2TBTJR3",
"WARC-Record-ID": "<urn:uuid:0ee52446-d499-4cde-bad5-595d6269c754>",
"WARC-Target-URI": "https://gitlab.inria.fr/alta/alta/-/blame/362c57776ff465bb356ca62ff8ac65ec98acbff4/sources/plugins/nonlinear_function_sgd/function.cpp",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d265b1c3-aa4e-4dd2-bdc7-9740735d111f>"
},
"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-203\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,
21,
33,
57,
79,
80,
98,
118,
137,
155,
176,
193,
194,
223,
224,
239,
284,
286,
327,
329,
330,
360,
394,
454,
456,
474,
476,
531,
533,
545,
599,
646,
649,
703,
847,
885,
887,
922,
956,
983,
1006,
1037,
1063,
1064,
1115,
1172,
1201,
1203,
1204,
1237,
1301,
1303,
1305,
1306,
1360,
1453,
1455,
1457,
1458,
1511,
1561,
1563,
1565,
1566,
1616,
1664,
1666,
1668,
1669,
1722,
1780,
1782,
1784,
1785,
1849,
1866,
1934,
1936,
1938,
1939,
1942,
2026,
2028,
2043,
2059,
2090,
2154,
2157,
2168,
2192,
2194,
2195,
2260,
2325,
2327,
2355,
2386,
2387,
2417,
2433,
2464,
2517,
2569,
2570,
2600,
2601,
2650,
2653,
2664,
2683,
2685,
2686,
2737,
2739,
2756,
2780,
2797,
2826,
2829,
2932,
2981,
2984,
2988
],
"line_end_idx": [
21,
33,
57,
79,
80,
98,
118,
137,
155,
176,
193,
194,
223,
224,
239,
284,
286,
327,
329,
330,
360,
394,
454,
456,
474,
476,
531,
533,
545,
599,
646,
649,
703,
847,
885,
887,
922,
956,
983,
1006,
1037,
1063,
1064,
1115,
1172,
1201,
1203,
1204,
1237,
1301,
1303,
1305,
1306,
1360,
1453,
1455,
1457,
1458,
1511,
1561,
1563,
1565,
1566,
1616,
1664,
1666,
1668,
1669,
1722,
1780,
1782,
1784,
1785,
1849,
1866,
1934,
1936,
1938,
1939,
1942,
2026,
2028,
2043,
2059,
2090,
2154,
2157,
2168,
2192,
2194,
2195,
2260,
2325,
2327,
2355,
2386,
2387,
2417,
2433,
2464,
2517,
2569,
2570,
2600,
2601,
2650,
2653,
2664,
2683,
2685,
2686,
2737,
2739,
2756,
2780,
2797,
2826,
2829,
2932,
2981,
2984,
2988,
2989
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2989,
"ccnet_original_nlines": 122,
"rps_doc_curly_bracket": 0.010036800056695938,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08510638028383255,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03427895903587341,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5957446694374084,
"rps_doc_frac_unique_words": 0.6598984599113464,
"rps_doc_mean_word_length": 4.7512688636779785,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0.00945626012980938,
"rps_doc_unigram_entropy": 5.182045936584473,
"rps_doc_word_count": 394,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06410256028175354,
"rps_doc_frac_chars_dupe_6grams": 0.06410256028175354,
"rps_doc_frac_chars_dupe_7grams": 0.03739316016435623,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.021367520093917847,
"rps_doc_frac_chars_top_3gram": 0.014423079788684845,
"rps_doc_frac_chars_top_4gram": 0.022435899823904037,
"rps_doc_books_importance": -339.6611633300781,
"rps_doc_books_importance_length_correction": -339.6611633300781,
"rps_doc_openwebtext_importance": -145.52969360351562,
"rps_doc_openwebtext_importance_length_correction": -145.52969360351562,
"rps_doc_wikipedia_importance": -78.31387329101562,
"rps_doc_wikipedia_importance_length_correction": -78.31387329101562
},
"fasttext": {
"dclm": 0.9964995980262756,
"english": 0.2206236720085144,
"fineweb_edu_approx": 1.9672108888626099,
"eai_general_math": 0.9962276816368103,
"eai_open_web_math": 0.37739109992980957,
"eai_web_code": 0.843695878982544
}
}
|
{
"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",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Arithmetic"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "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,894,466,108,844,544,000 |
Content: Slate Blackcurrant Watermelon Strawberry Orange Banana Apple Emerald Chocolate Marble
Background: Slate Blackcurrant Watermelon Strawberry Orange Banana Apple Emerald Chocolate Marble
Pattern: Blank Waves Notes Sharp Wood Rockface Leather Honey Vertical Triangles
Welcome to TerraFirmaCraft Forums
Register now to gain access to all of our features. Once registered and logged in, you will be able to contribute to this site by submitting your own content or replying to existing content. You'll be able to customize your profile, receive reputation points as a reward for submitting content, while also communicating with other members via your own private inbox, plus much more! This message will be removed once you have signed in.
• Announcements
• Dries007
Server Move 09/13/2018
I (Dries007) have recently taken over as main developer and server admin. This involved moving servers to reduce cost. It's likely there will be some more downtime in the future but most things should be sorted by now. This forum is in dire need of replacement as the software is quite old and can't be easily updated. If you wish to discuss or stay updated, join our discord: https://invite.gg/terrafirmacraft. The forum will remain available to read, but will be locked in the future, when a new system is setup. The forum and wiki are now ad free. If you'd like to contribute to keeping it that way, you can do so via paypal or patreon.
• Dries007
ATTENTION Forum Database Breach 03/04/2019
There has been a breach of our database. Please make sure you change your password (use a password manager, like Lastpass).
If you used this password anywhere else, change that too! The passwords themselves are stored hashed, but may old accounts still had old, insecure (by today's standards) hashes from back when they where created. This means they can be "cracked" more easily. Other leaked information includes: email, IP, account name.
I'm trying my best to find out more and keep everyone up to date. Discord (http://invite.gg/TerraFirmaCraft) is the best option for up to date news and questions. I'm sorry for this, but the damage has been done. All I can do is try to make sure it doesn't happen again.
Little Whispers
Island Portals Clarification
4 posts in this topic
(self introduction)
To start things off, I've been a huge fan of TFC1 for years now but never quite knew about the development of TFC2. For the most part, I figured TFC1 just died out and the developers left for other miscellaneous things, granted that I made that assumption based off the lack of TFC1 updates and the fact of me just not reaching out to research what's going on. Though, while recently playing the TFP modpack and searching up on gameplay help, I stumbled across these forums. Honestly, they're not hard to find when you want to look for it, though it seems uncommon to come across it on a natural basses. For the past few days, I've been doing a lot of research on what's going on with this mod in excitement and curiosity, along with testing out the early alpha test version of this mod that's out.
(the actual post)
Now that we got my position on looking into this mod out of the way, let's move onto what I actually made this post for. I find the island worldgen to be unique feature that you tend to only see with adventure maps in which you require to hop from portal to portal in order to reach another island. From what I know, these places are meant to be void like, dark, scary, and I've read "dangerous". Comparing to what I've seen in TFC2 while knowing it's merely alpha, I've only seen two platforms in those dimensions with a fairly long winding path above a grand abyss with various vanilla animals and vanilla mobs spawned on it. I'm pretty sure that's not going to be the finally form of what the island portal dimensions will consist of, or at least hope not. Though, this leads to my question of what's planned to make this realm "unique" and looking at how it'd be "dangerous".
Yes, I know it's very, very dangerous in the current state due to merely vanilla monster spam. Yet, knowing more of the bigger picture in which is TFC2, that's most likely either placeholder or unintentional mob spam. From originally reading into these "leap dimensions" to traverse the apparent planned dangers of these vast landscapes of which reside inside of TFC2, one mod kept popping into my head is Dimensional Doors. I'm curious in which direction and how in-depth are these leap dimensions going to be? Dimensional Doors was one of my favorite small mods back when it was relevant due to the alien and creepy nature of it. Also, is there going to be any special threats that reside in these transference zones? Using Dimensional Doors as an example to base perspectives off of, will there be threats like those eyes that transport you to Limbo along with other demons and monstrosities birthed form the void? Along with that question, will these places still continue to be these winding bridges or will it be more like a light dungeon that you're meant to rush through before the void consumes you?
(tangent)
I could see the little platforms of which the portal resides on in the grand vastness having something along the lines of a ward to protect them so the void doesn't destroy them if not use it to leak out into the real world with. Heh, maybe that could be an island type, an island tainted by the void from a broken portal due to a failed ward. Though, back to normal use of these portals, I do like both ideas of this area being either something you'd have to go slow and cautiously through and the idea of having to rush through it as everything brakes apart. Unless, there were to be a happy medium of where you can find stable and unstable portals. Unstable portals would be either a one time use or something that falls apart when used, then you'll have to wait for it to "rebuild" itself. On the other hand stable portals would be used more like solid dungeons. I also like the idea of them being highly risky and dangerous to traverse because that'd force players to make 100% sure they have everything they want to take to the new land and are prepared enough. These portals could also increase in stability the more you use them which will add progression amongst these worlds. This increase in stability could be increased in either the time that's spent there, the more void you fight off, or a mixture of the two if not something else. Actually that something else could be that, sense the other two feels more "grindy", you could also have a crystal or something of such that spans a ward across the path between the two portals that you need to activate. In this ward that spans to connect the two portals, the void shall be forced back along with all it's creatures which will allow players to temporarily "claim" these passages through the void. In order to keep the wards in tact, players need to either fuel or merely reactivate what we could just call the "crystal" for now.
Sorry about that massive tangent, that's a lot more of a suggestion but I'm tossing around ideas to what I could possibly see these void transportation zones becoming with my lack of knowledge on what the devs have in mind. Hopefully it won't be frowned upon. Also, thank you for taking your time in reading this post for the ones of you who have.
0
Share this post
Link to post
Share on other sites
What is planned is still not fully formed. What you see is more a test of what's feasible rather than a sketch of things to come. You've got some good ideas. I too was a fan of Dimensional Doors. There's a lot more to consider in this case then dimensional doors had to. First, this seems like it might be the primary if not only way to go between islands. Therefore anything related to travel greatly affects play. Something like mob and item transportation needs to be considered. Should players be able to move them? How should they move them? Will there be magical means of transportation/teleportation or summoning? If travel is both ways do you have to worry about people stripping islands of resources? Is that the dev's responsibility to think about or server's? If travel is one way and one person goes west and the other east can they ever meet? etc.
0
Share this post
Link to post
Share on other sites
vvv Summary: Different Uses for the void. vvv
One thing there is to consider is that there could be multiple uses for traversing the void. I personally love the rarity of the portals that hop from one island to the other due to making them more unique and possibly defended by another faction or entity. Though, now that we're in the suggestion thread, I shall suggest possibly using the void in result of not only doing island hopping but also, in some cases, making your way to different dimensions. This "void" dimension would possibly make more sense if it was used in more of a diverse way, looking at it as more of a half dimension, a split between two or more realms. It's interesting to see when you use these portals to not just fold space and time in half then just to walk from one island to another like a standard teleporter or warp gate, but merely used to enter an entire different dimension as a path way. This "dimension" instantly gets a lot more concerning for its existence and properties.
vvv Summary: Different functionalities for the different uses of the void. vvv
The reason I thought of using this "void" dimension for different purposes is due to the point you, Stroam, made of if we should be able to "summon" these portals along with other game changing features. If this "pocket dimension", "split dimension", "half dimension", etc. is used for passage ways to a multitude of locations being either the same dimension or another, then some portals would make sense to "summon" while others, like the ones that just transport you from one island to another, isn't. This would be able to maintain the rarity and seriousness of more concrete and permanent portals while using lesser portals for lesser counterparts, having both of these two mechanics using the same system. These different variations of transportation used in the void could have different stability, functions, and encounters.
vvv Summary: Overworld void corruption and random void rift encounters. vvv
Also, I believe void like things could make for some really interesting fantasy end game tiers and weird lore if lore were to be added in the game. Expanding on the point I've made about how some portal's wards get destroyed, due to this "void" dimension possibly being more of a 0.5 dimension than a complete one, you could have rifts and tares in the fabric of space which lets out this corruption and taint into various worlds because of its natural instability. There could also be a feature to create random encounters that make you go; "WHAT IS THAT?" and either force you to retreat or bunker down. I personally love when a game adds random events that could happen out of the blue which makes you a lot more cautious with the environment. It actually gives you reason to build shelter more than the fact of comfort. I believe some players would possible give up on building a base or house on every island or so besides small two block high walls or something to prevent monsters from coming in. Though, random encounters like a void monstrosity ripping a hole into your dimension to say "what's up", or possibly more of something like a storm instead of a monster emerging from an unprotected rift to the void, will gives players a lot more of a reason to build at least some kind of fleshed out bunker. Also, one thing to make important is that I see that every hostile void creature would be aggressive to anything that isn't of void descendant.
vvv Summary: Attempted justification of making this particular aspect of the game so expansive. vvv
I know I'm putting probably way too much effort into looking at this one topic of this mod compared to everything else, I just can see a lot of potential that can be tapped into with just this one aspect. From my experience with fantasy and magic, the void tends to be absolute end game territory. Fantasy concepts usually don't get too in-depth into the nature of the void, but almost always show how expansive and powerful it is, especially how dangerous and corrupting it is. In result, from what I know, this dimension and island transporting concept is very lightly done so far and isn't that deeply thought through. Yet, I believe if TFC2 is going to be fantasy related with all of these planned features, while having these portals and this void half dimension placeholder already in the game, it would be a very good idea to expand this aspect of the mod to add such more alien and unique gameplay. Most people know generally most of the creatures to encounter in a fantasy world that's like what's planned for TFC2, but nobody quite knows what kind of horrors that could reside deep within the void, especially the aspects that are strong enough in which they have self will and consciousness to attempt hunting you or anything specific down.
In my head, I have a mixture of these following mods:
Thaumcraft
Astral Sorcery
Ars Magica 2
Dimensional Doors
These are not due to their items, creation, and research focuses, but instead more exploration, vibes, and discovery focuses. I love the vibe and reality in Minecraft they attempt to create which would possibly work great with expanding this aspect if not others inside this mod.
Though, I believe I've finally drained everything that I can think of with this aspect. Again, sorry for the ridiculous amount of text, I tend to put too much effort into my work when I get my hands onto anything. I loved TFC1 and love seeing the progress of TFC2 so I wish the best for this mod. Though, like before, I thank you for the ones who do read through my massive mess. I really wish I was able to get into programming enough so I can actually start making my ideas myself or helping/working with others. That's one of my later goals in life to do, I already know the basics of several languages, I just need to chisel out my path or receive help till everything becomes clear.
Edited by Little Whispers
0
Share this post
Link to post
Share on other sites
Create an account or sign in to comment
You need to be a member in order to leave a comment
Create an account
Sign up for a new account in our community. It's easy!
Register a new account
Sign in
Already have an account? Sign in here.
Sign In Now
|
{
"url": "https://terrafirmacraft.com/f/topic/10225-island-portals-clarification/",
"source_domain": "terrafirmacraft.com",
"snapshot_id": "crawl=CC-MAIN-2019-26",
"warc_metadata": {
"Content-Length": "102532",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:5SN3CHA5Z2STS2HXYIDO56RV64GEHJRL",
"WARC-Concurrent-To": "<urn:uuid:9fc1be66-8990-469b-be68-4d0f9b7015a0>",
"WARC-Date": "2019-06-17T10:05:03Z",
"WARC-IP-Address": "104.24.101.166",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:D5D43XYJDVF4UW5HMQZGVYWFERFVGGSM",
"WARC-Record-ID": "<urn:uuid:06eeb874-ec3f-4123-baf6-9ad10e8e3e03>",
"WARC-Target-URI": "https://terrafirmacraft.com/f/topic/10225-island-portals-clarification/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e74e7b32-34e6-4004-9455-f1ed0d17f12b>"
},
"warc_info": "isPartOf: CC-MAIN-2019-26\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-142-81-83.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
95,
193,
273,
307,
308,
745,
746,
764,
765,
780,
781,
812,
813,
1460,
1475,
1476,
1527,
1528,
1658,
1982,
2259,
2275,
2276,
2305,
2306,
2328,
2329,
2349,
2350,
3149,
3150,
3168,
3169,
4049,
4050,
5159,
5160,
5170,
5171,
7064,
7065,
7413,
7414,
7416,
7417,
7433,
7434,
7435,
7448,
7469,
7470,
8332,
8333,
8335,
8336,
8338,
8339,
8355,
8356,
8357,
8370,
8391,
8392,
8442,
8443,
9407,
9408,
9491,
9492,
10325,
10326,
10406,
10407,
11864,
11865,
11965,
11966,
13218,
13219,
13221,
13222,
13276,
13277,
13288,
13289,
13304,
13305,
13318,
13319,
13337,
13338,
13618,
13619,
13621,
13622,
14310,
14311,
14337,
14339,
14340,
14356,
14357,
14358,
14371,
14392,
14393,
14433,
14434,
14486,
14487,
14505,
14506,
14561,
14562,
14563,
14586,
14587,
14595,
14596,
14635,
14636,
14637
],
"line_end_idx": [
95,
193,
273,
307,
308,
745,
746,
764,
765,
780,
781,
812,
813,
1460,
1475,
1476,
1527,
1528,
1658,
1982,
2259,
2275,
2276,
2305,
2306,
2328,
2329,
2349,
2350,
3149,
3150,
3168,
3169,
4049,
4050,
5159,
5160,
5170,
5171,
7064,
7065,
7413,
7414,
7416,
7417,
7433,
7434,
7435,
7448,
7469,
7470,
8332,
8333,
8335,
8336,
8338,
8339,
8355,
8356,
8357,
8370,
8391,
8392,
8442,
8443,
9407,
9408,
9491,
9492,
10325,
10326,
10406,
10407,
11864,
11865,
11965,
11966,
13218,
13219,
13221,
13222,
13276,
13277,
13288,
13289,
13304,
13305,
13318,
13319,
13337,
13338,
13618,
13619,
13621,
13622,
14310,
14311,
14337,
14339,
14340,
14356,
14357,
14358,
14371,
14392,
14393,
14433,
14434,
14486,
14487,
14505,
14506,
14561,
14562,
14563,
14586,
14587,
14595,
14596,
14635,
14636,
14637,
14648
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 14648,
"ccnet_original_nlines": 122,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.5043594837188721,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023138830438256264,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1213950365781784,
"rps_doc_frac_unique_words": 0.3129384219646454,
"rps_doc_mean_word_length": 4.5194854736328125,
"rps_doc_num_sentences": 117,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.816681861877441,
"rps_doc_word_count": 2566,
"rps_doc_frac_chars_dupe_10grams": 0.02371302992105484,
"rps_doc_frac_chars_dupe_5grams": 0.029404159635305405,
"rps_doc_frac_chars_dupe_6grams": 0.02371302992105484,
"rps_doc_frac_chars_dupe_7grams": 0.02371302992105484,
"rps_doc_frac_chars_dupe_8grams": 0.02371302992105484,
"rps_doc_frac_chars_dupe_9grams": 0.02371302992105484,
"rps_doc_frac_chars_top_2gram": 0.009054070338606834,
"rps_doc_frac_chars_top_3gram": 0.0034491699188947678,
"rps_doc_frac_chars_top_4gram": 0.0036216299049556255,
"rps_doc_books_importance": -1083.74658203125,
"rps_doc_books_importance_length_correction": -1083.74658203125,
"rps_doc_openwebtext_importance": -632.4834594726562,
"rps_doc_openwebtext_importance_length_correction": -632.4834594726562,
"rps_doc_wikipedia_importance": -516.134765625,
"rps_doc_wikipedia_importance_length_correction": -516.134765625
},
"fasttext": {
"dclm": 0.229331374168396,
"english": 0.9573417901992798,
"fineweb_edu_approx": 1.2243986129760742,
"eai_general_math": 0.22164928913116455,
"eai_open_web_math": 0.22486943006515503,
"eai_web_code": 0.04050856828689575
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.656",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "5",
"label": "Evaluate"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "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": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,851,907,457,339,370,000 |
Home > wiiconnect24 error code 107304
How do I fix the WiiConnect24 error code 107304?
Alton Alexander
By Alton AlexanderUpdated on June 3rd, 2022
The wiiconnect24 error code 107304 is caused by a problem with the Nintendo Wii's internet connection. This error code can be caused by a number of things, including a weak or unstable internet connection, a problem with the Wii's internet settings, or a problem with the Wii itself.
If you are receiving this error code, it is recommended that you check your internet connection and make sure that it is stable and strong. If your connection is good, then you should check your Wii's internet settings to make sure that they are correct. Finally, if you are still receiving the error code, there may be a problem with your Wii itself and you should contact Nintendo for further assistance.
1. Restart your computer and router
1. In Windows, open "Start" and click on "Control Panel".
2. Under "System and Security" category, click on "Restart".
3. Select "Restart now" and click on "Yes".
4. After your computer restarts, log in and check if wiiconnect24 error code 107304 is fixed.
2. Update your router firmware
1. Log in to your router’s admin interface.
2. If you are using a graphical user interface (GUI), click the “Administrative” tab, and then click the “Firmware” button.
3. If you are using a command line interface (CLI), enter the following command: fwupdate
4. If the firmware update process succeeds, your router will display a message indicating the firmware version and date.
5. Click the “Update” button to download and install the new firmware.
6. If the firmware update process fails, check the following: • Make sure your router is connected to the Internet. • Make sure your router has enough memory. The firmware update process can take a few minutes to complete. • Make sure you have the correct firmware file. The firmware update process downloads and installs only one firmware file.
7. If the firmware update process still fails, contact your router manufacturer for support.
3. Change your router's wireless channel
To change your router's wireless channel, follow these steps:
1. Log in to your router's administrative interface.
2. Under "Wireless," click the "WLAN" tab.
3. Under "Wireless Settings," find the "Channel" setting and change it to a different frequency.
4. Click "Apply" to save your changes.
If you didn't find success with an option above, then try:
1. Move your computer closer to the router.
2. Reduce the number of devices using the wireless network.
3. Disable any security features on the router.
4. Contact your ISP for help.
|
{
"url": "https://www.errorsolutions.tech/error/wiiconnect24-error-code-107304/",
"source_domain": "www.errorsolutions.tech",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "76790",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:EPLGMM42B6KD477Z2WN4O65ZGFWCKIBM",
"WARC-Concurrent-To": "<urn:uuid:97a7b3a1-3666-4087-b7f2-8dfed012dcee>",
"WARC-Date": "2022-08-11T15:03:32Z",
"WARC-IP-Address": "172.67.68.186",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:74SA4CP326H22JXYJAI5ALWFGOBPIHCG",
"WARC-Record-ID": "<urn:uuid:79b840a3-85e8-4dfe-b8b9-023179b9564d>",
"WARC-Target-URI": "https://www.errorsolutions.tech/error/wiiconnect24-error-code-107304/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9f9f0c26-f504-42dc-aea6-b9041c3c9a5f>"
},
"warc_info": "isPartOf: CC-MAIN-2022-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-103\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
38,
39,
88,
89,
105,
149,
150,
434,
435,
842,
843,
879,
880,
940,
1003,
1049,
1145,
1146,
1177,
1178,
1224,
1350,
1442,
1565,
1638,
1986,
2081,
2082,
2123,
2124,
2186,
2187,
2242,
2287,
2386,
2427,
2428,
2487,
2488,
2534,
2596,
2646
],
"line_end_idx": [
38,
39,
88,
89,
105,
149,
150,
434,
435,
842,
843,
879,
880,
940,
1003,
1049,
1145,
1146,
1177,
1178,
1224,
1350,
1442,
1565,
1638,
1986,
2081,
2082,
2123,
2124,
2186,
2187,
2242,
2287,
2386,
2427,
2428,
2487,
2488,
2534,
2596,
2646,
2677
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2677,
"ccnet_original_nlines": 42,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.32252252101898193,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009009010158479214,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25045046210289,
"rps_doc_frac_unique_words": 0.4041095972061157,
"rps_doc_mean_word_length": 4.746575355529785,
"rps_doc_num_sentences": 50,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.733306407928467,
"rps_doc_word_count": 438,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.15536315739154816,
"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.030303029343485832,
"rps_doc_frac_chars_top_3gram": 0.040885038673877716,
"rps_doc_frac_chars_top_4gram": 0.057720061391592026,
"rps_doc_books_importance": -189.0326690673828,
"rps_doc_books_importance_length_correction": -189.0326690673828,
"rps_doc_openwebtext_importance": -148.05218505859375,
"rps_doc_openwebtext_importance_length_correction": -148.05218505859375,
"rps_doc_wikipedia_importance": -86.08995056152344,
"rps_doc_wikipedia_importance_length_correction": -86.08995056152344
},
"fasttext": {
"dclm": 0.1582019329071045,
"english": 0.874320924282074,
"fineweb_edu_approx": 2.027977705001831,
"eai_general_math": 0.15244996547698975,
"eai_open_web_math": 0.09613137692213058,
"eai_web_code": 0.009333129972219467
}
}
|
{
"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": "794.8",
"labels": {
"level_1": "Arts",
"level_2": "Amusements and Recreation",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,307,228,965,951,948,300 |
Support » Plugin: EWWW Image Optimizer » compatibility with plugin 'User submitted posts'
• Resolved shahnaz
(@shahnaz)
I am using Ewww Image Optimizer plugin, which automatically compresses the images as I upload them.
I am wondering if this is an issue with other plugins like User submitted posts.
Currently, when User upload images of 1 MB or even lower. Their image does not reach me. User sees no error. However smaller files like 100 kb and slightly above do come through. I will also check with the other plugin support.
Is there a max image size that can be sent through this processing?
http://wordpress.org/plugins/ewww-image-optimizer/
Viewing 11 replies - 1 through 11 (of 11 total)
• Plugin Author nosilver4u
(@nosilver4u)
Nope, no maximum image size. Can you give me a link to the plugin you are using, so I can take a look at it myself?
Thanks for your reply.
The plugin I am using for users posts:
http://perishablepress.com/user-submitted-posts/
My site: http://www.recipesaresimple.com
Plugin Author nosilver4u
(@nosilver4u)
I did some testing, and didn’t have any trouble. I even tried some larger PNG images to see if there were any issues with timeouts due to longer processing time and they uploaded just fine.
I did notice that the User Submitted Posts plugin has some default restrictions that could very well block images around the 1 MB area (or larger obviously). You might want to check your settings on that.
Thank you! Currently, I deactivate the eww image optimizer plugin whenever I am not posting.
Now the Larger images are coming through. I Activate when I am posting.
Is this okay?
I did check the setting for ‘user submitted posts’ plugin, and size is not restricted.
I am just wondering if its ok to activate and reacitivate upon need at the moment.
Plugin Author nosilver4u
(@nosilver4u)
That should be fine to activate and deactivate the plugin at will. However, I’m still puzzled as to what the issue is, as I’ve been totally unable to replicate it.
Do you have any of the conversion options enabled?
What is the max width and height that you have set for ‘user submitted posts’?
Lastly, do you have an image that you know is causing issues?
Plugin Author nosilver4u
(@nosilver4u)
also wanted to ask if you were using the ‘cloud’ service, or just using the bundled/built-in optimizers?
Plugin Author nosilver4u
(@nosilver4u)
just wanted to let you know that I’ll be marking this as resolved in 3 days if I don’t hear back from you
Hi. Sorry I was not able to reply earlier. I had 4-5 images sent in my guests that didnt come through directlyy using the plugin. they sent them to my email instead.
For example: 1 image was sent from ipad . It is 1.3 MB in size.
However as I stated, when I turned off the plugin they were able to send large images.
Under Conversion Options the only box checked is
enable GIF to PNG conversion : is that checked by default. i dont remember if I checked this.
MAX image height and width is set to 4000 pixels each.
You may close this topic as resolved as I will work around it like this. Currently the plugin is on again. If I recieve a post again without and image I will probably turn it off at that time and ask user to submit again.
I would appreciate if youd let me know if there is any update.
Hope I have answered your questions
as for your questions
also wanted to ask if you were using the ‘cloud’ service, or just using the bundled/built-in optimizers?
I am not sure.
I use wp super cache, jetpack and varoious other selected plugins.
THANK YOU for the plugin
Plugin Author nosilver4u
(@nosilver4u)
Can you provide a link to the 1.3 MB image so I can test it on my dev box?
The GIF to PNG is not enabled by default, but is generally a good idea.
I really do want to resolve this issue properly, just having trouble replicating the issue on my dev box.
Plugin Author nosilver4u
(@nosilver4u)
I was hoping to try and replicate the issue with one of the images you were having trouble with, but I guess I’ll just have to close it…
Plugin Author nosilver4u
(@nosilver4u)
One thing I did discover is that the plugin does attempt to optimize the user submitted photos in 1.6.x, but fails due to the fact that the plugin generally expects to run in the admin. I’ve still been unable to get the plugin to actually block an image upload, but this discovery could potentially be the root cause.
With the upcoming 1.7.0 this has changed, since the inclusion of the wp_image_editor extensions allows all sorts of front-end interaction. Give it another run after 1.7.0 is released and let me know if you have further problems.
Viewing 11 replies - 1 through 11 (of 11 total)
• The topic ‘compatibility with plugin 'User submitted posts'’ is closed to new replies.
|
{
"url": "https://wordpress.org/support/topic/compatibility-with-plugin-user-submitted-posts/",
"source_domain": "wordpress.org",
"snapshot_id": "crawl=CC-MAIN-2017-47",
"warc_metadata": {
"Content-Length": "46371",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:J4K4JTOPGYKL4GTSKBKATDTDZWQQN2HM",
"WARC-Concurrent-To": "<urn:uuid:68319996-a369-4afe-9246-f0b729f4493c>",
"WARC-Date": "2017-11-25T12:03:46Z",
"WARC-IP-Address": "66.155.40.249",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:GLYUOUNNTJOTBYOVEP7HBAP72RK7XOAW",
"WARC-Record-ID": "<urn:uuid:55020aed-dbd7-427a-9e13-cc15f538e84e>",
"WARC-Target-URI": "https://wordpress.org/support/topic/compatibility-with-plugin-user-submitted-posts/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f320cc9f-5b29-443f-96d1-fd883515e68c>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-228-102-73.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,
90,
91,
112,
113,
128,
129,
130,
234,
319,
320,
552,
624,
625,
680,
681,
729,
758,
759,
777,
778,
898,
899,
926,
969,
1022,
1023,
1068,
1069,
1098,
1099,
1117,
1118,
1312,
1313,
1522,
1523,
1620,
1696,
1714,
1805,
1892,
1893,
1922,
1923,
1941,
1942,
2110,
2111,
2166,
2167,
2250,
2251,
2317,
2318,
2347,
2348,
2366,
2367,
2476,
2477,
2506,
2507,
2525,
2526,
2636,
2637,
2807,
2875,
2876,
2967,
2968,
3021,
3022,
3120,
3121,
3180,
3406,
3407,
3474,
3514,
3540,
3649,
3650,
3669,
3740,
3769,
3770,
3799,
3800,
3818,
3819,
3898,
3974,
3975,
4085,
4086,
4115,
4116,
4134,
4135,
4276,
4277,
4306,
4307,
4325,
4326,
4648,
4649,
4882,
4883,
4931
],
"line_end_idx": [
90,
91,
112,
113,
128,
129,
130,
234,
319,
320,
552,
624,
625,
680,
681,
729,
758,
759,
777,
778,
898,
899,
926,
969,
1022,
1023,
1068,
1069,
1098,
1099,
1117,
1118,
1312,
1313,
1522,
1523,
1620,
1696,
1714,
1805,
1892,
1893,
1922,
1923,
1941,
1942,
2110,
2111,
2166,
2167,
2250,
2251,
2317,
2318,
2347,
2348,
2366,
2367,
2476,
2477,
2506,
2507,
2525,
2526,
2636,
2637,
2807,
2875,
2876,
2967,
2968,
3021,
3022,
3120,
3121,
3180,
3406,
3407,
3474,
3514,
3540,
3649,
3650,
3669,
3740,
3769,
3770,
3799,
3800,
3818,
3819,
3898,
3974,
3975,
4085,
4086,
4115,
4116,
4134,
4135,
4276,
4277,
4306,
4307,
4325,
4326,
4648,
4649,
4882,
4883,
4931,
5021
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5021,
"ccnet_original_nlines": 111,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.40667974948883057,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0500982291996479,
"rps_doc_frac_lines_end_with_ellipsis": 0.008928569965064526,
"rps_doc_frac_no_alph_words": 0.18271119892597198,
"rps_doc_frac_unique_words": 0.36626505851745605,
"rps_doc_mean_word_length": 4.510843276977539,
"rps_doc_num_sentences": 65,
"rps_doc_symbol_to_word_ratio": 0.0009823200525715947,
"rps_doc_unigram_entropy": 5.160065650939941,
"rps_doc_word_count": 830,
"rps_doc_frac_chars_dupe_10grams": 0.06410256028175354,
"rps_doc_frac_chars_dupe_5grams": 0.08173076808452606,
"rps_doc_frac_chars_dupe_6grams": 0.06410256028175354,
"rps_doc_frac_chars_dupe_7grams": 0.06410256028175354,
"rps_doc_frac_chars_dupe_8grams": 0.06410256028175354,
"rps_doc_frac_chars_dupe_9grams": 0.06410256028175354,
"rps_doc_frac_chars_top_2gram": 0.024038460105657578,
"rps_doc_frac_chars_top_3gram": 0.04700855165719986,
"rps_doc_frac_chars_top_4gram": 0.0683760717511177,
"rps_doc_books_importance": -460.9158630371094,
"rps_doc_books_importance_length_correction": -460.9158630371094,
"rps_doc_openwebtext_importance": -281.731689453125,
"rps_doc_openwebtext_importance_length_correction": -281.731689453125,
"rps_doc_wikipedia_importance": -196.03953552246094,
"rps_doc_wikipedia_importance_length_correction": -196.03953552246094
},
"fasttext": {
"dclm": 0.022213760763406754,
"english": 0.9501734972000122,
"fineweb_edu_approx": 0.9271892309188843,
"eai_general_math": 0.3220728039741516,
"eai_open_web_math": 0.3028855323791504,
"eai_web_code": 0.049480561167001724
}
}
|
{
"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": "-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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-1,263,165,853,695,517,400 |
Удаление циклически ссылок из меню
Простой сниппет, который поможет вам удалить циклические ссылки из меню wordpress. Сейчас конечно не 2010 год и я уверен, что поисковые машины научились с легкостью распознавать циклические ссылки и не обращать на них внимания, но пусть в голове будет микро пунктик, что избавляясь от циклических ссылок это хоть как-то поможет вашему сайту чувствовать себя в плане SEO по лучше
// Удаление циклической ссылки из текущего пуннкта меню
function remove_cyclical_link_f_nav($items) {
return preg_replace( '%((current_page_item|current-menu-item)[^<]+)[^>]+>([^<]+)</a>%', '$1<span>$3</span>', $menu, 1 );
}
add_filter('wp_nav_menu_items', 'remove_cyclical_link_f_nav', 10);
Данный сниппет работает с страницами, записями, а так же произвольными ссылками. Результат выполнения — замена ссылки на тег <span>. Так же не стоит забывать, что для него нужно будет продублировать те же стили, что и для меню, не знаю как у вас называются стили, но это будет что-то вроде этого:
.menu a,
.menu span {
/* ваши стили для пункта меню */
}
Пару хороших практик вдогонку
Ничто так часто не попадается на глаза, как циклическая ссылка на главной странице сайта в логотипе/слогане, это можно легко исправить с помощью вордпресовских условий (conditional tags), например выводить лого в вашем header.php так:
<?php if ( is_front_page() || is_home()) : ?>
<div href="<?php echo esc_url( home_url( '/' ) ); ?>" class="logo">
<img src="<?php echo get_template_directory_uri(); ?>/assets/img/logo.png" alt=""/>
</div>
<?php else : ?>
<a href="<?php echo esc_url( home_url( '/' ) ); ?>" class="logo">
<img src="<?php echo get_template_directory_uri(); ?>/assets/img/logo.png" alt=""/>
</a>
<?php endif; ?>
И наверное самый забавный пример, когда на сайте нет категорий, вложенных статей, но почему-то владельцы сайтов упорно продолжают использовать хлебный крошки, где просто ссылка на главную и название страницы, причем ключ — текущее название статьи дублируется аж в трех местах — тайтл, заголовок и хлебаная крошка. Так делать не надо, не надо использовать хлебные крошки, где это не требуется, пользователь не тупой и сам в состоянии найти главную
|
{
"url": "https://kinganton.ru/blog/udalenie-cziklicheski-ssylok-iz-menyu",
"source_domain": "kinganton.ru",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "29526",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3HRKOM2RBG3EUZSXX4KS5TVQRCZJ7EBE",
"WARC-Concurrent-To": "<urn:uuid:9945cf20-9990-4f13-ac92-73e58343e75c>",
"WARC-Date": "2022-12-05T08:15:16Z",
"WARC-IP-Address": "89.108.87.87",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LNVQSSH4IOFWODSUTAC7WS4WFVOZW2GJ",
"WARC-Record-ID": "<urn:uuid:e49b4a0e-f7af-41ee-b544-fc1bcdee248e>",
"WARC-Target-URI": "https://kinganton.ru/blog/udalenie-cziklicheski-ssylok-iz-menyu",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:21fc787c-c289-48fc-94e0-5bcf9c0b5716>"
},
"warc_info": "isPartOf: CC-MAIN-2022-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-28\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,
415,
416,
473,
519,
644,
646,
713,
714,
1011,
1012,
1021,
1034,
1067,
1069,
1070,
1100,
1101,
1336,
1337,
1383,
1384,
1452,
1540,
1548,
1549,
1566,
1567,
1633,
1717,
1722,
1723,
1739,
1740
],
"line_end_idx": [
35,
36,
415,
416,
473,
519,
644,
646,
713,
714,
1011,
1012,
1021,
1034,
1067,
1069,
1070,
1100,
1101,
1336,
1337,
1383,
1384,
1452,
1540,
1548,
1549,
1566,
1567,
1633,
1717,
1722,
1723,
1739,
1740,
2186
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2186,
"ccnet_original_nlines": 35,
"rps_doc_curly_bracket": 0.0018298299983143806,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.014018690213561058,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004672899842262268,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.8294392228126526,
"rps_doc_frac_unique_words": 0.6785714030265808,
"rps_doc_mean_word_length": 5.8321428298950195,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.053725719451904,
"rps_doc_word_count": 280,
"rps_doc_frac_chars_dupe_10grams": 0.10777709633111954,
"rps_doc_frac_chars_dupe_5grams": 0.10777709633111954,
"rps_doc_frac_chars_dupe_6grams": 0.10777709633111954,
"rps_doc_frac_chars_dupe_7grams": 0.10777709633111954,
"rps_doc_frac_chars_dupe_8grams": 0.10777709633111954,
"rps_doc_frac_chars_dupe_9grams": 0.10777709633111954,
"rps_doc_frac_chars_top_2gram": 0.007348440121859312,
"rps_doc_frac_chars_top_3gram": 0.020820580422878265,
"rps_doc_frac_chars_top_4gram": 0.029393749311566353,
"rps_doc_books_importance": -185.70535278320312,
"rps_doc_books_importance_length_correction": -185.70535278320312,
"rps_doc_openwebtext_importance": -81.31398010253906,
"rps_doc_openwebtext_importance_length_correction": -81.31398010253906,
"rps_doc_wikipedia_importance": -45.47201156616211,
"rps_doc_wikipedia_importance_length_correction": -45.47201156616211
},
"fasttext": {
"dclm": 0.5969006419181824,
"english": 0.000039670001569902524,
"fineweb_edu_approx": 2.0896289348602295,
"eai_general_math": -0.000009420000424142927,
"eai_open_web_math": 0.17754799127578735,
"eai_web_code": 0.6608145833015442
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.85",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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
|
-2,310,586,418,839,313,400 |
Skip to content
HTTPS clone URL
Subversion checkout URL
You can clone with HTTPS or Subversion.
Download ZIP
Fork of roo that uses Nokogiri and doesn't pollute the global namespace with multiple class names.
tag: v1.3.10
Fetching latest commit…
Cannot retrieve the latest commit at this time
Failed to load latest commit information.
examples
lib
scripts
test
website
.gitignore
History.txt
License.txt
Manifest.txt
README.markdown
Rakefile
VERSION.yml
base64include.rb
roo.gemspec
setup.rb
README.markdown
README for Roo
Roo is available here and on Rubyforge. You can install the official release with 'gem install roo' or refer to the installation instructions below for the latest development gem.
Installation
# Run the following if you haven't done so before:
gem sources -a http://gems.github.com/
# Install the gem:
sudo gem install hmcgowan-roo
Usage:
require 'rubygems'
require 'roo'
s = Openoffice.new("myspreadsheet.ods") # creates an Openoffice Spreadsheet instance
s = Excel.new("myspreadsheet.xls") # creates an Excel Spreadsheet instance
s = Google.new("myspreadsheetkey_at_google") # creates an Google Spreadsheet instance
s = Excelx.new("myspreadsheet.xlsx") # creates an Excel Spreadsheet instance for Excel .xlsx files
s.default_sheet = s.sheets.first # first sheet in the spreadsheet file will be used
# s.sheet is an array which holds the names of the sheets within
# a spreadsheet.
# you can also write
# s.default_sheet = s.sheets[3] or
# s.default_sheet = 'Sheet 3'
s.cell(1,1) # returns the content of the first row/first cell in the sheet
s.cell('A',1) # same cell
s.cell(1,'A') # same cell
s.cell(1,'A',s.sheets[0]) # same cell
# almost all methods have an optional argument 'sheet'.
# If this parameter is omitted, the default_sheet will be used.
s.info # prints infos about the spreadsheet file
s.first_row # the number of the first row
s.last_row # the number of the last row
s.first_column # the number of the first column
s.last_column # the number of the last column
# limited font information is available
s.font(1,1).bold?
s.font(1,1).italic?
s.font(1,1).underline?
see http://roo.rubyforge.org for a more complete tutorial
Something went wrong with that request. Please try again.
|
{
"url": "https://github.com/sr3d/roo/tree/v1.3.10",
"source_domain": "github.com",
"snapshot_id": "crawl=CC-MAIN-2015-18",
"warc_metadata": {
"Content-Length": "48952",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BPYJTWVFQ7Z7BLBUAEYVY5EQAESFKVMA",
"WARC-Concurrent-To": "<urn:uuid:fb9609b5-c0d2-4b26-acce-2a9ac00e4d48>",
"WARC-Date": "2015-05-05T15:04:40Z",
"WARC-IP-Address": "192.30.252.128",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:AEJ5RHVR5ACNHND3AMP7UHWO4SYHX6OF",
"WARC-Record-ID": "<urn:uuid:18818319-8cfc-4c95-bc01-364a426087e7>",
"WARC-Target-URI": "https://github.com/sr3d/roo/tree/v1.3.10",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a2369114-5035-4c75-bfd6-fa27f20f4585>"
},
"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,
16,
17,
33,
34,
58,
59,
99,
100,
113,
212,
225,
226,
250,
251,
298,
299,
341,
350,
354,
362,
367,
375,
386,
398,
410,
423,
439,
448,
460,
477,
489,
498,
499,
515,
516,
531,
532,
712,
713,
726,
727,
778,
817,
818,
837,
867,
868,
875,
876,
895,
909,
910,
1000,
1085,
1171,
1278,
1279,
1364,
1365,
1430,
1447,
1468,
1503,
1533,
1534,
1641,
1697,
1753,
1809,
1810,
1866,
1930,
1931,
2017,
2018,
2092,
2165,
2242,
2318,
2319,
2359,
2360,
2378,
2398,
2421,
2422,
2480,
2481
],
"line_end_idx": [
16,
17,
33,
34,
58,
59,
99,
100,
113,
212,
225,
226,
250,
251,
298,
299,
341,
350,
354,
362,
367,
375,
386,
398,
410,
423,
439,
448,
460,
477,
489,
498,
499,
515,
516,
531,
532,
712,
713,
726,
727,
778,
817,
818,
837,
867,
868,
875,
876,
895,
909,
910,
1000,
1085,
1171,
1278,
1279,
1364,
1365,
1430,
1447,
1468,
1503,
1533,
1534,
1641,
1697,
1753,
1809,
1810,
1866,
1930,
1931,
2017,
2018,
2092,
2165,
2242,
2318,
2319,
2359,
2360,
2378,
2398,
2421,
2422,
2480,
2481,
2538
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2538,
"ccnet_original_nlines": 88,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2775590717792511,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023622050881385803,
"rps_doc_frac_lines_end_with_ellipsis": 0.011235959827899933,
"rps_doc_frac_no_alph_words": 0.31496062874794006,
"rps_doc_frac_unique_words": 0.5753424763679504,
"rps_doc_mean_word_length": 5.886986255645752,
"rps_doc_num_sentences": 60,
"rps_doc_symbol_to_word_ratio": 0.04921260103583336,
"rps_doc_unigram_entropy": 4.804721832275391,
"rps_doc_word_count": 292,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0814426988363266,
"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.01745201088488102,
"rps_doc_frac_chars_top_3gram": 0.02559627965092659,
"rps_doc_frac_chars_top_4gram": 0.03257707878947258,
"rps_doc_books_importance": -198.94656372070312,
"rps_doc_books_importance_length_correction": -198.94656372070312,
"rps_doc_openwebtext_importance": -134.12860107421875,
"rps_doc_openwebtext_importance_length_correction": -134.12860107421875,
"rps_doc_wikipedia_importance": -124.69556427001953,
"rps_doc_wikipedia_importance_length_correction": -124.69556427001953
},
"fasttext": {
"dclm": 0.42044979333877563,
"english": 0.6208289265632629,
"fineweb_edu_approx": 1.8656643629074097,
"eai_general_math": 0.8488523364067078,
"eai_open_web_math": 0.11133092641830444,
"eai_web_code": 0.09099643677473068
}
}
|
{
"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": "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": "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
|
5,816,188,083,306,148,000 |
Introduzione: questo articolo spiega come fare per pubblicare un sito web direttamente sul proprio Mac, utilizzando la funzione “Condivisione Mac”. Se volete fare in modo che il vostro sito sia raggiungibile da tutti e utilizzate una rete con IP dinamico, dovrete utilizzare un servizio come dynDNS, come spiegato qui nella sezione “Lato server: IP statico”. È ovvio che il vostro sito sarà raggiungibile fintantoché il vostro computer è collegato ad internet.
Abilitare la condivisione e il server Apache
Questo è molto semplice… basta andare in Preferenze di Sistema>Condivisione e attivare il servizio Condivisione Web. A questo punto digitando in un qualsiasi browser internet l’indirizzo http://vostro_indirizzo_IP/~vostro_nome_utente sarà possibile visitare l’interno della cartella “Siti” posta nella home del vostro utente. E se dentro c’è una pagina index.html, ovviamente verrà visualizzata questa. Per rendere accessibile a tutti, fuori dalla rete, il vostro sito internet, è necessario usare un’IP statico o servirsi del servizio dynDNS (leggi sopra per scoprire come fare). Io, ad esempio, ho registrato un dominio su dynDNS: andando su http://jeby.blogdns.com/~Jeby/ (se il mio computer è acceso…) dovreste appunto vedere una semplicissima pagina web, che poi è proprio quella contenuta nella mia cartella “Siti”. [EDIT: la pagina non si vede, ho qualche problema con le porte. In particolare la 443 e la 427 sembrano completamente bloccate. Anche l’ISP potrebbe avere la sua parte in tutto ciò…]
Attivare PHP
Se volete sviluppare un sito con pagine dinamiche, vi serve PHP. In Mac OS X c’è già tutto quello che serve, ma è disattivato. Per attivare PHP bisogna passare dal terminale.. almeno all’inizio! Si tratta di operazioni da effettuare come utenti root, quindi useremo il comando sudo.
Per prima cosa apriamo il terminale e digitiamo
cd /etc/httpd
dentro questa cartella c’è il file di configurazione che vogliamo modificare. Facciamo una copia di sicurezza del file, così se dovesse andare storto qualcosa possiamo sempre recuperare: basta semplicemente copiare il file. Quindi digitiamo
sudo cp httpd.conf httpd.conf.backup
vi sarà chiesta la password di amministratore, inseritela e date invio. Ora si tratta di modificare due righe del file di configurazione. Lo si può fare usando un editor di testi qualunque, ad esempio:
per usare l’editor direttamente dal terminale digitate
sudo nano httpd.conf
per editare il file col primo editor di testo in grado di aprire il file conf potete digitare semplicemente
sudo open httpd.conf
oppure ancora potete sostituire a nano uno a scelta tra edit, bbedit, smultron, mate rispettivamente per usare TextWrangler, BBedit, Smultron o TextMate. In ogni caso si tratta di modificare due linee, e cioè:
# LoadModule php4_module libexec/httpd/libphp4.so
e
# AddModule mod_php4.c
(cercatele in giro nel documento). Ora, togliete il cancelletto (#) all’inizio delle righe e salvate il documento. A questo punto basta riavviare il server Apache e il gioco è fatto! Si può fare da interfaccia grafica (basta stoppare e poi avviare il servizio Condivisione Web), ma noi siamo degli aspiranti geek e lo facciamo da terminale:
sudo apachectl graceful
Gli esperti ne sapranno sicuramente più di me e sapranno anche come modificare a loro piacimento tutto quanto nel file di configurazione. Per verificare che tutto va bene, inserite nella cartella Siti un file php contenente il codice <? phpinfo(); ?> e visualizzatelo nel vostro browser web.
Ah, se volete saperlo… non mi sono inventato nulla, e tutto ciò è preso pari pari dalla guida di installazione di WordPress su Mac OS X, che trovate qui.
MySQL e altri strumenti
Potreste anche aver bisogno di un database MySQL, e quindi dovreste installare e configurare anche quello, o voler aggiornare il modulo Apache di Tiger ad una versione più recente. Inoltre forse mettervi a smanacciare nei file di configurazione di sistema non è forse l’ideale per voi, perché magari non siete proprio espertissimi. Bene, per tutti voi ci sono delle soluzioni molto più semplici da usare e che non richiedono la conoscenza dei meandri del sistema. Si tratta di pacchetti all-in-one, come ad esempio l’ottimo MAMP (che ha anche la versione PRO a pagamento) che permette di installare e gestire facilmente in un colpo solo Apache, MySQL e PHP, senza bisogno di avviare o aggiornare quelli di sistema.
Conclusione
Mac OS X mette a disposizione dello sviluppatore web tutto il necessario per affrontare il suo lavoro/hobby. A seconda del proprio grado di preparazione, delle voglia e del tempo a disposizione per imparare, ognuno di noi può decidere di utilizzare e configurare manualmente gli elementi forniti dal sistema o di utilizzare pacchetti già pronti e più semplici da utilizzare. La tradizione, tra l’altro, è destinata a continuare, perché è già stato svelato che Mac OS X 10.5 aka Leopard, offrirà un ambiente completo per lo sviluppo su piattaforma Ruby on Rails.
’nuff said
Technorati Tags :
|
{
"url": "http://www.jeby.it/2007/04/pubblicare-un-sito-web-sul-mac/",
"source_domain": "www.jeby.it",
"snapshot_id": "crawl=CC-MAIN-2021-31",
"warc_metadata": {
"Content-Length": "264039",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JRR3AG6R5YCSS52CNYKZCGI7BZ33M56Q",
"WARC-Concurrent-To": "<urn:uuid:954c406b-a47f-4d17-a932-ebaeb78557a3>",
"WARC-Date": "2021-07-31T21:38:05Z",
"WARC-IP-Address": "185.2.4.28",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KCNNRFX4SVOOKDJWBPLVOB7DX544KXC5",
"WARC-Record-ID": "<urn:uuid:d6650c5c-e052-41cb-8804-445f961e2bdb>",
"WARC-Target-URI": "http://www.jeby.it/2007/04/pubblicare-un-sito-web-sul-mac/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:039d6287-4c64-479e-b5cc-2532ed78e41b>"
},
"warc_info": "isPartOf: CC-MAIN-2021-31\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July/August 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-15.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,
461,
462,
507,
1512,
1513,
1526,
1809,
1857,
1858,
1872,
1873,
2114,
2115,
2152,
2153,
2355,
2410,
2411,
2432,
2433,
2541,
2542,
2563,
2564,
2774,
2775,
2825,
2826,
2828,
2829,
2852,
2853,
3194,
3195,
3219,
3220,
3512,
3666,
3667,
3691,
4406,
4407,
4419,
4981,
4982,
4993,
4994
],
"line_end_idx": [
461,
462,
507,
1512,
1513,
1526,
1809,
1857,
1858,
1872,
1873,
2114,
2115,
2152,
2153,
2355,
2410,
2411,
2432,
2433,
2541,
2542,
2563,
2564,
2774,
2775,
2825,
2826,
2828,
2829,
2852,
2853,
3194,
3195,
3219,
3220,
3512,
3666,
3667,
3691,
4406,
4407,
4419,
4981,
4982,
4993,
4994,
5011
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5011,
"ccnet_original_nlines": 47,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10482180118560791,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.025157229974865913,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17085954546928406,
"rps_doc_frac_unique_words": 0.5019354820251465,
"rps_doc_mean_word_length": 5.294193744659424,
"rps_doc_num_sentences": 47,
"rps_doc_symbol_to_word_ratio": 0.007337530143558979,
"rps_doc_unigram_entropy": 5.528961658477783,
"rps_doc_word_count": 775,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.01121130958199501,
"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.007799169979989529,
"rps_doc_frac_chars_top_3gram": 0.005849380046129227,
"rps_doc_frac_chars_top_4gram": 0.007311719935387373,
"rps_doc_books_importance": -393.0020446777344,
"rps_doc_books_importance_length_correction": -393.0020446777344,
"rps_doc_openwebtext_importance": -233.5406494140625,
"rps_doc_openwebtext_importance_length_correction": -233.5406494140625,
"rps_doc_wikipedia_importance": -147.54562377929688,
"rps_doc_wikipedia_importance_length_correction": -147.54562377929688
},
"fasttext": {
"dclm": 0.7990841269493103,
"english": 0.0007985099800862372,
"fineweb_edu_approx": 1.4606441259384155,
"eai_general_math": 0.000027179999960935675,
"eai_open_web_math": 0.5519810914993286,
"eai_web_code": 0.43561702966690063
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.678",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "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,812,263,016,582,160,000 |
How to backup Redmine using the Bitnami Docker image
In a previous post I detailed how to install Redmine on Linux using the excellent Bitnami docker image.
This post will teach you how to easily make an online backup of your Redmine installation. Note that automating the backup is not within the scope of this post.
We assume that the redmine is installed as shown in my previous post in /var/lib/redmine. and that you want to backup to my.backup.server:~/redmine-backup/ using rsync.
Backing up the Redmine data
This is pretty easy, as the data is all in just one directory. You can sync it using
rsync --checksum -Pavz /var/lib/redmine/redmine_data my.backup.server:~/redmine-backup/
Note that old versions of files in redmine_data will be overwritten, however files that are deleted locally will not be deleted on the backup server. To me, this seems like a good compromise between the ability to recover deleted files and the used storage space.
Backing up the Redmine database
This part is slightly more complicated, since we need to access the MariaDB server running in a different container. Important note: The container ID can change so it is not sufficient to just find the container ID once and then use it. You need to determine the appropriate ID each time you do a backup. See below on instructions how to do that.
Full command:
docker exec -it $(docker container ls | grep redmine_mariadb_1 | cut -d' ' -f1) mysqldump -uroot bitnami_redmine | xz -e9 -zc - > redmine-database-dump-$(date -I).sql.xz
Let’s break it down:
• docker exec -it (container ID) (command): Run a command on a running docker container.
• docker container ls | grep redmine_mariadb_1 | cut -d' ' -f1: Get the ID (first field of the output cut -d' ' -f1) of the running docker container named redmine_mariadb_1
• mysqldump -uroot bitnami_redmine: This is run on the docker container and dumps the Redmine Database as SQL to stdout. No password is neccessary since the Bitnami MariaDB image allows access without any password.
• xz -e9 -zc -: Takes the data from mysqldump from stdin (-), compresses it using maximum compression settings (-e9 -z) and writes the compressed data to stdout.
• > redmine-database-dump-$(date -I).sql.xz: Writes the compressed data from xz into a file called redmine-database-dump-(current date).sql.xz in the current directory.
The resulting file is called e.g. redmine-database-dump-2019-02-01.sql.xz and it’s placed in the current directory. Ensure that you run the command in a suitable directory. Run it in /tmp if you don’t know which directory might be suitable.
Now we can rsync it to the server:
rsync --checksum -Pavz redmine-backup-*.sql.xz my.backup.server:~/redmine-backup/
Since the filename contains the current data, this approach will not overwrite old daily backups of the database, so you can restore your database very flexibly.
How to use custom themes with the Bitnami Redmine Docker image
In a previous post I detailed how to install Redmine on Linux using the excellent Bitnami docker image.
This post shows you how to install a custom theme like A1 (which I used successfully for more than 5 years) if you use the bitnami Docker image. We will assume that you installed redmine in /var/lib/redmine and your systemd service is called redmine.
Note: If you get any permission denied errors, try running the same command using sudo.
First, we need to create the themes directory.
sudo mkdir /var/lib/redmine/themes
The first thing we need to do is to copy the current (default) themes to that directory, since Redmine won’t be able to start up if the default theme isn’t available in the correct version.
In order to do this, we must first ensure that your container is running:
sudo systemctl start redmine
Now we can find out the container ID of the running redmine container:
uli:/var/lib/redmine$ docker container ps | grep redmine
ae4de10d0b41 bitnami/redmine:latest "/app-entrypoint.sh …" 30 minutes ago Up 30 minutes 0.0.0.0:3718->3000/tcp redmine_redmine_1
c231d11c48e9 bitnami/mariadb:latest "/entrypoint.sh /run…" 30 minutes ago Up 30 minutes 3306/tcp redmine_mariadb_1
From these lines, you need to select the line that says redmine_redmine_1 at the end. The one that lists redmine_mariadb_1 at the end is the database container and we don’t need that one for this task.
From that line, copy the first column – this is the container ID – e.g. ae4de10d0b41 in this example.
Now we can copy the default theme folder:
docker cp ae4de10d0b41:/opt/bitnami/redmine/public/themes /var/lib/redmine/themes
Now copy your custom theme (e.g. the a1 folder) to /var/lib/redmine/themes.
The next step is to fix the permissions. The bitnami container uses the user with UID 1001, so we need to change the owner to that. Repeat this every time you changed something in the themes directory:
sudo chown -R 1001:1001 /var/lib/redmine/themes
At this point we need to edit the docker-compose config (in /var/lib/redmine/docker-compose.yml) to mount /var/lib/redmine/themes in the correct directory. This is pretty easy: Just add - '/var/lib/redmine-szalata/themes:/opt/bitnami/redmine/public/themes' to the volumes section of the redmine container.
The finished config file will look like this:
version: '2'
services:
mariadb:
image: 'bitnami/mariadb:latest'
environment:
- ALLOW_EMPTY_PASSWORD=yes
volumes:
- '/var/lib/redmine/mariadb_data:/bitnami'
redmine:
image: 'bitnami/redmine:latest'
environment:
- REDMINE_USERNAME=admin
- REDMINE_PASSWORD=redmineadmin
- [email protected]
- SMTP_HOST=smtp.gmail.com
- SMTP_PORT=25
- [email protected]
- SMTP_PASSWORD=yourGmailPassword
ports:
- '3718:3000'
volumes:
- '/var/lib/redmine/redmine_data:/bitnami'
- '/var/lib/redmine-szalata/themes:/opt/bitnami/redmine/public/themes'
depends_on:
- mariadb
Now you can restart Redmine:
sudo systemctl restart redmine
and set your new theme by selecting it in Administration -> Settings -> Display.
Tips on how to use Redmine for your project
Having used Redmine for almost 10 years for a multitude of projects and with widely varying team sizes, here are my practical tips on how you should use it for your project:
Super-projects
Create one super-project of which all projects are subprojects. This allows you to use all project management features like Gantt, Milestones etc in the super-project.
Example project structure
• My Company Inc (Super-project)
• R&D
• Migration to cloud computing
• Machine learning research
• Operations
• Customer X
• Customer Y
• Management
By opening the ticket list for the super-project, you see all the tickets of all sub-projects – and therefore have more tools at your disposal for high-level management of the company. For example, you could create milestones for business development in the super-project that depend on tasks in some R&D sub-project.
No public projects !
People often make the mistake of making a Redmine project public – maybe because that’s the default setting for new projects.
However, anyone that knows the project URL, e.g. https://redmine.mydomain.com/projects/test/ can see ALL THE DATA in the project by default, even though the project isn’t listed in the search bar project list
Solution: Make all projects non-public: As admin, go to the project, go to the Settings tab, uncheck the Public checkbox and click Save. Unless, of course, you actually want all the data to be publically available via Redmine…
Avoid multiple issue trackers
Companies that grew organically to their current size often tend to have separate systems that fulfill mostly the same purpose but are mostly not interconnected – but are mostly used by separate subgroups of the personnel.
Typical example: (Project) management uses Redmine while the developers use Gitlab for source-code-oriented bug management and only interface to Redmine to communicate with the project managers.
While this constellation will work reasonably well even over long time periods, it inevitably leads to an unhealthy spread of information and, as a consequence, inefficiency in looking for information. Some low-level-development discussion or documentation will end up in Redmine whereas some project-management-related discussions inevitably end up in Gitlab.
If at all possible, try to encourage the use of one system and discourage the use of the other for any purpose that overlaps. Try to actively work with people opposed to that policy to find solutions on how to adapt their known process in the new system.
Enable support for incoming emails
Most Redmine setups are notoriously hard to use on a smartphone – the UI is not really optimized for mobile use.
In order to facilitate the use on mobile or other devices, one easy way is to allow the user to answer to notification emails, with their response being posted as an update to the ticket. While this is somewhat hard to set up, a couple of hours by a skilled admin or expert will most certainly get you a couple of years of maintenance-free updates by incoming emails.
Note that this does not cover the use case of creating new tickets or otherwise interfacing with Redmine, but in practice, people that are currently on mobile-only will either just update existing tickets or whatever they intend to do is sufficiently important that they will deal with the suboptimal mobile UI that Redmine currently provides.
While there are a few Redmine mobile apps out there and it is certainly worth a try at some point, I have not had great success with them in past projects.
Use (parts of) the wiki to collect unstructured information
Many companies lack a structured and searchable way of collecting unstructured information. What about the SSH command the admin uses to connect to some server? Everyone who has worked in R&D knows that perfect-documentation-land is pure utopia and while actually writing top-down documentation for all the tasks at hand might work for some time, it is mostly only used to describe what to do whereas details about how to do it are quite easily omitted.
Moreover, documentation is often not in sync with the real world, especially if the people who originally wrote it have moved on to other projects or even other jobs. Don’t make the mistake of assuming that you have any way of enforcing the discipline to write & keep in sync technical documentation down to the command- or component-level over a long term. Initial success regarding that matter is far worse in predicting the long-term success of documentation projects than most project managers would admit – and it’s debatable if good-but-horribly-outdated-information is of any use in a multi-year project.
If you don’t use the Redmine wiki for any other process, try to push people towards using it for documenting what they did, even if it’s only a prototype command line script or something that doesn’t work out later (you can delete it if it serves no purpose anymore).
If, however, you use the wiki for other documentation, just reserve a certain section, e.g. any page accessible from a special Documentation page, for structured information and create pages for different types of unstructured information
Crying Wolf: Don’t overuse Urgent and Immediate priorities
Everyone who has worked in the technology industry knows that some project managers appear to have the uncanny ability to always have one more Urgent task up their sleeve, no matter how many you have already fixed. Moreover, there are so many Urgent and Immediate tasks that no-one really knows what these words mean any more – especially since you can’t quite remember the last time you fixed a Low-priority task.
When you introduce the use of an advanced issue tracking tool, you have one more change in breaking out of that vicious circle. It’s a productive policy to enforce a rule that project managers must only have one Immediate and three Urgent tasks open at any one time. This enables developers to actually prioritize and avoid the risk of getting yelled at by some manager that didn’t use the tools at hand properly, in effect imposing wrong or unclear constraints on the developers.
Always have someone assigned & Order by priority
In practical projects, one phenomenon that often happens in conjunction with issue trackers is ticket orphanisation. Here’s how it happens.
• Mgmt creates a ticket with high priority and assigns a developer
• Developer fixes the issue and un-assigns himself, notifying the management to assign someone to test the fix properly via the issue update text.
• Mgmt forgets to actually assign someone (e.g. due to holiday or more urgent tasks) and the ticket enters the endless list of unclosed-but-not-that-important tickets that have (almost) been fixed but some small part is still missing.
Unless you are one of the lucky few that manages to close and properly & periodically handle all tickets over a long period of time, the small lapse of not having one assigned for a short period of time exponentially increases the likelihood of a ticket not being properly finished.
Here’s how it should work:
• Mgmt creates a ticket with high priority and assigns a developer
• Developer fixes the issue and assigns management, telling them in the update text that the next step is to find some tester capable of testing it. The developer sets the ticket to an appropriate priority level
• Mgmt will always see the tickets on the My tickets page.
In other words, there must be someone assigned at any one time. While this does not automatically solve issues of people leaving the project, or being on holiday or sick, this is how it should work:
• If the next step to do on this ticket will be done by you, leave yourself assigned
• If there are multiple next steps that should happen in parallel, create sub-tickets and assign accordingly
• If the next task is unknown to you, assign to mgmt or head developer and note that the next task needs to be determined
• If you know the next sub-task but don’t know who should do it, assign to mgmt and note that X needs to be done and they shall determine by whom (this represents our example listed above)
• If the task has been assigned to you and you don’t know what to do, assign to head developer or mgmt and note, as clearly as possible, why you are unsure about what to do. Frequent occurence of this case typically indicates a failure of mgmt or development head to communicate the tasks in a developer-compatible way.
Independently of the aforementioned decisions:
• Use sub-tickets heavily: Any time you see that something can be split into multiple tasks, even if you’re gonna do all of those tasks anyway
• Don’t create sub-issues for sub-tasks that are projected to take less than 10 minutes
• Always create sub-issues for sub-tasks that are projected to take more than 60 minutes
• It is the responsibility of mgmt to look through tasks of temporarily unavailable project members and re-assign issues that can’t wait accordingly
• It is the responsibility of mgmt to look through tasks of permanently unavailable project members and re-assign all issues as a matter of principle
A good way of conceptualizing sub-tickets is as local mini-milestones. While some tickets might have a scope larger than a typical milestone, sub-tickets should primarily focus on conveying relationship information to developers, while milestones should primarily focus on conveying information to mgmt.
Given that process, anyone should work primarily on the My tickets list, not so much on the project tickets list. The project tickets list is primarily for the mgmt to get an overview and developers should only use it to get some extra information or cross-reference some tasks.
The most efficient (& most obvious) way of using Redmine is to work through the My tickets list starting from the high priority tasks. Remember to regularly check if any higher priority tasks popped up.
One of the main tasks of the project manager is to ensure that the process I described automatically leads to people working on milestones, with some high-priority tasks outside the milestone interspersed in between. Proper communication to the developers ensures that while everyone is working based on the aforementioned scheme, the common goal of reaching the milestone is clearly defined in the minds of the developers.
Enforce regular updates by using Microtasks
A typical failure mode of software and hardware project management is that management thinks top-down and fails to enforce a process that thinks all the way to the bottom.
Regarding issue trackers, this systematic problem is often manifested in there being only coarse macro-tasks that, even if properly assigned to developers, don’t allow anyone to accurately assess the current state of the project (e.g. because there is no way of assessing a 0%…100% progress of an unclearly defined wide-scope task) and often lead to developers not giving regular updates.
Depending on the management style, irregular updates regarding specific parts of the development often lead to procrastination of tasks on the side of developers, greatly reducing their effectivity.
All of those failure modes can be avoided by using smaller, more strictly-defined micro-tasks. While this solution is obvious from a conceptual standpoint, the practical implementation is most often somewhere between utterly disastrous and not-viable-in-the-long term. The most common issues are:
• Management does not have insight into the “low level” of development and therefore can’t assess how to split up the tasks beyond a certain level
• Developers are said to not have enough insight into the bigger picture of the project and therefore it’s not considered feasible to let them split up tasks themselves
• Management considers the overhead of creating and micro-managing micro-tasks to be too large and therefore this processing being inefficient
However, most of these concerns are caused by a combination of inadequate processes and fundamental misconceptions about micro-tasks:
• Management often tends to raise artificial barriers between them and the developers – such as not considering the possibility that one who is assigned to perform a task should know best how to split the task.
• Many processes operate under a no-error paradigm regarding the issues (i.e. there shall be virtually no mistakes such as wrong splitting of tasks). Yet under real circumstances, it is almost always more effective in both short- and long-term to embrace the possibility of incorrectly-handled tickets on every level just like the industry has accepted the existence of software bugs. Embracing a certain level of errors being made also significantly reduces certain types of undesirable behavior, the most prominent one being the affinity to hide one’s own errors once one has realized they have been made, in order to avoid social repercussions (such as being yelled at), even if such repercussions are purely hypothetical in practice.This strategy also often eases the tendency to raise artificial barriers as outlined above, because the underlying reason for those barriers is often based in some conflict of competence and therefore a battle for authority.
• The overhead issue can easily & effectively be taken care of by simply defining the desirable size of microtasks, such as listed in the last chapter.
• Never create a micro-task if you assume the task will take less than 10 minutes
• Always create a micro-task if you assume the task will take more than 60 minutes
• In between those figures, use your own judgment as a developer
• Moreover, it is effective when using micro-tasks to make it as quick & easy as possible to create a microtask. In the worst case assuming accurate projections, the developer will create one micro-task for every 10 minutes of development work. If some requirement, policy or process makes creating the task inefficient for the developers, the overhead can quickly accumulate – however this is rare in practice as most technology-oriented developers who do not operate under strict & direct management supervision do employ some sort of self-regulation and will create fewer micro-tasks if the overhead is sufficiently large
• Yet, the same self-regulation mechanism can under some circumstances also lead to too few micro-tasks being created. This can only be solved by active encouragement and communication from the management, including some level of give-and-take on both sides.
Since management of larger companies often operates under the assumption that every subordinate shall be exchangeable to a certain extent and that concept often prevails throughout the hierarchy, some find it hard to swallow that some tasks might be split into multiple micro-tasks by one developer whereas another one will just treat it monolithically based on differences in their projected timespan. Yet given even a large expected deviance from the projected time a task will take to the actual time spent on it (plus the fact that it’s much easier to judge the duration of a short task as compared to a long one) this remains without any practical consequence given that the min-forced-split time of 60 minutes is so small compared to the duration of the entire project. All remaining issues need to be handled by communicating between management and developers anyway, such as telling the developer that he should have split this or that task after repeatedly failing to do so.
In addition to facilitating effective & automatic information flow between management and the developers, micro-tasks in combination with effective supervision by development heads or management tend to avoid many cases of getting stuck: A typical behavior for developers is to continue working on a technically challenging task, even if they are totally stuck dealing with the current issue.
My recommendation is what I call the 15-minute rule: Once you can’t get measurable progress on a problem within 15 minutes, you should try another task, or (if not possible) approach the issue from a different angle.
While this leaves significant room for interpretation and even besides that should be treated more like a heuristic than a rule, self-applying this rule has helped many inexperienced developers.
Micro-tasks deal with this issue on a project setting by allowing the management or the supervisory developer (depending on the project size) to periodically check all the currently active tasks with very short cycles times of less than an hour: If there has been no progress on a micro-task within one or two hours, one can expect that either the developer hasn’t split up the task properly or he is stuck and might be able to profit from assistance by the usually more experiences supervisor.
Without micro-tasks the timespan in which one can expect a feedback or otherwise can assume that it’s stuck not only varies a lot depending on the individual task, but is also extremely long – sometimes even weeks or months. This increases the likelihood that a lot of time is being lost due to long periods of developer being stuck on a task without measureable progress. In effect, micro-tasks add to the supervisory developer’s toolbox by providing means to intervene before much valuable time is lost, while avoiding the work environment being perceived as surveillance-focused by the developers.
Ease-of-use
The way Redmine is set up in many companies effectively makes people, especially non-tech oriented people, unlikely to use Redmine to document their issues.
Example 1: Redmine only over VPN
For security reasons, Redmine is often only available over a virtual private network. Regarding usability, this has the effect that often a user has to either log in through multiple layers of security (login to VPN, login to Redmine).
Moreover, often the VPN client requires a special setup that might not always.
One particular case that I recall is a company where all project mgmt tools were accessible only over VPN – and my VPN account could only handle one user at a time. Therefore, if I switched from my Desktop to my Notebook, the VPN couldn’t connect and therefore I was unable to use Redmine.
Security is usually handled sufficiently well by recurring reviews by admins and/or external specialists – these reviews should also cover your website. My main recommendation regarding Redmine is to copy the project URLs (e.g. https://redmine.gridbox.de/projects/test) when you’re logged in and opening them in Incognito mode (where you’re not logged in). If you see the login form, everything is alright for this project. If you see the project overview page, you have set the project to Public mode – see above for how to fix it.
In general, security should not be conceptualized as an optimization goal (as it is often done by technology-affine people) but more as a tradeoff between certain types of risk and usability. In that context, usability can be modeled as the likelihood that people will use a tool or process voluntarily – or, equivalently, the amount of effort you have to put in so that a certain group of people uses a certain tool or process to a given extent.
This implies that any educated discussion about security will need to define some model of the risk that is being talked about, and the people that. In many cases, the mistake being made especially by technologically affine people is to base the usability model on their own aptitude & capability of using extremely suboptimal tools effectively, while sometimes their risk model is somewhat influenced by a desire to better than the current state-of-the-market. While both these properties are fundamentally desirable in almost every aspect, practical businesses will have to make the fundamental security-usability tradeoff at some point, explicitly or implicitly, whether they like it or now.
Example 2: Too few privileges in Redmine
Often, Redmine admins strip users of all but the most obviously required privileges for all the subprojects. This means that users often can’t edit descriptions, can’t close or reopen issues. Even if they can contact the admin to e.g. re-open an erroneously closed issue, users will not use it effectively based on some level of fear of doing something they can’t revert themselves – and the social shame of having to contact the admin about it, even it the admin does not seem to judge them for their behavior.
The only action I recommend to not allow is to delete (as opposed to close) an issue as this is very hard to recover from. There are certain projects, of course, where certain (low level) users factually shouldn’t be able to do anything (e.g. marketing might just be able to read R&D info but not contribute to it), but in many projects, restrictions apply to all projects and inhibit effective use especially by non-tech personnel in projects with more that ~3 active participants.
Example 3: Too strict policies for Redmine
If one actively enforces a specific format, length or any other policy for creating or updating tickets or documentation, this will not only create a significant entry barrier to new users (who often will refrain from using project management tools altogether except for the level that is actively enforced) but also create a hard wall of separation between the veteran users (who know the rules, or, as some would say, define the interpretation of the rules) and everyone else – with everyone else being more or less afraid of not being able to follow the rules and therefore refrain from using it beyond the minimal enforced level.
Additionally, if you impose policies on the format of some documentation don’t forget to consider the case that some relevant information might not fit into a predefined scheme. If you are too aggressive on enforcing the policy, important information might be lost as it is dropped from updates. Therefore, you should always include an additional information field in any predefined format, even if it’s often misused.
Example: A company enforces that development tickets must only be closed by git commits. Yet they failed to consider that many bugs are either unintentionally fixed by a secondary ticket without the other developer being aware of the primary ticket – or are based on a misconception and are therefore not really a fixable bug.
The ostensibly good intention of being able to map all tickets to git commits might, therefore, result in either a lot of tickets not being closed at all, or handled in some other far-from-ideal way as people are looking to a workaround for the policy. The corporate process of fixing the policies once such cases are known and documented are often both too slow and too complex for the user to use compared to a quick workaround. However, in the long term, the unknown status or a large portion of your bug tracker will almost certainly come and haunt you!
Think of it this way: Your Bugtracker might suffer the same fate as many of the classical internet forums ubiquitous since the early 2000s: If you ask a question, and you’ll only get an answer like
Use the search function ! What you are looking for has been answered SO MANY TIMES on this forum!
by some veteran user, this will likely be the last question you ask voluntarily on said forum.
Why is that? Because not only isn’t it as obviously easy to use the search function and actually get some meaningful results out of it as said veteran implies (because the new user usually doesn’t know the right question to ask, i.e. what terms to look for), but said veteran could have just as easily used the 10 seconds of his time to get you one or two of the seemingly ubiquitous answer-to-your-question-links to at least get you started.
Example 4: Enforced deadlines
One project I recall temporarily had the policy that every ticket shall have a due date set to at most 4 weeks in the future, in order to be able to be reminded it via Gantt etc. This didn’t work out, as constant needless update emails to extend the due date (e.g. for a postponed issue) annoyed all the users. Also,
My recommendation is to use due dates only where due dates are functionally implied and, at the same time, functionally required by the project.
Example: If the software needs to be delivered in 6 months, maybe the core feature implementation tasks should be due in 3 months.
In general, it is advisable to use milestones instead of due dates to keep a lean development process and still be able to keep close track of the progress. If you e.g. set due dates for tickets belonging to the next spring, you could just as well have created a milestone for said sprint, and therefore keep close track of the progress while removing the often unrealistic dangling sword of due dates from the mind of the developer.
Think of it this way: The most effective way to motivate people in said context is for everyone to work towards a common goal (milestone) instead of everyone fearing to not hit and get yelled at. Don’t come up with reasoning like We don't yell at my company. Even if there is no explicitly negative reaction whatsoever, subconcious reactions to the negative motivation attempt will not make your goal easier to reach – or your project easier to manage.
Corollary
If you make tools difficult to use for people, people will not use the tools – or use them only to the extent that you actively enforce. Since you should have better things to do than enforcing the use of tools, try your best to don’t make them hard to use – and stop coming up with reasons why you seem to make it harder to be used.
In practice, it is often sufficient to avoid punishing behavior that is incompatible with some policy but instead try to encourage & reward improvement. You could, for example, treat badly written issues with a lower priority until they are improved, but never make the mistake of trying to educate the users by dismissing them.
Have a demo project for all users
Often when you introduce new users to Redmine or you want to test out new features, a demo project can come in very handy. It allows you to test out and show features to users without real-world consequences even if you screw up something. Give all users permanent access to the demo project – so they can try out things as well if required.
How to easily install Redmine using Docker Images
Note: Also see this followup post on how to use custom themes in this setup and this followup post on how to backup Redmine using this setup.
This tutorial shows you step-by-step the easiest method of setting up a fresh redmine installation I have found so far. The commands have been tested on Ubuntu 18.04, but they should work with minimal modification on other DEB-based distributions
Installing Docker & Docker-Compose
# Install prerequisites
sudo apt-get update
sudo apt-get -y install apt-transport-https ca-certificates curl software-properties-common
# Add docker's package signing key
curl -fsSL https://download.docker.com/linux/ubuntu/gpg | sudo apt-key add -
# Add repository
sudo add-apt-repository -y "deb [arch=amd64] https://download.docker.com/linux/ubuntu $(lsb_release -cs) stable"
# Install latest stable docker stable version
sudo apt-get update
sudo apt-get -y install docker-ce
# Install docker-compose
sudo curl -L "https://github.com/docker/compose/releases/download/1.23.2/docker-compose-$(uname -s)-$(uname -m)" -o /usr/local/bin/docker-compose
sudo chmod a+x /usr/local/bin/docker-compose
# Add current user to the docker group
sudo usermod -a -G docker $USER
# Enable & start docker service
sudo systemctl enable docker
sudo systemctl start docker
After running this shell script, log out & login from the system in order for the docker group to be added to the current user.
Creating the directory & docker-compose configuration
We will install redmine in /var/lib/redmine which will host the data directories and the docker-compose script.
# Create directories
sudo mkdir /var/lib/redmine
sudo mkdir -p /var/lib/redmine/redmine_data /var/lib/redmine/mariadb_data
# Set correct permissions for the directories
sudo chown -R 1001:1001 /var/lib/redmine/redmine_data /var/lib/redmine/mariadb_data
sudo chown -R $USER:docker /var/lib/redmine
Next, we’ll create /var/lib/redmine/docker-compose.yml.
There’s a couple of things you need to change here:
• Set REDMINE_EMAIL to the email of the admin user you want to use (usually that is your email!)
• Set the SMTP credentials (SMTP_HOSTSMTP_PORTSMTP_USER and SMTP_PASSWORD) to a valid SMTP server. SMTP_TLS defaults to true – in the rare case that
• The ports configuration, in this case '3718:3000' means that Redmine will be mapped to port 3718 on the local PC. This port is chosen somewhat arbitarily – as we will run redmine behind an nginx reverse proxy, the port does not need to be any port in particular (as long as you use the same port everywhere), but it may not be used by anything else. You can use any port here, provided that it’s not used for anything else. Leave 3000 as-is and only change 3718 if required.
Note that you do not need to change REDMINE_PASSWORD – when you login for the first time, redmine will force you to change the password anyway.
version: '2'
services:
mariadb:
image: 'bitnami/mariadb:latest'
environment:
- ALLOW_EMPTY_PASSWORD=yes
volumes:
- '/var/lib/redmine/mariadb_data:/bitnami'
redmine:
image: 'bitnami/redmine:latest'
environment:
- REDMINE_USERNAME=admin
- REDMINE_PASSWORD=redmineadmin
- [email protected]
- SMTP_HOST=smtp.gmail.com
- SMTP_PORT=25
- [email protected]
- SMTP_PASSWORD=yourGmailPassword
ports:
- '3718:3000'
volumes:
- '/var/lib/redmine/redmine_data:/bitnami'
depends_on:
- mariadb
Setting up the systemd service
Next, we’ll configure the systemd service in /etc/systemd/system/redmine.service.
Set User=... to your current user in the [Service] section.
[Unit]
Description=Redmine
Requires=docker.service
After=docker.service
[Service]
Restart=always
User=uli
Group=docker
# Shutdown container (if running) when unit is stopped
ExecStartPre=/usr/local/bin/docker-compose -f /var/lib/redmine/docker-compose.yml down -v
# Start container when unit is started
ExecStart=/usr/local/bin/docker-compose -f /var/lib/redmine/docker-compose.yml up
# Stop container when unit is stopped
ExecStop=/usr/local/bin/docker-compose -f /var/lib/redmine/docker-compose.yml down -v
[Install]
WantedBy=multi-user.target
After creating the file, we can enable and start the redmine service:
sudo systemctl enable redmine
sudo systemctl start redmine
The output of sudo systemctl start redmine should be empty. In case it is
Job for redmine.service failed because the control process exited with error code.
See "systemctl status redmine.service" and "journalctl -xe" for details.
debug the issue using journalctl -xe and journalctl -e
The first startup usually takes about 3 minutes, so grab a cup of coffee.
Now you can check if redmine is running using
wget -qO- http://localhost:3718/
(if you changed the port config before, you need to use your custom port in the URL).
If it worked, it will show a large HTML output, ending with
[...]
<div id="footer">
<div class="bgl"><div class="bgr">
Powered by <a href="https://www.redmine.org/">Redmine</a> © 2006-2018 Jean-Philippe Lang
</div></div>
</div>
</div>
</div>
</body>
</html>
If the output is empty, try wget -O- http://localhost:3718/ to see the error message
Setting up the nginx reverse proxy (optional but recommended)
We’ll use nginx to proxy the requests from a certain domain (Using Apache, if you use it already, is also possible but it is outside the scope of this tutorial to tell you how to do that). Install it using
sudo apt -y install nginx
First, you’ll need a domain name with DNS being configured. For this example, we’ll assume that your domain name is redmine.techoverflow.net ! You need to change it to your domain name!
First, we’ll create the config file in /etc/nginx/sites-enabled/redmine.conf. Remember to replace redmine.techoverflow.net by your domain name! If you use a port different from 3718, replace that as ewll.
server {
listen 80;
server_name redmine.techoverflow.net;
access_log /var/log/nginx/redmine.access_log;
error_log /var/log/nginx/redmine.error_log info;
location / {
proxy_pass http://127.0.0.1:3718; # docker-compose forwarded
proxy_read_timeout 3600s;
proxy_http_version 1.1;
}
}
Now run sudo nginx -t to test if there are any errors in the config file. If everything is alright, you’ll see
nginx: the configuration file /etc/nginx/nginx.conf syntax is ok
nginx: configuration file /etc/nginx/nginx.conf test is successful
Once you have fixed all errors, if any, run sudo service nginx reload to apply the configuration.
Test the setup by navigating your domain name in the browser. You should see the redmine interface:
Securing the nginx reverse proxy using Let’s Encrypt
First we need to install certbot and the certbot nginx plugin in order to create & install the certificate in nginx:
sudo apt -y install python3-certbot python3-certbot-nginx
Fortunately certbot automates most of the process of installing & configuring SSL and the certificate. Run
sudo certbot --nginx
It will ask you to enter your Email address and agree to the terms of service and if you want to receive the EFF newsletter.
After that, certbot will ask you to select the correct domain name:
Which names would you like to activate HTTPS for?
-------------------------------------------------------------------------------
1: redmine.techoverflow.net
-------------------------------------------------------------------------------
Select the appropriate numbers separated by commas and/or spaces, or leave input
blank to select all options shown (Enter 'c' to cancel):
In this case, there is only one domain name (there will be more if you have more domains active on nginx!).
Therefore, enter 1 and press enter. certbot will now generate the certificate. In case of success you will see
Deploying Certificate to VirtualHost /etc/nginx/sites-enabled/redmine.techoverflow.net.conf
Now it will ask you whether to redirect all requests to HTTPS automatically:
Please choose whether or not to redirect HTTP traffic to HTTPS, removing HTTP access.
-------------------------------------------------------------------------------
1: No redirect - Make no further changes to the webserver configuration.
2: Redirect - Make all requests redirect to secure HTTPS access. Choose this for
new sites, or if you're confident your site works on HTTPS. You can undo this
change by editing your web server's configuration.
-------------------------------------------------------------------------------
Select the appropriate number [1-2] then [enter] (press 'c' to cancel):
Choose Redirect here: Type 2 and press enter. Now you can login to redmine and finish the installation.
You need to renew the certificate every 3 months for it to stay valid, and run sudo service nginx reload afterwards to use the new certificate. If you fail to do this, users will see certificate expired error messages and won’t be able to access Redmine easily! See this post for details on how to mostly automate this process!
Setting up Redmine
Go to your domain name (if you have followed the instructions above, it should automatically redirect you to HTTPS). Click Login at the top right and login with the username admin and the default password redmineadmin. Upon first login, it will require you to change the password to a new – and more secure password.
I won’t describe in detail how to setup Redmine for your project. However there’s two things you should take care of immediately after the first login:
1. Configure the correct domain name: Go to Administration -> Settings and set Host name and path to your domain name, e.g. redmine.techoverflow.net. Set Protocol to HTTPS. You can also set a custom name for your Redmine installation under Application Title
2. Still under Administration -> Settings, go to the Email Notifications tab, set an approriate sender email address under Emission email address (usually you would use [email protected] here, but you might want to use your SMTP username for some SMTP providers like GMail)
3. Scroll down to the bottom of the Email Notifications page and click Send a test email which will send a test email to the current redmine user’s email adress. Unless you have changed it, the default is the address configured in REDMINE_EMAIL in /var/lib/redmine/docker-compose.yml.
In case the email does not work, change SMTP_...=... in /var/lib/redmine/docker-compose.yml but you also have to change it in /var/lib/redmine/redmine_data/redmine/conf/configuration.yml ! After doing the changes, restart redmine by
sudo systemctl restart redmine
which will use the new configuration from the config file.
Block access to the forwarded port using ufw (optional)
ufw is a simple Firewall for Ubuntu. Use sudo apt install ufw to install it and sudo ufw enable to activate it. The default configuration will allow SSH but it will block other ports, including port 3718 or any other custom port you might have used.
In order to enable it, use
sudo ufw enable
sudo ufw allow ssh
sudo ufw allow http
sudo ufw allow https
Remember to add any ports you need to have open to the list as well. See the ufw docs for more information.
|
{
"url": "https://techoverflow.net/category/project-management/",
"source_domain": "techoverflow.net",
"snapshot_id": "crawl=CC-MAIN-2019-13",
"warc_metadata": {
"Content-Length": "75249",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BWN42PNWO6EPDOYZAOB4VPYR534GE3TA",
"WARC-Concurrent-To": "<urn:uuid:97e44c1f-1f7e-4ccd-9614-cada9edea538>",
"WARC-Date": "2019-03-21T10:13:10Z",
"WARC-IP-Address": "95.216.138.188",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IKSSOI3KB3ONWMIMSINTLG3ORYC5WSU6",
"WARC-Record-ID": "<urn:uuid:a6acf89a-00bd-4ef3-89b9-0bc8a1f64c24>",
"WARC-Target-URI": "https://techoverflow.net/category/project-management/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5cc0ceb8-2a16-40dd-a90b-379f0ff60e2d>"
},
"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-30-226-49.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,
53,
54,
158,
159,
320,
321,
490,
491,
519,
520,
605,
606,
694,
695,
959,
960,
992,
993,
1340,
1341,
1355,
1356,
1526,
1527,
1548,
1549,
1640,
1815,
2032,
2196,
2367,
2368,
2609,
2610,
2645,
2646,
2728,
2729,
2891,
2892,
2955,
2956,
3060,
3061,
3312,
3313,
3401,
3402,
3449,
3450,
3485,
3486,
3676,
3677,
3751,
3752,
3781,
3782,
3853,
3854,
3911,
4061,
4195,
4196,
4398,
4399,
4501,
4502,
4544,
4545,
4627,
4628,
4704,
4705,
4907,
4908,
4956,
4957,
5263,
5264,
5310,
5311,
5324,
5334,
5345,
5381,
5398,
5431,
5444,
5493,
5504,
5540,
5557,
5588,
5626,
5661,
5694,
5715,
5746,
5786,
5797,
5817,
5830,
5879,
5956,
5972,
5988,
5989,
6018,
6019,
6050,
6051,
6132,
6133,
6177,
6178,
6352,
6353,
6368,
6369,
6537,
6538,
6564,
6565,
6600,
6610,
6647,
6681,
6698,
6717,
6736,
6753,
6754,
7072,
7073,
7094,
7095,
7221,
7222,
7431,
7432,
7659,
7660,
7690,
7691,
7914,
7915,
8110,
8111,
8472,
8473,
8728,
8729,
8764,
8765,
8878,
8879,
9247,
9248,
9592,
9593,
9749,
9750,
9810,
9811,
10265,
10266,
10878,
10879,
11147,
11148,
11387,
11388,
11447,
11448,
11863,
11864,
12345,
12346,
12395,
12396,
12536,
12537,
12606,
12755,
12992,
12993,
13276,
13277,
13304,
13305,
13374,
13588,
13649,
13650,
13849,
13850,
13937,
14048,
14172,
14363,
14685,
14686,
14733,
14734,
14879,
14969,
15060,
15211,
15363,
15364,
15668,
15669,
15948,
15949,
16152,
16153,
16577,
16578,
16622,
16623,
16795,
16796,
17185,
17186,
17385,
17386,
17683,
17684,
17833,
18004,
18149,
18150,
18284,
18285,
18498,
19462,
19616,
19702,
19789,
19858,
20485,
20746,
20747,
21731,
21732,
22125,
22126,
22343,
22538,
22539,
23034,
23035,
23636,
23637,
23649,
23650,
23807,
23808,
23841,
23842,
24078,
24079,
24158,
24159,
24449,
24450,
24984,
24985,
25432,
25433,
26128,
26129,
26170,
26171,
26683,
26684,
27167,
27168,
27211,
27212,
27846,
27847,
28266,
28267,
28594,
28595,
29153,
29154,
29352,
29353,
29451,
29452,
29547,
29548,
29991,
29992,
30022,
30023,
30340,
30341,
30486,
30617,
30618,
31052,
31053,
31506,
31507,
31517,
31518,
31852,
31853,
32182,
32183,
32217,
32218,
32560,
32561,
32611,
32612,
32754,
32755,
33002,
33003,
33038,
33039,
33063,
33083,
33175,
33210,
33287,
33304,
33417,
33463,
33483,
33517,
33542,
33688,
33733,
33734,
33773,
33805,
33837,
33866,
33894,
33895,
34023,
34024,
34078,
34079,
34191,
34192,
34213,
34241,
34315,
34361,
34445,
34489,
34490,
34546,
34547,
34599,
34600,
34699,
34850,
35329,
35330,
35474,
35475,
35488,
35498,
35509,
35545,
35562,
35595,
35608,
35657,
35668,
35704,
35721,
35752,
35790,
35825,
35858,
35879,
35910,
35950,
35961,
35981,
35994,
36043,
36059,
36075,
36076,
36107,
36108,
36190,
36191,
36251,
36252,
36259,
36279,
36303,
36324,
36325,
36335,
36350,
36359,
36372,
36427,
36517,
36556,
36638,
36676,
36762,
36763,
36773,
36800,
36801,
36871,
36872,
36902,
36931,
36932,
37006,
37007,
37090,
37163,
37164,
37219,
37220,
37294,
37295,
37341,
37342,
37375,
37376,
37462,
37463,
37523,
37524,
37530,
37548,
37585,
37683,
37698,
37705,
37712,
37719,
37720,
37728,
37736,
37737,
37822,
37823,
37885,
37886,
38092,
38093,
38119,
38120,
38306,
38307,
38512,
38513,
38522,
38537,
38579,
38580,
38630,
38683,
38684,
38701,
38770,
38804,
38836,
38842,
38843,
38845,
38846,
38957,
38958,
39023,
39090,
39091,
39189,
39190,
39290,
39291,
39344,
39345,
39462,
39463,
39521,
39522,
39629,
39630,
39651,
39652,
39777,
39778,
39846,
39847,
39897,
39977,
40005,
40085,
40166,
40223,
40224,
40332,
40333,
40444,
40445,
40537,
40538,
40615,
40616,
40702,
40782,
40855,
40936,
41014,
41065,
41145,
41218,
41219,
41323,
41324,
41652,
41653,
41672,
41673,
41990,
41991,
42143,
42144,
42404,
42689,
42976,
42977,
43210,
43211,
43242,
43243,
43302,
43303,
43359,
43360,
43610,
43611,
43638,
43639,
43655,
43674,
43694,
43715,
43716
],
"line_end_idx": [
53,
54,
158,
159,
320,
321,
490,
491,
519,
520,
605,
606,
694,
695,
959,
960,
992,
993,
1340,
1341,
1355,
1356,
1526,
1527,
1548,
1549,
1640,
1815,
2032,
2196,
2367,
2368,
2609,
2610,
2645,
2646,
2728,
2729,
2891,
2892,
2955,
2956,
3060,
3061,
3312,
3313,
3401,
3402,
3449,
3450,
3485,
3486,
3676,
3677,
3751,
3752,
3781,
3782,
3853,
3854,
3911,
4061,
4195,
4196,
4398,
4399,
4501,
4502,
4544,
4545,
4627,
4628,
4704,
4705,
4907,
4908,
4956,
4957,
5263,
5264,
5310,
5311,
5324,
5334,
5345,
5381,
5398,
5431,
5444,
5493,
5504,
5540,
5557,
5588,
5626,
5661,
5694,
5715,
5746,
5786,
5797,
5817,
5830,
5879,
5956,
5972,
5988,
5989,
6018,
6019,
6050,
6051,
6132,
6133,
6177,
6178,
6352,
6353,
6368,
6369,
6537,
6538,
6564,
6565,
6600,
6610,
6647,
6681,
6698,
6717,
6736,
6753,
6754,
7072,
7073,
7094,
7095,
7221,
7222,
7431,
7432,
7659,
7660,
7690,
7691,
7914,
7915,
8110,
8111,
8472,
8473,
8728,
8729,
8764,
8765,
8878,
8879,
9247,
9248,
9592,
9593,
9749,
9750,
9810,
9811,
10265,
10266,
10878,
10879,
11147,
11148,
11387,
11388,
11447,
11448,
11863,
11864,
12345,
12346,
12395,
12396,
12536,
12537,
12606,
12755,
12992,
12993,
13276,
13277,
13304,
13305,
13374,
13588,
13649,
13650,
13849,
13850,
13937,
14048,
14172,
14363,
14685,
14686,
14733,
14734,
14879,
14969,
15060,
15211,
15363,
15364,
15668,
15669,
15948,
15949,
16152,
16153,
16577,
16578,
16622,
16623,
16795,
16796,
17185,
17186,
17385,
17386,
17683,
17684,
17833,
18004,
18149,
18150,
18284,
18285,
18498,
19462,
19616,
19702,
19789,
19858,
20485,
20746,
20747,
21731,
21732,
22125,
22126,
22343,
22538,
22539,
23034,
23035,
23636,
23637,
23649,
23650,
23807,
23808,
23841,
23842,
24078,
24079,
24158,
24159,
24449,
24450,
24984,
24985,
25432,
25433,
26128,
26129,
26170,
26171,
26683,
26684,
27167,
27168,
27211,
27212,
27846,
27847,
28266,
28267,
28594,
28595,
29153,
29154,
29352,
29353,
29451,
29452,
29547,
29548,
29991,
29992,
30022,
30023,
30340,
30341,
30486,
30617,
30618,
31052,
31053,
31506,
31507,
31517,
31518,
31852,
31853,
32182,
32183,
32217,
32218,
32560,
32561,
32611,
32612,
32754,
32755,
33002,
33003,
33038,
33039,
33063,
33083,
33175,
33210,
33287,
33304,
33417,
33463,
33483,
33517,
33542,
33688,
33733,
33734,
33773,
33805,
33837,
33866,
33894,
33895,
34023,
34024,
34078,
34079,
34191,
34192,
34213,
34241,
34315,
34361,
34445,
34489,
34490,
34546,
34547,
34599,
34600,
34699,
34850,
35329,
35330,
35474,
35475,
35488,
35498,
35509,
35545,
35562,
35595,
35608,
35657,
35668,
35704,
35721,
35752,
35790,
35825,
35858,
35879,
35910,
35950,
35961,
35981,
35994,
36043,
36059,
36075,
36076,
36107,
36108,
36190,
36191,
36251,
36252,
36259,
36279,
36303,
36324,
36325,
36335,
36350,
36359,
36372,
36427,
36517,
36556,
36638,
36676,
36762,
36763,
36773,
36800,
36801,
36871,
36872,
36902,
36931,
36932,
37006,
37007,
37090,
37163,
37164,
37219,
37220,
37294,
37295,
37341,
37342,
37375,
37376,
37462,
37463,
37523,
37524,
37530,
37548,
37585,
37683,
37698,
37705,
37712,
37719,
37720,
37728,
37736,
37737,
37822,
37823,
37885,
37886,
38092,
38093,
38119,
38120,
38306,
38307,
38512,
38513,
38522,
38537,
38579,
38580,
38630,
38683,
38684,
38701,
38770,
38804,
38836,
38842,
38843,
38845,
38846,
38957,
38958,
39023,
39090,
39091,
39189,
39190,
39290,
39291,
39344,
39345,
39462,
39463,
39521,
39522,
39629,
39630,
39651,
39652,
39777,
39778,
39846,
39847,
39897,
39977,
40005,
40085,
40166,
40223,
40224,
40332,
40333,
40444,
40445,
40537,
40538,
40615,
40616,
40702,
40782,
40855,
40936,
41014,
41065,
41145,
41218,
41219,
41323,
41324,
41652,
41653,
41672,
41673,
41990,
41991,
42143,
42144,
42404,
42689,
42976,
42977,
43210,
43211,
43242,
43243,
43302,
43303,
43359,
43360,
43610,
43611,
43638,
43639,
43655,
43674,
43694,
43715,
43716,
43823
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 43823,
"ccnet_original_nlines": 558,
"rps_doc_curly_bracket": 0.00009128000237978995,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4036885201931,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.012295080348849297,
"rps_doc_frac_lines_end_with_ellipsis": 0.001788910012692213,
"rps_doc_frac_no_alph_words": 0.1837431639432907,
"rps_doc_frac_unique_words": 0.2308490127325058,
"rps_doc_mean_word_length": 5.10342264175415,
"rps_doc_num_sentences": 335,
"rps_doc_symbol_to_word_ratio": 0.00239070993848145,
"rps_doc_unigram_entropy": 6.164154052734375,
"rps_doc_word_count": 6749,
"rps_doc_frac_chars_dupe_10grams": 0.03675638139247894,
"rps_doc_frac_chars_dupe_5grams": 0.06451237946748734,
"rps_doc_frac_chars_dupe_6grams": 0.050605349242687225,
"rps_doc_frac_chars_dupe_7grams": 0.04535029083490372,
"rps_doc_frac_chars_dupe_8grams": 0.04337600991129875,
"rps_doc_frac_chars_dupe_9grams": 0.03954359143972397,
"rps_doc_frac_chars_top_2gram": 0.004209849983453751,
"rps_doc_frac_chars_top_3gram": 0.001829109969548881,
"rps_doc_frac_chars_top_4gram": 0.002177509944885969,
"rps_doc_books_importance": -3339.859375,
"rps_doc_books_importance_length_correction": -3339.859375,
"rps_doc_openwebtext_importance": -1924.7864990234375,
"rps_doc_openwebtext_importance_length_correction": -1924.7864990234375,
"rps_doc_wikipedia_importance": -1347.302001953125,
"rps_doc_wikipedia_importance_length_correction": -1347.302001953125
},
"fasttext": {
"dclm": 0.052098989486694336,
"english": 0.8924713134765625,
"fineweb_edu_approx": 2.0571486949920654,
"eai_general_math": 0.6832855343818665,
"eai_open_web_math": 0.20051223039627075,
"eai_web_code": 0.7509876489639282
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.445",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
3,746,312,596,873,290,000 |
Social Media Motivation – Using Crowd Power to Propel you Toward your Goals
Conventional wisdom says we’re more likely to reach our goals if we have support, if we’re around people who goad us on, encourage us or point the way to success. In my experience this is true, but not just with people I can see face-to-face.
I’m using social media to keep me motivated as I train for another marathon and write another novel.
Take the running, for example. I know a few local runners but I don’t belong to a gym or club. I’m mostly on my own. Except, I’m not.
I follow a lot of runners on Twitter and now, Dailymile. When I read their race reports or tweets about training trials and triumphs, it makes me want to get out there and do the same. When I’m feeling lethargic or uninspired, they encourage me to keep at it. When I have a great run or reach a milestone, they’re the first to offer praise. It helps and I’ve logged more miles as a result.
I’ve also added push ups and planks to my workouts because of social media peer pressure. A couple of months ago I kept seeing the #pushupclub and #plankaday hashtags, so I joined the fun. If you can call it that. There’s a lot of groaning and shaking involved in a quest for stronger abs and arms. But if I miss a few days, the @plankpolice tweet at me, spurring me to get planking. I like that. It’s like a having a coach tell you to get off your butt.
This motivating influence isn’t limited to running or planks. You can leverage social media to create your own positive peer pressure for just about any goal.
Do you want to write a novel, eliminate debt, lose weight, quit smoking or travel more? With a little digging, you can find like-minded people who either share your goals or who have already achieved them and are willing to share their expertise.
1. Search Twitter for hashtags about your topic. I found a lot of writers, for example, when I found the #amwriting tag through such a search.
2. Use an internet search engine to find relevant social media sites. Search for “social media” and “diet”, for example, to find sites geared toward losing weight. You’ll find a lot.
3. Pick one or two sites and make friends. Follow people, add them and interact.
4. Offer the type of encouragement and support you want to receive.
5. Share both your struggles and your successes.
6. Ask for tips and advice.
7. Have fun making friends while you work toward your goals.
Take it from me, it helps. Now, I better get planking before I get a tweet from the @plankpolice.
How do you meet other people who share your goals and interests? How do you encourage others on the same path?
This entry was posted in Running, Wildcard, Writing and tagged , , , , , , . Bookmark the permalink.
|
{
"url": "http://www.jillbarville.com/2012/02/02/social-media-motivation-using-crowd-power-to-propel-you-toward-your-goals/",
"source_domain": "www.jillbarville.com",
"snapshot_id": "crawl=CC-MAIN-2017-43",
"warc_metadata": {
"Content-Length": "42346",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SDY7YT4546M55II7F2N2QPKQBM53GNQD",
"WARC-Concurrent-To": "<urn:uuid:81395d50-6fd5-4a3c-a89e-b7e9732cb65f>",
"WARC-Date": "2017-10-22T04:23:20Z",
"WARC-IP-Address": "50.87.248.67",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CFBLKWF2JQANMNR4M6FYA2BGOFNFNVVX",
"WARC-Record-ID": "<urn:uuid:a6b50941-7242-45c6-81ae-f06cfccf6114>",
"WARC-Target-URI": "http://www.jillbarville.com/2012/02/02/social-media-motivation-using-crowd-power-to-propel-you-toward-your-goals/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:93b9d7ad-9ab1-48d4-ba95-15af0a63657d>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-152-37-148.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-43\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for October 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
76,
77,
320,
321,
422,
423,
557,
558,
948,
949,
1406,
1407,
1566,
1567,
1814,
1815,
1960,
2145,
2228,
2298,
2349,
2379,
2442,
2443,
2541,
2542,
2653,
2654
],
"line_end_idx": [
76,
77,
320,
321,
422,
423,
557,
558,
948,
949,
1406,
1407,
1566,
1567,
1814,
1815,
1960,
2145,
2228,
2298,
2349,
2379,
2442,
2443,
2541,
2542,
2653,
2654,
2754
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2754,
"ccnet_original_nlines": 28,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4168013036251068,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03554119914770126,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17932148277759552,
"rps_doc_frac_unique_words": 0.5070140361785889,
"rps_doc_mean_word_length": 4.2805609703063965,
"rps_doc_num_sentences": 47,
"rps_doc_symbol_to_word_ratio": 0.00484653003513813,
"rps_doc_unigram_entropy": 5.119069576263428,
"rps_doc_word_count": 499,
"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.02574905939400196,
"rps_doc_frac_chars_top_3gram": 0.00842696987092495,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -231.41049194335938,
"rps_doc_books_importance_length_correction": -231.41049194335938,
"rps_doc_openwebtext_importance": -122.32850646972656,
"rps_doc_openwebtext_importance_length_correction": -122.32850646972656,
"rps_doc_wikipedia_importance": -113.91313171386719,
"rps_doc_wikipedia_importance_length_correction": -113.91313171386719
},
"fasttext": {
"dclm": 0.08343321084976196,
"english": 0.898015558719635,
"fineweb_edu_approx": 1.3749723434448242,
"eai_general_math": 0.02201521024107933,
"eai_open_web_math": 0.12551403045654297,
"eai_web_code": 0.00032580000697635114
}
}
|
{
"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": "158.1",
"labels": {
"level_1": "Philosophy and psychology",
"level_2": "Psychology",
"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": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "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
|
-2,322,351,561,057,399,000 |
Solved
Saving a webpage to your HD then viewing it directly (ie without the internet)
Posted on 2016-09-22
8
40 Views
1 Endorsement
Last Modified: 2016-10-01
Hello,
I generally use Google Chrome or Mozilla Firefox for accessing the internet. With each of these browsers, you can right-click anywhere on the page and bring up the option to "Save as..." or "Save Page as...". Then after selecting a folder and pressing {Enter}, the browser shows that a download has occurred from that site.
1st Question
When the above steps are taken, what file(s) actually gets saved to your HD? Is it:
a) simply a link to the page's URL or
b) some portion of the page or
c) the entire page with all of its content?
2nd Question
Once the file has been saved to your HD folder, what exactly happens when you double-click to open it? Does it
a) go to the internet and bring up the site in same way it did in the first place (ie before the "Save as..." process) or
b) open the page directly from your HD without any internet involvement or
c) utilize a combination of the file you saved locally and content from the actual website?
3rd Question
Suppose a particular webpage has a very slow load time due to either slowness in the site itself or the amount of traffic accessing the site. Is there a way to save the webpage to your HD so that you can quickly open and view the content without going to the site — even though your system is connected to the internet?
Thanks
1
Comment
Question by:WeThotUWasAToad
8 Comments
LVL 83
Assisted Solution
by:Dave Baldwin
Dave Baldwin earned 300 total points
ID: 41811701
It depends. While Firefox will save the complete current page, you may still have content that accesses the internet. Double clicking on a simple page will load it directly from the file you saved. Pages that include things like AJAX routines that load content after the page is loaded will still try to access that content over the internet.
Saving a slow page will not necessarily speed it if the slowdown is because of database access which still requires internet access. In fact, the page may not load at all from a local file if it requires script files that are only on the server and not saved locally.
So... it depends. Try saving it to your computer and then see if it works when you try to open it locally.
0
Author Comment
by:WeThotUWasAToad
ID: 41811819
Thanks for the reply Dave.
Try saving it to your computer and then see if it works when you try to open it locally.
I tried that prior to my OP and you are right, it was actually slower than going to the site itself.
More details:
I'm playing World of Warcraft and Blizzard just launched their newest expansion (Legion) less than a month ago. I have not been subscribed/playing during the launch of a new expansion before but apparently it generates a lot of new subscriptions and re-subscriptions.
The most popular (independent) WoW fansite is wowhead.com which is where I've traditionally gone to research or get answers to questions. Some of their pages are unbearably slow right now and I assume that it's due to all the extra traffic. Am I correct that an overabundance of traffic will slow down a website?
As a result, I was hoping that I could download and save some of the main resource pages I use and then be able to simply access them directly from my HD after that.
Is there another method or workaround that could accomplish that?
Of course their pages have all sorts of ads and links but I'm mainly interested in the content. Having the links found in the main article would be helpful also if that's possible.
In the past, I've tried selecting the main article and doing a simple copy/paste but that almost always trashes the formatting and using Paste Value or Paste Text Only is not much better.
Any thoughts?
Thanks again.
0
LVL 26
Assisted Solution
by:Dr. Klahn
Dr. Klahn earned 100 total points
ID: 41811873
Dave is 100% correct. Whether a page can be saved, and still be readable, is unpredictable without actually trying it.
One way to make a saved page useless offline is to take the FQDN out of URLs in the page source. Consider:
<P>
Now insert the four left-handed lag screws according to the image below:<BR>
<IMG SRC="/images/assembly1.gif" ALT="Your downloaded page is futile">
</P>
Open in new window
The IMG tag lacks the FQDN preceding the path to the image. As such, the only place it will work is on the original web site. This is not necessarily done with the intent to make the page useless offline; from the web site manager's point of view, internal URLs without an FQDN are much easier to re-root at another folder, or even on another server.
The same applies for script, Perl and other "active" URLs. Except more so.
There is so much cross-site scripting going on now on most web pages that I'm generally surprised when a saved page does anything useful at all.
0
Free Tool: Port Scanner
Check which ports are open to the outside world. Helps make sure that your firewall rules are working as intended.
One of a set of tools we are providing to everyone as a way of saying thank you for being a part of the community.
LVL 88
Assisted Solution
by:rindi
rindi earned 100 total points
ID: 41812043
One thing that can help speed up access times to web content you have visited before, is to use a server at home which has a proxy server installed. Proxy servers can be configured as caching proxy's, and so if you visit a website, it's contents get cached on your server. If you visit that site again later or via another PC on your LAN, it loads faster as the content is first loaded from the proxy's cache.
0
Author Comment
by:WeThotUWasAToad
ID: 41813277
Thanks for the responses.
...use a server at home which has a proxy server installed.
Is that a hard thing to do? I mean, doesn't it require additional hardware, software, and know-how?
0
Accepted Solution
by:
WeThotUWasAToad earned 0 total points
ID: 41813306
FYI I just revisited the poor man's technique I mentioned earlier which is to simply select just the article itself and paste it into a Word document.
I haven't tried that for several years — certainly before Word 2010 which is my current version of choice — but the results are surprisingly good (ie definitely good enough for just quickly seeing a particular page). And the links are preserved.
For my own reference (and in case anyone else is interested), the page I used is here:
http://www.wowhead.com/guides/legion/world-quests
And following are the steps:
1) selected from the first word "Legion" in the title down to the paragraph ending with "Hidden Potential."
2) did a simple Ctrl+c followed by Ctrl+v in a new Word doc.
3) determined the webpage color (using a handy freeware utility called Meazure) and found it to be |036 036 036|
4) in Word, went to Page Layout > Page Color and specified the same RGB settings.
The only remaining issue was that, although the majority of links retained their yellow/gold color, the links adjacent to small image icons were completely blue |000 000 255| and difficult to read against the dark background. I tried modifying the Hyperlink Style but that did nothing.
But this did the trick:
5) using the Find and Replace box, I formatted the "Find what" field to |000 000 255| and the "Replace with" field to |000 112 221| (the color of those links on the website). Then clicking "Replace All" fixed the issue.
Oh, I also:
6) entered a double line feed wherever text butted-up to an image.
And Voila! I had a perfect replica of the webpage with all needed functionality included.
Again, that's quite a remedial approach but hey, it's great for what I'm after.
0
LVL 88
Expert Comment
by:rindi
ID: 41813466
Yes, for a proxy, you need another PC, install a Linux Distro to it, then install Squid proxy and configure it so that it acts as a cache, and then add the proxy server's address in the proxy settings of your PC's web-browsers.
0
Author Closing Comment
by:WeThotUWasAToad
ID: 41824643
Thanks for the feedback.
I flagged my own solution so it can be quickly identified in the future.
0
Featured Post
Free Tool: IP Lookup
Get more info about an IP address or domain name, such as organization, abuse contacts and geolocation.
One of a set of tools we are providing to everyone as a way of saying thank you for being a part of the community.
Question has a verified solution.
If you are experiencing a similar issue, please ask a related question
Suggested Solutions
How many times have you been browsing the internet, with multiple tabs open, and closed the wrong one? Have you ever clicked 'Close all tabs' instead of 'Close current tab' ? Internet Explorer 8 now brings to you, what Firefox has had for a wh…
#Citrix #Internet Explorer #Enterprise Mode #IE 11 #IE 8
Google currently has a new report that is in beta and coming soon to Webmaster Tool accounts. This Micro Tutorial will highlight new features for Google Webmaster Tools.
This Micro Tutorial will demonstrate how to add subdomains to your content reports. This can be very importing in having a site with multiple subdomains.
837 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/28971780/Saving-a-webpage-to-your-HD-then-viewing-it-directly-ie-without-the-internet.html",
"source_domain": "www.experts-exchange.com",
"snapshot_id": "crawl=CC-MAIN-2017-13",
"warc_metadata": {
"Content-Length": "195011",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HGFEZCBIRFGLWIBDQI2GIKT5YRCOXNP7",
"WARC-Concurrent-To": "<urn:uuid:7d31f5cf-26d6-4e04-ba10-a487b0bf9315>",
"WARC-Date": "2017-03-27T22:28:47Z",
"WARC-IP-Address": "104.20.169.10",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:FOPI6H2LD3FIK45HGEXZPQUKEEVFPOOE",
"WARC-Record-ID": "<urn:uuid:23827fcd-e254-4bd4-9c70-670038fd94f4>",
"WARC-Target-URI": "https://www.experts-exchange.com/questions/28971780/Saving-a-webpage-to-your-HD-then-viewing-it-directly-ie-without-the-internet.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:420da6fe-c855-4966-8367-fbb6965e1e4b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-233-31-227.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2017-13\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for March 2017\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
7,
8,
87,
88,
109,
111,
120,
134,
160,
167,
168,
492,
493,
506,
590,
632,
667,
715,
716,
729,
840,
966,
1045,
1141,
1142,
1155,
1475,
1476,
1483,
1485,
1493,
1521,
1532,
1534,
1541,
1542,
1560,
1561,
1577,
1614,
1627,
1973,
1974,
2243,
2244,
2352,
2354,
2356,
2357,
2372,
2373,
2392,
2405,
2432,
2433,
2522,
2623,
2624,
2638,
2639,
2907,
2908,
3221,
3222,
3388,
3389,
3455,
3456,
3637,
3638,
3826,
3827,
3841,
3842,
3856,
3858,
3860,
3867,
3868,
3886,
3887,
3900,
3934,
3947,
4067,
4068,
4176,
4177,
4181,
4258,
4329,
4334,
4335,
4354,
4355,
4356,
4709,
4710,
4786,
4787,
4932,
4934,
4958,
4959,
5074,
5075,
5190,
5191,
5193,
5200,
5201,
5219,
5220,
5229,
5259,
5272,
5682,
5684,
5686,
5687,
5702,
5703,
5722,
5735,
5761,
5821,
5921,
5923,
5925,
5926,
5944,
5945,
5949,
5987,
6000,
6151,
6152,
6398,
6399,
6486,
6487,
6541,
6542,
6571,
6572,
6680,
6681,
6742,
6743,
6856,
6857,
6939,
6940,
7226,
7227,
7251,
7252,
7472,
7473,
7485,
7486,
7553,
7554,
7644,
7645,
7725,
7727,
7729,
7736,
7737,
7752,
7753,
7762,
7775,
8003,
8005,
8007,
8008,
8031,
8032,
8051,
8064,
8089,
8090,
8163,
8165,
8166,
8180,
8181,
8202,
8203,
8307,
8308,
8423,
8424,
8458,
8459,
8530,
8531,
8551,
8552,
8797,
8854,
9024,
9178,
9179,
9263,
9264,
9343,
9344
],
"line_end_idx": [
7,
8,
87,
88,
109,
111,
120,
134,
160,
167,
168,
492,
493,
506,
590,
632,
667,
715,
716,
729,
840,
966,
1045,
1141,
1142,
1155,
1475,
1476,
1483,
1485,
1493,
1521,
1532,
1534,
1541,
1542,
1560,
1561,
1577,
1614,
1627,
1973,
1974,
2243,
2244,
2352,
2354,
2356,
2357,
2372,
2373,
2392,
2405,
2432,
2433,
2522,
2623,
2624,
2638,
2639,
2907,
2908,
3221,
3222,
3388,
3389,
3455,
3456,
3637,
3638,
3826,
3827,
3841,
3842,
3856,
3858,
3860,
3867,
3868,
3886,
3887,
3900,
3934,
3947,
4067,
4068,
4176,
4177,
4181,
4258,
4329,
4334,
4335,
4354,
4355,
4356,
4709,
4710,
4786,
4787,
4932,
4934,
4958,
4959,
5074,
5075,
5190,
5191,
5193,
5200,
5201,
5219,
5220,
5229,
5259,
5272,
5682,
5684,
5686,
5687,
5702,
5703,
5722,
5735,
5761,
5821,
5921,
5923,
5925,
5926,
5944,
5945,
5949,
5987,
6000,
6151,
6152,
6398,
6399,
6486,
6487,
6541,
6542,
6571,
6572,
6680,
6681,
6742,
6743,
6856,
6857,
6939,
6940,
7226,
7227,
7251,
7252,
7472,
7473,
7485,
7486,
7553,
7554,
7644,
7645,
7725,
7727,
7729,
7736,
7737,
7752,
7753,
7762,
7775,
8003,
8005,
8007,
8008,
8031,
8032,
8051,
8064,
8089,
8090,
8163,
8165,
8166,
8180,
8181,
8202,
8203,
8307,
8308,
8423,
8424,
8458,
8459,
8530,
8531,
8551,
8552,
8797,
8854,
9024,
9178,
9179,
9263,
9264,
9343,
9344,
9365
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9365,
"ccnet_original_nlines": 210,
"rps_doc_curly_bracket": 0.00021355999342631549,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4235652685165405,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.033011678606271744,
"rps_doc_frac_lines_end_with_ellipsis": 0.004739339929074049,
"rps_doc_frac_no_alph_words": 0.17420010268688202,
"rps_doc_frac_unique_words": 0.37975460290908813,
"rps_doc_mean_word_length": 4.480368137359619,
"rps_doc_num_sentences": 89,
"rps_doc_symbol_to_word_ratio": 0.005586590152233839,
"rps_doc_unigram_entropy": 5.689522743225098,
"rps_doc_word_count": 1630,
"rps_doc_frac_chars_dupe_10grams": 0.055593591183423996,
"rps_doc_frac_chars_dupe_5grams": 0.07065588980913162,
"rps_doc_frac_chars_dupe_6grams": 0.055593591183423996,
"rps_doc_frac_chars_dupe_7grams": 0.055593591183423996,
"rps_doc_frac_chars_dupe_8grams": 0.055593591183423996,
"rps_doc_frac_chars_dupe_9grams": 0.055593591183423996,
"rps_doc_frac_chars_top_2gram": 0.0068465000949800014,
"rps_doc_frac_chars_top_3gram": 0.004381760023534298,
"rps_doc_frac_chars_top_4gram": 0.004107899963855743,
"rps_doc_books_importance": -774.93310546875,
"rps_doc_books_importance_length_correction": -774.93310546875,
"rps_doc_openwebtext_importance": -477.64154052734375,
"rps_doc_openwebtext_importance_length_correction": -477.64154052734375,
"rps_doc_wikipedia_importance": -303.5143737792969,
"rps_doc_wikipedia_importance_length_correction": -303.5143737792969
},
"fasttext": {
"dclm": 0.0299835205078125,
"english": 0.9355023503303528,
"fineweb_edu_approx": 1.4693440198898315,
"eai_general_math": 0.2252671718597412,
"eai_open_web_math": 0.2475096583366394,
"eai_web_code": 0.022508619353175163
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-4,954,657,708,903,905,000 |
java
关注公众号 jb51net
关闭
首页 > 软件编程 > java > java LeetCode贪心构造
java LeetCode刷题稍有难度的贪心构造算法
作者：宫水三叶的刷题日记
这篇文章主要为大家介绍了java LeetCode刷题稍有难度的贪心构造题解示例，有需要的朋友可以借鉴参考下，希望能够有所帮助，祝大家多多进步，早日升职加薪
题目描述
这是 LeetCode 上的 768. 最多能完成排序的块 II ，难度为 困难
Tag : 「贪心」
这个问题和“最多能完成排序的块”相似，但给定数组中的元素可以重复，输入数组最大长度为 200020002000，其中的元素最大为 10810^8108。
arr 是一个可能包含重复元素的整数数组，我们将这个数组分割成几个“块”，并将这些块分别进行排序。之后再连接起来，使得连接的结果和按升序排序后的原数组相同。
我们最多能将数组分成多少块？
示例 1:
输入: arr = [5,4,3,2,1]
输出: 1
解释:
将数组分成2块或者更多块，都无法得到所需的结果。
例如，分成 [5, 4], [3, 2, 1] 的结果是 [4, 5, 1, 2, 3]，这不是有序的数组。
示例 2:
输入: arr = [2,1,3,4,4]
输出: 4
解释:
我们可以把它分成两块，例如 [2, 1], [3, 4, 4]。
然而，分成 [2, 1], [3], [4], [4] 可以得到最多的块数。
注意:
arr 的长度在 [1,2000][1, 2000][1,2000] 之间。
arr[i] 的大小在 [0,108][0, 10^8][0,108] 之间。
贪心 + 构造
一种容易想到的构造方法，是与目标序列（已排升序的数组 clone）做区间比较。
由于题目要求尽可能划分出多的区间，我们可以从前往后处理 arrclone 时统计区间内数的情况，若有 arr[i...j]clone[i...j] 词频完全相同，可知 arr[i...j] 可通过内部排序调整为 clone[i...j]，此时我们将范围 [i...j][i...j][i...j] 划分为一个区间，然后继续往后处理直到整个数组处理完。
Java 代码：
class Solution {
public int maxChunksToSorted(int[] arr) {
int[] clone = arr.clone();
Arrays.sort(clone);
int n = arr.length, ans = 0;
Map<Integer, Integer> map = new HashMap<>();
for (int i = 0, tot = 0; i < n; i++) {
int a = arr[i], b = clone[i];
if (map.getOrDefault(a, 0) == -1) tot--;
else if (map.getOrDefault(a, 0) == 0) tot++;
map.put(a, map.getOrDefault(a, 0) + 1);
if (map.getOrDefault(b, 0) == 1) tot--;
else if (map.getOrDefault(b, 0) == 0) tot++;
map.put(b, map.getOrDefault(b, 0) - 1);
if (tot == 0) ans++;
}
return ans;
}
}
TypeScript 代码：
function maxChunksToSorted(arr: number[]): number {
let clone = [...arr].sort((a,b)=>a-b)
let n = arr.length, ans = 0
const map = new Map<number, number>()
for (let i = 0, tot = 0; i < n; i++) {
const a = arr[i], b = clone[i]
if (!map.has(a)) map.set(a, 0)
if (map.get(a) == 0) tot++
else if (map.get(a) == -1) tot--;
map.set(a, map.get(a) + 1)
if (!map.has(b)) map.set(b, 0)
if (map.get(b) == 0) tot++
else if (map.get(b) == 1) tot--
map.set(b, map.get(b) - 1)
if (tot == 0) ans++
}
return ans
};
最后
这是我们「刷穿 LeetCode」系列文章的第 No.768 篇，系列开始于 2021/01/01，截止于起始日 LeetCode 上共有 1916 道题目，部分是有锁题，我们将先把所有不带锁的题目刷完。
在这个系列文章里面，除了讲解解题思路以外，还会尽可能给出最为简洁的代码。如果涉及通解还会相应的代码模板。
为了方便各位同学能够电脑上进行调试和提交代码，我建立了相关的仓库：github.com/SharingSour…
在仓库地址里，你可以看到系列文章的题解链接、系列文章的相应代码、LeetCode 原题链接和其他优选题解。
以上就是java LeetCode刷题稍有难度的贪心构造的详细内容，更多关于java LeetCode贪心构造的资料请关注脚本之家其它相关文章！
您可能感兴趣的文章:
阅读全文
|
{
"url": "https://m.jb51.net/article/274198.htm",
"source_domain": "m.jb51.net",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "16583",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TCO7TV7HEG35N7HGRIBARBXLZNKOI6X2",
"WARC-Concurrent-To": "<urn:uuid:69f502e5-b763-4d75-8e03-6df83b2ad29f>",
"WARC-Date": "2024-08-03T23:53:57Z",
"WARC-IP-Address": "45.194.34.252",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:IQX5UBOFXYNX5MM4OMKN5OFCC5TJPTKN",
"WARC-Record-ID": "<urn:uuid:d593c3b4-1557-4cd5-a77b-54bd33a15872>",
"WARC-Target-URI": "https://m.jb51.net/article/274198.htm",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d59fb93b-46b7-4167-959c-df966d97b8c6>"
},
"warc_info": "isPartOf: CC-MAIN-2024-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-90\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,
5,
6,
20,
21,
24,
61,
62,
89,
90,
103,
104,
183,
184,
189,
190,
231,
232,
243,
244,
321,
322,
401,
402,
417,
418,
424,
425,
447,
453,
457,
482,
538,
539,
545,
546,
568,
574,
578,
611,
651,
652,
656,
657,
696,
697,
737,
738,
746,
747,
787,
788,
964,
965,
974,
975,
992,
1038,
1073,
1101,
1138,
1191,
1238,
1280,
1333,
1390,
1442,
1494,
1551,
1603,
1636,
1646,
1666,
1672,
1674,
1675,
1690,
1691,
1743,
1785,
1817,
1859,
1902,
1941,
1980,
2015,
2057,
2092,
2131,
2166,
2206,
2241,
2269,
2275,
2290,
2293,
2294,
2297,
2298,
2401,
2402,
2455,
2456,
2513,
2514,
2568,
2569,
2642,
2643,
2654
],
"line_end_idx": [
5,
6,
20,
21,
24,
61,
62,
89,
90,
103,
104,
183,
184,
189,
190,
231,
232,
243,
244,
321,
322,
401,
402,
417,
418,
424,
425,
447,
453,
457,
482,
538,
539,
545,
546,
568,
574,
578,
611,
651,
652,
656,
657,
696,
697,
737,
738,
746,
747,
787,
788,
964,
965,
974,
975,
992,
1038,
1073,
1101,
1138,
1191,
1238,
1280,
1333,
1390,
1442,
1494,
1551,
1603,
1636,
1646,
1666,
1672,
1674,
1675,
1690,
1691,
1743,
1785,
1817,
1859,
1902,
1941,
1980,
2015,
2057,
2092,
2131,
2166,
2206,
2241,
2269,
2275,
2290,
2293,
2294,
2297,
2298,
2401,
2402,
2455,
2456,
2513,
2514,
2568,
2569,
2642,
2643,
2654,
2658
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2658,
"ccnet_original_nlines": 109,
"rps_doc_curly_bracket": 0.0037622300442308187,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.11725954711437225,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0013175200438126922,
"rps_doc_frac_lines_end_with_ellipsis": 0.009090909734368324,
"rps_doc_frac_no_alph_words": 0.7101449370384216,
"rps_doc_frac_unique_words": 0.5076923370361328,
"rps_doc_mean_word_length": 6.411538600921631,
"rps_doc_num_sentences": 39,
"rps_doc_symbol_to_word_ratio": 0.011857709847390652,
"rps_doc_unigram_entropy": 4.454878330230713,
"rps_doc_word_count": 260,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06358727812767029,
"rps_doc_frac_chars_dupe_6grams": 0.033593278378248215,
"rps_doc_frac_chars_dupe_7grams": 0.033593278378248215,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.014397120103240013,
"rps_doc_frac_chars_top_3gram": 0.021595679223537445,
"rps_doc_frac_chars_top_4gram": 0.004799040034413338,
"rps_doc_books_importance": -264.5377502441406,
"rps_doc_books_importance_length_correction": -264.5377502441406,
"rps_doc_openwebtext_importance": -122.26604461669922,
"rps_doc_openwebtext_importance_length_correction": -122.26604461669922,
"rps_doc_wikipedia_importance": -169.15936279296875,
"rps_doc_wikipedia_importance_length_correction": -169.15936279296875
},
"fasttext": {
"dclm": 0.9223160147666931,
"english": 0.013327489607036114,
"fineweb_edu_approx": 2.8614096641540527,
"eai_general_math": 0.8867869973182678,
"eai_open_web_math": 0.20600581169128418,
"eai_web_code": 0.6332991123199463
}
}
|
{
"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.3",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Arithmetic"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "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
|
9,026,087,171,652,148,000 |
Why this name?
nc -lp 4444
nc stands for the Netcat command, usually referred as the TCP/IP swiss army. While trying to create a session from a remote target, Netcat is used in the listening mode to double check if an outbound connection can actually exit. If it fails, even more elaborate tools as Meterpreter won't succeed.
Since I typed it so many times during my OSCP exam and in penetration tests, I decided to name my own blog in the same way.
|
{
"url": "http://www.nc-lp.com/why-this-name",
"source_domain": "www.nc-lp.com",
"snapshot_id": "crawl=CC-MAIN-2018-13",
"warc_metadata": {
"Content-Length": "10408",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RRAZR4IC4NEP5L5SCQFAB6RHTNZXMUUB",
"WARC-Concurrent-To": "<urn:uuid:c515e2b2-7967-41bc-89d1-c0748ba88b90>",
"WARC-Date": "2018-03-18T09:20:21Z",
"WARC-IP-Address": "89.46.105.78",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MFD2D26ODW5A62WPDF4XGCF27I7WCF3I",
"WARC-Record-ID": "<urn:uuid:58280b11-d20c-4205-ae3f-5f4662cc76b6>",
"WARC-Target-URI": "http://www.nc-lp.com/why-this-name",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6f889bb1-0ee9-4573-8459-5759ecd1b564>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-137-174-210.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-13\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for March 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
15,
16,
28,
29,
328,
329
],
"line_end_idx": [
15,
16,
28,
29,
328,
329,
452
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 452,
"ccnet_original_nlines": 6,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42268040776252747,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05154639109969139,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1340206265449524,
"rps_doc_frac_unique_words": 0.8072289228439331,
"rps_doc_mean_word_length": 4.277108192443848,
"rps_doc_num_sentences": 5,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.122292518615723,
"rps_doc_word_count": 83,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02816900983452797,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -42.67505645751953,
"rps_doc_books_importance_length_correction": -43.506439208984375,
"rps_doc_openwebtext_importance": -24.104888916015625,
"rps_doc_openwebtext_importance_length_correction": -24.93627166748047,
"rps_doc_wikipedia_importance": -19.432022094726562,
"rps_doc_wikipedia_importance_length_correction": -20.263402938842773
},
"fasttext": {
"dclm": 0.4580177068710327,
"english": 0.9491184949874878,
"fineweb_edu_approx": 2.1248669624328613,
"eai_general_math": 0.8925881385803223,
"eai_open_web_math": 0.15835994482040405,
"eai_web_code": 0.2588536739349365
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.82",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "9",
"label": "Personal/Misc"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "16",
"label": "Personal Blog"
},
"secondary": {
"code": "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
|
-3,989,595,850,353,492,500 |
Beefy Boxes and Bandwidth Generously Provided by pair Networks
good chemistry is complicated,
and a little bit messy -LW
PerlMonks
Re: Returning indices with same values for array within hash.
by johngg (Abbot)
on Nov 10, 2013 at 15:48 UTC ( #1061909=note: print w/ replies, xml ) Need Help??
in reply to Returning indices with same values for array within hash.
Not answering your query, but running min every time through the grep is likely to be wasteful if you are dealing with large arrays. It might be better to find the minimum once first.
$ perl -Mstrict -Mwarnings -MList::Util=min -E ' my @NI = ( 1, 1, 3, 4 ); my @NI_index = do { my $min = min @NI; grep { $NI[ $_ ] == $min } 0 .. $#NI; }; say qq{@NI_index};' 0 1 $
I hope this is of interest.
Cheers,
JohnGG
Comment on Re: Returning indices with same values for array within hash.
Select or Download Code
Log In?
Username:
Password:
What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1061909]
help
Chatterbox?
and the web crawler heard nothing...
How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (6)
As of 2014-12-25 15:47 GMT
Sections?
Information?
Find Nodes?
Leftovers?
Voting Booth?
Is guessing a good strategy for surviving in the IT business?
Results (160 votes), past polls
|
{
"url": "http://www.perlmonks.org/index.pl?node_id=1061909",
"source_domain": "www.perlmonks.org",
"snapshot_id": "crawl=CC-MAIN-2014-52",
"warc_metadata": {
"Content-Length": "17494",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7TT25LJJRPZ4R6VMKDJZDQRTNOPQSOBL",
"WARC-Concurrent-To": "<urn:uuid:4e38285c-c923-444a-9338-8c1c014f0cee>",
"WARC-Date": "2014-12-25T15:49:42Z",
"WARC-IP-Address": "66.39.54.27",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:OJGRI5DDBI3BKKPLRB7IKX2VYEHART3F",
"WARC-Record-ID": "<urn:uuid:ee2419cf-a8d2-435a-ad4d-ff1669606d28>",
"WARC-Target-URI": "http://www.perlmonks.org/index.pl?node_id=1061909",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5168cfb5-63ad-4922-9c00-85e52f30ec4d>"
},
"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,
63,
94,
121,
123,
135,
136,
198,
199,
217,
299,
300,
301,
371,
372,
556,
557,
737,
738,
766,
767,
775,
776,
783,
784,
785,
858,
882,
883,
891,
901,
911,
912,
932,
950,
963,
976,
1007,
1012,
1024,
1061,
1062,
1100,
1113,
1149,
1176,
1186,
1199,
1211,
1222,
1240,
1241,
1307,
1308,
1309,
1310,
1311,
1312
],
"line_end_idx": [
63,
94,
121,
123,
135,
136,
198,
199,
217,
299,
300,
301,
371,
372,
556,
557,
737,
738,
766,
767,
775,
776,
783,
784,
785,
858,
882,
883,
891,
901,
911,
912,
932,
950,
963,
976,
1007,
1012,
1024,
1061,
1062,
1100,
1113,
1149,
1176,
1186,
1199,
1211,
1222,
1240,
1241,
1307,
1308,
1309,
1310,
1311,
1312,
1347
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1347,
"ccnet_original_nlines": 57,
"rps_doc_curly_bracket": 0.004454339854419231,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.21904762089252472,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04126983880996704,
"rps_doc_frac_lines_end_with_ellipsis": 0.017241379246115685,
"rps_doc_frac_no_alph_words": 0.3523809611797333,
"rps_doc_frac_unique_words": 0.6962617039680481,
"rps_doc_mean_word_length": 4.537383079528809,
"rps_doc_num_sentences": 22,
"rps_doc_symbol_to_word_ratio": 0.009523809887468815,
"rps_doc_unigram_entropy": 4.8625593185424805,
"rps_doc_word_count": 214,
"rps_doc_frac_chars_dupe_10grams": 0.10298661142587662,
"rps_doc_frac_chars_dupe_5grams": 0.15242019295692444,
"rps_doc_frac_chars_dupe_6grams": 0.15242019295692444,
"rps_doc_frac_chars_dupe_7grams": 0.15242019295692444,
"rps_doc_frac_chars_dupe_8grams": 0.15242019295692444,
"rps_doc_frac_chars_dupe_9grams": 0.15242019295692444,
"rps_doc_frac_chars_top_2gram": 0.049433570355176926,
"rps_doc_frac_chars_top_3gram": 0.06179197132587433,
"rps_doc_frac_chars_top_4gram": 0.07415036112070084,
"rps_doc_books_importance": -136.6020050048828,
"rps_doc_books_importance_length_correction": -136.60198974609375,
"rps_doc_openwebtext_importance": -65.4808578491211,
"rps_doc_openwebtext_importance_length_correction": -65.4808578491211,
"rps_doc_wikipedia_importance": -55.501529693603516,
"rps_doc_wikipedia_importance_length_correction": -55.482791900634766
},
"fasttext": {
"dclm": 0.031555239111185074,
"english": 0.8300302028656006,
"fineweb_edu_approx": 1.2073873281478882,
"eai_general_math": 0.0014652600511908531,
"eai_open_web_math": 0.12115895748138428,
"eai_web_code": 0.0000019100000372418435
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1332",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.133",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "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,372,673,929,112,822,800 |
Define 2nf normal form, Database Management System
2NF Normal Form:
A relation schema process R is in 2NF if it is in 1NF and each non-prime attribute A in R is fully functionally related on primary key. Second normal form (2NF) is a normal process needed in database normalization. 2NF was originally described by E.F. Codd in 1971. A table that is in first normal form (1NF) must accept additional criteria if it is to accept for second normal form. A table is in 2NF if and only if, it is in 1NF and no non prime attribute is related on any proper subset of any candidate key of the table.
1801_2 NF Normal Form.png
Posted Date: 7/30/2012 2:11:33 AM | Location : United States
Related Discussions:- Define 2nf normal form, Assignment Help, Ask Question on Define 2nf normal form, Get Answer, Expert's Help, Define 2nf normal form Discussions
Write discussion on Define 2nf normal form
Your posts are moderated
Related Questions
Process of normalization is the integral part of designing a database. Justify this statement with suitable database design
Question: This form represents one of a number used for each sailing of a range of boats. A passenger may go on many sailings and will have the same passenger number for each.
Explain the conventions for displaying an ER schema as an ER diagram? An E-R Diagram scheme might describe certain constraints to that the contents of a database must conform.
Making Common Behaviour Abstract Let us define abstraction "Abstraction means to focus on the necessary, inherent aspects of an entity and ignoring its accidental features". O
What is the main advantage of the object model? What are its different components? The object model focuses on the logical data structures. Each object model comprises of many
read-set(T) : Each data items that are read by a transaction T Timestamps : for all transaction T, the start-time and the end time are reserved for all the three phases.
What is OLAP? OnLine Analytical Processing (OLAP) is a Business Intelligence (BI) reporting system. OLAP gives the user with the capability to sum, count, average and do other
properties of derirable decomposition
What are the ways in which the variable-length records arise in database systems? Storage of many record types in a file. Record types that permit variable lengths for one o
|
{
"url": "http://www.expertsmind.com/questions/define-2nf-normal-form-3018459.aspx",
"source_domain": "www.expertsmind.com",
"snapshot_id": "crawl=CC-MAIN-2018-22",
"warc_metadata": {
"Content-Length": "29824",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NVNGYZ5GBUD7BAC3SLGR53KBZZNG5P4F",
"WARC-Concurrent-To": "<urn:uuid:e119e250-cf17-4d58-8044-0ca197dbb370>",
"WARC-Date": "2018-05-27T23:35:03Z",
"WARC-IP-Address": "166.63.31.122",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:PVUJUGKEPFUFJN7O3MFHFBCCXNIZTSWQ",
"WARC-Record-ID": "<urn:uuid:4eb7c31d-f562-4ef3-b4a0-643c2e71b160>",
"WARC-Target-URI": "http://www.expertsmind.com/questions/define-2nf-normal-form-3018459.aspx",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:731ffc6f-9229-4b49-a055-bd24bfb13641>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-136-201-20.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-22\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for May 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
51,
52,
69,
70,
595,
596,
598,
599,
625,
626,
687,
688,
689,
690,
691,
692,
693,
694,
859,
860,
903,
928,
946,
1070,
1071,
1247,
1248,
1424,
1425,
1601,
1602,
1778,
1779,
1780,
1950,
1951,
2127,
2128,
2166,
2167
],
"line_end_idx": [
51,
52,
69,
70,
595,
596,
598,
599,
625,
626,
687,
688,
689,
690,
691,
692,
693,
694,
859,
860,
903,
928,
946,
1070,
1071,
1247,
1248,
1424,
1425,
1601,
1602,
1778,
1779,
1780,
1950,
1951,
2127,
2128,
2166,
2167,
2340
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2340,
"ccnet_original_nlines": 40,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3318871855735779,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06724511831998825,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1518438160419464,
"rps_doc_frac_unique_words": 0.5051813721656799,
"rps_doc_mean_word_length": 4.823834419250488,
"rps_doc_num_sentences": 23,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.84547758102417,
"rps_doc_word_count": 386,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.03759397938847542,
"rps_doc_frac_chars_dupe_6grams": 0.015037589706480503,
"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.04833512008190155,
"rps_doc_frac_chars_top_3gram": 0.04189043864607811,
"rps_doc_frac_chars_top_4gram": 0.051020409911870956,
"rps_doc_books_importance": -179.9515838623047,
"rps_doc_books_importance_length_correction": -179.9515838623047,
"rps_doc_openwebtext_importance": -118.72886657714844,
"rps_doc_openwebtext_importance_length_correction": -118.72886657714844,
"rps_doc_wikipedia_importance": -83.12830352783203,
"rps_doc_wikipedia_importance_length_correction": -83.12830352783203
},
"fasttext": {
"dclm": 0.03173518180847168,
"english": 0.897425651550293,
"fineweb_edu_approx": 2.7673981189727783,
"eai_general_math": 0.6260461211204529,
"eai_open_web_math": 0.2939522862434387,
"eai_web_code": 0.13485604524612427
}
}
|
{
"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.74",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"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": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
2,990,271,273,821,444,600 |
×
Namespaces
Variants
Actions
(Difference between revisions)
Archived:Full duplex with PCM16 codec produces echo on Nokia N95 with AD-54 headset (Known Issue)
From Nokia Developer Wiki
Jump to: navigation, search
hamishwillee (Talk | contribs)
m (Hamishwillee - Bot fixing redirect link.(Moving links from forum.nokia.com TO developer.nokia.com))
hamishwillee (Talk | contribs)
(7 intermediate revisions by 2 users not shown)
Line 1: Line 1:
[[Category:Symbian C++]]
+
{{Archived|timestamp=20120313123208|user=roy.debjit| }}
[[Category:Known Issue]]
+
[[Category:Symbian C++]][[Category:Known Issue]][[Category:S60 3rd Edition FP1]][[Category:Hardware]][[Category:Audio]]
[[Category:S60 3rd Edition, Feature Pack 1]]
+
{{ArticleMetaData <!-- v1.2 -->
[[Category:Hardware]]
+
|sourcecode= <!-- Link to example source code (e.g. [[Media:The Code Example ZIP.zip]]) -->
[[Category:Audio]]
+
|installfile= <!-- Link to installation file (e.g. [[Media:The Installation File.sis]]) -->
{{KBKI}}
+
|devices= Nokia N95, Nokia N95 8GB
__NOTOC__
+
|sdk= <!-- SDK(s) built and tested against (e.g. [http://linktosdkdownload/ Nokia Qt SDK 1.1]) -->
__NOEDITSECTION__
+
|platform= S60 3rd Edition, FP1
{{KnowledgeBase
+
|devicecompatability= <!-- Compatible devices (e.g.: All* (must have GPS) ) -->
|id=KIS001042
+
|dependencies= <!-- Any other/external dependencies e.g.: Google Maps Api v1.0 -->
|platform=S60 3rd Edition, FP1
+
|signing= <!-- Empty or one of Self-Signed, DevCert, Manufacturer -->
|devices=Nokia N95, Nokia N95 8GB
+
|capabilities= <!-- Capabilities required by the article/code example (e.g. Location, NetworkServices. -->
|category=Symbian C++
+
|keywords= <!-- APIs, classes and methods (e.g. QSystemScreenSaver, QList, CBase -->
|subcategory=Audio, Hardware
+
|language= <!-- Language category code for non-English topics - e.g. Lang-Chinese -->
|creationdate=June 19, 2008
+
|translated-by= <!-- [[User:XXXX]] -->
|keywords=
+
|translated-from-title= <!-- Title only -->
+
|translated-from-id= <!-- Id of translated revision -->
+
|review-by= <!-- After re-review: [[User:username]] -->
+
|review-timestamp= <!-- After re-review: YYYYMMDD -->
+
|update-by= <!-- After significant update: [[User:username]]-->
+
|update-timestamp= <!-- After significant update: YYYYMMDD -->
+
|creationdate= 20080619
+
|author= [[User:Technical writer 1]]
+
<!-- The following are not in current metadata -->
+
|id= KIS001042
}}
}}
+
==Description==
==Description==
Simultaneous audio playback and recording (full duplex) may result in echo and/or feedback loop when certain wired headsets are attached and audio is being streamed in uncompressed PCM16 format.
+
{{Abstract|Simultaneous audio playback and recording (full duplex) may result in echo and/or feedback loop when certain wired headsets are attached and audio is being streamed in uncompressed PCM16 format.}}
==How to reproduce==
==How to reproduce==
Line 24: Line 33:
With the following modifications, also support for PCM16 format can be added:
With the following modifications, also support for PCM16 format can be added:
+
<code cpp>
// Specify PCM16 fourCC as follows:
+
// Specify PCM16 fourCC as follows:
fourCC = TFourCC(' ', 'P', '1', '6');
+
fourCC = TFourCC(' ', 'P', '1', '6');
// Sample rate:
+
// Sample rate:
conf.iRate = EMMFSampleRate16000Hz;
+
conf.iRate = EMMFSampleRate16000Hz;
+
// Buffer size:
+
const TUint KBufferLength = 0x2000;
+
+
// Buffer size:
+
const TUint KBufferLength = 0x2000;
+
</code>
Running full-duplex audio with this configuration works fine on most devices, but
Running full-duplex audio with this configuration works fine on most devices, but
produces echo on the Nokia N95 when used with the AD-54 headset.
produces echo on the Nokia N95 when used with the AD-54 headset.
Latest revision as of 09:24, 21 June 2012
Archived.pngArchived: This article is archived because it is not considered relevant for third-party developers creating commercial solutions today. If you think this article is still relevant, let us know by adding the template {{ReviewForRemovalFromArchive|user=~~~~|write your reason here}}.
Article Metadata
Tested with
Devices(s): Nokia N95, Nokia N95 8GB
Compatibility
Platform(s): S60 3rd Edition, FP1
S60 3rd Edition FP1
Article
Created: User:Technical writer 1 (19 Jun 2008)
Last edited: hamishwillee (21 Jun 2012)
[edit] Description
Simultaneous audio playback and recording (full duplex) may result in echo and/or feedback loop when certain wired headsets are attached and audio is being streamed in uncompressed PCM16 format.
[edit] How to reproduce
The example application S60 Platform: Full-Duplex Audio Example supports four codecs: AMR, G.711, G.729, and iLBC.
With the following modifications, also support for PCM16 format can be added:
// Specify PCM16 fourCC as follows:
fourCC = TFourCC(' ', 'P', '1', '6');
// Sample rate:
conf.iRate = EMMFSampleRate16000Hz;
// Buffer size:
const TUint KBufferLength = 0x2000;
Running full-duplex audio with this configuration works fine on most devices, but produces echo on the Nokia N95 when used with the AD-54 headset.
[edit] Solution
No solution exists.
This page was last modified on 21 June 2012, at 09:24.
54 page views in the last 30 days.
|
{
"url": "http://developer.nokia.com/community/wiki/index.php?title=Archived:Full_duplex_with_PCM16_codec_produces_echo_on_Nokia_N95_with_AD-54_headset_(Known_Issue)&diff=157623&oldid=100256",
"source_domain": "developer.nokia.com",
"snapshot_id": "crawl=CC-MAIN-2014-15",
"warc_metadata": {
"Content-Length": "65433",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7IMD5TIM5GHM3CDP2C2IFFHLQFGAMNR3",
"WARC-Concurrent-To": "<urn:uuid:6daa2df7-af80-4e0c-a21b-93d1071a854d>",
"WARC-Date": "2014-04-21T00:31:03Z",
"WARC-IP-Address": "23.0.59.80",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:72BJWHYJ3K55XLOJNSJS2ZD7EVEVALKN",
"WARC-Record-ID": "<urn:uuid:59da14b3-1671-49f9-9ba8-77a2fcf1d937>",
"WARC-Target-URI": "http://developer.nokia.com/community/wiki/index.php?title=Archived:Full_duplex_with_PCM16_codec_produces_echo_on_Nokia_N95_with_AD-54_headset_(Known_Issue)&diff=157623&oldid=100256",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6b2bc74e-0738-4ec6-b469-b6c3cb2ee235>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-147-4-33.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-15\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for April 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
2,
13,
14,
23,
31,
62,
63,
161,
162,
188,
216,
247,
350,
381,
383,
431,
447,
472,
474,
530,
555,
557,
677,
722,
724,
756,
778,
780,
872,
891,
893,
985,
994,
996,
1031,
1041,
1043,
1142,
1160,
1162,
1194,
1210,
1212,
1292,
1306,
1308,
1391,
1422,
1424,
1494,
1528,
1530,
1637,
1659,
1661,
1746,
1775,
1777,
1863,
1891,
1893,
1932,
1943,
1945,
1989,
1992,
2048,
2051,
2107,
2110,
2164,
2167,
2231,
2234,
2297,
2300,
2324,
2327,
2364,
2367,
2418,
2421,
2436,
2438,
2441,
2443,
2446,
2448,
2450,
2452,
2454,
2470,
2472,
2488,
2683,
2685,
2893,
2896,
2898,
2919,
2921,
2942,
2960,
2963,
2965,
3043,
3045,
3123,
3125,
3127,
3138,
3174,
3176,
3212,
3250,
3252,
3290,
3292,
3296,
3298,
3302,
3318,
3320,
3336,
3372,
3374,
3410,
3412,
3414,
3430,
3432,
3468,
3470,
3473,
3476,
3492,
3495,
3531,
3534,
3542,
3544,
3626,
3628,
3710,
3712,
3777,
3779,
3844,
3845,
3887,
3888,
4183,
4184,
4201,
4213,
4250,
4264,
4298,
4318,
4326,
4373,
4413,
4414,
4433,
4434,
4629,
4630,
4654,
4655,
4770,
4771,
4849,
4850,
4886,
4924,
4926,
4942,
4978,
4980,
4996,
5032,
5033,
5180,
5181,
5197,
5198,
5218,
5219,
5274
],
"line_end_idx": [
2,
13,
14,
23,
31,
62,
63,
161,
162,
188,
216,
247,
350,
381,
383,
431,
447,
472,
474,
530,
555,
557,
677,
722,
724,
756,
778,
780,
872,
891,
893,
985,
994,
996,
1031,
1041,
1043,
1142,
1160,
1162,
1194,
1210,
1212,
1292,
1306,
1308,
1391,
1422,
1424,
1494,
1528,
1530,
1637,
1659,
1661,
1746,
1775,
1777,
1863,
1891,
1893,
1932,
1943,
1945,
1989,
1992,
2048,
2051,
2107,
2110,
2164,
2167,
2231,
2234,
2297,
2300,
2324,
2327,
2364,
2367,
2418,
2421,
2436,
2438,
2441,
2443,
2446,
2448,
2450,
2452,
2454,
2470,
2472,
2488,
2683,
2685,
2893,
2896,
2898,
2919,
2921,
2942,
2960,
2963,
2965,
3043,
3045,
3123,
3125,
3127,
3138,
3174,
3176,
3212,
3250,
3252,
3290,
3292,
3296,
3298,
3302,
3318,
3320,
3336,
3372,
3374,
3410,
3412,
3414,
3430,
3432,
3468,
3470,
3473,
3476,
3492,
3495,
3531,
3534,
3542,
3544,
3626,
3628,
3710,
3712,
3777,
3779,
3844,
3845,
3887,
3888,
4183,
4184,
4201,
4213,
4250,
4264,
4298,
4318,
4326,
4373,
4413,
4414,
4433,
4434,
4629,
4630,
4654,
4655,
4770,
4771,
4849,
4850,
4886,
4924,
4926,
4942,
4978,
4980,
4996,
5032,
5033,
5180,
5181,
5197,
5198,
5218,
5219,
5274,
5308
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5308,
"ccnet_original_nlines": 189,
"rps_doc_curly_bracket": 0.004521479830145836,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.1612349897623062,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0523156113922596,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.41166380047798157,
"rps_doc_frac_unique_words": 0.45440250635147095,
"rps_doc_mean_word_length": 6.0408806800842285,
"rps_doc_num_sentences": 64,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.369276523590088,
"rps_doc_word_count": 636,
"rps_doc_frac_chars_dupe_10grams": 0.2943779230117798,
"rps_doc_frac_chars_dupe_5grams": 0.3667360842227936,
"rps_doc_frac_chars_dupe_6grams": 0.34981781244277954,
"rps_doc_frac_chars_dupe_7grams": 0.33966684341430664,
"rps_doc_frac_chars_dupe_8grams": 0.33029672503471375,
"rps_doc_frac_chars_dupe_9grams": 0.2943779230117798,
"rps_doc_frac_chars_top_2gram": 0.01874024048447609,
"rps_doc_frac_chars_top_3gram": 0.014575740322470665,
"rps_doc_frac_chars_top_4gram": 0.010931810364127159,
"rps_doc_books_importance": -439.9850158691406,
"rps_doc_books_importance_length_correction": -439.9850158691406,
"rps_doc_openwebtext_importance": -263.2319641113281,
"rps_doc_openwebtext_importance_length_correction": -263.2319641113281,
"rps_doc_wikipedia_importance": -247.84011840820312,
"rps_doc_wikipedia_importance_length_correction": -247.84011840820312
},
"fasttext": {
"dclm": 0.0883902907371521,
"english": 0.7348898649215698,
"fineweb_edu_approx": 2.095325231552124,
"eai_general_math": 0.0016365100163966417,
"eai_open_web_math": 0.08351665735244751,
"eai_web_code": 0.0019975900650024414
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02854",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.392",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,426,865,865,799,347,000 |
Hot answers tagged
36
First of all, are you sure you really need that? Have you calculated the memory footprint? A small back-of-the-envelope calculation: A single mob and its state should fit into 100 byte of data. Let's give it a whole kByte, in case you are doing something extraordinary. When a cell has 1000 such entities, it requires a MByte. If your world is 100x100 cells, ...
17
From an API design perspective, when deciding whether to make multiple separate communicating programs or just one, the question is: can each program function meaningfully without the others? The answer will vary based on your project and preferences. If they can't, it's not worth thinking about. Clearly they're so heavily linked that they're not really ...
15
Independent of feasibility (yes, depending on scale) there are often better or easier ways. For instance, in your typical MMO, the server really only needs to know about the coarse navigation map used by AI and player pathfinding. Instead of storing the location of a tree, you can instead just cut a hole into the navmap at the location of the tree. Likewise ...
15
1000 player may or may not be a problem. It depends on how often you need to update the database. However there is a simple solution: put the database on its own server. I had a peek at how the database system works a game that people would call an MMO-Lite – which one I will not disclosure – yet I can tell it consistently has more than 1000 players, this ...
14
Attack vector 1: The netcode As already pointed out by Mario, one important factor when designing the network protocol of a client/server application is to not blindly trust the client. You can't control the software which runs on the client machine. You can't even tell that it's your software and not something the user programmed themself. The same ...
14
Web browsers disable some Javascript features for security reasons. My bet is that you just hit Google Chrome forbidding XMLHttpRequest on local files by default (see this answer on SO for how to disable that, but beware: this is dangerous). See this page on the Chrome dev site for details. This is why you have to setup a local HTTP server to workaround ...
14
One way you could solve this problem is not actually storing state on disk, but just setting up your generation code to use a seed for the random number generator, so it generates the same thing for a given area every time the area is generated, deterministically. Then you just keep the 1000 or so most recently visited areas in memory. When areas are ...
11
As others have said, the first step is separating logic that's shared from logic that's not. While it's great to draw that line wherever it's clear, your addendum illustrates that sometimes you don't have a clean line to split the code down. So, how do we solve cases where the client and server want to do semantically the same thing (play a sound), but take ...
11
is it worthwhile to have a separate process that listens for connections and messages from clients and sends the data via local sockets or stdin to another process that runs the actual game server? To answer whether it is worthwhile, you had to first ask yourself, what is the problem you are trying to solve by adding a dedicated queuing service. If it ...
10
After searching around, it seems that synchronizing the clocks of 2 or more computers is not a trivial task. A protocol like NTP does a good job but is supposedly slow and too complex to be practical in games. Also, it uses UDP which won't work for me because I'm working with web-sockets, which don't support UDP. I found a method here however, which seems ...
8
In my opinion there are a few types of mobile games. Single player / action / arcade puzzle - these doesn't really require a server side anyway and you can go a long way with openfeint or gamecenter to implement the social functions. Multiplayer / MMO / MMORPG - These require a strong backend with very quick response times and the BAAS solutions are really ...
8
After the user authenticated itself to the loginserver, give it a token (an unique, randomly-generated string too long to be guessed). The loginserver picks a gameserver. Send the token, the username and all other relevant data about the user from the loginserver to the server it picked. Send the token and the hostname of the gameserver to the client. Then ...
8
Whichever you do, it doesn't matter. If you rely on clientside calculation of anything you will get hacked. All the "anti-hacker" tooling has AFAIK been thoroughly penetrated, new versions often themselves being hacked in a matter of hours after release. Given that, browser games are a major PITA IMO (poor usability) though they do offer ease of installation....
8
Scrambling the transmitted score is probably worthwhile. To avoid cheat-engine type stuff, you can always scramble it in memory too. If you're storing seven variables, each of which, %10, is a digit, and you add a random number of 10s to each variable whenever a score changes, then it will be tricky to find a variable that matters. You could also get quite ...
8
One way to do this is not to change the actual values in the database in realtime. When the player logs on, you see how long it's been, and how much stuff he should have if he were earning during the time he was logged off, then update the value accordingly. One benefit of this is that if a player never logs on again, you're not spending server time and ...
7
Tribal Wars is a browser-based, massive multiplayer online real time strategy game, set in the Middle Ages. Now Tribal Wars is a browser based game and was released in 2003 as a text based game. Browser-based games usually rely on some kind of server-side code, such as Perl, PHP, Ruby, Python, or Java; though some will use technologies like Flash, ActiveX, ...
7
One library to use is ENet, which implements a generic network API suitable for many games. Or libevent even, which just handles the low-level network events. There is not a direct need for threads on most platforms, though Windows forces their use for large numbers of clients. Separate threads can be useful when you need a fixed response time or a ...
7
What about VPS servers? They can be pretty cheap and easily upgradeable because of their flexibility. VPS ( Virtual private server ) servers differ from real servers in the fact that they are actually just one of many virtual machines running on a real server, which makes it pretty customizable and flexible.
7
Do not copy the entire game model to the server, you wouldn't like to load all the textures and detailed meshes on your server. Keep it as simple as possible, handle all the important processes like the location, health, any movement but do not load everything. - NEVER TRUST THE CLIENT. There are many books, along with multiple wiki's. Every engine ...
7
Do the LOS and AOI (Area Of Interest) filtering on the server. Yes, any data you send the client can be hacked. OR extra programs can be inserted as a proxy between client and server to sniff excess data, like the old EverQuest viewer that lets players not only see far-away monsters but even what loot they would drop (which is a bit mind-boggling why that ...
7
Yes - it is feasible. MMOs often split the game world into multiple areas, as this makes the job easier, but you can still do it with 1 massive area - you just need to use a good spatial partitioning scheme. Because most objects in MMOs don't move, you can also perform a preprocessing pass where objects are used to create collision checking trees. Memory ...
7
System.Net.WebSockets seems to be completely built-in to .Net and freely available in Unity. Here's a full Websockets client for Unity for example: using System; using System.Text; using System.Threading; using System.Net.WebSockets; using UnityEngine; public class Comms: MonoBehaviour { Uri u = new Uri("ws://blah blah.us-west-1.compute.amazonaws....
7
Both approaches are used with MMORPGs. Keeping everything in memory and periodically check pointing it to disk seems to be the most popular option, at least for older games. It has the advantage of being fairly simple to implement and scaling fairly well, but making it reliable is completely up the to the developer. SQL databases provide ACID properties ...
6
OK, the obvious answers would be: Don't do drawing on the server. Just have the server tell the client what it needs to draw and let the client handle the actual drawing. Have the client keep track of the information it's previously received, so that the server only needs to send it a list of changes rather than sending everything again. Have the client ...
6
1) Would one embed the script itself in the entity object before persisting to it to the disk? Is this okay? You'll get cleaner diffs in your version control and encourage reusable scripts by providing the actual script out-of-line and having the entity merely store, say, a filename and script parameters. Storing the script in the entity itself is viable ...
6
There are many reasons I wouldn't suggest that: Computer resources are valuable. even if they are free, you shouldn't waste them. consider the case where two or more server are running simultaneously on one computer. If a single instance of server consumes all CPU cycles, other instances will simply fail. Surly OS will try to handle this kinda greedy ...
6
Can't be done. Haven't you ever been in a 10mx10m TF2 server where you'd just wait for drops? Neither have I! ;) You could implement some sanity-checks on your server, but then you'd have a central server. Can you afford a central server for such checks?
Only top voted, non community-wiki answers of a minimum length are eligible
|
{
"url": "https://gamedev.stackexchange.com/tags/server/hot?filter=all",
"source_domain": "gamedev.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "162741",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:MNVMFF3RMEND4FBQ7LYCR4ARDQJJDHOB",
"WARC-Concurrent-To": "<urn:uuid:f4e082e8-533c-4533-a9bf-ac2c08725d62>",
"WARC-Date": "2020-10-28T20:24:49Z",
"WARC-IP-Address": "151.101.193.69",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6MGD47IGPW4ANPBRQOU7VGQCLL2SYOQP",
"WARC-Record-ID": "<urn:uuid:40e0d313-1102-46b8-b56a-20ba21cabf04>",
"WARC-Target-URI": "https://gamedev.stackexchange.com/tags/server/hot?filter=all",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e7270670-81b1-4651-810f-0d1b28c041e7>"
},
"warc_info": "isPartOf: CC-MAIN-2020-45\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for October 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-128.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,
19,
20,
23,
24,
387,
388,
389,
392,
393,
753,
754,
755,
758,
759,
1123,
1124,
1125,
1128,
1129,
1491,
1492,
1493,
1496,
1497,
1853,
1854,
1855,
1858,
1859,
2219,
2220,
2221,
2224,
2225,
2582,
2583,
2584,
2587,
2588,
2952,
2953,
2954,
2957,
2958,
3316,
3317,
3318,
3321,
3322,
3684,
3685,
3686,
3688,
3689,
4052,
4053,
4054,
4056,
4057,
4420,
4421,
4422,
4424,
4425,
4790,
4791,
4792,
4794,
4795,
5158,
5159,
5160,
5162,
5163,
5523,
5524,
5525,
5527,
5528,
5891,
5892,
5893,
5895,
5896,
6251,
6252,
6253,
6255,
6256,
6566,
6567,
6568,
6570,
6571,
6926,
6927,
6928,
6930,
6931,
7293,
7294,
7295,
7297,
7298,
7659,
7660,
7661,
7663,
7664,
8017,
8018,
8019,
8021,
8022,
8382,
8383,
8384,
8386,
8387,
8747,
8748,
8749,
8751,
8752,
9113,
9114,
9115,
9117,
9118,
9475,
9476,
9477,
9479,
9480,
9735,
9736,
9737
],
"line_end_idx": [
19,
20,
23,
24,
387,
388,
389,
392,
393,
753,
754,
755,
758,
759,
1123,
1124,
1125,
1128,
1129,
1491,
1492,
1493,
1496,
1497,
1853,
1854,
1855,
1858,
1859,
2219,
2220,
2221,
2224,
2225,
2582,
2583,
2584,
2587,
2588,
2952,
2953,
2954,
2957,
2958,
3316,
3317,
3318,
3321,
3322,
3684,
3685,
3686,
3688,
3689,
4052,
4053,
4054,
4056,
4057,
4420,
4421,
4422,
4424,
4425,
4790,
4791,
4792,
4794,
4795,
5158,
5159,
5160,
5162,
5163,
5523,
5524,
5525,
5527,
5528,
5891,
5892,
5893,
5895,
5896,
6251,
6252,
6253,
6255,
6256,
6566,
6567,
6568,
6570,
6571,
6926,
6927,
6928,
6930,
6931,
7293,
7294,
7295,
7297,
7298,
7659,
7660,
7661,
7663,
7664,
8017,
8018,
8019,
8021,
8022,
8382,
8383,
8384,
8386,
8387,
8747,
8748,
8749,
8751,
8752,
9113,
9114,
9115,
9117,
9118,
9475,
9476,
9477,
9479,
9480,
9735,
9736,
9737,
9812
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9812,
"ccnet_original_nlines": 137,
"rps_doc_curly_bracket": 0.00010191999899689108,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.44011828303337097,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.020699849352240562,
"rps_doc_frac_lines_end_with_ellipsis": 0.18115942180156708,
"rps_doc_frac_no_alph_words": 0.16362740099430084,
"rps_doc_frac_unique_words": 0.41532015800476074,
"rps_doc_mean_word_length": 4.591861248016357,
"rps_doc_num_sentences": 115,
"rps_doc_symbol_to_word_ratio": 0.012321339920163155,
"rps_doc_unigram_entropy": 5.809189796447754,
"rps_doc_word_count": 1671,
"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.011729439720511436,
"rps_doc_frac_chars_top_3gram": 0.0018245800165459514,
"rps_doc_frac_chars_top_4gram": 0.003388510085642338,
"rps_doc_books_importance": -890.317626953125,
"rps_doc_books_importance_length_correction": -890.317626953125,
"rps_doc_openwebtext_importance": -495.37493896484375,
"rps_doc_openwebtext_importance_length_correction": -495.37493896484375,
"rps_doc_wikipedia_importance": -319.2773132324219,
"rps_doc_wikipedia_importance_length_correction": -319.2773132324219
},
"fasttext": {
"dclm": 0.5577152371406555,
"english": 0.9474512338638306,
"fineweb_edu_approx": 1.9859843254089355,
"eai_general_math": 0.915222704410553,
"eai_open_web_math": 0.2847958207130432,
"eai_web_code": 0.8800177574157715
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-7,521,685,084,793,690,000 |
Micr Font for Check
cbudoris
Active Member
Has anyone had issues with using the MICR font? We've got our BIP check in development, and no matter what I do, I can't seem to get the MICR to display correctly. Far as I know, MICR fonts don't come standard with Word, so we had to download the font (think I found the link here on another BIP thread).
The font looks fine in development when I first put it on the check, but when I upload it to the server, it just displays a bunch of blocks. And then after I've closed it on my local machine and re-open, its like it lost the variable and just displays a bunch of dots.
Anybody know what's going on, or another suggestion for getting around this?
Call Orchestrations From Excel – The Easy Way to Make the Orchestrator Work for You.
Krishna M
Member
There is a bug in MS Office which corrupted the field formatted with custom font. I had to do font substitution to get it to work.
Try this..
E1: XMLP: Field with Custom Font Shows Gibberish/Garbage Characters when Template is Reopened in Microsoft Word (Doc ID 1664146.1)
cbudoris
Active Member
If you've got a basic setup on your fat client, the folder for the xdo.cfg file is: C:\Program Files\Oracle\BI Publisher\BI Publisher Desktop\Template Builder for Word\config
There's an xdo example file there already, so you can use that one as your base and delete the 'example' out of the name.
The MICR font is in: C:\Program Files\Oracle\BI Publisher\BI Publisher Desktop\Template Builder for Word\fonts. Its the MICR____.TTF. No idea what those underscores are about, but you need to leave them in for references to the file.
Then in the font section of the XDO.CFG, you just need to reference that location. Here's the entire font section of the file:
<!-- Font setting -->
<fonts>
<font family="Micr MT" style="normal" weight="normal"
<truetype path="C:\Program Files\Oracle\BI Publisher\BI Publisher Desktop\Template Builder for Word\fonts\MICR____.TTF"/>
</font>
</fonts>
After you have all of this in, the MICR font should work in BIP desktop. You'll need something similar to this setup on your Enterprise servers as well. Be aware there could be multiple copies of the XDO.CFG, so search for all of them. Something about small kernals vs large kernals on the servers.
cbudoris
Active Member
Just one more little gotcha here, in the XDO.cfg the path to the MICR could be case sensitive. Our MICR wasn't working with our tools 9.2.3.2 upgrade. We had the word RESOURCE capitalized, but the actual path is lower case. Doens't make any sense, if you copy/paste the path into Windows Explorer it resolves with either, but maybe in the process that uses it, it matters.
incorrect:
<truetype path="D:\JDEdwards\E920\system\RESOURCE\truetype\MICR____.TTF" />
correct:
<truetype path="D:\JDEdwards\E920\system\resource\truetype\MICR____.TTF" />
Top
|
{
"url": "https://www.jdelist.com/community/threads/micr-font-for-check.48395/",
"source_domain": "www.jdelist.com",
"snapshot_id": "crawl=CC-MAIN-2021-17",
"warc_metadata": {
"Content-Length": "80362",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:JILGXWBESCX4GU4LKLV77UGMMYJMPUNF",
"WARC-Concurrent-To": "<urn:uuid:029bf0a9-87fd-4184-ac86-eeec7cf9b008>",
"WARC-Date": "2021-04-18T20:15:49Z",
"WARC-IP-Address": "104.21.38.130",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4QPY3WYFJ4X3TSW4P4JOM73CEZPQQDHW",
"WARC-Record-ID": "<urn:uuid:5634446f-3650-4386-b787-4742285cf705>",
"WARC-Target-URI": "https://www.jdelist.com/community/threads/micr-font-for-check.48395/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3e2aa12f-bdca-4d0d-931c-1c6fc52de510>"
},
"warc_info": "isPartOf: CC-MAIN-2021-17\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-253.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
20,
21,
30,
31,
45,
350,
351,
620,
621,
698,
700,
785,
786,
796,
797,
804,
935,
946,
1077,
1079,
1080,
1089,
1090,
1104,
1279,
1280,
1402,
1403,
1637,
1638,
1765,
1766,
1788,
1796,
1850,
1972,
1980,
1989,
1990,
1991,
2290,
2292,
2293,
2302,
2303,
2317,
2690,
2691,
2702,
2778,
2779,
2780,
2789,
2865,
2867
],
"line_end_idx": [
20,
21,
30,
31,
45,
350,
351,
620,
621,
698,
700,
785,
786,
796,
797,
804,
935,
946,
1077,
1079,
1080,
1089,
1090,
1104,
1279,
1280,
1402,
1403,
1637,
1638,
1765,
1766,
1788,
1796,
1850,
1972,
1980,
1989,
1990,
1991,
2290,
2292,
2293,
2302,
2303,
2317,
2690,
2691,
2702,
2778,
2779,
2780,
2789,
2865,
2867,
2870
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2870,
"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.3439878225326538,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07914763689041138,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.21917808055877686,
"rps_doc_frac_unique_words": 0.49890589714050293,
"rps_doc_mean_word_length": 4.827133655548096,
"rps_doc_num_sentences": 37,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.0062055587768555,
"rps_doc_word_count": 457,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.10426110774278641,
"rps_doc_frac_chars_dupe_6grams": 0.08612874150276184,
"rps_doc_frac_chars_dupe_7grams": 0.05983680859208107,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01586581952869892,
"rps_doc_frac_chars_top_3gram": 0.02719854936003685,
"rps_doc_frac_chars_top_4gram": 0.06527651846408844,
"rps_doc_books_importance": -248.3981170654297,
"rps_doc_books_importance_length_correction": -248.3981170654297,
"rps_doc_openwebtext_importance": -153.1990509033203,
"rps_doc_openwebtext_importance_length_correction": -153.1990509033203,
"rps_doc_wikipedia_importance": -126.95572662353516,
"rps_doc_wikipedia_importance_length_correction": -126.95572662353516
},
"fasttext": {
"dclm": 0.022111769765615463,
"english": 0.9013823866844177,
"fineweb_edu_approx": 1.2498503923416138,
"eai_general_math": 0.7777896523475647,
"eai_open_web_math": 0.6116631627082825,
"eai_web_code": 0.3104855418205261
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.462",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "658.40285",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
4,849,081,075,914,229,000 |
Data Standards and Your Bottom Line
Study after study has made it clear that data standards can have a huge impact on a company’s bottom line.
Companies with strong data standards (and systems to manage these standards across different teams and technologies) have a significant advantage over their competitors.
How? Here are a few examples that show how being proactive around your data can be a boon for your business.
1. Improved Data Quality
According to a study by Experian, 92% of organizations believe that their data is inaccurate in some way. Implementing data standards will improve data quality by reducing errors, inconsistencies, and duplicates.
If your results are more trustworthy, you’ll have better decision-making, improved customer targeting, and more efficient operations.
2. Enhanced Customer Insights
Having data standards means you can consolidate data from lots of sources and create a unified customer view. Tying this data together lets you segment customers, meaning you can create more personalized marketing campaigns and improved customer experiences.
According to a report by McKinsey, companies that effectively use customer analytics are more likely to generate above-average profits.
3. Increased Marketing Effectiveness
Standardized data lets you accurately measure marketing performance and ROI. With consistent metrics, you can identify which marketing efforts are generating the best results and allocate resources more effectively.
According to a study by the Aberdeen Group, companies with strong data management practices achieved a 27% higher profit margin than their competitors.
4. Cost Savings
Implementing data standards reduces the time and effort required for data cleaning, integration, and analysis.
If the data is compliant with your taxonomy at the top, you won’t have to spend resources correcting data after a campaign. This saves tons of money on labor costs, and means you can reallocate your resources to higher-value activities.
According to a study by Gartner, poor data quality can result in significant costs, ranging from 10% to 25% of operating revenue.
5. Regulatory Compliance and Risk Mitigation
Data standards are crucial to ensuring compliance with data protection regulations. They also mitigate the risk of data breaches.
Failure to comply with regulations can lead to hefty fines, legal consequences, and damage to your reputation. Implementing data standards helps protect sensitive customer information and safeguards the company from potential legal risks.
Important note: the impact of data standards on a company’s bottom line can vary depending on the industry, size of the organization, and the specific data challenges they face. We recommend conducting a thorough assessment of your own organization to determine the potential financial impact.
To gather specific data and industry reports related to your company’s sector or region, we suggest:
• Consulting reputable market research firms or industry associations
• Conducting targeted searches on scholarly databases (such as Google Scholar or JSTOR) to access relevant studies and data-backed insights.
As always, if you’re ready to take the first step towards better data standards, you can find us here.
Get Started
Find out why hundreds of customers use Claravine
Back to Top
|
{
"url": "https://www.claravine.com/data-standards-and-your-bottom-line/",
"source_domain": "www.claravine.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "68535",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PX7EJ7JJLVO67Q6BN2QDUFUO2FBE7LZO",
"WARC-Concurrent-To": "<urn:uuid:a9bb3695-8320-45fc-9c6e-b0c2638cf5f2>",
"WARC-Date": "2024-02-26T03:39:48Z",
"WARC-IP-Address": "104.196.40.64",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7B4YIQQW73PCBGZN2FCZND6V5TMLBZH6",
"WARC-Record-ID": "<urn:uuid:d293f489-3c9b-4575-8ec8-f313160888ef>",
"WARC-Target-URI": "https://www.claravine.com/data-standards-and-your-bottom-line/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c40bfae1-3d5a-4c89-bde7-acbf7e0a3878>"
},
"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-183\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,
36,
37,
144,
145,
315,
316,
425,
426,
451,
452,
665,
666,
800,
801,
831,
832,
1091,
1092,
1228,
1229,
1266,
1267,
1483,
1484,
1636,
1637,
1653,
1654,
1765,
1766,
2003,
2004,
2134,
2135,
2180,
2181,
2311,
2312,
2551,
2552,
2553,
2847,
2848,
2949,
2950,
3022,
3165,
3166,
3269,
3270,
3282,
3283,
3332,
3333
],
"line_end_idx": [
36,
37,
144,
145,
315,
316,
425,
426,
451,
452,
665,
666,
800,
801,
831,
832,
1091,
1092,
1228,
1229,
1266,
1267,
1483,
1484,
1636,
1637,
1653,
1654,
1765,
1766,
2003,
2004,
2134,
2135,
2180,
2181,
2311,
2312,
2551,
2552,
2553,
2847,
2848,
2949,
2950,
3022,
3165,
3166,
3269,
3270,
3282,
3283,
3332,
3333,
3344
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3344,
"ccnet_original_nlines": 54,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34192439913749695,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0034364298917353153,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14432990550994873,
"rps_doc_frac_unique_words": 0.5370741486549377,
"rps_doc_mean_word_length": 5.50701379776001,
"rps_doc_num_sentences": 31,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.11890983581543,
"rps_doc_word_count": 499,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.036754000931978226,
"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.047307129949331284,
"rps_doc_frac_chars_top_3gram": 0.017467249184846878,
"rps_doc_frac_chars_top_4gram": 0.01855894923210144,
"rps_doc_books_importance": -291.7503356933594,
"rps_doc_books_importance_length_correction": -291.7503356933594,
"rps_doc_openwebtext_importance": -172.93832397460938,
"rps_doc_openwebtext_importance_length_correction": -172.93832397460938,
"rps_doc_wikipedia_importance": -136.56967163085938,
"rps_doc_wikipedia_importance_length_correction": -136.56967163085938
},
"fasttext": {
"dclm": 0.48975616693496704,
"english": 0.9290308952331543,
"fineweb_edu_approx": 2.0018038749694824,
"eai_general_math": 0.018947599455714226,
"eai_open_web_math": 0.11408209800720215,
"eai_web_code": 0.018182870000600815
}
}
|
{
"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": "658.403",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Business",
"level_3": "Management"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "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": "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
|
3,788,003,999,353,933,300 |
FUNCTION value_range_wr2
(* SCHEMA Ap210_electronic_assembly_interconnect_and_packaging_design_mim_lf; *)
FUNCTION value_range_wr2
(agg: compound_item_definition) : BOOLEAN;
BEGIN
IF ((SIZEOF(QUERY (i <* agg | (i\representation_item.name = 'upper limit'))) = 1)
AND (SIZEOF(QUERY (i <* agg | (i\representation_item.name = 'lower limit'))) = 1))
THEN
RETURN(TRUE);
ELSE
RETURN(FALSE);
END_IF;
END;
END_FUNCTION;
Referenced By
Defintion value_range_wr2 is references by the following definitions:
DefinitionType
value_range ENTITY
[Top Level Definitions] [Exit]
Generated by STEP Tools® EXPRESS to HTML Converter
2012-03-27T17:15:33-04:00
|
{
"url": "http://www.steptools.com/support/stdev_docs/express/ap210/html/t_value-05.html",
"source_domain": "www.steptools.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "3303",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FQOTF33ZETKAOIAUF3FFV7NLCMBJZ7LO",
"WARC-Concurrent-To": "<urn:uuid:e772f997-4cdc-4a01-b74e-e9e0d81b53c8>",
"WARC-Date": "2013-12-09T07:55:32Z",
"WARC-IP-Address": "199.249.159.1",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:4PREGFDKGMSGDDNJQXWKLKJ27644JNLH",
"WARC-Record-ID": "<urn:uuid:9b141c00-f912-4e09-953b-3a752cbf0748>",
"WARC-Target-URI": "http://www.steptools.com/support/stdev_docs/express/ap210/html/t_value-05.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9ce1cbc7-cc64-47ff-9e3b-a4f114fea2fc>"
},
"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,
25,
26,
107,
132,
176,
182,
270,
361,
372,
394,
405,
428,
442,
451,
465,
466,
480,
481,
551,
566,
586,
587,
588,
619,
620,
671
],
"line_end_idx": [
25,
26,
107,
132,
176,
182,
270,
361,
372,
394,
405,
428,
442,
451,
465,
466,
480,
481,
551,
566,
586,
587,
588,
619,
620,
671,
696
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 696,
"ccnet_original_nlines": 26,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.095238097012043,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.1984127014875412,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4841269850730896,
"rps_doc_frac_unique_words": 0.7796609997749329,
"rps_doc_mean_word_length": 8.13559341430664,
"rps_doc_num_sentences": 3,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.7454769611358643,
"rps_doc_word_count": 59,
"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.08749999850988388,
"rps_doc_frac_chars_top_3gram": 0.0625,
"rps_doc_frac_chars_top_4gram": 0.15833333134651184,
"rps_doc_books_importance": -45.80119323730469,
"rps_doc_books_importance_length_correction": -48.181724548339844,
"rps_doc_openwebtext_importance": -30.195743560791016,
"rps_doc_openwebtext_importance_length_correction": -32.57627487182617,
"rps_doc_wikipedia_importance": -6.106039524078369,
"rps_doc_wikipedia_importance_length_correction": -8.486572265625
},
"fasttext": {
"dclm": 0.9790312051773071,
"english": 0.42452284693717957,
"fineweb_edu_approx": 3.198486089706421,
"eai_general_math": 0.8736492395401001,
"eai_open_web_math": 0.6257603168487549,
"eai_web_code": 0.666509211063385
}
}
|
{
"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": "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": "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
|
-4,800,145,288,469,078,000 |
persp.im
0th
Percentile
Perspective Plot of Pixel Image
Displays a perspective plot of a pixel image.
Keywords
hplot, spatial
Usage
# S3 method for im
persp(x, …,
colmap=NULL, colin=x, apron=FALSE, visible=FALSE)
Arguments
x
The pixel image to be plotted as a surface. An object of class "im" (see im.object).
Extra arguments passed to persp.default to control the display.
colmap
Optional data controlling the colour map. See Details.
colin
Optional. Colour input. Another pixel image (of the same dimensions as x) containing the values that will be mapped to colours.
apron
Logical. If TRUE, a grey apron is placed around the sides of the perspective plot.
visible
Logical value indicating whether to compute which pixels of x are visible in the perspective view. See Details.
Details
This is the persp method for the class "im".
The pixel image x must have real or integer values. These values are treated as heights of a surface, and the surface is displayed as a perspective plot on the current plot device, using equal scales on the x and y axes.
The optional argument colmap gives an easy way to display different altitudes in different colours (if this is what you want).
• If colmap is a colour map (object of class "colourmap", created by the function colourmap) then this colour map will be used to associate altitudes with colours.
• If colmap is a character vector, then the range of altitudes in the perspective plot will be divided into length(colmap) intervals, and those parts of the surface which lie in a particular altitude range will be assigned the corresponding colour from colmap.
• If colmap is a function in the R language of the form function(n, ...), this function will be called with an appropriate value of n to generate a character vector of n colours. Examples of such functions are heat.colors, terrain.colors, topo.colors and cm.colors.
• If colmap is a function in the R language of the form function(range, ...) then it will be called with range equal to the range of altitudes, to determine the colour values or colour map. Examples of such functions are beachcolours and beachcolourmap.
• If colmap is a list with entries breaks and col, then colmap$breaks determines the breakpoints of the altitude intervals, and colmap$col provides the corresponding colours.
Alternatively, if the argument colin (colour input) is present, then the colour map colmap will be applied to the pixel values of colin instead of the pixel values of x. The result is a perspective view of a surface with heights determined by x and colours determined by colin (mapped by colmap).
If apron=TRUE, vertical surface is drawn around the boundary of the perspective plot, so that the terrain appears to have been cut out of a solid material. If colour data were supplied, then the apron is coloured light grey.
Graphical parameters controlling the perspective plot are passed through the ... arguments directly to the function persp.default. See the examples in persp.default or in demo(persp).
The vertical scale is controlled by the argument expand: setting expand=1 will interpret the pixel values as being in the same units as the spatial coordinates \(x\) and \(y\) and represent them at the same scale.
If visible=TRUE, the algorithm also computes whether each pixel in x is visible in the perspective view. In order to be visible, a pixel must not be obscured by another pixel which lies in front of it (as seen from the viewing direction), and the three-dimensional vector normal to the surface must be pointing toward the viewer. The return value of persp.im then has an attribute "visible" which is a pixel image, compatible with x, with pixel value equal to TRUE if the corresponding pixel in x is visible, and FALSE if it is not visible.
Value
(invisibly) the 3D transformation matrix returned by persp.default, together with an attribute "expand" which gives the relative scale of the \(z\) coordinate.
If argument visible=TRUE was given, the return value also has an attribute "visible" which is a pixel image, compatible with x, with logical values which are TRUE when the corresponding pixel is visible in the perspective view, and FALSE when it is obscured.
See Also
perspPoints, perspLines for drawing additional points or lines on the surface.
trans3d for mapping arbitrary \((x,y,z)\) coordinate locations to the plotting coordinates.
im.object, plot.im, contour.im
Aliases
• persp.im
Examples
# NOT RUN {
# an image
Z <- setcov(owin())
persp(Z, colmap=terrain.colors(128))
co <- colourmap(range=c(0,1), col=rainbow(128))
persp(Z, colmap=co, axes=FALSE, shade=0.3)
## Terrain elevation
persp(bei.extra$elev, colmap=terrain.colors(128),
apron=TRUE, theta=-30, phi=20,
zlab="Elevation", main="", ticktype="detailed",
expand=6)
# }
Documentation reproduced from package spatstat, version 1.61-0, License: GPL (>= 2)
Community examples
Looks like there are no examples yet.
|
{
"url": "https://www.rdocumentation.org/packages/spatstat/versions/1.61-0/topics/persp.im",
"source_domain": "www.rdocumentation.org",
"snapshot_id": "crawl=CC-MAIN-2019-51",
"warc_metadata": {
"Content-Length": "21911",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TBXMLWAWRDS6TDSXKABTQGANMITSB4SO",
"WARC-Concurrent-To": "<urn:uuid:a2a9acc9-31ff-4b95-953b-0735f74cadf2>",
"WARC-Date": "2019-12-10T21:52:03Z",
"WARC-IP-Address": "34.238.223.233",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:DPMPDYJQP3YIEQMAODTYV4AODUARP7TP",
"WARC-Record-ID": "<urn:uuid:ad213090-b324-41be-b961-5c3e44d67e89>",
"WARC-Target-URI": "https://www.rdocumentation.org/packages/spatstat/versions/1.61-0/topics/persp.im",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f754e2bf-d2ab-4d52-871d-52190e3980a8>"
},
"warc_info": "isPartOf: CC-MAIN-2019-51\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for December 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-206.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,
9,
10,
14,
15,
26,
27,
59,
60,
106,
107,
116,
131,
137,
156,
168,
239,
249,
251,
252,
337,
338,
402,
403,
410,
411,
466,
467,
473,
474,
602,
603,
609,
610,
693,
694,
702,
703,
815,
816,
824,
825,
870,
871,
1092,
1093,
1220,
1221,
1387,
1388,
1651,
1652,
1920,
1921,
2177,
2178,
2355,
2356,
2653,
2654,
2879,
2880,
3064,
3065,
3279,
3280,
3821,
3822,
3828,
3829,
3989,
3990,
4249,
4250,
4259,
4260,
4339,
4340,
4432,
4433,
4464,
4465,
4473,
4486,
4495,
4507,
4521,
4544,
4584,
4635,
4681,
4682,
4706,
4759,
4799,
4856,
4875,
4879,
4963,
4964,
4983,
4984
],
"line_end_idx": [
9,
10,
14,
15,
26,
27,
59,
60,
106,
107,
116,
131,
137,
156,
168,
239,
249,
251,
252,
337,
338,
402,
403,
410,
411,
466,
467,
473,
474,
602,
603,
609,
610,
693,
694,
702,
703,
815,
816,
824,
825,
870,
871,
1092,
1093,
1220,
1221,
1387,
1388,
1651,
1652,
1920,
1921,
2177,
2178,
2355,
2356,
2653,
2654,
2879,
2880,
3064,
3065,
3279,
3280,
3821,
3822,
3828,
3829,
3989,
3990,
4249,
4250,
4259,
4260,
4339,
4340,
4432,
4433,
4464,
4465,
4473,
4486,
4495,
4507,
4521,
4544,
4584,
4635,
4681,
4682,
4706,
4759,
4799,
4856,
4875,
4879,
4963,
4964,
4983,
4984,
5021
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5021,
"ccnet_original_nlines": 101,
"rps_doc_curly_bracket": 0.0003983300121035427,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.348747581243515,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022158000618219376,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22061656415462494,
"rps_doc_frac_unique_words": 0.3684895932674408,
"rps_doc_mean_word_length": 5.03515625,
"rps_doc_num_sentences": 62,
"rps_doc_symbol_to_word_ratio": 0.009633909910917282,
"rps_doc_unigram_entropy": 4.987399101257324,
"rps_doc_word_count": 768,
"rps_doc_frac_chars_dupe_10grams": 0.052236881107091904,
"rps_doc_frac_chars_dupe_5grams": 0.10343936085700989,
"rps_doc_frac_chars_dupe_6grams": 0.06723558157682419,
"rps_doc_frac_chars_dupe_7grams": 0.052236881107091904,
"rps_doc_frac_chars_dupe_8grams": 0.052236881107091904,
"rps_doc_frac_chars_dupe_9grams": 0.052236881107091904,
"rps_doc_frac_chars_top_2gram": 0.011636929586529732,
"rps_doc_frac_chars_top_3gram": 0.011636929586529732,
"rps_doc_frac_chars_top_4gram": 0.014222909696400166,
"rps_doc_books_importance": -361.4957580566406,
"rps_doc_books_importance_length_correction": -361.4957580566406,
"rps_doc_openwebtext_importance": -241.4026641845703,
"rps_doc_openwebtext_importance_length_correction": -241.4026641845703,
"rps_doc_wikipedia_importance": -232.5391387939453,
"rps_doc_wikipedia_importance_length_correction": -232.5391387939453
},
"fasttext": {
"dclm": 0.1043967604637146,
"english": 0.7849904894828796,
"fineweb_edu_approx": 2.933502197265625,
"eai_general_math": 0.9881699085235596,
"eai_open_web_math": 0.367084264755249,
"eai_web_code": 0.986621618270874
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "516",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "5",
"label": "Exceptionally Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
6,815,289,552,141,764,000 |
JavaScript Math.max()
The Math.max() function returns the largest of zero or more numbers.
Syntax
Math.max(value1, value2, ...)
Parameters
value1, value2 and other arguments should be numbers. All arguments are optional.
If no arguments are given, the result is Infinity. If at least one of arguments cannot be converted to a number, the result is NaN.
MDN link | MSDN link
Examples
Math.max(); // Infinity
Math.max('a'); // NaN
Math.max(NaN); // NaN
Math.max(5); // 5
Math.max(10, 20); // 20
Math.max(-10, -20); // -10
Math.max(-10, 20); // 20
var x = Math.max(107 - 3, 48 * 90);
document.write(x);
// Output:
// 4320
|
{
"url": "https://freecodecamp.github.io/wiki/en/js-math-max/",
"source_domain": "freecodecamp.github.io",
"snapshot_id": "crawl=CC-MAIN-2019-43",
"warc_metadata": {
"Content-Length": "113395",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4FO3CD25FQZVLP5KRZ7KI23OYW2GA3OV",
"WARC-Concurrent-To": "<urn:uuid:3f33fdc1-1336-4bb9-8cff-913fa0412da1>",
"WARC-Date": "2019-10-22T19:55:15Z",
"WARC-IP-Address": "185.199.108.153",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UMF3HN2A6HREMI4UNT5PVYLRRY5IEGEN",
"WARC-Record-ID": "<urn:uuid:3aa10f1b-f40c-406d-bf6d-cc65b7f6812f>",
"WARC-Target-URI": "https://freecodecamp.github.io/wiki/en/js-math-max/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b44c5d90-4947-470e-8b2a-eb8b5c74f940>"
},
"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-173.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
22,
23,
92,
93,
100,
101,
131,
132,
143,
144,
226,
227,
359,
360,
381,
382,
391,
392,
424,
451,
478,
503,
530,
557,
584,
621,
640,
641,
652
],
"line_end_idx": [
22,
23,
92,
93,
100,
101,
131,
132,
143,
144,
226,
227,
359,
360,
381,
382,
391,
392,
424,
451,
478,
503,
530,
557,
584,
621,
640,
641,
652,
659
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 659,
"ccnet_original_nlines": 29,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.16568046808242798,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.011834319680929184,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4674556255340576,
"rps_doc_frac_unique_words": 0.6941176652908325,
"rps_doc_mean_word_length": 5.047058582305908,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0.005917159840464592,
"rps_doc_unigram_entropy": 3.93808650970459,
"rps_doc_word_count": 85,
"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.07692307978868484,
"rps_doc_frac_chars_top_3gram": 0.05128204822540283,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -54.76070022583008,
"rps_doc_books_importance_length_correction": -63.143798828125,
"rps_doc_openwebtext_importance": -30.873645782470703,
"rps_doc_openwebtext_importance_length_correction": -39.25674819946289,
"rps_doc_wikipedia_importance": -23.121055603027344,
"rps_doc_wikipedia_importance_length_correction": -31.5041561126709
},
"fasttext": {
"dclm": 0.10236536711454391,
"english": 0.10543400794267654,
"fineweb_edu_approx": 2.4573354721069336,
"eai_general_math": 0.8834980726242065,
"eai_open_web_math": 0.05690068006515503,
"eai_web_code": 0.9980950355529785
}
}
|
{
"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": "-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": "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": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
8,962,860,785,005,258,000 |
Tagged Questions
The tag has no wiki summary.
learn more… | top users | synonyms
0
votes
0answers
19 views
Can You Require the Use of JavaScript in a WordPress Plugin?
I commonly use Mozilla Firefox for testing changes I make for a plugin that I'm developing. I also have the NoScript addon installed because it is also my main browser. I noticed that the ...
0
votes
2answers
351 views
Add credit to get_custom_header in alt
Been hunting for a while and I can't figure out how to use get_custom_header to get the alt text associated with the media file, so that I can add photo credits to the headers on my site. Am I missing ...
3
votes
3answers
392 views
Stylesheet switching and caching
I'm implementing a site that allows users to switch stylesheets (to show a high contrast version for people with vision impairments). The switcher essentially just changes the <link>ref to ...
2
votes
1answer
279 views
Accesibility problems with dropdown menus in twentyten theme or others
Some time ago I discovered that dropdown menus that do have clickable links on parent nodes are confusing for the users. Often they are not seeing that they can click on the parent, they just assume ...
3
votes
1answer
677 views
How to make WordPress blog accessible for people with disabilities?
How do you make your wordpress blog accessible for people with disabilities ? are there any special plugins you are using ? are there any friendly themes you recommend ? is there an auto-detect ...
1
vote
3answers
8k views
How can I make a site viewable in multiple languages?
I am aware of the question What are options are there to implement a multi language site, but the answers there are focused on multi-language support on the backend as well as the frontend. I am only ...
|
{
"url": "http://wordpress.stackexchange.com/questions/tagged/accessibility?sort=unanswered&pagesize=15",
"source_domain": "wordpress.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2014-49",
"warc_metadata": {
"Content-Length": "59650",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HOPLE35HLZ3DZZ7PA6QOZUOFBAOLI2KI",
"WARC-Concurrent-To": "<urn:uuid:daac758a-dc2c-4a78-8572-aff71310c192>",
"WARC-Date": "2014-11-23T03:45:55Z",
"WARC-IP-Address": "198.252.206.16",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:DUJVXZLKYTXJ7BLZQDUCQOGKZLSRA6TZ",
"WARC-Record-ID": "<urn:uuid:ec4c767e-ca2b-4fec-9649-c17a098a33ba>",
"WARC-Target-URI": "http://wordpress.stackexchange.com/questions/tagged/accessibility?sort=unanswered&pagesize=15",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c0180f9d-bdc1-4774-9238-d3f73e991423>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-235-23-156.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-49\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for November 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
17,
18,
47,
48,
83,
84,
86,
92,
101,
110,
111,
172,
173,
365,
367,
373,
382,
392,
393,
432,
433,
638,
640,
646,
655,
665,
666,
699,
700,
893,
895,
901,
909,
919,
920,
991,
992,
1195,
1197,
1203,
1211,
1221,
1222,
1290,
1291,
1489,
1491,
1496,
1505,
1514,
1515,
1569,
1570
],
"line_end_idx": [
17,
18,
47,
48,
83,
84,
86,
92,
101,
110,
111,
172,
173,
365,
367,
373,
382,
392,
393,
432,
433,
638,
640,
646,
655,
665,
666,
699,
700,
893,
895,
901,
909,
919,
920,
991,
992,
1195,
1197,
1203,
1211,
1221,
1222,
1290,
1291,
1489,
1491,
1496,
1505,
1514,
1515,
1569,
1570,
1773
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1773,
"ccnet_original_nlines": 53,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.385294109582901,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.038235291838645935,
"rps_doc_frac_lines_end_with_ellipsis": 0.1111111119389534,
"rps_doc_frac_no_alph_words": 0.1294117569923401,
"rps_doc_frac_unique_words": 0.554817259311676,
"rps_doc_mean_word_length": 4.6445183753967285,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0.020588239654898643,
"rps_doc_unigram_entropy": 4.789165496826172,
"rps_doc_word_count": 301,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06866952776908875,
"rps_doc_frac_chars_dupe_6grams": 0.06866952776908875,
"rps_doc_frac_chars_dupe_7grams": 0.06866952776908875,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.019313300028443336,
"rps_doc_frac_chars_top_3gram": 0.027897000312805176,
"rps_doc_frac_chars_top_4gram": 0.03719599172472954,
"rps_doc_books_importance": -131.2220916748047,
"rps_doc_books_importance_length_correction": -124.04013061523438,
"rps_doc_openwebtext_importance": -82.53302764892578,
"rps_doc_openwebtext_importance_length_correction": -82.53302764892578,
"rps_doc_wikipedia_importance": -67.18011474609375,
"rps_doc_wikipedia_importance_length_correction": -64.84105682373047
},
"fasttext": {
"dclm": 0.1235780119895935,
"english": 0.9110873937606812,
"fineweb_edu_approx": 1.2211304903030396,
"eai_general_math": 0.0028923701029270887,
"eai_open_web_math": 0.08350861072540283,
"eai_web_code": 0.00010895999730564654
}
}
|
{
"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": "616.858",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Pathology and Diseases"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
987,826,815,486,065,200 |
Take My Oval (Projective Plane) Lab Checklist
Take My Oval (Projective Plane) Lab
Do My Oval (Projective Plane) Lab
As discussed above, I utilized to write an easy and also simple math lab with only Oval (Projective Plane) However, the easier you make your lab, the easier it becomes to obtain stuck at the end of it, then at the start. This can be extremely frustrating, and all this can take place to you since you are utilizing Oval (Projective Plane) and/or Modular Equations improperly.
With Modular Formulas, you are currently utilizing the wrong formula when you get stuck at the start, otherwise, after that you are most likely in a stumbling block, and also there is no possible way out. This will just worsen as the problem comes to be much more complex, but then there is the question of exactly how to proceed with the issue. There is no chance to appropriately tackle solving this sort of mathematics problem without being able to immediately see what is taking place.
It is clear that Oval (Projective Plane) and Modular Formulas are hard to discover, and it does take practice to develop your very own feeling of instinct. Yet when you intend to fix a math problem, you need to utilize a device, as well as the tools for learning are utilized when you are stuck, and they are not made use of when you make the wrong action. This is where lab Help Service can be found in.
For example, what is wrong with the concern is incorrect ideas, such as obtaining a partial value when you do not have sufficient working parts to complete the entire job. There is a great reason that this was wrong, as well as it refers logic, not intuition. Logic permits you to comply with a detailed procedure that makes good sense, and when you make a wrong step, you are normally compelled to either attempt to go forward and also correct the error, or try to step and do a backwards step.
Another circumstances is when the student does not recognize an action of a process. These are both sensible failings, and there is no way around them. Also when you are stuck in an area that does not allow you to make any type of kind of relocation, such as a triangular, it is still important to comprehend why you are stuck, to ensure that you can make a far better move as well as go from the step you are stuck at to the next area.
With this in mind, the very best means to resolve a stuck situation is to just take the advance, rather than trying to go backward. Both processes are different in their method, but they have some fundamental similarities. Nonetheless, when they are tried together, you can swiftly tell which one is better at resolving the issue, and you can additionally inform which one is extra effective.
Allow's speak about the first example, which relates to the Oval (Projective Plane) mathematics lab. This is not also complicated, so allow's initial go over how to start. Take the adhering to process of affixing a component to a panel to be used as a body. This would certainly call for three dimensions, and would be something you would require to affix as part of the panel.
Currently, you would have an extra measurement, yet that does not imply that you can just maintain that dimension as well as go from there. When you made your very first step, you can quickly forget the dimension, and then you would have to go back and backtrack your actions.
However, as opposed to keeping in mind the added measurement, you can utilize what is called a "psychological faster way" to help you keep in mind that additional measurement. As you make your primary step, picture yourself taking the dimension and also affixing it to the part you intend to attach to, and afterwards see exactly how that makes you feel when you duplicate the procedure.
Visualisation is a very powerful technique, and is something that you should not skip over. Picture what it would certainly seem like to actually connect the part and have the ability to go from there, without the dimension.
Currently, let's take a look at the 2nd example. Allow's take the exact same process as before, and now the trainee needs to remember that they are going to return one step. If you tell them that they need to move back one step, however then you remove the idea of having to move back one action, then they won't understand exactly how to proceed with the trouble, they will not understand where to search for that action, as well as the procedure will be a mess.
Rather, make use of a mental shortcut like the mental diagram to emotionally reveal them that they are going to move back one step. as well as place them in a placement where they can progress from there. without having to consider the missing an action.
Pay Me To Do Your Oval (Projective Plane) Lab
" Oval (Projective Plane) - Need Aid With a Mathematics lab?" Regrettably, numerous trainees have actually had a problem understanding the concepts of linear Oval (Projective Plane). The good news is, there is a new format for linear Oval (Projective Plane) that can be made use of to show straight Oval (Projective Plane) to trainees who struggle with this idea. Pupils can use the lab Help Solution to help them discover brand-new strategies in straight Oval (Projective Plane) without facing a mountain of issues and without having to take a test on their concepts.
The lab Aid Solution was created in order to assist battling trainees as they relocate from university and also senior high school to the college and task market. Lots of trainees are unable to handle the stress and anxiety of the learning process as well as can have really little success in realizing the principles of direct Oval (Projective Plane).
The lab Assist Service was established by the Educational Testing Solution, that uses a variety of different online examinations that students can take and practice. The Test Help Service has aided many students improve their ratings and also can aid you enhance your ratings also. As trainees relocate from college as well as secondary school to the college and also job market, the TTS will help make your pupils' transition simpler.
There are a couple of different ways that you can make the most of the lab Help Solution. The primary way that pupils use the lab Help Solution is through the Solution Managers, which can assist trainees learn strategies in direct Oval (Projective Plane), which they can use to help them do well in their courses.
There are a number of problems that pupils experience when they initially make use of the lab Aid Service. Pupils are often overwhelmed and also do not understand just how much time they will certainly need to commit to the Solution. The Solution Managers can help the trainees review their principle discovering as well as help them to assess all of the product that they have currently learned in order to be gotten ready for their next program work.
The lab Aid Service works the same way that a professor does in regards to helping pupils comprehend the principles of linear Oval (Projective Plane). By giving your students with the tools that they need to find out the important ideas of straight Oval (Projective Plane), you can make your trainees a lot more successful throughout their researches. Actually, the lab Assist Service is so efficient that several students have switched over from typical math class to the lab Assist Solution.
The Task Supervisor is developed to assist trainees handle their research. The Job Manager can be set up to schedule how much time the pupil has readily available to complete their assigned homework. You can likewise establish a personalized time period, which is a fantastic feature for trainees that have a busy schedule or a very active high school. This feature can aid pupils prevent sensation overwhelmed with math projects.
An additional valuable attribute of the lab Assist Solution is the Trainee Assistant. The Trainee Aide helps students handle their work as well as provides a location to upload their research. The Pupil Aide is helpful for pupils that do not want to get overwhelmed with responding to numerous questions.
As trainees get more comfy with their jobs, they are encouraged to get in touch with the Job Manager and also the Pupil Aide to get an on-line support group. The on the internet support system can assist students maintain their emphasis as they answer their projects.
All of the tasks for the lab Help Service are consisted of in the package. Pupils can login and finish their appointed job while having the pupil help readily available in the background to help them. The lab Assist Solution can be a fantastic assistance for your pupils as they start to navigate the difficult college admissions and also work hunting waters.
Pupils must be prepared to get used to their assignments as quickly as possible in order to reach their main objective of entering into the university. They need to strive enough to see results that will certainly enable them to stroll on at the following level of their studies. Getting made use of to the process of finishing their projects is really vital.
Trainees have the ability to locate various means to help them learn how to make use of the lab Assist Service. Learning how to utilize the lab Help Solution is necessary to students' success in college as well as job application.
Pay Someone To Take My Oval (Projective Plane) Lab
Take My Oval (Projective Plane) Lab
Oval (Projective Plane) is made use of in a lot of colleges. Some instructors, however, do not use it really properly or use it incorrectly. This can have an unfavorable impact on the trainee's knowing.
So, when assigning projects, utilize a good Oval (Projective Plane) aid service to help you with each lab. These services offer a range of practical services, consisting of:
Tasks might need a lot of reviewing and browsing on the computer system. This is when utilizing a help solution can be a terrific advantage. It enables you to get more job done, enhance your understanding, as well as avoid a lot of stress and anxiety.
These types of homework solutions are an amazing way to begin collaborating with the most effective kind of help for your demands. Oval (Projective Plane) is one of the most difficult based on understand for students. Working with a service, you can make sure that your requirements are met, you are taught correctly, and you comprehend the material appropriately.
There are numerous ways that you can show yourself to function well with the class and be successful. Make use of a proper Oval (Projective Plane) assistance solution to direct you as well as get the work done. Oval (Projective Plane) is one of the hardest courses to discover but it can be easily grasped with the ideal aid.
Having a research solution additionally helps to improve the trainee's qualities. It permits you to add extra credit score in addition to increase your Grade Point Average. Getting additional credit report is commonly a substantial advantage in lots of universities.
Pupils who do not take full advantage of their Oval (Projective Plane) course will certainly wind up moving ahead of the remainder of the course. The good news is that you can do it with a fast as well as easy service. So, if you wish to move ahead in your course, utilize a good assistance service. Something to bear in mind is that if you really wish to boost your quality degree, your training course job needs to get done. As long as feasible, you require to comprehend and also deal with all your issues. You can do this with an excellent help solution.
One advantage of having a homework solution is that you can help yourself. If you don't feel great in your capability to do so, after that an excellent tutor will certainly have the ability to help you. They will certainly be able to fix the troubles you face as well as help you comprehend them in order to get a far better quality.
When you graduate from secondary school as well as go into college, you will require to strive in order to stay ahead of the various other students. That means that you will certainly need to work hard on your homework. Using an Oval (Projective Plane) service can assist you get it done.
Keeping your grades up can be challenging since you typically need to research a whole lot and take a great deal of examinations. You don't have time to deal with your qualities alone. Having an excellent tutor can be a fantastic assistance due to the fact that they can assist you and also your research out.
A help solution can make it simpler for you to handle your Oval (Projective Plane) course. Furthermore, you can learn more concerning on your own and aid you succeed. Discover the best tutoring service and also you will be able to take your research study skills to the next degree.
|
{
"url": "https://mathexamination.com/lab/oval-(projective-plane).php",
"source_domain": "mathexamination.com",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "23556",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QHKHBT7BHQ4TM6ALFSHKEXS5GI7REFCX",
"WARC-Concurrent-To": "<urn:uuid:8883caf2-33f6-425e-a8e6-e1c8a4c76b8e>",
"WARC-Date": "2021-03-03T02:56:31Z",
"WARC-IP-Address": "172.67.178.201",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GZDCYSBL33Y5JJ76XPTV4X4JF7WHJQSB",
"WARC-Record-ID": "<urn:uuid:0f1bc84c-0137-4e7f-9335-dde039b3e6c7>",
"WARC-Target-URI": "https://mathexamination.com/lab/oval-(projective-plane).php",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:612ec757-61d4-47b6-b7a4-136caa9fed81>"
},
"warc_info": "isPartOf: CC-MAIN-2021-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-128.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
46,
47,
83,
84,
118,
119,
495,
496,
986,
987,
1392,
1393,
1889,
1890,
2327,
2328,
2721,
2722,
3100,
3101,
3378,
3379,
3767,
3768,
3993,
3994,
4458,
4459,
4714,
4715,
4761,
4762,
5331,
5332,
5685,
5686,
6122,
6123,
6437,
6438,
6891,
6892,
7386,
7387,
7818,
7819,
8124,
8125,
8393,
8394,
8754,
8755,
9115,
9116,
9347,
9348,
9399,
9400,
9436,
9437,
9640,
9641,
9815,
9816,
10068,
10069,
10434,
10435,
10761,
10762,
11029,
11030,
11589,
11590,
11924,
11925,
12214,
12215,
12525,
12526
],
"line_end_idx": [
46,
47,
83,
84,
118,
119,
495,
496,
986,
987,
1392,
1393,
1889,
1890,
2327,
2328,
2721,
2722,
3100,
3101,
3378,
3379,
3767,
3768,
3993,
3994,
4458,
4459,
4714,
4715,
4761,
4762,
5331,
5332,
5685,
5686,
6122,
6123,
6437,
6438,
6891,
6892,
7386,
7387,
7818,
7819,
8124,
8125,
8393,
8394,
8754,
8755,
9115,
9116,
9347,
9348,
9399,
9400,
9436,
9437,
9640,
9641,
9815,
9816,
10068,
10069,
10434,
10435,
10761,
10762,
11029,
11030,
11589,
11590,
11924,
11925,
12214,
12215,
12525,
12526,
12808
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 12808,
"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.5068163871765137,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0012028899509459734,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.09903769195079803,
"rps_doc_frac_unique_words": 0.26756152510643005,
"rps_doc_mean_word_length": 4.599105358123779,
"rps_doc_num_sentences": 101,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.395238399505615,
"rps_doc_word_count": 2235,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06245743855834007,
"rps_doc_frac_chars_dupe_6grams": 0.0274345800280571,
"rps_doc_frac_chars_dupe_7grams": 0.013620000332593918,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.036774009466171265,
"rps_doc_frac_chars_top_3gram": 0.04990758001804352,
"rps_doc_frac_chars_top_4gram": 0.012841720134019852,
"rps_doc_books_importance": -891.4092407226562,
"rps_doc_books_importance_length_correction": -891.4092407226562,
"rps_doc_openwebtext_importance": -527.9799194335938,
"rps_doc_openwebtext_importance_length_correction": -527.9799194335938,
"rps_doc_wikipedia_importance": -471.8274230957031,
"rps_doc_wikipedia_importance_length_correction": -471.8274230957031
},
"fasttext": {
"dclm": 0.025601740926504135,
"english": 0.9751097559928894,
"fineweb_edu_approx": 1.8886268138885498,
"eai_general_math": 0.2575083374977112,
"eai_open_web_math": 0.36517882347106934,
"eai_web_code": 0.023559749126434326
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "516.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Geometry, Algebraic"
}
},
"secondary": {
"code": "378.15",
"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": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,460,682,099,394,088,400 |
Desktop productivity for business analysts and programmers
Input multiple text files into my EG project
Reply
Occasional Contributor
Posts: 7
Input multiple text files into my EG project
[ Edited ]
I was wondering if anyone could help I'm still new to sas and getting the hang of the basics.
i have text files in the following file structure.
File 1
date 1 date 2 etc etc
text doc 1 text doc 2 text doc 3
all my text files are delimited with | and are all the same format.
how would I enter all my txt files into one query within sas enterprise guide please?
Any example code would be a great help. But I'm afraid you may have to dumb it down for me to be able to understand as I am so new to this.
Thank you
PROC Star
Posts: 1,334
Re: In put mutipul text files into my project
Posted in reply to VicBrookes
There are two options.
If you want to use the "point and click" capabilities of Enterprise Guide, use the "import data" task to get your data into SAS dataset format.
If you prefer to write a SAS program, you would open a Program window and write data step code. The SAS documentation covers this process in detail.
Tom
Occasional Contributor
Posts: 7
Re: In put mutipul text files into my project
[ Edited ]
Thank you. I understand the point and click method but this will not
bring in all the muti files that are sat below my file structure.
I do need to write the code but I would not know where to start as my
second layer down change names as they are named the date the file was
created and a similar issue with the txt files themselves as they are
named date and time of file being written, plus a unique customer
identifier. I've seen code that uses wildcards but not at a 3 layer
approach.
I do have something above these files currently that brings them into an
excel file but with the amount of data I have this is a very timely
process and I still have to txt to columns after I've brought it in. I
would like my process to be quicker going forward.
Current Excel VBA code
ub Button1_Click()
'
Dim fso As Object 'FileSystemObject
Dim fldStart As Object 'Folder
Dim fld As Object 'Folder
Dim fl As Object 'File
Dim Mask As String
Application.ScreenUpdating = False
Dim newWS As Worksheet
Set newWS = Sheets.Add(before:=Sheets(1))
Set fso = CreateObject("scripting.FileSystemObject") ' late binding
'Set fso = New FileSystemObject 'or use early binding (also replace
Object types)
Set fldStart = fso.GetFolder("FILEPATH") ' <-- use your FileDialog
code here
Mask = "*.txt"
'Debug.Print fldStart.Path & "\"
ListFiles fldStart, Mask
For Each fld In fldStart.SubFolders
ListFiles fld, Mask
ListFolders fld, Mask
Next
Dim myWB As Workbook, WB As Workbook
Set myWB = ThisWorkbook
Dim L As Long, t As Long, i As Long
L = myWB.Sheets(1).Cells(Rows.Count, "A").End(xlUp).Row
t = 1
For i = 1 To L
Workbooks.OpenText Filename:=myWB.Sheets(1).Cells(i, 1).Value,
DataType:=xlDelimited, Tab:=True
Set WB = ActiveWorkbook
WB.Sheets(1).UsedRange.Copy newWS.Cells(t, 2)
t = myWB.Sheets(1).Cells(Rows.Count, "B").End(xlUp).Row + 1
WB.Close False
Next
myWB.Sheets(1).Columns(1).Delete
Application.ScreenUpdating = True
End Sub
Sub ListFolders(fldStart As Object, Mask As String)
Dim fld As Object 'Folder
For Each fld In fldStart.SubFolders
'Debug.Print fld.Path & "\"
ListFiles fld, Mask
ListFolders fld, Mask
Next
End Sub
##- Please type your reply above this line. Simple formatting, no
PROC Star
Posts: 1,334
Re: In put mutipul text files into my project
Posted in reply to VicBrookes
A couple of questions:
Are you trying to read every file in a directory, or is there a structure with one directory above another, etc, with the files in a set of directories at the bottom.
Do you know the directory names and file names in advance, or do you need the program to discover them?
It is really easy to create and use directory and file names as macro variables, like in this example:
%let DirName = C:\Desktop;
%let FileName = TestFile.txt;
data TestData;
infile "&DirName.\&FileName.";
input a b c;
run;
Super User
Posts: 23,980
Re: In put mutipul text files into my project
Posted in reply to VicBrookes
I wrote an article on this a while back. It should help you get started. If you have specific questions post back with what you've tried.
https://communities.sas.com/t5/SAS-Communities-Library/How-do-I-write-a-macro-to-import-multiple-tex...
Occasional Contributor
Posts: 7
Re: In put mutipul text files into my project
Arrrrrh it was your article I read and tried to work through hence the term "wild card" I really am so new to this sad thing I come from a non developer back ground learn all my stuff from you tube and forums to get my project that far in excel and really am at the stage of leading to walk and your code it taking me in to the marathon. But I'm embracing learning a whole new skill.
I've got this far and willing to learn so if I try again over the next few days and provide you with where I'm going wrong your help would be amazing.
PROC Star
Posts: 1,334
Re: In put mutipul text files into my project
Posted in reply to VicBrookes
Don't be discouraged!
If you were able to get as far as you did with VB and Excel, you're on the right track for programming.
And the great thing is, if you're wanting to process and analyze data, there's nothing better than SAS for that.
So your journey is going in the right direction, and we're all here to help.
Tom
Super User
Posts: 23,980
Re: In put mutipul text files into my project
Posted in reply to VicBrookes
@VicBrookes You'll find that if you put in any effort and it shows, the forum is more than helpful. Especially if you mock up data and show what you want. You'll get several different versions of code that will solve your issues as long as you ask your question clearly Smiley Happy
Ask a Question
Discussion stats
• 7 replies
• 441 views
• 1 like
• 3 in conversation
|
{
"url": "https://communities.sas.com/t5/SAS-Enterprise-Guide/Input-multiple-text-files-into-my-EG-project/td-p/271553?nobounce",
"source_domain": "communities.sas.com",
"snapshot_id": "crawl=CC-MAIN-2018-34",
"warc_metadata": {
"Content-Length": "269351",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PTU5X3S6GT73SBZRC6Z3FR6BL3N6XESE",
"WARC-Concurrent-To": "<urn:uuid:b9ca8fcb-dd0e-4e62-85b6-c2207abfb4a2>",
"WARC-Date": "2018-08-16T00:23:15Z",
"WARC-IP-Address": "208.74.205.167",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WIFPMWSI6ZWWBW3G3NN3IE2X7EFS6Z4P",
"WARC-Record-ID": "<urn:uuid:b2e40063-283e-4be8-b733-d2c78f9641cd>",
"WARC-Target-URI": "https://communities.sas.com/t5/SAS-Enterprise-Guide/Input-multiple-text-files-into-my-EG-project/td-p/271553?nobounce",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:45b1f2db-f008-4e09-9f09-df3d208464d9>"
},
"warc_info": "isPartOf: CC-MAIN-2018-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2018\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-31-69-36.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,
59,
60,
105,
106,
112,
135,
144,
145,
190,
191,
202,
203,
297,
298,
350,
351,
358,
359,
381,
382,
415,
416,
418,
419,
487,
488,
490,
491,
578,
579,
581,
582,
723,
724,
734,
735,
745,
758,
759,
805,
806,
836,
837,
860,
861,
863,
864,
1008,
1009,
1011,
1012,
1161,
1162,
1164,
1165,
1169,
1170,
1193,
1202,
1203,
1249,
1250,
1261,
1262,
1331,
1397,
1398,
1468,
1539,
1609,
1675,
1743,
1753,
1754,
1827,
1895,
1966,
2017,
2018,
2041,
2042,
2043,
2044,
2063,
2064,
2066,
2067,
2103,
2104,
2135,
2136,
2162,
2163,
2186,
2187,
2206,
2207,
2208,
2209,
2244,
2245,
2268,
2269,
2270,
2271,
2313,
2314,
2315,
2316,
2384,
2385,
2453,
2467,
2468,
2469,
2470,
2537,
2547,
2548,
2563,
2564,
2597,
2598,
2623,
2624,
2660,
2661,
2681,
2682,
2704,
2705,
2710,
2711,
2712,
2713,
2714,
2715,
2752,
2753,
2777,
2778,
2814,
2815,
2871,
2872,
2878,
2879,
2894,
2895,
2958,
2991,
2992,
3016,
3017,
3063,
3064,
3124,
3125,
3140,
3141,
3146,
3147,
3180,
3181,
3215,
3216,
3224,
3225,
3226,
3227,
3228,
3229,
3230,
3231,
3283,
3284,
3310,
3311,
3347,
3348,
3376,
3377,
3397,
3398,
3420,
3421,
3426,
3427,
3435,
3436,
3502,
3503,
3513,
3526,
3527,
3573,
3574,
3604,
3605,
3628,
3629,
3631,
3632,
3799,
3800,
3802,
3803,
3907,
3908,
3910,
3911,
4014,
4015,
4017,
4018,
4045,
4046,
4076,
4077,
4092,
4093,
4124,
4125,
4138,
4139,
4144,
4145,
4156,
4170,
4171,
4217,
4218,
4248,
4249,
4388,
4389,
4391,
4392,
4496,
4497,
4520,
4529,
4530,
4576,
4577,
4961,
4962,
5114,
5115,
5125,
5138,
5139,
5185,
5186,
5216,
5217,
5239,
5240,
5242,
5243,
5347,
5348,
5350,
5351,
5464,
5465,
5467,
5468,
5545,
5546,
5548,
5549,
5553,
5554,
5565,
5579,
5580,
5626,
5627,
5657,
5658,
5941,
5942,
5957,
5974,
5988,
6002,
6013
],
"line_end_idx": [
59,
60,
105,
106,
112,
135,
144,
145,
190,
191,
202,
203,
297,
298,
350,
351,
358,
359,
381,
382,
415,
416,
418,
419,
487,
488,
490,
491,
578,
579,
581,
582,
723,
724,
734,
735,
745,
758,
759,
805,
806,
836,
837,
860,
861,
863,
864,
1008,
1009,
1011,
1012,
1161,
1162,
1164,
1165,
1169,
1170,
1193,
1202,
1203,
1249,
1250,
1261,
1262,
1331,
1397,
1398,
1468,
1539,
1609,
1675,
1743,
1753,
1754,
1827,
1895,
1966,
2017,
2018,
2041,
2042,
2043,
2044,
2063,
2064,
2066,
2067,
2103,
2104,
2135,
2136,
2162,
2163,
2186,
2187,
2206,
2207,
2208,
2209,
2244,
2245,
2268,
2269,
2270,
2271,
2313,
2314,
2315,
2316,
2384,
2385,
2453,
2467,
2468,
2469,
2470,
2537,
2547,
2548,
2563,
2564,
2597,
2598,
2623,
2624,
2660,
2661,
2681,
2682,
2704,
2705,
2710,
2711,
2712,
2713,
2714,
2715,
2752,
2753,
2777,
2778,
2814,
2815,
2871,
2872,
2878,
2879,
2894,
2895,
2958,
2991,
2992,
3016,
3017,
3063,
3064,
3124,
3125,
3140,
3141,
3146,
3147,
3180,
3181,
3215,
3216,
3224,
3225,
3226,
3227,
3228,
3229,
3230,
3231,
3283,
3284,
3310,
3311,
3347,
3348,
3376,
3377,
3397,
3398,
3420,
3421,
3426,
3427,
3435,
3436,
3502,
3503,
3513,
3526,
3527,
3573,
3574,
3604,
3605,
3628,
3629,
3631,
3632,
3799,
3800,
3802,
3803,
3907,
3908,
3910,
3911,
4014,
4015,
4017,
4018,
4045,
4046,
4076,
4077,
4092,
4093,
4124,
4125,
4138,
4139,
4144,
4145,
4156,
4170,
4171,
4217,
4218,
4248,
4249,
4388,
4389,
4391,
4392,
4496,
4497,
4520,
4529,
4530,
4576,
4577,
4961,
4962,
5114,
5115,
5125,
5138,
5139,
5185,
5186,
5216,
5217,
5239,
5240,
5242,
5243,
5347,
5348,
5350,
5351,
5464,
5465,
5467,
5468,
5545,
5546,
5548,
5549,
5553,
5554,
5565,
5579,
5580,
5626,
5627,
5657,
5658,
5941,
5942,
5957,
5974,
5988,
6002,
6013,
6034
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6034,
"ccnet_original_nlines": 288,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3358490467071533,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03547170013189316,
"rps_doc_frac_lines_end_with_ellipsis": 0.0034602100495249033,
"rps_doc_frac_no_alph_words": 0.21056604385375977,
"rps_doc_frac_unique_words": 0.3709677457809448,
"rps_doc_mean_word_length": 4.582661151885986,
"rps_doc_num_sentences": 72,
"rps_doc_symbol_to_word_ratio": 0.0022641499526798725,
"rps_doc_unigram_entropy": 5.36568021774292,
"rps_doc_word_count": 992,
"rps_doc_frac_chars_dupe_10grams": 0.11438626796007156,
"rps_doc_frac_chars_dupe_5grams": 0.1750989854335785,
"rps_doc_frac_chars_dupe_6grams": 0.14738230407238007,
"rps_doc_frac_chars_dupe_7grams": 0.14738230407238007,
"rps_doc_frac_chars_dupe_8grams": 0.13066431879997253,
"rps_doc_frac_chars_dupe_9grams": 0.11438626796007156,
"rps_doc_frac_chars_top_2gram": 0.02177738957107067,
"rps_doc_frac_chars_top_3gram": 0.025736909359693527,
"rps_doc_frac_chars_top_4gram": 0.02969644032418728,
"rps_doc_books_importance": -591.5645141601562,
"rps_doc_books_importance_length_correction": -591.5645141601562,
"rps_doc_openwebtext_importance": -362.1844177246094,
"rps_doc_openwebtext_importance_length_correction": -362.1844177246094,
"rps_doc_wikipedia_importance": -305.6136169433594,
"rps_doc_wikipedia_importance_length_correction": -305.6136169433594
},
"fasttext": {
"dclm": 0.022726060822606087,
"english": 0.9033242464065552,
"fineweb_edu_approx": 1.5847804546356201,
"eai_general_math": 0.12601113319396973,
"eai_open_web_math": 0.2956642508506775,
"eai_web_code": 0.003124650102108717
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.462",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.467",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-5,918,860,405,428,151,000 |
Collaborative App with Mendix
0
Hi All, I'm trying to build a collaborative app using Mendix and i was hoping anyone could point me in he direction of where i can get resources to guide me on how to go about it.
asked
1 answers
0
If you're new to app building, I highly recommend following some learning paths to get started. You can find them in the academy here.
This course specifically should help you get started: Become a rapid developer
Welcome and good luck on your low code journey!
answered
|
{
"url": "https://community.mendix.com/link/space/app-development/questions/132999",
"source_domain": "community.mendix.com",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "4389",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VMYC2SNAPRYQCSEAUKLHQLKGQFM3USHZ",
"WARC-Concurrent-To": "<urn:uuid:8ad79fbf-f26c-4f5a-9f88-56951c72dd65>",
"WARC-Date": "2024-08-14T00:18:56Z",
"WARC-IP-Address": "3.125.189.196",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:MQLK4H7LZPMDZEAVSCYXRMHP6GVYQIPI",
"WARC-Record-ID": "<urn:uuid:d614f516-bc4b-42ad-aabb-d7a302836f63>",
"WARC-Target-URI": "https://community.mendix.com/link/space/app-development/questions/132999",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8e65c6c9-ecd2-40aa-9df4-51e31eb14351>"
},
"warc_info": "isPartOf: CC-MAIN-2024-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-138\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,
30,
31,
33,
215,
221,
231,
233,
234,
369,
370,
372,
373,
452,
453,
455,
456,
504,
505
],
"line_end_idx": [
30,
31,
33,
215,
221,
231,
233,
234,
369,
370,
372,
373,
452,
453,
455,
456,
504,
505,
513
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 513,
"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.4757281541824341,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019417479634284973,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.11650484800338745,
"rps_doc_frac_unique_words": 0.77173912525177,
"rps_doc_mean_word_length": 4.34782600402832,
"rps_doc_num_sentences": 5,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.161093711853027,
"rps_doc_word_count": 92,
"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.07999999821186066,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -59.73603820800781,
"rps_doc_books_importance_length_correction": -70.65992736816406,
"rps_doc_openwebtext_importance": -32.620784759521484,
"rps_doc_openwebtext_importance_length_correction": -43.544673919677734,
"rps_doc_wikipedia_importance": -20.90118408203125,
"rps_doc_wikipedia_importance_length_correction": -31.8250732421875
},
"fasttext": {
"dclm": 0.020318450406193733,
"english": 0.9586254358291626,
"fineweb_edu_approx": 1.1073648929595947,
"eai_general_math": 0.03246510028839111,
"eai_open_web_math": 0.05891352891921997,
"eai_web_code": 0.016258480027318
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.452",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
-2,635,820,345,667,134,000 |
Tokenization/De-identify Respondents' Emails - Server-side vs Client-side
ThomazThomaz MA, USACommunity Member Qubie ✭
Tokenization/De-identify Respondents' Emails - Server-side vs Client-side
Hi, I have a quick questions about how to tokenize/de-identify emails that respondents enter in my survey.
As a part of a multi-survey project, I need to create a survey that asks for a respondent's email and then tokenize it using a one-way function where the email will be converted to a random token in the first entry, and then in follow-up surveys, anytime the same email is entered, the same token is created (so I can link all different responses from the same person).
I already have built the tokenization function. However, I am unsure how to implement it in Qualtrics so that it runs on the server-side rather than on the client-side. Is that possible?
Thanks
Sign In to Comment
|
{
"url": "https://www.qualtrics.com/community/discussion/10928/tokenization-de-identify-respondents-emails-server-side-vs-client-side",
"source_domain": "www.qualtrics.com",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "108323",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SA6AFT5IEJOD47NHGX3VLRIRYTP7EGIR",
"WARC-Concurrent-To": "<urn:uuid:345a7b4f-78f7-4aea-ae10-57cfae7c2f7e>",
"WARC-Date": "2021-03-08T10:07:27Z",
"WARC-IP-Address": "104.108.122.55",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7UL6NZCM6TNYKWC2WHRZLJA54HKGAFM5",
"WARC-Record-ID": "<urn:uuid:6dc928af-2ef1-4da6-8c86-134ba15f831b>",
"WARC-Target-URI": "https://www.qualtrics.com/community/discussion/10928/tokenization-de-identify-respondents-emails-server-side-vs-client-side",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:6b002e62-08dd-4d4b-bc8c-b8ad47b94d7f>"
},
"warc_info": "isPartOf: CC-MAIN-2021-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-127.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
74,
75,
120,
121,
195,
196,
303,
304,
674,
675,
862,
863,
870,
871
],
"line_end_idx": [
74,
75,
120,
121,
195,
196,
303,
304,
674,
675,
862,
863,
870,
871,
889
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 889,
"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.38624340295791626,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0317460298538208,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.17989417910575867,
"rps_doc_frac_unique_words": 0.6000000238418579,
"rps_doc_mean_word_length": 5.050000190734863,
"rps_doc_num_sentences": 6,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.200150012969971,
"rps_doc_word_count": 140,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.17256011068820953,
"rps_doc_frac_chars_dupe_6grams": 0.17256011068820953,
"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.029702970758080482,
"rps_doc_frac_chars_top_3gram": 0.11032532155513763,
"rps_doc_frac_chars_top_4gram": 0.13861386477947235,
"rps_doc_books_importance": -78.81192016601562,
"rps_doc_books_importance_length_correction": -78.81192016601562,
"rps_doc_openwebtext_importance": -28.885042190551758,
"rps_doc_openwebtext_importance_length_correction": -20.822486877441406,
"rps_doc_wikipedia_importance": -2.7371649742126465,
"rps_doc_wikipedia_importance_length_correction": -2.7371649742126465
},
"fasttext": {
"dclm": 0.14098942279815674,
"english": 0.893207848072052,
"fineweb_edu_approx": 1.7347381114959717,
"eai_general_math": 0.6906128525733948,
"eai_open_web_math": 0.10359150171279907,
"eai_web_code": 0.3601696491241455
}
}
|
{
"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": "300.72",
"labels": {
"level_1": "Social sciences",
"level_2": "",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
672f1e42c33a7f9846924a2431ea77df
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.