Hai cercato la traduzione di arbitrary da Coreano a Turco

add a launch annotation (to a target of arbitrary file type).
Önceki

이 수학 함수는 당신 컴퓨터의 long 과 double 형의 범위 안에서만 값들을 다룬다. 만약 더 큰 수를 다루고자 한다면 arbitrary precision math functions 를 보라.
these math functions will only handle values within the range of the integer and float types on your computer. (this corresponds currently to the c types long resp. double) if you need to handle bigger numbers, take a look at the arbitrary precision math functions.

note that if you are going to allow data coming from user input to be passed to this function, then you should be using escapeshellcmd() to make sure that users cannot trick the system into executing arbitrary commands.
uyarý

note, that if you are going to allow data coming from user input to be passed to this function, then you should be using the escapeshellcmd() function to make sure that users cannot trick the system into executing arbitrary commands.
uyarý

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.
consider the pattern fragment (a+)* this can match "aaaa "in 33 different ways, and this number increases very rapidly as the string gets longer. (the * repeat can match 0, 1, 2, 3, or 4 times, and for each of those cases other than 0, the + repeats can match different numbers of times.) when the remainder of the pattern is such that the entire match is going to fail, pcre has in princi - ple to try every possible variation, and this can take an extremely long time.