Sie suchten nach: items (Koreanisch - Englisch)

more items
more items

채널remove all items from a list
channels

copy items 작업을 위한 템플릿 제작 및 저장
create and save templates for install package task

끄기( o) items, as in music
& off

open items 작업 실행 시 모든 네트워크 데이터 암호화
encryption of all network data when executing open application task

action for locking float items on the map
sun control...

the following items were added in php 4.3:
the following items were added in php 4.3:

@ info: whatsthis combination of multiple whatsthis items
%1: the message text is spoken.

% 1 (% 2) items: folders, files (size)
%1 (%2)

결과가 없습니다.% 1 current item number,% 2 total number of items
no results found.

(총% 1개) items (folders, files), size
no folders

사용량visible items on device information columns (enable_bar_disable)
usage

값의 이름: @ label: textbox to define after how many items the list is wrapped
name of variable:

스크롤백 ì‚­ì œregular expression to remove accelerators from menu items
kwrited - listening on device %1

새로 만들기@ title: menu synchronize pim items (message, calendar, to- do, etc.)
new

값의 이름: @ label: textbox to define after how many items the list is wrapped
c array

adds the data in the record to the database. if the number of items in the supplied record isn't equal to the number of fields in the database, the operation will fail and false will be returned.
if the number of items in the supplied record isn 't equal to the number of fields in the database, the operation will fail and false will be returned.

replaces the data associated with the record record_number with the data in the record in the database. if the number of items in the supplied record is not equal to the number of fields in the database, the operation will fail and false will be returned.
if the number of items in the supplied record is not equal to the number of fields in the database, the operation will fail and false will be returned.

certain items that may appear in patterns are more efficient than others. it is more efficient to use a character class like [aeiou] than a set of alternatives such as (a_bar_e_bar_i_bar_o_bar_u). in general, the simplest construction that provides the required behaviour is usually the most efficient. jeffrey friedl's book contains a lot of discussion about optimizing regular expressions for efficient performance. when a pattern begins with .* and the pcre_dotall option is set, the pattern is implicitly anchored by pcre, since it can match only at the start of a subject string. however, if pcre_dotall is not set, pcre cannot make this optimization, because the. metacharacter does not then match a newline, and if the subject string contains newlines, the pattern may match from the character immediately following one of them instead of from the very start. for example, the pattern (.*) second matches the subject "first\nand second" (where \n stands for a newline character) with the first captured substring being "and". in order to do this, pcre has to retry the match starting after every newline in the subject. if you are using such a pattern with subject strings that do not contain newlines, the best performance is obtained by setting pcre_dotall, or starting the pattern with ^.* to indicate explicit anchoring. that saves pcre from having to scan along the subject looking for a newline to restart at. beware of patterns that contain nested indefinite repeats. these can take a long time to run when applied to a string that does not match. 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 principle to try every possible variation, and this can take an extremely long time. an optimization catches some of the more simple cases such as (a+)*b where a literal character follows. before embarking on the standard matching procedure, pcre checks that there is a "b" later in the subject string, and if there is not, it fails the match immediately. however, when there is no following literal this optimization cannot be used. you can see the difference by comparing the behaviour of (a+)*\d with the pattern above. the former gives a failure almost instantly when applied to a whole line of "a" characters, whereas the latter takes an appreciable time with strings longer than about 20 characters.
the former gives a failure almost instantly when applied to a whole line of "a" characters, whereas the latter takes an appreciable time with strings longer than about 20 characters.