Вы искали: things (Корейский - Испанский)

there are still some things todo:
llamemos a este script 'hyperwave'.

지정한 폴더를 찾을 수 없습니다. name of the component that finds things
imposible encontrar la carpeta especificada. name of the component that finds things

matt newellcredit text for someone that did testing and some other similar things
matt newellcredit text for someone that did testing and some other similar things

일시 정지됨% 1 is the name of the job, can be things like copying, deleting, moving
pausado%1 is the name of the job, can be things like copying, deleting, moving

% 1 (% 2 남음)% 1 is the name of the job, can be things like copying, deleting, moving
%1 (%2 restante)%1 is the name of the job, can be things like copying, deleting, moving

(중지됨)% 1% 1 is the name of the job, can be things like copying, deleting, moving
(pausado) %1%1 is the name of the job, can be things like copying, deleting, moving

eval() evaluates the string given in code_str as php code. among other things, this can be useful for storing code in a database text field for later execution.
entre otras cosas, ésto puede ser útil para almacenar código en un campo de texto de base de datos para una ejecución posterior.

consider the problem of matching a string in parentheses, allowing for unlimited nested parentheses. without the use of recursion, the best that can be done is to use a pattern that matches up to some fixed depth of nesting. it is not possible to handle an arbitrary nesting depth. perl 5.6 has provided an experimental facility that allows regular expressions to recurse (amongst other things). the special item (?r) is provided for the specific case of recursion. this pcre pattern solves the parentheses problem (assume the pcre_extended option is set so that white space is ignored): \( ((? [^()]+) _bar_ (?r) )*\) first it matches an opening parenthesis. then it matches any number of substrings which can either be a sequence of non- parentheses, or a recursive match of the pattern itself (i.e. a correctly parenthesized substring). finally there is a closing parenthesis. this particular example pattern contains nested unlimited repeats, and so the use of a once-only subpattern for matching strings of non-parentheses is important when applying the pattern to strings that do not match. for example, when it is applied to (aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa() it yields "no match" quickly. however, if a once-only subpattern is not used, the match runs for a very long time indeed because there are so many different ways the + and * repeats can carve up the subject, and all have to be tested before failure can be reported. the values set for any capturing subpatterns are those from the outermost level of the recursion at which the subpattern value is set. if the pattern above is matched against (ab(cd)ef) the value for the capturing parentheses is "ef", which is the last value taken on at the top level. if additional parentheses are added, giving \( (((? [^()]+) _bar_ (?r) )*)\) ^ ^ ^ ^ then the string they capture is "ab(cd)ef", the contents of the top level parentheses. if there are more than 15 capturing parentheses in a pattern, pcre has to obtain extra memory to store data during a recursion, which it does by using pcre_malloc, freeing it via pcre_free afterwards. if no memory can be obtained, it saves data for the first 15 capturing parentheses only, as there is no way to give an out-of-memory error from within a recursion.
por ejemplo, el patrón (.*) second casa la cadena de entrada "first\nand second "(donde \n representa un carácter de nueva línea) con la primera subcadena capturada empezando con "and".