Примери коришћења Zero or more на Енглеском и њихови преводи на Српски
{-}
-
Colloquial
-
Ecclesiastic
-
Computer
-
Latin
-
Cyrillic
Zero or more.
Repeats, Zero or More Times.
Zero or more occurrences.
The rate is calculated by iteration andcan have zero or more solutions.
Declaring zero or more occurrences of an element.
Solving for the Rate requires iteration, andthere may be zero or more solutions.
Each chain can contain zero or more rules, and has a default policy.
Each location step has three components:an axis a node test zero or more predicates.
A symbol is a letter followed by zero or more of any characters(excluding whitespace); and.
This set can also be described as the set of strings that can be made by concatenating zero or more strings from V.
Every request andevent has zero or more arguments, each one with a name and a data type.
The Kleene star: the language consisting of all words that are concatenations of zero or more words in the original language;
A string is a sequence of zero or more Unicode characters, wrapped in double quotes, using backslash escapes.
It contains the name of a tree object(of the top-level source directory), a time stamp,a log message, and the names of zero or more parent commit objects.
Executing a set of statements zero or more times, until some condition is met(i.e., loop- the same as conditional branch).
In formal languages, the Kleene closure of a language can be described as the set of strings that can be made by concatenating zero or more strings from that language.
The example above declares that the"note" element can contain zero or more occurrences of parsed character data,"to","from","header", or"message" elements.
Assembler macros provide an alternative approach to inlining whereby a sequence of instructions can normally be generated inline by macro expansion from a single macro source statement(with zero or more parameters).
This is followed by one or more groups each having zero or more leading whitespace, an optional comma or“and” and more optional space.
An example of an EXPSPACE-complete problem is the problem of recognizing whether two regular expressions represent different languages, where the expressions are limited to four operators: union, concatenation,the Kleene star(zero or more copies of an expression), and squaring(two copies of an expression).
To specify a list of zero or more arguments, use the special argument varargin as the last(or only) argument in the list. function s= plus(varargin) if(nargin==0) s= 0; else s= varargin{1}+ plus(varargin{2:nargin}); end end A function can be set up to return any number of values by using the special return value varargout.
A vertex v in level i, i>0, has only three types of edges: backward edges which connect it to level i- 1(there is at least one such edge, which may be artificial),local edges which connect it to other edges in level i(there are zero or more such edges), or forward edges which connect it to edges in level i+1(there are zero or more such edges).
It is calculated by the iteration, andcan have either zero or even more solutions.
One zero more or less- what does it matter?