id
int64 | text
string | metadata
dict | line_start_n_end_idx
dict | quality_signals
dict | eai_taxonomy
dict | pid
string |
|---|---|---|---|---|---|---|
6,800,996,200,543,161,000 |
Manual Reference Pages - BASH (1)
NAME
bash - GNU Bourne-Again SHell
CONTENTS
Synopsis
Copyright
Description
Options
Arguments
Invocation
Definitions
Simple Commands
Pipelines
Lists
Compound Commands
Coprocesses
Shell Function Definitions
Comments
Quoting
Parameters
Positional Parameters
Special Parameters
Shell Variables
Arrays
Expansion
Brace Expansion
Tilde Expansion
Parameter Expansion
Command Substitution
Arithmetic Expansion
Process Substitution
Word Splitting
Pathname Expansion
Quote Removal
Redirection
Redirecting Input
Redirecting Output
Appending Redirected Output
Redirecting Standard Output and Standard Error
Appending Standard Output and Standard Error
Here Documents
Aliases
Functions
Command Execution Environment
Environment
Signals
Prompting
Readline
Searching
Commands for Moving
Commands for Manipulating the History
Commands for Changing Text
Killing and Yanking
Numeric Arguments
Completing
Keyboard Macros
Miscellaneous
Programmable Completion
History
Event Designators
Word Designators
Modifiers
Files
Authors
Bug Reports
Bugs
SYNOPSIS
bash [options] [file]
COPYRIGHT
Bash is Copyright © 1989-2011 by the Free Software Foundation, Inc.
DESCRIPTION
Bash is an sh-compatible command language interpreter that executes commands read from the standard input or from a file. Bash also incorporates useful features from the Korn and C shells (ksh and csh).
Bash is intended to be a conformant implementation of the Shell and Utilities portion of the IEEE POSIX specification (IEEE Standard 1003.1). Bash can be configured to be POSIX-conformant by default.
OPTIONS
All of the single-character shell options documented in the description of the set builtin command can be used as options when the shell is invoked. In addition, bash interprets the following options when it is invoked:
-c string If the -c option is present, then commands are read from string. If there are arguments after the string, they are assigned to the positional parameters, starting with $0.
-i If the -i option is present, the shell is interactive.
-l Make bash act as if it had been invoked as a login shell (see INVOCATION below).
-r If the -r option is present, the shell becomes restricted (see RESTRICTED SHELL below).
-s If the -s option is present, or if no arguments remain after option processing, then commands are read from the standard input. This option allows the positional parameters to be set when invoking an interactive shell.
-D A list of all double-quoted strings preceded by $ is printed on the standard output. These are the strings that are subject to language translation when the current locale is not C or POSIX. This implies the -n option; no commands will be executed.
[-+]O [shopt_option]
shopt_option is one of the shell options accepted by the shopt builtin (see SHELL BUILTIN COMMANDS below). If shopt_option is present, -O sets the value of that option; +O unsets it. If shopt_option is not supplied, the names and values of the shell options accepted by shopt are printed on the standard output. If the invocation option is +O, the output is displayed in a format that may be reused as input.
-- A -- signals the end of options and disables further option processing. Any arguments after the -- are treated as filenames and arguments. An argument of - is equivalent to --.
Bash also interprets a number of multi-character options. These options must appear on the command line before the single-character options to be recognized.
--debugger
Arrange for the debugger profile to be executed before the shell starts. Turns on extended debugging mode (see the description of the extdebug option to the shopt builtin below).
--dump-po-strings
Equivalent to -D, but the output is in the GNU gettext po (portable object) file format.
--dump-strings
Equivalent to -D.
--help Display a usage message on standard output and exit successfully.
--init-file file
--rcfile file
Execute commands from file instead of the system wide initialization file /etc/bash.bashrc and the standard personal initialization file ~/.bashrc if the shell is interactive (see INVOCATION below).
--login Equivalent to -l.
--noediting
Do not use the GNU readline library to read command lines when the shell is interactive.
--noprofile
Do not read either the system-wide startup file /etc/profile or any of the personal initialization files ~/.bash_profile, ~/.bash_login, or ~/.profile. By default, bash reads these files when it is invoked as a login shell (see INVOCATION below).
--norc Do not read and execute the system wide initialization file /etc/bash.bashrc and the personal initialization file ~/.bashrc if the shell is interactive. This option is on by default if the shell is invoked as sh.
--posix Change the behavior of bash where the default operation differs from the POSIX standard to match the standard (posix mode).
--restricted
The shell becomes restricted (see RESTRICTED SHELL below).
--verbose
Equivalent to -v.
--version
Show version information for this instance of bash on the standard output and exit successfully.
ARGUMENTS
If arguments remain after option processing, and neither the -c nor the -s option has been supplied, the first argument is assumed to be the name of a file containing shell commands. If bash is invoked in this fashion, $0 is set to the name of the file, and the positional parameters are set to the remaining arguments. Bash reads and executes commands from this file, then exits. Bash’s exit status is the exit status of the last command executed in the script. If no commands are executed, the exit status is 0. An attempt is first made to open the file in the current directory, and, if no file is found, then the shell searches the directories in PATH for the script.
INVOCATION
A login shell is one whose first character of argument zero is a -, or one started with the --login option.
An interactive shell is one started without non-option arguments and without the -c option whose standard input and error are both connected to terminals (as determined by isatty(3)), or one started with the -i option. PS1 is set and $- includes i if bash is interactive, allowing a shell script or a startup file to test this state.
The following paragraphs describe how bash executes its startup files. If any of the files exist but cannot be read, bash reports an error. Tildes are expanded in file names as described below under Tilde Expansion in the EXPANSION section.
When bash is invoked as an interactive login shell, or as a non-interactive shell with the --login option, it first reads and executes commands from the file /etc/profile, if that file exists. After reading that file, it looks for ~/.bash_profile, ~/.bash_login, and ~/.profile, in that order, and reads and executes commands from the first one that exists and is readable. The --noprofile option may be used when the shell is started to inhibit this behavior.
When a login shell exits, bash reads and executes commands from the file ~/.bash_logout, if it exists.
When an interactive shell that is not a login shell is started, bash reads and executes commands from /etc/bash.bashrc and ~/.bashrc, if these files exist. This may be inhibited by using the --norc option. The --rcfile file option will force bash to read and execute commands from file instead of /etc/bash.bashrc and ~/.bashrc.
When bash is started non-interactively, to run a shell script, for example, it looks for the variable BASH_ENV in the environment, expands its value if it appears there, and uses the expanded value as the name of a file to read and execute. Bash behaves as if the following command were executed:
if [ -n "$BASH_ENV" ]; then . "$BASH_ENV"; fi
but the value of the PATH variable is not used to search for the file name.
If bash is invoked with the name sh, it tries to mimic the startup behavior of historical versions of sh as closely as possible, while conforming to the POSIX standard as well. When invoked as an interactive login shell, or a non-interactive shell with the --login option, it first attempts to read and execute commands from /etc/profile and ~/.profile, in that order. The --noprofile option may be used to inhibit this behavior. When invoked as an interactive shell with the name sh, bash looks for the variable ENV, expands its value if it is defined, and uses the expanded value as the name of a file to read and execute. Since a shell invoked as sh does not attempt to read and execute commands from any other startup files, the --rcfile option has no effect. A non-interactive shell invoked with the name sh does not attempt to read any other startup files. When invoked as sh, bash enters posix mode after the startup files are read.
When bash is started in posix mode, as with the --posix command line option, it follows the POSIX standard for startup files. In this mode, interactive shells expand the ENV variable and commands are read and executed from the file whose name is the expanded value. No other startup files are read.
Bash attempts to determine when it is being run with its standard input connected to a network connection, as when executed by the remote shell daemon, usually rshd, or the secure shell daemon sshd. If bash determines it is being run in this fashion, it reads and executes commands from ~/.bashrc and ~/.bashrc, if these files exist and are readable. It will not do this if invoked as sh. The --norc option may be used to inhibit this behavior, and the --rcfile option may be used to force another file to be read, but rshd does not generally invoke the shell with those options or allow them to be specified.
If the shell is started with the effective user (group) id not equal to the real user (group) id, and the -p option is not supplied, no startup files are read, shell functions are not inherited from the environment, the SHELLOPTS, BASHOPTS, CDPATH, and GLOBIGNORE variables, if they appear in the environment, are ignored, and the effective user id is set to the real user id. If the -p option is supplied at invocation, the startup behavior is the same, but the effective user id is not reset.
DEFINITIONS
The following definitions are used throughout the rest of this document.
blank A space or tab.
word A sequence of characters considered as a single unit by the shell. Also known as a token.
name A word consisting only of alphanumeric characters and underscores, and beginning with an alphabetic character or an underscore. Also referred to as an identifier.
metacharacter
A character that, when unquoted, separates words. One of the following:
| & ; ( ) < > space tab
control operator
A token that performs a control function. It is one of the following symbols:
|| & && ; ;; ( ) | |& <newline>
RESERVED WORDS
Reserved words are words that have a special meaning to the shell. The following words are recognized as reserved when unquoted and either the first word of a simple command (see SHELL GRAMMAR below) or the third word of a case or for command:
! case do done elif else esac fi for function if in select then until while { } time [[ ]]
SHELL GRAMMAR
Simple Commands
A simple command is a sequence of optional variable assignments followed by blank-separated words and redirections, and terminated by a control operator. The first word specifies the command to be executed, and is passed as argument zero. The remaining words are passed as arguments to the invoked command.
The return value of a simple command is its exit status, or 128+n if the command is terminated by signal n.
Pipelines
A pipeline is a sequence of one or more commands separated by one of the control operators | or |&. The format for a pipeline is:
[time [-p]] [ ! ] command [ [|||&] command2 ... ]
The standard output of command is connected via a pipe to the standard input of command2. This connection is performed before any redirections specified by the command (see REDIRECTION below). If |& is used, the standard error of command is connected to command2’s standard input through the pipe; it is shorthand for 2>&1 |. This implicit redirection of the standard error is performed after any redirections specified by the command.
The return status of a pipeline is the exit status of the last command, unless the pipefail option is enabled. If pipefail is enabled, the pipeline’s return status is the value of the last (rightmost) command to exit with a non-zero status, or zero if all commands exit successfully. If the reserved word ! precedes a pipeline, the exit status of that pipeline is the logical negation of the exit status as described above. The shell waits for all commands in the pipeline to terminate before returning a value.
If the time reserved word precedes a pipeline, the elapsed as well as user and system time consumed by its execution are reported when the pipeline terminates. The -p option changes the output format to that specified by POSIX. When the shell is in posix mode, it does not recognize time as a reserved word if the next token begins with a ‘-’. The TIMEFORMAT variable may be set to a format string that specifies how the timing information should be displayed; see the description of TIMEFORMAT under Shell Variables below.
When the shell is in posix mode, time may be followed by a newline. In this case, the shell displays the total user and system time consumed by the shell and its children. The TIMEFORMAT variable may be used to specify the format of the time information.
Each command in a pipeline is executed as a separate process (i.e., in a subshell).
Lists
A list is a sequence of one or more pipelines separated by one of the operators ;, &, &&, or ||, and optionally terminated by one of ;, &, or <newline>.
Of these list operators, && and || have equal precedence, followed by ; and &, which have equal precedence.
A sequence of one or more newlines may appear in a list instead of a semicolon to delimit commands.
If a command is terminated by the control operator &, the shell executes the command in the background in a subshell. The shell does not wait for the command to finish, and the return status is 0. Commands separated by a ; are executed sequentially; the shell waits for each command to terminate in turn. The return status is the exit status of the last command executed.
AND and OR lists are sequences of one of more pipelines separated by the && and || control operators, respectively. AND and OR lists are executed with left associativity. An AND list has the form
command1 && command2
command2 is executed if, and only if, command1 returns an exit status of zero.
An OR list has the form
command1 || command2
command2 is executed if and only if command1 returns a non-zero exit status. The return status of AND and OR lists is the exit status of the last command executed in the list.
Compound Commands
A compound command is one of the following:
(list) list is executed in a subshell environment (see COMMAND EXECUTION ENVIRONMENT below). Variable assignments and builtin commands that affect the shell’s environment do not remain in effect after the command completes. The return status is the exit status of list.
{ list; }
list is simply executed in the current shell environment. list must be terminated with a newline or semicolon. This is known as a group command. The return status is the exit status of list. Note that unlike the metacharacters ( and ), { and } are reserved words and must occur where a reserved word is permitted to be recognized. Since they do not cause a word break, they must be separated from list by whitespace or another shell metacharacter.
((expression))
The expression is evaluated according to the rules described below under ARITHMETIC EVALUATION. If the value of the expression is non-zero, the return status is 0; otherwise the return status is 1. This is exactly equivalent to let "expression".
[[ expression ]]
Return a status of 0 or 1 depending on the evaluation of the conditional expression expression. Expressions are composed of the primaries described below under CONDITIONAL EXPRESSIONS. Word splitting and pathname expansion are not performed on the words between the [[ and ]]; tilde expansion, parameter and variable expansion, arithmetic expansion, command substitution, process substitution, and quote removal are performed. Conditional operators such as -f must be unquoted to be recognized as primaries.
When used with [[, the < and > operators sort lexicographically using the current locale.
See the description of the test builtin command (section SHELL BUILTIN COMMANDS below) for the handling of parameters (i.e. missing parameters).
When the == and != operators are used, the string to the right of the operator is considered a pattern and matched according to the rules described below under Pattern Matching. If the shell option nocasematch is enabled, the match is performed without regard to the case of alphabetic characters. The return value is 0 if the string matches (==) or does not match (!=) the pattern, and 1 otherwise. Any part of the pattern may be quoted to force it to be matched as a string.
An additional binary operator, =~, is available, with the same precedence as == and !=. When it is used, the string to the right of the operator is considered an extended regular expression and matched accordingly (as in regex(3)). The return value is 0 if the string matches the pattern, and 1 otherwise. If the regular expression is syntactically incorrect, the conditional expression’s return value is 2. If the shell option nocasematch is enabled, the match is performed without regard to the case of alphabetic characters. Any part of the pattern may be quoted to force it to be matched as a string. Substrings matched by parenthesized subexpressions within the regular expression are saved in the array variable BASH_REMATCH. The element of BASH_REMATCH with index 0 is the portion of the string matching the entire regular expression. The element of BASH_REMATCH with index n is the portion of the string matching the nth parenthesized subexpression.
Expressions may be combined using the following operators, listed in decreasing order of precedence:
( expression )
Returns the value of expression. This may be used to override the normal precedence of operators.
! expression
True if expression is false.
expression1 && expression2
True if both expression1 and expression2 are true.
expression1 || expression2
True if either expression1 or expression2 is true.
The && and || operators do not evaluate expression2 if the value of expression1 is sufficient to determine the return value of the entire conditional expression.
for name [ [ in [ word ... ] ] ; ] do list ; done
The list of words following in is expanded, generating a list of items. The variable name is set to each element of this list in turn, and list is executed each time. If the in word is omitted, the for command executes list once for each positional parameter that is set (see PARAMETERS below). The return status is the exit status of the last command that executes. If the expansion of the items following in results in an empty list, no commands are executed, and the return status is 0.
for (( expr1 ; expr2 ; expr3 )) ; do list ; done
First, the arithmetic expression expr1 is evaluated according to the rules described below under ARITHMETIC EVALUATION. The arithmetic expression expr2 is then evaluated repeatedly until it evaluates to zero. Each time expr2 evaluates to a non-zero value, list is executed and the arithmetic expression expr3 is evaluated. If any expression is omitted, it behaves as if it evaluates to 1. The return value is the exit status of the last command in list that is executed, or false if any of the expressions is invalid.
select name [ in word ] ; do list ; done
The list of words following in is expanded, generating a list of items. The set of expanded words is printed on the standard error, each preceded by a number. If the in word is omitted, the positional parameters are printed (see PARAMETERS below). The PS3 prompt is then displayed and a line read from the standard input. If the line consists of a number corresponding to one of the displayed words, then the value of name is set to that word. If the line is empty, the words and prompt are displayed again. If EOF is read, the command completes. Any other value read causes name to be set to null. The line read is saved in the variable REPLY. The list is executed after each selection until a break command is executed. The exit status of select is the exit status of the last command executed in list, or zero if no commands were executed.
case word in [ [(] pattern [ | pattern ]
A case command first expands word, and tries to match it against each pattern in turn, using the same matching rules as for pathname expansion (see Pathname Expansion below). The word is expanded using tilde expansion, parameter and variable expansion, arithmetic substitution, command substitution, process substitution and quote removal. Each pattern examined is expanded using tilde expansion, parameter and variable expansion, arithmetic substitution, command substitution, and process substitution. If the shell option nocasematch is enabled, the match is performed without regard to the case of alphabetic characters. When a match is found, the corresponding list is executed. If the ;; operator is used, no subsequent matches are attempted after the first pattern match. Using ;& in place of ;; causes execution to continue with the list associated with the next set of patterns. Using ;;& in place of ;; causes the shell to test the next pattern list in the statement, if any, and execute any associated list on a successful match. The exit status is zero if no pattern matches. Otherwise, it is the exit status of the last command executed in list.
if list; then list;
[ elif list; then list; ] ... [ else list; ] fi The if list is executed. If its exit status is zero, the then list is executed. Otherwise, each elif list is executed in turn, and if its exit status is zero, the corresponding then list is executed and the command completes. Otherwise, the else list is executed, if present. The exit status is the exit status of the last command executed, or zero if no condition tested true.
while list-1; do list-2; done
until list-1; do list-2; done
The while command continuously executes the list list-2 as long as the last command in the list list-1 returns an exit status of zero. The until command is identical to the while command, except that the test is negated; list-2 is executed as long as the last command in list-1 returns a non-zero exit status. The exit status of the while and until commands is the exit status of the last command executed in list-2, or zero if none was executed.
Coprocesses
A coprocess is a shell command preceded by the coproc reserved word. A coprocess is executed asynchronously in a subshell, as if the command had been terminated with the & control operator, with a two-way pipe established between the executing shell and the coprocess.
The format for a coprocess is:
coproc [NAME] command [redirections]
This creates a coprocess named NAME. If NAME is not supplied, the default name is COPROC. NAME must not be supplied if command is a simple command (see above); otherwise, it is interpreted as the first word of the simple command. When the coproc is executed, the shell creates an array variable (see Arrays below) named NAME in the context of the executing shell. The standard output of command is connected via a pipe to a file descriptor in the executing shell, and that file descriptor is assigned to NAME[0]. The standard input of command is connected via a pipe to a file descriptor in the executing shell, and that file descriptor is assigned to NAME[1]. This pipe is established before any redirections specified by the command (see REDIRECTION below). The file descriptors can be utilized as arguments to shell commands and redirections using standard word expansions. The process ID of the shell spawned to execute the coprocess is available as the value of the variable NAME_PID. The wait builtin command may be used to wait for the coprocess to terminate.
The return status of a coprocess is the exit status of command.
Shell Function Definitions
A shell function is an object that is called like a simple command and executes a compound command with a new set of positional parameters. Shell functions are declared as follows:
name () compound-command [redirection]
function name [()] compound-command [redirection]
This defines a function named name. The reserved word function is optional. If the function reserved word is supplied, the parentheses are optional. The body of the function is the compound command compound-command (see Compound Commands above). That command is usually a list of commands between { and }, but may be any command listed under Compound Commands above. compound-command is executed whenever name is specified as the name of a simple command. Any redirections (see REDIRECTION below) specified when a function is defined are performed when the function is executed. The exit status of a function definition is zero unless a syntax error occurs or a readonly function with the same name already exists. When executed, the exit status of a function is the exit status of the last command executed in the body. (See FUNCTIONS below.)
COMMENTS
In a non-interactive shell, or an interactive shell in which the interactive_comments option to the shopt builtin is enabled (see SHELL BUILTIN COMMANDS below), a word beginning with # causes that word and all remaining characters on that line to be ignored. An interactive shell without the interactive_comments option enabled does not allow comments. The interactive_comments option is on by default in interactive shells.
QUOTING
Quoting is used to remove the special meaning of certain characters or words to the shell. Quoting can be used to disable special treatment for special characters, to prevent reserved words from being recognized as such, and to prevent parameter expansion.
Each of the metacharacters listed above under DEFINITIONS has special meaning to the shell and must be quoted if it is to represent itself.
When the command history expansion facilities are being used (see HISTORY EXPANSION below), the history expansion character, usually !, must be quoted to prevent history expansion.
There are three quoting mechanisms: the escape character, single quotes, and double quotes.
A non-quoted backslash (\) is the escape character. It preserves the literal value of the next character that follows, with the exception of <newline>. If a \<newline> pair appears, and the backslash is not itself quoted, the \<newline> is treated as a line continuation (that is, it is removed from the input stream and effectively ignored).
Enclosing characters in single quotes preserves the literal value of each character within the quotes. A single quote may not occur between single quotes, even when preceded by a backslash.
Enclosing characters in double quotes preserves the literal value of all characters within the quotes, with the exception of $, `, \, and, when history expansion is enabled, !. The characters $ and ` retain their special meaning within double quotes. The backslash retains its special meaning only when followed by one of the following characters: $, `, ", \, or <newline>. A double quote may be quoted within double quotes by preceding it with a backslash. If enabled, history expansion will be performed unless an ! appearing in double quotes is escaped using a backslash. The backslash preceding the ! is not removed.
The special parameters * and @ have special meaning when in double quotes (see PARAMETERS below).
Words of the form $ string are treated specially. The word expands to string, with backslash-escaped characters replaced as specified by the ANSI C standard. Backslash escape sequences, if present, are decoded as follows:
\a alert (bell)
\b backspace
\e
\E
an escape character
\f form feed
\n new line
\r carriage return
\t horizontal tab
\v vertical tab
\\ backslash
\ single quote
\\(dq double quote
\nnn the eight-bit character whose value is the octal value nnn (one to three digits)
\xHH the eight-bit character whose value is the hexadecimal value HH (one or two hex digits)
\uHHHH the Unicode (ISO/IEC 10646) character whose value is the hexadecimal value HHHH (one to four hex digits)
\UHHHHHHHH
the Unicode (ISO/IEC 10646) character whose value is the hexadecimal value HHHHHHHH (one to eight hex digits)
\cx a control-x character
The expanded result is single-quoted, as if the dollar sign had not been present.
A double-quoted string preceded by a dollar sign ($\(dqstring\(dq) will cause the string to be translated according to the current locale. If the current locale is C or POSIX, the dollar sign is ignored. If the string is translated and replaced, the replacement is double-quoted.
PARAMETERS
A parameter is an entity that stores values. It can be a name, a number, or one of the special characters listed below under Special Parameters. A variable is a parameter denoted by a name. A variable has a value and zero or more attributes. Attributes are assigned using the declare builtin command (see declare below in SHELL BUILTIN COMMANDS).
A parameter is set if it has been assigned a value. The null string is a valid value. Once a variable is set, it may be unset only by using the unset builtin command (see SHELL BUILTIN COMMANDS below).
A variable may be assigned to by a statement of the form
name=[value]
If value is not given, the variable is assigned the null string. All values undergo tilde expansion, parameter and variable expansion, command substitution, arithmetic expansion, and quote removal (see EXPANSION below). If the variable has its integer attribute set, then value is evaluated as an arithmetic expression even if the $((...)) expansion is not used (see Arithmetic Expansion below). Word splitting is not performed, with the exception of "$@" as explained below under Special Parameters. Pathname expansion is not performed. Assignment statements may also appear as arguments to the alias, declare, typeset, export, readonly, and local builtin commands.
In the context where an assignment statement is assigning a value to a shell variable or array index, the += operator can be used to append to or add to the variable’s previous value. When += is applied to a variable for which the integer attribute has been set, value is evaluated as an arithmetic expression and added to the variable’s current value, which is also evaluated. When += is applied to an array variable using compound assignment (see Arrays below), the variable’s value is not unset (as it is when using =), and new values are appended to the array beginning at one greater than the array’s maximum index (for indexed arrays) or added as additional key-value pairs in an associative array. When applied to a string-valued variable, value is expanded and appended to the variable’s value.
Positional Parameters
A positional parameter is a parameter denoted by one or more digits, other than the single digit 0. Positional parameters are assigned from the shell’s arguments when it is invoked, and may be reassigned using the set builtin command. Positional parameters may not be assigned to with assignment statements. The positional parameters are temporarily replaced when a shell function is executed (see FUNCTIONS below).
When a positional parameter consisting of more than a single digit is expanded, it must be enclosed in braces (see EXPANSION below).
Special Parameters
The shell treats several parameters specially. These parameters may only be referenced; assignment to them is not allowed.
* Expands to the positional parameters, starting from one. When the expansion occurs within double quotes, it expands to a single word with the value of each parameter separated by the first character of the IFS special variable. That is, "$*" is equivalent to "$1c$2c...", where c is the first character of the value of the IFS variable. If IFS is unset, the parameters are separated by spaces. If IFS is null, the parameters are joined without intervening separators.
@ Expands to the positional parameters, starting from one. When the expansion occurs within double quotes, each parameter expands to a separate word. That is, "$@" is equivalent to "$1" "$2" ... If the double-quoted expansion occurs within a word, the expansion of the first parameter is joined with the beginning part of the original word, and the expansion of the last parameter is joined with the last part of the original word. When there are no positional parameters, "$@" and $@ expand to nothing (i.e., they are removed).
# Expands to the number of positional parameters in decimal.
? Expands to the exit status of the most recently executed foreground pipeline.
- Expands to the current option flags as specified upon invocation, by the set builtin command, or those set by the shell itself (such as the -i option).
$ Expands to the process ID of the shell. In a () subshell, it expands to the process ID of the current shell, not the subshell.
! Expands to the process ID of the most recently executed background (asynchronous) command.
0 Expands to the name of the shell or shell script. This is set at shell initialization. If bash is invoked with a file of commands, $0 is set to the name of that file. If bash is started with the -c option, then $0 is set to the first argument after the string to be executed, if one is present. Otherwise, it is set to the file name used to invoke bash, as given by argument zero.
_ At shell startup, set to the absolute pathname used to invoke the shell or shell script being executed as passed in the environment or argument list. Subsequently, expands to the last argument to the previous command, after expansion. Also set to the full pathname used to invoke each command executed and placed in the environment exported to that command. When checking mail, this parameter holds the name of the mail file currently being checked.
Shell Variables
The following variables are set by the shell:
BASH Expands to the full file name used to invoke this instance of bash.
BASHOPTS
A colon-separated list of enabled shell options. Each word in the list is a valid argument for the -s option to the shopt builtin command (see SHELL BUILTIN COMMANDS below). The options appearing in BASHOPTS are those reported as on by shopt. If this variable is in the environment when bash starts up, each shell option in the list will be enabled before reading any startup files. This variable is read-only.
BASHPID
Expands to the process ID of the current bash process. This differs from $$ under certain circumstances, such as subshells that do not require bash to be re-initialized.
BASH_ALIASES
An associative array variable whose members correspond to the internal list of aliases as maintained by the alias builtin. Elements added to this array appear in the alias list; unsetting array elements cause aliases to be removed from the alias list.
BASH_ARGC
An array variable whose values are the number of parameters in each frame of the current bash execution call stack. The number of parameters to the current subroutine (shell function or script executed with . or source) is at the top of the stack. When a subroutine is executed, the number of parameters passed is pushed onto BASH_ARGC. The shell sets BASH_ARGC only when in extended debugging mode (see the description of the extdebug option to the shopt builtin below)
BASH_ARGV
An array variable containing all of the parameters in the current bash execution call stack. The final parameter of the last subroutine call is at the top of the stack; the first parameter of the initial call is at the bottom. When a subroutine is executed, the parameters supplied are pushed onto BASH_ARGV. The shell sets BASH_ARGV only when in extended debugging mode (see the description of the extdebug option to the shopt builtin below)
BASH_CMDS
An associative array variable whose members correspond to the internal hash table of commands as maintained by the hash builtin. Elements added to this array appear in the hash table; unsetting array elements cause commands to be removed from the hash table.
BASH_COMMAND
The command currently being executed or about to be executed, unless the shell is executing a command as the result of a trap, in which case it is the command executing at the time of the trap.
BASH_EXECUTION_STRING
The command argument to the -c invocation option.
BASH_LINENO
An array variable whose members are the line numbers in source files where each corresponding member of FUNCNAME was invoked. ${BASH_LINENO[$i]} is the line number in the source file (${BASH_SOURCE[$i+1]}) where ${FUNCNAME[$i]} was called (or ${BASH_LINENO[$i-1]} if referenced within another shell function). Use LINENO to obtain the current line number.
BASH_REMATCH
An array variable whose members are assigned by the =~ binary operator to the [[ conditional command. The element with index 0 is the portion of the string matching the entire regular expression. The element with index n is the portion of the string matching the nth parenthesized subexpression. This variable is read-only.
BASH_SOURCE
An array variable whose members are the source filenames where the corresponding shell function names in the FUNCNAME array variable are defined. The shell function ${FUNCNAME[$i]} is defined in the file ${BASH_SOURCE[$i]} and called from ${BASH_SOURCE[$i+1]}.
BASH_SUBSHELL
Incremented by one each time a subshell or subshell environment is spawned. The initial value is 0.
BASH_VERSINFO
A readonly array variable whose members hold version information for this instance of bash. The values assigned to the array members are as follows:
BASH_VERSINFO[0] The major version number (the release).
BASH_VERSINFO[1] The minor version number (the version).
BASH_VERSINFO[2] The patch level.
BASH_VERSINFO[3] The build version.
BASH_VERSINFO[4] The release status (e.g., beta1).
BASH_VERSINFO[5] The value of MACHTYPE.
BASH_VERSION
Expands to a string describing the version of this instance of bash.
COMP_CWORD
An index into ${COMP_WORDS} of the word containing the current cursor position. This variable is available only in shell functions invoked by the programmable completion facilities (see Programmable Completion below).
COMP_KEY
The key (or final key of a key sequence) used to invoke the current completion function.
COMP_LINE
The current command line. This variable is available only in shell functions and external commands invoked by the programmable completion facilities (see Programmable Completion below).
COMP_POINT
The index of the current cursor position relative to the beginning of the current command. If the current cursor position is at the end of the current command, the value of this variable is equal to ${#COMP_LINE}. This variable is available only in shell functions and external commands invoked by the programmable completion facilities (see Programmable Completion below).
COMP_TYPE
Set to an integer value corresponding to the type of completion attempted that caused a completion function to be called: TAB, for normal completion, ?, for listing completions after successive tabs, !, for listing alternatives on partial word completion, @, to list completions if the word is not unmodified, or %, for menu completion. This variable is available only in shell functions and external commands invoked by the programmable completion facilities (see Programmable Completion below).
COMP_WORDBREAKS
The set of characters that the readline library treats as word separators when performing word completion. If COMP_WORDBREAKS is unset, it loses its special properties, even if it is subsequently reset.
COMP_WORDS
An array variable (see Arrays below) consisting of the individual words in the current command line. The line is split into words as readline would split it, using COMP_WORDBREAKS as described above. This variable is available only in shell functions invoked by the programmable completion facilities (see Programmable Completion below).
COPROC An array variable (see Arrays below) created to hold the file descriptors for output from and input to an unnamed coprocess (see Coprocesses above).
DIRSTACK
An array variable (see Arrays below) containing the current contents of the directory stack. Directories appear in the stack in the order they are displayed by the dirs builtin. Assigning to members of this array variable may be used to modify directories already in the stack, but the pushd and popd builtins must be used to add and remove directories. Assignment to this variable will not change the current directory. If DIRSTACK is unset, it loses its special properties, even if it is subsequently reset.
EUID Expands to the effective user ID of the current user, initialized at shell startup. This variable is readonly.
FUNCNAME
An array variable containing the names of all shell functions currently in the execution call stack. The element with index 0 is the name of any currently-executing shell function. The bottom-most element (the one with the highest index) is "main". This variable exists only when a shell function is executing. Assignments to FUNCNAME have no effect and return an error status. If FUNCNAME is unset, it loses its special properties, even if it is subsequently reset.
This variable can be used with BASH_LINENO and BASH_SOURCE. Each element of FUNCNAME has corresponding elements in BASH_LINENO and BASH_SOURCE to describe the call stack. For instance, ${FUNCNAME[$i]} was called from the file ${BASH_SOURCE[$i+1]} at line number ${BASH_LINENO[$i]}. The caller builtin displays the current call stack using this information.
GROUPS An array variable containing the list of groups of which the current user is a member. Assignments to GROUPS have no effect and return an error status. If GROUPS is unset, it loses its special properties, even if it is subsequently reset.
HISTCMD
The history number, or index in the history list, of the current command. If HISTCMD is unset, it loses its special properties, even if it is subsequently reset.
HOSTNAME
Automatically set to the name of the current host.
HOSTTYPE
Automatically set to a string that uniquely describes the type of machine on which bash is executing. The default is system-dependent.
LINENO Each time this parameter is referenced, the shell substitutes a decimal number representing the current sequential line number (starting with 1) within a script or function. When not in a script or function, the value substituted is not guaranteed to be meaningful. If LINENO is unset, it loses its special properties, even if it is subsequently reset.
MACHTYPE
Automatically set to a string that fully describes the system type on which bash is executing, in the standard GNU cpu-company-system format. The default is system-dependent.
MAPFILE
An array variable (see Arrays below) created to hold the text read by the mapfile builtin when no variable name is supplied.
OLDPWD The previous working directory as set by the cd command.
OPTARG The value of the last option argument processed by the getopts builtin command (see SHELL BUILTIN COMMANDS below).
OPTIND The index of the next argument to be processed by the getopts builtin command (see SHELL BUILTIN COMMANDS below).
OSTYPE Automatically set to a string that describes the operating system on which bash is executing. The default is system-dependent.
PIPESTATUS
An array variable (see Arrays below) containing a list of exit status values from the processes in the most-recently-executed foreground pipeline (which may contain only a single command).
PPID The process ID of the shell’s parent. This variable is readonly.
PWD The current working directory as set by the cd command.
RANDOM Each time this parameter is referenced, a random integer between 0 and 32767 is generated. The sequence of random numbers may be initialized by assigning a value to RANDOM. If RANDOM is unset, it loses its special properties, even if it is subsequently reset.
READLINE_LINE
The contents of the readline line buffer, for use with bind -x (see SHELL BUILTIN COMMANDS below).
READLINE_POINT
The position of the insertion point in the readline line buffer, for use with bind -x (see SHELL BUILTIN COMMANDS below).
REPLY Set to the line of input read by the read builtin command when no arguments are supplied.
SECONDS
Each time this parameter is referenced, the number of seconds since shell invocation is returned. If a value is assigned to SECONDS, the value returned upon subsequent references is the number of seconds since the assignment plus the value assigned. If SECONDS is unset, it loses its special properties, even if it is subsequently reset.
SHELLOPTS
A colon-separated list of enabled shell options. Each word in the list is a valid argument for the -o option to the set builtin command (see SHELL BUILTIN COMMANDS below). The options appearing in SHELLOPTS are those reported as on by set -o. If this variable is in the environment when bash starts up, each shell option in the list will be enabled before reading any startup files. This variable is read-only.
SHLVL Incremented by one each time an instance of bash is started.
UID Expands to the user ID of the current user, initialized at shell startup. This variable is readonly.
The following variables are used by the shell. In some cases, bash assigns a default value to a variable; these cases are noted below.
BASH_ENV
If this parameter is set when bash is executing a shell script, its value is interpreted as a filename containing commands to initialize the shell, as in ~/.bashrc. The value of BASH_ENV is subjected to parameter expansion, command substitution, and arithmetic expansion before being interpreted as a file name. PATH is not used to search for the resultant file name.
BASH_XTRACEFD
If set to an integer corresponding to a valid file descriptor, bash will write the trace output generated when set -x is enabled to that file descriptor. The file descriptor is closed when BASH_XTRACEFD is unset or assigned a new value. Unsetting BASH_XTRACEFD or assigning it the empty string causes the trace output to be sent to the standard error. Note that setting BASH_XTRACEFD to 2 (the standard error file descriptor) and then unsetting it will result in the standard error being closed.
CDPATH The search path for the cd command. This is a colon-separated list of directories in which the shell looks for destination directories specified by the cd command. A sample value is ".:~:/usr".
COLUMNS
Used by the select compound command to determine the terminal width when printing selection lists. Automatically set upon receipt of a SIGWINCH.
COMPREPLY
An array variable from which bash reads the possible completions generated by a shell function invoked by the programmable completion facility (see Programmable Completion below).
EMACS If bash finds this variable in the environment when the shell starts with value t, it assumes that the shell is running in an Emacs shell buffer and disables line editing.
ENV Similar to BASH_ENV; used when the shell is invoked in POSIX mode.
FCEDIT The default editor for the fc builtin command.
FIGNORE
A colon-separated list of suffixes to ignore when performing filename completion (see READLINE below). A filename whose suffix matches one of the entries in FIGNORE is excluded from the list of matched filenames. A sample value is ".o:~". (Quoting is needed when assigning a value to this variable, which contains tildes).
FUNCNEST
If set to a numeric value greater than 0, defines a maximum function nesting level. Function invocations that exceed this nesting level will cause the current command to abort.
GLOBIGNORE
A colon-separated list of patterns defining the set of filenames to be ignored by pathname expansion. If a filename matched by a pathname expansion pattern also matches one of the patterns in GLOBIGNORE, it is removed from the list of matches.
HISTCONTROL
A colon-separated list of values controlling how commands are saved on the history list. If the list of values includes ignorespace, lines which begin with a space character are not saved in the history list. A value of ignoredups causes lines matching the previous history entry to not be saved. A value of ignoreboth is shorthand for ignorespace and ignoredups. A value of erasedups causes all previous lines matching the current line to be removed from the history list before that line is saved. Any value not in the above list is ignored. If HISTCONTROL is unset, or does not include a valid value, all lines read by the shell parser are saved on the history list, subject to the value of HISTIGNORE. The second and subsequent lines of a multi-line compound command are not tested, and are added to the history regardless of the value of HISTCONTROL.
HISTFILE
The name of the file in which command history is saved (see HISTORY below). The default value is ~/.bash_history. If unset, the command history is not saved when an interactive shell exits.
HISTFILESIZE
The maximum number of lines contained in the history file. When this variable is assigned a value, the history file is truncated, if necessary, by removing the oldest entries, to contain no more than that number of lines. The default value is 500. The history file is also truncated to this size after writing it when an interactive shell exits.
HISTIGNORE
A colon-separated list of patterns used to decide which command lines should be saved on the history list. Each pattern is anchored at the beginning of the line and must match the complete line (no implicit ‘*’ is appended). Each pattern is tested against the line after the checks specified by HISTCONTROL are applied. In addition to the normal shell pattern matching characters, ‘&’ matches the previous history line. ‘&’ may be escaped using a backslash; the backslash is removed before attempting a match. The second and subsequent lines of a multi-line compound command are not tested, and are added to the history regardless of the value of HISTIGNORE.
HISTSIZE
The number of commands to remember in the command history (see HISTORY below). The default value is 500.
HISTTIMEFORMAT
If this variable is set and not null, its value is used as a format string for strftime(3) to print the time stamp associated with each history entry displayed by the history builtin. If this variable is set, time stamps are written to the history file so they may be preserved across shell sessions. This uses the history comment character to distinguish timestamps from other history lines.
HOME The home directory of the current user; the default argument for the cd builtin command. The value of this variable is also used when performing tilde expansion.
HOSTFILE
Contains the name of a file in the same format as /etc/hosts that should be read when the shell needs to complete a hostname. The list of possible hostname completions may be changed while the shell is running; the next time hostname completion is attempted after the value is changed, bash adds the contents of the new file to the existing list. If HOSTFILE is set, but has no value, or does not name a readable file, bash attempts to read /etc/hosts to obtain the list of possible hostname completions. When HOSTFILE is unset, the hostname list is cleared.
IFS The Internal Field Separator that is used for word splitting after expansion and to split lines into words with the read builtin command. The default value is ‘‘<space><tab><newline>’’.
IGNOREEOF
Controls the action of an interactive shell on receipt of an EOF character as the sole input. If set, the value is the number of consecutive EOF characters which must be typed as the first characters on an input line before bash exits. If the variable exists but does not have a numeric value, or has no value, the default value is 10. If it does not exist, EOF signifies the end of input to the shell.
INPUTRC
The filename for the readline startup file, overriding the default of ~/.inputrc (see READLINE below).
LANG Used to determine the locale category for any category not specifically selected with a variable starting with LC_.
LC_ALL This variable overrides the value of LANG and any other LC_ variable specifying a locale category.
LC_COLLATE
This variable determines the collation order used when sorting the results of pathname expansion, and determines the behavior of range expressions, equivalence classes, and collating sequences within pathname expansion and pattern matching.
LC_CTYPE
This variable determines the interpretation of characters and the behavior of character classes within pathname expansion and pattern matching.
LC_MESSAGES
This variable determines the locale used to translate double-quoted strings preceded by a $.
LC_NUMERIC
This variable determines the locale category used for number formatting.
LINES Used by the select compound command to determine the column length for printing selection lists. Automatically set upon receipt of a SIGWINCH.
MAIL If this parameter is set to a file or directory name and the MAILPATH variable is not set, bash informs the user of the arrival of mail in the specified file or Maildir-format directory.
MAILCHECK
Specifies how often (in seconds) bash checks for mail. The default is 60 seconds. When it is time to check for mail, the shell does so before displaying the primary prompt. If this variable is unset, or set to a value that is not a number greater than or equal to zero, the shell disables mail checking.
MAILPATH
A colon-separated list of file names to be checked for mail. The message to be printed when mail arrives in a particular file may be specified by separating the file name from the message with a ‘?’. When used in the text of the message, $_ expands to the name of the current mailfile. Example:
MAILPATH= /var/mail/bfox?"You have mail":~/shell-mail?"$_ has mail!"
Bash supplies a default value for this variable, but the location of the user mail files that it uses is system dependent (e.g., /var/mail/$USER).
OPTERR If set to the value 1, bash displays error messages generated by the getopts builtin command (see SHELL BUILTIN COMMANDS below). OPTERR is initialized to 1 each time the shell is invoked or a shell script is executed.
PATH The search path for commands. It is a colon-separated list of directories in which the shell looks for commands (see COMMAND EXECUTION below). A zero-length (null) directory name in the value of PATH indicates the current directory. A null directory name may appear as two adjacent colons, or as an initial or trailing colon. The default path is system-dependent, and is set by the administrator who installs bash. A common value is /usr/gnu/bin:/usr/local/bin:/usr/ucb:/bin:/usr/bin.
POSIXLY_CORRECT
If this variable is in the environment when bash starts, the shell enters posix mode before reading the startup files, as if the --posix invocation option had been supplied. If it is set while the shell is running, bash enables posix mode, as if the command set -o posix had been executed.
PROMPT_COMMAND
If set, the value is executed as a command prior to issuing each primary prompt.
PROMPT_DIRTRIM
If set to a number greater than zero, the value is used as the number of trailing directory components to retain when expanding the \w and \W prompt string escapes (see PROMPTING below). Characters removed are replaced with an ellipsis.
PS1 The value of this parameter is expanded (see PROMPTING below) and used as the primary prompt string. The default value is ‘‘\s-\v\$ ’’.
PS2 The value of this parameter is expanded as with PS1 and used as the secondary prompt string. The default is ‘‘> ’’.
PS3 The value of this parameter is used as the prompt for the select command (see SHELL GRAMMAR above).
PS4 The value of this parameter is expanded as with PS1 and the value is printed before each command bash displays during an execution trace. The first character of PS4 is replicated multiple times, as necessary, to indicate multiple levels of indirection. The default is ‘‘+ ’’.
SHELL The full pathname to the shell is kept in this environment variable. If it is not set when the shell starts, bash assigns to it the full pathname of the current user’s login shell.
TIMEFORMAT
The value of this parameter is used as a format string specifying how the timing information for pipelines prefixed with the time reserved word should be displayed. The % character introduces an escape sequence that is expanded to a time value or other information. The escape sequences and their meanings are as follows; the braces denote optional portions.
%% A literal %.
%[p][l]R The elapsed time in seconds.
%[p][l]U The number of CPU seconds spent in user mode.
%[p][l]S The number of CPU seconds spent in system mode.
%P The CPU percentage, computed as (%U + %S) / %R.
The optional p is a digit specifying the precision, the number of fractional digits after a decimal point. A value of 0 causes no decimal point or fraction to be output. At most three places after the decimal point may be specified; values of p greater than 3 are changed to 3. If p is not specified, the value 3 is used.
The optional l specifies a longer format, including minutes, of the form MMmSS.FFs. The value of p determines whether or not the fraction is included.
If this variable is not set, bash acts as if it had the value $ \nreal\t%3lR\nuser\t%3lU\nsys %3lS . If the value is null, no timing information is displayed. A trailing newline is added when the format string is displayed.
TMOUT If set to a value greater than zero, TMOUT is treated as the default timeout for the read builtin. The select command terminates if input does not arrive after TMOUT seconds when input is coming from a terminal. In an interactive shell, the value is interpreted as the number of seconds to wait for input after issuing the primary prompt. Bash terminates after waiting for that number of seconds if input does not arrive.
TMPDIR If set, bash uses its value as the name of a directory in which bash creates temporary files for the shell’s use.
auto_resume
This variable controls how the shell interacts with the user and job control. If this variable is set, single word simple commands without redirections are treated as candidates for resumption of an existing stopped job. There is no ambiguity allowed; if there is more than one job beginning with the string typed, the job most recently accessed is selected. The name of a stopped job, in this context, is the command line used to start it. If set to the value exact, the string supplied must match the name of a stopped job exactly; if set to substring, the string supplied needs to match a substring of the name of a stopped job. The substring value provides functionality analogous to the %? job identifier (see JOB CONTROL below). If set to any other value, the supplied string must be a prefix of a stopped job’s name; this provides functionality analogous to the %string job identifier.
histchars
The two or three characters which control history expansion and tokenization (see HISTORY EXPANSION below). The first character is the history expansion character, the character which signals the start of a history expansion, normally ‘!’. The second character is the quick substitution character, which is used as shorthand for re-running the previous command entered, substituting one string for another in the command. The default is ‘^’. The optional third character is the character which indicates that the remainder of the line is a comment when found as the first character of a word, normally ‘#’. The history comment character causes history substitution to be skipped for the remaining words on the line. It does not necessarily cause the shell parser to treat the rest of the line as a comment.
Arrays
Bash provides one-dimensional indexed and associative array variables. Any variable may be used as an indexed array; the declare builtin will explicitly declare an array. There is no maximum limit on the size of an array, nor any requirement that members be indexed or assigned contiguously. Indexed arrays are referenced using integers (including arithmetic expressions) and are zero-based; associative arrays are referenced using arbitrary strings.
An indexed array is created automatically if any variable is assigned to using the syntax name[subscript]=value. The subscript is treated as an arithmetic expression that must evaluate to a number. If subscript evaluates to a number less than zero, it is used as an offset from one greater than the array’s maximum index (so a subcript of -1 refers to the last element of the array). To explicitly declare an indexed array, use declare -a name (see SHELL BUILTIN COMMANDS below). declare -a name[subscript] is also accepted; the subscript is ignored.
Associative arrays are created using declare -A name.
Attributes may be specified for an array variable using the declare and readonly builtins. Each attribute applies to all members of an array.
Arrays are assigned to using compound assignments of the form name=(value1 ... valuen), where each value is of the form [subscript]=string. Indexed array assignments do not require the bracket and subscript. When assigning to indexed arrays, if the optional brackets and subscript are supplied, that index is assigned to; otherwise the index of the element assigned is the last index assigned to by the statement plus one. Indexing starts at zero.
When assigning to an associative array, the subscript is required.
This syntax is also accepted by the declare builtin. Individual array elements may be assigned to using the name[subscript]=value syntax introduced above.
Any element of an array may be referenced using ${name[subscript]}. The braces are required to avoid conflicts with pathname expansion. If subscript is @ or *, the word expands to all members of name. These subscripts differ only when the word appears within double quotes. If the word is double-quoted, ${name[*]} expands to a single word with the value of each array member separated by the first character of the IFS special variable, and ${name[@]} expands each element of name to a separate word. When there are no array members, ${name[@]} expands to nothing. If the double-quoted expansion occurs within a word, the expansion of the first parameter is joined with the beginning part of the original word, and the expansion of the last parameter is joined with the last part of the original word. This is analogous to the expansion of the special parameters * and @ (see Special Parameters above). ${#name[subscript]} expands to the length of ${name[subscript]}. If subscript is * or @, the expansion is the number of elements in the array. Referencing an array variable without a subscript is equivalent to referencing the array with a subscript of 0.
An array variable is considered set if a subscript has been assigned a value. The null string is a valid value.
The unset builtin is used to destroy arrays. unset name[subscript] destroys the array element at index subscript. Care must be taken to avoid unwanted side effects caused by pathname expansion. unset name, where name is an array, or unset name[subscript], where subscript is * or @, removes the entire array.
The declare, local, and readonly builtins each accept a -a option to specify an indexed array and a -A option to specify an associative array. If both options are supplied, -A takes precedence. The read builtin accepts a -a option to assign a list of words read from the standard input to an array. The set and declare builtins display array values in a way that allows them to be reused as assignments.
EXPANSION
Expansion is performed on the command line after it has been split into words. There are seven kinds of expansion performed: brace expansion, tilde expansion, parameter and variable expansion, command substitution, arithmetic expansion, word splitting, and pathname expansion.
The order of expansions is: brace expansion, tilde expansion, parameter, variable and arithmetic expansion and command substitution (done in a left-to-right fashion), word splitting, and pathname expansion.
On systems that can support it, there is an additional expansion available: process substitution.
Only brace expansion, word splitting, and pathname expansion can change the number of words of the expansion; other expansions expand a single word to a single word. The only exceptions to this are the expansions of "$@" and "${name[@]}" as explained above (see PARAMETERS).
Brace Expansion
Brace expansion is a mechanism by which arbitrary strings may be generated. This mechanism is similar to pathname expansion, but the filenames generated need not exist. Patterns to be brace expanded take the form of an optional preamble, followed by either a series of comma-separated strings or a sequence expression between a pair of braces, followed by an optional postscript. The preamble is prefixed to each string contained within the braces, and the postscript is then appended to each resulting string, expanding left to right.
Brace expansions may be nested. The results of each expanded string are not sorted; left to right order is preserved. For example, a{d,c,b}e expands into ‘ade ace abe’.
A sequence expression takes the form {x..y[..incr]}, where x and y are either integers or single characters, and incr, an optional increment, is an integer. When integers are supplied, the expression expands to each number between x and y, inclusive. Supplied integers may be prefixed with 0 to force each term to have the same width. When either x or y begins with a zero, the shell attempts to force all generated terms to contain the same number of digits, zero-padding where necessary. When characters are supplied, the expression expands to each character lexicographically between x and y, inclusive. Note that both x and y must be of the same type. When the increment is supplied, it is used as the difference between each term. The default increment is 1 or -1 as appropriate.
Brace expansion is performed before any other expansions, and any characters special to other expansions are preserved in the result. It is strictly textual. Bash does not apply any syntactic interpretation to the context of the expansion or the text between the braces.
A correctly-formed brace expansion must contain unquoted opening and closing braces, and at least one unquoted comma or a valid sequence expression. Any incorrectly formed brace expansion is left unchanged. A { or , may be quoted with a backslash to prevent its being considered part of a brace expression. To avoid conflicts with parameter expansion, the string ${ is not considered eligible for brace expansion.
This construct is typically used as shorthand when the common prefix of the strings to be generated is longer than in the above example:
mkdir /usr/local/src/bash/{old,new,dist,bugs}
or
chown root /usr/{ucb/{ex,edit},lib/{ex?.?*,how_ex}}
Brace expansion introduces a slight incompatibility with historical versions of sh. sh does not treat opening or closing braces specially when they appear as part of a word, and preserves them in the output. Bash removes braces from words as a consequence of brace expansion. For example, a word entered to sh as file{1,2} appears identically in the output. The same word is output as file1 file2 after expansion by bash. If strict compatibility with sh is desired, start bash with the +B option or disable brace expansion with the +B option to the set command (see SHELL BUILTIN COMMANDS below).
Tilde Expansion
If a word begins with an unquoted tilde character (‘~’), all of the characters preceding the first unquoted slash (or all characters, if there is no unquoted slash) are considered a tilde-prefix. If none of the characters in the tilde-prefix are quoted, the characters in the tilde-prefix following the tilde are treated as a possible login name. If this login name is the null string, the tilde is replaced with the value of the shell parameter HOME. If HOME is unset, the home directory of the user executing the shell is substituted instead. Otherwise, the tilde-prefix is replaced with the home directory associated with the specified login name.
If the tilde-prefix is a ‘~+’, the value of the shell variable PWD replaces the tilde-prefix. If the tilde-prefix is a ‘~-’, the value of the shell variable OLDPWD, if it is set, is substituted. If the characters following the tilde in the tilde-prefix consist of a number N, optionally prefixed by a ‘+’ or a ‘-’, the tilde-prefix is replaced with the corresponding element from the directory stack, as it would be displayed by the dirs builtin invoked with the tilde-prefix as an argument. If the characters following the tilde in the tilde-prefix consist of a number without a leading ‘+’ or ‘-’, ‘+’ is assumed.
If the login name is invalid, or the tilde expansion fails, the word is unchanged.
Each variable assignment is checked for unquoted tilde-prefixes immediately following a : or the first =. In these cases, tilde expansion is also performed. Consequently, one may use file names with tildes in assignments to PATH, MAILPATH, and CDPATH, and the shell assigns the expanded value.
Parameter Expansion
The ‘$’ character introduces parameter expansion, command substitution, or arithmetic expansion. The parameter name or symbol to be expanded may be enclosed in braces, which are optional but serve to protect the variable to be expanded from characters immediately following it which could be interpreted as part of the name.
When braces are used, the matching ending brace is the first ‘}’ not escaped by a backslash or within a quoted string, and not within an embedded arithmetic expansion, command substitution, or parameter expansion.
${parameter}
The value of parameter is substituted. The braces are required when parameter is a positional parameter with more than one digit, or when parameter is followed by a character which is not to be interpreted as part of its name.
If the first character of parameter is an exclamation point (!), a level of variable indirection is introduced. Bash uses the value of the variable formed from the rest of parameter as the name of the variable; this variable is then expanded and that value is used in the rest of the substitution, rather than the value of parameter itself. This is known as indirect expansion. The exceptions to this are the expansions of ${!prefix*} and ${!name[@]} described below. The exclamation point must immediately follow the left brace in order to introduce indirection.
In each of the cases below, word is subject to tilde expansion, parameter expansion, command substitution, and arithmetic expansion.
When not performing substring expansion, using the forms documented below, bash tests for a parameter that is unset or null. Omitting the colon results in a test only for a parameter that is unset.
${parameter:-word}
Use Default Values. If parameter is unset or null, the expansion of word is substituted. Otherwise, the value of parameter is substituted.
${parameter:=word}
Assign Default Values. If parameter is unset or null, the expansion of word is assigned to parameter. The value of parameter is then substituted. Positional parameters and special parameters may not be assigned to in this way.
${parameter:?word}
Display Error if Null or Unset. If parameter is null or unset, the expansion of word (or a message to that effect if word is not present) is written to the standard error and the shell, if it is not interactive, exits. Otherwise, the value of parameter is substituted.
${parameter:+word}
Use Alternate Value. If parameter is null or unset, nothing is substituted, otherwise the expansion of word is substituted.
${parameter:offset}
${parameter:offset:length}
Substring Expansion. Expands to up to length characters of parameter starting at the character specified by offset. If length is omitted, expands to the substring of parameter starting at the character specified by offset. length and offset are arithmetic expressions (see ARITHMETIC EVALUATION below). If offset evaluates to a number less than zero, the value is used as an offset from the end of the value of parameter. Arithmetic expressions starting with a - must be separated by whitespace from the preceding : to be distinguished from the Use Default Values expansion. If length evaluates to a number less than zero, and parameter is not @ and not an indexed or associative array, it is interpreted as an offset from the end of the value of parameter rather than a number of characters, and the expansion is the characters between the two offsets. If parameter is @, the result is length positional parameters beginning at offset. If parameter is an indexed array name subscripted by @ or *, the result is the length members of the array beginning with ${parameter[offset]}. A negative offset is taken relative to one greater than the maximum index of the specified array. Substring expansion applied to an associative array produces undefined results. Note that a negative offset must be separated from the colon by at least one space to avoid being confused with the :- expansion. Substring indexing is zero-based unless the positional parameters are used, in which case the indexing starts at 1 by default. If offset is 0, and the positional parameters are used, $0 is prefixed to the list.
${!prefix*}
${!prefix@}
Names matching prefix. Expands to the names of variables whose names begin with prefix, separated by the first character of the IFS special variable. When @ is used and the expansion appears within double quotes, each variable name expands to a separate word.
${!name[@]}
${!name[*]}
List of array keys. If name is an array variable, expands to the list of array indices (keys) assigned in name. If name is not an array, expands to 0 if name is set and null otherwise. When @ is used and the expansion appears within double quotes, each key expands to a separate word.
${#parameter}
Parameter length. The length in characters of the value of parameter is substituted. If parameter is * or @, the value substituted is the number of positional parameters. If parameter is an array name subscripted by * or @, the value substituted is the number of elements in the array.
${parameter#word}
${parameter##word}
Remove matching prefix pattern. The word is expanded to produce a pattern just as in pathname expansion. If the pattern matches the beginning of the value of parameter, then the result of the expansion is the expanded value of parameter with the shortest matching pattern (the ‘‘#’’ case) or the longest matching pattern (the ‘‘##’’ case) deleted. If parameter is @ or *, the pattern removal operation is applied to each positional parameter in turn, and the expansion is the resultant list. If parameter is an array variable subscripted with @ or *, the pattern removal operation is applied to each member of the array in turn, and the expansion is the resultant list.
${parameter%word}
${parameter%%word}
Remove matching suffix pattern. The word is expanded to produce a pattern just as in pathname expansion. If the pattern matches a trailing portion of the expanded value of parameter, then the result of the expansion is the expanded value of parameter with the shortest matching pattern (the ‘‘%’’ case) or the longest matching pattern (the ‘‘%%’’ case) deleted. If parameter is @ or *, the pattern removal operation is applied to each positional parameter in turn, and the expansion is the resultant list. If parameter is an array variable subscripted with @ or *, the pattern removal operation is applied to each member of the array in turn, and the expansion is the resultant list.
${parameter/pattern/string}
Pattern substitution. The pattern is expanded to produce a pattern just as in pathname expansion. Parameter is expanded and the longest match of pattern against its value is replaced with string. If pattern begins with /, all matches of pattern are replaced with string. Normally only the first match is replaced. If pattern begins with #, it must match at the beginning of the expanded value of parameter. If pattern begins with %, it must match at the end of the expanded value of parameter. If string is null, matches of pattern are deleted and the / following pattern may be omitted. If parameter is @ or *, the substitution operation is applied to each positional parameter in turn, and the expansion is the resultant list. If parameter is an array variable subscripted with @ or *, the substitution operation is applied to each member of the array in turn, and the expansion is the resultant list.
${parameter^pattern}
${parameter^^pattern}
${parameter,pattern}
${parameter,,pattern}
Case modification. This expansion modifies the case of alphabetic characters in parameter. The pattern is expanded to produce a pattern just as in pathname expansion. The ^ operator converts lowercase letters matching pattern to uppercase; the , operator converts matching uppercase letters to lowercase. The ^^ and ,, expansions convert each matched character in the expanded value; the ^ and , expansions match and convert only the first character in the expanded value. If pattern is omitted, it is treated like a ?, which matches every character. If parameter is @ or *, the case modification operation is applied to each positional parameter in turn, and the expansion is the resultant list. If parameter is an array variable subscripted with @ or *, the case modification operation is applied to each member of the array in turn, and the expansion is the resultant list.
Command Substitution
Command substitution allows the output of a command to replace the command name. There are two forms:
$(command)
or
`command`
Bash performs the expansion by executing command and replacing the command substitution with the standard output of the command, with any trailing newlines deleted. Embedded newlines are not deleted, but they may be removed during word splitting. The command substitution $(cat file) can be replaced by the equivalent but faster $(< file).
When the old-style backquote form of substitution is used, backslash retains its literal meaning except when followed by $, `, or \. The first backquote not preceded by a backslash terminates the command substitution. When using the $(command) form, all characters between the parentheses make up the command; none are treated specially.
Command substitutions may be nested. To nest when using the backquoted form, escape the inner backquotes with backslashes.
If the substitution appears within double quotes, word splitting and pathname expansion are not performed on the results.
Arithmetic Expansion
Arithmetic expansion allows the evaluation of an arithmetic expression and the substitution of the result. The format for arithmetic expansion is:
$((expression))
The old format $[expression] is deprecated and will be removed in upcoming versions of bash.
The expression is treated as if it were within double quotes, but a double quote inside the parentheses is not treated specially. All tokens in the expression undergo parameter expansion, string expansion, command substitution, and quote removal. Arithmetic expansions may be nested.
The evaluation is performed according to the rules listed below under ARITHMETIC EVALUATION. If expression is invalid, bash prints a message indicating failure and no substitution occurs.
Process Substitution
Process substitution is supported on systems that support named pipes (FIFOs) or the /dev/fd method of naming open files. It takes the form of <(list) or >(list). The process list is run with its input or output connected to a FIFO or some file in /dev/fd. The name of this file is passed as an argument to the current command as the result of the expansion. If the >(list) form is used, writing to the file will provide input for list. If the <(list) form is used, the file passed as an argument should be read to obtain the output of list.
When available, process substitution is performed simultaneously with parameter and variable expansion, command substitution, and arithmetic expansion.
Word Splitting
The shell scans the results of parameter expansion, command substitution, and arithmetic expansion that did not occur within double quotes for word splitting.
The shell treats each character of IFS as a delimiter, and splits the results of the other expansions into words on these characters. If IFS is unset, or its value is exactly <space><tab><newline>, the default, then sequences of <space>, <tab>, and <newline> at the beginning and end of the results of the previous expansions are ignored, and any sequence of IFS characters not at the beginning or end serves to delimit words. If IFS has a value other than the default, then sequences of the whitespace characters space and tab are ignored at the beginning and end of the word, as long as the whitespace character is in the value of IFS (an IFS whitespace character). Any character in IFS that is not IFS whitespace, along with any adjacent IFS whitespace characters, delimits a field. A sequence of IFS whitespace characters is also treated as a delimiter. If the value of IFS is null, no word splitting occurs.
Explicit null arguments ("" or ) are retained. Unquoted implicit null arguments, resulting from the expansion of parameters that have no values, are removed. If a parameter with no value is expanded within double quotes, a null argument results and is retained.
Note that if no expansion occurs, no splitting is performed.
Pathname Expansion
After word splitting, unless the -f option has been set, bash scans each word for the characters *, ?, and [. If one of these characters appears, then the word is regarded as a pattern, and replaced with an alphabetically sorted list of file names matching the pattern. If no matching file names are found, and the shell option nullglob is not enabled, the word is left unchanged. If the nullglob option is set, and no matches are found, the word is removed. If the failglob shell option is set, and no matches are found, an error message is printed and the command is not executed. If the shell option nocaseglob is enabled, the match is performed without regard to the case of alphabetic characters. Note that when using range expressions like [a-z] (see below), letters of the other case may be included, depending on the setting of LC_COLLATE. When a pattern is used for pathname expansion, the character ‘‘.’’ at the start of a name or immediately following a slash must be matched explicitly, unless the shell option dotglob is set. When matching a pathname, the slash character must always be matched explicitly. In other cases, the ‘‘.’’ character is not treated specially. See the description of shopt below under SHELL BUILTIN COMMANDS for a description of the nocaseglob, nullglob, failglob, and dotglob shell options.
The GLOBIGNORE shell variable may be used to restrict the set of file names matching a pattern. If GLOBIGNORE is set, each matching file name that also matches one of the patterns in GLOBIGNORE is removed from the list of matches. The file names ‘‘.’’ and ‘‘..’’ are always ignored when GLOBIGNORE is set and not null. However, setting GLOBIGNORE to a non-null value has the effect of enabling the dotglob shell option, so all other file names beginning with a ‘‘.’’ will match. To get the old behavior of ignoring file names beginning with a ‘‘.’’, make ‘‘.*’’ one of the patterns in GLOBIGNORE. The dotglob option is disabled when GLOBIGNORE is unset.
Pattern Matching
Any character that appears in a pattern, other than the special pattern characters described below, matches itself. The NUL character may not occur in a pattern. A backslash escapes the following character; the escaping backslash is discarded when matching. The special pattern characters must be quoted if they are to be matched literally.
The special pattern characters have the following meanings:
* Matches any string, including the null string. When the globstar shell option is enabled, and * is used in a pathname expansion context, two adjacent *s used as a single pattern will match all files and zero or more directories and subdirectories. If followed by a /, two adjacent *s will match only directories and subdirectories.
? Matches any single character.
[...] Matches any one of the enclosed characters. A pair of characters separated by a hyphen denotes a range expression; any character that sorts between those two characters, inclusive, using the current locale’s collating sequence and character set, is matched. If the first character following the [ is a ! or a ^ then any character not enclosed is matched. The sorting order of characters in range expressions is determined by the current locale and the value of the LC_COLLATE shell variable, if set. A - may be matched by including it as the first or last character in the set. A ] may be matched by including it as the first character in the set.
Within [ and ], character classes can be specified using the syntax [:class:], where class is one of the following classes defined in the POSIX standard:
alnum alpha ascii blank cntrl digit graph lower print punct space upper word xdigit
A character class matches any character belonging to that class. The word character class matches letters, digits, and the character _.
Within [ and ], an equivalence class can be specified using the syntax [=c=], which matches all characters with the same collation weight (as defined by the current locale) as the character c.
Within [ and ], the syntax [.symbol.] matches the collating symbol symbol.
If the extglob shell option is enabled using the shopt builtin, several extended pattern matching operators are recognized. In the following description, a pattern-list is a list of one or more patterns separated by a |. Composite patterns may be formed using one or more of the following sub-patterns:
?(pattern-list)
Matches zero or one occurrence of the given patterns
*(pattern-list)
Matches zero or more occurrences of the given patterns
+(pattern-list)
Matches one or more occurrences of the given patterns
@(pattern-list)
Matches one of the given patterns
!(pattern-list)
Matches anything except one of the given patterns
Quote Removal
After the preceding expansions, all unquoted occurrences of the characters \, , and " that did not result from one of the above expansions are removed.
REDIRECTION
Before a command is executed, its input and output may be redirected using a special notation interpreted by the shell. Redirection may also be used to open and close files for the current shell execution environment. The following redirection operators may precede or appear anywhere within a simple command or may follow a command. Redirections are processed in the order they appear, from left to right.
Each redirection that may be preceded by a file descriptor number may instead be preceded by a word of the form {varname}. In this case, for each redirection operator except >&- and <&-, the shell will allocate a file descriptor greater than 10 and assign it to varname. If >&- or <&- is preceded by {varname}, the value of varname defines the file descriptor to close.
In the following descriptions, if the file descriptor number is omitted, and the first character of the redirection operator is <, the redirection refers to the standard input (file descriptor 0). If the first character of the redirection operator is >, the redirection refers to the standard output (file descriptor 1).
The word following the redirection operator in the following descriptions, unless otherwise noted, is subjected to brace expansion, tilde expansion, parameter expansion, command substitution, arithmetic expansion, quote removal, pathname expansion, and word splitting. If it expands to more than one word, bash reports an error.
Note that the order of redirections is significant. For example, the command
ls > dirlist 2>&1
directs both standard output and standard error to the file dirlist, while the command
ls 2>&1 > dirlist
directs only the standard output to file dirlist, because the standard error was duplicated from the standard output before the standard output was redirected to dirlist.
Bash handles several filenames specially when they are used in redirections, as described in the following table:
/dev/fd/fd
If fd is a valid integer, file descriptor fd is duplicated.
/dev/stdin
File descriptor 0 is duplicated.
/dev/stdout
File descriptor 1 is duplicated.
/dev/stderr
File descriptor 2 is duplicated.
/dev/tcp/host/port
If host is a valid hostname or Internet address, and port is an integer port number or service name, bash attempts to open a TCP connection to the corresponding socket.
/dev/udp/host/port
If host is a valid hostname or Internet address, and port is an integer port number or service name, bash attempts to open a UDP connection to the corresponding socket.
A failure to open or create a file causes the redirection to fail.
Redirections using file descriptors greater than 9 should be used with care, as they may conflict with file descriptors the shell uses internally.
Note that the exec builtin command can make redirections take effect in the current shell.
Redirecting Input
Redirection of input causes the file whose name results from the expansion of word to be opened for reading on file descriptor n, or the standard input (file descriptor 0) if n is not specified.
The general format for redirecting input is:
[n]<word
Redirecting Output
Redirection of output causes the file whose name results from the expansion of word to be opened for writing on file descriptor n, or the standard output (file descriptor 1) if n is not specified. If the file does not exist it is created; if it does exist it is truncated to zero size.
The general format for redirecting output is:
[n]>word
If the redirection operator is >, and the noclobber option to the set builtin has been enabled, the redirection will fail if the file whose name results from the expansion of word exists and is a regular file. If the redirection operator is >|, or the redirection operator is > and the noclobber option to the set builtin command is not enabled, the redirection is attempted even if the file named by word exists.
Appending Redirected Output
Redirection of output in this fashion causes the file whose name results from the expansion of word to be opened for appending on file descriptor n, or the standard output (file descriptor 1) if n is not specified. If the file does not exist it is created.
The general format for appending output is:
[n]>>word
Redirecting Standard Output and Standard Error
This construct allows both the standard output (file descriptor 1) and the standard error output (file descriptor 2) to be redirected to the file whose name is the expansion of word.
There are two formats for redirecting standard output and standard error:
&>word
and
>&word
Of the two forms, the first is preferred. This is semantically equivalent to
>word 2>&1
Appending Standard Output and Standard Error
This construct allows both the standard output (file descriptor 1) and the standard error output (file descriptor 2) to be appended to the file whose name is the expansion of word.
The format for appending standard output and standard error is:
&>>word
This is semantically equivalent to
>>word 2>&1
Here Documents
This type of redirection instructs the shell to read input from the current source until a line containing only delimiter (with no trailing blanks) is seen. All of the lines read up to that point are then used as the standard input for a command.
The format of here-documents is:
<<[-]word
here-document
delimiter
No parameter expansion, command substitution, arithmetic expansion, or pathname expansion is performed on word. If any characters in word are quoted, the delimiter is the result of quote removal on word, and the lines in the here-document are not expanded. If word is unquoted, all lines of the here-document are subjected to parameter expansion, command substitution, and arithmetic expansion. In the latter case, the character sequence \<newline> is ignored, and \ must be used to quote the characters \, $, and `.
If the redirection operator is <<-, then all leading tab characters are stripped from input lines and the line containing delimiter. This allows here-documents within shell scripts to be indented in a natural fashion.
Here Strings
A variant of here documents, the format is:
<<<word
The word is expanded and supplied to the command on its standard input.
Duplicating File Descriptors
The redirection operator
[n]<&word
is used to duplicate input file descriptors. If word expands to one or more digits, the file descriptor denoted by n is made to be a copy of that file descriptor. If the digits in word do not specify a file descriptor open for input, a redirection error occurs. If word evaluates to -, file descriptor n is closed. If n is not specified, the standard input (file descriptor 0) is used.
The operator
[n]>&word
is used similarly to duplicate output file descriptors. If n is not specified, the standard output (file descriptor 1) is used. If the digits in word do not specify a file descriptor open for output, a redirection error occurs. As a special case, if n is omitted, and word does not expand to one or more digits, the standard output and standard error are redirected as described previously.
Moving File Descriptors
The redirection operator
[n]<&digit-
moves the file descriptor digit to file descriptor n, or the standard input (file descriptor 0) if n is not specified. digit is closed after being duplicated to n.
Similarly, the redirection operator
[n]>&digit-
moves the file descriptor digit to file descriptor n, or the standard output (file descriptor 1) if n is not specified.
Opening File Descriptors for Reading and Writing
The redirection operator
[n]<>word
causes the file whose name is the expansion of word to be opened for both reading and writing on file descriptor n, or on file descriptor 0 if n is not specified. If the file does not exist, it is created.
ALIASES
Aliases allow a string to be substituted for a word when it is used as the first word of a simple command. The shell maintains a list of aliases that may be set and unset with the alias and unalias builtin commands (see SHELL BUILTIN COMMANDS below). The first word of each simple command, if unquoted, is checked to see if it has an alias. If so, that word is replaced by the text of the alias. The characters /, $, `, and = and any of the shell metacharacters or quoting characters listed above may not appear in an alias name. The replacement text may contain any valid shell input, including shell metacharacters. The first word of the replacement text is tested for aliases, but a word that is identical to an alias being expanded is not expanded a second time. This means that one may alias ls to ls -F, for instance, and bash does not try to recursively expand the replacement text. If the last character of the alias value is a blank, then the next command word following the alias is also checked for alias expansion.
Aliases are created and listed with the alias command, and removed with the unalias command.
There is no mechanism for using arguments in the replacement text. If arguments are needed, a shell function should be used (see FUNCTIONS below).
Aliases are not expanded when the shell is not interactive, unless the expand_aliases shell option is set using shopt (see the description of shopt under SHELL BUILTIN COMMANDS below).
The rules concerning the definition and use of aliases are somewhat confusing. Bash always reads at least one complete line of input before executing any of the commands on that line. Aliases are expanded when a command is read, not when it is executed. Therefore, an alias definition appearing on the same line as another command does not take effect until the next line of input is read. The commands following the alias definition on that line are not affected by the new alias. This behavior is also an issue when functions are executed. Aliases are expanded when a function definition is read, not when the function is executed, because a function definition is itself a compound command. As a consequence, aliases defined in a function are not available until after that function is executed. To be safe, always put alias definitions on a separate line, and do not use alias in compound commands.
For almost every purpose, aliases are superseded by shell functions.
FUNCTIONS
A shell function, defined as described above under SHELL GRAMMAR, stores a series of commands for later execution. When the name of a shell function is used as a simple command name, the list of commands associated with that function name is executed. Functions are executed in the context of the current shell; no new process is created to interpret them (contrast this with the execution of a shell script). When a function is executed, the arguments to the function become the positional parameters during its execution. The special parameter # is updated to reflect the change. Special parameter 0 is unchanged. The first element of the FUNCNAME variable is set to the name of the function while the function is executing.
All other aspects of the shell execution environment are identical between a function and its caller with these exceptions: the DEBUG and RETURN traps (see the description of the trap builtin under SHELL BUILTIN COMMANDS below) are not inherited unless the function has been given the trace attribute (see the description of the declare builtin below) or the -o functrace shell option has been enabled with the set builtin (in which case all functions inherit the DEBUG and RETURN traps), and the ERR trap is not inherited unless the -o errtrace shell option has been enabled.
Variables local to the function may be declared with the local builtin command. Ordinarily, variables and their values are shared between the function and its caller.
The FUNCNEST variable, if set to a numeric value greater than 0, defines a maximum function nesting level. Function invocations that exceed the limit cause the entire command to abort.
If the builtin command return is executed in a function, the function completes and execution resumes with the next command after the function call. Any command associated with the RETURN trap is executed before execution resumes. When a function completes, the values of the positional parameters and the special parameter # are restored to the values they had prior to the function’s execution.
Function names and definitions may be listed with the -f option to the declare or typeset builtin commands. The -F option to declare or typeset will list the function names only (and optionally the source file and line number, if the extdebug shell option is enabled). Functions may be exported so that subshells automatically have them defined with the -f option to the export builtin. A function definition may be deleted using the -f option to the unset builtin. Note that shell functions and variables with the same name may result in multiple identically-named entries in the environment passed to the shell’s children. Care should be taken in cases where this may cause a problem.
Functions may be recursive. The FUNCNEST variable may be used to limit the depth of the function call stack and restrict the number of function invocations. By default, no limit is imposed on the number of recursive calls.
ARITHMETIC EVALUATION
The shell allows arithmetic expressions to be evaluated, under certain circumstances (see the let and declare builtin commands and Arithmetic Expansion). Evaluation is done in fixed-width integers with no check for overflow, though division by 0 is trapped and flagged as an error. The operators and their precedence, associativity, and values are the same as in the C language. The following list of operators is grouped into levels of equal-precedence operators. The levels are listed in order of decreasing precedence.
id++ id--
variable post-increment and post-decrement
++id --id
variable pre-increment and pre-decrement
- + unary minus and plus
! ~ logical and bitwise negation
** exponentiation
* / % multiplication, division, remainder
+ - addition, subtraction
<< >> left and right bitwise shifts
<= >= < >
comparison
== != equality and inequality
& bitwise AND
^ bitwise exclusive OR
| bitwise OR
&& logical AND
|| logical OR
expr?expr:expr
conditional operator
= *= /= %= += -= <<= >>= &= ^= |=
assignment
expr1 , expr2
comma
Shell variables are allowed as operands; parameter expansion is performed before the expression is evaluated. Within an expression, shell variables may also be referenced by name without using the parameter expansion syntax. A shell variable that is null or unset evaluates to 0 when referenced by name without using the parameter expansion syntax. The value of a variable is evaluated as an arithmetic expression when it is referenced, or when a variable which has been given the integer attribute using declare -i is assigned a value. A null value evaluates to 0. A shell variable need not have its integer attribute turned on to be used in an expression.
Constants with a leading 0 are interpreted as octal numbers. A leading 0x or 0X denotes hexadecimal. Otherwise, numbers take the form [base#]n, where the optional base is a decimal number between 2 and 64 representing the arithmetic base, and n is a number in that base. If base# is omitted, then base 10 is used. The digits greater than 9 are represented by the lowercase letters, the uppercase letters, @, and _, in that order. If base is less than or equal to 36, lowercase and uppercase letters may be used interchangeably to represent numbers between 10 and 35.
Operators are evaluated in order of precedence. Sub-expressions in parentheses are evaluated first and may override the precedence rules above.
CONDITIONAL EXPRESSIONS
Conditional expressions are used by the [[ compound command and the test and [ builtin commands to test file attributes and perform string and arithmetic comparisons. Expressions are formed from the following unary or binary primaries. If any file argument to one of the primaries is of the form /dev/fd/n, then file descriptor n is checked. If the file argument to one of the primaries is one of /dev/stdin, /dev/stdout, or /dev/stderr, file descriptor 0, 1, or 2, respectively, is checked.
Unless otherwise specified, primaries that operate on files follow symbolic links and operate on the target of the link, rather than the link itself.
When used with [[, the < and > operators sort lexicographically using the current locale. The test command sorts using ASCII ordering.
-a file True if file exists.
-b file True if file exists and is a block special file.
-c file True if file exists and is a character special file.
-d file True if file exists and is a directory.
-e file True if file exists.
-f file True if file exists and is a regular file.
-g file True if file exists and is set-group-id.
-h file True if file exists and is a symbolic link.
-k file True if file exists and its ‘‘sticky’’ bit is set.
-p file True if file exists and is a named pipe (FIFO).
-r file True if file exists and is readable.
-s file True if file exists and has a size greater than zero.
-t fd True if file descriptor fd is open and refers to a terminal.
-u file True if file exists and its set-user-id bit is set.
-w file True if file exists and is writable.
-x file True if file exists and is executable.
-G file True if file exists and is owned by the effective group id.
-L file True if file exists and is a symbolic link.
-N file True if file exists and has been modified since it was last read.
-O file True if file exists and is owned by the effective user id.
-S file True if file exists and is a socket.
file1 -ef file2
True if file1 and file2 refer to the same device and inode numbers.
file1 -nt file2
True if file1 is newer (according to modification date) than file2, or if file1 exists and file2 does not.
file1 -ot file2
True if file1 is older than file2, or if file2 exists and file1 does not.
-o optname
True if the shell option optname is enabled. See the list of options under the description of the -o option to the set builtin below.
-v varname
True if the shell variable varname is set (has been assigned a value).
-z string
True if the length of string is zero.
string
-n string
True if the length of string is non-zero.
string1 == string2
string1 = string2
True if the strings are equal. = should be used with the test command for POSIX conformance.
string1 != string2
True if the strings are not equal.
string1 < string2
True if string1 sorts before string2 lexicographically.
string1 > string2
True if string1 sorts after string2 lexicographically.
arg1 OP arg2
OP is one of -eq, -ne, -lt, -le, -gt, or -ge. These arithmetic binary operators return true if arg1 is equal to, not equal to, less than, less than or equal to, greater than, or greater than or equal to arg2, respectively. Arg1 and arg2 may be positive or negative integers.
SIMPLE COMMAND EXPANSION
When a simple command is executed, the shell performs the following expansions, assignments, and redirections, from left to right.
1. The words that the parser has marked as variable assignments (those preceding the command name) and redirections are saved for later processing.
2. The words that are not variable assignments or redirections are expanded. If any words remain after expansion, the first word is taken to be the name of the command and the remaining words are the arguments.
3. Redirections are performed as described above under REDIRECTION.
4. The text after the = in each variable assignment undergoes tilde expansion, parameter expansion, command substitution, arithmetic expansion, and quote removal before being assigned to the variable.
If no command name results, the variable assignments affect the current shell environment. Otherwise, the variables are added to the environment of the executed command and do not affect the current shell environment. If any of the assignments attempts to assign a value to a readonly variable, an error occurs, and the command exits with a non-zero status.
If no command name results, redirections are performed, but do not affect the current shell environment. A redirection error causes the command to exit with a non-zero status.
If there is a command name left after expansion, execution proceeds as described below. Otherwise, the command exits. If one of the expansions contained a command substitution, the exit status of the command is the exit status of the last command substitution performed. If there were no command substitutions, the command exits with a status of zero.
COMMAND EXECUTION
After a command has been split into words, if it results in a simple command and an optional list of arguments, the following actions are taken.
If the command name contains no slashes, the shell attempts to locate it. If there exists a shell function by that name, that function is invoked as described above in FUNCTIONS. If the name does not match a function, the shell searches for it in the list of shell builtins. If a match is found, that builtin is invoked.
If the name is neither a shell function nor a builtin, and contains no slashes, bash searches each element of the PATH for a directory containing an executable file by that name. Bash uses a hash table to remember the full pathnames of executable files (see hash under SHELL BUILTIN COMMANDS below). A full search of the directories in PATH is performed only if the command is not found in the hash table. If the search is unsuccessful, the shell searches for a defined shell function named command_not_found_handle. If that function exists, it is invoked with the original command and the original command’s arguments as its arguments, and the function’s exit status becomes the exit status of the shell. If that function is not defined, the shell prints an error message and returns an exit status of 127.
If the search is successful, or if the command name contains one or more slashes, the shell executes the named program in a separate execution environment. Argument 0 is set to the name given, and the remaining arguments to the command are set to the arguments given, if any.
If this execution fails because the file is not in executable format, and the file is not a directory, it is assumed to be a shell script, a file containing shell commands. A subshell is spawned to execute it. This subshell reinitializes itself, so that the effect is as if a new shell had been invoked to handle the script, with the exception that the locations of commands remembered by the parent (see hash below under SHELL BUILTIN COMMANDS) are retained by the child.
If the program is a file beginning with #!, the remainder of the first line specifies an interpreter for the program. The shell executes the specified interpreter on operating systems that do not handle this executable format themselves. The arguments to the interpreter consist of a single optional argument following the interpreter name on the first line of the program, followed by the name of the program, followed by the command arguments, if any.
COMMAND EXECUTION ENVIRONMENT
The shell has an execution environment, which consists of the following:
o open files inherited by the shell at invocation, as modified by redirections supplied to the exec builtin
o the current working directory as set by cd, pushd, or popd, or inherited by the shell at invocation
o the file creation mode mask as set by umask or inherited from the shell’s parent
o current traps set by trap
o shell parameters that are set by variable assignment or with set or inherited from the shell’s parent in the environment
o shell functions defined during execution or inherited from the shell’s parent in the environment
o options enabled at invocation (either by default or with command-line arguments) or by set
o options enabled by shopt
o shell aliases defined with alias
o various process IDs, including those of background jobs, the value of $$, and the value of PPID
When a simple command other than a builtin or shell function is to be executed, it is invoked in a separate execution environment that consists of the following. Unless otherwise noted, the values are inherited from the shell.
o the shell’s open files, plus any modifications and additions specified by redirections to the command
o the current working directory
o the file creation mode mask
o shell variables and functions marked for export, along with variables exported for the command, passed in the environment
o traps caught by the shell are reset to the values inherited from the shell’s parent, and traps ignored by the shell are ignored
A command invoked in this separate environment cannot affect the shell’s execution environment.
Command substitution, commands grouped with parentheses, and asynchronous commands are invoked in a subshell environment that is a duplicate of the shell environment, except that traps caught by the shell are reset to the values that the shell inherited from its parent at invocation. Builtin commands that are invoked as part of a pipeline are also executed in a subshell environment. Changes made to the subshell environment cannot affect the shell’s execution environment.
Subshells spawned to execute command substitutions inherit the value of the -e option from the parent shell. When not in posix mode, bash clears the -e option in such subshells.
If a command is followed by a & and job control is not active, the default standard input for the command is the empty file /dev/null. Otherwise, the invoked command inherits the file descriptors of the calling shell as modified by redirections.
ENVIRONMENT
When a program is invoked it is given an array of strings called the environment. This is a list of name-value pairs, of the form name=value.
The shell provides several ways to manipulate the environment. On invocation, the shell scans its own environment and creates a parameter for each name found, automatically marking it for export to child processes. Executed commands inherit the environment. The export and declare -x commands allow parameters and functions to be added to and deleted from the environment. If the value of a parameter in the environment is modified, the new value becomes part of the environment, replacing the old. The environment inherited by any executed command consists of the shell’s initial environment, whose values may be modified in the shell, less any pairs removed by the unset command, plus any additions via the export and declare -x commands.
The environment for any simple command or function may be augmented temporarily by prefixing it with parameter assignments, as described above in PARAMETERS. These assignment statements affect only the environment seen by that command.
If the -k option is set (see the set builtin command below), then all parameter assignments are placed in the environment for a command, not just those that precede the command name.
When bash invokes an external command, the variable _ is set to the full file name of the command and passed to that command in its environment.
EXIT STATUS
The exit status of an executed command is the value returned by the waitpid system call or equivalent function. Exit statuses fall between 0 and 255, though, as explained below, the shell may use values above 125 specially. Exit statuses from shell builtins and compound commands are also limited to this range. Under certain circumstances, the shell will use special values to indicate specific failure modes.
For the shell’s purposes, a command which exits with a zero exit status has succeeded. An exit status of zero indicates success. A non-zero exit status indicates failure. When a command terminates on a fatal signal N, bash uses the value of 128+N as the exit status.
If a command is not found, the child process created to execute it returns a status of 127. If a command is found but is not executable, the return status is 126.
If a command fails because of an error during expansion or redirection, the exit status is greater than zero.
Shell builtin commands return a status of 0 (true) if successful, and non-zero (false) if an error occurs while they execute. All builtins return an exit status of 2 to indicate incorrect usage.
Bash itself returns the exit status of the last command executed, unless a syntax error occurs, in which case it exits with a non-zero value. See also the exit builtin command below.
SIGNALS
When bash is interactive, in the absence of any traps, it ignores SIGTERM (so that kill 0 does not kill an interactive shell), and SIGINT is caught and handled (so that the wait builtin is interruptible). In all cases, bash ignores SIGQUIT. If job control is in effect, bash ignores SIGTTIN, SIGTTOU, and SIGTSTP.
Non-builtin commands run by bash have signal handlers set to the values inherited by the shell from its parent. When job control is not in effect, asynchronous commands ignore SIGINT and SIGQUIT in addition to these inherited handlers. Commands run as a result of command substitution ignore the keyboard-generated job control signals SIGTTIN, SIGTTOU, and SIGTSTP.
The shell exits by default upon receipt of a SIGHUP. Before exiting, an interactive shell resends the SIGHUP to all jobs, running or stopped. Stopped jobs are sent SIGCONT to ensure that they receive the SIGHUP. To prevent the shell from sending the signal to a particular job, it should be removed from the jobs table with the disown builtin (see SHELL BUILTIN COMMANDS below) or marked to not receive SIGHUP using disown -h.
If the huponexit shell option has been set with shopt, bash sends a SIGHUP to all jobs when an interactive login shell exits.
If bash is waiting for a command to complete and receives a signal for which a trap has been set, the trap will not be executed until the command completes. When bash is waiting for an asynchronous command via the wait builtin, the reception of a signal for which a trap has been set will cause the wait builtin to return immediately with an exit status greater than 128, immediately after which the trap is executed.
JOB CONTROL
Job control refers to the ability to selectively stop (suspend) the execution of processes and continue (resume) their execution at a later point. A user typically employs this facility via an interactive interface supplied jointly by the operating system kernel’s terminal driver and bash.
The shell associates a job with each pipeline. It keeps a table of currently executing jobs, which may be listed with the jobs command. When bash starts a job asynchronously (in the background), it prints a line that looks like:
[1] 25647
indicating that this job is job number 1 and that the process ID of the last process in the pipeline associated with this job is 25647. All of the processes in a single pipeline are members of the same job. Bash uses the job abstraction as the basis for job control.
To facilitate the implementation of the user interface to job control, the operating system maintains the notion of a current terminal process group ID. Members of this process group (processes whose process group ID is equal to the current terminal process group ID) receive keyboard-generated signals such as SIGINT. These processes are said to be in the foreground. Background processes are those whose process group ID differs from the terminal’s; such processes are immune to keyboard-generated signals. Only foreground processes are allowed to read from or, if the user so specifies with stty tostop, write to the terminal. Background processes which attempt to read from (write to when stty tostop is in effect) the terminal are sent a SIGTTIN (SIGTTOU) signal by the kernel’s terminal driver, which, unless caught, suspends the process.
If the operating system on which bash is running supports job control, bash contains facilities to use it. Typing the suspend character (typically ^Z, Control-Z) while a process is running causes that process to be stopped and returns control to bash. Typing the delayed suspend character (typically ^Y, Control-Y) causes the process to be stopped when it attempts to read input from the terminal, and control to be returned to bash. The user may then manipulate the state of this job, using the bg command to continue it in the background, the fg command to continue it in the foreground, or the kill command to kill it. A ^Z takes effect immediately, and has the additional side effect of causing pending output and typeahead to be discarded.
There are a number of ways to refer to a job in the shell. The character % introduces a job specification (jobspec). Job number n may be referred to as %n. A job may also be referred to using a prefix of the name used to start it, or using a substring that appears in its command line. For example, %ce refers to a stopped ce job. If a prefix matches more than one job, bash reports an error. Using %?ce, on the other hand, refers to any job containing the string ce in its command line. If the substring matches more than one job, bash reports an error. The symbols %% and %+ refer to the shell’s notion of the current job, which is the last job stopped while it was in the foreground or started in the background. The previous job may be referenced using %-. If there is only a single job, %+ and %- can both be used to refer to that job. In output pertaining to jobs (e.g., the output of the jobs command), the current job is always flagged with a +, and the previous job with a -. A single % (with no accompanying job specification) also refers to the current job.
Simply naming a job can be used to bring it into the foreground: %1 is a synonym for ‘‘fg %1’’, bringing job 1 from the background into the foreground. Similarly, ‘‘%1 &’’ resumes job 1 in the background, equivalent to ‘‘bg %1’’.
The shell learns immediately whenever a job changes state. Normally, bash waits until it is about to print a prompt before reporting changes in a job’s status so as to not interrupt any other output. If the -b option to the set builtin command is enabled, bash reports such changes immediately. Any trap on SIGCHLD is executed for each child that exits.
If an attempt to exit bash is made while jobs are stopped (or, if the checkjobs shell option has been enabled using the shopt builtin, running), the shell prints a warning message, and, if the checkjobs option is enabled, lists the jobs and their statuses. The jobs command may then be used to inspect their status. If a second attempt to exit is made without an intervening command, the shell does not print another warning, and any stopped jobs are terminated.
PROMPTING
When executing interactively, bash displays the primary prompt PS1 when it is ready to read a command, and the secondary prompt PS2 when it needs more input to complete a command. Bash allows these prompt strings to be customized by inserting a number of backslash-escaped special characters that are decoded as follows:
\a an ASCII bell character (07)
\d the date in "Weekday Month Date" format (e.g., "Tue May 26")
\D{format}
the format is passed to strftime(3) and the result is inserted into the prompt string; an empty format results in a locale-specific time representation. The braces are required
\e an ASCII escape character (033)
\h the hostname up to the first ‘.’
\H the hostname
\j the number of jobs currently managed by the shell
\l the basename of the shell’s terminal device name
\n newline
\r carriage return
\s the name of the shell, the basename of $0 (the portion following the final slash)
\t the current time in 24-hour HH:MM:SS format
\T the current time in 12-hour HH:MM:SS format
\@ the current time in 12-hour am/pm format
\A the current time in 24-hour HH:MM format
\u the username of the current user
\v the version of bash (e.g., 2.00)
\V the release of bash, version + patch level (e.g., 2.00.0)
\w the current working directory, with $HOME abbreviated with a tilde (uses the value of the PROMPT_DIRTRIM variable)
\W the basename of the current working directory, with $HOME abbreviated with a tilde
\! the history number of this command
\# the command number of this command
\$ if the effective UID is 0, a #, otherwise a $
\nnn the character corresponding to the octal number nnn
\\ a backslash
\[ begin a sequence of non-printing characters, which could be used to embed a terminal control sequence into the prompt
\] end a sequence of non-printing characters
The command number and the history number are usually different: the history number of a command is its position in the history list, which may include commands restored from the history file (see HISTORY below), while the command number is the position in the sequence of commands executed during the current shell session. After the string is decoded, it is expanded via parameter expansion, command substitution, arithmetic expansion, and quote removal, subject to the value of the promptvars shell option (see the description of the shopt command under SHELL BUILTIN COMMANDS below).
READLINE
This is the library that handles reading input when using an interactive shell, unless the --noediting option is given at shell invocation. Line editing is also used when using the -e option to the read builtin. By default, the line editing commands are similar to those of Emacs. A vi-style line editing interface is also available. Line editing can be enabled at any time using the -o emacs or -o vi options to the set builtin (see SHELL BUILTIN COMMANDS below). To turn off line editing after the shell is running, use the +o emacs or +o vi options to the set builtin.
Readline Notation
In this section, the Emacs-style notation is used to denote keystrokes. Control keys are denoted by C-key, e.g., C-n means Control-N. Similarly, meta keys are denoted by M-key, so M-x means Meta-X. (On keyboards without a meta key, M-x means ESC x, i.e., press the Escape key then the x key. This makes ESC the meta prefix. The combination M-C-x means ESC-Control-x, or press the Escape key then hold the Control key while pressing the x key.)
Readline commands may be given numeric arguments, which normally act as a repeat count. Sometimes, however, it is the sign of the argument that is significant. Passing a negative argument to a command that acts in the forward direction (e.g., kill-line) causes that command to act in a backward direction. Commands whose behavior with arguments deviates from this are noted below.
When a command is described as killing text, the text deleted is saved for possible future retrieval (yanking). The killed text is saved in a kill ring. Consecutive kills cause the text to be accumulated into one unit, which can be yanked all at once. Commands which do not kill text separate the chunks of text on the kill ring.
Readline Initialization
Readline is customized by putting commands in an initialization file (the inputrc file). The name of this file is taken from the value of the INPUTRC variable. If that variable is unset, the default is ~/.inputrc. When a program which uses the readline library starts up, the initialization file is read, and the key bindings and variables are set. There are only a few basic constructs allowed in the readline initialization file. Blank lines are ignored. Lines beginning with a # are comments. Lines beginning with a $ indicate conditional constructs. Other lines denote key bindings and variable settings.
The default key-bindings may be changed with an inputrc file. Other programs that use this library may add their own commands and bindings.
For example, placing
M-Control-u: universal-argument
or
C-Meta-u: universal-argument
into the inputrc would make M-C-u execute the readline command universal-argument.
The following symbolic character names are recognized: RUBOUT, DEL, ESC, LFD, NEWLINE, RET, RETURN, SPC, SPACE, and TAB.
In addition to command names, readline allows keys to be bound to a string that is inserted when the key is pressed (a macro).
Readline Key Bindings
The syntax for controlling key bindings in the inputrc file is simple. All that is required is the name of the command or the text of a macro and a key sequence to which it should be bound. The name may be specified in one of two ways: as a symbolic key name, possibly with Meta- or Control- prefixes, or as a key sequence.
When using the form keyname:function-name or macro, keyname is the name of a key spelled out in English. For example:
Control-u: universal-argument
Meta-Rubout: backward-kill-word
Control-o: "> output"
In the above example, C-u is bound to the function universal-argument, M-DEL is bound to the function backward-kill-word, and C-o is bound to run the macro expressed on the right hand side (that is, to insert the text > output into the line).
In the second form, "keyseq":function-name or macro, keyseq differs from keyname above in that strings denoting an entire key sequence may be specified by placing the sequence within double quotes. Some GNU Emacs style key escapes can be used, as in the following example, but the symbolic character names are not recognized.
"\C-u": universal-argument
"\C-x\C-r": re-read-init-file
"\e[11~": "Function Key 1"
In this example, C-u is again bound to the function universal-argument. C-x C-r is bound to the function re-read-init-file, and ESC [ 1 1 ~ is bound to insert the text Function Key 1.
The full set of GNU Emacs style escape sequences is
\C- control prefix
\M- meta prefix
\e an escape character
\\ backslash
\ literal "
\ literal
In addition to the GNU Emacs style escape sequences, a second set of backslash escapes is available:
\a alert (bell)
\b backspace
\d delete
\f form feed
\n newline
\r carriage return
\t horizontal tab
\v vertical tab
\nnn the eight-bit character whose value is the octal value nnn (one to three digits)
\xHH the eight-bit character whose value is the hexadecimal value HH (one or two hex digits)
When entering the text of a macro, single or double quotes must be used to indicate a macro definition. Unquoted text is assumed to be a function name. In the macro body, the backslash escapes described above are expanded. Backslash will quote any other character in the macro text, including " and .
Bash allows the current readline key bindings to be displayed or modified with the bind builtin command. The editing mode may be switched during interactive use by using the -o option to the set builtin command (see SHELL BUILTIN COMMANDS below).
Readline Variables
Readline has variables that can be used to further customize its behavior. A variable may be set in the inputrc file with a statement of the form
set variable-name value
Except where noted, readline variables can take the values On or Off (without regard to case). Unrecognized variable names are ignored. When a variable value is read, empty or null values, "on" (case-insensitive), and "1" are equivalent to On. All other values are equivalent to Off. The variables and their default values are:
bell-style (audible)
Controls what happens when readline wants to ring the terminal bell. If set to none, readline never rings the bell. If set to visible, readline uses a visible bell if one is available. If set to audible, readline attempts to ring the terminal’s bell.
bind-tty-special-chars (On)
If set to On, readline attempts to bind the control characters treated specially by the kernel’s terminal driver to their readline equivalents.
comment-begin (‘‘#’’)
The string that is inserted when the readline insert-comment command is executed. This command is bound to M-# in emacs mode and to # in vi command mode.
completion-ignore-case (Off)
If set to On, readline performs filename matching and completion in a case-insensitive fashion.
completion-prefix-display-length (0)
The length in characters of the common prefix of a list of possible completions that is displayed without modification. When set to a value greater than zero, common prefixes longer than this value are replaced with an ellipsis when displaying possible completions.
completion-query-items (100)
This determines when the user is queried about viewing the number of possible completions generated by the possible-completions command. It may be set to any integer value greater than or equal to zero. If the number of possible completions is greater than or equal to the value of this variable, the user is asked whether or not he wishes to view them; otherwise they are simply listed on the terminal.
convert-meta (On)
If set to On, readline will convert characters with the eighth bit set to an ASCII key sequence by stripping the eighth bit and prefixing an escape character (in effect, using escape as the meta prefix).
disable-completion (Off)
If set to On, readline will inhibit word completion. Completion characters will be inserted into the line as if they had been mapped to self-insert.
editing-mode (emacs)
Controls whether readline begins with a set of key bindings similar to Emacs or vi. editing-mode can be set to either emacs or vi.
echo-control-characters (On)
When set to On, on operating systems that indicate they support it, readline echoes a character corresponding to a signal generated from the keyboard.
enable-keypad (Off)
When set to On, readline will try to enable the application keypad when it is called. Some systems need this to enable the arrow keys.
enable-meta-key (On)
When set to On, readline will try to enable any meta modifier key the terminal claims to support when it is called. On many terminals, the meta key is used to send eight-bit characters.
expand-tilde (Off)
If set to On, tilde expansion is performed when readline attempts word completion.
history-preserve-point (Off)
If set to On, the history code attempts to place point at the same location on each history line retrieved with previous-history or next-history.
history-size (0)
Set the maximum number of history entries saved in the history list. If set to zero, the number of entries in the history list is not limited.
horizontal-scroll-mode (Off)
When set to On, makes readline use a single line for display, scrolling the input horizontally on a single screen line when it becomes longer than the screen width rather than wrapping to a new line.
input-meta (Off)
If set to On, readline will enable eight-bit input (that is, it will not strip the high bit from the characters it reads), regardless of what the terminal claims it can support. The name meta-flag is a synonym for this variable.
isearch-terminators (‘‘C-[C-J’’)
The string of characters that should terminate an incremental search without subsequently executing the character as a command. If this variable has not been given a value, the characters ESC and C-J will terminate an incremental search.
keymap (emacs)
Set the current readline keymap. The set of valid keymap names is emacs, emacs-standard, emacs-meta, emacs-ctlx, vi, vi-command, and vi-insert. vi is equivalent to vi-command; emacs is equivalent to emacs-standard. The default value is emacs; the value of editing-mode also affects the default keymap.
mark-directories (On)
If set to On, completed directory names have a slash appended.
mark-modified-lines (Off)
If set to On, history lines that have been modified are displayed with a preceding asterisk (*).
mark-symlinked-directories (Off)
If set to On, completed names which are symbolic links to directories have a slash appended (subject to the value of mark-directories).
match-hidden-files (On)
This variable, when set to On, causes readline to match files whose names begin with a ‘.’ (hidden files) when performing filename completion. If set to Off, the leading ‘.’ must be supplied by the user in the filename to be completed.
menu-complete-display-prefix (Off)
If set to On, menu completion displays the common prefix of the list of possible completions (which may be empty) before cycling through the list.
output-meta (Off)
If set to On, readline will display characters with the eighth bit set directly rather than as a meta-prefixed escape sequence.
page-completions (On)
If set to On, readline uses an internal more-like pager to display a screenful of possible completions at a time.
print-completions-horizontally (Off)
If set to On, readline will display completions with matches sorted horizontally in alphabetical order, rather than down the screen.
revert-all-at-newline (Off)
If set to On, readline will undo all changes to history lines before returning when accept-line is executed. By default, history lines may be modified and retain individual undo lists across calls to readline.
show-all-if-ambiguous (Off)
This alters the default behavior of the completion functions. If set to On, words which have more than one possible completion cause the matches to be listed immediately instead of ringing the bell.
show-all-if-unmodified (Off)
This alters the default behavior of the completion functions in a fashion similar to show-all-if-ambiguous. If set to On, words which have more than one possible completion without any possible partial completion (the possible completions don’t share a common prefix) cause the matches to be listed immediately instead of ringing the bell.
skip-completed-text (Off)
If set to On, this alters the default completion behavior when inserting a single match into the line. It’s only active when performing completion in the middle of a word. If enabled, readline does not insert characters from the completion that match characters after point in the word being completed, so portions of the word following the cursor are not duplicated.
visible-stats (Off)
If set to On, a character denoting a file’s type as reported by stat(2) is appended to the filename when listing possible completions.
Readline Conditional Constructs
Readline implements a facility similar in spirit to the conditional compilation features of the C preprocessor which allows key bindings and variable settings to be performed as the result of tests. There are four parser directives used.
$if The $if construct allows bindings to be made based on the editing mode, the terminal being used, or the application using readline. The text of the test extends to the end of the line; no characters are required to isolate it.
mode The mode= form of the $if directive is used to test whether readline is in emacs or vi mode. This may be used in conjunction with the set keymap command, for instance, to set bindings in the emacs-standard and emacs-ctlx keymaps only if readline is starting out in emacs mode.
term The term= form may be used to include terminal-specific key bindings, perhaps to bind the key sequences output by the terminal’s function keys. The word on the right side of the = is tested against the both full name of the terminal and the portion of the terminal name before the first -. This allows sun to match both sun and sun-cmd, for instance.
application The application construct is used to include application-specific settings. Each program using the readline library sets the application name, and an initialization file can test for a particular value. This could be used to bind key sequences to functions useful for a specific program. For instance, the following command adds a key sequence that quotes the current or previous word in bash:
$if Bash
# Quote the current or previous word
"\C-xq": "\eb\"\ef\""
$endif
$endif This command, as seen in the previous example, terminates an $if command.
$else Commands in this branch of the $if directive are executed if the test fails.
$include This directive takes a single filename as an argument and reads commands and bindings from that file. For example, the following directive would read /etc/inputrc:
$include /etc/inputrc
Searching
Readline provides commands for searching through the command history (see HISTORY below) for lines containing a specified string. There are two search modes: incremental and non-incremental.
Incremental searches begin before the user has finished typing the search string. As each character of the search string is typed, readline displays the next entry from the history matching the string typed so far. An incremental search requires only as many characters as needed to find the desired history entry. The characters present in the value of the isearch-terminators variable are used to terminate an incremental search. If that variable has not been assigned a value the Escape and Control-J characters will terminate an incremental search. Control-G will abort an incremental search and restore the original line. When the search is terminated, the history entry containing the search string becomes the current line.
To find other matching entries in the history list, type Control-S or Control-R as appropriate. This will search backward or forward in the history for the next entry matching the search string typed so far. Any other key sequence bound to a readline command will terminate the search and execute that command. For instance, a newline will terminate the search and accept the line, thereby executing the command from the history list.
Readline remembers the last incremental search string. If two Control-Rs are typed without any intervening characters defining a new search string, any remembered search string is used.
Non-incremental searches read the entire search string before starting to search for matching history lines. The search string may be typed by the user or be part of the contents of the current line.
Readline Command Names
The following is a list of the names of the commands and the default key sequences to which they are bound. Command names without an accompanying key sequence are unbound by default. In the following descriptions, point refers to the current cursor position, and mark refers to a cursor position saved by the set-mark command. The text between the point and mark is referred to as the region.
Commands for Moving
beginning-of-line (C-a)
Move to the start of the current line.
end-of-line (C-e)
Move to the end of the line.
forward-char (C-f)
Move forward a character.
backward-char (C-b)
Move back a character.
forward-word (M-f)
Move forward to the end of the next word. Words are composed of alphanumeric characters (letters and digits).
backward-word (M-b)
Move back to the start of the current or previous word. Words are composed of alphanumeric characters (letters and digits).
shell-forward-word
Move forward to the end of the next word. Words are delimited by non-quoted shell metacharacters.
shell-backward-word
Move back to the start of the current or previous word. Words are delimited by non-quoted shell metacharacters.
clear-screen (C-l)
Clear the screen leaving the current line at the top of the screen. With an argument, refresh the current line without clearing the screen.
redraw-current-line
Refresh the current line.
Commands for Manipulating the History
accept-line (Newline, Return)
Accept the line regardless of where the cursor is. If this line is non-empty, add it to the history list according to the state of the HISTCONTROL variable. If the line is a modified history line, then restore the history line to its original state.
previous-history (C-p)
Fetch the previous command from the history list, moving back in the list.
next-history (C-n)
Fetch the next command from the history list, moving forward in the list.
beginning-of-history (M-<)
Move to the first line in the history.
end-of-history (M->)
Move to the end of the input history, i.e., the line currently being entered.
reverse-search-history (C-r)
Search backward starting at the current line and moving ‘up’ through the history as necessary. This is an incremental search.
forward-search-history (C-s)
Search forward starting at the current line and moving ‘down’ through the history as necessary. This is an incremental search.
non-incremental-reverse-search-history (M-p)
Search backward through the history starting at the current line using a non-incremental search for a string supplied by the user.
non-incremental-forward-search-history (M-n)
Search forward through the history using a non-incremental search for a string supplied by the user.
history-search-forward
Search forward through the history for the string of characters between the start of the current line and the point. This is a non-incremental search.
history-search-backward
Search backward through the history for the string of characters between the start of the current line and the point. This is a non-incremental search.
yank-nth-arg (M-C-y)
Insert the first argument to the previous command (usually the second word on the previous line) at point. With an argument n, insert the nth word from the previous command (the words in the previous command begin with word 0). A negative argument inserts the nth word from the end of the previous command. Once the argument n is computed, the argument is extracted as if the "!n" history expansion had been specified.
yank-last-arg (M-., M-_) Insert the last argument to the previous command (the last word of the previous history entry). With a numeric argument, behave exactly like yank-nth-arg. Successive calls to yank-last-arg move back through the history list, inserting the last word (or the word specified by the argument to the first call) of each line in turn. Any numeric argument supplied to these successive calls determines the direction to move through the history. A negative argument switches the direction through the history (back or forward). The history expansion facilities are used to extract the last argument, as if the "!$" history expansion had been specified.
shell-expand-line (M-C-e)
Expand the line as the shell does. This performs alias and history expansion as well as all of the shell word expansions. See HISTORY EXPANSION below for a description of history expansion.
history-expand-line (M-^)
Perform history expansion on the current line. See HISTORY EXPANSION below for a description of history expansion.
magic-space
Perform history expansion on the current line and insert a space. See HISTORY EXPANSION below for a description of history expansion.
alias-expand-line
Perform alias expansion on the current line. See ALIASES above for a description of alias expansion.
history-and-alias-expand-line
Perform history and alias expansion on the current line.
insert-last-argument (M-., M-_)
A synonym for yank-last-arg.
operate-and-get-next (C-o)
Accept the current line for execution and fetch the next line relative to the current line from the history for editing. Any argument is ignored.
edit-and-execute-command (C-xC-e)
Invoke an editor on the current command line, and execute the result as shell commands. Bash attempts to invoke $VISUAL, $EDITOR, and emacs as the editor, in that order.
Commands for Changing Text
delete-char (C-d)
Delete the character at point. If point is at the beginning of the line, there are no characters in the line, and the last character typed was not bound to delete-char, then return EOF.
backward-delete-char (Rubout)
Delete the character behind the cursor. When given a numeric argument, save the deleted text on the kill ring.
forward-backward-delete-char
Delete the character under the cursor, unless the cursor is at the end of the line, in which case the character behind the cursor is deleted.
quoted-insert (C-q, C-v)
Add the next character typed to the line verbatim. This is how to insert characters like C-q, for example.
tab-insert (C-v TAB)
Insert a tab character.
self-insert (a, b, A, 1, !, ...)
Insert the character typed.
transpose-chars (C-t)
Drag the character before point forward over the character at point, moving point forward as well. If point is at the end of the line, then this transposes the two characters before point. Negative arguments have no effect.
transpose-words (M-t)
Drag the word before point past the word after point, moving point over that word as well. If point is at the end of the line, this transposes the last two words on the line.
upcase-word (M-u)
Uppercase the current (or following) word. With a negative argument, uppercase the previous word, but do not move point.
downcase-word (M-l)
Lowercase the current (or following) word. With a negative argument, lowercase the previous word, but do not move point.
capitalize-word (M-c)
Capitalize the current (or following) word. With a negative argument, capitalize the previous word, but do not move point.
overwrite-mode
Toggle overwrite mode. With an explicit positive numeric argument, switches to overwrite mode. With an explicit non-positive numeric argument, switches to insert mode. This command affects only emacs mode; vi mode does overwrite differently. Each call to readline() starts in insert mode. In overwrite mode, characters bound to self-insert replace the text at point rather than pushing the text to the right. Characters bound to backward-delete-char replace the character before point with a space. By default, this command is unbound.
Killing and Yanking
kill-line (C-k)
Kill the text from point to the end of the line.
backward-kill-line (C-x Rubout)
Kill backward to the beginning of the line.
unix-line-discard (C-u)
Kill backward from point to the beginning of the line. The killed text is saved on the kill-ring.
kill-whole-line
Kill all characters on the current line, no matter where point is.
kill-word (M-d)
Kill from point to the end of the current word, or if between words, to the end of the next word. Word boundaries are the same as those used by forward-word.
backward-kill-word (M-Rubout)
Kill the word behind point. Word boundaries are the same as those used by backward-word.
shell-kill-word (M-d)
Kill from point to the end of the current word, or if between words, to the end of the next word. Word boundaries are the same as those used by shell-forward-word.
shell-backward-kill-word (M-Rubout)
Kill the word behind point. Word boundaries are the same as those used by shell-backward-word.
unix-word-rubout (C-w)
Kill the word behind point, using white space as a word boundary. The killed text is saved on the kill-ring.
unix-filename-rubout
Kill the word behind point, using white space and the slash character as the word boundaries. The killed text is saved on the kill-ring.
delete-horizontal-space (M-\)
Delete all spaces and tabs around point.
kill-region
Kill the text in the current region.
copy-region-as-kill
Copy the text in the region to the kill buffer.
copy-backward-word
Copy the word before point to the kill buffer. The word boundaries are the same as backward-word.
copy-forward-word
Copy the word following point to the kill buffer. The word boundaries are the same as forward-word.
yank (C-y)
Yank the top of the kill ring into the buffer at point.
yank-pop (M-y)
Rotate the kill ring, and yank the new top. Only works following yank or yank-pop.
Numeric Arguments
digit-argument (M-0, M-1, ..., M--)
Add this digit to the argument already accumulating, or start a new argument. M-- starts a negative argument.
universal-argument
This is another way to specify an argument. If this command is followed by one or more digits, optionally with a leading minus sign, those digits define the argument. If the command is followed by digits, executing universal-argument again ends the numeric argument, but is otherwise ignored. As a special case, if this command is immediately followed by a character that is neither a digit or minus sign, the argument count for the next command is multiplied by four. The argument count is initially one, so executing this function the first time makes the argument count four, a second time makes the argument count sixteen, and so on.
Completing
complete (TAB)
Attempt to perform completion on the text before point. Bash attempts completion treating the text as a variable (if the text begins with $), username (if the text begins with ~), hostname (if the text begins with @), or command (including aliases and functions) in turn. If none of these produces a match, filename completion is attempted.
possible-completions (M-?)
List the possible completions of the text before point.
insert-completions (M-*)
Insert all completions of the text before point that would have been generated by possible-completions.
menu-complete
Similar to complete, but replaces the word to be completed with a single match from the list of possible completions. Repeated execution of menu-complete steps through the list of possible completions, inserting each match in turn. At the end of the list of completions, the bell is rung (subject to the setting of bell-style) and the original text is restored. An argument of n moves n positions forward in the list of matches; a negative argument may be used to move backward through the list. This command is intended to be bound to TAB, but is unbound by default.
menu-complete-backward
Identical to menu-complete, but moves backward through the list of possible completions, as if menu-complete had been given a negative argument. This command is unbound by default.
delete-char-or-list
Deletes the character under the cursor if not at the beginning or end of the line (like delete-char). If at the end of the line, behaves identically to possible-completions. This command is unbound by default.
complete-filename (M-/)
Attempt filename completion on the text before point.
possible-filename-completions (C-x /)
List the possible completions of the text before point, treating it as a filename.
complete-username (M-~)
Attempt completion on the text before point, treating it as a username.
possible-username-completions (C-x ~)
List the possible completions of the text before point, treating it as a username.
complete-variable (M-$)
Attempt completion on the text before point, treating it as a shell variable.
possible-variable-completions (C-x $)
List the possible completions of the text before point, treating it as a shell variable.
complete-hostname (M-@)
Attempt completion on the text before point, treating it as a hostname.
possible-hostname-completions (C-x @)
List the possible completions of the text before point, treating it as a hostname.
complete-command (M-!)
Attempt completion on the text before point, treating it as a command name. Command completion attempts to match the text against aliases, reserved words, shell functions, shell builtins, and finally executable filenames, in that order.
possible-command-completions (C-x !)
List the possible completions of the text before point, treating it as a command name.
dynamic-complete-history (M-TAB)
Attempt completion on the text before point, comparing the text against lines from the history list for possible completion matches.
dabbrev-expand
Attempt menu completion on the text before point, comparing the text against lines from the history list for possible completion matches.
complete-into-braces (M-{)
Perform filename completion and insert the list of possible completions enclosed within braces so the list is available to the shell (see Brace Expansion above).
Keyboard Macros
start-kbd-macro (C-x ()
Begin saving the characters typed into the current keyboard macro.
end-kbd-macro (C-x ))
Stop saving the characters typed into the current keyboard macro and store the definition.
call-last-kbd-macro (C-x e)
Re-execute the last keyboard macro defined, by making the characters in the macro appear as if typed at the keyboard.
Miscellaneous
re-read-init-file (C-x C-r)
Read in the contents of the inputrc file, and incorporate any bindings or variable assignments found there.
abort (C-g)
Abort the current editing command and ring the terminal’s bell (subject to the setting of bell-style).
do-uppercase-version (M-a, M-b, M-x, ...)
If the metafied character x is lowercase, run the command that is bound to the corresponding uppercase character.
prefix-meta (ESC)
Metafy the next character typed. ESC f is equivalent to Meta-f.
undo (C-_, C-x C-u)
Incremental undo, separately remembered for each line.
revert-line (M-r)
Undo all changes made to this line. This is like executing the undo command enough times to return the line to its initial state.
tilde-expand (M-&)
Perform tilde expansion on the current word.
set-mark (C-@, M-<space>)
Set the mark to the point. If a numeric argument is supplied, the mark is set to that position.
exchange-point-and-mark (C-x C-x)
Swap the point with the mark. The current cursor position is set to the saved position, and the old cursor position is saved as the mark.
character-search (C-])
A character is read and point is moved to the next occurrence of that character. A negative count searches for previous occurrences.
character-search-backward (M-C-])
A character is read and point is moved to the previous occurrence of that character. A negative count searches for subsequent occurrences.
skip-csi-sequence
Read enough characters to consume a multi-key sequence such as those defined for keys like Home and End. Such sequences begin with a Control Sequence Indicator (CSI), usually ESC-[. If this sequence is bound to "\[", keys producing such sequences will have no effect unless explicitly bound to a readline command, instead of inserting stray characters into the editing buffer. This is unbound by default, but usually bound to ESC-[.
insert-comment (M-#)
Without a numeric argument, the value of the readline comment-begin variable is inserted at the beginning of the current line. If a numeric argument is supplied, this command acts as a toggle: if the characters at the beginning of the line do not match the value of comment-begin, the value is inserted, otherwise the characters in comment-begin are deleted from the beginning of the line. In either case, the line is accepted as if a newline had been typed. The default value of comment-begin causes this command to make the current line a shell comment. If a numeric argument causes the comment character to be removed, the line will be executed by the shell.
glob-complete-word (M-g)
The word before point is treated as a pattern for pathname expansion, with an asterisk implicitly appended. This pattern is used to generate a list of matching file names for possible completions.
glob-expand-word (C-x *)
The word before point is treated as a pattern for pathname expansion, and the list of matching file names is inserted, replacing the word. If a numeric argument is supplied, an asterisk is appended before pathname expansion.
glob-list-expansions (C-x g)
The list of expansions that would have been generated by glob-expand-word is displayed, and the line is redrawn. If a numeric argument is supplied, an asterisk is appended before pathname expansion.
dump-functions
Print all of the functions and their key bindings to the readline output stream. If a numeric argument is supplied, the output is formatted in such a way that it can be made part of an inputrc file.
dump-variables
Print all of the settable readline variables and their values to the readline output stream. If a numeric argument is supplied, the output is formatted in such a way that it can be made part of an inputrc file.
dump-macros
Print all of the readline key sequences bound to macros and the strings they output. If a numeric argument is supplied, the output is formatted in such a way that it can be made part of an inputrc file.
display-shell-version (C-x C-v)
Display version information about the current instance of bash.
Programmable Completion
When word completion is attempted for an argument to a command for which a completion specification (a compspec) has been defined using the complete builtin (see SHELL BUILTIN COMMANDS below), the programmable completion facilities are invoked.
First, the command name is identified. If the command word is the empty string (completion attempted at the beginning of an empty line), any compspec defined with the -E option to complete is used. If a compspec has been defined for that command, the compspec is used to generate the list of possible completions for the word. If the command word is a full pathname, a compspec for the full pathname is searched for first. If no compspec is found for the full pathname, an attempt is made to find a compspec for the portion following the final slash. If those searches do not result in a compspec, any compspec defined with the -D option to complete is used as the default.
Once a compspec has been found, it is used to generate the list of matching words. If a compspec is not found, the default bash completion as described above under Completing is performed.
First, the actions specified by the compspec are used. Only matches which are prefixed by the word being completed are returned. When the -f or -d option is used for filename or directory name completion, the shell variable FIGNORE is used to filter the matches.
Any completions specified by a pathname expansion pattern to the -G option are generated next. The words generated by the pattern need not match the word being completed. The GLOBIGNORE shell variable is not used to filter the matches, but the FIGNORE variable is used.
Next, the string specified as the argument to the -W option is considered. The string is first split using the characters in the IFS special variable as delimiters. Shell quoting is honored. Each word is then expanded using brace expansion, tilde expansion, parameter and variable expansion, command substitution, and arithmetic expansion, as described above under EXPANSION. The results are split using the rules described above under Word Splitting. The results of the expansion are prefix-matched against the word being completed, and the matching words become the possible completions.
After these matches have been generated, any shell function or command specified with the -F and -C options is invoked. When the command or function is invoked, the COMP_LINE, COMP_POINT, COMP_KEY, and COMP_TYPE variables are assigned values as described above under Shell Variables. If a shell function is being invoked, the COMP_WORDS and COMP_CWORD variables are also set. When the function or command is invoked, the first argument is the name of the command whose arguments are being completed, the second argument is the word being completed, and the third argument is the word preceding the word being completed on the current command line. No filtering of the generated completions against the word being completed is performed; the function or command has complete freedom in generating the matches.
Any function specified with -F is invoked first. The function may use any of the shell facilities, including the compgen builtin described below, to generate the matches. It must put the possible completions in the COMPREPLY array variable.
Next, any command specified with the -C option is invoked in an environment equivalent to command substitution. It should print a list of completions, one per line, to the standard output. Backslash may be used to escape a newline, if necessary.
After all of the possible completions are generated, any filter specified with the -X option is applied to the list. The filter is a pattern as used for pathname expansion; a & in the pattern is replaced with the text of the word being completed. A literal & may be escaped with a backslash; the backslash is removed before attempting a match. Any completion that matches the pattern will be removed from the list. A leading ! negates the pattern; in this case any completion not matching the pattern will be removed.
Finally, any prefix and suffix specified with the -P and -S options are added to each member of the completion list, and the result is returned to the readline completion code as the list of possible completions.
If the previously-applied actions do not generate any matches, and the -o dirnames option was supplied to complete when the compspec was defined, directory name completion is attempted.
If the -o plusdirs option was supplied to complete when the compspec was defined, directory name completion is attempted and any matches are added to the results of the other actions.
By default, if a compspec is found, whatever it generates is returned to the completion code as the full set of possible completions. The default bash completions are not attempted, and the readline default of filename completion is disabled. If the -o bashdefault option was supplied to complete when the compspec was defined, the bash default completions are attempted if the compspec generates no matches. If the -o default option was supplied to complete when the compspec was defined, readline’s default completion will be performed if the compspec (and, if attempted, the default bash completions) generate no matches.
When a compspec indicates that directory name completion is desired, the programmable completion functions force readline to append a slash to completed names which are symbolic links to directories, subject to the value of the mark-directories readline variable, regardless of the setting of the mark-symlinked-directories readline variable.
There is some support for dynamically modifying completions. This is most useful when used in combination with a default completion specified with complete -D. It’s possible for shell functions executed as completion handlers to indicate that completion should be retried by returning an exit status of 124. If a shell function returns 124, and changes the compspec associated with the command on which completion is being attempted (supplied as the first argument when the function is executed), programmable completion restarts from the beginning, with an attempt to find a new compspec for that command. This allows a set of completions to be built dynamically as completion is attempted, rather than being loaded all at once.
For instance, assuming that there is a library of compspecs, each kept in a file corresponding to the name of the command, the following default completion function would load completions dynamically:
_completion_loader()
{
. "/etc/bash_completion.d/$1.sh" >/dev/null 2>&1 && return 124
}
complete -D -F _completion_loader
HISTORY
When the -o history option to the set builtin is enabled, the shell provides access to the command history, the list of commands previously typed. The value of the HISTSIZE variable is used as the number of commands to save in a history list. The text of the last HISTSIZE commands (default 500) is saved. The shell stores each command in the history list prior to parameter and variable expansion (see EXPANSION above) but after history expansion is performed, subject to the values of the shell variables HISTIGNORE and HISTCONTROL.
On startup, the history is initialized from the file named by the variable HISTFILE (default ~/.bash_history). The file named by the value of HISTFILE is truncated, if necessary, to contain no more than the number of lines specified by the value of HISTFILESIZE. When the history file is read, lines beginning with the history comment character followed immediately by a digit are interpreted as timestamps for the preceding history line. These timestamps are optionally displayed depending on the value of the HISTTIMEFORMAT variable. When an interactive shell exits, the last $HISTSIZE lines are copied from the history list to $HISTFILE. If the histappend shell option is enabled (see the description of shopt under SHELL BUILTIN COMMANDS below), the lines are appended to the history file, otherwise the history file is overwritten. If HISTFILE is unset, or if the history file is unwritable, the history is not saved. If the HISTTIMEFORMAT variable is set, time stamps are written to the history file, marked with the history comment character, so they may be preserved across shell sessions. This uses the history comment character to distinguish timestamps from other history lines. After saving the history, the history file is truncated to contain no more than HISTFILESIZE lines. If HISTFILESIZE is not set, no truncation is performed.
The builtin command fc (see SHELL BUILTIN COMMANDS below) may be used to list or edit and re-execute a portion of the history list. The history builtin may be used to display or modify the history list and manipulate the history file. When using command-line editing, search commands are available in each editing mode that provide access to the history list.
The shell allows control over which commands are saved on the history list. The HISTCONTROL and HISTIGNORE variables may be set to cause the shell to save only a subset of the commands entered. The cmdhist shell option, if enabled, causes the shell to attempt to save each line of a multi-line command in the same history entry, adding semicolons where necessary to preserve syntactic correctness. The lithist shell option causes the shell to save the command with embedded newlines instead of semicolons. See the description of the shopt builtin below under SHELL BUILTIN COMMANDS for information on setting and unsetting shell options.
HISTORY EXPANSION
The shell supports a history expansion feature that is similar to the history expansion in csh. This section describes what syntax features are available. This feature is enabled by default for interactive shells, and can be disabled using the +H option to the set builtin command (see SHELL BUILTIN COMMANDS below). Non-interactive shells do not perform history expansion by default.
History expansions introduce words from the history list into the input stream, making it easy to repeat commands, insert the arguments to a previous command into the current input line, or fix errors in previous commands quickly.
History expansion is performed immediately after a complete line is read, before the shell breaks it into words. It takes place in two parts. The first is to determine which line from the history list to use during substitution. The second is to select portions of that line for inclusion into the current one. The line selected from the history is the event, and the portions of that line that are acted upon are words. Various modifiers are available to manipulate the selected words. The line is broken into words in the same fashion as when reading input, so that several metacharacter-separated words surrounded by quotes are considered one word. History expansions are introduced by the appearance of the history expansion character, which is ! by default. Only backslash (\) and single quotes can quote the history expansion character.
Several characters inhibit history expansion if found immediately following the history expansion character, even if it is unquoted: space, tab, newline, carriage return, and =. If the extglob shell option is enabled, ( will also inhibit expansion.
Several shell options settable with the shopt builtin may be used to tailor the behavior of history expansion. If the histverify shell option is enabled (see the description of the shopt builtin below), and readline is being used, history substitutions are not immediately passed to the shell parser. Instead, the expanded line is reloaded into the readline editing buffer for further modification. If readline is being used, and the histreedit shell option is enabled, a failed history substitution will be reloaded into the readline editing buffer for correction. The -p option to the history builtin command may be used to see what a history expansion will do before using it. The -s option to the history builtin may be used to add commands to the end of the history list without actually executing them, so that they are available for subsequent recall.
The shell allows control of the various characters used by the history expansion mechanism (see the description of histchars above under Shell Variables). The shell uses the history comment character to mark history timestamps when writing the history file.
Event Designators
An event designator is a reference to a command line entry in the history list. Unless the reference is absolute, events are relative to the current position in the history list.
! Start a history substitution, except when followed by a blank, newline, carriage return, = or ( (when the extglob shell option is enabled using the shopt builtin).
!n Refer to command line n.
!-n Refer to the current command minus n.
!! Refer to the previous command. This is a synonym for ‘!-1’.
!string
Refer to the most recent command preceding the current position in the history list starting with string.
!?string[?]
Refer to the most recent command preceding the current postition in the history list containing string. The trailing ? may be omitted if string is followed immediately by a newline.
^string1^string2^
Quick substitution. Repeat the previous command, replacing string1 with string2. Equivalent to ‘‘!!:s/string1/string2/’’ (see Modifiers below).
!# The entire command line typed so far.
Word Designators
Word designators are used to select desired words from the event. A : separates the event specification from the word designator. It may be omitted if the word designator begins with a ^, $, *, -, or %. Words are numbered from the beginning of the line, with the first word being denoted by 0 (zero). Words are inserted into the current line separated by single spaces.
0 (zero)
The zeroth word. For the shell, this is the command word.
n The nth word.
^ The first argument. That is, word 1.
$ The last argument.
% The word matched by the most recent ‘?string?’ search.
x-y A range of words; ‘-y’ abbreviates ‘0-y’.
* All of the words but the zeroth. This is a synonym for ‘1-$’. It is not an error to use * if there is just one word in the event; the empty string is returned in that case.
x* Abbreviates x-$.
x- Abbreviates x-$ like x*, but omits the last word.
If a word designator is supplied without an event specification, the previous command is used as the event.
Modifiers
After the optional word designator, there may appear a sequence of one or more of the following modifiers, each preceded by a ‘:’.
h Remove a trailing file name component, leaving only the head.
t Remove all leading file name components, leaving the tail.
r Remove a trailing suffix of the form .xxx, leaving the basename.
e Remove all but the trailing suffix.
p Print the new command but do not execute it.
q Quote the substituted words, escaping further substitutions.
x Quote the substituted words as with q, but break into words at blanks and newlines.
s/old/new/
Substitute new for the first occurrence of old in the event line. Any delimiter can be used in place of /. The final delimiter is optional if it is the last character of the event line. The delimiter may be quoted in old and new with a single backslash. If & appears in new, it is replaced by old. A single backslash will quote the &. If old is null, it is set to the last old substituted, or, if no previous history substitutions took place, the last string in a !?string[?] search.
& Repeat the previous substitution.
g Cause changes to be applied over the entire event line. This is used in conjunction with ‘:s’ (e.g., ‘:gs/old/new/’) or ‘:&’. If used with ‘:s’, any delimiter can be used in place of /, and the final delimiter is optional if it is the last character of the event line. An a may be used as a synonym for g.
G Apply the following ‘s’ modifier once to each word in the event line.
SHELL BUILTIN COMMANDS
Unless otherwise noted, each builtin command documented in this section as accepting options preceded by - accepts -- to signify the end of the options. The :, true, false, and test builtins do not accept options and do not treat -- specially. The exit, logout, break, continue, let, and shift builtins accept and process arguments beginning with - without requiring --. Other builtins that accept arguments but are not specified as accepting options interpret arguments beginning with - as invalid options and require -- to prevent this interpretation.
: [arguments]
No effect; the command does nothing beyond expanding arguments and performing any specified redirections. A zero exit code is returned.
. filename [arguments]
source filename [arguments]
Read and execute commands from filename in the current shell environment and return the exit status of the last command executed from filename. If filename does not contain a slash, file names in PATH are used to find the directory containing filename. The file searched for in PATH need not be executable. When bash is not in posix mode, the current directory is searched if no file is found in PATH. If the sourcepath option to the shopt builtin command is turned off, the PATH is not searched. If any arguments are supplied, they become the positional parameters when filename is executed. Otherwise the positional parameters are unchanged. The return status is the status of the last command exited within the script (0 if no commands are executed), and false if filename is not found or cannot be read.
alias [-p] [name[=value] ...]
Alias with no arguments or with the -p option prints the list of aliases in the form alias name=value on standard output. When arguments are supplied, an alias is defined for each name whose value is given. A trailing space in value causes the next word to be checked for alias substitution when the alias is expanded. For each name in the argument list for which no value is supplied, the name and value of the alias is printed. Alias returns true unless a name is given for which no alias has been defined.
bg [jobspec ...]
Resume each suspended job jobspec in the background, as if it had been started with &. If jobspec is not present, the shell’s notion of the current job is used. bg jobspec returns 0 unless run when job control is disabled or, when run with job control enabled, any specified jobspec was not found or was started without job control.
bind [-m keymap] [-lpsvPSV]
bind [-m keymap] [-q function] [-u function] [-r keyseq]
bind [-m keymap] -f filename
bind [-m keymap] -x keyseq:shell-command
bind [-m keymap] keyseq:function-name
bind readline-command
Display current readline key and function bindings, bind a key sequence to a readline function or macro, or set a readline variable. Each non-option argument is a command as it would appear in .inputrc, but each binding or command must be passed as a separate argument; e.g., ’"\C-x\C-r": re-read-init-file’. Options, if supplied, have the following meanings:
-m keymap
Use keymap as the keymap to be affected by the subsequent bindings. Acceptable keymap names are emacs, emacs-standard, emacs-meta, emacs-ctlx, vi, vi-move, vi-command, and vi-insert. vi is equivalent to vi-command; emacs is equivalent to emacs-standard.
-l List the names of all readline functions.
-p Display readline function names and bindings in such a way that they can be re-read.
-P List current readline function names and bindings.
-s Display readline key sequences bound to macros and the strings they output in such a way that they can be re-read.
-S Display readline key sequences bound to macros and the strings they output.
-v Display readline variable names and values in such a way that they can be re-read.
-V List current readline variable names and values.
-f filename
Read key bindings from filename.
-q function
Query about which keys invoke the named function.
-u function
Unbind all keys bound to the named function.
-r keyseq
Remove any current binding for keyseq.
-x keyseq:shell-command
Cause shell-command to be executed whenever keyseq is entered. When shell-command is executed, the shell sets the READLINE_LINE variable to the contents of the readline line buffer and the READLINE_POINT variable to the current location of the insertion point. If the executed command changes the value of READLINE_LINE or READLINE_POINT, those new values will be reflected in the editing state.
The return value is 0 unless an unrecognized option is given or an error occurred.
break [n]
Exit from within a for, while, until, or select loop. If n is specified, break n levels. n must be >= 1. If n is greater than the number of enclosing loops, all enclosing loops are exited. The return value is 0 unless n is not greater than or equal to 1.
builtin shell-builtin [arguments]
Execute the specified shell builtin, passing it arguments, and return its exit status. This is useful when defining a function whose name is the same as a shell builtin, retaining the functionality of the builtin within the function. The cd builtin is commonly redefined this way. The return status is false if shell-builtin is not a shell builtin command.
caller [expr]
Returns the context of any active subroutine call (a shell function or a script executed with the . or source builtins). Without expr, caller displays the line number and source filename of the current subroutine call. If a non-negative integer is supplied as expr, caller displays the line number, subroutine name, and source file corresponding to that position in the current execution call stack. This extra information may be used, for example, to print a stack trace. The current frame is frame 0. The return value is 0 unless the shell is not executing a subroutine call or expr does not correspond to a valid position in the call stack.
cd [-L|[-P [-e]]] [dir]
Change the current directory to dir. The variable HOME is the default dir. The variable CDPATH defines the search path for the directory containing dir. Alternative directory names in CDPATH are separated by a colon (:). A null directory name in CDPATH is the same as the current directory, i.e., ‘‘.’’. If dir begins with a slash (/), then CDPATH is not used. The -P option says to use the physical directory structure instead of following symbolic links (see also the -P option to the set builtin command); the -L option forces symbolic links to be followed. If the -e option is supplied with -P, and the current working directory cannot be successfully determined after a successful directory change, cd will return an unsuccessful status. An argument of - is equivalent to $OLDPWD. If a non-empty directory name from CDPATH is used, or if - is the first argument, and the directory change is successful, the absolute pathname of the new working directory is written to the standard output. The return value is true if the directory was successfully changed; false otherwise.
command [-pVv] command [arg ...]
Run command with args suppressing the normal shell function lookup. Only builtin commands or commands found in the PATH are executed. If the -p option is given, the search for command is performed using a default value for PATH that is guaranteed to find all of the standard utilities. If either the -V or -v option is supplied, a description of command is printed. The -v option causes a single word indicating the command or file name used to invoke command to be displayed; the -V option produces a more verbose description. If the -V or -v option is supplied, the exit status is 0 if command was found, and 1 if not. If neither option is supplied and an error occurred or command cannot be found, the exit status is 127. Otherwise, the exit status of the command builtin is the exit status of command.
compgen [option] [word]
Generate possible completion matches for word according to the options, which may be any option accepted by the complete builtin with the exception of -p and -r, and write the matches to the standard output. When using the -F or -C options, the various shell variables set by the programmable completion facilities, while available, will not have useful values.
The matches will be generated in the same way as if the programmable completion code had generated them directly from a completion specification with the same flags. If word is specified, only those completions matching word will be displayed.
The return value is true unless an invalid option is supplied, or no matches were generated.
complete [-abcdefgjksuv] [-o comp-option] [-DE] [-A action] [-G globpat] [-W wordlist] [-F function] [-C command]
[-X filterpat] [-P prefix] [-S suffix] name [name ...]
complete -pr [-DE] [name ...]
Specify how arguments to each name should be completed. If the -p option is supplied, or if no options are supplied, existing completion specifications are printed in a way that allows them to be reused as input. The -r option removes a completion specification for each name, or, if no names are supplied, all completion specifications. The -D option indicates that the remaining options and actions should apply to the ‘‘default’’ command completion; that is, completion attempted on a command for which no completion has previously been defined. The -E option indicates that the remaining options and actions should apply to ‘‘empty’’ command completion; that is, completion attempted on a blank line.
The process of applying these completion specifications when word completion is attempted is described above under Programmable Completion.
Other options, if specified, have the following meanings. The arguments to the -G, -W, and -X options (and, if necessary, the -P and -S options) should be quoted to protect them from expansion before the complete builtin is invoked.
-o comp-option
The comp-option controls several aspects of the compspec’s behavior beyond the simple generation of completions. comp-option may be one of:
bashdefault
Perform the rest of the default bash completions if the compspec generates no matches.
default Use readline’s default filename completion if the compspec generates no matches.
dirnames Perform directory name completion if the compspec generates no matches.
filenames
Tell readline that the compspec generates filenames, so it can perform any filename-specific processing (like adding a slash to directory names, quoting special characters, or suppressing trailing spaces). Intended to be used with shell functions.
nospace Tell readline not to append a space (the default) to words completed at the end of the line.
plusdirs After any matches defined by the compspec are generated, directory name completion is attempted and any matches are added to the results of the other actions.
-A action The action may be one of the following to generate a list of possible completions:
alias Alias names. May also be specified as -a.
arrayvar Array variable names.
binding Readline key binding names.
builtin Names of shell builtin commands. May also be specified as -b.
command Command names. May also be specified as -c.
directory
Directory names. May also be specified as -d.
disabled Names of disabled shell builtins.
enabled Names of enabled shell builtins.
export Names of exported shell variables. May also be specified as -e.
file File names. May also be specified as -f.
function Names of shell functions.
group Group names. May also be specified as -g.
helptopic
Help topics as accepted by the help builtin.
hostname Hostnames, as taken from the file specified by the HOSTFILE shell variable.
job Job names, if job control is active. May also be specified as -j.
keyword Shell reserved words. May also be specified as -k.
running Names of running jobs, if job control is active.
service Service names. May also be specified as -s.
setopt Valid arguments for the -o option to the set builtin.
shopt Shell option names as accepted by the shopt builtin.
signal Signal names.
stopped Names of stopped jobs, if job control is active.
user User names. May also be specified as -u.
variable Names of all shell variables. May also be specified as -v.
-C command command is executed in a subshell environment, and its output is used as the possible completions.
-F function
The shell function function is executed in the current shell environment. When it finishes, the possible completions are retrieved from the value of the COMPREPLY array variable.
-G globpat The pathname expansion pattern globpat is expanded to generate the possible completions.
-P prefix prefix is added at the beginning of each possible completion after all other options have been applied.
-S suffix suffix is appended to each possible completion after all other options have been applied.
-W wordlist
The wordlist is split using the characters in the IFS special variable as delimiters, and each resultant word is expanded. The possible completions are the members of the resultant list which match the word being completed.
-X filterpat
filterpat is a pattern as used for pathname expansion. It is applied to the list of possible completions generated by the preceding options and arguments, and each completion matching filterpat is removed from the list. A leading ! in filterpat negates the pattern; in this case, any completion not matching filterpat is removed.
The return value is true unless an invalid option is supplied, an option other than -p or -r is supplied without a name argument, an attempt is made to remove a completion specification for a name for which no specification exists, or an error occurs adding a completion specification.
compopt [-o option] [-DE] [+o option] [name]
Modify completion options for each name according to the options, or for the currently-executing completion if no names are supplied. If no options are given, display the completion options for each name or the current completion. The possible values of option are those valid for the complete builtin described above. The -D option indicates that the remaining options should apply to the ‘‘default’’ command completion; that is, completion attempted on a command for which no completion has previously been defined. The -E option indicates that the remaining options should apply to ‘‘empty’’ command completion; that is, completion attempted on a blank line.
The return value is true unless an invalid option is supplied, an attempt is made to modify the options for a name for which no completion specification exists, or an output error occurs.
continue [n]
Resume the next iteration of the enclosing for, while, until, or select loop. If n is specified, resume at the nth enclosing loop. n must be >= 1. If n is greater than the number of enclosing loops, the last enclosing loop (the ‘‘top-level’’ loop) is resumed. The return value is 0 unless n is not greater than or equal to 1.
declare [-aAfFgilrtux] [-p] [name[=value] ...]
typeset [-aAfFgilrtux] [-p] [name[=value] ...]
Declare variables and/or give them attributes. If no names are given then display the values of variables. The -p option will display the attributes and values of each name. When -p is used with name arguments, additional options are ignored. When -p is supplied without name arguments, it will display the attributes and values of all variables having the attributes specified by the additional options. If no other options are supplied with -p, declare will display the attributes and values of all shell variables. The -f option will restrict the display to shell functions. The -F option inhibits the display of function definitions; only the function name and attributes are printed. If the extdebug shell option is enabled using shopt, the source file name and line number where the function is defined are displayed as well. The -F option implies -f. The -g option forces variables to be created or modified at the global scope, even when declare is executed in a shell function. It is ignored in all other cases. The following options can be used to restrict output to variables with the specified attribute or to give variables attributes:
-a Each name is an indexed array variable (see Arrays above).
-A Each name is an associative array variable (see Arrays above).
-f Use function names only.
-i The variable is treated as an integer; arithmetic evaluation (see ARITHMETIC EVALUATION above) is performed when the variable is assigned a value.
-l When the variable is assigned a value, all upper-case characters are converted to lower-case. The upper-case attribute is disabled.
-r Make names readonly. These names cannot then be assigned values by subsequent assignment statements or unset.
-t Give each name the trace attribute. Traced functions inherit the DEBUG and RETURN traps from the calling shell. The trace attribute has no special meaning for variables.
-u When the variable is assigned a value, all lower-case characters are converted to upper-case. The lower-case attribute is disabled.
-x Mark names for export to subsequent commands via the environment.
Using ‘+’ instead of ‘-’ turns off the attribute instead, with the exceptions that +a may not be used to destroy an array variable and +r will not remove the readonly attribute. When used in a function, makes each name local, as with the local command, unless the -g option is supplied, If a variable name is followed by =value, the value of the variable is set to value. The return value is 0 unless an invalid option is encountered, an attempt is made to define a function using -f foo=bar, an attempt is made to assign a value to a readonly variable, an attempt is made to assign a value to an array variable without using the compound assignment syntax (see Arrays above), one of the names is not a valid shell variable name, an attempt is made to turn off readonly status for a readonly variable, an attempt is made to turn off array status for an array variable, or an attempt is made to display a non-existent function with -f.
dirs [+n] [-n] [-clpv]
Without options, displays the list of currently remembered directories. The default display is on a single line with directory names separated by spaces. Directories are added to the list with the pushd command; the popd command removes entries from the list.
+n Displays the nth entry counting from the left of the list shown by dirs when invoked without options, starting with zero.
-n Displays the nth entry counting from the right of the list shown by dirs when invoked without options, starting with zero.
-c Clears the directory stack by deleting all of the entries.
-l Produces a longer listing; the default listing format uses a tilde to denote the home directory.
-p Print the directory stack with one entry per line.
-v Print the directory stack with one entry per line, prefixing each entry with its index in the stack.
The return value is 0 unless an invalid option is supplied or n indexes beyond the end of the directory stack.
disown [-ar] [-h] [jobspec ...]
Without options, each jobspec is removed from the table of active jobs. If jobspec is not present, and neither -a nor -r is supplied, the shell’s notion of the current job is used. If the -h option is given, each jobspec is not removed from the table, but is marked so that SIGHUP is not sent to the job if the shell receives a SIGHUP. If no jobspec is present, and neither the -a nor the -r option is supplied, the current job is used. If no jobspec is supplied, the -a option means to remove or mark all jobs; the -r option without a jobspec argument restricts operation to running jobs. The return value is 0 unless a jobspec does not specify a valid job.
echo [-neE] [arg ...]
Output the args, separated by spaces, followed by a newline. The return status is always 0. If -n is specified, the trailing newline is suppressed. If the -e option is given, interpretation of the following backslash-escaped characters is enabled. The -E option disables the interpretation of these escape characters, even on systems where they are interpreted by default. The xpg_echo shell option may be used to dynamically determine whether or not echo expands these escape characters by default. echo does not interpret -- to mean the end of options. echo interprets the following escape sequences:
\a alert (bell)
\b backspace
\c suppress further output
\e
\E
an escape character
\f form feed
\n new line
\r carriage return
\t horizontal tab
\v vertical tab
\\ backslash
\0nnn the eight-bit character whose value is the octal value nnn (zero to three octal digits)
\xHH the eight-bit character whose value is the hexadecimal value HH (one or two hex digits)
\uHHHH the Unicode (ISO/IEC 10646) character whose value is the hexadecimal value HHHH (one to four hex digits)
\UHHHHHHHH
the Unicode (ISO/IEC 10646) character whose value is the hexadecimal value HHHHHHHH (one to eight hex digits)
enable [-a] [-dnps] [-f filename] [name ...]
Enable and disable builtin shell commands. Disabling a builtin allows a disk command which has the same name as a shell builtin to be executed without specifying a full pathname, even though the shell normally searches for builtins before disk commands. If -n is used, each name is disabled; otherwise, names are enabled. For example, to use the test binary found via the PATH instead of the shell builtin version, run enable -n test. The -f option means to load the new builtin command name from shared object filename, on systems that support dynamic loading. The -d option will delete a builtin previously loaded with -f. If no name arguments are given, or if the -p option is supplied, a list of shell builtins is printed. With no other option arguments, the list consists of all enabled shell builtins. If -n is supplied, only disabled builtins are printed. If -a is supplied, the list printed includes all builtins, with an indication of whether or not each is enabled. If -s is supplied, the output is restricted to the POSIX special builtins. The return value is 0 unless a name is not a shell builtin or there is an error loading a new builtin from a shared object.
eval [arg ...]
The args are read and concatenated together into a single command. This command is then read and executed by the shell, and its exit status is returned as the value of eval. If there are no args, or only null arguments, eval returns 0.
exec [-cl] [-a name] [command [arguments]]
If command is specified, it replaces the shell. No new process is created. The arguments become the arguments to command. If the -l option is supplied, the shell places a dash at the beginning of the zeroth argument passed to command. This is what login(1) does. The -c option causes command to be executed with an empty environment. If -a is supplied, the shell passes name as the zeroth argument to the executed command. If command cannot be executed for some reason, a non-interactive shell exits, unless the shell option execfail is enabled, in which case it returns failure. An interactive shell returns failure if the file cannot be executed. If command is not specified, any redirections take effect in the current shell, and the return status is 0. If there is a redirection error, the return status is 1.
exit [n]
Cause the shell to exit with a status of n. If n is omitted, the exit status is that of the last command executed. A trap on EXIT is executed before the shell terminates.
export [-fn] [name[=word]] ...
export -p
The supplied names are marked for automatic export to the environment of subsequently executed commands. If the -f option is given, the names refer to functions. If no names are given, or if the -p option is supplied, a list of all names that are exported in this shell is printed. The -n option causes the export property to be removed from each name. If a variable name is followed by =word, the value of the variable is set to word. export returns an exit status of 0 unless an invalid option is encountered, one of the names is not a valid shell variable name, or -f is supplied with a name that is not a function.
fc [-e ename] [-lnr] [first] [last]
fc -s [pat=rep] [cmd]
Fix Command. In the first form, a range of commands from first to last is selected from the history list. First and last may be specified as a string (to locate the last command beginning with that string) or as a number (an index into the history list, where a negative number is used as an offset from the current command number). If last is not specified it is set to the current command for listing (so that fc -l -10 prints the last 10 commands) and to first otherwise. If first is not specified it is set to the previous command for editing and -16 for listing.
The -n option suppresses the command numbers when listing. The -r option reverses the order of the commands. If the -l option is given, the commands are listed on standard output. Otherwise, the editor given by ename is invoked on a file containing those commands. If ename is not given, the value of the FCEDIT variable is used, and the value of EDITOR if FCEDIT is not set. If neither variable is set, vi is used. When editing is complete, the edited commands are echoed and executed.
In the second form, command is re-executed after each instance of pat is replaced by rep. A useful alias to use with this is r=’fc -s’, so that typing r cc runs the last command beginning with cc and typing r re-executes the last command.
If the first form is used, the return value is 0 unless an invalid option is encountered or first or last specify history lines out of range. If the -e option is supplied, the return value is the value of the last command executed or failure if an error occurs with the temporary file of commands. If the second form is used, the return status is that of the command re-executed, unless cmd does not specify a valid history line, in which case fc returns failure.
fg [jobspec]
Resume jobspec in the foreground, and make it the current job. If jobspec is not present, the shell’s notion of the current job is used. The return value is that of the command placed into the foreground, or failure if run when job control is disabled or, when run with job control enabled, if jobspec does not specify a valid job or jobspec specifies a job that was started without job control.
getopts optstring name [args]
getopts is used by shell procedures to parse positional parameters. optstring contains the option characters to be recognized; if a character is followed by a colon, the option is expected to have an argument, which should be separated from it by white space. The colon and question mark characters may not be used as option characters. Each time it is invoked, getopts places the next option in the shell variable name, initializing name if it does not exist, and the index of the next argument to be processed into the variable OPTIND. OPTIND is initialized to 1 each time the shell or a shell script is invoked. When an option requires an argument, getopts places that argument into the variable OPTARG. The shell does not reset OPTIND automatically; it must be manually reset between multiple calls to getopts within the same shell invocation if a new set of parameters is to be used.
When the end of options is encountered, getopts exits with a return value greater than zero. OPTIND is set to the index of the first non-option argument, and name is set to ?.
getopts normally parses the positional parameters, but if more arguments are given in args, getopts parses those instead.
getopts can report errors in two ways. If the first character of optstring is a colon, silent error reporting is used. In normal operation diagnostic messages are printed when invalid options or missing option arguments are encountered. If the variable OPTERR is set to 0, no error messages will be displayed, even if the first character of optstring is not a colon.
If an invalid option is seen, getopts places ? into name and, if not silent, prints an error message and unsets OPTARG. If getopts is silent, the option character found is placed in OPTARG and no diagnostic message is printed.
If a required argument is not found, and getopts is not silent, a question mark (?) is placed in name, OPTARG is unset, and a diagnostic message is printed. If getopts is silent, then a colon (:) is placed in name and OPTARG is set to the option character found.
getopts returns true if an option, specified or unspecified, is found. It returns false if the end of options is encountered or an error occurs.
hash [-lr] [-p filename] [-dt] [name]
Each time hash is invoked, the full pathname of the command name is determined by searching the directories in $PATH and remembered. Any previously-remembered pathname is discarded. If the -p option is supplied, no path search is performed, and filename is used as the full file name of the command. The -r option causes the shell to forget all remembered locations. The -d option causes the shell to forget the remembered location of each name. If the -t option is supplied, the full pathname to which each name corresponds is printed. If multiple name arguments are supplied with -t, the name is printed before the hashed full pathname. The -l option causes output to be displayed in a format that may be reused as input. If no arguments are given, or if only -l is supplied, information about remembered commands is printed. The return status is true unless a name is not found or an invalid option is supplied.
help [-dms] [pattern]
Display helpful information about builtin commands. If pattern is specified, help gives detailed help on all commands matching pattern; otherwise help for all the builtins and shell control structures is printed.
-d Display a short description of each pattern
-m Display the description of each pattern in a manpage-like format
-s Display only a short usage synopsis for each pattern
The return status is 0 unless no command matches pattern.
history [n]
history -c
history -d offset
history -anrw [filename]
history -p arg [arg ...]
history -s arg [arg ...]
With no options, display the command history list with line numbers. Lines listed with a * have been modified. An argument of n lists only the last n lines. If the shell variable HISTTIMEFORMAT is set and not null, it is used as a format string for strftime(3) to display the time stamp associated with each displayed history entry. No intervening blank is printed between the formatted time stamp and the history line. If filename is supplied, it is used as the name of the history file; if not, the value of HISTFILE is used. Options, if supplied, have the following meanings:
-c Clear the history list by deleting all the entries.
-d offset
Delete the history entry at position offset.
-a Append the ‘‘new’’ history lines (history lines entered since the beginning of the current bash session) to the history file.
-n Read the history lines not already read from the history file into the current history list. These are lines appended to the history file since the beginning of the current bash session.
-r Read the contents of the history file and use them as the current history.
-w Write the current history to the history file, overwriting the history file’s contents.
-p Perform history substitution on the following args and display the result on the standard output. Does not store the results in the history list. Each arg must be quoted to disable normal history expansion.
-s Store the args in the history list as a single entry. The last command in the history list is removed before the args are added.
If the HISTTIMEFORMAT variable is set, the time stamp information associated with each history entry is written to the history file, marked with the history comment character. When the history file is read, lines beginning with the history comment character followed immediately by a digit are interpreted as timestamps for the previous history line. The return value is 0 unless an invalid option is encountered, an error occurs while reading or writing the history file, an invalid offset is supplied as an argument to -d, or the history expansion supplied as an argument to -p fails.
jobs [-lnprs] [ jobspec ... ]
jobs -x command [ args ... ]
The first form lists the active jobs. The options have the following meanings:
-l List process IDs in addition to the normal information.
-n Display information only about jobs that have changed status since the user was last notified of their status.
-p List only the process ID of the job’s process group leader.
-r Restrict output to running jobs.
-s Restrict output to stopped jobs.
If jobspec is given, output is restricted to information about that job. The return status is 0 unless an invalid option is encountered or an invalid jobspec is supplied.
If the -x option is supplied, jobs replaces any jobspec found in command or args with the corresponding process group ID, and executes command passing it args, returning its exit status.
kill [-s sigspec | -n signum | -sigspec] [pid | jobspec] ...
kill -l [sigspec | exit_status]
Send the signal named by sigspec or signum to the processes named by pid or jobspec. sigspec is either a case-insensitive signal name such as SIGKILL (with or without the SIG prefix) or a signal number; signum is a signal number. If sigspec is not present, then SIGTERM is assumed. An argument of -l lists the signal names. If any arguments are supplied when -l is given, the names of the signals corresponding to the arguments are listed, and the return status is 0. The exit_status argument to -l is a number specifying either a signal number or the exit status of a process terminated by a signal. kill returns true if at least one signal was successfully sent, or false if an error occurs or an invalid option is encountered.
let arg [arg ...]
Each arg is an arithmetic expression to be evaluated (see ARITHMETIC EVALUATION above). If the last arg evaluates to 0, let returns 1; 0 is returned otherwise.
local [option] [name[=value] ...]
For each argument, a local variable named name is created, and assigned value. The option can be any of the options accepted by declare. When local is used within a function, it causes the variable name to have a visible scope restricted to that function and its children. With no operands, local writes a list of local variables to the standard output. It is an error to use local when not within a function. The return status is 0 unless local is used outside a function, an invalid name is supplied, or name is a readonly variable.
logout Exit a login shell.
mapfile [-n count] [-O origin] [-s count] [-t] [-u fd] [-C callback] [-c quantum] [array]
readarray [-n count] [-O origin] [-s count] [-t] [-u fd] [-C callback] [-c quantum] [array]
Read lines from the standard input into the indexed array variable array, or from file descriptor fd if the -u option is supplied. The variable MAPFILE is the default array. Options, if supplied, have the following meanings:
-n Copy at most count lines. If count is 0, all lines are copied.
-O Begin assigning to array at index origin. The default index is 0.
-s Discard the first count lines read.
-t Remove a trailing newline from each line read.
-u Read lines from file descriptor fd instead of the standard input.
-C Evaluate callback each time quantum lines are read. The -c option specifies quantum.
-c Specify the number of lines read between each call to callback.
If -C is specified without -c, the default quantum is 5000. When callback is evaluated, it is supplied the index of the next array element to be assigned and the line to be assigned to that element as additional arguments. callback is evaluated after the line is read but before the array element is assigned.
If not supplied with an explicit origin, mapfile will clear array before assigning to it.
mapfile returns successfully unless an invalid option or option argument is supplied, array is invalid or unassignable, or if array is not an indexed array.
popd [-n] [+n] [-n]
Removes entries from the directory stack. With no arguments, removes the top directory from the stack, and performs a cd to the new top directory. Arguments, if supplied, have the following meanings:
-n Suppresses the normal change of directory when removing directories from the stack, so that only the stack is manipulated.
+n Removes the nth entry counting from the left of the list shown by dirs, starting with zero. For example: popd +0 removes the first directory, popd +1 the second.
-n Removes the nth entry counting from the right of the list shown by dirs, starting with zero. For example: popd -0 removes the last directory, popd -1 the next to last.
If the popd command is successful, a dirs is performed as well, and the return status is 0. popd returns false if an invalid option is encountered, the directory stack is empty, a non-existent directory stack entry is specified, or the directory change fails.
printf [-v var] format [arguments]
Write the formatted arguments to the standard output under the control of the format. The -v option causes the output to be assigned to the variable var rather than being printed to the standard output.
The format is a character string which contains three types of objects: plain characters, which are simply copied to standard output, character escape sequences, which are converted and copied to the standard output, and format specifications, each of which causes printing of the next successive argument. In addition to the standard printf(1) format specifications, printf interprets the following extensions:
%b causes printf to expand backslash escape sequences in the corresponding argument (except that \c terminates output, backslashes in \ , \", and \? are not removed, and octal escapes beginning with \0 may contain up to four digits).
%q causes printf to output the corresponding argument in a format that can be reused as shell input.
%(datefmt)T
causes printf to output the date-time string resulting from using datefmt as a format string for strftime(3). The corresponding argument is an integer representing the number of seconds since the epoch. Two special argument values may be used: -1 represents the current time, and -2 represents the time the shell was invoked.
Arguments to non-string format specifiers are treated as C constants, except that a leading plus or minus sign is allowed, and if the leading character is a single or double quote, the value is the ASCII value of the following character.
The format is reused as necessary to consume all of the arguments. If the format requires more arguments than are supplied, the extra format specifications behave as if a zero value or null string, as appropriate, had been supplied. The return value is zero on success, non-zero on failure.
pushd [-n] [+n] [-n]
pushd [-n] [dir]
Adds a directory to the top of the directory stack, or rotates the stack, making the new top of the stack the current working directory. With no arguments, exchanges the top two directories and returns 0, unless the directory stack is empty. Arguments, if supplied, have the following meanings:
-n Suppresses the normal change of directory when adding directories to the stack, so that only the stack is manipulated.
+n Rotates the stack so that the nth directory (counting from the left of the list shown by dirs, starting with zero) is at the top.
-n Rotates the stack so that the nth directory (counting from the right of the list shown by dirs, starting with zero) is at the top.
dir Adds dir to the directory stack at the top, making it the new current working directory.
If the pushd command is successful, a dirs is performed as well. If the first form is used, pushd returns 0 unless the cd to dir fails. With the second form, pushd returns 0 unless the directory stack is empty, a non-existent directory stack element is specified, or the directory change to the specified new current directory fails.
pwd [-LP]
Print the absolute pathname of the current working directory. The pathname printed contains no symbolic links if the -P option is supplied or the -o physical option to the set builtin command is enabled. If the -L option is used, the pathname printed may contain symbolic links. The return status is 0 unless an error occurs while reading the name of the current directory or an invalid option is supplied.
read [-ers] [-a aname] [-d delim] [-i text] [-n nchars] [-N nchars] [-p prompt] [-t timeout] [-u fd] [name ...]
One line is read from the standard input, or from the file descriptor fd supplied as an argument to the -u option, and the first word is assigned to the first name, the second word to the second name, and so on, with leftover words and their intervening separators assigned to the last name. If there are fewer words read from the input stream than names, the remaining names are assigned empty values. The characters in IFS are used to split the line into words. The backslash character (\) may be used to remove any special meaning for the next character read and for line continuation. Options, if supplied, have the following meanings:
-a aname The words are assigned to sequential indices of the array variable aname, starting at 0. aname is unset before any new values are assigned. Other name arguments are ignored.
-d delim The first character of delim is used to terminate the input line, rather than newline.
-e If the standard input is coming from a terminal, readline (see READLINE above) is used to obtain the line. Readline uses the current (or default, if line editing was not previously active) editing settings.
-i text If readline is being used to read the line, text is placed into the editing buffer before editing begins.
-n nchars
read returns after reading nchars characters rather than waiting for a complete line of input, but honor a delimiter if fewer than nchars characters are read before the delimiter.
-N nchars
read returns after reading exactly nchars characters rather than waiting for a complete line of input, unless EOF is encountered or read times out. Delimiter characters encountered in the input are not treated specially and do not cause read to return until nchars characters are read.
-p prompt
Display prompt on standard error, without a trailing newline, before attempting to read any input. The prompt is displayed only if input is coming from a terminal.
-r Backslash does not act as an escape character. The backslash is considered to be part of the line. In particular, a backslash-newline pair may not be used as a line continuation.
-s Silent mode. If input is coming from a terminal, characters are not echoed.
-t timeout
Cause read to time out and return failure if a complete line of input is not read within timeout seconds. timeout may be a decimal number with a fractional portion following the decimal point. This option is only effective if read is reading input from a terminal, pipe, or other special file; it has no effect when reading from regular files. If timeout is 0, read returns success if input is available on the specified file descriptor, failure otherwise. The exit status is greater than 128 if the timeout is exceeded.
-u fd Read input from file descriptor fd.
If no names are supplied, the line read is assigned to the variable REPLY. The return code is zero, unless end-of-file is encountered, read times out (in which case the return code is greater than 128), or an invalid file descriptor is supplied as the argument to -u.
readonly [-aAf] [-p] [name[=word] ...]
The given names are marked readonly; the values of these names may not be changed by subsequent assignment. If the -f option is supplied, the functions corresponding to the names are so marked. The -a option restricts the variables to indexed arrays; the -A option restricts the variables to associative arrays. If both options are supplied, -A takes precedence. If no name arguments are given, or if the -p option is supplied, a list of all readonly names is printed. The other options may be used to restrict the output to a subset of the set of readonly names. The -p option causes output to be displayed in a format that may be reused as input. If a variable name is followed by =word, the value of the variable is set to word. The return status is 0 unless an invalid option is encountered, one of the names is not a valid shell variable name, or -f is supplied with a name that is not a function.
return [n]
Causes a function to exit with the return value specified by n. If n is omitted, the return status is that of the last command executed in the function body. If used outside a function, but during execution of a script by the . (source) command, it causes the shell to stop executing that script and return either n or the exit status of the last command executed within the script as the exit status of the script. If used outside a function and not during execution of a script by ., the return status is false. Any command associated with the RETURN trap is executed before execution resumes after the function or script.
set [--abefhkmnptuvxBCEHPT] [-o option-name] [arg ...]
set [+abefhkmnptuvxBCEHPT] [+o option-name] [arg ...]
Without options, the name and value of each shell variable are displayed in a format that can be reused as input for setting or resetting the currently-set variables. Read-only variables cannot be reset. In posix mode, only shell variables are listed. The output is sorted according to the current locale. When options are specified, they set or unset shell attributes. Any arguments remaining after option processing are treated as values for the positional parameters and are assigned, in order, to $1, $2, ... $n. Options, if specified, have the following meanings:
-a Automatically mark variables and functions which are modified or created for export to the environment of subsequent commands.
-b Report the status of terminated background jobs immediately, rather than before the next primary prompt. This is effective only when job control is enabled.
-e Exit immediately if a pipeline (which may consist of a single simple command), a subshell command enclosed in parentheses, or one of the commands executed as part of a command list enclosed by braces (see SHELL GRAMMAR above) exits with a non-zero status. The shell does not exit if the command that fails is part of the command list immediately following a while or until keyword, part of the test following the if or elif reserved words, part of any command executed in a && or || list except the command following the final && or ||, any command in a pipeline but the last, or if the command’s return value is being inverted with !. A trap on ERR, if set, is executed before the shell exits. This option applies to the shell environment and each subshell environment separately (see COMMAND EXECUTION ENVIRONMENT above), and may cause subshells to exit before executing all the commands in the subshell.
-f Disable pathname expansion.
-h Remember the location of commands as they are looked up for execution. This is enabled by default.
-k All arguments in the form of assignment statements are placed in the environment for a command, not just those that precede the command name.
-m Monitor mode. Job control is enabled. This option is on by default for interactive shells on systems that support it (see JOB CONTROL above). Background processes run in a separate process group and a line containing their exit status is printed upon their completion.
-n Read commands but do not execute them. This may be used to check a shell script for syntax errors. This is ignored by interactive shells.
-o option-name
The option-name can be one of the following:
allexport
Same as -a.
braceexpand
Same as -B.
emacs Use an emacs-style command line editing interface. This is enabled by default when the shell is interactive, unless the shell is started with the --noediting option. This also affects the editing interface used for read -e.
errexit Same as -e.
errtrace Same as -E.
functrace
Same as -T.
hashall Same as -h.
histexpand
Same as -H.
history Enable command history, as described above under HISTORY. This option is on by default in interactive shells.
ignoreeof
The effect is as if the shell command IGNOREEOF=10 had been executed (see Shell Variables above).
keyword Same as -k.
monitor Same as -m.
noclobber
Same as -C.
noexec Same as -n.
noglob Same as -f.
nolog Currently ignored.
notify Same as -b.
nounset Same as -u.
onecmd Same as -t.
physical Same as -P.
pipefail If set, the return value of a pipeline is the value of the last (rightmost) command to exit with a non-zero status, or zero if all commands in the pipeline exit successfully. This option is disabled by default.
posix Change the behavior of bash where the default operation differs from the POSIX standard to match the standard (posix mode).
privileged
Same as -p.
verbose Same as -v.
vi Use a vi-style command line editing interface. This also affects the editing interface used for read -e.
xtrace Same as -x.
If -o is supplied with no option-name, the values of the current options are printed. If +o is supplied with no option-name, a series of set commands to recreate the current option settings is displayed on the standard output.
-p Turn on privileged mode. In this mode, the $ENV and $BASH_ENV files are not processed, shell functions are not inherited from the environment, and the SHELLOPTS, BASHOPTS, CDPATH, and GLOBIGNORE variables, if they appear in the environment, are ignored. If the shell is started with the effective user (group) id not equal to the real user (group) id, and the -p option is not supplied, these actions are taken and the effective user id is set to the real user id. If the -p option is supplied at startup, the effective user id is not reset. Turning this option off causes the effective user and group ids to be set to the real user and group ids.
-t Exit after reading and executing one command.
-u Treat unset variables and parameters other than the special parameters "@" and "*" as an error when performing parameter expansion. If expansion is attempted on an unset variable or parameter, the shell prints an error message, and, if not interactive, exits with a non-zero status.
-v Print shell input lines as they are read.
-x After expanding each simple command, for command, case command, select command, or arithmetic for command, display the expanded value of PS4, followed by the command and its expanded arguments or associated word list.
-B The shell performs brace expansion (see Brace Expansion above). This is on by default.
-C If set, bash does not overwrite an existing file with the >, >&, and <> redirection operators. This may be overridden when creating output files by using the redirection operator >| instead of >.
-E If set, any trap on ERR is inherited by shell functions, command substitutions, and commands executed in a subshell environment. The ERR trap is normally not inherited in such cases.
-H Enable ! style history substitution. This option is on by default when the shell is interactive.
-P If set, the shell does not follow symbolic links when executing commands such as cd that change the current working directory. It uses the physical directory structure instead. By default, bash follows the logical chain of directories when performing commands which change the current directory.
-T If set, any traps on DEBUG and RETURN are inherited by shell functions, command substitutions, and commands executed in a subshell environment. The DEBUG and RETURN traps are normally not inherited in such cases.
-- If no arguments follow this option, then the positional parameters are unset. Otherwise, the positional parameters are set to the args, even if some of them begin with a -.
- Signal the end of options, cause all remaining args to be assigned to the positional parameters. The -x and -v options are turned off. If there are no args, the positional parameters remain unchanged.
The options are off by default unless otherwise noted. Using + rather than - causes these options to be turned off. The options can also be specified as arguments to an invocation of the shell. The current set of options may be found in $-. The return status is always true unless an invalid option is encountered.
shift [n]
The positional parameters from n+1 ... are renamed to $1 .... Parameters represented by the numbers $# down to $#-n+1 are unset. n must be a non-negative number less than or equal to $#. If n is 0, no parameters are changed. If n is not given, it is assumed to be 1. If n is greater than $#, the positional parameters are not changed. The return status is greater than zero if n is greater than $# or less than zero; otherwise 0.
shopt [-pqsu] [-o] [optname ...]
Toggle the values of variables controlling optional shell behavior. With no options, or with the -p option, a list of all settable options is displayed, with an indication of whether or not each is set. The -p option causes output to be displayed in a form that may be reused as input. Other options have the following meanings:
-s Enable (set) each optname.
-u Disable (unset) each optname.
-q Suppresses normal output (quiet mode); the return status indicates whether the optname is set or unset. If multiple optname arguments are given with -q, the return status is zero if all optnames are enabled; non-zero otherwise.
-o Restricts the values of optname to be those defined for the -o option to the set builtin.
If either -s or -u is used with no optname arguments, the display is limited to those options which are set or unset, respectively. Unless otherwise noted, the shopt options are disabled (unset) by default.
The return status when listing options is zero if all optnames are enabled, non-zero otherwise. When setting or unsetting options, the return status is zero unless an optname is not a valid shell option.
The list of shopt options is:
autocd If set, a command name that is the name of a directory is executed as if it were the argument to the cd command. This option is only used by interactive shells.
cdable_vars
If set, an argument to the cd builtin command that is not a directory is assumed to be the name of a variable whose value is the directory to change to.
cdspell If set, minor errors in the spelling of a directory component in a cd command will be corrected. The errors checked for are transposed characters, a missing character, and one character too many. If a correction is found, the corrected file name is printed, and the command proceeds. This option is only used by interactive shells.
checkhash
If set, bash checks that a command found in the hash table exists before trying to execute it. If a hashed command no longer exists, a normal path search is performed.
checkjobs
If set, bash lists the status of any stopped and running jobs before exiting an interactive shell. If any jobs are running, this causes the exit to be deferred until a second exit is attempted without an intervening command (see JOB CONTROL above). The shell always postpones exiting if any jobs are stopped.
checkwinsize
If set, bash checks the window size after each command and, if necessary, updates the values of LINES and COLUMNS.
cmdhist If set, bash attempts to save all lines of a multiple-line command in the same history entry. This allows easy re-editing of multi-line commands.
compat31 If set, bash changes its behavior to that of version 3.1 with respect to quoted arguments to the [[ conditional command’s =~ operator.
compat32 If set, bash changes its behavior to that of version 3.2 with respect to locale-specific string comparison when using the [[ conditional command’s < and > operators. Bash versions prior to bash-4.1 use ASCII collation and strcmp(3); bash-4.1 and later use the current locale’s collation sequence and strcoll(3).
compat40 If set, bash changes its behavior to that of version 4.0 with respect to locale-specific string comparison when using the [[ conditional command’s < and > operators (see previous item) and the effect of interrupting a command list.
compat41 If set, bash, when in posix mode, treats a single quote in a double-quoted parameter expansion as a special character. The single quotes must match (an even number) and the characters between the single quotes are considered quoted. This is the behavior of posix mode through version 4.1. The default bash behavior remains as in previous versions.
direxpand
If set, bash replaces directory names with the results of word expansion when performing filename completion. This changes the contents of the readline editing buffer. If not set, bash attempts to preserve what the user typed.
dirspell If set, bash attempts spelling correction on directory names during word completion if the directory name initially supplied does not exist.
dotglob If set, bash includes filenames beginning with a ‘.’ in the results of pathname expansion.
execfail If set, a non-interactive shell will not exit if it cannot execute the file specified as an argument to the exec builtin command. An interactive shell does not exit if exec fails.
expand_aliases
If set, aliases are expanded as described above under ALIASES. This option is enabled by default for interactive shells.
extdebug If set, behavior intended for use by debuggers is enabled:
1. The -F option to the declare builtin displays the source file name and line number corresponding to each function name supplied as an argument.
2. If the command run by the DEBUG trap returns a non-zero value, the next command is skipped and not executed.
3. If the command run by the DEBUG trap returns a value of 2, and the shell is executing in a subroutine (a shell function or a shell script executed by the . or source builtins), a call to return is simulated.
4. BASH_ARGC and BASH_ARGV are updated as described in their descriptions above.
5. Function tracing is enabled: command substitution, shell functions, and subshells invoked with ( command ) inherit the DEBUG and RETURN traps.
6. Error tracing is enabled: command substitution, shell functions, and subshells invoked with ( command ) inherit the ERR trap.
extglob If set, the extended pattern matching features described above under Pathname Expansion are enabled.
extquote If set, $ string and $"string" quoting is performed within ${parameter} expansions enclosed in double quotes. This option is enabled by default.
failglob If set, patterns which fail to match filenames during pathname expansion result in an expansion error.
force_fignore
If set, the suffixes specified by the FIGNORE shell variable cause words to be ignored when performing word completion even if the ignored words are the only possible completions. See SHELL VARIABLES above for a description of FIGNORE. This option is enabled by default.
globstar If set, the pattern ** used in a pathname expansion context will match all files and zero or more directories and subdirectories. If the pattern is followed by a /, only directories and subdirectories match.
gnu_errfmt
If set, shell error messages are written in the standard GNU error message format.
histappend
If set, the history list is appended to the file named by the value of the HISTFILE variable when the shell exits, rather than overwriting the file.
histreedit
If set, and readline is being used, a user is given the opportunity to re-edit a failed history substitution.
histverify
If set, and readline is being used, the results of history substitution are not immediately passed to the shell parser. Instead, the resulting line is loaded into the readline editing buffer, allowing further modification.
hostcomplete
If set, and readline is being used, bash will attempt to perform hostname completion when a word containing a @ is being completed (see Completing under READLINE above). This is enabled by default.
huponexit
If set, bash will send SIGHUP to all jobs when an interactive login shell exits.
interactive_comments
If set, allow a word beginning with # to cause that word and all remaining characters on that line to be ignored in an interactive shell (see COMMENTS above). This option is enabled by default.
lastpipe If set, and job control is not active, the shell runs the last command of a pipeline not executed in the background in the current shell environment.
lithist If set, and the cmdhist option is enabled, multi-line commands are saved to the history with embedded newlines rather than using semicolon separators where possible.
login_shell
The shell sets this option if it is started as a login shell (see INVOCATION above). The value may not be changed.
mailwarn If set, and a file that bash is checking for mail has been accessed since the last time it was checked, the message ‘‘The mail in mailfile has been read’’ is displayed.
no_empty_cmd_completion
If set, and readline is being used, bash will not attempt to search the PATH for possible completions when completion is attempted on an empty line.
nocaseglob
If set, bash matches filenames in a case-insensitive fashion when performing pathname expansion (see Pathname Expansion above).
nocasematch
If set, bash matches patterns in a case-insensitive fashion when performing matching while executing case or [[ conditional commands.
nullglob If set, bash allows patterns which match no files (see Pathname Expansion above) to expand to a null string, rather than themselves.
progcomp If set, the programmable completion facilities (see Programmable Completion above) are enabled. This option is enabled by default.
promptvars
If set, prompt strings undergo parameter expansion, command substitution, arithmetic expansion, and quote removal after being expanded as described in PROMPTING above. This option is enabled by default.
restricted_shell
The shell sets this option if it is started in restricted mode (see RESTRICTED SHELL below). The value may not be changed. This is not reset when the startup files are executed, allowing the startup files to discover whether or not a shell is restricted.
shift_verbose
If set, the shift builtin prints an error message when the shift count exceeds the number of positional parameters.
sourcepath
If set, the source (.) builtin uses the value of PATH to find the directory containing the file supplied as an argument. This option is enabled by default.
xpg_echo If set, the echo builtin expands backslash-escape sequences by default.
suspend [-f]
Suspend the execution of this shell until it receives a SIGCONT signal. A login shell cannot be suspended; the -f option can be used to override this and force the suspension. The return status is 0 unless the shell is a login shell and -f is not supplied, or if job control is not enabled.
test expr
[ expr ]
Return a status of 0 or 1 depending on the evaluation of the conditional expression expr. Each operator and operand must be a separate argument. Expressions are composed of the primaries described above under CONDITIONAL EXPRESSIONS. test does not accept any options, nor does it accept and ignore an argument of -- as signifying the end of options.
Expressions may be combined using the following operators, listed in decreasing order of precedence. The evaluation depends on the number of arguments; see below. Operator precedence is used when there are five or more arguments.
! expr True if expr is false.
( expr ) Returns the value of expr. This may be used to override the normal precedence of operators.
expr1 -a expr2
True if both expr1 and expr2 are true.
expr1 -o expr2
True if either expr1 or expr2 is true.
test and [ evaluate conditional expressions using a set of rules based on the number of arguments.
0 arguments
The expression is false.
1 argument
The expression is true if and only if the argument is not null.
2 arguments
If the first argument is !, the expression is true if and only if the second argument is null. If the first argument is one of the unary conditional operators listed above under CONDITIONAL EXPRESSIONS, the expression is true if the unary test is true. If the first argument is not a valid unary conditional operator, the expression is false.
3 arguments
The following conditions are applied in the order listed. If the second argument is one of the binary conditional operators listed above under CONDITIONAL EXPRESSIONS, the result of the expression is the result of the binary test using the first and third arguments as operands. The -a and -o operators are considered binary operators when there are three arguments. If the first argument is !, the value is the negation of the two-argument test using the second and third arguments. If the first argument is exactly ( and the third argument is exactly ), the result is the one-argument test of the second argument. Otherwise, the expression is false.
4 arguments
If the first argument is !, the result is the negation of the three-argument expression composed of the remaining arguments. Otherwise, the expression is parsed and evaluated according to precedence using the rules listed above.
5 or more arguments
The expression is parsed and evaluated according to precedence using the rules listed above.
When used with test or [, the < and > operators sort lexicographically using ASCII ordering.
times Print the accumulated user and system times for the shell and for processes run from the shell. The return status is 0.
trap [-lp] [[arg] sigspec ...]
The command arg is to be read and executed when the shell receives signal(s) sigspec. If arg is absent (and there is a single sigspec) or -, each specified signal is reset to its original disposition (the value it had upon entrance to the shell). If arg is the null string the signal specified by each sigspec is ignored by the shell and by the commands it invokes. If arg is not present and -p has been supplied, then the trap commands associated with each sigspec are displayed. If no arguments are supplied or if only -p is given, trap prints the list of commands associated with each signal. The -l option causes the shell to print a list of signal names and their corresponding numbers. Each sigspec is either a signal name defined in <signal.h>, or a signal number. Signal names are case insensitive and the SIG prefix is optional.
If a sigspec is EXIT (0) the command arg is executed on exit from the shell. If a sigspec is DEBUG, the command arg is executed before every simple command, for command, case command, select command, every arithmetic for command, and before the first command executes in a shell function (see SHELL GRAMMAR above). Refer to the description of the extdebug option to the shopt builtin for details of its effect on the DEBUG trap. If a sigspec is RETURN, the command arg is executed each time a shell function or a script executed with the . or source builtins finishes executing.
If a sigspec is ERR, the command arg is executed whenever a simple command has a non-zero exit status, subject to the following conditions. The ERR trap is not executed if the failed command is part of the command list immediately following a while or until keyword, part of the test in an if statement, part of a command executed in a && or || list, or if the command’s return value is being inverted via !. These are the same conditions obeyed by the errexit option.
Signals ignored upon entry to the shell cannot be trapped or reset. Trapped signals that are not being ignored are reset to their original values in a subshell or subshell environment when one is created. The return status is false if any sigspec is invalid; otherwise trap returns true.
type [-aftpP] name [name ...]
With no options, indicate how each name would be interpreted if used as a command name. If the -t option is used, type prints a string which is one of alias, keyword, function, builtin, or file if name is an alias, shell reserved word, function, builtin, or disk file, respectively. If the name is not found, then nothing is printed, and an exit status of false is returned. If the -p option is used, type either returns the name of the disk file that would be executed if name were specified as a command name, or nothing if type -t name would not return file. The -P option forces a PATH search for each name, even if type -t name would not return file. If a command is hashed, -p and -P print the hashed value, not necessarily the file that appears first in PATH. If the -a option is used, type prints all of the places that contain an executable named name. This includes aliases and functions, if and only if the -p option is not also used. The table of hashed commands is not consulted when using -a. The -f option suppresses shell function lookup, as with the command builtin. type returns true if all of the arguments are found, false if any are not found.
ulimit [-HSTabcdefilmnpqrstuvx [limit]]
Provides control over the resources available to the shell and to processes started by it, on systems that allow such control. The -H and -S options specify that the hard or soft limit is set for the given resource. A hard limit cannot be increased by a non-root user once it is set; a soft limit may be increased up to the value of the hard limit. If neither -H nor -S is specified, both the soft and hard limits are set. The value of limit can be a number in the unit specified for the resource or one of the special values hard, soft, or unlimited, which stand for the current hard limit, the current soft limit, and no limit, respectively. If limit is omitted, the current value of the soft limit of the resource is printed, unless the -H option is given. When more than one resource is specified, the limit name and unit are printed before the value. Other options are interpreted as follows:
-a All current limits are reported
-b The maximum socket buffer size
-c The maximum size of core files created
-d The maximum size of a process’s data segment
-e The maximum scheduling priority ("nice")
-f The maximum size of files written by the shell and its children
-i The maximum number of pending signals
-l The maximum size that may be locked into memory
-m The maximum resident set size (many systems do not honor this limit)
-n The maximum number of open file descriptors (most systems do not allow this value to be set)
-p The pipe size in 512-byte blocks (this may not be set)
-q The maximum number of bytes in POSIX message queues
-r The maximum real-time scheduling priority
-s The maximum stack size
-t The maximum amount of cpu time in seconds
-u The maximum number of processes available to a single user
-v The maximum amount of virtual memory available to the shell and, on some systems, to its children
-x The maximum number of file locks
-T The maximum number of threads
If limit is given, it is the new value of the specified resource (the -a option is display only). If no option is given, then -f is assumed. Values are in 1024-byte increments, except for -t, which is in seconds, -p, which is in units of 512-byte blocks, and -T, -b, -n, and -u, which are unscaled values. The return status is 0 unless an invalid option or argument is supplied, or an error occurs while setting a new limit.
umask [-p] [-S] [mode]
The user file-creation mask is set to mode. If mode begins with a digit, it is interpreted as an octal number; otherwise it is interpreted as a symbolic mode mask similar to that accepted by chmod(1). If mode is omitted, the current value of the mask is printed. The -S option causes the mask to be printed in symbolic form; the default output is an octal number. If the -p option is supplied, and mode is omitted, the output is in a form that may be reused as input. The return status is 0 if the mode was successfully changed or if no mode argument was supplied, and false otherwise.
unalias [-a] [name ...]
Remove each name from the list of defined aliases. If -a is supplied, all alias definitions are removed. The return value is true unless a supplied name is not a defined alias.
unset [-fv] [name ...]
For each name, remove the corresponding variable or function. If no options are supplied, or the -v option is given, each name refers to a shell variable. Read-only variables may not be unset. If -f is specified, each name refers to a shell function, and the function definition is removed. Each unset variable or function is removed from the environment passed to subsequent commands. If any of COMP_WORDBREAKS, RANDOM, SECONDS, LINENO, HISTCMD, FUNCNAME, GROUPS, or DIRSTACK are unset, they lose their special properties, even if they are subsequently reset. The exit status is true unless a name is readonly.
wait [n ...]
Wait for each specified process and return its termination status. Each n may be a process ID or a job specification; if a job spec is given, all processes in that job’s pipeline are waited for. If n is not given, all currently active child processes are waited for, and the return status is zero. If n specifies a non-existent process or job, the return status is 127. Otherwise, the return status is the exit status of the last process or job waited for.
RESTRICTED SHELL
If bash is started with the name rbash, or the -r option is supplied at invocation, the shell becomes restricted. A restricted shell is used to set up an environment more controlled than the standard shell. It behaves identically to bash with the exception that the following are disallowed or not performed:
o changing directories with cd
o setting or unsetting the values of SHELL, PATH, ENV, or BASH_ENV
o specifying command names containing /
o specifying a file name containing a / as an argument to the . builtin command
o specifying a filename containing a slash as an argument to the -p option to the hash builtin command
o importing function definitions from the shell environment at startup
o parsing the value of SHELLOPTS from the shell environment at startup
o redirecting output using the >, >|, <>, >&, &>, and >> redirection operators
o using the exec builtin command to replace the shell with another command
o adding or deleting builtin commands with the -f and -d options to the enable builtin command
o using the enable builtin command to enable disabled shell builtins
o specifying the -p option to the command builtin command
o turning off restricted mode with set +r or set +o restricted.
These restrictions are enforced after any startup files are read.
When a command that is found to be a shell script is executed (see COMMAND EXECUTION above), rbash turns off any restrictions in the shell spawned to execute the script.
SEE ALSO
Bash Reference Manual, Brian Fox and Chet Ramey
The Gnu Readline Library, Brian Fox and Chet Ramey
The Gnu History Library, Brian Fox and Chet Ramey
Portable Operating System Interface (POSIX) Part 2: Shell and Utilities, IEEE
sh(1), ksh(1), csh(1)
emacs(1), vi(1)
readline(3)
FILES
/bin/bash
The bash executable
/etc/profile
The systemwide initialization file, executed for login shells
/etc/bash.bashrc
The systemwide per-interactive-shell startup file
/etc/bash.bash.logout
The systemwide login shell cleanup file, executed when a login shell exits
~/.bash_profile
The personal initialization file, executed for login shells
~/.bashrc
The individual per-interactive-shell startup file
~/.bash_logout
The individual login shell cleanup file, executed when a login shell exits
~/.inputrc
Individual readline initialization file
AUTHORS
Brian Fox, Free Software Foundation
[email protected]
Chet Ramey, Case Western Reserve University
[email protected]
BUG REPORTS
If you find a bug in bash, you should report it. But first, you should make sure that it really is a bug, and that it appears in the latest version of bash. The latest version is always available from ftp://ftp.gnu.org/pub/gnu/bash/.
Once you have determined that a bug actually exists, use the bashbug command to submit a bug report. If you have a fix, you are encouraged to mail that as well! Suggestions and ‘philosophical’ bug reports may be mailed to [email protected] or posted to the Usenet newsgroup gnu.bash.bug.
ALL bug reports should include:
The version number of bash
The hardware and operating system
The compiler used to compile
A description of the bug behaviour
A short script or ‘recipe’ which exercises the bug
bashbug inserts the first three items automatically into the template it provides for filing a bug report.
Comments and bug reports concerning this manual page should be directed to [email protected].
BUGS
It’s too big and too slow.
There are some subtle differences between bash and traditional versions of sh, mostly because of the POSIX specification.
Aliases are confusing in some uses.
Shell builtin commands and functions are not stoppable/restartable.
Compound commands and command sequences of the form ‘a ; b ; c’ are not handled gracefully when process suspension is attempted. When a process is stopped, the shell immediately executes the next command in the sequence. It suffices to place the sequence of commands between parentheses to force it into a subshell, which may be stopped as a unit.
Array variables may not (yet) be exported.
There may be only one active coprocess at a time.
GNU Bash-4.2 BASH (1) 2010 December 28
blog comments powered by Disqus
|
{
"url": "http://manpages.sgvulcan.com/bash.1.php",
"source_domain": "manpages.sgvulcan.com",
"snapshot_id": "crawl=CC-MAIN-2017-47",
"warc_metadata": {
"Content-Length": "463491",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WSN7UII5CMJTBFEEBUM3K3X6HS4FJHWB",
"WARC-Concurrent-To": "<urn:uuid:93ac9675-9789-49bf-8ee6-8389eeda083c>",
"WARC-Date": "2017-11-21T15:24:32Z",
"WARC-IP-Address": "176.58.110.130",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:C4YYJGWJ7MUOXZ4OSNIGSYDW63YUKV2K",
"WARC-Record-ID": "<urn:uuid:3df8121e-2dd4-4a74-9098-defa0432b08a>",
"WARC-Target-URI": "http://manpages.sgvulcan.com/bash.1.php",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f156262c-8369-49fc-a62f-6dee0b666b77>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-155-20-164.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-47\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for November 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
1,
2,
37,
38,
43,
44,
74,
75,
84,
85,
94,
104,
116,
124,
134,
145,
157,
178,
193,
204,
227,
244,
276,
285,
293,
304,
331,
355,
376,
388,
398,
419,
440,
465,
491,
517,
543,
563,
587,
606,
618,
641,
665,
698,
750,
800,
820,
828,
838,
868,
880,
888,
898,
907,
922,
947,
990,
1022,
1047,
1070,
1086,
1107,
1126,
1155,
1163,
1186,
1208,
1223,
1229,
1237,
1249,
1254,
1255,
1264,
1265,
1287,
1288,
1298,
1299,
1367,
1368,
1380,
1381,
1584,
1585,
1785,
1786,
1794,
1795,
2015,
2016,
2198,
2256,
2340,
2431,
2653,
2905,
2926,
3337,
3517,
3675,
3676,
3687,
3868,
3886,
3977,
3992,
4012,
4085,
4102,
4116,
4317,
4343,
4355,
4446,
4458,
4707,
4927,
5059,
5072,
5133,
5143,
5163,
5173,
5272,
5273,
5283,
5284,
5956,
5957,
5968,
5969,
6077,
6078,
6412,
6413,
6654,
6655,
7116,
7117,
7220,
7221,
7550,
7551,
7848,
7849,
7895,
7896,
7972,
7973,
8913,
8914,
9213,
9214,
9824,
9825,
10320,
10321,
10333,
10334,
10407,
10429,
10524,
10692,
10706,
10780,
10781,
10805,
10806,
10823,
10903,
10904,
10936,
10937,
10952,
10953,
11197,
11198,
11289,
11290,
11304,
11305,
11325,
11326,
11633,
11634,
11742,
11743,
11757,
11758,
11888,
11889,
11939,
11940,
12376,
12377,
12889,
12890,
13414,
13415,
13670,
13671,
13755,
13756,
13766,
13767,
13920,
13921,
14029,
14030,
14130,
14131,
14503,
14504,
14700,
14701,
14722,
14723,
14802,
14803,
14827,
14828,
14849,
14850,
15026,
15027,
15049,
15050,
15094,
15364,
15374,
15824,
15839,
16087,
16104,
16614,
16615,
16705,
16706,
16851,
16852,
17329,
17330,
18288,
18289,
18390,
18391,
18393,
18408,
18508,
18521,
18552,
18579,
18632,
18659,
18712,
18874,
18924,
19416,
19465,
19985,
20026,
20871,
20912,
22072,
22092,
22520,
22550,
22580,
23029,
23030,
23046,
23047,
23316,
23317,
23348,
23349,
23386,
23387,
24454,
24455,
24519,
24520,
24551,
24552,
24733,
24772,
24822,
25668,
25669,
25678,
25679,
26104,
26105,
26113,
26114,
26371,
26372,
26512,
26513,
26694,
26695,
26787,
26788,
27131,
27132,
27322,
27323,
27944,
27945,
28043,
28044,
28266,
28267,
28283,
28296,
28299,
28302,
28322,
28335,
28347,
28366,
28384,
28400,
28413,
28428,
28447,
28533,
28626,
28738,
28749,
28861,
28887,
28888,
28970,
28971,
29251,
29252,
29263,
29264,
29611,
29612,
29814,
29815,
29872,
29873,
29886,
29887,
30554,
30555,
31358,
31359,
31385,
31386,
31802,
31803,
31936,
31937,
31960,
31961,
32084,
32554,
33083,
33144,
33224,
33378,
33507,
33600,
33983,
34435,
34436,
34456,
34457,
34503,
34504,
34577,
34586,
34999,
35007,
35179,
35192,
35446,
35456,
35929,
35939,
36384,
36394,
36655,
36668,
36864,
36886,
36938,
36950,
37308,
37321,
37647,
37659,
37922,
37936,
38038,
38052,
38203,
38204,
38261,
38318,
38352,
38388,
38439,
38479,
38480,
38493,
38564,
38575,
38795,
38804,
38895,
38905,
39093,
39104,
39480,
39490,
39989,
40005,
40210,
40221,
40561,
40717,
40726,
41238,
41354,
41363,
41832,
41833,
42190,
42191,
42437,
42445,
42609,
42618,
42671,
42680,
42817,
43177,
43186,
43363,
43371,
43498,
43562,
43684,
43805,
43939,
43950,
44141,
44211,
44271,
44538,
44552,
44653,
44668,
44792,
44888,
44896,
45236,
45246,
45659,
45726,
45831,
45966,
45975,
46345,
46359,
46857,
47058,
47066,
47213,
47223,
47405,
47583,
47654,
47708,
47716,
48041,
48050,
48229,
48240,
48486,
48498,
49356,
49365,
49557,
49570,
49918,
49929,
50590,
50599,
50706,
50721,
51116,
51283,
51292,
51853,
52043,
52053,
52458,
52466,
52571,
52692,
52798,
52809,
53052,
53061,
53207,
53219,
53314,
53325,
53400,
53549,
53741,
53751,
54057,
54066,
54363,
54364,
54433,
54434,
54581,
54582,
54807,
55297,
55313,
55605,
55620,
55703,
55718,
55957,
56097,
56217,
56321,
56601,
56788,
56799,
57160,
57161,
57177,
57215,
57270,
57327,
57378,
57379,
57701,
57852,
58083,
58511,
58632,
58644,
59539,
59549,
60358,
60359,
60370,
60371,
60822,
60823,
61374,
61375,
61429,
61430,
61572,
61573,
62021,
62022,
62089,
62090,
62245,
62246,
63405,
63406,
63518,
63519,
63828,
63829,
64233,
64234,
64244,
64245,
64522,
64523,
64730,
64731,
64829,
64830,
65105,
65106,
65126,
65127,
65663,
65664,
65833,
65834,
66619,
66620,
66891,
66892,
67306,
67307,
67444,
67445,
67491,
67492,
67495,
67547,
67548,
68145,
68146,
68166,
68167,
68818,
68819,
69435,
69436,
69519,
69520,
69814,
69815,
69839,
69840,
70165,
70166,
70380,
70381,
70394,
70623,
71187,
71320,
71518,
71537,
71678,
71697,
71926,
71945,
72216,
72235,
72361,
72381,
72408,
74010,
74022,
74034,
74296,
74308,
74320,
74607,
74621,
74909,
74927,
74946,
75618,
75636,
75655,
76341,
76369,
77275,
77296,
77318,
77339,
77361,
78240,
78241,
78266,
78267,
78369,
78370,
78381,
78382,
78385,
78395,
78396,
78736,
78737,
79075,
79076,
79199,
79200,
79322,
79323,
79348,
79349,
79496,
79497,
79513,
79514,
79607,
79608,
79892,
79893,
80081,
80082,
80107,
80108,
80650,
80651,
80803,
80804,
80823,
80824,
80983,
80984,
81897,
81898,
82160,
82161,
82222,
82223,
82246,
82247,
83577,
83578,
84232,
84233,
84250,
84251,
84592,
84593,
84653,
84654,
84988,
85020,
85674,
85675,
85829,
85830,
85914,
86050,
86051,
86244,
86245,
86320,
86321,
86624,
86625,
86641,
86696,
86712,
86769,
86785,
86841,
86857,
86893,
86909,
86961,
86962,
86980,
86981,
87133,
87134,
87146,
87147,
87554,
87555,
87925,
87926,
88247,
88248,
88577,
88578,
88655,
88656,
88674,
88675,
88762,
88763,
88781,
88782,
88953,
88954,
89068,
89069,
89080,
89142,
89153,
89188,
89200,
89235,
89247,
89282,
89301,
89472,
89491,
89662,
89663,
89730,
89731,
89878,
89879,
89970,
89971,
89993,
89994,
90189,
90190,
90235,
90236,
90245,
90246,
90269,
90270,
90556,
90557,
90603,
90604,
90613,
90614,
91028,
91029,
91061,
91062,
91319,
91320,
91364,
91365,
91375,
91376,
91427,
91428,
91611,
91612,
91686,
91687,
91694,
91695,
91699,
91706,
91707,
91784,
91785,
91796,
91797,
91846,
91847,
92028,
92029,
92093,
92094,
92102,
92103,
92138,
92139,
92151,
92152,
92171,
92172,
92419,
92420,
92453,
92454,
92464,
92486,
92496,
92497,
93014,
93015,
93233,
93234,
93251,
93252,
93296,
93297,
93305,
93306,
93378,
93379,
93412,
93413,
93438,
93439,
93449,
93450,
93836,
93837,
93850,
93851,
93861,
93862,
94253,
94254,
94282,
94283,
94308,
94309,
94321,
94322,
94486,
94487,
94523,
94524,
94536,
94537,
94657,
94658,
94711,
94712,
94737,
94738,
94748,
94749,
94955,
94956,
94964,
94965,
95992,
95993,
96086,
96087,
96234,
96235,
96420,
96421,
97324,
97325,
97394,
97395,
97405,
97406,
98133,
98134,
98711,
98712,
98879,
98880,
99065,
99066,
99463,
99464,
100151,
100152,
100375,
100376,
100398,
100399,
100921,
100922,
100932,
100977,
100987,
101030,
101055,
101088,
101106,
101148,
101174,
101210,
101220,
101233,
101263,
101277,
101300,
101313,
101328,
101342,
101357,
101380,
101414,
101427,
101441,
101449,
102107,
102108,
102675,
102676,
102820,
102821,
102845,
102846,
103338,
103339,
103489,
103490,
103625,
103626,
103655,
103712,
103773,
103821,
103850,
103901,
103950,
104002,
104061,
104117,
104162,
104224,
104291,
104351,
104396,
104443,
104511,
104563,
104637,
104704,
104749,
104765,
104835,
104851,
104960,
104976,
105052,
105063,
105199,
105210,
105283,
105293,
105333,
105340,
105350,
105392,
105411,
105429,
105524,
105543,
105580,
105598,
105656,
105674,
105731,
105744,
106021,
106022,
106047,
106048,
106179,
106327,
106538,
106606,
106807,
107165,
107166,
107342,
107343,
107695,
107696,
107714,
107715,
107860,
107861,
108182,
108183,
108991,
108992,
109268,
109269,
109742,
109743,
110197,
110198,
110228,
110229,
110302,
110410,
110512,
110595,
110623,
110746,
110845,
110938,
110965,
111000,
111098,
111325,
111429,
111461,
111491,
111615,
111745,
111841,
111842,
112318,
112319,
112497,
112498,
112744,
112745,
112757,
112758,
112900,
112901,
113642,
113643,
113879,
113880,
114063,
114064,
114209,
114210,
114222,
114223,
114634,
114635,
114902,
114903,
115066,
115067,
115177,
115178,
115373,
115374,
115557,
115558,
115566,
115567,
115881,
115882,
116248,
116249,
116676,
116677,
116803,
116804,
117222,
117223,
117235,
117236,
117527,
117528,
117757,
117758,
117768,
117769,
118036,
118037,
118882,
118883,
119628,
119629,
120698,
120699,
120929,
120930,
121284,
121285,
121748,
121749,
121759,
121760,
122081,
122113,
122177,
122188,
122367,
122402,
122438,
122454,
122507,
122559,
122570,
122589,
122674,
122721,
122768,
122812,
122856,
122892,
122928,
122989,
123107,
123193,
123231,
123269,
123318,
123375,
123390,
123511,
123556,
123557,
124145,
124146,
124155,
124156,
124728,
124729,
124751,
124752,
125196,
125197,
125578,
125579,
125909,
125910,
125938,
125939,
126548,
126549,
126689,
126690,
126711,
126712,
126744,
126745,
126748,
126777,
126860,
126861,
126982,
126983,
127110,
127111,
127137,
127138,
127462,
127463,
127581,
127582,
127612,
127644,
127666,
127667,
127910,
127911,
128237,
128238,
128265,
128295,
128322,
128323,
128507,
128508,
128560,
128561,
128580,
128596,
128619,
128632,
128644,
128654,
128655,
128756,
128757,
128773,
128786,
128796,
128809,
128820,
128839,
128857,
128873,
128959,
129052,
129053,
129354,
129355,
129602,
129603,
129626,
129627,
129773,
129774,
129798,
129799,
130127,
130128,
130149,
130402,
130430,
130576,
130598,
130754,
130783,
130881,
130918,
131186,
131215,
131621,
131639,
131845,
131870,
132021,
132042,
132175,
132204,
132357,
132377,
132514,
132535,
132723,
132742,
132827,
132856,
133004,
133021,
133166,
133195,
133397,
133414,
133645,
133678,
133918,
133933,
134237,
134259,
134324,
134350,
134449,
134482,
134620,
134644,
134882,
134917,
135066,
135084,
135214,
135236,
135352,
135389,
135524,
135552,
135764,
135792,
135993,
136022,
136364,
136390,
136760,
136780,
136917,
136918,
136954,
136955,
137193,
137424,
137706,
138062,
138468,
138469,
138478,
138515,
138537,
138544,
138545,
138626,
138709,
138882,
138883,
138906,
138907,
138921,
138922,
139113,
139114,
139845,
139846,
140281,
140282,
140468,
140469,
140669,
140670,
140697,
140698,
141091,
141092,
141116,
141117,
141141,
141182,
141200,
141231,
141250,
141278,
141298,
141323,
141342,
141454,
141474,
141600,
141619,
141719,
141739,
141853,
141872,
142014,
142034,
142062,
142063,
142105,
142106,
142136,
142388,
142411,
142488,
142507,
142583,
142610,
142651,
142672,
142752,
142781,
142909,
142938,
143067,
143112,
143245,
143290,
143393,
143416,
143569,
143593,
143747,
143768,
144189,
144860,
144886,
145078,
145104,
145221,
145233,
145369,
145387,
145490,
145520,
145579,
145611,
145642,
145669,
145817,
145851,
146023,
146024,
146055,
146056,
146074,
146262,
146292,
146405,
146434,
146578,
146603,
146712,
146733,
146759,
146792,
146822,
146844,
147070,
147092,
147269,
147287,
147410,
147430,
147553,
147575,
147700,
147715,
148253,
148254,
148278,
148279,
148295,
148346,
148378,
148424,
148448,
148548,
148564,
148633,
148649,
148809,
148839,
148930,
148952,
149118,
149154,
149251,
149274,
149385,
149406,
149545,
149575,
149618,
149630,
149669,
149689,
149739,
149758,
149858,
149876,
149978,
149989,
150047,
150062,
150147,
150148,
150170,
150171,
150207,
150319,
150338,
150978,
150979,
150994,
150995,
151010,
151353,
151380,
151438,
151463,
151569,
151583,
152153,
152176,
152359,
152379,
152591,
152615,
152671,
152709,
152794,
152818,
152892,
152930,
153015,
153039,
153119,
153157,
153248,
153272,
153346,
153384,
153469,
153492,
153731,
153768,
153857,
153890,
154025,
154040,
154180,
154207,
154371,
154372,
154392,
154393,
154417,
154486,
154508,
154601,
154629,
154749,
154750,
154768,
154769,
154797,
154907,
154919,
155024,
155066,
155182,
155200,
155266,
155286,
155343,
155361,
155493,
155512,
155559,
155585,
155683,
155717,
155857,
155880,
156015,
156049,
156190,
156208,
156643,
156664,
157328,
157353,
157552,
157577,
157804,
157833,
158034,
158049,
158250,
158265,
158478,
158490,
158695,
158727,
158793,
158794,
158822,
158823,
159068,
159069,
159743,
159744,
159933,
159934,
160197,
160198,
160468,
160469,
161059,
161060,
161869,
161870,
162111,
162112,
162358,
162359,
162877,
162878,
163091,
163092,
163278,
163279,
163463,
163464,
164089,
164090,
164433,
164434,
165164,
165165,
165366,
165367,
165388,
165390,
165461,
165463,
165497,
165498,
165506,
165507,
166042,
166043,
167389,
167390,
167750,
167751,
168389,
168390,
168408,
168409,
168794,
168795,
169026,
169027,
169870,
169871,
170120,
170121,
170980,
170981,
171239,
171240,
171262,
171263,
171442,
171443,
171609,
171637,
171679,
171742,
171750,
171858,
171870,
172054,
172072,
172218,
172259,
172260,
172281,
172282,
172652,
172653,
172662,
172722,
172738,
172777,
172798,
172855,
172901,
173076,
173096,
173149,
173257,
173258,
173272,
173273,
173404,
173405,
173469,
173530,
173597,
173635,
173682,
173745,
173831,
173842,
174328,
174364,
174672,
174744,
174745,
174768,
174769,
175323,
175324,
175338,
175476,
175499,
175527,
176337,
176367,
176878,
176895,
177230,
177258,
177315,
177344,
177385,
177423,
177445,
177807,
177817,
178073,
178118,
178206,
178260,
178378,
178457,
178543,
178595,
178607,
178642,
178654,
178706,
178718,
178765,
178775,
178816,
178840,
179238,
179321,
179331,
179588,
179622,
179981,
179995,
180641,
180665,
181746,
181779,
182587,
182611,
182975,
182976,
183220,
183221,
183314,
183315,
183429,
183486,
183516,
184223,
184224,
184364,
184365,
184598,
184613,
184755,
184767,
184856,
184945,
185026,
185036,
185286,
185387,
185555,
185648,
185696,
185727,
185763,
185833,
185885,
185895,
185943,
185986,
186027,
186098,
186144,
186179,
186227,
186237,
186284,
186369,
186439,
186498,
186555,
186607,
186668,
186727,
186748,
186805,
186851,
186919,
187029,
187041,
187222,
187322,
187436,
187536,
187548,
187774,
187787,
188119,
188405,
188406,
188451,
189115,
189116,
189304,
189305,
189318,
189646,
189693,
189740,
190891,
190953,
191019,
191047,
191197,
191332,
191445,
191618,
191753,
191822,
192757,
192780,
193042,
193167,
193293,
193355,
193455,
193509,
193613,
193724,
193756,
194417,
194439,
195044,
195060,
195073,
195100,
195103,
195106,
195126,
195139,
195151,
195170,
195188,
195204,
195217,
195311,
195404,
195516,
195527,
195639,
195684,
196861,
196876,
197114,
197157,
197973,
197982,
198155,
198186,
198196,
198817,
198853,
198875,
199445,
199446,
199933,
199934,
200173,
200174,
200638,
200639,
200652,
201050,
201080,
201971,
201972,
202148,
202149,
202271,
202272,
202639,
202640,
202867,
202868,
203131,
203132,
203277,
203278,
203316,
204233,
204255,
204470,
204517,
204585,
204641,
204699,
204711,
204722,
204740,
204765,
204790,
204815,
205396,
205451,
205461,
205508,
205637,
205827,
205905,
205996,
206206,
206338,
206925,
206955,
206984,
207065,
207124,
207238,
207301,
207337,
207373,
207544,
207545,
207732,
207733,
207794,
207826,
208558,
208576,
208738,
208772,
209309,
209336,
209426,
209518,
209745,
209811,
209880,
209919,
209969,
210038,
210126,
210193,
210503,
210504,
210594,
210595,
210752,
210753,
210773,
210975,
211101,
211266,
211437,
211697,
211732,
211937,
211938,
212350,
212584,
212685,
212697,
213025,
213263,
213264,
213555,
213556,
213577,
213594,
213891,
214013,
214146,
214280,
214373,
214707,
214717,
215126,
215238,
215880,
216063,
216159,
216369,
216483,
216493,
216675,
216685,
216973,
216983,
217149,
217331,
217410,
217421,
217944,
217986,
218254,
218293,
219198,
219209,
219836,
219891,
219945,
220516,
220646,
220806,
221716,
221747,
221849,
221994,
222266,
222407,
222422,
222469,
222479,
222493,
222505,
222519,
222749,
222769,
222790,
222800,
222814,
222834,
222845,
222859,
222977,
222987,
223087,
223107,
223127,
223137,
223151,
223170,
223189,
223214,
223233,
223253,
223272,
223293,
223513,
223643,
223654,
223668,
223688,
223796,
223815,
223816,
224043,
224694,
224743,
225029,
225074,
225295,
225385,
225584,
225770,
225870,
226169,
226385,
226561,
226764,
227079,
227089,
227521,
227554,
227885,
227915,
227948,
228179,
228272,
228479,
228480,
228684,
228685,
228715,
228716,
228884,
228896,
229051,
229391,
229401,
229571,
229581,
229892,
229905,
230022,
230176,
230320,
230641,
230882,
231239,
231249,
231478,
231628,
231727,
231916,
231931,
232054,
232122,
232269,
232381,
232592,
232673,
232819,
232948,
233057,
233211,
233323,
233337,
233610,
233827,
233838,
233923,
233934,
234085,
234096,
234208,
234219,
234444,
234457,
234657,
234667,
234750,
234771,
234967,
235126,
235300,
235312,
235429,
235607,
235631,
235782,
235793,
235923,
235935,
236071,
236213,
236353,
236364,
236569,
236586,
236843,
236857,
236975,
236986,
237144,
237225,
237226,
237239,
237532,
237542,
237551,
237903,
237904,
238134,
238164,
238265,
238280,
238321,
238336,
238377,
238476,
238477,
238489,
238516,
238527,
238593,
238605,
238950,
238962,
239616,
239628,
239859,
239879,
239974,
239975,
240068,
240069,
240195,
240226,
241066,
241067,
241646,
241647,
242116,
242117,
242405,
242406,
242436,
243603,
243643,
244543,
244578,
244612,
244654,
244702,
244746,
244813,
244854,
244905,
244977,
245073,
245131,
245186,
245231,
245257,
245302,
245364,
245465,
245501,
245534,
245959,
245982,
246570,
246594,
246773,
246796,
247410,
247423,
247882,
247883,
247900,
247901,
248210,
248241,
248308,
248348,
248428,
248531,
248602,
248673,
248752,
248827,
248922,
248991,
249049,
249113,
249179,
249180,
249350,
249351,
249360,
249361,
249409,
249460,
249510,
249588,
249610,
249626,
249638,
249640,
249641,
249647,
249648,
249658,
249680,
249693,
249757,
249774,
249826,
249848,
249925,
249941,
250003,
250013,
250065,
250080,
250157,
250168,
250210,
250211,
250219,
250220,
250256,
250269,
250270,
250314,
250334,
250335,
250347,
250348,
250582,
250583,
250870,
250871,
250903,
250904,
250931,
250965,
250994,
251029,
251080,
251082,
251189,
251190,
251286,
251287,
251292,
251293,
251320,
251321,
251443,
251444,
251480,
251481,
251549,
251550,
251898,
251899,
251942,
251943,
251993,
251994,
251995,
252034
],
"line_end_idx": [
1,
2,
37,
38,
43,
44,
74,
75,
84,
85,
94,
104,
116,
124,
134,
145,
157,
178,
193,
204,
227,
244,
276,
285,
293,
304,
331,
355,
376,
388,
398,
419,
440,
465,
491,
517,
543,
563,
587,
606,
618,
641,
665,
698,
750,
800,
820,
828,
838,
868,
880,
888,
898,
907,
922,
947,
990,
1022,
1047,
1070,
1086,
1107,
1126,
1155,
1163,
1186,
1208,
1223,
1229,
1237,
1249,
1254,
1255,
1264,
1265,
1287,
1288,
1298,
1299,
1367,
1368,
1380,
1381,
1584,
1585,
1785,
1786,
1794,
1795,
2015,
2016,
2198,
2256,
2340,
2431,
2653,
2905,
2926,
3337,
3517,
3675,
3676,
3687,
3868,
3886,
3977,
3992,
4012,
4085,
4102,
4116,
4317,
4343,
4355,
4446,
4458,
4707,
4927,
5059,
5072,
5133,
5143,
5163,
5173,
5272,
5273,
5283,
5284,
5956,
5957,
5968,
5969,
6077,
6078,
6412,
6413,
6654,
6655,
7116,
7117,
7220,
7221,
7550,
7551,
7848,
7849,
7895,
7896,
7972,
7973,
8913,
8914,
9213,
9214,
9824,
9825,
10320,
10321,
10333,
10334,
10407,
10429,
10524,
10692,
10706,
10780,
10781,
10805,
10806,
10823,
10903,
10904,
10936,
10937,
10952,
10953,
11197,
11198,
11289,
11290,
11304,
11305,
11325,
11326,
11633,
11634,
11742,
11743,
11757,
11758,
11888,
11889,
11939,
11940,
12376,
12377,
12889,
12890,
13414,
13415,
13670,
13671,
13755,
13756,
13766,
13767,
13920,
13921,
14029,
14030,
14130,
14131,
14503,
14504,
14700,
14701,
14722,
14723,
14802,
14803,
14827,
14828,
14849,
14850,
15026,
15027,
15049,
15050,
15094,
15364,
15374,
15824,
15839,
16087,
16104,
16614,
16615,
16705,
16706,
16851,
16852,
17329,
17330,
18288,
18289,
18390,
18391,
18393,
18408,
18508,
18521,
18552,
18579,
18632,
18659,
18712,
18874,
18924,
19416,
19465,
19985,
20026,
20871,
20912,
22072,
22092,
22520,
22550,
22580,
23029,
23030,
23046,
23047,
23316,
23317,
23348,
23349,
23386,
23387,
24454,
24455,
24519,
24520,
24551,
24552,
24733,
24772,
24822,
25668,
25669,
25678,
25679,
26104,
26105,
26113,
26114,
26371,
26372,
26512,
26513,
26694,
26695,
26787,
26788,
27131,
27132,
27322,
27323,
27944,
27945,
28043,
28044,
28266,
28267,
28283,
28296,
28299,
28302,
28322,
28335,
28347,
28366,
28384,
28400,
28413,
28428,
28447,
28533,
28626,
28738,
28749,
28861,
28887,
28888,
28970,
28971,
29251,
29252,
29263,
29264,
29611,
29612,
29814,
29815,
29872,
29873,
29886,
29887,
30554,
30555,
31358,
31359,
31385,
31386,
31802,
31803,
31936,
31937,
31960,
31961,
32084,
32554,
33083,
33144,
33224,
33378,
33507,
33600,
33983,
34435,
34436,
34456,
34457,
34503,
34504,
34577,
34586,
34999,
35007,
35179,
35192,
35446,
35456,
35929,
35939,
36384,
36394,
36655,
36668,
36864,
36886,
36938,
36950,
37308,
37321,
37647,
37659,
37922,
37936,
38038,
38052,
38203,
38204,
38261,
38318,
38352,
38388,
38439,
38479,
38480,
38493,
38564,
38575,
38795,
38804,
38895,
38905,
39093,
39104,
39480,
39490,
39989,
40005,
40210,
40221,
40561,
40717,
40726,
41238,
41354,
41363,
41832,
41833,
42190,
42191,
42437,
42445,
42609,
42618,
42671,
42680,
42817,
43177,
43186,
43363,
43371,
43498,
43562,
43684,
43805,
43939,
43950,
44141,
44211,
44271,
44538,
44552,
44653,
44668,
44792,
44888,
44896,
45236,
45246,
45659,
45726,
45831,
45966,
45975,
46345,
46359,
46857,
47058,
47066,
47213,
47223,
47405,
47583,
47654,
47708,
47716,
48041,
48050,
48229,
48240,
48486,
48498,
49356,
49365,
49557,
49570,
49918,
49929,
50590,
50599,
50706,
50721,
51116,
51283,
51292,
51853,
52043,
52053,
52458,
52466,
52571,
52692,
52798,
52809,
53052,
53061,
53207,
53219,
53314,
53325,
53400,
53549,
53741,
53751,
54057,
54066,
54363,
54364,
54433,
54434,
54581,
54582,
54807,
55297,
55313,
55605,
55620,
55703,
55718,
55957,
56097,
56217,
56321,
56601,
56788,
56799,
57160,
57161,
57177,
57215,
57270,
57327,
57378,
57379,
57701,
57852,
58083,
58511,
58632,
58644,
59539,
59549,
60358,
60359,
60370,
60371,
60822,
60823,
61374,
61375,
61429,
61430,
61572,
61573,
62021,
62022,
62089,
62090,
62245,
62246,
63405,
63406,
63518,
63519,
63828,
63829,
64233,
64234,
64244,
64245,
64522,
64523,
64730,
64731,
64829,
64830,
65105,
65106,
65126,
65127,
65663,
65664,
65833,
65834,
66619,
66620,
66891,
66892,
67306,
67307,
67444,
67445,
67491,
67492,
67495,
67547,
67548,
68145,
68146,
68166,
68167,
68818,
68819,
69435,
69436,
69519,
69520,
69814,
69815,
69839,
69840,
70165,
70166,
70380,
70381,
70394,
70623,
71187,
71320,
71518,
71537,
71678,
71697,
71926,
71945,
72216,
72235,
72361,
72381,
72408,
74010,
74022,
74034,
74296,
74308,
74320,
74607,
74621,
74909,
74927,
74946,
75618,
75636,
75655,
76341,
76369,
77275,
77296,
77318,
77339,
77361,
78240,
78241,
78266,
78267,
78369,
78370,
78381,
78382,
78385,
78395,
78396,
78736,
78737,
79075,
79076,
79199,
79200,
79322,
79323,
79348,
79349,
79496,
79497,
79513,
79514,
79607,
79608,
79892,
79893,
80081,
80082,
80107,
80108,
80650,
80651,
80803,
80804,
80823,
80824,
80983,
80984,
81897,
81898,
82160,
82161,
82222,
82223,
82246,
82247,
83577,
83578,
84232,
84233,
84250,
84251,
84592,
84593,
84653,
84654,
84988,
85020,
85674,
85675,
85829,
85830,
85914,
86050,
86051,
86244,
86245,
86320,
86321,
86624,
86625,
86641,
86696,
86712,
86769,
86785,
86841,
86857,
86893,
86909,
86961,
86962,
86980,
86981,
87133,
87134,
87146,
87147,
87554,
87555,
87925,
87926,
88247,
88248,
88577,
88578,
88655,
88656,
88674,
88675,
88762,
88763,
88781,
88782,
88953,
88954,
89068,
89069,
89080,
89142,
89153,
89188,
89200,
89235,
89247,
89282,
89301,
89472,
89491,
89662,
89663,
89730,
89731,
89878,
89879,
89970,
89971,
89993,
89994,
90189,
90190,
90235,
90236,
90245,
90246,
90269,
90270,
90556,
90557,
90603,
90604,
90613,
90614,
91028,
91029,
91061,
91062,
91319,
91320,
91364,
91365,
91375,
91376,
91427,
91428,
91611,
91612,
91686,
91687,
91694,
91695,
91699,
91706,
91707,
91784,
91785,
91796,
91797,
91846,
91847,
92028,
92029,
92093,
92094,
92102,
92103,
92138,
92139,
92151,
92152,
92171,
92172,
92419,
92420,
92453,
92454,
92464,
92486,
92496,
92497,
93014,
93015,
93233,
93234,
93251,
93252,
93296,
93297,
93305,
93306,
93378,
93379,
93412,
93413,
93438,
93439,
93449,
93450,
93836,
93837,
93850,
93851,
93861,
93862,
94253,
94254,
94282,
94283,
94308,
94309,
94321,
94322,
94486,
94487,
94523,
94524,
94536,
94537,
94657,
94658,
94711,
94712,
94737,
94738,
94748,
94749,
94955,
94956,
94964,
94965,
95992,
95993,
96086,
96087,
96234,
96235,
96420,
96421,
97324,
97325,
97394,
97395,
97405,
97406,
98133,
98134,
98711,
98712,
98879,
98880,
99065,
99066,
99463,
99464,
100151,
100152,
100375,
100376,
100398,
100399,
100921,
100922,
100932,
100977,
100987,
101030,
101055,
101088,
101106,
101148,
101174,
101210,
101220,
101233,
101263,
101277,
101300,
101313,
101328,
101342,
101357,
101380,
101414,
101427,
101441,
101449,
102107,
102108,
102675,
102676,
102820,
102821,
102845,
102846,
103338,
103339,
103489,
103490,
103625,
103626,
103655,
103712,
103773,
103821,
103850,
103901,
103950,
104002,
104061,
104117,
104162,
104224,
104291,
104351,
104396,
104443,
104511,
104563,
104637,
104704,
104749,
104765,
104835,
104851,
104960,
104976,
105052,
105063,
105199,
105210,
105283,
105293,
105333,
105340,
105350,
105392,
105411,
105429,
105524,
105543,
105580,
105598,
105656,
105674,
105731,
105744,
106021,
106022,
106047,
106048,
106179,
106327,
106538,
106606,
106807,
107165,
107166,
107342,
107343,
107695,
107696,
107714,
107715,
107860,
107861,
108182,
108183,
108991,
108992,
109268,
109269,
109742,
109743,
110197,
110198,
110228,
110229,
110302,
110410,
110512,
110595,
110623,
110746,
110845,
110938,
110965,
111000,
111098,
111325,
111429,
111461,
111491,
111615,
111745,
111841,
111842,
112318,
112319,
112497,
112498,
112744,
112745,
112757,
112758,
112900,
112901,
113642,
113643,
113879,
113880,
114063,
114064,
114209,
114210,
114222,
114223,
114634,
114635,
114902,
114903,
115066,
115067,
115177,
115178,
115373,
115374,
115557,
115558,
115566,
115567,
115881,
115882,
116248,
116249,
116676,
116677,
116803,
116804,
117222,
117223,
117235,
117236,
117527,
117528,
117757,
117758,
117768,
117769,
118036,
118037,
118882,
118883,
119628,
119629,
120698,
120699,
120929,
120930,
121284,
121285,
121748,
121749,
121759,
121760,
122081,
122113,
122177,
122188,
122367,
122402,
122438,
122454,
122507,
122559,
122570,
122589,
122674,
122721,
122768,
122812,
122856,
122892,
122928,
122989,
123107,
123193,
123231,
123269,
123318,
123375,
123390,
123511,
123556,
123557,
124145,
124146,
124155,
124156,
124728,
124729,
124751,
124752,
125196,
125197,
125578,
125579,
125909,
125910,
125938,
125939,
126548,
126549,
126689,
126690,
126711,
126712,
126744,
126745,
126748,
126777,
126860,
126861,
126982,
126983,
127110,
127111,
127137,
127138,
127462,
127463,
127581,
127582,
127612,
127644,
127666,
127667,
127910,
127911,
128237,
128238,
128265,
128295,
128322,
128323,
128507,
128508,
128560,
128561,
128580,
128596,
128619,
128632,
128644,
128654,
128655,
128756,
128757,
128773,
128786,
128796,
128809,
128820,
128839,
128857,
128873,
128959,
129052,
129053,
129354,
129355,
129602,
129603,
129626,
129627,
129773,
129774,
129798,
129799,
130127,
130128,
130149,
130402,
130430,
130576,
130598,
130754,
130783,
130881,
130918,
131186,
131215,
131621,
131639,
131845,
131870,
132021,
132042,
132175,
132204,
132357,
132377,
132514,
132535,
132723,
132742,
132827,
132856,
133004,
133021,
133166,
133195,
133397,
133414,
133645,
133678,
133918,
133933,
134237,
134259,
134324,
134350,
134449,
134482,
134620,
134644,
134882,
134917,
135066,
135084,
135214,
135236,
135352,
135389,
135524,
135552,
135764,
135792,
135993,
136022,
136364,
136390,
136760,
136780,
136917,
136918,
136954,
136955,
137193,
137424,
137706,
138062,
138468,
138469,
138478,
138515,
138537,
138544,
138545,
138626,
138709,
138882,
138883,
138906,
138907,
138921,
138922,
139113,
139114,
139845,
139846,
140281,
140282,
140468,
140469,
140669,
140670,
140697,
140698,
141091,
141092,
141116,
141117,
141141,
141182,
141200,
141231,
141250,
141278,
141298,
141323,
141342,
141454,
141474,
141600,
141619,
141719,
141739,
141853,
141872,
142014,
142034,
142062,
142063,
142105,
142106,
142136,
142388,
142411,
142488,
142507,
142583,
142610,
142651,
142672,
142752,
142781,
142909,
142938,
143067,
143112,
143245,
143290,
143393,
143416,
143569,
143593,
143747,
143768,
144189,
144860,
144886,
145078,
145104,
145221,
145233,
145369,
145387,
145490,
145520,
145579,
145611,
145642,
145669,
145817,
145851,
146023,
146024,
146055,
146056,
146074,
146262,
146292,
146405,
146434,
146578,
146603,
146712,
146733,
146759,
146792,
146822,
146844,
147070,
147092,
147269,
147287,
147410,
147430,
147553,
147575,
147700,
147715,
148253,
148254,
148278,
148279,
148295,
148346,
148378,
148424,
148448,
148548,
148564,
148633,
148649,
148809,
148839,
148930,
148952,
149118,
149154,
149251,
149274,
149385,
149406,
149545,
149575,
149618,
149630,
149669,
149689,
149739,
149758,
149858,
149876,
149978,
149989,
150047,
150062,
150147,
150148,
150170,
150171,
150207,
150319,
150338,
150978,
150979,
150994,
150995,
151010,
151353,
151380,
151438,
151463,
151569,
151583,
152153,
152176,
152359,
152379,
152591,
152615,
152671,
152709,
152794,
152818,
152892,
152930,
153015,
153039,
153119,
153157,
153248,
153272,
153346,
153384,
153469,
153492,
153731,
153768,
153857,
153890,
154025,
154040,
154180,
154207,
154371,
154372,
154392,
154393,
154417,
154486,
154508,
154601,
154629,
154749,
154750,
154768,
154769,
154797,
154907,
154919,
155024,
155066,
155182,
155200,
155266,
155286,
155343,
155361,
155493,
155512,
155559,
155585,
155683,
155717,
155857,
155880,
156015,
156049,
156190,
156208,
156643,
156664,
157328,
157353,
157552,
157577,
157804,
157833,
158034,
158049,
158250,
158265,
158478,
158490,
158695,
158727,
158793,
158794,
158822,
158823,
159068,
159069,
159743,
159744,
159933,
159934,
160197,
160198,
160468,
160469,
161059,
161060,
161869,
161870,
162111,
162112,
162358,
162359,
162877,
162878,
163091,
163092,
163278,
163279,
163463,
163464,
164089,
164090,
164433,
164434,
165164,
165165,
165366,
165367,
165388,
165390,
165461,
165463,
165497,
165498,
165506,
165507,
166042,
166043,
167389,
167390,
167750,
167751,
168389,
168390,
168408,
168409,
168794,
168795,
169026,
169027,
169870,
169871,
170120,
170121,
170980,
170981,
171239,
171240,
171262,
171263,
171442,
171443,
171609,
171637,
171679,
171742,
171750,
171858,
171870,
172054,
172072,
172218,
172259,
172260,
172281,
172282,
172652,
172653,
172662,
172722,
172738,
172777,
172798,
172855,
172901,
173076,
173096,
173149,
173257,
173258,
173272,
173273,
173404,
173405,
173469,
173530,
173597,
173635,
173682,
173745,
173831,
173842,
174328,
174364,
174672,
174744,
174745,
174768,
174769,
175323,
175324,
175338,
175476,
175499,
175527,
176337,
176367,
176878,
176895,
177230,
177258,
177315,
177344,
177385,
177423,
177445,
177807,
177817,
178073,
178118,
178206,
178260,
178378,
178457,
178543,
178595,
178607,
178642,
178654,
178706,
178718,
178765,
178775,
178816,
178840,
179238,
179321,
179331,
179588,
179622,
179981,
179995,
180641,
180665,
181746,
181779,
182587,
182611,
182975,
182976,
183220,
183221,
183314,
183315,
183429,
183486,
183516,
184223,
184224,
184364,
184365,
184598,
184613,
184755,
184767,
184856,
184945,
185026,
185036,
185286,
185387,
185555,
185648,
185696,
185727,
185763,
185833,
185885,
185895,
185943,
185986,
186027,
186098,
186144,
186179,
186227,
186237,
186284,
186369,
186439,
186498,
186555,
186607,
186668,
186727,
186748,
186805,
186851,
186919,
187029,
187041,
187222,
187322,
187436,
187536,
187548,
187774,
187787,
188119,
188405,
188406,
188451,
189115,
189116,
189304,
189305,
189318,
189646,
189693,
189740,
190891,
190953,
191019,
191047,
191197,
191332,
191445,
191618,
191753,
191822,
192757,
192780,
193042,
193167,
193293,
193355,
193455,
193509,
193613,
193724,
193756,
194417,
194439,
195044,
195060,
195073,
195100,
195103,
195106,
195126,
195139,
195151,
195170,
195188,
195204,
195217,
195311,
195404,
195516,
195527,
195639,
195684,
196861,
196876,
197114,
197157,
197973,
197982,
198155,
198186,
198196,
198817,
198853,
198875,
199445,
199446,
199933,
199934,
200173,
200174,
200638,
200639,
200652,
201050,
201080,
201971,
201972,
202148,
202149,
202271,
202272,
202639,
202640,
202867,
202868,
203131,
203132,
203277,
203278,
203316,
204233,
204255,
204470,
204517,
204585,
204641,
204699,
204711,
204722,
204740,
204765,
204790,
204815,
205396,
205451,
205461,
205508,
205637,
205827,
205905,
205996,
206206,
206338,
206925,
206955,
206984,
207065,
207124,
207238,
207301,
207337,
207373,
207544,
207545,
207732,
207733,
207794,
207826,
208558,
208576,
208738,
208772,
209309,
209336,
209426,
209518,
209745,
209811,
209880,
209919,
209969,
210038,
210126,
210193,
210503,
210504,
210594,
210595,
210752,
210753,
210773,
210975,
211101,
211266,
211437,
211697,
211732,
211937,
211938,
212350,
212584,
212685,
212697,
213025,
213263,
213264,
213555,
213556,
213577,
213594,
213891,
214013,
214146,
214280,
214373,
214707,
214717,
215126,
215238,
215880,
216063,
216159,
216369,
216483,
216493,
216675,
216685,
216973,
216983,
217149,
217331,
217410,
217421,
217944,
217986,
218254,
218293,
219198,
219209,
219836,
219891,
219945,
220516,
220646,
220806,
221716,
221747,
221849,
221994,
222266,
222407,
222422,
222469,
222479,
222493,
222505,
222519,
222749,
222769,
222790,
222800,
222814,
222834,
222845,
222859,
222977,
222987,
223087,
223107,
223127,
223137,
223151,
223170,
223189,
223214,
223233,
223253,
223272,
223293,
223513,
223643,
223654,
223668,
223688,
223796,
223815,
223816,
224043,
224694,
224743,
225029,
225074,
225295,
225385,
225584,
225770,
225870,
226169,
226385,
226561,
226764,
227079,
227089,
227521,
227554,
227885,
227915,
227948,
228179,
228272,
228479,
228480,
228684,
228685,
228715,
228716,
228884,
228896,
229051,
229391,
229401,
229571,
229581,
229892,
229905,
230022,
230176,
230320,
230641,
230882,
231239,
231249,
231478,
231628,
231727,
231916,
231931,
232054,
232122,
232269,
232381,
232592,
232673,
232819,
232948,
233057,
233211,
233323,
233337,
233610,
233827,
233838,
233923,
233934,
234085,
234096,
234208,
234219,
234444,
234457,
234657,
234667,
234750,
234771,
234967,
235126,
235300,
235312,
235429,
235607,
235631,
235782,
235793,
235923,
235935,
236071,
236213,
236353,
236364,
236569,
236586,
236843,
236857,
236975,
236986,
237144,
237225,
237226,
237239,
237532,
237542,
237551,
237903,
237904,
238134,
238164,
238265,
238280,
238321,
238336,
238377,
238476,
238477,
238489,
238516,
238527,
238593,
238605,
238950,
238962,
239616,
239628,
239859,
239879,
239974,
239975,
240068,
240069,
240195,
240226,
241066,
241067,
241646,
241647,
242116,
242117,
242405,
242406,
242436,
243603,
243643,
244543,
244578,
244612,
244654,
244702,
244746,
244813,
244854,
244905,
244977,
245073,
245131,
245186,
245231,
245257,
245302,
245364,
245465,
245501,
245534,
245959,
245982,
246570,
246594,
246773,
246796,
247410,
247423,
247882,
247883,
247900,
247901,
248210,
248241,
248308,
248348,
248428,
248531,
248602,
248673,
248752,
248827,
248922,
248991,
249049,
249113,
249179,
249180,
249350,
249351,
249360,
249361,
249409,
249460,
249510,
249588,
249610,
249626,
249638,
249640,
249641,
249647,
249648,
249658,
249680,
249693,
249757,
249774,
249826,
249848,
249925,
249941,
250003,
250013,
250065,
250080,
250157,
250168,
250210,
250211,
250219,
250220,
250256,
250269,
250270,
250314,
250334,
250335,
250347,
250348,
250582,
250583,
250870,
250871,
250903,
250904,
250931,
250965,
250994,
251029,
251080,
251082,
251189,
251190,
251286,
251287,
251292,
251293,
251320,
251321,
251443,
251444,
251480,
251481,
251549,
251550,
251898,
251899,
251942,
251943,
251993,
251994,
251995,
252034,
252065
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 252065,
"ccnet_original_nlines": 2333,
"rps_doc_curly_bracket": 0.0004839999892283231,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3997279703617096,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023322800174355507,
"rps_doc_frac_lines_end_with_ellipsis": 0.0008569000056013465,
"rps_doc_frac_no_alph_words": 0.1649397909641266,
"rps_doc_frac_unique_words": 0.06735195964574814,
"rps_doc_mean_word_length": 4.859888553619385,
"rps_doc_num_sentences": 2528,
"rps_doc_symbol_to_word_ratio": 0.001520180027000606,
"rps_doc_unigram_entropy": 5.858164310455322,
"rps_doc_word_count": 41053,
"rps_doc_frac_chars_dupe_10grams": 0.12591159343719482,
"rps_doc_frac_chars_dupe_5grams": 0.3115686774253845,
"rps_doc_frac_chars_dupe_6grams": 0.23648083209991455,
"rps_doc_frac_chars_dupe_7grams": 0.19363148510456085,
"rps_doc_frac_chars_dupe_8grams": 0.16127771139144897,
"rps_doc_frac_chars_dupe_9grams": 0.1428227722644806,
"rps_doc_frac_chars_top_2gram": 0.01110203005373478,
"rps_doc_frac_chars_top_3gram": 0.004059889819473028,
"rps_doc_frac_chars_top_4gram": 0.0031526798848062754,
"rps_doc_books_importance": -23647.828125,
"rps_doc_books_importance_length_correction": -23647.828125,
"rps_doc_openwebtext_importance": -11940.50390625,
"rps_doc_openwebtext_importance_length_correction": -11940.50390625,
"rps_doc_wikipedia_importance": -9199.30078125,
"rps_doc_wikipedia_importance_length_correction": -9199.30078125
},
"fasttext": {
"dclm": 0.3408694267272949,
"english": 0.8639867901802063,
"fineweb_edu_approx": 2.8509888648986816,
"eai_general_math": 0.9348220825195312,
"eai_open_web_math": 0.37825602293014526,
"eai_web_code": 0.9554699659347534
}
}
|
{
"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.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
808,675,855,644,227,500 |
begonia
1. Wahid78y2
Thread [ROM] [13.0] DerpFest Tango for Redmi Note 8 Pro [OFFICIAL] [BEGONIA]
This is a small project based on AOSP. We try to be a platform for beginners and support the Custom ROM community with our own unique contributions as well. This ROM exists thanks to inspiration of AOSiP, Thank you! #StayDerped /* Your warranty is now void. * * I am not responsible for bricked...
2. Godllyra
Thread 5g WiFi connection issue
this happens in any custom rom if I connect to a 5g wifi System stops then restarts
3. loic12305
Thread [UNMAINTAINED][ROM][13][begonia] Pixel Experience [UNOFFICIAL][PLUS EDITION]
PixelExperience for Redmi Note 8 Pro [begonia][Android13][PLUS EDITION] [UNMAINTAINED] I BUY A NEW PHONE SORRY What is this? Pixel Experience is an AOSP based ROM, with Google apps included and all Pixel goodies (launcher, wallpapers, icons, fonts, bootanimation) Our mission is to offer the...
4. Wahid78y2
Thread [Kernel] [Azure] Nova Kernel [Begonia]
Nova Kernel | Android 11-13 Released: 11/12/'22 Kernels for Redmi Note 8 Pro (Begonia) Download Link | Mirror Change logs Mod edit: TG link removed Notes Important ! Credits and Thanks: @SoldatSempai, @PiotrBurdzinski & @DarkJoker360dev for 🌲 Thanks to @verbal1 & @Panic69 for testing...
5. ishitachakraborty22
Thread [KERNEL] [Begonia] HYDRA KERNEL REDMI NOTE 8 PRO [AOSP] [MIUI]
HYDRA Kernel is a kernel built keeping in mind to provide smooth performance, best battery backup and powerful gaming experience. Latest Build : https://www.pling.com/p/1944627/ Description: Compiled Using Dragon Toolchain(for defined gaming ) This kernel is for Android 11/12/13 Devices...
6. hheylau
Thread [Solved] Note 8 Pro bricked and no boot screen
Sorry, I am a idiot and My phone was in perfect condition until I run and now my phone doesnt have charging logo on, doesnt boot to bootloader It is basically black and no response however, the noti LED is on when charging. and I saw COM6 in device manager once then disappeared AND in some...
7. ttimmyturner
Thread Slow charging after installing PE12.1 Plus(Begonia), Redmi Note 8 Pro
Yesterday successfuly installed PE12.1 Plus on my Redmi Note 8 Pro. Was totally satisfied with everything about this ROM, but then I've set it on the charge and discovered that it charges terribly-slow. I mean from 85% to 100% it charges around 40min(Can't say how long it charges from 0 to 100...
8. bishwofic
Thread [ROM] [13] | CherishOS v4.7.5 | [Begonia] [OFFICIAL] [AOSP]
CherishOS is an AOSP-based ROM focusing on Unique and Smooth UI with handy features. CherishOS is reborn of pie-based Dot-ExtendedOS. Your warranty is now void. We are not responsible for anything that may happen to your phone by installing custom ROMs and/or kernels. You do it at your own...
9. MikqPL14
Thread [RECOVERY][OFFICIAL] Femboy Recovery Project3.5.0 V2 UNIFIED[begonia/begoniain]
* Disclaimer * * Your warranty is now void and your phone is cute. * * We're not responsible for bricked devices, dead SD cards, * thermonuclear war, or you getting fired because the alarm app failed. Please * do some research if you have any concerns about features included in this recovery *...
10. Madara_96
Thread Proximity Sensor Problem
Hi everyone my Proximity Sensor is Damage so i want to Freeze it value at 5 , i tried an Xposed module it working but it need to be reactivated after each reboot and it not stable , my question is how can i Freeze it myself manually to stay at the value 5 forever , thanks . Redmi Note 8 Pro MiUi...
11. A
Thread [ROM] [OFFICIAL] [NONCFW] [12.1] [BEGONIA/BEGONIAIN] Project Elixir for Xiaomi Redmi Note 8 Pro [AOSP]
* Your warranty is now void. * We are not responsible for anything that may happen to your phone by installing any custom ROMs and/or kernels. * You do it at your own risk and take the responsibility upon yourself and you are not to blame us or XDA and its respected developers. "This is a...
12. bishwofic
Thread [ROM][NONCFW][12L][BEGONIA/BEGONIAIN] CherishOS V3.9.5 | Xiaomi Redmi Note 8 Pro [OFFICIAL][AOSP]
CherishOS is an AOSP based rom focusing on Unique and Smooth UI with handy features. CherishOS is a reborn of pie based Dot-ExtendedOS. Your warranty is now void. We are not responsible for anything that may happen to your phone by installing any custom ROMs and/or kernels. You do it at your...
13. 7Soldier
Thread [ROM] [NONCFW] [12.1] [BEGONIA/BEGONIAIN] PixelPlusUI v4.5 | Xiaomi Redmi Note 8 Pro [OFFICIAL] [AOSP]
* Your warranty is now void. * We are not responsible for anything that may happen to your phone by installing any custom ROMs and/or kernels. * You do it at your own risk and take the responsibility upon yourself and you are not to blame us or XDA and its respected developers. "This is a...
14. abhi.xv
Thread [ROM][12.0][Begonia] LineageOS 19.0 [UNOFFICIAL]
About LineageOS LineageOS is a free and open-source operating system for set-top boxes, smartphones and tablet computers, based on the Android mobile platform. It is the successor to the custom ROM CyanogenMod, from which it was forked in December 2016 when Cyanogen Inc. announced it was...
15. D
Thread Micro G on LineageOs begonia
Hi ! I would like to install microG on my phone for degooglize myself. I have LineageOS 18.1-20211010-UNOFFICIAL-full-begonia. It's an unofficial rom so i don't know how to install microg. Could you help me ? thank you
16. A
Thread Soft bricked twice after installing Twrp
I need a little help, I tried installing custom recovery (TWRP) in my redmi note 8 pro and I some how soft bricked it twice I don't know what I'm doing wrong that keeps bricking. Any suggestions?
17. Fedroid
Thread Sims deactivation and MultiRom manager for custom roms
Dear developers, I want to thank you for your time and consideration building ROMs for our begonia. Gone are the times of cfw and we have plenty of choice of custom roms. It's time to port MultiRom manager! So, we could taste all available ROMs here and there. I haven't got the knowledge to...
18. K
Thread [UNOFFICIAL][ROM][CWF][begonia] TWRP deployment & LineageOS from theimpulson
Hi All, It came to my attention that theimpulson stopped maintaining LineageOS for begonia couple months ago but I wanted to give it a try anyway. https://forum.xda-developers.com/t/rom-10-0-unofficial-lineageos-17-1-begonia-begoniain.4072137/page-16 I know the front camera does not work and...
19. S
Thread [RECOVERY][UNOFFICIAL] Begonia Recovery Project Themed TWRP 3.5.0 V2 UNIFIED [begonia/begoniain]
#Themed-Version #NonCFW-TWRP-3.5.0 #Unified #Unofficial #Begonia Begonia Recovery Project 3.5.0 - Unified 2.0 UNOFFICIAL | Themed Version TWRP Updated: 14/02/'21 ▪️Download [64 MB] Changelog: • Initial Build • Based on Non-CFW-TWRP 3.5.0-Unified Notes: • Non - CFW based For Custom Roms and...
20. L
Thread Redmi note 8 pro flashing sucessful but stuck on logo
My redmi note 8 pro was flashed by the MTK bypass utility and sp flashtool. The flashing completes without any error and the download ok window shows up. But the device won't boot. It's just stuck on logo and restarts after sometime. I tried with 3 different stock rom versions all are giving...
21. Sahil_Sonar
Thread [ROM] [11.0.0] dotOS v5.2 [UNOFFICIAL] [begonia/begoniain] [MIUI-A11-fw] [2021.09.15]
" #DroidOnTime " ROM Version: 5.2 Device: begonia/begoniain Maintainer: @Sahil_Sonar Build Status: Unofficial * Your warranty is now void. * We are not responsible for anything that may happen to your phone by installing any custom ROMs and/or kernels. * You do it at your own...
22. KangMonkey
Thread [CLOSED]====Thread Removed====
======{{{{{NO THREAD}}}}}======
23. TTTT555
Thread [ROM][11] crDroid 7.17 [begonia/begoniain][OFFICIAL]
*** Disclaimer I am not responsible for any damage you made to your device You have been warned crDroid is designed to increase performance and reliability over stock Android for your device also attempting to bringing many of the best features existent today Features...
24. S
Thread [ROM][CFW][11.0] Arrow Os 11.0 - begonia/begoniain [UNOFFICIAL][STABLE]
ArrowOS #include <std_disclaimer.h> /* * Your warranty is... still valid? * * I am not responsible for bricked devices, dead SD cards, * thermonuclear war, or you getting fired because the alarm app failed. Please * do some research if you have any concerns about features included in this ROM...
25. RichyRicho
Thread Miui 12.0.1.0 twrp
Phone automatically updated to 12.0.1.0 last night, and I can not get it to boot back to TWRP, LR LWRP or Orangefox. When it wants to boot to the recovery after holding power and up, it just black screens for a few seconds and reboots, then boots back into MIUI. Am I doing something wrong or...
26. KangMonkey
Thread [CLOSED]---- project drawn back ----
---- Project Found Buggy ----
27. KangMonkey
Thread [OFFICIAL][AOSP][VoLTE] BlissRom 14.2 [Begonia/Begoniain]
Team Bliss is pleased to present to you BlissRoms based on Android 11 Our focus is to bring the Open Source community a quality OS that can run on all your devices as a daily driver, syncing your apps + settings + customizations across all platforms you run Bliss on. Bliss ROMs comes with a...
|
{
"url": "https://forum.xda-developers.com/tags/begonia/",
"source_domain": "forum.xda-developers.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "133900",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:T7JM7HR52ITPVYPE2TWLS5KCCJBROIRO",
"WARC-Concurrent-To": "<urn:uuid:81e05eda-fff9-47bf-b178-0f6f3edd3847>",
"WARC-Date": "2023-09-22T04:17:14Z",
"WARC-IP-Address": "104.18.5.119",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:JMVVYWMEJKA7JKENWKAODOX6YWJ7ZASG",
"WARC-Record-ID": "<urn:uuid:e4af430f-8a3d-4b32-84cb-398b5d23576f>",
"WARC-Target-URI": "https://forum.xda-developers.com/tags/begonia/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c7f32585-b805-41f9-bfe3-4bb27e687c27>"
},
"warc_info": "isPartOf: CC-MAIN-2023-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-168\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
8,
9,
24,
25,
106,
107,
409,
423,
424,
460,
461,
549,
564,
565,
653,
654,
953,
968,
969,
1019,
1020,
1312,
1337,
1338,
1412,
1413,
1708,
1721,
1722,
1780,
1781,
2079,
2097,
2098,
2179,
2180,
2482,
2497,
2498,
2569,
2570,
2868,
2882,
2883,
2974,
2975,
3277,
3293,
3294,
3330,
3331,
3635,
3643,
3644,
3758,
3759,
4056,
4072,
4073,
4182,
4183,
4483,
4498,
4499,
4613,
4614,
4911,
4925,
4926,
4986,
4987,
5283,
5291,
5292,
5332,
5333,
5556,
5564,
5565,
5617,
5618,
5818,
5832,
5833,
5899,
5900,
6199,
6207,
6208,
6296,
6297,
6597,
6605,
6606,
6714,
6715,
7013,
7021,
7022,
7087,
7088,
7388,
7406,
7407,
7504,
7505,
7789,
7806,
7807,
7849,
7850,
7886,
7900,
7901,
7965,
7966,
8242,
8250,
8251,
8334,
8335,
8636,
8653,
8654,
8684,
8685,
8985,
9002,
9003,
9051,
9052,
9086,
9103,
9104,
9173,
9174
],
"line_end_idx": [
8,
9,
24,
25,
106,
107,
409,
423,
424,
460,
461,
549,
564,
565,
653,
654,
953,
968,
969,
1019,
1020,
1312,
1337,
1338,
1412,
1413,
1708,
1721,
1722,
1780,
1781,
2079,
2097,
2098,
2179,
2180,
2482,
2497,
2498,
2569,
2570,
2868,
2882,
2883,
2974,
2975,
3277,
3293,
3294,
3330,
3331,
3635,
3643,
3644,
3758,
3759,
4056,
4072,
4073,
4182,
4183,
4483,
4498,
4499,
4613,
4614,
4911,
4925,
4926,
4986,
4987,
5283,
5291,
5292,
5332,
5333,
5556,
5564,
5565,
5617,
5618,
5818,
5832,
5833,
5899,
5900,
6199,
6207,
6208,
6296,
6297,
6597,
6605,
6606,
6714,
6715,
7013,
7021,
7022,
7087,
7088,
7388,
7406,
7407,
7504,
7505,
7789,
7806,
7807,
7849,
7850,
7886,
7900,
7901,
7965,
7966,
8242,
8250,
8251,
8334,
8335,
8636,
8653,
8654,
8684,
8685,
8985,
9002,
9003,
9051,
9052,
9086,
9103,
9104,
9173,
9174,
9472
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9472,
"ccnet_original_nlines": 136,
"rps_doc_curly_bracket": 0.0010557400528341532,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.26797065138816833,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07383862882852554,
"rps_doc_frac_lines_end_with_ellipsis": 0.16058394312858582,
"rps_doc_frac_no_alph_words": 0.30317848920822144,
"rps_doc_frac_unique_words": 0.3867325186729431,
"rps_doc_mean_word_length": 4.987297058105469,
"rps_doc_num_sentences": 149,
"rps_doc_symbol_to_word_ratio": 0.015158919617533684,
"rps_doc_unigram_entropy": 5.676860332489014,
"rps_doc_word_count": 1417,
"rps_doc_frac_chars_dupe_10grams": 0.18565161526203156,
"rps_doc_frac_chars_dupe_5grams": 0.22951747477054596,
"rps_doc_frac_chars_dupe_6grams": 0.19499079883098602,
"rps_doc_frac_chars_dupe_7grams": 0.18565161526203156,
"rps_doc_frac_chars_dupe_8grams": 0.18565161526203156,
"rps_doc_frac_chars_dupe_9grams": 0.18565161526203156,
"rps_doc_frac_chars_top_2gram": 0.009905190207064152,
"rps_doc_frac_chars_top_3gram": 0.01584831066429615,
"rps_doc_frac_chars_top_4gram": 0.023913970217108727,
"rps_doc_books_importance": -894.5735473632812,
"rps_doc_books_importance_length_correction": -894.5735473632812,
"rps_doc_openwebtext_importance": -496.8264465332031,
"rps_doc_openwebtext_importance_length_correction": -496.8264465332031,
"rps_doc_wikipedia_importance": -381.01007080078125,
"rps_doc_wikipedia_importance_length_correction": -381.01007080078125
},
"fasttext": {
"dclm": 0.020803330466151237,
"english": 0.861741304397583,
"fineweb_edu_approx": 0.8700123429298401,
"eai_general_math": 0.002810240024700761,
"eai_open_web_math": 0.12455887347459793,
"eai_web_code": 0.008848310448229313
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-2,434,041,783,390,362,600 |
Cube Root of 1687
In math, the cube root of a number like 1687 is a number that, when multiplied by itself two times, is equal to 1687.
We would show this in mathematical form with the cube root symbol, which is similar to the radical symbol (√) used in a square root, but which also has the number 3 above the symbol (this number is called the index):
∛1687
So, the √ is called the radical symbol, the little 3 above it is the index (which means multiply by itself two more times), and the number, 1687, is called the radicand.
To explain the cube root a little more, the cube root of the number 1687 is a number (which we call n) that when multiplied by itself twice is equal to 1687:
n × n × n = 1687
∛1687 is the same as 1687 and so if you are solving a problem in a spreadsheet like Excel, Numbers, or Google Sheets, you can use =1687^(1/3) to calculate the cube root.
For the purposes of this article, we'll use a scientific calculator to work out the cubic root by typing the number 1687 and pressing the [∛x] button, to give the following answer:
∛1687 ≈ 11.904331920978
Is 1687 a Perfect Cube?
When the cube root of a given number is a whole number, this is called a perfect cube. Perfect cubes are important for many mathematical functions and are used in everything from carpentry through to more advanced topics like physics and astronomy.
If we look at the number 1687, we know that the cube root is 11.904331920978, and since this is not a whole number, we also know that 1687 is not a perfect cube.
If you want to learn more about perfect cube numbers we have a list of perfect cubes which covers the first 500 perfect cube numbers.
Is the Cube Root of 1687 a Rational or Irrational Number?
Another common question you might find when working with the roots of a number like 1687 is whether the given number is rational or irrational. Rational numbers can be written as a fraction and irrational numbers can't.
The quickest way to check if a number is rational or irrational is to determine if it is a perfect cube. If it is, then it's a rational number, but if it is not a perfect cube then it is an irrational number.
We already know that 1687 is not a rational number then, because we know it is not a perfect cube.
Rounding the Cube Root of 1687
Sometimes when you work with the cube root of 1687 you might need to round the answer down to a specific number of decimal places:
10th: ∛1687 = 11.9
100th: ∛1687 = 11.90
1000th: ∛1687 = 11.904
Simplifying the Cube Root of 1687
It is possible to simplify the cube root of 1687 if the radicand can be made smaller. When that is possible, it is called the cube root of 1687 in its simplest radical form.
In this example, the cube root of 1687 cannot be simplified down any further.
Practice Cube Roots Using Examples
If you want to continue learning about cubic roots, take a look at the random calculations in the sidebar to the right of this blog post.
We have listed a selection of completely random numbers that you can click through and follow the information on calculating the cubic root of that number to help you understand number roots.
Calculate Cube Square Root Problem
Enter your number in box A below and click "Calculate" to work out the cube root of the given number.
Link to Us / Reference this Page
Please use the tool below to link back to this page or cite/reference us in anything you use the information for. Your support helps us to continue providing content!
• "Cube Root of 1687". WorksheetGenius.com. Accessed on January 27, 2023. http://worksheetgenius.com/calc/cube-root-of-1687/.
• "Cube Root of 1687". WorksheetGenius.com, http://worksheetgenius.com/calc/cube-root-of-1687/. Accessed 27 January, 2023
• Cube Root of 1687. WorksheetGenius.com. Retrieved from http://worksheetgenius.com/calc/cube-root-of-1687/.
|
{
"url": "https://worksheetgenius.com/calc/cube-root-of-1687/",
"source_domain": "worksheetgenius.com",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "21443",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:V7KHHDZX6D7VLSRV36BMYSW7AQ6DSCMW",
"WARC-Concurrent-To": "<urn:uuid:9314df79-11e3-4886-97b5-d1fa949e973c>",
"WARC-Date": "2023-01-27T23:25:27Z",
"WARC-IP-Address": "172.67.170.195",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:PAPKNSB7BG6MYTVACYHL7KIN6MXWTNST",
"WARC-Record-ID": "<urn:uuid:70b9b290-7db8-4b58-a7bd-767e0e861b42>",
"WARC-Target-URI": "https://worksheetgenius.com/calc/cube-root-of-1687/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:48c9b585-f63c-4d91-b600-a14af14a440e>"
},
"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-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,
18,
19,
137,
138,
355,
356,
362,
363,
533,
534,
692,
693,
710,
711,
881,
882,
1063,
1064,
1088,
1089,
1113,
1114,
1363,
1364,
1526,
1527,
1661,
1662,
1720,
1721,
1941,
1942,
2151,
2152,
2251,
2252,
2283,
2284,
2415,
2416,
2435,
2436,
2457,
2458,
2481,
2482,
2516,
2517,
2691,
2692,
2770,
2771,
2806,
2807,
2945,
2946,
3138,
3139,
3174,
3175,
3176,
3278,
3279,
3280,
3313,
3314,
3481,
3482,
3610,
3611,
3735,
3736
],
"line_end_idx": [
18,
19,
137,
138,
355,
356,
362,
363,
533,
534,
692,
693,
710,
711,
881,
882,
1063,
1064,
1088,
1089,
1113,
1114,
1363,
1364,
1526,
1527,
1661,
1662,
1720,
1721,
1941,
1942,
2151,
2152,
2251,
2252,
2283,
2284,
2415,
2416,
2435,
2436,
2457,
2458,
2481,
2482,
2516,
2517,
2691,
2692,
2770,
2771,
2806,
2807,
2945,
2946,
3138,
3139,
3174,
3175,
3176,
3278,
3279,
3280,
3313,
3314,
3481,
3482,
3610,
3611,
3735,
3736,
3846
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3846,
"ccnet_original_nlines": 72,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4302884638309479,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0012019199784845114,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22355769574642181,
"rps_doc_frac_unique_words": 0.3169642984867096,
"rps_doc_mean_word_length": 4.452381134033203,
"rps_doc_num_sentences": 42,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.62547492980957,
"rps_doc_word_count": 672,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.17513369023799896,
"rps_doc_frac_chars_dupe_6grams": 0.07052139192819595,
"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.050802141427993774,
"rps_doc_frac_chars_top_3gram": 0.05013369023799896,
"rps_doc_frac_chars_top_4gram": 0.05147058889269829,
"rps_doc_books_importance": -353.93572998046875,
"rps_doc_books_importance_length_correction": -353.93572998046875,
"rps_doc_openwebtext_importance": -209.2137451171875,
"rps_doc_openwebtext_importance_length_correction": -209.2137451171875,
"rps_doc_wikipedia_importance": -158.13121032714844,
"rps_doc_wikipedia_importance_length_correction": -158.13121032714844
},
"fasttext": {
"dclm": 0.8741170763969421,
"english": 0.9064310193061829,
"fineweb_edu_approx": 3.1424448490142822,
"eai_general_math": 0.9977768659591675,
"eai_open_web_math": 0.6793856620788574,
"eai_web_code": 0.5495880246162415
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "512.9",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Algebra"
}
},
"secondary": {
"code": "510",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
2,843,102,832,519,159,000 |
INCLUDE File Problem
I cannot get the INCLUDE function to work. What am I doing wrong? Thanks!
Here's the main file:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<html>
<body>
<p>In main HTML</p>
<!--#include file="z.html"-->
<!--#include virtual="z.html"-->
</body>
</html>
Here's z.html:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<html>
<body>
<p>In Footer</p>
</body>
</html>
Results when I call the main file:
In main HTML
(The "In Footer" words do not appear.)
bparmeleeAsked:
Who is Participating?
[Product update] Infrastructure Analysis Tool is now available with Business Accounts.Learn More
x
I wear a lot of hats...
"The solutions and answers provided on Experts Exchange have been extremely helpful to me over the last few years. I wear a lot of hats - Developer, Database Administrator, Help Desk, etc., so I know a lot of things but not a lot about one thing. Experts Exchange gives me answers from people who do know a lot about one thing, in a easy to use platform." -Todd S.
bparmeleeAuthor Commented:
P.S. Both files are in the same (root) directory.
0
DexstarCommented:
@bparmelee:
> I cannot get the INCLUDE function to work. What am I doing wrong? Thanks!
You can't do that with HTML. The syntax you are using is for ASP code, which only work with specific web server software. If you are using IIS for your web server, then try renaming your main file to have a ".asp" extension. Then it should work. If you aren't using IIS, then you can't do what you're trying to do the way you're trying to do it.
Hope That Helps,
Dex*
0
COBOLdinosaurCommented:
Dexstar,
What are you talking about. That is not ASP syntax.
There are likely one of two (or possible both problems).
1. The server must be configured to recognize and support includes.
2. If it is configured for includes, it must also have the extension configured. Normally .inc, or .shtml are used but virtually anything including html can be configuted.
An good source for SSI related problems:
http://bignosebird.com/ssi.shtml
Cd&
0
Experts Exchange Solution brought to you by
Your issues matter to us.
Facing a tech roadblock? Get the help and guidance you need from experienced professionals who care. Ask your question anytime, anywhere, with no hassle.
Start your 7-day free trial
Determine the Perfect Price for Your IT Services
Do you wonder if your IT business is truly profitable or if you should raise your prices? Learn how to calculate your overhead burden with our free interactive tool and use it to determine the right price for your IT services. Download your free eBook now!
DexstarCommented:
What I meant was that the syntax of
<!--#include file="z.html"-->
Has to be supported by the server for it to work, and won't just work with any web server. It isn't ASP syntax perse. I misspoke. But, if you are on IIS, it does need to be an active server page (with the .ASP extension) for the server to process the SSI directives.
Dex*
0
COBOLdinosaurCommented:
ASP can process the directive, but you do not have to use ASP. the includes will work in IIS for static HTML pages by mapping the extensions like .inc into Ssinc.dll I believe; all the SSI directives support by Microsoft work. In an ASP page the only SSI directive that works is the include itsef.
Cd&
0
DexstarCommented:
@COBOLdinosaur:
Okay, I just tested this on IIS 5. Maybe a new version is different, but here is what I found. I took this file these files (IncTest.htm and Inc.htm):
---
IncTest.htm
---
<html>
<head>
<title>Inc Test</title>
</head>
<body>
<!-- #include file="inc.htm"-->
</body>
</html>
---
Inc.Htm
---
<B>Inc Test!!</B>
---
When I requested "IncTest.htm" with my browser, I got a blank page. When I looked at the sourc, it showed the <#include> command in there. Then I renamed the file "IncTest.asp", and requested that with my browser, and the file got included.
You have to invoke the scripting engine to get the server side includes to work. By default, that means usings the .ASP suffix on your files. (The suffix on the included file doesn't matter at all). However, you can configure your web server to invoke the engine for .htm files too, but then you end up running the scripting engine on pages that don't contain any script, which is wasteful..
Dex*
0
COBOLdinosaurCommented:
It is not working for you without asp, because you have not configured Ssinc.dll to handle the includes with htm extensions. IIS gets delivered with those kind of includes turned off and you have to user the manager interface to specifically configure the dll.
However given the poor performance of IIS on includes, you are better not to use them at all in IIs environments because it is more efficient to use client side scripting to generate shared code.
Cd&
0
bparmeleeAuthor Commented:
THe shtml extension did the trick. Thanks!
0
COBOLdinosaurCommented:
Glad we could help. Thanks for the A. :^)
Cd&
0
DexstarCommented:
@COBOLdinosaur: Where do I find those settings?
0
COBOLdinosaurCommented:
You can start here I guess:
http://msdn.microsoft.com/library/default.asp?url=/library/en-us/iisref/htm/ref_ssi_ssiref.asp
I hate usng the MSDN site, because they are always trying to mess with the browser, but try searching MSDN with Ssinc.dll as the argument. That should give you some of the hype that MS likes to call tech documentation.
Cd&
0
co2tux2600Commented:
I'm lazy..use php.
<?php include "z.html"; ?>
:P
0
DirkManuelCommented:
I'm new to PHP but I came here looking for the same question. Now if you use PHP and include the z.html file, am I right in assuming that the z.html file should only contain HTML that is VALID AT THE POINT IT IS INCLUDED? (i.e. you'd need to strip out the DOCTYPE, HTML and BODY tags?
0
jimmysaysCommented:
You may have to go into the Internet Service Manager and make sure the server side include dll has been associated with the extension you desire. To do that:
1. Start the Internet Service Manager
2. Click on the Default Website directory
3. Right click and select Properties
4. Select the Home Directory tab
5. Under Application Settings, click on Configuration
6. Make sure the .html extension is listed as associated with
c:\WINNT\System32\inetsrv\ssinc.dll; if it is not, then:
7. To associate .html with the ssinc.dll, click the Add button
8. Browse to c:\WINNT\System32\inetsrv\ssinc.dll in the executable field
9. Enter .html (with the dot) into the Extension field
10. Leave the Method exclusion field blank; leave Script engine checked and Check that file exists unchecked
11. Click OK twice
12. In the main Properties window, click Apply
13. SSI should now be enabled for .html files
0
It's more than this solution.Get answers and train to solve all your tech problems - anytime, anywhere.Try it for free Edge Out The Competitionfor your dream job with proven skills and certifications.Get started today Stand Outas the employee with proven skills.Start learning today for free Move Your Career Forwardwith certification training in the latest technologies.Start your trial today
Web Languages and Standards
From novice to tech pro — start learning today.
|
{
"url": "https://www.experts-exchange.com/questions/20811604/INCLUDE-File-Problem.html",
"source_domain": "www.experts-exchange.com",
"snapshot_id": "crawl=CC-MAIN-2018-47",
"warc_metadata": {
"Content-Length": "150883",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZH5XS5JJWMN65L62PLANQKX4E4RBIOJI",
"WARC-Concurrent-To": "<urn:uuid:85617275-dfc1-4f97-8cbc-b549a3378d9f>",
"WARC-Date": "2018-11-19T21:37:35Z",
"WARC-IP-Address": "104.20.168.10",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:4KUZPGBC3KNJT3HUP3KOTIKK6OP7RTPG",
"WARC-Record-ID": "<urn:uuid:7eaf8820-4ec8-4867-a118-afc7738d07c5>",
"WARC-Target-URI": "https://www.experts-exchange.com/questions/20811604/INCLUDE-File-Problem.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bd4ff4db-5d6a-4777-b13b-6aa87d3d001b>"
},
"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-171-47-161.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,
21,
22,
98,
99,
121,
184,
191,
201,
227,
257,
290,
301,
309,
310,
325,
388,
395,
405,
428,
439,
447,
448,
483,
508,
509,
548,
564,
586,
587,
684,
685,
687,
711,
712,
1077,
1078,
1105,
1156,
1158,
1176,
1188,
1189,
1267,
1268,
1618,
1619,
1636,
1641,
1643,
1667,
1676,
1677,
1732,
1733,
1790,
1791,
1859,
2033,
2034,
2075,
2076,
2109,
2110,
2114,
2116,
2118,
2119,
2163,
2164,
2190,
2191,
2345,
2346,
2374,
2423,
2424,
2681,
2682,
2700,
2736,
2770,
2771,
3041,
3042,
3047,
3049,
3073,
3373,
3374,
3378,
3380,
3382,
3400,
3416,
3417,
3570,
3574,
3586,
3590,
3597,
3604,
3628,
3636,
3643,
3675,
3683,
3691,
3695,
3703,
3707,
3725,
3729,
3730,
3973,
3974,
4369,
4370,
4375,
4377,
4401,
4663,
4664,
4860,
4861,
4865,
4867,
4894,
4938,
4940,
4964,
5006,
5007,
5011,
5013,
5031,
5080,
5082,
5106,
5134,
5135,
5230,
5231,
5451,
5452,
5456,
5458,
5479,
5500,
5501,
5528,
5529,
5532,
5534,
5555,
5842,
5844,
5864,
6022,
6023,
6065,
6111,
6152,
6189,
6247,
6313,
6370,
6437,
6514,
6573,
6686,
6709,
6760,
6810,
6812,
7206,
7234,
7235
],
"line_end_idx": [
21,
22,
98,
99,
121,
184,
191,
201,
227,
257,
290,
301,
309,
310,
325,
388,
395,
405,
428,
439,
447,
448,
483,
508,
509,
548,
564,
586,
587,
684,
685,
687,
711,
712,
1077,
1078,
1105,
1156,
1158,
1176,
1188,
1189,
1267,
1268,
1618,
1619,
1636,
1641,
1643,
1667,
1676,
1677,
1732,
1733,
1790,
1791,
1859,
2033,
2034,
2075,
2076,
2109,
2110,
2114,
2116,
2118,
2119,
2163,
2164,
2190,
2191,
2345,
2346,
2374,
2423,
2424,
2681,
2682,
2700,
2736,
2770,
2771,
3041,
3042,
3047,
3049,
3073,
3373,
3374,
3378,
3380,
3382,
3400,
3416,
3417,
3570,
3574,
3586,
3590,
3597,
3604,
3628,
3636,
3643,
3675,
3683,
3691,
3695,
3703,
3707,
3725,
3729,
3730,
3973,
3974,
4369,
4370,
4375,
4377,
4401,
4663,
4664,
4860,
4861,
4865,
4867,
4894,
4938,
4940,
4964,
5006,
5007,
5011,
5013,
5031,
5080,
5082,
5106,
5134,
5135,
5230,
5231,
5451,
5452,
5456,
5458,
5479,
5500,
5501,
5528,
5529,
5532,
5534,
5555,
5842,
5844,
5864,
6022,
6023,
6065,
6111,
6152,
6189,
6247,
6313,
6370,
6437,
6514,
6573,
6686,
6709,
6760,
6810,
6812,
7206,
7234,
7235,
7282
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7282,
"ccnet_original_nlines": 177,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3314536213874817,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0595238097012043,
"rps_doc_frac_lines_end_with_ellipsis": 0.005617979913949966,
"rps_doc_frac_no_alph_words": 0.24060149490833282,
"rps_doc_frac_unique_words": 0.38654011487960815,
"rps_doc_mean_word_length": 4.744607448577881,
"rps_doc_num_sentences": 139,
"rps_doc_symbol_to_word_ratio": 0.003759399987757206,
"rps_doc_unigram_entropy": 5.469414234161377,
"rps_doc_word_count": 1159,
"rps_doc_frac_chars_dupe_10grams": 0.04037097841501236,
"rps_doc_frac_chars_dupe_5grams": 0.06001091003417969,
"rps_doc_frac_chars_dupe_6grams": 0.0458265095949173,
"rps_doc_frac_chars_dupe_7grams": 0.04037097841501236,
"rps_doc_frac_chars_dupe_8grams": 0.04037097841501236,
"rps_doc_frac_chars_dupe_9grams": 0.04037097841501236,
"rps_doc_frac_chars_top_2gram": 0.0036370200105011463,
"rps_doc_frac_chars_top_3gram": 0.0032733199186623096,
"rps_doc_frac_chars_top_4gram": 0.00472813006490469,
"rps_doc_books_importance": -690.4652099609375,
"rps_doc_books_importance_length_correction": -690.4652099609375,
"rps_doc_openwebtext_importance": -426.4383850097656,
"rps_doc_openwebtext_importance_length_correction": -426.4383850097656,
"rps_doc_wikipedia_importance": -332.2016906738281,
"rps_doc_wikipedia_importance_length_correction": -332.2016906738281
},
"fasttext": {
"dclm": 0.044245000928640366,
"english": 0.8902244567871094,
"fineweb_edu_approx": 1.5164738893508911,
"eai_general_math": 0.026327909901738167,
"eai_open_web_math": 0.2926408052444458,
"eai_web_code": 0.01821703091263771
}
}
|
{
"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": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-3,331,154,039,526,476,300 |
)
MyIPNeighbors Reverse IP Lookup (Free service)
MyIPNeighbors Reverse IP Lookup (Free service).
This is how you can look up reverse IP. It is a free service.
What is reverse IP lookup?
Reverse IP lookup is the process to check IP or a domain name and find out all the domains hosted at the same IP address on a web server.
As you already know, IP lookup track down IP addresses and websites and provide you with useful geographical information of a particular IP address.
Reverse IP lookup operates vice versa and gives you another kind of information, which is no less critical. Reverse IP lookup is good for those thinking of creating a website at a specific shared hosting. With this, it is possible to check which domains are located on a web server and whether this is a good idea to place a new site at the same hosting.
Besides that, sharing one and the same IP address by several websites can lead to failures in the case of the so-called overclocking. For example, it comes up that some sites contain prohibited material and must be shut down. Once their IP is known and blocked, other prominent sites may share the same IP address, and they all get blocked together.
The services provided can range from web, e-mail, and file sharing, … By submitting a query with the IP address or hostname of your website,
Leave a Comment
|
{
"url": "https://www.brodneil.com/myipneighbors-reverse-ip-lookup-free-service/",
"source_domain": "www.brodneil.com",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "155915",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RN2RYI3TXXHQAJULWUEGYKQQPLWSSZ6N",
"WARC-Concurrent-To": "<urn:uuid:3483f7a9-feb8-420a-b188-92df3a4c31a3>",
"WARC-Date": "2023-04-02T12:04:26Z",
"WARC-IP-Address": "104.21.84.79",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YAFK6BNGSVJW27MFC2ZANVH326QUVPUZ",
"WARC-Record-ID": "<urn:uuid:276de803-cb14-47c4-83e3-423ba7dd773b>",
"WARC-Target-URI": "https://www.brodneil.com/myipneighbors-reverse-ip-lookup-free-service/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a5558c80-0e64-444c-8ec8-8335a256618e>"
},
"warc_info": "isPartOf: CC-MAIN-2023-14\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-84\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
2,
3,
50,
51,
99,
100,
162,
163,
190,
191,
329,
330,
479,
480,
481,
836,
837,
838,
1188,
1189,
1330,
1331
],
"line_end_idx": [
2,
3,
50,
51,
99,
100,
162,
163,
190,
191,
329,
330,
479,
480,
481,
836,
837,
838,
1188,
1189,
1330,
1331,
1346
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1346,
"ccnet_original_nlines": 22,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4481481611728668,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.05925925821065903,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1111111119389534,
"rps_doc_frac_unique_words": 0.5104602575302124,
"rps_doc_mean_word_length": 4.456067085266113,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0.0037036999128758907,
"rps_doc_unigram_entropy": 4.422000885009766,
"rps_doc_word_count": 239,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07323943823575974,
"rps_doc_frac_chars_dupe_6grams": 0.07323943823575974,
"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.0591549314558506,
"rps_doc_frac_chars_top_3gram": 0.0845070406794548,
"rps_doc_frac_chars_top_4gram": 0.04507042095065117,
"rps_doc_books_importance": -132.44158935546875,
"rps_doc_books_importance_length_correction": -132.44158935546875,
"rps_doc_openwebtext_importance": -88.75856018066406,
"rps_doc_openwebtext_importance_length_correction": -88.75856018066406,
"rps_doc_wikipedia_importance": -70.02589416503906,
"rps_doc_wikipedia_importance_length_correction": -70.0098876953125
},
"fasttext": {
"dclm": 0.041449788957834244,
"english": 0.9428048729896545,
"fineweb_edu_approx": 2.5930216312408447,
"eai_general_math": 0.024493340402841568,
"eai_open_web_math": 0.12291741371154785,
"eai_web_code": 0.025033650919795036
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.019",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-4,845,437,789,845,901,000 |
U.S. flag
An official website of the United States government
Skip to main content
Return to topReturn to top
Medical Science Publication No. 4, Volume 1
THURSDAY MORNING SESSION
22 April 1954
MODERATOR
LIEUTENANT COLONEL GEORGEJ. HAYES, MC
A REVIEW OF POSTMORTEM EXAMINATIONS IN COMBATCASUALTIES*
FIRST LIEUTENANT JOSEPHG. STRAWITZ, MC
During a 10-month period in 1952 and 1953 a pathologist was assignedto the Surgical Research Team of Korea operating at the 46th Army SurgicalHospital. His mission was to supplement research activities of the teamwith information gleaned from postmortem examinations performed on victimsof traumatic death previously treated at the hospital. Autopsies were alsodone routinely when death resulted from vehicular accidents, burns, medicalcauses and suicide.
This report deals only with 35 cases in which death followed treatmentof wounds received in combat. Analyses of other traumatic deaths are deletedin an effort to bring emphasis to those cases which pose the greatest problemsin management. Because of the relatively small number of cases presented,statistical significance cannot be attached to them. However, definitetrends can be observed and some generalizations made.
The large majority of casualties were examined by the same prosector.Microscopic review and interpretation were carried out by several membersof the Pathology Department of the 406th Medical General Laboratory. Clinicalhistories were recorded in great detail and frequently the prosector hadobserved the clinical course of the patient prior to death. Consequently,considerable consistency in examination and interpretation was possible.
Results
Table 1 lists the causes of death in 35 combat casualties. There isconsiderable overlap between the first three groups-irreversible shock,vital organ damage, and uncontrolled hemorrhage. Some cases with vitalorgan damage and others with uncontrolled hemorrhage showed changes consistentwith those seen in irreversible shock. On the other hand, in a few casesclassified as irreversible shock the patients exhibited uncontrolled hemorrhageduring some period of their clinical course. Despite this overlap, thesingle major cause of death
*Presented 22 April 1954, to the Course on Recent Advances in Medicine and Surgery, Army Medical Service Graduate School, Walter Reed Army Medical Center, Washington, D. C.
378
Table 1. Causes of Death in 35 Combat Casualties
Cause of death
Number of cases
Irreversible shock
11
Vital organ damage
9
Uncontrolled hemorrhage
6
Bronchial obstruction
2
Cardiac standstill
1
Myocardial infarction
(traumatic coronary thrombosis).
1
Blast injury (lungs)
1
Fat embolism (cerebral)
1
Uremia (lower nephron nephrosis)
1
Subdural hematoma
1
Cause undetermined
1
35
was determined by considering all factors. The causes of death in theremaining cases were quite specific.
Irreversible Shock. Over the years there has been a great dealof controversy regarding the disturbed state of physiology called irreversibleshock. Some investigators have even denied that such a syndrome exists.Recent thinking on the problem has implicated a number of etiologic possibilities.Hypoxia, bacterial invasion, tissue breakdown, psychological stress andother factors have been considered. They are difficult to evaluate in anysingle case since their nature is not well understood and methods of measurementhave not as yet been developed. A complex etiology is suspected in thisseries, since survival was observed in other cases with equal and greaterdegrees of tissue destruction and organ damage.
Experiments subjecting dogs to prolonged periods of hypotension haveshown that death ensues despite adequate blood volume replacement. Althoughthe period of hypotension required to produce death in humans is not known,there must be a time limit from which there is no return to normal.
Table 2 shows median values for the evacuation time, survival time andblood volume replacement in 11 cases of irreversible shock. On the basisof the prolonged period of hypotension, the severe state of clinical shockand the marked degree of tissue destruction displayed in most instances,the clinical diagnosis of irreversible shock was made.
Table 2. Median Values, Evacuation Time, SurvivalTime, and Blood Volume Replacement in 11 Cases of Irreversible Shock
Evacuation time, wounding to MASH
Survival time, wounding to death
Total blood volume replacement
4 hours, 45 minutes
17.5 hours
9.5 liters
379
Table 3 shows a tabulation of morphologic findings occurring in variouscombinations in irreversible shock. Petechial hemorrhages involving seroussurfaces and mucous membranes are commonly thought to result from prolongedhypoxemia. Subendocardial hemorrhages are not infrequently seen and arepeculiarly limited to the right side of the heart, as in the medical shockof hemorrhagic fever. The many differences in anatomy and physiology betweenleft and right sides of the heart have been seized upon to explain thispeculiar localization of hemorrhages. No positive explanation is availableto date.
Table 3. Morphologic Changes in IrreversibleShock
1. Petechial hemorrhages-Serosal, mucosal (gastrointestinal).
2. Dilatation and engorgement-Vessels in abdominal and thoracic viscera,brain, striated muscle.
3. Pulmonary edema.
4. Pulmonary atelectasis-Focal and diffuse.
5. Dilatation of cardiac chambers with flabbiness of the myocardium.
6. Renal tubular changes consistent with lower nephron nephrosis (microscopic).
7. Lipoid depletion-Adrenal cortical cells (microscopic).
8. Fatty vacuolization-Heart muscle, liver, kidney (microscopic).
Intense congestion of all organs and striated muscle was a consistentfinding. On section of lungs, liver, spleen or kidneys, fluid blood virtuallypoured out.
Microscopic examination confirmed the severe dilatation and congestionof all blood vessels. It is not surprising that large quantities of bloodwere used in attempts to maintain adequate arterial pressures in such expandedvascular trees.
Table 4 shows various degrees of pulmonary edema in 11 cases of irreversibleshock. The majority show some degree and over half exhibited marked edema.The average blood volume replacement is shown with each grade of edema.There appears to be more edema in those patients most vigorously resuscitated.It must again be emphasized that these cases represent a very small samplingand should be evaluated in this light.
Table 4. Degrees of Pulmonary Edema Comparedto Blood Volume Replacement in Cases of Irreversible Shock
Degree of pulmonary edema
Number of cases
Average blood volume replacement
No edema (below 500 grams)
1
2.0 liters
Slight (500-700 grams)
3
4.8 liters
Moderate (700-900 grams)
1
12.0 liters
Marked (900 grams plus)
6
13.0 liters
380
In classical descriptions, it has been suggested that pulmonary edemais a constant and integral part of the shock mechanism. Several factorsmay influence its development. It is certainly a common complication ofrenal insufficiency which frequently accompanies shock. Cardiac failure,as evidenced by gross flabbiness of the myocardium, dilatation of cardiacchambers and microscopic fatty degeneration of myocardial fibers, mustplay a considerable role in the formation of pulmonary edema. In a reviewof a large number of traumatic deaths, fat embolism has been shown notto predispose to this complication. It is difficult to assess the importanceof overenthusiastic intravenous therapy.
Varying amounts of pulmonary atelectasis were seen in many cases ofirreversible shock. In some cases, patchy areas were seen, while in othersthe greater part of a single lobe might be involved; this was usually basilarin distribution. These pulmonary findings may very well have representedagonal changes frequently seen in patients subjected to anesthesia, etc.In one case of the eleven, diffuse atelectasis was thought to be one ofthe principal factors causing death.
Congestion of striated muscle is listed as a morphologic finding inirreversible shock. This is particularly true of patients strenuously resuscitatedwith whole blood and fluids. Striated muscle composes a large part of thehuman body but is not often seriously considered at the postmortem tablebecause of its somewhat hidden anatomical location. Yet a great part ofthe vascular tree is found in these large masses of muscle. The typicalfinding in examining large avulsive wounds was severe congestion with outpouringof blood and fluids at autopsy incision. Further studies are necessaryto correlate this observation with the theory of blood sludging and pooling.
Renal failure is a universal finding in irreversible shock. The principalmorphologic findings consist of heme casts within tubules and varying degreesof degeneration of the tubular epithelium. In larger series of cases thesechanges are found to occur after the first 24 hours of shock. In this series,all showed marked renal insufficiency during the clinical courses. Fourof 11 cases showed morphologic changes consistent with lower nephron nephrosis.The remaining cases might have exhibited these changes had the time ofsurvival been longer than the average 17.5 hours.
Dr. Tracy Mallory, in studying postmortem material from shocked patientsduring World War II, found a peculiar morphologic change in the viscerawhen the survival time was over 18 hours. With special stains, fat vacuolizationwas demonstrated in the heart, the central cells of liver lobules and theascending limbs of Henle's loops. In the adrenal gland the doubly refractilelipid became depleted after the same time interval. From the fourth dayonward in cases not com-
381
plicated by infection, a tendency to a return to normal could be demonstrated.Special stains were not carried out in cases presented in this report.However, Dr. Mallory's finding is an important morphologic demonstrationof an intracellular response to injury produced by shock.
Vital Organ Damage. Nine patients died of vital organ damagenot compatible with life. Seven showed extensive brain damage and two haddirect cardiac involvement by shell fragments. The majority of patientssurvived for some hours.
Uncontrolled Hemorrhage
Table 5 shows a summary of six patients whose deaths were attributedto uncontrolled hemorrhage. All showed profuse bleeding from lacerated,large vascular channels. It appears in most cases that if adequate controlof profuse hemorrhage had been possible early, death may not have occurred.The average evacuation time from wounding to hospital admission is considerablyshorter than that seen in irreversible shock. Pulmonary edema is a lessfrequent finding.
Table 5. Summary of Six Cases of UncontrolledHemorrhage
Case No.
Evacuation time wounding to MASH (hours)
Total blood vol. replacement (liters)
Pulmonary edema
Site of bleeding
Survival time (hours)
1
51/2
10.5
None
Laceration of pulmonary vessels.
113/4
2
3
0
None
Splenic rupture, laceration of lung.
3
3
21/2
Total unknown
3.5.
None
Lacerated kidney, retroperitoneal and peritoneal hemorrhage.
18
4
4
18
None
Lacerated vena cava
17
5
1
6.5
Moderate
Lacerated dural vessels.
41/2
6
11/2
9.5
Moderate
Lacerated mesenteric vessels.
31/2
Average
2. 9
8.5
-----
-----
9. 6
Bronchial Obstruction. An open airway is always a primary considerationin surgical cases in both military and civilian life. Two patients in thisseries died of bronchial obstruction. A simple amputation of a lower extremitywas performed in one case with excellent chance of recovery. Aspirationof vomitus 15 minutes postoperatively was the cause of death. The remainingpatient suffered a perforating gunshot wound of the lung with bleedinginto the bronchial
382
tree and obstruction. This patient died shortly after hospital admission.
Cardiac Standstill. Cardiac standstill is a physiologic deathwhich ordinarily is unaccompanied by morphologic changes. One patient withmultiple avulsive and puncture wounds of all extremities died during surgery.Cardiac massage was performed without benefit. A moderate number of fatemboli were seen microscopically in small myocardial blood vessels. Itis not known what influence they may have had on cardiac function.
Myocardial Infarction (Traumatic Coronary Thrombosis). The onecase of myocardial infarction resulting from coronary thrombosis was asurprising finding. The patient, who suffered a puncture wound of the leftlung from small arms fire, showed progressive cardiac failure during surgery.At autopsy, an antemortem thrombus was found in the lumen of the circumflexbranch of the left coronary artery. Microscopically the myocardium exhibiteddegenerative changes. Although there was no myocardial laceration in theregion of the left coronary artery, diffuse subepicardial and perivascularhemorrhages suggested that contusion and arteritis may have occurred fromthe marked pressure changes when the missile passed through the thorax.
Fat Embolism. Fat embolism has been recognized as a complicationof trauma and fractures for many years. Different investigators have ascribedvarying importance to it as a death-producing clinical entity. CaptainRobert E. Scully has reviewed a large number of battle casualty autopsiesand has shown that fat is found in the lungs in over 90 percent of casesand is occasionally seen in the kidneys (1). Cases of death resultingfrom fat embolism were rare in his review. The criteria for establishingfat embolism as a cause of death are a typical clinical history with neurologicfindings and the presence of a moderate to marked degree of fat in thevessels of the lung, kidney and brain. Perivascular hemorrhages and necrosisin the brain are the usual findings in fatal cases.
The one fatal case of fat embolism in this series was classical. Thepatient suffered traumatic amputations of several extremities and numerousavulsive and puncture wounds. Preoperative resuscitation and surgery wereuneventful. However, recovery from anesthesia was not complete and intracranialhemorrhage was suspected when the patient remained unconscious and displayedmuscular twitchings. A craniotomy was negative. The patient died severaldays after wounding and postmortem examination revealed the typical morphologicfindings of fatal fat embolism.
Blast Injury. In World Wars I and II injuries to the thoracicand abdominal viscera and to the central nervous system were observed
383
to occur as the result of rapid changes in the environmental pressurefrom air blast. When persons are exposed to the effects of nearby shelland mortar explosions, death may occur with minimal evidence of externalinjury. Hemorrhages and lacerations of the lungs, abdominal viscera orbrain may occur. One patient in this series was close to an exploding mortarround and showed severe pulmonary hemorrhage, congestion, contusion andedema without perforation of the thorax. This patient was admitted to thehospital but died shortly afterwards with severe respiratory distress andhypoxia. A large shell fragment was found in the region of the left kidney.
Lower Nephron Nephrosis. One case of marked renal insufficiencyresulting from a penetrating abdominal wound with multiple perforationsof the small intestines was seen in this series. The patient died 6 dayspost-wounding in uremia. The morphologic findings were compatible withsevere lower nephron nephrosis. There were numerous heme casts in renaltubules and marked degeneration of the tubular epithelium. A fibrinopurulentperitonitis was found at autopsy.
Subdural Hematoma. One patient had a subdural hematoma as a complicationof a skull fracture. A very large subdural blood clot was evacuated. Thepatient died shortly thereafter with signs of increased intracranial pressure.
Cause Undetermined. In the one case in which a cause of deathcould not be established, the patient suffered a gunshot wound of the abdomenwith laceration of the tail of the pancreas. The postoperative course wasuneventful and the patient was ambulatory. He suddenly developed severerespiratory distress on the sixth postoperative day and died 12 hours laterin vascular collapse. The clinical history was suggestive of pulmonaryembolism, but the autopsy did not confirm this diagnosis. There were nosignificant findings to suggest a cause of death.
Summary
An analysis of 35 postmortem examinations in combat casualties dyingrelatively soon after wounding is presented. Irreversible shock, vitalorgan damage and uncontrolled hemorrhage constitute the major causes ofdeath. Bronchial obstruction, cardiac standstill, traumatic coronary thrombosis,blast injury and subdural hematoma were found less frequently. One caseof lower nephron nephrosis is described in a patient who died 6 days post-wounding.Although fat embolism is found frequently in the lungs of victims of traumaticdeath, it rarely is the principal factor causing death.
Reference
Scully, R. E.: Fat Embolism in Wartime. (Awaitingpublication.)
|
{
"url": "https://achh.army.mil/history/book-korea-recad1-ch7-1/",
"source_domain": "achh.army.mil",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "488395",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OKOXF5KKL4RCQM62GE3ODWUOX3ZTYLI5",
"WARC-Concurrent-To": "<urn:uuid:19739bd1-7ff6-4b2b-8b85-23c07b93f192>",
"WARC-Date": "2024-07-19T05:10:40Z",
"WARC-IP-Address": "52.245.192.111",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FVZODFJE3OAIEL5WMOPD7BCKNZHIXUQM",
"WARC-Record-ID": "<urn:uuid:f2f0e35a-a2be-4038-a221-98e3234ef687>",
"WARC-Target-URI": "https://achh.army.mil/history/book-korea-recad1-ch7-1/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2b6376e9-32ea-491d-b1dc-45534351db13>"
},
"warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-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,
10,
11,
63,
64,
85,
112,
113,
157,
158,
183,
197,
198,
208,
246,
247,
248,
305,
306,
345,
346,
802,
803,
1224,
1225,
1662,
1663,
1671,
1672,
2207,
2208,
2209,
2382,
2383,
2384,
2388,
2389,
2438,
2439,
2454,
2455,
2471,
2472,
2491,
2492,
2495,
2496,
2515,
2516,
2518,
2519,
2543,
2544,
2546,
2547,
2569,
2570,
2572,
2573,
2592,
2593,
2595,
2596,
2618,
2651,
2652,
2654,
2655,
2676,
2677,
2679,
2680,
2704,
2705,
2707,
2708,
2741,
2742,
2744,
2745,
2763,
2764,
2766,
2767,
2786,
2787,
2789,
2790,
2793,
2794,
2900,
2901,
3610,
3611,
3897,
3898,
4241,
4242,
4360,
4361,
4395,
4396,
4429,
4430,
4461,
4462,
4482,
4483,
4494,
4495,
4506,
4507,
4508,
4512,
4513,
5108,
5109,
5159,
5160,
5222,
5318,
5338,
5382,
5451,
5531,
5589,
5655,
5656,
5814,
5815,
6052,
6053,
6467,
6468,
6571,
6572,
6598,
6599,
6615,
6616,
6649,
6650,
6677,
6678,
6680,
6681,
6692,
6693,
6716,
6717,
6719,
6720,
6731,
6732,
6757,
6758,
6760,
6761,
6773,
6774,
6798,
6799,
6801,
6802,
6814,
6815,
6816,
6820,
6821,
7507,
7508,
7978,
7979,
8642,
8643,
9214,
9215,
9683,
9684,
9685,
9689,
9690,
9968,
9969,
10198,
10199,
10223,
10224,
10680,
10681,
10737,
10738,
10747,
10748,
10789,
10790,
10828,
10829,
10845,
10846,
10863,
10864,
10886,
10887,
10889,
10890,
10895,
10896,
10901,
10902,
10907,
10908,
10941,
10942,
10948,
10949,
10951,
10952,
10954,
10955,
10957,
10958,
10963,
10964,
11001,
11002,
11004,
11005,
11007,
11008,
11013,
11014,
11028,
11033,
11034,
11039,
11040,
11101,
11102,
11105,
11106,
11108,
11109,
11111,
11112,
11115,
11116,
11121,
11122,
11142,
11143,
11146,
11147,
11149,
11150,
11152,
11153,
11157,
11158,
11167,
11168,
11193,
11194,
11199,
11200,
11202,
11203,
11208,
11209,
11213,
11214,
11223,
11224,
11254,
11255,
11260,
11261,
11262,
11270,
11271,
11272,
11277,
11278,
11279,
11283,
11284,
11285,
11291,
11292,
11293,
11299,
11300,
11301,
11306,
11307,
11765,
11766,
11767,
11771,
11772,
11846,
11847,
12267,
12268,
12993,
12994,
13768,
13769,
14322,
14323,
14454,
14455,
14456,
14460,
14461,
15112,
15113,
15570,
15571,
15794,
15795,
16343,
16344,
16352,
16353,
16930,
16931,
16941,
16942,
17005,
17006
],
"line_end_idx": [
10,
11,
63,
64,
85,
112,
113,
157,
158,
183,
197,
198,
208,
246,
247,
248,
305,
306,
345,
346,
802,
803,
1224,
1225,
1662,
1663,
1671,
1672,
2207,
2208,
2209,
2382,
2383,
2384,
2388,
2389,
2438,
2439,
2454,
2455,
2471,
2472,
2491,
2492,
2495,
2496,
2515,
2516,
2518,
2519,
2543,
2544,
2546,
2547,
2569,
2570,
2572,
2573,
2592,
2593,
2595,
2596,
2618,
2651,
2652,
2654,
2655,
2676,
2677,
2679,
2680,
2704,
2705,
2707,
2708,
2741,
2742,
2744,
2745,
2763,
2764,
2766,
2767,
2786,
2787,
2789,
2790,
2793,
2794,
2900,
2901,
3610,
3611,
3897,
3898,
4241,
4242,
4360,
4361,
4395,
4396,
4429,
4430,
4461,
4462,
4482,
4483,
4494,
4495,
4506,
4507,
4508,
4512,
4513,
5108,
5109,
5159,
5160,
5222,
5318,
5338,
5382,
5451,
5531,
5589,
5655,
5656,
5814,
5815,
6052,
6053,
6467,
6468,
6571,
6572,
6598,
6599,
6615,
6616,
6649,
6650,
6677,
6678,
6680,
6681,
6692,
6693,
6716,
6717,
6719,
6720,
6731,
6732,
6757,
6758,
6760,
6761,
6773,
6774,
6798,
6799,
6801,
6802,
6814,
6815,
6816,
6820,
6821,
7507,
7508,
7978,
7979,
8642,
8643,
9214,
9215,
9683,
9684,
9685,
9689,
9690,
9968,
9969,
10198,
10199,
10223,
10224,
10680,
10681,
10737,
10738,
10747,
10748,
10789,
10790,
10828,
10829,
10845,
10846,
10863,
10864,
10886,
10887,
10889,
10890,
10895,
10896,
10901,
10902,
10907,
10908,
10941,
10942,
10948,
10949,
10951,
10952,
10954,
10955,
10957,
10958,
10963,
10964,
11001,
11002,
11004,
11005,
11007,
11008,
11013,
11014,
11028,
11033,
11034,
11039,
11040,
11101,
11102,
11105,
11106,
11108,
11109,
11111,
11112,
11115,
11116,
11121,
11122,
11142,
11143,
11146,
11147,
11149,
11150,
11152,
11153,
11157,
11158,
11167,
11168,
11193,
11194,
11199,
11200,
11202,
11203,
11208,
11209,
11213,
11214,
11223,
11224,
11254,
11255,
11260,
11261,
11262,
11270,
11271,
11272,
11277,
11278,
11279,
11283,
11284,
11285,
11291,
11292,
11293,
11299,
11300,
11301,
11306,
11307,
11765,
11766,
11767,
11771,
11772,
11846,
11847,
12267,
12268,
12993,
12994,
13768,
13769,
14322,
14323,
14454,
14455,
14456,
14460,
14461,
15112,
15113,
15570,
15571,
15794,
15795,
16343,
16344,
16352,
16353,
16930,
16931,
16941,
16942,
17005,
17006,
17007
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 17007,
"ccnet_original_nlines": 330,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.2948763966560364,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01433178037405014,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16338230669498444,
"rps_doc_frac_unique_words": 0.38669440150260925,
"rps_doc_mean_word_length": 5.857380390167236,
"rps_doc_num_sentences": 197,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.986069202423096,
"rps_doc_word_count": 2405,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.035990629345178604,
"rps_doc_frac_chars_dupe_6grams": 0.011074040085077286,
"rps_doc_frac_chars_dupe_7grams": 0.011074040085077286,
"rps_doc_frac_chars_dupe_8grams": 0.006388870067894459,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.008873430080711842,
"rps_doc_frac_chars_top_3gram": 0.009370340034365654,
"rps_doc_frac_chars_top_4gram": 0.003194429911673069,
"rps_doc_books_importance": -1314.259521484375,
"rps_doc_books_importance_length_correction": -1314.259521484375,
"rps_doc_openwebtext_importance": -720.7734375,
"rps_doc_openwebtext_importance_length_correction": -720.7734375,
"rps_doc_wikipedia_importance": -453.1162414550781,
"rps_doc_wikipedia_importance_length_correction": -453.1162414550781
},
"fasttext": {
"dclm": 0.029764890670776367,
"english": 0.929637610912323,
"fineweb_edu_approx": 2.6414027214050293,
"eai_general_math": 0.22700738906860352,
"eai_open_web_math": 0.38432008028030396,
"eai_web_code": 0.00375318992882967
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "616.072",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Pathology and Diseases"
}
},
"secondary": {
"code": "616.07",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Pathology and Diseases"
}
}
},
"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": "2",
"label": "Academic/Research"
},
"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": "3",
"label": "Academic Writing"
},
"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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-7,154,071,331,088,088,000 |
VariantChangeTypeEx function (oleauto.h)
Important
This API is affected by the problem described in Microsoft Support topic VarI8FromCy produces incorrect value when CY value is very large.
Converts a variant from one type to another, using an LCID.
Syntax
HRESULT VariantChangeTypeEx(
[out] VARIANTARG *pvargDest,
[in] const VARIANTARG *pvarSrc,
[in] LCID lcid,
[in] USHORT wFlags,
[in] VARTYPE vt
);
Parameters
[out] pvargDest
The destination variant. If this is the same as pvarSrc, the variant will be converted in place.
[in] pvarSrc
The variant to convert.
[in] lcid
The locale identifier. The LCID is useful when the type of the source or destination VARIANTARG is VT_BSTR, VT_DISPATCH, or VT_DATE.
[in] wFlags
Flags.
Value Meaning
VARIANT_NOVALUEPROP
Prevents the function from attempting to coerce an object to a fundamental type by getting the Value property. Applications should set this flag only if necessary, because it makes their behavior inconsistent with other applications.
VARIANT_ALPHABOOL
Converts a VT_BOOL value to a string containing either "True" or "False".
VARIANT_NOUSEROVERRIDE
For conversions to or from VT_BSTR, passes LOCALE_NOUSEROVERRIDE to the core coercion routines.
VARIANT_LOCALBOOL
For conversions from VT_BOOL to VT_BSTR and back, uses the language specified by the locale in use on the local computer.
[in] vt
The type to convert to. If the return code is S_OK, the vt field of the *pvargDest is guaranteed to be equal to this value.
Return value
This function can return one of these values.
Return code Description
S_OK
Success.
DISP_E_BADVARTYPE
The variant type is not a valid type of variant.
DISP_E_OVERFLOW
The data pointed to by pvarSrc does not fit in the destination type.
DISP_E_TYPEMISMATCH
The argument could not be coerced to the specified type.
E_INVALIDARG
One of the arguments is not valid.
E_OUTOFMEMORY
Insufficient memory to complete the operation.
Remarks
The VariantChangeTypeEx function handles coercions between the fundamental types (including numeric-to-string and string-to-numeric coercions). A variant that has VT_BYREF set is coerced to a value by obtaining the referenced value. An object is coerced to a value by invoking the object's Value property (DISPID_VALUE).
Typically, the implementer of IDispatch::Invoke determines which member is being accessed, and then calls VariantChangeType to get the value of one or more arguments. For example, if the IDispatch call specifies a SetTitle member that takes one string argument, the implementer would call VariantChangeTypeEx to attempt to coerce the argument to VT_BSTR.
If VariantChangeTypeEx does not return an error, the argument could then be obtained directly from the bstrVal field of the VARIANTARG. If VariantChangeTypeEx returns DISP_E_TYPEMISMATCH, the implementer would set *puArgErr to 0 (indicating the argument in error) and return DISP_E_TYPEMISMATCH from IDispatch::Invoke.
Arrays of one type cannot be converted to arrays of another type with this function.
Note The type of a VARIANTARG should not be changed in the rgvarg array in place.
Requirements
Target Platform Windows
Header oleauto.h
Library OleAut32.lib
DLL OleAut32.dll
See also
Variant Manipulation Functions
VariantChangeType
|
{
"url": "https://learn.microsoft.com/en-us/windows/win32/api/oleauto/nf-oleauto-variantchangetypeex",
"source_domain": "learn.microsoft.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "44279",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FNA3SXHZLBZPYUDKOPU7SC4QVFNDWHMY",
"WARC-Concurrent-To": "<urn:uuid:5a719740-f5b3-4f4d-a540-b5a7b75da7bd>",
"WARC-Date": "2022-12-03T23:44:52Z",
"WARC-IP-Address": "104.73.29.190",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:EC5B3Z47OWICHFJAJPKXN2QCAK54NEGE",
"WARC-Record-ID": "<urn:uuid:d154b689-0404-4b36-a813-ca611c4fe3e9>",
"WARC-Target-URI": "https://learn.microsoft.com/en-us/windows/win32/api/oleauto/nf-oleauto-variantchangetypeex",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:25686808-50e7-4789-91ee-ad4784ab6036>"
},
"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-148\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,
41,
42,
52,
53,
192,
193,
253,
254,
261,
262,
291,
328,
363,
394,
427,
455,
458,
459,
470,
471,
487,
488,
585,
586,
599,
600,
624,
625,
635,
636,
769,
770,
782,
783,
790,
791,
805,
825,
1059,
1077,
1151,
1174,
1270,
1288,
1410,
1411,
1419,
1420,
1544,
1545,
1558,
1559,
1605,
1606,
1630,
1635,
1644,
1662,
1711,
1727,
1796,
1816,
1873,
1886,
1921,
1935,
1982,
1983,
1991,
1992,
2313,
2314,
2669,
2670,
2989,
2990,
3075,
3076,
3159,
3161,
3162,
3175,
3176,
3180,
3204,
3221,
3242,
3259,
3260,
3269,
3270,
3301,
3302
],
"line_end_idx": [
41,
42,
52,
53,
192,
193,
253,
254,
261,
262,
291,
328,
363,
394,
427,
455,
458,
459,
470,
471,
487,
488,
585,
586,
599,
600,
624,
625,
635,
636,
769,
770,
782,
783,
790,
791,
805,
825,
1059,
1077,
1151,
1174,
1270,
1288,
1410,
1411,
1419,
1420,
1544,
1545,
1558,
1559,
1605,
1606,
1630,
1635,
1644,
1662,
1711,
1727,
1796,
1816,
1873,
1886,
1921,
1935,
1982,
1983,
1991,
1992,
2313,
2314,
2669,
2670,
2989,
2990,
3075,
3076,
3159,
3161,
3162,
3175,
3176,
3180,
3204,
3221,
3242,
3259,
3260,
3269,
3270,
3301,
3302,
3319
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3319,
"ccnet_original_nlines": 93,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.37068966031074524,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0672413781285286,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16551724076271057,
"rps_doc_frac_unique_words": 0.4388185739517212,
"rps_doc_mean_word_length": 5.540084362030029,
"rps_doc_num_sentences": 36,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.768824100494385,
"rps_doc_word_count": 474,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.014470679685473442,
"rps_doc_frac_chars_dupe_6grams": 0.014470679685473442,
"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.007616150192916393,
"rps_doc_frac_chars_top_3gram": 0.012947450391948223,
"rps_doc_frac_chars_top_4gram": 0.009139380417764187,
"rps_doc_books_importance": -180.27845764160156,
"rps_doc_books_importance_length_correction": -180.27845764160156,
"rps_doc_openwebtext_importance": -99.61587524414062,
"rps_doc_openwebtext_importance_length_correction": -99.61587524414062,
"rps_doc_wikipedia_importance": -13.201057434082031,
"rps_doc_wikipedia_importance_length_correction": -13.201057434082031
},
"fasttext": {
"dclm": 0.03217500075697899,
"english": 0.730914294719696,
"fineweb_edu_approx": 3.091177463531494,
"eai_general_math": 0.6396950483322144,
"eai_open_web_math": 0.154485285282135,
"eai_web_code": 0.8889982104301453
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
8,214,921,641,261,895,000 |
* Posts by DavidRa
131 posts • joined 1 Feb 2011
Page:
Microsoft tests ‘Suggested Actions’ in Windows 11. Insiders: Can we turn it off?
DavidRa
Devil
Re: Just. Stop.
Well naturally. Why else are they so hellbent on ensuring that every machine is signed into a Microsoft account, even the ones that are isolated from the internet?
Atlassian boasts strong Q3 revenue growth in wake of two-week outage
DavidRa
Paris Hilton
Incompetence you say? All they did was create an internal API to unquestioningly and permanently delete things by number, and passed the wrong number to it. 800+ times. Because no-one noticed the wrong numbers were supplied.
Could happen to anyone!
Paris is looking at the list of IDs to be submitted to the API...
Free enterprise systems management tool Uyuni releases stable version
DavidRa
Meh, still needs openSUSE as the server
It does look like a great idea and is probably a good tool, but demands openSUSE for the server. So unless you're using it already, it's another Linux to learn and understand (while the base is the same the foibles matter a LOT).
Were it possible to deploy to Debian or Centos then maybe I'd consider it more thoughtfully.
Microsoft reveals revamped Azure CDN – in two editions
DavidRa
Ugh timing Microsoft!
I literally deployed Azure CDN today, brand new for a customer. The beauty of CDN plus storage account was low cost - I had a small static website that would have been literally cents per month. This change ratchets the costs up about 10000%. Couldn't you have waited a week till the project closed!? I would have avoided all the angst!
BOFH: The Geek's Countergambit – outwitted at an electronics store
DavidRa
Re: 3gb
Gave up on Seagate...
Don't know who makes all these now, but not one ever failed me.
Mostly Seagate and Western Digital.
Alert: Let's Encrypt to revoke about 2 million HTTPS certificates in two days
DavidRa
Re: Would be really nice
Thank you Bernard, that will be quite enough.
Say what you see: Four-letter fun on a late-night support call
DavidRa
Re: File a bug report to the manufacturer
The problem is that people don't read them anyway. Perfect case in point would be an error message that says
"Please call the help desk on 555 5555 and say that the Rostrum app had error Bingo"
They call and what you're told is that
* I can't log on
* There's no error message
* Windows is broken
* It's definitely not the same Bingo problem in Rostrum that twenty people have reported.
How do you make that any clearer?
GitHub's npm gave away a package name while it was in use, causing rethink
DavidRa
Re: In this case I think the correct decision was made.
I'm not so sure it's entirely on the dev. Surely part of the check before releasing the name should have included checking simple things, perhaps like "whether the bloody thing had been updated in the past year". I recognise that there are statements about "fixing the process" but really, given there was evidence of continuous use, it should be more like the ICANN result where the original owner gets it back.
Is it broken yet? Is it? Is it? Ooh that means I can buy a sparkly, new but otherwise hard-to-justify replacement!
DavidRa
Devil
I'm feeling personally attacked
How dare you sir? What gives you the right to denigrate me in this fashion? I'm shocked and appalled.
BOFH: I'm so pleased to be on the call, Boss. No, of course this isn't a recording
DavidRa
Re: Sorry I'm late
Is there any chance that some of them, or perhaps all of them, are... Alike?
Hi, Congress. FTC here. It would be so wonderful if you could let us recover money stolen from victims by crooks
DavidRa
Devil
Re: What's going on?
Just being deliberately obtuse perhaps, but this stance is consistent with the US stubborn belief that perfectly free markets are wonderful and business is the only thing worth supporting.
Allowing clawbacks for fraud opens businesses to such oppressive actions like having to deliver what's been sold lest the business have to refund.
I know it's not actually that had but it sure seems like it sometimes.
iFixit wants you to be legally able to break software locks to repair gizmos. Unsurprisingly, manufacturers are less keen
DavidRa
Re: Environmental repair tax
I am thinking of the company profits, and how good they'll look when not needlessly extracted from the pockets of the customers.
Microsoft previews Windows Server 2022: Someone took a spanner to core plumbing features
DavidRa
Re: Holds hand up....
I also prefer Core where possible but it's no longer true (if indeed it ever was) that there are fewer updates and reboots. Microsoft shot that idea down the moment they moved from individual updates to the CU model. Core and Desktop receive the same packages, same size and they install in about the same time on each.
I suspect I'm neither the first nor only person to call it the Cumulative Update for New Technology model on the back of Windows historical designation.
Buggy chkdsk in Windows update that caused boot failures and damaged file systems has been fixed
DavidRa
Re: When is it safe to make the jump?
For goodness sake. Windows 10 is more than five years old at this point. Windows 7 hasn't received security updates for a year.
You can pretend all you want that you're waiting to see what happens but reality says you've made the decision already to stay on old and familiar but increasingly insecure.
In my view you're the "XP is best" dinosaur from late Windows 7 timeframes.
What does my neighbour's Tesla have in common with a stairlift?
DavidRa
Re: EVs = bad for planet, bad for poor people, bad for practicality
I've considered the idea of solar + battery cars in the past, but even with double the efficiency of modern solar, I'd need 6m2 of panels for the daily (220km) commute. I think I'm an outlier, but I don't think the fit for many will be as promising as Aptera suggest (since lots of parking is underground, for example, you're not going to get charged while you're away from the car).
Can't fault them for trying though.
Travel agent leaked customer data by – this is embarrassing – giving it away in a hackathon
DavidRa
Re: Postcodes [in the UK] can be personal too
It's not quite that simple though. Some postcodes in Australia cover quite large geographical areas with lots of people, others cover large areas with a few people, and still others might cover just a few suburbs in Sydney or Melbourne.
Wikipedia - Postcodes in Australia gives a few examples of extremes.
Given those sorts of examples, most Australians probably won't think of a postcode as being able to directly identify people.
Italian competition watchdog slaps Apple with €10m fine over allegedly misleading iPhone waterproofing claims
DavidRa
Re: Own Goal
Yes, but we dont then keep it at 97C despite being told that it is too hot and goes against policy which states it is supposed to be 80C. And continue doing so after complaints that it was too hot, because it saves $2 in replacing it over the course of the day.
Microsoft pledges to give Teams users multi-account sign-in then reels it back to one work and one personal
DavidRa
Browser profiles are the shiz for this
The trick here is to use Profiles in Edgium (I think it's called Profiles in Chrome too?) to separate out your personas. I have between 4 and 10 on the go at any one time - one for my company, and one each for every O365 or Azure customer.
Also, if you can get yourself onto the CSP program, you should be able to set up the tenants so you log in once, and have delegated access to the other tenancies; you can then switch between them using links at the top of the various admin portals.
Let's Encrypt warns about a third of Android devices will from next year stumble over sites that use its certs
DavidRa
Devil
Support old devices? What are you, a socialist or something?
Because if they support older devices, people who won't purchase new devices won't purchase any new devices and they might miss out on ten cents of advertising revenue. This is horrifically bad, because that ten cents of revenue might mean that the shareholders would need to spend 10c of their OWN MONEY for the 600 foot power yacht.
And apparently we can't have that.
With so many cloud services dependent on it, Azure Active Directory has become a single point of failure for Microsoft
DavidRa
Re: How it will all work out.
I believe the draft name is "Edge Computing" - locating the compute close to the users and data.
What a concept.
Oracle hosting TikTok US data. '25,000' moderators hired. Code reviews. Trump getting his cut... It's the season finale
DavidRa
Stop trying to look behind the curtain! There's nothing behind the curtain. Also, the emperor's clothes are fantastic.
Why cloud costs get out of control: Too much lift and shift, and pricing that is 'screwy and broken'
DavidRa
Re: I can see it now
I believe the new hotness is Edge Computing. Get the compute and services out where the users are for latency and performance.
Also known as on premise.
The point of containers is they aren't VMs, yet Microsoft licenses SQL Server in containers as if they were VMs
DavidRa
So your contention here seems to be that a SME with a need for SQL Server to support a line of business application for 50 users on 4 cores in a VM or container should pay the same as a large multinational who want to support 5,000 users on bare metal and 128 cores.
I don't agree with that opinion at all.
If you don't want to pay the licenses, buy or build a solution that doesn't require them. Otherwise - it's a business, pay for the software.
Brit MP demands answers from Fujitsu about Horizon IT system after Post Office staff jailed over accounting errors
DavidRa
Re: Any chance
I was given to understand that an EW is there on behalf of the court (and therefore "called" by the presiding judge), not either of the parties to the action. It seems that would be the only reasonable way to have someone who is impartial in their role as the EW (and specifically that's because they are _seen_ to be impartial as well).
Microsoft! Please, put down the rebrandogun. No one else needs to get hurt... But it's too late for Visual Studio Online
DavidRa
Re: Questionable value
Honestly, I've spent five weekends and countless nights trying to get K8s to run in a truly HA mode in my lab (3 masters, shared storage for volumes and 2+ workers). I've read dozens of K8s guides, 95% of which build an "HA" environment with a single cluster master accessible only from the master itself.
The other 5% are outdated (even though at least one was only 4 months old, it referenced a process that had been replaced two months prior to the guide date) or plain don't work as written.
At this point K8s feels like ivory tower academia desperately pretending it's open but rabidly protecting its IP so it *can't* be replicated on premise. That's not really a recipe for a future in which I want to be building IT.
That in turn means that I don't currently see containers as a way out of the cloud mess, in case it's not clear.
Spyware slinger NSO to Facebook: Pretty funny you're suing us in California when we have no US presence and use no American IT services...
DavidRa
Re: Class action suit?
I rather suspect that admitting that is irrelevant - wouldn't it be the case that only the owner of the mobile device would have standing (in the legal sense) in a disagreement about the specific devices?
After all, Alice can't sue Bob for Bob breaking into Candace's computer, right?
Is Chrome really secretly stalking you across Google sites using per-install ID numbers? We reveal the truth
DavidRa
Your information is out of date. Edge Stable has been available for several weeks (both v79 and v80 are in stable, and those map closely to Chromium versions with the same inflated numbers). While there are Dev and Canary channels (and I run in Dev) it's definitely wide release as of Jan 15.
And as far as I can see, Edgium doesn't send the X-Client-Data header (nor did it seem to have an equivalent for Microsoft properties so it seems to be MORE privacy conscious than Chrome).
I don't get the continued FUD about Microsoft hoovering up info - unlike Google where you don't pay for stuff (which supposedly means you're "the product", right) you do pay MS. And regardless of all the noise about it, I've never actually seen anyone show any data suggesting that MS really is copying everyone's hard disks to the cloud. Even when all the "privacy invasions" are left on.
DavidRa
Re: PII leak
While that's true, it doesn't mean they have (or that there won't be some kind of process failure that releases one of the stragglers to someone else).
Fed-up air safety bods ban A350 pilots from enjoying cockpit coffees
DavidRa
Re: Euphemisms
As opposed to the "CFIT" designation - Controlled Flight Into Terrain.
Remember when Europe’s entire Galileo satellite system fell over last summer? No you don’t. The official stats reveal it never happened
DavidRa
Re: European Space SLAs
's water music was referencing a song by Tom Lehrer, "Wernher von Braun".
A Notepad nightmare leaves sysadmin with something totally unprintable
DavidRa
Re: Support ticket
Not quite. The Exchange 5.5 Admin console had a nasty habit of not committing changes with the OK button, leading to those who administered Exchange being rapidly conditioned to clicking both in sequence.
That code that could never run? Well, guess what. Now Windows thinks it's Batman
DavidRa
Go
Re: Assume the worst
That was (and still is) a neat little trick in the languages that allow it. I recall that was the reason that my rubber-banding worked properly (1993 Xterms being what they were) and in near real time - most of the others were about 3x slower than real time and if you followed the absolute dunce-cap algorithm in the provided materials, 9x slower.
For clarity, when drawing an ellipse with this particular library, you had to nominate the top left and bottom right corners - so if you started in the wrong direction you'd get undefined results or crashes. The provided algorithm was something like:
if ((x1 < x2) && (y1 > y2)) { swap (y1, y2); }
if ((x1 > x2) && (y1 < y2)) { swap (x1, x2); }
if ((x1 > x2) && (y1 > y2)) { swap (x1, x2); swap (y1, y2); }
if ((x1 > x2) && (y1 > y2)) { }
And yes, swap() was the 3 variable load/store, as a function. Replace with the passthrough macro version of SWAP, optimise the compare/swap:
#define SWAP(a,b) (a ^= b ^= a ^= b)
if (x1 > x2) SWAP (x1, x2);
if (y1 > y2) SWAP (y1, y2);
And done.
Bad news: 'Unblockable' web trackers emerge. Good news: Firefox with uBlock Origin can stop it. Chrome, not so much
DavidRa
What always amazes me is that the advertising companies must have technical folk working for them. Why then do those technical people assist the marketroids? I couldn't in good conscience do that kind of deep analysis work to assist an ad-slinger - and I find it near incomprehensible that others sell their souls that way.
DavidRa
Re: Chrome or Chromium?
Seems likely, since the extra JS methods/functions would need to be added to the DOM in source.
Think your VMware snapshots are all good? Guess again if you're on Windows Server 2019
DavidRa
Re: Backups
It's called VSS, but it's new technology (only available since Windows 2003) so I'm not surprised some vendors haven't gotten around to fully supporting it yet.
Normally I'd expect installing VMWare Tools to provide the conduit between "host wants an application-consistent snapshot" and "call VSS function to quiesce IO properly". It's probably less than two hundred lines of code including proper error checking (I say 200 because I expect the bare call is probably ... 5).
Linky revisited: How the evil French smart meter escaped Hell to taunt me
DavidRa
Re: obligitory
The topologist will point out that they are in fact identical.
The mod firing squad: Stack Exchange embroiled in 'he said, she said, they said' row
DavidRa
Re: Good riddance!
> (BTW, I prefer to be refereed to as "Oi You" although "You Bas****d" is also acceptable).
Identity theft is NOT a joke.
We asked for your Fitbit horror stories and, oh wow, did you deliver: Readers sync their teeth into 'junk' gizmos
DavidRa
Remind me again where the phone is going to be to measure your heart rate while swimming, running or biking, count laps and provide basic info such as the SMS from your SO (which might mean an emergency)? I too was a naysayer until that specific need (swimming data/analysis) presented itself. The alternative would appear to be a heart rate band and the phone app, which would seem to provide no significant benefits and some detriment when compared to the wristwatch.
DavidRa
"Pointless" last word
The GP seemed to display a remarkable inability to conceive of situations that are not a perfect match to his own, and I submit therefore that the epithet under subsequent discussion was in fact both appropriate and deserved.
Literally braking news: Two people hurt as not one but two self-driving space-age buses go awry
DavidRa
Re: Physics will still be applied
Well, if they situate themselves correctly, they'll at least get a kiss before they pass on.
Even if that is likely to be a Liverpool kiss (that one was safe at time of writing, but YMMV).
The in and outs of Microsoft's new Windows Terminal
DavidRa
Re: "It still has a local console for when the worst happens"
All the more reason to install Core, I'd say.
Google may have taken this whole 'serverless' thing too far: Outage caused by bandwidth-killing config blunder
DavidRa
Re: Latency sensitive workloads
That would never happen, because everyone is so organised and time-rich thanks to our new automation overlords.
What the #!/%* is that rogue Raspberry Pi doing plugged into my company's server room, sysadmin despairs
DavidRa
Joke
Re: LOL Reddit
Oi, who are you calling calm and rational!?
Sure, Europe. Here's our Android suite without Search, Chrome apps. Now pay the Google tax
DavidRa
Re: Chaos
This feels like a "because they can" scenario. They figure the phones without Play Store will be less desirable and thus they can double/triple/quadruple charge for the service (charge the phone manufacturers for the right to put an icon on the device, charge the developers 15-30% - I can't remember the actual number - for Play Store access), and no doubt if they figure out a way to do it, charge consumers extra and possibly telcos too.
Rookie almost wipes customer's entire inventory – unbeknownst to sysadmin
DavidRa
Sure they did, but the universe invented better idiots
Of course. However, the incompletely-experienced often choose to force bypass that configuration. For example, a lot of systems aliased rm to "rm -i" by default, which would force interactive confirmations. People would then say "UGH, I hate having to do this" and add their own customisations to their shells/profiles etc:
unalias rm
alias rm=rm -f
Lo and behold, now no silly confirmations, regardless of stupidity/typos/etc.
Attempt to clean up tech area has shocking effect on kit
DavidRa
Re: C
50 litres a minute? Wow. The Australian nanny-state seems to have limited most of the pumps I've used in the last couple of decades to about 20-30 lpm at most. Can't find any supporting requirement (e.g. Wikipedia lists US as limiting to 10Gpm or ~38lpm, but nothing for AU).
Certainly makes filling a 90L tank in 40C temps a bore.
Official: Google Chrome 69 kills off the World Wide Web (in URLs)
DavidRa
I don't think you understand - this is Google demonstrating the problem so they can propose the advertising- and tracking-based fix.
When's a backdoor not a backdoor? When the Oz government says it isn't
DavidRa
Re: Question:
Of course they can, because they might be discussing terrywrism. With the threat of $50K fines hanging over their heads, we'll end up developing new capabilities - like the reconstruction of paper after burning, or creating the recording of a conversation years after it happened.
After all, if the laws of mathematics can be bypassed, physics and chemistry should be easy and reversal of entropy not far behind.
Automated payment machines do NOT work the same all over the world – as I found out
DavidRa
Re: Fs#king Pisa Airport!
So tell me - how many litres to fill the tank of this Fiat I've rented, based on the tank being 50L and the needle on the dial (which is of unknown accuracy and non-linear scale) showing somewhere between E and 1/2?
Bear in mind that if you get it wrong, you have to go through the rigamarole of doing it again with another semi-random amount or paying the $50 per ml that the rental extortionists charge?
My Civic used to get 330km from the "top half" of the dial (from F down to 1/2 tank) and 160km from the second half. 45L tank, but filling from E to 1/2 tank on the dial was only ~16 litres.
Sysadmin hailed as hero for deleting data from the wrong disk drive
DavidRa
Re: 512 MiB of misery
I've had to do that when I've realised I've hit the power button on the wrong bit of kit (but before I let go). You used to be able to keep it on if you reapplied power within about half a second - sure you didn't want to do it all the time, but I saved my own bacon a dozen times.
Then came ATX.
Page:
SUBSCRIBE TO OUR WEEKLY TECH NEWSLETTER
Biting the hand that feeds IT © 1998–2022
|
{
"url": "https://forums.theregister.com/user/48330/",
"source_domain": "forums.theregister.com",
"snapshot_id": "crawl=CC-MAIN-2022-27",
"warc_metadata": {
"Content-Length": "127463",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OFLECPHOVRR26UYQVLP3VZYNBGBUE5R6",
"WARC-Concurrent-To": "<urn:uuid:7ce29640-d5df-49bb-848a-356119365df7>",
"WARC-Date": "2022-07-06T11:15:38Z",
"WARC-IP-Address": "104.18.5.22",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FD72KOSNWKHW4M6C5RWFLTVV7FSL3RHJ",
"WARC-Record-ID": "<urn:uuid:a444812a-d885-4272-8eaa-97100416927c>",
"WARC-Target-URI": "https://forums.theregister.com/user/48330/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b027dc80-acc2-4e36-bea8-def511d210bd>"
},
"warc_info": "isPartOf: CC-MAIN-2022-27\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for June/July 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-111\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
19,
20,
50,
51,
57,
58,
139,
140,
148,
154,
155,
171,
172,
336,
337,
406,
407,
415,
428,
429,
654,
655,
679,
680,
746,
747,
817,
818,
826,
827,
867,
868,
1098,
1099,
1192,
1193,
1248,
1249,
1257,
1258,
1280,
1281,
1618,
1619,
1686,
1687,
1695,
1696,
1704,
1705,
1727,
1728,
1792,
1793,
1829,
1830,
1908,
1909,
1917,
1918,
1943,
1944,
1990,
1991,
2054,
2055,
2063,
2064,
2106,
2107,
2216,
2217,
2302,
2303,
2342,
2343,
2360,
2361,
2388,
2389,
2409,
2410,
2500,
2501,
2535,
2536,
2611,
2612,
2620,
2621,
2677,
2678,
3091,
3092,
3207,
3208,
3216,
3222,
3223,
3255,
3256,
3358,
3359,
3442,
3443,
3451,
3452,
3471,
3472,
3549,
3550,
3663,
3664,
3672,
3678,
3679,
3700,
3701,
3890,
3891,
4038,
4039,
4110,
4111,
4233,
4234,
4242,
4243,
4272,
4273,
4402,
4403,
4492,
4493,
4501,
4502,
4524,
4525,
4845,
4846,
4999,
5000,
5097,
5098,
5106,
5107,
5145,
5146,
5274,
5275,
5449,
5450,
5526,
5527,
5591,
5592,
5600,
5601,
5669,
5670,
6054,
6055,
6091,
6092,
6184,
6185,
6193,
6194,
6240,
6241,
6478,
6479,
6548,
6549,
6675,
6676,
6786,
6787,
6795,
6796,
6809,
6810,
7072,
7073,
7181,
7182,
7190,
7191,
7230,
7231,
7471,
7472,
7721,
7722,
7833,
7834,
7842,
7848,
7849,
7910,
7911,
8246,
8247,
8282,
8283,
8402,
8403,
8411,
8412,
8442,
8443,
8540,
8541,
8557,
8558,
8678,
8679,
8687,
8688,
8807,
8808,
8909,
8910,
8918,
8919,
8940,
8941,
9068,
9069,
9095,
9096,
9208,
9209,
9217,
9218,
9485,
9486,
9526,
9527,
9668,
9669,
9784,
9785,
9793,
9794,
9809,
9810,
10148,
10149,
10270,
10271,
10279,
10280,
10303,
10304,
10610,
10611,
10801,
10802,
11030,
11031,
11144,
11145,
11284,
11285,
11293,
11294,
11317,
11318,
11523,
11524,
11604,
11605,
11714,
11715,
11723,
11724,
12017,
12018,
12207,
12208,
12598,
12599,
12607,
12608,
12621,
12622,
12774,
12775,
12844,
12845,
12853,
12854,
12869,
12870,
12941,
12942,
13078,
13079,
13087,
13088,
13112,
13113,
13187,
13188,
13259,
13260,
13268,
13269,
13288,
13289,
13494,
13495,
13576,
13577,
13585,
13588,
13589,
13610,
13611,
13960,
13961,
14212,
14213,
14260,
14261,
14308,
14309,
14371,
14372,
14404,
14405,
14546,
14547,
14584,
14585,
14613,
14614,
14642,
14643,
14653,
14654,
14770,
14771,
14779,
14780,
15104,
15105,
15113,
15114,
15138,
15139,
15235,
15236,
15323,
15324,
15332,
15333,
15345,
15346,
15507,
15508,
15823,
15824,
15898,
15899,
15907,
15908,
15923,
15924,
15987,
15988,
16073,
16074,
16082,
16083,
16102,
16103,
16195,
16196,
16226,
16227,
16341,
16342,
16350,
16351,
16821,
16822,
16830,
16831,
16853,
16854,
17080,
17081,
17177,
17178,
17186,
17187,
17221,
17222,
17315,
17316,
17412,
17413,
17465,
17466,
17474,
17475,
17537,
17538,
17584,
17585,
17696,
17697,
17705,
17706,
17738,
17739,
17851,
17852,
17957,
17958,
17966,
17971,
17972,
17987,
17988,
18032,
18033,
18124,
18125,
18133,
18134,
18144,
18145,
18586,
18587,
18661,
18662,
18670,
18671,
18726,
18727,
19051,
19052,
19063,
19064,
19079,
19080,
19158,
19159,
19216,
19217,
19225,
19226,
19232,
19233,
19509,
19510,
19566,
19567,
19633,
19634,
19642,
19643,
19776,
19777,
19848,
19849,
19857,
19858,
19872,
19873,
20154,
20155,
20287,
20288,
20372,
20373,
20381,
20382,
20408,
20409,
20625,
20626,
20816,
20817,
21008,
21009,
21077,
21078,
21086,
21087,
21109,
21110,
21392,
21393,
21408,
21409,
21415,
21416,
21456,
21457
],
"line_end_idx": [
19,
20,
50,
51,
57,
58,
139,
140,
148,
154,
155,
171,
172,
336,
337,
406,
407,
415,
428,
429,
654,
655,
679,
680,
746,
747,
817,
818,
826,
827,
867,
868,
1098,
1099,
1192,
1193,
1248,
1249,
1257,
1258,
1280,
1281,
1618,
1619,
1686,
1687,
1695,
1696,
1704,
1705,
1727,
1728,
1792,
1793,
1829,
1830,
1908,
1909,
1917,
1918,
1943,
1944,
1990,
1991,
2054,
2055,
2063,
2064,
2106,
2107,
2216,
2217,
2302,
2303,
2342,
2343,
2360,
2361,
2388,
2389,
2409,
2410,
2500,
2501,
2535,
2536,
2611,
2612,
2620,
2621,
2677,
2678,
3091,
3092,
3207,
3208,
3216,
3222,
3223,
3255,
3256,
3358,
3359,
3442,
3443,
3451,
3452,
3471,
3472,
3549,
3550,
3663,
3664,
3672,
3678,
3679,
3700,
3701,
3890,
3891,
4038,
4039,
4110,
4111,
4233,
4234,
4242,
4243,
4272,
4273,
4402,
4403,
4492,
4493,
4501,
4502,
4524,
4525,
4845,
4846,
4999,
5000,
5097,
5098,
5106,
5107,
5145,
5146,
5274,
5275,
5449,
5450,
5526,
5527,
5591,
5592,
5600,
5601,
5669,
5670,
6054,
6055,
6091,
6092,
6184,
6185,
6193,
6194,
6240,
6241,
6478,
6479,
6548,
6549,
6675,
6676,
6786,
6787,
6795,
6796,
6809,
6810,
7072,
7073,
7181,
7182,
7190,
7191,
7230,
7231,
7471,
7472,
7721,
7722,
7833,
7834,
7842,
7848,
7849,
7910,
7911,
8246,
8247,
8282,
8283,
8402,
8403,
8411,
8412,
8442,
8443,
8540,
8541,
8557,
8558,
8678,
8679,
8687,
8688,
8807,
8808,
8909,
8910,
8918,
8919,
8940,
8941,
9068,
9069,
9095,
9096,
9208,
9209,
9217,
9218,
9485,
9486,
9526,
9527,
9668,
9669,
9784,
9785,
9793,
9794,
9809,
9810,
10148,
10149,
10270,
10271,
10279,
10280,
10303,
10304,
10610,
10611,
10801,
10802,
11030,
11031,
11144,
11145,
11284,
11285,
11293,
11294,
11317,
11318,
11523,
11524,
11604,
11605,
11714,
11715,
11723,
11724,
12017,
12018,
12207,
12208,
12598,
12599,
12607,
12608,
12621,
12622,
12774,
12775,
12844,
12845,
12853,
12854,
12869,
12870,
12941,
12942,
13078,
13079,
13087,
13088,
13112,
13113,
13187,
13188,
13259,
13260,
13268,
13269,
13288,
13289,
13494,
13495,
13576,
13577,
13585,
13588,
13589,
13610,
13611,
13960,
13961,
14212,
14213,
14260,
14261,
14308,
14309,
14371,
14372,
14404,
14405,
14546,
14547,
14584,
14585,
14613,
14614,
14642,
14643,
14653,
14654,
14770,
14771,
14779,
14780,
15104,
15105,
15113,
15114,
15138,
15139,
15235,
15236,
15323,
15324,
15332,
15333,
15345,
15346,
15507,
15508,
15823,
15824,
15898,
15899,
15907,
15908,
15923,
15924,
15987,
15988,
16073,
16074,
16082,
16083,
16102,
16103,
16195,
16196,
16226,
16227,
16341,
16342,
16350,
16351,
16821,
16822,
16830,
16831,
16853,
16854,
17080,
17081,
17177,
17178,
17186,
17187,
17221,
17222,
17315,
17316,
17412,
17413,
17465,
17466,
17474,
17475,
17537,
17538,
17584,
17585,
17696,
17697,
17705,
17706,
17738,
17739,
17851,
17852,
17957,
17958,
17966,
17971,
17972,
17987,
17988,
18032,
18033,
18124,
18125,
18133,
18134,
18144,
18145,
18586,
18587,
18661,
18662,
18670,
18671,
18726,
18727,
19051,
19052,
19063,
19064,
19079,
19080,
19158,
19159,
19216,
19217,
19225,
19226,
19232,
19233,
19509,
19510,
19566,
19567,
19633,
19634,
19642,
19643,
19776,
19777,
19848,
19849,
19857,
19858,
19872,
19873,
20154,
20155,
20287,
20288,
20372,
20373,
20381,
20382,
20408,
20409,
20625,
20626,
20816,
20817,
21008,
21009,
21077,
21078,
21086,
21087,
21109,
21110,
21392,
21393,
21408,
21409,
21415,
21416,
21456,
21457,
21498
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 21498,
"ccnet_original_nlines": 503,
"rps_doc_curly_bracket": 0.00037212998722679913,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41274359822273254,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03218742832541466,
"rps_doc_frac_lines_end_with_ellipsis": 0.007936510257422924,
"rps_doc_frac_no_alph_words": 0.17122837901115417,
"rps_doc_frac_unique_words": 0.38705310225486755,
"rps_doc_mean_word_length": 4.5295233726501465,
"rps_doc_num_sentences": 190,
"rps_doc_symbol_to_word_ratio": 0.0024085799232125282,
"rps_doc_unigram_entropy": 6.320763111114502,
"rps_doc_word_count": 3692,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.005023019853979349,
"rps_doc_frac_chars_dupe_6grams": 0.004305449780076742,
"rps_doc_frac_chars_dupe_7grams": 0.003707469906657934,
"rps_doc_frac_chars_dupe_8grams": 0.003707469906657934,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.017221789807081223,
"rps_doc_frac_chars_top_3gram": 0.0017939399695023894,
"rps_doc_frac_chars_top_4gram": 0.0019135300535708666,
"rps_doc_books_importance": -2426.095703125,
"rps_doc_books_importance_length_correction": -2426.095703125,
"rps_doc_openwebtext_importance": -1275.8746337890625,
"rps_doc_openwebtext_importance_length_correction": -1275.8746337890625,
"rps_doc_wikipedia_importance": -1022.8768310546875,
"rps_doc_wikipedia_importance_length_correction": -1022.8768310546875
},
"fasttext": {
"dclm": 0.2345409393310547,
"english": 0.9547136425971985,
"fineweb_edu_approx": 1.4210107326507568,
"eai_general_math": 0.289484441280365,
"eai_open_web_math": 0.21989232301712036,
"eai_web_code": 0.10219699144363403
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.4",
"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": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "5",
"label": "Comment Section"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
1,704,148,761,391,863,000 |
[ClusterLabs] node went to stand-by after one single resource-failure
Oscar Salvador osalvador.vilardaga at gmail.com
Mon Jun 8 08:05:19 EDT 2015
Hi guys!
I've configured two nodes with the stack pacemaker + corosync, with only
one resource ( just for test purposes ), and I'm having a strange result.
First a little bit of information:
pacemaker version: 1.1.12-1
corosync version: 2.3.4-1
# crm configure show
node 1053402612: server1 \
node 1053402613: server2
primitive IP-rsc_apache IPaddr2 \
params ip=xx.xx.xx.xy nic=eth0 cidr_netmask=255.255.255.192 \
meta migration-threshold=2 \
op monitor interval=20 timeout=60 on-fail=standby
property cib-bootstrap-options: \
last-lrm-refresh=1433763004 \
stonith-enabled=false \
no-quorum-policy=ignore
# cat corosync.conf
totem {
version: 2
token: 3000
token_retransmits_before_loss_const: 10
clear_node_high_bit: yes
crypto_cipher: none
crypto_hash: none
transport: udpu
interface {
ringnumber: 0
bindnetaddr: xx.xx.xx.xx
ttl: 1
}
}
logging {
to_logfile: yes
logfile: /var/log/corosync/corosync.log
debug: on
timestamp: on
logger_subsys {
subsys: QUORUM
debug: on
}
}
quorum {
provider: corosync_votequorum
two_node: 1
wait_for_all: 1
}
nodelist {
node {
ring0_addr: server1
}
node {
ring0_addr: server2
}
}
It's easy, I configured only one resource.
This resource can fail two times till it will get migrated to the ther
node, and if the monitoring operation for this resource causes a timeout
for more than 60s, the node will be marked as a standby, and the resource
will be automatically migrated to the other node.
At least, that would be the expected behaviour, but for some reason it
isn't.
Let's say that the resource IP-rsc_apache starts on server1, and we keep it
running there for some minutes.
Then we simulate that something goes wrong with:
# ip addr del xx.xx.xx.xx/26 dev eth0
As far as I know, pacemaker should notice that this resource is not running
anymore, and should increase the failcount for the pair resource-node. So
now should be "1", and since we specified "2", the resource should run
again in server1.
But this doesn't happen, because the resource jumps directly to server2:
Jun 08 13:47:54 [5856] server1 crmd: debug: do_state_transition:
All 2 cluster nodes are eligible to run resources.
Jun 08 13:47:54 [5855] server1 pengine: debug: determine_op_status:
IP-rsc_apache_monitor_20000 on server1 returned 'not running' (7)
instead of the expected value: 'ok' (0)
Jun 08 13:47:54 [5855] server1 pengine: warning: unpack_rsc_op_failure:
Processing failed op monitor for IP-rsc_apache on server1: not running
(7)
Jun 08 13:47:54 [5855] server1 pengine: info: native_print:
IP-rsc_apache (ocf::heartbeat:IPaddr2): Started server2
Jun 08 13:47:54 [5855] server1 pengine: info: get_failcount_full:
IP-rsc_apache has failed 1 times on server1
Jun 08 13:47:54 [5855] server1 pengine: info:
common_apply_stickiness: IP-rsc_apache can fail 1 more times on server1
before being forced off
Jun 08 13:47:54 [5855] server1 pengine: debug: native_assign_node:
Assigning server2 to IP-rsc_apache
Jun 08 13:47:54 [5855] server1 pengine: info: LogActions:
Leave IP-rsc_apache (Started server2)
As you can see here, IP-rsc_apache can fail one more time, but when pengine
computes, it says that the resource is assigned to the other server.
I'm not understand so much this, because I was testing this with and
old-stack ( pacemaker 1.1.7 + heartbeat ) and it worked as I expected, but
not here.
crm_mon shows me:
# crm_mon -f
Migration summary:
* Node server1:
IP-rsc_apache: migration-threshold=2 fail-count=1 last-failure='Mon Jun
8 13:32:54 2015'
* Node server2:
Failed actions:
IP-rsc_apache_monitor_20000 on server1 'not running' (7): call=24,
status=complete, last-rc-change='Mon Jun 8 13:32:54 2015', queued=0ms,
exec=0ms
# crm_mon -o
Last updated: Mon Jun 8 13:58:54 2015
Last change: Mon Jun 8 13:31:13 2015
Current DC: server1 (1053402612) - partition with quorum
2 Nodes configured
1 Resources configured
Node server1 (1053402612): standby (on-fail)
Online: [ server2 ]
IP-rsc_apache (ocf::heartbeat:IPaddr2): Started server2
Operations:
* Node server1:
IP-rsc_apache: migration-threshold=2 fail-count=1 last-failure='Mon Jun
8 13:32:54 2015'
+ (24) monitor: interval=20000ms rc=0 (ok)
+ (24) monitor: interval=20000ms rc=7 (not running)
+ (26) stop: rc=0 (ok)
* Node server2:
IP-rsc_apache: migration-threshold=2
+ (19) start: rc=0 (ok)
+ (20) monitor: interval=20000ms rc=0 (ok)
Failed actions:
IP-rsc_apache_monitor_20000 on server1 'not running' (7): call=24,
status=complete, last-rc-change='Mon Jun 8 13:32:54 2015', queued=0ms,
exec=0ms
It seems like pacemaker is assuming that the monitor-operation failed, and
because of this, decides to mark the node as a standby. But should not be,
no?
Somebody has some hint about that?
Thank you very much
Oscar Salvador
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.clusterlabs.org/pipermail/users/attachments/20150608/e3f96111/attachment-0002.html>
More information about the Users mailing list
|
{
"url": "https://lists.clusterlabs.org/pipermail/users/2015-June/007844.html",
"source_domain": "lists.clusterlabs.org",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "8388",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:DANREQALFJZERAQMTCIQDD5O7MIGF5FI",
"WARC-Concurrent-To": "<urn:uuid:8489870a-6af6-4a22-9297-0098f6a6a2fa>",
"WARC-Date": "2022-05-24T14:42:09Z",
"WARC-IP-Address": "95.217.104.78",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VIPTCP77F262D646PEVTSCV5YLQ5C7SE",
"WARC-Record-ID": "<urn:uuid:b7a7a23e-7f89-45f3-9b8e-1c047475ac51>",
"WARC-Target-URI": "https://lists.clusterlabs.org/pipermail/users/2015-June/007844.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:17c8684b-cce2-4daf-9f18-5afcee61606a>"
},
"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,
70,
71,
119,
147,
148,
149,
158,
159,
232,
306,
307,
342,
343,
371,
397,
398,
399,
420,
447,
472,
506,
568,
597,
647,
681,
711,
735,
759,
760,
761,
781,
789,
800,
812,
852,
877,
897,
915,
931,
943,
957,
982,
989,
991,
993,
994,
1004,
1020,
1060,
1070,
1084,
1100,
1115,
1125,
1127,
1129,
1130,
1139,
1169,
1181,
1197,
1199,
1200,
1211,
1226,
1254,
1264,
1279,
1307,
1317,
1319,
1320,
1321,
1364,
1435,
1508,
1582,
1632,
1633,
1704,
1711,
1712,
1788,
1820,
1869,
1870,
1908,
1909,
1985,
2059,
2130,
2148,
2221,
2222,
2296,
2351,
2425,
2495,
2535,
2611,
2686,
2690,
2757,
2822,
2895,
2944,
2997,
3071,
3095,
3168,
3208,
3273,
3316,
3317,
3318,
3394,
3463,
3532,
3607,
3617,
3618,
3636,
3637,
3650,
3651,
3670,
3686,
3761,
3779,
3795,
3796,
3812,
3883,
3955,
3964,
3965,
3966,
3979,
4018,
4056,
4113,
4132,
4155,
4156,
4157,
4202,
4222,
4223,
4287,
4288,
4300,
4316,
4391,
4409,
4456,
4512,
4539,
4555,
4595,
4623,
4670,
4671,
4687,
4758,
4830,
4839,
4840,
4841,
4842,
4917,
4992,
4996,
4997,
5032,
5033,
5053,
5068,
5108,
5143,
5246,
5247,
5248
],
"line_end_idx": [
70,
71,
119,
147,
148,
149,
158,
159,
232,
306,
307,
342,
343,
371,
397,
398,
399,
420,
447,
472,
506,
568,
597,
647,
681,
711,
735,
759,
760,
761,
781,
789,
800,
812,
852,
877,
897,
915,
931,
943,
957,
982,
989,
991,
993,
994,
1004,
1020,
1060,
1070,
1084,
1100,
1115,
1125,
1127,
1129,
1130,
1139,
1169,
1181,
1197,
1199,
1200,
1211,
1226,
1254,
1264,
1279,
1307,
1317,
1319,
1320,
1321,
1364,
1435,
1508,
1582,
1632,
1633,
1704,
1711,
1712,
1788,
1820,
1869,
1870,
1908,
1909,
1985,
2059,
2130,
2148,
2221,
2222,
2296,
2351,
2425,
2495,
2535,
2611,
2686,
2690,
2757,
2822,
2895,
2944,
2997,
3071,
3095,
3168,
3208,
3273,
3316,
3317,
3318,
3394,
3463,
3532,
3607,
3617,
3618,
3636,
3637,
3650,
3651,
3670,
3686,
3761,
3779,
3795,
3796,
3812,
3883,
3955,
3964,
3965,
3966,
3979,
4018,
4056,
4113,
4132,
4155,
4156,
4157,
4202,
4222,
4223,
4287,
4288,
4300,
4316,
4391,
4409,
4456,
4512,
4539,
4555,
4595,
4623,
4670,
4671,
4687,
4758,
4830,
4839,
4840,
4841,
4842,
4917,
4992,
4996,
4997,
5032,
5033,
5053,
5068,
5108,
5143,
5246,
5247,
5248,
5293
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5293,
"ccnet_original_nlines": 182,
"rps_doc_curly_bracket": 0.0030228600371629,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.18129613995552063,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022969650104641914,
"rps_doc_frac_lines_end_with_ellipsis": 0.005464479792863131,
"rps_doc_frac_no_alph_words": 0.44298604130744934,
"rps_doc_frac_unique_words": 0.4643399119377136,
"rps_doc_mean_word_length": 5.843702793121338,
"rps_doc_num_sentences": 41,
"rps_doc_symbol_to_word_ratio": 0.004922070074826479,
"rps_doc_unigram_entropy": 5.289748191833496,
"rps_doc_word_count": 659,
"rps_doc_frac_chars_dupe_10grams": 0.10386911779642105,
"rps_doc_frac_chars_dupe_5grams": 0.16852766275405884,
"rps_doc_frac_chars_dupe_6grams": 0.1633342057466507,
"rps_doc_frac_chars_dupe_7grams": 0.15580369532108307,
"rps_doc_frac_chars_dupe_8grams": 0.10386911779642105,
"rps_doc_frac_chars_dupe_9grams": 0.10386911779642105,
"rps_doc_frac_chars_top_2gram": 0.010386910289525986,
"rps_doc_frac_chars_top_3gram": 0.022851210087537766,
"rps_doc_frac_chars_top_4gram": 0.027265649288892746,
"rps_doc_books_importance": -454.1759033203125,
"rps_doc_books_importance_length_correction": -454.1759033203125,
"rps_doc_openwebtext_importance": -244.66822814941406,
"rps_doc_openwebtext_importance_length_correction": -244.66822814941406,
"rps_doc_wikipedia_importance": -255.45635986328125,
"rps_doc_wikipedia_importance_length_correction": -255.45635986328125
},
"fasttext": {
"dclm": 0.05621159076690674,
"english": 0.7108087539672852,
"fineweb_edu_approx": 1.5370432138442993,
"eai_general_math": 0.34150826930999756,
"eai_open_web_math": 0.5499170422554016,
"eai_web_code": 0.31826573610305786
}
}
|
{
"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.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": "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": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
7,365,564,441,491,268,000 |
Source: opticalraytracer Section: science Priority: optional Maintainer: Debian Science Maintainers Uploaders: D Haley DM-Upload-Allowed: yes Vcs-Git: git://git.debian.org/git/debian-science/packages/opticalraytracer.git Vcs-Browser: http://git.debian.org/?p=debian-science/packages/opticalraytracer.git Build-Depends: quilt, cdbs, debhelper (>= 7), ant (>=1.7.1), junit, javahelper, default-jdk Standards-Version: 3.9.3 Homepage: http://www.arachnoid.com/OpticalRayTracer/ Package: opticalraytracer Architecture: all Depends: ${misc:Depends}, ${java:Depends}, default-jre, java-wrappers Description: Virtual lens design workshop OpticalRayTracer is an application that analyzes systems of lenses. It uses optical principles and a virtual optical bench to predict the behavior of many kinds of ordinary and exotic lens types. OpticalRayTracer includes an advanced, easy-to-use interface that allows the user to rearrange the optical configuration by simply dragging lenses around using the mouse.
|
{
"url": "https://tracker.debian.org/media/packages/o/opticalraytracer/control-3.2-1.1",
"source_domain": "tracker.debian.org",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "1679",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:C4FVLX7C5BFIJKBXY6MV2IQ3YGLF5T4S",
"WARC-Concurrent-To": "<urn:uuid:1cf5faec-8b8d-4efd-ba11-ebec2282dfd5>",
"WARC-Date": "2021-03-01T11:05:43Z",
"WARC-IP-Address": "209.87.16.64",
"WARC-Identified-Payload-Type": "text/plain",
"WARC-Payload-Digest": "sha1:LHC46EMWYZ6PFMH3WG5DPXPNQLCQHTVM",
"WARC-Record-ID": "<urn:uuid:df347940-88ad-4aed-96c2-a882bda4daa8>",
"WARC-Target-URI": "https://tracker.debian.org/media/packages/o/opticalraytracer/control-3.2-1.1",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:697804b0-beb3-4f05-a94e-dc20a5cfbdf9>"
},
"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-150.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
],
"line_end_idx": [
996
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 996,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.0040160599164664745,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.13679245114326477,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009433959610760212,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.37264150381088257,
"rps_doc_frac_unique_words": 0.8217821717262268,
"rps_doc_mean_word_length": 7.980197906494141,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.330245494842529,
"rps_doc_word_count": 101,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -112.43179321289062,
"rps_doc_books_importance_length_correction": -112.43179321289062,
"rps_doc_openwebtext_importance": -64.96586608886719,
"rps_doc_openwebtext_importance_length_correction": -50.916351318359375,
"rps_doc_wikipedia_importance": -55.072750091552734,
"rps_doc_wikipedia_importance_length_correction": -55.072750091552734
},
"fasttext": {
"dclm": 0.07138509303331375,
"english": 0.629024863243103,
"fineweb_edu_approx": 3.1034181118011475,
"eai_general_math": 0.1232839822769165,
"eai_open_web_math": 0.09144312143325806,
"eai_web_code": 0.01205271016806364
}
}
|
{
"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": "535",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Physics",
"level_3": "Optics and Light"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"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": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "1",
"label": "No Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-5,920,156,249,390,239,000 |
Skip to content
This repository
HTTPS clone URL
Subversion checkout URL
You can clone with HTTPS or Subversion.
Download ZIP
a QTVR viewer based on Flash 10
branch: master
README.txt
CuTy
================================================================
CuTy is a tiny, dedicated viewer for (single node, JPEG encoded,
cubic) QTVR .mov files based for Flash Player 10 and newer. Its
functionality is deliberately kept minimal.
CuTy was originally written by Aldo Hoeben
([email protected]) as a means to easily display uploaded
QTVR files. It was first used publically at http://sziget360.com
and later at http://ivrpa.org and its subsites.
License
-------
This software is licensed under the Creative Commons Attribution
version 3.0 or later:
http://creativecommons.org/licenses/by/3.0/
In a nutshell, this means you are free to use the software and
its source code in your projects. If you use (parts of) the
source code in another software project, you are required to
add attribution to the author. I encourage you to share the
your source code in a similar fashion, but it is not a
requirement.
How to build
------------
To build the CuTy.swf file, you need the open source Flex SDK,
version 3.2 or newer, from Adobe:
http://opensource.adobe.com/wiki/display/flexsdk/Flex+SDK
To compile CuTy.swf, use the following commandline options:
mxmlc -target-player=10.0.0 -use-network=false CuTy.as
How to use
----------
A quick way to test CuTy.swf with your quicktime movie is to
rename the swf file to match the name of the mov file, eg:
if your Quicktime VR file is called "cubicvr.mov", make a copy
of CuTy.swf named "cubicvr.swf" in the same folder as the
Quicktime file. You can now open the cubicvr.swf in the
Flash 10 standalone viewer provided with the open source Flex
SDK, or you can drop the swf file in your browser.
When included in an HTML file you may use the same technique
or you can keep the name of the CuTy.swf as is and supply the
path to the Quicktime VR file setting the FlashVars to
"mov=cubicvr.swf".
The fullscreen functionality of the viewer is only available
if the parent HTML specifically allows fullscreen display.
For more information about how to use CuTy.swf, see:
http://fieldofview.com/projects/cuty
Something went wrong with that request. Please try again.
|
{
"url": "https://github.com/fieldOfView/CuTy",
"source_domain": "github.com",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "35508",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZCNUXUVR2CK746TWZSZTYOGPWFETABHW",
"WARC-Concurrent-To": "<urn:uuid:7ed3a5ca-3ab4-4255-99c3-0154d49950db>",
"WARC-Date": "2014-03-11T08:36:33Z",
"WARC-IP-Address": "192.30.252.131",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:UBIQEH42ZKPQLE27LTAYQ3OKNKJ6NYTI",
"WARC-Record-ID": "<urn:uuid:6bf429f1-9b68-4580-b10f-7473798fd77f>",
"WARC-Target-URI": "https://github.com/fieldOfView/CuTy",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:50f57b6f-979c-42c3-9089-0ad4f9ff443a>"
},
"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,
16,
32,
33,
49,
50,
74,
75,
115,
116,
129,
130,
162,
163,
178,
189,
194,
259,
260,
326,
391,
435,
436,
480,
542,
607,
655,
656,
657,
665,
673,
674,
739,
761,
805,
806,
870,
931,
993,
1054,
1110,
1123,
1124,
1125,
1138,
1151,
1152,
1216,
1250,
1308,
1309,
1369,
1424,
1425,
1426,
1437,
1448,
1449,
1511,
1570,
1633,
1692,
1749,
1811,
1862,
1863,
1924,
1987,
2043,
2062,
2063,
2124,
2184,
2185,
2238,
2275,
2277,
2278
],
"line_end_idx": [
16,
32,
33,
49,
50,
74,
75,
115,
116,
129,
130,
162,
163,
178,
189,
194,
259,
260,
326,
391,
435,
436,
480,
542,
607,
655,
656,
657,
665,
673,
674,
739,
761,
805,
806,
870,
931,
993,
1054,
1110,
1123,
1124,
1125,
1138,
1151,
1152,
1216,
1250,
1308,
1309,
1369,
1424,
1425,
1426,
1437,
1448,
1449,
1511,
1570,
1633,
1692,
1749,
1811,
1862,
1863,
1924,
1987,
2043,
2062,
2063,
2124,
2184,
2185,
2238,
2275,
2277,
2278,
2335
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2335,
"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.3286004066467285,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03853955119848251,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.22109532356262207,
"rps_doc_frac_unique_words": 0.5071225166320801,
"rps_doc_mean_word_length": 4.962963104248047,
"rps_doc_num_sentences": 39,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.766142845153809,
"rps_doc_word_count": 351,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.022962110117077827,
"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.01377726998180151,
"rps_doc_frac_chars_top_3gram": 0.02066590078175068,
"rps_doc_frac_chars_top_4gram": 0.019517799839377403,
"rps_doc_books_importance": -227.81240844726562,
"rps_doc_books_importance_length_correction": -227.81240844726562,
"rps_doc_openwebtext_importance": -132.2501220703125,
"rps_doc_openwebtext_importance_length_correction": -132.2501220703125,
"rps_doc_wikipedia_importance": -87.67412567138672,
"rps_doc_wikipedia_importance_length_correction": -87.67412567138672
},
"fasttext": {
"dclm": 0.05267912149429321,
"english": 0.8499009609222412,
"fineweb_edu_approx": 2.672804355621338,
"eai_general_math": 0.23145776987075806,
"eai_open_web_math": 0.33468252420425415,
"eai_web_code": 0.029085280373692513
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
4,268,202,654,028,480,000 |
hal-03853646 https://hal.inrae.fr/hal-03853646 https://hal.inrae.fr/hal-03853646/document https://hal.inrae.fr/hal-03853646/file/He-TPC-2022.pdf doi:10.1093/plcell/koac305 pubmed:36268892 [CNRS] CNRS - Centre national de la recherche scientifique [TDS-MACS] Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes [INRAE] Institut National de Recherche en Agriculture, Alimentation et Environnement [INRAEOCCITANIETOULOUSE] INRAE Occitanie Toulouse [LIPME] Laboratoire des Interactions Plantes Microbes Environnement [RESEAU-EAU] Réseau "Systèmes Agricoles et Eau" Establishing Physalis as a Solanaceae model system enables genetic reevaluation of the inflated calyx syndrome He, Jia Alonge, Michael Ramakrishnan, Srividya Benoit, Matthias Soyk, Sebastian Reem, Nathan, Hendelman, Anat van Eck, Joyce Schatz, Michael, Lippman, Zachary, [SDV.BIO] Life Sciences [q-bio]/Biotechnology [SDV.BV.BOT] Life Sciences [q-bio]/Vegetal Biology/Botanics [SDV.GEN.GPL] Life Sciences [q-bio]/Genetics/Plants genetics [INFO.INFO-MO] Computer Science [cs]/Modeling and Simulation ART Abstract The highly diverse Solanaceae family contains several widely studied models and crop species. Fully exploring, appreciating, and exploiting this diversity requires additional model systems. Particularly promising are orphan fruit crops in the genus Physalis, which occupy a key evolutionary position in the Solanaceae and capture understudied variation in traits such as inflorescence complexity, fruit ripening and metabolites, disease and insect resistance, self-compatibility, and most notable, the striking inflated calyx syndrome (ICS), an evolutionary novelty found across angiosperms where sepals grow exceptionally large to encapsulate fruits in a protective husk. We recently developed transformation and genome editing in Physalis grisea (groundcherry). However, to systematically explore and unlock the potential of this and related Physalis as genetic systems, high-quality genome assemblies are needed. Here, we present chromosome-scale references for P. grisea and its close relative Physalis pruinosa and use these resources to study natural and engineered variations in floral traits. We first rapidly identified a natural structural variant in a bHLH gene that causes petal color variation. Further, and against expectations, we found that CRISPR–Cas9-targeted mutagenesis of 11 MADS-box genes, including purported essential regulators of ICS, had no effect on inflation. In a forward genetics screen, we identified huskless, which lacks ICS due to mutation of an AP2-like gene that causes sepals and petals to merge into a single whorl of mixed identity. These resources and findings elevate Physalis to a new Solanaceae model system and establish a paradigm in the search for factors driving ICS. Genomics and genetics resources establish Physalis as a new Solanaceae reference system and enable reevaluation of the inflated calyx syndrome. 2022-10-21 2022-11-15 en http://creativecommons.org/licenses/by/ The Plant cell American Society of Plant Biologists (ASPB)
|
{
"url": "https://cnrs.hal.science/hal-03853646v1/dcterms",
"source_domain": "cnrs.hal.science",
"snapshot_id": "CC-MAIN-2023-14",
"warc_metadata": {
"Content-Length": "6026",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FT6AUUL3MLNABTMGHQURRPPKS4ABI5GF",
"WARC-Concurrent-To": "<urn:uuid:3e0b7463-f6d1-4db1-b1a5-c9858c3b9fc8>",
"WARC-Date": "2023-03-24T06:35:18Z",
"WARC-IP-Address": "193.48.96.10",
"WARC-Identified-Payload-Type": "application/xml",
"WARC-Payload-Digest": "sha1:THJDVZ3EXOW6XJ5RCQN654WQTKT6A6OK",
"WARC-Record-ID": "<urn:uuid:8b5bd09b-e142-491a-8814-b9ce583d7e29>",
"WARC-Target-URI": "https://cnrs.hal.science/hal-03853646v1/dcterms",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:74b8ee33-5fa2-409f-8427-8336e1632682>"
},
"warc_info": "isPartOf: CC-MAIN-2023-14\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-253\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
],
"line_end_idx": [
3107
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3107,
"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.1799660474061966,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.054329369217157364,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.25976231694221497,
"rps_doc_frac_unique_words": 0.6496163606643677,
"rps_doc_mean_word_length": 6.583120346069336,
"rps_doc_num_sentences": 28,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.249948978424072,
"rps_doc_word_count": 391,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.029526030644774437,
"rps_doc_frac_chars_dupe_6grams": 0.029526030644774437,
"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.011655010282993317,
"rps_doc_frac_chars_top_3gram": 0.024475520476698875,
"rps_doc_frac_chars_top_4gram": 0.01942501962184906,
"rps_doc_books_importance": -241.8590545654297,
"rps_doc_books_importance_length_correction": -241.8590545654297,
"rps_doc_openwebtext_importance": -148.32882690429688,
"rps_doc_openwebtext_importance_length_correction": -148.32882690429688,
"rps_doc_wikipedia_importance": -118.00363159179688,
"rps_doc_wikipedia_importance_length_correction": -118.00363159179688
},
"fasttext": {
"dclm": 0.07807903736829758,
"english": 0.7561452984809875,
"fineweb_edu_approx": 2.7473337650299072,
"eai_general_math": 0.1650632619857788,
"eai_open_web_math": 0.169874370098114,
"eai_web_code": 0.020758269354701042
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "581.6",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Botany",
"level_3": "Plant physiology and Plant anatomy"
}
},
"secondary": {
"code": "576.8",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Biology and Anthropology",
"level_3": "Microbiology"
}
}
},
"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": "2",
"label": "Academic/Research"
},
"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": "3",
"label": "Academic Writing"
},
"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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
527,731,517,133,886,500 |
# Makefile settings shared between Makefiles. CC = @CC@ CXX = @CXX@ CFLAGS = @CFLAGS@ CXXFLAGS = @CXXFLAGS@ CCPIC = @CCPIC@ CPPFLAGS = @CPPFLAGS@ DEFS = @DEFS@ LDFLAGS = @LDFLAGS@ LIBS = @LIBS@ LIBOBJS = @LIBOBJS@ EMULATOR = @EMULATOR@ NM = @NM@ OBJEXT = @OBJEXT@ EXEEXT = @EXEEXT@ CC_FOR_BUILD = @CC_FOR_BUILD@ EXEEXT_FOR_BUILD = @EXEEXT_FOR_BUILD@ DEP_FLAGS = @DEP_FLAGS@ DEP_PROCESS = @DEP_PROCESS@ PACKAGE_BUGREPORT = @PACKAGE_BUGREPORT@ PACKAGE_NAME = @PACKAGE_NAME@ PACKAGE_STRING = @PACKAGE_STRING@ PACKAGE_TARNAME = @PACKAGE_TARNAME@ PACKAGE_VERSION = @PACKAGE_VERSION@ LIBNETTLE_MAJOR = @LIBNETTLE_MAJOR@ LIBNETTLE_MINOR = @LIBNETTLE_MINOR@ LIBNETTLE_SONAME = @LIBNETTLE_SONAME@ LIBNETTLE_FILE = @LIBNETTLE_FILE@ LIBNETTLE_FILE_SRC = @LIBNETTLE_FILE_SRC@ LIBNETTLE_FORLINK = @LIBNETTLE_FORLINK@ LIBNETTLE_LIBS = @LIBNETTLE_LIBS@ LIBNETTLE_LINK = @LIBNETTLE_LINK@ LIBHOGWEED_MAJOR = @LIBHOGWEED_MAJOR@ LIBHOGWEED_MINOR = @LIBHOGWEED_MINOR@ LIBHOGWEED_SONAME = @LIBHOGWEED_SONAME@ LIBHOGWEED_FILE = @LIBHOGWEED_FILE@ LIBHOGWEED_FILE_SRC = @LIBHOGWEED_FILE_SRC@ LIBHOGWEED_FORLINK = @LIBHOGWEED_FORLINK@ LIBHOGWEED_LIBS = @LIBHOGWEED_LIBS@ LIBHOGWEED_LINK = @LIBHOGWEED_LINK@ GMP_NUMB_BITS = @GMP_NUMB_BITS@ AR = @AR@ ARFLAGS = cru AUTOCONF = autoconf AUTOHEADER = autoheader M4 = @M4@ MAKEINFO = makeinfo RANLIB = @RANLIB@ LN_S = @LN_S@ prefix = @prefix@ exec_prefix = @exec_prefix@ datarootdir = @datarootdir@ bindir = @bindir@ libdir = @libdir@ includedir = @includedir@ infodir = @infodir@ # PRE_CPPFLAGS and PRE_LDFLAGS lets each Makefile.in prepend its own # flags before CPPFLAGS and LDFLAGS. While EXTRA_CFLAGS are added at the end. COMPILE = $(CC) $(PRE_CPPFLAGS) $(CPPFLAGS) $(DEFS) $(CFLAGS) $(EXTRA_CFLAGS) $(DEP_FLAGS) COMPILE_CXX = $(CXX) $(PRE_CPPFLAGS) $(CPPFLAGS) $(DEFS) $(CXXFLAGS) $(DEP_FLAGS) LINK = $(CC) $(CFLAGS) $(PRE_LDFLAGS) $(LDFLAGS) LINK_CXX = $(CXX) $(CXXFLAGS) $(PRE_LDFLAGS) $(LDFLAGS) # Default rule. Must be here, since config.make is included before the # usual targets. default: all # For some reason the suffixes list must be set before the rules. # Otherwise BSD make won't build binaries e.g. aesdata. On the other # hand, AIX make has the opposite idiosyncrasies to BSD, and the AIX # compile was broken when .SUFFIXES was moved here from Makefile.in. .SUFFIXES: .SUFFIXES: .asm .c .$(OBJEXT) .p$(OBJEXT) .html .dvi .info .exe .pdf .ps .texinfo # Disable builtin rule %$(EXEEXT) : %.c .c: # Keep object files .PRECIOUS: %.o .PHONY: all check install uninstall clean distclean mostlyclean maintainer-clean distdir \ all-here check-here install-here clean-here distclean-here mostlyclean-here \ maintainer-clean-here distdir-here \ install-shared install-info install-headers \ uninstall-shared uninstall-info uninstall-headers \ dist distcleancheck
|
{
"url": "https://git.lysator.liu.se/nettle/nettle/-/raw/91c0fc5083b024f12673b8d86a44c69db518505c/config.make.in",
"source_domain": "git.lysator.liu.se",
"snapshot_id": "crawl=CC-MAIN-2020-45",
"warc_metadata": {
"Content-Length": "3623",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:M332OYR7VSTKEOAJZWEZ2BIEUCITWUKB",
"WARC-Concurrent-To": "<urn:uuid:7a34b55f-e35d-451f-994a-730f7bfa2d02>",
"WARC-Date": "2020-10-25T23:11:20Z",
"WARC-IP-Address": "130.236.254.118",
"WARC-Identified-Payload-Type": "text/plain",
"WARC-Payload-Digest": "sha1:SAAJK7UNNFWCPYARXL3G5UXF7ZYGXUVQ",
"WARC-Record-ID": "<urn:uuid:e64c0a27-1830-4425-8208-28fc71451006>",
"WARC-Target-URI": "https://git.lysator.liu.se/nettle/nettle/-/raw/91c0fc5083b024f12673b8d86a44c69db518505c/config.make.in",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:dc3a16e3-e903-4b9c-9070-52f0e383c040>"
},
"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-239.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
],
"line_end_idx": [
2794
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2794,
"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.0954861119389534,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.2326388955116272,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4913194477558136,
"rps_doc_frac_unique_words": 0.6088560819625854,
"rps_doc_mean_word_length": 7.597785949707031,
"rps_doc_num_sentences": 32,
"rps_doc_symbol_to_word_ratio": 0.0190972201526165,
"rps_doc_unigram_entropy": 4.9725189208984375,
"rps_doc_word_count": 271,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.01748421974480152,
"rps_doc_frac_chars_top_3gram": 0.022340940311551094,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -226.1898956298828,
"rps_doc_books_importance_length_correction": -226.1898956298828,
"rps_doc_openwebtext_importance": -89.75723266601562,
"rps_doc_openwebtext_importance_length_correction": -89.75723266601562,
"rps_doc_wikipedia_importance": 10.259215354919434,
"rps_doc_wikipedia_importance_length_correction": 10.259215354919434
},
"fasttext": {
"dclm": 0.9996541738510132,
"english": 0.5135347843170166,
"fineweb_edu_approx": 3.803849935531616,
"eai_general_math": 0.99541175365448,
"eai_open_web_math": 0.6058784127235413,
"eai_web_code": 0.9551623463630676
}
}
|
{
"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": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "1",
"label": "No Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-7,319,681,641,279,972,000 |
Link to home
Start Free TrialLog in
Avatar of rapidpet
rapidpet
asked on
Google Sheets and Datatables
I am looking to determine why I cannot successfully use Datatables (Datatables.net) with a Google Sheets spreadsheet. The google sheets link is: https://docs.google.com/spreadsheets/d/1pk19yXW1CHgZFAWcif7S-5FS3LOgQ8bX4j-oWRdeND0/edit?usp=sharing
I have been told it is relatively simple to do, but I lack the basic understanding of Datatables and java. I hope that someone can help with this as its for a good cause.
Avatar of Rainer Jeschor
Rainer Jeschor
Flag of Germany image
Hi,
can you please explain, what your exact aim here is? Where do you want to use datatables?
Thanks for clarification.
Rainer
Avatar of rapidpet
rapidpet
ASKER
The goal with using Datatables with Google Sheets, is to be able to sort the data with the many functions that DataTables has. This is the basic view of a datatables table, https://datatables.net/examples/basic_init/zero_configuration.html
I am just looking to have the data in the above referenced Google Sheet in a Datatables table.
Any luck?
Hi,
your Google sheet needs to be published so that the JSON URL from Google can be used.
I created my own small sample sheet and the following code works:
$(document).ready(function() {
var results = [];
var url = "https://spreadsheets.google.com/feeds/list/1WMbRG1H3MP79IVCgUSR6asrmca59KiwGykGGOVgjLfA/od6/public/values?alt=json";
var jqxhr = $.getJSON(url, function() {
console.log( "success" );
})
.done(function(data) {
console.log( "second success" );
var entry = data.feed.entry;
$(entry).each(function(){
// Column names are name, age, etc.
//results.push({"Id" : this.gsx$id.$t , "Name" : this.gsx$name.$t, "Country" : this.gsx$country.$t, "Solutions" : this.gsx$solutions.$t});
results.push([this.gsx$id.$t , this.gsx$name.$t, this.gsx$country.$t, this.gsx$solutions.$t]);
});
var table = $('#example').DataTable( {
data: results,
columns: [
{ title: "Id" },
{ title: "Name" },
{ title: "Country" },
{ title: "Solutions" }
]
});
})
.fail(function() {
console.log( "error" );
})
.always(function() {
console.log( "complete" );
});
});
Open in new window
Full working sample:
http://jsfiddle.net/EE_RainerJ/2e5f1at8/
With the sample it should be easy for you to adopt to your own sheet.
HTH
Rainer
Thank you, I have tried something similar to this, but it hasn't worked. Can you try to get it to work using my link that I gave you at the top?
This is what I have now. The bulk of which can be removed, as this is just an example page from Datatables. Again, thank you for your time.
<!DOCTYPE html>
<html>
<head>
<meta charset="utf-8">
<link rel="shortcut icon" type="image/ico" href="http://www.datatables.net/favicon.ico">
<meta name="viewport" content="initial-scale=1.0, maximum-scale=2.0">
<title>DataTables example - Zero configuration</title>
<link rel="stylesheet" type="text/css" href="../../media/css/jquery.dataTables.css">
<link rel="stylesheet" type="text/css" href="../resources/syntax/shCore.css">
<link rel="stylesheet" type="text/css" href="../resources/demo.css">
<style type="text/css" class="init">
</style>
<script type="text/javascript" charset="utf-8">
$(document).ready(function() {
$('#example').dataTable( {
"bServerSide":false,
"bProcessing":true,
"sAjaxDataProp": "feed.entry",
"sAjaxSource": "<a href="https://docs.google.com/spreadsheets/d/1pk19yXW1CHgZFAWcif7S-5FS3LOgQ8bX4j-oWRdeND0/edit?usp=sharing"" target="_blank" rel="nofollow">https://docs.google.com/spreadsheets/d/1pk19yXW1CHgZFAWcif7S-5FS3LOgQ8bX4j-oWRdeND0/edit?usp=sharing/od6/public/values?alt=json"</a>,
"aoColumns": [
{ "mDataProp": "gsx$carmake.$t" },
{ "mDataProp": "gsx$model.$t" },
{ "mDataProp": "gsx$year.$t" },
]
} );
} );
</script>
</head>
<body class="dt-example">
<div class="container">
<section>
<h1>DataTables example <span>Zero configuration</span></h1>
<div class="info">
<p>DataTables has most features enabled by default, so all you need to do to use it with your own tables is to call the construction function:
<code>$().DataTable();</code>.</p>
<p>Searching, ordering and paging goodness will be immediately added to the table, as shown in this example.</p>
</div>
<table id="example" class="display" cellspacing="0" width="100%">
<thead>
<tr>
<th>Name</th>
<th>Position</th>
<th>Office</th>
<th>Age</th>
<th>Start date</th>
<th>Salary</th>
</tr>
</thead>
<tfoot>
<tr>
<th>Name</th>
<th>Position</th>
<th>Office</th>
<th>Age</th>
<th>Start date</th>
<th>Salary</th>
</tr>
</tfoot>
<tbody>
<tr>
<td>Tiger Nixon</td>
<td>System Architect</td>
<td>Edinburgh</td>
<td>61</td>
<td>2011/04/25</td>
<td>$320,800</td>
</tr>
<tr>
<td>Garrett Winters</td>
<td>Accountant</td>
<td>Tokyo</td>
<td>63</td>
<td>2011/07/25</td>
<td>$170,750</td>
</tr>
<tr>
<td>Ashton Cox</td>
<td>Junior Technical Author</td>
<td>San Francisco</td>
<td>66</td>
<td>2009/01/12</td>
<td>$86,000</td>
</tr>
<tr>
<td>Cedric Kelly</td>
<td>Senior Javascript Developer</td>
<td>Edinburgh</td>
<td>22</td>
<td>2012/03/29</td>
<td>$433,060</td>
</tr>
<tr>
<td>Airi Satou</td>
<td>Accountant</td>
<td>Tokyo</td>
<td>33</td>
<td>2008/11/28</td>
<td>$162,700</td>
</tr>
<tr>
<td>Brielle Williamson</td>
<td>Integration Specialist</td>
<td>New York</td>
<td>61</td>
<td>2012/12/02</td>
<td>$372,000</td>
</tr>
<tr>
<td>Herrod Chandler</td>
<td>Sales Assistant</td>
<td>San Francisco</td>
<td>59</td>
<td>2012/08/06</td>
<td>$137,500</td>
</tr>
<tr>
<td>Rhona Davidson</td>
<td>Integration Specialist</td>
<td>Tokyo</td>
<td>55</td>
<td>2010/10/14</td>
<td>$327,900</td>
</tr>
<tr>
<td>Colleen Hurst</td>
<td>Javascript Developer</td>
<td>San Francisco</td>
<td>39</td>
<td>2009/09/15</td>
<td>$205,500</td>
</tr>
<tr>
<td>Sonya Frost</td>
<td>Software Engineer</td>
<td>Edinburgh</td>
<td>23</td>
<td>2008/12/13</td>
<td>$103,600</td>
</tr>
<tr>
<td>Jena Gaines</td>
<td>Office Manager</td>
<td>London</td>
<td>30</td>
<td>2008/12/19</td>
<td>$90,560</td>
</tr>
<tr>
<td>Quinn Flynn</td>
<td>Support Lead</td>
<td>Edinburgh</td>
<td>22</td>
<td>2013/03/03</td>
<td>$342,000</td>
</tr>
<tr>
<td>Charde Marshall</td>
<td>Regional Director</td>
<td>San Francisco</td>
<td>36</td>
<td>2008/10/16</td>
<td>$470,600</td>
</tr>
<tr>
<td>Haley Kennedy</td>
<td>Senior Marketing Designer</td>
<td>London</td>
<td>43</td>
<td>2012/12/18</td>
<td>$313,500</td>
</tr>
<tr>
<td>Tatyana Fitzpatrick</td>
<td>Regional Director</td>
<td>London</td>
<td>19</td>
<td>2010/03/17</td>
<td>$385,750</td>
</tr>
<tr>
<td>Michael Silva</td>
<td>Marketing Designer</td>
<td>London</td>
<td>66</td>
<td>2012/11/27</td>
<td>$198,500</td>
</tr>
<tr>
<td>Paul Byrd</td>
<td>Chief Financial Officer (CFO)</td>
<td>New York</td>
<td>64</td>
<td>2010/06/09</td>
<td>$725,000</td>
</tr>
<tr>
<td>Gloria Little</td>
<td>Systems Administrator</td>
<td>New York</td>
<td>59</td>
<td>2009/04/10</td>
<td>$237,500</td>
</tr>
<tr>
<td>Bradley Greer</td>
<td>Software Engineer</td>
<td>London</td>
<td>41</td>
<td>2012/10/13</td>
<td>$132,000</td>
</tr>
<tr>
<td>Dai Rios</td>
<td>Personnel Lead</td>
<td>Edinburgh</td>
<td>35</td>
<td>2012/09/26</td>
<td>$217,500</td>
</tr>
<tr>
<td>Jenette Caldwell</td>
<td>Development Lead</td>
<td>New York</td>
<td>30</td>
<td>2011/09/03</td>
<td>$345,000</td>
</tr>
<tr>
<td>Yuri Berry</td>
<td>Chief Marketing Officer (CMO)</td>
<td>New York</td>
<td>40</td>
<td>2009/06/25</td>
<td>$675,000</td>
</tr>
<tr>
<td>Caesar Vance</td>
<td>Pre-Sales Support</td>
<td>New York</td>
<td>21</td>
<td>2011/12/12</td>
<td>$106,450</td>
</tr>
<tr>
<td>Doris Wilder</td>
<td>Sales Assistant</td>
<td>Sidney</td>
<td>23</td>
<td>2010/09/20</td>
<td>$85,600</td>
</tr>
<tr>
<td>Angelica Ramos</td>
<td>Chief Executive Officer (CEO)</td>
<td>London</td>
<td>47</td>
<td>2009/10/09</td>
<td>$1,200,000</td>
</tr>
<tr>
<td>Gavin Joyce</td>
<td>Developer</td>
<td>Edinburgh</td>
<td>42</td>
<td>2010/12/22</td>
<td>$92,575</td>
</tr>
<tr>
<td>Jennifer Chang</td>
<td>Regional Director</td>
<td>Singapore</td>
<td>28</td>
<td>2010/11/14</td>
<td>$357,650</td>
</tr>
<tr>
<td>Brenden Wagner</td>
<td>Software Engineer</td>
<td>San Francisco</td>
<td>28</td>
<td>2011/06/07</td>
<td>$206,850</td>
</tr>
<tr>
<td>Fiona Green</td>
<td>Chief Operating Officer (COO)</td>
<td>San Francisco</td>
<td>48</td>
<td>2010/03/11</td>
<td>$850,000</td>
</tr>
<tr>
<td>Shou Itou</td>
<td>Regional Marketing</td>
<td>Tokyo</td>
<td>20</td>
<td>2011/08/14</td>
<td>$163,000</td>
</tr>
<tr>
<td>Michelle House</td>
<td>Integration Specialist</td>
<td>Sidney</td>
<td>37</td>
<td>2011/06/02</td>
<td>$95,400</td>
</tr>
<tr>
<td>Suki Burks</td>
<td>Developer</td>
<td>London</td>
<td>53</td>
<td>2009/10/22</td>
<td>$114,500</td>
</tr>
<tr>
<td>Prescott Bartlett</td>
<td>Technical Author</td>
<td>London</td>
<td>27</td>
<td>2011/05/07</td>
<td>$145,000</td>
</tr>
<tr>
<td>Gavin Cortez</td>
<td>Team Leader</td>
<td>San Francisco</td>
<td>22</td>
<td>2008/10/26</td>
<td>$235,500</td>
</tr>
<tr>
<td>Martena Mccray</td>
<td>Post-Sales support</td>
<td>Edinburgh</td>
<td>46</td>
<td>2011/03/09</td>
<td>$324,050</td>
</tr>
<tr>
<td>Unity Butler</td>
<td>Marketing Designer</td>
<td>San Francisco</td>
<td>47</td>
<td>2009/12/09</td>
<td>$85,675</td>
</tr>
<tr>
<td>Howard Hatfield</td>
<td>Office Manager</td>
<td>San Francisco</td>
<td>51</td>
<td>2008/12/16</td>
<td>$164,500</td>
</tr>
<tr>
<td>Hope Fuentes</td>
<td>Secretary</td>
<td>San Francisco</td>
<td>41</td>
<td>2010/02/12</td>
<td>$109,850</td>
</tr>
<tr>
<td>Vivian Harrell</td>
<td>Financial Controller</td>
<td>San Francisco</td>
<td>62</td>
<td>2009/02/14</td>
<td>$452,500</td>
</tr>
<tr>
<td>Timothy Mooney</td>
<td>Office Manager</td>
<td>London</td>
<td>37</td>
<td>2008/12/11</td>
<td>$136,200</td>
</tr>
<tr>
<td>Jackson Bradshaw</td>
<td>Director</td>
<td>New York</td>
<td>65</td>
<td>2008/09/26</td>
<td>$645,750</td>
</tr>
<tr>
<td>Olivia Liang</td>
<td>Support Engineer</td>
<td>Singapore</td>
<td>64</td>
<td>2011/02/03</td>
<td>$234,500</td>
</tr>
<tr>
<td>Bruno Nash</td>
<td>Software Engineer</td>
<td>London</td>
<td>38</td>
<td>2011/05/03</td>
<td>$163,500</td>
</tr>
<tr>
<td>Sakura Yamamoto</td>
<td>Support Engineer</td>
<td>Tokyo</td>
<td>37</td>
<td>2009/08/19</td>
<td>$139,575</td>
</tr>
<tr>
<td>Thor Walton</td>
<td>Developer</td>
<td>New York</td>
<td>61</td>
<td>2013/08/11</td>
<td>$98,540</td>
</tr>
<tr>
<td>Finn Camacho</td>
<td>Support Engineer</td>
<td>San Francisco</td>
<td>47</td>
<td>2009/07/07</td>
<td>$87,500</td>
</tr>
<tr>
<td>Serge Baldwin</td>
<td>Data Coordinator</td>
<td>Singapore</td>
<td>64</td>
<td>2012/04/09</td>
<td>$138,575</td>
</tr>
<tr>
<td>Zenaida Frank</td>
<td>Software Engineer</td>
<td>New York</td>
<td>63</td>
<td>2010/01/04</td>
<td>$125,250</td>
</tr>
<tr>
<td>Zorita Serrano</td>
<td>Software Engineer</td>
<td>San Francisco</td>
<td>56</td>
<td>2012/06/01</td>
<td>$115,000</td>
</tr>
<tr>
<td>Jennifer Acosta</td>
<td>Junior Javascript Developer</td>
<td>Edinburgh</td>
<td>43</td>
<td>2013/02/01</td>
<td>$75,650</td>
</tr>
<tr>
<td>Cara Stevens</td>
<td>Sales Assistant</td>
<td>New York</td>
<td>46</td>
<td>2011/12/06</td>
<td>$145,600</td>
</tr>
<tr>
<td>Hermione Butler</td>
<td>Regional Director</td>
<td>London</td>
<td>47</td>
<td>2011/03/21</td>
<td>$356,250</td>
</tr>
<tr>
<td>Lael Greer</td>
<td>Systems Administrator</td>
<td>London</td>
<td>21</td>
<td>2009/02/27</td>
<td>$103,500</td>
</tr>
<tr>
<td>Jonas Alexander</td>
<td>Developer</td>
<td>San Francisco</td>
<td>30</td>
<td>2010/07/14</td>
<td>$86,500</td>
</tr>
<tr>
<td>Shad Decker</td>
<td>Regional Director</td>
<td>Edinburgh</td>
<td>51</td>
<td>2008/11/13</td>
<td>$183,000</td>
</tr>
<tr>
<td>Michael Bruce</td>
<td>Javascript Developer</td>
<td>Singapore</td>
<td>29</td>
<td>2011/06/27</td>
<td>$183,000</td>
</tr>
<tr>
<td>Donna Snider</td>
<td>Customer Support</td>
<td>New York</td>
<td>27</td>
<td>2011/01/25</td>
<td>$112,000</td>
</tr>
</tbody>
</table>
<ul class="tabs">
<li class="active">Javascript</li>
<li>HTML</li>
<li>CSS</li>
<li>Ajax</li>
<li>Server-side script</li>
</ul>
<div class="tabs">
<div class="js">
<p>The Javascript shown below is used to initialise the table shown in this example:</p><code class="multiline language-js">$(document).ready(function() {
$('#example').DataTable();
} );</code>
<p>In addition to the above code, the following Javascript library files are loaded for use in this example:</p>
<ul>
<li><a href="//code.jquery.com/jquery-1.11.3.min.js">//code.jquery.com/jquery-1.11.3.min.js</a></li>
<li><a href="../../media/js/jquery.dataTables.js">../../media/js/jquery.dataTables.js</a></li>
</ul>
</div>
<div class="table">
<p>The HTML shown below is the raw HTML table element, before it has been enhanced by DataTables:</p>
</div>
<div class="css">
<div>
<p>This example uses a little bit of additional CSS beyond what is loaded from the library files (below), in order to correctly display the table. The
additional CSS used is shown below:</p><code class="multiline language-css"></code>
</div>
<p>The following CSS library files are loaded for use in this example to provide the styling of the table:</p>
<ul>
<li><a href="../../media/css/jquery.dataTables.css">../../media/css/jquery.dataTables.css</a></li>
</ul>
</div>
<div class="ajax">
<p>This table loads data by Ajax. The latest data that has been loaded is shown below. This data will update automatically as any additional data is
loaded.</p>
</div>
<div class="php">
<p>The script used to perform the server-side processing for this table is shown below. Please note that this is just an example script using PHP. Server-side
processing scripts can be written in any language, using <a href="//datatables.net/manual/server-side">the protocol described in the DataTables
documentation</a>.</p>
</div>
</div>
</section>
</div>
<section>
<div class="footer">
<div class="gradient"></div>
<div class="liner">
<h2>Other examples</h2>
<div class="toc">
<div class="toc-group">
<h3><a href="./index.html">Basic initialisation</a></h3>
<ul class="toc active">
<li class="active"><a href="./zero_configuration.html">Zero configuration</a></li>
<li><a href="./filter_only.html">Feature enable / disable</a></li>
<li><a href="./table_sorting.html">Default ordering (sorting)</a></li>
<li><a href="./multi_col_sort.html">Multi-column ordering</a></li>
<li><a href="./multiple_tables.html">Multiple tables</a></li>
<li><a href="./hidden_columns.html">Hidden columns</a></li>
<li><a href="./complex_header.html">Complex headers (rowspan and colspan)</a></li>
<li><a href="./dom.html">DOM positioning</a></li>
<li><a href="./flexible_width.html">Flexible table width</a></li>
<li><a href="./state_save.html">State saving</a></li>
<li><a href="./alt_pagination.html">Alternative pagination</a></li>
<li><a href="./scroll_y.html">Scroll - vertical</a></li>
<li><a href="./scroll_y_dynamic.html">Scroll - vertical, dynamic height</a></li>
<li><a href="./scroll_x.html">Scroll - horizontal</a></li>
<li><a href="./scroll_xy.html">Scroll - horizontal and vertical</a></li>
<li><a href="./comma-decimal.html">Language - Comma decimal place</a></li>
<li><a href="./language.html">Language options</a></li>
</ul>
</div>
<div class="toc-group">
<h3><a href="../advanced_init/index.html">Advanced initialisation</a></h3>
<ul class="toc">
<li><a href="../advanced_init/events_live.html">DOM / jQuery events</a></li>
<li><a href="../advanced_init/dt_events.html">DataTables events</a></li>
<li><a href="../advanced_init/column_render.html">Column rendering</a></li>
<li><a href="../advanced_init/length_menu.html">Page length options</a></li>
<li><a href="../advanced_init/dom_multiple_elements.html">Multiple table control elements</a></li>
<li><a href="../advanced_init/complex_header.html">Complex headers with column visibility</a></li>
<li><a href="../advanced_init/object_dom_read.html">Read HTML to data objects</a></li>
<li><a href="../advanced_init/html5-data-attributes.html">HTML5 data-* attributes - cell data</a></li>
<li><a href="../advanced_init/html5-data-options.html">HTML5 data-* attributes - table options</a></li>
<li><a href="../advanced_init/language_file.html">Language file</a></li>
<li><a href="../advanced_init/defaults.html">Setting defaults</a></li>
<li><a href="../advanced_init/row_callback.html">Row created callback</a></li>
<li><a href="../advanced_init/row_grouping.html">Row grouping</a></li>
<li><a href="../advanced_init/footer_callback.html">Footer callback</a></li>
<li><a href="../advanced_init/dom_toolbar.html">Custom toolbar elements</a></li>
<li><a href="../advanced_init/sort_direction_control.html">Order direction sequence control</a></li>
</ul>
</div>
<div class="toc-group">
<h3><a href="../styling/index.html">Styling</a></h3>
<ul class="toc">
<li><a href="../styling/display.html">Base style</a></li>
<li><a href="../styling/no-classes.html">Base style - no styling classes</a></li>
<li><a href="../styling/cell-border.html">Base style - cell borders</a></li>
<li><a href="../styling/compact.html">Base style - compact</a></li>
<li><a href="../styling/hover.html">Base style - hover</a></li>
<li><a href="../styling/order-column.html">Base style - order-column</a></li>
<li><a href="../styling/row-border.html">Base style - row borders</a></li>
<li><a href="../styling/stripe.html">Base style - stripe</a></li>
<li><a href="../styling/bootstrap.html">Bootstrap</a></li>
<li><a href="../styling/foundation.html">Foundation</a></li>
<li><a href="../styling/jqueryUI.html">jQuery UI ThemeRoller</a></li>
</ul>
</div>
<div class="toc-group">
<h3><a href="../data_sources/index.html">Data sources</a></h3>
<ul class="toc">
<li><a href="../data_sources/dom.html">HTML (DOM) sourced data</a></li>
<li><a href="../data_sources/ajax.html">Ajax sourced data</a></li>
<li><a href="../data_sources/js_array.html">Javascript sourced data</a></li>
<li><a href="../data_sources/server_side.html">Server-side processing</a></li>
</ul>
</div>
<div class="toc-group">
<h3><a href="../api/index.html">API</a></h3>
<ul class="toc">
<li><a href="../api/add_row.html">Add rows</a></li>
<li><a href="../api/multi_filter.html">Individual column searching (text inputs)</a></li>
<li><a href="../api/multi_filter_select.html">Individual column searching (select inputs)</a></li>
<li><a href="../api/highlight.html">Highlighting rows and columns</a></li>
<li><a href="../api/row_details.html">Child rows (show extra / detailed information)</a></li>
<li><a href="../api/select_row.html">Row selection (multiple rows)</a></li>
<li><a href="../api/select_single_row.html">Row selection and deletion (single row)</a></li>
<li><a href="../api/form.html">Form inputs</a></li>
<li><a href="../api/counter_columns.html">Index column</a></li>
<li><a href="../api/show_hide.html">Show / hide columns dynamically</a></li>
<li><a href="../api/api_in_init.html">Using API in callbacks</a></li>
<li><a href="../api/tabs_and_scrolling.html">Scrolling and Bootstrap tabs</a></li>
<li><a href="../api/regex.html">Search API (regular expressions)</a></li>
</ul>
</div>
<div class="toc-group">
<h3><a href="../ajax/index.html">Ajax</a></h3>
<ul class="toc">
<li><a href="../ajax/simple.html">Ajax data source (arrays)</a></li>
<li><a href="../ajax/objects.html">Ajax data source (objects)</a></li>
<li><a href="../ajax/deep.html">Nested object data (objects)</a></li>
<li><a href="../ajax/objects_subarrays.html">Nested object data (arrays)</a></li>
<li><a href="../ajax/orthogonal-data.html">Orthogonal data</a></li>
<li><a href="../ajax/null_data_source.html">Generated content for a column</a></li>
<li><a href="../ajax/custom_data_property.html">Custom data source property</a></li>
<li><a href="../ajax/custom_data_flat.html">Flat array data source</a></li>
<li><a href="../ajax/defer_render.html">Deferred rendering for speed</a></li>
</ul>
</div>
<div class="toc-group">
<h3><a href="../server_side/index.html">Server-side</a></h3>
<ul class="toc">
<li><a href="../server_side/simple.html">Server-side processing</a></li>
<li><a href="../server_side/custom_vars.html">Custom HTTP variables</a></li>
<li><a href="../server_side/post.html">POST data</a></li>
<li><a href="../server_side/ids.html">Automatic addition of row ID attributes</a></li>
<li><a href="../server_side/object_data.html">Object data source</a></li>
<li><a href="../server_side/row_details.html">Row details</a></li>
<li><a href="../server_side/select_rows.html">Row selection</a></li>
<li><a href="../server_side/jsonp.html">JSONP data source for remote domains</a></li>
<li><a href="../server_side/defer_loading.html">Deferred loading of data</a></li>
<li><a href="../server_side/pipeline.html">Pipelining data to reduce Ajax calls for paging</a></li>
</ul>
</div>
<div class="toc-group">
<h3><a href="../plug-ins/index.html">Plug-ins</a></h3>
<ul class="toc">
<li><a href="../plug-ins/api.html">API plug-in methods</a></li>
<li><a href="../plug-ins/sorting_auto.html">Ordering plug-ins (with type detection)</a></li>
<li><a href="../plug-ins/sorting_manual.html">Ordering plug-ins (no type detection)</a></li>
<li><a href="../plug-ins/range_filtering.html">Custom filtering - range search</a></li>
<li><a href="../plug-ins/dom_sort.html">Live DOM ordering</a></li>
</ul>
</div>
</div>
<div class="epilogue">
<p>Please refer to the <a href="http://www.datatables.net">DataTables documentation</a> for full information about its API properties and methods.<br>
Additionally, there are a wide range of <a href="http://www.datatables.net/extensions">extensions</a> and <a href=
"http://www.datatables.net/plug-ins">plug-ins</a> which extend the capabilities of DataTables.</p>
<p class="copyright">DataTables designed and created by <a href="http://www.sprymedia.co.uk">SpryMedia Ltd</a> © 2007-2015<br>
DataTables is licensed under the <a href="http://www.datatables.net/mit">MIT license</a>.</p>
</div>
</div>
</div>
</section>
</body>
</html>
Open in new window
ASKER CERTIFIED SOLUTION
Avatar of Rainer Jeschor
Rainer Jeschor
Flag of Germany image
Link to home
membership
This solution is only available to members.
To access this solution, you must be a member of Experts Exchange.
Start Free Trial
Expert got this done in less than a day. Very impressed.
Rainer-
It just stopped working again... can you assist?
|
{
"url": "https://www.experts-exchange.com/questions/28789880/Google-Sheets-and-Datatables.html",
"source_domain": "www.experts-exchange.com",
"snapshot_id": "CC-MAIN-2024-10",
"warc_metadata": {
"Content-Length": "275684",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PHEWESCNAZJOTT4FKPJ57AFGGRWLL6LY",
"WARC-Concurrent-To": "<urn:uuid:1e008f7e-c970-4348-8685-c2f31514732a>",
"WARC-Date": "2024-02-24T23:13:31Z",
"WARC-IP-Address": "172.67.36.241",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:OIHFD653TP3R7EHBN426TYOQ7VWWW6IL",
"WARC-Record-ID": "<urn:uuid:c2636e96-e97c-479a-9506-bab8be637738>",
"WARC-Target-URI": "https://www.experts-exchange.com/questions/28789880/Google-Sheets-and-Datatables.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c997013f-747b-41de-a1f8-bfa1e4d7c2f4>"
},
"warc_info": "isPartOf: CC-MAIN-2024-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February/March 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-88\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
13,
36,
55,
64,
65,
74,
75,
104,
105,
354,
355,
527,
552,
567,
589,
590,
594,
595,
685,
686,
712,
719,
738,
747,
748,
754,
755,
996,
997,
1092,
1102,
1106,
1192,
1193,
1259,
1290,
1312,
1444,
1449,
1493,
1527,
1531,
1557,
1595,
1632,
1661,
1703,
1848,
1956,
1964,
2008,
2029,
2048,
2077,
2108,
2142,
2177,
2187,
2196,
2202,
2224,
2253,
2259,
2283,
2315,
2322,
2326,
2327,
2346,
2347,
2348,
2369,
2410,
2411,
2481,
2482,
2486,
2493,
2639,
2781,
2782,
2798,
2805,
2812,
2836,
2926,
2997,
2998,
3054,
3140,
3219,
3289,
3327,
3328,
3338,
3387,
3426,
3465,
3502,
3538,
3585,
3894,
3942,
3997,
4050,
4102,
4132,
4149,
4162,
4176,
4184,
4185,
4211,
4236,
4248,
4311,
4312,
4334,
4481,
4520,
4521,
4638,
4648,
4649,
4718,
4730,
4740,
4760,
4784,
4806,
4825,
4851,
4873,
4884,
4897,
4898,
4910,
4920,
4940,
4964,
4986,
5005,
5031,
5053,
5064,
5077,
5078,
5090,
5100,
5127,
5159,
5184,
5202,
5228,
5252,
5263,
5273,
5304,
5330,
5351,
5369,
5395,
5419,
5430,
5440,
5466,
5505,
5534,
5552,
5578,
5601,
5612,
5622,
5650,
5693,
5718,
5736,
5762,
5786,
5797,
5807,
5833,
5859,
5880,
5898,
5924,
5948,
5959,
5969,
6003,
6041,
6065,
6083,
6109,
6133,
6144,
6154,
6185,
6216,
6245,
6263,
6289,
6313,
6324,
6334,
6364,
6402,
6423,
6441,
6467,
6491,
6502,
6512,
6541,
6577,
6606,
6624,
6650,
6674,
6685,
6695,
6722,
6755,
6780,
6798,
6824,
6848,
6859,
6869,
6896,
6926,
6948,
6966,
6992,
7015,
7026,
7036,
7063,
7091,
7116,
7134,
7160,
7184,
7195,
7205,
7236,
7269,
7298,
7316,
7342,
7366,
7377,
7387,
7416,
7457,
7479,
7497,
7523,
7547,
7558,
7568,
7603,
7636,
7658,
7676,
7702,
7726,
7737,
7747,
7776,
7810,
7832,
7850,
7876,
7900,
7911,
7921,
7946,
7991,
8015,
8033,
8059,
8083,
8094,
8104,
8133,
8170,
8194,
8212,
8238,
8262,
8273,
8283,
8312,
8345,
8367,
8385,
8411,
8435,
8446,
8456,
8480,
8510,
8535,
8553,
8579,
8603,
8614,
8624,
8656,
8688,
8712,
8730,
8756,
8780,
8791,
8801,
8827,
8872,
8896,
8914,
8940,
8964,
8975,
8985,
9013,
9046,
9070,
9088,
9114,
9138,
9149,
9159,
9187,
9218,
9240,
9258,
9284,
9307,
9318,
9328,
9358,
9403,
9425,
9443,
9469,
9495,
9506,
9516,
9543,
9568,
9593,
9611,
9637,
9660,
9671,
9681,
9711,
9744,
9769,
9787,
9813,
9837,
9848,
9858,
9888,
9921,
9950,
9968,
9994,
10018,
10029,
10039,
10066,
10111,
10140,
10158,
10184,
10208,
10219,
10229,
10254,
10288,
10309,
10327,
10353,
10377,
10388,
10398,
10428,
10466,
10488,
10506,
10532,
10555,
10566,
10576,
10602,
10627,
10649,
10667,
10693,
10717,
10728,
10738,
10771,
10803,
10825,
10843,
10869,
10893,
10904,
10914,
10942,
10969,
10998,
11016,
11042,
11066,
11077,
11087,
11117,
11151,
11176,
11194,
11220,
11244,
11255,
11265,
11293,
11327,
11356,
11374,
11400,
11423,
11434,
11444,
11475,
11505,
11534,
11552,
11578,
11602,
11613,
11623,
11651,
11676,
11705,
11723,
11749,
11773,
11784,
11794,
11824,
11860,
11889,
11907,
11933,
11957,
11968,
11978,
12008,
12038,
12060,
12078,
12104,
12128,
12139,
12149,
12181,
12205,
12229,
12247,
12273,
12297,
12308,
12318,
12346,
12378,
12403,
12421,
12447,
12471,
12482,
12492,
12518,
12551,
12573,
12591,
12617,
12641,
12652,
12662,
12693,
12725,
12746,
12764,
12790,
12814,
12825,
12835,
12862,
12887,
12911,
12929,
12955,
12978,
12989,
12999,
13027,
13059,
13088,
13106,
13132,
13155,
13166,
13176,
13205,
13237,
13262,
13280,
13306,
13330,
13341,
13351,
13380,
13413,
13437,
13455,
13481,
13505,
13516,
13526,
13556,
13589,
13618,
13636,
13662,
13686,
13697,
13707,
13738,
13781,
13806,
13824,
13850,
13873,
13884,
13894,
13922,
13953,
13977,
13995,
14021,
14045,
14056,
14066,
14097,
14130,
14152,
14170,
14196,
14220,
14231,
14241,
14267,
14304,
14326,
14344,
14370,
14394,
14405,
14415,
14446,
14471,
14500,
14518,
14544,
14567,
14578,
14588,
14615,
14648,
14673,
14691,
14717,
14741,
14752,
14762,
14791,
14827,
14852,
14870,
14896,
14920,
14931,
14941,
14969,
15001,
15025,
15043,
15069,
15093,
15104,
15117,
15129,
15130,
15151,
15190,
15208,
15225,
15243,
15275,
15284,
15285,
15307,
15328,
15488,
15516,
15528,
15529,
15647,
15648,
15658,
15765,
15866,
15877,
15888,
15889,
15913,
16020,
16031,
16032,
16054,
16065,
16222,
16312,
16324,
16325,
16441,
16442,
16452,
16557,
16568,
16579,
16580,
16603,
16757,
16774,
16785,
16786,
16808,
16972,
17121,
17149,
17160,
17170,
17183,
17191,
17192,
17203,
17226,
17258,
17259,
17282,
17310,
17311,
17333,
17362,
17425,
17455,
17545,
17619,
17697,
17771,
17840,
17907,
17997,
18054,
18127,
18188,
18263,
18327,
18415,
18481,
18561,
18643,
18706,
18718,
18730,
18731,
18760,
18841,
18864,
18948,
19028,
19111,
19195,
19301,
19407,
19501,
19611,
19722,
19802,
19880,
19966,
20044,
20128,
20216,
20324,
20336,
20348,
20349,
20378,
20437,
20460,
20525,
20614,
20698,
20773,
20844,
20929,
21011,
21084,
21150,
21218,
21295,
21307,
21319,
21320,
21349,
21418,
21441,
21520,
21594,
21678,
21764,
21776,
21788,
21789,
21818,
21869,
21892,
21951,
22048,
22154,
22236,
22337,
22420,
22520,
22579,
22650,
22734,
22811,
22901,
22982,
22994,
23006,
23007,
23036,
23089,
23112,
23188,
23266,
23343,
23432,
23507,
23598,
23690,
23773,
23858,
23870,
23882,
23883,
23912,
23979,
24002,
24082,
24166,
24231,
24325,
24406,
24480,
24556,
24649,
24738,
24845,
24857,
24869,
24870,
24899,
24960,
24983,
25054,
25154,
25254,
25349,
25423,
25435,
25447,
25458,
25459,
25486,
25642,
25762,
25866,
25867,
26004,
26103,
26114,
26124,
26133,
26145,
26153,
26161,
26162,
26181,
26182,
26207,
26232,
26247,
26269,
26270,
26283,
26294,
26338,
26405,
26422,
26480,
26488,
26489
],
"line_end_idx": [
13,
36,
55,
64,
65,
74,
75,
104,
105,
354,
355,
527,
552,
567,
589,
590,
594,
595,
685,
686,
712,
719,
738,
747,
748,
754,
755,
996,
997,
1092,
1102,
1106,
1192,
1193,
1259,
1290,
1312,
1444,
1449,
1493,
1527,
1531,
1557,
1595,
1632,
1661,
1703,
1848,
1956,
1964,
2008,
2029,
2048,
2077,
2108,
2142,
2177,
2187,
2196,
2202,
2224,
2253,
2259,
2283,
2315,
2322,
2326,
2327,
2346,
2347,
2348,
2369,
2410,
2411,
2481,
2482,
2486,
2493,
2639,
2781,
2782,
2798,
2805,
2812,
2836,
2926,
2997,
2998,
3054,
3140,
3219,
3289,
3327,
3328,
3338,
3387,
3426,
3465,
3502,
3538,
3585,
3894,
3942,
3997,
4050,
4102,
4132,
4149,
4162,
4176,
4184,
4185,
4211,
4236,
4248,
4311,
4312,
4334,
4481,
4520,
4521,
4638,
4648,
4649,
4718,
4730,
4740,
4760,
4784,
4806,
4825,
4851,
4873,
4884,
4897,
4898,
4910,
4920,
4940,
4964,
4986,
5005,
5031,
5053,
5064,
5077,
5078,
5090,
5100,
5127,
5159,
5184,
5202,
5228,
5252,
5263,
5273,
5304,
5330,
5351,
5369,
5395,
5419,
5430,
5440,
5466,
5505,
5534,
5552,
5578,
5601,
5612,
5622,
5650,
5693,
5718,
5736,
5762,
5786,
5797,
5807,
5833,
5859,
5880,
5898,
5924,
5948,
5959,
5969,
6003,
6041,
6065,
6083,
6109,
6133,
6144,
6154,
6185,
6216,
6245,
6263,
6289,
6313,
6324,
6334,
6364,
6402,
6423,
6441,
6467,
6491,
6502,
6512,
6541,
6577,
6606,
6624,
6650,
6674,
6685,
6695,
6722,
6755,
6780,
6798,
6824,
6848,
6859,
6869,
6896,
6926,
6948,
6966,
6992,
7015,
7026,
7036,
7063,
7091,
7116,
7134,
7160,
7184,
7195,
7205,
7236,
7269,
7298,
7316,
7342,
7366,
7377,
7387,
7416,
7457,
7479,
7497,
7523,
7547,
7558,
7568,
7603,
7636,
7658,
7676,
7702,
7726,
7737,
7747,
7776,
7810,
7832,
7850,
7876,
7900,
7911,
7921,
7946,
7991,
8015,
8033,
8059,
8083,
8094,
8104,
8133,
8170,
8194,
8212,
8238,
8262,
8273,
8283,
8312,
8345,
8367,
8385,
8411,
8435,
8446,
8456,
8480,
8510,
8535,
8553,
8579,
8603,
8614,
8624,
8656,
8688,
8712,
8730,
8756,
8780,
8791,
8801,
8827,
8872,
8896,
8914,
8940,
8964,
8975,
8985,
9013,
9046,
9070,
9088,
9114,
9138,
9149,
9159,
9187,
9218,
9240,
9258,
9284,
9307,
9318,
9328,
9358,
9403,
9425,
9443,
9469,
9495,
9506,
9516,
9543,
9568,
9593,
9611,
9637,
9660,
9671,
9681,
9711,
9744,
9769,
9787,
9813,
9837,
9848,
9858,
9888,
9921,
9950,
9968,
9994,
10018,
10029,
10039,
10066,
10111,
10140,
10158,
10184,
10208,
10219,
10229,
10254,
10288,
10309,
10327,
10353,
10377,
10388,
10398,
10428,
10466,
10488,
10506,
10532,
10555,
10566,
10576,
10602,
10627,
10649,
10667,
10693,
10717,
10728,
10738,
10771,
10803,
10825,
10843,
10869,
10893,
10904,
10914,
10942,
10969,
10998,
11016,
11042,
11066,
11077,
11087,
11117,
11151,
11176,
11194,
11220,
11244,
11255,
11265,
11293,
11327,
11356,
11374,
11400,
11423,
11434,
11444,
11475,
11505,
11534,
11552,
11578,
11602,
11613,
11623,
11651,
11676,
11705,
11723,
11749,
11773,
11784,
11794,
11824,
11860,
11889,
11907,
11933,
11957,
11968,
11978,
12008,
12038,
12060,
12078,
12104,
12128,
12139,
12149,
12181,
12205,
12229,
12247,
12273,
12297,
12308,
12318,
12346,
12378,
12403,
12421,
12447,
12471,
12482,
12492,
12518,
12551,
12573,
12591,
12617,
12641,
12652,
12662,
12693,
12725,
12746,
12764,
12790,
12814,
12825,
12835,
12862,
12887,
12911,
12929,
12955,
12978,
12989,
12999,
13027,
13059,
13088,
13106,
13132,
13155,
13166,
13176,
13205,
13237,
13262,
13280,
13306,
13330,
13341,
13351,
13380,
13413,
13437,
13455,
13481,
13505,
13516,
13526,
13556,
13589,
13618,
13636,
13662,
13686,
13697,
13707,
13738,
13781,
13806,
13824,
13850,
13873,
13884,
13894,
13922,
13953,
13977,
13995,
14021,
14045,
14056,
14066,
14097,
14130,
14152,
14170,
14196,
14220,
14231,
14241,
14267,
14304,
14326,
14344,
14370,
14394,
14405,
14415,
14446,
14471,
14500,
14518,
14544,
14567,
14578,
14588,
14615,
14648,
14673,
14691,
14717,
14741,
14752,
14762,
14791,
14827,
14852,
14870,
14896,
14920,
14931,
14941,
14969,
15001,
15025,
15043,
15069,
15093,
15104,
15117,
15129,
15130,
15151,
15190,
15208,
15225,
15243,
15275,
15284,
15285,
15307,
15328,
15488,
15516,
15528,
15529,
15647,
15648,
15658,
15765,
15866,
15877,
15888,
15889,
15913,
16020,
16031,
16032,
16054,
16065,
16222,
16312,
16324,
16325,
16441,
16442,
16452,
16557,
16568,
16579,
16580,
16603,
16757,
16774,
16785,
16786,
16808,
16972,
17121,
17149,
17160,
17170,
17183,
17191,
17192,
17203,
17226,
17258,
17259,
17282,
17310,
17311,
17333,
17362,
17425,
17455,
17545,
17619,
17697,
17771,
17840,
17907,
17997,
18054,
18127,
18188,
18263,
18327,
18415,
18481,
18561,
18643,
18706,
18718,
18730,
18731,
18760,
18841,
18864,
18948,
19028,
19111,
19195,
19301,
19407,
19501,
19611,
19722,
19802,
19880,
19966,
20044,
20128,
20216,
20324,
20336,
20348,
20349,
20378,
20437,
20460,
20525,
20614,
20698,
20773,
20844,
20929,
21011,
21084,
21150,
21218,
21295,
21307,
21319,
21320,
21349,
21418,
21441,
21520,
21594,
21678,
21764,
21776,
21788,
21789,
21818,
21869,
21892,
21951,
22048,
22154,
22236,
22337,
22420,
22520,
22579,
22650,
22734,
22811,
22901,
22982,
22994,
23006,
23007,
23036,
23089,
23112,
23188,
23266,
23343,
23432,
23507,
23598,
23690,
23773,
23858,
23870,
23882,
23883,
23912,
23979,
24002,
24082,
24166,
24231,
24325,
24406,
24480,
24556,
24649,
24738,
24845,
24857,
24869,
24870,
24899,
24960,
24983,
25054,
25154,
25254,
25349,
25423,
25435,
25447,
25458,
25459,
25486,
25642,
25762,
25866,
25867,
26004,
26103,
26114,
26124,
26133,
26145,
26153,
26161,
26162,
26181,
26182,
26207,
26232,
26247,
26269,
26270,
26283,
26294,
26338,
26405,
26422,
26480,
26488,
26489,
26537
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 26537,
"ccnet_original_nlines": 831,
"rps_doc_curly_bracket": 0.0013565999688580632,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.0856519415974617,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006683030165731907,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5335515737533569,
"rps_doc_frac_unique_words": 0.48159998655319214,
"rps_doc_mean_word_length": 7.953066825866699,
"rps_doc_num_sentences": 326,
"rps_doc_symbol_to_word_ratio": 0.0006819400005042553,
"rps_doc_unigram_entropy": 6.052611827850342,
"rps_doc_word_count": 1875,
"rps_doc_frac_chars_dupe_10grams": 0.006974250078201294,
"rps_doc_frac_chars_dupe_5grams": 0.033798281103372574,
"rps_doc_frac_chars_dupe_6grams": 0.019983910024166107,
"rps_doc_frac_chars_dupe_7grams": 0.019983910024166107,
"rps_doc_frac_chars_dupe_8grams": 0.019983910024166107,
"rps_doc_frac_chars_dupe_9grams": 0.015557940118014812,
"rps_doc_frac_chars_top_2gram": 0.015021460130810738,
"rps_doc_frac_chars_top_3gram": 0.005364810116589069,
"rps_doc_frac_chars_top_4gram": 0.00985782966017723,
"rps_doc_books_importance": -4567.9580078125,
"rps_doc_books_importance_length_correction": -4567.9580078125,
"rps_doc_openwebtext_importance": -1814.505615234375,
"rps_doc_openwebtext_importance_length_correction": -1814.505615234375,
"rps_doc_wikipedia_importance": -2325.599853515625,
"rps_doc_wikipedia_importance_length_correction": -2325.599853515625
},
"fasttext": {
"dclm": 0.7285402417182922,
"english": 0.3951292335987091,
"fineweb_edu_approx": 2.080683708190918,
"eai_general_math": 0.06406862288713455,
"eai_open_web_math": 0.1356675624847412,
"eai_web_code": 0.47421371936798096
}
}
|
{
"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.776",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-4,899,061,505,959,684,000 |
Verified Commit 94cbf2f2 authored by Sebastian Krzyszkowiak's avatar Sebastian Krzyszkowiak
Browse files
jobs: Add dconf-editor
parent 242fa03c
......@@ -54,6 +54,10 @@ cogl:
archs: ['aarch64', 'armhf', 'amd64']
dists: ['buster']
branch: 'pureos/amber-phone'
dconf-editor:
url: https://source.puri.sm/librem5-apps/dconf-editor.git
dists: ['buster+ci']
branch: 'pureos/amber-phone'
deja-dup:
url: https://source.puri.sm/Librem5/deja-dup.git
dists: ['buster+ci']
......
Supports Markdown
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://source.puri.sm/guido.gunther/deb-build-jobs/-/commit/94cbf2f2c3dde9b2a6591cf8202fbdc85cfacbca",
"source_domain": "source.puri.sm",
"snapshot_id": "CC-MAIN-2023-06",
"warc_metadata": {
"Content-Length": "112689",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ADUSHSPEDCDAGV37DC45VTKILE73ISBI",
"WARC-Concurrent-To": "<urn:uuid:94043278-84e2-4745-a86b-aa67cf23992e>",
"WARC-Date": "2023-02-08T07:27:39Z",
"WARC-IP-Address": "143.198.145.103",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:A5LJULF33IMBDEVVANZWAQAMIMMHSDHB",
"WARC-Record-ID": "<urn:uuid:28ee0128-02b8-46df-baaa-2df33218fb39>",
"WARC-Target-URI": "https://source.puri.sm/guido.gunther/deb-build-jobs/-/commit/94cbf2f2c3dde9b2a6591cf8202fbdc85cfacbca",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f6b0e30d-b3c5-4c93-b530-3e1c479cc1b6>"
},
"warc_info": "isPartOf: CC-MAIN-2023-06\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January/February 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-56\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
92,
105,
106,
129,
130,
146,
177,
214,
232,
261,
275,
333,
354,
383,
393,
442,
463,
470,
488,
496,
567,
602
],
"line_end_idx": [
92,
105,
106,
129,
130,
146,
177,
214,
232,
261,
275,
333,
354,
383,
393,
442,
463,
470,
488,
496,
567,
602,
631
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 631,
"ccnet_original_nlines": 22,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.08176100999116898,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0,
"rps_doc_frac_lines_end_with_ellipsis": 0.043478261679410934,
"rps_doc_frac_no_alph_words": 0.446540892124176,
"rps_doc_frac_unique_words": 0.8059701323509216,
"rps_doc_mean_word_length": 6.970149040222168,
"rps_doc_num_sentences": 13,
"rps_doc_symbol_to_word_ratio": 0.025157229974865913,
"rps_doc_unigram_entropy": 3.920090675354004,
"rps_doc_word_count": 67,
"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.0942184180021286,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -54.17112350463867,
"rps_doc_books_importance_length_correction": -65.7956314086914,
"rps_doc_openwebtext_importance": -12.574355125427246,
"rps_doc_openwebtext_importance_length_correction": -24.19886016845703,
"rps_doc_wikipedia_importance": -23.535472869873047,
"rps_doc_wikipedia_importance_length_correction": -35.159976959228516
},
"fasttext": {
"dclm": 0.26888442039489746,
"english": 0.6860271692276001,
"fineweb_edu_approx": 0.810825526714325,
"eai_general_math": -0.000010009999641624745,
"eai_open_web_math": 0.16911643743515015,
"eai_web_code": -0.000010009999641624745
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "22",
"label": "Truncated"
}
},
"reasoning_depth": {
"primary": {
"code": "1",
"label": "No 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": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-5,272,866,696,021,078,000 |
manual:config:macros:usermacros
Differences
This shows you the differences between two versions of the page.
Link to this comparison view
manual:config:macros:usermacros [2015/05/05 07:56]
asaveljevs [Example 1] fixed net.tcp.service item key
manual:config:macros:usermacros [2016/01/08 11:41]
Line 1: Line 1:
-==== - User macros ====
-=== Overview ===
-
-For greater flexibility, Zabbix supports user macros, which can be defined on global, template and host level. These macros have a special syntax: **{$MACRO}**.
-
-The macros can be used in:
-
- * item names
- * item key parameters
- * trigger names
- * trigger expression parameters and constants (see examples)
- * several other [[manual:appendix:macros:supported_by_location#additional_support_for_user_macros|locations]]
-
-The following characters are allowed in the macro names: **A-Z** , **0-9** , **_** , **.**
-
-Zabbix substitutes macros according to the following precedence:
-
- - host level macros (checked first)
- - macros defined for first level templates of the host (i.e., templates linked directly to the host), sorted by template ID
- - macros defined for second level templates of the host, sorted by template ID
- - macros defined for third level templates of the host, sorted by template ID
- - ...
- - global macros (checked last)
-
-In other words, if a macro does not exist for a host, Zabbix will try to find it in the host templates of increasing depth. If still not found, a global macro will be used, if exists.
-
-If Zabbix is unable to find a macro, the macro will not be substituted.
-
-To define user macros, go to the corresponding locations in the frontend:
- * for global macros, visit //Administration -> General -> Macros//
- * for host and template level macros, open host or template properties and look for the //Macros// tab
-
-<note tip>If a user macro is used in items or triggers in a template, it is suggested to add that macro to the template even if it is defined on a global level. That way, exporting the template to XML and importing it in another system will still allow it to work as expected.</note>
-
-**Most common use cases of global and host macros:**
-
- - taking advantage of templates with host specific attributes: passwords, port numbers, file names, regular expressions, etc
- - global macros for global one-click configuration changes and fine tuning
-
-=== Examples ===
-
-== Example 1 ==
-
-Use of host-level macro in the "Status of SSH daemon" item key:
-
-**net.tcp.service[ssh,,{$SSH_PORT}]**
-
-This item can be assigned to multiple hosts, providing that the value of **{$SSH_PORT}** is defined on those hosts.
-
-== Example 2 ==
-
-Use of host-level macro in the "CPU load is too high" trigger:
-
-**{ca_001:system.cpu.load[,avg1].last(0)}>{$MAX_CPULOAD}**
-
-Such a trigger would be created on the template, not edited in individual hosts.
-
-<note tip>If you want to use amount of values as the function parameter (for example, **max(#3)**), include hash mark in the macro definition like this: SOME_PERIOD => #3</note>
-
-== Example 3 ==
-
-Use of two macros in the "CPU load is too high" trigger:
-
-**{ca_001:system.cpu.load[,avg1].min({$CPULOAD_PERIOD})}>{$MAX_CPULOAD}**
-
-Note that a macro can be used as a parameter of trigger function, in this example function **min()**.
-
-<note important>In trigger expressions user macros will expand if referencing a parameter or constant. They will NOT expand if referencing the host, item key, function, operator or another trigger expression.</note>
|
{
"url": "https://www.zabbix.com/documentation/2.0/manual/config/macros/usermacros?do=diff&rev2%5B0%5D=1452253271&rev2%5B1%5D=1430812615&difftype=sidebyside",
"source_domain": "www.zabbix.com",
"snapshot_id": "crawl=CC-MAIN-2021-04",
"warc_metadata": {
"Content-Length": "26477",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:UGAMIPZAOXBWTRFRVE5NAPEELVTI3XLP",
"WARC-Concurrent-To": "<urn:uuid:055e71d5-64ba-4678-afe9-5cd8d500618b>",
"WARC-Date": "2021-01-27T10:33:26Z",
"WARC-IP-Address": "104.21.18.21",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:BMOVETWODRZPHPOTQYL3NPNCNH56HHOF",
"WARC-Record-ID": "<urn:uuid:f5384682-3ae4-46bd-883e-e4e3644ad937>",
"WARC-Target-URI": "https://www.zabbix.com/documentation/2.0/manual/config/macros/usermacros?do=diff&rev2%5B0%5D=1452253271&rev2%5B1%5D=1430812615&difftype=sidebyside",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f2d1eeaa-4e88-4dc5-a016-603ae31a3e91>"
},
"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-246.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,
32,
33,
45,
46,
111,
112,
141,
142,
193,
247,
298,
314,
340,
343,
362,
365,
531,
534,
563,
566,
583,
611,
631,
696,
814,
817,
910,
913,
980,
983,
1023,
1151,
1234,
1316,
1326,
1361,
1364,
1550,
1553,
1627,
1630,
1706,
1778,
1885,
1888,
2176,
2179,
2234,
2237,
2367,
2446,
2449,
2468,
2471,
2489,
2492,
2560,
2563,
2604,
2607,
2725,
2728,
2746,
2749,
2814,
2817,
2881,
2884,
2967,
2970,
3155,
3158,
3176,
3179,
3238,
3241,
3320,
3323,
3427,
3430
],
"line_end_idx": [
32,
33,
45,
46,
111,
112,
141,
142,
193,
247,
298,
314,
340,
343,
362,
365,
531,
534,
563,
566,
583,
611,
631,
696,
814,
817,
910,
913,
980,
983,
1023,
1151,
1234,
1316,
1326,
1361,
1364,
1550,
1553,
1627,
1630,
1706,
1778,
1885,
1888,
2176,
2179,
2234,
2237,
2367,
2446,
2449,
2468,
2471,
2489,
2492,
2560,
2563,
2604,
2607,
2725,
2728,
2746,
2749,
2814,
2817,
2881,
2884,
2967,
2970,
3155,
3158,
3176,
3179,
3238,
3241,
3320,
3323,
3427,
3430,
3650
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3650,
"ccnet_original_nlines": 80,
"rps_doc_curly_bracket": 0.004383559804409742,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.25472888350486755,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02143757976591587,
"rps_doc_frac_lines_end_with_ellipsis": 0.01234568003565073,
"rps_doc_frac_no_alph_words": 0.34300124645233154,
"rps_doc_frac_unique_words": 0.409368634223938,
"rps_doc_mean_word_length": 5.319755554199219,
"rps_doc_num_sentences": 28,
"rps_doc_symbol_to_word_ratio": 0.005044139921665192,
"rps_doc_unigram_entropy": 4.785810947418213,
"rps_doc_word_count": 491,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09992343187332153,
"rps_doc_frac_chars_dupe_6grams": 0.09111791849136353,
"rps_doc_frac_chars_dupe_7grams": 0.0746554434299469,
"rps_doc_frac_chars_dupe_8grams": 0.0746554434299469,
"rps_doc_frac_chars_dupe_9grams": 0.05321592837572098,
"rps_doc_frac_chars_top_2gram": 0.013399690389633179,
"rps_doc_frac_chars_top_3gram": 0.01837671920657158,
"rps_doc_frac_chars_top_4gram": 0.021822359412908554,
"rps_doc_books_importance": -334.02703857421875,
"rps_doc_books_importance_length_correction": -334.02703857421875,
"rps_doc_openwebtext_importance": -182.8184814453125,
"rps_doc_openwebtext_importance_length_correction": -182.8184814453125,
"rps_doc_wikipedia_importance": -115.48444366455078,
"rps_doc_wikipedia_importance_length_correction": -115.48444366455078
},
"fasttext": {
"dclm": 0.07403814792633057,
"english": 0.5449118614196777,
"fineweb_edu_approx": 1.6614060401916504,
"eai_general_math": 0.68472820520401,
"eai_open_web_math": 0.755341649055481,
"eai_web_code": 0.6580201387405396
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.455",
"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": "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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
5,798,828,269,340,829,000 |
Advertisements
Bush viper
Atheris squamiger
Bush ViperDescription: Often called leaf viper, its color varies from ground colors of pale green to olive, brown, or rusty brown. The viper uses its prehensile tail to secure itself to branches.
Characteristics: An arboreal species that often comes down to the ground to feed on small rodents. It is not aggressive, but it will defend itself when molested or touched. Its venom is hemotoxic; healthy adults rarely die from its bite.
Habitat: Found in rain forests and woodlands bordering swamps and forests. Often found in trees, low-hanging branches, or brush.
Length: Average 45 centimeters (18 inches), maximum 75 centimeters (29 inches).
Distribution: Most of Africa, particularly Angola, Cameroon, Uganda, Kenya, and the Congo.
Print Friendly, PDF & Email
Advertisements
|
{
"url": "http://wildernessarena.com/dangers/animals/poisonous-animals/bush-viper",
"source_domain": "wildernessarena.com",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "98257",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:W3TCK3YPJKWAKFW26PUGYEQZDPUMBTWM",
"WARC-Concurrent-To": "<urn:uuid:e4fa211e-22b0-42e4-8182-4a1f2538eba0>",
"WARC-Date": "2018-06-25T15:53:13Z",
"WARC-IP-Address": "70.35.206.242",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:EVMDXW4TDKD6RDOASE6SQDRZGGSSN4DD",
"WARC-Record-ID": "<urn:uuid:1e9f7d2c-db46-4abc-b6a8-a10617cd1c5d>",
"WARC-Target-URI": "http://wildernessarena.com/dangers/animals/poisonous-animals/bush-viper",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8d194714-a32d-4913-aa48-2abc5a9c3978>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-167-170-5.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,
15,
16,
27,
45,
46,
242,
243,
481,
482,
611,
612,
692,
693,
784,
785,
813
],
"line_end_idx": [
15,
16,
27,
45,
46,
242,
243,
481,
482,
611,
612,
692,
693,
784,
785,
813,
827
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 827,
"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.24203822016716003,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006369430106133223,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2292993664741516,
"rps_doc_frac_unique_words": 0.7419354915618896,
"rps_doc_mean_word_length": 5.338709831237793,
"rps_doc_num_sentences": 10,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.410072326660156,
"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.021148040890693665,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -50.05373001098633,
"rps_doc_books_importance_length_correction": -50.05373001098633,
"rps_doc_openwebtext_importance": -29.115032196044922,
"rps_doc_openwebtext_importance_length_correction": -28.85353660583496,
"rps_doc_wikipedia_importance": -36.54718780517578,
"rps_doc_wikipedia_importance_length_correction": -36.54718780517578
},
"fasttext": {
"dclm": 0.08969675749540329,
"english": 0.8985487818717957,
"fineweb_edu_approx": 3.356112480163574,
"eai_general_math": 0.0026183100417256355,
"eai_open_web_math": 0.2914798855781555,
"eai_web_code": 0.0037748198956251144
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "597.952",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Zoology",
"level_3": "Fishes, Amphibians, and Reptiles"
}
},
"secondary": {
"code": "597.95",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Zoology",
"level_3": "Fishes, Amphibians, and Reptiles"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "1",
"label": "Remember"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "1",
"label": "No 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": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-1,399,952,928,397,227,300 |
Wikia
Minecraft Technic Pack Wiki
Energy Collector
Comments96
1,235pages on
this wiki
Logo pickaxe The article Energy Collector is still unfinished and may be lacking detailed general information, screenshots, and crafting recipes. Please expand the article and remove the {{unfinished}} tag once the article can be considered complete.
Logo-EE 40 Energy Collector is a part of the Equivalent Exchange mod.
Energy Collector
Block Energy Collector Block Collector MK2 Block Collector MK3
Energy Collectors Mk. 1 through 3
Type Machine
Tool Grid Wooden Pickaxe
Stackable Yes
EMC Value 82,953 EMC (Mk.1)
232,969 EMC (Mk.2)
710,665 (Mk.3)
Mod Included Equivalent Exchange
The energy Collector uses light to create EMC which can then be used to upgrade one fuel type to another, exported to an Energy Condenser, or sent to an Antimatter Relay and used to charge a Klein Star. Contrary to popular belief, the EMC generation of an Energy Collector does not increase when charging an Antimatter Relay. Rather, the Relay creates its own EMC based on its tier and the number of Energy Collectors surrounding it. If only 1 machine is working (charging a Klein Star or upgrading fuel) all generated EMC is transferred to that machine. For example, a Klein Star in an Antimatter relay will charge using the EMC from each Energy Collector touching one of its six faces. Something in the Collector itself takes precedence over charging anything else. Energy Collectors are the prime route to beginning your Equivalent Exchange career. There are three different tiers of Energy Collector:
Class EMC/s Storage
MK1 4 10k
MK2 12 30k
MK3 40 60k
These Collectors collect energy at an increased pace as you upgrade them, and also discharge much quicker.
UsageEdit
Energy Collector 2
The two columns on the left store fuel to be upgraded. It will cycle that fuel in automatically. The upgrade order is as follows:
Charcoal -> Redstone -> Coal -> Gunpowder -> Glowstone Dust -> Alchemical Coal -> Blaze Powder -> Glowstone Block -> Mobius Fuel -> Aeternalis Fuel
The lower right space is the fuel currently being upgraded. The far right space allows you to target a particular type of fuel that you want to upgrade to. For instance, drop Glowstone here if you only want it to upgrade to Glowstone and no further. Drop Aeternalis fuel here if you want to upgrade directly to Aeternalis fuel without going through the other types. The top right space is where the upgraded fuel goes.
The amount of EMC collected by each collector is as follows, measured in full sunlight averaged over 60 seconds. This output decreases in proportion to the decrease in light. The small square on the right shows the light level. When it's full, the Collector is at full efficiency. When it's fully dark, the Collector works at 1/16 efficiency. For each light level, it gains another 1/16 efficiency for a max light level of 15.
CraftingEdit
Mark I:
Glowstone
Glowstone
Glowstone
Glass
Diamond Block
Furnace
Glowstone
Glowstone
Glowstone
Energy Collector
Mark II:
Glowstone
Glowstone
Glowstone
Dark Matter
Energy Collector
Glowstone
Glowstone
Glowstone
Glowstone
Collector MK2
Mark III:
Glowstone
Glowstone
Glowstone
Red Matter
Collector MK2
Glowstone
Glowstone
Glowstone
Glowstone
Collector MK3
NotesEdit
• Glowstone blocks can be used to power all three versions of the Energy Collector. Unlike the solar panels from either RedPower or Industrialcraft, the Energy Collectors mistake Glowstone as sunlight and use its light, making for an energy farm that may work at night or underground.
• If you insert an item that the collector cannot use, it will literally spit it out through its front panel (the little hole).
• Note: These do not collect energy, but raw EMC.
Video TutorialEdit
Technic Tutorials 64Technic Tutorials 64. Energy Collector(05:17)
276 views
Advertisement | Your ad here
Around Wikia's network
Random Wiki
|
{
"url": "http://technicpack.wikia.com/wiki/Energy_Collector",
"source_domain": "technicpack.wikia.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "115749",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OIYFE3FCL4H6Z2PZKB27AS5GGDF6SHAW",
"WARC-Concurrent-To": "<urn:uuid:1890a8d9-612e-43aa-a60a-1730269c2654>",
"WARC-Date": "2013-12-13T01:15:40Z",
"WARC-IP-Address": "199.27.72.194",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:IVVT46ZOIKY3OSIWLC6FXS62UTAXEITS",
"WARC-Record-ID": "<urn:uuid:b10d3a6e-9275-4db8-9683-a2226c4652b5>",
"WARC-Target-URI": "http://technicpack.wikia.com/wiki/Energy_Collector",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0079bf79-0c5d-4163-8499-a3703e57e9bd>"
},
"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,
6,
7,
35,
36,
57,
58,
73,
91,
105,
360,
434,
455,
522,
560,
577,
606,
624,
656,
679,
698,
735,
736,
737,
1646,
1647,
1671,
1685,
1700,
1715,
1716,
1827,
1828,
1829,
1843,
1844,
1867,
1868,
2002,
2003,
2155,
2156,
2579,
2580,
3011,
3012,
3029,
3030,
3042,
3043,
3057,
3058,
3072,
3073,
3087,
3088,
3098,
3099,
3117,
3118,
3130,
3131,
3145,
3146,
3160,
3161,
3175,
3176,
3197,
3198,
3199,
3200,
3213,
3214,
3228,
3229,
3243,
3244,
3258,
3259,
3275,
3276,
3297,
3298,
3312,
3313,
3327,
3328,
3342,
3343,
3357,
3358,
3376,
3377,
3378,
3392,
3393,
3407,
3408,
3422,
3423,
3437,
3438,
3453,
3454,
3472,
3473,
3487,
3488,
3502,
3503,
3517,
3518,
3532,
3533,
3551,
3552,
3553,
3554,
3568,
3569,
3858,
3990,
4044,
4045,
4068,
4069,
4139,
4153,
4154,
4155,
4156,
4191,
4192,
4221,
4222
],
"line_end_idx": [
6,
7,
35,
36,
57,
58,
73,
91,
105,
360,
434,
455,
522,
560,
577,
606,
624,
656,
679,
698,
735,
736,
737,
1646,
1647,
1671,
1685,
1700,
1715,
1716,
1827,
1828,
1829,
1843,
1844,
1867,
1868,
2002,
2003,
2155,
2156,
2579,
2580,
3011,
3012,
3029,
3030,
3042,
3043,
3057,
3058,
3072,
3073,
3087,
3088,
3098,
3099,
3117,
3118,
3130,
3131,
3145,
3146,
3160,
3161,
3175,
3176,
3197,
3198,
3199,
3200,
3213,
3214,
3228,
3229,
3243,
3244,
3258,
3259,
3275,
3276,
3297,
3298,
3312,
3313,
3327,
3328,
3342,
3343,
3357,
3358,
3376,
3377,
3378,
3392,
3393,
3407,
3408,
3422,
3423,
3437,
3438,
3453,
3454,
3472,
3473,
3487,
3488,
3502,
3503,
3517,
3518,
3532,
3533,
3551,
3552,
3553,
3554,
3568,
3569,
3858,
3990,
4044,
4045,
4068,
4069,
4139,
4153,
4154,
4155,
4156,
4191,
4192,
4221,
4222,
4239
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4239,
"ccnet_original_nlines": 135,
"rps_doc_curly_bracket": 0.000943619990721345,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3177441358566284,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.031636860221624374,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.16781292855739594,
"rps_doc_frac_unique_words": 0.4612903296947479,
"rps_doc_mean_word_length": 5.082258224487305,
"rps_doc_num_sentences": 34,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.11065673828125,
"rps_doc_word_count": 620,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.028562359511852264,
"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.07997460663318634,
"rps_doc_frac_chars_top_3gram": 0.06854967027902603,
"rps_doc_frac_chars_top_4gram": 0.010155510157346725,
"rps_doc_books_importance": -309.10467529296875,
"rps_doc_books_importance_length_correction": -309.10467529296875,
"rps_doc_openwebtext_importance": -179.57264709472656,
"rps_doc_openwebtext_importance_length_correction": -179.57264709472656,
"rps_doc_wikipedia_importance": -134.41102600097656,
"rps_doc_wikipedia_importance_length_correction": -134.41102600097656
},
"fasttext": {
"dclm": 0.022636180743575096,
"english": 0.8436297178268433,
"fineweb_edu_approx": 2.608935832977295,
"eai_general_math": 0.39444196224212646,
"eai_open_web_math": 0.38318490982055664,
"eai_web_code": 0.024516940116882324
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "621.312",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "1",
"label": "Truncated Snippets"
}
},
"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": "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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-3,814,143,304,715,351,000 |
#7 Effective Home Workouts to Improve Your Core Strength Building core strength is an invaluable asset and here are few exercises for every part of your body to achieve a healthy body goal
By Priyadarshini Patwa
Opinions expressed by Entrepreneur contributors are their own.
You're reading Entrepreneur India, an international franchise of Entrepreneur Media.
Pixabay
Building core strength is an invaluable asset. With the ongoing novel coronavirus, it is the right time to get fit and in shape. To formulate a strong core, one needs to exercise a variety of muscles, from hips to shoulders. Most people consider the core as a nice six-pack or toned abs. But your "core' is not just the abs; it is every part of your body, except for your limbs. The glutes, flexors, abs, back, scapula, and pelvic floor comprises of the core.
Certainly, if you want a sculpted midsection, you have to work on these muscles. Core exercises are most efficient when they involve multiple muscles throughout the torso that crosses various joints and works together to coordinate stability. Unfortunately, there is a plethora of misinformation out there about what kind of exercises you should be doing to strengthen the core.
To avoid ineffectiveness or inaccurate information, Entrepreneur India spoke to Prateek Sood, Director, Grand Slam Fitness who breaks it down so you can get incredible, fast, and the right kind of attention your cores deserve. Being an expert in the field, Sood hugely recommends seven at-home core exercises with no weights, that everyone must focus on and strengthen their core.
Plank
Photo: Pexel
It might look simple, but it certainly isn't. The plank involves minimal movement but maximal effort. From improving your body posture to strengthening your back, chest, shoulders, neck, and abs, this one does wonder.
Process: "This definitive core exercise requires you to support your body on your toes and forearms while holding your body in a straight line, right from your shoulders to ankles. The posture is everything," he said.
Dead Bug
Photo: YouTube/ Howcast
Another brilliant core strength and trunk stabilizing exercise is a dead bug. It not only improves core conditioning but also helps build stability in the hips and trunk.
Process: "Lie straight on your back with arms extended towards the ceiling, and legs raised while bending your knees at 90°. Lower your left leg and right arm at the same time until they are hovering just above the floor, and then return to the initial position. Do the same with the opposite limbs," he explained.
Hanging Knee Raise
Photo: Youtube/ Clean Health Fitness Institute
You might have seen many doing this, now it's your turn. The hanging knee raises focus on your rectus abdominis aka front abs, hip flexors, as some obliques
Process: "Hold yourself steady with arms fully extended, on a set of dip bars. Raise your knees towards your chest, then lower them slowly and repeat. You can also perform this exercise hanging from a pull-up bar," said Sood.
Side Plank crunch
Photo: Pexel/ Elly Fairytale
Looking to focus on core muscles? Side Plank Crunch is a core body exercise that works on building your core muscles and obliques. It also strengthens your upper back and shoulder.
Process: "Start with left knee and left hand on the floor while keeping your right arm straight up. Then extend your right leg, so your body forms a straight line. Pull right knee toward the torso and right elbow toward the knee. Straighten arm and leg. Repeat 10 times, then switch sides," he explains.
Table-Top Knee Taps
Photo: YouTube/ Howcast
When the focus is to work on strengthening your core, glutes, arms, and shoulders, table-top knee taps are one of the most trusted exercises.
Process: "Start with placing palms flat on the floor and wrists and elbows directly beneath shoulders. Try to keep the knees directly below hips with toes tucked and pressed into the mat. With core tight, lift knees up, so that hips are in a-line with shoulders. Hold for one to two seconds, then release knees to the ground. Perform this workout in 15 repetitions for better results," he explains.
Assisted Crunches
Photo: Representation Purpose Only, Pexel/ Polina Tankilevitch
Followed religiously for building muscles, assisted crunches have been many's favourite. The intense muscle isolation makes this practice quite popular for people trying to get six-pack abs. It strengthens your core, which includes your lower back muscles and obliques. It also improves your focus and balance, which works in overall development.
Process: "Lie on back with legs in the air (knees over hips) bent at 90 degrees. Arms should be rounded and hands to rest on backs of thighs, just below knees. Use the core to curl forward, so that head, shoulders, and upper back lift up off the ground and towards knees. Lower back a few inches and then forward. Perform the exercise in 20-30 repetitions," he said.
Glute Bridge
Photo: YouTube/ CSIRO Total Wellbeing Diet
Apart from just working on your glutes, this exercise even focuses on building your hamstrings, lower back, abs. Quite similar to the benefits similar to that of a squat, it is a great alternative for those who find it difficult to squat due to back, hip, or knee pain
Process: "Lie down on your back, bending your knees and keeping your feet flat on the floor. Lift your hips off the floor while tightening your glutes. Held yourself high and form a straight line from your knees to your shoulders. Hold the contraction for 5-10 seconds before returning them to the starting position," he explains.
The thing about fitness is that once you start following, it becomes a way of life. Make fitness your mantra, not some compulsion that you don't enjoy! The basics of core workouts is to make your body a powerful foundation of strength, hitting your muscles from all directions. Being fit isn't just need of the hour but also an awakening call that we need to hear before it's too late!
Priyadarshini Patwa
Former Features Editor, Entrepreneur India
Priyadarshini Patwa is the Former Features Editors of Entrepreneur India and hosted an Instagram show every Friday named ‘Lighten Up’, about people from different walks of life and talk about their work and beyond. She handled the lifestyle, features, technology, entertainment segments and was also responsible for the Digital Covers. Previously she has worked with MensXP, a Times of India entity and Deccan Chronicle.
She’s @Priyanka_Patwa on Twitter and @priyadarshinipatwa on Instagram.
Related Topics
Marketing
How to Craft a Sales Funnel That Meets Your Business Needs
Understand the sales funnel and how small businesses can compete with larger rivals using cost-effective marketing and branding strategies.
Business Ideas
55 Small Business Ideas to Start in 2023
We put together a list of the best, most profitable small business ideas for entrepreneurs to pursue in 2023.
Leadership
5 Lessons Learned From a Female Entrepreneur
Entrepreneurship is a marathon, not a sprint — you must have a willingness to learn.
Starting a Business
Start A Dream Business In 60 Seconds: Take The First Step With This New App
For many, the dream of starting a business is often hindered by the daunting prospect of securing investment.
Starting a Business
Success Starts When You Let Go of These Entrepreneurial Myths
Whether you're preparing to launch your first business or you've been an entrepreneur for a while, don't fall for the following founder fables.
Buying / Investing in Business
How Venture Capitalists Are Using AI To Invest More Effectively
From sourcing hidden gems to promoting diversity, AI-driven tools streamline investments, save time and money, and revolutionize the industry. But does it work in reality, beyond just theoretical concepts?
|
{
"url": "https://www.entrepreneur.com/en-in/lifestyle/7-effective-home-workouts-to-improve-your-core-strength/352338",
"source_domain": "www.entrepreneur.com",
"snapshot_id": "CC-MAIN-2023-50",
"warc_metadata": {
"Content-Length": "377222",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TN4U3UDJYDSJ6SFZCAHLP567VTPAEGZV",
"WARC-Concurrent-To": "<urn:uuid:83e0e8a3-fe46-4f4d-bbf5-b55a4f9bad64>",
"WARC-Date": "2023-11-29T02:13:57Z",
"WARC-IP-Address": "146.75.37.91",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:35GXEPBVJRKKMUA5R3MSSK4DVW77CXZP",
"WARC-Record-ID": "<urn:uuid:ce70ca1b-4efd-45f6-917a-df9667a24026>",
"WARC-Target-URI": "https://www.entrepreneur.com/en-in/lifestyle/7-effective-home-workouts-to-improve-your-core-strength/352338",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b0091391-aafa-40e4-bd47-fd9f4e414b80>"
},
"warc_info": "isPartOf: CC-MAIN-2023-50\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-27\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
189,
190,
213,
214,
277,
278,
363,
364,
372,
373,
833,
834,
1213,
1214,
1595,
1596,
1602,
1603,
1616,
1617,
1835,
1836,
2054,
2055,
2064,
2065,
2089,
2090,
2261,
2262,
2577,
2578,
2597,
2598,
2645,
2646,
2803,
2804,
3030,
3031,
3049,
3050,
3079,
3080,
3261,
3262,
3566,
3567,
3587,
3588,
3612,
3613,
3755,
3756,
4155,
4156,
4174,
4175,
4238,
4239,
4586,
4587,
4954,
4955,
4968,
4969,
5012,
5013,
5282,
5283,
5614,
5615,
6001,
6002,
6022,
6023,
6066,
6067,
6489,
6490,
6561,
6562,
6577,
6578,
6588,
6589,
6648,
6649,
6789,
6790,
6805,
6806,
6847,
6848,
6958,
6959,
6970,
6971,
7016,
7017,
7102,
7103,
7123,
7124,
7200,
7201,
7311,
7312,
7332,
7333,
7395,
7396,
7540,
7541,
7572,
7573,
7637,
7638
],
"line_end_idx": [
189,
190,
213,
214,
277,
278,
363,
364,
372,
373,
833,
834,
1213,
1214,
1595,
1596,
1602,
1603,
1616,
1617,
1835,
1836,
2054,
2055,
2064,
2065,
2089,
2090,
2261,
2262,
2577,
2578,
2597,
2598,
2645,
2646,
2803,
2804,
3030,
3031,
3049,
3050,
3079,
3080,
3261,
3262,
3566,
3567,
3587,
3588,
3612,
3613,
3755,
3756,
4155,
4156,
4174,
4175,
4238,
4239,
4586,
4587,
4954,
4955,
4968,
4969,
5012,
5013,
5282,
5283,
5614,
5615,
6001,
6002,
6022,
6023,
6066,
6067,
6489,
6490,
6561,
6562,
6577,
6578,
6588,
6589,
6648,
6649,
6789,
6790,
6805,
6806,
6847,
6848,
6958,
6959,
6970,
6971,
7016,
7017,
7102,
7103,
7123,
7124,
7200,
7201,
7311,
7312,
7332,
7333,
7395,
7396,
7540,
7541,
7572,
7573,
7637,
7638,
7843
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7843,
"ccnet_original_nlines": 118,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36532098054885864,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.002647249959409237,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.15023162961006165,
"rps_doc_frac_unique_words": 0.42051684856414795,
"rps_doc_mean_word_length": 4.924040794372559,
"rps_doc_num_sentences": 70,
"rps_doc_symbol_to_word_ratio": 0.00066180998692289,
"rps_doc_unigram_entropy": 5.626881122589111,
"rps_doc_word_count": 1277,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.026081420481204987,
"rps_doc_frac_chars_dupe_6grams": 0.012404579669237137,
"rps_doc_frac_chars_dupe_7grams": 0.012404579669237137,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.008905850350856781,
"rps_doc_frac_chars_top_3gram": 0.006202289834618568,
"rps_doc_frac_chars_top_4gram": 0.006997460033744574,
"rps_doc_books_importance": -720.9326782226562,
"rps_doc_books_importance_length_correction": -720.9326782226562,
"rps_doc_openwebtext_importance": -400.8011169433594,
"rps_doc_openwebtext_importance_length_correction": -400.8011169433594,
"rps_doc_wikipedia_importance": -291.75439453125,
"rps_doc_wikipedia_importance_length_correction": -291.75439453125
},
"fasttext": {
"dclm": 0.02891761064529419,
"english": 0.9335132837295532,
"fineweb_edu_approx": 1.9616353511810303,
"eai_general_math": 0.01037347037345171,
"eai_open_web_math": 0.16896724700927734,
"eai_web_code": 0.009204859845340252
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "613.712",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Health and Hygiene"
}
},
"secondary": {
"code": "613.71",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Health and Hygiene"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-3,364,162,961,330,630,700 |
助手标题
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
流体性能 的翻译结果: 查询用时：0.751秒
图标索引 在分类学科中查询
所有学科
石油天然气工业
地质学
矿业工程
地球物理学
更多类别查询
图标索引 历史查询
流体性能
相关语句
“流体性能”译为未确定词的双语例句
Simulation study of the properties of ER fluid
ER流体性能的仿真研究
短句来源
Results and Conclusion The key to electrorheological technology lies in the ER fluids themselves.
结果与结论电流变技术的关键是电流变流体，电流变流体性能的好坏，直接影响到电流变装置的成功与否。
短句来源
The fundamental rheological properties of low methoxyl pectin(LMP) and the effects of factors, such as temperature, shear rate, pH value, metal ions, sugar on rheological properties were researched with AR-500-type rheometers.
以商品低酯果胶为研究对象,以AR-500型动态流变仪为主要设备,考察低酯果胶溶液的流变学基本特性,以及温度、剪切速率、体系pH值、金属离子、糖等因素对其流体性能的影响。
短句来源
Study on Rheological Properties and Synergism Action of Oat β-Glucan
燕麦β-葡聚糖溶液流体性能及其协同增稠效应研究
短句来源
Through bench testing the influence of the excitation frequency and the oscillation amplitude on the performance of a shock absorber with electrorheological fluid is studied and the behaviors of fluid requested by shock absorber is discussed.
通过台架试验研究了激振频率、振幅对电流变液体减振器性能的影响,并就电流变液体减振器要求的流体性能进行探讨。
短句来源
更多
相似匹配句对
Simulation study of the properties of ER fluid
ER流体性能的仿真研究
短句来源
Electro-rheological fluids perfomance test
电流变流体性能测试
短句来源
Plant Performance
设备性能
短句来源
④fluid;
4流体;
短句来源
The function of wood structure
木结构的性能
短句来源
查询“流体性能”译词为用户自定义的双语例句
我想查看译文中含有：的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法，我们为您准备了出自英文原文的大量英语例句，供您参考。
fluid property
Considering the effect of acute variety of the fluid property on heat transfer, the coreelation of heat transfer coefficient on the top of the internally ribbed tube was provided.
This discovery plays an important role in all-round understanding of the fluid property of the upper mantle, especially the ancient oceanic upper mantle.
We have developed a new method based on WT energy spectra analysis, by which the signal component reflecting the reservoir fluid property is extracted.
The inverse dependence of Reynolds number and skin friction coefficient is the basis for validity of the Reynolds' analogy, in convective flows with fluid property variations.
Electrical resistivity of soils is dependent upon various factors, including soil type, water content, saturation and pore fluid property.
更多
fluid performance
An effective filtration is also an important factor affecting the cutting fluid performance, specially when CBN wheels are used.
HOT table values are not exact but rather estimates of fluid performance.
Most of the poverty reducing outcome can be attributed to the fluid performance of the labor market through both employment and wage effects.
These fluctuations cause fluid performance variability which is detrimental to manufacturing processes.
This paper introduces a microcomputer program system for seaplane float contour design system——FCDS. A float contour is a complex 3-D curved surface which must satisfysome requirements about hydrostatical and hydrodynamical performances. In FCDS. a model picked from the model bank is taken as the foundation for generating a contour surface, which makes the further design of the surface have some warranties in hydrodynamics. A non-uniform rational B-spline is adopted to fit the cross designed curves and surfaces,...
This paper introduces a microcomputer program system for seaplane float contour design system——FCDS. A float contour is a complex 3-D curved surface which must satisfysome requirements about hydrostatical and hydrodynamical performances. In FCDS. a model picked from the model bank is taken as the foundation for generating a contour surface, which makes the further design of the surface have some warranties in hydrodynamics. A non-uniform rational B-spline is adopted to fit the cross designed curves and surfaces, on which not only the multiple-knot and multiple-vertex techniques based on a common polynomical non-uniform B-spline can be inherited, but also the ability of regulating shape will be increased. Besides, conies and conicoids can be integrated into a cubic ratio- nal expression. In the system. the function of fairing space curves and surfaces with the Hosaka method has been designed and the float contour can be faired so as to provide the contour data for direct application to manufacture.In this paper, it is also noted that the design conception and the structural form of CAD systems for specialized surface design such as FCDS are discussed. The universal conception of the system design makes FCDS possible be used for designing other aircraft component contours after being modified slightly.
本文介绍了一个水上飞机浮简外形设计的微机系统FCDS。浮筒外形是一张须满足流体静、动力等性能要求的复杂的三维曲面。FCDS以性能优良的库模型作为外形曲面生成的基础,使曲面的进一步设计有了一定的流体性能上的保证。系统用非均匀有理B样条来作曲线曲面的拟合和交互设计。不仅继承了普通多项式非均匀B样条重节点、重顶点等设计技巧,而且增加了形状调节的能力,同时可将二次曲线曲面统一在三次有理式中。系统提供了用穗坂卫法直接光顺空间曲线和曲面的功能,可对浮筒外形进行光顺处理,提供直接用于制造的数据。文中还对FCDS这类专业曲面CAD系统的设计构思、结构组成作了探讨。系统设计的通用性构思,使FCDS稍作修改即可用于其他飞机部件的外形设计。
The paper detailedly analyses the factors affecting whirlflow length and finds out the rules of effectof factors such as annular flow velocity,fluid properties and whirl flow centralizer structure parameters onwhirlflow length,and establishes a calculation formula of whirlflow length.
以实验为依据，对影响旋流长度的因素进行了详细的分析，得到了环空排量、流体性能、旋流器结构参数诸因素对旋流长度的影响规律。建立了旋流长度公式。
The fluid performance of contact area in elastohydro- dynamic lubrication is analysed in detail in this paper. The heat produced by sliding affects the fluid performance. This paper presents the shearing stress of heavily loaded contact area at defferent sliding speed and advances relevant formulaes.
本文详细分析了弹性流体动力润滑状态下接触区流体性能．由于滑动而产生的热严重影响流体性能．本文着重讨论了重载时不同滑动速度情况下接触区的剪切应力，并提出了相应的公式．
<< 更多相关文摘
图标索引 相关查询
CNKI小工具
在英文学术搜索中查有关流体性能的内容
在知识搜索中查有关流体性能的内容
在数字搜索中查有关流体性能的内容
在概念知识元中查有关流体性能的内容
在学术趋势中查有关流体性能的内容
CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标 2008 CNKI－中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号：110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社
|
{
"url": "http://dict.cnki.net/h_1817661000.html",
"source_domain": "dict.cnki.net",
"snapshot_id": "crawl=CC-MAIN-2020-34",
"warc_metadata": {
"Content-Length": "35940",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:YXKDAOAQZK7PMS5BZMR7AQXDRXJSGEBI",
"WARC-Concurrent-To": "<urn:uuid:f8142aa7-dacd-4694-b89d-e7cc2444c5b6>",
"WARC-Date": "2020-08-14T21:08:33Z",
"WARC-IP-Address": "103.26.1.120",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RWLUKHSP4BFHBLI2MCMMXIG7X74OY74T",
"WARC-Record-ID": "<urn:uuid:bdd24c1a-a14a-48cd-9367-cb95213f53e2>",
"WARC-Target-URI": "http://dict.cnki.net/h_1817661000.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:b0bb99ee-a3e2-43e8-bfc4-dcef849757ff>"
},
"warc_info": "isPartOf: CC-MAIN-2020-34\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-230.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
7,
37,
42,
47,
74,
88,
93,
101,
105,
110,
116,
123,
124,
134,
136,
137,
142,
147,
167,
219,
236,
241,
344,
397,
402,
634,
724,
729,
803,
832,
837,
1085,
1144,
1149,
1159,
1168,
1220,
1237,
1242,
1290,
1305,
1310,
1333,
1343,
1348,
1361,
1371,
1376,
1412,
1424,
1429,
1451,
1452,
1472,
1475,
1533,
1550,
1730,
1737,
1891,
1898,
2050,
2057,
2233,
2240,
2379,
2386,
2399,
2419,
2548,
2555,
2629,
2636,
2778,
2785,
2889,
2896,
2897,
2898,
3419,
3420,
4742,
4743,
5057,
5058,
5344,
5345,
5416,
5417,
5719,
5720,
5803,
5804,
5806,
5820,
5830,
5831,
5833,
5834,
5835,
5837,
5845,
5864,
5881,
5898,
5916,
5933,
5935,
5937,
5938,
5986,
6007,
6042,
6069
],
"line_end_idx": [
7,
37,
42,
47,
74,
88,
93,
101,
105,
110,
116,
123,
124,
134,
136,
137,
142,
147,
167,
219,
236,
241,
344,
397,
402,
634,
724,
729,
803,
832,
837,
1085,
1144,
1149,
1159,
1168,
1220,
1237,
1242,
1290,
1305,
1310,
1333,
1343,
1348,
1361,
1371,
1376,
1412,
1424,
1429,
1451,
1452,
1472,
1475,
1533,
1550,
1730,
1737,
1891,
1898,
2050,
2057,
2233,
2240,
2379,
2386,
2399,
2419,
2548,
2555,
2629,
2636,
2778,
2785,
2889,
2896,
2897,
2898,
3419,
3420,
4742,
4743,
5057,
5058,
5344,
5345,
5416,
5417,
5719,
5720,
5803,
5804,
5806,
5820,
5830,
5831,
5833,
5834,
5835,
5837,
5845,
5864,
5881,
5898,
5916,
5933,
5935,
5937,
5938,
5986,
6007,
6042,
6069,
6105
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6105,
"ccnet_original_nlines": 114,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.26494845747947693,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.039175260812044144,
"rps_doc_frac_lines_end_with_ellipsis": 0.008695649914443493,
"rps_doc_frac_no_alph_words": 0.27113401889801025,
"rps_doc_frac_unique_words": 0.5019867420196533,
"rps_doc_mean_word_length": 6.642384052276611,
"rps_doc_num_sentences": 33,
"rps_doc_symbol_to_word_ratio": 0.0010309299686923623,
"rps_doc_unigram_entropy": 5.3429036140441895,
"rps_doc_word_count": 755,
"rps_doc_frac_chars_dupe_10grams": 0.19381853938102722,
"rps_doc_frac_chars_dupe_5grams": 0.19381853938102722,
"rps_doc_frac_chars_dupe_6grams": 0.19381853938102722,
"rps_doc_frac_chars_dupe_7grams": 0.19381853938102722,
"rps_doc_frac_chars_dupe_8grams": 0.19381853938102722,
"rps_doc_frac_chars_dupe_9grams": 0.19381853938102722,
"rps_doc_frac_chars_top_2gram": 0.012961120344698429,
"rps_doc_frac_chars_top_3gram": 0.011365899816155434,
"rps_doc_frac_chars_top_4gram": 0.007976070046424866,
"rps_doc_books_importance": -376.39093017578125,
"rps_doc_books_importance_length_correction": -376.39093017578125,
"rps_doc_openwebtext_importance": -228.25027465820312,
"rps_doc_openwebtext_importance_length_correction": -228.25027465820312,
"rps_doc_wikipedia_importance": -158.95193481445312,
"rps_doc_wikipedia_importance_length_correction": -158.95193481445312
},
"fasttext": {
"dclm": 0.04815148934721947,
"english": 0.5881578326225281,
"fineweb_edu_approx": 2.792686939239502,
"eai_general_math": 0.32877999544143677,
"eai_open_web_math": 0.4638715982437134,
"eai_web_code": 0.001484749955125153
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "621.402",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
},
"secondary": {
"code": "621.4",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "2",
"label": "Academic/Research"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "3",
"label": "Academic Writing"
},
"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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
7,768,592,595,011,333,000 |
Log In
E-mail or User ID
Password
Keep me signed in
Recover Password
Create an Account
Teradata
Solve problems - It's Free
Create your account in seconds
Email address
Username
Between 5 and 30 characters. No spaces please
Password
Notify me of new activity in this group:
Keep me informed of the latest:
By clicking "Join Now", you agree to Toolbox for Technology terms of use, and have read and understand our privacy policy.
TOAD, Teradata, Duplicate Records
Hi!
I have data that is duplicated by a field that should be unique but is not. The whole record is distinct due to date field values and other CHARVARs.
Mem_ID is expected to be duplicative where appropriate, i.e. more than one uniqueID by Mem_Id.
Would like to keep just one record by UniqueID (earliest).
Ideally, min(admit) and set discharge date to max(discharge)
Have tried combinations of SELECT DISTINCT & MIN & MAX, but keep getting same number of records, obviously doing something wrong.
Thanks for any insight!
Here are some examples.
For example, UniqueID 5459110 is duplicated data due to influences beyond the scope of my current needs and only need one record.
UniqueID Mem_Id admit discharge Status
5459110 135802 7/20/2010 7/27/2010 Some Description 1
5459110 135802 7/22/2010 7/27/2010 Some Description 1
13776129 478821 6/8/2011 6/12/2011 Some Description 4
13776129 478821 6/11/2011 6/12/2011 Some Description 4
14844766 478914 4/28/2011 5/2/2011 Some Description 2
14844766 478914 4/29/2011 5/2/2011 Some Description 1
14844766 478914 4/30/2011 5/2/2011 Some Description 1
14844766 478914 5/1/2011 5/2/2011 Some Description 1
14844766 478914 5/2/2011 5/2/2011 Some Description 1
Best Answer
Updated
You don't use WHERE, just QUALIFY:
CREATE TABLE ar_asrh_dm_etl_beacon.Flg_ReAdAlgo1a1a AS
( SELECT *
FROM ar_asrh_dm_etl_beacon.Flg_ReAdAlgo1a1
QUALIFY ROW_NUMBER()
OVER (partition by UniqueID
ORDER by Admit DESC) = 1
)
WITH DATA;
The ROW_NUMBER function will group the data into partitions for each value of UniqueID, sorted by Admit in descending order. The QUALIFY statement is like a "where" clause in that it selects only rows that qualify (in this case, rows where the ROW_NUMBER function returns a 1, meaning it is the most recent value of Admit for each group of UniqueID.
Original answer by bob duell Dec 14, 2012
Contributors:
All Replies (4)
1
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
sayaksitex replied Jan 1, 0001
(SEL * FROM table_name QUALIFY ROW_NUMBER() OVER (partition by col1, col2... order by 1) > 1 )
use this logic in where condition......then you will get only distinct rows....!
cheers!
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
WPoling replied Dec 14, 2012
Thank you for this example. I am not sure exactly how to use it though.
Have tried to incorporate but getting syntax error, expecting something between the WHERE & QUALIFY:
CREATE TABLE ar_asrh_dm_etl_beacon.Flg_ReAdAlgo1a1a AS
(SELECT * FROM ar_asrh_dm_etl_beacon.Flg_ReAdAlgo1a1
WHERE QUALIFY ROW_NUMBER() OVER (partition by AdmitMem_id2, AdmitClaim_id2 ORDER by 1) > 1 )
WITH DATA;
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
bob duell replied Dec 14, 2012
You don't use WHERE, just QUALIFY:
CREATE TABLE ar_asrh_dm_etl_beacon.Flg_ReAdAlgo1a1a AS
( SELECT *
FROM ar_asrh_dm_etl_beacon.Flg_ReAdAlgo1a1
QUALIFY ROW_NUMBER()
OVER (partition by UniqueID
ORDER by Admit DESC) = 1
)
WITH DATA;
The ROW_NUMBER function will group the data into partitions for each value of UniqueID, sorted by Admit in descending order. The QUALIFY statement is like a "where" clause in that it selects only rows that qualify (in this case, rows where the ROW_NUMBER function returns a 1, meaning it is the most recent value of Admit for each group of UniqueID.
0
Mark this reply as the best answer?
(Choose carefully, this can't be changed)
Yes | No
WPoling replied Dec 14, 2012
Thank you Bob, this is working.
WHP
For discussions on Teradata please visit the Data Warehouse – General Discussions group. The Teradata group is no longer active.
PCMag Digital Group AdChoices
TRUSTe Privacy Certification
|
{
"url": "http://datawarehouse.ittoolbox.com/groups/technical-functional/teradata-l/toad-teradata-duplicate-records-5038166",
"source_domain": "datawarehouse.ittoolbox.com",
"snapshot_id": "crawl=CC-MAIN-2016-40",
"warc_metadata": {
"Content-Length": "141228",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O2OMKSVA2Y6OCVA34NXE4WSW7STZWHD6",
"WARC-Concurrent-To": "<urn:uuid:bd9fed23-e06b-48a3-983a-e566bfa3d5f8>",
"WARC-Date": "2016-10-01T10:29:43Z",
"WARC-IP-Address": "23.50.225.10",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:PQPK4WJ3YFCLLN4PZUYME4LDUYA76OYL",
"WARC-Record-ID": "<urn:uuid:027864f3-1b2f-4e9d-81b3-7c9adcf28fef>",
"WARC-Target-URI": "http://datawarehouse.ittoolbox.com/groups/technical-functional/teradata-l/toad-teradata-duplicate-records-5038166",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8de7a87f-6268-4d37-a0ba-693a4a619a3b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-143-35-109.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-40\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for September 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
7,
25,
34,
54,
71,
89,
98,
99,
126,
127,
158,
172,
181,
182,
228,
237,
278,
310,
433,
434,
468,
469,
473,
623,
624,
719,
720,
779,
780,
841,
842,
972,
973,
997,
998,
1022,
1023,
1153,
1154,
1193,
1247,
1301,
1355,
1410,
1464,
1518,
1572,
1625,
1678,
1690,
1698,
1733,
1734,
1790,
1802,
1848,
1872,
1910,
1951,
1955,
1966,
2316,
2358,
2372,
2388,
2390,
2426,
2468,
2479,
2510,
2605,
2606,
2687,
2688,
2696,
2698,
2734,
2776,
2787,
2816,
2888,
2889,
2990,
2991,
2992,
3047,
3048,
3101,
3102,
3195,
3196,
3207,
3209,
3245,
3287,
3298,
3329,
3364,
3365,
3421,
3433,
3479,
3503,
3541,
3582,
3586,
3597,
3947,
3949,
3985,
4027,
4038,
4067,
4099,
4100,
4104,
4233,
4234,
4264,
4265
],
"line_end_idx": [
7,
25,
34,
54,
71,
89,
98,
99,
126,
127,
158,
172,
181,
182,
228,
237,
278,
310,
433,
434,
468,
469,
473,
623,
624,
719,
720,
779,
780,
841,
842,
972,
973,
997,
998,
1022,
1023,
1153,
1154,
1193,
1247,
1301,
1355,
1410,
1464,
1518,
1572,
1625,
1678,
1690,
1698,
1733,
1734,
1790,
1802,
1848,
1872,
1910,
1951,
1955,
1966,
2316,
2358,
2372,
2388,
2390,
2426,
2468,
2479,
2510,
2605,
2606,
2687,
2688,
2696,
2698,
2734,
2776,
2787,
2816,
2888,
2889,
2990,
2991,
2992,
3047,
3048,
3101,
3102,
3195,
3196,
3207,
3209,
3245,
3287,
3298,
3329,
3364,
3365,
3421,
3433,
3479,
3503,
3541,
3582,
3586,
3597,
3947,
3949,
3985,
4027,
4038,
4067,
4099,
4100,
4104,
4233,
4234,
4264,
4265,
4293
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4293,
"ccnet_original_nlines": 120,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.26918670535087585,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.07216495275497437,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.32646048069000244,
"rps_doc_frac_unique_words": 0.3785046637058258,
"rps_doc_mean_word_length": 5.115264892578125,
"rps_doc_num_sentences": 37,
"rps_doc_symbol_to_word_ratio": 0.004581899847835302,
"rps_doc_unigram_entropy": 5.093313694000244,
"rps_doc_word_count": 642,
"rps_doc_frac_chars_dupe_10grams": 0.37606576085090637,
"rps_doc_frac_chars_dupe_5grams": 0.4561510384082794,
"rps_doc_frac_chars_dupe_6grams": 0.4372716248035431,
"rps_doc_frac_chars_dupe_7grams": 0.40438491106033325,
"rps_doc_frac_chars_dupe_8grams": 0.40438491106033325,
"rps_doc_frac_chars_dupe_9grams": 0.37606576085090637,
"rps_doc_frac_chars_top_2gram": 0.041108399629592896,
"rps_doc_frac_chars_top_3gram": 0.02923263981938362,
"rps_doc_frac_chars_top_4gram": 0.02679659053683281,
"rps_doc_books_importance": -366.2338562011719,
"rps_doc_books_importance_length_correction": -366.2338562011719,
"rps_doc_openwebtext_importance": -217.44155883789062,
"rps_doc_openwebtext_importance_length_correction": -217.44155883789062,
"rps_doc_wikipedia_importance": -164.6173095703125,
"rps_doc_wikipedia_importance_length_correction": -164.6173095703125
},
"fasttext": {
"dclm": 0.035681549459695816,
"english": 0.8282889127731323,
"fineweb_edu_approx": 1.2968999147415161,
"eai_general_math": 0.03818482160568237,
"eai_open_web_math": 0.2055530548095703,
"eai_web_code": 0.013717889785766602
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.44",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.758",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "4",
"label": "Graduate/Expert Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-1,787,166,006,848,735,200 |
SmartFrog 3.10.000
Uses of Class
org.smartfrog.sfcore.reference.ReferencePart
Packages that use ReferencePart
org.smartfrog.sfcore.reference
Uses of ReferencePart in org.smartfrog.sfcore.reference
Subclasses of ReferencePart in org.smartfrog.sfcore.reference
class AttribReferencePart
Implements the attrib reference part.
class HereReferencePart
Implements the most basic of reference parts.
class HostReferencePart
Implements the host reference part.
class IPropertyReferencePart
Implements the property reference part.
class ParentReferencePart
Implements the parent reference part.
class ProcessReferencePart
Implements the process reference part.
class PropertyReferencePart
Implements the property reference part.
class RootReferencePart
Implements the root reference part.
class ThisReferencePart
Implements the most basic of reference parts.
Methods in org.smartfrog.sfcore.reference that return ReferencePart
ReferencePart Reference.addElement(ReferencePart o)
Adds element to the end of the reference.
ReferencePart HereReferencePart.asAttribReferencePart()
Converts this reference part to an AttribReferencePart.
ReferencePart AttribReferencePart.asAttribReferencePart()
Returns this object since this is already an attrib reference part.
ReferencePart HostReferencePart.asHostReferencePart()
Returns this object since this is already a host reference part.
ReferencePart ProcessReferencePart.asProcessReferencePart()
Returns this object since this is already a process reference part.
static ReferencePart ReferencePart.attrib(java.lang.Object s)
Creates a reference part to a attribute of a containing component.
ReferencePart Reference.elementAt(int index)
Returns element at index.
ReferencePart Reference.firstElement()
Returns first element of reference.
static ReferencePart ReferencePart.here(java.lang.Object s)
Creates a reference part to the current component.
static ReferencePart ReferencePart.host(java.lang.String s)
Creates a reference part which resolves to a host's root process compound component.
static ReferencePart ReferencePart.iproperty(java.lang.Object s)
Creates an integer property part which resolves to a system property.
ReferencePart Reference.lastElement()
Returns last element in reference.
static ReferencePart ReferencePart.parent()
Creates a reference part to the parent component.
static ReferencePart ReferencePart.process()
Creates a reference part which resolves to the process compound component.
static ReferencePart ReferencePart.property(java.lang.Object s)
Creates a property part which resolves to a system property.
static ReferencePart ReferencePart.root()
Creates a reference part to the root component.
ReferencePart Reference.setElementAt(ReferencePart elem, int index)
Sets the element at given index to a new element.
static ReferencePart ReferencePart.thisref()
Creates a reference part to the containing component.
Methods in org.smartfrog.sfcore.reference with parameters of type ReferencePart
ReferencePart Reference.addElement(ReferencePart o)
Adds element to the end of the reference.
boolean Reference.removeElement(ReferencePart o)
Remove element from reference.
ReferencePart Reference.setElementAt(ReferencePart elem, int index)
Sets the element at given index to a new element.
Constructors in org.smartfrog.sfcore.reference with parameters of type ReferencePart
Reference(ReferencePart referencePart)
Constructs a reference with a single reference part.
SmartFrog CORE 3.10.000
(C) Copyright 1998-2006 Hewlett-Packard Development Company, LP
|
{
"url": "http://www.hpl.hp.com/research/smartfrog/releasedocs/smartfrogdoc/jdocs/org/smartfrog/sfcore/reference/class-use/ReferencePart.html",
"source_domain": "www.hpl.hp.com",
"snapshot_id": "crawl=CC-MAIN-2018-05",
"warc_metadata": {
"Content-Length": "26940",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Z3YD7KROJJ4OZOGAIG2I4ZQNY4K6TOVH",
"WARC-Concurrent-To": "<urn:uuid:d151272c-2bbb-4939-98ae-0a05f5d0b28f>",
"WARC-Date": "2018-01-19T17:51:15Z",
"WARC-IP-Address": "204.123.3.20",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LDKIGKYU43K2P3ZHJR2OPKVSY5WAC45K",
"WARC-Record-ID": "<urn:uuid:1bd40ba3-0a49-4a78-83ea-23f01527e1eb>",
"WARC-Target-URI": "http://www.hpl.hp.com/research/smartfrog/releasedocs/smartfrogdoc/jdocs/org/smartfrog/sfcore/reference/class-use/ReferencePart.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cd136059-dde9-4855-9c9a-d73a7e5240ab>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-233-143-46.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-05\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for January 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
19,
20,
34,
79,
80,
112,
146,
148,
149,
205,
207,
208,
270,
297,
345,
370,
426,
451,
497,
527,
577,
604,
652,
680,
729,
758,
808,
833,
879,
904,
960,
962,
963,
1031,
1084,
1136,
1193,
1259,
1318,
1396,
1451,
1526,
1587,
1665,
1727,
1804,
1850,
1886,
1926,
1972,
2032,
2093,
2153,
2248,
2313,
2393,
2432,
2477,
2521,
2581,
2626,
2711,
2775,
2846,
2888,
2946,
3015,
3075,
3120,
3184,
3186,
3187,
3267,
3320,
3372,
3422,
3463,
3532,
3592,
3594,
3595,
3680,
3719,
3782,
3784,
3785,
3786,
3810,
3811
],
"line_end_idx": [
19,
20,
34,
79,
80,
112,
146,
148,
149,
205,
207,
208,
270,
297,
345,
370,
426,
451,
497,
527,
577,
604,
652,
680,
729,
758,
808,
833,
879,
904,
960,
962,
963,
1031,
1084,
1136,
1193,
1259,
1318,
1396,
1451,
1526,
1587,
1665,
1727,
1804,
1850,
1886,
1926,
1972,
2032,
2093,
2153,
2248,
2313,
2393,
2432,
2477,
2521,
2581,
2626,
2711,
2775,
2846,
2888,
2946,
3015,
3075,
3120,
3184,
3186,
3187,
3267,
3320,
3372,
3422,
3463,
3532,
3592,
3594,
3595,
3680,
3719,
3782,
3784,
3785,
3786,
3810,
3811,
3874
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3874,
"ccnet_original_nlines": 89,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.21206897497177124,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005172410048544407,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.237931028008461,
"rps_doc_frac_unique_words": 0.29100528359413147,
"rps_doc_mean_word_length": 7.939153671264648,
"rps_doc_num_sentences": 89,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.088719367980957,
"rps_doc_word_count": 378,
"rps_doc_frac_chars_dupe_10grams": 0.1266244649887085,
"rps_doc_frac_chars_dupe_5grams": 0.3748750388622284,
"rps_doc_frac_chars_dupe_6grams": 0.3455514907836914,
"rps_doc_frac_chars_dupe_7grams": 0.2765744924545288,
"rps_doc_frac_chars_dupe_8grams": 0.17860713601112366,
"rps_doc_frac_chars_dupe_9grams": 0.1266244649887085,
"rps_doc_frac_chars_top_2gram": 0.0823059007525444,
"rps_doc_frac_chars_top_3gram": 0.041985999792814255,
"rps_doc_frac_chars_top_4gram": 0.04898367077112198,
"rps_doc_books_importance": -236.4955291748047,
"rps_doc_books_importance_length_correction": -236.4955291748047,
"rps_doc_openwebtext_importance": -155.6682586669922,
"rps_doc_openwebtext_importance_length_correction": -155.6682586669922,
"rps_doc_wikipedia_importance": -113.76315307617188,
"rps_doc_wikipedia_importance_length_correction": -113.76315307617188
},
"fasttext": {
"dclm": 0.028824390843510628,
"english": 0.5143618583679199,
"fineweb_edu_approx": 2.629833936691284,
"eai_general_math": 0.5917527079582214,
"eai_open_web_math": 0.7064099311828613,
"eai_web_code": 0.2962929606437683
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-8,400,107,140,014,119,000 |
Logo Search packages:
Sourcecode: gnucap version File versions Download package
d_trln.cc
/*$Id: d_trln.cc,v 24.5 2003/04/27 01:05:05 al Exp $ -*- C++ -*-
* Copyright (C) 2001 Albert Davis
* Author: Albert Davis <[email protected]>
*
* This file is part of "Gnucap", the Gnu Circuit Analysis Package
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2, or (at your option)
* any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
* 02111-1307, USA.
*------------------------------------------------------------------
* Transmission line. (ideal lossless.)
*/
#include "ap.h"
#include "d_trln.h"
/*--------------------------------------------------------------------------*/
const double LINLENTOL = .000001;
const double default_nl = 0.25;
const double default_z0 = 50;
const char* default_z0_string = "50";
static COMMON_TRANSLINE Default_TRANSLINE(CC_STATIC);
/*--------------------------------------------------------------------------*/
COMMON_TRANSLINE::COMMON_TRANSLINE(int c)
:COMMON_COMPONENT(c),
real_z0(NOT_INPUT),
real_td(NOT_INPUT),
len(1.),
R(0.),
L(NOT_INPUT),
G(0.),
C(NOT_INPUT),
z0(NOT_INPUT),
td(NOT_INPUT),
f(NOT_INPUT),
nl(default_nl),
icset(false)
{
for (int i = 0; i < NUM_INIT_COND; ++i) {
ic[i] = 0.;
}
}
/*--------------------------------------------------------------------------*/
COMMON_TRANSLINE::COMMON_TRANSLINE(const COMMON_TRANSLINE& p)
:COMMON_COMPONENT(p),
real_z0(p.real_z0),
real_td(p.real_td),
len(p.len),
R(p.R),
L(p.L),
G(p.G),
C(p.C),
z0(p.z0),
td(p.td),
f(p.f),
nl(p.nl),
icset(p.icset)
{
for (int i = 0; i < NUM_INIT_COND; ++i) {
ic[i] = p.ic[i];
}
}
/*--------------------------------------------------------------------------*/
bool COMMON_TRANSLINE::operator==(const COMMON_COMPONENT& x)const
{
const COMMON_TRANSLINE* p = dynamic_cast<const COMMON_TRANSLINE*>(&x);
bool rv = p
&& real_z0 == p->real_z0
&& real_td == p->real_td
&& icset == p->icset
&& R == p->R
&& G == p->G
&& is_equal(x);
if (rv) {
{for (int i=0; i<NUM_INIT_COND; ++i) {
rv &= ic[i] == p->ic[i];
}}
}
return rv;
}
/*--------------------------------------------------------------------------*/
void COMMON_TRANSLINE::parse(CS& cmd)
{
int here = cmd.cursor();
do{
0
|| get(cmd, "LEN", &len)
|| get(cmd, "Mult", &len)
|| get(cmd, "R", &R)
|| get(cmd, "L", &L)
|| get(cmd, "G", &G)
|| get(cmd, "C", &C)
|| get(cmd, "Z0", &z0)
|| get(cmd, "Zo", &z0)
|| get(cmd, "Delay",&td)
|| get(cmd, "TD", &td)
|| get(cmd, "Freq", &f, mPOSITIVE)
|| get(cmd, "Nl", &nl, mPOSITIVE)
;
if (cmd.pmatch("Ic")) {
untested();
icset = true;
for (int i = 0; i < NUM_INIT_COND; ++i) {
untested();
ic[i] = cmd.ctof();
}
}
}while (cmd.more() && !cmd.stuck(&here));
cmd.check(bWARNING, "what's this?");
{if (td != NOT_INPUT) {
real_td = len * td;
// have td. check for conflicts.
if (f != NOT_INPUT) {
{if (!conchk(td, nl/f, OPT::vntol)) {
untested();
cmd.warn(bDANGER, 0, "td, f&nl conflict. using td");
}else{
untested();
}}
}
}else if (f != NOT_INPUT) {
// try to calculate td by nl/f
real_td = len * nl / f;
}else if (L != NOT_INPUT && C != NOT_INPUT) {
untested();
real_td = len * sqrt(L * C);
}else if (real_td == NOT_INPUT) {
untested();
cmd.warn(bDANGER, 0, "can't determine length");
}else{
untested();
}}
{if (z0 != NOT_INPUT) {
real_z0 = z0;
if (L != NOT_INPUT && C != NOT_INPUT) {
untested();
cmd.warn(bDANGER, 0, "redundant specification both Z0 and LC, using Z0");
}
}else{
{if (L != NOT_INPUT && C != NOT_INPUT) {
untested();
real_z0 = sqrt(L / C);
}else{
assert(default_z0 == 50.);
cmd.warn(bDANGER, 0, "can't determine Z0, assuming 50");
real_z0 = default_z0;
}}
}}
}
/*--------------------------------------------------------------------------*/
void COMMON_TRANSLINE::print(OMSTREAM& o)const
{
o.setfloatwidth(7);
if (len != 1.)
o << " len=" << len;
if (R != 0.)
o << " R=" << R;
if (L != NOT_INPUT)
o << " L=" << L;
if (G != 0.)
o << " G=" << G;
if (C != NOT_INPUT)
o << " C=" << C;
if (z0 != NOT_INPUT)
o << " Z0=" << z0;
if (td != NOT_INPUT)
o << " TD=" << td;
if (f != NOT_INPUT)
o << " F=" << f;
if (nl != default_nl)
o << " NL=" << nl;
if (icset) {
untested();
o << " IC=";
for (int i = 0; i < NUM_INIT_COND; ++i) {
untested();
o << ic[i] << ' ';
}
}
o << '\n';
}
/*--------------------------------------------------------------------------*/
DEV_TRANSLINE::DEV_TRANSLINE()
:ELEMENT(),
_forward(), _reflect(),
_if0(0), _ir0(0), _if1(0), _ir1(0),
_y11(), _y12()
{
attach_common(&Default_TRANSLINE);
}
/*--------------------------------------------------------------------------*/
void DEV_TRANSLINE::parse(CS& cmd)
{
assert(has_common());
COMMON_TRANSLINE* c = prechecked_cast<COMMON_TRANSLINE*>(common()->clone());
assert(c);
parse_Label(cmd);
parse_nodes(cmd, max_nodes(), min_nodes());
c->parse(cmd);
attach_common(c);
set_converged();
}
/*--------------------------------------------------------------------------*/
void DEV_TRANSLINE::print(OMSTREAM& o, int)const
{
const COMMON_TRANSLINE*c=prechecked_cast<const COMMON_TRANSLINE*>(common());
assert(c);
o << short_label();
printnodes(o);
c->print(o);
}
/*--------------------------------------------------------------------------*/
void DEV_TRANSLINE::precalc()
{
const COMMON_TRANSLINE* c=prechecked_cast<const COMMON_TRANSLINE*>(common());
assert(c);
_forward.set_delay(c->real_td);
_reflect.set_delay(c->real_td);
}
/*--------------------------------------------------------------------------*/
void DEV_TRANSLINE::tr_alloc_matrix()
{
extern NODE* nstat; // yuck
aa.iwant(_n[OUT1].m_(),_n[OUT2].m_());
aa.iwant(_n[IN1].m_(), _n[IN2].m_());
lu.iwant(_n[OUT1].m_(),_n[OUT2].m_());
lu.iwant(_n[IN1].m_(), _n[IN2].m_());
nstat[_n[OUT1].m_()].set_needs_analog();
nstat[_n[OUT2].m_()].set_needs_analog();
nstat[_n[IN1].m_()].set_needs_analog();
nstat[_n[IN2].m_()].set_needs_analog();
}
/*--------------------------------------------------------------------------*/
/* first setup, initial dc, empty the lines
*/
void DEV_TRANSLINE::tr_begin()
{
_forward.initialize();
_reflect.initialize();
}
/*--------------------------------------------------------------------------*/
/* before anything else .. see what is coming out
*/
void DEV_TRANSLINE::tr_advance()
{
const COMMON_TRANSLINE* c=prechecked_cast<const COMMON_TRANSLINE*>(common());
assert(c);
_if0 = _forward.v_out(SIM::time0)/c->real_z0;
_ir0 = _reflect.v_out(SIM::time0)/c->real_z0;
}
/*--------------------------------------------------------------------------*/
/* usually nothing, always converged. It is all done in advance and accept.
* UNLESS ... it is a very short line .. then we fake it here.
* very short line means delay is less than internal time step.
*/
bool DEV_TRANSLINE::do_tr()
{
// code to deal with short lines goes here.
//{if (_if0 != _if1 || _ir0 != _ir1) {
{if (!conchk(_if0, _if1, OPT::abstol, OPT::reltol*.01)
|| !conchk(_ir0, _ir1, OPT::abstol, OPT::reltol*.01)) {
q_load();
}else{
//untested();
}}
assert(converged());
return true;
}
/*--------------------------------------------------------------------------*/
void DEV_TRANSLINE::tr_load()
{
double lvf = NOT_VALID; // load value, forward
double lvr = NOT_VALID; // load value, reflected
{if (!SIM::inc_mode) {
const COMMON_TRANSLINE*
c = prechecked_cast<const COMMON_TRANSLINE*>(common());
assert(c);
aa.load_symmetric(_n[OUT1].m_(), _n[OUT2].m_(), 1/c->real_z0);
aa.load_symmetric(_n[IN1].m_(), _n[IN2].m_(), 1/c->real_z0);
lvf = _if0;
lvr = _ir0;
}else{
lvf = dn_diff(_if0, _if1);
lvr = dn_diff(_ir0, _ir1);
}}
if (lvf != 0.) {
{if (_n[OUT1].m_() != 0) {
_n[OUT1].i() += lvf;
}else{
untested();
}}
if (_n[OUT2].m_() != 0) {
_n[OUT2].i() -= lvf;
}
}
if (lvr != 0.) {
{if (_n[IN1].m_() != 0) {
_n[IN1].i() += lvr;
}else{
untested();
}}
if (_n[IN2].m_() != 0) {
untested();
_n[IN2].i() -= lvr;
}
}
_if1 = _if0;
_ir1 = _ir0;
}
/*--------------------------------------------------------------------------*/
/* limit the time step to no larger than a line length.
*/
double DEV_TRANSLINE::tr_review()
{
q_accept();
const COMMON_TRANSLINE* c=prechecked_cast<const COMMON_TRANSLINE*>(common());
assert(c);
return SIM::time0 + c->real_td; // ok to miss the spikes, for now
}
/*--------------------------------------------------------------------------*/
/* after this step is all done, determine the reflections and send them on.
*/
void DEV_TRANSLINE::tr_accept()
{
_reflect.push(SIM::time0, _forward.v_reflect(SIM::time0, tr_outvolts()));
_forward.push(SIM::time0, _reflect.v_reflect(SIM::time0, tr_involts()));
}
/*--------------------------------------------------------------------------*/
void DEV_TRANSLINE::tr_unload()
{
untested();
}
/*--------------------------------------------------------------------------*/
void DEV_TRANSLINE::do_ac()
{
const COMMON_TRANSLINE*c=prechecked_cast<const COMMON_TRANSLINE*>(common());
assert(c);
double lenth = SIM::freq * c->real_td * 4; /* length in quarter waves */
double dif = lenth - floor(lenth+.5); /* avoid divide by zero if close to */
if (std::abs(dif) < LINLENTOL) { /* resonance by tweeking a little */
error(bDEBUG,
long_label() + ": transmission line too close to resonance\n");
lenth = (dif<0.) ? floor(lenth+.5)-LINLENTOL : floor(lenth+.5)+LINLENTOL;
}
lenth *= (kPId2); /* now in radians */
_y12 = COMPLEX(0., -1. / (c->real_z0 * sin(lenth)));
_y11 = COMPLEX(0., tan(lenth/2) / c->real_z0) + _y12;
ac_load();
}
/*--------------------------------------------------------------------------*/
void DEV_TRANSLINE::ac_load()
{
acx.load_symmetric(_n[OUT1].m_(), _n[OUT2].m_(), _y11);
acx.load_symmetric(_n[IN1].m_(), _n[IN2].m_(), _y11);
acx.load_asymmetric(_n[OUT1].m_(),_n[OUT2].m_(), _n[IN2].m_(), _n[IN1].m_(), _y12);
acx.load_asymmetric(_n[IN1].m_(), _n[IN2].m_(), _n[OUT2].m_(), _n[OUT1].m_(), _y12);
}
/*--------------------------------------------------------------------------*/
/*--------------------------------------------------------------------------*/
Generated by Doxygen 1.6.0 Back to index
|
{
"url": "http://gnucap.sourcearchive.com/documentation/0.34/d__trln_8cc-source.html",
"source_domain": "gnucap.sourcearchive.com",
"snapshot_id": "crawl=CC-MAIN-2018-09",
"warc_metadata": {
"Content-Length": "23004",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WSPYGHHXDEOW5YST56EAL4QNPHSBJECV",
"WARC-Concurrent-To": "<urn:uuid:de3aa1d1-00fd-4b9d-82a0-00ed879c826d>",
"WARC-Date": "2018-02-24T13:42:31Z",
"WARC-IP-Address": "5.9.86.18",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:6BT3KIOZZYVWC6Q3WKXCJHQMIJ7BZ4ZC",
"WARC-Record-ID": "<urn:uuid:894829e2-eec4-430c-804c-e689c40fdf7e>",
"WARC-Target-URI": "http://gnucap.sourcearchive.com/documentation/0.34/d__trln_8cc-source.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c80136b5-fb35-421d-9fe4-aa85b04ac76b>"
},
"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,
33,
92,
93,
103,
104,
169,
204,
247,
250,
317,
320,
392,
464,
535,
557,
560,
627,
693,
758,
806,
809,
878,
941,
1002,
1022,
1091,
1131,
1135,
1151,
1171,
1250,
1284,
1316,
1346,
1384,
1438,
1517,
1559,
1583,
1606,
1629,
1641,
1651,
1668,
1678,
1695,
1713,
1731,
1748,
1767,
1783,
1785,
1831,
1847,
1851,
1853,
1932,
1994,
2018,
2041,
2064,
2079,
2090,
2101,
2112,
2123,
2136,
2149,
2160,
2173,
2191,
2193,
2239,
2260,
2264,
2266,
2345,
2411,
2413,
2486,
2500,
2529,
2558,
2583,
2600,
2617,
2637,
2649,
2692,
2723,
2730,
2734,
2747,
2749,
2828,
2866,
2868,
2895,
2901,
2907,
2939,
2971,
3001,
3031,
3061,
3091,
3122,
3153,
3184,
3215,
3257,
3299,
3307,
3335,
3353,
3373,
3423,
3441,
3467,
3475,
3481,
3525,
3564,
3565,
3591,
3615,
3653,
3679,
3723,
3741,
3801,
3814,
3832,
3841,
3847,
3877,
3912,
3946,
3994,
4010,
4043,
4079,
4095,
4147,
4156,
4172,
4177,
4178,
4204,
4222,
4266,
4284,
4364,
4370,
4379,
4424,
4442,
4471,
4482,
4515,
4578,
4606,
4613,
4618,
4620,
4699,
4746,
4748,
4770,
4787,
4813,
4828,
4850,
4872,
4894,
4909,
4931,
4953,
4975,
4998,
5022,
5045,
5069,
5091,
5114,
5138,
5162,
5177,
5193,
5211,
5259,
5277,
5302,
5308,
5312,
5325,
5327,
5406,
5437,
5451,
5478,
5517,
5535,
5537,
5574,
5576,
5655,
5690,
5692,
5716,
5795,
5808,
5809,
5829,
5875,
5892,
5912,
5931,
5933,
6012,
6061,
6063,
6142,
6155,
6156,
6178,
6195,
6210,
6212,
6291,
6321,
6323,
6403,
6416,
6450,
6484,
6486,
6565,
6603,
6605,
6635,
6638,
6679,
6719,
6760,
6800,
6801,
6844,
6887,
6929,
6971,
6973,
7052,
7096,
7100,
7131,
7133,
7158,
7183,
7185,
7264,
7314,
7318,
7351,
7353,
7433,
7446,
7494,
7542,
7544,
7623,
7700,
7763,
7827,
7831,
7859,
7861,
7907,
7950,
8007,
8070,
8084,
8093,
8111,
8116,
8139,
8154,
8156,
8235,
8265,
8267,
8316,
8367,
8392,
8421,
8483,
8498,
8565,
8632,
8648,
8664,
8673,
8704,
8735,
8740,
8759,
8790,
8817,
8828,
8846,
8853,
8883,
8910,
8916,
8920,
8939,
8969,
8995,
9006,
9024,
9031,
9060,
9078,
9104,
9110,
9114,
9129,
9144,
9146,
9225,
9281,
9285,
9319,
9321,
9335,
9415,
9428,
9496,
9498,
9577,
9653,
9657,
9689,
9691,
9767,
9842,
9844,
9923,
9955,
9957,
9971,
9973,
10052,
10080,
10082,
10161,
10174,
10250,
10331,
10404,
10422,
10494,
10572,
10576,
10621,
10624,
10679,
10735,
10748,
10750,
10829,
10859,
10861,
10919,
10977,
11065,
11153,
11155,
11234,
11313,
11314
],
"line_end_idx": [
33,
92,
93,
103,
104,
169,
204,
247,
250,
317,
320,
392,
464,
535,
557,
560,
627,
693,
758,
806,
809,
878,
941,
1002,
1022,
1091,
1131,
1135,
1151,
1171,
1250,
1284,
1316,
1346,
1384,
1438,
1517,
1559,
1583,
1606,
1629,
1641,
1651,
1668,
1678,
1695,
1713,
1731,
1748,
1767,
1783,
1785,
1831,
1847,
1851,
1853,
1932,
1994,
2018,
2041,
2064,
2079,
2090,
2101,
2112,
2123,
2136,
2149,
2160,
2173,
2191,
2193,
2239,
2260,
2264,
2266,
2345,
2411,
2413,
2486,
2500,
2529,
2558,
2583,
2600,
2617,
2637,
2649,
2692,
2723,
2730,
2734,
2747,
2749,
2828,
2866,
2868,
2895,
2901,
2907,
2939,
2971,
3001,
3031,
3061,
3091,
3122,
3153,
3184,
3215,
3257,
3299,
3307,
3335,
3353,
3373,
3423,
3441,
3467,
3475,
3481,
3525,
3564,
3565,
3591,
3615,
3653,
3679,
3723,
3741,
3801,
3814,
3832,
3841,
3847,
3877,
3912,
3946,
3994,
4010,
4043,
4079,
4095,
4147,
4156,
4172,
4177,
4178,
4204,
4222,
4266,
4284,
4364,
4370,
4379,
4424,
4442,
4471,
4482,
4515,
4578,
4606,
4613,
4618,
4620,
4699,
4746,
4748,
4770,
4787,
4813,
4828,
4850,
4872,
4894,
4909,
4931,
4953,
4975,
4998,
5022,
5045,
5069,
5091,
5114,
5138,
5162,
5177,
5193,
5211,
5259,
5277,
5302,
5308,
5312,
5325,
5327,
5406,
5437,
5451,
5478,
5517,
5535,
5537,
5574,
5576,
5655,
5690,
5692,
5716,
5795,
5808,
5809,
5829,
5875,
5892,
5912,
5931,
5933,
6012,
6061,
6063,
6142,
6155,
6156,
6178,
6195,
6210,
6212,
6291,
6321,
6323,
6403,
6416,
6450,
6484,
6486,
6565,
6603,
6605,
6635,
6638,
6679,
6719,
6760,
6800,
6801,
6844,
6887,
6929,
6971,
6973,
7052,
7096,
7100,
7131,
7133,
7158,
7183,
7185,
7264,
7314,
7318,
7351,
7353,
7433,
7446,
7494,
7542,
7544,
7623,
7700,
7763,
7827,
7831,
7859,
7861,
7907,
7950,
8007,
8070,
8084,
8093,
8111,
8116,
8139,
8154,
8156,
8235,
8265,
8267,
8316,
8367,
8392,
8421,
8483,
8498,
8565,
8632,
8648,
8664,
8673,
8704,
8735,
8740,
8759,
8790,
8817,
8828,
8846,
8853,
8883,
8910,
8916,
8920,
8939,
8969,
8995,
9006,
9024,
9031,
9060,
9078,
9104,
9110,
9114,
9129,
9144,
9146,
9225,
9281,
9285,
9319,
9321,
9335,
9415,
9428,
9496,
9498,
9577,
9653,
9657,
9689,
9691,
9767,
9842,
9844,
9923,
9955,
9957,
9971,
9973,
10052,
10080,
10082,
10161,
10174,
10250,
10331,
10404,
10422,
10494,
10572,
10576,
10621,
10624,
10679,
10735,
10748,
10750,
10829,
10859,
10861,
10919,
10977,
11065,
11153,
11155,
11234,
11313,
11314,
11357
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 11357,
"ccnet_original_nlines": 381,
"rps_doc_curly_bracket": 0.011270579881966114,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.12855979800224304,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.08584214746952057,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5207485556602478,
"rps_doc_frac_unique_words": 0.4738636314868927,
"rps_doc_mean_word_length": 6.0625,
"rps_doc_num_sentences": 167,
"rps_doc_symbol_to_word_ratio": 0.001220499980263412,
"rps_doc_unigram_entropy": 5.537932395935059,
"rps_doc_word_count": 880,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.09072165191173553,
"rps_doc_frac_chars_dupe_6grams": 0.047610118985176086,
"rps_doc_frac_chars_dupe_7grams": 0.031865041702985764,
"rps_doc_frac_chars_dupe_8grams": 0.019868789240717888,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.031490158289670944,
"rps_doc_frac_chars_top_3gram": 0.0052483598701655865,
"rps_doc_frac_chars_top_4gram": 0.005998129956424236,
"rps_doc_books_importance": -1098.014404296875,
"rps_doc_books_importance_length_correction": -1098.014404296875,
"rps_doc_openwebtext_importance": -571.2670288085938,
"rps_doc_openwebtext_importance_length_correction": -571.2670288085938,
"rps_doc_wikipedia_importance": -471.54229736328125,
"rps_doc_wikipedia_importance_length_correction": -471.54229736328125
},
"fasttext": {
"dclm": 0.8730735778808594,
"english": 0.25170499086380005,
"fineweb_edu_approx": 2.0865113735198975,
"eai_general_math": 0.7691999673843384,
"eai_open_web_math": 0.12807351350784302,
"eai_web_code": 0.12925046682357788
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "621.317",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
},
"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": "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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
7,190,759,050,379,155,000 |
Bowfins are amazing fish from the eastern side of North America.
They are the only surviving species of Amiiform, an order of fish that was once widespread across the world during the Jurassic period.
The Bowfin is their final representative, stalking through dark and dingy waters in search of fish and crustaceans to catch with their sharp teeth.
They can breathe air if they need to, which allows them to tolerate oxygen-deprived waters and probably survive on land for a few days.
One of the coolest things about them is that the males look after their eggs and larvae for several weeks. The tiny babies swim around in a school and their Pappy hangs around to make sure nothing bad happens.
…Images: Phil’s 1stPix/Uncle Chicken
Japetella is a genus containing one or two species of entirely pelagic octopods. They spend their whole life swimming in the ocean’s mesopelagic zone, surrounded by twilight gloom.
They tend to be entirely transparent so that they cast no shadow that could be seen by sharp-eyed predators. But when bioluminescence strikes them, they instantly become a red-brown colour so as to disappear into the darkness.
In happier times, females develop a ring of photophores around the mouth to attract males. It’s light-up lipstick!
…Images: NOAA/MBARI/Sarah Zylinski, Duke University/Michael Vecchione
This is surely the weirdest sea cucumber in the world!
Pelagothuria natatrix is, as far as anyone knows, the world’s only fully pelagic echinoderm. That means they spend their entire lives swimming through the sea and need never descend to the sea floor.
They live in the deep sea and get around by pulsing their umbrella, much like a jellyfish.
In the middle of the umbrella is their mouth, facing straight upward, and surrounded by oral tentacles that capture food from the water.
The body meanwhile simply dangles beneath.
The entire internet has almost ZERO photos of this thing! Someone needs to start a petition…
|
{
"url": "http://realmonstrosities.tumblr.com/tagged/animals/page/4",
"source_domain": "realmonstrosities.tumblr.com",
"snapshot_id": "crawl=CC-MAIN-2014-42",
"warc_metadata": {
"Content-Length": "129016",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:36KAXP44TEWKNQI72ZJ52XPI7JQEYDG7",
"WARC-Concurrent-To": "<urn:uuid:b8a7407d-d8f6-44da-a1d2-0f6add5ee700>",
"WARC-Date": "2014-10-20T09:38:01Z",
"WARC-IP-Address": "66.6.41.21",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:6T262YICWVFWKHLVZRFTTSSPKVV3AQLY",
"WARC-Record-ID": "<urn:uuid:a610139a-c73d-45b8-94fd-8a7284e8f56b>",
"WARC-Target-URI": "http://realmonstrosities.tumblr.com/tagged/animals/page/4",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a7c82622-2d14-4ec3-9f49-a80f6bbac9bc>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-16-133-185.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2014-42\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for October 2014\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
65,
66,
202,
203,
351,
352,
488,
489,
699,
700,
737,
738,
919,
920,
1147,
1148,
1263,
1264,
1334,
1335,
1390,
1391,
1591,
1592,
1683,
1684,
1821,
1822,
1865,
1866
],
"line_end_idx": [
65,
66,
202,
203,
351,
352,
488,
489,
699,
700,
737,
738,
919,
920,
1147,
1148,
1263,
1264,
1334,
1335,
1390,
1391,
1591,
1592,
1683,
1684,
1821,
1822,
1865,
1866,
1958
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1958,
"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.41952505707740784,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00791557040065527,
"rps_doc_frac_lines_end_with_ellipsis": 0.032258059829473495,
"rps_doc_frac_no_alph_words": 0.12664908170700073,
"rps_doc_frac_unique_words": 0.6269592642784119,
"rps_doc_mean_word_length": 4.965517044067383,
"rps_doc_num_sentences": 20,
"rps_doc_symbol_to_word_ratio": 0.00791557040065527,
"rps_doc_unigram_entropy": 4.925847053527832,
"rps_doc_word_count": 319,
"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.012626259587705135,
"rps_doc_frac_chars_top_3gram": 0.01767677068710327,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -151.93101501464844,
"rps_doc_books_importance_length_correction": -151.93101501464844,
"rps_doc_openwebtext_importance": -84.78567504882812,
"rps_doc_openwebtext_importance_length_correction": -84.78567504882812,
"rps_doc_wikipedia_importance": -53.38764572143555,
"rps_doc_wikipedia_importance_length_correction": -53.38764572143555
},
"fasttext": {
"dclm": 0.7015321850776672,
"english": 0.9650435447692871,
"fineweb_edu_approx": 3.175584554672241,
"eai_general_math": 0.07067794352769852,
"eai_open_web_math": 0.204170823097229,
"eai_web_code": 0.013843479566276073
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "597.3",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Zoology",
"level_3": "Fishes, Amphibians, and Reptiles"
}
},
"secondary": {
"code": "591.4",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Zoology",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "1",
"label": "Remember"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "12",
"label": "Listicle"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
610,685,640,960,652,800 |
Self-care is becoming increasingly popular for hair, skin and overall body wellness, but many people forget their eyes deserve care too. Eye health is often an afterthought for most people except when their annual eye exam comes around. Even then, however, many people skip this essential doctor’s visit unless they think something is wrong.
In addition to attending the eye doctor every year for annual checkups, you can follow certain steps to protect your eyes and support their health.
Steps for Keeping Your Eyes Healthy
A routine for eye health should be an important part of your life to ensure your eyes stay well as you age. Having good habits can mitigate or prevent the potential development of harmful diseases that can lead to partial or full vision loss.
The following are some steps on how to take care of your eyes:
1. Eat a Healthy Diet
Eating well is a staple of almost all healthy living habits — it’s the foundation for practically all health advice, as food fuels our bodies every day. Therefore, what we eat and drink naturally impacts our eye health. Primarily, getting enough water is one of the best ways to take care of your eyes daily. Tears are lubrication for your eyes, and they help keep your eyes moist and remove bacteria and other particles. Adequate water intake is also essential to maintaining healthy tear production.
According to the American Optometric Association, these antioxidants are the best for your eyes:
• Lutein and zeaxanthin: Found in colorful foods like leafy greens, corn, peas and tangerines, these nutrients can help prevent chronic eye diseases and cataracts.
• Vitamin C: In addition to being an immune booster, Vitamin C helps prevent cataracts and may even help fight macular degeneration. Citrus fruits like grapefruit and oranges are great sources of Vitamin C.
• Vitamin E: Vitamin E can help fight harmful molecules called free radicals, which attack healthy tissues. Sweet potatoes and nuts are great sources of Vitamin E.
• Omega-3 fatty acids: Already a source of protection for the cardiovascular system, omega-3 fatty acids are also great for eye health. You can eat tuna, salmon or other coldwater fish to get your dosage or take omega-3 pills as an eye health supplement.
• Zinc: Zinc acts as a transporter to bring essential vitamins from the liver to the retina. You can find zinc in red meats, shellfish and nuts or seeds.
2. Stop Smoking
Smoking has been proven to lead to some serious health consequences, such as cancer, heart disease and lung disease. But did you know it also impacts your eye health? Studies have shown that smoking can contribute to a condition called Dry Eye Syndrome, which means the tear ducts cannot produce enough tears to properly lubricate the eyes. In addition to discomfort, this syndrome can lead to blurry vision and light sensitivity, which can seriously impact activities like driving.
Furthermore, smoking can lead to much more harmful consequences for your eyes. Research has found a link between smoking and harmful conditions such as:
• Age-related macular degeneration.
• Vision loss.
• Cataracts.
• Glaucoma.
• Diabetic retinopathy.
One way to protect your eye health is to quit smoking, but many people struggle with quitting for a long time. However, even if you’ve tried to quit unsuccessfully in the past, the more times you try increases the likelihood of success.
3. Wear UV Protective Sunglasses
The sun’s UV rays are powerful and can impact our skin and eyes even on cloudy days. Wearing proper eye protection when you spend time outdoors can protect your eyes from sun damage, which can cause vision loss and other conditions. When looking for sunglasses, choose options with 99%-100% UVA and UVB protective coatings. These glasses should block almost all UV rays from the sun.
Getting too much exposure to the sun can cause short-term issues like sunburn to your cornea, which results in pain and sensitivity to light. Long-term exposure can cause a condition called solar retinopathy, which means there is extensive damage to your retinal tissue. Because the retina doesn’t feel pain, many people won’t know they have sun-related eye damage until a few days or weeks later, when they experience a blur or spots in their vision.
4. Wear Safety Goggles
Safety goggles are an important protective element for many activities. Certain jobs, hobbies and sports require safety goggles to protect the eyes from harm. If you work in a lab setting, play certain sports or operate heavy machinery, you should wear safety goggles to prevent particles from getting in your eyes or equipment from harming your eyes.
While projectiles and other objects are a threat to your eye health, certain gasses and liquids can also cause eye irritation. If you are painting with liquid or especially spray paint, wear protective glasses to prevent fumes or droplets from getting in your eyes. Additionally, wear properly fitting goggles when swimming to keep your eyes free of chlorine or salt.
If you work with any crafts such as resin, or you’re in the beauty industry and deal with strong chemicals and fine particles, wear safety goggles to protect your eyes from irritants.
5. Be Careful About Screen Time
More people are spending upward of 17 hours a day looking at different screens. From phones to televisions to laptops, the average person will spend most of their day looking at a screen of some sort. Be cognizant of your screen time and engage in practices that can help mitigate asthenopia, or eyestrain, and headaches.
If you are looking at a screen for an extended period, be sure to periodically look away and at your surroundings. A good rule of thumb is to focus your eyes on something 20 feet away for 20 seconds every 20 minutes. Changing the perspective at which your eyes see can help reduce strain and prevent headaches.
Additionally, best practices to prevent digital eyestrain are to keep the screen an appropriate distance from your eyes and avoid glare on the screen as much as possible.
6. Avoid Touching Your Eyes
Not all eye diseases are congenital. Some come from environmental factors, such as conjunctivitis — or pinkeye as it’s more commonly known. The causes of pinkeye are often a bacterial or viral infection that irritates the conjunctiva or whites of your eyes. This disease is extremely contagious and is especially prevalent in younger children who may not have good hand-washing habits. However, anyone can get conjunctivitis.
The best thing to do to avoid eye infection or disease is to avoid touching your eyes altogether. If you suffer from dry, itchy eyes from allergies, thoroughly wash your hands before touching your eyes. Carrying around eye drops may also help prevent the issue altogether.
7. Get Comprehensive Eye Exams
The most important step you can take to prevent damage and maintain your eye health is to go to the eye doctor at least once a year. A doctor’s visit can help you prevent eyestrain by checking if your glasses or contacts prescription has changed over the year. If you continue using the wrong prescription, you could experience eyestrain and headaches.
Eye doctors also check for diseases like glaucoma, which often has no apparent symptoms, and can address any issues you may have, such as dry, itchy eyes, pain or soreness.
Eye Care Tips
Keeping in mind the important steps you can take every day to maintain your eye health, here are some more specific tips on how to care for the eyes at different stages of life.
For Children
Vision is an essential factor in how infants and toddlers interact with the world. Mothers can protect their children’s eye health by eating healthy foods during pregnancy, and parents can take additional steps to protect their child’s eye health, such as:
• Offering nutritious foods rich in vitamins and antioxidants.
• Providing eye health vitamins like omega-3 fatty acids.
• Dressing their kids with UV protective glasses when outdoors.
• Buying age-appropriate toys without sharp edges.
• Playing games that promote visual development.
Certain activities and games can help a child’s visual development:
• Birth to four months: Hold objects 8 to 10 inches from your child’s face and allow them to focus their eyes on the item. This practice will help stimulate visual cues and let children practice focusing their eyes on particular objects.
• Five to eight months: Small wooden blocks and other toys, in addition to floor play, can help babies at this age develop hand-eye coordination and depth perception.
• Nine to 12 months: Reading books and playing hide-and-seek games are great ways to stimulate the development of visual memory.
Furthermore, teaching children healthy practices when using tablets and screens will help prevent eyestrain and headaches. Natural light is also important for children’s eye development, so getting them off screens and outside is good for their eye health.
For older children and teenagers, regular eye exams are important to track any conditions or vision loss that might cause the need for glasses or contacts. Additionally, it’s important to encourage children to wear the proper eye protection during sports to avoid eye injuries.
For Adults
Adults also need to maintain good eye health to avoid developing degenerative conditions later in life. Eating a balanced diet with plenty of nutrients and vitamins is an essential aspect of maintaining good eye health, as is wearing protective eye gear whenever going outside for prolonged periods. Doing so protects from UVA and UVB rays. Wear safety goggles whenever performing risky activities, such as handling hazardous items at the workplace and doing sports.
Diabetes can lead to a condition called diabetic retinopathy, which is the leading cause of blindness in adults ages 20 to 74. To avoid developing this condition, adults with diabetes should get comprehensive eye exams with dilation every year. Preventative care and early detection can significantly decrease a person’s risk of vision loss due to diabetes.
For Older Adults
Preventative care is one of the best ways to maintain eye health as you age. For older adults, habits like eating right, getting exercise, wearing protective sunglasses outside and always wearing the correct prescription eyeglasses can help maintain good eye health. Furthermore, ensure you have good lighting in your house to prevent eyestrain.
For some older adults who have certain health conditions that affect the eyes, macular degeneration or vision loss can be a scary symptom. While there is no cure for macular degeneration, some medicines and procedures can significantly impede the progression of the disease.
Older adults should still schedule annual eye exams, and your doctor’s visit should include testing for age-related macular degeneration.
For Contacts Wearers
If you wear contacts, you need to have a special regimen to ensure your eyes remain healthy. Contacts are a convenient and comfortable option for many, but they require upkeep and responsibility, so they aren’t the best choice for young children. To maintain proper eye health while wearing contacts, follow these essential rules:
• Wash your hands before handling your contacts or touching your eyes.
• Be gentle with your eyes as you insert and remove your contacts.
• Never sleep in your contacts.
• Always change your contacts at the appropriate time — generally daily, bi-weekly or monthly.
Improper storage or handling of your contacts can lead to health conditions like corneal ulcers, conjunctivitis and other infections. Furthermore, particles in the contact can lead to scratches on the eye that can become irritated when rubbed.
The Importance of Regular Eye Tests
Regular eye tests are essential for people of all ages to prevent or track the onset of certain conditions that could impact your vision. They also provide an important touchpoint to gauge a person’s relative eye health over the years. Many people suffer from eyestrain and headaches only to discover the solution to their problems is that they need glasses.
While most people discover they need glasses around the ages of six to 12, some adults can develop the need for full-time or reading glasses as they age. Attending your yearly eye test can help ensure you’re using the right prescription and type of glasses lens or contact lens.
Since diseases like glaucoma don’t have noticeable symptoms, getting your eyes checked every year is vital to catching and diagnosing problems early. You should also go to the eye doctor should you experience any sudden changes or abnormalities in your vision, such as spots, blurred vision or chronic dry eyes.
Shop for Lenses With Lensabl
Having quality glasses and contact lenses can help support eye health by improving vision and decreasing eyestrain and headaches. As a one-stop-online shop for all your optical needs, Lensabl can provide the best contact lenses on the market and quality glasses lenses for your favorite frames.
With Lensabl, you can sign up for a vision plan, order contacts, frames or replacement lenses and renew your prescriptions from your laptop or smartphone. The convenience of ordering is beaten only by the cost savings you’ll enjoy by choosing Lensabl.
Have any more questions about our products or services? Contact us or check out our FAQ page for the answers you need!
Leave a Reply
Your email address will not be published.
|
{
"url": "https://www.lensabl.com/blog/how-to-keep-your-eyes-healthy/",
"source_domain": "www.lensabl.com",
"snapshot_id": "crawl=CC-MAIN-2022-49",
"warc_metadata": {
"Content-Length": "117713",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NCYLVUB3UUPLBEJNUOS2DHOUZZ4H6HNE",
"WARC-Concurrent-To": "<urn:uuid:bf25d4f5-d929-4063-ad59-f3afa92eb800>",
"WARC-Date": "2022-12-08T05:32:12Z",
"WARC-IP-Address": "18.154.227.51",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:73DMOWJ3AJ3F4AIX2CDDNERTUUFHRXIF",
"WARC-Record-ID": "<urn:uuid:5c0b89e2-cb89-4e54-9d02-30923c4bbc25>",
"WARC-Target-URI": "https://www.lensabl.com/blog/how-to-keep-your-eyes-healthy/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a17da124-674a-45ec-bb84-d9fa02ba4dac>"
},
"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-125\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,
342,
343,
491,
492,
528,
529,
773,
774,
837,
839,
840,
862,
863,
1365,
1366,
1463,
1465,
1466,
1632,
1841,
2007,
2264,
2420,
2421,
2422,
2439,
2440,
2923,
2924,
3077,
3078,
3116,
3133,
3148,
3162,
3188,
3189,
3427,
3428,
3429,
3462,
3463,
3847,
3848,
4300,
4301,
4324,
4325,
4677,
4678,
5047,
5048,
5233,
5234,
5266,
5267,
5590,
5591,
5903,
5904,
6075,
6076,
6104,
6105,
6532,
6533,
6807,
6808,
6839,
6840,
7194,
7195,
7369,
7370,
7384,
7385,
7564,
7565,
7578,
7579,
7836,
7837,
7903,
7963,
8029,
8083,
8134,
8135,
8203,
8204,
8444,
8613,
8744,
8745,
9002,
9003,
9281,
9283,
9284,
9295,
9296,
9763,
9764,
10122,
10123,
10140,
10141,
10487,
10488,
10763,
10764,
10903,
10904,
10925,
10926,
11257,
11258,
11331,
11400,
11434,
11531,
11532,
11776,
11777,
11813,
11814,
12174,
12175,
12454,
12455,
12767,
12768,
12797,
12798,
13093,
13094,
13346,
13347,
13467,
13468,
13482,
13483
],
"line_end_idx": [
342,
343,
491,
492,
528,
529,
773,
774,
837,
839,
840,
862,
863,
1365,
1366,
1463,
1465,
1466,
1632,
1841,
2007,
2264,
2420,
2421,
2422,
2439,
2440,
2923,
2924,
3077,
3078,
3116,
3133,
3148,
3162,
3188,
3189,
3427,
3428,
3429,
3462,
3463,
3847,
3848,
4300,
4301,
4324,
4325,
4677,
4678,
5047,
5048,
5233,
5234,
5266,
5267,
5590,
5591,
5903,
5904,
6075,
6076,
6104,
6105,
6532,
6533,
6807,
6808,
6839,
6840,
7194,
7195,
7369,
7370,
7384,
7385,
7564,
7565,
7578,
7579,
7836,
7837,
7903,
7963,
8029,
8083,
8134,
8135,
8203,
8204,
8444,
8613,
8744,
8745,
9002,
9003,
9281,
9283,
9284,
9295,
9296,
9763,
9764,
10122,
10123,
10140,
10141,
10487,
10488,
10763,
10764,
10903,
10904,
10925,
10926,
11257,
11258,
11331,
11400,
11434,
11531,
11532,
11776,
11777,
11813,
11814,
12174,
12175,
12454,
12455,
12767,
12768,
12797,
12798,
13093,
13094,
13346,
13347,
13467,
13468,
13482,
13483,
13524
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 13524,
"ccnet_original_nlines": 142,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.39133891463279724,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00715136993676424,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12634088099002838,
"rps_doc_frac_unique_words": 0.3333333432674408,
"rps_doc_mean_word_length": 4.962358474731445,
"rps_doc_num_sentences": 122,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.76724910736084,
"rps_doc_word_count": 2205,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.021385490894317627,
"rps_doc_frac_chars_dupe_6grams": 0.007128499913960695,
"rps_doc_frac_chars_dupe_7grams": 0.0036556399427354336,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.019009320065379143,
"rps_doc_frac_chars_top_3gram": 0.004935109987854958,
"rps_doc_frac_chars_top_4gram": 0.003107290016487241,
"rps_doc_books_importance": -1072.0657958984375,
"rps_doc_books_importance_length_correction": -1072.0657958984375,
"rps_doc_openwebtext_importance": -607.6581420898438,
"rps_doc_openwebtext_importance_length_correction": -607.6581420898438,
"rps_doc_wikipedia_importance": -358.14227294921875,
"rps_doc_wikipedia_importance_length_correction": -358.14227294921875
},
"fasttext": {
"dclm": 0.12194191664457321,
"english": 0.9281954765319824,
"fineweb_edu_approx": 3.043973207473755,
"eai_general_math": 0.001128440024331212,
"eai_open_web_math": 0.10797374695539474,
"eai_web_code": 0.0004051300056744367
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "617.7",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Surgery and Dentistry"
}
},
"secondary": {
"code": "613.2",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Health and Hygiene"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
5,756,704,696,601,253,000 |
What's new
iphone 4 problem synch movies w/green tint
tvproducersm
New Member
Joined
Nov 4, 2010
Messages
1
Reaction score
0
Its the strangest thing... all my movies from DVD on my itunes folder, that work perfectly with my old iphone (prior to replacement with 4) and still work perfectly on my ipod will NOT play without a green tinted screen on my iphone 4.
Anyone have suggestions what to do?
Steve
Have you tried to re-convert the movies from the originals, into the proper format for the Retina screen resolution, 960x640dpi . It might make a difference.
hello,
just install VLC and your problem will be resolve !!!
Top
|
{
"url": "https://www.iphoneforums.net/threads/iphone-4-problem-synch-movies-w-green-tint.4829/",
"source_domain": "www.iphoneforums.net",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "71793",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QFVWL43DOQZNAAFCXRKRI3C4MR4HQ6RM",
"WARC-Concurrent-To": "<urn:uuid:d17d9280-d887-400e-a8a4-fe16d970fcf6>",
"WARC-Date": "2024-04-24T23:20:07Z",
"WARC-IP-Address": "104.21.39.143",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3JT2AVJQPTGS5M6U7DHGZZDT3DI4RUNL",
"WARC-Record-ID": "<urn:uuid:d82c5eb3-bd11-423f-aad1-3d3f74d5e7b4>",
"WARC-Target-URI": "https://www.iphoneforums.net/threads/iphone-4-problem-synch-movies-w-green-tint.4829/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ceaa0a74-9aaf-47c1-87bc-eb27b6ab41c3>"
},
"warc_info": "isPartOf: CC-MAIN-2024-18\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for April 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-230\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
11,
12,
55,
56,
69,
70,
81,
88,
100,
109,
111,
126,
128,
364,
365,
401,
402,
408,
410,
568,
570,
577,
578,
632,
634
],
"line_end_idx": [
11,
12,
55,
56,
69,
70,
81,
88,
100,
109,
111,
126,
128,
364,
365,
401,
402,
408,
410,
568,
570,
577,
578,
632,
634,
637
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 637,
"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.3700787425041199,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.023622050881385803,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18110236525535583,
"rps_doc_frac_unique_words": 0.7222222089767456,
"rps_doc_mean_word_length": 4.592592716217041,
"rps_doc_num_sentences": 7,
"rps_doc_symbol_to_word_ratio": 0.007874020375311375,
"rps_doc_unigram_entropy": 4.218500137329102,
"rps_doc_word_count": 108,
"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.024193549528717995,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -58.639427185058594,
"rps_doc_books_importance_length_correction": -69.67198181152344,
"rps_doc_openwebtext_importance": -30.80159568786621,
"rps_doc_openwebtext_importance_length_correction": -41.83415603637695,
"rps_doc_wikipedia_importance": -23.01473045349121,
"rps_doc_wikipedia_importance_length_correction": -34.04729080200195
},
"fasttext": {
"dclm": 0.03909606114029884,
"english": 0.9109659194946289,
"fineweb_edu_approx": 0.9415971040725708,
"eai_general_math": 0.0006841400172561407,
"eai_open_web_math": 0.051597241312265396,
"eai_web_code": 0.000014539999938278925
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "2",
"label": "Partially Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-5,333,116,977,277,521,000 |
Interesting facts on capillary blood glucose
When we were at school, we briefly learned about capillaries, veins, and arteries. The three major blood vessel types. It is only when you go to medical school that you learn more about these blood vessels. Unless you are a diabetic. Then you quickly become accustomed to the terms used when the doctor needs to check your blood glucose. This is mostly done via the capillary vessel with a glucometer. But let’s take a closer look at capillary blood glucose.
Venous vs Capillary blood glucose
A study was done where 20 patients above the age of 13 were enrolled. They did both a venous and capillary blood glucose test to measure the difference between the two. The venous blood glucose test was sent to the laboratory for testing, while the capillary blood glucose test was done with a glucometer. They found the laboratory venous blood glucose to be 7.075 mmol/l, while the capillary blood glucose was 7.66 mmol/l. This gave a difference between the two blood glucose measurements of 0.58 mmol/l.
The conclusion that they drew from this was that although the venous blood glucose and the capillary blood glucose levels had a marginal difference, they had to take into consideration the constant fluctuation of blood glucose levels. Thus came about the early intravenous cannula insertion. With this it enabled hospital staff to readily have available blood glucose testing, thus removing the need of constant finger prick samples.
Both venous and capillary blood glucose testing has been under question, debating on which one is better and more accurate. It was found that venous blood glucose testing was more accurate, and with the technology at the bedside of the patient, it cut out the need to constantly send samples to the laboratory. Disregarding that, the conclusion was that laboratory blood glucose testing was still the most accurate of all, and should be employed in extreme cases of long-term patients. To read more about this study, click on the link Capillary versus venous bedside blood glucose estimations | Emergency Medicine Journal (bmj.com)
Why do you wipe the first drop of blood?
This is a loaded question in the medical society. Do you wipe the first drop of blood with the testing strip, or do you use the second drop after wiping the first drop of blood away with a sterile piece of gauze? It is debatable, and up to each emergency department and doctor. Some may prefer to use the first drop of blood, while others will use the second drop of blood. A study done by Dr. Susan Fetzer showed that the effect of alcohol swabbing on capillary blood glucose measurements rendered a clinically insignificant difference, and thus showed that even if a 70% isopropyl alcohol swab is used, it is not necessary to wipe away the first drop of blood.
The use of alcohol swabbing on capillary blood glucose measurements are a standard for both private doctors as well as hospital doctors and hospital staff. This is especially true when an emergency patient comes in, where there is no time to set up a venous blood glucose measuring kit. This requires a simple swab and prick situation.
The reasoning behind swabbing the fingertip with an alcohol swab on capillary blood glucose measurements is quite simple; the sample may be altered by whatever is present on the fingertip. But still the controversy remains. Many do believe that the alcohol of the swab alters the results of the sample, while others argue that many patients cannot produce a second drop of blood. Since capillary blood glucose levels is extremely important to monitor critical patient care decisions, many has decided to forego the swabbing away of the first drop, and simply use it as the sample for the strip. The danger does remain that inaccurate capillary blood glucose values may lead to dangerous episodes of hyperglycaemia or hypoglycaemia.
For outpatients, the use of alcohol swabbing preparation pads are normally not used. They are simply instructed to thoroughly wash their hands before performing a capillary blood glucose values test. This is why it is so important for outpatients to keep an accurate account of their results, as this may indicate extreme differences in capillary blood glucose values if they are hospitalized.
In the same study, a group of 192 volunteers consented to two capillary blood glucose tests. All the participants were asked to thoroughly wash their hands. Thereafter one capillary blood glucose level was taken without further prepping of the finger, while the other finger was swabbed with an alcohol prep pad. The samples were taken within 2 minutes of each other. Their findings showed that the fingers prepped with an alcohol swab yielded results of 10.44 mg/dL lower than the fingers that were not prepped. This would ring bells as being clinically significant.
In another study done by the same team, 526 patients with type 1 and type 2 diabetes were selected for the study. They took capillary blood glucose sampling where the finger was prepped with an alcohol swab and dried before piercing the skin, then they took a sample where the second drop was taken, and finally they took a venous blood sample to be analysed in the laboratory. Of the three, they found no statistically significant differences in blood glucose readings. They concluded that the fact that the alcohol was allowed to dry before piercing the skin is what made a difference. Unfortunately this is not common practice amongst nursing practice. For more information on this study, please follow the link The Effect of Alcohol Prep Pads and Blood Drop Number On Capillary Blood Glucose Values (unh.edu)
Capillary blood glucose testing
Before capillary blood glucose testing became standard practice, glucose urine testing was the norm. This proved to be a very inaccurate way of determining blood glucose levels. The glucometer was first introduced in the 1970s, but this also proved to be quite inaccurate.
In 1980 the Dextrometer was launched, and it was a game-changer. It gave patients the freedom to safely check their capillary blood glucose levels at home, and to monitor their blood glucose levels. As medicine advanced over the years, the importance of cleaning a site with an alcohol swab became standard practice. As discussed above, this came with its own set of arguments. The fact of the matter is that patients could monitor their own capillary blood glucose levels without having to go into a hospital each time to have a venous blood glucose test performed. Especially with blood glucose levels fluctuating constantly, the wait for laboratory test results was problematic, and could be fatal for some patients.
Capillary blood glucose testing gave them the tool to monitor themselves, or allow others to do so if they suspected hypoglycaemia or hyperglycaemia. Capillary blood glucose testing also gave ambulance staff and emergency department staff the tools to quickly and effectively diagnose a patient and act accordingly by using capillary blood glucose testing. The effect of alcohol swabbing on capillary blood glucose measurements became a secondary concern over the saving of a patient’s life, as the data available is still widely debated.
Capillary blood glucose levels
Monitoring your capillary blood glucose levels is extremely important if you are a diabetic. With so many things affecting your blood glucose levels, you need to know what is normal and what is dangerous. Everything from what you eat and drink, to how much you exercise, has an effect on your blood glucose levels. So what is normal, and what is dangerous? When looking at a normal fasting blood glucose level, a range within 70 to 99 mg/dL is a normal blood glucose level. A blood glucose level of 100 to 125 mg/dL puts you in the range of pre-diabetic. A blood glucose level of 126 or higher means that you are probably diabetic, and should go to your doctor for further testing and diagnosis.
What puts me at risk?
There are a couple of factors to look out for that would make you a high-risk for developing diabetes. Some of these include individuals who are overweight or obese, people over the age of 45, individuals with high blood pressure, and people of certain ethnicities. But diabetes is not a death sentence if properly managed. You can still live a full, active life.
In Hollywood there are stars such as Tom Hanks, Salma Hayek, Nick Jonas, and Randy Jackson who lives with diabetes as a constant companion. In the sports world we have stars such as Jay Cutler (former football quarterback for multiple teams), Bill Carlson (Ironman triathlete), Pamela Fernandes (Olympic gold medal cyclist), Billie Jean King (tennis legend), and Mark Lyle (professional golfer), just to name a few.
Knowing that exercise affects blood glucose, it is good to know that these people are able to live a full life with this disease. It is not a death sentence if properly monitored, and that is why the glucometer is so important, and why a journal of your capillary blood glucose readings will help you to reach your full potential, in spite of having diabetes.
Natural blood thinners
If you are interested to find out how food or drink affects our blood condition you feel free to visit HematicFood channel on YouTube. You just interested in a natural blood thinners then you can on this link natural blood thinners
|
{
"url": "https://hematicfood.com/interesting-facts-on-capillary-blood-glucose/",
"source_domain": "hematicfood.com",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "48206",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NPHD7VXY66OMF2BMNGVVHEQQTVWX3AHT",
"WARC-Concurrent-To": "<urn:uuid:48a1ddea-3eaa-4729-ab9c-39cc957b14ba>",
"WARC-Date": "2022-05-25T12:11:32Z",
"WARC-IP-Address": "172.67.202.177",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:3BSIQN7P4PZT2TGXWYY6N7HCDKXX35AI",
"WARC-Record-ID": "<urn:uuid:0670c746-9bb2-48bf-a3bb-ddc17c6c9e0f>",
"WARC-Target-URI": "https://hematicfood.com/interesting-facts-on-capillary-blood-glucose/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5f707ad4-eb8d-4496-97fe-7c94de1cd9b6>"
},
"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-24\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
45,
46,
505,
506,
540,
541,
1047,
1048,
1482,
1483,
2115,
2116,
2157,
2158,
2821,
2822,
3158,
3159,
3891,
3892,
4286,
4287,
4855,
4856,
5669,
5670,
5702,
5703,
5976,
5977,
6697,
6698,
7237,
7238,
7269,
7270,
7966,
7967,
7989,
7990,
8354,
8355,
8771,
8772,
9132,
9133,
9156,
9157
],
"line_end_idx": [
45,
46,
505,
506,
540,
541,
1047,
1048,
1482,
1483,
2115,
2116,
2157,
2158,
2821,
2822,
3158,
3159,
3891,
3892,
4286,
4287,
4855,
4856,
5669,
5670,
5702,
5703,
5976,
5977,
6697,
6698,
7237,
7238,
7269,
7270,
7966,
7967,
7989,
7990,
8354,
8355,
8771,
8772,
9132,
9133,
9156,
9157,
9388
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9388,
"ccnet_original_nlines": 48,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.42620137333869934,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.002288330113515258,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.10983981937170029,
"rps_doc_frac_unique_words": 0.3267136514186859,
"rps_doc_mean_word_length": 4.888533115386963,
"rps_doc_num_sentences": 83,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.352681636810303,
"rps_doc_word_count": 1561,
"rps_doc_frac_chars_dupe_10grams": 0.015987420454621315,
"rps_doc_frac_chars_dupe_5grams": 0.10758747160434723,
"rps_doc_frac_chars_dupe_6grams": 0.0579216405749321,
"rps_doc_frac_chars_dupe_7grams": 0.0579216405749321,
"rps_doc_frac_chars_dupe_8grams": 0.030140219256281853,
"rps_doc_frac_chars_dupe_9grams": 0.015987420454621315,
"rps_doc_frac_chars_top_2gram": 0.08334425091743469,
"rps_doc_frac_chars_top_3gram": 0.08255799114704132,
"rps_doc_frac_chars_top_4gram": 0.018084129318594933,
"rps_doc_books_importance": -905.53662109375,
"rps_doc_books_importance_length_correction": -905.53662109375,
"rps_doc_openwebtext_importance": -513.4052124023438,
"rps_doc_openwebtext_importance_length_correction": -513.4052124023438,
"rps_doc_wikipedia_importance": -424.1571044921875,
"rps_doc_wikipedia_importance_length_correction": -424.1571044921875
},
"fasttext": {
"dclm": 0.36033928394317627,
"english": 0.9583858251571655,
"fineweb_edu_approx": 2.9762609004974365,
"eai_general_math": 0.10031867027282715,
"eai_open_web_math": 0.3923001289367676,
"eai_web_code": 0.005650219973176718
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "616.4028",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Pathology and Diseases"
}
},
"secondary": {
"code": "616.402",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Pathology and Diseases"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-3,599,108,668,850,756,000 |
Take the 2-minute tour ×
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It's 100% free, no registration required.
I know the general concept of recursion. I came across the concept of tail recursion while studying the quicksort algorithm. In this video of quick sort algorithm from MIT at 18:30 seconds the professor says that this is a tail recursive algorithm. It is not clear to me what tail recursion really means.
Can someone explain the concept with a proper example?
Some answers provided by the SO community here.
share|improve this question
Tell us more about the context where you have encountered the term tail recursion. Link? Citation? – A.Schulz Oct 22 '12 at 9:05
@A.Schulz I have put the link to the context . – Geek Oct 22 '12 at 9:18
5
Look at "What is tail-recursion?" on stackoverflow – Vor Oct 22 '12 at 9:24
2
@ajmartin The question is borderline on Stack Overflow but firmly on-topic on Computer Science, so in principle Computer Science should produce better answers. It hasn't happened here, but it's still ok to re-ask here in the hope of a better answer. Geek, you should have mentioned your earlier question on SO though, so that people don't repeat what's already been said. – Gilles Jan 5 '13 at 15:59
1
Also you should say what is ambiguous part or why you are not satisfied by previous answers, I think on SO people provide good answers but what caused you to ask it again? – user742 Jan 7 '13 at 10:14
4 Answers 4
up vote 16 down vote accepted
Tail recursion is a special case of recursion where the calling function does no more computation after making a recursive call. For example, the function
int f(int x, int y) {
if (y == 0) {
return x;
}
return f(x*y, y-1);
}
is tail recursive (since the final instruction is a recursive call) whereas this function is not tail recursive:
int g(int x) {
if (x == 1) {
return 1;
}
int y = g(x-1);
return x*y;
}
since it does some computation after the recursive call has returned.
Tail recursion is important because it can be implemented more efficiently than general recursion. When we make a normal recursive call, we have to push the return address onto the call stack then jump to the called function. This means that we need a call stack whose size is linear in the depth of the recursive calls. When we have tail recursion we know that as soon as we return from the recursive call we're going to immediately return as well, so we can skip the entire chain of recursive functions returning and return straight to the original caller. That means we don't need a call stack at all for all of the recursive calls, and can implement the final call as a simple jump, which saves us space.
share|improve this answer
1
you wrote "That means we don't need a call stack at all for all of the recursive calls" . Call stack will always be there , just that the return address need not be written into the call stack , right ? – Geek Jan 8 '13 at 5:09
1
It depends on your model of computation to some degree :) But yes, on a real computer the call stack is still there, we're just not using it. – Matt Lewis Jan 8 '13 at 11:25
My answer is based on the explanation given in the book Structure and Interpretation of Computer Programs. I highly recommend this book to computer scientists.
Approach A: Called as a Linear Recursive Process
(define (factorail n)
(if (= n 1)
1
(* n (factorial (- n 1)))))
Shape of the process for Approach A looks like this:
(factorial 5)
(* 5 (factorial 4))
(* 5 (* 4 (factorial 3)))
(* 5 (* 4 (* 3 (factorial 2))))
(* 5 (* 4 (* 3 (* 2 (factorial 1)))))
(* 5 (* 4 (* 3 (* 2 (* 1)))))
(* 5 (* 4 (* 3 (* 2))))
(* 5 (* 4 (* 6)))
(* 5 (* 24))
120
Approach B: Called as Linear Iterative Process
(define (factorial n)
(fact-iter 1 1 n))
(define (fact-iter product counter max-count)
(if (> counter max-count)
product
(fact-iter (* counter product)
(+ counter 1)
max-count)))
Shape of the process for Approach B looks like this:
(factorial 5)
(fact-iter 1 1 5)
(fact-iter 1 2 5)
(fact-iter 2 3 5)
(fact-iter 6 4 5)
(fact-iter 24 5 5)
(fact-iter 120 6 5)
120
The Linear Iterative Process (Approach B) runs in constant space even though the process is a recursive procedure. It should also be noted that in this approach a set variables define the state of the process at any point viz. {product, counter, max-count}. This is also a technique by which tail recursion allows compiler optimization.
In Approach A there is more hidden information which the interpreter maintains which is basically the chain of deferred operations.
share|improve this answer
Simply said, tail recursion is a recursion where the compiler could replace the recursive call with a "goto" command, so the compiled version will not have to increase the stack depth.
Sometimes designing a tail-recursive function requires you need to create a helper function with additional parameters.
For example, this is not a tail-recursive function:
int factorial(int x) {
if (x > 0) {
return x * factorial(x - 1);
}
return 1;
}
But this is a tail-recursive function:
int factorial(int x) {
return tailfactorial(x, 1);
}
int tailfactorial(int x, int multiplier) {
if (x > 0) {
return tailfactorial(x - 1, x * multiplier);
}
return multiplier;
}
because the compiler could rewrite the recursive function to a non-recursive one, using something like this (a pseudocode):
int tailfactorial(int x, int multiplier) {
start:
if (x > 0) {
multiplier = x * multiplier;
x--;
goto start;
}
return multiplier;
}
The rule for the compiler is very simple: When you find "return thisfunction(newparameters);", replace it with "parameters = newparameters; goto start;". But this can be done only if the value returned by the recursive call is returned directly.
If all recursive calls in a function can be replaced like this, then it is a tail-recursive function.
share|improve this answer
Tail-recursion is a form of recursion in which the recursive calls are the last instructions in the function (that's where the tail part comes from). Moreover, the recursive call must not be composed with references to memory cells storing previous values (references other than the parameters of the function). In this way, we don't care about previous values and one stack frame suffices for all of the recursive calls; tail-recursion is one way of optimizing recursive algorithms. The other advantage/optimization is that there is an easy way to transform a tail-recursive algorithm to an equivalent one that uses iteration instead of recursion. So yes, the algorithm for quicksort is indeed tail-recursive.
QUICKSORT(A, p, r)
if(p < r)
then
q = PARTITION(A, p, r)
QUICKSORT(A, p, q–1)
QUICKSORT(A, q+1, r)
Here is the iterative version:
QUICKSORT(A)
p = 0, r = len(A) - 1
while(p < r)
q = PARTITION(A, p, r)
r = q - 1
p = 0, r = len(A) - 1
while(p < r)
q = PARTITION(A, p, r)
p = q + 1
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://cs.stackexchange.com/questions/6230/what-is-tail-recursion/7814",
"source_domain": "cs.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2015-32",
"warc_metadata": {
"Content-Length": "92272",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:2HA7BL2UPPFHGX3XMVPO5MKX3LBIJD7G",
"WARC-Concurrent-To": "<urn:uuid:14c2f53d-2965-4a27-ac30-e33c320f3f73>",
"WARC-Date": "2015-07-29T13:31:06Z",
"WARC-IP-Address": "104.16.13.13",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:FHSQAMPMPBEFOOZRDQBH5YMQILCE2TBI",
"WARC-Record-ID": "<urn:uuid:5b871ddf-e134-417e-b44a-4faeeaeab369>",
"WARC-Target-URI": "http://cs.stackexchange.com/questions/6230/what-is-tail-recursion/7814",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9a5f45a7-3e32-4122-8719-0555a5f9af3b>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-236-191-2.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-32\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for August 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
25,
194,
195,
500,
501,
556,
557,
605,
606,
634,
639,
769,
774,
848,
852,
929,
933,
1334,
1338,
1540,
1541,
1553,
1554,
1584,
1585,
1740,
1741,
1763,
1779,
1793,
1797,
1798,
1820,
1822,
1823,
1936,
1937,
1952,
1968,
1982,
1986,
1987,
2005,
2006,
2020,
2022,
2023,
2093,
2094,
2803,
2804,
2830,
2834,
3063,
3067,
3242,
3243,
3403,
3404,
3453,
3454,
3476,
3489,
3493,
3523,
3524,
3577,
3578,
3592,
3612,
3638,
3670,
3708,
3738,
3762,
3780,
3793,
3797,
3798,
3845,
3846,
3868,
3888,
3889,
3935,
3962,
3972,
4005,
4032,
4058,
4059,
4112,
4113,
4127,
4145,
4163,
4181,
4199,
4218,
4238,
4242,
4243,
4580,
4581,
4713,
4714,
4740,
4741,
4926,
4927,
5047,
5048,
5100,
5101,
5124,
5141,
5178,
5184,
5198,
5200,
5201,
5240,
5241,
5264,
5296,
5298,
5299,
5342,
5359,
5412,
5418,
5441,
5443,
5444,
5568,
5569,
5612,
5623,
5640,
5677,
5690,
5710,
5716,
5739,
5741,
5742,
5988,
5989,
6091,
6092,
6118,
6119,
6830,
6831,
6850,
6864,
6873,
6904,
6933,
6962,
6963,
6994,
6995,
7008,
7034,
7051,
7082,
7100,
7101,
7127,
7144,
7175,
7193,
7219,
7220,
7232,
7233,
7235,
7243,
7244,
7322,
7323
],
"line_end_idx": [
25,
194,
195,
500,
501,
556,
557,
605,
606,
634,
639,
769,
774,
848,
852,
929,
933,
1334,
1338,
1540,
1541,
1553,
1554,
1584,
1585,
1740,
1741,
1763,
1779,
1793,
1797,
1798,
1820,
1822,
1823,
1936,
1937,
1952,
1968,
1982,
1986,
1987,
2005,
2006,
2020,
2022,
2023,
2093,
2094,
2803,
2804,
2830,
2834,
3063,
3067,
3242,
3243,
3403,
3404,
3453,
3454,
3476,
3489,
3493,
3523,
3524,
3577,
3578,
3592,
3612,
3638,
3670,
3708,
3738,
3762,
3780,
3793,
3797,
3798,
3845,
3846,
3868,
3888,
3889,
3935,
3962,
3972,
4005,
4032,
4058,
4059,
4112,
4113,
4127,
4145,
4163,
4181,
4199,
4218,
4238,
4242,
4243,
4580,
4581,
4713,
4714,
4740,
4741,
4926,
4927,
5047,
5048,
5100,
5101,
5124,
5141,
5178,
5184,
5198,
5200,
5201,
5240,
5241,
5264,
5296,
5298,
5299,
5342,
5359,
5412,
5418,
5441,
5443,
5444,
5568,
5569,
5612,
5623,
5640,
5677,
5690,
5710,
5716,
5739,
5741,
5742,
5988,
5989,
6091,
6092,
6118,
6119,
6830,
6831,
6850,
6864,
6873,
6904,
6933,
6962,
6963,
6994,
6995,
7008,
7034,
7051,
7082,
7100,
7101,
7127,
7144,
7175,
7193,
7219,
7220,
7232,
7233,
7235,
7243,
7244,
7322,
7323,
7413
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7413,
"ccnet_original_nlines": 182,
"rps_doc_curly_bracket": 0.003237559925764799,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3375527262687683,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01989150047302246,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.30982521176338196,
"rps_doc_frac_unique_words": 0.32742616534233093,
"rps_doc_mean_word_length": 4.5350213050842285,
"rps_doc_num_sentences": 49,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.315226078033447,
"rps_doc_word_count": 1185,
"rps_doc_frac_chars_dupe_10grams": 0.032378118485212326,
"rps_doc_frac_chars_dupe_5grams": 0.08429475128650665,
"rps_doc_frac_chars_dupe_6grams": 0.06159285083413124,
"rps_doc_frac_chars_dupe_7grams": 0.032378118485212326,
"rps_doc_frac_chars_dupe_8grams": 0.032378118485212326,
"rps_doc_frac_chars_dupe_9grams": 0.032378118485212326,
"rps_doc_frac_chars_top_2gram": 0.024562710896134377,
"rps_doc_frac_chars_top_3gram": 0.014886490069329739,
"rps_doc_frac_chars_top_4gram": 0.014142169617116451,
"rps_doc_books_importance": -724.9501342773438,
"rps_doc_books_importance_length_correction": -724.9501342773438,
"rps_doc_openwebtext_importance": -439.3811950683594,
"rps_doc_openwebtext_importance_length_correction": -439.3811950683594,
"rps_doc_wikipedia_importance": -311.5115661621094,
"rps_doc_wikipedia_importance_length_correction": -311.5115661621094
},
"fasttext": {
"dclm": 0.6808454394340515,
"english": 0.8620641231536865,
"fineweb_edu_approx": 2.109874963760376,
"eai_general_math": 0.9483911991119385,
"eai_open_web_math": 0.4726797342300415,
"eai_web_code": 0.6321009397506714
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
6,748,782,862,345,850,000 |
Search Images Maps Play YouTube News Gmail Drive More »
Sign in
Screen reader users: click this link for accessible mode. Accessible mode has the same essential features but works better with your reader.
Patents
1. Advanced Patent Search
Publication numberUS3342457 A
Publication typeGrant
Publication dateSep 19, 1967
Filing dateFeb 1, 1965
Priority dateFeb 1, 1965
Publication numberUS 3342457 A, US 3342457A, US-A-3342457, US3342457 A, US3342457A
InventorsBobrowski Louis G
Original AssigneeStanley Works
Export CitationBiBTeX, EndNote, RefMan
External Links: USPTO, USPTO Assignment, Espacenet
Guardrail assembly
US 3342457 A
Abstract available in
Images(1)
Previous page
Next page
Claims available in
Description (OCR text may contain errors)
p 1967 L. G. BOBROWSKI 3,342,457
GUARDRAIL ASSEMBLY Filed Feb. 1, 1965 50 T5 50 32 INVENTORQ LOUIS G. BOBROWSKI ATTORNEYS United States Patent G 3,342,457 GUARDRAIL ASSEMBLY Louis G. Bobrowski, Berlin, Conn, assignor to The Stanley Works, New Britain, Conn., a corporation of Connecticut Filed Feb. 1, 1965, Ser. No. 429,528 4 Claims. (Cl. 256-21) The present invention relates to a guardrail assembly and more particularly to new and improved assemblies of the handrail type generally utilized adjacent automatic doorways and similar heavily trafiicked pedestrian areas.
A principal object of the present invention is to provide a guardrail assembly which can be quickly and easily erected in the form of variously configured modules of sturdy construction and pleasing appearance.
A further object of the present invention is to provide a guardrail assemblage possessing a high degree of adjustability and flexibility in both size and style while employing standard units adapted for rapid custom fabrication and assembly in the field.
Other objects will be in part obvious and in part pointed out more in detail hereinafter.
The invention accordingly consists in the features of construction, combination of elements and arrangement of parts which will be exemplified in the construction hereafter set forth and the scope of the application which will be indicated in the appended claims.
In the drawing:
FIG. 1 is an elevated side View partly in section illustrating an installed guardrail assembly embodying the present invention;
FIGS. 2, 3 and 4 are enlarged perspective views partially broken away of typical junction units employed in the assembly of the present invention; and
FIG. 5 is a sectional view taken along the line 5-5 of FIG. 1.
Referring now to the drawing in greater detail, FIG. 1 depicts the embodiment chosen for illustrative purposes and shows an installed guardrail assembly typical of railings employed in conjunction with automatically operated doors. The assembly, generally designated 10, is shown as mounted and supported by a floor or footing 12 and a vertical wall 14 or similar support such as the frame of a door. It will, of course, be appreciated that the assembly may take various forms and may be mounted not only in the cooperative manner illustrated but also solely on the footing 12 or between a pair of closely spaced wall members. The assembly may consist of a number of repeating units or modules as shown in FIG. 1. Each module of the assembly contains at flat, relatively thin panel member 16 mounted within and entirely enclosed by a frame portion 18. However, where desired, the module may consist of the frame only, thereby providing various combinations of module structures, such as those alternately including and omitting the panel member 16.
The frame 18 generally comprises a plurality of vertically disposed supporting posts or balusters 20 which make take the form of a wall rail, as shown on the right of FIG. 1 and designated 20', or may extend to the footing 12 and may be suitably mounted thereon or anchored therein. As shown in FIG. 1, the balusters 20 are anchored within the concrete footing 12 with the aid of roll pins 22. The balusters 20 and 20', as well as the top or handrail 24, and the bottom and terminal rails 26, 28 respectively, are preferably elongated, extruded aluminum structures having the same generally rectangular cross section which prevents rotation thereof within the junctioning units or fittings 30, 32 and 34.
As illustrated in FIGS. 2 through 4, the fittings may 3,342,457 Patented Sept. 19, 1967 ice take various forms. Generally, they are all hollow members having a plurality of angularly oriented, unidirectional, intersecting cavities having a generally rectangular cross-sectional configuration of sufficient size to provide a smooth slip fit between the fittings and the rail and baluster members. As best shown in FIG. 1, the fitting 34 exhibiting a cross or X-shaped configuration may be slipped over baluster 20 on the extreme left and slid downwardly thereon to a position slightly below the middle thereof where it is properly secured in place and supported by the baluster 20. The fitting is preferably a die cast, aluminum alloy unit having a base portion 36 and a top portion 38, the portions being provided with aligned, generally rectangular cavities 40, 42 respectively. The cavities 40, 42 are slightly larger than the external dimensions of the baluster 2t} and extend unidirectionally into the fitting, joining in the center thereof to form a passage extending entirely through the fitting 34.
The fitting 34 is further provided with a pair of aligned side portions 44, 46 extending outwardly from opposite sides of the generally vertical base and top portions 36, 38 at substantially right angles thereto. Each of the side portions 44, 46 are provided with mutually aligned, gen erally rectangular cavities 48, 50 of the same size as cavities 40, 42, the cavities 48, 50 extending inwardly toward and intersecting the aligned cavities of the base and top portions. As shown in FIG. 1, the unidirectional cavities 40, 42, 48 and 58 all intersect at right angles to provide a continuous X-shaped passage conforming entirely with the external shape of the fitting 34. As best shown in FIG. 4, the base and side portions of the fittings 34 are provided with threaded apertures 52 adapted to receive set screws 54 for securing the baluster and rails against relative movement upon assemblage thereof. When the fitting 34 is intermediate the ends of the baluster and upon tightening of the set screws 54, the bottom rail 26 may be inserted into the side cavity 50 within the side portion 46 and secured therein against relative movement.
Referring now to FIGS. 1 and 2, there is shown the generally T-shaped fitting 30 which is supported on the top of baluster 20. Fitting 30 exhibits an overall construction and design similar to that of fitting 34 although, of course, modified in external shape or configuration. The fitting 30 comprises a base portion 56 and a crossbar portion integrally joined thereto, the crossbar portion comprising a pair of aligned side portions 58, 60 interconnected with the base portion 56 to form the T- shape of the fitting. Each of these portions contains a unidirectional cavity of rectangular cross section, the cavities 62, 64 of side portions 58, 60 respectively, being aligned to form a passage extending entirely through the fitting 30 while the cavity 66 of base 56 intersects and communicates therewith at substantially a right angle. Thus, as shown in FIG. 1, the fitting 30 may slip over the baluster 28 so that the baluster sits within the terminating cavity 66 while the top rail 24 slidably fits within side cavity 64. As mentioned hercinbefore, the fitting 30 is further provided with a symmetrical side portion 58 opposite portion 60, the symmetrical portion 58 being provided with a unidirectional cavity 62 which intersects the cavity 64 at substantially a right angle thereto. As best shown in FIG. 1, the guardrail assembly may be provided with a terminal rail portion 28 having a generally U-shaped configuration and adapted to slide into the side cavities 62 and 48 of the respective fittings 30, 34.
Referring now to FIG. 3 there is shown a generally L-shaped elbow fitting 32 having a construction substantially similar to the fittings 30, 34 and possessing a base portion 68 and a leg portion 70, each having: mutually intersecting terminating cavities 72, 74. The fittings 32,
in addition to being provided with threaded apertures 52 on the inward side of each portion for receiving the set screws 54 also contains within the base portion 68 the countersunk apertures 76 adapted to receive the threaded members 78 for attaching the fitting 32 to the wall 14.
As mentioned hereinbefore, each module of the guardrail assembly may contain a panel member 16 which is mounted within and completely enclosed by the frame portion 18 of the assembly. Referring now to FIG. 5, it can be seen that the rails and balusters are each provided with a longitudinal dovetail groove or mortise 80 extending along the entire length thereof. Where the assembly requires, each baluster may be provided with a mortise on both sides of the baluster 20. The mortise 80 is further provided with a relatively thin, resilient plastic or rubberlike liner 82 which assumes the dovetail configuration of the mortise 8t and securingly contacts the edge portions of the panel 16, the latter being dimensioned to readily slide into and out of the lined mortise 80. The liner 82 is particularly elfectively in eliminating any rattling of the panel 16 while accommodating slight irregularities and burrs on the rail and baluster members.
As will be apparent from the foregoing description, the assembly shown in FIG. 1 may be readily assembled by anchoring the balusters 20 in the footing 12 at the desired distances from wall 14. The bottom rail 26, cut to proper length, may then be inserted through the side cavities of one fitting 34 so that the latter will be positioned over the short center baluster 20. One end of rail 26 may then be inserted into the side cavity 50 of fitting 34 while the other end thereof slips into the leg cavity 74 of fitting 32. The assembled rail and fittings may then be positioned by sliding the end fitting 34 down over the tall baluster 26 so that the latter passes through cavities 40 and 42 therein. Upon reaching the desired level the short intermediate baluster 20 slips into cavity .0 until it contacts rail 26, after which the set screws 54 in the base portion 36 may be tightened to secure the fitting to the baluster. The wall rail 20' is then slipped into cavity 72 of fitting 32 and the fitting is secured to the wall by means of threaded member 78. Likewise, an intermediate baluster 20 substantially equal in length to the Wall rail is placed in cavity 42 of intermediate fitting 34. After sliding the panels 16 into place so that they are held within the lined mortise grooves '80 of the balusters, bottom rail and wall rail, the top rail having the fittings 30 and 32 atached thereto is put into place by sliding the top of balusters 20 into the cavities 66 and the top of wall rail 20' into cavity 72. Subsequently, the terminal U-shaped rail 28 is put into place and secured therein to complete the assembly and provide stabilizing support for the fitting 34.
Although the guardrail assembly may be made from any suitable structural material, it is generally preferred to employ extruded, aluminum alloy rails having an anodized or satin finish and die cast aluminum alloy junction units or fittings adapted for mounting on the balusters and rails as well as against generally vertical wall members.
As will be appreciated from the foregoing description, the present invention provides an improved flexibility and adjustability in handrail assemblies which permits the use of a minimum number of readily assembled standard elements. These elements can be easily cut to size and field assembled into generally rectangular modules of sturdy construction in a quick and facile manner yet provide a clean and artistically pleasing appearance.
As will be apparent to persons skilled in the art, various modifications and adaptations of the structure abovedescribed will become readily apparent without departure from the spirit and scope of the invention, the scope of which is defined in the appended claims.
I claim:
1. A guardrail assembly having a frame comprising a plurality of elongated balusters mounted in an upright position on a support; at least one of said balusters comprising separate first and second baluster portions, a hollow fitting for the balusters having a pair of aligned unidirectional cavities forming a passage extending entirely therethrough and at least one side cavity angularly oriented with respect to said aligned cavities, said fitting slidably receiving a portion of the baluster within said side cavity; and an elongated rail of substantially uniform cross section slidably received within said passage and extending outwardly therefrom whereby the rail rests on and is supported by the baluster, said baluster and rail being fixedly secured Within said fitting against relative movement.
2. A guardrail assembly comprising a frame including a plurality of elongated balusters mounted in an upright position, at least one of said balusters comprising separate first and second baluster portions; and upper and lower fitting for each baluster, at least one of said lower fittings having a pair of aligned unidirectional cavities forming a passage extending entirely therethrough and at least one side cavity angularly oriented with respect to said passage, said first baluster portion passing into the side cavity; a lower rail extending through the passage of the lower fitting and resting on the first baluster portion within the fitting whereby the first baluster portion supports said lower fitting and lower rail, the second baluster portion supportably resting on said rail, at least one of said upper fittings having a first unidirectional cavity and a terminating side cavity angularly oriented with respect thereto, said second baluster portion being positioned within said terminating cavity; and an elongated top rail extending through the first unidirectional cavity of the top fitting, said top rail resting on and being supported by said second baluster portion, said top and bottom rails extending between adjacent balusters and being received by fittings carried thereon to form an enclosed polyhedral frame, said fittings including means contacting and securing the balusters and rails thereto.
3. A guardrail assembly including a module comprising a generally polyhedral frame and a panel mounted on the frame and enclosed thereby. said frame comprising a plurality of elongated balusters of generally rectangular cross section mounted in an upright position, at least one of said balusters comprising separate first and second baluster portions; an upper and a lower fitting for each baluster having rectangular passage-forming cavities, at least one of said lower fittings having a pair of aligned unidirectional cavities forming a passage extending entirely therethrough and a pair of side cavities angularly oriented with respect to said passage and on opposite sides thereof, said first baluster portion having one end mounted on a support and the other end positioned within one of said side cavities; a lower rail extending through the passage in said one lower fitting and resting on the baluster end Within the fitting thereby supporting said lower rail and fitting, one end of said second baluster portion being received within the other of said side cavities in the lower fitting, at least one of said upper fittings having a pair of aligned unidirectional cavities and a terminating side cavity angularly oriented with respect thereto, said second baluster portion having the other end thereof positioned within said terminating cavity; and an elongated top rail of rectangular cross section extending through the aligned cavities of the top fitting, said top rail resting on and being supported by said second baluster portion, said top and bottom rails extending between adjacent balusters and being received by fittings carried thereon to form an enclosed polyhedral frame, said fittings including means contacting and securing the balusters and rails thereto, said polyhedral frame having along a substantial portion of its inner periphery a mortise receiving and enclose said panel.
4. The guardrail assembly of claim 3 wherein said References Cited UNITED STATES PATENTS Paine 256-24 Martin 256-65 X Harrison et a1. 25665 Gascoigne et a]. 256-21 X 6 3/1939 George 28754 X 9/1939 Ewing 287-54 11/1958 Derrig 25622 X 2/ 1959 Blum 256-31 7/1963 Bieber 256-21 X FOREIGN PATENTS 11/ 1949 Great Britain. 11/ 1964 Great Britain.
10 DAVID J. WILLIAMOWSKY, Primary Examiner.
Patent Citations
Cited PatentFiling datePublication dateApplicantTitle
US65592 *Jun 11, 1867HimIsland
US245189 *Apr 4, 1881Aug 2, 1881 Iron fence
US1316155 *May 6, 1915Sep 16, 1919 Fitting
US2117798 *Jan 21, 1937May 17, 1938Harry Gascoigne GeorgeRailing and the like
US2149844 *Mar 7, 1935Mar 7, 1939Union Carbide & Carbon CorpTubular structure embodying welded joint and method of making the same
US2172137 *Apr 16, 1937Sep 5, 1939Vulcan Rail And Construction CTubular metal railing structure
US2859990 *Feb 19, 1954Nov 11, 1958Fairbanks Morse & CoRailing structure
US2873094 *Nov 19, 1956Feb 10, 1959Louis BlumFence assembly with panels
US3099247 *Feb 27, 1962Jul 30, 1963Philip BieberSimulated hedge for turf race track
GB631786A * Title not available
GB974055A * Title not available
Referenced by
Citing PatentFiling datePublication dateApplicantTitle
US3848388 *Feb 1, 1973Nov 19, 1974Bretche SMulti-directional connecting element for panels
US3885765 *Apr 17, 1973May 27, 1975Richards Adrian JohnFurniture frames
US3920345 *May 30, 1973Nov 18, 1975Jean StoltzT-section assembly connector
US4068443 *Oct 4, 1974Jan 17, 1978Jean StoltzSection piece for T-section assembly
US4351621 *Dec 19, 1979Sep 28, 1982Liou Jin SConnector for combination furniture
US5425203 *Jun 18, 1993Jun 20, 1995Scott; James H.Apparatus for supporting plants
US5667199 *Sep 28, 1993Sep 16, 1997Hamm; WilfriedRailing made of prefabricated standard components
US6039308 *Mar 2, 1998Mar 21, 2000Venegas, Jr.; FrankPeople gate
US6209854 *Oct 23, 1998Apr 3, 2001Mark A. SedlackSuspended stair railing for children
US6290213Dec 9, 1999Sep 18, 2001Wildeck Mezzanines, Inc.Modular rail assembly
US6848679 *Sep 13, 2002Feb 1, 2005Kee Klamp LimitedConnector for a modular safety rail
US6896229 *Jan 21, 2003May 24, 2005Larry D. WestgateHanger
US7093322 *Jun 4, 2004Aug 22, 2006Access Technologies LimitedCounter-balance weight for a modular safety rail
US7404687 *Mar 16, 2005Jul 29, 2008Rittal Gmbh & Co. KgHolder for a support arm system
US20030094604 *Sep 13, 2002May 22, 2003Higgs Philip MauriceConnector for a modular safety rail
US20030178614 *Feb 6, 2003Sep 25, 2003Frank VenegasPlastic-coated hand rails, guard rails, and the like
US20040060257 *Jun 11, 2003Apr 1, 2004Frank VenegasStanchion covers
US20050000060 *Jun 4, 2004Jan 6, 2005Access Technologies LimitedCounter-balance weight for a modular safety rail
US20050258322 *Mar 16, 2005Nov 24, 2005Markus NeuhofHolder for a support arm system
US20080196330 *Jun 21, 2007Aug 21, 2008Frank Roger SPublic Access Stair System
Classifications
U.S. Classification256/21, 403/362, 403/174, 256/65.16, 256/65.4, 403/173, 403/205
International ClassificationE04F11/18
Cooperative ClassificationE04F11/181
European ClassificationE04F11/18F
|
{
"url": "http://www.google.com/patents/US3342457?dq=7,346,539",
"source_domain": "www.google.com",
"snapshot_id": "crawl=CC-MAIN-2016-22",
"warc_metadata": {
"Content-Length": "52878",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RIMFOOETWX6CI3D7JIPF3NYOKQVKI4SV",
"WARC-Concurrent-To": "<urn:uuid:0b9c9de4-44dc-4304-b85e-ba4b99e26ebb>",
"WARC-Date": "2016-05-29T11:46:06Z",
"WARC-IP-Address": "216.58.195.132",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:TQ6DYWQXKHQJ34LI3JMYIL54ZGJBFQ5R",
"WARC-Record-ID": "<urn:uuid:cb8ba002-d3fa-4d62-8a38-5434572fb720>",
"WARC-Target-URI": "http://www.google.com/patents/US3342457?dq=7,346,539",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1cc36503-ec57-4f77-ad2b-df13f22f9153>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-185-217-139.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-22\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for May 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
56,
64,
205,
206,
214,
215,
243,
273,
295,
324,
347,
372,
455,
482,
513,
552,
603,
622,
635,
658,
668,
682,
692,
713,
756,
757,
790,
791,
1330,
1331,
1542,
1543,
1798,
1799,
1889,
1890,
2154,
2155,
2171,
2172,
2300,
2301,
2452,
2453,
2516,
2517,
3566,
3567,
4272,
4273,
5379,
5380,
6519,
6520,
8037,
8038,
8318,
8319,
8601,
8602,
9547,
9548,
11223,
11224,
11564,
11565,
12004,
12005,
12271,
12272,
12281,
12282,
13088,
13089,
14511,
14512,
16418,
16419,
16759,
16760,
16804,
16805,
16822,
16876,
16907,
16951,
16994,
17072,
17203,
17299,
17372,
17444,
17528,
17560,
17592,
17606,
17661,
17752,
17824,
17899,
17981,
18062,
18144,
18243,
18308,
18394,
18472,
18559,
18618,
18728,
18815,
18910,
19014,
19082,
19195,
19279,
19358,
19374,
19457,
19495,
19532
],
"line_end_idx": [
56,
64,
205,
206,
214,
215,
243,
273,
295,
324,
347,
372,
455,
482,
513,
552,
603,
622,
635,
658,
668,
682,
692,
713,
756,
757,
790,
791,
1330,
1331,
1542,
1543,
1798,
1799,
1889,
1890,
2154,
2155,
2171,
2172,
2300,
2301,
2452,
2453,
2516,
2517,
3566,
3567,
4272,
4273,
5379,
5380,
6519,
6520,
8037,
8038,
8318,
8319,
8601,
8602,
9547,
9548,
11223,
11224,
11564,
11565,
12004,
12005,
12271,
12272,
12281,
12282,
13088,
13089,
14511,
14512,
16418,
16419,
16759,
16760,
16804,
16805,
16822,
16876,
16907,
16951,
16994,
17072,
17203,
17299,
17372,
17444,
17528,
17560,
17592,
17606,
17661,
17752,
17824,
17899,
17981,
18062,
18144,
18243,
18308,
18394,
18472,
18559,
18618,
18728,
18815,
18910,
19014,
19082,
19195,
19279,
19358,
19374,
19457,
19495,
19532,
19565
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 19565,
"ccnet_original_nlines": 121,
"rps_doc_curly_bracket": 0.000051110000640619546,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3203169107437134,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03140917047858238,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20797963440418243,
"rps_doc_frac_unique_words": 0.2786458432674408,
"rps_doc_mean_word_length": 5.220377445220947,
"rps_doc_num_sentences": 111,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.758443355560303,
"rps_doc_word_count": 3072,
"rps_doc_frac_chars_dupe_10grams": 0.10775083303451538,
"rps_doc_frac_chars_dupe_5grams": 0.19373947381973267,
"rps_doc_frac_chars_dupe_6grams": 0.15894493460655212,
"rps_doc_frac_chars_dupe_7grams": 0.14522665739059448,
"rps_doc_frac_chars_dupe_8grams": 0.12789174914360046,
"rps_doc_frac_chars_dupe_9grams": 0.11822660267353058,
"rps_doc_frac_chars_top_2gram": 0.009976929984986782,
"rps_doc_frac_chars_top_3gram": 0.005612019915133715,
"rps_doc_frac_chars_top_4gram": 0.004801400005817413,
"rps_doc_books_importance": -1459.3477783203125,
"rps_doc_books_importance_length_correction": -1459.3477783203125,
"rps_doc_openwebtext_importance": -852.6939086914062,
"rps_doc_openwebtext_importance_length_correction": -852.6939086914062,
"rps_doc_wikipedia_importance": -596.1668701171875,
"rps_doc_wikipedia_importance_length_correction": -596.1668701171875
},
"fasttext": {
"dclm": 0.03683733940124512,
"english": 0.9000871777534485,
"fineweb_edu_approx": 1.7776683568954468,
"eai_general_math": 0.0383726991713047,
"eai_open_web_math": 0.23822331428527832,
"eai_web_code": 0.0014464899431914091
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "624.17",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Bridges, Roofs, and Civil engineering"
}
},
"secondary": {
"code": "624.1",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Bridges, Roofs, and Civil engineering"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "11",
"label": "Legal/Regulatory"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "17",
"label": "Product Page"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-6,614,445,892,336,393,000 |
1
vote
1answer
44 views
Is it possible to group java selenium tests in a larger utility class for reuse?
So say you have a made up flight booking application. I'm speaking on a very high level; because i'm more concerned with the design of these java objects. We're creating tests that have these classes ...
1
vote
1answer
39 views
Finding Elements On a Wwebpage
I am writing Coded UI Tests in Visual Studio and need to know the best way to find elements on a page. Would it be better to use the element's class or some other attribute?
1
vote
3answers
134 views
Where should I create a coded UI project?
Should Coded UI tests be within the solution that they are testing (similar to Unit Tests), or should they be contained in a separate, generic Coded UI solution that is built only once and executed ...
1
vote
1answer
36 views
How to load test a workflow system with stages linked by email
I want to load test a web site that provides a workflow system. In this system, users register and then create a record. An administrator sees the new record in their task list on a web page; they ...
0
votes
2answers
114 views
XPath not recognised in page object model in WebDriver [closed]
xpath not recognised in page object model in webdriver. @FindBy(xpath = "//td[contains (text(),'xxx')]") public WebElement topMenu; topMenu.click(); Error: Unable to locate element: ...
-1
votes
2answers
95 views
What Assert.AreEqual(true, true); does? [closed]
Can any one explain Assert.AreEqual(true, true); with proper example and explanation?
1
vote
3answers
208 views
How to write test cases in selenium webdriver using C#, simultaneously when web application is being developed (application pages not available)
I want to write test cases when application is under developing. I know the design of the application based on the wireframes. I intend to write test cases in C# using the Selenuim WebDriver. ...
0
votes
2answers
64 views
How can I write test cases without knowing the application in Selenium IDE?
If I don't know the application I only know the Software requirements, on Software requirement basis I need to write the test cases in Selenium IDE. So how can I write the Test cases on Software ...
0
votes
2answers
88 views
Universal Skills in a QA role
Lately I have been looking for a new position in the QA world. My background, while short, has afforded me amazing learning opportunities and I feel it is time for me to take a leap and learn even ...
0
votes
4answers
127 views
What are the possible test scenario's to test a Text field?
Consider the text field accepts alpha-numeric characters. What could be some unique and out of the box test scenario's/cases that could be useful in finding an important defect.
0
votes
0answers
37 views
How to make an assessment of a project's testing process? Compare with CMMI-DEV
I'm trying to figure out the best way to collect information, analyse and evaluate/assess a project's current Testing process, currently being developed by a team. After I do that, I compare the ...
1
vote
3answers
96 views
Role of Quality Assurance (Not testing!) in Agile
From Wikipedia: "Quality Assurance refers to administrative and procedural activities implemented in a quality system so that requirements and goals for a product, service or activity will be ...
4
votes
5answers
120 views
Testing non-central features
Only 1% of our clients use particular features or scenarios. Do you think we should spend as much time testing these features and scenarios as we spend on our central features and scenarios, or we ...
1
vote
1answer
36 views
Best way to wait till the status changes
I have to automate a web page. Which has the following behaviour. I will create an application and the created application will be displayed in a table. The table has a column named status. The ...
0
votes
2answers
49 views
Where should a test server be hosted?
Should a test server be hosted locally or on the internet ? What are the pros/cons? I have seen people do both. What is best practice?
1
vote
5answers
120 views
Lightweight load & performance testing frameworks
Which lightweight load and/or performance testing frameworks could you recommend? some considerations: Configuration with not too much coding (some JS would be okay) command line + text editor ...
1
vote
1answer
34 views
Simulating realistic latency to a WAN SQL server
Context: Our desktop application communicates with a SQL server, some clients use a WAN connection to reach this SQL server. When they complain something is very slow we ask a list of ping times to ...
0
votes
2answers
195 views
How to iterate a list of WebElements and print the values one by one to perform some action
List<WebElement> allLinks = driver.findElements(By.xpath("//div[@class='datepicker']/div/table/tbody/tr/td/table/tbody[2]/tr/td[@class='' or @class='datepickerSaturday' or ...
1
vote
1answer
75 views
How to gather usage statistics for various open source testing frameworks
My organization would like to choose between the TestNG and Robot Framework. I thought it better to approach this from the stand point of usage statistics, since both are open source. How do I go ...
0
votes
1answer
47 views
Virtualbox can fully run any OS?
I want to use Virtualbox to run Windows in Ubuntu. Can it really run every OS with no problems or restrictions if my PC respects the requirements? And can I run it in full screen?
0
votes
2answers
35 views
Possible for specific hardware to cause memory leaks?
I'm running a stress test for about 12 hours on some new hardware we just got. My new baselines look ok but one process is worse than before. Only one process is a culprit. I've tried so many ...
0
votes
0answers
36 views
Invalid xml data generator
I am searching for a tool that can generate invalid data for xml. I know data valid in one system might be invalid in other. Still some error like length, signs, repetition could be simulated. I do ...
3
votes
1answer
80 views
BDD in Validation: good tools?
Context: For 2.5 years, I wrote Java-based desktop software at software company A (the supplier). The software also has a server and a web component. The software was custom-built for company B (the ...
0
votes
2answers
59 views
Give me some tips for testing Email client mobile application
I am not familiar with e-mail but I need to test Email client for mobile platform. I suppose that there are some test engineers which can help me to define tricky use cases and well-known problems ...
0
votes
1answer
62 views
I want to parameterize the filename textfield of CSV dataset config
I want to parameterize the filename textfield of CSV dataset config from other CSV dataset config. Here is my test plan Test Plan CSV Config1-file1 Login LoopController CSV config2-file2 ...
1
vote
5answers
106 views
Who should log bugs? [closed]
In an agile environment where project priorities constantly change meeting deliverables, how healthy is the situation where bugs are logged by project members other than the actual qa member who is ...
1
vote
1answer
73 views
Parsing xpath results in selenium ide
I'm trying to get a list of all the links that follow a certain rule ( their href is Downloads.aspx?<somestring> ) *Note: I'm using Selenium IDE, the Firefox plugin for this. In order to get ...
3
votes
1answer
78 views
UAT Best practises | Level of detail
For our current software product some of our enterprise clients want to run User Acceptance Testing on their own acceptance environment. To help them get started we have setup an UAT testing suite ...
2
votes
3answers
89 views
Getting up to speed quickly with automation tests
I'm starting a new QA engineering internship and I've been tasked with automation tests. I was going through the documentation for selenium and testNG and it seems straightforward and easy to pickup. ...
0
votes
2answers
134 views
Writing Test cases in an agile approach
I use to develop test cases in the traditional way by defining the following for each test senario:- Test case name. “View Current Transaction” Pre-condition. Valid “Username & password” The ...
0
votes
0answers
25 views
ALM - moving tests into test set
HP ALM -trying to add tests into my test set but the folder will not expand so I can't see my tests. I have created a folder in Test Lab, have a test set assigned to this folder. When I "select test" ...
0
votes
2answers
54 views
Force selenium to use the portable firefox application
I have installed firefox 14 and has firefox portable version 25.0.1 on the machine, where I run tests for a web site. Due to a limitation in the site I'm testing, I cannot run my tests on firefox 14 ...
0
votes
2answers
108 views
Selenium: Basic Drop Down
I am very new to the world of QA and selenium. I have been trying to create a number of tests to run and cannot seem to get the commands to work properly on one specific drop down. When I execute the ...
1
vote
1answer
44 views
Best resources for learning Ruby/Cucumber/Rspec test suite organization and refactoring [closed]
I'm working with a Cucumber suite that needs refactoring and organization. The end goal is to have a maintainable suite of tests that matter enough that developers will stop if the cucumber tests are ...
0
votes
0answers
94 views
How to store webelements(dates) in an array
How to store webelements(dates) in an array and retrieve it? I got the total no. of dates by using the xpath : //div[@class='datepicker']/div/table/tbody/tr/td/table/tbody[2]/tr/td[@class='' ...
1
vote
2answers
55 views
What are the leading policies on limiting bug reporting redundancy?
Currently automated reports run on recurring monitors based on user encounters. At the start the automated errors were for the most part useless because there were 400 low priority bugs, 50 major, two ...
1
vote
0answers
30 views
Can any one explain me about how / where to use Listeners in TestNG? [closed]
As I am new to TestNG, I would like to request you guys to please give me a brief about @Listeners. If possible please provide a dummy code of the same.
0
votes
1answer
71 views
How to use locator value in WebDriver?
I am learning Java to automate testcases using WebDriver. As for now I was using Selenium IDE. I have a scenario. In date picker on selecting date, based on the current date and time-future timeslots ...
1
vote
1answer
105 views
How to use Run Keyword IF" in Robot Framework
I want to run Keyword if Element is visible. E.g I want to check that if a button is visible on the page then run particular Keyword. Below is my code. Create button is Keyword and want to run if ...
2
votes
1answer
208 views
What are the Selenium, JUnit, Ant and JScover and how they are combined?
I am given a javascript function which takes as input some numbers and returns the max, as a part of a project at the university, and I have to test it, using Selenium, JUnit, Ant and JScover. I have ...
0
votes
1answer
44 views
How to access a dynamically created element
I am using Watin to test a website. It contains a div which is created dynamically on clicking a tablecell. How can I access the dynamically created div. The issue is the div is deleted after a short ...
0
votes
2answers
90 views
Is it functional or invalid input test?
I have a screen with a "I agree" check box and the "Next" button. I tested it in the following way: Do not select a check box. Click "Next". Expect an alert message is shown. Is this functional ...
0
votes
0answers
14 views
How to Extract Uncovered Requirements from QC using QC API
How do I extract requirements which are not mapped to any test conditions using QC API.
5
votes
2answers
105 views
Testing localization
We have a site which is using the ip of the client machine to determine location for display on the home page Has anyone got any idea how we test this from a fixed office, on a corporate network?
0
votes
0answers
27 views
Is it possible to run OpenScript functional tests from Maven?
I don't know Maven very well at all. I've been trying to pick up the basics as part of learning Selenium, which my company is considering for web functional tests. We also have some tests in Oracle ...
0
votes
1answer
73 views
How to capture a series of screenshots in Web Driver using Java
I Just wanted to know, that how we can take a series of screenshots / a video recording for a screen using Selenium 2 / Web Driver with JAVA ? Please provide the answer or the lick where I can get ...
2
votes
2answers
120 views
Where I can get all the commands related to Web Driver / Selenium 2
I am not able to find all the commands for Web Driver / Selenium 2. Please help me providing the same. Thanks
2
votes
1answer
86 views
How to navigate to a alert using Selenium Web Driver with Java?
I am trying to navigate the command on the alert box, but I am not able to do it in Web Driver with JAVA. Please help me with it. Apart from this I would also like to know how to tackle with the ...
0
votes
1answer
70 views
what is Keys.ZENKAKU_HANKAKU in webdriver?
As i came across this code, driver.findElement(By.name("xxx")).sendKeys( Keys.ZENKAKU_HANKAKU); so wanted to know why and when to use this kind of key.
1
vote
2answers
58 views
what are the equivalent commands for label and Goto label in webdriver
I used Selenium IDE to automate the project. Now I started learning Webdriver. In IDE, there are few commands like label and Goto labels, where I can create a bunch of code under a label and use ...
15 30 50 per page
|
{
"url": "http://sqa.stackexchange.com/questions?page=3&sort=newest&pagesize=30",
"source_domain": "sqa.stackexchange.com",
"snapshot_id": "crawl=CC-MAIN-2014-15",
"warc_metadata": {
"Content-Length": "168720",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:FQHM4QKM4YKYCU7LO3JTFUBKHSUWUSV2",
"WARC-Concurrent-To": "<urn:uuid:096cbe46-9a7d-47db-b295-fa98f12fa101>",
"WARC-Date": "2014-04-23T21:27:10Z",
"WARC-IP-Address": "198.252.206.140",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:EYEEG2KJNK4DLLKMHHHEKSWGHUMHLTBU",
"WARC-Record-ID": "<urn:uuid:e51151ca-770e-486f-b3ed-8776e85a8f74>",
"WARC-Target-URI": "http://sqa.stackexchange.com/questions?page=3&sort=newest&pagesize=30",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f3787c78-3de4-406f-963d-f9f3b7ba081d>"
},
"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,
7,
15,
24,
25,
106,
107,
311,
313,
318,
326,
335,
336,
367,
368,
542,
544,
549,
558,
568,
569,
611,
612,
814,
816,
821,
829,
838,
839,
902,
903,
1104,
1106,
1112,
1121,
1131,
1132,
1196,
1197,
1383,
1386,
1392,
1401,
1410,
1411,
1460,
1461,
1547,
1549,
1554,
1563,
1573,
1574,
1719,
1720,
1916,
1918,
1924,
1933,
1942,
1943,
2019,
2020,
2219,
2221,
2227,
2236,
2245,
2246,
2276,
2277,
2478,
2480,
2486,
2495,
2505,
2506,
2566,
2567,
2745,
2747,
2753,
2762,
2771,
2772,
2852,
2853,
3052,
3054,
3059,
3068,
3077,
3078,
3128,
3129,
3325,
3327,
3333,
3342,
3352,
3353,
3382,
3383,
3584,
3586,
3591,
3599,
3608,
3609,
3650,
3651,
3849,
3851,
3857,
3866,
3875,
3876,
3914,
3915,
4050,
4052,
4057,
4066,
4076,
4077,
4127,
4128,
4325,
4327,
4332,
4340,
4349,
4350,
4399,
4400,
4602,
4604,
4610,
4619,
4629,
4630,
4722,
4723,
4899,
4901,
4906,
4914,
4923,
4924,
4998,
4999,
5199,
5201,
5207,
5215,
5224,
5225,
5258,
5259,
5439,
5441,
5447,
5456,
5465,
5466,
5520,
5521,
5717,
5719,
5725,
5734,
5743,
5744,
5771,
5772,
5974,
5976,
5982,
5990,
5999,
6000,
6031,
6032,
6235,
6237,
6243,
6252,
6261,
6262,
6324,
6325,
6526,
6528,
6534,
6542,
6551,
6552,
6620,
6621,
6812,
6814,
6819,
6828,
6838,
6839,
6869,
6870,
7072,
7074,
7079,
7087,
7096,
7097,
7135,
7136,
7331,
7333,
7339,
7347,
7356,
7357,
7394,
7395,
7596,
7598,
7604,
7613,
7622,
7623,
7673,
7674,
7878,
7880,
7886,
7895,
7905,
7906,
7946,
7947,
8142,
8144,
8150,
8159,
8168,
8169,
8202,
8203,
8407,
8409,
8415,
8424,
8433,
8434,
8489,
8490,
8693,
8695,
8701,
8710,
8720,
8721,
8747,
8748,
8952,
8954,
8959,
8967,
8976,
8977,
9074,
9075,
9279,
9281,
9287,
9296,
9305,
9306,
9350,
9351,
9546,
9548,
9553,
9562,
9571,
9572,
9640,
9641,
9846,
9848,
9853,
9862,
9871,
9872,
9950,
9951,
10104,
10106,
10112,
10120,
10129,
10130,
10169,
10170,
10374,
10376,
10381,
10389,
10399,
10400,
10446,
10447,
10647,
10649,
10655,
10663,
10673,
10674,
10747,
10748,
10952,
10954,
10960,
10968,
10977,
10978,
11022,
11023,
11227,
11229,
11235,
11244,
11253,
11254,
11294,
11295,
11493,
11495,
11501,
11510,
11519,
11520,
11579,
11580,
11668,
11670,
11676,
11685,
11695,
11696,
11717,
11718,
11914,
11916,
11922,
11931,
11940,
11941,
12003,
12004,
12206,
12208,
12214,
12222,
12231,
12232,
12296,
12297,
12498,
12500,
12506,
12515,
12525,
12526,
12594,
12595,
12705,
12707,
12713,
12721,
12730,
12731,
12795,
12796,
12995,
12997,
13003,
13011,
13020,
13021,
13064,
13065,
13217,
13219,
13224,
13233,
13242,
13243,
13314,
13315,
13514,
13515
],
"line_end_idx": [
2,
7,
15,
24,
25,
106,
107,
311,
313,
318,
326,
335,
336,
367,
368,
542,
544,
549,
558,
568,
569,
611,
612,
814,
816,
821,
829,
838,
839,
902,
903,
1104,
1106,
1112,
1121,
1131,
1132,
1196,
1197,
1383,
1386,
1392,
1401,
1410,
1411,
1460,
1461,
1547,
1549,
1554,
1563,
1573,
1574,
1719,
1720,
1916,
1918,
1924,
1933,
1942,
1943,
2019,
2020,
2219,
2221,
2227,
2236,
2245,
2246,
2276,
2277,
2478,
2480,
2486,
2495,
2505,
2506,
2566,
2567,
2745,
2747,
2753,
2762,
2771,
2772,
2852,
2853,
3052,
3054,
3059,
3068,
3077,
3078,
3128,
3129,
3325,
3327,
3333,
3342,
3352,
3353,
3382,
3383,
3584,
3586,
3591,
3599,
3608,
3609,
3650,
3651,
3849,
3851,
3857,
3866,
3875,
3876,
3914,
3915,
4050,
4052,
4057,
4066,
4076,
4077,
4127,
4128,
4325,
4327,
4332,
4340,
4349,
4350,
4399,
4400,
4602,
4604,
4610,
4619,
4629,
4630,
4722,
4723,
4899,
4901,
4906,
4914,
4923,
4924,
4998,
4999,
5199,
5201,
5207,
5215,
5224,
5225,
5258,
5259,
5439,
5441,
5447,
5456,
5465,
5466,
5520,
5521,
5717,
5719,
5725,
5734,
5743,
5744,
5771,
5772,
5974,
5976,
5982,
5990,
5999,
6000,
6031,
6032,
6235,
6237,
6243,
6252,
6261,
6262,
6324,
6325,
6526,
6528,
6534,
6542,
6551,
6552,
6620,
6621,
6812,
6814,
6819,
6828,
6838,
6839,
6869,
6870,
7072,
7074,
7079,
7087,
7096,
7097,
7135,
7136,
7331,
7333,
7339,
7347,
7356,
7357,
7394,
7395,
7596,
7598,
7604,
7613,
7622,
7623,
7673,
7674,
7878,
7880,
7886,
7895,
7905,
7906,
7946,
7947,
8142,
8144,
8150,
8159,
8168,
8169,
8202,
8203,
8407,
8409,
8415,
8424,
8433,
8434,
8489,
8490,
8693,
8695,
8701,
8710,
8720,
8721,
8747,
8748,
8952,
8954,
8959,
8967,
8976,
8977,
9074,
9075,
9279,
9281,
9287,
9296,
9305,
9306,
9350,
9351,
9546,
9548,
9553,
9562,
9571,
9572,
9640,
9641,
9846,
9848,
9853,
9862,
9871,
9872,
9950,
9951,
10104,
10106,
10112,
10120,
10129,
10130,
10169,
10170,
10374,
10376,
10381,
10389,
10399,
10400,
10446,
10447,
10647,
10649,
10655,
10663,
10673,
10674,
10747,
10748,
10952,
10954,
10960,
10968,
10977,
10978,
11022,
11023,
11227,
11229,
11235,
11244,
11253,
11254,
11294,
11295,
11493,
11495,
11501,
11510,
11519,
11520,
11579,
11580,
11668,
11670,
11676,
11685,
11695,
11696,
11717,
11718,
11914,
11916,
11922,
11931,
11940,
11941,
12003,
12004,
12206,
12208,
12214,
12222,
12231,
12232,
12296,
12297,
12498,
12500,
12506,
12515,
12525,
12526,
12594,
12595,
12705,
12707,
12713,
12721,
12730,
12731,
12795,
12796,
12995,
12997,
13003,
13011,
13020,
13021,
13064,
13065,
13217,
13219,
13224,
13233,
13242,
13243,
13314,
13315,
13514,
13515,
13532
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 13532,
"ccnet_original_nlines": 401,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34967556595802307,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04758471995592117,
"rps_doc_frac_lines_end_with_ellipsis": 0.09950248897075653,
"rps_doc_frac_no_alph_words": 0.1741168051958084,
"rps_doc_frac_unique_words": 0.31506258249282837,
"rps_doc_mean_word_length": 4.561933517456055,
"rps_doc_num_sentences": 160,
"rps_doc_symbol_to_word_ratio": 0.015140590257942677,
"rps_doc_unigram_entropy": 5.711146831512451,
"rps_doc_word_count": 2317,
"rps_doc_frac_chars_dupe_10grams": 0.01078523974865675,
"rps_doc_frac_chars_dupe_5grams": 0.05610217899084091,
"rps_doc_frac_chars_dupe_6grams": 0.03084200993180275,
"rps_doc_frac_chars_dupe_7grams": 0.02611164003610611,
"rps_doc_frac_chars_dupe_8grams": 0.019489120692014694,
"rps_doc_frac_chars_dupe_9grams": 0.019489120692014694,
"rps_doc_frac_chars_top_2gram": 0.013623460195958614,
"rps_doc_frac_chars_top_3gram": 0.01135289017111063,
"rps_doc_frac_chars_top_4gram": 0.005676439963281155,
"rps_doc_books_importance": -1039.3294677734375,
"rps_doc_books_importance_length_correction": -1039.3294677734375,
"rps_doc_openwebtext_importance": -583.5864868164062,
"rps_doc_openwebtext_importance_length_correction": -583.5864868164062,
"rps_doc_wikipedia_importance": -356.44659423828125,
"rps_doc_wikipedia_importance_length_correction": -356.44659423828125
},
"fasttext": {
"dclm": 0.06327593326568604,
"english": 0.9143028855323792,
"fineweb_edu_approx": 1.2560924291610718,
"eai_general_math": 0.017330169677734375,
"eai_open_web_math": 0.12644779682159424,
"eai_web_code": 0.0026539000682532787
}
}
|
{
"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": "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": "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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
1,027,387,445,828,933,400 |
Beating motion sickness
Do you worry about travelling because you are often affected by motion sickness? You should know that it is possible to reduce the symptoms and even to prevent them.
WHAT ARE THE SYMPTOMS OF MOTION SICKNESS?
Nausea and vomiting are the best known symptoms of motion sickness. They are usually preceded by a general feeling of discomfort, pallor (especially around the mouth), and cold sweats. Other individuals may yawn, suffer from frontal headaches, experience drowsiness, increased salivation or rapid breathing.
WHAT ARE THE CAUSES OF MOTION SICKNESS?
Typically, motion sickness occurs when your body feels movement that your eyes have not detected. This is the case, for instance, in the car. However, the reverse situation can also occur, that is, your eyes perceive movement that your body does not feel. The IMAX cinema or flight simulators are examples of this phenomenon. You see the horizon change quickly, but your body is not moving at all.
The mode of transportation influences the incidence of motion sickness. A cruise has a higher risk of inducing it than travel by airplane or car. The train is the mode of transportation that is least likely to cause motion sickness.
MOTION SICKNESS
WHAT ARE THE FACTORS THAT PROMOTE MOTION SICKNESS?
Most people adjust to the disparity between what the eyes perceive and the body feels. Motion sickness is a lot less frequent after repeated exposure to the same stimulus. Thus, motion sickness is generally much more common in children. Children who travel by airplane for the first time have a higher risk of motion sickness than those who have used that mode of transportation two or more times.
Motion sickness risks
How can motion sickness be treated?
The effectiveness of certain treatments such as acupressure, herbal remedies, and homeopathy has not yet been thoroughly proven. These treatments can have a positive effect on certain people, but their effectiveness is anecdotal. There are three over-the-counter medications available that have proven to be effective. Each one has its advantages and its potential side effects.
Scopolamine (Transderm-V®)
This medication prevents nausea very effectively, but is not an effective treatment once symptoms are already present. Transderm-V® comes in the form of a small patch to be placed behind the ear. The medication is absorbed by the skin and then reaches the central nervous system. It must be applied six to twelve hours prior to departure. The patch can be left in place for three days. It can be used solely for adults. Since its action is sustained, it is very useful for cruises and long trips by airplane.
Dimenhydrinate (Gravol®, etc.)
This medication effectively prevents and relieves nausea. Dimenhydrinate (Gravol®, etc.) is available in tablet, suppository, and syrup form. The different dosages make it possible to administer this medication to children starting at age two and to adults. To prevent motion sickness, it must be taken at least 30 minutes, and ideally one to two hours, prior to departure. Its effect can last for six to eight hours, depending on the chosen formulation. Due to its rapid action and its short-term effectiveness, dimenhydrinate is very useful for short trips such as by car or by airplane.
Meclizine (Bonamine®)
This medication effectively prevents and relieves nausea associated with motion sickness. To prevent motion sickness, a single dose a day of meclizine must be taken, at least one hour prior to departure. Meclizine is recommended for children over 12 and for adults. Due to its rapid action and its 24-hour duration of action, it is recommended for travel by car, airplane or for cruises of medium to long duration.
These three medications cause drowsiness. Avoid alcohol and activities requiring vigilance.
Note that some studies have revealed that ginger, a natural product, could have significant effectiveness against motion sickness. It would have the advantage of not causing drowsiness, contrary to the other products. Ginger in tablet and lozenge form is one of the products available by the manufacturers of Gravol®.
Don't hesitate to speak to your pharmacist if you have any questions about motion sickness or the available treatments.
×
Send to a friend
Beating motion sickness
Do you worry about travelling because you are often affected by motion sickness? You should know that it is possible to reduce the symptoms and even to prevent them.
From:
To:
Loading...
|
{
"url": "https://www.jeancoutu.com/en/health/health-tips/beating-motion-sickness/",
"source_domain": "www.jeancoutu.com",
"snapshot_id": "crawl=CC-MAIN-2019-26",
"warc_metadata": {
"Content-Length": "306142",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QKFXVEHUJKZPS6HL5T3PCNVN36VWU76O",
"WARC-Concurrent-To": "<urn:uuid:0a3f8b02-74d2-4dbd-ad26-1c3719d24e5a>",
"WARC-Date": "2019-06-18T21:42:21Z",
"WARC-IP-Address": "204.101.154.59",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VH7QJL5UWQ4CBMP6NTRVXDFO4OSZDBT5",
"WARC-Record-ID": "<urn:uuid:7eaaaf6f-e54f-469d-87f4-70f2146c0387>",
"WARC-Target-URI": "https://www.jeancoutu.com/en/health/health-tips/beating-motion-sickness/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:f467ed57-46d2-41f6-b309-c26ca8d7d2db>"
},
"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-13-190-31.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
24,
25,
191,
192,
234,
235,
543,
544,
584,
585,
983,
984,
1217,
1218,
1234,
1235,
1286,
1287,
1686,
1687,
1709,
1710,
1746,
1747,
1749,
1750,
2129,
2130,
2157,
2158,
2668,
2669,
2700,
2701,
3291,
3292,
3314,
3315,
3730,
3731,
3823,
3824,
4142,
4143,
4264,
4265,
4267,
4268,
4285,
4286,
4310,
4311,
4477,
4483,
4487,
4488
],
"line_end_idx": [
24,
25,
191,
192,
234,
235,
543,
544,
584,
585,
983,
984,
1217,
1218,
1234,
1235,
1286,
1287,
1686,
1687,
1709,
1710,
1746,
1747,
1749,
1750,
2129,
2130,
2157,
2158,
2668,
2669,
2700,
2701,
3291,
3292,
3314,
3315,
3730,
3731,
3823,
3824,
4142,
4143,
4264,
4265,
4267,
4268,
4285,
4286,
4310,
4311,
4477,
4483,
4487,
4488,
4498
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4498,
"ccnet_original_nlines": 56,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41877254843711853,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03369434177875519,
"rps_doc_frac_lines_end_with_ellipsis": 0.017543859779834747,
"rps_doc_frac_no_alph_words": 0.12996390461921692,
"rps_doc_frac_unique_words": 0.4138889014720917,
"rps_doc_mean_word_length": 5.054166793823242,
"rps_doc_num_sentences": 53,
"rps_doc_symbol_to_word_ratio": 0.0012033700477331877,
"rps_doc_unigram_entropy": 5.120449066162109,
"rps_doc_word_count": 720,
"rps_doc_frac_chars_dupe_10grams": 0.08573783934116364,
"rps_doc_frac_chars_dupe_5grams": 0.1368507742881775,
"rps_doc_frac_chars_dupe_6grams": 0.1269579529762268,
"rps_doc_frac_chars_dupe_7grams": 0.1269579529762268,
"rps_doc_frac_chars_dupe_8grams": 0.08573783934116364,
"rps_doc_frac_chars_dupe_9grams": 0.08573783934116364,
"rps_doc_frac_chars_top_2gram": 0.08463864028453827,
"rps_doc_frac_chars_top_3gram": 0.021984059363603592,
"rps_doc_frac_chars_top_4gram": 0.012640840373933315,
"rps_doc_books_importance": -351.8868103027344,
"rps_doc_books_importance_length_correction": -351.8868103027344,
"rps_doc_openwebtext_importance": -241.40737915039062,
"rps_doc_openwebtext_importance_length_correction": -241.40737915039062,
"rps_doc_wikipedia_importance": -147.7911376953125,
"rps_doc_wikipedia_importance_length_correction": -147.7911376953125
},
"fasttext": {
"dclm": 0.21059179306030273,
"english": 0.9521889090538025,
"fineweb_edu_approx": 2.860785722732544,
"eai_general_math": 0.19933712482452393,
"eai_open_web_math": 0.23362517356872559,
"eai_web_code": 0.007095749955624342
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "615.822",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Materia medica, Drugs, and Pharmacy"
}
},
"secondary": {
"code": "615.8",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Materia medica, Drugs, and Pharmacy"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "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": "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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
355,669,681,089,409,000 |
1. TechSpot is dedicated to computer enthusiasts and power users. Ask a question and give support. Join the community here.
TechSpot is dedicated to computer enthusiasts and power users.
Ask a question and give support.
Join the community here, it only takes a minute.
Dismiss Notice
Explorer won't load (Win XP)
By KerrybianTulip · 4 replies
Oct 30, 2006
1. I managed to make our new office PC stop working. It came from our IT department with many programs preinstalled including google desktop, google world, and other google programs on the desktop.
I wanted to see if it was possible to keep all the google programs from loading, and I went about it entirely in the wrong way.
I moved the entire Google folder from C:/Program Files to a temporary folder I created in My Documents. Then, I restarted my computer. After windows loads and I log in as the administrator, explorer.exe does not load as a process. My startbar, and desktop therefore do not load. I tried to run explorer.exe through the task manager(which works fine) and the start bar pops up for a fraction of a second and then vanishes.
To attempt to fix this, I ran My Documents and Program Files through task manager and put the Google folder back where it was. I restarted again, and I still get nothing. I restarted and ran in safe mode, with the same problem. I also tried to perform a system restore to no avail.
I'm being a bit lazy by trying to avoid having to do another install of Windows XP completely, or send my computer back to the IT department which would almost guarantee that I would not see it again for about 3 months, because they're so backed up. If anyone has any solutions or suggestions, please let me know. Thank you in advance :)
2. cfitzarl
cfitzarl TechSpot Chancellor Posts: 1,975 +9
Try to uninstall all of those programs and see if that makes a difference (maybe?). I would've told you to go to msconfig, but you can't load up the run command can you? If you can do that and enter msconfig, and then have the comptuer start in Normal Startup.
3. Gars
Gars TS Booster Posts: 227
try some Registry Repair utility
see if google stuf installs any services and get rid of them
regards
4. Do ctrl alt del, find explorer.exe in the process list and kill the process. Go back to the first tab and click the button near the bottom "new task", enter "explorer.exe". If the explorer starts ok then run "msconfig" if not run msconfig in the same way as you've just run explorer. This will get you to msconfig. Uncheck all of the "process this" and process that" lines and go to the startup section. Uncheck everything in the list, taking note of what was checked before, and go to the services tab. Select hide all microsoft services and uncheck those that remain. Ok and exit, restart when it tells you.
5. KerrybianTulip
KerrybianTulip TS Rookie Topic Starter
success ^^
I ran msconfig through task manager and managed to find a system restore point that DID work. Thank you all so much for your help and suggestions, I appreciate it so much.
-Kerry
Topic Status:
Not open for further replies.
Similar Topics
Add New Comment
You need to be a member to leave a comment. Join thousands of tech enthusiasts and participate.
TechSpot Account You may also...
|
{
"url": "http://www.techspot.com/community/topics/explorer-wont-load-win-xp.61942/",
"source_domain": "www.techspot.com",
"snapshot_id": "crawl=CC-MAIN-2017-13",
"warc_metadata": {
"Content-Length": "49775",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:HWUKQPBYAMCW3OUKX6ZSUYLFUA7WFG7C",
"WARC-Concurrent-To": "<urn:uuid:0dd63ba0-be26-4ac4-8a23-b1f9b30df408>",
"WARC-Date": "2017-03-23T06:32:39Z",
"WARC-IP-Address": "184.173.241.66",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:5XRYMMXLX6Q7QW4ZXHQMKOUZRDXH5SFN",
"WARC-Record-ID": "<urn:uuid:dbb3c3ea-50fd-4bab-bfbe-777ed065521f>",
"WARC-Target-URI": "http://www.techspot.com/community/topics/explorer-wont-load-win-xp.61942/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8ade2762-be8c-4aab-91cc-f1343f733ac2>"
},
"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,
126,
193,
230,
283,
302,
303,
332,
333,
363,
376,
576,
577,
709,
710,
1136,
1137,
1423,
1424,
1766,
1772,
1786,
1787,
1838,
1839,
2104,
2110,
2120,
2121,
2152,
2153,
2190,
2255,
2256,
2268,
2274,
2889,
2895,
2915,
2916,
2959,
2960,
2975,
2976,
3152,
3153,
3164,
3170,
3184,
3214,
3215,
3230,
3231,
3247,
3248,
3344
],
"line_end_idx": [
126,
193,
230,
283,
302,
303,
332,
333,
363,
376,
576,
577,
709,
710,
1136,
1137,
1423,
1424,
1766,
1772,
1786,
1787,
1838,
1839,
2104,
2110,
2120,
2121,
2152,
2153,
2190,
2255,
2256,
2268,
2274,
2889,
2895,
2915,
2916,
2959,
2960,
2975,
2976,
3152,
3153,
3164,
3170,
3184,
3214,
3215,
3230,
3231,
3247,
3248,
3344,
3376
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3376,
"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.40379008650779724,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03935860097408295,
"rps_doc_frac_lines_end_with_ellipsis": 0.01785713993012905,
"rps_doc_frac_no_alph_words": 0.161807581782341,
"rps_doc_frac_unique_words": 0.4748700261116028,
"rps_doc_mean_word_length": 4.435008525848389,
"rps_doc_num_sentences": 47,
"rps_doc_symbol_to_word_ratio": 0.0014577299589291215,
"rps_doc_unigram_entropy": 5.141624927520752,
"rps_doc_word_count": 577,
"rps_doc_frac_chars_dupe_10grams": 0.07737396657466888,
"rps_doc_frac_chars_dupe_5grams": 0.07737396657466888,
"rps_doc_frac_chars_dupe_6grams": 0.07737396657466888,
"rps_doc_frac_chars_dupe_7grams": 0.07737396657466888,
"rps_doc_frac_chars_dupe_8grams": 0.07737396657466888,
"rps_doc_frac_chars_dupe_9grams": 0.07737396657466888,
"rps_doc_frac_chars_top_2gram": 0.007815550081431866,
"rps_doc_frac_chars_top_3gram": 0.01484955009073019,
"rps_doc_frac_chars_top_4gram": 0.016412660479545593,
"rps_doc_books_importance": -334.7506103515625,
"rps_doc_books_importance_length_correction": -334.7506103515625,
"rps_doc_openwebtext_importance": -179.80368041992188,
"rps_doc_openwebtext_importance_length_correction": -179.80368041992188,
"rps_doc_wikipedia_importance": -105.6504898071289,
"rps_doc_wikipedia_importance_length_correction": -105.6504898071289
},
"fasttext": {
"dclm": 0.08217710256576538,
"english": 0.9401557445526123,
"fineweb_edu_approx": 1.0176995992660522,
"eai_general_math": 0.08741384744644165,
"eai_open_web_math": 0.21294766664505005,
"eai_web_code": 0.019764240831136703
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-7,720,618,112,464,563,000 |
What is food mineral?
Minerals are inorganic elements that originate in the earth and cannot be made in the body. They play important roles in various bodily functions and are necessary to sustain life and maintain optimal health, and thus are essential nutrients.
Thursday, September 23, 2021
Low vitamin E intake enhance selenium deficiency
Selenium is a micronutrient that is essential for the proper functioning of all organisms. Selenium, in the form of selenoproteins, carries out various functions in normal health and metabolism. This element is a cofactor of many enzymes, for example, glutathione peroxidase or thioredoxin reductase.
Selenium plays a role in the immune system functioning and the progression of HIV to AIDS. Selenium deficiency has been implicated in cardiovascular disease, infertility, myodegenerative diseases, and cognitive decline.
Selenium exhibits synergy with vitamin E. In metabolic processes, sulfur amino acids such as cystine and methionine are closely associated with it. The combined interaction of selenium and tocopherol gives the best results in the protection of organs against the destructive effects of free radicals. Combined administration of selenium and vitamin E results in an immunostimulatory effect.
Selenium deficiency occurs when there is inadequate dietary intake of selenium, typically due to a scarcity of selenium sources in a given region. Interestingly, low vitamin E intake may enhance the effect of selenium deficiency, which is associated with increased risk of fatal cancer.
Individuals whose blood (serum) selenium level is low with deficiencies of vitamin E accompanied are at the increased risk of developing cancer. In healthy individuals, the level of this element in blood is higher by several percent in comparison with those who suffer from cancer.
Low vitamin E intake enhance selenium deficiency
The Most Popular Articles
• Rice plant cultivation - The rice plant is a member of Poaceae (old Gramineae) family. The common cultivated rice plant is an annual which usually grows to a height of a half meter...
|
{
"url": "https://www.foodmineral.com/2021/09/low-vitamin-e-intake-enhance-selenium.html",
"source_domain": "www.foodmineral.com",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "53579",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Q6WIY4Y52WOIILCVMDCISUQWL6JKUSZK",
"WARC-Concurrent-To": "<urn:uuid:935236c3-cc86-4a29-b8fc-4b6a8aefd3fb>",
"WARC-Date": "2021-12-02T00:00:56Z",
"WARC-IP-Address": "172.217.0.51",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:UHEOZI56FSJRUGPYKC3XGOPIDWTGN7QG",
"WARC-Record-ID": "<urn:uuid:10280e2c-f5f5-46ca-9307-c283dad0dcc7>",
"WARC-Target-URI": "https://www.foodmineral.com/2021/09/low-vitamin-e-intake-enhance-selenium.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:71951463-8f6a-4fb6-b174-ab2880081f8d>"
},
"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-155\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,
22,
23,
266,
267,
296,
297,
346,
347,
648,
649,
869,
870,
1261,
1262,
1549,
1550,
1832,
1882,
1883,
1909,
1910
],
"line_end_idx": [
22,
23,
266,
267,
296,
297,
346,
347,
648,
649,
869,
870,
1261,
1262,
1549,
1550,
1832,
1882,
1883,
1909,
1910,
2097
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2097,
"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.35393258929252625,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02247191034257412,
"rps_doc_frac_lines_end_with_ellipsis": 0.04545455053448677,
"rps_doc_frac_no_alph_words": 0.11516854166984558,
"rps_doc_frac_unique_words": 0.5566037893295288,
"rps_doc_mean_word_length": 5.427672863006592,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0.002808989956974983,
"rps_doc_unigram_entropy": 4.717100620269775,
"rps_doc_word_count": 318,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.048667438328266144,
"rps_doc_frac_chars_dupe_6grams": 0.048667438328266144,
"rps_doc_frac_chars_dupe_7grams": 0.048667438328266144,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02780997008085251,
"rps_doc_frac_chars_top_3gram": 0.019119350239634514,
"rps_doc_frac_chars_top_4gram": 0.02954808995127678,
"rps_doc_books_importance": -184.9244842529297,
"rps_doc_books_importance_length_correction": -184.9244842529297,
"rps_doc_openwebtext_importance": -83.84648132324219,
"rps_doc_openwebtext_importance_length_correction": -83.84648132324219,
"rps_doc_wikipedia_importance": -54.33329391479492,
"rps_doc_wikipedia_importance_length_correction": -54.33329391479492
},
"fasttext": {
"dclm": 0.0735209584236145,
"english": 0.9329378604888916,
"fineweb_edu_approx": 3.180615186691284,
"eai_general_math": 0.22610247135162354,
"eai_open_web_math": 0.582748532295227,
"eai_web_code": 0.0021368900779634714
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "613.2",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Health and Hygiene"
}
},
"secondary": {
"code": "572.6",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Biology and Anthropology",
"level_3": "Anthropology"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
9,132,459,101,166,109,000 |
aboutsummaryrefslogtreecommitdiff
path: root/textproc/libvisio01
Commit message (Collapse)AuthorAgeFilesLines
* Remove WWW entries moved into port MakefilesStefan Eßer2022-09-071-2/+0
| | | | | | | | | | Commit b7f05445c00f has added WWW entries to port Makefiles based on WWW: lines in pkg-descr files. This commit removes the WWW: lines of moved-over URLs from these pkg-descr files. Approved by: portmgr (tcberner)
* Add WWW entries to port MakefilesStefan Eßer2022-09-071-0/+1
| | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | It has been common practice to have one or more URLs at the end of the ports' pkg-descr files, one per line and prefixed with "WWW:". These URLs should point at a project website or other relevant resources. Access to these URLs required processing of the pkg-descr files, and they have often become stale over time. If more than one such URL was present in a pkg-descr file, only the first one was tarnsfered into the port INDEX, but for many ports only the last line did contain the port specific URL to further information. There have been several proposals to make a project URL available as a macro in the ports' Makefiles, over time. This commit implements such a proposal and moves one of the WWW: entries of each pkg-descr file into the respective port's Makefile. A heuristic attempts to identify the most relevant URL in case there is more than one WWW: entry in some pkg-descr file. URLs that are not moved into the Makefile are prefixed with "See also:" instead of "WWW:" in the pkg-descr files in order to preserve them. There are 1256 ports that had no WWW: entries in pkg-descr files. These ports will not be touched in this commit. The portlint port has been adjusted to expect a WWW entry in each port Makefile, and to flag any remaining "WWW:" lines in pkg-descr files as deprecated. Approved by: portmgr (tcberner)
* */*: bump all consumers after recent boost upgradeDima Panov2022-08-121-1/+1
|
* textproc/libxml2: bump all LIB_DEPENDS consumersCharlie Li2022-04-101-1/+1
| | | | | | | | This is a separate commit to facilitate easier cherry-picking for quarterly. PR: 262853, 262940, 262877, 263126 Approved by: fluffy (mentor)
* devel/icu: update to 71.1Jan Beich2022-04-071-1/+1
| | | | | | | | Changes: https://github.com/unicode-org/icu/releases/tag/release-71-1 Reported by: GitHub (watch releases) PR: 262654 Exp-run by: antoine Approved by: fluffy
* textproc/libxml2: bump all dependenciesMatthias Fechner2022-03-261-1/+1
| | | | | This should make sure that all dependent ports will pick up the new version commited with a13ec21cd733f67a9fc0dc00ab45268bdc236246
* devel/icu: update to 70.1Jan Beich2021-10-281-1/+1
| | | | | | | Changes: https://github.com/unicode-org/icu/releases/tag/release-70-1 Reported by: GitHub (watch releases) PR: 258794 Exp-run by: antoine
* devel/icu: update to 69.1Jan Beich2021-04-081-1/+1
| | | | | Changes: https://github.com/unicode-org/icu/releases/tag/release-69-1 Reported by: GitHub (watch releases)
* One more small cleanup, forgotten yesterday.Mathieu Arnold2021-04-071-1/+0
| | | | Reported by: lwhsu
* Remove # $FreeBSD$ from Makefiles.Mathieu Arnold2021-04-061-1/+0
|
* devel/icu: update to 68.1Jan Beich2020-11-031-1/+1
| | | | | | | | | Changes: http://site.icu-project.org/download/68 ABI: https://abi-laboratory.pro/tracker/timeline/icu4c/ Reported by: GitHub (watch releases) Notes: svn path=/head/; revision=553940
* devel/icu: update to 67.1Jan Beich2020-04-231-1/+1
| | | | | | | | | Changes: http://site.icu-project.org/download/67 ABI: https://abi-laboratory.pro/tracker/timeline/icu4c/ Reported by: GitHub (watch releases) Notes: svn path=/head/; revision=532707
* devel/icu: update to 66.1Jan Beich2020-03-131-0/+1
| | | | | | | | Changes: http://site.icu-project.org/download/66 ABI: https://abi-laboratory.pro/tracker/timeline/icu4c/ Notes: svn path=/head/; revision=528343
* update to 0.1.7Baptiste Daroussin2019-12-263-6/+5
| | | | Notes: svn path=/head/; revision=520908
* devel/boost-*: update to 1.72.0Jan Beich2019-12-111-1/+1
| | | | | | | | | | Changes: http://www.boost.org/users/history/version_1_72_0.html PR: 241449 Exp-run by: antoine Differential Revision: https://reviews.freebsd.org/D22136 Notes: svn path=/head/; revision=519824
* textproc: Add missing USES={gnome,php}Tobias Kortkamp2019-11-081-1/+1
| | | | Notes: svn path=/head/; revision=517055
* devel/icu: update to 65.1Jan Beich2019-10-031-1/+1
| | | | | | | | Changes: http://site.icu-project.org/download/65 ABI: https://abi-laboratory.pro/tracker/timeline/icu4c/ Notes: svn path=/head/; revision=513733
* devel/boost-*: update to 1.71.0Jan Beich2019-08-191-1/+1
| | | | | | | | | | Changes: http://www.boost.org/users/history/version_1_71_0.html PR: 238827 Exp-run by: antoine Differential Revision: https://reviews.freebsd.org/D20774 Notes: svn path=/head/; revision=509290
* Bump PORTREVISION for ports depending on the canonical version of GCCGerald Pfeifer2019-07-261-1/+1
| | | | | | | | | | | | | | | | | | as defined in Mk/bsd.default-versions.mk which has moved from GCC 8.3 to GCC 9.1 under most circumstances now after revision 507371. This includes ports - with USE_GCC=yes or USE_GCC=any, - with USES=fortran, - using Mk/bsd.octave.mk which in turn features USES=fortran, and - with USES=compiler specifying openmp, nestedfct, c11, c++0x, c++11-lang, c++11-lib, c++14-lang, c++17-lang, or gcc-c++11-lib plus, everything INDEX-11 shows with a dependency on lang/gcc9 now. PR: 238330 Notes: svn path=/head/; revision=507372
* devel/boost-*: update to 1.70.0Jan Beich2019-04-121-1/+1
| | | | | | | | | | Changes: http://www.boost.org/users/history/version_1_70_0.html PR: 235956 Exp-run by: antoine Differential Revision: https://reviews.freebsd.org/D19303 Notes: svn path=/head/; revision=498698
* devel/icu: update to 64.1Jan Beich2019-03-271-1/+1
| | | | | | | | | | | Changes: http://site.icu-project.org/download/64 ABI: https://abi-laboratory.pro/tracker/timeline/icu4c/ PR: 236325 Exp-run by: antoine Differential Revision: https://reviews.freebsd.org/D19479 Notes: svn path=/head/; revision=496981
* Bump PORTREVISION for ports depending on the canonical version of GCCGerald Pfeifer2018-12-121-1/+1
| | | | | | | | | | | | | | | | | | defined via Mk/bsd.default-versions.mk which has moved from GCC 7.4 t GCC 8.2 under most circumstances. This includes ports - with USE_GCC=yes or USE_GCC=any, - with USES=fortran, - using Mk/bsd.octave.mk which in turn features USES=fortran, and - with USES=compiler specifying openmp, nestedfct, c11, c++0x, c++11-lang, c++11-lib, c++14-lang, c++17-lang, or gcc-c++11-lib plus, as a double check, everything INDEX-11 showed depending on lang/gcc7. PR: 231590 Notes: svn path=/head/; revision=487272
* devel/boost-*: update to 1.69.0Jan Beich2018-12-121-1/+1
| | | | | | | | | | Changes: http://www.boost.org/users/history/version_1_69_0.html PR: 232525 Exp-run by: antoine Differential Revision: https://reviews.freebsd.org/D17645 Notes: svn path=/head/; revision=487266
* devel/icu: update to 63.1Jan Beich2018-10-231-1/+1
| | | | | | | | | | Changes: http://site.icu-project.org/download/63 ABI: https://abi-laboratory.pro/tracker/timeline/icu4c/ PR: 232300 Exp-run by: antoine Notes: svn path=/head/; revision=482830
* devel/boost-*: update to 1.68.0Jan Beich2018-08-091-1/+1
| | | | | | | | | | | | - Switch to C++14 for libboost_system to support C++14 consumers Changes: http://www.boost.org/users/history/version_1_68_0.html PR: 229569 Exp-run by: antoine Differential Revision: https://reviews.freebsd.org/D16165 Notes: svn path=/head/; revision=476723
* Bump PORTREVISION for ports depending on the canonical version of GCCGerald Pfeifer2018-07-291-1/+1
| | | | | | | | | | | | | | | | | in the ports tree (via Mk/bsd.default-versions.mk and lang/gcc) which has now moved from GCC 6 to GCC 7 by default. This includes ports - featuring USE_GCC=yes or USE_GCC=any, - featuring USES=fortran, - using Mk/bsd.octave.mk which in turn features USES=fortran, and those - with USES=compiler specifying one of openmp, nestedfct, c11, c++0x, c++11-lib, c++11-lang, c++14-lang, c++17-lang, or gcc-c++11-lib. PR: 222542 Notes: svn path=/head/; revision=475857
* devel/icu: update to 62.1Jan Beich2018-06-291-1/+1
| | | | | | | | | | Changes: http://site.icu-project.org/download/62 ABI: https://abi-laboratory.pro/tracker/timeline/icu4c/ PR: 229359 Exp-run by: antoine (only 10.4) Notes: svn path=/head/; revision=473551
* devel/boost-*: update to 1.67.0Jan Beich2018-04-181-1/+1
| | | | | | | | | | Changes: http://www.boost.org/users/history/version_1_67_0.html PR: 227427 Exp-run by: antoine Differential Revision: https://reviews.freebsd.org/D15030 Notes: svn path=/head/; revision=467711
* devel/icu: update to 61.1Jan Beich2018-04-061-1/+1
| | | | | | | | | | | Changes: http://site.icu-project.org/download/61 ABI: https://abi-laboratory.pro/tracker/timeline/icu4c/ PR: 227042 Exp-run by: antoine MFH: 2018Q2 (required by Firefox 61) Notes: svn path=/head/; revision=466648
* devel/boost-*: update to 1.66.0Jan Beich2018-01-181-1/+1
| | | | | | | | | | Changes: http://www.boost.org/users/history/version_1_66_0.html PR: 223922 Exp-run by: antoine Differential Revision: https://reviews.freebsd.org/D13279 Notes: svn path=/head/; revision=459315
* Don't use MASTER_SITE_SUBDIR when it is not needed.Mathieu Arnold2017-11-241-2/+1
| | | | | | | Sponsored by: Absolight Notes: svn path=/head/; revision=454828
* devel/icu: update to 60.1Jan Beich2017-11-091-0/+1
| | | | | | | | | | Changes: http://site.icu-project.org/download/60 ABI: https://abi-laboratory.pro/tracker/timeline/icu4c/ PR: 223373 Exp-run by: antoine Notes: svn path=/head/; revision=453790
* Update to 0.1.6.Jung-uk Kim2017-10-254-11/+12
| | | | Notes: svn path=/head/; revision=452888
* devel/boost-*: update to 1.65.1Jan Beich2017-09-251-1/+1
| | | | | | | | | | | | Changes: http://www.boost.org/users/history/version_1_65_1.html PR: 218835 Approved by: maintainer timeout (1.65.1: 2 weeks; 1.65.0: 1 month) Tested by: jhibbits (on powerpc64, earlier version) Exp-run by: antoine Differential Revision: https://reviews.freebsd.org/D11582 Notes: svn path=/head/; revision=450560
* devel/boost-*: enable C++11 featuresJan Beich2017-09-251-1/+1
| | | | | | | | | | | PR: 218835 Obtained from: https://github.com/DragonFlyBSD/DeltaPorts/pull/690 Approved by: maintainer timeout (2 months) Exp-run by: antoine Differential Revision: https://reviews.freebsd.org/D11582 Notes: svn path=/head/; revision=450557
* devel/icu: update to 59.1Jan Beich2017-09-251-1/+1
| | | | | | | | | | | | - Temporarily keep C++98 working in consumers for Clang's default -std= Changes: http://site.icu-project.org/download/59 PR: 218788 Submitted by: [email protected], [email protected] (early version) Exp-run by: antoine Notes: svn path=/head/; revision=450556
* Update and sort LICENSESunpoet Po-Chuan Hsieh2017-09-241-1/+2
| | | | | | | - Add LICENSE_FILE Notes: svn path=/head/; revision=450523
* Bump PORTREVISION for ports depending on the canonical version of GCCGerald Pfeifer2017-09-101-1/+1
| | | | | | | | | | | | | | | | | (via Mk/bsd.default-versions.mk and lang/gcc) which has moved from GCC 5.4 to GCC 6.4 under most circumstances. This includes ports - with USE_GCC=yes or USE_GCC=any, - with USES=fortran, - using Mk/bsd.octave.mk which in turn features USES=fortran, and - with USES=compiler specifying openmp, nestedfct, c++11-lib, c++11-lang, c++14-lang, c++0x, c11, or gcc-c++11-lib. PR: 219275 Notes: svn path=/head/; revision=449591
* devel/boost-*: update to 1.64.0Jan Beich2017-05-021-1/+1
| | | | | | | | | | | Changes: http://www.boost.org/users/history/version_1_64_0.html PR: 218835 Approved by: office (bapt) Exp-run by: antoine Differential Revision: https://reviews.freebsd.org/D10472 Notes: svn path=/head/; revision=439934
* Bump PORTREVISIONs for ports depending on the canonical version of GCC andGerald Pfeifer2017-04-011-1/+1
| | | | | | | | | | | | | | | | | lang/gcc which have moved from GCC 4.9.4 to GCC 5.4 (at least under some circumstances such as versions of FreeBSD or platforms). This includes ports - with USE_GCC=yes or USE_GCC=any, - with USES=fortran, - using using Mk/bsd.octave.mk which in turn has USES=fortran, and - with USES=compiler specifying openmp, nestedfct, c++11-lib, c++14-lang, c++11-lang, c++0x, c11, or gcc-c++11-lib. PR: 216707 Notes: svn path=/head/; revision=437439
* devel/boost-*: update to 1.63.0Jan Beich2017-01-061-1/+1
| | | | | | | | | | | Changes: http://www.boost.org/users/history/version_1_63_0.html PR: 215598 Exp-run by: antoine Approved by: office (bapt) MFH: 2017Q1 Notes: svn path=/head/; revision=430692
* Assume "pkg-config --static zlib" works after 9.x EOLJan Beich2017-01-031-4/+1
| | | | | | | | Many hacks simply removed dependency on zlib which broke static linking if it was actually supported. Notes: svn path=/head/; revision=430509
* devel/boost-*: update to 1.62.0Jan Beich2016-11-231-1/+1
| | | | | | | | | | | | | | | - Enable `long double` C99 math usage - Switch 9.x back to building with GCC Changes: http://www.boost.org/users/history/ PR: 199601 Submitted by: Chen Xu, bapt, amdmi3, truckman (based on) Reviewed by: rakuco (kde) (earlier version) Exp-run by: antoine (3 tries), truckman (consumers only, earlier versions) Approved by: bapt (office) Notes: svn path=/head/; revision=426908
* devel/icu: update to 58.1Jan Beich2016-11-191-1/+1
| | | | | | | | | | Changes: http://site.icu-project.org/download/58 PR: 214384 Exp-run by: antoine Approved by: office (bapt) Notes: svn path=/head/; revision=426525
* - Update devel/icu to 57.1.Tijl Coosemans2016-09-241-2/+2
| | | | | | | | | | | | | | | | | | | | | | | | | | | | - Clean up the Makefile. - Follow some upstream recommendations (--with-data-packaging=archive, --disable-renaming, -DICU_NO_USER_DATA_OVERRIDE). - Patch makefiles to install static libraries with INSTALL_DATA so they aren't stripped. - Patch config/mh-bsd-gcc to sync with config/mh-linux-gcc. - Fix endianness detection in ICU. The code wanted to use BYTE_ORDER defined in machine/endian.h, but this isn't visible because ICU is compiled with _XOPEN_SOURCE. Patch the code to use _BYTE_ORDER instead. - Compile ICU with C++11 compiler to enable move constructors. - Patch ICU to fix a problem with atomics in the case of a C++11 compiler without C++11 header <atomic> (like Clang on FreeBSD 9). - Bump all ports that depend on it due to library version change. - Add USES=compiler:c++0x to some ports that pick up -std=c++0x from ICU pkgconfig files. - Add USES=compiler:c++11-lib to graphics/libcdr01 because it also needs a C++11 runtime library now. Add this to all ports that depend on it so their executables load the right libstdc++.so on FreeBSD 9. PR: 205120 Exp-run by: antoine Approved by: portmgr (antoine) Notes: svn path=/head/; revision=422711
* Bump PORTREVISION for the icu revert.Mathieu Arnold2016-07-061-1/+1
| | | | | | | | | | | | This time not bumping lang/php70, but devel/php70-intl which is the one really depending on icu. PR: 205120 With hat: portmgr Sponsored by: Absolight Notes: svn path=/head/; revision=418153
* devel/icu: bump PORTREVISION on dependent portsPietro Cerutti2016-07-061-0/+1
| | | | Notes: svn path=/head/; revision=418119
* Remove ${PORTSDIR}/ from dependencies, categories r, s, t, and u.Mathieu Arnold2016-04-011-3/+3
| | | | | | | | With hat: portmgr Sponsored by: Absolight Notes: svn path=/head/; revision=412349
* Update to 0.1.5Baptiste Daroussin2016-01-163-4/+4
| | | | Notes: svn path=/head/; revision=406228
* Update to 0.1.4.Jung-uk Kim2016-01-083-4/+4
| | | | Notes: svn path=/head/; revision=405581
|
{
"url": "https://cgit.freebsd.org/ports/log/textproc/libvisio01?showmsg=1",
"source_domain": "cgit.freebsd.org",
"snapshot_id": "crawl=CC-MAIN-2022-40",
"warc_metadata": {
"Content-Length": "57164",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PXZZQQTPV5Y5VN2CZUJMZD3HY3RP6GP6",
"WARC-Concurrent-To": "<urn:uuid:e52dba97-aa7e-4474-9325-e744f552d55d>",
"WARC-Date": "2022-10-05T05:34:07Z",
"WARC-IP-Address": "96.47.72.110",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YQ2AWIH4FQB6M5R2ERFMO4XYTYTLGOHL",
"WARC-Record-ID": "<urn:uuid:b36b174e-3668-44bf-90a4-48242ef17ce5>",
"WARC-Target-URI": "https://cgit.freebsd.org/ports/log/textproc/libvisio01?showmsg=1",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e8746d6a-e3ba-4244-9d85-acd230592819>"
},
"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-82\r\nsoftware: Apache Nutch 1.19 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
34,
65,
110,
184,
418,
481,
1877,
1956,
1958,
2035,
2192,
2245,
2419,
2493,
2634,
2687,
2839,
2892,
3009,
3086,
3113,
3180,
3182,
3235,
3435,
3488,
3688,
3741,
3902,
3954,
4002,
4061,
4274,
4346,
4394,
4447,
4608,
4667,
4880,
4982,
5539,
5598,
5811,
5864,
6120,
6222,
6758,
6817,
7030,
7083,
7279,
7338,
7620,
7722,
8216,
8269,
8477,
8536,
8749,
8802,
9037,
9096,
9309,
9393,
9471,
9524,
9720,
9768,
9816,
9875,
10211,
10275,
10536,
10589,
10879,
10943,
11016,
11118,
11573,
11632,
11874,
11981,
12455,
12514,
12710,
12791,
12949,
13008,
13414,
13467,
13634,
13694,
14910,
14980,
15194,
15274,
15322,
15420,
15518,
15570,
15618,
15664
],
"line_end_idx": [
34,
65,
110,
184,
418,
481,
1877,
1956,
1958,
2035,
2192,
2245,
2419,
2493,
2634,
2687,
2839,
2892,
3009,
3086,
3113,
3180,
3182,
3235,
3435,
3488,
3688,
3741,
3902,
3954,
4002,
4061,
4274,
4346,
4394,
4447,
4608,
4667,
4880,
4982,
5539,
5598,
5811,
5864,
6120,
6222,
6758,
6817,
7030,
7083,
7279,
7338,
7620,
7722,
8216,
8269,
8477,
8536,
8749,
8802,
9037,
9096,
9309,
9393,
9471,
9524,
9720,
9768,
9816,
9875,
10211,
10275,
10536,
10589,
10879,
10943,
11016,
11118,
11573,
11632,
11874,
11981,
12455,
12514,
12710,
12791,
12949,
13008,
13414,
13467,
13634,
13694,
14910,
14980,
15194,
15274,
15322,
15420,
15518,
15570,
15618,
15664,
15711
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 15711,
"ccnet_original_nlines": 102,
"rps_doc_curly_bracket": 0.0002545999886933714,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.11915087699890137,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03241268917918205,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5279616713523865,
"rps_doc_frac_unique_words": 0.3584672510623932,
"rps_doc_mean_word_length": 6.947465896606445,
"rps_doc_num_sentences": 220,
"rps_doc_symbol_to_word_ratio": 0.00022826000349596143,
"rps_doc_unigram_entropy": 5.577329158782959,
"rps_doc_word_count": 1618,
"rps_doc_frac_chars_dupe_10grams": 0.0963437408208847,
"rps_doc_frac_chars_dupe_5grams": 0.2372564673423767,
"rps_doc_frac_chars_dupe_6grams": 0.17658570408821106,
"rps_doc_frac_chars_dupe_7grams": 0.14055688679218292,
"rps_doc_frac_chars_dupe_8grams": 0.134329691529274,
"rps_doc_frac_chars_dupe_9grams": 0.12481095641851425,
"rps_doc_frac_chars_top_2gram": 0.028467219322919846,
"rps_doc_frac_chars_top_3gram": 0.05693443864583969,
"rps_doc_frac_chars_top_4gram": 0.026421140879392624,
"rps_doc_books_importance": -1509.1429443359375,
"rps_doc_books_importance_length_correction": -1509.1429443359375,
"rps_doc_openwebtext_importance": -1082.796142578125,
"rps_doc_openwebtext_importance_length_correction": -1082.796142578125,
"rps_doc_wikipedia_importance": -800.5903930664062,
"rps_doc_wikipedia_importance_length_correction": -800.5903930664062
},
"fasttext": {
"dclm": 1.0000100135803223,
"english": 0.7173069715499878,
"fineweb_edu_approx": 1.4195585250854492,
"eai_general_math": 0.05963457003235817,
"eai_open_web_math": 0.30704689025878906,
"eai_web_code": 0.6885556578636169
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.455",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "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": "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": "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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
5,093,922,025,418,418,000 |
XmlDsigExcC14NTransform Classe
Définition
Représente la transformation, sans commentaires, selon les spécifications de canonisation (C14N) XML exclusive d'une signature numérique définies par le W3C (World Wide Web Consortium).Represents the exclusive C14N XML canonicalization transform for a digital signature as defined by the World Wide Web Consortium (W3C), without comments.
public ref class XmlDsigExcC14NTransform : System::Security::Cryptography::Xml::Transform
public class XmlDsigExcC14NTransform : System.Security.Cryptography.Xml.Transform
type XmlDsigExcC14NTransform = class
inherit Transform
Public Class XmlDsigExcC14NTransform
Inherits Transform
Héritage
XmlDsigExcC14NTransform
Dérivé
Exemples
L’exemple de code suivant montre comment signer un document XML avec la classe XmlDsigExcC14NTransform à l’aide d’une signature d’enveloppe.The following code example shows how to sign an XML document with the XmlDsigExcC14NTransform class using an envelope signature.
//
// This example signs an XML file using an
// envelope signature. It then verifies the
// signed XML.
//
#using <System.Xml.dll>
#using <System.Security.dll>
#using <System.dll>
using namespace System;
using namespace System::Security::Cryptography;
using namespace System::Security::Cryptography::X509Certificates;
using namespace System::Security::Cryptography::Xml;
using namespace System::Text;
using namespace System::Xml;
// Sign an XML file and save the signature in a new file.
static void SignXmlFile( String^ FileName, String^ SignedFileName, RSA^ Key )
{
// Create a new XML document.
XmlDocument^ doc = gcnew XmlDocument;
// Format the document to ignore white spaces.
doc->PreserveWhitespace = false;
// Load the passed XML file using it's name.
doc->Load( gcnew XmlTextReader( FileName ) );
// Create a SignedXml object.
SignedXml^ signedXml = gcnew SignedXml( doc );
// Add the key to the SignedXml document.
signedXml->SigningKey = Key;
// Specify a canonicalization method.
signedXml->SignedInfo->CanonicalizationMethod = SignedXml::XmlDsigExcC14NTransformUrl;
// Set the InclusiveNamespacesPrefixList property.
XmlDsigExcC14NTransform^ canMethod = dynamic_cast<XmlDsigExcC14NTransform^>(signedXml->SignedInfo->CanonicalizationMethodObject);
canMethod->InclusiveNamespacesPrefixList = L"Sign";
// Create a reference to be signed.
Reference^ reference = gcnew Reference;
reference->Uri = L"";
// Add an enveloped transformation to the reference.
XmlDsigEnvelopedSignatureTransform^ env = gcnew XmlDsigEnvelopedSignatureTransform;
reference->AddTransform( env );
// Add the reference to the SignedXml object.
signedXml->AddReference( reference );
// Add an RSAKeyValue KeyInfo (optional; helps recipient find key to validate).
KeyInfo^ keyInfo = gcnew KeyInfo;
keyInfo->AddClause( gcnew RSAKeyValue( dynamic_cast<RSA^>(Key) ) );
signedXml->KeyInfo = keyInfo;
// Compute the signature.
signedXml->ComputeSignature();
// Get the XML representation of the signature and save
// it to an XmlElement object.
XmlElement^ xmlDigitalSignature = signedXml->GetXml();
// Append the element to the XML document.
doc->DocumentElement->AppendChild( doc->ImportNode( xmlDigitalSignature, true ) );
if ( dynamic_cast<XmlDeclaration^>(doc->FirstChild) )
{
doc->RemoveChild( doc->FirstChild );
}
// Save the signed XML document to a file specified
// using the passed string.
XmlTextWriter^ xmltw = gcnew XmlTextWriter( SignedFileName,gcnew UTF8Encoding( false ) );
doc->WriteTo( xmltw );
xmltw->Close();
}
// Verify the signature of an XML file and return the result.
static Boolean VerifyXmlFile( String^ Name )
{
// Create a new XML document.
XmlDocument^ xmlDocument = gcnew XmlDocument;
// Format using white spaces.
xmlDocument->PreserveWhitespace = true;
// Load the passed XML file into the document.
xmlDocument->Load( Name );
// Create a new SignedXml object and pass it
// the XML document class.
SignedXml^ signedXml = gcnew SignedXml( xmlDocument );
// Find the "Signature" node and create a new
// XmlNodeList object.
XmlNodeList^ nodeList = xmlDocument->GetElementsByTagName( L"Signature" );
// Load the signature node.
signedXml->LoadXml( dynamic_cast<XmlElement^>(nodeList->Item( 0 )) );
// Check the signature and return the result.
return signedXml->CheckSignature();
}
// Create example data to sign.
static void CreateSomeXml( String^ FileName )
{
// Create a new XmlDocument object.
XmlDocument^ document = gcnew XmlDocument;
// Create a new XmlNode object.
XmlNode^ node = document->CreateNode( XmlNodeType::Element, L"", L"MyXML", L"Don't_Sign" );
// Append the node to the document.
document->AppendChild( node );
// Create a new XmlNode object.
XmlNode^ subnode = document->CreateNode( XmlNodeType::Element, L"", L"TempElement", L"Sign" );
// Add some text to the node.
subnode->InnerText = L"Here is some data to sign.";
// Append the node to the document.
document->DocumentElement->AppendChild( subnode );
// Save the XML document to the file name specified.
XmlTextWriter^ xmltw = gcnew XmlTextWriter( FileName,gcnew UTF8Encoding( false ) );
document->WriteTo( xmltw );
xmltw->Close();
}
int main()
{
try
{
// Generate a signing key.
RSACryptoServiceProvider^ Key = gcnew RSACryptoServiceProvider;
// Create an XML file to sign.
CreateSomeXml( L"Example.xml" );
Console::WriteLine( L"New XML file created." );
// Sign the XML that was just created and save it in a
// new file.
SignXmlFile( L"Example.xml", L"SignedExample.xml", Key );
Console::WriteLine( L"XML file signed." );
// Verify the signature of the signed XML.
Console::WriteLine( L"Verifying signature..." );
bool result = VerifyXmlFile( L"SignedExample.xml" );
// Display the results of the signature verification to \
// the console.
if ( result )
{
Console::WriteLine( L"The XML signature is valid." );
}
else
{
Console::WriteLine( L"The XML signature is not valid." );
}
}
catch ( CryptographicException^ e )
{
Console::WriteLine( e->Message );
}
return 1;
}
//
// This example signs an XML file using an
// envelope signature. It then verifies the
// signed XML.
//
using System;
using System.Security.Cryptography;
using System.Security.Cryptography.X509Certificates;
using System.Security.Cryptography.Xml;
using System.Text;
using System.Xml;
public class SignVerifyEnvelope
{
public static void Main(String[] args)
{
try
{
// Generate a signing key.
RSACryptoServiceProvider Key = new RSACryptoServiceProvider();
// Create an XML file to sign.
CreateSomeXml("Example.xml");
Console.WriteLine("New XML file created.");
// Sign the XML that was just created and save it in a
// new file.
SignXmlFile("Example.xml", "SignedExample.xml", Key);
Console.WriteLine("XML file signed.");
// Verify the signature of the signed XML.
Console.WriteLine("Verifying signature...");
bool result = VerifyXmlFile("SignedExample.xml");
// Display the results of the signature verification to \
// the console.
if (result)
{
Console.WriteLine("The XML signature is valid.");
}
else
{
Console.WriteLine("The XML signature is not valid.");
}
}
catch (CryptographicException e)
{
Console.WriteLine(e.Message);
}
}
// Sign an XML file and save the signature in a new file.
public static void SignXmlFile(string FileName, string SignedFileName, RSA Key)
{
// Create a new XML document.
XmlDocument doc = new XmlDocument();
// Format the document to ignore white spaces.
doc.PreserveWhitespace = false;
// Load the passed XML file using it's name.
doc.Load(new XmlTextReader(FileName));
// Create a SignedXml object.
SignedXml signedXml = new SignedXml(doc);
// Add the key to the SignedXml document.
signedXml.SigningKey = Key;
// Specify a canonicalization method.
signedXml.SignedInfo.CanonicalizationMethod = SignedXml.XmlDsigExcC14NTransformUrl;
// Set the InclusiveNamespacesPrefixList property.
XmlDsigExcC14NTransform canMethod = (XmlDsigExcC14NTransform)signedXml.SignedInfo.CanonicalizationMethodObject;
canMethod.InclusiveNamespacesPrefixList = "Sign";
// Create a reference to be signed.
Reference reference = new Reference();
reference.Uri = "";
// Add an enveloped transformation to the reference.
XmlDsigEnvelopedSignatureTransform env = new XmlDsigEnvelopedSignatureTransform();
reference.AddTransform(env);
// Add the reference to the SignedXml object.
signedXml.AddReference(reference);
// Add an RSAKeyValue KeyInfo (optional; helps recipient find key to validate).
KeyInfo keyInfo = new KeyInfo();
keyInfo.AddClause(new RSAKeyValue((RSA)Key));
signedXml.KeyInfo = keyInfo;
// Compute the signature.
signedXml.ComputeSignature();
// Get the XML representation of the signature and save
// it to an XmlElement object.
XmlElement xmlDigitalSignature = signedXml.GetXml();
// Append the element to the XML document.
doc.DocumentElement.AppendChild(doc.ImportNode(xmlDigitalSignature, true));
if (doc.FirstChild is XmlDeclaration)
{
doc.RemoveChild(doc.FirstChild);
}
// Save the signed XML document to a file specified
// using the passed string.
XmlTextWriter xmltw = new XmlTextWriter(SignedFileName, new UTF8Encoding(false));
doc.WriteTo(xmltw);
xmltw.Close();
}
// Verify the signature of an XML file and return the result.
public static Boolean VerifyXmlFile(String Name)
{
// Create a new XML document.
XmlDocument xmlDocument = new XmlDocument();
// Format using white spaces.
xmlDocument.PreserveWhitespace = true;
// Load the passed XML file into the document.
xmlDocument.Load(Name);
// Create a new SignedXml object and pass it
// the XML document class.
SignedXml signedXml = new SignedXml(xmlDocument);
// Find the "Signature" node and create a new
// XmlNodeList object.
XmlNodeList nodeList = xmlDocument.GetElementsByTagName("Signature");
// Load the signature node.
signedXml.LoadXml((XmlElement)nodeList[0]);
// Check the signature and return the result.
return signedXml.CheckSignature();
}
// Create example data to sign.
public static void CreateSomeXml(string FileName)
{
// Create a new XmlDocument object.
XmlDocument document = new XmlDocument();
// Create a new XmlNode object.
XmlNode node = document.CreateNode(XmlNodeType.Element, "", "MyXML", "Don't_Sign");
// Append the node to the document.
document.AppendChild(node);
// Create a new XmlNode object.
XmlNode subnode = document.CreateNode(XmlNodeType.Element, "", "TempElement", "Sign");
// Add some text to the node.
subnode.InnerText = "Here is some data to sign.";
// Append the node to the document.
document.DocumentElement.AppendChild(subnode);
// Save the XML document to the file name specified.
XmlTextWriter xmltw = new XmlTextWriter(FileName, new UTF8Encoding(false));
document.WriteTo(xmltw);
xmltw.Close();
}
}
'
' This example signs an XML file using an
' envelope signature. It then verifies the
' signed XML.
'
Imports System.Security.Cryptography
Imports System.Security.Cryptography.X509Certificates
Imports System.Security.Cryptography.Xml
Imports System.Text
Imports System.Xml
Module SignVerifyEnvelope
Sub Main(ByVal args() As String)
Try
' Generate a signing key.
Dim Key As New RSACryptoServiceProvider()
' Create an XML file to sign.
CreateSomeXml("Example.xml")
Console.WriteLine("New XML file created.")
' Sign the XML that was just created and save it in a
' new file.
SignXmlFile("Example.xml", "SignedExample.xml", Key)
Console.WriteLine("XML file signed.")
' Verify the signature of the signed XML.
Console.WriteLine("Verifying signature...")
Dim result As Boolean = VerifyXmlFile("SignedExample.xml")
' Display the results of the signature verification to
' the console.
If result Then
Console.WriteLine("The XML signature is valid.")
Else
Console.WriteLine("The XML signature is not valid.")
End If
Catch e As CryptographicException
Console.WriteLine(e.Message)
End Try
End Sub
' Sign an XML file and save the signature in a new file.
Sub SignXmlFile(ByVal FileName As String, ByVal SignedFileName As String, ByVal Key As RSA)
' Create a new XML document.
Dim doc As New XmlDocument()
' Format the document to ignore white spaces.
doc.PreserveWhitespace = False
' Load the passed XML file using it's name.
doc.Load(New XmlTextReader(FileName))
' Create a SignedXml object.
Dim signedXml As New SignedXml(doc)
' Add the key to the SignedXml document.
signedXml.SigningKey = Key
' Specify a canonicalization method.
signedXml.SignedInfo.CanonicalizationMethod = signedXml.XmlDsigExcC14NTransformUrl
' Set the InclusiveNamespacesPrefixList property.
Dim canMethod As XmlDsigExcC14NTransform = CType(signedXml.SignedInfo.CanonicalizationMethodObject, XmlDsigExcC14NTransform)
canMethod.InclusiveNamespacesPrefixList = "Sign"
' Create a reference to be signed.
Dim reference As New Reference()
reference.Uri = ""
' Add an enveloped transformation to the reference.
Dim env As New XmlDsigEnvelopedSignatureTransform()
reference.AddTransform(env)
' Add the reference to the SignedXml object.
signedXml.AddReference(reference)
' Add an RSAKeyValue KeyInfo (optional; helps recipient find key to validate).
Dim keyInfo As New KeyInfo()
keyInfo.AddClause(New RSAKeyValue(CType(Key, RSA)))
signedXml.KeyInfo = keyInfo
' Compute the signature.
signedXml.ComputeSignature()
' Get the XML representation of the signature and save
' it to an XmlElement object.
Dim xmlDigitalSignature As XmlElement = signedXml.GetXml()
' Append the element to the XML document.
doc.DocumentElement.AppendChild(doc.ImportNode(xmlDigitalSignature, True))
If TypeOf doc.FirstChild Is XmlDeclaration Then
doc.RemoveChild(doc.FirstChild)
End If
' Save the signed XML document to a file specified
' using the passed string.
Dim xmltw As New XmlTextWriter(SignedFileName, New UTF8Encoding(False))
doc.WriteTo(xmltw)
xmltw.Close()
End Sub
' Verify the signature of an XML file and return the result.
Function VerifyXmlFile(ByVal Name As String) As [Boolean]
' Create a new XML document.
Dim xmlDocument As New XmlDocument()
' Format using white spaces.
xmlDocument.PreserveWhitespace = True
' Load the passed XML file into the document.
xmlDocument.Load(Name)
' Create a new SignedXml object and pass it
' the XML document class.
Dim signedXml As New SignedXml(xmlDocument)
' Find the "Signature" node and create a new
' XmlNodeList object.
Dim nodeList As XmlNodeList = xmlDocument.GetElementsByTagName("Signature")
' Load the signature node.
signedXml.LoadXml(CType(nodeList(0), XmlElement))
' Check the signature and return the result.
Return signedXml.CheckSignature()
End Function
' Create example data to sign.
Sub CreateSomeXml(ByVal FileName As String)
' Create a new XmlDocument object.
Dim document As New XmlDocument()
' Create a new XmlNode object.
Dim node As XmlNode = document.CreateNode(XmlNodeType.Element, "", "MyXML", "Don't_Sign")
' Append the node to the document.
document.AppendChild(node)
' Create a new XmlNode object.
Dim subnode As XmlNode = document.CreateNode(XmlNodeType.Element, "", "TempElement", "Sign")
' Add some text to the node.
subnode.InnerText = "Here is some data to sign."
' Append the node to the document.
document.DocumentElement.AppendChild(subnode)
' Save the XML document to the file name specified.
Dim xmltw As New XmlTextWriter(FileName, New UTF8Encoding(False))
document.WriteTo(xmltw)
xmltw.Close()
End Sub
End Module
Remarques
La classe XmlDsigExcC14NTransform représente la transformation de canonisation (C14N) XML exclusive sans commentaires.The XmlDsigExcC14NTransform class represents the exclusive C14N XML canonicalization transform without comments. Cette classe est semblable à la classe XmlDsigC14NTransform, qui permet à un signataire de créer un condensé à l’aide de la forme canonique d’un document XML.This class is similar to the XmlDsigC14NTransform class, which allows a signer to create a digest using the canonical form of an XML document. Toutefois, la classe XmlDsigExcC14NTransform exclut le contexte de l’ancêtre d’un sous-document canonique.However, the XmlDsigExcC14NTransform class excludes ancestor context from a canonicalized subdocument.
Utilisez la classe XmlDsigC14NTransform lorsque vous devez rendre canonique un sous-document XML pour qu’il soit indépendant de son contexte XML.Use the XmlDsigC14NTransform class when you need to canonicalize an XML subdocument so that it is independent from its XML context. Par exemple, les applications telles que les services Web qui utilisent des XML signés dans des protocoles de communication complexes doivent souvent canonicaliser le XML de cette manière.For example, applications such as Web services that use signed XML within complex communication protocols often need to canonicalize XML in this manner. De telles applications enveloppent souvent du code XML dans différents éléments construits dynamiquement, ce qui peut modifier sensiblement le document et provoquer l’échec de la vérification de la signature XML.Such applications often envelop XML within various dynamically constructed elements, which can substantially change the document and cause XML signature verification to fail. La classe XmlDsigExcC14NTransform résout ce problème en excluant ce contexte d’ancêtre du sous-document canonique.The XmlDsigExcC14NTransform class solves this problem by excluding such ancestor context from the canonical subdocument.
En règle générale, vous ne créez pas une nouvelle instance d’une classe de transformation de canonisation.Typically, you do not create a new instance of a canonicalization transform class. Pour spécifier une transformation de canonisation, transmettez le Uniform Resource Identifier (URI) qui décrit une transformation à la propriété CanonicalizationMethod, qui est accessible à partir de la propriété SignedInfo.To specify a canonicalization transform, pass the Uniform Resource Identifier (URI) that describes a transform to the CanonicalizationMethod property, which is accessible from the SignedInfo property. Pour obtenir une référence à la transformation de canonisation, utilisez la propriété CanonicalizationMethodObject, qui est accessible à partir de la propriété SignedInfo.To acquire a reference to the canonicalization transform, use the CanonicalizationMethodObject property, which is accessible from the SignedInfo property.
Vous devez créer une nouvelle instance d’une classe de transformation de canonisation uniquement lorsque vous souhaitez hacher manuellement un document XML ou utiliser votre propre algorithme de canonisation.You are required to create a new instance of a canonicalization transform class only when you want to manually hash an XML document or use your own canonicalization algorithm.
L’URI qui décrit la classe XmlDsigExcC14NWithCommentsTransform est défini par le champ XmlDsigExcC14NWithCommentsTransformUrl.The URI that describes the XmlDsigExcC14NWithCommentsTransform class is defined by the XmlDsigExcC14NWithCommentsTransformUrl field.
L’URI qui décrit la classe XmlDsigExcC14NTransform est défini par le champ XmlDsigExcC14NTransformUrl.The URI that describes the XmlDsigExcC14NTransform class is defined by the XmlDsigExcC14NTransformUrl field.
Pour plus d’informations sur la transformation C14N exclusive, consultez la spécificationdu W3C sur XMLDSIG.For more information about the exclusive C14N transform, see the W3C XMLDSIG specification. L’algorithme de canonisation est défini dans la spécification XML canoniqueW3C.The canonicalization algorithm is defined in the W3C Canonical XML specification.
Constructeurs
XmlDsigExcC14NTransform()
Initialise une nouvelle instance de la classe XmlDsigExcC14NTransform.Initializes a new instance of the XmlDsigExcC14NTransform class.
XmlDsigExcC14NTransform(Boolean)
Initialise une nouvelle instance de la classe XmlDsigExcC14NTransform en spécifiant une valeur qui détermine s'il faut inclure des commentaires.Initializes a new instance of the XmlDsigExcC14NTransform class specifying a value that determines whether to include comments.
XmlDsigExcC14NTransform(Boolean, String)
Initialise une nouvelle instance de la classe XmlDsigExcC14NTransform en spécifiant s'il faut inclure des commentaires, ainsi qu'une liste de préfixes d'espace de noms.Initializes a new instance of the XmlDsigExcC14NTransform class specifying whether to include comments, and specifying a list of namespace prefixes.
XmlDsigExcC14NTransform(String)
Initialise une nouvelle instance de la classe XmlDsigExcC14NTransform en spécifiant une liste de préfixes d'espace de noms à canoniser à l'aide de l'algorithme canonisation standard.Initializes a new instance of the XmlDsigExcC14NTransform class specifying a list of namespace prefixes to canonicalize using the standard canonicalization algorithm.
Propriétés
Algorithm
Obtient ou définit l'URI (Uniform Resource Identifier) qui identifie l'algorithme exécuté par la transformation actuelle.Gets or sets the Uniform Resource Identifier (URI) that identifies the algorithm performed by the current transform.
(Hérité de Transform)
Context
Obtient ou définit un objet XmlElement qui représente le contexte de document dans lequel l'objet Transform actuel est exécuté.Gets or sets an XmlElement object that represents the document context under which the current Transform object is running.
(Hérité de Transform)
InclusiveNamespacesPrefixList
Obtient ou définit une chaîne qui contient des préfixes d'espace de noms à canoniser à l'aide de l'algorithme de canonisation standard.Gets or sets a string that contains namespace prefixes to canonicalize using the standard canonicalization algorithm.
InputTypes
Obtient un tableau de types qui constituent des entrées valides dans les méthodes LoadInput(Object) de l'objet XmlDsigExcC14NTransform en cours.Gets an array of types that are valid inputs to the LoadInput(Object) method of the current XmlDsigExcC14NTransform object.
OutputTypes
Obtient un tableau de types qui constituent des sorties valides des méthodes GetOutput() de l'objet XmlDsigExcC14NTransform en cours.Gets an array of types that are possible outputs from the GetOutput() methods of the current XmlDsigExcC14NTransform object.
PropagatedNamespaces
Obtient ou définit un objet Hashtable qui contient les espaces de noms qui sont propagés dans la signature.Gets or sets a Hashtable object that contains the namespaces that are propagated into the signature.
(Hérité de Transform)
Resolver
Définit l'objet XmlResolver en cours.Sets the current XmlResolver object.
(Hérité de Transform)
Méthodes
Equals(Object)
Détermine si l'objet spécifié est égal à l'objet actuel.Determines whether the specified object is equal to the current object.
(Hérité de Object)
GetDigestedOutput(HashAlgorithm)
Retourne le Digest associé à un objet XmlDsigExcC14NTransform.Returns the digest associated with a XmlDsigExcC14NTransform object.
GetHashCode()
Sert de fonction de hachage par défaut.Serves as the default hash function.
(Hérité de Object)
GetInnerXml()
Retourne une représentation XML des paramètres d'un objet XmlDsigExcC14NTransform pouvant être inclus comme sous-éléments d'un élément <Transform> XMLDSIG.Returns an XML representation of the parameters of a XmlDsigExcC14NTransform object that are suitable to be included as subelements of an XMLDSIG <Transform> element.
GetOutput()
Retourne la sortie de l'objet XmlDsigExcC14NTransform en cours.Returns the output of the current XmlDsigExcC14NTransform object.
GetOutput(Type)
Retourne la sortie de l'objet XmlDsigExcC14NTransform en cours en tant qu'objet du type spécifié.Returns the output of the current XmlDsigExcC14NTransform object as an object of the specified type.
GetType()
Obtient le Type de l'instance actuelle.Gets the Type of the current instance.
(Hérité de Object)
GetXml()
Retourne la représentation XML de l'objet Transform en cours.Returns the XML representation of the current Transform object.
(Hérité de Transform)
LoadInnerXml(XmlNodeList)
Analyse l'objet XmlNodeList spécifié en tant que contenu propre à la transformation d'un élément <Transform> et configure l'état interne de l'objet XmlDsigExcC14NTransform en cours pour qu'il corresponde à l'élément <Transform>.Parses the specified XmlNodeList object as transform-specific content of a <Transform> element and configures the internal state of the current XmlDsigExcC14NTransform object to match the <Transform> element.
LoadInput(Object)
En cas de substitution dans une classe dérivée, charge l'entrée spécifiée dans l'objet XmlDsigExcC14NTransform en cours.When overridden in a derived class, loads the specified input into the current XmlDsigExcC14NTransform object.
MemberwiseClone()
Crée une copie superficielle du Object actuel.Creates a shallow copy of the current Object.
(Hérité de Object)
ToString()
Retourne une chaîne qui représente l'objet actif.Returns a string that represents the current object.
(Hérité de Object)
S’applique à
|
{
"url": "https://docs.microsoft.com/fr-fr/dotnet/api/system.security.cryptography.xml.xmldsigexcc14ntransform?redirectedfrom=MSDN&view=netframework-4.8",
"source_domain": "docs.microsoft.com",
"snapshot_id": "crawl=CC-MAIN-2020-16",
"warc_metadata": {
"Content-Length": "98908",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LZ73YS2SS7YSW7TKBVLE7L4WVVEGYKOF",
"WARC-Concurrent-To": "<urn:uuid:aac9e5f0-0e0d-4207-b353-16848c1613af>",
"WARC-Date": "2020-04-05T17:54:34Z",
"WARC-IP-Address": "23.218.77.154",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:KFHTPGQQVFJ64NZC7VEJSHQPZSWHE3TJ",
"WARC-Record-ID": "<urn:uuid:d4a63330-d529-4c05-b56a-d109b3f28a7d>",
"WARC-Target-URI": "https://docs.microsoft.com/fr-fr/dotnet/api/system.security.cryptography.xml.xmldsigexcc14ntransform?redirectedfrom=MSDN&view=netframework-4.8",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0584239f-9dee-456d-9da0-3cffe05df608>"
},
"warc_info": "isPartOf: CC-MAIN-2020-16\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for March/April 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-155.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
31,
32,
43,
44,
383,
384,
474,
556,
593,
615,
652,
671,
680,
704,
711,
712,
721,
722,
991,
992,
995,
1038,
1083,
1098,
1101,
1125,
1154,
1174,
1175,
1199,
1247,
1313,
1366,
1396,
1425,
1426,
1484,
1562,
1564,
1568,
1601,
1642,
1646,
1696,
1732,
1736,
1784,
1833,
1837,
1870,
1920,
1924,
1970,
2002,
2006,
2047,
2137,
2141,
2203,
2336,
2391,
2395,
2434,
2477,
2502,
2506,
2562,
2649,
2684,
2688,
2737,
2778,
2782,
2865,
2902,
2973,
3006,
3010,
3039,
3073,
3077,
3136,
3170,
3228,
3232,
3278,
3364,
3421,
3426,
3469,
3474,
3475,
3479,
3534,
3565,
3658,
3684,
3703,
3705,
3706,
3707,
3769,
3814,
3816,
3820,
3853,
3902,
3906,
3939,
3982,
3986,
4037,
4067,
4071,
4119,
4149,
4207,
4211,
4260,
4286,
4364,
4368,
4399,
4472,
4476,
4525,
4564,
4566,
4567,
4568,
4600,
4646,
4648,
4652,
4691,
4737,
4741,
4776,
4871,
4875,
4914,
4948,
4952,
4987,
5085,
5089,
5122,
5177,
5181,
5220,
5274,
5278,
5334,
5421,
5452,
5471,
5473,
5474,
5485,
5487,
5494,
5499,
5506,
5539,
5609,
5616,
5653,
5692,
5746,
5753,
5815,
5834,
5898,
5947,
5954,
6003,
6058,
6117,
6124,
6188,
6210,
6230,
6238,
6301,
6309,
6320,
6328,
6395,
6403,
6408,
6448,
6453,
6493,
6498,
6499,
6512,
6514,
6515,
6518,
6561,
6606,
6621,
6624,
6638,
6674,
6727,
6767,
6786,
6804,
6805,
6837,
6839,
6840,
6883,
6889,
6901,
6911,
6950,
7025,
7026,
7069,
7111,
7167,
7168,
7236,
7261,
7327,
7378,
7379,
7434,
7491,
7553,
7554,
7624,
7652,
7676,
7690,
7756,
7770,
7787,
7801,
7871,
7885,
7895,
7936,
7946,
7988,
7998,
8004,
8005,
8067,
8151,
8157,
8195,
8240,
8241,
8296,
8336,
8337,
8390,
8437,
8438,
8476,
8526,
8527,
8578,
8614,
8615,
8661,
8753,
8754,
8821,
8941,
8999,
9000,
9044,
9091,
9119,
9120,
9181,
9272,
9309,
9310,
9364,
9407,
9408,
9496,
9537,
9591,
9628,
9629,
9663,
9701,
9702,
9766,
9805,
9866,
9867,
9918,
10002,
10003,
10049,
10059,
10104,
10114,
10115,
10175,
10211,
10301,
10329,
10352,
10358,
10424,
10477,
10483,
10521,
10574,
10575,
10613,
10660,
10661,
10717,
10749,
10750,
10803,
10838,
10896,
10897,
10951,
10982,
11060,
11061,
11097,
11149,
11150,
11204,
11247,
11253,
11254,
11290,
11344,
11350,
11394,
11444,
11445,
11485,
11577,
11578,
11622,
11658,
11659,
11699,
11794,
11795,
11833,
11891,
11892,
11936,
11991,
11992,
12053,
12137,
12170,
12193,
12199,
12201,
12203,
12245,
12289,
12303,
12305,
12342,
12396,
12437,
12457,
12476,
12477,
12478,
12479,
12505,
12506,
12507,
12544,
12556,
12594,
12648,
12649,
12691,
12732,
12787,
12788,
12855,
12879,
12944,
12994,
12995,
13049,
13105,
13176,
13177,
13245,
13272,
13299,
13364,
13381,
13450,
13469,
13470,
13512,
13553,
13569,
13570,
13582,
13583,
13584,
13645,
13741,
13778,
13815,
13816,
13870,
13909,
13910,
13962,
14008,
14009,
14046,
14090,
14091,
14141,
14176,
14177,
14222,
14313,
14314,
14373,
14506,
14563,
14564,
14607,
14648,
14675,
14676,
14736,
14796,
14832,
14833,
14886,
14928,
14929,
14930,
15017,
15054,
15114,
15150,
15151,
15184,
15221,
15222,
15285,
15323,
15390,
15391,
15441,
15524,
15525,
15526,
15582,
15626,
15641,
15642,
15701,
15736,
15816,
15843,
15865,
15866,
15878,
15879,
15944,
16006,
16043,
16088,
16089,
16126,
16172,
16173,
16228,
16259,
16260,
16312,
16346,
16398,
16399,
16452,
16482,
16566,
16567,
16602,
16660,
16661,
16714,
16756,
16757,
16774,
16775,
16776,
16811,
16859,
16902,
16944,
16945,
16984,
17082,
17083,
17126,
17161,
17162,
17201,
17302,
17303,
17340,
17397,
17398,
17441,
17495,
17496,
17556,
17630,
17662,
17684,
17685,
17697,
17708,
17709,
17719,
17720,
18461,
18462,
19702,
19703,
20643,
20644,
21028,
21029,
21288,
21289,
21500,
21501,
21862,
21863,
21877,
21878,
21904,
21905,
22040,
22041,
22074,
22075,
22347,
22348,
22389,
22390,
22707,
22708,
22740,
22741,
23090,
23091,
23102,
23103,
23113,
23114,
23352,
23353,
23375,
23383,
23384,
23635,
23636,
23658,
23688,
23689,
23942,
23943,
23954,
23955,
24223,
24224,
24236,
24237,
24495,
24496,
24517,
24518,
24726,
24727,
24749,
24758,
24759,
24833,
24834,
24856,
24857,
24866,
24867,
24882,
24883,
25011,
25012,
25031,
25064,
25065,
25196,
25197,
25211,
25212,
25288,
25289,
25308,
25322,
25323,
25645,
25646,
25658,
25659,
25788,
25789,
25805,
25806,
26004,
26005,
26015,
26016,
26094,
26095,
26114,
26123,
26124,
26249,
26250,
26272,
26298,
26299,
26736,
26737,
26755,
26756,
26987,
26988,
27006,
27007,
27099,
27100,
27119,
27130,
27131,
27233,
27234,
27253,
27254
],
"line_end_idx": [
31,
32,
43,
44,
383,
384,
474,
556,
593,
615,
652,
671,
680,
704,
711,
712,
721,
722,
991,
992,
995,
1038,
1083,
1098,
1101,
1125,
1154,
1174,
1175,
1199,
1247,
1313,
1366,
1396,
1425,
1426,
1484,
1562,
1564,
1568,
1601,
1642,
1646,
1696,
1732,
1736,
1784,
1833,
1837,
1870,
1920,
1924,
1970,
2002,
2006,
2047,
2137,
2141,
2203,
2336,
2391,
2395,
2434,
2477,
2502,
2506,
2562,
2649,
2684,
2688,
2737,
2778,
2782,
2865,
2902,
2973,
3006,
3010,
3039,
3073,
3077,
3136,
3170,
3228,
3232,
3278,
3364,
3421,
3426,
3469,
3474,
3475,
3479,
3534,
3565,
3658,
3684,
3703,
3705,
3706,
3707,
3769,
3814,
3816,
3820,
3853,
3902,
3906,
3939,
3982,
3986,
4037,
4067,
4071,
4119,
4149,
4207,
4211,
4260,
4286,
4364,
4368,
4399,
4472,
4476,
4525,
4564,
4566,
4567,
4568,
4600,
4646,
4648,
4652,
4691,
4737,
4741,
4776,
4871,
4875,
4914,
4948,
4952,
4987,
5085,
5089,
5122,
5177,
5181,
5220,
5274,
5278,
5334,
5421,
5452,
5471,
5473,
5474,
5485,
5487,
5494,
5499,
5506,
5539,
5609,
5616,
5653,
5692,
5746,
5753,
5815,
5834,
5898,
5947,
5954,
6003,
6058,
6117,
6124,
6188,
6210,
6230,
6238,
6301,
6309,
6320,
6328,
6395,
6403,
6408,
6448,
6453,
6493,
6498,
6499,
6512,
6514,
6515,
6518,
6561,
6606,
6621,
6624,
6638,
6674,
6727,
6767,
6786,
6804,
6805,
6837,
6839,
6840,
6883,
6889,
6901,
6911,
6950,
7025,
7026,
7069,
7111,
7167,
7168,
7236,
7261,
7327,
7378,
7379,
7434,
7491,
7553,
7554,
7624,
7652,
7676,
7690,
7756,
7770,
7787,
7801,
7871,
7885,
7895,
7936,
7946,
7988,
7998,
8004,
8005,
8067,
8151,
8157,
8195,
8240,
8241,
8296,
8336,
8337,
8390,
8437,
8438,
8476,
8526,
8527,
8578,
8614,
8615,
8661,
8753,
8754,
8821,
8941,
8999,
9000,
9044,
9091,
9119,
9120,
9181,
9272,
9309,
9310,
9364,
9407,
9408,
9496,
9537,
9591,
9628,
9629,
9663,
9701,
9702,
9766,
9805,
9866,
9867,
9918,
10002,
10003,
10049,
10059,
10104,
10114,
10115,
10175,
10211,
10301,
10329,
10352,
10358,
10424,
10477,
10483,
10521,
10574,
10575,
10613,
10660,
10661,
10717,
10749,
10750,
10803,
10838,
10896,
10897,
10951,
10982,
11060,
11061,
11097,
11149,
11150,
11204,
11247,
11253,
11254,
11290,
11344,
11350,
11394,
11444,
11445,
11485,
11577,
11578,
11622,
11658,
11659,
11699,
11794,
11795,
11833,
11891,
11892,
11936,
11991,
11992,
12053,
12137,
12170,
12193,
12199,
12201,
12203,
12245,
12289,
12303,
12305,
12342,
12396,
12437,
12457,
12476,
12477,
12478,
12479,
12505,
12506,
12507,
12544,
12556,
12594,
12648,
12649,
12691,
12732,
12787,
12788,
12855,
12879,
12944,
12994,
12995,
13049,
13105,
13176,
13177,
13245,
13272,
13299,
13364,
13381,
13450,
13469,
13470,
13512,
13553,
13569,
13570,
13582,
13583,
13584,
13645,
13741,
13778,
13815,
13816,
13870,
13909,
13910,
13962,
14008,
14009,
14046,
14090,
14091,
14141,
14176,
14177,
14222,
14313,
14314,
14373,
14506,
14563,
14564,
14607,
14648,
14675,
14676,
14736,
14796,
14832,
14833,
14886,
14928,
14929,
14930,
15017,
15054,
15114,
15150,
15151,
15184,
15221,
15222,
15285,
15323,
15390,
15391,
15441,
15524,
15525,
15526,
15582,
15626,
15641,
15642,
15701,
15736,
15816,
15843,
15865,
15866,
15878,
15879,
15944,
16006,
16043,
16088,
16089,
16126,
16172,
16173,
16228,
16259,
16260,
16312,
16346,
16398,
16399,
16452,
16482,
16566,
16567,
16602,
16660,
16661,
16714,
16756,
16757,
16774,
16775,
16776,
16811,
16859,
16902,
16944,
16945,
16984,
17082,
17083,
17126,
17161,
17162,
17201,
17302,
17303,
17340,
17397,
17398,
17441,
17495,
17496,
17556,
17630,
17662,
17684,
17685,
17697,
17708,
17709,
17719,
17720,
18461,
18462,
19702,
19703,
20643,
20644,
21028,
21029,
21288,
21289,
21500,
21501,
21862,
21863,
21877,
21878,
21904,
21905,
22040,
22041,
22074,
22075,
22347,
22348,
22389,
22390,
22707,
22708,
22740,
22741,
23090,
23091,
23102,
23103,
23113,
23114,
23352,
23353,
23375,
23383,
23384,
23635,
23636,
23658,
23688,
23689,
23942,
23943,
23954,
23955,
24223,
24224,
24236,
24237,
24495,
24496,
24517,
24518,
24726,
24727,
24749,
24758,
24759,
24833,
24834,
24856,
24857,
24866,
24867,
24882,
24883,
25011,
25012,
25031,
25064,
25065,
25196,
25197,
25211,
25212,
25288,
25289,
25308,
25322,
25323,
25645,
25646,
25658,
25659,
25788,
25789,
25805,
25806,
26004,
26005,
26015,
26016,
26094,
26095,
26114,
26123,
26124,
26249,
26250,
26272,
26298,
26299,
26736,
26737,
26755,
26756,
26987,
26988,
27006,
27007,
27099,
27100,
27119,
27130,
27131,
27233,
27234,
27253,
27254,
27266
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 27266,
"ccnet_original_nlines": 661,
"rps_doc_curly_bracket": 0.0013936799950897694,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.17074255645275116,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03134727105498314,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2832369804382324,
"rps_doc_frac_unique_words": 0.22658182680606842,
"rps_doc_mean_word_length": 7.0664544105529785,
"rps_doc_num_sentences": 349,
"rps_doc_symbol_to_word_ratio": 0.001333929947577417,
"rps_doc_unigram_entropy": 5.506816387176514,
"rps_doc_word_count": 2829,
"rps_doc_frac_chars_dupe_10grams": 0.3291481137275696,
"rps_doc_frac_chars_dupe_5grams": 0.5091291069984436,
"rps_doc_frac_chars_dupe_6grams": 0.4736131429672241,
"rps_doc_frac_chars_dupe_7grams": 0.4375969171524048,
"rps_doc_frac_chars_dupe_8grams": 0.4082337021827698,
"rps_doc_frac_chars_dupe_9grams": 0.36326345801353455,
"rps_doc_frac_chars_top_2gram": 0.006602969951927662,
"rps_doc_frac_chars_top_3gram": 0.011505180038511753,
"rps_doc_frac_chars_top_4gram": 0.0036016199737787247,
"rps_doc_books_importance": -2203.837158203125,
"rps_doc_books_importance_length_correction": -2203.837158203125,
"rps_doc_openwebtext_importance": -883.05859375,
"rps_doc_openwebtext_importance_length_correction": -883.05859375,
"rps_doc_wikipedia_importance": -414.52801513671875,
"rps_doc_wikipedia_importance_length_correction": -414.52801513671875
},
"fasttext": {
"dclm": 0.886568546295166,
"english": 0.2543456256389618,
"fineweb_edu_approx": 2.3920950889587402,
"eai_general_math": 0.5182327628135681,
"eai_open_web_math": 0.23018670082092285,
"eai_web_code": 0.8909748792648315
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.72",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-1,624,186,292,805,394,700 |
教師資料查詢 | 類別: 專利 | 教師: 王建凱 Chien-Kai Wang (瀏覽個人網頁)
標題：Device and method for measuring distribution of atomic resolution deformation
學年103
學期2
專利開始日期2015/04/07
作品名稱Device and method for measuring distribution of atomic resolution deformation
作品名稱（其他語言）
著者Bong Kyun Jang, Jae-Hyun Kim, Hak-Joo Lee, Kyung-Suk Kim, Chien-Kai Wang
單位
著錄名稱、卷期、頁數
描述
摘要The present invention relates to an atomic resolution deformation distribution measurement device that can measure a deformation rate of an atomic scale with low expense by improving resolution using an AFM system, and the atomic resolution deformation distribution measurement device includes: a laser source generating a laser beam; a first cantilever and a second cantilever provided close to a measurement specimen or a reference specimen to cause deformation by an atomic force; an optical system controlling a light path of the laser beam so as to cause the laser beam to be sequentially reflected to the first cantilever and the second cantilever and locate the first cantilever and the second cantilever to an image point; a measurement unit measuring the laser beam reflected from the second cantilever; and a stage on which a measurement specimen or a reference specimen is located and movable in X, Y, and Z axis directions.
關鍵字
語言英文(美國)
相關連結
Google+ 推薦功能，讓全世界都能看到您的推薦！
|
{
"url": "http://teacher.tku.edu.tw/StfFdDtl.aspx?tid=6933325",
"source_domain": "teacher.tku.edu.tw",
"snapshot_id": "crawl=CC-MAIN-2019-26",
"warc_metadata": {
"Content-Length": "11626",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:4AGBDEBGNLFX6MV74CDBQA6DG4H6RWX5",
"WARC-Concurrent-To": "<urn:uuid:72df4780-5a82-4a36-a0a4-cb0759aa5197>",
"WARC-Date": "2019-06-27T09:14:59Z",
"WARC-IP-Address": "163.13.238.181",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:N67DENAZ2UWD4GUJSALJXNQGAIOPEGHW",
"WARC-Record-ID": "<urn:uuid:720c142f-f347-4066-96b3-efa4e32ae3cb>",
"WARC-Target-URI": "http://teacher.tku.edu.tw/StfFdDtl.aspx?tid=6933325",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ca20a109-f867-49b5-a5e0-9042fbd1c0e4>"
},
"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-146-47-206.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,
50,
51,
132,
138,
142,
159,
241,
252,
327,
330,
341,
344,
1282,
1286,
1295,
1300
],
"line_end_idx": [
50,
51,
132,
138,
142,
159,
241,
252,
327,
330,
341,
344,
1282,
1286,
1295,
1300,
1326
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1326,
"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.30000001192092896,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01600000075995922,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.24400000274181366,
"rps_doc_frac_unique_words": 0.5124378204345703,
"rps_doc_mean_word_length": 5.44278621673584,
"rps_doc_num_sentences": 2,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.2724151611328125,
"rps_doc_word_count": 201,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.36197441816329956,
"rps_doc_frac_chars_dupe_6grams": 0.36197441816329956,
"rps_doc_frac_chars_dupe_7grams": 0.2595978081226349,
"rps_doc_frac_chars_dupe_8grams": 0.11334551870822906,
"rps_doc_frac_chars_dupe_9grams": 0.11334551870822906,
"rps_doc_frac_chars_top_2gram": 0.05941499024629593,
"rps_doc_frac_chars_top_3gram": 0.09872028976678848,
"rps_doc_frac_chars_top_4gram": 0.038391221314668655,
"rps_doc_books_importance": -86.49114990234375,
"rps_doc_books_importance_length_correction": -86.49114990234375,
"rps_doc_openwebtext_importance": -40.507652282714844,
"rps_doc_openwebtext_importance_length_correction": -40.507652282714844,
"rps_doc_wikipedia_importance": -28.64751625061035,
"rps_doc_wikipedia_importance_length_correction": -28.64693832397461
},
"fasttext": {
"dclm": 0.17752647399902344,
"english": 0.7317878603935242,
"fineweb_edu_approx": 2.9903743267059326,
"eai_general_math": 0.5913667678833008,
"eai_open_web_math": 0.19218158721923828,
"eai_web_code": 0.014754059724509716
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "621.381",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
},
"secondary": {
"code": "620.1",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "2",
"label": "Academic/Research"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "3",
"label": "Academic Writing"
},
"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": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-9,002,327,657,618,511,000 |
Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
Last Updated: 2 Dec, 2020
Deepest Left
Moderate
Asked in companies
UberFreshworks
Problem statement
You are given a binary tree having ‘N’ number of nodes. Your task is to find the deepest leaf node in the given input tree.
Note:
The deepest leaf node is the leaf node which will be the left child of some node and will be at the maximum level in the tree.
If there are multiple deepest left leaf nodes, return the node with maximum value.
Note :
1. A binary tree is a tree in which each node can have at most two children.
2. The given tree will be non-empty i.e. the number of non-NULL nodes will always be greater than or equal to 1.
3. Multiple nodes in the tree can have the same values, all values in the tree will be positive.
Input format :
The first line of input contains an integer ‘T’, which denotes the number of test cases. Then each test case follows.
The first line of every test case contains elements of the Binary Tree in the level order form. The input consists of values of nodes separated by a single space in a single line. In case a node is null, we take -1 in its place.
For Example :
Consider the binary tree:
The input for the tree depicted in the above image would be :
3
5 1
6 2 0 8
-1 -1 7 4 -1 -1 -1 -1
-1 -1 -1 -1
Explanation :
Level 1 :
The root node of the tree is 3
Level 2 :
Left child of 3 = 5
Right child of 3 = 1
Level 3 :
Left child of 5 = 6
Right child of 5 = 2
Left child of 1 = 0
Right child of 1 = 8
Level 4 :
Left child of 6 = null (-1)
Right child of 6 = null(-1)
Left child of 2 = 7
Right child of 2 = 4
Left child of 0 = null (-1)
Right child of 0 = null (-1)
Left child of 8 = null (-1)
Right child of 8 = null (-1)
Level 5 :
Left child of 7 = null (-1)
Right child of 7 = null (-1)
Left child of 4 = null (-1)
Right child of 4 = null (-1)
The first not-null node (of the previous level) is treated as the parent of the first two nodes of the current level. The second not-null node (of the previous level) is treated as the parent node for the next two nodes of the current level and so on.
The input ends when all nodes at the last level are null (-1).
Output format :
For each test case, print the deepest leaf node’s data which is the left child of some node.
The output of each test case should be printed in a separate line.
Note:
You do not need to print anything, it has already been taken care of. Just implement the given function.
Constraints:
1 <= T <= 5
1 <= N <= 3 * (10 ^ 3)
1 <= nodeVal <= 10 ^ 9
Time Limit: 1 sec.
Approaches
01 Approach
The idea is to traverse the tree iteratively and whenever a left tree node is pushed into the queue, check if it is a leaf node, if it’s a leaf node, then update the result. Since we go level by level, the last stored leaf node is the deepest one.
Approach:
• First, check if the root is null or not.
• Make a queue for breadth-first search.
• Initialize a variable of int type say ‘result’ to 0, ‘maxLevel’ to 0, ‘level’ to 1.
• Push the root inside the queue.
• Make an iteration till the queue does not become empty.
• Store the size of the queue in a variable, say ‘si’.
• Iterate till size does not become 0.
• Store the queue’s front element in a variable, say ‘temp’, and pop the element from the queue.
• Check if there existed the left element of ‘temp’ in the tree or not.
• If a left element of ‘temp’ exists:
• Push temp’s left into the queue.
• If temp’s left node is the leaf node then:
• Check if temp’s left level is greater than the ‘maxLevel’ then store the temp’s left’s data in the variable ‘result’ and update ‘maxLevel with the level of temp’s left’s level.
• Else, if temp’s left’s level is already reached level then store the maximum element in ‘result’
• If a right element of ‘temp’ exists:
• Push temp’s right into the queue.
• Increment ‘level’.
• Update ‘maxLevel’.
• Return ‘result’ to the function.
|
{
"url": "https://www.naukri.com/code360/problem-details/deepest-left_920385",
"source_domain": "www.naukri.com",
"snapshot_id": "CC-MAIN-2024-30",
"warc_metadata": {
"Content-Length": "266060",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OOT7JGMY2VFPPI2PNCEW3MQ77V2WLQOH",
"WARC-Concurrent-To": "<urn:uuid:ab091cd3-0c2e-4632-b0bc-042081a30073>",
"WARC-Date": "2024-07-16T00:21:15Z",
"WARC-IP-Address": "23.202.153.115",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FRWYQTX5IIKD6LCJ4BR3XXAYCJ4XQ7XS",
"WARC-Record-ID": "<urn:uuid:00c8eab1-27d4-4798-b6de-0efc6bdf9108>",
"WARC-Target-URI": "https://www.naukri.com/code360/problem-details/deepest-left_920385",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5d2cdbcb-c02e-4206-995a-f22043c49cf4>"
},
"warc_info": "isPartOf: CC-MAIN-2024-30\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-32\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,
93,
119,
120,
133,
134,
143,
162,
177,
178,
196,
197,
321,
322,
328,
329,
456,
539,
540,
547,
548,
626,
739,
836,
837,
852,
853,
972,
1201,
1202,
1216,
1217,
1243,
1244,
1245,
1307,
1308,
1310,
1314,
1322,
1344,
1356,
1357,
1371,
1372,
1382,
1413,
1414,
1424,
1444,
1465,
1466,
1476,
1496,
1517,
1537,
1558,
1559,
1569,
1597,
1625,
1645,
1666,
1694,
1723,
1751,
1780,
1781,
1791,
1819,
1848,
1876,
1905,
1906,
2158,
2159,
2222,
2223,
2239,
2240,
2333,
2334,
2401,
2402,
2408,
2409,
2514,
2515,
2528,
2529,
2541,
2564,
2587,
2588,
2607,
2608,
2619,
2620,
2632,
2633,
2881,
2882,
2884,
2885,
2895,
2896,
2898,
2899,
2944,
2987,
3075,
3111,
3171,
3230,
3273,
3376,
3454,
3500,
3545,
3600,
3791,
3902,
3949,
3995,
4020,
4045
],
"line_end_idx": [
93,
119,
120,
133,
134,
143,
162,
177,
178,
196,
197,
321,
322,
328,
329,
456,
539,
540,
547,
548,
626,
739,
836,
837,
852,
853,
972,
1201,
1202,
1216,
1217,
1243,
1244,
1245,
1307,
1308,
1310,
1314,
1322,
1344,
1356,
1357,
1371,
1372,
1382,
1413,
1414,
1424,
1444,
1465,
1466,
1476,
1496,
1517,
1537,
1558,
1559,
1569,
1597,
1625,
1645,
1666,
1694,
1723,
1751,
1780,
1781,
1791,
1819,
1848,
1876,
1905,
1906,
2158,
2159,
2222,
2223,
2239,
2240,
2333,
2334,
2401,
2402,
2408,
2409,
2514,
2515,
2528,
2529,
2541,
2564,
2587,
2588,
2607,
2608,
2619,
2620,
2632,
2633,
2881,
2882,
2884,
2885,
2895,
2896,
2898,
2899,
2944,
2987,
3075,
3111,
3171,
3230,
3273,
3376,
3454,
3500,
3545,
3600,
3791,
3902,
3949,
3995,
4020,
4045,
4081
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4081,
"ccnet_original_nlines": 125,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31370559334754944,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00812183041125536,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.30253806710243225,
"rps_doc_frac_unique_words": 0.28125,
"rps_doc_mean_word_length": 3.8411457538604736,
"rps_doc_num_sentences": 45,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.642759323120117,
"rps_doc_word_count": 768,
"rps_doc_frac_chars_dupe_10grams": 0.03322033956646919,
"rps_doc_frac_chars_dupe_5grams": 0.17728814482688904,
"rps_doc_frac_chars_dupe_6grams": 0.1152542382478714,
"rps_doc_frac_chars_dupe_7grams": 0.08338983356952667,
"rps_doc_frac_chars_dupe_8grams": 0.03322033956646919,
"rps_doc_frac_chars_dupe_9grams": 0.03322033956646919,
"rps_doc_frac_chars_top_2gram": 0.047457631677389145,
"rps_doc_frac_chars_top_3gram": 0.04101695120334625,
"rps_doc_frac_chars_top_4gram": 0.006779660005122423,
"rps_doc_books_importance": -496.75653076171875,
"rps_doc_books_importance_length_correction": -496.75653076171875,
"rps_doc_openwebtext_importance": -291.1720886230469,
"rps_doc_openwebtext_importance_length_correction": -291.1720886230469,
"rps_doc_wikipedia_importance": -258.4017333984375,
"rps_doc_wikipedia_importance_length_correction": -258.4017333984375
},
"fasttext": {
"dclm": 0.07372403144836426,
"english": 0.8406582474708557,
"fineweb_edu_approx": 2.9963066577911377,
"eai_general_math": 0.9506472945213318,
"eai_open_web_math": 0.20390188694000244,
"eai_web_code": 0.9338608384132385
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.72",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-8,947,807,014,860,930,000 |
@article { author = {Keshavarz, Mozhdeh and Shariati-Bafghi, Seyedeh Elaheh and Rezvani, Reza and Ranjbar, Golnaz and Nematy, Mohsen}, title = {Indirect Calorimetry during the COVID-19 Pandemic: Practical Guidance for Infection Control}, journal = {Journal of Nutrition,Fasting and Health}, volume = {9}, number = {2}, pages = {91-97}, year = {2021}, publisher = {Mashhad University of Medical Sciences (MUMS)}, issn = {2345-2587}, eissn = {2345-2587}, doi = {10.22038/jnfh.2021.53836.1307}, abstract = {Introduction: Indirect calorimetry (IC) is the optimal tool for the assessment of the resting energy expenditure, as well as the reference standard for energy expenditure measurement. During the outbreak of coronavirus, performing respiratory tests such as IC has become challenging. The current guidance was designed to prevent the virus spread at calorimetry centers. Methods: This protocol was devised in accordance with the latest recommendations of the World Health Organization (WHO) and Centers for Disease Control (CDC), as well as the related articles. Conclusion: Due to the specific features of COVID-19, unnecessary ICs should be avoided in the hotspots of the disease. If these tests must be performed, adherence to the validated infection control recommendations is critical.}, keywords = {Calorimetry,COVID-19,infection control,IC,Coronavirus}, url = {https://jnfh.mums.ac.ir/article_17407.html}, eprint = {https://jnfh.mums.ac.ir/article_17407_146b461881bc579a4a3e35d490254ccc.pdf} }
|
{
"url": "https://jnfh.mums.ac.ir/?_action=export&rf=bibtex&rc=17407",
"source_domain": "jnfh.mums.ac.ir",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "2698",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NSKOYD24JEJFSLZ3EIW4NT5IJJEUOB3A",
"WARC-Concurrent-To": "<urn:uuid:560263e8-6aa1-4156-a4fc-8d5fa90dbbed>",
"WARC-Date": "2022-08-12T17:13:23Z",
"WARC-IP-Address": "185.116.24.132",
"WARC-Identified-Payload-Type": "text/plain",
"WARC-Payload-Digest": "sha1:M4RE75IWQC42JXJZ4BQ67675PZIDBMXM",
"WARC-Record-ID": "<urn:uuid:cdefccf5-0242-4bed-a530-730eba0093b9>",
"WARC-Target-URI": "https://jnfh.mums.ac.ir/?_action=export&rf=bibtex&rc=17407",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d2225eb7-50e1-44ec-940a-2fb7da2a7084>"
},
"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-80\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
],
"line_end_idx": [
1503
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1503,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.021290749311447144,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.18649518489837646,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.028938909992575645,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3826366662979126,
"rps_doc_frac_unique_words": 0.6777777671813965,
"rps_doc_mean_word_length": 6.561110973358154,
"rps_doc_num_sentences": 19,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.547410011291504,
"rps_doc_word_count": 180,
"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.01270109973847866,
"rps_doc_frac_chars_top_3gram": 0.013547839596867561,
"rps_doc_frac_chars_top_4gram": 0.018628280609846115,
"rps_doc_books_importance": -173.4453582763672,
"rps_doc_books_importance_length_correction": -164.2700958251953,
"rps_doc_openwebtext_importance": -101.13861846923828,
"rps_doc_openwebtext_importance_length_correction": -101.13861846923828,
"rps_doc_wikipedia_importance": -53.07598876953125,
"rps_doc_wikipedia_importance_length_correction": -41.065147399902344
},
"fasttext": {
"dclm": 0.741933286190033,
"english": 0.8999951481819153,
"fineweb_edu_approx": 3.3793280124664307,
"eai_general_math": 0.307012140750885,
"eai_open_web_math": 0.5097965598106384,
"eai_web_code": 0.01968681998550892
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "616.994",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Pathology and Diseases"
}
},
"secondary": {
"code": "616.075",
"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": "2",
"label": "Academic/Research"
},
"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": "3",
"label": "Academic Writing"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-6,558,930,295,737,057,000 |
How do driving phobias start?
Pretty well all driving phobias are set up by a one-off learning event.
It would be natural to assume that this event has to be something really traumatic and life-threatening like a road traffic accident. But if it had been, it would most likely create some form of short-lived post-traumatic stress disorder (PTSD) and a natural avoidance of driving for some time afterwards and this is slightly different in nature and structure to a driving phobia. So many people with a fear of driving will say they don’t know when their thing started because they are searching their minds for something horrific.
The reality is that probably 95% or more of driving phobias start with something milder – like suddenly feeling a little strange when driving at speed on a multi-lane highway. Something like:
“I was just driving along and I tried to overtake a truck….. and couldn’t do it and felt a bit panicky and weird…. and managed to drive on then thought nothing of it until it happened again the next day.”
This kind of experience would probably hold true for more than half of all set-up events for driving phobias.
If you are following the math(s) then you can see that there is a 9 out of 10 chance that your driving phobia was caused by a relatively mild, one-off learning event. There is a high probability that it started on a multi-lane highway when you were much more stressed than usual.
How people manage driving fear
Most people with a fear of driving will try and hide their distress because they think there’s something wrong with them or they’re going mad or becoming a nervous wreck. Very rarely will they tell anyone beyond their partner or immediate family. Even then, they are unlikely to disclose the full extent of their fear.
So safety and avoidance strategies are used by the sufferer to reduce their anxiety and exposure and to conceal and accommodate their panic and embarrassment.
These strategies will include:
Planning and driving alternative routes to avoid particular types of roads (like multi-lane roads, freeways and motorways). Drivers become experts on finding and driving back road routes (they love their Sat-Navs) and can even convince themselves that the bigger roads are always jammed so” it’s quicker this way”.
Driving at times when the roads are clear to avoid traffic. Typically this will involve leaving for work at unsociable hours (like 5am) and returning late in the evening. It makes for a very long working day with a stressful drive home at the end.
Relying on partners or friends to drive instead or take over en route.
Making excuses to avoid driving with friends and colleagues, or giving people lifts, who might notice their anxiety: “I’m going a different way” or “I’ll meet you there”.
Finding other “reasons” to turn down jobs, promotions, social invitations and vacations that would involve driving
Manipulating people and situations to avoid having to drive.
Fear, as they say, is the mother of invention.
|
{
"url": "http://phobiaclinic.co.uk/tag/highway",
"source_domain": "phobiaclinic.co.uk",
"snapshot_id": "crawl=CC-MAIN-2018-05",
"warc_metadata": {
"Content-Length": "96251",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:O5OS4OJGA6B75DTRJ5LMEBRPYZ5WWBOB",
"WARC-Concurrent-To": "<urn:uuid:3a3ab622-7696-4a33-9bd1-ab260352cf41>",
"WARC-Date": "2018-01-21T18:26:07Z",
"WARC-IP-Address": "77.92.75.3",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:X643OZCCYW3YO63WVCKH55IOK3ORWVVL",
"WARC-Record-ID": "<urn:uuid:868fa74e-be4e-4a69-91af-f035d95dd095>",
"WARC-Target-URI": "http://phobiaclinic.co.uk/tag/highway",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:c59f16df-4dfc-46df-a512-b4ad31d418fd>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-181-213-23.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-05\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for January 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
30,
31,
103,
104,
636,
637,
829,
830,
1035,
1036,
1146,
1147,
1427,
1428,
1459,
1460,
1779,
1780,
1939,
1940,
1971,
1972,
2287,
2288,
2536,
2537,
2608,
2609,
2780,
2781,
2896,
2897,
2958,
2959
],
"line_end_idx": [
30,
31,
103,
104,
636,
637,
829,
830,
1035,
1036,
1146,
1147,
1427,
1428,
1459,
1460,
1779,
1780,
1939,
1940,
1971,
1972,
2287,
2288,
2536,
2537,
2608,
2609,
2780,
2781,
2896,
2897,
2958,
2959,
3005
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3005,
"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.4757118821144104,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.008375209756195545,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12730318307876587,
"rps_doc_frac_unique_words": 0.5226824283599854,
"rps_doc_mean_word_length": 4.777120113372803,
"rps_doc_num_sentences": 25,
"rps_doc_symbol_to_word_ratio": 0.0033500799909234047,
"rps_doc_unigram_entropy": 5.1285200119018555,
"rps_doc_word_count": 507,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.023121390491724014,
"rps_doc_frac_chars_dupe_6grams": 0.023121390491724014,
"rps_doc_frac_chars_dupe_7grams": 0.023121390491724014,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.023121390491724014,
"rps_doc_frac_chars_top_3gram": 0.015689510852098465,
"rps_doc_frac_chars_top_4gram": 0.012386459857225418,
"rps_doc_books_importance": -264.54937744140625,
"rps_doc_books_importance_length_correction": -264.54937744140625,
"rps_doc_openwebtext_importance": -162.6217498779297,
"rps_doc_openwebtext_importance_length_correction": -162.6217498779297,
"rps_doc_wikipedia_importance": -98.94210052490234,
"rps_doc_wikipedia_importance_length_correction": -98.94210052490234
},
"fasttext": {
"dclm": 0.39496684074401855,
"english": 0.9717972874641418,
"fineweb_edu_approx": 2.0195469856262207,
"eai_general_math": 0.08875322341918945,
"eai_open_web_math": 0.2194647192955017,
"eai_web_code": 0.038467880338430405
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "616.852",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Pathology and Diseases"
}
},
"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": "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": "-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": "16",
"label": "Personal Blog"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
1,109,799,136,623,382,100 |
3 - anterior composite restorations
Home
What do anterior composite restoration materials need to create?
Esthetic anatomy
Characterization
Hue
Value
Chroma
Position
Form
Function
Direction
Texture
What is used to classify composite resins?
Filler size
What are the filler size classification of composite resins?
Microfilled
Hybrids
Nanofilled
What do the fillers in composite resins determine?
The mechanical properties
What do the fillers in composite resins allow for?
Reduction of the amount of resin matrix and, consequently, the polymerization shrinkage
What happens when filler loading in composite resins is increased?
Optimizes translucency and opalescence while simultaneously enhancing the esthetic and handling properties
What do filler arrangement and distribution within the resin matrix affect?
Light scattering and gloss retention
What is the relationship with filler size of composite resin and optical scattering?
Indirect - smaller filler size translates to more efficient optical scattering
What particles are in nanofilled composite resins?
100nm or below particles of silica, zirconia and other organic fillers
Which composite resin class is used at SBU SDM due to its superior polishing ability and gloss retention?
Nanofilled = Filtek Supreme in enamel, body, and dentin shades
What promotes characterization and allows us to mimic optical properties in anterior composite restorations?
Composite staining kits to help correct fluorosis, incisal edge blue for youthful appearance, incisal edge gray for more mature look, incisal edge lavender or purple-ish for elderly, increase saturation dark brown for pits/fissures and craze lines, white
What color appearance comes along with reflected light?
Blueish
What color appearance comes along with transmitted light?
Reddish-orange
What is a disadvantage to the typical composite spatula?
Too thick, so cannot get into embrasures well enough for esthetic restorations
What are the gold, blue, and green instruments used for with respect to anterior composite restorations?
Gold = incisal area
Blue = carving
Gingival area (class v lesions benefit from this instrument = green
What needs to be addressed before esthetics?
Disease
Function
If incisal wear is localized, what is the probable cause?
Parafunctional habit like nail biting since patient is probably targeting that specific area repeatedly over time
Why is it important to evaluate the patient's habits and normal function?
This will reveal occlusal problems such as abrasion, nutritional problems, erosion, or bruxism
Once wear is evaluated and the cause is identified, what is the next step?
Treatment possibilities AND precautions are planned
PATIENT EDUCATION IS KEY
How can patients avoid wear in the future or at least minimize the threat of repetition?
Provider needs to evaluate what has happened to the individual's teeth, and to the opposing dentition, to ensure that a better profile, shape, and position can be created for those teeth
What are the indications for anterior composite restorations?
Correcting diastema
Masking discolored or stained teeth (i.e. fluorosis, white spots)
Correcting maligned or malformed teeth (i.e. peg laterals)
Trauma - chipped or fractured teeth
Tooth wear (i.e. attrition, abrasion, erosion)
What are the contraindications for anterior composite restorations?
Limited incisal clearance
Gross loss of tooth structure where composite would not be strong enough
What are the advantages of direct composite veneers vs. porcelain veneers?
Conservative/Noninvasive
Temporary/Reversible
Immediate results
No lab expense
Cost - less expensive
What are the disadvantages of direct composite veneers vs. porcelain veneers?
Can stain, chip, and lose luster
Technique sensitive (need to use rubber dam!)
Rely on dentist
More maintenance
What should the provider keep in mind when treatment planning anterior composite restorations?
Are you confident free-handing? If not, consider veneer
How high are the patient's esthetic demands? If unrealistic, consider veneer
Are you planning a full mouth rehabilitation? If yes, consider veneer
What characteristics need to be thoughtfully analyzed to achieve a a natural esthetic outcome?
Translucency
Value
Chroma
What needs to be considered to mimic natural tooth appearance?
4 main variations of translucency
Chromaticity and brightness among enamel and dentin
What are the steps in the anterior composite layering technique? (Examples in slideshow where this applies include fracture on central incisor and diastema closure)
Layering technique
First of all, make a diagnostic waxup on a cast use that to form a putty starting on the lingual and extending to the buccal surface. If the putty is too thin, it will be flimsy. If the putty is too thick, it may not fit in the patient'
What are the steps to finish and polish anterior composite restorations?
Remove the rubber dam and check the occlusion by having the patient tap their teeth together and go through protrusive and lateral movements. Finish the lingual surface with fine burs. Finish the proximal surface with strips going in an S shape starting w
|
{
"url": "https://www.assignguru.com/mcqs/21237/507850072/",
"source_domain": "www.assignguru.com",
"snapshot_id": "CC-MAIN-2024-22",
"warc_metadata": {
"Content-Length": "42991",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LFGHT6LX3U2RV4WEYZ3BRNUSX2L75JDT",
"WARC-Concurrent-To": "<urn:uuid:89334de3-122d-4dc9-b3fd-4e4e49af78d2>",
"WARC-Date": "2024-05-26T11:07:59Z",
"WARC-IP-Address": "35.173.69.207",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:VTBL7HF5OKJI7P4VR7OLHGY36HFHB4X2",
"WARC-Record-ID": "<urn:uuid:53375d5a-c7b7-4751-9fbd-53fc21643a9e>",
"WARC-Target-URI": "https://www.assignguru.com/mcqs/21237/507850072/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:bc7930cd-061b-46a4-9a46-fe9c1c03cf36>"
},
"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-22\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,
42,
43,
108,
109,
126,
143,
147,
153,
160,
169,
174,
183,
193,
201,
202,
245,
246,
258,
259,
320,
321,
333,
341,
352,
353,
404,
405,
431,
432,
483,
484,
572,
573,
640,
641,
748,
749,
825,
826,
863,
864,
949,
950,
1029,
1030,
1081,
1082,
1153,
1154,
1260,
1261,
1324,
1325,
1434,
1435,
1690,
1691,
1747,
1748,
1756,
1757,
1815,
1816,
1831,
1832,
1889,
1890,
1969,
1970,
2075,
2076,
2096,
2111,
2179,
2180,
2225,
2226,
2234,
2243,
2244,
2302,
2303,
2417,
2418,
2492,
2493,
2588,
2589,
2664,
2665,
2717,
2742,
2743,
2832,
2833,
3020,
3021,
3083,
3084,
3104,
3170,
3229,
3265,
3312,
3313,
3381,
3382,
3408,
3481,
3482,
3557,
3558,
3583,
3604,
3622,
3637,
3659,
3660,
3738,
3739,
3772,
3818,
3834,
3851,
3852,
3947,
3948,
4004,
4081,
4151,
4152,
4247,
4248,
4261,
4267,
4274,
4275,
4338,
4339,
4373,
4425,
4426,
4591,
4592,
4611,
4848,
4849,
4922,
4923
],
"line_end_idx": [
36,
37,
42,
43,
108,
109,
126,
143,
147,
153,
160,
169,
174,
183,
193,
201,
202,
245,
246,
258,
259,
320,
321,
333,
341,
352,
353,
404,
405,
431,
432,
483,
484,
572,
573,
640,
641,
748,
749,
825,
826,
863,
864,
949,
950,
1029,
1030,
1081,
1082,
1153,
1154,
1260,
1261,
1324,
1325,
1434,
1435,
1690,
1691,
1747,
1748,
1756,
1757,
1815,
1816,
1831,
1832,
1889,
1890,
1969,
1970,
2075,
2076,
2096,
2111,
2179,
2180,
2225,
2226,
2234,
2243,
2244,
2302,
2303,
2417,
2418,
2492,
2493,
2588,
2589,
2664,
2665,
2717,
2742,
2743,
2832,
2833,
3020,
3021,
3083,
3084,
3104,
3170,
3229,
3265,
3312,
3313,
3381,
3382,
3408,
3481,
3482,
3557,
3558,
3583,
3604,
3622,
3637,
3659,
3660,
3738,
3739,
3772,
3818,
3834,
3851,
3852,
3947,
3948,
4004,
4081,
4151,
4152,
4247,
4248,
4261,
4267,
4274,
4275,
4338,
4339,
4373,
4425,
4426,
4591,
4592,
4611,
4848,
4849,
4922,
4923,
5178
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5178,
"ccnet_original_nlines": 151,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3287671208381653,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.00913241971284151,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.12328767031431198,
"rps_doc_frac_unique_words": 0.48944592475891113,
"rps_doc_mean_word_length": 5.602902412414551,
"rps_doc_num_sentences": 46,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.359392166137695,
"rps_doc_word_count": 758,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.05792323872447014,
"rps_doc_frac_chars_dupe_6grams": 0.05085942894220352,
"rps_doc_frac_chars_dupe_7grams": 0.035319048911333084,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.036025431007146835,
"rps_doc_frac_chars_top_3gram": 0.01883682981133461,
"rps_doc_frac_chars_top_4gram": 0.007534729782491922,
"rps_doc_books_importance": -412.7602844238281,
"rps_doc_books_importance_length_correction": -412.7602844238281,
"rps_doc_openwebtext_importance": -227.48416137695312,
"rps_doc_openwebtext_importance_length_correction": -227.48416137695312,
"rps_doc_wikipedia_importance": -165.05673217773438,
"rps_doc_wikipedia_importance_length_correction": -165.05673217773438
},
"fasttext": {
"dclm": 0.9104650020599365,
"english": 0.878379225730896,
"fineweb_edu_approx": 2.8801939487457275,
"eai_general_math": 0.15960592031478882,
"eai_open_web_math": 0.26120465993881226,
"eai_web_code": 0.010193879716098309
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "617.622",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Surgery and Dentistry"
}
},
"secondary": {
"code": "617.62",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Surgery and Dentistry"
}
}
},
"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": "9",
"label": "FAQ"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-6,958,304,319,251,176,000 |
Increment
How to create a unique value variable.
Saving screenshots taken during scenario run. Use a unique name for each screenshot. Increment screenshots taken using “Take Screenshot” action without having to overwrite the existing images from previous screenshots. Use case: Saving screenshots taken during a scenario run using the action “Take Screenshot” might rewrite the existing screenshots taken before during previous runs
|
{
"url": "https://www.automai.com/automation-type/increment/",
"source_domain": "www.automai.com",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "101517",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QEX5XEJMVESFK4FKPFOG67G5A5MAVDEE",
"WARC-Concurrent-To": "<urn:uuid:16c413a4-f319-4349-aadd-90b949ffbd35>",
"WARC-Date": "2024-09-10T08:38:43Z",
"WARC-IP-Address": "141.193.213.10",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:TJVIS56LLNIGIQNGW6VTB4NT7Z5TMCG5",
"WARC-Record-ID": "<urn:uuid:a12e6ebd-3e60-4d1d-b615-018b69b0acdd>",
"WARC-Target-URI": "https://www.automai.com/automation-type/increment/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:183b7079-4f89-4fbc-9ec0-67de22fb8ea5>"
},
"warc_info": "isPartOf: CC-MAIN-2024-38\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September 2024\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-248\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
10,
11,
50,
51
],
"line_end_idx": [
10,
11,
50,
51,
437
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 437,
"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.3661971688270569,
"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.1267605572938919,
"rps_doc_frac_unique_words": 0.5806451439857483,
"rps_doc_mean_word_length": 5.903225898742676,
"rps_doc_num_sentences": 5,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.457751989364624,
"rps_doc_word_count": 62,
"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.17486338317394257,
"rps_doc_frac_chars_top_3gram": 0.12021858245134354,
"rps_doc_frac_chars_top_4gram": 0.1530054658651352,
"rps_doc_books_importance": -26.81678009033203,
"rps_doc_books_importance_length_correction": -26.844205856323242,
"rps_doc_openwebtext_importance": -2.1494035720825195,
"rps_doc_openwebtext_importance_length_correction": -2.176828622817993,
"rps_doc_wikipedia_importance": -16.107385635375977,
"rps_doc_wikipedia_importance_length_correction": -16.134811401367188
},
"fasttext": {
"dclm": 0.8499535918235779,
"english": 0.8254762887954712,
"fineweb_edu_approx": 1.4839351177215576,
"eai_general_math": 0.21573293209075928,
"eai_open_web_math": 0.4275059103965759,
"eai_web_code": 0.3018384575843811
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.072",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-4,904,411,465,301,997,000 |
Are you feeling upset when playing PLAYERUNKNOWN’S BATTLEGROUNDS (PUBG) with your friends but the game keeps stuttering? You’re not alone. Many players are reporting this. The good news is you can fix it easily! We’ve put together some fixes to help you resolve the problem.
Fixes to try:
Here’s a list of fixes that have resolved this problem for other PUBG players. You don’t have to try them all. Just work your way through the list until you find the one that does the trick for you.
1. Check if your PC meets the minimum hardware requirements
2. Run PUBG in windowed mode
3. Update your graphics driver
4. Install the latest game patch
5. Modify the graphics settings of your PUBG
6. Change the power plan of your PC
Fix 1: Check if your PC meets the minimum hardware requirements
The PUBG stuttering issue may occur if your PC fails to meet the minimum hardware requirements of the game. Check if your PC meets its minimum hardware requirements:
• The minimum hardware requirements for PUBG:
OS:64-bit Windows 7, Windows 8.1, Windows 10
Processor:Intel Core i5-4430 / AMD FX-6300
Graphics:NVIDIA GeForce GTX 960 2GB / AMD Radeon R7 370 2GB
Memory:8 GB RAM
DirectX:Version 11
Network:Broadband Internet connection
Storage:30 GB available space
As we all know, it’s never the ideal way to play PUBG with a PC which just meets its minimum hardware requirements. So we also list the PUBG recommended system requirements below.
• The recommended system requirements for PUBG
OS: 64-bit Windows 10
Processor: AMD Ryzen 5-1600 / Intel Core i5-7600K
Graphics: NVIDIA GeForce GTX 1060 6GB or better
Memory: 8 GB RAM
DirectX: Version 11
Network: Broadband Internet connection
Storage: 30 GB available space
You may need to upgrade your hardware if your PC fails to meet the minimum system requirements of the game.
Fix 2: Run PUBG in windowed mode
PUBG consumes lots of resources when running in fullscreen mode. If your PUBG keeps stuttering when you play it in fullscreen mode, try running it in windowed mode.
To switch PUBG to windowed mode: While in the game, on your keyboard, press Alt and Enter at the same time.
See if your PUBG keeps stuttering. If this annoying issue persists, try the next fix.
Fix 3: Update your graphics driver
Updating your graphics driver to the latest version can make your PUBG run smoother and prevents many issues or errors. If you don’t have the time, patience or skills to update your driver manually, you can do it automatically with Driver Easy.
Driver Easy will automatically recognize your system and find the correct drivers for it. You don’t need to know exactly what system your computer is running, you don’t need to risk downloading and installing the wrong driver, and you don’t need to worry about making a mistake when installing. Driver Easy handles it all.
All the drivers in Driver Easy come straight from the manufacturer. They‘re all certified safe and secure.
1. Download and install Driver Easy.
2. Run Driver Easy and click the Scan Now button. Driver Easy will then scan your computer and detect any problem drivers.
3. Click Update next to your graphics card to automatically download the correct version of this driver, then you can install it manually. Or click Update All to automatically download and install the correct version of all the drivers that are missing or out of date on your system (this requires the Pro version – you’ll be prompted to upgrade when you click Update All
. You get full support and a 30-day money back guarantee).
You can do it for free if you like, but it’s partly manual.
If you need assistance, please contact Driver Easy’s support team at [email protected].
Fix 4: Install the latest game patch
Bluehole (PUBG developer) will release game patches to fix bugs. If you haven’t installed the latest game patch yet, you may encounter the PUBG stuttering issue. Check if there is any update from Steam or the official website and install the latest game patch to resolve the PUBG stuttering issue.
After you installed the latest game patch, run PUBG to check if this issue reappears. If not, you’ve fixed this issue.
Fix 5: Modify the graphics settings of your PUBG
Maybe the PUBG stuttering issue is caused by the improper graphics settings of the game. Try modifying its graphics settings to see if the PUBG stuttering issue persists. Here is how to do it:
1. Open the settings of your PUBG and navigate to the GRAPHICS tab. Disable Highlight Auto Capture.
2. In the ADVANCED SETTINGS, set the Overall Quality to the lowest and click APPLY to save the settings.
Run the game again to see if the PUBG stuttering issue persists. This this annoying issue remains, try the fix below.
Fix 6: Change the power plan of your PC
The PUBG stuttering issue is also probably caused by the power plan of your PC. Most PC are configured to Balanced, which limits the operating capacity of your graphics card and CPU. So, the stuttering issue may occur. Follow the instructions below to change the power plan of your PC:
1. On your keyboard, press the Windows logo key and R at the same time, then type powercfg.cpl and press Enter.
2. In the pop-up window, expand Hide additional plans and select High performance.
3. Type advanced in the search box in the upper-right corner and then click View advanced system settings.
4. In the pop-up window, click Settings… in the Performance section.
5. Select Adjust for best performance and click OK.
Run your PUBG to see if the game will keep stuttering. If not, you’ve fixed this issue.
Hopefully one of the fixes can help you resolve this issue. Please leave your comment below if you have any questions.
4
4 people found this helpful
|
{
"url": "https://www.drivereasy.com/knowledge/how-to-fix-pubg-stuttering/",
"source_domain": "www.drivereasy.com",
"snapshot_id": "crawl=CC-MAIN-2020-10",
"warc_metadata": {
"Content-Length": "287035",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RR7Q3RQC3NUD2ZUFHUQGR7UQLUYFUQ5R",
"WARC-Concurrent-To": "<urn:uuid:1d0392b1-92e7-4fe7-8ce2-6ba9c4362699>",
"WARC-Date": "2020-02-24T12:38:40Z",
"WARC-IP-Address": "167.114.130.158",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WGIFPKPBLYBGSKKNNLJRELKYDAVFY5US",
"WARC-Record-ID": "<urn:uuid:24d38664-6c07-40e0-9204-c91baca704bc>",
"WARC-Target-URI": "https://www.drivereasy.com/knowledge/how-to-fix-pubg-stuttering/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2364f487-831f-4660-b807-d9c4b9136866>"
},
"warc_info": "isPartOf: CC-MAIN-2020-10\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for February 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-10.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
275,
276,
290,
291,
490,
491,
553,
584,
617,
652,
699,
737,
738,
802,
803,
969,
970,
1018,
1063,
1106,
1166,
1182,
1201,
1239,
1269,
1270,
1450,
1451,
1500,
1522,
1572,
1620,
1637,
1657,
1696,
1727,
1835,
1836,
1869,
1870,
2035,
2036,
2144,
2145,
2231,
2232,
2267,
2268,
2513,
2514,
2837,
2838,
2945,
2946,
2983,
2984,
3107,
3108,
3480,
3539,
3540,
3600,
3693,
3694,
3731,
3732,
4030,
4031,
4150,
4151,
4200,
4201,
4394,
4395,
4495,
4496,
4601,
4602,
4720,
4721,
4761,
4762,
5048,
5049,
5161,
5162,
5245,
5246,
5353,
5354,
5423,
5424,
5476,
5477,
5565,
5566,
5685,
5686,
5688
],
"line_end_idx": [
275,
276,
290,
291,
490,
491,
553,
584,
617,
652,
699,
737,
738,
802,
803,
969,
970,
1018,
1063,
1106,
1166,
1182,
1201,
1239,
1269,
1270,
1450,
1451,
1500,
1522,
1572,
1620,
1637,
1657,
1696,
1727,
1835,
1836,
1869,
1870,
2035,
2036,
2144,
2145,
2231,
2232,
2267,
2268,
2513,
2514,
2837,
2838,
2945,
2946,
2983,
2984,
3107,
3108,
3480,
3539,
3540,
3600,
3693,
3694,
3731,
3732,
4030,
4031,
4150,
4151,
4200,
4201,
4394,
4395,
4495,
4496,
4601,
4602,
4720,
4721,
4761,
4762,
5048,
5049,
5161,
5162,
5245,
5246,
5353,
5354,
5423,
5424,
5476,
5477,
5565,
5566,
5685,
5686,
5688,
5715
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5715,
"ccnet_original_nlines": 99,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.34069669246673584,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.057773999869823456,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.18011894822120667,
"rps_doc_frac_unique_words": 0.34256410598754883,
"rps_doc_mean_word_length": 4.652307510375977,
"rps_doc_num_sentences": 76,
"rps_doc_symbol_to_word_ratio": 0.0008496199734508991,
"rps_doc_unigram_entropy": 5.128396511077881,
"rps_doc_word_count": 975,
"rps_doc_frac_chars_dupe_10grams": 0.02160494029521942,
"rps_doc_frac_chars_dupe_5grams": 0.18915343284606934,
"rps_doc_frac_chars_dupe_6grams": 0.12081129103899002,
"rps_doc_frac_chars_dupe_7grams": 0.08421517163515091,
"rps_doc_frac_chars_dupe_8grams": 0.07848325371742249,
"rps_doc_frac_chars_dupe_9grams": 0.02160494029521942,
"rps_doc_frac_chars_top_2gram": 0.011904760263860226,
"rps_doc_frac_chars_top_3gram": 0.026234570890665054,
"rps_doc_frac_chars_top_4gram": 0.03395061939954758,
"rps_doc_books_importance": -384.69793701171875,
"rps_doc_books_importance_length_correction": -384.69793701171875,
"rps_doc_openwebtext_importance": -250.00015258789062,
"rps_doc_openwebtext_importance_length_correction": -250.00015258789062,
"rps_doc_wikipedia_importance": -129.00592041015625,
"rps_doc_wikipedia_importance_length_correction": -129.00592041015625
},
"fasttext": {
"dclm": 0.02132391929626465,
"english": 0.8253680467605591,
"fineweb_edu_approx": 1.2069965600967407,
"eai_general_math": 0.013650420121848583,
"eai_open_web_math": 0.06142812967300415,
"eai_web_code": 0.022318720817565918
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.16",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "1",
"label": "Factual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "2",
"label": "Click Here References"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
1,664,967,618,035,615,700 |
Instantly share code, notes, and snippets.
Embed
What would you like to do?
#! /usr/bin/env python
import fileinput
import argparse
from operator import itemgetter
parser = argparse.ArgumentParser()
parser.add_argument('--target-mb', action = 'store', dest = 'target_mb', default = 61000, type = int)
parser.add_argument('vmtouch_output_file', action = 'store', nargs = '+')
args = parser.parse_args()
entries = []
last_fl_name = None
for line in open(args.vmtouch_output_file[0]):
line = line.strip()
if line.startswith('['):
# this is a mem info row
if not last_fl_name:
continue
currently_paged_percent = line.rsplit(' ', 1)[-1]
num, denom = map(float, currently_paged_percent.split('/'))
if num and denom:
bytes = denom * 4096
mb = bytes / (1024 * 1024)
entries.append((last_fl_name, num / denom, mb))
elif line.startswith('.') or line.startswith('/'):
last_fl_name = line
sorted_entries = sorted(entries, key = itemgetter(1), reverse = True)
loaded_mb = 0
to_page_in = []
for entry in sorted_entries:
if loaded_mb <= args.target_mb:
loaded_mb += entry[-1]
to_page_in.append(entry[0])
print 'vmtouch -m 5G -vt', ' '.join(to_page_in)
@sandys
This comment has been minimized.
sandys commented Apr 10, 2012
what command do you use to generate the vmtouch output on one machine ?
@avoine
This comment has been minimized.
avoine commented Apr 12, 2012
I think it's something like: vmtouch -vf > vmtouch_output_file.txt
@mikeyk
This comment has been minimized.
Owner
mikeyk commented Apr 12, 2012
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
|
{
"url": "https://gist.github.com/mikeyk/1424540",
"source_domain": "gist.github.com",
"snapshot_id": "crawl=CC-MAIN-2018-47",
"warc_metadata": {
"Content-Length": "60520",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:B52QFC4WJ5K7DIKCPJJN6XO3YL4TNF6D",
"WARC-Concurrent-To": "<urn:uuid:d904d1f8-6a7a-4b91-9c67-eb876ba213dd>",
"WARC-Date": "2018-11-15T05:03:07Z",
"WARC-IP-Address": "192.30.253.118",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:WICN65CBNRWDQH5WHBXO3AXSJ2KE4BI3",
"WARC-Record-ID": "<urn:uuid:9dd2fca6-a946-4efa-8ad1-1ab21bd085a5>",
"WARC-Target-URI": "https://gist.github.com/mikeyk/1424540",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:1ac2ab17-f374-47cd-8288-465f9ac2781e>"
},
"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-166-161-213.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,
43,
44,
50,
77,
100,
117,
133,
165,
200,
302,
376,
403,
416,
436,
483,
503,
528,
553,
574,
583,
633,
693,
711,
732,
759,
807,
858,
878,
948,
962,
978,
1007,
1039,
1062,
1090,
1138,
1146,
1147,
1180,
1181,
1211,
1212,
1284,
1285,
1293,
1294,
1327,
1328,
1358,
1359,
1426,
1427,
1435,
1436,
1469,
1470,
1476,
1477,
1507,
1508
],
"line_end_idx": [
43,
44,
50,
77,
100,
117,
133,
165,
200,
302,
376,
403,
416,
436,
483,
503,
528,
553,
574,
583,
633,
693,
711,
732,
759,
807,
858,
878,
948,
962,
978,
1007,
1039,
1062,
1090,
1138,
1146,
1147,
1180,
1181,
1211,
1212,
1284,
1285,
1293,
1294,
1327,
1328,
1358,
1359,
1426,
1427,
1435,
1436,
1469,
1470,
1476,
1477,
1507,
1508,
1605
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1605,
"ccnet_original_nlines": 60,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.14409221708774567,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005763689987361431,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4178674519062042,
"rps_doc_frac_unique_words": 0.6577540040016174,
"rps_doc_mean_word_length": 6.181818008422852,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0.005763689987361431,
"rps_doc_unigram_entropy": 4.668851852416992,
"rps_doc_word_count": 187,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07006920129060745,
"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.028546709567308426,
"rps_doc_frac_chars_top_3gram": 0.036332178860902786,
"rps_doc_frac_chars_top_4gram": 0.04671280086040497,
"rps_doc_books_importance": -167.60731506347656,
"rps_doc_books_importance_length_correction": -153.91477966308594,
"rps_doc_openwebtext_importance": -92.99822235107422,
"rps_doc_openwebtext_importance_length_correction": -92.99822235107422,
"rps_doc_wikipedia_importance": -64.56643676757812,
"rps_doc_wikipedia_importance_length_correction": -50.97704315185547
},
"fasttext": {
"dclm": 0.3348991274833679,
"english": 0.5907353162765503,
"fineweb_edu_approx": 2.3699910640716553,
"eai_general_math": 0.470963716506958,
"eai_open_web_math": 0.0330963097512722,
"eai_web_code": 0.007489739917218685
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "1",
"label": "Leftover HTML"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
1,994,861,849,714,902,300 |
cldirectburn.dll
Process name: CLDirectBurn
Application using this process: CLDirectBurn Dynamic Link Library
cldirectburn.dll
Process name: CLDirectBurn
Application using this process: CLDirectBurn Dynamic Link Library
cldirectburn.dll
Click here to run a scan if you are experiencing issues with this process.
Process name: CLDirectBurn
Application using this process: CLDirectBurn Dynamic Link Library
Recommended: Scan your system for invalid registry entries.
What is cldirectburn.dll doing on my computer?
cldirectburn.dll is a CLDirectBurn belonging to CLDirectBurn Dynamic Link Library from Cyberlink Non-system processes like cldirectburn.dll originate from software you installed on your system. Since most applications store data in your system's registry, it is likely that your registry has suffered fragmentation and accumulated invalid entries which can affect your PC's performance. It is recommended that you check your registry to identify slowdown issues.
cldirectburn.dll
Is cldirectburn.dll harmful?
cldirectburn.dll has not been assigned a security rating yet. Check your computer for viruses or other malware infected files.
cldirectburn.dll is unrated
Can I stop or remove cldirectburn.dll?
Most non-system processes that are running can be stopped because they are not involved in running your operating system. Scan your system now to identify unused processes that are using up valuable resources. cldirectburn.dll is used by 'CLDirectBurn Dynamic Link Library'.This is an application created by 'Cyberlink'. To stop cldirectburn.dll permanently uninstall 'CLDirectBurn Dynamic Link Library' from your system. Uninstalling applications can leave invalid registry entries, accumulating over time. Run a free scan to find out how to optimize software and system performance.
Is cldirectburn.dll CPU intensive?
This process is not considered CPU intensive. However, running too many processes on your system may affect your PC’s performance. To reduce system overload, you can use the Microsoft System Configuration Utility to manually find and disable processes that launch upon start-up. Alternatively, download SpeedUpMyPC to automatically scan and identify any unused processes.
Why is cldirectburn.dll giving me errors?
Process related issues are usually related to problems encountered by the application that runs it. The safest way to stop these errors is to uninstall the application and run a system scan to automatically identify any unused processes and services that are using up valuable resources.
The safest way to stop these errors is to uninstall the application and run a scan to identify any system issues including invalid registry entries that have accumulated over time.
Process Library is the unique and indispensable process listing database since 2004 Now counting 140,000 processes and 55,000 DLLs. Join and subscribe now!
System Tools
SpeedUpMyPC
Toolbox
ProcessQuicklink
|
{
"url": "http://www.processlibrary.com/directory/files/cldirectburn/415593/",
"source_domain": "www.processlibrary.com",
"snapshot_id": "crawl=CC-MAIN-2013-20",
"warc_metadata": {
"Content-Length": "29393",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:OFTPX3PHZNA2ZW4GRT6F3OQTROKJCKML",
"WARC-Concurrent-To": "<urn:uuid:4c4a8bcf-8a2e-4251-bb62-55e39cb8baba>",
"WARC-Date": "2013-05-24T03:02:53Z",
"WARC-IP-Address": "54.246.105.117",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:WU6M2XQJVR5QZJ5QFHP3XVAB5PFQ5JO2",
"WARC-Record-ID": "<urn:uuid:5a6c092c-8358-4342-b3f6-1ba9ab2b2c4c>",
"WARC-Target-URI": "http://www.processlibrary.com/directory/files/cldirectburn/415593/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:85c4981c-c12d-415f-9fae-7626f5c23fc9>"
},
"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,
17,
18,
45,
46,
112,
113,
130,
131,
158,
159,
225,
226,
243,
244,
245,
320,
321,
348,
349,
415,
416,
476,
477,
524,
525,
988,
1005,
1006,
1035,
1036,
1163,
1191,
1192,
1231,
1232,
1817,
1818,
1853,
1854,
2226,
2227,
2269,
2270,
2558,
2559,
2740,
2741,
2742,
2743,
2744,
2745,
2746,
2747,
2903,
2904,
2917,
2918,
2930,
2931,
2939,
2940
],
"line_end_idx": [
17,
18,
45,
46,
112,
113,
130,
131,
158,
159,
225,
226,
243,
244,
245,
320,
321,
348,
349,
415,
416,
476,
477,
524,
525,
988,
1005,
1006,
1035,
1036,
1163,
1191,
1192,
1231,
1232,
1817,
1818,
1853,
1854,
2226,
2227,
2269,
2270,
2558,
2559,
2740,
2741,
2742,
2743,
2744,
2745,
2746,
2747,
2903,
2904,
2917,
2918,
2930,
2931,
2939,
2940,
2956
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2956,
"ccnet_original_nlines": 61,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.32270917296409607,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009960159659385681,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14342628419399261,
"rps_doc_frac_unique_words": 0.406326025724411,
"rps_doc_mean_word_length": 5.948904991149902,
"rps_doc_num_sentences": 44,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.692692279815674,
"rps_doc_word_count": 411,
"rps_doc_frac_chars_dupe_10grams": 0.16809816658496857,
"rps_doc_frac_chars_dupe_5grams": 0.22126789391040802,
"rps_doc_frac_chars_dupe_6grams": 0.1934560239315033,
"rps_doc_frac_chars_dupe_7grams": 0.16809816658496857,
"rps_doc_frac_chars_dupe_8grams": 0.16809816658496857,
"rps_doc_frac_chars_dupe_9grams": 0.16809816658496857,
"rps_doc_frac_chars_top_2gram": 0.0466257706284523,
"rps_doc_frac_chars_top_3gram": 0.05644172057509422,
"rps_doc_frac_chars_top_4gram": 0.061349689960479736,
"rps_doc_books_importance": -233.63772583007812,
"rps_doc_books_importance_length_correction": -233.63772583007812,
"rps_doc_openwebtext_importance": -89.77937316894531,
"rps_doc_openwebtext_importance_length_correction": -89.77937316894531,
"rps_doc_wikipedia_importance": -95.9390869140625,
"rps_doc_wikipedia_importance_length_correction": -95.9390869140625
},
"fasttext": {
"dclm": 0.050767239183187485,
"english": 0.88907790184021,
"fineweb_edu_approx": 1.9795863628387451,
"eai_general_math": 0.03441203013062477,
"eai_open_web_math": 0.07016115635633469,
"eai_web_code": 0.02730380930006504
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.457",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "6",
"label": "Promotional/Advertisement"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-407,699,771,801,420,800 |
Audio-power-amplifier
Posted on May 17, 2012
The single speaker amplifier circuit uses current feedback, rather than the more popular voltage feedback. The feedback loop is from the junction of the speaker terminal and a 0.5-0 resistor, to the inverting input of the NE5534. When the input to the amplifier is positive, the power supply supplies current through the TIP32 and the load to ground. Conversely, with a negative input, the TIP31 supplies current through the load to ground. The gain is set to about 15 (gain = SPKR 8 0/0.5 0 feedback). The 0.22-!LF capacitor across the speaker rolls off its response beyond the frequencies of interest.
Audio-power-amplifier
Click here to download the full size of the above Circuit.
Using the 0.22-!LF capacitor specified, the amplifier current output is 3 dB down at 90 kHz where the speaker impedance is about 20 0. To set the recommended class A output collector current, adjust the value of either 130-0 resistor. An output current of 50 to 100 mA will provide a good operating midpoint between the best crossover distortion and power dissipation.
Leave Comment
characters left:
Related Circuits
• New Circuits
.
Popular Circuits
Power Supply for the 8051 Microcontroller
Current-Loop Scr Control
solar charger circuit by lm317
birdie doorbell circuit
Solar Cell and Photovoltaic Circuits
LM386 Audio Amplifier Chip
electric output stator
555 capacitance tester circuit diagram
Super lock circuit diagram
Plus resistive and capacitive silicon tube regulator phase trigger circuit
Top
|
{
"url": "http://www.next.gr/audio/amplifiers/Audio-power-amplifier-l13579.html",
"source_domain": "www.next.gr",
"snapshot_id": "crawl=CC-MAIN-2020-29",
"warc_metadata": {
"Content-Length": "78896",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:CIDMCRL3IZEBJXI7HLON44QVZ4OZXYHR",
"WARC-Concurrent-To": "<urn:uuid:5d0fc131-4204-468f-a978-850d95879777>",
"WARC-Date": "2020-07-02T08:39:54Z",
"WARC-IP-Address": "198.211.126.132",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:CCSY5WH2IBZADBSJSQVJW2BQ4F27MGEJ",
"WARC-Record-ID": "<urn:uuid:2ef27a2d-91fb-423e-941d-2fb114d5b264>",
"WARC-Target-URI": "http://www.next.gr/audio/amplifiers/Audio-power-amplifier-l13579.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a1294113-44fa-4cd8-ae34-9e9ac0ad6230>"
},
"warc_info": "isPartOf: CC-MAIN-2020-29\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for July 2020\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-193.ec2.internal\r\nsoftware: Apache Nutch 1.17 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
22,
23,
24,
47,
48,
652,
653,
654,
676,
735,
736,
1105,
1106,
1107,
1108,
1109,
1123,
1124,
1141,
1142,
1159,
1160,
1177,
1178,
1184,
1185,
1191,
1192,
1193,
1214,
1215,
1261,
1290,
1325,
1353,
1394,
1425,
1452,
1495,
1526,
1605,
1606,
1607,
1608
],
"line_end_idx": [
22,
23,
24,
47,
48,
652,
653,
654,
676,
735,
736,
1105,
1106,
1107,
1108,
1109,
1123,
1124,
1141,
1142,
1159,
1160,
1177,
1178,
1184,
1185,
1191,
1192,
1193,
1214,
1215,
1261,
1290,
1325,
1353,
1394,
1425,
1452,
1495,
1526,
1605,
1606,
1607,
1608,
1615
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1615,
"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.2655172348022461,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.027586210519075394,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2137930989265442,
"rps_doc_frac_unique_words": 0.6041666865348816,
"rps_doc_mean_word_length": 5.224999904632568,
"rps_doc_num_sentences": 18,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.568624496459961,
"rps_doc_word_count": 240,
"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.011961719952523708,
"rps_doc_frac_chars_top_3gram": 0.035087719559669495,
"rps_doc_frac_chars_top_4gram": 0.039872411638498306,
"rps_doc_books_importance": -146.87083435058594,
"rps_doc_books_importance_length_correction": -133.0911102294922,
"rps_doc_openwebtext_importance": -69.23775482177734,
"rps_doc_openwebtext_importance_length_correction": -69.23775482177734,
"rps_doc_wikipedia_importance": -36.08338165283203,
"rps_doc_wikipedia_importance_length_correction": -22.694908142089844
},
"fasttext": {
"dclm": 0.018742380663752556,
"english": 0.7985227704048157,
"fineweb_edu_approx": 2.8785338401794434,
"eai_general_math": 0.2111581563949585,
"eai_open_web_math": 0.19700902700424194,
"eai_web_code": 0.0009064699988812208
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "621.3815",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
},
"secondary": {
"code": "621.381",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": "Mechanical engineering and Machinery"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-4,153,576,608,689,494,500 |
Statalist
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: st: Anova
From David Airey <[email protected]>
To "[email protected]" <[email protected]>
Subject Re: st: Anova
Date Fri, 28 Nov 2008 09:04:28 -0600
No, I meant the difference in R-squared between the model with all variables vs the one with those of interest removed. But are you really interested in percent variation explained or a measure of effect size? It might also be worth interpreting the coefficients in terms of change in Y with a standardized change in X.
Sent from my iPhone
On Nov 28, 2008, at 8:35 AM, aapdm <[email protected]> wrote:
Dear David,
Thanks - so are you suggesting that I should regress Y on each of the explanatory variables separately and look at the R2 in each case?
Thanks, Alice.
--- On Fri, 28/11/08, David Airey <[email protected]> wrote:
From: David Airey <[email protected]>
Subject: Re: st: Anova
To: [email protected]
Date: Friday, 28 November, 2008, 2:22 PM
This is true for balanced factorial ANOVA, but probably not
in your complicated model.
For a given variable, why not look at adjusted R^2 with
that variable (or group of dummies if categorical) in an out
of a regression model?
-Dave
On Nov 28, 2008, at 7:08 AM, aapdm wrote:
Hi,
I am trying to use the anova command but I am not sure
I am doing the right thing.
I have a dependent variable Y which I explain by 10
explanatory variables, half of which are categorical while
the others are continuous.
When I use the anova command and specify which
variables are continuous, then I get a table with the
Partial SS for each of the explanatory variables.
If I sum the Partial SS for all variables then this is
much smaller than the value reported for the Model SS. How
is that the case? What am I missing here?
What I want to is to find to what extent each of the
different explanatory variables explains the variance of the
dependent variable, which should be given by the ratio
between the Partial SS of each variable and the total SS. Am
I right?
Many thanks!
Alice.
*
* For searches and help try:
* http://www.stata.com/help.cgi?search
* http://www.stata.com/support/statalist/faq
* http://www.ats.ucla.edu/stat/stata/
*
* For searches and help try:
* http://www.stata.com/help.cgi?search
* http://www.stata.com/support/statalist/faq
* http://www.ats.ucla.edu/stat/stata/
*
* For searches and help try:
* http://www.stata.com/help.cgi?search
* http://www.stata.com/support/statalist/faq
* http://www.ats.ucla.edu/stat/stata/
*
* For searches and help try:
* http://www.stata.com/help.cgi?search
* http://www.stata.com/support/statalist/faq
* http://www.ats.ucla.edu/stat/stata/
© Copyright 1996–2013 StataCorp LP | Terms of use | Privacy | Contact us | What's new | Site index
|
{
"url": "http://www.stata.com/statalist/archive/2008-11/msg01291.html",
"source_domain": "www.stata.com",
"snapshot_id": "crawl=CC-MAIN-2013-48",
"warc_metadata": {
"Content-Length": "9689",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:24TZKAUF6K2PGT5GO2EFVBPXSY7SEBPG",
"WARC-Concurrent-To": "<urn:uuid:682ad7b0-c887-44bd-b6ba-03692895f527>",
"WARC-Date": "2013-12-11T06:27:26Z",
"WARC-IP-Address": "66.76.6.5",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:UUUK7VRDXPLNAP4RTMRK4QL5DMEZGIJA",
"WARC-Record-ID": "<urn:uuid:cd4bd52f-24b7-432c-a202-de49086b2c72>",
"WARC-Target-URI": "http://www.stata.com/statalist/archive/2008-11/msg01291.html",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3632d803-268e-49e7-9ce0-9e5cc49dd905>"
},
"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,
10,
11,
12,
87,
88,
102,
103,
104,
152,
223,
247,
286,
287,
607,
608,
628,
629,
695,
696,
708,
709,
845,
846,
861,
862,
863,
933,
934,
981,
1004,
1039,
1080,
1140,
1167,
1168,
1224,
1285,
1308,
1309,
1315,
1316,
1358,
1359,
1363,
1364,
1419,
1447,
1448,
1500,
1559,
1586,
1587,
1634,
1688,
1738,
1739,
1794,
1853,
1895,
1896,
1949,
2010,
2065,
2126,
2135,
2136,
2149,
2150,
2157,
2158,
2159,
2160,
2161,
2162,
2163,
2165,
2196,
2237,
2284,
2324,
2325,
2327,
2358,
2399,
2446,
2486,
2487,
2488,
2489,
2490,
2492,
2523,
2564,
2611,
2651,
2653,
2684,
2725,
2772,
2812,
2813,
2814,
2815
],
"line_end_idx": [
10,
11,
12,
87,
88,
102,
103,
104,
152,
223,
247,
286,
287,
607,
608,
628,
629,
695,
696,
708,
709,
845,
846,
861,
862,
863,
933,
934,
981,
1004,
1039,
1080,
1140,
1167,
1168,
1224,
1285,
1308,
1309,
1315,
1316,
1358,
1359,
1363,
1364,
1419,
1447,
1448,
1500,
1559,
1586,
1587,
1634,
1688,
1738,
1739,
1794,
1853,
1895,
1896,
1949,
2010,
2065,
2126,
2135,
2136,
2149,
2150,
2157,
2158,
2159,
2160,
2161,
2162,
2163,
2165,
2196,
2237,
2284,
2324,
2325,
2327,
2358,
2399,
2446,
2486,
2487,
2488,
2489,
2490,
2492,
2523,
2564,
2611,
2651,
2653,
2684,
2725,
2772,
2812,
2813,
2814,
2815,
2933
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2933,
"ccnet_original_nlines": 103,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.26944443583488464,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0416666716337204,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.33194443583488464,
"rps_doc_frac_unique_words": 0.454773873090744,
"rps_doc_mean_word_length": 5.442211151123047,
"rps_doc_num_sentences": 68,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.840273857116699,
"rps_doc_word_count": 398,
"rps_doc_frac_chars_dupe_10grams": 0.2012927085161209,
"rps_doc_frac_chars_dupe_5grams": 0.24007387459278107,
"rps_doc_frac_chars_dupe_6grams": 0.2012927085161209,
"rps_doc_frac_chars_dupe_7grams": 0.2012927085161209,
"rps_doc_frac_chars_dupe_8grams": 0.2012927085161209,
"rps_doc_frac_chars_dupe_9grams": 0.2012927085161209,
"rps_doc_frac_chars_top_2gram": 0.009233609773218632,
"rps_doc_frac_chars_top_3gram": 0.025854110717773438,
"rps_doc_frac_chars_top_4gram": 0.03324100002646446,
"rps_doc_books_importance": -398.4102783203125,
"rps_doc_books_importance_length_correction": -398.4102783203125,
"rps_doc_openwebtext_importance": -216.18441772460938,
"rps_doc_openwebtext_importance_length_correction": -216.18441772460938,
"rps_doc_wikipedia_importance": -145.70068359375,
"rps_doc_wikipedia_importance_length_correction": -145.70068359375
},
"fasttext": {
"dclm": 0.02875828929245472,
"english": 0.844379186630249,
"fineweb_edu_approx": 1.6330550909042358,
"eai_general_math": 0.8686609268188477,
"eai_open_web_math": 0.4471745491027832,
"eai_web_code": 0.01484500989317894
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "519.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Probabilities; or, Mathematical statistics"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-4,039,677,526,590,861,300 |
Bug #42510 Falcon: Default memory parameters must be changed
Submitted: 1 Feb 2009 9:33 Modified: 15 May 2009 13:00
Reporter: Christopher Powers Email Updates:
Status: Closed Impact on me:
None
Category:MySQL Server: Falcon storage engine Severity:S2 (Serious)
Version:6.0.9 OS:Any
Assigned to: Christopher Powers CPU Architecture:Any
Tags: F_MEMORY
Triage: Triaged: D3 (Medium)
[1 Feb 2009 9:33] Christopher Powers
Description:
The default Falcon memory parameters are:
falcon_record_memory_max = 250 MB
falcon_page_cache_size = 4 MB
falcon_record_scavenge_threshold = 67% (of record memory max)
falcon_record_scavenge_floor = 50% (of scavenge threshold)
falcon_record_chill_threshold = 5 MB
falcon_index_chill_threshold = 4 MB
I propose the following changes:
falcon_record_memory_max = 250 MB
falcon_page_cache_size = 250 MB
falcon_record_scavenge_threshold = 90% (of record memory max)
falcon_record_scavenge_floor = 80% (of scavenge threshold)
falcon_record_chill_threshold = 5 MB
falcon_index_chill_threshold = 4 MB
Reasoning:
1. Increase the page cache to 250 MB.
A properly sized page cache can make a tremendous difference in performance. For example, on Xeno the testcase for Bug #36442 required 5 hours to complete with a 4 MB page cache, but less than 5 *minutes* with a page cache of 500 MB.
Note that the page cache size is fixed, and that the page cache is pre-allocated during engine initialization. The record cache is not pre-allocated, and grows up to the record memory max.
2. Increase record scavenge threshold to 90%.
Load-based scavenging now ensures a better response to rapid filling of the record cache, so we can afford to operate closer to capacity, keeping more records in cache--a good thing.
3. Increase record scavenge floor to 80%.
This will reduce the cost of scavenging by avoiding unnecessarily deep scavenges. A higher floor will also keep more records in cache.
A final note: Backlogging is enabled by scavenging, but the backlog operation is only triggered by transaction chill operation. So, for now, no matter how desperately a backlog is needed, it will not happen unless a transaction exceeds the chill threshold. I am revisiting this policy.
How to repeat:
Run the testcase for Bug#36442 (omit the TABLE OPTIMIZE) with the default Falcon parameters.
Exit mysqld, change falcon_page_cache_size = 250MB
Re-run the test. It will complete within minutes rather than hours.
[1 Feb 2009 9:53] Bugs System
A patch for this bug has been committed. After review, it may
be pushed to the relevant source trees for release in the next
version. You can access the patch from:
http://lists.mysql.com/commits/64771
2993 Christopher Powers 2009-02-01
Bug #42510, "Falcon: Default memory parameters must be changed"
Bug #36442, "Falcon: crash during optimize table"
Increased default page cache size from 4MB to 250MB
Increased record scavenge threshold from 67 to 90
Increased record scavenge floor from 50 to 80
[1 Feb 2009 16:57] Bugs System
A patch for this bug has been committed. After review, it may
be pushed to the relevant source trees for release in the next
version. You can access the patch from:
http://lists.mysql.com/commits/64785
2994 Christopher Powers 2009-02-01
Bug #42510, "Falcon: Default memory parameters must be changed"
Updated Falcon options tests.
[2 Feb 2009 5:51] Kevin Lewis
patch approved. Please note that 80% of the record cache threshold of 90% is actually 72% of the record cache. In my opinion, 18% of cache is still a lot of records to scavenge. But it is much netter than before.
I would also like to point out that the record-cache-floor aught to have a more intuitive meaning, reflecting the percentage of falcon-record-memory-max. The downside to this proposed change in meaning is that there must be extra precautions against setting the floor as high or higher than the threshold. The current setting protects that automatically by having an upper limit of 90. If there is a consensus to change the meaning of falcon-record-scavenge-floor, it can be done in another bug.
[13 Feb 2009 7:24] Bugs System
Pushed into 6.0.10-alpha (revid:[email protected]) (version source revid:[email protected]) (merge vers: 6.0.10-alpha) (pib:6)
[15 May 2009 13:00] MC Brown
An entry has been added to the 6.0.10 changelog:
The default Falcon memory parameters have been updated. The new settings for all the memory parameters are as follows:
falcon_record_memory_max is now 250 MB
falcon_page_cache_size is now 250 MB
falcon_record_scavenge_threshold is 90% (of record memory max)
falcon_record_scavenge_floor is 80% (of scavenge threshold)
falcon_record_chill_threshold is 5 MB
falcon_index_chill_threshold is now 4MB
|
{
"url": "https://bugs.mysql.com/bug.php?id=42510",
"source_domain": "bugs.mysql.com",
"snapshot_id": "crawl=CC-MAIN-2018-09",
"warc_metadata": {
"Content-Length": "13145",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:46G6WACB3OO5LCKMDKDB73G4PPFY6ZNB",
"WARC-Concurrent-To": "<urn:uuid:df23ee3e-8ef4-4783-ae78-6cd630ae0aa3>",
"WARC-Date": "2018-02-22T18:44:42Z",
"WARC-IP-Address": "137.254.60.21",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:VDGC53FZPMOYJD37ATXOLBUOXMM6DBBY",
"WARC-Record-ID": "<urn:uuid:67859a2a-f1b4-4139-bd67-6ab551ae2ab5>",
"WARC-Target-URI": "https://bugs.mysql.com/bug.php?id=42510",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:56401f0d-1692-4cda-9b85-1ff33232060e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-184-2-158.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,
1,
62,
117,
161,
190,
196,
263,
284,
337,
352,
381,
382,
419,
432,
474,
475,
517,
559,
622,
686,
728,
770,
771,
804,
805,
847,
889,
952,
1016,
1058,
1100,
1101,
1112,
1113,
1151,
1152,
1386,
1387,
1576,
1577,
1623,
1624,
1807,
1808,
1850,
1851,
1986,
1987,
2273,
2274,
2289,
2382,
2383,
2434,
2435,
2503,
2533,
2595,
2658,
2698,
2699,
2738,
2739,
2774,
2844,
2900,
2907,
2965,
3021,
3073,
3104,
3166,
3229,
3269,
3270,
3309,
3310,
3345,
3415,
3422,
3458,
3488,
3706,
3707,
4206,
4237,
4417,
4446,
4496,
4497,
4616,
4617,
4656,
4657,
4694,
4695,
4758,
4759,
4819,
4820,
4858,
4859
],
"line_end_idx": [
1,
62,
117,
161,
190,
196,
263,
284,
337,
352,
381,
382,
419,
432,
474,
475,
517,
559,
622,
686,
728,
770,
771,
804,
805,
847,
889,
952,
1016,
1058,
1100,
1101,
1112,
1113,
1151,
1152,
1386,
1387,
1576,
1577,
1623,
1624,
1807,
1808,
1850,
1851,
1986,
1987,
2273,
2274,
2289,
2382,
2383,
2434,
2435,
2503,
2533,
2595,
2658,
2698,
2699,
2738,
2739,
2774,
2844,
2900,
2907,
2965,
3021,
3073,
3104,
3166,
3229,
3269,
3270,
3309,
3310,
3345,
3415,
3422,
3458,
3488,
3706,
3707,
4206,
4237,
4417,
4446,
4496,
4497,
4616,
4617,
4656,
4657,
4694,
4695,
4758,
4759,
4819,
4820,
4858,
4859,
4898
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4898,
"ccnet_original_nlines": 102,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.24612203240394592,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.03516028821468353,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.323681503534317,
"rps_doc_frac_unique_words": 0.40376266837120056,
"rps_doc_mean_word_length": 5.419681549072266,
"rps_doc_num_sentences": 48,
"rps_doc_symbol_to_word_ratio": 0.006204760167747736,
"rps_doc_unigram_entropy": 5.146223068237305,
"rps_doc_word_count": 691,
"rps_doc_frac_chars_dupe_10grams": 0.11481975764036179,
"rps_doc_frac_chars_dupe_5grams": 0.23364485800266266,
"rps_doc_frac_chars_dupe_6grams": 0.19225634634494781,
"rps_doc_frac_chars_dupe_7grams": 0.1687583327293396,
"rps_doc_frac_chars_dupe_8grams": 0.1687583327293396,
"rps_doc_frac_chars_dupe_9grams": 0.1687583327293396,
"rps_doc_frac_chars_top_2gram": 0.01682242937386036,
"rps_doc_frac_chars_top_3gram": 0.00854473002254963,
"rps_doc_frac_chars_top_4gram": 0.01682242937386036,
"rps_doc_books_importance": -454.5780029296875,
"rps_doc_books_importance_length_correction": -454.5780029296875,
"rps_doc_openwebtext_importance": -260.4585266113281,
"rps_doc_openwebtext_importance_length_correction": -260.4585266113281,
"rps_doc_wikipedia_importance": -263.45458984375,
"rps_doc_wikipedia_importance_length_correction": -263.45458984375
},
"fasttext": {
"dclm": 0.01891148090362549,
"english": 0.839294970035553,
"fineweb_edu_approx": 1.7293545007705688,
"eai_general_math": 0.19939583539962769,
"eai_open_web_math": 0.4839341640472412,
"eai_web_code": 0.08864141255617142
}
}
|
{
"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.72",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-5,179,382,621,253,340,000 |
/* $NetBSD: cbiiisc.c,v 1.21 2012/10/27 17:17:28 chs Exp $ */ /* * Copyright (c) 1982, 1990 The Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * * @(#)dma.c */ /* * Copyright (c) 1994,1998 Michael L. Hitch * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * * @(#)dma.c */ #include __KERNEL_RCSID(0, "$NetBSD: cbiiisc.c,v 1.21 2012/10/27 17:17:28 chs Exp $"); #include #include #include #include #include #include #include #include #include #include #include #include #define ARCH_720 /* This is for a 53c770 */ #include #include #include #include void cbiiiscattach(device_t, device_t, void *); int cbiiiscmatch(device_t, cfdata_t, void *); int cbiiisc_dmaintr(void *); #ifdef DEBUG void cbiiisc_dump(void); #endif #ifdef DEBUG #endif CFATTACH_DECL_NEW(cbiiisc, sizeof(struct siop_softc), cbiiiscmatch, cbiiiscattach, NULL, NULL); /* * if we are a CyberStorm MK III SCSI */ int cbiiiscmatch(device_t parent, cfdata_t cf, void *aux) { struct p5bus_attach_args *p5baa; p5baa = aux; if (strcmp(p5baa->p5baa_name, "cbiiisc") == 0) return 1; return 0; } void cbiiiscattach(device_t parent, device_t self, void *aux) { struct siop_softc *sc = device_private(self); siop_regmap_p rp; struct scsipi_adapter *adapt = &sc->sc_adapter; struct scsipi_channel *chan = &sc->sc_channel; aprint_normal(": CyberStorm PPC/Mk-III SCSI host adapter\n"); sc->sc_dev = self; sc->sc_siopp = rp = ztwomap(0xf40000); /* siopng_dump_registers(sc); */ /* * CTEST7 = 00 */ sc->sc_clock_freq = 50; /* Clock = 50 MHz >> */ sc->sc_ctest7 = 0x00; sc->sc_dcntl = 0x20; /* XXX ?? */ /* * Fill in the scsipi_adapter. */ memset(adapt, 0, sizeof(*adapt)); adapt->adapt_dev = self; adapt->adapt_nchannels = 1; adapt->adapt_openings = 7; adapt->adapt_max_periph = 1; adapt->adapt_request = siopng_scsipi_request; adapt->adapt_minphys = siopng_minphys; /* * Fill in the scsipi_channel. */ memset(chan, 0, sizeof(*chan)); chan->chan_adapter = adapt; chan->chan_bustype = &scsi_bustype; chan->chan_channel = 0; chan->chan_ntargets = 16; chan->chan_nluns = 8; chan->chan_id = 7; siopnginitialize(sc); if (sc->sc_channel.chan_ntargets < 0) return; sc->sc_isr.isr_intr = cbiiisc_dmaintr; sc->sc_isr.isr_arg = sc; sc->sc_isr.isr_ipl = 2; /* ?? */ add_isr(&sc->sc_isr); /* * attach all scsi units on us */ config_found(self, chan, scsiprint); } int cbiiisc_dmaintr(void *arg) { struct siop_softc *sc = arg; siop_regmap_p rp; int istat; if (sc->sc_flags & SIOP_INTSOFF) return (0); /* interrupts are not active */ rp = sc->sc_siopp; amiga_membarrier(); istat = rp->siop_istat; if ((istat & (SIOP_ISTAT_SIP | SIOP_ISTAT_DIP)) == 0) return(0); /* * save interrupt status, DMA status, and SCSI status 0 * (may need to deal with stacked interrupts?) */ sc->sc_sist = rp->siop_sist; sc->sc_istat = istat; sc->sc_dstat = rp->siop_dstat; amiga_membarrier(); siopngintr(sc); return(1); } #ifdef DEBUG void cbiiisc_dump(void) { extern struct cfdriver cbiiisc_cd; struct siop_softc *sc; int i; for (i = 0; i < cbiiisc_cd.cd_ndevs; ++i) { sc = device_lookup_private(&cbiiisc_cd, i); if (sc != NULL) siopng_dump(sc); } } #endif
|
{
"url": "http://bxr.su/NetBSD/sys/arch/amiga/dev/cbiiisc.c",
"source_domain": "bxr.su",
"snapshot_id": "crawl=CC-MAIN-2020-24",
"warc_metadata": {
"Content-Length": "6675",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TY2LWWGY4BSMG3DKG7OQJNFPKYSC4BRE",
"WARC-Concurrent-To": "<urn:uuid:d06d103d-addc-4e22-bbd2-2206aacf0783>",
"WARC-Date": "2020-05-31T12:41:37Z",
"WARC-IP-Address": "88.198.54.22",
"WARC-Identified-Payload-Type": "text/x-csrc",
"WARC-Payload-Digest": "sha1:OQZNNN3TRQO35LWMC7OJFX6V3GGKI2EN",
"WARC-Record-ID": "<urn:uuid:7489ffd0-9bc0-47ce-99c0-a77f67c75813>",
"WARC-Target-URI": "http://bxr.su/NetBSD/sys/arch/amiga/dev/cbiiisc.c",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ed42f7bf-e29f-4c09-b324-0392dd61c543>"
},
"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-36.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
],
"line_end_idx": [
5705
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5705,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.0017528500175103545,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.11137820780277252,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.1979166716337204,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.4142628312110901,
"rps_doc_frac_unique_words": 0.3953824043273926,
"rps_doc_mean_word_length": 6.02453088760376,
"rps_doc_num_sentences": 35,
"rps_doc_symbol_to_word_ratio": 0.02083333022892475,
"rps_doc_unigram_entropy": 5.19444465637207,
"rps_doc_word_count": 693,
"rps_doc_frac_chars_dupe_10grams": 0.4651497006416321,
"rps_doc_frac_chars_dupe_5grams": 0.49628743529319763,
"rps_doc_frac_chars_dupe_6grams": 0.49628743529319763,
"rps_doc_frac_chars_dupe_7grams": 0.48335328698158264,
"rps_doc_frac_chars_dupe_8grams": 0.4651497006416321,
"rps_doc_frac_chars_dupe_9grams": 0.4651497006416321,
"rps_doc_frac_chars_top_2gram": 0.04694610834121704,
"rps_doc_frac_chars_top_3gram": 0.06035928055644035,
"rps_doc_frac_chars_top_4gram": 0.06706587225198746,
"rps_doc_books_importance": -581.1824340820312,
"rps_doc_books_importance_length_correction": -581.1824340820312,
"rps_doc_openwebtext_importance": -312.4584655761719,
"rps_doc_openwebtext_importance_length_correction": -312.4584655761719,
"rps_doc_wikipedia_importance": -247.03839111328125,
"rps_doc_wikipedia_importance_length_correction": -247.03839111328125
},
"fasttext": {
"dclm": 0.9405381679534912,
"english": 0.5196923613548279,
"fineweb_edu_approx": 1.6268385648727417,
"eai_general_math": 0.832405686378479,
"eai_open_web_math": 0.5601860880851746,
"eai_web_code": 0.05622076988220215
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.456",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
746,322,268,751,823,500 |
JSON Basics What You Need to Know
A common use of JSON is to read data from a web server, and display the data in a web page.
If you’ve developed websites or web apps at all, you’ve probably heard of JSON, at least in passing. But what exactly is JSON ? What can it do, and how do you use it?
json
In this tutorial you’ll learn the basics of JSON. You’ll look at the following topics:
• What JSON does
• The kinds of things JSON is used for
• How to create JSON strings
• A simple JSON example
• How JSON compares to XML, and
• How to work with JSON using both JavaScript and PHP.
Let’s get started!
What is JSON?
JSON is a simple, text-based way to store and transmit structured data. By using a simple syntax, you can easily store anything from a single number through to strings, arrays, and objects using nothing but a string of plain text. You can also nest arrays and objects, allowing you to create complex data structures.
Once you’ve created your JSON string, it’s easy to send it to another application or computer, because it’s just plain text.
JSON has a lot of advantages:
• It’s compact
• It’s easy for both computers and people to read and write
• It maps very easily onto the data structures used by most programming languages (numbers, strings, booleans, nulls, arrays and associative arrays)
Nearly all programming languages contain functions or libraries that can read and write JSON structures
JSON stands for JavaScript Object Notation. As the name implies, it’s based on the way you define objects (which are very similar to what you’d call associative arrays or hashes in other languages), and arrays.
What is JSON used for?
JSON is most commonly used in web applications to send data from the server to the browser. Typically you transfer JSON data using Ajax, which lets your web application exchange data and messages between the browser and the server without having to reload the page.
For example:
1 – A user clicks a product thumbnail in an online store
2 – The JavaScript running in the browser makes an Ajax request to a PHP script running on the server, passing it the ID of the clicked product
3 – The PHP script retrieves the product name, description, price, and other info from the products database, encodes the data as a JSON string, and sends the string back to the browser
4- The JavaScript running in the browser decodes the JSON string and displays the product details in the page for the user.
You can also use JSON to send data from the browser to the server, provided the JSON string is properly encoded as a GET or POST parameter. This approach is less common, since the data sent in Ajax requests tend to be fairly simple (for example, a product ID). It’s more common simply to encode the data in the URL as part of the GET request.
The jQuery JavaScript library includes some useful methods, such as getJSON() and parseJSON(), that make it easy to receive JSON-encoded data via Ajax requests.
How to write JSON strings
Here are the basic rules for creating a JSON string:
• A JSON string contains either an array of values, or an object (an associative array of name/value pairs).
• An array is surrounded by square brackets, [ and ], and contains a comma-separated list of values.
• An object is surrounded by curly brackets, { and }, and contains a comma-separated list of name/value pairs.
• A name/value pair consists of a field name (in double quotes), followed by a colon (:), followed by the field value.
A value in an array or object can be:
• A number (integer or floating point)
• A string (in double quotes)
• A boolean (true or false)
• Another array (surrounded by square brackets, [ and ])
• Another object (surrounded by curly brackets, { and })
• The value null
To put double quotes inside strings, use the backslash character to escape the double quotes: “. You can also put control characters and hexadecimal-encoded characters in strings using the backslash, like you do in most programming languages. See the JSON website for details.
A simple JSON example
The following example shows how you might store a simple shopping cart in JSON format:
{
"orderID": 12345,
"shopperName": "John deo",
"shopperEmail": "[email protected]",
"contents": [
{
"productID": 34,
"productName": "SuperWidget",
"quantity": 1
},
{
"productID": 56,
"productName": "WonderWidget",
"quantity": 3
}
],
"orderCompleted": true
}
Let’s break this string down:
• At the top level, we’ve written curly braces ({ and }), which creates an object.
• Inside the object, we have several name/value pairs:
"orderID": 12345
A property with the name "orderId" and the integer value 12345
"shopperName": "John deo"
A property with the name "shopperName" and the string value "John deo"
"shopperEmail": "[email protected]"
A property with the name "shopperEmail" and the string value "[email protected]"
"contents": [ ... ]
A property with the name "contents", whose value in an array
"orderCompleted": true
A property with the name "orderCompleted" and the boolean value true
• Inside the "contents" array, we have 2 objects representing individual order lines in the cart. Each object contains 3 properties: productID, productName, and quantity.
By the way, since JSON is very closely based on the notation JavaScript uses to create arrays and objects, you can take the above JSON string and create a JavaScript object from it very easily:
<script type="text/javascript">
var cart = {
"orderID": 12345,
"shopperName": "John deo",
"shopperEmail": "[email protected]",
"contents": [
{
"productID": 34,
"productName": "SuperWidget",
"quantity": 1
},
{
"productID": 56,
"productName": "WonderWidget",
"quantity": 3
}
],
"orderCompleted": true
};
</script>
JSON vs. XML
In many ways, you can think of JSON as an alternative to XML — at least in terms of web applications. The Ajax concept (Asynchronous JavaScript And XML) originally used XML to transmit data between server and browser, but in recent years JSON has become a more popular way to carry Ajax data.
While XML is a tried-and-tested technology and is used in a huge range of applications, JSON’s advantages are that it tends to be more compact than XML, and easier to read and write.
Here’s the previous JSON example written as XML instead:
<object>
<property>
<key>orderID</key>
<number>12345</number>
</property>
<property>
<key>shopperName</key>
<string>John deo</string>
</property>
<property>
<key>shopperEmail</key>
<string>[email protected]</string>
</property>
<property>
<key>contents</key>
<array>
<object>
<property>
<key>productID</key>
<number>34</number>
</property>
<property>
<key>productName</key>
<string>SuperWidget</string>
</property>
<property>
<key>quantity</key>
<number>1</number>
</property>
</object>
<object>
<property>
<key>productID</key>
<number>56</number>
</property>
<property>
<key>productName</key>
<string>WonderWidget</string>
</property>
<property>
<key>quantity</key>
<number>3</number>
</property>
</object>
</array>
</property>
<property>
<key>orderCompleted</key>
<boolean>true</boolean>
</property>
</object>
As you can see, this XML version is a fair bit longer. In fact it’s 1,128 characters long, whereas the JSON version is only 323 characters long. The XML version is also harder to read.
This is quite an extreme example, and it’s common to write XML in a less verbose format than this. However, even compact XML formats usually take up more space than their JSON equivalents.
How to create and read JSON strings in JavaScript
JSON might be a simple format, but it’s obviously fairly tedious to write JSON strings by hand. What’s more, you often need to be able to take a JSON string, and convert its contents into a variable that can be used by your code.
Fortunately, most programming languages give you tools that can easily turn variables into JSON strings, and vice-versa. The basic idea is as follows:
To create a JSON string, you start with a variable containing some data, then pass it through a function to turn that data into a JSON string.
To read a JSON string, you start with a JSON string representing some data, then pass it through a function to create a variable containing the data.
Let’s take a look at how to create and read JSON strings in JavaScript.
Creating a JSON string from a JavaScript variable
JavaScript contains a built-in method, JSON.stringify(), that takes a JavaScript variable and outputs a JSON string representing the variable’s contents. For example, let’s create a JavaScript object containing our cart data from earlier, then create a JSON string from that object:
<script type="text/javascript">
var cart = {
"orderID": 12345,
"shopperName": "John deo",
"shopperEmail": "[email protected]",
"contents": [
{
"productID": 34,
"productName": "SuperWidget",
"quantity": 1
},
{
"productID": 56,
"productName": "WonderWidget",
"quantity": 3
}
],
"orderCompleted": true
};
alert ( JSON.stringify( cart ) );
</script>
This produces the output:
{"orderID":12345,"shopperName":"John deo","shopperEmail":"[email protected]",
"contents":[{"productID":34,"productName":"SuperWidget","quantity":1},
{"productID":56,"productName":"WonderWidget","quantity":3}],
"orderCompleted":true}
Notice that JSON.stringify() outputs JSON strings with all whitespace removed. It’s harder to read, but it makes the string more compact for sending around the web.
Creating a JavaScript variable from a JSON string
There are quite a few ways to parse a JSON string in JavaScript, but the safest and most reliable way is to use JavaScript’s built-in JSON.parse() method. This takes a JSON string and returns a JavaScript object or array containing the JSON data. Here’s an example:
<script type="text/javascript">
var jsonString = '
{
"orderID": 12345,
"shopperName": "John deo",
"shopperEmail": "[email protected]",
"contents": [
{
"productID": 34,
"productName": "SuperWidget",
"quantity": 1
},
{
"productID": 56,
"productName": "WonderWidget",
"quantity": 3
}
],
"orderCompleted": true
}
';
var cart = JSON.parse ( jsonString );
alert ( cart.shopperEmail );
alert ( cart.contents[1].productName );
</script>
Here we’ve created a variable, jsonString, that holds the JSON string for our shopping cart example. Then we’ve passed this string through JSON.parse() to create an object holding the JSON data, which we store in cart. We then check the conversion worked by displaying the contents of the object’s shopperEmail property, as well as the value of the productName property of the second object in the contents array.
This displays the following output:
[email protected]
WonderWidget
In a real-world online store application, your JavaScript would likely receive the shopping cart JSON string as an Ajax response from a server script, pass the string to JSON.parse(), then use the data in the resulting object to display the cart to the user in the page.
JSON.stringify() and JSON.parse() can do other things too, such as allowing callback functions to do their own custom conversions of certain values. This is handy for things like converting a date value in a JSON string to a proper JavaScript Date object.
How to create and read JSON strings in PHP
PHP, like JavaScript, has functions that can convert variables to JSON strings and vice-versa. Let’s take a look at them.
Creating a JSON string from a PHP variable
json_encode() takes a PHP variable and returns a JSON string representing the variable. Here’s our shopping cart example written in PHP:
<?php
$cart = array(
"orderID" => 12345,
"shopperName" => "John deo",
"shopperEmail" => "[email protected]",
"contents" => array(
array(
"productID" => 34,
"productName" => "SuperWidget",
"quantity" => 1
),
array(
"productID" => 56,
"productName" => "WonderWidget",
"quantity" => 3
)
),
"orderCompleted" => true
);
echo json_encode( $cart );
?>
This produces exactly the same output as our JavaScript example — a valid JSON string representing the variable’s contents:
{"orderID":12345,"shopperName":"John deo","shopperEmail":"[email protected]","contents":[{"productID":34,"productName":"SuperWidget","quantity":1},{"productID":56,"productName":"WonderWidget","quantity":3}],"orderCompleted":true}
In a real-world online store, your PHP script would send this JSON string as part of the Ajax response back to the browser, where the JavaScript code would use JSON.parse() to turn the string back into a variable so it can display the cart’s contents to the shopper.
You can also pass various flags as a second argument to json_encode(). These let you do things like encode certain special characters using hex notation to make the string more portable, and force empty and indexed arrays to be encoded as objects (associative arrays). Find out more.
Creating a PHP variable from a JSON string
To go the other way and convert a JSON string into a PHP variable, you use — you guessed it — json_decode(). Let’s rewrite our JavaScript JSON.parse() example in PHP:
<?php
$jsonString = '
{
"orderID": 12345,
"shopperName": "John deo",
"shopperEmail": "[email protected]",
"contents": [
{
"productID": 34,
"productName": "SuperWidget",
"quantity": 1
},
{
"productID": 56,
"productName": "WonderWidget",
"quantity": 3
}
],
"orderCompleted": true
}
';
$cart = json_decode( $jsonString );
echo $cart->shopperEmail . "<br>";
echo $cart->contents[1]->productName . "<br>";
?>
As with the JavaScript version, this produces the following output:
[email protected]
WonderWidget
By default, json_decode() returns JSON “objects” as actual PHP objects. These are generic PHP objects of the stdClass class. That’s why we used -> to access the objects’ properties in the example above.
If you’d rather return JSON objects as PHP associative arrays, just pass true as a second argument to json_decode(). For example:
$cart = json_decode( $jsonString, true );
echo $cart["shopperEmail"] . "<br>";
echo $cart["contents"][1]["productName"] . "<br>";
This displays the same output:
[email protected]
WonderWidget
ou can also pass other arguments to json_decode() to specify things like the recursion depth and how to handle large integers. Find out more.
Summary
In this tutorial you’ve learned the basics of JSON. You’ve looked at:
• What JSON is, and what it’s used for
• The syntax of JSON strings
• A simple example of a JSON string
• How JSON compares to XML, and
• How to read and write JSON strings in both JavaScript and PHP.
Although simple to understand and use, JSON is a very useful and flexible way to transfer data between applications and computers, particularly when sending Ajax data from server to browser. If you’re planning to write Ajax applications then you’ll no doubt find that JSON is an essential tool in your toolbox.
I hope you enjoyed reading this tutorial. Happy coding!
Please follow and like us:
Add a Comment
|
{
"url": "https://www.quickmysupport.com/php/json-basics-what-you-need-to-know/",
"source_domain": "www.quickmysupport.com",
"snapshot_id": "crawl=CC-MAIN-2021-17",
"warc_metadata": {
"Content-Length": "77609",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ULGNLSMHBUEAY4AQOQGTFMJ55TGXD76K",
"WARC-Concurrent-To": "<urn:uuid:abbbe6e0-2dd0-4089-9fb7-4aa77836e332>",
"WARC-Date": "2021-04-21T01:14:22Z",
"WARC-IP-Address": "166.62.28.127",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:NMHHUXX6LCORIYINO4JNLHUXUC3LPICX",
"WARC-Record-ID": "<urn:uuid:072b9482-aa02-459c-b933-02c275efe4d4>",
"WARC-Target-URI": "https://www.quickmysupport.com/php/json-basics-what-you-need-to-know/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:745d6fc2-f642-48bb-b80e-df7cf7cc13d1>"
},
"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-55.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,
34,
35,
127,
294,
299,
300,
387,
388,
407,
448,
479,
505,
539,
596,
597,
616,
617,
631,
632,
949,
950,
1075,
1076,
1106,
1107,
1124,
1186,
1337,
1445,
1446,
1657,
1658,
1681,
1682,
1948,
1949,
1962,
1963,
2020,
2164,
2350,
2474,
2475,
2818,
2819,
2980,
2981,
3007,
3008,
3061,
3062,
3173,
3276,
3389,
3510,
3554,
3555,
3598,
3632,
3664,
3725,
3786,
3807,
3808,
4085,
4086,
4108,
4109,
4196,
4197,
4199,
4219,
4248,
4289,
4305,
4311,
4334,
4370,
4390,
4397,
4403,
4426,
4463,
4483,
4489,
4494,
4519,
4521,
4522,
4552,
4553,
4638,
4695,
4716,
4783,
4813,
4888,
4930,
5017,
5041,
5106,
5133,
5206,
5379,
5380,
5574,
5575,
5607,
5620,
5640,
5669,
5710,
5726,
5732,
5755,
5791,
5811,
5818,
5824,
5847,
5884,
5904,
5910,
5915,
5940,
5943,
5953,
5954,
5956,
5957,
5970,
5971,
6264,
6265,
6448,
6449,
6506,
6507,
6516,
6529,
6552,
6579,
6593,
6606,
6633,
6663,
6677,
6690,
6718,
6759,
6773,
6786,
6810,
6822,
6837,
6856,
6887,
6917,
6937,
6956,
6989,
7028,
7048,
7067,
7097,
7126,
7154,
7170,
7185,
7204,
7235,
7265,
7285,
7304,
7337,
7377,
7397,
7416,
7446,
7475,
7496,
7512,
7525,
7539,
7552,
7582,
7610,
7626,
7636,
7637,
7822,
7823,
8012,
8013,
8015,
8016,
8066,
8067,
8297,
8298,
8449,
8450,
8593,
8743,
8744,
8816,
8817,
8819,
8820,
8870,
8871,
9154,
9155,
9187,
9188,
9201,
9221,
9250,
9291,
9307,
9313,
9336,
9372,
9392,
9399,
9405,
9428,
9465,
9485,
9491,
9496,
9521,
9524,
9525,
9560,
9561,
9571,
9572,
9598,
9599,
9679,
9750,
9811,
9834,
9835,
10000,
10001,
10003,
10004,
10054,
10055,
10321,
10322,
10354,
10355,
10400,
10445,
10490,
10533,
10576,
10621,
10666,
10711,
10756,
10801,
10846,
10891,
10936,
10981,
11026,
11071,
11116,
11161,
11206,
11209,
11210,
11248,
11249,
11278,
11318,
11319,
11329,
11330,
11744,
11745,
11781,
11782,
11802,
11815,
11816,
12087,
12088,
12344,
12345,
12388,
12389,
12511,
12512,
12555,
12556,
12693,
12694,
12700,
12715,
12737,
12768,
12811,
12834,
12845,
12870,
12908,
12930,
12937,
12948,
12973,
13012,
13034,
13040,
13045,
13072,
13075,
13076,
13103,
13106,
13107,
13231,
13232,
13464,
13465,
13732,
13733,
14017,
14018,
14020,
14021,
14064,
14065,
14232,
14233,
14239,
14255,
14300,
14345,
14388,
14431,
14476,
14521,
14566,
14611,
14655,
14700,
14745,
14790,
14835,
14880,
14925,
14970,
15015,
15060,
15063,
15064,
15100,
15135,
15182,
15185,
15186,
15254,
15255,
15275,
15288,
15289,
15492,
15493,
15623,
15624,
15666,
15703,
15754,
15755,
15786,
15787,
15807,
15820,
15821,
15963,
15964,
15972,
15973,
16043,
16044,
16085,
16116,
16154,
16188,
16255,
16256,
16567,
16568,
16624,
16625,
16652,
16653
],
"line_end_idx": [
34,
35,
127,
294,
299,
300,
387,
388,
407,
448,
479,
505,
539,
596,
597,
616,
617,
631,
632,
949,
950,
1075,
1076,
1106,
1107,
1124,
1186,
1337,
1445,
1446,
1657,
1658,
1681,
1682,
1948,
1949,
1962,
1963,
2020,
2164,
2350,
2474,
2475,
2818,
2819,
2980,
2981,
3007,
3008,
3061,
3062,
3173,
3276,
3389,
3510,
3554,
3555,
3598,
3632,
3664,
3725,
3786,
3807,
3808,
4085,
4086,
4108,
4109,
4196,
4197,
4199,
4219,
4248,
4289,
4305,
4311,
4334,
4370,
4390,
4397,
4403,
4426,
4463,
4483,
4489,
4494,
4519,
4521,
4522,
4552,
4553,
4638,
4695,
4716,
4783,
4813,
4888,
4930,
5017,
5041,
5106,
5133,
5206,
5379,
5380,
5574,
5575,
5607,
5620,
5640,
5669,
5710,
5726,
5732,
5755,
5791,
5811,
5818,
5824,
5847,
5884,
5904,
5910,
5915,
5940,
5943,
5953,
5954,
5956,
5957,
5970,
5971,
6264,
6265,
6448,
6449,
6506,
6507,
6516,
6529,
6552,
6579,
6593,
6606,
6633,
6663,
6677,
6690,
6718,
6759,
6773,
6786,
6810,
6822,
6837,
6856,
6887,
6917,
6937,
6956,
6989,
7028,
7048,
7067,
7097,
7126,
7154,
7170,
7185,
7204,
7235,
7265,
7285,
7304,
7337,
7377,
7397,
7416,
7446,
7475,
7496,
7512,
7525,
7539,
7552,
7582,
7610,
7626,
7636,
7637,
7822,
7823,
8012,
8013,
8015,
8016,
8066,
8067,
8297,
8298,
8449,
8450,
8593,
8743,
8744,
8816,
8817,
8819,
8820,
8870,
8871,
9154,
9155,
9187,
9188,
9201,
9221,
9250,
9291,
9307,
9313,
9336,
9372,
9392,
9399,
9405,
9428,
9465,
9485,
9491,
9496,
9521,
9524,
9525,
9560,
9561,
9571,
9572,
9598,
9599,
9679,
9750,
9811,
9834,
9835,
10000,
10001,
10003,
10004,
10054,
10055,
10321,
10322,
10354,
10355,
10400,
10445,
10490,
10533,
10576,
10621,
10666,
10711,
10756,
10801,
10846,
10891,
10936,
10981,
11026,
11071,
11116,
11161,
11206,
11209,
11210,
11248,
11249,
11278,
11318,
11319,
11329,
11330,
11744,
11745,
11781,
11782,
11802,
11815,
11816,
12087,
12088,
12344,
12345,
12388,
12389,
12511,
12512,
12555,
12556,
12693,
12694,
12700,
12715,
12737,
12768,
12811,
12834,
12845,
12870,
12908,
12930,
12937,
12948,
12973,
13012,
13034,
13040,
13045,
13072,
13075,
13076,
13103,
13106,
13107,
13231,
13232,
13464,
13465,
13732,
13733,
14017,
14018,
14020,
14021,
14064,
14065,
14232,
14233,
14239,
14255,
14300,
14345,
14388,
14431,
14476,
14521,
14566,
14611,
14655,
14700,
14745,
14790,
14835,
14880,
14925,
14970,
15015,
15060,
15063,
15064,
15100,
15135,
15182,
15185,
15186,
15254,
15255,
15275,
15288,
15289,
15492,
15493,
15623,
15624,
15666,
15703,
15754,
15755,
15786,
15787,
15807,
15820,
15821,
15963,
15964,
15972,
15973,
16043,
16044,
16085,
16116,
16154,
16188,
16255,
16256,
16567,
16568,
16624,
16625,
16652,
16653,
16666
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 16666,
"ccnet_original_nlines": 402,
"rps_doc_curly_bracket": 0.002880119951441884,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28728944063186646,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04379786178469658,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3053598701953888,
"rps_doc_frac_unique_words": 0.24238227307796478,
"rps_doc_mean_word_length": 5.225300312042236,
"rps_doc_num_sentences": 116,
"rps_doc_symbol_to_word_ratio": 0.00030628000968135893,
"rps_doc_unigram_entropy": 5.368016242980957,
"rps_doc_word_count": 2166,
"rps_doc_frac_chars_dupe_10grams": 0.08764798939228058,
"rps_doc_frac_chars_dupe_5grams": 0.2058667540550232,
"rps_doc_frac_chars_dupe_6grams": 0.15753667056560516,
"rps_doc_frac_chars_dupe_7grams": 0.12714259326457977,
"rps_doc_frac_chars_dupe_8grams": 0.1229015663266182,
"rps_doc_frac_chars_dupe_9grams": 0.10125464200973511,
"rps_doc_frac_chars_top_2gram": 0.024739349260926247,
"rps_doc_frac_chars_top_3gram": 0.019438060000538826,
"rps_doc_frac_chars_top_4gram": 0.014225129969418049,
"rps_doc_books_importance": -1495.9454345703125,
"rps_doc_books_importance_length_correction": -1495.9454345703125,
"rps_doc_openwebtext_importance": -846.4136352539062,
"rps_doc_openwebtext_importance_length_correction": -846.4136352539062,
"rps_doc_wikipedia_importance": -719.8025512695312,
"rps_doc_wikipedia_importance_length_correction": -719.8025512695312
},
"fasttext": {
"dclm": 0.3952115774154663,
"english": 0.7637571096420288,
"fineweb_edu_approx": 3.207509994506836,
"eai_general_math": 0.4801511764526367,
"eai_open_web_math": 0.1331775188446045,
"eai_web_code": 0.6352896094322205
}
}
|
{
"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": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "23",
"label": "Tutorial"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-5,995,076,296,605,843,000 |
Fine-grained hardness of lattice problems: Open questions
1 Introduction
1.1 Lattices and lattice-based cryptography
Lattices are classically-studied geometric objects that in the past few decades have found a multitude of applications in computer science. The most important application area is lattice-based cryptography, the design of cryptosystems whose security is based on the apparent intractability of computational problems on lattices, even for quantum computers. Indeed, lattice-based cryptography has revolutionized the field because of its apparent quantum resistance and its other attractive security, functionality, and efficiency properties.
Intuitively, a lattice is a regular ordering of points in some (typically high-dimensional) space. More precisely, a lattice \( {{\cal{L}}}\) of rank \( {n}\) is the set of all integer linear combinations of some linearly independent vectors \( {\mathbf{b}_1, \ldots, \mathbf{b}_n}\), which are called a basis of \( {{\cal{L}}}\). We will be primarily interested in analyzing the running times of lattice algorithms as functions of the lattice’s rank \( {n}\).
1.2. Computational lattice problems
The two most important computational problems on lattices are the Shortest Vector Problem (SVP) and the Closest Vector Problem (CVP). SVP asks, given a basis of a lattice \( {{\cal{L}}}\) as input, to find a shortest non-zero vector in \( {{\cal{L}}}\). CVP, which can be viewed as an inhomogeneous version of SVP, asks, given a basis of a lattice \( {{\cal{L}}}\) and a target point \( {\mathbf{t}}\) as input, to find a closest vector in \( {{\cal{L}}}\) to \( {\mathbf{t}}\).
Algorithms for solving SVP form the core of the best known attacks on lattice-based cryptography both in theory and in practice. Accordingly, it is critical to understand the precise complexity of SVP as well as possible. The best provably correct algorithms for both SVP and CVP run in \( {2^{n + o(n)}}\)-time [ADRS15, ADS15, AS18a]. The best heuristic algorithms for SVP run in \( {2^{cn + o(n)}}\)-time for \( {c = 0.292}\) classically [BDGL16] and \( {c = 0.265}\) using quantum speedups [Laa15] (see also [KMPR19]), and most real-world lattice-based cryptosystems assume that these algorithms are close to optimal. Indeed, many of these cryptosystems assume what Bos et al. [B+16] call a “paranoid” worst-case estimate of \( {c = 0.2075}\) (based on the kissing number and assuming that sieving algorithms are optimal) as the fastest hypothetical running time for SVP algorithms when choosing parameters. (See also Albrecht et al. [A+18], which surveys the security assumptions made in a wide range of lattice-based cryptosystems.) Accordingly, the difference in being able to solve SVP in \( {2^{0.2075n}}\) versus \( {2^{n/20}}\) versus \( {2^{\sqrt{n}}}\) time may mean the difference between lattice-based cryptosystems being secure, insecure with current parameters, or effectively broken in practice.
There is a rank-preserving reduction from SVP to CVP [GMSS99], so any algorithm for CVP immediately gives an essentially equally fast algorithm for SVP. In other words, CVP is at least as hard as SVP (and probably a bit harder). Indeed, historically, almost all lower bounds for SVP are proven via reduction from CVP (and nearly all algorithmic progress on CVP uses ideas originally developed for SVP).
1.3. Fine-grained hardness
The field of fine-grained complexity works to give strong, quantitative lower bounds on computational problems assuming standard complexity-theoretic assumptions. Proving such a (conditional) lower bound for an \( {{\mathsf{NP}}}\)-hard problem generally works by (1) assuming a stronger hardness assumption than \( {{\mathsf{P}} \neq {\mathsf{NP}}}\) about the complexity of \( {k}\)-SAT (such as ETH or SETH, defined below), and (2) giving a highly efficient reduction from \( {k}\)-SAT to the problem. The most important hardness assumptions for giving lower bounds on \( {{\mathsf{NP}}}\)-hard problems are the Exponential Time Hypothesis (ETH) and the Strong Exponential Time Hypothesis (SETH) of Impagliazzo and Paturi [IP01]. ETH asserts that there is no \( {2^{o(n)}}\)-time algorithm for \( {3}\)-SAT, and SETH asserts that for every \( {\epsilon > 0}\) there exists \( {k \in {\mathbb Z}^+}\) such that there is no \( {2^{(1 – \epsilon)n}}\)-time algorithm for \( {k}\)-SAT, where \( {n}\) denotes the number of variables in the SAT instance.
Here by “highly efficient” reductions we mean linear ones, i.e., reductions that map a \( {3}\)-SAT or \( {k}\)-SAT formula on \( {n}\) variables to an SVP or CVP instance of rank \( {C n + o(n)}\) for some absolute constant \( {C > 0}\). Indeed, by giving a reduction from \( {3}\)-SAT (respectively, \( {k}\)-SAT for any \( {k \in {\mathbb Z}^+}\)) instances on \( {n}\) variables to SVP or CVP instances of rank \( {C n + o(n)}\), we can conclude that there is no \( {2^{o(n)}}\)-time (resp., \( {2^{(1-\epsilon)n/C}}\)-time for any \( {\epsilon > 0}\)) algorithm for the corresponding problem assuming ETH (resp., SETH). Note that the smaller the value of \( {C}\) for which one can show such a reduction, the stronger the conclusion. In particular, a reduction mapping \( {k}\)-SAT instances on \( {n}\) variables to SVP or CVP instances of rank \( {n + o(n)}\) would imply an essentially tight lower bound on the corresponding problem assuming SETH — as mentioned above, the best provably correct algorithms for both SVP and CVP run in time \( {2^{n + o(n)}}\).
1.4. Fine-grained hardness of CVP (and SVP)
It is relatively easy to show that CVP is “ETH-hard,” i.e., to show that a \( {2^{o(n)}}\)-time algorithm for CVP would imply a \( {2^{o(n)}}\)-time algorithm for \( {3}\)-SAT instances with \( {n}\) variables. This would falsify ETH. (It’s a nice exercise to show that the Subset Sum problem on a set of size \( {n}\) reduces to CVP on a lattice of rank \( {n}\), which implies the result.)
With some work, Divesh Aggarwal and Noah extended this to SVP [AS18b]. In particular, we showed a reduction from CVP to SVP that only increases the rank of the lattice by some constant multiplicative factor. (Formally, the reduction only works with certain minor constraints on the CVP instance. The reduction originally relied on a geometric conjecture, which was open for decades. But, Serge Vlăduţ proved the conjecture [Vlă19] shortly after we published!)
So, unless ETH is false, there is no \( {2^{o(n)}}\)-time algorithm for CVP or SVP. But, for cryptographic applications, even, say, a \( {2^{n/20}}\)-time algorithm would be completely devastating. If such an algorithm were found, cryptographic schemes that we currently think are secure against absurdly powerful attackers straight out of science fiction (say, one with a computer the size of the sun running until the heat death of the universe) would turn out to be easily broken (e.g., in seconds on our laptops).
In [BGS17, ABGS20], we almost showed that CVP is “SETH-hard,” i.e., that a \( {2^{(1-\epsilon)n}}\)-time algorithm for CVP would imply such an algorithm for \( {k}\)-SAT for any constant \( {k}\). This would falsify SETH. So, we almost showed that the [ADS15] algorithm is optimal. The “almost” is because our proof works with \( {\ell_p}\) norms, that is, we show hardness for the version of CVP in which the distance from the target to a lattice vector is defined in terms of the \( {\ell_p}\) norm,
\( \displaystyle \|\mathbf{x}\|_p := (|x_1|^p + \cdots + |x_d|^p)^{1/p} \; . \)
We call the corresponding problem \( {{\mathrm{CVP}}_p}\). In fact, our proof works for all \( {\ell_p}\) norms except when \( {p}\) is an even integer. (To see why this might happen, notice \( {\|\mathbf{x}\|_p^p}\) is a polynomial in the \( {x_i}\) if and only if \( {p}\) is an even integer. In fact, there’s some sense in which “\( {\ell_2}\) is the easiest norm,” because for any \( {p}\), there is a linear map \( {A \in {\mathbb R}^{d \times m}}\) such that \( {m}\) is not too large and \( {\|\mathbf{x}\|_2 \approx \|A \mathbf{x}\|_p}\).) Of course, we are most interested in the case \( {p= 2}\) (the only case for which the [ADS15] algorithm works), which is an even integer! Indeed, for all \( {p \neq 2}\), the fastest known algorithm for CVP is still Ravi Kannan’s \( {n^{O(n)}}\)-time algorithm from 1987 [Kan87]. (For SVP and for constant-factor approximate CVP, \(2^{O(n)}\)-time algorithms are known [DPV11].)
In fact, we showed that for \( {p = 2}\), no “natural” reduction can rule out a \( {2^{3n/4}}\)-time algorithm for CVP under SETH. A “natural” reduction is one with a fixed bijection between witnesses. In particular, any “natural” reduction from \( {3}\)-SAT to CVP must reduce to a lattice with rank at least roughly \( {4n/3}\). So, new ideas will be needed to prove stronger hardness of CVP in the \( {\ell_2}\) norm.
2. Open problems
We now discuss some of the problems that we left open in [BGS17, ABGS20]. For simplicity, we ask for specific results (e.g., “prove that problem \( {A}\) is \( {T}\)-hard under hypothesis \( {B}\)“), but of course any similar results would be very interesting (e.g., “\( {A}\) is \( {T’}\)-hard under hypothesis \( {B’}\)“).
2.1. Hardness in the \(\ell_2\) norm
The most obvious question that we left open is, of course, to prove similar \( {2^n}\)-time hardness results for \( {{\mathrm{CVP}}_2}\) (and more generally for \( {{\mathrm{CVP}}_p}\) for even integers \( {p}\)).
Open problem 1. Show that there is no \( {2^{0.99 n}}\)-time algorithm for \( {{\mathrm{CVP}}_2}\) assuming SETH.
Remember that we showed that any proof of such a strong result would have to use an “unnatural” reduction. So, a fundamentally different approach is needed. One potentially promising direction would be to find a Cook reduction, as our limitations only apply to Karp reductions.
Alternatively, one might try for a different result that gets around this “natural” reduction limitations. E.g., even the following much weaker result would be very interesting.
Open problem 2. Show an efficient reduction from \( {3}\)-SAT on \( {n}\) variables to \( {{\mathrm{CVP}}_2}\) on a lattice of rank \( {\approx 10n}\).
Such a reduction to \( {{\mathrm{CVP}}_2}\) on a lattice of rank \( {Cn}\) for some large constant \( {C}\) is known by applying the Sparsification Lemma [IPZ01] to \( {3}\)-SAT, but showing such a reduction for any reasonably small \( {C}\) or even any explicit \( {C}\) using a different proof technique would be interesting.
Also, our limitations only apply to reductions that map satisfying assignments to exact closest vectors. So, one might try to get around our limitation by working directly with approximate versions of \( {3}\)-SAT and \( {{\mathrm{CVP}}_2}\). (In [ABGS20], we show such reductions from Gap-\( {k}\)-SAT to constant-factor approximate \( {{\mathrm{CVP}}_p}\) for all \( {p \notin 2{\mathbb Z}}\) as well as all \( {k \leq p}\). We also show reductions from Gap-\( {k}\)-Parity that achieve relatively large approximation factors.)
Open problem 3. Show an efficient reduction from Gap-\( {3}\)-SAT on \( {n}\) variables to approximate \( {{\mathrm{CVP}}_2}\) on a lattice of rank \( {n}\).
2.2. Hardness in \(\ell_p\) norms
Intuitively, one reason that we are able to prove such strong results for \( {\ell_p}\) norms for \( {p \neq 2}\) is because we can use lattices with large ambient dimension \( {d}\) but low rank \( {n}\). In other words, while our reductions produce lattices \( {{\cal{L}}}\) that live in some \( {n}\)-dimensional subspace of \( {\ell_p}\)-space, the ambient space itself has large dimension \( {d}\) relative to \( {n}\). Of course, any subspace of the \( {\ell_2}\) norm is an \( {\ell_2}\) subspace (i.e., every slice of a ball is a lower-dimensional ball), so in the \( {\ell_2}\) norm, one can assume without loss of generality that \( {d = n}\). In particular, if we were able to prove \( {2^n}\)-hardness for the \( {\ell_2}\) norm, then we would actually prove \( {2^d}\)-hardness for free. However, a potentially easier problem would be to improve the \( {2^n}\)-hardness of \( {{\mathrm{CVP}}_p}\) shown in [BGS17, ABGS20] to \( {2^d}\)-hardness for some \( p \neq 2 \).
Open problem 4. Show that there is no \( {2^{0.99 d}}\)-time algorithm for \( {{\mathrm{CVP}}_p}\) (for some \( {p}\)) assuming SETH.
More generally, it would be very interesting to settle the fine-grained complexity of \( {{\mathrm{CVP}}_p}\) for some \( {p \neq 2}\) (either in terms of rank \( {n} \) or dimension \( {d} \)). This could take the form either of showing improved algorithms (currently the fastest algorithms for \( {{\mathrm{CVP}}_p}\) for general \( {p}\) run in \( {n^{O(n)}}\)-time [Kan87], and \( {2^{O(n)}}\)-time for a constant approximation factor [DPV11]), or showing super-\( {2^n}\) hardness, or both.
Open problem 5. Show matching upper bounds and lower bounds (under SETH) for \( {{\mathrm{CVP}}_p}\) for some \( {p}\) (possibly with a constant approximation factor).
The case where \( {p = \infty}\) is especially interesting. Indeed, because the kissing number in the \( {\ell_\infty}\) norm is \( {3^n-1}\), one might guess that the fastest algorithms for \( {{\mathrm{CVP}}_\infty}\) and \( {{\mathrm{SVP}}_\infty}\) actually run in time \( {3^{n + o(n)}}\) or perhaps \( {3^{d + o(d)}}\). (See [AM18], which essentially achieves this.) We therefore ask whether stronger lower bounds can be proven in this special case.
Open problem 6. Show that \( {{\mathrm{CVP}}_\infty}\) cannot be solved in time \( {3^{0.99n}}\) (under SETH).
2.3. Hardness closer to crypto
The most relevant problem to cryptography is approximate \( {{\mathrm{SVP}}_2}\) with an approximation factor that is polynomial in the rank \( {n}\). Our fastest algorithms to solve this problem work via a reduction to exact (or near exact) \( {{\mathrm{SVP}}_2}\) with some lower rank \( {n’ = \Theta(n)}\), so that even for these polynomial approximation factors, our fastest algorithms run in time \( {2^{\Omega(n)}}\) (where the hidden constant depends on the polynomial; see Michael’s post for more on this topic). And, hardness results for exact SVP rule out attacks on cryptography that use such reductions. We currently only know how to rule out \( {2^{o(n)}}\)-time algorithms for \( {{\mathrm{SVP}}_2}\) (under the Gap-ETH assumption). We ask whether we can do better. (In [AS18b], we proved the stronger result below for \( {\ell_p}\) norms for large enough \( {p \notin 2{\mathbb Z}}\).)
Open problem 7. Prove that there is no \( {2^{n/10}}\)-time algorithm for \( {{\mathrm{SVP}}_2}\) (under SETH).
Of course, we would ideally like to directly rule out faster algorithms for approximate \( {{\mathrm{SVP}}_2}\) with the approximation factors that are most directly relevant to cryptography. There are serious complexity-theoretic barriers to overcome to get all the way there (e.g., \( {{\mathrm{CVP}}_p}\) and \( {{\mathrm{SVP}}_p}\) are known to be in \( {{\mathsf{NP}}} \cap {{\mathsf{coNP}}}\) for large enough polynomial approximation factors. But, we can still hope to get as close as possible, by proving stronger hardness results for approximate \( {{\mathrm{CVP}}_p}\) and approximate \( {{\mathrm{SVP}}_p}\). Indeed, a beautiful sequence of works showed hardness for approximation factors up to \( {n^{c/\log \log n}}\) (so “nearly polynomial) [DKRS03, HR12], but these results are not fine grained.
The best fine-grained hardness of approximation results known rule out algorithms for small constant-factor approximations for \( {{\mathrm{CVP}}_p}\) with \( {p \notin 2{\mathbb Z}}\) in time \( {2^{0.99n}}\) for \( {{\mathrm{CVP}}_p}\) and \( {{\mathrm{SVP}}_p}\) for any \( {p}\) in time \( {2^{o(n)}}\). We ask whether we can do better.
Open problem 8. Prove that there is no \( {2^{0.99 n}}\)-time algorithm for \( {2}\)-approximate \( {{\mathrm{CVP}}_p}\) (under some form of Gap-SETH, see below).
Open problem 9. Prove that there is no \( {2^{o(n)}}\)-time algorithm for \( {\gamma}\)-approximate \( {{\mathrm{CVP}}_p}\) for superconstant \( {\gamma = \omega(1)}\) (under Gap-ETH).
2.4. Gap-SETH?
One issue that arose in our attempts to prove fine-grained hardness of approximation results is that we don’t even know the “right” complexity-theoretic assumption about approximate CSPs to use as a starting point. For fine-grained hardness of exact problems, ETH and SETH are very well established hypotheses, and they are in some sense “the weakest possible” assumptions of their form. E.g., it is easy to see that \( {k}\)-SAT is \( {2^{Cn}}\) hard if any \( {k}\)-CSP is. But, for hardness of approximation, the situation is less clear.
The analogue of ETH in the regime of hardness of approximation is the beautiful Gap-ETH assumption, which was defined independently by Irit Dinur [Din16] and Pasin Manurangsi and Prasad Raghavendra [MR17]. This assumption says that there exists some constant approximation factor \( {\delta \neq 1}\) such that \( {\delta}\)-Gap-\( {3}\)-SAT cannot be solved in time \( {2^{o(n)}}\). (Formally, both Dinur and Manurangsi and Raghavendra say that there is no \( {2^{o(n)}}\)-time algorithm that distinguishes a satisfiable formula from a formula for which no assignment satisfies more than a \( {(1-\epsilon)}\) fraction of the clauses, but we ignore this requirement of perfect completeness here.) It is easy to see that this hypothesis is equivalent to a similar hypothesis about any \( {3}\)-CSP (or, indeed, any \( {k}\)-CSP for any constant\( {k}\)).
However, to prove hardness of approximation with the finest of grains, we need some “gap” analogue of SETH, i.e., we would like to assume that for large enough \( {k}\), some Gap-\( {k}\)-CSP is hard to approximate up to some constant factor \( {\delta \neq 1}\) in better than \( {2^{0.99n}}\)-time. (Formally, we should add an additional variable \( {\epsilon > 0}\) and have such a hypothesis for every running time \( {2^{(1-\epsilon)n}}\), but we set \( {\epsilon = 0.01}\) here to keep things relatively simple.)
An issue arises here concerning the dependence of the approximation factor \( {\delta}\) on the arity \( {k}\). In particular, recall that \( {k}\)-SAT can be trivially approximated up to a factor of \( {1-2^{-k}}\) (since a random assignment satisfies a \( {1-2^{-k}}\) fraction of the clauses in expectation). So, if we define Gap-SETH in terms of Gap-\( {k}\)-SAT, then we must choose \( {\delta = \delta(k) \geq 1-2^{-k}}\) that converges to one as \(k\) increases. Manurangsi proposed such a version of Gap-SETH in his thesis [Man19, Conjecture 12.1], specifically that for every large enough constant \( {k}\) there exists a constant \( {\delta = \delta(k) \neq 1}\) such that Gap-\( {k}\)-SAT cannot be approximated up to a factor of \( {\delta}\) in time \( {2^{0.99n}}\). (Again, we are leaving out an additional variable, \( {\epsilon}\).)
If we rely on this version of Gap-SETH, then our current techniques seem to get stuck at proving hardness of approximation for, say, \( {\gamma}\)-approximate \( {{\mathrm{CVP}}_p}\) for some non-explicit constant \( {\gamma_p > 1}\) (and, if one works out the numbers, one can see immediately that \( {\gamma_p}\) must be really quite close to one). However, other Gap-\(k\)-CSPs are known to be (\(\mathsf{NP}\)-)hard to approximate up to much better approximation factors. E.g., for any \( {k}\), Gap-\(k\)-Parity is \( {{\mathsf{NP}}}\)-hard to approximate up to any constant approximation factor \( {1/2 < \delta \leq 1}\) [Hås01], and Gap-\( {k}\)-AND is \( {{\mathsf{NP}}}\)-hard to approximate for any constant approximation factor \( {\Omega(k/2^k) \leq \delta \leq 1}\) [Cha16]. Indeed, Gap-\( {k}\)-AND is a quite natural problem to consider in this context since there is a fine-grained, approximation-factor preserving reduction from any Gap-\( {k}\)-CSP to Gap-\( {k}\)-AND. This generality motivates understanding the precise complexity of Gap-\( {k}\)-AND.
Open problem 10. What is the fine-grained complexity of the \( {\delta}\)-Gap-\( {k}\)-AND problem in terms of \( {n}\), \( {k}\), and \( {\delta}\)? In particular, if
\( \displaystyle C_{k,\delta} := \inf \{ C > 0 \ : \ \text{there is a $2^{C_{k,\delta}}$-time algorithm for algorithm for $\delta$-Gap-$k$-AND}\}\)
then what is the behavior of \( {C_{k,\delta}}\) as \( {k \rightarrow \infty}\) (for various functions \( {\delta = \delta(k)}\) of \( {k}\))?
In particular, if one were to hypothesize sufficiently strong hardness of \( {\delta}\)-Gap-\( {k}\)-AND — i.e., to define an appropriate variant of Gap-SETH based on Gap-\( {k}\)-AND — then one might be able to use this hypothesis to prove very strong fine-grained hardness of approximation results. There is a fine-grained (but non-approximation preserving) reduction from Gap-\( {k}\)-AND to Gap-\( {k}\)-SAT, and so Manurangsi’s Gap-SETH is equivalent to the conjecture that there exists some non-explicit \( {\delta(k)}\) such that \( {\lim_{k \rightarrow \infty} C_{k,\delta} = 1}\).
• [ABGS20] Aggarwal, Bennett, Golovnev, Stephens-Davidowitz. Fine-grained hardness of CVP(P)— Everything that we can prove (and nothing else)
• [A+18] Albrecht, Curtis, Deo, Davidson, Player, Postlethwaite, Virdia, Wunderer. Estimate all the {LWE, NTRU} schemes! SCN, 2019.
• [ADRS15] Aggarwal, Dadush, Regev, Stephens-Davidowitz. Solving the Shortest Vector Problem in \(2^n\) time via discrete Gaussian sampling. STOC, 2015.
• [ADS15] Aggarwal, Dadush, Stephens-Davidowitz. Solving the Closest Vector Problem in \(2^n\) time–The discrete Gaussian strikes again! FOCS, 2015.
• [AM18] Aggarwal, Mukhopadhyay. Faster algorithms for SVP and CVP in the \(\ell_\infty\) norm. ISAAC, 2018.
• [AS18a] Aggarwal, Stephens-Davidowitz. Just take the average! An embarrassingly simple \(2^n\)-time algorithm for SVP (and CVP). SOSA, 2018.
• [AS18b] Aggarwal, Stephens-Davidowitz. (Gap/S)ETH hardness of SVP. STOC, 2018.
• [B+16] Bos, Costello, Ducas, Mironov, Naehrig, Nikolaenko, Raghunathan, Stebila. Frodo: Take off the ring! Practical, Quantum-Secure Key Exchange from LWE. CCS, 2016.
• [BDGL16] Becker, Ducas, Gama, Laarhoven. New directions in nearest neighbor searching with applications to lattice sieving. SODA, 2016.
• [BGS17] Bennett, Golovnev, Stephens-Davidowitz. On the quantitative hardness of CVP. FOCS, 2017.
• [Cha16] Chan. Approximation resistance from pairwise-independent subgroups. J. ACM, 2016.
• [Din16] Dinur. Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover.
• [DKRS03] Dinur, Kindler, Raz, Safra. Approximating CVP to within almost-polynomial factors is NP-hard. Combinatorica, 2003.
• [DPV11] Dadush, Peikert, Vempala. Enumerative lattice algorithms in any norm via \(M\)-ellipsoid coverings. FOCS, 2011.
• [GMSS99] Goldreich, Micciancio, Safra, Seifert. Approximating shortest lattice vectors is not harder than approximating closest lattice vectors. IPL, 1999.
• [Hås01] Håstad. Some optimal inapproximability results. J. ACM, 2001.
• [HR12] Haviv, Regev. Tensor-based hardness of the Shortest Vector Problem to within almost polynomial factors. TOC, 2012.
• [IP01] Impagliazzo, Paturi. On the complexity of \(k\)-SAT. JCSS, 2001.
• [IPZ01] Impagliazzo, Paturi, Zane. Which problems have strongly exponential complexity? JCSS, 2001.
• [Laa15] Laarhoven. Search problems in cryptography. Ph.D thesis, 2015.
• [Kan87] Kannan. Minkowski’s convex body theorem and Integer Programming. MOR, 1987.
• [KMPR19] Kirshanova, Mårtensson, Postlethwaite, Roy Moulik. Quantum algorithms for the approximate \(k\)-list problem and their application to lattice sieving. Asiacrypt, 2019.
• [Man19] Manurangsi. Approximation and Hardness: Beyond P and NP.
• [MR17] Manurangsi, Raghavendra. A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs. ICALP, 17.
• [Vlă19] Vlăduţ. Lattices with exponentially large kissing numbers. Moscow J. of Combinatorics and Number Theory, 2019.
6 thoughts on “Fine-grained hardness of lattice problems: Open questions
1. Small comment: [KMPR19] has little/nothing to do with the 0.265 constant. After the positive reception of the classic 0.292 I thought I’d make a sequel with a new and improved constant, but the 0.265 never took off as much and was even called “tenuous” by some critics.
• Hi Thijs,
Sorry for using the wrong citation!
It seems like that algorithm has stood the test of time :).
-Noah
• While I’m nitpicking: I believe [A+18] only collected the security models from all the NIST submissions, and the “paranoid” bound 0.2075 was proposed in the Frodo submission.
On a higher level, I liked Huck’s informal explanation on the difference between (Euclidean) SVP and CVP in that there can be up to 2^n closest lattice vectors to a target vector (e.g. the all-0.5 vector in Z^n) which with a small perturbation can be hard to distinguish, but there can only be at most 2^(0.401n) shortest non-zero lattice vectors of equal norm in a lattice due to bounds on the kissing constant. So I suppose that while we expect the 2^n for CVP to be tight, one might conjecture that the true worst-case hardness for SVP might lie at 2^(0.401n), or whatever is the actual scaling of the kissing constant in high dimensions. Perhaps similar arguments can be used to make educated guesses about the “true worst-case hardness” of SVP and CVP in any norm?
• Hi Thijs,
In this case the attribution to Albrecht et al. was for the descriptive and colorful choice of the word “paranoid.” They attribute the bound itself to New Hope, but it appears in both the Frodo and New Hope submissions, and perhaps a number of other places.
I agree that it is natural to hypothesize that the worst-case complexity of exact SVP (resp. CVP) in a given norm is essentially the kissing number (resp. maximum possible number of closest vectors) in that norm. We discuss this a bit for l_infinity at the end of Section 2.2/in Open problem 6.
• Hi Huck,
I believe the original Frodo preprint (https://eprint.iacr.org/2016/659/20160628:211043) coined the term “paranoid”, even though indeed it seems that their latest version no longer mentions this term.
And I guess then an interesting geometrical question would be to figure out what are the kissing constants and maximum numbers of closest vectors for arbitrary ell_p norms? (I’m not sure how much is known about that for p other than 2 or infinity.)
• Hi Thijs,
RE, Frodo, thanks for the correction! I’ve updated the post.
I’m not at all sure about kissing numbers in l_p norms, but the maximum number of closest vectors is known and is fairly straightforward for all l_p norms: the maximum possible number of closest vectors for 1 < p < infinity is 2^n and is unbounded for l_1 and l_infinity (even in two dimensions).
For 1 < p < infinity, the integer lattice together with the all (1/2)s vector as a target yields a lower bound of 2^n, and the upper bound follows by a pigeonhole/coset averaging argument. Namely, suppose that there are 2^n + 1 closest lattice vectors to a given target. Then, there must be two such closest vectors v, w that lie in the same coset mod twice the lattice. But then (v + w)/2 is also a lattice vector, and, by the strict convexity of the l_p norm for 1 < p < infinity, it is strictly closer to the target than v or w, which is a contradiction.
Accordingly, it might be reasonable to guess that the “right” time complexity of CVP_p for 1 < p < infinity is 2^n. This would match our lower bound for all such p that are not even integers.
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://blog.simons.berkeley.edu/2020/05/fine-grained-hardness-of-lattice-problems-open-questions/",
"source_domain": "blog.simons.berkeley.edu",
"snapshot_id": "crawl=CC-MAIN-2020-24",
"warc_metadata": {
"Content-Length": "54775",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VSDXAZNK3V4RTYADGUH2PSHOUS53X7YZ",
"WARC-Concurrent-To": "<urn:uuid:e014b711-d886-4668-8e5e-face94e378ac>",
"WARC-Date": "2020-06-01T23:43:40Z",
"WARC-IP-Address": "23.185.0.2",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UI332TNRQAD3UGELBURPCG6RXVAYCOSW",
"WARC-Record-ID": "<urn:uuid:faf0ed5f-5a3e-401b-bd65-05c536655aad>",
"WARC-Target-URI": "https://blog.simons.berkeley.edu/2020/05/fine-grained-hardness-of-lattice-problems-open-questions/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:eb082ece-fd41-4e1a-8674-fd85612e3645>"
},
"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-36.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,
58,
59,
74,
75,
119,
120,
661,
662,
1123,
1124,
1160,
1161,
1640,
1641,
2954,
2955,
3358,
3359,
3386,
3387,
4440,
4441,
5509,
5510,
5554,
5555,
5947,
5948,
6408,
6409,
6927,
6928,
7430,
7431,
7511,
7512,
8440,
8441,
8862,
8863,
8880,
8881,
9206,
9207,
9244,
9245,
9459,
9460,
9574,
9575,
9853,
9854,
10032,
10033,
10185,
10186,
10514,
10515,
11045,
11046,
11204,
11205,
11239,
11240,
12224,
12225,
12359,
12360,
12856,
12857,
13025,
13026,
13482,
13483,
13594,
13595,
13626,
13627,
14528,
14529,
14641,
14642,
15453,
15454,
15795,
15796,
15959,
15960,
16145,
16146,
16161,
16162,
16703,
16704,
17559,
17560,
18079,
18080,
18930,
18931,
20004,
20005,
20173,
20174,
20322,
20323,
20466,
20467,
21057,
21058,
21202,
21336,
21491,
21642,
21753,
21898,
21981,
22152,
22292,
22393,
22487,
22580,
22708,
22832,
22992,
23066,
23192,
23268,
23372,
23447,
23535,
23716,
23785,
23906,
24029,
24030,
24103,
24104,
24379,
24380,
24396,
24438,
24439,
24505,
24506,
24518,
24519,
24702,
24703,
25481,
25482,
25502,
25503,
25771,
25772,
26077,
26078,
26099,
26100,
26313,
26314,
26575,
26576,
26598,
26599,
26672,
26673,
26982,
26983,
27553,
27554,
27758,
27759,
27773,
27774,
27845,
27846
],
"line_end_idx": [
58,
59,
74,
75,
119,
120,
661,
662,
1123,
1124,
1160,
1161,
1640,
1641,
2954,
2955,
3358,
3359,
3386,
3387,
4440,
4441,
5509,
5510,
5554,
5555,
5947,
5948,
6408,
6409,
6927,
6928,
7430,
7431,
7511,
7512,
8440,
8441,
8862,
8863,
8880,
8881,
9206,
9207,
9244,
9245,
9459,
9460,
9574,
9575,
9853,
9854,
10032,
10033,
10185,
10186,
10514,
10515,
11045,
11046,
11204,
11205,
11239,
11240,
12224,
12225,
12359,
12360,
12856,
12857,
13025,
13026,
13482,
13483,
13594,
13595,
13626,
13627,
14528,
14529,
14641,
14642,
15453,
15454,
15795,
15796,
15959,
15960,
16145,
16146,
16161,
16162,
16703,
16704,
17559,
17560,
18079,
18080,
18930,
18931,
20004,
20005,
20173,
20174,
20322,
20323,
20466,
20467,
21057,
21058,
21202,
21336,
21491,
21642,
21753,
21898,
21981,
22152,
22292,
22393,
22487,
22580,
22708,
22832,
22992,
23066,
23192,
23268,
23372,
23447,
23535,
23716,
23785,
23906,
24029,
24030,
24103,
24104,
24379,
24380,
24396,
24438,
24439,
24505,
24506,
24518,
24519,
24702,
24703,
25481,
25482,
25502,
25503,
25771,
25772,
26077,
26078,
26099,
26100,
26313,
26314,
26575,
26576,
26598,
26599,
26672,
26673,
26982,
26983,
27553,
27554,
27758,
27759,
27773,
27774,
27845,
27846,
27926
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 27926,
"ccnet_original_nlines": 177,
"rps_doc_curly_bracket": 0.02964979037642479,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3050977885723114,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04820575937628746,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3465270400047302,
"rps_doc_frac_unique_words": 0.25544553995132446,
"rps_doc_mean_word_length": 4.928712844848633,
"rps_doc_num_sentences": 312,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.928961753845215,
"rps_doc_word_count": 4040,
"rps_doc_frac_chars_dupe_10grams": 0.009943749755620956,
"rps_doc_frac_chars_dupe_5grams": 0.07749096304178238,
"rps_doc_frac_chars_dupe_6grams": 0.044997990131378174,
"rps_doc_frac_chars_dupe_7grams": 0.029027720913290977,
"rps_doc_frac_chars_dupe_8grams": 0.016572920605540276,
"rps_doc_frac_chars_dupe_9grams": 0.013157890178263187,
"rps_doc_frac_chars_top_2gram": 0.012053029611706734,
"rps_doc_frac_chars_top_3gram": 0.004519890062510967,
"rps_doc_frac_chars_top_4gram": 0.005875850096344948,
"rps_doc_books_importance": -2832.13134765625,
"rps_doc_books_importance_length_correction": -2832.13134765625,
"rps_doc_openwebtext_importance": -1825.938232421875,
"rps_doc_openwebtext_importance_length_correction": -1825.938232421875,
"rps_doc_wikipedia_importance": -1647.4266357421875,
"rps_doc_wikipedia_importance_length_correction": -1647.4266357421875
},
"fasttext": {
"dclm": 0.0326690711081028,
"english": 0.8753516674041748,
"fineweb_edu_approx": 1.9201325178146362,
"eai_general_math": 0.9942561984062195,
"eai_open_web_math": 0.9114797711372375,
"eai_web_code": 0.21265745162963867
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "511.6",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Mathematics",
"level_3": "Arithmetic"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "5",
"label": "Evaluate"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "2",
"label": "Academic/Research"
},
"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": "3",
"label": "Academic Writing"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "4",
"label": "Advanced Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
6,932,692,939,723,936,000 |
beta
cables is under heavy development.
There might be one or another bug, please let us know about it!
Ops.Math
Abs
Returns the absolute, positive value
Accumulator
Add to and multiply a number, set to current value
AddUp
add up numbers
AngleBetweenPoints
outputs the angle between two points (degree)
ApproachInterpolation
weighted average interpolation
Array3x2dProjection
calculate 2d positions of an array3x
Array3xMultiplyMatrix
multiply every XYZ coordinate with a matrix
Array3xTransform
transform (translate,rotate,scale) positions in an array3x
Atan2
Calculates the angle from a specified point to the coordinate origin.
Average
average of last two values
ButterflyCurve
generate coordinates of a butterfly curve
Ceil
Returns the smallest integer greater than or equal to a given number
CircleCoordinates
x and y coordinates of a circle
CirclePath
calculates a circle path, outputs array3x
Clamp
Makes sure a value is within range cuts off the rest
Cosine
Calculates the cosine of an angle.
DegreeToVector
Calculates a vector (x and y) based on an angle in degrees
Degrees
Converts a radian measurement to its corresponding value in degrees.
Delta
difference to the last value (previous, store)
DeltaSum
add delta values to an clamped absolute value
Difference
Difference between two numbers
Distance2d
Calculates the Distance between two 2d points
Distance3d
distance between two 3d points
Distance3dNew
distance between two 3d points, calculated when triggered
Divide
Divides a number by another
Ease
map a value to an easing curve
Exp
Calculates the power of Euler’s number
FlipSign
positive numbers become negative and vice versa
Floor
returns the largest integer less than or equal to a given number
Fract
returns the fractional part of a number
GaussianRandomArray
random numbers fitting a Gaussian, or normal, distribution
Incrementor
increment a number by triggering
Interpolate
Interpolate between values, lerp, linear interpolate
LissajouseSpline
generate spline using lissajous formulas
Log
Calculates the logarithm of Number
MapRange
Maps a value from one range into another.
Max
Sets the output to the input value which is higher
Max2
Returns the biggest number
MaxSinceReset
Outputs the maximum value since reset has been triggered
MercatorCoord
project mercator coordinates
Min
Result will be the smaller number of the inputs
Min3
Result will be the smaller number of the inputs
MinSinceReset
Outputs the minimum value since reset has been triggered
Modulo
outputs the remainder after division of one number by another
Multiply
Multiplies two numbers
NumberDivisible
is a number capable of being divided.
OneMinus
subtract a number from one
PerlinNoise
outputs a perlin noise value like random
Phyllotaxis2
coordinate generation like arrangement of leaves in some plants
Pi
returns PI (3.141592653589793)
PointInRectangle2d
test if a point is in or outside of a rectangle
Pow
value of x to the power of y
PowerOfTwoSize
Return the next values as power of two
Radians
Converts a degree measurement to its corresponding value in radians.
Random2
generate random number between min and max
RandomNumbers
simple way to get random numbers without using arrays
Round
Outputs number rounded to the nearest integer
Sign
get sign of value
SimpleMovingAverage
Calculate the Average of the last X values
Sine
Calculates the sine of an angle.
SmoothStep
interpolate smoothly between two input values
SmootherStep
interpolate smoothly between two input values
Speed
measure speed of how much a value changes
Sqrt
square root of a number
Subtract
Subtracts Number2 from Number1 (minus, -)
Sum
Add two values
Tangent
Calculates the ratio of the sine and cosine of an angle.
VectorLength
length of a vector
Ops.Math.Compare
Between
result is true if value is between number1 and number2
BetweenEquals
result is true if value is between or equal number1 and number2
Equals
result is true if number1 and number2 are equal
Greater
result is true if number1 is greater than number2
IfBetweenThen
triggers when value is between min and max
IsEven
Checks if Value is even or not
Smaller
Is n1 smaller than n2? (lesser, less)
|
{
"url": "https://cables.gl/ops/Ops.Math",
"source_domain": "cables.gl",
"snapshot_id": "crawl=CC-MAIN-2019-13",
"warc_metadata": {
"Content-Length": "28201",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TVQMKKYFP5EIRYR3D37O3AFQ4MSMUVFK",
"WARC-Concurrent-To": "<urn:uuid:688dd003-41f4-4d6d-a6ed-2959a4155a94>",
"WARC-Date": "2019-03-25T10:17:01Z",
"WARC-IP-Address": "78.47.172.236",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:N4NY3YAZ3FMRDQYOINYS6PHLGJ2RA3NR",
"WARC-Record-ID": "<urn:uuid:d102bca5-b195-41bd-9cfa-dddbdbefdd80>",
"WARC-Target-URI": "https://cables.gl/ops/Ops.Math",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:562d4ebe-a0bc-4ac0-8cf1-7b962d7d12db>"
},
"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-101-182-190.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,
5,
40,
104,
105,
114,
115,
119,
120,
157,
158,
170,
171,
223,
224,
230,
231,
246,
247,
266,
267,
314,
315,
337,
338,
369,
370,
390,
391,
428,
429,
451,
452,
496,
497,
514,
515,
574,
575,
581,
582,
652,
653,
661,
662,
689,
690,
705,
706,
748,
749,
754,
755,
824,
825,
843,
844,
876,
877,
888,
889,
931,
932,
938,
939,
992,
993,
1000,
1001,
1036,
1037,
1052,
1053,
1113,
1114,
1122,
1123,
1192,
1193,
1199,
1200,
1247,
1248,
1257,
1258,
1305,
1306,
1317,
1318,
1349,
1350,
1361,
1362,
1409,
1410,
1421,
1422,
1453,
1454,
1468,
1469,
1527,
1528,
1535,
1536,
1564,
1565,
1570,
1571,
1603,
1604,
1608,
1609,
1648,
1649,
1658,
1659,
1707,
1708,
1714,
1715,
1780,
1781,
1787,
1788,
1829,
1830,
1850,
1851,
1910,
1911,
1923,
1924,
1958,
1959,
1971,
1972,
2025,
2026,
2043,
2044,
2086,
2087,
2091,
2092,
2127,
2128,
2137,
2138,
2181,
2182,
2186,
2187,
2238,
2239,
2244,
2245,
2272,
2273,
2287,
2288,
2345,
2346,
2360,
2361,
2391,
2392,
2396,
2397,
2445,
2446,
2451,
2452,
2500,
2501,
2515,
2516,
2573,
2574,
2581,
2582,
2644,
2645,
2654,
2655,
2678,
2679,
2695,
2696,
2735,
2736,
2745,
2746,
2774,
2775,
2787,
2788,
2829,
2830,
2843,
2844,
2909,
2910,
2913,
2914,
2945,
2946,
2965,
2966,
3015,
3016,
3020,
3021,
3050,
3051,
3066,
3067,
3106,
3107,
3115,
3116,
3185,
3186,
3194,
3195,
3238,
3239,
3253,
3254,
3308,
3309,
3315,
3316,
3362,
3363,
3368,
3369,
3387,
3388,
3408,
3409,
3452,
3453,
3458,
3459,
3492,
3493,
3504,
3505,
3552,
3553,
3566,
3567,
3614,
3615,
3621,
3622,
3665,
3666,
3671,
3672,
3696,
3697,
3706,
3707,
3749,
3750,
3754,
3755,
3770,
3771,
3779,
3780,
3837,
3838,
3851,
3852,
3871,
3872,
3889,
3890,
3898,
3899,
3954,
3955,
3969,
3970,
4034,
4035,
4042,
4043,
4091,
4092,
4100,
4101,
4151,
4152,
4166,
4167,
4210,
4211,
4218,
4219,
4250,
4251,
4259,
4260
],
"line_end_idx": [
5,
40,
104,
105,
114,
115,
119,
120,
157,
158,
170,
171,
223,
224,
230,
231,
246,
247,
266,
267,
314,
315,
337,
338,
369,
370,
390,
391,
428,
429,
451,
452,
496,
497,
514,
515,
574,
575,
581,
582,
652,
653,
661,
662,
689,
690,
705,
706,
748,
749,
754,
755,
824,
825,
843,
844,
876,
877,
888,
889,
931,
932,
938,
939,
992,
993,
1000,
1001,
1036,
1037,
1052,
1053,
1113,
1114,
1122,
1123,
1192,
1193,
1199,
1200,
1247,
1248,
1257,
1258,
1305,
1306,
1317,
1318,
1349,
1350,
1361,
1362,
1409,
1410,
1421,
1422,
1453,
1454,
1468,
1469,
1527,
1528,
1535,
1536,
1564,
1565,
1570,
1571,
1603,
1604,
1608,
1609,
1648,
1649,
1658,
1659,
1707,
1708,
1714,
1715,
1780,
1781,
1787,
1788,
1829,
1830,
1850,
1851,
1910,
1911,
1923,
1924,
1958,
1959,
1971,
1972,
2025,
2026,
2043,
2044,
2086,
2087,
2091,
2092,
2127,
2128,
2137,
2138,
2181,
2182,
2186,
2187,
2238,
2239,
2244,
2245,
2272,
2273,
2287,
2288,
2345,
2346,
2360,
2361,
2391,
2392,
2396,
2397,
2445,
2446,
2451,
2452,
2500,
2501,
2515,
2516,
2573,
2574,
2581,
2582,
2644,
2645,
2654,
2655,
2678,
2679,
2695,
2696,
2735,
2736,
2745,
2746,
2774,
2775,
2787,
2788,
2829,
2830,
2843,
2844,
2909,
2910,
2913,
2914,
2945,
2946,
2965,
2966,
3015,
3016,
3020,
3021,
3050,
3051,
3066,
3067,
3106,
3107,
3115,
3116,
3185,
3186,
3194,
3195,
3238,
3239,
3253,
3254,
3308,
3309,
3315,
3316,
3362,
3363,
3368,
3369,
3387,
3388,
3408,
3409,
3452,
3453,
3458,
3459,
3492,
3493,
3504,
3505,
3552,
3553,
3566,
3567,
3614,
3615,
3621,
3622,
3665,
3666,
3671,
3672,
3696,
3697,
3706,
3707,
3749,
3750,
3754,
3755,
3770,
3771,
3779,
3780,
3837,
3838,
3851,
3852,
3871,
3872,
3889,
3890,
3898,
3899,
3954,
3955,
3969,
3970,
4034,
4035,
4042,
4043,
4091,
4092,
4100,
4101,
4151,
4152,
4166,
4167,
4210,
4211,
4218,
4219,
4250,
4251,
4259,
4260,
4297
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4297,
"ccnet_original_nlines": 306,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4058394134044647,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004379559773951769,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.06715328246355057,
"rps_doc_frac_unique_words": 0.4305993616580963,
"rps_doc_mean_word_length": 5.440062999725342,
"rps_doc_num_sentences": 16,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.043155193328857,
"rps_doc_word_count": 634,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.1426500380039215,
"rps_doc_frac_chars_dupe_6grams": 0.11539576947689056,
"rps_doc_frac_chars_dupe_7grams": 0.05334879830479622,
"rps_doc_frac_chars_dupe_8grams": 0.022615250200033188,
"rps_doc_frac_chars_dupe_9grams": 0.022615250200033188,
"rps_doc_frac_chars_top_2gram": 0.014207020401954651,
"rps_doc_frac_chars_top_3gram": 0.013917080126702785,
"rps_doc_frac_chars_top_4gram": 0.01623659022152424,
"rps_doc_books_importance": -299.1676025390625,
"rps_doc_books_importance_length_correction": -299.1676025390625,
"rps_doc_openwebtext_importance": -153.3441925048828,
"rps_doc_openwebtext_importance_length_correction": -153.3441925048828,
"rps_doc_wikipedia_importance": -105.3391342163086,
"rps_doc_wikipedia_importance_length_correction": -105.3391342163086
},
"fasttext": {
"dclm": 0.8967550992965698,
"english": 0.7422648668289185,
"fineweb_edu_approx": 3.277107000350952,
"eai_general_math": 0.9954096674919128,
"eai_open_web_math": 0.6391924023628235,
"eai_web_code": 0.7986026406288147
}
}
|
{
"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": "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": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "1",
"label": "No 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": "3",
"label": "Undergraduate Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
7,355,040,319,059,700,000 |
Cymbalta normal dose
I39ve seen a few posts asking about cymbalta dosages and thought I39d start a poll to . First, those sound like normal start up side effects to me Learn about indications, dosage and how it is supplied for the drug Cymbalta ( Duloxetine Hcl)
Usual Adult Dose for Depression. Initial dose: 20 mg orally twice a day. Maintenance dose: 60 mg per day, given either once a day or as 30 mg orally twice a day
Medscape - Generalized anxiety disorder, major depressive disorder, fibromyalgia-specific dosing for Cymbalta (duloxetine), frequency-based adverse effects, Cymbalta official prescribing information for healthcare professionals. Includes: indications, dosage, adverse reactions, pharmacology and more. History Calendar Drug history at FDA. Close. Osteoarthritis. Reviews. Average User Rating If it is almost time for the next dose, skip the missed dose and take the next dose at the regular time. Do not take two doses of CYMBALTA at the same time
What Dosage Of Cymbalta Are You On - Cymbalta - Cymbalta
I have always taken extremely low doses of antidepressants because I am at the higher dose levels, and at lower doses may basically be working as a regular SSRI, It is possible that a higher dose of Cymbalta (duloxetine) would be less The usual dose is a single 60 mg capsule once daily. A reduced dose of 30 mg once daily is indicated for people with end-stage
Doctors usually do not prescribe Cymbalta for anyone younger than 18. The risk is greatest when first starting treatment or increasing the dose of Cymbalta WebMD examines the use of Cymbalta to treat fibromyalgia and explains the This makes a person overly sensitive to things that would normally not be painful. 30 milligrams a day for the first week, before increasing you to the full dose
|
{
"url": "http://brandstand.in/wp-content/uploads/2014/05/main.php?id=7037_cymbalta-normal-dose.html",
"source_domain": "brandstand.in",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "5939",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:Q4QUWVHZNGGWFS2YSG3OCMDAHINF2QTO",
"WARC-Concurrent-To": "<urn:uuid:68e12379-1a72-4053-a299-f52637afd1bc>",
"WARC-Date": "2018-06-25T19:22:41Z",
"WARC-IP-Address": "184.168.47.225",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:LGEIEJKOWWK57R3W3FVIM4JVMT4K6A27",
"WARC-Record-ID": "<urn:uuid:3173c210-dfe8-42b7-9273-bbdca4c162b4>",
"WARC-Target-URI": "http://brandstand.in/wp-content/uploads/2014/05/main.php?id=7037_cymbalta-normal-dose.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:98780464-b06b-4532-8f44-bb86108d194e>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-144-111-253.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-26\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for June 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
21,
22,
264,
265,
426,
427,
975,
976,
1033,
1034,
1396,
1397
],
"line_end_idx": [
21,
22,
264,
265,
426,
427,
975,
976,
1033,
1034,
1396,
1397,
1788
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1788,
"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.357988178730011,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017751479521393776,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1420118361711502,
"rps_doc_frac_unique_words": 0.5510203838348389,
"rps_doc_mean_word_length": 4.904761791229248,
"rps_doc_num_sentences": 14,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.721127033233643,
"rps_doc_word_count": 294,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.023578360676765442,
"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.034674059599637985,
"rps_doc_frac_chars_top_3gram": 0.01803050935268402,
"rps_doc_frac_chars_top_4gram": 0.019417479634284973,
"rps_doc_books_importance": -138.60855102539062,
"rps_doc_books_importance_length_correction": -132.80299377441406,
"rps_doc_openwebtext_importance": -71.59066009521484,
"rps_doc_openwebtext_importance_length_correction": -71.59066009521484,
"rps_doc_wikipedia_importance": -71.10874938964844,
"rps_doc_wikipedia_importance_length_correction": -70.17957305908203
},
"fasttext": {
"dclm": 0.07057542353868484,
"english": 0.881172239780426,
"fineweb_edu_approx": 2.146881580352783,
"eai_general_math": 0.054878119379282,
"eai_open_web_math": 0.3843232989311218,
"eai_web_code": 0.004101810045540333
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "615.19",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Materia medica, Drugs, and Pharmacy"
}
},
"secondary": {
"code": "615.857",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Materia medica, Drugs, and Pharmacy"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "5",
"label": "Social/Forum"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-6,785,066,521,655,326,000 |
Testing
?
• Created by: 13westt
• Created on: 20-03-18 10:01
Syntax Errors - 'Syntax' dictates how a program's code must be formatted. Syntax errors happen when a computer programmer does not obey the grammar rules of the programming language being used.
Common Causes:
• Case of letter.
• Punctuation.
• Incorrect spelling
Run-Time Errors- when a program instructs a computer to carry out a task that it either cannot do or is slow to perform. Occurs during a program's execution.
Common Causes:
• Insufficient memory available.
• Unusual data is encountered.
• A program instructs a computer to divide a number by 0.
Logic Errors - are mistakes in the design of a program that cause the program to…
Comments
No comments have yet been made
Similar Computing resources:
See all Computing resources »See all Programming resources »
|
{
"url": "https://www.prod.gr.cuttlefish.com/revision-notes/testing-21",
"source_domain": "www.prod.gr.cuttlefish.com",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "34502",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:NAZEOH6YSQPBAQTZD674A3N6BXXSWYNP",
"WARC-Concurrent-To": "<urn:uuid:7736b310-2c7f-4c48-8d79-a68b998d83b0>",
"WARC-Date": "2024-08-15T03:09:59Z",
"WARC-IP-Address": "34.240.83.107",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:G42UXFHJ5GN247EHGWWNVYRQY3H5WGCL",
"WARC-Record-ID": "<urn:uuid:1daefb1e-4c3e-4bc9-826b-c6f8ab908ab3>",
"WARC-Target-URI": "https://www.prod.gr.cuttlefish.com/revision-notes/testing-21",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:dda67103-9012-4f8a-946c-6f33cd5c4293>"
},
"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-108\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,
11,
35,
66,
67,
261,
262,
278,
279,
299,
316,
339,
340,
498,
499,
514,
515,
550,
583,
643,
644,
726,
727,
736,
737,
768,
769,
798,
799
],
"line_end_idx": [
8,
9,
11,
35,
66,
67,
261,
262,
278,
279,
299,
316,
339,
340,
498,
499,
514,
515,
550,
583,
643,
644,
726,
727,
736,
737,
768,
769,
798,
799,
859
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 859,
"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.3176470696926117,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.005882349796593189,
"rps_doc_frac_lines_end_with_ellipsis": 0.032258059829473495,
"rps_doc_frac_no_alph_words": 0.25294119119644165,
"rps_doc_frac_unique_words": 0.6470588445663452,
"rps_doc_mean_word_length": 4.897058963775635,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0.005882349796593189,
"rps_doc_unigram_entropy": 4.245023250579834,
"rps_doc_word_count": 136,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.08408407866954803,
"rps_doc_frac_chars_dupe_6grams": 0.08408407866954803,
"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.04054053872823715,
"rps_doc_frac_chars_top_3gram": 0.039039041846990585,
"rps_doc_frac_chars_top_4gram": 0.054054051637649536,
"rps_doc_books_importance": -67.1878662109375,
"rps_doc_books_importance_length_correction": -67.1878662109375,
"rps_doc_openwebtext_importance": -40.15243148803711,
"rps_doc_openwebtext_importance_length_correction": -36.00078582763672,
"rps_doc_wikipedia_importance": -28.264965057373047,
"rps_doc_wikipedia_importance_length_correction": -28.264965057373047
},
"fasttext": {
"dclm": 0.028337180614471436,
"english": 0.8446566462516785,
"fineweb_edu_approx": 3.268660545349121,
"eai_general_math": 0.03607302904129028,
"eai_open_web_math": 0.06831640005111694,
"eai_web_code": 0.03248310089111328
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "1",
"label": "Truncated Snippets"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "2",
"label": "Partially Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
3,513,774,206,250,343,000 |
Wikia
Psychology Wiki
Genetic linkage
Talk0
34,146pages on
this wiki
Redirected from Gene linkage
Assessment | Biopsychology | Comparative | Cognitive | Developmental | Language | Individual differences | Personality | Philosophy | Social |
Methods | Statistics | Clinical | Educational | Industrial | Professional items | World psychology |
Biological: Behavioural genetics · Evolutionary psychology · Neuroanatomy · Neurochemistry · Neuroendocrinology · Neuroscience · Psychoneuroimmunology · Physiological Psychology · Psychopharmacology (Index, Outline)
Genetic linkage occurs when particular alleles are inherited together. Typically, an organism can pass on an allele without regard to which allele was passed on for a different gene. This is because chromosomes are sorted randomly during meiosis. However, alleles that are on the same chromosome are more likely to be inherited together, and are said to be linked.
Because there is some crossing over of DNA when the chromosomes segregate, alleles on the same chromosome can be separated and go to different cells. There is a greater probability of this happening if the alleles are far apart on the chromosome, as it is more likely that a cross-over will occur between them.
The physical distance between two genes can be calculated using the offspring of an organism showing two linked genetic traits, and finding the percentage of the offspring where the two traits don't run together. The higher the percentage of descendence that doesn't show both traits, the further apart on the chromosome they are.
A study of the linkages between many genes enables the creation of a linkage map or genetic map.
Among individuals of an experimental population or species, some phenotypes or traits occur randomly with respect to one another in a manner known as independent assortment. Today scientists understand that independent assortment occurs when the genes affecting the phenotypes are found on different chromosomes.
An exception to independent assortment develops when genes appear near one another on the same chromosome. When genes occur on the same chromosome, they are usually inherited as a single unit. Genes inherited in this way are said to be linked. For example, in fruit flies the genes affecting eye color and wing length are inherited together because they appear on the same chromosome.
But in many cases, even genes on the same chromosome that are inherited together produce offspring with unexpected allele combinations. This results from a process called crossing over. Sometimes at the beginning of meiosis, a chromosome pair (made up of a chromosome from the mother and a chromosome from the father) may intertwine and exchange sections or fragments of chromosome. The pair then breaks apart to form two chromosomes with a new combination of genes that differs from the combination supplied by the parents. Through this process of recombining genes, organisms can produce offspring with new combinations of maternal and paternal traits that may contribute to or enhance survival.
Genetic linkage was first discovered by the British geneticists William Bateson and Reginald Punnett shortly after Mendel's laws were rediscovered.
Linkage mappingEdit
The observations by Thomas Hunt Morgan that the amount of crossing over between linked genes differs led to the idea that crossover frequency might indicate the distance separating genes on the chromosome. Morgan's student Alfred Sturtevant developed the first genetic map, also called a linkage map.
Sturtevant proposed that the greater the distance between linked genes, the greater the chance that non-sister chromatids would cross over in the region between the genes. By working out the number of recombinants it is possible to obtain a measure for the distance between the genes. This distance is called a genetic map unit (m.u.), or a centimorgan and is defined as the distance between genes for which one product of meiosis in 100 is recombinant. A recombinant frequency (RF) of 1 % is equivalent to 1 m.u. A linkage map is created by finding the map distances between a number of traits that are present on the same chromosome, ideally avoiding having significant gaps between traits to avoid the inaccuracies that will occur due to the possibility of multiple recombination events.
Linkage mapping is critical for identifying the location of genes that cause genetic diseases. In a normal population, genetic traits and markers will occur in all possible combinations with the frequencies of combinations determined by the frequencies of the individual genes. For example, if alleles A and a occur with frequency 90% and 10%, and alleles B and b at a different genetic locus occur with frequencies 70% and 30%, the frequency of individuals having the combination AB would be 63%, the product of the frequencies of A and B, regardless of how close together the genes are. However, if a mutation in gene B that causes some disease happened recently in a particular subpopulation, it almost always occurs with a particur allele of gene A if the individual in which the mutation occurred had that variant of gene A and there have not been sufficient generations for recombination to happen between them (presumably due to tight linkage on the genetic map). In this case, called linkage disequilibrium, it is possible to search potential markers in the subpopulation and identify which marker the mutation is close to, thus determining the mutation's location on the map and identifying the gene at which the mutation occurred. Once the gene has been identified, it can be targeted to identify ways to mitigate the disease.
Linkage mapEdit
A linkage map is a chromosome map of a species or experimental population that shows the position of its known genes and/or markers relative to each other, rather than as specific physical points on each chromosome.
A genetic map is a map based on the frequencies of recombination between markers during crossover of homologous chromosomes. The greater the frequency of recombination (segregation) between two genetic markers, the farther apart they are assumed to be. Conversely, the higher the frequency of association between the markers, the smaller the physical distance between them. Historically, the markers originally used were detectable phenotypes (enzyme production, eye color) derived from coding DNA sequences; eventually, confirmed or assumed noncoding DNA sequences such as microsatellites or those generating RFLPs have been used.
Genetic maps help researchers to locate other markers, such as other genes by testing for genetic linkage of the already known markers.
A genetic map is not a gene map.
Lod score method for linkageEdit
The Lod (log of odds) score is used to calculate the probability of a pedigree arising randomly or by genetic linkage. The test was developed by Newton E. Morton.
LOD = \log \frac{
\mbox{probability of birth sequence with a given linkage value}
}{
\mbox{probability of birth sequence with no linkage}
}
In practice, linkage is declared if the LOD score is greater than 3 (i.e. the likelihood of observing the result if the two loci are not linked is less than 1 in 1000).
See also Edit
de:Genkopplung fr:Liaison génétique ko:유전자 연관 sr:Везани гени
This page uses Creative Commons Licensed content from Wikipedia (view authors).
Around Wikia's network
Random Wiki
|
{
"url": "http://psychology.wikia.com/wiki/Gene_linkage",
"source_domain": "psychology.wikia.com",
"snapshot_id": "crawl=CC-MAIN-2015-06",
"warc_metadata": {
"Content-Length": "73882",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:PTTAIEKFBEQXONWHQ5NQEHP72E5TWJVO",
"WARC-Concurrent-To": "<urn:uuid:cd3c7b8d-5b9b-4b4b-a245-efd2b7d79d5d>",
"WARC-Date": "2015-02-01T17:07:58Z",
"WARC-IP-Address": "199.27.76.194",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:VGJS4BHKZZ2XQLEF4LYMHXJENPTADKL3",
"WARC-Record-ID": "<urn:uuid:064c9c2f-af89-4dbb-b9f9-c71c128545d7>",
"WARC-Target-URI": "http://psychology.wikia.com/wiki/Gene_linkage",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:0ea4ee91-0f11-4229-991c-7feff9870cc2>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-180-212-252.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-06\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for January 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
6,
7,
23,
24,
40,
41,
47,
62,
72,
73,
102,
103,
246,
347,
348,
564,
565,
566,
931,
932,
1243,
1244,
1575,
1576,
1673,
1674,
1987,
1988,
2373,
2374,
3072,
3073,
3221,
3222,
3242,
3243,
3544,
3545,
4336,
4337,
5674,
5675,
5691,
5692,
5908,
5909,
6541,
6542,
6678,
6679,
6680,
6713,
6714,
6747,
6748,
6911,
6912,
6931,
6995,
6998,
7051,
7053,
7054,
7223,
7224,
7238,
7239,
7300,
7301,
7381,
7382,
7405,
7406
],
"line_end_idx": [
6,
7,
23,
24,
40,
41,
47,
62,
72,
73,
102,
103,
246,
347,
348,
564,
565,
566,
931,
932,
1243,
1244,
1575,
1576,
1673,
1674,
1987,
1988,
2373,
2374,
3072,
3073,
3221,
3222,
3242,
3243,
3544,
3545,
4336,
4337,
5674,
5675,
5691,
5692,
5908,
5909,
6541,
6542,
6678,
6679,
6680,
6713,
6714,
6747,
6748,
6911,
6912,
6931,
6995,
6998,
7051,
7053,
7054,
7223,
7224,
7238,
7239,
7300,
7301,
7381,
7382,
7405,
7406,
7417
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7417,
"ccnet_original_nlines": 73,
"rps_doc_curly_bracket": 0.0010785999475046992,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4200151562690735,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.015921149402856827,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1341925710439682,
"rps_doc_frac_unique_words": 0.3766346871852875,
"rps_doc_mean_word_length": 5.285963535308838,
"rps_doc_num_sentences": 52,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.293962478637695,
"rps_doc_word_count": 1147,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.01682334952056408,
"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.010720769874751568,
"rps_doc_frac_chars_top_3gram": 0.010390900075435638,
"rps_doc_frac_chars_top_4gram": 0.021936340257525444,
"rps_doc_books_importance": -584.324951171875,
"rps_doc_books_importance_length_correction": -584.324951171875,
"rps_doc_openwebtext_importance": -329.8605651855469,
"rps_doc_openwebtext_importance_length_correction": -329.8605651855469,
"rps_doc_wikipedia_importance": -261.4560852050781,
"rps_doc_wikipedia_importance_length_correction": -261.4560852050781
},
"fasttext": {
"dclm": 0.83311527967453,
"english": 0.9248645901679993,
"fineweb_edu_approx": 3.4224767684936523,
"eai_general_math": 0.8543304204940796,
"eai_open_web_math": 0.5055766105651855,
"eai_web_code": 0.4725314974784851
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "576.5",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Biology and Anthropology",
"level_3": "Microbiology"
}
},
"secondary": {
"code": "572.88",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Biology and Anthropology",
"level_3": "Anthropology"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
1,323,245,533,944,065,300 |
Nematocera
From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
Nematocera
Aedes aegypti.jpg
Aedes aegypti, a disease-carrying mosquito
Scientific classification
Kingdom: Animalia
Phylum: Arthropoda
Class: Insecta
Order: Diptera
Suborder: Nematocera
The Nematocera are a large suborder of flies which include the mosquitoes and midges. They usually have long thin bodies, with segmented antennae. Usually their larvae are aquatic, but there are many exceptions to this.
Examples of the Nematocera include the mosquitoes (Culicidae), crane flies (Tipulidae) and black flies (Simuliidae). Many of the other families are called gnats, and others are called midges.
Many species form mating swarms of males, and in some of these, competition for females is extreme. Although many species (as larvae) have a strong association with water, even within a single family there may be a trend toward semiaquatic and terrestrial habitats.
|
{
"url": "https://simple.wikipedia.org/wiki/Nematocera",
"source_domain": "simple.wikipedia.org",
"snapshot_id": "crawl=CC-MAIN-2018-51",
"warc_metadata": {
"Content-Length": "37754",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:I76WMQUIBHSG3UO2BINLVS4PEEBONOY3",
"WARC-Concurrent-To": "<urn:uuid:aeb9a56b-e606-4367-8c3f-fcb6cf6b6895>",
"WARC-Date": "2018-12-15T18:51:55Z",
"WARC-IP-Address": "208.80.154.224",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:UT6PTROOJ7JX5MXII7F2B7NVUV7PJDWJ",
"WARC-Record-ID": "<urn:uuid:bf0511da-3cca-4fd0-aa5b-d922cf0a2ee2>",
"WARC-Target-URI": "https://simple.wikipedia.org/wiki/Nematocera",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a7d67d47-2d54-4858-8da6-9b29a6be61e1>"
},
"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-232-130-137.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
11,
12,
50,
84,
85,
96,
114,
157,
183,
201,
220,
235,
250,
271,
272,
492,
493,
685,
686
],
"line_end_idx": [
11,
12,
50,
84,
85,
96,
114,
157,
183,
201,
220,
235,
250,
271,
272,
492,
493,
685,
686,
951
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 951,
"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.31952664256095886,
"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.17159762978553772,
"rps_doc_frac_unique_words": 0.6739130616188049,
"rps_doc_mean_word_length": 5.637681007385254,
"rps_doc_num_sentences": 8,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.339245319366455,
"rps_doc_word_count": 138,
"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.015424160286784172,
"rps_doc_frac_chars_top_3gram": 0.0514138787984848,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -75.3668441772461,
"rps_doc_books_importance_length_correction": -75.3668441772461,
"rps_doc_openwebtext_importance": -39.248409271240234,
"rps_doc_openwebtext_importance_length_correction": -26.241220474243164,
"rps_doc_wikipedia_importance": -28.289968490600586,
"rps_doc_wikipedia_importance_length_correction": -28.289968490600586
},
"fasttext": {
"dclm": 0.20971423387527466,
"english": 0.9094438552856445,
"fineweb_edu_approx": 3.141601085662842,
"eai_general_math": 0.11611008644104004,
"eai_open_web_math": 0.7633085250854492,
"eai_web_code": 0.003273729933425784
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "595.78",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Zoology",
"level_3": "Arthropoda and Worms"
}
},
"secondary": {
"code": "595.7",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Zoology",
"level_3": "Arthropoda and Worms"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "3",
"label": "Academic Writing"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-212,770,028,015,372,160 |
2024-08-09
Spaceteams Coding Workshop: Wie man Domain Driven Design zum Leben erweckt
Software Engineering
Learning & Growth
showing a striking conceptual design featuring a gritty urban inspired illustration of a laptop with coding on
showing badge with astronauts representing a software engineer team profile image
GESCHRIEBEN VON
Hung, Tawhi & Saad
INHALT
Während eines Workshops in unserer Spacetime haben wir Domain Driven Design (DDD) und dessen praktische Anwendung kennengelernt. DDD ist ein Ansatz zur Softwareentwicklung, der sich an den Geschäftsanforderungen orientiert. Wichtige Konzepte sind Domain Storytelling, Ubiquitous Language und Bounded Contexts. Der Workshop verwendete praktische Beispiele aus dem Bankwesen und einem detaillierten Leasing-Beispiel, um zu zeigen, wie architektonische Konzepte im Code umgesetzt werden können. Dies fördert verständlichen und wartbaren Code.
Dieser Artikel fokussiert sich auf einen der letzten Workshops, geleitet von Henning Schwentner, einem bekannten Experten in der DDD-Community.
DDD-Konzepte
Bevor wir zu DDD im Code kommen, schauen wir uns kurz einige DDD-Konzepte an.
Ubiquitous Language: Das ist eine gemeinsame Sprache für verschiedene Geschäftsprozesse oder Entities. Diese Sprache wird von den Domainexpert:innen verwendet und sollte daher auch im Code verwendet werden, z.B. in Variablennamen, Methoden und Klassen.
Bounded Contexts: Durch Domain Storytelling erhalten wir eine Visualisierung der Domain. Danach können klare Grenzen gezogen werden, um die Domain, die Software und die Teams zu organisieren. Diese Grenzen nennt man Bounded Contexts. Beispiel: Im Geschäftsfeld Autoleasing können wir alle Aktivitäten und Einträge im Zusammenhang mit dem Verkauf in einem Kontext und alle Aktivitäten und Einheiten im Zusammenhang mit dem Risikomanagement des Darlehensantrags in einem anderen Kontext stellen.
Domain Storytelling: Das ist eine Methode, um Domainwissen in Softwareanwendungen zu übertragen, die Geschäftsprobleme lösen. Domainexpert:innen und Entwickler:innen kommen zusammen und visualisieren den Geschäftsprozess, was bei der Entwicklung hilft, die Domain zu verstehen und die Software entsprechend zu entwickeln.
showing domainstory leasingninja example with contexts
Quelle: https://speakerdeck.com/hschwentner/
Bausteine von DDD:
• Value Object: Ein unveränderliches Objekt, das nur durch seinen Wert definiert wird, z.B. eine IBAN für ein Bankkonto.
• Entities: Veränderliche Objekte mit einer eindeutigen Identität innerhalb der Domain. Sie benötigen eine Identifikation zur Unterscheidung und haben einen Lebenszyklus, z.B. ein Bankkonto mit einer eindeutigen Kontonummer.
• Aggregates: Aggregates sind Entitäten, die aus mehreren Entitäten bestehen können und innerhalb ihrer inneren Entitäten Konsistenz und Integrität sicherstellen.
showing an aggregation of entities
Quelle: https://speakerdeck.com/hschwentner/
• Repository: Repositories dienen als Zugangspunkte zu Aggregates und verbergen die technischen Details der Infrastruktur. Sie erleichtern die Zuordnung externer Daten zu Entitäten und Value Objects und speichern Aggregates.
showing repository with aggregations
Quelle: https://speakerdeck.com/hschwentner/
• Domain Services: Wenn Geschäftslogik nicht natürlich in den Kontext von Entitäten, Value Objects oder Aggregates passt, wird sie als Domain Service implementiert.
Nun, da wir die Bausteine von DDD kennen, widmen wir uns einigen Beispielen, die wir während des Workshops bearbeitet haben. Diese Beispiele helfen uns, die Konzepte von DDD in der Praxis besser zu verstehen und zu visualisieren. Wir beginnen mit einem Beispiel für DDD im Bankwesen.
Beispiel aus dem Bankwesen mit xMolecules
In DDD ist eine Entität eine Darstellung eines eindeutigen und identifizierbaren realen Objekts. In unserem Bankbeispiel passt ein Konto perfekt zu diesem Konzept, da es eine eindeutige Kennung wie eine Kontonummer und einen Zustand wie den Kontostand besitzt.
Die Konto-Entity repräsentiert ein einzigartiges und identifizierbares Objekt in der Bankdomain, und sein Zustand wird durch die Methoden Einzahlung und Auszahlung verwaltet. Diese Methoden setzen Domainregeln durch, z.B. dass Transaktionen nicht negativ sein dürfen und ausreichend Geld vorhanden sein muss, um Auszahlungen zu decken. Durch die Anwendung von DDD-Prinzipien schafft das Bankbeispiel ein Softwaremodell, das mit der Geschäftsdomain übereinstimmt und verständlichen und wartbaren Code fördert.
Traditionell ist es üblich, den Kontostand vor einer Auszahlung zu überprüfen, um sicherzustellen, dass genügend Geld vorhanden ist. Wir haben jedoch einen anderen Ansatz gewählt, indem wir eine Ausnahme ausgelöst haben. Dies kapselt nicht nur Fehlermeldungen für einfacheres Debugging, sondern erfordert auch, dass die Aufrufer Fehler explizit behandeln.
Design by Contract (DbC) ist eine Methode zur Softwareentwicklung, die die Definition klarer und formaler Verträge zwischen den Komponenten eines Softwaresystems betont. Diese Verträge spezifizieren die Verpflichtungen der einzelnen Komponenten und stellen sicher, dass das System wie erwartet funktioniert.
Beispiel:
showing assertion using keyword assert
Quelle: https://speakerdeck.com/hschwentner/
Die Assertion assert amount <= balance() ist eine Möglichkeit zu überprüfen, ob die Vorbedingung der Methode withdraw() erfüllt ist. Die Vorbedingung besagt, dass der Betrag, der abgehoben werden soll, kleiner oder gleich dem Kontostand sein muss. Wenn die Assertion fehlschlägt, wird eine Ausnahme ausgeworfen.
• Dies ist eine Möglichkeit, einen Vertrag zwischen der Methode withdraw() und ihrem / ihrer Aufrufer:in zu spezifizieren. Der Vertrag besagt, dass der / die Aufrufer:in nicht mehr Geld abheben darf, als auf dem Konto vorhanden ist. Dieser Vertrag hilft sicherzustellen, dass das System wie erwartet funktioniert.
Im weiteren Verlauf unseres Bankbeispiels haben wir verschiedene Anmerkungen aus xMolecules untersucht, die es ermöglichen, architektonische Konzepte im Code auszudrücken.
• Mit diesen Tools können Sie spezielle Labels und Datentypen verwenden, um zu beschreiben, wie verschiedene Teile Ihrer Softwarearchitektur zusammenpassen. Diese Tools generieren auch automatisch einige grundlegende Codes, was es einfacher macht, Ihre architektonischen Ideen mit dem tatsächlichen Code zu verbinden, den Sie schreiben.
In diesem Beispiel zeigt die Annotation @Entity an, dass die Klasse Account eine Entität ist. Die Annotation @Identity zeigt an, dass die Eigenschaft id der Primärschlüssel der Entität ist. Die Verwendung der Annotation ist eine Möglichkeit, DDD-Prinzipien im Code zu implementieren. Dies trägt dazu bei, dass das Domainmodell in einer Weise dargestellt wird, die mit den DDD-Prinzipien übereinstimmt. Hier sind einige Vorteile der Verwendung der Annotation:
• Verbesserte Lesbarkeit des Codes: Die Annotation macht es dem Entwicklerteam klar, dass eine Klasse eine Entität ist. Dies kann die Lesbarkeit des Codes verbessern.
• Reduzierter Boilerplate-Code: Die Annotation kann verwendet werden, um die Menge an Boilerplate-Code zu reduzieren, die erforderlich ist, um Entitäten in einer Datenbank zu speichern.
• Erhöhte Wartbarkeit: Die Verwendung der Annotation kann den Code wartbarer machen, indem klar gemacht wird, wie Entitäten auf Datenbanktabellen abgebildet werden.
showing value object
Quelle: https://speakerdeck.com/hschwentner/
Leasing Ninja Beispiel
Danach haben wir uns ein detaillierteres Beispiel angesehen, nämlich das Leasing Ninja Beispiel, ein Open Source DDD-Beispiel, das hier verfügbar ist.
Die Domäne:
Unsere Domäne für dieses Beispiel ist das Leasing eines Autos: Ein:e Kund:in geht zu einem Autohaus und fordert ein Auto an, der / die Verkäufer:in berechnet die monatliche Rate und erstellt einen Vertrag. Nachdem der / die Kund:in den Vertrag unterschrieben hat, gibt der / die Verkäufer:in den Vertrag an die Risikoabteilung weiter, die den Vertrag prüft. Wenn alles gut aussieht, wird der / die Verkäufer:in informiert und kann die Autoschlüssel übergeben.
Für das Beispiel konzentrieren wir uns hauptsächlich auf den "Sales"-Kontext und den "Risk Management"-Kontext.
Nachdem wir unsere Bausteine und Bounded Contexts mit Domain Storytelling identifiziert haben, gehen wir zum Code über und:
• machen Klassen aus unseren Arbeitsobjekten (Nomen)
• machen Methoden/Befehle aus unseren Aktivitäten (Verben)
Der Code:
Wir begannen mit einem Überblick über die Java-Implementierung des Beispiels, verfügbar hier:
https://github.com/leasingninja/leasingninja-java-boundedcontexts-domainmodel
Dann verglichen wir einige Teile des Codes mit anderen Implementierungen, die für uns interessant sind, wie z.B. die Verwendung von Typescript oder andere Wege wie die funktionale Programmierung mit F#.
Der Code dieser Beispiele war sehr lesbar, da er mit den DDD-Bausteinen strukturiert ist und auch die xMolecules-Bibliothek für Anmerkungen verwendet.
Hier sind einige Codebeispiele von DDD-Bausteinen aus dem Sales-Kontext. Diese Bausteine sind wie folgt annotiert:
Car Value Object:
@ValueObject
public record Car(String car) {
public static Car of(String car) {
return new Car(car);
}
}
Contract Entity:
@Entity
public class Contract {
@Identity
private final ContractNumber number;
private final Customer lessee;
private final Car car;
private final Amount price;
private record Calculation(LeaseTerm leaseTerm, Interest interest, Amount installment) {}
private Optional<Calculation> calculation;
private Optional<SignDate> signDate;
...
}
Contract Repository:
@Repository
public interface Contracts {
Contract with(ContractNumber number);
void save(Contract contract);
}
FinancialCalculator Service (simuliert den berühmten HP12c calculator):
@Service
public class FinancialCalculator {
public static double pmt(double n, double iInPercent, double pv, double fv, double s) {
double i = iInPercent / 100.0;
return pmtWithDecimalInterestRate(n, i, pv, fv, s);
}
...
}
Zusammenfassung
Bei Spaceteams glauben wir, dass DDD wichtig ist. Wir denken, dass es entscheidend ist, dass alle unsere Entwickler:innen die Geschäftslogik in unseren Projekten verstehen und mit den Stakeholder:innen sprechen können, um echten Mehrwert für die Kunden zu schaffen.
Während des Workshops haben wir die Vorteile von Domain Driven Design (DDD) kennengelernt. Einer der Hauptvorteile von DDD ist die klare Trennung zwischen der Domain und den Implementierungsdetails. Dies ermöglicht es uns, uns auf das Verständnis der Domain zu konzentrieren und die richtige Lösung für das Geschäft zu schaffen.
Im Workshop haben wir die praktischen Aspekte von DDD im Code untersucht. Wir haben gelernt, wie man DDD-Anmerkungen mit xMolecules anwendet, was uns hilft, architektonische Konzepte im Code auszudrücken und unsere architektonischen Ideen mit dem tatsächlichen Code zu verbinden. Außerdem haben wir etwas über das Design by Contract gelernt, eine Methode, die betont, klare und formale Verträge zwischen den Komponenten eines Softwaresystems zu definieren, um sicherzustellen, dass das System wie erwartet funktioniert.
Insgesamt war der Workshop sehr hilfreich, da er uns Codebeispiele lieferte, die uns halfen, die Konzepte von DDD besser zu verstehen. Unsere Softwareteams hatten diesen Workshop sehnlichst erwartet, da sie viele DDD-Workshops hatten und endlich die Konzepte im Code und deren Umsetzung sehen konnten.
|
{
"url": "https://www.spaceteams.de/insights/spaceteams-coding-workshop-wie-man-domain-driven-design-zum-leben-erweckt",
"source_domain": "www.spaceteams.de",
"snapshot_id": "CC-MAIN-2024-38",
"warc_metadata": {
"Content-Length": "69710",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:X36WPVS4FHJRTY6K7HO2O2ORMDBHTKB3",
"WARC-Concurrent-To": "<urn:uuid:67525910-9f8a-49d2-b4e8-131471a26fd9>",
"WARC-Date": "2024-09-14T11:19:29Z",
"WARC-IP-Address": "168.119.249.225",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:XMWODEB4KJOABP4R67YA2VQQXY2QJIWE",
"WARC-Record-ID": "<urn:uuid:9e695d15-0f6b-4102-8fd2-b9cd01369288>",
"WARC-Target-URI": "https://www.spaceteams.de/insights/spaceteams-coding-workshop-wie-man-domain-driven-design-zum-leben-erweckt",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:15bde9b5-e753-43d3-b9d6-d6007486a82d>"
},
"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-196\r\nsoftware: Apache Nutch 1.20 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.5-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
11,
12,
87,
88,
109,
127,
238,
320,
321,
337,
338,
357,
358,
365,
366,
906,
907,
1051,
1052,
1065,
1066,
1144,
1145,
1398,
1399,
1893,
1894,
2216,
2217,
2272,
2273,
2318,
2319,
2338,
2339,
2462,
2689,
2854,
2889,
2890,
2935,
2936,
3163,
3200,
3201,
3246,
3247,
3414,
3415,
3699,
3700,
3742,
3743,
4004,
4005,
4514,
4515,
4871,
4872,
5180,
5181,
5191,
5192,
5231,
5232,
5277,
5278,
5590,
5591,
5907,
5908,
6080,
6081,
6420,
6421,
6880,
6881,
7050,
7238,
7405,
7426,
7427,
7472,
7473,
7496,
7497,
7648,
7649,
7661,
7662,
8122,
8123,
8235,
8236,
8360,
8361,
8416,
8477,
8478,
8488,
8489,
8583,
8584,
8662,
8663,
8866,
8867,
9018,
9019,
9134,
9135,
9153,
9154,
9167,
9199,
9200,
9239,
9268,
9274,
9275,
9277,
9278,
9295,
9296,
9297,
9305,
9329,
9330,
9342,
9381,
9382,
9417,
9444,
9476,
9477,
9571,
9616,
9617,
9656,
9662,
9664,
9665,
9686,
9687,
9699,
9728,
9729,
9771,
9772,
9806,
9807,
9809,
9810,
9882,
9883,
9892,
9927,
9928,
10020,
10059,
10060,
10120,
10126,
10132,
10134,
10135,
10151,
10152,
10418,
10419,
10748,
10749,
11269,
11270
],
"line_end_idx": [
11,
12,
87,
88,
109,
127,
238,
320,
321,
337,
338,
357,
358,
365,
366,
906,
907,
1051,
1052,
1065,
1066,
1144,
1145,
1398,
1399,
1893,
1894,
2216,
2217,
2272,
2273,
2318,
2319,
2338,
2339,
2462,
2689,
2854,
2889,
2890,
2935,
2936,
3163,
3200,
3201,
3246,
3247,
3414,
3415,
3699,
3700,
3742,
3743,
4004,
4005,
4514,
4515,
4871,
4872,
5180,
5181,
5191,
5192,
5231,
5232,
5277,
5278,
5590,
5591,
5907,
5908,
6080,
6081,
6420,
6421,
6880,
6881,
7050,
7238,
7405,
7426,
7427,
7472,
7473,
7496,
7497,
7648,
7649,
7661,
7662,
8122,
8123,
8235,
8236,
8360,
8361,
8416,
8477,
8478,
8488,
8489,
8583,
8584,
8662,
8663,
8866,
8867,
9018,
9019,
9134,
9135,
9153,
9154,
9167,
9199,
9200,
9239,
9268,
9274,
9275,
9277,
9278,
9295,
9296,
9297,
9305,
9329,
9330,
9342,
9381,
9382,
9417,
9444,
9476,
9477,
9571,
9616,
9617,
9656,
9662,
9664,
9665,
9686,
9687,
9699,
9728,
9729,
9771,
9772,
9806,
9807,
9809,
9810,
9882,
9883,
9892,
9927,
9928,
10020,
10059,
10060,
10120,
10126,
10132,
10134,
10135,
10151,
10152,
10418,
10419,
10748,
10749,
11269,
11270,
11571
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 11571,
"ccnet_original_nlines": 174,
"rps_doc_curly_bracket": 0.0012099200394004583,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.034643229097127914,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.017580140382051468,
"rps_doc_frac_lines_end_with_ellipsis": 0.011428570374846458,
"rps_doc_frac_no_alph_words": 0.1928645372390747,
"rps_doc_frac_unique_words": 0.3929521441459656,
"rps_doc_mean_word_length": 6.374335289001465,
"rps_doc_num_sentences": 89,
"rps_doc_symbol_to_word_ratio": 0.001551190041936934,
"rps_doc_unigram_entropy": 5.761699676513672,
"rps_doc_word_count": 1504,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.04589547961950302,
"rps_doc_frac_chars_dupe_6grams": 0.036924999207258224,
"rps_doc_frac_chars_dupe_7grams": 0.022530509158968925,
"rps_doc_frac_chars_dupe_8grams": 0.011891099624335766,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.005006779916584492,
"rps_doc_frac_chars_top_3gram": 0.0058412398211658,
"rps_doc_frac_chars_top_4gram": 0.009387710131704807,
"rps_doc_books_importance": -907.4880981445312,
"rps_doc_books_importance_length_correction": -907.4880981445312,
"rps_doc_openwebtext_importance": -540.1812744140625,
"rps_doc_openwebtext_importance_length_correction": -540.1812744140625,
"rps_doc_wikipedia_importance": -374.46624755859375,
"rps_doc_wikipedia_importance_length_correction": -374.46624755859375
},
"fasttext": {
"dclm": 0.7120226621627808,
"english": 0.0030264300294220448,
"fineweb_edu_approx": 1.8363381624221802,
"eai_general_math": 0.011492489837110043,
"eai_open_web_math": 0.6736694574356079,
"eai_web_code": 0.5299971699714661
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
357,014,989,791,028,700 |
DaedTech
Stories about Software
By
The Most Important Code Metrics You’ve Never Heard Of
Editorial Note: I originally wrote this post for the NDepend blog. Head on over and check out the original. If software architecture interests you or you aspire to that title, there’s a pretty focused set of topics that will interest you.
Oh how I hope you don’t measure developer productivity by lines of code. As Bill Gates once ably put it, “measuring software productivity by lines of code is like measuring progress on an airplane by how much it weighs.” No doubt, you have other, better reasoned metrics that you capture for visible progress and quality barometers. Automated test coverage is popular (though be careful with that one). Counts of defects or trends in defect reduction are another one. And of course, in our modern, agile world, sprint velocity is ubiquitous.
FigherJet
But today, I’d like to venture off the beaten path a bit and take you through some metrics that might be unfamiliar to you, particularly if you’re no longer technical (or weren’t ever). But don’t leave if that describes you — I’ll help you understand the significance of these metrics, even if you won’t necessarily understand all of the nitty-gritty details.
Perhaps the most significant factor here is that the metrics I’ll go through can be tied, relatively easily, to stakeholder value in projects. In other words, I won’t just tell you the significance of the metrics in terms of what they say about the code. I’ll also describe what they mean for people invested in the project’s outcome.
Type Rank
It’s possible that you’ve heard of the concept of Page Rank. If you haven’t, page rank was, for a long time, the method by which Google determined which sites on the internet were most important. This should make intuitive sense on some level. Amazon has a high page rank — if it went down, millions of lives would be disrupted, stocks would plummet, and all sorts of chaos would ensure. The blog you created that one time and totally meant to add to over the years has a low page rank — no one, yourself included, would notice if it stopped working.
It turns out that you can actually reason about pieces of code in a very similar way. Some bits of code in the code base are extremely important to the system, with inbound and outbound dependencies. Others exist at the very periphery or are even completely useless (see the section on dead code). Not all code is created equally. This scheme for ranking code by importance is called “Type Rank” (at least at the level of type granularity — methods can also be ranked).
You can use Type Rank to create a release riskiness score. All you’d really need to do is have a build that tabulated which types had been modified and what their type rank was, and this would create a composite index of release riskiness. Each time you were gearing up for deployment, you could look at the score. If it were higher than normal, you’d want to budget extra time and money for additional testing efforts and issue remediation strategies.
Cohesion
Cohesion of modules in a code base can loosely be described as “how well is the code base organized?” To put it a bit more concretely, cohesion is the idea that things with common interest are grouped together while unrelated things are not. A cohesive house would have specialized rooms for certain purposes: food preparation, food consumption, family time, sleeping, etc. A non-cohesive house would have elements of all of those things strewn about all over the house, resulting in a scenario where a broken refrigerator fan might mean you couldn’t sleep or work at your desk due to noise.
Keeping track of the aggregate cohesiveness score of a codebase will give you insight into how likely your team is to look ridiculous in the face of an issue. Code bases with low cohesion are ones in which unrelated functionality is bolted together inappropriately, and this sort of thing results in really, really odd looking bugs that can erode your credibility.
Imagine speaking on your team’s behalf and explaining a bug that resulted in a significant amount of client data being clobbered. When pressed for the root cause, you had to look the person asking directly in the eye and say, “well, that happened because we changed the font of the labels on the login page.”
You would sound ridiculous. You’d know it. The person you were talking to would know it. And you’d find your credibility quickly evaporating. Keeping track of cohesion lets you keep track of the likelihood of something like that.
Dependency Cycles
So far, I’ve talked about managing risk as it pertains to defects: the risk of encountering them on release, and the risk of encountering weird or embarrassing ones. I’m going to switch gears, now, and talk about the risk of being caught flat-footed, unable to respond to a changing environment or a critical business need.
Dependency cycles in your code base represent a form of inappropriate coupling. These are situations where two or more things are mutually dependent in an architectural world where it is far better for dependencies to flow one way. As a silly but memorable example, consider the situation of charging your phone, where your phone depends on your house’s electrical system to be charged. Would you hire an electrician to come in and create a situation where your house’s electricity depended on the presence of your charging phone?
All too often, we do this in code, and it creates situations as ludicrous as the phone-electrical example would. When the business asks, “how hard would it be to use a different logging framework,” you don’t want the answer to be, “we’d basically have to rewrite everything from scratch.” That makes as much sense as not being able to take your phone with you anywhere because your appliances would stop working.
So, keep an eye out for dependency cycles. These are the early warning light indicators that you’re heading for something like this.
Dead Code
One last thing to keep an eye out for is dead code. Dead code is code that can never possibly be called during the running application’s lifecycle. It just sits in your codebase taking up space to no good end.
That may sound benign, but every line of code in your code base carries a small, cognitive maintenance weight. The more code there is, the more results come back in text searches of the code base, the more files there are to lose and confuse developers, and the more general friction is encountered when working with the system. This has a very real cost in the labor required to maintain the code.
Use Wisely
These are metrics about which fewer people know, so the industry isn’t rife with stories about people gaming them, the way it is with something like unit test coverage. But that doesn’t mean they can’t be gamed. For instance, it’s possible to have a nightmarish code base without any actual dead code — perversely, dead code could be eliminated by finding everything useless in the code base and implementing calls to it.
The metrics I’ve outlined today, if you make them big and visible to all, should serve as a conversation starter. Why did we introduce a dependency cycle? Should we be concerned about the lack of cohesion in modules? Use them in this fashion, and your group can save real money and produce better output. Use them in the wrong fashion, and they’ll be just another ineffective management bludgeon straight out of a Dilbert comic.
Subscribe
newest oldest most voted
Notify of
Brent Arias
Guest
I’m surprised you highlighted these metrics, without mentioning tools or techniques for gathering them. Two of your metrics, cohesion and dependency cycles, can be simultaneously measured with Cumulative Component Dependency (CCD) or Average Component Dependency (ACD). Those metrics were introduced in “Large Scale Architecture” by John Lakos, long ago…I am very sad that practically nobody has heard of them today.
Erik Dietrich
Guest
The original post is on the site of a static analysis tool vendor, so the tool/technique is sort of implied 🙂
(I realize that wouldn’t necessarily translate here to my blog, though — but that’s why there was no mention)
Helton Moraes
Guest
“The blog you created that one time and totally meant to add to over the years”… (sigh)
Erik Dietrich
Guest
🙂
Zeb Mason
Guest
Would Type Rank give the main() method of a program a low rank as it is at the periphery?
Erik Dietrich
Guest
Off the cuff, I don’t think so, but I’d have to check. (Don’t have my development rig with me at the moment).
Adam
Guest
Software Engineering undergrad here – I’ve gotten a lesson in coupling vs cohesion in *all* of my classes. Dependency cycles have been mentioned sparingly however.
Erik Dietrich
Guest
Frankly, I’m impressed that any of that is mentioned. The distinction doesn’t surprise me, necessarily, though. Coupling/cohesion can bite you in a codebase of any size. The cycles among namespaces, however, don’t really rear their ugly head until the project has grown and you’re looking to reorganize, months or years later.
Karl Gjertsen
Guest
I was surprised by the metrics you mention, however they make a lot of sense. It’s hard when you have non-technical managers who still insist lines of code are a valid metric.
Andy Bailey
Guest
That is because non-technicals think that production = more so they translate this into “more code”. They have to be educated that this is only ever relevant to a production process where there is a finished product involved. Software is never a finished product.
Erik Dietrich
Guest
/shudders/
I keep thinking, it’s {insert current year}, no one is still worried about LOC as a productivity metric anymore. And I’m always wrong.
Markus Pscheidt
Guest
How do measure type rank?
Erik Dietrich
Guest
I believe it’s proprietary, so I’m not sure.
|
{
"url": "https://www.daedtech.com/important-code-metrics-youve-never-heard/",
"source_domain": "www.daedtech.com",
"snapshot_id": "crawl=CC-MAIN-2018-09",
"warc_metadata": {
"Content-Length": "98725",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:SD2SG5IWFPDRGSADQPCXITQLUZ2AHB2R",
"WARC-Concurrent-To": "<urn:uuid:a2e5f5d4-6bc5-4171-95c2-430db95571db>",
"WARC-Date": "2018-02-25T03:37:05Z",
"WARC-IP-Address": "69.175.81.154",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:RUEXOWNKHIUF5MHZ7E7IZNFHFZHVWWYB",
"WARC-Record-ID": "<urn:uuid:6f342504-ddf7-4f98-97c3-e9b684fcdea2>",
"WARC-Target-URI": "https://www.daedtech.com/important-code-metrics-youve-never-heard/",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e14c2fba-11fd-4af9-bc48-f7f7e9a886c7>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-145-70-71.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2018-09\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for February 2018\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
9,
10,
33,
34,
37,
38,
92,
93,
334,
335,
882,
883,
893,
894,
1255,
1256,
1593,
1594,
1604,
1605,
2160,
2161,
2635,
2636,
3092,
3093,
3102,
3103,
3698,
3699,
4065,
4066,
4376,
4377,
4611,
4612,
4630,
4631,
4956,
4957,
5491,
5492,
5907,
5908,
6042,
6043,
6053,
6054,
6266,
6267,
6668,
6669,
6680,
6681,
7105,
7106,
7539,
7540,
7554,
7579,
7589,
7601,
7607,
7608,
8025,
8026,
8040,
8046,
8047,
8157,
8158,
8268,
8269,
8283,
8289,
8290,
8378,
8379,
8393,
8399,
8400,
8402,
8403,
8413,
8419,
8420,
8510,
8511,
8525,
8531,
8532,
8642,
8643,
8648,
8654,
8655,
8819,
8820,
8834,
8840,
8841,
9168,
9169,
9183,
9189,
9190,
9366,
9367,
9379,
9385,
9386,
9650,
9651,
9665,
9671,
9672,
9683,
9684,
9819,
9820,
9836,
9842,
9843,
9869,
9870,
9884,
9890,
9891
],
"line_end_idx": [
9,
10,
33,
34,
37,
38,
92,
93,
334,
335,
882,
883,
893,
894,
1255,
1256,
1593,
1594,
1604,
1605,
2160,
2161,
2635,
2636,
3092,
3093,
3102,
3103,
3698,
3699,
4065,
4066,
4376,
4377,
4611,
4612,
4630,
4631,
4956,
4957,
5491,
5492,
5907,
5908,
6042,
6043,
6053,
6054,
6266,
6267,
6668,
6669,
6680,
6681,
7105,
7106,
7539,
7540,
7554,
7579,
7589,
7601,
7607,
7608,
8025,
8026,
8040,
8046,
8047,
8157,
8158,
8268,
8269,
8283,
8289,
8290,
8378,
8379,
8393,
8399,
8400,
8402,
8403,
8413,
8419,
8420,
8510,
8511,
8525,
8531,
8532,
8642,
8643,
8648,
8654,
8655,
8819,
8820,
8834,
8840,
8841,
9168,
9169,
9183,
9189,
9190,
9366,
9367,
9379,
9385,
9386,
9650,
9651,
9665,
9671,
9672,
9683,
9684,
9819,
9820,
9836,
9842,
9843,
9869,
9870,
9884,
9890,
9891,
9935
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 9935,
"ccnet_original_nlines": 128,
"rps_doc_curly_bracket": 0.0002013100020121783,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.44005993008613586,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.013486510142683983,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.13536463677883148,
"rps_doc_frac_unique_words": 0.40738534927368164,
"rps_doc_mean_word_length": 4.731387615203857,
"rps_doc_num_sentences": 87,
"rps_doc_symbol_to_word_ratio": 0.000999000039882958,
"rps_doc_unigram_entropy": 5.790627479553223,
"rps_doc_word_count": 1679,
"rps_doc_frac_chars_dupe_10grams": 0.013595170341432095,
"rps_doc_frac_chars_dupe_5grams": 0.0236656591296196,
"rps_doc_frac_chars_dupe_6grams": 0.013595170341432095,
"rps_doc_frac_chars_dupe_7grams": 0.013595170341432095,
"rps_doc_frac_chars_dupe_8grams": 0.013595170341432095,
"rps_doc_frac_chars_dupe_9grams": 0.013595170341432095,
"rps_doc_frac_chars_top_2gram": 0.008056390099227428,
"rps_doc_frac_chars_top_3gram": 0.012839879840612411,
"rps_doc_frac_chars_top_4gram": 0.005287010222673416,
"rps_doc_books_importance": -911.621337890625,
"rps_doc_books_importance_length_correction": -911.621337890625,
"rps_doc_openwebtext_importance": -534.1536254882812,
"rps_doc_openwebtext_importance_length_correction": -534.1536254882812,
"rps_doc_wikipedia_importance": -395.6790466308594,
"rps_doc_wikipedia_importance_length_correction": -395.6790466308594
},
"fasttext": {
"dclm": 0.08959180116653442,
"english": 0.9448007941246033,
"fineweb_edu_approx": 2.0597941875457764,
"eai_general_math": 0.419585645198822,
"eai_open_web_math": 0.2375914454460144,
"eai_web_code": 0.07666283845901489
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "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": "16",
"label": "Personal Blog"
}
},
"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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-8,245,281,385,023,058,000 |
Biology DNA replication project
Updated: 1/15/2021
Biology DNA replication project
Storyboard Text
• I hope this information helps people understand more about DNA...
• Hello, I am the conductor of human body. Today is a very important day. DNA replication is happening. Let me explain the process to you!
• This is how DNA looks like. It is very small so people cannot see by eyes but I can. That is the advantage of being a conductor. DNA is a double helix consisting two strands that is twisted together.
• Firstly, DNA replication is the process of making a copy of itself during cell division. Cell division takes place in the cell cycle and DNA is replicated in a S phase.
• DNA is made of long chains of nucleotides. A nucleotide has three parts which are deoxyribose, phosphate, and nitrogen bases. Deoxyribose and phosphate are bonded covalently. The nucleotide differs only in their nitrogen bases. There is thymine, adenine, cytosine, and guanine. Thymine will always pair with adenine, cytosine will always pair with guanine which is a complementary base pairing. The bonding of the nitrogen bases is called the hydrogen bond. Let's move on to the main point!
• DNA is unzipped and unwinded by an enzyme, helicase. After the DNA is unzipped replication fork breaks the hydrogen bond and hold 2 DNA strands.
• After breaking the hydrogen bond, DNA polymerase starts to work. DNA polymerase is an enzyme that works in pairs to create two identical DNA strands. Each strands are copied and create. There would be two old stands and two new strands existing.
• After the replication for DNA, we will find two DNA that is identical to the first DNA. DNA is an semi conservative process because one strand is old and the other is new.
|
{
"url": "https://www.storyboardthat.com/storyboards/19ab7f37/biology-dna-replication-project",
"source_domain": "www.storyboardthat.com",
"snapshot_id": "crawl=CC-MAIN-2021-10",
"warc_metadata": {
"Content-Length": "122767",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:ZSO2D6O4QSPAR3U4FEEO67YIMSVWVRDK",
"WARC-Concurrent-To": "<urn:uuid:d228afbc-bf5d-4d57-8568-c52e44a9e00b>",
"WARC-Date": "2021-03-07T19:08:34Z",
"WARC-IP-Address": "20.49.104.0",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:YSHOUHTDAZICZI4H637ZAWNSUFNYT4MF",
"WARC-Record-ID": "<urn:uuid:41f6589d-f129-45cf-81b3-3f53ac1a9c83>",
"WARC-Target-URI": "https://www.storyboardthat.com/storyboards/19ab7f37/biology-dna-replication-project",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:cf5842da-998b-4329-a3c8-cf186525ce45>"
},
"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-241.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,
32,
51,
83,
84,
100,
101,
171,
312,
516,
689,
1184,
1333,
1583
],
"line_end_idx": [
32,
51,
83,
84,
100,
101,
171,
312,
516,
689,
1184,
1333,
1583,
1758
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1758,
"ccnet_original_nlines": 13,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.36887606978416443,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06916426867246628,
"rps_doc_frac_lines_end_with_ellipsis": 0.0714285671710968,
"rps_doc_frac_no_alph_words": 0.15561960637569427,
"rps_doc_frac_unique_words": 0.5,
"rps_doc_mean_word_length": 4.619205474853516,
"rps_doc_num_sentences": 27,
"rps_doc_symbol_to_word_ratio": 0.002881840104237199,
"rps_doc_unigram_entropy": 4.572876453399658,
"rps_doc_word_count": 302,
"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.021505380049347878,
"rps_doc_frac_chars_top_3gram": 0.032258059829473495,
"rps_doc_frac_chars_top_4gram": 0.040143370628356934,
"rps_doc_books_importance": -124.4290542602539,
"rps_doc_books_importance_length_correction": -115.99586486816406,
"rps_doc_openwebtext_importance": -84.77101135253906,
"rps_doc_openwebtext_importance_length_correction": -84.77101135253906,
"rps_doc_wikipedia_importance": -23.898447036743164,
"rps_doc_wikipedia_importance_length_correction": -19.957202911376953
},
"fasttext": {
"dclm": 0.3874872326850891,
"english": 0.9583441615104675,
"fineweb_edu_approx": 3.059864044189453,
"eai_general_math": 0.6121051907539368,
"eai_open_web_math": 0.6248518228530884,
"eai_web_code": 0.006665769964456558
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "572.888",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Biology and Anthropology",
"level_3": "Anthropology"
}
},
"secondary": {
"code": "572.88",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Biology and Anthropology",
"level_3": "Anthropology"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
381,137,575,244,478,900 |
/* * Matroska common data * Copyright (c) 2003-2004 The ffmpeg Project * * This file is part of FFmpeg. * * FFmpeg is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License as published by the Free Software Foundation; either * version 2.1 of the License, or (at your option) any later version. * * FFmpeg is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * Lesser General Public License for more details. * * You should have received a copy of the GNU Lesser General Public * License along with FFmpeg; if not, write to the Free Software * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA */ #include "matroska.h" CodecTags ff_mkv_codec_tags[]={ // {"V_MS/VFW/FOURCC" , CODEC_ID_NONE}, {"V_UNCOMPRESSED" , CODEC_ID_RAWVIDEO}, {"V_MPEG4/ISO/SP" , CODEC_ID_MPEG4}, {"V_MPEG4/ISO/ASP" , CODEC_ID_MPEG4}, {"V_MPEG4/ISO/AP" , CODEC_ID_MPEG4}, {"V_MPEG4/ISO/AVC" , CODEC_ID_H264}, {"V_MPEG4/MS/V3" , CODEC_ID_MSMPEG4V3}, {"V_MPEG1" , CODEC_ID_MPEG1VIDEO}, {"V_MPEG2" , CODEC_ID_MPEG2VIDEO}, {"V_MJPEG" , CODEC_ID_MJPEG}, {"V_REAL/RV10" , CODEC_ID_RV10}, {"V_REAL/RV20" , CODEC_ID_RV20}, {"V_REAL/RV30" , CODEC_ID_RV30}, {"V_REAL/RV40" , CODEC_ID_RV40}, {"V_THEORA" , CODEC_ID_THEORA}, /* TODO: Real/Quicktime */ // {"A_MS/ACM" , CODEC_ID_NONE}, {"A_MPEG/L3" , CODEC_ID_MP3}, {"A_MPEG/L2" , CODEC_ID_MP2}, {"A_MPEG/L1" , CODEC_ID_MP2}, {"A_PCM/INT/BIG" , CODEC_ID_PCM_U16BE}, {"A_PCM/INT/LIT" , CODEC_ID_PCM_U16LE}, // {"A_PCM/FLOAT/IEEE" , CODEC_ID_NONE}, {"A_AC3" , CODEC_ID_AC3}, {"A_DTS" , CODEC_ID_DTS}, {"A_VORBIS" , CODEC_ID_VORBIS}, {"A_AAC" , CODEC_ID_AAC}, {"A_FLAC" , CODEC_ID_FLAC}, {"A_WAVPACK4" , CODEC_ID_WAVPACK}, {"A_TTA1" , CODEC_ID_TTA}, {"A_REAL/14_4" , CODEC_ID_RA_144}, {"A_REAL/28_8" , CODEC_ID_RA_288}, {"A_REAL/ATRC" , CODEC_ID_ATRAC3}, {"A_REAL/COOK" , CODEC_ID_COOK}, // {"A_REAL/SIPR" , CODEC_ID_SIPRO}, {"S_TEXT/UTF8" , CODEC_ID_TEXT}, {"S_TEXT/ASCII" , CODEC_ID_TEXT}, {"S_TEXT/ASS" , CODEC_ID_TEXT}, {"S_TEXT/SSA" , CODEC_ID_TEXT}, {"S_ASS" , CODEC_ID_TEXT}, {"S_SSA" , CODEC_ID_TEXT}, {"S_VOBSUB" , CODEC_ID_DVD_SUBTITLE}, {NULL , CODEC_ID_NONE} /* TODO: AC3-9/10 (?), Real, Musepack, Quicktime */ };
|
{
"url": "https://ans.disi.unitn.it/redmine/projects/peerstreamer/repository/ffmpeg/revisions/0a5790d1a9f86cde715f747b0a4fee8ea2076530/raw/libavformat/matroska.c",
"source_domain": "ans.disi.unitn.it",
"snapshot_id": "crawl=CC-MAIN-2021-21",
"warc_metadata": {
"Content-Length": "3362",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3SOXH3RG4N55UEHZEKRID6MJ7LCMDLBS",
"WARC-Concurrent-To": "<urn:uuid:88b6447a-a594-4a23-a297-35d0a4d9d9d3>",
"WARC-Date": "2021-05-13T12:41:54Z",
"WARC-IP-Address": "193.205.194.89",
"WARC-Identified-Payload-Type": "text/x-csrc",
"WARC-Payload-Digest": "sha1:WXOXL5WGOG2475FS675VXHJ3LMFA4XPG",
"WARC-Record-ID": "<urn:uuid:3e9a0dec-0810-4740-9ffa-a0a09133416f>",
"WARC-Target-URI": "https://ans.disi.unitn.it/redmine/projects/peerstreamer/repository/ffmpeg/revisions/0a5790d1a9f86cde715f747b0a4fee8ea2076530/raw/libavformat/matroska.c",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:8c0571d4-dd0e-4729-b1a7-63153ebce2ce>"
},
"warc_info": "isPartOf: CC-MAIN-2021-21\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for May 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-25.ec2.internal\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.2-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0
],
"line_end_idx": [
2349
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2349,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.036611318588256836,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.10112360119819641,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.2509363293647766,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.5224719047546387,
"rps_doc_frac_unique_words": 0.7443946003913879,
"rps_doc_mean_word_length": 6.959641456604004,
"rps_doc_num_sentences": 9,
"rps_doc_symbol_to_word_ratio": 0.0018726600101217628,
"rps_doc_unigram_entropy": 4.932405471801758,
"rps_doc_word_count": 223,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.06443299353122711,
"rps_doc_frac_chars_dupe_6grams": 0.06443299353122711,
"rps_doc_frac_chars_dupe_7grams": 0.04381442815065384,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.02319587953388691,
"rps_doc_frac_chars_top_3gram": 0.02319587953388691,
"rps_doc_frac_chars_top_4gram": 0.03672679886221886,
"rps_doc_books_importance": -296.6336975097656,
"rps_doc_books_importance_length_correction": -296.6336975097656,
"rps_doc_openwebtext_importance": -127.56867980957031,
"rps_doc_openwebtext_importance_length_correction": -127.56867980957031,
"rps_doc_wikipedia_importance": -44.28408432006836,
"rps_doc_wikipedia_importance_length_correction": -44.28408432006836
},
"fasttext": {
"dclm": 0.10554295778274536,
"english": 0.3841250240802765,
"fineweb_edu_approx": 0.6647528409957886,
"eai_general_math": 0.5176603198051453,
"eai_open_web_math": 0.9894531965255737,
"eai_web_code": 0.0086402902379632
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.4",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.0151",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "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": "-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": "20",
"label": "Structured Data"
}
},
"reasoning_depth": {
"primary": {
"code": "1",
"label": "No Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic 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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
3,672,313,591,094,674,000 |
Skip to content
HTTPS clone URL
Subversion checkout URL
You can clone with HTTPS or Subversion.
Download ZIP
branch: master
Fetching contributors…
Cannot retrieve contributors at this time
486 lines (383 sloc) 19.619 kb
Self Tutorial
This is a tutorial covering the use of the VimL Self library.
The Self library had its origins soon after Vim 7.0 came out and was sporadically worked upon for a number of years prior to its posting on www.vim.org.
Reflections
Some might object to some of the reflections here. Well, I objected to the killing of the Branchidae. But what can one do? Despair, lessons are rarely actually learned, so just keep on truckin'.
With version 7.0, VimL just had enough features to allow for a library to extend it with Object Prototype capabilities. The Dictionary data structure allowed one to associated functions with the Dictionary and those functions had the concept of 'self', a reference to the Dictionary instance.
Object Prototype languages do not have Class-base inheritance but rather Object-base inheritance. One clones an Object instance and then modifies and/or adds-to its attributes and methods to make a new Object 'kind'. The earliest instance of such an object-oriented language, that I am aware of, was the Self language by Dave Ungar and Randy Smith. For those whose knowledge of Computer Science starts with the Internet, Javascript is also an Object-base object-oriented language.
Now, whether the Vim 7.0 enhancements that permitted an Object-base extension library was intensional or simple incidental could be a matter of discussion. There are two key features that are missing and have to be bolted on in order to get an Object-base language. Without those features, VimL is closer to Ada vintage mid-1980s than Javascript. You will recall (or maybe not) that with the original Ada, one could create objects but there was no inheritance. Possibly, the USA DoD felt that inheritance was too new and the associated tools and techniques concerning inheritance were too untested to base the One-true-language-to-rule-them-all on. They might have been right, but, as a result, the One-language certainly allowed for the evolution of more advanced languages. Anyway, VimL allows for the creation of objects, Dictionaries, but there is no support for inheritance.
Some might say, "We don't need no stinking Objects"; VimL is just perfect the way it is. Well, if that were true, then Vim would not have any complier bindings for some of the ghetto scripting languages. There are a handful of object-oriented scripting languages for which there are Vim compiler plugins. These would not exist unless folks thought there was a need. It is a shame that when Vim 7.0 came out it was not recognized that with, possibly a bunch of extra work, one of the very fast (far faster than the ghetto languages) Javascript engines could be modified and used as a replacement VimL engine allowing for a full object-oriented VimL (VimOOL).
So, what does VimL lack. First, a Dictionary data structure does not have any notion of a 'prototype' parent Dictionary. It can not inherit either attributes, key/value pairs, nor methods, whether named functions bound to a Dictionary or un-named, numbered functions defined directly to the Dictionary.
Example named and numbered Dictionary methods:
let d = {}
" named
function! NamedFunc() dict
" functioncode
endfuction
let d.named = function("NamedFunc")
" numbered
function! d.numberedFunc() dict
" func code
endfuction
To compensate for the lack of a 'prototype', all objects in the Self library have the '_prototype' attribute which holds the parent object. Because the '_prototype' value is the parent, when an object is cloned, it is not a deep-clone.
The second feature that is missing is the ability of an object to call its prototype's method and prototype prototype's method, etc. And, no the Vim 'call()' method is not enough. Consider that one has three objects: A, B and C; where A is B's prototype and B is C's prototype. In addition, A, B, and C all have a method 'm()' where we want the C object to call its 'm()', internally, have the 'C.m()' method call its prototype's 'm()' method 'B.m()' and, finally, have the 'B.m()' call its prototype's 'm()' method 'A.m()'.
function A.m() dict
" local code
endfuction
function B.m() dict
" local code
" call prototype m()
endfuction
function C.m() dict
" local code
" call prototype m()
endfuction
What does the code look like in 'C.m()':
function C.m() dict
" local code
" call prototype m()
let prototype = self._prototype " note that prototype == B
call call(prototype.m, [], self)
endfuction
and, doing the same for B:
function B.m() dict
" local code
" call prototype m()
let prototype = self._prototype
call call(prototype.m, [], self)
endfuction
But wait, in 'B,m()' when called from C's 'm()', the self reference is C not B. So,
let prototype = self._prototype
refers to C's prototype, not B's. So, within 'B.m()' when called from 'C.m()' the prototype object is B, not A. Thus 'B.m()' will call B's 'm()' once again with self being C once again. And you run out of stack.
With languages with true prototype support there is a mechanism for an object to call its prototype's method, which, in turn can call its prototype's method, and so on and this mechanism is transparently supported. With the Self library due to VimL's limitation, such support must be provided by an ad-hock convention.
One way to do this is by having all Self object methods support a variable number of arguments where the last such argument, if it exists, is the current object (in the above case B), not the calling object, self (in the above case C). Thus, C's method would be:
function C.m(...) dict
" local code
" call prototype m()
if a:0 > 0
let prototype = a:1._prototype " note that prototype == B
else
" In this case, it would be B, but if there was an object D
" derived from C, then D.m() would result in this being C, not B
let prototype = self._prototype " note that prototype == B
endif
call call(prototype.m, [prototype], self)
endfuction
and B's method:
function B.m(...) dict
" local code
" call prototype m()
if a:0 > 0
let prototype = a:1._prototype " note that prototype == C
else
let prototype = self._prototype " note that prototype == B
endif
call call(prototype.m, [prototype], self)
endfuction
This will work, but is rather verbose and developers will forget to do it.
So, as far as I can tell there is no real good solution.
Within the Forms library, which is based upon Self, I tend to simply hard-code a method's prototype within it. This disallows true method inheritance chaining but is simple and concrete.
let g:A = { ... }
function g:A.m() dict
" local code
endfuction
let g:B = { ... }
function g:B.m() dict
" local code
" call prototype m()
let prototype = g:B._prototype " note that prototype == C
call call(prototype.m, [], self)
endfuction
let g:C = { ... }
function g:C.m() dict
" local code
" call prototype m()
let prototype = g:C._prototype " note that prototype == B
call call(prototype.m, [], self)
endfuction
The key for the above to work, is that the Objects, be globals so that where ever the method happens to execute, they can be accessed.
Object Prototype
At the top (bottom) of the Object, prototype, prototype, ,,, chain is the Object Prototype defined in the self.vim file:
let g:self_ObjectPrototype = {
\ '_kind': 'self_ObjectPrototype' ,
\ '_prototype': '' }
Note that this is a global. Its 'kind' is 'self_ObjectPrototype' and its 'prototype' is the empty String, not the empty Dictionary. This is the only object whose prototype is not a Dictionary. In addition to the attributes created explicitly, when the Object Prototype is registered with the Prototype Manager (see below) it is given a Number 'id' (_id) attribute which is unique per object.
Common Attributes
All Objects that the following three attributes:
• kind The kind of Object it is whether the base Object of that kind or a clone of the base Object.
• prototype The Object's parent Object.
• id A unique Number used both as a key by the Managers for Object lookup and for the generation of an Object's String tag (if the tag has not be explicitly set).
When a new Prototype kind is defined, its 'kind' is not the same as its prototype's 'kind'. On the other hand, when a Prototype is cloned, the clone's 'kind' is the same as its prototypes (the Object from which it was cloned). A new Prototype 'kind' has additional attributes and/or methods from its own prototype, else, why define a new Prototype 'kind' - simply clone the prototype.
Common Methods
All Objects that the following public methods:
• init(attrs) Initialize the Object's attributes with the key/values in the attrs argument Dictionary. If the Object has an attribute of the form '__' + 'attributeName' and if 'attributeName' is a key in the attrs Dictionary, then set the attribute to the associated value from the attrs Dictionary.
• getKind() Return the 'kind' of this Object.
• isKindOf(kind) Return 'true' if the Object or any Object in its prototype chain is the same kind as the 'kind' argument and return false otherwise.
• getProtoType() Return the Object's prototype.
• equals(obj) Returns true if Object's 'id' attribute value equals the 'obj' argument's 'id' value (assuming that 'obj' is a Dictionary with attribute 'id').
• super() This seems to simply return the Object's prototype but in a round about manner. Have to determine if if is any different from 'getProtoType()'.
• clone(...) Make a shallow copy of Object.
• delete(...) Perform a shallow delete of Object.
Many times code will simply use 'obj._prototype' rather than 'obj.getProtoType()' since they should be the same thing. Many times code will simply use 'obj._kind' rather than 'obj.getKind()' since they should be the same thing.
Objects and Prototypes
In the Self library there is a distinction between those objects that define a new 'kind' and those that are clones of an existing 'kind'. Of course, a new 'kind' is also a clone of an existing 'kind' but a new 'kind' has a new kind-name. This is rather artificial, but one distinction is important. During a Vim session, new kinds should not be deleted because they are the basis of Objects created for an 'application', While application Objects come and go as an application is run and then stopped. As such, application Objects should be deleted when an application is stopped (and will, most likely, not be run again during a Vim session). This is a matter of garbage collection and memory usage.
So, Objects whose creation define a new kind, additional attributes and method, should not be deleted during a Vim session, but those Objects that are created to make and run an application, should be deleted.
And, that is the distinction between Objects in Self. An Object that, for example, defines a rational number with its 'numerator' and 'denominator' Number attributes as well as methods for addition, subtraction, etc., is a Prototype object. But a clone of this Object which is used as part of an application is simply an Object.
Managers
There are two Object Managers in Self: one stores Prototype objects using their 'id' attribute as a key and the other stores Objects using, again, using their 'id' attributes. When an application has finished running, it should be safe to ask the Object manager to delete all of its Objects. On the other hand, if there is any expectation that the application or another application might be run during a Vim session, then the Prototype object Manager should not have its objects deleted.
The Prototype object Manager assigns unique negative numbers to an Object's 'id' attribute when it is registered. The Object Manager assigns unique positive numbers to Object when they are registered.
Example Usage
In the following example, a rational number Object will be created along with a test function exercising the code. For the code, see Rational1 and Rational2
There maybe many ways to structure code that defines a new Object Prototype kind. Here, two ways will be described.
In both ways, a Dictionary is created that represents the Rational Object Prototype and it has the Object Prototype as its prototype and it has 'kind' self#rational1#Rational (or self#rational2#Rational for the second example). Additionally, it has 'num' and 'den' (numerator and denominator) attributes and a number of additional methods.
To test either way, one can run ':call self#rational1#Test()' and ':call self#rational2#Test()'.
Both ways of organizing the code define Rational Object methods using 'named' functions. The following is an example of the 'named' function approach:
function! SELF_RATIONAL_toString() dict
return (self.__den == 1)
\ ? "" . self.__num
\ : "" . self.__num . "/" . self.__den
endfunction
let g:self#rational1#Rational.toString = function("SELF_RATIONAL_toString")
The name of the Rational Object's 'toString' method is 'SELF_RATIONAL_toString' which corresponds to its namespace plus method name.
In both ways, it is the case that one needs to be able to support the resourcing or reloading of the code during the development process. And, I do not mean: exiting Vim, restarting Vim and then resourcing the file under development or executing autoload via a function call. Rather, some quick, explicit way for a developer to reload the code.
Development Mode Guard
One way of supporting the reloading of the definition of a Rational is to 'unlet' the definition every time the file is sourced when in development mode. In the following selection of code from 'rational1.vim', when the file is re-sourced in development mode, it the Rational Object definition is defined, then it is 'unlet' (undefined). Then in the 'self#rational2#loadRationalPrototype()' function, if the Rational Object is not defined, it is defined. When using this approach, after changes have been made to the file, the developer needs to re-source the file for those changes to be seen.
if g:self#IN_DEVELOPMENT_MODE
if exists("g:self#rational1#Rational")
" force reload of Rational definition
unlet g:self#rational1#Rational
endif
endif
" define Rational
function! self#rational2#loadRationalPrototype()
if !exists("g:self#rational1#Rational")
let g:self#rational1#Rational = self#LoadObjectPrototype().clone('self#rational1#Rational')
" code defining attributes and methods .....
endif
return g:self#rational1#Rational
endfunction
" Rational constructor
function! self#rational1#newRational(attrs)
return self#rational1#loadRationalPrototype().clone().init(a:attrs)
endfunction
This approach was the second way I chose to structure Object code (the first way was quite simply wrong and never saw the light of day). It has the advantage that all the code that defines a Rational is in the 'self#rational2#loadRationalPrototype()' function, Its disadvantage is that it requires the developer to re-source the file, implying that the developer must know where the file is.
It should be noted that this approach was used originally on code that was not 'autoload' ready - all of the code was in the 'plugin' directory and was all sourced on Vim startup.
Self Reload Function
Another way is to use the fact that the code is 'autoload' ready. Here there is a 'reload()' function that calls the Self library 'reload(prefix)' function. This function deletes all functions whose name starts with the given 'prefix'. So, this this case the prefix is 'self#rational2#'. In development mode, one simply executes 'self#rational2#reload()' and code in the file will be reloaded, re-sourced, the next time one of its functions is called.
if !exists("*self#rational2#reload")
if g:self#IN_DEVELOPMENT_MODE
" force reload of Rational definition
function self#rational2#reload()
call self#reload('self#rational2#')
endfunction
endif
endif
" define Rational
let g:self#rational2#Rational = self#LoadObjectPrototype().clone('self#rational2#Rational')
" code defining attributes and methods .....
" Rational constructor
function! self#rational2#new(attrs)
return g:self#rational2#Rational.clone().init(a:attrs)
endfunction
This code does not have the encapsulation of the Rational code that the first approach has, but it is cleaner and clearer.
Fixing VimL
Can VimL be altered so that it natively supports prototype-base Objects? Well, of course, it can. Thats why its called software. So, rather, what would need to be done and how hard would it be?
It has been identified that there is no support for the notion of the current 'prototype' when calling Dictionary functions. There is a notion of current 'self'. As one calls a method up a prototype chain, the 'self' Object does not change but the 'prototype' Object, the Object that has the next method in the chain, does change.
To address this, such methods should have associated with them as part of their data, the Object for which they were initially created. From that Object, its prototype could then be a known object within the method:
let g:A = < ... >
function g:A.m() obj
" local code
" the 'prototype' is the VimL base object (by default)
endfuction
let g:B = g:A< ... >
function g:B.m() obj
" local code
" 'prototype' is g:A since g:B has prototype g:A
" call prototype m()
call call(prototype.m, [], self)
endfuction
let g:C = g:B< ... >
function g:C.m() obj
" local code
" 'prototype' is g:B since g:C has prototype g:B
" call prototype m()
call call(prototype.m, [], self)
endfuction
Above, is a possible way of encoding the notion of Object (rather than Dictionary) and 'prototype' as know name in an Object method. Not saying this is the best way or only way, just an example. The '< ... >' are the same as a Dictionary's '{ ... }' but signify that an Object is being created. And, 'obj< ... >' says that the new object has 'obj' as its prototype. If 'obj' is missing, then VimL's base prototype object is used as the prototype by default. A 'clone' method would also be supported.
There would be a new data type in Vim called Object which is like a Dictionary but supports functions (methods) that have the 'obj' rather than the 'dict' tag associated with them. The 'obj' tag says that there is a 'prototype' local variable (like the 'self' local variable) defined in the context of the function. The declaration of an Object type is like a Dictionary but there 1) has to be a way to distinguish a Object vs Dictionary definition and 2) there has to be a way to declare and optional prototype object.
Also needed is that any of the Object types have an attribute called 'prototype' that holds it prototype object.
The last and much more ambitious change would be to embed a Javascript engine (with modification) in Vim and use it to run the VimL + Objects code.
Jump to Line
Something went wrong with that request. Please try again.
|
{
"url": "https://github.com/megaannum/self/blob/master/tutorial/self/Tutorial.md",
"source_domain": "github.com",
"snapshot_id": "crawl=CC-MAIN-2015-11",
"warc_metadata": {
"Content-Length": "48632",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:BE2G7G26XX73GYW4TZWSQTW6653I2XOQ",
"WARC-Concurrent-To": "<urn:uuid:c473b7cc-5f59-4497-8d46-a0f340a46679>",
"WARC-Date": "2015-03-05T04:38:30Z",
"WARC-IP-Address": "192.30.252.129",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:FOETGKGL2MFRCHO73IG4FQZ2D44ULQMJ",
"WARC-Record-ID": "<urn:uuid:12b025bd-a560-495b-a1ea-00cbd72f5248>",
"WARC-Target-URI": "https://github.com/megaannum/self/blob/master/tutorial/self/Tutorial.md",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:60623ef9-7572-4309-ac29-2ee70aaf3425>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-28-5-156.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2015-11\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web with URLs provided by Blekko for February 2015\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
16,
17,
33,
34,
58,
59,
99,
100,
113,
128,
151,
152,
194,
195,
226,
227,
241,
242,
304,
305,
458,
459,
471,
472,
667,
668,
961,
962,
1443,
1444,
2324,
2325,
2983,
2984,
3287,
3288,
3335,
3336,
3347,
3348,
3356,
3384,
3401,
3412,
3448,
3449,
3460,
3493,
3507,
3518,
3519,
3755,
3756,
4281,
4282,
4303,
4318,
4329,
4330,
4351,
4366,
4389,
4400,
4401,
4422,
4437,
4460,
4471,
4472,
4513,
4514,
4535,
4550,
4573,
4634,
4669,
4680,
4681,
4708,
4709,
4730,
4745,
4768,
4803,
4838,
4849,
4850,
4934,
4935,
4970,
4971,
5183,
5184,
5503,
5504,
5767,
5768,
5792,
5807,
5830,
5843,
5905,
5912,
5976,
6045,
6108,
6116,
6160,
6171,
6172,
6188,
6189,
6213,
6228,
6251,
6264,
6326,
6333,
6396,
6404,
6448,
6459,
6460,
6535,
6536,
6593,
6594,
6781,
6782,
6800,
6823,
6838,
6849,
6850,
6868,
6891,
6906,
6929,
6989,
7024,
7035,
7036,
7054,
7077,
7092,
7115,
7175,
7210,
7221,
7222,
7357,
7358,
7375,
7376,
7497,
7498,
7530,
7591,
7636,
7637,
8029,
8030,
8048,
8049,
8098,
8099,
8201,
8243,
8408,
8409,
8794,
8795,
8810,
8811,
8858,
8859,
9161,
9162,
9210,
9211,
9363,
9364,
9414,
9415,
9575,
9576,
9732,
9733,
9779,
9780,
9832,
9833,
10061,
10062,
10085,
10086,
10788,
10789,
10999,
11000,
11329,
11330,
11339,
11340,
11829,
11830,
12031,
12032,
12046,
12047,
12204,
12205,
12321,
12322,
12662,
12663,
12760,
12761,
12912,
12913,
12953,
12980,
13008,
13055,
13067,
13143,
13144,
13277,
13278,
13623,
13624,
13647,
13648,
14243,
14244,
14274,
14315,
14357,
14393,
14401,
14407,
14408,
14426,
14475,
14517,
14613,
14614,
14663,
14664,
14672,
14673,
14708,
14720,
14721,
14744,
14788,
14858,
14870,
14871,
15263,
15264,
15444,
15445,
15466,
15467,
15919,
15920,
15957,
15989,
16031,
16069,
16111,
16127,
16135,
16141,
16142,
16160,
16252,
16253,
16298,
16299,
16322,
16358,
16415,
16427,
16428,
16551,
16552,
16564,
16565,
16759,
16760,
17091,
17092,
17308,
17309,
17327,
17348,
17363,
17420,
17431,
17432,
17453,
17474,
17489,
17540,
17563,
17598,
17609,
17610,
17631,
17653,
17668,
17719,
17742,
17777,
17788,
17789,
18289,
18290,
18810,
18811,
18924,
18925,
19073,
19074,
19087
],
"line_end_idx": [
16,
17,
33,
34,
58,
59,
99,
100,
113,
128,
151,
152,
194,
195,
226,
227,
241,
242,
304,
305,
458,
459,
471,
472,
667,
668,
961,
962,
1443,
1444,
2324,
2325,
2983,
2984,
3287,
3288,
3335,
3336,
3347,
3348,
3356,
3384,
3401,
3412,
3448,
3449,
3460,
3493,
3507,
3518,
3519,
3755,
3756,
4281,
4282,
4303,
4318,
4329,
4330,
4351,
4366,
4389,
4400,
4401,
4422,
4437,
4460,
4471,
4472,
4513,
4514,
4535,
4550,
4573,
4634,
4669,
4680,
4681,
4708,
4709,
4730,
4745,
4768,
4803,
4838,
4849,
4850,
4934,
4935,
4970,
4971,
5183,
5184,
5503,
5504,
5767,
5768,
5792,
5807,
5830,
5843,
5905,
5912,
5976,
6045,
6108,
6116,
6160,
6171,
6172,
6188,
6189,
6213,
6228,
6251,
6264,
6326,
6333,
6396,
6404,
6448,
6459,
6460,
6535,
6536,
6593,
6594,
6781,
6782,
6800,
6823,
6838,
6849,
6850,
6868,
6891,
6906,
6929,
6989,
7024,
7035,
7036,
7054,
7077,
7092,
7115,
7175,
7210,
7221,
7222,
7357,
7358,
7375,
7376,
7497,
7498,
7530,
7591,
7636,
7637,
8029,
8030,
8048,
8049,
8098,
8099,
8201,
8243,
8408,
8409,
8794,
8795,
8810,
8811,
8858,
8859,
9161,
9162,
9210,
9211,
9363,
9364,
9414,
9415,
9575,
9576,
9732,
9733,
9779,
9780,
9832,
9833,
10061,
10062,
10085,
10086,
10788,
10789,
10999,
11000,
11329,
11330,
11339,
11340,
11829,
11830,
12031,
12032,
12046,
12047,
12204,
12205,
12321,
12322,
12662,
12663,
12760,
12761,
12912,
12913,
12953,
12980,
13008,
13055,
13067,
13143,
13144,
13277,
13278,
13623,
13624,
13647,
13648,
14243,
14244,
14274,
14315,
14357,
14393,
14401,
14407,
14408,
14426,
14475,
14517,
14613,
14614,
14663,
14664,
14672,
14673,
14708,
14720,
14721,
14744,
14788,
14858,
14870,
14871,
15263,
15264,
15444,
15445,
15466,
15467,
15919,
15920,
15957,
15989,
16031,
16069,
16111,
16127,
16135,
16141,
16142,
16160,
16252,
16253,
16298,
16299,
16322,
16358,
16415,
16427,
16428,
16551,
16552,
16564,
16565,
16759,
16760,
17091,
17092,
17308,
17309,
17327,
17348,
17363,
17420,
17431,
17432,
17453,
17474,
17489,
17540,
17563,
17598,
17609,
17610,
17631,
17653,
17668,
17719,
17742,
17777,
17788,
17789,
18289,
18290,
18810,
18811,
18924,
18925,
19073,
19074,
19087,
19144
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 19144,
"ccnet_original_nlines": 327,
"rps_doc_curly_bracket": 0.0006268299766816199,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.3813210725784302,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022501809522509575,
"rps_doc_frac_lines_end_with_ellipsis": 0.009146340191364288,
"rps_doc_frac_no_alph_words": 0.2421969473361969,
"rps_doc_frac_unique_words": 0.22157533466815948,
"rps_doc_mean_word_length": 4.958904266357422,
"rps_doc_num_sentences": 221,
"rps_doc_symbol_to_word_ratio": 0.017178799957036972,
"rps_doc_unigram_entropy": 5.430291652679443,
"rps_doc_word_count": 2920,
"rps_doc_frac_chars_dupe_10grams": 0.022237569093704224,
"rps_doc_frac_chars_dupe_5grams": 0.10338398069143295,
"rps_doc_frac_chars_dupe_6grams": 0.0741712674498558,
"rps_doc_frac_chars_dupe_7grams": 0.06588397920131683,
"rps_doc_frac_chars_dupe_8grams": 0.04958564043045044,
"rps_doc_frac_chars_dupe_9grams": 0.02941988967359066,
"rps_doc_frac_chars_top_2gram": 0.005870169959962368,
"rps_doc_frac_chars_top_3gram": 0.008977900259196758,
"rps_doc_frac_chars_top_4gram": 0.009392269887030125,
"rps_doc_books_importance": -2268.949462890625,
"rps_doc_books_importance_length_correction": -2268.949462890625,
"rps_doc_openwebtext_importance": -1455.7398681640625,
"rps_doc_openwebtext_importance_length_correction": -1455.7398681640625,
"rps_doc_wikipedia_importance": -1031.2685546875,
"rps_doc_wikipedia_importance_length_correction": -1031.2685546875
},
"fasttext": {
"dclm": 0.09665930271148682,
"english": 0.9036611914634705,
"fineweb_edu_approx": 2.7184062004089355,
"eai_general_math": 0.9753111600875854,
"eai_open_web_math": 0.4498516321182251,
"eai_web_code": 0.9669098258018494
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.435",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "4",
"label": "Code/Software"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "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": "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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-3,226,615,351,661,482,500 |
The Age When You Freeze: Understanding the Implications and Tradeoffs
The Advantages & Disadvantage to Freezing Eggs At Different Ages
Age is a crucial component of egg freezing because of three main issues: it impacts (1) the likelihood your eggs will work if you need them; (2) the number of cycles you’ll end up wanting to to do; and (3) the likelihood that you’ll ever need to use the eggs you froze.
One caveat: we use the words “younger” and “older” only in the context of a woman’s general window of fertility. “Younger” generally refers to women who are in their mid-30’s and younger, and “older” referring to women who are in their late 30’s and beyond. We realize that the fertility field is probably the only realm in which “older” would be used for that category.
Here’s the Catch-22 of egg freezing, as it applies to age specifically:
The younger you are, the more likely you’ll be to
• Retrieve a large number of eggs
• Need fewer eggs to achieve a healthy pregnancy
• Feel happy with your results after one cycle
• Conceive naturally without ever needing to use the high quality eggs you’ve stored
The older you are, the more likely you’ll be to
• Retrieve a smaller number of eggs
• Need a high number of eggs to achieve a healthy pregnancy
• Feel the need to do multiple cycles to get a result you’re happy with, which takes more time and money
• Need to come back and use your eggs to conceive
Strengths and Weaknesses of Age and Egg Freezing
Thus, generally speaking, young women who freeze their eggs are more likely to have eggs worth freezing, but are less likely to need them. Older women are more likely to rely on their frozen eggs but often must do more cycles for their frozen eggs to be useful.
How Many Eggs Will You Get & Need At Different Ages?
Below is one study that illustrates this concept. A Spanish center broke down the live birth rates for women who froze their eggs and returned back to use them -- results are displayed based on the age at which a woman froze her eggs, and how many eggs she stored at the time.
This study has its flaws, but in our minds, it’s the best information we have available today. The study represents the largest sample of outcomes from women who chose to electively freeze their eggs. The shortcomings include: a small sample size (300 patients), the data is from a single center, and the age brackets (35 and younger vs. 36 and older) are crude. Thus, it’s hard to say how generalizable these observations are to all patients.
You’ll see that women who froze 10 eggs by the age of 35 had nearly double the rates of successful pregnancies compared with women who froze the same number of eggs at 36 or older.
What’s more, it becomes much less likely for “older” (age 36 and beyond) women to capture those 10 eggs in a single cycle, as evidenced by data below from a clinic in New York showing how many eggs were retrieved by age.
Thus, an advantage to freezing one’s eggs younger is that what she collects in each retrieval is more likely to be sufficient to lead a live birth.
The Possible Downside of Pushing For the Maximum Number of Eggs
Naturally, patients want to retrieve more eggs and, for this reason, many push their doctor to prescribe higher doses of hormones or to delay their retrieval another day. It’s unclear if these tactics increase the number of useful eggs (often only mature eggs can be frozen) and may well come with risks, namely over stimulating the woman into a state of OHSS (see our lesson on “The Risks of Egg Freezing”), or maturing the eggs too much.
How Often Patients Really Use Their Eggs
According to the two largest studies available, women who froze their eggs have, so far, returned back to use them in only about 10% of cases.
Today our data tells us that the women who froze their eggs in their late 30’s have most frequently returned back to use their eggs, and they do so an average of two years after they were frozen. The belief is that these women had a strong sense they would need their eggs by the time they choose to bank. Thus, older women who freeze seem more likely to actually use their eggs.
How often do women who froze their eggs at younger ages return? For the moment, it seems far less often. The conventional wisdom is that these women may choose to freeze, then find a partner and manage to conceive naturally. But whether this is actually the case is unknown -- we need more time for these younger freezers to mature and to see if they return back at later ages to use their eggs. We simply haven’t been doing elective egg freezing for long enough to know the answer.
This is the principle reason that younger women are advised against doing egg freezing. However, you need to calibrate whether this is a sufficient reason not to freeze your eggs. Some women will freeze their eggs in the remote chances they are needed, and if they conceive naturally, are still pleased with the decision. Other women may be unhappy if they invested the time and money into egg freezing and ultimately never use their eggs.
Of course, there are some women who seem far more likely to ultimately need to use IVF, and are therefore more likely to eventually use and benefit from frozen eggs. This may become apparent even at a young age. This list includes women who have:
• Blocked fallopian tubes (from a history of STD’s or any other reason)
• A partner with male factor infertility
• Reason to believe they have endometriosis
• A family history of early menopause
• A history of ovarian cyst rupture
• Have a genetic disorder that they want to screen for
• Reason to believe they’ll use a sperm donor later on
• A lesbian relationship and may want to do “reciprocal IVF” at some point
• A male partner who has been treated for cancer, so they expect to use frozen sperm
If you believe you’ll eventually need to do IVF, you’d far prefer to be doing it with younger eggs. Below is data on how women with younger eggs fare significantly better in the IVF process.
Thinking About Your Complete Family Building Goals
One thing we believe is often overlooked in this discussion is what a woman’s family building goals are. In many senses the question is not whether she’ll be able to conceive her first child naturally, but whether she’ll be able to conceive her last child naturally. If the answer is no, and ultimately she resorts to doing IVF, then she’d certainly prefer to undergo fertility treatment using her frozen, younger eggs.
The reality is that a third of IVF patients are in treatment due to secondary infertility (meaning they’ve already had a child and now they’re trying to conceive again).
For example, a woman might get married at 35 and be perfectly fine conceiving her first child at 37. But it’s entirely possible that she’ll have a harder time if she wants to conceive again at 39 or 40. In which case, she’d rather be starting fertility treatment with her younger eggs than her eggs at 39 or 40. As you saw in the chart above, IVF with 32 year olds eggs has a nearly 50% success rate. IVF with 39 - 40 year old eggs is successful less than half as often.
Egg Freeze Family Building
The same holds true for women even at later ages. For example, if a woman gets married at 39, and wants to conceive at 40, it’s possible that she’ll get pregnant naturally. But trying again at 42 or 43 makes the odds lower that she’ll be successful on her own, so she might want the option of using eggs she froze earlier.
Does The Argument That You’re Freezing “Too Late” Make Sense?
We often hear people refer to women freezing “too late” as “preserving infertility” rather than “preserving fertility.” We think the assumption that freezing eggs at, say, 40 is a “waste” likely rests on an unhelpful comparison. Sure, if a woman freezes at 40 instead of 30, she won’t have the same likelihood of success. But, if a woman feels that she would use IVF in the future if she has difficulty conceiving, as you can see below, then she would be much better off using those frozen 40-year-old eggs in comparison to her later 42-year-old or 44-year-old eggs.
So, again, this is personal. Consider whether you think you’d be willing to try IVF in the future with your own eggs if you have trouble conceiving. If the answer is yes, then freezing at a relatively older age can still make sense.
Costs Differ With Age
The amount of money that you’ll spend on freezing your eggs and storing them can vary drastically based on which age when you decide to freeze. We’ll cover this in great detail in our next lesson on cost, but at a very high level: younger patients will likely have lower up-front fees on medical expenses and drugs but they’ll rack up larger storage bills over time; older patients will likely have higher up-front fees on medical expenses in the form of more cycles and higher drug doses, but they'll likely spend less on years of storage.
Next
Lesson Plan
|
{
"url": "http://assets3.fertilityiq.com/courses/egg-freezing/the-age-when-you-freeze-understanding-the-implications-and-tradeoffs",
"source_domain": "assets3.fertilityiq.com",
"snapshot_id": "crawl=CC-MAIN-2019-09",
"warc_metadata": {
"Content-Length": "63526",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WBCDZZXB22OPCEM2ALJTARYVMVZ7FRVR",
"WARC-Concurrent-To": "<urn:uuid:d292c6fc-638e-4852-8155-442998347ee3>",
"WARC-Date": "2019-02-20T01:24:04Z",
"WARC-IP-Address": "99.84.181.111",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:E46U6THGMKL4GC4FMZSFJ5GO4EMOA3MT",
"WARC-Record-ID": "<urn:uuid:93d63df6-2607-4768-aa3b-9f06310d687c>",
"WARC-Target-URI": "http://assets3.fertilityiq.com/courses/egg-freezing/the-age-when-you-freeze-understanding-the-implications-and-tradeoffs",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:05baca3b-1483-4038-8c0a-136e97773e68>"
},
"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-154-78-3.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,
70,
71,
136,
137,
407,
408,
779,
780,
852,
853,
903,
904,
940,
991,
1040,
1127,
1128,
1176,
1177,
1215,
1277,
1384,
1436,
1437,
1490,
1491,
1757,
1758,
1811,
1812,
2089,
2090,
2534,
2535,
2716,
2717,
2938,
2939,
3087,
3088,
3152,
3153,
3154,
3594,
3595,
3636,
3637,
3780,
3781,
4161,
4162,
4645,
4646,
5086,
5087,
5334,
5335,
5409,
5410,
5453,
5454,
5500,
5501,
5541,
5542,
5580,
5581,
5638,
5639,
5696,
5697,
5774,
5775,
5862,
5863,
5864,
6055,
6056,
6107,
6108,
6528,
6529,
6699,
6700,
7171,
7172,
7173,
7200,
7523,
7524,
7586,
7587,
8154,
8155,
8388,
8389,
8411,
8412,
8953,
8954,
8959
],
"line_end_idx": [
70,
71,
136,
137,
407,
408,
779,
780,
852,
853,
903,
904,
940,
991,
1040,
1127,
1128,
1176,
1177,
1215,
1277,
1384,
1436,
1437,
1490,
1491,
1757,
1758,
1811,
1812,
2089,
2090,
2534,
2535,
2716,
2717,
2938,
2939,
3087,
3088,
3152,
3153,
3154,
3594,
3595,
3636,
3637,
3780,
3781,
4161,
4162,
4645,
4646,
5086,
5087,
5334,
5335,
5409,
5410,
5453,
5454,
5500,
5501,
5541,
5542,
5580,
5581,
5638,
5639,
5696,
5697,
5774,
5775,
5862,
5863,
5864,
6055,
6056,
6107,
6108,
6528,
6529,
6699,
6700,
7171,
7172,
7173,
7200,
7523,
7524,
7586,
7587,
8154,
8155,
8388,
8389,
8411,
8412,
8953,
8954,
8959,
8970
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 8970,
"ccnet_original_nlines": 101,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.46309080719947815,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.009559210389852524,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14816781878471375,
"rps_doc_frac_unique_words": 0.31569117307662964,
"rps_doc_mean_word_length": 4.422789573669434,
"rps_doc_num_sentences": 59,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.461256504058838,
"rps_doc_word_count": 1606,
"rps_doc_frac_chars_dupe_10grams": 0.010981280356645584,
"rps_doc_frac_chars_dupe_5grams": 0.06645079702138901,
"rps_doc_frac_chars_dupe_6grams": 0.03547796979546547,
"rps_doc_frac_chars_dupe_7grams": 0.029846539720892906,
"rps_doc_frac_chars_dupe_8grams": 0.020836269482970238,
"rps_doc_frac_chars_dupe_9grams": 0.010981280356645584,
"rps_doc_frac_chars_top_2gram": 0.014641700312495232,
"rps_doc_frac_chars_top_3gram": 0.01013655960559845,
"rps_doc_frac_chars_top_4gram": 0.01013655960559845,
"rps_doc_books_importance": -833.1915893554688,
"rps_doc_books_importance_length_correction": -833.1915893554688,
"rps_doc_openwebtext_importance": -497.94744873046875,
"rps_doc_openwebtext_importance_length_correction": -497.94744873046875,
"rps_doc_wikipedia_importance": -433.1159362792969,
"rps_doc_wikipedia_importance_length_correction": -433.1159362792969
},
"fasttext": {
"dclm": 0.07914888858795166,
"english": 0.9688572883605957,
"fineweb_edu_approx": 2.7209646701812744,
"eai_general_math": 0.320847749710083,
"eai_open_web_math": 0.25663745403289795,
"eai_web_code": 0.06345409154891968
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "618.122",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Women — Health and hygiene, Children — Health and hygiene, Gynecology, and Pediatrics"
}
},
"secondary": {
"code": "618.12",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Women — Health and hygiene, Children — Health and hygiene, Gynecology, and Pediatrics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "4",
"label": "Analyze"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "23",
"label": "Tutorial"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-71,085,250,061,197,080 |
Isolated Systolic Hypertension In Pregnancy
Last updated 2023-09-18
Average Blood Pressure isolated systolic hypertension in pregnancy How To Lower Blood Pressure In Minutes, low body temp and blood pressure.
Face but it was such a little white face that quickly obtained the code name by virtue of his thigh johnnie walker and became a member of the organization gee hide the.
Like a birthday celebration after testing getting the code name and lying in his room akai shuichi still felt that things were fantastic he pondered over his new code name.
That he was indeed a member of an evil organization and that trivial sense of familiarity at the first sight of johnnie walker was summed up by him as one of the johnnie.
Handkerchief and wiped his hands slowly in a short time when he cleaned his body his subordinates were ready about the information that the dying person confided.
Discovering a strange blind spot sawada tsunayoshi heard the other party continue to say in a strange tone you don t have to it s normal to worry about usproper.
A lot of cfr 38 hypertension fame in the organization at this time and had already obtained a code name he was still weak against the second in command of the organization and he was the only.
Over there will disappear directly that is another question however at that time rum sneered unabashedly isolated systolic hypertension in pregnancy exhaled the smoke of the cigar from his mouth and once again.
Been running smoothly since s unilaterally contacted him to determine the form mr liaison would have been trembling about whether such a simple form would be discovered.
Given directly also became a choice the young man couldn t help but twitched the corner of his mouth looked again at the corner that no one cared about and blood pressure how to lower top number bought a copy to.
School students who are about to go on a spring outing thinking like this he decided to kill mr godfather who turned a blind eye to the two subordinates fight with open.
And quickly flashed the information he had in his mind with a look that was logically overdone to a mixture of fear and ecstasy and he isolated systolic hypertension in pregnancy opened his mouth to say what does it mean when ur blood pressure is low the words of.
Undercover plan revealed by a isolated systolic hypertension in pregnancy guy in the same period of his own who later became the liaison of the undercover people although it was very outrageous s caught a code named.
Being liked by men it is more likely that both men and women will kill each other it s high zhu xingda the godfather who seemed to be really thinking about it looked at him.
Know so much that he will not be assassinated however the reliable scottish he has a steady appearance and even low body temp and blood pressure Signs Of Low Blood Pressure when his boss says he is excited he will hand over tomato.
Came up with the name he said how about it can t it it s not a question of whether it s okay or not pseudo the problem of pretending to be exposed and being like a rat.
The people I met was not very good high blood pressure and alzheimer s but curiosity defeated the guilty conscience so the little girl asked her little friend in a very low voice and gestured a big brother.
Face it s gin recalling that the boss told him that the other party had a good personality the young man couldn t help but wonder whether it was himself or the boss who.
Member isolated systolic hypertension in pregnancy of an evil criminal organization after living in the safe house for .
What Are The Dangers Of High Systolic Blood Pressure ?
low body temp and blood pressure Diastolic Blood Pressure Blood Pressure Chart By Age isolated systolic hypertension in pregnancy Moneygment. so long the most thing he does is go out alone and play with the little girl codenamed shirley.
Only participate in he looked a little weak which was completely opposite to the image he usually showed on the training ground or in front of other people bourbon s.
Laughed he put a finger in front of his lips and bent his eyes slightly very deceiving secrets I would have been happier if you had told your secrets italy west in siri a.
From here at night what s the use of vicious guys what are they doing with the open roof are you ready for the hail of bullets falling from the sky no one knew no one asked.
And sent it to bourbon and zhu xingda took him isolated systolic hypertension in pregnancy to visit in the room this is a very japanese style small single family house which is somewhat close to sawada tsunayoshi s.
Successfully solved and gangji and the two were able to return to their box with this episode the conversation just now is not easy to continue sawada tsunayoshi low blood pressure in elderly person and akai.
Only did he not show fear he even he praised kudo shinichi for being vigilant rubbed the black haired .
Why Is My Blood Pressure Higher When I Sit Up ?
isolated systolic hypertension in pregnancy What Is A Good Blood Pressure, How To Lower High Blood Pressure low body temp and blood pressure Blood Pressure Chart By Age. boy s head and turned his head under the gaze of shuichi akai who didn.
Gently with a kind .
Can High Blood Pressure Cause Testicular Pain
Blood Pressure Range isolated systolic hypertension in pregnancy Moneygment low body temp and blood pressure Low Blood Pressure Chart. of nostalgia like light in his eyes which fell into the eyes of the two fighting bad guys and then I don t know what they will think but he s still.
Pendant vodka sawada tsunayoshi glanced at the honest and honest vodka and felt that the gin as expected of jinjiu he had isolated systolic hypertension in pregnancy Low Blood Pressure Treatment long anticipated the isolated systolic hypertension in pregnancy chaos that many subordinates.
Was not addressed to bourbon akai shuichi looked over bourbon s shoulder and looked at the door that came out the brown haired youth asked with a gesture of showing.
Think in my heart mom gin really doesn t deceive me after a few days of running before and after running in scotland and staying in a warm and comfortable safe house.
He paused and said meaningfully I ve heard the name for a long time according to the rumor johnnie walker the little white face mr when he was caught by gin at the training.
Standing at the door behind him zero and a guy he didn t know were squeezing each other this scene was like a babysitter taking two troubled children scot with a sandwich.
Not knowing what he was thinking and suddenly laughed I see he pushed open the window to let the sun in on the cause in the room that was sealed by thick curtains when the.
The other party is very suitable for sniping and scotland who happens to be a sniper recently is fine so he will bring it with him during training the great entrance to all.
In yet he said sawada tsunayoshi also blinked scotland looked at him with an expression that was similar to the expression on the empty Good Blood Pressure For Women low body temp and blood pressure dormitory when you were alone many.
Slowly and walked to the balcony puffing slowly automatically hides when the two bosses chat teja colorfully brought them coffee and biscuits in and then crept away after a.
Words fell akai shuichi didn t have time to speak when he heard a small exclamation from behind him wow shinichi is the big brother just inviting another big brother to the.
Ascending just like bourbon and scotland the former follows the path of rum and the latter follows the path of gin so that they can join the large scale events in the.
Gestured scotland pondered for a while and said a few flavors all of which were denied by sawada tsunayoshi it s either aromatherapy or it s a very ordinary smell isolated systolic hypertension in pregnancy that you.
He doesn t have hypertension due to smoking that much sympathy probably and has been dealing with his cats and dogs since then the dog s quarrel every now and then he wonders how to reconnect with his.
Mission completed received come back tonight to choose a code name looking at the words that the other party replied almost instantly the code name that was said to be.
S just a mere gem how can it be worth it what about your face the other party was finally pleased isolated systolic hypertension in pregnancy and left with a smile after dealing with this ancestor who even gin was.
And he started from the arms business which was once rejected by the japanese political circles but money can make ghosts run the mill the huge gray business has given the.
Not know its existence after showing the invitation letter and entering the cruise ship rao is sawada tsunayoshi who is not very familiar with japan recently politicians.
Excitedly raised his head and stared at him as if he hadn t seen the boss isolated systolic hypertension in pregnancy in a century his red pupils were curved and the gem like pupils could only accommodate the.
Money to build a safe house without having to pay harpagophytum et hypertension for it mr godfather watched the two of them sit down graciously always feeling that the atmosphere was a bit strange that.
Serving the organization does not seem to have such a sense of avoiding child labor tsunayoshi sawada could feel bourbon s eyes falling on him mixed with scrutiny and other.
Each season she seemed like a walking dead only when she saw miyano akemi and sucked enough of her eldest sister could she come back to life again see you seeing that.
Is something dissatisfied sawada tsunayoshi cleared his expression and scratched his cheek a little embarrassedly no he does medicare cover high blood pressure monitors paused saying that he started to think that his.
Able to become good friends but it shouldn t be too much he emphasized that when he was in venglie the poor training room that was destroyed because of senior skylark and.
Cares dali did not act in the name of an organization but the title of the individual decimo was the first to be played in italian it refers to the number ten and if it is.
I isolated systolic hypertension in pregnancy was having breakfast with love I saw two subordinates with dark fluctuating high and low blood pressure circles under their eyes mr godfather hesitated did you fight at night he asked from experience a strange.
And the footsteps of the elder smoking with low blood pressure brother behind him and the forehead could not help oozing out big drops of sweat johnnie walker went out to play with his eldest brother on.
Would have in a normal home the brown haired youth lowered his head and shrugged the tip of his nose there is a little bit of this in the room kind of taste but not obvious.
With a warm heart jiang guling hesitated in silence thinking about where to go next in the dark night in farther places there are also people who can t sleep poor mr.
Eliminated this kind of problem requires .
Does Taking Fish Oil Reduce High Blood Pressure ?
isolated systolic hypertension in pregnancy
Q&A
Is 183 84 High Blood Pressure ?Healthy Blood Pressure Range low body temp and blood pressure, isolated systolic hypertension in pregnancy Good Blood Pressure What Is Considered Low Blood Pressure.
Is 143 Over 77 Considered High Blood Pressure ?Healthy Blood Pressure Range low body temp and blood pressure, isolated systolic hypertension in pregnancy Good Blood Pressure What Is Considered Low Blood Pressure.
Does High Blood Pressure Cause Dizziness When Standing ?isolated systolic hypertension in pregnancy What Is A Good Blood Pressure, How To Lower High Blood Pressure low body temp and blood pressure Blood Pressure Chart By Age.
Does Anemia Lead To High Blood Pressure ?Average Blood Pressure isolated systolic hypertension in pregnancy How To Lower Blood Pressure In Minutes, low body temp and blood pressure.
low body temp and blood pressure Diastolic Blood Pressure Blood Pressure Chart By Age isolated systolic hypertension in pregnancy Moneygment. two people to be willing to reconcile so gangji did not atenolol low blood pressure stop them but acquiesced to the two people who chose the competition.
For andrea who has left the organization so he just let it go does parkinson s cause high blood pressure sawada tsunayoshi isolated systolic hypertension in pregnancy Low Blood Pressure Treatment frowned it has nothing to do with him he explained frowning andreathat s martinez he was.
Subtle expression flashed by behind him bourbon who had gone and returned hid behind the door of the upper deck and the cat stuck out a head looked at this side vigilantly.
Parents of the children sawa tian tsunayoshi even got an what foods will help pulmonary hypertension autograph from yusaku kudo the last time he seemed to have seen novan reading each other s novels in the study and.
Aware of this behavior akai hideyoshi seen the senior on the paper file not to mention age according to the time he served for the fbi the other party is indeed his senior.
Swords and dark arrows to finish off his delicious hamburger and wiped the corners of his mouth reservedly don t worry he comforted the two of them gently it s just an.
Haired youth hesitated how did you come up with pulmonary hypertension and liver disease that he said in distress it s probably because it s fun as an undercover agent he became uncomplicated hypertension treatment the leader s most trusted guy so he.
This kind of request still has a good chance of success it s because of johnnie .
Can Zicam Be Taken With High Blood Pressure
Average Blood Pressure isolated systolic hypertension in pregnancy How To Lower Blood Pressure In Minutes, low body temp and blood pressure. walker isolated systolic hypertension in pregnancy I didn t care about the organization as much as I thought even his code named member.
Fbi was a little hesitant and only came to a single conclusion contradictory guy he considered it for a while then said sideways do you like children this question made.
Her handover time so tsunayoshi and akai in the box became her best friends the contact object after and and misato just recently broke up with her boyfriend best yoga for low blood pressure that person.
This made scotland laugh he pinched his chin and thought johnnie walker what kind of goals for hypertension patients room do you want he asked that s a really good question sawada tsunayoshi hesitated.
His fingers and his expression became excited I couldn t help but click on the recorded text message again it was the frantic voice of the gentle and graceful young man but.
Placed in the italian world it will bring another layer of meaning tenth generation old families with long histories would use numbers like this to call him their leader so.
With troubled children terrible is he johnnie walker he slumped back lazily on the sofa his long arms stretched out a rare gesture of relaxation bo the thing that ss asked.
That guy said he s a total lunatic but it s better to use than most of the crap in the organization and probably because there was no change on the surface in italy that.
Couldn t help but sniff and found that familiarity that he had felt since he saw scotland the source of the feeling almost the next moment I must sincerely high blood pressure cause chills call out what i.
Dimensional flavor a young man with black hair looked at the pink magazines published in the corner and the big books above word indifferently took a photo and sent it out.
Attention of the other party then raised his head and made a provocative mouth except for the face no one could bear it but akai shuichi is not an ordinary person before.
Change locations to buy new clothes but it didn t work .
Can High Blood Pressure Cause You To Not Sleep Well
Healthy Blood Pressure Range low body temp and blood pressure, isolated systolic hypertension in pregnancy Good Blood Pressure What Is Considered Low Blood Pressure. out they didn t even have a store isolated systolic hypertension in pregnancy can go out in a square not far away a man wearing a black hood with only two noses.
Bullied by nuovan after they pass for reasons like boss carrying the little wild cat I was looking for outside on his back and other reasons hey the hairstyle I just did.
Don t think this big brother has anything isolated systolic hypertension in pregnancy to do with this incident said the black head the policeman bowed his head and smiled suddenly it s you he looked very familiar.
Look and walked away the young man by his side the feeling that the other party brought to him was still very dangerous no matter how gentle and elegant the appearance was.
Difficult to recognize the lip shape at such a distance he looked at johnnie walker s relaxed posture and the young tame dyeing there is more than performance after all.
Life was held on a cruise ship and its current owner is tomizawa eiji the son of the tomizawa family of japanese consortium it is said to be a consortium but in fact the.
Numerous and complicated information and then every other paragraph pass back in time and it is also one way so that he does not know the next action of the public security.
Last month fortunately after isolated systolic hypertension in pregnancy two months of disconnection he received a letter from s again he exhaled slowly and after a brief investigation of the left and right he.
Of he was so angry that he wrapped himself and sat on the other side looking out of the window angrily even what he was going to say to gin forget it vodka watched their.
Detective named kudo shinichi and felt that he was the real one he recalled how the other party got along with another child of about the same age shirley the genius.
Even more but vodka is wronged vodka can t say not only that but facing his big brother who was sitting in the back seat and didn t know what was going on he had to show.
After coming down the undercover agent in charge of the other contacts always had various .
What Specialist Treats High Blood Pressure
Blood Pressure Range isolated systolic hypertension in pregnancy Moneygment low body temp and blood pressure Low Blood Pressure Chart. problems but the s he was in charge of was always as stable as an old dog until.
Be mind raised vigilance but there was still a smile on his face sawada tsunayoshi entered the safe house with Good Blood Pressure For Women low body temp and blood pressure two guys who looked like cats and dogs who didn t deal .
Can An Enlarged Spleen Cause High Blood Pressure
Blood Pressure Range isolated systolic hypertension in pregnancy Moneygment low body temp and blood pressure Low Blood Pressure Chart. with.
Gunpowder and cigarettes came in that case he is more like bestar than jiro besta is the box weapon of his theoretical uncle xanxus the leader of varian s assassination.
Still on the light .
Is Propranolol Used For High Blood Pressure ?
Blood Pressure Range isolated systolic hypertension in pregnancy Moneygment low body temp and blood pressure Low Blood Pressure Chart. lit up revealing a letter that had not yet been sent I seem to have met the senior .
Can You Pass Out If Your Blood Pressure Is High ?
isolated systolic hypertension in pregnancy What Is A Good Blood Pressure, How To Lower High Blood Pressure low body temp and blood pressure Blood Pressure Chart By Age. .
How Common Is High Blood Pressure In Australia ?
low body temp and blood pressure Diastolic Blood Pressure Blood Pressure Chart By Age isolated systolic hypertension in pregnancy Moneygment. you liked very much but I forgot to ask for your autograph for you.
Expression appeared on the faces of the two bottles of wine so he exhaled isolated systolic hypertension in pregnancy it s not like fighting oh no even if even if there is a fight there is an organization that gives.
Hand and then handed it back but I d rather see you in the bar than in the room the brown haired youth raised his eyes and his warm brown pupils revealed an irresistible.
Fuze family wealth and ambition and it has also given them tickets to enter the political isolated systolic hypertension in pregnancy world through the unremitting efforts of three generations for nearly a hundred.
Those political clans with noble origins and a long history the fuze family belongs to so the rising star the wealth of the founder of the fuze family is not good looking.
Molars at the same time a hand came over .
Can High Blood Pressure Cause Blood Clots ?
Blood Pressure Range isolated systolic hypertension in pregnancy Moneygment low body temp and blood pressure Low Blood Pressure Chart. from behind and pressed his shoulder someone tapped scotland on the shoulder bladder a sharp light flashed in the black does propranolol help high blood pressure haired.
Organization that is still interested in gems ah no maybe there is mr godfather thought for a while and looked at gin with a subtle expression it won t be rum the silver.
Followed gem pandora pandora is the legendary gem it is hypertension and smoking said that there is a comet baoley that approaches the earth once every 10 000 years when the comet approaches the.
And noticed that he looked over and showed some pitiful expressions expression are you some strange animal come over if you want the same expression don t worry scotland.
For me I ll be fine soon is a cute little child duo however even children are very capable children sawada tsunayoshi who was ruled out of suspicion but was no longer in.
Feng tai who was in a big book was silent for a bottom number of blood pressure low meaning while finally he lowered his eyes and smiled softly of course he said softly with cherished nostalgia in his eyes the adults.
Tsunayoshi sat alone from the training ground and passed by passing low blood pressure and longevity by he pinched his chin in the car that took him back to gin if he hadn isolated systolic hypertension in pregnancy t seen the police he would have.
That of him and johnnie walker who met for the first time therefore according to johnnie walker s preferences what can i drink to lower my blood pressure immediately probably a little bit of weakness is exposed johnnie walker.
Training whistled keen a more low key companion followed behind her clutching her hat and nodded with gangji they are a team commonly used by gin in japan so they have met.
Can you sleep at your age mr liaison sat up excitedly sawada tsunayoshi did not know what happened to his subordinates the next day he sat at the table and ate scotch when.
Because of the long standing opposition to rum in the camp and isolated systolic hypertension in pregnancy the natural alliance with johnnie walker mr topkiller of the organization is very happy about it see it done.
Known each other from the beginning they still have to create an appearance in the organization that they have just met and are still gradually running in from the.
Still undercover agents around me one two three and four five and six and I was also very broken okay gin didn t really want to know what the guy beside him was thinking he.
Conscience he took care of her shiho chan doesn t have to worry about such a small problem he said gently straightening the other person s hair how is it is the new.
Alone but even without saying a word sawada tsunayoshi frowned slightly putting it another way at the age of two children they looked like they were only about eleven or.
The organization and he has never done such a thing after all in italy whether it is an organization or other he is a local snake and he has no rules the frame can be.
Looked like he would how do hypertension affect the body join the organization even if he touched porcelain and even ten cows couldn t pull it back and he called him boss since he called him boss and he was.
The same expression as usual he could only take advantage of the elder brother to close his eyes and take a nap carefully glance at each other through his sunglasses vodka.
To have entered the organization low body temp and blood pressure Signs Of Low Blood Pressure through johnnie walker s back door and was introduced everywhere by the other party except for the rumored johnnie walker there is no other.
But tsunayoshi sawada who really took this trip back to japan as a holiday didn t care much about things in italy and only received information from novan that everything.
Chance even if this kind of request is a bit more contrived according to the character of the other party he has learned from getting along with johnnie walker these days.
Him opened the door and saw how does renal disease lead to systemic hypertension that the two guys were still facing each other suddenly there was an illusion that the big golden retriever just bought and the big black cat.
Tsunayoshi didn t seem to see the expressions of the two of them so he really hesitated zhu xingda squatted beside him at some point and his momentum after restraining claritin with high blood pressure was.
Him vodka s mind flashed the dark haired youth walking side by side with johnnie walker stabbed the other party who had not officially met well it s that little white face.
Old and his face is soft at first glance he looks like a little boy who is worthy of adulthood scotland or zhu fu jingguang looked at him then lowered his eyes and laughed.
Young man lowered his eyes smiled softly and raised his hand to pull a strand of broken hair behind belmode s ear I look forward to meeting you even more he said softly it.
Host was not there the smell of the softener washed bed in the sun before you came I did a big cleaning he stood at the window with a smile on his face sawada tsunayoshi.
Almost passed out damnjohnnie walker s mad dog novan deqi who got the information he wanted didn t even isolated systolic hypertension in pregnancy look at him he threw the whip to his subordinates and he took a.
Organization in a short period of time and successfully obtain the code name and this the newcomer that johnnie walker referred to was obviously a newcomer recommended by.
With a provocative meaning bourbon clenched his fists before he could say .
Can You Take Viagra If You Get High Blood Pressure ?
isolated systolic hypertension in pregnancy
• 1.Is High Blood Pressure Considered A Heart Disease
• 2.What Cause High Blood Pressure
• 3.Can You Take Advil If You Have High Blood Pressure
• 4.Can Too Much Magnesium Cause High Blood Pressure
• 5.How Does Tehology Can Cause High Blood Pressure
isolated systolic hypertension in pregnancy What Is A Good Blood Pressure, How To Lower High Blood Pressure low body temp and blood pressure Blood Pressure Chart By Age. anything the black haired little white face raised his head weakly can Good Blood Pressure For Women low body temp and blood pressure I obviously this sentence.
Two and remembered that he had two new ones the subordinate finally took him to the underground training ground of the organization ready to connect with the other two and.
A question mark on johnnie walker s physical characteristics he also said that johnnie walker had lived in italy for a long time before but this time he came to japan for a.
The other two guys who were always watching this side also slowed down are you talking about andrea knowing what he wanted high blood pressure gummies to ask is this it s normal most people in the.
Certain basement a young man with long black hair stepped on someone s face squatted down and patted the other person s cheek with the leather whip in his hand huh don t.
Away in italy the young man with long black hair spread out on his chair murmuring constantly goodbye boss no isolated systolic hypertension in pregnancy smell b the smell of oss if I don t get stepped on by the boss.
Complicated he paused and said jokingly well in that case I think I have found a way to make money so it is after all I should be pretty good looking there should be a lot.
Didn t know very well walked behind if it is his partner or someone else he trusts such as a certain tutor then mr godfather will not feel any restraint and even when the.
Guessed that his good boss found him a code member as a coach in this training ground I don t know who is called chianti s woman is still a man named cohen according to.
Trivial matters are not inhumane only the guardians who occasionally saw the hidden desire in the leader s eyes went to xanxus to fight one on one and then sent their own.
Don t suffer thinking like this the guy who said he was relieved still speeded up silently and got two sandwiches neatly just before he started to eat his ears perked up.
Several times on gangji s side although jin mao accepted his apology and admitted that it was not his problem but the contradiction between low blood pressure skin symptoms the two people has not been.
Moment for some reason the eyes of bourbon and zhu xingda met for a moment and immediately glanced away while the former hummed viciously by when the domestic pets started.
Bastard of the gangster also doesn t believe it and he didn t answer his question just now tsunayoshi puffed out his cheeks on the side that zhuxingda couldn t see which.
Was silent staring at each other isolated systolic hypertension in pregnancy he was relieved until the brown haired youth waved his hand and muttered .
Does Higher Blood Pressure Cause Veins To Pop ?
low body temp and blood pressure Diastolic Blood Pressure Blood Pressure Chart By Age isolated systolic hypertension in pregnancy Moneygment. I know gin suddenly micardis for hypertension had the illusion that he was a lonely old man.
Brought the relationship between the two closer sawada tsunayoshi was puzzled by this and was unanimously rejected when he tried to join them he was so angry that he took a.
That everyone s good mother almighty scotland is in the safe house as for the others sawada tsunayoshi s craftsmanship can t be said to be good but it arthritis and hypertension s not bad but no one.
Request rather it is a derogation to see when our good partner the boss s good assistant has done the kind of work he said it is all the bottom level personnel need worry.
Sincerely thanked his tutor who gave him the instinct to remember his posture even if he had not held a gun for a long time although the next second after being so grateful.
Bourbon and scotland were not involved in the work of other codename members such .
Do Decongestants Cause High Blood Pressure
Blood Pressure Range isolated systolic hypertension in pregnancy Moneygment low body temp and blood pressure Low Blood Pressure Chart. as gin because they were drawn to him and high blood pressure memory loss symptoms even sent them a message the power of the cloth.
Eldest brother walked slowly behind him he was still a little guilty and angry of course the so called anger is just his own feeling of taking care of himself niwalker didn.
T know what to say do you want to be together zhuxing kun akai shuichi he is really calm about this picture of the mafia chief exchanging phone calls with the japanese.
The basic layout of the other two floors is also very close to sawada tsunayoshi s home and they are all ordinary japanese style families the first floor is mainly the.
Days of initial contact sawada tsunayoshi also gained some understanding of his three subordinates bourbon and scotland don t look like he means they don t make him feel as.
With my sister will be messy the little girl stared at him with unreliable eyes mature the reliable adult made an ehhh and tried to get through it and with a guilty.
Crawling under your paws but once you start to think like this you will begin to suspect that your disguise is in place the opponent is the legendary johnnie walker even if.
Finally bought with the name this thing written on it zhi looked at him like this as if s who was eager to pass on information was watching him faintly s did you sleep how.
Obviously did not expect to meet directly some blinked somewhat cute so sawada tsunayoshi simply stepped forward is that mr detective just now he said the title of mr.
Italy and when to code for hypertension he walked away with a johnnie walker that didn t seem to have changed much on the surface but it was actually because the mad dog was still sitting there although.
The training ground he took off his vest turned his head to look behind him johnnie walker who seemed a little sluggish for some reason if I win this time the blond young.
Took with him it was a child named jiro he was gentle and had a good hand he was released from time to time and he liked to pounce on him while thinking about it like this.
Like a docile big dog staring at the only master with burning eyes sawada tsunayoshi looked at him and moved his fingers he remembered the akita dog that yamamoto often.
Recalling how grandpa timoteo what causes hypertension in eclampsia led him into the family when he became the tenth generation he also put on formal clothes and took zhu xingda to visit one by one just visited.
And says no um low blood pressure risk because what I did was not good enough the guy who was already bruised and bruised breathed out because does high blood pressure make you snore he pulled away because this the breath of relief.
They are talking about them therefore in the face of bourbon s provocation akai xiu just lowered his eyes and smiled slightly to be frank isolated systolic hypertension in pregnancy although the arc is slight but.
Man hesitated a little with some pleas in his Moneygment isolated systolic hypertension in pregnancy purple gray eyes can you go back to the safe house it s easy to call people sympathy if I can even as an intelligence officer.
The so called fire of life plan the plan is one of the biggest plans of .
Does A Plant Based Diet Help With High Blood Pressure
Healthy Blood Pressure Range low body temp and blood pressure, isolated systolic hypertension in pregnancy Good Blood Pressure What Is Considered Low Blood Pressure. several organizations that rum holds in his hands like the drug experiments shirley participated in.
Become the organization boss or something like that mr godfather refused to admit that the latter had a connotation of mr killer both titles gave his subordinates a strange.
Subordinates are not allowed to spy on the whereabouts of isolated systolic hypertension in pregnancy .
Are Cranberries Good For High Blood Pressure ?
isolated systolic hypertension in pregnancy What Is A Good Blood Pressure, How To Lower High Blood Pressure low body temp and blood pressure Blood Pressure Chart By Age. their bosses but he is not only bourbon but also the japanese public security police however his boss not isolated systolic hypertension in pregnancy like a.
Original appearance of the other party vodka was silent again showing an inexplicable smile so know garlic for high blood pressure reviews that the organization having a disguised belmod s valley zero only puts.
Can be placed on johnnie walker and johnnie walker s record in italy is also obtained from here in short before seeing johnnie walker in person down valley zero knew a.
Process of collecting information in vodka is very distorted however there is some useful information eg it is said that johnnie walker s general appearance features short.
Liaison tossed and turned in bed and finally sat up after finding he couldn t fall asleep there was an unopened magazine on the desk beside the bed yes the pink one i.
Leave a Reply
Your email address will not be published. Required fields are marked *
|
{
"url": "https://moneygment.ph/pressuresyuxpl/isolated-systolic-hypertension-in-pregnancy/",
"source_domain": "moneygment.ph",
"snapshot_id": "CC-MAIN-2024-33",
"warc_metadata": {
"Content-Length": "105298",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:24E2QINN7QLJUVLRJOJ26UIUWKGTD2F7",
"WARC-Concurrent-To": "<urn:uuid:2b263c3a-c271-43cb-a9f0-aba5711803b8>",
"WARC-Date": "2024-08-05T22:16:58Z",
"WARC-IP-Address": "148.66.137.117",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:SFBL2T67N5WGGZFY2KFIR7IW3TPGKKZF",
"WARC-Record-ID": "<urn:uuid:55b90712-dbaf-4335-be56-7fa73cbc0b83>",
"WARC-Target-URI": "https://moneygment.ph/pressuresyuxpl/isolated-systolic-hypertension-in-pregnancy/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:d1d3049e-c48d-4512-be0c-dcb29d52e5b7>"
},
"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-137\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,
44,
45,
69,
70,
211,
212,
381,
382,
555,
556,
727,
728,
891,
892,
1054,
1055,
1248,
1249,
1460,
1461,
1631,
1632,
1845,
1846,
2016,
2017,
2282,
2283,
2500,
2501,
2675,
2676,
2908,
2909,
3078,
3079,
3286,
3287,
3457,
3458,
3579,
3580,
3635,
3636,
3875,
3876,
4043,
4044,
4216,
4217,
4391,
4392,
4608,
4609,
4818,
4819,
4923,
4924,
4972,
4973,
5215,
5216,
5237,
5238,
5284,
5285,
5570,
5571,
5861,
5862,
6028,
6029,
6196,
6197,
6371,
6372,
6544,
6545,
6718,
6719,
6893,
6894,
7129,
7130,
7304,
7305,
7479,
7480,
7648,
7649,
7866,
7867,
8069,
8070,
8239,
8240,
8455,
8456,
8629,
8630,
8801,
8802,
9012,
9013,
9216,
9217,
9391,
9392,
9560,
9561,
9779,
9780,
9952,
9953,
10126,
10127,
10384,
10385,
10589,
10590,
10764,
10765,
10932,
10933,
10976,
10977,
11027,
11028,
11072,
11076,
11273,
11486,
11712,
11894,
11895,
12192,
12193,
12479,
12480,
12653,
12654,
12871,
12872,
13045,
13046,
13215,
13216,
13468,
13469,
13551,
13552,
13596,
13597,
13875,
13876,
14046,
14047,
14251,
14252,
14454,
14455,
14629,
14630,
14804,
14805,
14978,
14979,
15150,
15151,
15357,
15358,
15531,
15532,
15703,
15704,
15761,
15762,
15814,
15815,
16143,
16144,
16315,
16316,
16530,
16531,
16704,
16705,
16875,
16876,
17047,
17048,
17222,
17223,
17434,
17435,
17606,
17607,
17774,
17775,
17946,
17947,
18039,
18040,
18083,
18084,
18301,
18302,
18533,
18534,
18583,
18584,
18726,
18727,
18897,
18898,
18919,
18920,
18966,
18967,
19188,
19189,
19239,
19240,
19412,
19413,
19462,
19463,
19674,
19675,
19892,
19893,
20064,
20065,
20280,
20281,
20453,
20454,
20497,
20498,
20542,
20543,
20849,
20850,
21021,
21022,
21218,
21219,
21390,
21391,
21562,
21563,
21781,
21782,
22031,
22032,
22259,
22260,
22433,
22434,
22607,
22608,
22825,
22826,
22991,
22992,
23166,
23167,
23333,
23334,
23505,
23506,
23674,
23675,
23883,
23884,
24057,
24058,
24293,
24294,
24466,
24467,
24639,
24640,
24864,
24865,
25072,
25073,
25246,
25247,
25420,
25421,
25594,
25595,
25766,
25767,
25980,
25981,
26153,
26154,
26230,
26231,
26284,
26285,
26329,
26385,
26422,
26479,
26534,
26588,
26589,
26920,
26921,
27094,
27095,
27269,
27270,
27468,
27469,
27640,
27641,
27859,
27860,
28033,
28034,
28206,
28207,
28377,
28378,
28550,
28551,
28722,
28723,
28925,
28926,
29099,
29100,
29271,
29272,
29424,
29425,
29473,
29474,
29710,
29711,
29885,
29886,
30086,
30087,
30259,
30260,
30434,
30435,
30519,
30520,
30563,
30564,
30832,
30833,
31007,
31008,
31177,
31178,
31347,
31348,
31522,
31523,
31689,
31690,
31864,
31865,
32038,
32039,
32207,
32208,
32412,
32413,
32585,
32586,
32759,
32760,
32930,
32931,
33143,
33144,
33377,
33378,
33592,
33593,
33822,
33823,
33897,
33898,
33952,
33953,
34220,
34221,
34395,
34396,
34500,
34501,
34548,
34549,
34877,
34878,
35090,
35091,
35260,
35261,
35434,
35435,
35603,
35604,
35618,
35619
],
"line_end_idx": [
44,
45,
69,
70,
211,
212,
381,
382,
555,
556,
727,
728,
891,
892,
1054,
1055,
1248,
1249,
1460,
1461,
1631,
1632,
1845,
1846,
2016,
2017,
2282,
2283,
2500,
2501,
2675,
2676,
2908,
2909,
3078,
3079,
3286,
3287,
3457,
3458,
3579,
3580,
3635,
3636,
3875,
3876,
4043,
4044,
4216,
4217,
4391,
4392,
4608,
4609,
4818,
4819,
4923,
4924,
4972,
4973,
5215,
5216,
5237,
5238,
5284,
5285,
5570,
5571,
5861,
5862,
6028,
6029,
6196,
6197,
6371,
6372,
6544,
6545,
6718,
6719,
6893,
6894,
7129,
7130,
7304,
7305,
7479,
7480,
7648,
7649,
7866,
7867,
8069,
8070,
8239,
8240,
8455,
8456,
8629,
8630,
8801,
8802,
9012,
9013,
9216,
9217,
9391,
9392,
9560,
9561,
9779,
9780,
9952,
9953,
10126,
10127,
10384,
10385,
10589,
10590,
10764,
10765,
10932,
10933,
10976,
10977,
11027,
11028,
11072,
11076,
11273,
11486,
11712,
11894,
11895,
12192,
12193,
12479,
12480,
12653,
12654,
12871,
12872,
13045,
13046,
13215,
13216,
13468,
13469,
13551,
13552,
13596,
13597,
13875,
13876,
14046,
14047,
14251,
14252,
14454,
14455,
14629,
14630,
14804,
14805,
14978,
14979,
15150,
15151,
15357,
15358,
15531,
15532,
15703,
15704,
15761,
15762,
15814,
15815,
16143,
16144,
16315,
16316,
16530,
16531,
16704,
16705,
16875,
16876,
17047,
17048,
17222,
17223,
17434,
17435,
17606,
17607,
17774,
17775,
17946,
17947,
18039,
18040,
18083,
18084,
18301,
18302,
18533,
18534,
18583,
18584,
18726,
18727,
18897,
18898,
18919,
18920,
18966,
18967,
19188,
19189,
19239,
19240,
19412,
19413,
19462,
19463,
19674,
19675,
19892,
19893,
20064,
20065,
20280,
20281,
20453,
20454,
20497,
20498,
20542,
20543,
20849,
20850,
21021,
21022,
21218,
21219,
21390,
21391,
21562,
21563,
21781,
21782,
22031,
22032,
22259,
22260,
22433,
22434,
22607,
22608,
22825,
22826,
22991,
22992,
23166,
23167,
23333,
23334,
23505,
23506,
23674,
23675,
23883,
23884,
24057,
24058,
24293,
24294,
24466,
24467,
24639,
24640,
24864,
24865,
25072,
25073,
25246,
25247,
25420,
25421,
25594,
25595,
25766,
25767,
25980,
25981,
26153,
26154,
26230,
26231,
26284,
26285,
26329,
26385,
26422,
26479,
26534,
26588,
26589,
26920,
26921,
27094,
27095,
27269,
27270,
27468,
27469,
27640,
27641,
27859,
27860,
28033,
28034,
28206,
28207,
28377,
28378,
28550,
28551,
28722,
28723,
28925,
28926,
29099,
29100,
29271,
29272,
29424,
29425,
29473,
29474,
29710,
29711,
29885,
29886,
30086,
30087,
30259,
30260,
30434,
30435,
30519,
30520,
30563,
30564,
30832,
30833,
31007,
31008,
31177,
31178,
31347,
31348,
31522,
31523,
31689,
31690,
31864,
31865,
32038,
32039,
32207,
32208,
32412,
32413,
32585,
32586,
32759,
32760,
32930,
32931,
33143,
33144,
33377,
33378,
33592,
33593,
33822,
33823,
33897,
33898,
33952,
33953,
34220,
34221,
34395,
34396,
34500,
34501,
34548,
34549,
34877,
34878,
35090,
35091,
35260,
35261,
35434,
35435,
35603,
35604,
35618,
35619,
35689
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 35689,
"ccnet_original_nlines": 414,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 3,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.4817795157432556,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.006680840160697699,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.04069238156080246,
"rps_doc_frac_unique_words": 0.2189573496580124,
"rps_doc_mean_word_length": 4.562875270843506,
"rps_doc_num_sentences": 221,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.89224910736084,
"rps_doc_word_count": 6330,
"rps_doc_frac_chars_dupe_10grams": 0.11300764977931976,
"rps_doc_frac_chars_dupe_5grams": 0.17165806889533997,
"rps_doc_frac_chars_dupe_6grams": 0.13101132214069366,
"rps_doc_frac_chars_dupe_7grams": 0.1251947432756424,
"rps_doc_frac_chars_dupe_8grams": 0.12131703644990921,
"rps_doc_frac_chars_dupe_9grams": 0.11743932217359543,
"rps_doc_frac_chars_top_2gram": 0.06076239049434662,
"rps_doc_frac_chars_top_3gram": 0.050410278141498566,
"rps_doc_frac_chars_top_4gram": 0.05401100963354111,
"rps_doc_books_importance": -2862.094970703125,
"rps_doc_books_importance_length_correction": -2862.094970703125,
"rps_doc_openwebtext_importance": -1669.0849609375,
"rps_doc_openwebtext_importance_length_correction": -1669.0849609375,
"rps_doc_wikipedia_importance": -924.7553100585938,
"rps_doc_wikipedia_importance_length_correction": -924.7553100585938
},
"fasttext": {
"dclm": 0.04548310860991478,
"english": 0.972474992275238,
"fineweb_edu_approx": 1.0829209089279175,
"eai_general_math": 0.02970392070710659,
"eai_open_web_math": 0.18753010034561157,
"eai_web_code": 0.005404230207204819
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "616.1",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Pathology and Diseases"
}
},
"secondary": {
"code": "618.2",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Women — Health and hygiene, Children — Health and hygiene, Gynecology, and Pediatrics"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "1",
"label": "Factual"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "13",
"label": "Literary/Creative"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "2",
"label": "Text Extraction Errors"
}
},
"missing_content": {
"primary": {
"code": "3",
"label": "Incoherent Flow"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "7",
"label": "Creative Writing"
}
},
"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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-1,056,925,685,865,329,700 |
Click here to Skip to main content
13,086,120 members (82,923 online)
Click here to Skip to main content
Add your own
alternative version
Stats
45.4K views
2.2K downloads
37 bookmarked
Posted 23 Jun 2005
Simple thread pool manager
, 23 Jun 2005
Rate this:
Please Sign up or sign in to vote.
A simple thread pool implementation.
Introduction
It is a simple thread pool management class, which gives flexibility of:
1. Queuing tasks in case no idle threads are present or the thread count has reached the maximum limit of allowed threads.
2. Altering thread pool at runtime. Which would mean increasing or decreasing the number of threads required by the system.
3. Creating pool at runtime to avoid unwanted resource usage. Maintaining a pool with idle threads becomes a costly affair in resource crunching moments, this would allow removing of idle threads and recreating them when required again.
Using the code
CThreadPoolManager is the class that handles the creation and management of the thread pool.
Here is the skeleton of the manager class:
class CThreadPoolManager
{
static friend UINT ProcessRequestMgr(LPVOID);
static friend UINT ProcessRequestWkr(LPVOID);
static friend bool UpdateThreadPool(int&,int&);
public:
static CThreadPoolManager* GetInstance();
static void ReleaseInstance();
public:
bool StartMgr(int,int);
bool DelegateTask(CDelegator*);
public:
const HANDLE GetMgrPort() const;
int GetMaxAllowedThread() const
int GetMinAllowedThread() const
void GetTaskList(CStringArray&) const;
const CThreadMap& GetThreadList() const;
private:
CThreadPoolManager();
virtual ~CThreadPoolManager();
private:
bool ClearAllOperations();
private:
static CThreadPoolManager* myInstance;
CWinThread* myManagerThrd;
HANDLE myManagerIOPort;
int myMaxThreadCount,myMinThreadCount;
};
Function Descriptions
static friend UINT ProcessRequestMgr(LPVOID)
Handler for the manager thread. Responsible for creating and managing the thread pool. Upon starting, the manager would wait for the request by calling GetQueuedCompletionStatus and taking actions accordingly.
Here are the events that the manager would respond to.
• MGR_UPDATE_POOL: Maintains the thread pool status, by adding or removing the required number of threads.
• MGR_INVOKE_WORKER: Checks the thread pool for idle threads. Associates the task if available or else creates the thread and associates the task in case if current thread count is less than the maximum number allowed or else puts the task in queue which would get associated to as soon as any of the thread gets idle.
• MGR_WORKER_JOB_STATUS: Reacts according to the status received from pool threads, if a pool thread has completed the task then assign with new one if anything is pending in the queue, else check minimum thread count, if acceptable then allow the thread to be idle or else terminate the thread.
• MGR_TERMINATE_POOL: Would send terminate request to the pool and finally terminate itself.
Here are the events that pool threads would respond to:
• WKR_START_JOB_PROCESSING: Would handle the execution of user request.
OVERLAPPED aSendWrkIOPort;
aSendWrkIOPort.Internal = reinterpret_cast<unsigned long>(aWkrIOPort);
CDelegator* aProcessor = reinterpret_cast<CDelegator*>(pStatus);
if(!aProcessor)
{
TRACE("Invalid task pointer for worker thread!\n");
if(!PostQueuedCompletionStatus(aMgIoPort, MGR_WORKER_JOB_STATUS,
0, &aSendWrkIOPort))
{
LOG("Unable to send job completion message to manager.\r\n");
ASSERT(FALSE);
}
break;
}
aProcessor->ProcessData();
delete aProcessor;
aProcessor = NULL;
if(!PostQueuedCompletionStatus(aMgIoPort, MGR_WORKER_JOB_STATUS,
0, &aSendWrkIOPort))
{
LOG("Unable to send job completion message to manager.\r\n");
ASSERT(FALSE);
}
break;
All the tasks which are to be executed need to be derived from CDelegator whose virtual method is called by the thread to execute the assigned task.
Skeleton of CDelegator is as follows:
class CDelegator
{
public:
CDelegator(){};
virtual ~CDelegator(){};
virtual void ProcessData()=0;
};
• WKR_TERMINATE: Terminate pool thread.
About the demo code
Sample Image
Default maximum thread count is set to 25 and minimum to 0, this can be modified. On pressing of 'Start' button, the minimum number of threads specified would be created and get listed in the Inactive thread list as no task has been assigned to it currently.
Assigning of task could be done by pressing the 'Create Task' button. Each time when the button is pressed, an idle thread would be picked from the Inactive thread list and be shifted to the Active thread list. This would continue till the maximum number of permissible threads is reached.
Later tasks would be queued if the count exceeds the maximum thread count. Select a task from the active thread list and the button to complete the task would get activated, would terminate the task and free the thread (alternately, if you double click on the active thread, it would perform the same action). Immediately, one task from the pending task list would be picked and assigned to the thread. So still the thread would be shown in the active thread list instead as inactive.
On completion of all tasks, the threads would get into the inactive thread list. But there would not be any more than what we have specified in the minimum thread count. So the remaining threads would get terminated and would get active later if more tasks are generated.
At any point of time, the numbers in Min/Max can be changed, and on pressing the 'Start' button the change would get reflected provided the threads are not engaged in any active tasks.
License
This article has no explicit license attached to it but may contain usage terms in the article text or the download files themselves. If in doubt please contact the author via the discussion board below.
A list of licenses authors might use can be found here
Share
About the Author
Nilesh K.
Web Developer
India India
No Biography provided
You may also be interested in...
Pro
Pro
Comments and Discussions
GeneralMemory leak Pin
anders_ma2-Mar-06 16:16
memberanders_ma2-Mar-06 16:16
GeneralNice Pin
ThatsAlok23-Jun-05 2:24
memberThatsAlok23-Jun-05 2:24
GeneralRe: Nice Pin
Nilesh K.23-Jun-05 15:44
memberNilesh K.23-Jun-05 15:44
General General News News Suggestion Suggestion Question Question Bug Bug Answer Answer Joke Joke Praise Praise Rant Rant Admin Admin
Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.
Permalink | Advertise | Privacy | Terms of Use | Mobile
Web03 | 2.8.170813.1 | Last Updated 23 Jun 2005
Article Copyright 2005 by Nilesh K.
Everything else Copyright © CodeProject, 1999-2017
Layout: fixed | fluid
|
{
"url": "https://www.codeproject.com/Articles/10769/Simple-thread-pool-manager",
"source_domain": "www.codeproject.com",
"snapshot_id": "crawl=CC-MAIN-2017-34",
"warc_metadata": {
"Content-Length": "88908",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:LRRD53CSDPMZ7NO3FWQHL7BCBDIZGTVM",
"WARC-Concurrent-To": "<urn:uuid:ef7a1b7e-9f69-4338-b12f-5ef72d9d7989>",
"WARC-Date": "2017-08-17T02:09:43Z",
"WARC-IP-Address": "76.74.234.210",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:5VRFUKD4OIOAJAVY2EUNSDROGF26R624",
"WARC-Record-ID": "<urn:uuid:3140158d-c1b5-427e-98d6-0b78693602be>",
"WARC-Target-URI": "https://www.codeproject.com/Articles/10769/Simple-thread-pool-manager",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:32c279ce-e513-43c8-b9a7-5e49155c5e41>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-166-25-178.ec2.internal\r\nsoftware: Nutch 1.6 (CC)\r\nisPartOf: CC-MAIN-2017-34\r\noperator: Common Crawl Admin\r\ndescription: Wide crawl of the web for August 2017\r\npublisher: Common Crawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
35,
70,
105,
118,
138,
139,
145,
146,
158,
173,
187,
206,
207,
234,
235,
249,
260,
295,
332,
333,
346,
347,
420,
421,
546,
672,
911,
912,
927,
928,
1021,
1022,
1065,
1066,
1091,
1093,
1143,
1193,
1245,
1253,
1299,
1334,
1342,
1370,
1406,
1407,
1415,
1452,
1489,
1526,
1569,
1614,
1623,
1649,
1684,
1693,
1724,
1733,
1776,
1810,
1846,
1900,
1903,
1904,
1926,
1927,
1972,
1973,
2183,
2184,
2239,
2240,
2349,
2670,
2968,
3063,
3064,
3120,
3121,
3195,
3226,
3301,
3306,
3376,
3381,
3401,
3407,
3466,
3538,
3610,
3619,
3687,
3708,
3717,
3731,
3737,
3742,
3773,
3796,
3819,
3824,
3893,
3962,
3968,
4036,
4057,
4063,
4074,
4079,
4080,
4233,
4234,
4276,
4277,
4298,
4304,
4316,
4340,
4373,
4411,
4418,
4460,
4461,
4481,
4482,
4495,
4496,
4755,
4756,
5046,
5047,
5532,
5533,
5805,
5806,
5991,
5992,
6000,
6001,
6205,
6206,
6261,
6262,
6268,
6269,
6286,
6287,
6297,
6311,
6323,
6345,
6346,
6379,
6380,
6384,
6388,
6389,
6414,
6415,
6417,
6440,
6464,
6495,
6511,
6535,
6566,
6586,
6611,
6643,
6644,
6808,
6809,
6920,
6921,
6977,
7025,
7061,
7112
],
"line_end_idx": [
35,
70,
105,
118,
138,
139,
145,
146,
158,
173,
187,
206,
207,
234,
235,
249,
260,
295,
332,
333,
346,
347,
420,
421,
546,
672,
911,
912,
927,
928,
1021,
1022,
1065,
1066,
1091,
1093,
1143,
1193,
1245,
1253,
1299,
1334,
1342,
1370,
1406,
1407,
1415,
1452,
1489,
1526,
1569,
1614,
1623,
1649,
1684,
1693,
1724,
1733,
1776,
1810,
1846,
1900,
1903,
1904,
1926,
1927,
1972,
1973,
2183,
2184,
2239,
2240,
2349,
2670,
2968,
3063,
3064,
3120,
3121,
3195,
3226,
3301,
3306,
3376,
3381,
3401,
3407,
3466,
3538,
3610,
3619,
3687,
3708,
3717,
3731,
3737,
3742,
3773,
3796,
3819,
3824,
3893,
3962,
3968,
4036,
4057,
4063,
4074,
4079,
4080,
4233,
4234,
4276,
4277,
4298,
4304,
4316,
4340,
4373,
4411,
4418,
4460,
4461,
4481,
4482,
4495,
4496,
4755,
4756,
5046,
5047,
5532,
5533,
5805,
5806,
5991,
5992,
6000,
6001,
6205,
6206,
6261,
6262,
6268,
6269,
6286,
6287,
6297,
6311,
6323,
6345,
6346,
6379,
6380,
6384,
6388,
6389,
6414,
6415,
6417,
6440,
6464,
6495,
6511,
6535,
6566,
6586,
6611,
6643,
6644,
6808,
6809,
6920,
6921,
6977,
7025,
7061,
7112,
7133
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 7133,
"ccnet_original_nlines": 178,
"rps_doc_curly_bracket": 0.001962709939107299,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.28412696719169617,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.02619048021733761,
"rps_doc_frac_lines_end_with_ellipsis": 0.005586590152233839,
"rps_doc_frac_no_alph_words": 0.23333333432674408,
"rps_doc_frac_unique_words": 0.408184677362442,
"rps_doc_mean_word_length": 5.619097709655762,
"rps_doc_num_sentences": 57,
"rps_doc_symbol_to_word_ratio": 0.0007936499896459281,
"rps_doc_unigram_entropy": 5.329013824462891,
"rps_doc_word_count": 953,
"rps_doc_frac_chars_dupe_10grams": 0.04929972067475319,
"rps_doc_frac_chars_dupe_5grams": 0.06722688674926758,
"rps_doc_frac_chars_dupe_6grams": 0.05975724011659622,
"rps_doc_frac_chars_dupe_7grams": 0.05975724011659622,
"rps_doc_frac_chars_dupe_8grams": 0.04929972067475319,
"rps_doc_frac_chars_dupe_9grams": 0.04929972067475319,
"rps_doc_frac_chars_top_2gram": 0.021848740056157112,
"rps_doc_frac_chars_top_3gram": 0.009710550308227539,
"rps_doc_frac_chars_top_4gram": 0.0117647098377347,
"rps_doc_books_importance": -529.421875,
"rps_doc_books_importance_length_correction": -529.421875,
"rps_doc_openwebtext_importance": -350.8287048339844,
"rps_doc_openwebtext_importance_length_correction": -350.8287048339844,
"rps_doc_wikipedia_importance": -303.1341857910156,
"rps_doc_wikipedia_importance_length_correction": -303.1341857910156
},
"fasttext": {
"dclm": 0.061938051134347916,
"english": 0.8427479267120361,
"fineweb_edu_approx": 2.036868095397949,
"eai_general_math": 0.014386770315468311,
"eai_open_web_math": 0.13976013660430908,
"eai_web_code": 0.001502390019595623
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "4",
"label": "Code/Software"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
8,817,562,323,822,173,000 |
Description
Highly Configurable Systems (HCS) aim at being easily modified and adapted to end-users needs or to their environment. When they span over a single domain, they are often called Product Lines (PL). Adaptation is possible by systematically reusing software components and explicitly dealing with variability among those components. After an initial investment, it becomes possible to drastically reduce development costs of new, envisaged products. However, ensuring the quality of such large systems is a new challenge: the configuration number grows exponentially with the options/variants number. This project aims at enhancing HCS through testing: we will define
new metrics suited to HCS, and will propose new methods for selecting non-regression tests and
analysing test smells.
L'acronymeTHCS
statutEn cours d'exécution
Les dates de début/date réelle1/01/1831/12/19
Attachement à un institut de recherche reconnus à l'UNAMUR
• NADI
|
{
"url": "https://researchportal.unamur.be/fr/projects/testing-highly-configurable-systems",
"source_domain": "researchportal.unamur.be",
"snapshot_id": "crawl=CC-MAIN-2019-51",
"warc_metadata": {
"Content-Length": "20994",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:RWNBZWUDUOVI2MRELU47C4UGDPE3H5D4",
"WARC-Concurrent-To": "<urn:uuid:2726ecd9-c27a-4aaf-a6ed-ead3db93d978>",
"WARC-Date": "2019-12-12T03:06:25Z",
"WARC-IP-Address": "52.51.22.49",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:Y6O6IWDXSZSRCWB45WUNVCWAYHG46QAS",
"WARC-Record-ID": "<urn:uuid:e61921d1-3d9a-414f-9fff-48ee03b8f3ea>",
"WARC-Target-URI": "https://researchportal.unamur.be/fr/projects/testing-highly-configurable-systems",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:2cd94ded-6fc8-4122-ab46-709f2b6a9d96>"
},
"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-133.ec2.internal\r\nsoftware: Apache Nutch 1.16 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.1-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
12,
13,
679,
774,
797,
812,
839,
885,
886,
945,
946
],
"line_end_idx": [
12,
13,
679,
774,
797,
812,
839,
885,
886,
945,
946,
954
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 954,
"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.3005780279636383,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.0404624305665493,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.19653178751468658,
"rps_doc_frac_unique_words": 0.8074074387550354,
"rps_doc_mean_word_length": 5.866666793823242,
"rps_doc_num_sentences": 7,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.59972620010376,
"rps_doc_word_count": 135,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0,
"rps_doc_frac_chars_dupe_6grams": 0,
"rps_doc_frac_chars_dupe_7grams": 0,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -87.43097686767578,
"rps_doc_books_importance_length_correction": -87.43097686767578,
"rps_doc_openwebtext_importance": -53.89260482788086,
"rps_doc_openwebtext_importance_length_correction": -40.75080108642578,
"rps_doc_wikipedia_importance": -26.509422302246094,
"rps_doc_wikipedia_importance_length_correction": -26.509422302246094
},
"fasttext": {
"dclm": 0.02594692073762417,
"english": 0.8357264995574951,
"fineweb_edu_approx": 2.286450147628784,
"eai_general_math": 0.3118235468864441,
"eai_open_web_math": 0.38632893562316895,
"eai_web_code": 0.22984737157821655
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.02",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "004.072",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "2",
"label": "Academic/Research"
},
"secondary": {
"code": "-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": "3",
"label": "Academic Writing"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
2,293,222,879,547,780,600 |
RAPID COMMUNICATION
KEYWORDS
TOPICS
ABSTRACT
Knowing the tritrophic interactions between plant-virus-insect is important in developing sustainable pest management practices. Myzus persicae is a well-known plant viral vector which can transmit over 40 plant viruses. We studied the impact of Cucumber mosaic virus (CMV) infection in Nicotiana tabacum on the colony development of M. persicae to understand how plant virus infection can affect vector growth and reproduction. Aphid growth, reproduction and fecundity were significantly affected by the virus infection. The mean relative growth rate of M. persicae on healthy plants was 0.29 mg–1 · mg–1 · day–1 and was significantly higher than that of CMV-infected plants (0.23 mg–1 · mg–1 · day–1). In contrast, the percentage of survival was significantly higher on CMV-infected plants. The estimated survival percentages of aphids at 20 days after introduction to CMV-infected and healthy plants were 55.8 and 25.8%, respectively. Therefore, the total population of aphids on CMVinfected plants was significantly higher on the 25th day after the introduction of aphids. The total population of aphids on the CMV-infected plants was 1,225 compared to that of healthy plants which was 713. Similarly, mean fecundity over a 30 day observation period was 61.25 and 35.65 for aphids grown on CMV-infected and healthy plants, respectively. Jasmonic acid (JA) upstream gene OPR3 and downstream gene COI1 was measured to quantify the changes in JA expression in the plants under the virus infection. Both genes tested were significantly downregulated in CMV-infected plants. From our results, it was evident that the JA related insect resistance was reduced in CMV-infected plants and hence aphid colony development was increased.
RESPONSIBLE EDITOR
Ekaterina Grizanova
CONFLICT OF INTEREST
The authors have declared that no conflict of interests exist.
REFERENCES (18)
1.
Dietzgen R.G., Mann K.S., Johnson K.N. 2016. Plant virus-insect vector interactions: Current and potential future research directions. Viruses 8 (11): 303. DOI: https://doi.org/10.3390/v81103....
2.
Dixon A.F.G. 1987. Parthenogenetic reproduction and the rate of increase in aphids. p. 269–287. In: “Aphids: Their Biology, Natural Enemies and Control” (A.K. Minks, P. Harrewijn, eds.). Elsevier, Amsterdam.
3.
Donnelly R., Cunniffe N.J., Carr J.P., Gilligan C.A. 2019. Pathogenic modification of plants enhances long-distance dispersal of nonpersistently transmitted viruses to new hosts. Ecology 100 (7): e02725. DOI: https://doi.org/10.1002/ecy.27....
4.
Escriu F., Perry K.L., García-Arenal F. 2000. Transmissibility of Cucumber mosaic virus by Aphis gossypii correlates with viral accumulation and is affected by the presence of its satellite RNA. Phytopathology 90 (10): 1068–1072. DOI: https://doi.org/10.1094/PHYTO.....
5.
Gholi-Tolouie S., Sokhandan-Bashir N., Davari M., Sedghi M. 2018. The effect of salicylic and jasmonic acids on tomato physiology and tolerance to Cucumber mosaic virus (CMV). European Journal of Plant Pathology 151: 101–116. DOI: https://doi.org/10.1007/s10658....
6.
Jacquemond M. 2012. Cucumber mosaic virus. Advances in Virus Reserch 84: 439–504. DOI: https://doi.org/10.1016/B978-0....
7.
Kloth K.J., Wiegers G.L., Busscher-Lange J., van Haarst J.C., Kruijer W., Bouwmeester H.J., Dicke M., Jongsma M.A. 2016. AtWRKY22 promotes susceptibility to aphids and modulates salicylic acid and jasmonic acid signalling. Journal of Experimental Botany 67 (11): 3383–3396. DOI: https://doi.org/10.1093/jxb/er....
8.
Ng J.C., Perry K.L. 2004. Transmission of plant viruses by aphid vectors. Molecular Plant Pathology 5 (5): 505–511. DOI: https://doi.org/10.1111/j.1364....
9.
Nouri-Ganbalani G., Borzoui E., Shahnavazi M., Nouri A. 2018. Induction of resistance against Plutella xylostella (L.) (Lep.: Plutellidae) by jasmonic acid and mealy cabbage aphid feeding in Brassica napus L. Frontiers in Physiology 9: 859. DOI: https://doi.org/10.3389/fphys.....
10.
Safari M., Ferrari M.J., Roossinck M.J. 2019. Manipulation of aphid behavior by a persistent plant virus. Journal of Virology 93 (9): e01781-18. DOI: https://doi.org/10.1128/JVI.01....
11.
Shi X., Deng J., Zhang Z., Yan S., Zheng L., Sun S., Gao Y., Zhou X., Zhang D., Liu Y. 2021. Initial ingestion of CMV-infected plants reduces subsequent aphid performance. Arthropod-Plant Interactions 15 (2): 153–160. DOI: https://doi.org/10.1007/s11829....
12.
Shi X., Gao Y., Yan S., Tang X., Zhou X., Zhang D., Liu Y. 2016. Aphid performance changes with plant defense mediated by Cucumber mosaic virus titer. Virology Journal 13 (1): 70 DOI: https://doi.org/10.1186/s12985....
13.
Van Dam N.M., Wondafrash M., Mathur V., Tytgat T.O.G. 2018. Differences in hormonal signaling triggered by two root-feeding nematode species result in contrasting effects on aphid population growth. Frontiers in Ecology and Evolution 6: 88. DOI: https://doi.org/10.3389/fevo.2....
14.
Vinoth K.R., Shivaprasad P.V. 2020. Plant-virus-insect tritrophic interactions: insights into the functions of geminivirus virion-sense strand genes. Proceedings of the Royal Society B: Biological Sciences 287 (1936): 20201846 DOI: https://doi.org/10.1098/rspb.2....
15.
Westwood J.H., Groen S.C., Du Z., Murphy A.M., Anggoro D.T., Tungadi T., Luang-In V., Lewsey M.G., Rossiter J.T., Powell G., Alison G., Smith A.G., Carr J.P. 2013. A trio of viral proteins tunes aphid-plant interactions in Arabidopsis thaliana. PLoS ONE 8 (12): e83066. DOI: https://doi.org/10.1371/journa....
16.
Westwood J.H., Stevens M. 2010. Resistance to aphid vectors of virus disease. Advances in Virus Research 76: 179–210. DOI: https://doi.org/10.1016/S0065-....
17.
Zhang H.Y., Xie X.Z., Xu Y.Z., Wu N.H. 2004. Isolation and functional assessment of a tomato proteinase inhibitor II gene. Plant Physiology and Biochemistry 42 (5): 437–444. DOI: https://doi.org/10.1016/j.plap....
18.
Ziebell H., Murphy A.M., Groen S.C., Tungadi T., Westwood J.H., Lewsey M.G., Moulin M., Kleczkowski A., Smith A.G., Stevens M. 2011. Cucumber mosaic virus and its 2b RNA silencing suppressor modify plant-aphid interactions in tobacco. Scientific Reports 1 (1): 187. DOI: https://doi.org/10.1038/srep00....
eISSN:1899-007X
ISSN:1427-4345
Journals System - logo
Scroll to top
|
{
"url": "https://www.plantprotection.pl/Effect-of-Cucumber-mosaic-virus-infection-on-aphid-colony-development,142116,0,2.html",
"source_domain": "www.plantprotection.pl",
"snapshot_id": "CC-MAIN-2024-18",
"warc_metadata": {
"Content-Length": "71558",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:D2LY5ZTAOAK2P2JIO6PGEAXTBNEI6D35",
"WARC-Concurrent-To": "<urn:uuid:27f6c01d-25ca-41ec-b2d7-94584e2ea5ba>",
"WARC-Date": "2024-04-25T12:11:45Z",
"WARC-IP-Address": "46.28.13.204",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:PIFRRFZNQDFIYSMF2TVGUTU6UU3BIMVH",
"WARC-Record-ID": "<urn:uuid:43bb1848-bfc2-48fe-afe7-7ca0c7450af3>",
"WARC-Target-URI": "https://www.plantprotection.pl/Effect-of-Cucumber-mosaic-virus-infection-on-aphid-colony-development,142116,0,2.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3d2235af-015f-4690-9449-2128cd172b58>"
},
"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,
20,
22,
31,
38,
47,
1777,
1796,
1816,
1837,
1900,
1902,
1918,
1921,
2117,
2119,
2122,
2330,
2332,
2335,
2579,
2581,
2584,
2854,
2856,
2859,
3125,
3127,
3130,
3252,
3254,
3257,
3571,
3573,
3576,
3732,
3734,
3737,
4018,
4020,
4024,
4209,
4211,
4215,
4473,
4475,
4479,
4698,
4700,
4704,
4985,
4987,
4991,
5258,
5260,
5264,
5574,
5576,
5580,
5738,
5740,
5744,
5958,
5960,
5964,
6270,
6272,
6288,
6303,
6326
],
"line_end_idx": [
20,
22,
31,
38,
47,
1777,
1796,
1816,
1837,
1900,
1902,
1918,
1921,
2117,
2119,
2122,
2330,
2332,
2335,
2579,
2581,
2584,
2854,
2856,
2859,
3125,
3127,
3130,
3252,
3254,
3257,
3571,
3573,
3576,
3732,
3734,
3737,
4018,
4020,
4024,
4209,
4211,
4215,
4473,
4475,
4479,
4698,
4700,
4704,
4985,
4987,
4991,
5258,
5260,
5264,
5574,
5576,
5580,
5738,
5740,
5744,
5958,
5960,
5964,
6270,
6272,
6288,
6303,
6326,
6339
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6339,
"ccnet_original_nlines": 69,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.11389072239398956,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.12376563996076584,
"rps_doc_frac_lines_end_with_ellipsis": 0.24285714328289032,
"rps_doc_frac_no_alph_words": 0.40947991609573364,
"rps_doc_frac_unique_words": 0.5487945079803467,
"rps_doc_mean_word_length": 5.524684429168701,
"rps_doc_num_sentences": 284,
"rps_doc_symbol_to_word_ratio": 0.011191570200026035,
"rps_doc_unigram_entropy": 5.724356174468994,
"rps_doc_word_count": 871,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.024106400087475777,
"rps_doc_frac_chars_dupe_6grams": 0.01787199079990387,
"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.024729840457439423,
"rps_doc_frac_chars_top_3gram": 0.02369076944887638,
"rps_doc_frac_chars_top_4gram": 0.008728180080652237,
"rps_doc_books_importance": -886.9104614257812,
"rps_doc_books_importance_length_correction": -886.9104614257812,
"rps_doc_openwebtext_importance": -530.8855590820312,
"rps_doc_openwebtext_importance_length_correction": -530.8855590820312,
"rps_doc_wikipedia_importance": -335.0750732421875,
"rps_doc_wikipedia_importance_length_correction": -335.0750732421875
},
"fasttext": {
"dclm": 0.04213714972138405,
"english": 0.7362449169158936,
"fineweb_edu_approx": 3.110464334487915,
"eai_general_math": 0.023071590811014175,
"eai_open_web_math": 0.4381597638130188,
"eai_web_code": 0.000011920000360987615
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "581.9",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Botany",
"level_3": "Plant physiology and Plant anatomy"
}
},
"secondary": {
"code": "583.2",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Botany",
"level_3": "Dicotyledons"
}
}
},
"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": "2",
"label": "Academic/Research"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "3",
"label": "Academic Writing"
},
"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": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
1,872,855,568,655,703,800 |
<![CDATA[Extra public IPs not working]]>I may be having the same (or a similar) issue. Running nanoBSD pfSense 2.2.3 64-bit.
Have Verizon Business Fios with a block of 5 static IPs.
I have 3 of them pointed at 3 servers in my DMZ (172.19.69.0/24) using 1:1 NAT.
(nat.png)
I have a WAN firewall rule that allows traffic to the DMZ…
(wan.png)
...and a DMZ firewall rule that allows traffic to anything except the LAN.
(dmz.png)
This exact configuration (different ISP and IPs) works at my office. However, here at my house, it isn't working.
I can access the servers in the DMZ (172.19.69.0/24) directly from my LAN (10.19.69.0/24).
I can access the public static IPs from my LAN successfully using NAT reflection.
But there's no response at all when accessing the public static IPs from the outside world.
I tried running a packet capture on the public static IPs from the WAN interface, but it doesn't show any packets captured.
The weirdest part is that I can plug my laptop directly into the fiber ONT (bypassing pfsense) and talk successfully on any of the public static IPs. Any ideas?
]]>
https://forum.netgate.com/topic/86063/extra-public-ips-not-workingRSS for NodeThu, 02 Dec 2021 19:31:09 GMTWed, 01 Jul 2015 07:49:33 GMT60<![CDATA[Reply to Extra public IPs not working on Wed, 01 Jul 2015 22:40:10 GMT]]>Whether or not VIPs are required depends on your ISP's setup. If they're routing them to you, no need for VIPs. Where you must answer ARP on them, you must have a VIP type that answers ARP. Where you have multiple aliases on the same device, they all show up as the same MAC. Outside of circumstances like CARP, VRRP, and HSRP that use virtual MACs, there is only one MAC on a given interface and all the IPs on that interface use it.
]]>
https://forum.netgate.com/post/554639https://forum.netgate.com/post/554639Wed, 01 Jul 2015 22:40:10 GMT
<![CDATA[Reply to Extra public IPs not working on Wed, 01 Jul 2015 17:42:30 GMT]]>After a good night's rest, I actually came to the same conclusion.
And you're absolutely right, it was the virtual IPs. :) Problem is solved! Thanks!
Additional observations:
Strangely enough, at my work on a different ISP, the virtual IPs weren't required (which is what is most confusing about this config).
Even stranger is that I plugged my laptop into the WAN my older cisco router (that was working), pinged the public static IPs, then checked the ARP table only to find that all static IPs had the same MAC address…very strange. I don't understand how that worked.
Anyway, color me slightly confused, but I'm grateful that the current pfSense box is working.
]]>
https://forum.netgate.com/post/554554https://forum.netgate.com/post/554554Wed, 01 Jul 2015 17:42:30 GMT
<![CDATA[Reply to Extra public IPs not working on Wed, 01 Jul 2015 17:27:51 GMT]]>Split this into its own topic. It sounds like the same root cause in that your modem/next hop router isn't sending you the traffic, but there are a wide range of reasons that could occur.
Did you add IP alias type virtual IPs for the public IPs? I'm guessing that's probably not the issue given you see nothing at all on WAN for those IPs, and without VIPs you'd see repeated ARP requests for those IPs and it sounds like that's not the case.
Since you plugged in another device on those IPs, your Fios modem/router likely is hanging onto those MACs. Power cycling it, after disconnecting anything else with those public IPs assigned, likely will suffice.
]]>
https://forum.netgate.com/post/554549https://forum.netgate.com/post/554549Wed, 01 Jul 2015 17:27:51 GMT
|
{
"url": "https://forum.netgate.com/topic/86063.rss",
"source_domain": "forum.netgate.com",
"snapshot_id": "crawl=CC-MAIN-2021-49",
"warc_metadata": {
"Content-Length": "5512",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:F2PJEL3KH2DBX3PXVF6DB56UY5FGJ63N",
"WARC-Concurrent-To": "<urn:uuid:c2c9943a-eee8-47b4-8272-60cf628dd1aa>",
"WARC-Date": "2021-12-02T19:31:09Z",
"WARC-IP-Address": "208.123.73.199",
"WARC-Identified-Payload-Type": "application/rss+xml",
"WARC-Payload-Digest": "sha1:M2OIVHJY6VU2Z4K3FGOC3PVAOZVZHL3I",
"WARC-Record-ID": "<urn:uuid:e4f9a9b4-99b6-493b-ac28-f127dd17fee1>",
"WARC-Target-URI": "https://forum.netgate.com/topic/86063.rss",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:a34cb8bf-e86c-4efd-8c48-3c5aaa3003ff>"
},
"warc_info": "isPartOf: CC-MAIN-2021-49\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November/December 2021\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-12\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.3-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
125,
126,
183,
184,
264,
274,
275,
334,
344,
345,
420,
430,
431,
546,
637,
719,
811,
935,
936,
1098,
1099,
1100,
1101,
1102,
1103,
1107,
1762,
1763,
1767,
1871,
2020,
2021,
2106,
2107,
2132,
2267,
2530,
2624,
2625,
2626,
2630,
2734,
3004,
3005,
3260,
3261,
3474,
3475,
3479
],
"line_end_idx": [
125,
126,
183,
184,
264,
274,
275,
334,
344,
345,
420,
430,
431,
546,
637,
719,
811,
935,
936,
1098,
1099,
1100,
1101,
1102,
1103,
1107,
1762,
1763,
1767,
1871,
2020,
2021,
2106,
2107,
2132,
2267,
2530,
2624,
2625,
2626,
2630,
2734,
3004,
3005,
3260,
3261,
3474,
3475,
3479,
3582
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 3582,
"ccnet_original_nlines": 49,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.32678982615470886,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.06004618853330612,
"rps_doc_frac_lines_end_with_ellipsis": 0.019999999552965164,
"rps_doc_frac_no_alph_words": 0.2990761995315552,
"rps_doc_frac_unique_words": 0.4649122655391693,
"rps_doc_mean_word_length": 4.821052551269531,
"rps_doc_num_sentences": 65,
"rps_doc_symbol_to_word_ratio": 0.0034642000682651997,
"rps_doc_unigram_entropy": 5.130825519561768,
"rps_doc_word_count": 570,
"rps_doc_frac_chars_dupe_10grams": 0.05312955006957054,
"rps_doc_frac_chars_dupe_5grams": 0.10189229249954224,
"rps_doc_frac_chars_dupe_6grams": 0.09388645738363266,
"rps_doc_frac_chars_dupe_7grams": 0.05312955006957054,
"rps_doc_frac_chars_dupe_8grams": 0.05312955006957054,
"rps_doc_frac_chars_dupe_9grams": 0.05312955006957054,
"rps_doc_frac_chars_top_2gram": 0.022925760596990585,
"rps_doc_frac_chars_top_3gram": 0.022925760596990585,
"rps_doc_frac_chars_top_4gram": 0.032751090824604034,
"rps_doc_books_importance": -376.990234375,
"rps_doc_books_importance_length_correction": -376.990234375,
"rps_doc_openwebtext_importance": -225.59024047851562,
"rps_doc_openwebtext_importance_length_correction": -225.59024047851562,
"rps_doc_wikipedia_importance": -147.3967742919922,
"rps_doc_wikipedia_importance_length_correction": -147.3967742919922
},
"fasttext": {
"dclm": 0.15418750047683716,
"english": 0.9470745325088501,
"fineweb_edu_approx": 1.4311187267303467,
"eai_general_math": 0.22362011671066284,
"eai_open_web_math": 0.14196360111236572,
"eai_web_code": 0.8180214762687683
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-6,120,240,102,157,638,000 |
Home > Physics > The World’s Coldest Physics Lab
The World’s Coldest Physics Lab
An overview of the South Pole with the South Pole Station to the left of the runway and IceCube to the right. (Photo: NSF - Photographer: Forest Banks)
On December 18th, 2010, construction of the IceCube Neutrino Observatory in Antarctica was completed.
IceCube is
a massive ice-bound telescope that fills a cubic kilometer of deep Antarctic ice. The main IceCube detector now contains 5,160 optical sensors on 86 strings embedded two kilometers below the National Science Foundation’s Amundsen-Scott South Pole Station.
These researchers used a large water drill to bore 86 holes into the ice of Antarctica. The holes are approximately 2.5 kilometers deep and each took an average of 48 hours to drill.
Next, they installed sensors into each of these holes designed to detect neutrinos.
A sensor descends down a hole in the ice as part of the final season of IceCube. (Photo: NSF/B. Gudbjartsson)
Neutrinos are subatomic particles which are extremely abundant and rarely interact with matter. In fact, as Darren Grant, a University of Alberta physicist explained on this weeks episode of Quirks & Quarks, 10 billion neutrinos pass through your thumbnail every second! We never notice them though, because they very rarely interact with matter.
However, if you install enough detectors in the right kind of medium, eventually a neutrino will interact with that material and you will be able to see it.
So why ice? Well the Antarctic ice is both very thick and very transparent. When a neutrino eventually interacts with an ice molecule, it will emit what is called Cherenkov radiation. This is the same type of radiation that causes the weird blue glow in a nuclear reactor.
Cherenkov radiation glowing in the core of the Advanced Test Reactor. Via Wikipedia
On Quirks and Quarks, Dr. Grant explains that Cherenkov radiation is kind of like a “an optical equivalent of a sonic boom”. Basically after the neutrino interacts with the ice it will eject a muon from the ice molecule (a muon is an elementary particle similar to an electron, but 200 times bigger). As the muon travels through the ice, it travels faster than the speed of light through ice. This disrupts the electromagnetic field of neighbouring particles and generates the blue glow of Cherenkov radiation, which is then detected by IceCube.
[Aside: Some of you may be thinking “Whoa! How can it travel faster than the speed of light?”. Be assured that relativity still holds in this situation. That is because the muon is still travelling slower than the speed of light in a vacuum. Since light moves more slowly through ice than it does in a vacuum, the muon will travel faster than light through ice, but still slower than light through a vacuum.]
So why study neutrinos? Well they are quite useful to astronomers because they can travel from distant stars and galaxies without interacting with magnetic fields or matter. Thus they are like a direct messenger from whatever it is the scientist is studying.
Because of IceCube’s size, it is able to detect the highest energy neutrinos, allowing scientists to study supernova, gamma ray bursts and even dark matter.
You can listen to Dr. Grant’s Quirks & Quarks interview here.
Advertisements
1. January 20, 2011 at 2:35 pm
I really appreciate your aside on the speed of light. I was thinking exactly that, though I’m not much of a physicist, just a lowly programmer. Also, I’ve read more than a few articles on neutrino detectors, but this was a good explanation of it — especially Cherenkov radiation, the means by which neutrinos are “observed”. An optical “sonic boom” is a great analogy.
Good stuff, keep it up.
2. February 25, 2011 at 10:32 am
Cool! Read you ‘about’ page.. I’m a Trekkie too, grew up in Alberta and now I’m working in Texas. Kudos for being on FP :) One of my recipes made it there and I had a lot more traffic after that. Hope you pick up some subscribers from you day of fame :)
1. March 9, 2011 at 1:41 am
2. March 9, 2011 at 2:03 am
3. March 9, 2011 at 2:03 am
4. March 9, 2011 at 2:03 am
5. March 16, 2011 at 4:28 pm
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://aquantumofknowledge.wordpress.com/2011/01/17/the-worlds-coldest-physics-lab/",
"source_domain": "aquantumofknowledge.wordpress.com",
"snapshot_id": "crawl=CC-MAIN-2018-26",
"warc_metadata": {
"Content-Length": "81102",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VAEBMU4DJCWQ2R6BZY7EHEK2XSSZYHXM",
"WARC-Concurrent-To": "<urn:uuid:6ea861f1-0a42-4f93-a1ab-3bf648cc131d>",
"WARC-Date": "2018-06-20T22:26:48Z",
"WARC-IP-Address": "192.0.78.12",
"WARC-Identified-Payload-Type": "application/xhtml+xml",
"WARC-Payload-Digest": "sha1:IEEX4RVNKY2E7IFGCXGLAA2VHFV2HACD",
"WARC-Record-ID": "<urn:uuid:01db4706-0705-4207-9d25-6e93e8f621ad>",
"WARC-Target-URI": "https://aquantumofknowledge.wordpress.com/2011/01/17/the-worlds-coldest-physics-lab/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:341b2807-fefb-483d-b6ce-ad0459129dda>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-138-114-107.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,
49,
50,
82,
83,
235,
236,
338,
339,
350,
351,
607,
608,
791,
792,
876,
877,
987,
988,
1336,
1337,
1494,
1495,
1768,
1769,
1853,
1854,
2400,
2401,
2811,
2812,
3071,
3072,
3229,
3230,
3292,
3293,
3308,
3341,
3342,
3715,
3716,
3744,
3745,
3780,
3781,
4039,
4040,
4070,
4100,
4130,
4160,
4191,
4192,
4206,
4207,
4262,
4263,
4282,
4283,
4356,
4357,
4371,
4372,
4439,
4440,
4456,
4457,
4524,
4525,
4540,
4541,
4609,
4610,
4612,
4613,
4630,
4631
],
"line_end_idx": [
49,
50,
82,
83,
235,
236,
338,
339,
350,
351,
607,
608,
791,
792,
876,
877,
987,
988,
1336,
1337,
1494,
1495,
1768,
1769,
1853,
1854,
2400,
2401,
2811,
2812,
3071,
3072,
3229,
3230,
3292,
3293,
3308,
3341,
3342,
3715,
3716,
3744,
3745,
3780,
3781,
4039,
4040,
4070,
4100,
4130,
4160,
4191,
4192,
4206,
4207,
4262,
4263,
4282,
4283,
4356,
4357,
4371,
4372,
4439,
4440,
4456,
4457,
4524,
4525,
4540,
4541,
4609,
4610,
4612,
4613,
4630,
4631,
4653
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 4653,
"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.3689727485179901,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.01257861964404583,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.20335429906845093,
"rps_doc_frac_unique_words": 0.4597701132297516,
"rps_doc_mean_word_length": 4.661558151245117,
"rps_doc_num_sentences": 58,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.388463020324707,
"rps_doc_word_count": 783,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.07643835991621017,
"rps_doc_frac_chars_dupe_6grams": 0.03041096031665802,
"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.011506849899888039,
"rps_doc_frac_chars_top_3gram": 0.010958899743855,
"rps_doc_frac_chars_top_4gram": 0.013150679878890514,
"rps_doc_books_importance": -370.88836669921875,
"rps_doc_books_importance_length_correction": -370.88836669921875,
"rps_doc_openwebtext_importance": -211.83277893066406,
"rps_doc_openwebtext_importance_length_correction": -211.83277893066406,
"rps_doc_wikipedia_importance": -180.2833709716797,
"rps_doc_wikipedia_importance_length_correction": -180.2833709716797
},
"fasttext": {
"dclm": 0.3954143524169922,
"english": 0.9231844544410706,
"fineweb_edu_approx": 2.830422878265381,
"eai_general_math": 0.0031316298991441727,
"eai_open_web_math": 0.3234790563583374,
"eai_web_code": -0.0000071499998739454895
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "539.72",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Physics",
"level_3": "Nuclear physics and Matter"
}
},
"secondary": {
"code": "530.8",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Physics",
"level_3": ""
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "1",
"label": "News/Editorial"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "4",
"label": "Missing Images or Figures"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "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": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
6,894,271,348,245,463,000 |
How will my physical therapist know that I am participating in this study?
A physical therapist with the ARC trial will contact your treating physical therapist to make sure they know about the study and receive the appropriate treatment instructions. You will also be given a packet with information about the study to take with you to your first physical therapy visit.
Go to Top
|
{
"url": "https://shoulderstudy.org/faq_category/arc-trial-patient-faqs/page/2/",
"source_domain": "shoulderstudy.org",
"snapshot_id": "crawl=CC-MAIN-2022-21",
"warc_metadata": {
"Content-Length": "866787",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:L4TPZDDL5ASIZ7G5NQNFEVKDA2JTE4TQ",
"WARC-Concurrent-To": "<urn:uuid:0ff45174-7265-4aee-97b4-3a4b4e3b4069>",
"WARC-Date": "2022-05-26T10:43:56Z",
"WARC-IP-Address": "104.21.90.64",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:D7LDX4D7WEWAILZZGB224QEYJC6I225N",
"WARC-Record-ID": "<urn:uuid:864694a2-65a5-41cf-9e70-80403f20af84>",
"WARC-Target-URI": "https://shoulderstudy.org/faq_category/arc-trial-patient-faqs/page/2/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:e9b9e83e-eaf9-4ac3-b023-6b47ff72723f>"
},
"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,
75,
76,
373,
374
],
"line_end_idx": [
75,
76,
373,
374,
383
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 383,
"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.5294117331504822,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.04411764815449715,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.04411764815449715,
"rps_doc_frac_unique_words": 0.6615384817123413,
"rps_doc_mean_word_length": 4.830769062042236,
"rps_doc_num_sentences": 4,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 3.608997344970703,
"rps_doc_word_count": 65,
"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.1624203771352768,
"rps_doc_frac_chars_top_3gram": 0.08280254900455475,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -17.796037673950195,
"rps_doc_books_importance_length_correction": -17.796037673950195,
"rps_doc_openwebtext_importance": -12.546172142028809,
"rps_doc_openwebtext_importance_length_correction": -12.546172142028809,
"rps_doc_wikipedia_importance": -11.591455459594727,
"rps_doc_wikipedia_importance_length_correction": -11.591455459594727
},
"fasttext": {
"dclm": 0.5932192802429199,
"english": 0.9548590779304504,
"fineweb_edu_approx": 1.5388665199279785,
"eai_general_math": 0.0004990100278519094,
"eai_open_web_math": 0.18204104900360107,
"eai_web_code": -0.000005360000159271294
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "617.1",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Surgery and Dentistry"
}
},
"secondary": {
"code": "610.73",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": ""
}
}
},
"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": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "9",
"label": "FAQ"
},
"secondary": {
"code": "21",
"label": "Customer Support"
}
},
"reasoning_depth": {
"primary": {
"code": "1",
"label": "No 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": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
8,510,530,855,701,557,000 |
Service Providers
NetIron sFlow Enhancements
by pmoyer on 06-18-2013 08:52 AM (861 Views)
sFlow is a very interesting technology that often gets overlooked in terms of network management, operations and performance. That’s a shame; as it can be a very powerful tool in the network operator’s tool-kit. In this brief blog, I hope to shed some light on the appealing advantages of sFlow. To start with - if you are a network operator and you are not gathering network statistics from sFlow, I hope you will carefully read this blog!
While the title of this blog says enhancements to sFlow, I’d like to focus a good portion of this piece on sFlow itself and explain why it’s not just useful, but why it should be considered a necessary component of any overall network architecture. I’ll also point out some differences between sFlow, NetFlow and IPFIX (since I frequently get asked about these when I talk about sFlow with customers).
sFlow Overview
sFlow was originally developed by InMon and has been published in Informational RFC 3176. In a nutshell, sFlow is the leading, multi-vendor, standard for monitoring high-speed switched and routed networks. Additional information can be found at sFlow.org.
sFlow relies on sampling; which enables it to scale to the highest speed interfaces, such as 100GbE. It provides very powerful statistics and this data can be aggregated into very edifying graphs. Here is a pretty cool animation describing sFlow in operation. sFlow provides enhanced network visibility & traffic analysis; can contribute relevant data to an overall network security solution; and can be used for SLA verification, accounting and billing purposes. sFlow has been implemented in network switches & routers for many years and is now often implemented in end hosts.
Here are some publicly available sFlow generated graphs from AMS-IX (the sFlow samples are taken from Brocade NetIron routers).
Here is another simple output from sFlow, showing the top talkers in a specific IP subnet.
sflow_graph.jpg
Short Comparison of sFlow, Netflow and IPFIX
While sFlow was explicitly invented as an open standards based protocol for network monitoring, Netflow was originally developed to accelerate IP routing functionality in Cisco routers (it remains proprietary to Cisco). The technology was subsequently modified to support network monitoring functions instead of providing accelerated IP routing; however, it can exhibit performance problems on high-speed interfaces. Furthermore, sFlow can provide visibility and network statistics from L2 – L7 of the network stack, while Netflow is predominantly used for L3 – L4 (there is now limited L2 support in Netflow but there is still no MPLS support).
Another key difference between the two protocols is that sFlow is a packet sampling technology; while Netflow attempts to capture entire flows. Attempting to capture an entire flow often leads to performance problems on high-speed interfaces, which are interfaces of 10GbE and beyond.
IPFIX is an IETF standards based protocol for extracting IP flow information from routers. It was derived from Netflow (specifically, Version 9 of Netflow). IPFIX is standardized in RFC 5101, 5102, and 5103. As its name correctly implies, IPFIX remains specific to L3 of the network stack. It is not as widely implemented in networking gear as sFlow is.
sFlow and OpenFlow?
There is some recent activity around integrating sFlow with OpenFlow to provide some unique “performance aware” SDN applications. For example, take a look at this diagram:
sflow-rt.jpg
In this example, sFlow is used to provide the real-time network performance characteristics to the SDN application running on top of an OpenFlow controller, and OpenFlow is used to re-program the forwarding paths to more efficiently utilize the available infrastructure. Pretty slick, huh? This example uses sFlow-RT, a real-time analytics engine, in place of a normal sFlow collector.
NetIron sFlow Implementation Enhancements
Brocade devices have been implementing sFlow in hardware for many years. This hardware based implementation provides key advantages in terms of performance. The sampling rate is configurable and sFlow provides packet header information for ingress and egress interfaces. sFlow can provide visibility in the default VRF and non-default VRFs. NetIron devices support sFlow v5, which replaces the version outlined in RFC 3176.
In addition to the standard rate-based sampling capability, NetIron devices are capable of using an IPv4 or IPv6 ACL to select which traffic is to be sampled and sent to the sFlow collector. This capability provides more of a flow-based sampling option, rather than just sampling packets based on a specified rate. In addition to sampling L2 and L3 information, sFlow can be configured to sample VPN endpoint interfaces to provide MPLS visibility. Neither Netflow nor IPFIX can provide this type of visibility.
One of the new enhancements to the NetIron sFlow implementation is the ability to provide Null0 interface sampling. Service providers often use the Null0 interface to drop packets during Denial of Service (DoS) attacks. sFlow can now be configured to sample those dropped packets to provide visibility into the DoS attack. This feature is in NetIron Software Release 5.5.
The other new enhancement that I’d like to mention is the ability to now capture the MPLS tunnel name/ID when sampling on ingress interfaces. This feature is coming very soon and will provide additional visibility into MPLS-based networks.
In summary, I hope you gained some additional insight into the advantages of leveraging the network visibility that sFlow provides. One last thing I’d like to correlate to sFlow is Network Analytics. These are complementary technologies which can co-exist together in the same network, while performing different functions. Brocade continues to innovate in both of these areas and I welcome any questions or comments you may have on sFlow or Network Analytics.
Labels
|
{
"url": "http://community.brocade.com/t5/Service-Providers/NetIron-sFlow-Enhancements/ba-p/36024",
"source_domain": "community.brocade.com",
"snapshot_id": "crawl=CC-MAIN-2016-26",
"warc_metadata": {
"Content-Length": "111050",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QQ5TLC3CXDFAJMMNQFPLX6XAIMDT3VKO",
"WARC-Concurrent-To": "<urn:uuid:db8bddb0-f6ac-40ba-a47e-f361d075321b>",
"WARC-Date": "2016-06-24T21:59:12Z",
"WARC-IP-Address": "208.74.205.127",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:ONEMXPGHV4UH6OYB55HQHXGC4K75GZI4",
"WARC-Record-ID": "<urn:uuid:66e589f2-aaf1-4eac-855c-d882659a17b2>",
"WARC-Target-URI": "http://community.brocade.com/t5/Service-Providers/NetIron-sFlow-Enhancements/ba-p/36024",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:61669056-7f3e-4243-a61b-1e4d560c1d8a>"
},
"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,
18,
19,
46,
47,
93,
94,
535,
536,
938,
939,
954,
955,
956,
1212,
1213,
1792,
1793,
1921,
1922,
2013,
2014,
2030,
2031,
2076,
2077,
2078,
2724,
2725,
3010,
3011,
3365,
3366,
3386,
3387,
3388,
3560,
3561,
3574,
3575,
3576,
3962,
3963,
4005,
4006,
4007,
4431,
4432,
4943,
4944,
4945,
5317,
5318,
5319,
5559,
5560,
5561,
6022,
6023
],
"line_end_idx": [
18,
19,
46,
47,
93,
94,
535,
536,
938,
939,
954,
955,
956,
1212,
1213,
1792,
1793,
1921,
1922,
2013,
2014,
2030,
2031,
2076,
2077,
2078,
2724,
2725,
3010,
3011,
3365,
3366,
3386,
3387,
3388,
3560,
3561,
3574,
3575,
3576,
3962,
3963,
4005,
4006,
4007,
4431,
4432,
4943,
4944,
4945,
5317,
5318,
5319,
5559,
5560,
5561,
6022,
6023,
6029
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6029,
"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.3702359199523926,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.042649731040000916,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1388384848833084,
"rps_doc_frac_unique_words": 0.4164882302284241,
"rps_doc_mean_word_length": 5.275160789489746,
"rps_doc_num_sentences": 55,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 5.341612815856934,
"rps_doc_word_count": 934,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.016237059608101845,
"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.008524459786713123,
"rps_doc_frac_chars_top_3gram": 0.005480010062456131,
"rps_doc_frac_chars_top_4gram": 0.008118529804050922,
"rps_doc_books_importance": -536.9013671875,
"rps_doc_books_importance_length_correction": -536.9013671875,
"rps_doc_openwebtext_importance": -302.8924560546875,
"rps_doc_openwebtext_importance_length_correction": -302.8924560546875,
"rps_doc_wikipedia_importance": -210.12921142578125,
"rps_doc_wikipedia_importance_length_correction": -210.12921142578125
},
"fasttext": {
"dclm": 0.034972429275512695,
"english": 0.9353328347206116,
"fineweb_edu_approx": 2.3842756748199463,
"eai_general_math": 0.6766703128814697,
"eai_open_web_math": 0.35480326414108276,
"eai_web_code": 0.5254509449005127
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "004.6",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
},
"secondary": {
"code": "005.1",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-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": "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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
1,515,600,043,903,063,000 |
Super User is a question and answer site for computer enthusiasts and power users. It's 100% free, no registration required.
Sign up
Here's how it works:
1. Anybody can ask a question
2. Anybody can answer
3. The best answers are voted up and rise to the top
I have an Outlook server with 1 email address. ([email protected]) I want three users to have aliases for that email: [email protected], [email protected], and [email protected].
I want all three aliases to be active. For instance, say Alice receives an email. It would go to [email protected] and be labeled for Alice. (I can do auto labeling without difficulty.)
However, when she replies to the person who wrote her, I'd like them to see her email as [email protected], not [email protected].
Is this functionality available directly in Outlook settings? I am currently using both Outlook 2007 and Outlook 2010.
share|improve this question
Do the other accounts exist? – wizlog Feb 28 '13 at 17:59
You should be able to do this when you setup the account on the machine itself. – Ramhound Feb 28 '13 at 18:21
I don't know a lot about Outlook specifically, but wouldn't the easiest way for this be to add the office inbox to alice, bob and carols clients? They will have two separate inboxes, but that might be a good thing, and when they reply from the shared inbox I'm pretty sure it will show up as being sent from the e-mail that the shared inbox belongs to – pzkpfw Feb 28 '13 at 20:25
Your Answer
discard
By posting your answer, you agree to the privacy policy and terms of service.
Browse other questions tagged or ask your own question.
|
{
"url": "http://superuser.com/questions/558889/sending-email-as-an-alias-in-outlook",
"source_domain": "superuser.com",
"snapshot_id": "crawl=CC-MAIN-2016-07",
"warc_metadata": {
"Content-Length": "68240",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:TVEYZZ5HWTU4YMNTQ5WN6CGKKNLKCWC3",
"WARC-Concurrent-To": "<urn:uuid:06a403bd-f2a9-43ae-a80e-1cd08ef8d5a2>",
"WARC-Date": "2016-02-12T12:29:43Z",
"WARC-IP-Address": "104.16.126.192",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:YIFJLYW54LMVNHD5NVFONRT5VXNJHJFZ",
"WARC-Record-ID": "<urn:uuid:79955649-7ce5-4731-a3b1-96b9e49a337d>",
"WARC-Target-URI": "http://superuser.com/questions/558889/sending-email-as-an-alias-in-outlook",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:46e3babc-4389-4622-9b3b-138e3f875aa0>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-236-182-209.ec2.internal\r\nsoftware: Nutch 1.6 (CC)/CC WarcExport 1.0\r\nisPartOf: CC-MAIN-2016-07\r\noperator: CommonCrawl Admin\r\ndescription: Wide crawl of the web for February 2016\r\npublisher: CommonCrawl\r\nformat: WARC File Format 1.0\r\nconformsTo: http://bibnum.bnf.fr/WARC/WARC_ISO_28500_version1_latestdraft.pdf"
}
|
{
"line_start_idx": [
0,
125,
126,
134,
155,
187,
211,
266,
267,
441,
442,
628,
629,
759,
760,
879,
880,
908,
913,
971,
976,
1087,
1092,
1473,
1474,
1486,
1487,
1489,
1497,
1498,
1576,
1577
],
"line_end_idx": [
125,
126,
134,
155,
187,
211,
266,
267,
441,
442,
628,
629,
759,
760,
879,
880,
908,
913,
971,
976,
1087,
1092,
1473,
1474,
1486,
1487,
1489,
1497,
1498,
1576,
1577,
1632
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 1632,
"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.3962264060974121,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.021563339978456497,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.23450134694576263,
"rps_doc_frac_unique_words": 0.5943060517311096,
"rps_doc_mean_word_length": 4.4590744972229,
"rps_doc_num_sentences": 26,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.848058223724365,
"rps_doc_word_count": 281,
"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.011971269734203815,
"rps_doc_frac_chars_top_3gram": 0.016759779304265976,
"rps_doc_frac_chars_top_4gram": 0.021548280492424965,
"rps_doc_books_importance": -171.1685028076172,
"rps_doc_books_importance_length_correction": -157.3824005126953,
"rps_doc_openwebtext_importance": -99.23677825927734,
"rps_doc_openwebtext_importance_length_correction": -99.23677825927734,
"rps_doc_wikipedia_importance": -87.6738052368164,
"rps_doc_wikipedia_importance_length_correction": -74.76876068115234
},
"fasttext": {
"dclm": 0.2717289924621582,
"english": 0.9288567304611206,
"fineweb_edu_approx": 1.3242284059524536,
"eai_general_math": 0.000806869997177273,
"eai_open_web_math": 0.14237409830093384,
"eai_web_code": -0.000004649999937100802
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "005.442",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computer programming"
}
},
"secondary": {
"code": "004.67",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "5",
"label": "Social/Forum"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "18",
"label": "Q&A Forum"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "1",
"label": "No Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "6",
"label": "Not Applicable/Indeterminate"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "2",
"label": "High School Level"
},
"secondary": {
"code": "1",
"label": "General Audience"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-4,296,331,620,009,257,000 |
Research Highlights
Gail Tomlinson
Gail Tomlinson, MD
Acute lymphoblastic leukemia (ALL) is the most common childhood malignancy and the U.S. Surveillance Epidemiology and End Results (SEER) registry reports that Hispanic children have the highest incidence of ALL; however, it is unclear if this is due to genetic factors, unique environmental exposures, or both. Previous research has shown that there is an association between CYP1A1 gene variants and ALL. In order to investigate whether there was a specific genetic abnormality that could be statistically associated with a particular ethnic group, collaborative studies between Drs. Tomlinson and Pollock were undertaken to analyze genetic factors in blood samples from 258 children (Caucasian, Hispanic, and African-American) diagnosed with ALL in Central-South Texas. Allele frequencies among the cases and controls in each ethnic group were compared using the Chi-square test.
Increased risk of developing ALL was found in the whole sample group for homozygosity of variant alleles at CYP1A1*2C. Of note, stratified analyses showed not only increased risks in the Hispanic group, but also that Hispanic normal control subjects were significantly more likely to be carriers of variant alleles as compared to Caucasians and African Americans. This study suggests that polymorphisms in CYP1A1 may contribute to the increased risk of ALL in Hispanic children due to both their impact on leukemia susceptibility and the increased prevalence of the at-risk alleles in the Hispanic population.
This is the first investigation that links the prevalence CYP1A1 polymorphisms to the increased susceptibility of ALL in Hispanic children. Additionally, the CYP1A1*2A allele is reported to be associated with increased enzymatic activity. As a consequence, individuals carrying the at-risk alleles are more likely to be at higher risk when exposed to carcinogens. The results of this study provide a novel and specific link between CYP1A1 polymorphisms and ethnic influence on ALL risk that may be related to varying susceptibility across ethnic groups to environmental toxins.
Click here for the publication
|
{
"url": "http://www.ctrc.net/ctrc3.cfm?mid=4233&pid=2020",
"source_domain": "www.ctrc.net",
"snapshot_id": "crawl=CC-MAIN-2014-10",
"warc_metadata": {
"Content-Length": "38867",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:6GGELHLATC5CVDFIGLO3L456PXBSTK6F",
"WARC-Concurrent-To": "<urn:uuid:8402d137-007b-4708-960f-a7c49e265f2b>",
"WARC-Date": "2014-03-11T13:10:10Z",
"WARC-IP-Address": "129.111.230.40",
"WARC-Identified-Payload-Type": null,
"WARC-Payload-Digest": "sha1:N4JEJWZFENYEDG2STM64ASYRBRQCMAQ5",
"WARC-Record-ID": "<urn:uuid:5193babe-67d3-4ab5-8a12-510eef637e68>",
"WARC-Target-URI": "http://www.ctrc.net/ctrc3.cfm?mid=4233&pid=2020",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:9def53df-7e38-4f9b-a698-812e486c80d0>"
},
"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,
20,
21,
36,
55,
56,
938,
939,
1549,
1550,
2128,
2129
],
"line_end_idx": [
20,
21,
36,
55,
56,
938,
939,
1549,
1550,
2128,
2129,
2159
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2159,
"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.3814713954925537,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.054495908319950104,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.1089918315410614,
"rps_doc_frac_unique_words": 0.528124988079071,
"rps_doc_mean_word_length": 5.612500190734863,
"rps_doc_num_sentences": 15,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.747339725494385,
"rps_doc_word_count": 320,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.025612469762563705,
"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.011135860346257687,
"rps_doc_frac_chars_top_3gram": 0.016703790053725243,
"rps_doc_frac_chars_top_4gram": 0.015590200200676918,
"rps_doc_books_importance": -146.92782592773438,
"rps_doc_books_importance_length_correction": -146.92782592773438,
"rps_doc_openwebtext_importance": -88.65937042236328,
"rps_doc_openwebtext_importance_length_correction": -88.65937042236328,
"rps_doc_wikipedia_importance": -51.433536529541016,
"rps_doc_wikipedia_importance_length_correction": -51.433536529541016
},
"fasttext": {
"dclm": 0.2121860384941101,
"english": 0.9530783295631409,
"fineweb_edu_approx": 3.1088294982910156,
"eai_general_math": 0.36140501499176025,
"eai_open_web_math": 0.3241824507713318,
"eai_web_code": 0.006225999910384417
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "616.99442072",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Pathology and Diseases"
}
},
"secondary": {
"code": "616.99442",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Pathology and Diseases"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "4",
"label": "Analyze"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "2",
"label": "Academic/Research"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"missing_content": {
"primary": {
"code": "2",
"label": "Click Here References"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "3",
"label": "Academic Writing"
},
"secondary": {
"code": "13",
"label": "News (Org.)"
}
},
"reasoning_depth": {
"primary": {
"code": "3",
"label": "Intermediate Reasoning"
},
"secondary": {
"code": "2",
"label": "Basic Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-8,295,080,063,678,439,000 |
Diet Tips
The Ultimate Guide to Probiotics: Questions and Answers
Probiotics are a hot topic these days. Everyone is talking about them, and for good reason – they offer a wealth of health benefits. But what are probiotics? And what do they do?
In this article, we will answer all of your questions about probiotics! We will cover everything from what they are to how they work to the benefits that you can expect to see from taking them.
Additionally, we’ll share some cutting edge new studies, which showcase the power of probiotics for mood and cognitive support.
So if you want to learn more about the power of probiotics, keep reading!
What are probiotics and what do they do?
What are probiotics? Probiotics are live bacteria that line the gut and support digestive health. They are sometimes called “good” or “friendly” bacteria because they help to keep things in balance, keeping our microbiome in harmony, and preventing harmful bacteria from taking over.
What is the gut microbiome and how does it affect our health?
The human microbiome is made up of bacteria, viruses, fungi, and other microorganisms. There are an estimated 100 trillion microbes living on and in our bodies, outnumbering our human cells by 10 to 1! The gut microbiota is the community of bacteria that live in our gut. This community of bacteria plays a huge role in our health, affecting everything from our weight to our mood. The gut microbiota is so important that scientists are now calling it “the forgotten organ”!
What are the benefits of taking probiotics?
There are a number of benefits that you can experience from taking probiotics, including:
-Improved Digestive Health: Probiotics help to keep our gut microbiota in balance, which is important for optimal digestive health. They also help to increase the absorption of nutrients from food and boost our immune system.
-Better Mood Health: Probiotics may help to improve mental health by reducing mood related issues.
-Improved Skin Health: Probiotics can help to keep our skin healthy by fighting off harmful bacteria and fungus. They can also help to reduce acne and other skin-related issues.
-Weight Loss Support: Probiotics may help to promote weight loss by increasing the absorption of nutrients from food and helping to reduce inflammation.
How do you determine which probiotic supplements or foods are right for you?
Not all probiotic are created equally, so it is important to do your research before choosing a supplement or food. Here are a few tips on how to determine which probiotic is right for you:
Histamine-Sensitive: If you are histamine-sensitive, look for a probiotic that contains non-histamine producing strains.
CFU Count : The number of colony forming units (CFUs) in a probiotic is an indicator of its potency. Look for a product that has a high CFU count to ensure that you are getting the most bang. 20 billion+ is generally good.
Targeted Strains: Not all probiotics work the same way, so it is important to choose one that targets the issues you are looking to support. For instance, some specific probiotics can support mood and stress!
Read the label: When choosing a probiotic supplement, be sure to read the label carefully. Try to choose a probiotic that has minimal ‘added ingredients’
Probiotics benefits – what can we expect from taking them long-term?
There is a lot of excitement about the potential probiotic benefits. The hope is that by taking them regularly, we can enjoy better overall health and reduce our risk of health issues. But what are the specific things we can expect from probiotics over the long term?
The truth is, scientists are still exploring all the ways that probiotic can benefit our health. But some of the potential benefits that have been seen include:
– A stronger immune system
– Reduced inflammation throughout the body
– Improved digestion and gut health
– Better moods, including reduced mood-related issues
– Fewer sniffles and colds
What’s the best time of day to take probiotics?
There is no one right answer to this question. Some people prefer to take their probiotics in the morning, while others find that they work better at night. It really depends on what works best for you. Just be sure to take them at around the same time each day so that you can get the most benefit from them. Also, our Lifted Naturals MOOD Probiotics are best taken with food. That further helps the good bacteria get where it needs to go, by making the stomach less acidic.
Probiotics For The Win
As you can see, probiotics offer a wealth of health benefits! They work by restoring the balance of good and bad bacteria in your gut. This is important because a healthy gut microbiota is essential for optimal health. Probiotic help to keep our gut microbiota in balance, which is important for optimal digestive health. They also help to increase the absorption of nutrients from food and boost our immune system.
So if you are looking for a way to improve your health, probiotics may be a serious part of the solution!
Health2Wellness
We are nutritionist, health writer's, and food bloggers. Check it out our latest health & wellness articles on fitness, diet, and healthy living.
Share
Published by
Health2Wellness
Recent Posts
Caring For Seniors with Dementia: The Importance of Meeting Unmet Needs
You might know how embarrassing it can be if you have ever gone blank when… Read More
September 25, 2023
How to Decide Which Anxiety Treatment to Choose
It's only in recent decades that society has begun to fully accept that anxiety is… Read More
September 19, 2023
Revolutionizing Peptide-Based Drug Delivery Medicine
Groundbreaking developments in the dynamic field of pharmaceuticals have resulted from the search for more… Read More
September 19, 2023
Exploring Three Behavioural Addictions: Gambling, Pornography and Gaming
Introduction When we think of addiction, substances like drugs and alcohol often come to mind.… Read More
September 16, 2023
The Art of Mindful Living: A Beginner’s Guide
Mindfulness has garnered a lot of attention in recent years, becoming an increasingly important concept… Read More
September 14, 2023
The Pros and Cons of Self-Diagnosis
In today's digital age, with the vast expanse of information just a click away, it… Read More
September 12, 2023
|
{
"url": "https://www.health2wellnessblog.com/the-ultimate-guide-to-probiotics/amp/",
"source_domain": "www.health2wellnessblog.com",
"snapshot_id": "CC-MAIN-2023-40",
"warc_metadata": {
"Content-Length": "84944",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:WKMXYPYZOEMDNXFDTSFIXMLFGO2VS4IB",
"WARC-Concurrent-To": "<urn:uuid:5973170d-b03b-4b67-be1a-0601b0077229>",
"WARC-Date": "2023-09-29T00:25:42Z",
"WARC-IP-Address": "66.29.141.227",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:HZAJT3AAB5FVRRWVQZ54AGSOBHOSFU2R",
"WARC-Record-ID": "<urn:uuid:7c03e100-dd05-48b0-9dd6-e684877a0047>",
"WARC-Target-URI": "https://www.health2wellnessblog.com/the-ultimate-guide-to-probiotics/amp/",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:5ebd4d20-c999-4a75-9d19-f0a3395d6250>"
},
"warc_info": "isPartOf: CC-MAIN-2023-40\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for September/October 2023\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-18\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,
10,
11,
67,
68,
247,
248,
442,
443,
571,
572,
646,
647,
688,
689,
973,
974,
1036,
1037,
1513,
1514,
1558,
1559,
1649,
1650,
1876,
1877,
1976,
1977,
2155,
2156,
2309,
2310,
2387,
2388,
2578,
2579,
2700,
2701,
2924,
2925,
3134,
3135,
3289,
3290,
3359,
3360,
3628,
3629,
3790,
3791,
3818,
3819,
3862,
3863,
3899,
3900,
3954,
3955,
3982,
3983,
4031,
4032,
4508,
4509,
4532,
4533,
4949,
4950,
5056,
5057,
5073,
5074,
5220,
5221,
5227,
5240,
5256,
5257,
5270,
5271,
5343,
5344,
5430,
5431,
5450,
5451,
5499,
5500,
5594,
5595,
5614,
5615,
5668,
5669,
5787,
5788,
5807,
5808,
5881,
5882,
5988,
5989,
6008,
6009,
6055,
6056,
6171,
6172,
6191,
6192,
6228,
6229,
6323,
6324
],
"line_end_idx": [
10,
11,
67,
68,
247,
248,
442,
443,
571,
572,
646,
647,
688,
689,
973,
974,
1036,
1037,
1513,
1514,
1558,
1559,
1649,
1650,
1876,
1877,
1976,
1977,
2155,
2156,
2309,
2310,
2387,
2388,
2578,
2579,
2700,
2701,
2924,
2925,
3134,
3135,
3289,
3290,
3359,
3360,
3628,
3629,
3790,
3791,
3818,
3819,
3862,
3863,
3899,
3900,
3954,
3955,
3982,
3983,
4031,
4032,
4508,
4509,
4532,
4533,
4949,
4950,
5056,
5057,
5073,
5074,
5220,
5221,
5227,
5240,
5256,
5257,
5270,
5271,
5343,
5344,
5430,
5431,
5450,
5451,
5499,
5500,
5594,
5595,
5614,
5615,
5668,
5669,
5787,
5788,
5807,
5808,
5881,
5882,
5988,
5989,
6008,
6009,
6055,
6056,
6171,
6172,
6191,
6192,
6228,
6229,
6323,
6324,
6342
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6342,
"ccnet_original_nlines": 114,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.41044774651527405,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.004145939834415913,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.14096185564994812,
"rps_doc_frac_unique_words": 0.3760765492916107,
"rps_doc_mean_word_length": 4.887081146240234,
"rps_doc_num_sentences": 56,
"rps_doc_symbol_to_word_ratio": 0.004975120071321726,
"rps_doc_unigram_entropy": 5.314958572387695,
"rps_doc_word_count": 1045,
"rps_doc_frac_chars_dupe_10grams": 0.05991775915026665,
"rps_doc_frac_chars_dupe_5grams": 0.10593303292989731,
"rps_doc_frac_chars_dupe_6grams": 0.09026826173067093,
"rps_doc_frac_chars_dupe_7grams": 0.07930292189121246,
"rps_doc_frac_chars_dupe_8grams": 0.07244957983493805,
"rps_doc_frac_chars_dupe_9grams": 0.05991775915026665,
"rps_doc_frac_chars_top_2gram": 0.010573719628155231,
"rps_doc_frac_chars_top_3gram": 0.01997259072959423,
"rps_doc_frac_chars_top_4gram": 0.007636580150574446,
"rps_doc_books_importance": -521.8660888671875,
"rps_doc_books_importance_length_correction": -521.8660888671875,
"rps_doc_openwebtext_importance": -266.9838562011719,
"rps_doc_openwebtext_importance_length_correction": -266.9838562011719,
"rps_doc_wikipedia_importance": -193.0588836669922,
"rps_doc_wikipedia_importance_length_correction": -193.0588836669922
},
"fasttext": {
"dclm": 0.05269050970673561,
"english": 0.9484690427780151,
"fineweb_edu_approx": 2.2005579471588135,
"eai_general_math": 0.005827370099723339,
"eai_open_web_math": 0.1663387417793274,
"eai_web_code": 0.0011363000376150012
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "613.2",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Health and Hygiene"
}
},
"secondary": {
"code": "615.5",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Materia medica, Drugs, and Pharmacy"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "3",
"label": "Irrelevant Content"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"document_type_v2": {
"primary": {
"code": "9",
"label": "FAQ"
},
"secondary": {
"code": "10",
"label": "Knowledge Article"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "3",
"label": "Mostly Correct"
},
"secondary": {
"code": "4",
"label": "Highly Correct"
}
},
"education_level": {
"primary": {
"code": "1",
"label": "General Audience"
},
"secondary": {
"code": "2",
"label": "High School Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-1,705,551,533,371,593,000 |
Intermittent catheter techniques, strategies and catheter designs for managing long-term bladder conditions
Review question
There are different catheterisation techniques, strategies and catheter designs which may affect symptomatic urinary tract infection (UTI; a bladder infection detected through urine testing where the person has symptoms of infection), other complications and user preference.
In this review, we focussed on these outcomes in people who used aseptic or clean catheterisation techniques, single or multiple-use catheters and different designs of catheter (e.g. coated or uncoated, standard or compact length) to determine if one approach or design is better than another.
Background
Intermittent catheterisation is a common strategy used by people who have bladder emptying problems. A hollow tube (catheter) is passed through the channel to the bladder (urethra) or through a surgically made channel to the skin surface. The catheter is emptied regularly, usually several times every day. Intermittent catheterisation can be done by a healthcare professional or by the person (or carer) themselves. There are various approaches to intermittent catheterisation which could impact on infection, other complications and user experience.
There are four main types of intervention considered in this review which might make a difference to users or to costs.
Techniques: Aseptic versus clean
An ‘aseptic technique’ is used in healthcare settings, with specially packaged sterile equipment (gloves, lubricant and catheter) and a technique that avoids the catheter coming into contact with anything non-sterile (including hands, equipment and surfaces) before it is inserted.
People inserting their own catheters use a ‘clean’ technique, where the environment is kept as clean as possible and a sterile or clean (multiple-use) catheter is used without the need for gloves.
Strategies: Single-use versus multiple-use
There are two types of catheter use: single-use and multiple-use. Re-use of catheters means that the catheter is cleaned and re-used a varying number of times (e.g. for up to 24 hours or for one week/month).
Design: Uncoated versus hydrophilic-coated
Uncoated catheters are typically clear PVC and packed individually in sterile packaging. They may be supplied pre-lubricated, or used with a separate lubricant or water to aid insertion.
Hydrophilic-coated catheters have a slippery coating and either are supplied ready to use, or require the addition of water.
Design: Shorter versus standard length
Catheters come in varying sizes and lengths to suit men, women and children, and people's different needs.
How up-to-date is this review?
We searched for evidence that had been published up to 12 April 2021.
Study characteristics
We found 23 trials (involving a total of 1339 children and adults using intermittent catheterisation for bladder emptying) comparing different catheterisation techniques and catheter designs.
Key results
Aseptic versus clean techniques
We are uncertain if there is any difference between aseptic and clean techniques in the risk of symptomatic UTI. We identified no data relating to the risk of adverse events.
Single-use (sterile) catheter versus multiple-use (clean)
We are uncertain if there is any difference between single-use and multiple-use catheters in the risk of symptomatic UTI because the certainty of evidence is low. One study comparing these interventions reported zero adverse events in either group and no other adverse event data were reported.
Hydrophilic-coated catheters versus uncoated catheters
We are uncertain if there is any difference between hydrophilic and uncoated catheters in the number of people with symptomatic UTI. Uncoated catheters probably slightly reduce the risk of urethral trauma and bleeding compared to hydrophilic-coated catheters. We are uncertain if there is any difference in patient satisfaction or preference.
One catheter length versus another catheter length
We are uncertain if there is any difference between one catheter length versus another catheter length for all included outcomes.
We identified no useable evidence relating to cost-effectiveness for any of the comparisons.
Certainty of the evidence
The current research evidence is uncertain and design and reporting issues are significant. There are many factors that could limit the generalisability of findings, for example, the study setting (e.g. hospital or home), sex of participants, variability in adherence to user instructions and whether catheterisation is undertaken by the user or another person. More well-designed trials are needed. Such trials should include analysis of cost-effectiveness because there are likely to be substantial differences associated with the use of different catheter designs, catheterisation techniques and strategies.
Authors' conclusions:
Despite a total of 23 trials, the paucity of useable data and uncertainty of the evidence means that it remains unclear whether the incidence of UTI or other complications is affected by use of aseptic or clean technique, single (sterile) or multiple-use (clean) catheters, coated or uncoated catheters or different catheter lengths. The current research evidence is uncertain and design and reporting issues are significant. More well-designed trials are needed. Such trials should include analysis of cost-effectiveness because there are likely to be substantial differences associated with the use of different catheterisation techniques and strategies, and catheter designs.
Read the full abstract...
Background:
Intermittent catheterisation (IC) is a commonly recommended procedure for people with incomplete bladder emptying. Frequent complications are urinary tract infection (UTI), urethral trauma and discomfort during catheter use. Despite the many designs of intermittent catheter, including different lengths, materials and coatings, it is unclear which catheter techniques, strategies or designs affect the incidence of UTI and other complications, measures of satisfaction/quality of life and cost-effectiveness.
This is an update of a Cochrane Review first published in 2007.
Objectives:
To assess the clinical and cost-effectiveness of different catheterisation techniques, strategies and catheter designs, and their impact, on UTI and other complications, and measures of satisfaction/quality of life among adults and children whose long-term bladder condition is managed by intermittent catheterisation.
Search strategy:
We searched the Cochrane Incontinence Specialised Register, which contains trials identified from the Cochrane Central Register of Controlled Trials (CENTRAL), MEDLINE, MEDLINE In-Process, MEDLINE Epub Ahead of Print, CINAHL, ClinicalTrials.gov, WHO ICTRP and handsearching of journals and conference proceedings (searched 12 April 2021), the reference lists of relevant articles and conference proceedings, and we attempted to contact other investigators for unpublished data or for clarification.
Selection criteria:
Randomised controlled trials (RCTs) or randomised cross-over trials comparing at least two different catheterisation techniques, strategies or catheter designs.
Data collection and analysis:
As per standard Cochrane methodological procedures, two review authors independently extracted data, assessed risk of bias and assessed the certainty of evidence using GRADE. Outcomes included the number of people with symptomatic urinary tract infections, complications such as urethral trauma/bleeding, comfort and ease of use of catheters, participant satisfaction and preference, quality of life measures and economic outcomes.
Main results:
We included 23 trials (1339 randomised participants), including twelve RCTs and eleven cross-over trials. Most were small (fewer than 60 participants completed), although three trials had more than 100 participants. Length of follow-up ranged from one month to 12 months and there was considerable variation in definitions of UTI. Most of the data from cross-over trials were not presented in a useable form for this review.
Risk of bias was unclear in many domains due to insufficient information in the trial reports and several trials were judged to have a high risk of performance bias due to lack of blinding and a high risk of attrition bias. The certainty of evidence was downgraded for risk of bias, and imprecision due to low numbers of participants.
Aseptic versus clean technique
We are uncertain if there is any difference between aseptic and clean techniques in the risk of symptomatic UTI because the evidence is low-certainty and the 95% confidence interval (CI) is consistent with possible benefit and possible harm (RR 1.20 95% CI 0.54 to 2.66; one study; 36 participants). We identified no data relating to the risk of adverse events comparing aseptic and clean techniques or participant satisfaction or preference.
Single-use (sterile) catheter versus multiple-use (clean)
We are uncertain if there is any difference between single-use and multiple-use catheters in terms of the risk of symptomatic UTI because the certainty of evidence is low and the 95% CI is consistent with possible benefit and possible harm (RR 0.98, 95% CI 0.55, 1.74; two studies; 97 participants). One study comparing single-use catheters to multiple-use catheters reported zero adverse events in either group; no other adverse event data were reported for this comparison. We identified no data for participant satisfaction or preference.
Hydrophilic-coated catheters versus uncoated catheters
We are uncertain if there is any difference between hydrophilic and uncoated catheters in terms of the number of people with symptomatic UTI because the certainty of evidence is low and the 95% CI is consistent with possible benefit and possible harm (RR 0.89, 95% CI 0.69 to 1.14; two studies; 98 participants). Uncoated catheters probably slightly reduce the risk of urethral trauma and bleeding compared to hydrophilic-coated catheters (RR 1.37, 95% CI 1.01 to 1.87; moderate-certainty evidence). The evidence is uncertain if hydrophilic-coated catheters compared with uncoated catheters has any effect on participant satisfaction measured on a 0-10 scale (MD 0.7 higher, 95% CI 0.19 to 1.21; very low-certainty evidence; one study; 114 participants). Due to the paucity of data, we could not assess the certainty of evidence relating to participant preference (one cross-over trial of 29 participants reported greater preference for a hydrophilic-coated catheter (19/29) compared to an uncoated catheter (10/29)).
|
{
"url": "https://www.cochrane.org/CD006008/INCONT_intermittent-catheter-techniques-strategies-and-catheter-designs-managing-long-term-bladder",
"source_domain": "www.cochrane.org",
"snapshot_id": "crawl=CC-MAIN-2022-33",
"warc_metadata": {
"Content-Length": "52109",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:QYFRCRSG6PHWGWSLCZCOHSVX6R3DD2RD",
"WARC-Concurrent-To": "<urn:uuid:b5e11349-a415-4fd0-b24f-7f2a6b5caa4c>",
"WARC-Date": "2022-08-13T07:11:38Z",
"WARC-IP-Address": "99.83.231.148",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:2GHNE5HFPSCBGZZVRZCGFM4N4FBRTUSK",
"WARC-Record-ID": "<urn:uuid:b032b875-3c9a-457b-adc8-8cd39792ba2f>",
"WARC-Target-URI": "https://www.cochrane.org/CD006008/INCONT_intermittent-catheter-techniques-strategies-and-catheter-designs-managing-long-term-bladder",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:87a9131d-fc83-42b7-b03c-f3e7b7616ad2>"
},
"warc_info": "isPartOf: CC-MAIN-2022-33\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for August 2022\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-65\r\nsoftware: Apache Nutch 1.18 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 1.4-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: https://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
108,
109,
125,
126,
403,
404,
698,
699,
710,
711,
1263,
1264,
1384,
1385,
1419,
1420,
1702,
1703,
1900,
1901,
1946,
1947,
2155,
2156,
2199,
2200,
2387,
2388,
2513,
2514,
2554,
2555,
2663,
2664,
2695,
2696,
2766,
2767,
2789,
2790,
2982,
2983,
2995,
2996,
3028,
3029,
3204,
3205,
3263,
3264,
3559,
3560,
3615,
3616,
3959,
3960,
4011,
4012,
4143,
4144,
4237,
4238,
4264,
4265,
4876,
4877,
4900,
4901,
5580,
5581,
5607,
5620,
5621,
6131,
6132,
6197,
6198,
6211,
6212,
6531,
6532,
6550,
6551,
7050,
7051,
7072,
7073,
7234,
7235,
7266,
7267,
7699,
7700,
7715,
7716,
8141,
8142,
8480,
8481,
8512,
8513,
8957,
8958,
9016,
9017,
9559,
9560,
9615,
9616
],
"line_end_idx": [
108,
109,
125,
126,
403,
404,
698,
699,
710,
711,
1263,
1264,
1384,
1385,
1419,
1420,
1702,
1703,
1900,
1901,
1946,
1947,
2155,
2156,
2199,
2200,
2387,
2388,
2513,
2514,
2554,
2555,
2663,
2664,
2695,
2696,
2766,
2767,
2789,
2790,
2982,
2983,
2995,
2996,
3028,
3029,
3204,
3205,
3263,
3264,
3559,
3560,
3615,
3616,
3959,
3960,
4011,
4012,
4143,
4144,
4237,
4238,
4264,
4265,
4876,
4877,
4900,
4901,
5580,
5581,
5607,
5620,
5621,
6131,
6132,
6197,
6198,
6211,
6212,
6531,
6532,
6550,
6551,
7050,
7051,
7072,
7073,
7234,
7235,
7266,
7267,
7699,
7700,
7715,
7716,
8141,
8142,
8480,
8481,
8512,
8513,
8957,
8958,
9016,
9017,
9559,
9560,
9615,
9616,
10634
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 10634,
"ccnet_original_nlines": 109,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 1,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.344626784324646,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.019057700410485268,
"rps_doc_frac_lines_end_with_ellipsis": 0.009090909734368324,
"rps_doc_frac_no_alph_words": 0.18581260740756989,
"rps_doc_frac_unique_words": 0.2950819730758667,
"rps_doc_mean_word_length": 5.727869033813477,
"rps_doc_num_sentences": 83,
"rps_doc_symbol_to_word_ratio": 0.0005293799913488328,
"rps_doc_unigram_entropy": 5.3470940589904785,
"rps_doc_word_count": 1525,
"rps_doc_frac_chars_dupe_10grams": 0.20629650354385376,
"rps_doc_frac_chars_dupe_5grams": 0.2892959415912628,
"rps_doc_frac_chars_dupe_6grams": 0.26754435896873474,
"rps_doc_frac_chars_dupe_7grams": 0.2638809382915497,
"rps_doc_frac_chars_dupe_8grams": 0.216485396027565,
"rps_doc_frac_chars_dupe_9grams": 0.21534058451652527,
"rps_doc_frac_chars_top_2gram": 0.00892958976328373,
"rps_doc_frac_chars_top_3gram": 0.012821979820728302,
"rps_doc_frac_chars_top_4gram": 0.014653690159320831,
"rps_doc_books_importance": -930.020263671875,
"rps_doc_books_importance_length_correction": -930.020263671875,
"rps_doc_openwebtext_importance": -539.5271606445312,
"rps_doc_openwebtext_importance_length_correction": -539.5271606445312,
"rps_doc_wikipedia_importance": -401.85211181640625,
"rps_doc_wikipedia_importance_length_correction": -401.85211181640625
},
"fasttext": {
"dclm": 0.19457441568374634,
"english": 0.9169957637786865,
"fineweb_edu_approx": 2.6324474811553955,
"eai_general_math": 0.4036199450492859,
"eai_open_web_math": 0.2547813653945923,
"eai_web_code": 0.06729059666395187
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "616.192",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Pathology and Diseases"
}
},
"secondary": {
"code": "616.19",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Pathology and Diseases"
}
}
},
"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": "2",
"label": "Academic/Research"
},
"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": "3",
"label": "Academic Writing"
},
"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": "4",
"label": "Graduate/Expert Level"
},
"secondary": {
"code": "3",
"label": "Undergraduate Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
3,619,488,552,739,030,000 |
@article {Rohde250340, author = {Rohde, Jason M. and Brimacombe, Kyle R. and Liu, Li and Pacold, Michael E. and Yasgar, Adam and Cheff, Dorian M. and Lee, Tobie D. and Rai, Ganesha and Baljinnyam, Bolormaa and Li, Zhuyin and Simeonov, Anton and Hall, Matthew D. and Shen, Min and Sabatini, David M. and Boxer, Matthew B.}, title = {Discovery and optimization of piperazine-1-thiourea-based human phosphoglycerate dehydrogenase inhibitors}, elocation-id = {250340}, year = {2018}, doi = {10.1101/250340}, publisher = {Cold Spring Harbor Laboratory}, abstract = {Proliferating cells, including cancer cells, obtain serine both exogenously and via the metabolism of glucose. By catalyzing the first, rate-limiting step in the synthesis of serine from glucose, phosphoglycerate dehydrogenase (PHGDH) controls flux through the biosynthetic pathway for this important amino acid and represents a putative target in oncology. To discover inhibitors of PHGDH, a coupled biochemical assay was developed and optimized to enable high-throughput screening for inhibitors of human PHGDH. Feedback inhibition was minimized by coupling PHGDH activity to two downstream enzymes (PSAT1 and PSPH), providing a significant improvement in enzymatic turnover. Further coupling of NADH to a diaphorase/resazurin system enabled a red-shifted detection readout, minimizing interference due to compound autofluorescence. With this protocol, over 400,000 small molecules were screened for PHGDH inhibition, and following hit validation and triage work, a piperazine-1-thiourea was identified. Following rounds of medicinal chemistry and SAR exploration, two probes (NCT-502 and NCT-503) were identified. These molecules demonstrated improved target activity and encouraging ADME properties, enabling both in vitro and in vivo assessment of the biological importance of PHGDH, and its role in the fate of serine in PHGDH-dependent cancer cells.}, URL = {https://www.biorxiv.org/content/early/2018/01/19/250340}, eprint = {https://www.biorxiv.org/content/early/2018/01/19/250340.full.pdf}, journal = {bioRxiv} }
|
{
"url": "https://www.biorxiv.org/highwire/citation/76809/bibtext",
"source_domain": "www.biorxiv.org",
"snapshot_id": "crawl=CC-MAIN-2019-47",
"warc_metadata": {
"Content-Length": "3573",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:3HDK4SP7OIOV5OQZZA36Q5WIT5MJ2JSM",
"WARC-Concurrent-To": "<urn:uuid:df0c758b-0944-46e9-ac0e-14ceb249f1e5>",
"WARC-Date": "2019-11-15T20:33:45Z",
"WARC-IP-Address": "104.16.75.12",
"WARC-Identified-Payload-Type": "text/plain",
"WARC-Payload-Digest": "sha1:5MFBURCXEDHKDIUBPMSP6CTSHFCXNM6N",
"WARC-Record-ID": "<urn:uuid:61c86071-3280-4495-b2f0-15d9dab0a824>",
"WARC-Target-URI": "https://www.biorxiv.org/highwire/citation/76809/bibtext",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:3a3e4561-6d79-42a1-9dfd-96ad76122c2f>"
},
"warc_info": "isPartOf: CC-MAIN-2019-47\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for November 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-67-67-221.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
],
"line_end_idx": [
2083
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 2083,
"ccnet_original_nlines": 0,
"rps_doc_curly_bracket": 0.010561689734458923,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.19194312393665314,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.054502371698617935,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.3222748935222626,
"rps_doc_frac_unique_words": 0.6617100238800049,
"rps_doc_mean_word_length": 6.211895942687988,
"rps_doc_num_sentences": 24,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.817174434661865,
"rps_doc_word_count": 269,
"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.007181330118328333,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -192.48251342773438,
"rps_doc_books_importance_length_correction": -192.48251342773438,
"rps_doc_openwebtext_importance": -114.32913208007812,
"rps_doc_openwebtext_importance_length_correction": -114.32913208007812,
"rps_doc_wikipedia_importance": -99.41319274902344,
"rps_doc_wikipedia_importance_length_correction": -99.41319274902344
},
"fasttext": {
"dclm": 0.14886152744293213,
"english": 0.8974536657333374,
"fineweb_edu_approx": 2.6459426879882812,
"eai_general_math": 0.2767797112464905,
"eai_open_web_math": 0.32407814264297485,
"eai_web_code": 0.0004356499994173646
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "572.6",
"labels": {
"level_1": "Science and Natural history",
"level_2": "Biology and Anthropology",
"level_3": "Anthropology"
}
},
"secondary": {
"code": "615.5",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Materia medica, Drugs, and Pharmacy"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "2",
"label": "Understand"
},
"secondary": {
"code": "3",
"label": "Apply"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "2",
"label": "Conceptual"
},
"secondary": {
"code": "3",
"label": "Procedural"
}
},
"document_type_v1": {
"primary": {
"code": "2",
"label": "Academic/Research"
},
"secondary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
}
},
"extraction_artifacts": {
"primary": {
"code": "0",
"label": "No Artifacts"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "0",
"label": "No missing content"
}
},
"document_type_v2": {
"primary": {
"code": "3",
"label": "Academic Writing"
},
"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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-4,109,935,304,444,109,300 |
Forgot password? | Forgot username? | Register
You are here: HomeSatellites
Back to the list
Satellite Name: Intelsat 702 (IS-702, Intelsat 7-F2)
Status: deorbited
Position: 33° E (32.9° E)
NORAD: 23124
Cospar number: 1994-034A
Operator: Intelsat
Launch date: 17-Jun-1994
Launch site: Guiana Space Center
Launch vehicle: Ariane 44LP
Launch mass (kg): 3695
Dry mass (kg): 1500
Manufacturer: Space Systems Loral (SSL)
Model (bus): LS-1300
Orbit: Inclined
Expected lifetime: 10-15 yrs.
Call sign: S2388
Beacon(s): 3947.5RHCP, 3948.0RHCP, 3950.0V, 3952.0RHCP, 3952.5RHCP, 11198RHCP, 11452RHCP, 12501H, 11701V
Details:
26 C-band transponders, 10 Ku-band transponders.
Beams:
Which tablet OS do you use?
|
{
"url": "http://www.satbeams.com/satellites?norad=23124",
"source_domain": "www.satbeams.com",
"snapshot_id": "crawl=CC-MAIN-2017-26",
"warc_metadata": {
"Content-Length": "33484",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:VIMPEQ5CY34NAI6KUMN4N4CPFLVMCGUS",
"WARC-Concurrent-To": "<urn:uuid:cdd3a0c1-a278-43a4-89ed-247399c29ed6>",
"WARC-Date": "2017-06-25T01:49:19Z",
"WARC-IP-Address": "85.17.231.83",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:GWGENTRTMSEPACWL4FZWSHIALOXR2D3Q",
"WARC-Record-ID": "<urn:uuid:4e52f9a8-eb32-4fe8-929c-df4239e1b0e8>",
"WARC-Target-URI": "http://www.satbeams.com/satellites?norad=23124",
"WARC-Truncated": "length",
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ad71510e-8551-4231-8c33-14949501f299>"
},
"warc_info": "robots: classic\r\nhostname: ip-10-145-147-9.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,
47,
48,
77,
79,
96,
149,
167,
193,
206,
231,
250,
275,
308,
336,
359,
379,
419,
440,
456,
486,
503,
608,
617,
666,
673,
675,
703,
705
],
"line_end_idx": [
47,
48,
77,
79,
96,
149,
167,
193,
206,
231,
250,
275,
308,
336,
359,
379,
419,
440,
456,
486,
503,
608,
617,
666,
673,
675,
703,
705,
706
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 706,
"ccnet_original_nlines": 28,
"rps_doc_curly_bracket": 0,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.04571428894996643,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.11999999731779099,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.49142858386039734,
"rps_doc_frac_unique_words": 0.8736842274665833,
"rps_doc_mean_word_length": 5.6315789222717285,
"rps_doc_num_sentences": 11,
"rps_doc_symbol_to_word_ratio": 0,
"rps_doc_unigram_entropy": 4.358665466308594,
"rps_doc_word_count": 95,
"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.02242990955710411,
"rps_doc_frac_chars_top_3gram": 0,
"rps_doc_frac_chars_top_4gram": 0,
"rps_doc_books_importance": -72.31804656982422,
"rps_doc_books_importance_length_correction": -73.1684341430664,
"rps_doc_openwebtext_importance": -48.28281784057617,
"rps_doc_openwebtext_importance_length_correction": -49.133209228515625,
"rps_doc_wikipedia_importance": -29.82568359375,
"rps_doc_wikipedia_importance_length_correction": -30.676074981689453
},
"fasttext": {
"dclm": 0.028030509129166603,
"english": 0.6233629584312439,
"fineweb_edu_approx": 1.9481686353683472,
"eai_general_math": 0.00003587999890442006,
"eai_open_web_math": 0.06706339120864868,
"eai_web_code": -0.000006320000011328375
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "629.43",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Engineering",
"level_3": ""
}
},
"secondary": {
"code": "621.40285",
"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": "1",
"label": "Factual"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "3",
"label": "Reference/Encyclopedic/Educational"
},
"secondary": {
"code": "-1",
"label": "Abstain"
}
},
"extraction_artifacts": {
"primary": {
"code": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "8",
"label": "Documentation"
},
"secondary": {
"code": "6",
"label": "Content Listing"
}
},
"reasoning_depth": {
"primary": {
"code": "1",
"label": "No 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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
-6,694,790,737,794,641,000 |
Advertisement
Topics
Uveal Melanoma Pipeline Review, H2 2017 [Report Updated: 10102017] Prices from USD $2000
14:46 EST 13 Nov 2017 | BioPortfolio Reports
Uveal Melanoma Pipeline Review, H2 2017
Summary
Global Markets Direct's latest Pharmaceutical and Healthcare disease pipeline guide Uveal Melanoma Pipeline Review, H2 2017, provides an overview of the Uveal Melanoma Oncology pipeline landscape.
Uveal melanoma, the most common intraocular tumor, is a disease in which cancer malignant cells are found in the part of the eye called the uvea. The uvea contains cells called melanocytes. When these cells become cancerous, the cancer is called a melanoma. Symptoms include dark spot on the iris, glaucoma, eye pain and eye redness. Uveal melanoma is more common in people who have atypical mole syndrome, dysplastic nevus syndrome, and ocular or oculodermal melanocytosis. Treatment includes surgery, radiation and proton therapy.
Report Highlights
Global Markets Direct's Pharmaceutical and Healthcare latest pipeline guide Uveal Melanoma Pipeline Review, H2 2017, provides comprehensive information on the therapeutics under development for Uveal Melanoma Oncology, complete with analysis by stage of development, drug target, mechanism of action MoA, route of administration RoA and molecule type. The guide covers the descriptive pharmacological action of the therapeutics, its complete research and development history and latest news and press releases.
The Uveal Melanoma Oncology pipeline guide also reviews of key players involved in therapeutic development for Uveal Melanoma and features dormant and discontinued projects. The guide covers therapeutics under Development by Companies /Universities /Institutes, the molecules developed by Companies in Phase III, Phase II, Phase I, IND/CTA Filed and Preclinical stages are 1, 9, 8, 1 and 6 respectively. Similarly, the Universities portfolio in Phase III, Phase II, Preclinical and Discovery stages comprises 1, 1, 1 and 1 molecules, respectively.
Uveal Melanoma Oncology pipeline guide helps in identifying and tracking emerging players in the market and their portfolios, enhances decision making capabilities and helps to create effective counter strategies to gain competitive advantage. The guide is built using data and information sourced from Global Markets Direct's proprietary databases, company/university websites, clinical trial registries, conferences, SEC filings, investor presentations and featured press releases from company/university sites and industryspecific third party sources. Additionally, various dynamic tracking processes ensure that the most recent developments are captured on a real time basis.
Note: Certain content / sections in the pipeline guide may be removed or altered based on the availability and relevance of data.
Scope
The pipeline guide provides a snapshot of the global therapeutic landscape of Uveal Melanoma Oncology.
The pipeline guide reviews pipeline therapeutics for Uveal Melanoma Oncology by companies and universities/research institutes based on information derived from company and industryspecific sources.
The pipeline guide covers pipeline products based on several stages of development ranging from preregistration till discovery and undisclosed stages.
The pipeline guide features descriptive drug profiles for the pipeline products which comprise, product description, descriptive licensing and collaboration details, RD brief, MoA other developmental activities.
The pipeline guide reviews key companies involved in Uveal Melanoma Oncology therapeutics and enlists all their major and minor projects.
The pipeline guide evaluates Uveal Melanoma Oncology therapeutics based on mechanism of action MoA, drug target, route of administration RoA and molecule type.
The pipeline guide encapsulates all the dormant and discontinued pipeline projects.
The pipeline guide reviews latest news related to pipeline therapeutics for Uveal Melanoma Oncology
Reasons to buy
Procure strategically important competitor information, analysis, and insights to formulate effective RD strategies.
Recognize emerging players with potentially strong product portfolio and create effective counterstrategies to gain competitive advantage.
Find and recognize significant and varied types of therapeutics under development for Uveal Melanoma Oncology.
Classify potential new clients or partners in the target demographic.
Develop tactical initiatives by understanding the focus areas of leading companies.
Plan mergers and acquisitions meritoriously by identifying key players and it's most promising pipeline therapeutics.
Formulate corrective measures for pipeline projects by understanding Uveal Melanoma Oncology pipeline depth and focus of Indication therapeutics.
Develop and design inlicensing and outlicensing strategies by identifying prospective partners with the most attractive projects to enhance and expand business potential and scope.
Adjust the therapeutic portfolio by recognizing discontinued projects and understand from the knowhow what drove them from pipeline.
Original Article: Uveal Melanoma Pipeline Review, H2 2017 [Report Updated: 10102017] Prices from USD $2000
NEXT ARTICLE
More From BioPortfolio on "Uveal Melanoma Pipeline Review, H2 2017 [Report Updated: 10102017] Prices from USD $2000"
Advertisement
Quick Search
Advertisement
Advertisement
Relevant Topics
Melanoma
Melanoma is a highly malignant tumor of melanin-forming cells (melanocytes) There are most commonly found in the skin (resulting from sunlight exposure), but also in the eyes and mucous membranes. Metastasis to other regions of the body is also common....
Healthcare
Health care (or healthcare) is the diagnosis, treatment, and prevention of disease, illness, injury, and other physical and mental impairments in humans. Health care is delivered by practitioners in medicine, chiropractic, dentistry, nursing, pharmacy, a...
Cancer
Bladder Cancer Brain Cancer Breast Cancer Cancer Cervical Cancer Colorectal Head & Neck Cancers Hodgkin Lymphoma Leukemia Lung Cancer Melanoma Myeloma Ovarian Cancer Pancreatic Cancer ...
|
{
"url": "https://www.bioportfolio.com/news/article/3416285/Uveal-Melanoma-Pipeline-Review-H2-2017-Report-Updated-10102017-Prices-from-USD.html",
"source_domain": "www.bioportfolio.com",
"snapshot_id": "crawl=CC-MAIN-2018-34",
"warc_metadata": {
"Content-Length": "39737",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:7FJSOKCT5OR3NO7Z27W7OT7GFTU7EHGR",
"WARC-Concurrent-To": "<urn:uuid:24703f32-ba87-452f-9136-34c4db6025e5>",
"WARC-Date": "2018-08-14T23:16:25Z",
"WARC-IP-Address": "46.43.1.110",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:FCKDQ4P5BOHVO7SXFVS5Y3OTEDBGECLL",
"WARC-Record-ID": "<urn:uuid:f6e7fe33-6605-4db4-b330-4431695b91ba>",
"WARC-Target-URI": "https://www.bioportfolio.com/news/article/3416285/Uveal-Melanoma-Pipeline-Review-H2-2017-Report-Updated-10102017-Prices-from-USD.html",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:874a230e-b8d3-43e2-9f33-f1e1783043fa>"
},
"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-157-100-246.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
14,
15,
22,
23,
112,
113,
158,
159,
199,
200,
201,
209,
210,
211,
408,
409,
410,
943,
944,
945,
963,
964,
965,
1476,
1477,
1478,
2026,
2027,
2028,
2708,
2709,
2710,
2840,
2841,
2842,
2848,
2849,
2850,
2953,
2954,
3153,
3154,
3305,
3306,
3518,
3519,
3657,
3658,
3818,
3819,
3903,
3904,
4004,
4005,
4006,
4021,
4022,
4023,
4140,
4141,
4280,
4281,
4392,
4393,
4463,
4464,
4548,
4549,
4667,
4668,
4814,
4815,
4996,
4997,
5130,
5131,
5238,
5239,
5252,
5253,
5370,
5371,
5385,
5398,
5412,
5426,
5427,
5429,
5430,
5446,
5447,
5456,
5712,
5713,
5724,
5982,
5983,
5990
],
"line_end_idx": [
14,
15,
22,
23,
112,
113,
158,
159,
199,
200,
201,
209,
210,
211,
408,
409,
410,
943,
944,
945,
963,
964,
965,
1476,
1477,
1478,
2026,
2027,
2028,
2708,
2709,
2710,
2840,
2841,
2842,
2848,
2849,
2850,
2953,
2954,
3153,
3154,
3305,
3306,
3518,
3519,
3657,
3658,
3818,
3819,
3903,
3904,
4004,
4005,
4006,
4021,
4022,
4023,
4140,
4141,
4280,
4281,
4392,
4393,
4463,
4464,
4548,
4549,
4667,
4668,
4814,
4815,
4996,
4997,
5130,
5131,
5238,
5239,
5252,
5253,
5370,
5371,
5385,
5398,
5412,
5426,
5427,
5429,
5430,
5446,
5447,
5456,
5712,
5713,
5724,
5982,
5983,
5990,
6179
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 6179,
"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.2303771674633026,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.022426100447773933,
"rps_doc_frac_lines_end_with_ellipsis": 0.030303029343485832,
"rps_doc_frac_no_alph_words": 0.1610601395368576,
"rps_doc_frac_unique_words": 0.42004773020744324,
"rps_doc_mean_word_length": 6.134844779968262,
"rps_doc_num_sentences": 37,
"rps_doc_symbol_to_word_ratio": 0.0030580998864024878,
"rps_doc_unigram_entropy": 5.236996173858643,
"rps_doc_word_count": 838,
"rps_doc_frac_chars_dupe_10grams": 0.04143162816762924,
"rps_doc_frac_chars_dupe_5grams": 0.14919276535511017,
"rps_doc_frac_chars_dupe_6grams": 0.12254425138235092,
"rps_doc_frac_chars_dupe_7grams": 0.0990079790353775,
"rps_doc_frac_chars_dupe_8grams": 0.0787784531712532,
"rps_doc_frac_chars_dupe_9grams": 0.0624392107129097,
"rps_doc_frac_chars_top_2gram": 0.050573818385601044,
"rps_doc_frac_chars_top_3gram": 0.04493289068341255,
"rps_doc_frac_chars_top_4gram": 0.03151138126850128,
"rps_doc_books_importance": -447.6733093261719,
"rps_doc_books_importance_length_correction": -447.6733093261719,
"rps_doc_openwebtext_importance": -237.3480987548828,
"rps_doc_openwebtext_importance_length_correction": -237.3480987548828,
"rps_doc_wikipedia_importance": -145.6653289794922,
"rps_doc_wikipedia_importance_length_correction": -145.6653289794922
},
"fasttext": {
"dclm": 0.02227460965514183,
"english": 0.8790550231933594,
"fineweb_edu_approx": 1.8801904916763306,
"eai_general_math": 0.002543689915910363,
"eai_open_web_math": 0.025184210389852524,
"eai_web_code": 0.00199264008551836
}
}
|
{
"free_decimal_correspondence": {
"primary": {
"code": "616.994",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Pathology and Diseases"
}
},
"secondary": {
"code": "615.5",
"labels": {
"level_1": "Industrial arts, Technology, and Engineering",
"level_2": "Medicine",
"level_3": "Materia medica, Drugs, and Pharmacy"
}
}
},
"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": "3",
"label": "Irrelevant Content"
},
"secondary": {
"code": "0",
"label": "No Artifacts"
}
},
"missing_content": {
"primary": {
"code": "0",
"label": "No missing content"
},
"secondary": {
"code": "4",
"label": "Missing Images or Figures"
}
},
"document_type_v2": {
"primary": {
"code": "10",
"label": "Knowledge Article"
},
"secondary": {
"code": "8",
"label": "Documentation"
}
},
"reasoning_depth": {
"primary": {
"code": "2",
"label": "Basic Reasoning"
},
"secondary": {
"code": "3",
"label": "Intermediate Reasoning"
}
},
"technical_correctness": {
"primary": {
"code": "4",
"label": "Highly Correct"
},
"secondary": {
"code": "3",
"label": "Mostly Correct"
}
},
"education_level": {
"primary": {
"code": "3",
"label": "Undergraduate Level"
},
"secondary": {
"code": "4",
"label": "Graduate/Expert Level"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|
4,972,671,220,905,388,000 |
Gordon Strodel, Archetype Consulting
Gordon Strodel
Data & Analytics Solution Owner for @SlalomBoston. Background in Mechanical Engineering. Obsessed with solving problems elegantly and permanently.
📍 Boston, MA
Azure: Saving IoT Data into SQL Server
Azure: Saving IoT Data into SQL Server
I've received several questions from the community about specific details of how I built the IoT to Tableau solution with Azure, particularly the part where I save data to SQL Server. This post is meant as a follow up to my prior post and hopefully will shed some light on the technical details. As always, if you can't find the answer you are looking for, use the form below to send me an email. Happy coding!
iot.png
This tutorial will assume you have an IoT device set up, publishing data to Azure IoT Hub, and that you can see the data in Azure in the raw JSON payload (or other) format. If you don't have this set up, please go complete the device setup and Azure set up documented here.
Setting up the Stream Analytics Job
Once data is publishing in Azure IoT Hub, you will need to set up a Stream Analytics job to get that data somewhere else, like SQL server.
Follow this tutorial to set up your Stream Analytics job, but stop before you get to the section called "Add an output to the Stream Analytics job".
At this point, we are going to deviate from the tutorial. We don't want to use PowerBI, instead, we want to save the data into SQL Server then we can use any normal data visualization tool to access it. However, we first must create a SQL instance, then database, then storage table before we can continue setting up Stream Analytics.
Steps to Create a new SQL Database:
1. Create a new SQL database instance by entering a name, pricing tier, and region. Make sure "Select Source" is listed as blank. Click Create.
2. Wait for the SQL Instance to be deployed. Once it is, you should see it under "SQL Databases" on your Azure Dashboard.
3. Open the instance and then open the "Query Editor." Login using the credentials you set up previously.
4. Using standard SQL, create a new table for your IoT data to live in. Coming from Particle.io, the webhook had the payload from my device, Device ID, Published At (date time), and the name of the web hook. (Azure IoT hub appends additional metadata but I wasn't going to capture it in my SQL table.) In my case, my Particle Photon data looked like this because I coded it that way in the IDE: {Sensor_Value_1|Sensor_Value_2|...|Sensor_Value_N|}
5. Verify the table is created without issues by refreshing the left pane of the Query Editor. You should see your table name show up under the "Tables" folder.
6. Now you have set up a SQL instance, created a login, and created a table to hold the data. Let's return to the Stream Analytics job.
CREATE TABLE [dbo].[particle_data] (
[PUBLISHED_AT] NVARCHAR (30) NOT NULL,
[DEVICE_ID] NVARCHAR (40) NOT NULL,
[EVENT] NVARCHAR (4000),
[RAW_DATA] NVARCHAR (4000),
[DATA] NVARCHAR (4000)
)
GO
Steps to Connect SQL DB to Stream Analytics:
1. So, under the "Outputs" screen of the Stream Analytics job, create a new output for "SQL Database." Make sure the Database field matches the database name from above. Enter your database username/password credentials. Lastly, enter the Table name from what you created above. Click "Save" when complete. Azure will then test the connection. If all is well, move on. If it fails, troubleshoot your connection first by double-checking the names of the database and table. :)
2. Go to the "Query" tab of the Stream Analytics Job.
3. Enter a new query like the following there. Be sure to replace the names of the input/output to match the names of your own Stream Analytics Job Input/Output aliases.
4. Click "Save." If you are feeling extra cautious, you can test the job by using some test data. I generated some data from the IoT Hub results and saved it as a JSON file. Here is what it looked like if you'd like to re-use the data.
5. After you save the output location, click the "Overview" tab of the Stream Analytics Job and click "Start." The job should start without any issue.
6. Wait for the IoT device to publish data. Once it does, the payload should now show up in the SQL database table you created before. Use the "Query Editor" to confirm the data exists. Use the query: select top 10 * from dbo.particle_data
[{"data":"151654|35|76|3141|-51|87.925781|3.996300|","device_id":"3100220039383037","event":"send","published_at":"2018-01-21T03:52:19.1510000Z","EventProcessedUtcTime":"2018-01-21T03:52:35.4095036Z","PartitionId":0,"EventEnqueuedUtcTime":"2018-01-21T03:52:20.5840000Z","IoTHub":{"MessageId":null,"CorrelationId":null,"ConnectionDeviceId":"310022001247343339383037","ConnectionDeviceGenerationId":"636520993218760636","EnqueuedTime":"2018-01-21T03:52:19.3520000Z","StreamId":null}}]
SELECT
DEVICE_ID,
EVENT,
PUBLISHED_AT,
DATA,
IOTHUB as RAW_DATA
INTO
[alias of stream analytics job output]
FROM
[alias of stream analytics job input]
Connect Tableau Desktop
For those of you with a copy of Tableau Desktop, use the connector for SQL Server. Enter your instance URL, database name, username, password. Remember the database URL will look something like this: instance-name.database.windows.net
Once you've connected Tableau Desktop, create visualizations and dashboards as you would normally. Or feel free to use mine as a starting point.
Hopefully this helps some of you fellow IoT Enthusiasts! As always, email me with any specific questions you need answered. Enjoy!
sql server auth.png
Project Maestro @ BTUG
Project Maestro @ BTUG
☁️Cloudy with a chance of IoT Data
☁️Cloudy with a chance of IoT Data
|
{
"url": "https://www.gordonstrodel.com/home/2018/2/16/azure-saving-iot-data-into-sql-server",
"source_domain": "www.gordonstrodel.com",
"snapshot_id": "crawl=CC-MAIN-2019-04",
"warc_metadata": {
"Content-Length": "108978",
"Content-Type": "application/http; msgtype=response",
"WARC-Block-Digest": "sha1:KIWQBIOYYWOLTY3CL42JULFCZJSKR6EY",
"WARC-Concurrent-To": "<urn:uuid:80f9c3c3-b758-4ad4-9633-fd0dcc271d6c>",
"WARC-Date": "2019-01-23T04:02:12Z",
"WARC-IP-Address": "198.185.159.145",
"WARC-Identified-Payload-Type": "text/html",
"WARC-Payload-Digest": "sha1:7KZKFZHTMWNWTDDHIIA3VSKKNNZC2PKB",
"WARC-Record-ID": "<urn:uuid:c5a910a3-5bf5-46e9-8046-08f816991f48>",
"WARC-Target-URI": "https://www.gordonstrodel.com/home/2018/2/16/azure-saving-iot-data-into-sql-server",
"WARC-Truncated": null,
"WARC-Type": "response",
"WARC-Warcinfo-ID": "<urn:uuid:ce30fa9d-b396-4a81-ab68-abac317ee5c5>"
},
"warc_info": "isPartOf: CC-MAIN-2019-04\r\npublisher: Common Crawl\r\ndescription: Wide crawl of the web for January 2019\r\noperator: Common Crawl Admin ([email protected])\r\nhostname: ip-10-152-117-40.ec2.internal\r\nsoftware: Apache Nutch 1.15 (modified, https://github.com/commoncrawl/nutch/)\r\nrobots: checked via crawler-commons 0.11-SNAPSHOT (https://github.com/crawler-commons/crawler-commons)\r\nformat: WARC File Format 1.1\r\nconformsTo: http://iipc.github.io/warc-specifications/specifications/warc-format/warc-1.1/"
}
|
{
"line_start_idx": [
0,
37,
38,
53,
54,
201,
202,
215,
216,
255,
256,
295,
296,
707,
708,
716,
717,
991,
992,
1028,
1029,
1168,
1169,
1318,
1319,
1654,
1655,
1691,
1692,
1838,
1962,
2070,
2520,
2521,
2684,
2822,
2859,
2905,
2948,
2984,
3024,
3061,
3063,
3066,
3067,
3112,
3113,
3591,
3647,
3819,
4057,
4210,
4452,
4935,
4942,
4953,
4960,
4974,
4980,
4999,
5004,
5047,
5052,
5098,
5099,
5123,
5124,
5360,
5361,
5506,
5507,
5638,
5639,
5659,
5661,
5663,
5686,
5687,
5710,
5711,
5746,
5747
],
"line_end_idx": [
37,
38,
53,
54,
201,
202,
215,
216,
255,
256,
295,
296,
707,
708,
716,
717,
991,
992,
1028,
1029,
1168,
1169,
1318,
1319,
1654,
1655,
1691,
1692,
1838,
1962,
2070,
2520,
2521,
2684,
2822,
2859,
2905,
2948,
2984,
3024,
3061,
3063,
3066,
3067,
3112,
3113,
3591,
3647,
3819,
4057,
4210,
4452,
4935,
4942,
4953,
4960,
4974,
4980,
4999,
5004,
5047,
5052,
5098,
5099,
5123,
5124,
5360,
5361,
5506,
5507,
5638,
5639,
5659,
5661,
5663,
5686,
5687,
5710,
5711,
5746,
5747,
5781
]
}
|
{
"red_pajama_v2": {
"ccnet_original_length": 5781,
"ccnet_original_nlines": 81,
"rps_doc_curly_bracket": 0.0010378799634054303,
"rps_doc_ldnoobw_words": 0,
"rps_doc_lorem_ipsum": 0,
"rps_doc_stop_word_fraction": 0.31707316637039185,
"rps_doc_ut1_blacklist": 0,
"rps_doc_frac_all_caps_words": 0.054471541196107864,
"rps_doc_frac_lines_end_with_ellipsis": 0,
"rps_doc_frac_no_alph_words": 0.2544715404510498,
"rps_doc_frac_unique_words": 0.36189401149749756,
"rps_doc_mean_word_length": 4.985343933105469,
"rps_doc_num_sentences": 83,
"rps_doc_symbol_to_word_ratio": 0.0008130099740810692,
"rps_doc_unigram_entropy": 5.164111614227295,
"rps_doc_word_count": 887,
"rps_doc_frac_chars_dupe_10grams": 0,
"rps_doc_frac_chars_dupe_5grams": 0.0775667130947113,
"rps_doc_frac_chars_dupe_6grams": 0.03844413906335831,
"rps_doc_frac_chars_dupe_7grams": 0.026684759184718132,
"rps_doc_frac_chars_dupe_8grams": 0,
"rps_doc_frac_chars_dupe_9grams": 0,
"rps_doc_frac_chars_top_2gram": 0.044097691774368286,
"rps_doc_frac_chars_top_3gram": 0.04477611929178238,
"rps_doc_frac_chars_top_4gram": 0.028493890538811684,
"rps_doc_books_importance": -532.9592895507812,
"rps_doc_books_importance_length_correction": -532.9592895507812,
"rps_doc_openwebtext_importance": -270.10498046875,
"rps_doc_openwebtext_importance_length_correction": -270.10498046875,
"rps_doc_wikipedia_importance": -255.02850341796875,
"rps_doc_wikipedia_importance_length_correction": -255.02850341796875
},
"fasttext": {
"dclm": 0.23278695344924927,
"english": 0.8470690846443176,
"fineweb_edu_approx": 2.036336898803711,
"eai_general_math": 0.23670071363449097,
"eai_open_web_math": 0.15463006496429443,
"eai_web_code": 0.7895489931106567
}
}
|
{
"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.0285",
"labels": {
"level_1": "General works, books and libraries, information sciences",
"level_2": "",
"level_3": "Computers and Computer science"
}
}
},
"bloom_cognitive_process": {
"primary": {
"code": "3",
"label": "Apply"
},
"secondary": {
"code": "2",
"label": "Understand"
}
},
"bloom_knowledge_domain": {
"primary": {
"code": "3",
"label": "Procedural"
},
"secondary": {
"code": "2",
"label": "Conceptual"
}
},
"document_type_v1": {
"primary": {
"code": "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": "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"
}
}
}
|
0481f2301c0ce20c4ed4d421fc5ba134
|