Searched refs:an (Results 1 - 25 of 44) sorted by relevance

12

/PHP_5_5/ext/oci8/tests/
H A Ddetails.inc10 * corresponding to the POOLED server instance or an Easy Connect
/PHP_5_5/ext/pdo/tests/
H A Dpdo_test.inc19 // create an instance of the PDO driver, based on
/PHP_5_5/ext/phar/tests/zip/files/
H A Dzipmaker.php.inc53 * Create an internal directory, creating parent directories as needed
/PHP_5_5/ext/spl/examples/
H A Ddbaarray.inc45 * Read an entry.
64 * Set an entry.
H A Dfindfile.inc56 * @note This may be overloaded and contain a regular expression for an
H A Dinigroups.inc16 * @brief Class to iterate all groups within an ini file.
31 * Construct an ini file group iterator from a filename.
H A Dkeyfilter.inc18 * are strings. In other words you can put an iterator into the constructor
28 * Constructs a filter around an iterator whose elemnts are strings.
H A Dsearchiterator.inc22 /** @internal whether an entry was found already */
/PHP_5_5/ext/spl/internal/
H A Dappenditerator.inc23 /** Construct an empty AppendIterator
30 /** Append an Iterator
H A Demptyiterator.inc35 /** This function must not be called. It throws an exception upon access.
41 throw new Exception('Accessing the value of an EmptyIterator');
44 /** This function must not be called. It throws an exception upon access.
50 throw new Exception('Accessing the key of an EmptyIterator');
H A Dfilteriterator.inc19 * you can put an iterator into the constructor and the instance will only
48 * Accept function to decide whether an element of the inner iterator
H A Dinfiniteiterator.inc21 * \note Even an InfiniteIterator stops if its inner Iterator is empty.
H A Diteratoriterator.inc17 * an Iterator. It is very important to understand that most classes that do
37 * Omitting the downcast in the above example would result in an endless loop
42 /** Construct an IteratorIterator from an Iterator or an IteratorAggregate.
H A Dmultipleiterator.inc64 * @throws IllegalValueException if a inf is already an associated info
127 // The following code is an optimized version that executes as few
151 /** @return false if no sub Iterator is attached and an array of
194 /** @return false if no sub Iterator is attached and an array of
H A Drecursivearrayiterator.inc39 /** @return an iterator for the current elements children
H A Drecursivecachingiterator.inc46 /** Forward to next element if necessary then an Iterator for the Children
H A Drecursivefilteriterator.inc46 /** @return an iterator for the current elements children
H A Drecursiveregexiterator.inc23 * Constructs a regular expression filter around an iterator whose
45 /** @return an iterator for the current elements children
H A Dseekableiterator.inc18 * to seek on an iterator LimitIterator can use this to efficiently rewind
23 /** Seek to an absolute position
28 * The method should throw an exception if it is not possible to seek to
H A Dspldoublylinkedlist.inc54 throw new RuntimeException("Can't pop from an empty datastructure");
65 throw new RuntimeException("Can't shift from an empty datastructure");
70 /** Pushes an element to the end of the DLL.
79 /** Adds an element to the beginning of the DLL.
/PHP_5_5/ext/standard/tests/http/
H A Dserver.inc13 * $files is an array of files containing N responses for N expected requests. Server dies after N requests.
/PHP_5_5/ext/sybase_ct/tests/
H A Dtest.inc64 // Returns all fetched rows from an SQL query
80 // Fires an SQL query and returns the first value from the first row
/PHP_5_5/scripts/dev/
H A Dcredits17 if you want to change an entry you have to edit the appropriate
/PHP_5_5/ext/imap/tests/
H A Dimap_include.inc30 * Display all fields in an element from an imap_fetch_overview() response
32 * Special handling for 'udate', which will vary run-to-run; assumes an IMAP
/PHP_5_5/ext/mbstring/oniguruma/
H A Dregcomp.c2762 AnchorNode* an = NANCHOR(node); local
2763 switch (an->type) {
2768 r = subexp_inf_recursive_check(an->target, env, head);
2818 AnchorNode* an = NANCHOR(node); local
2819 switch (an->type) {
2824 r = subexp_inf_recursive_check_trav(an->target, env);
2871 AnchorNode* an = NANCHOR(node); local
2872 switch (an->type) {
2877 r = subexp_recursive_check(an->target);
2940 AnchorNode* an local
3065 AnchorNode* an = NANCHOR(node); local
3094 AnchorNode* an = NANCHOR(node); local
3124 AnchorNode* an = NANCHOR(node); local
3259 Node *anode, *var_anode, *snode, *xnode, *an; local
3844 AnchorNode* an = NANCHOR(node); local
[all...]

Completed in 22 milliseconds

12