Searched refs:next (Results 401 - 425 of 3487) sorted by relevance

<<11121314151617181920>>

/external/apache-http/src/org/apache/http/impl/conn/
H A DAbstractPoolEntry.java229 * @param next the proxy to which the tunnel was established.
239 public void tunnelProxy(HttpHost next, boolean secure, HttpParams params) argument
242 if (next == null) {
258 this.connection.update(null, next, secure, params);
259 this.tracker.tunnelProxy(next, secure);
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/util/
H A DCollectionStore.java46 Object obj = iter.next();
/external/checkpolicy/
H A Dqueue.h21 queue_node_ptr_t next; member in struct:queue_node
/external/chromium/third_party/libevent/
H A Devrpc-internal.h37 TAILQ_ENTRY(evrpc_hook) (next);
/external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/
H A Derror_fixer.py105 iterator = iterator.next
112 while iterator and iterator != token.attached_object.type_end_token.next:
115 iterator = iterator.next
287 if token.previous.string == '{' and token.next.string == '}':
289 tokenutil.DeleteToken(token.next)
326 token.next.type == Type.END_PAREN and
327 token.next.next.type == Type.SEMICOLON):
328 current_token = token.next.next
[all...]
/external/clang/lib/Sema/
H A DAttributeList.cpp60 AttributeList *next = cur->NextInPool; local
73 cur = next;
89 AttributeList *next = pool->NextInPool; local
92 pool = next;
/external/dropbear/
H A Dauth.h105 struct SignKeyList *next; member in struct:SignKeyList
H A Dsvr-runopts.c99 char ** next = 0; local
142 if (next) {
143 *next = argv[i];
144 if (*next == NULL) {
147 next = 0x00;
154 next = &svr_opts.bannerfile;
158 next = &svr_opts.dsskeyfile;
163 next = &svr_opts.rsakeyfile;
196 next = &svr_opts.pidfile;
/external/e2fsprogs/lib/et/
H A Dinit_et.c49 new_et->etl.next = _et_dynamic_list;
/external/guava/guava/src/com/google/common/collect/
H A DAbstractLinkedIterator.java28 * interface for sequences whose next element can always be derived from the
60 * {@link #next()} in order to compute the result of a <i>future</i> call to
61 * {@code next()}.
71 public final T next() { method in class:AbstractLinkedIterator
H A DAbstractSortedMultiset.java71 return entryIterator.hasNext() ? entryIterator.next() : null;
77 return entryIterator.hasNext() ? entryIterator.next() : null;
84 Entry<E> result = entryIterator.next();
96 Entry<E> result = entryIterator.next();
H A DDiscreteDomain.java27 * operations: {@link #next}, {@link #previous} and {@link #distance}, according
54 public abstract C next(C value); method in class:DiscreteDomain
59 * #next}.
69 * #next} (if positive) or {@link #previous} (if negative) are needed to reach
71 * next(next(next(start)))}, then {@code distance(start, end) == 3} and {@code
H A DMapMakerInternalMap.java356 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
357 return new StrongEntry<K, V>(key, hash, next);
363 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
364 return new StrongExpirableEntry<K, V>(key, hash, next);
378 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
379 return new StrongEvictableEntry<K, V>(key, hash, next);
393 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
394 return new StrongExpirableEvictableEntry<K, V>(key, hash, next);
410 Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) {
411 return new SoftEntry<K, V>(segment.keyReferenceQueue, key, hash, next);
545 newEntry( Segment<K, V> segment, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
732 setNextExpirable(ReferenceEntry<K, V> next) argument
758 setNextEvictable(ReferenceEntry<K, V> next) argument
811 setNextExpirable(ReferenceEntry<Object, Object> next) argument
827 setNextEvictable(ReferenceEntry<Object, Object> next) argument
880 setNextExpirable(ReferenceEntry<K, V> next) argument
900 setNextEvictable(ReferenceEntry<K, V> next) argument
969 StrongEntry(K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
998 setNextExpirable(ReferenceEntry<K, V> next) argument
1020 setNextEvictable(ReferenceEntry<K, V> next) argument
1037 final ReferenceEntry<K, V> next; field in class:MapMakerInternalMap.StrongEntry
1065 StrongExpirableEntry(K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1092 setNextExpirable(ReferenceEntry<K, V> next) argument
1112 StrongEvictableEntry(K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1127 setNextEvictable(ReferenceEntry<K, V> next) argument
1147 StrongExpirableEvictableEntry(K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1174 setNextExpirable(ReferenceEntry<K, V> next) argument
1202 setNextEvictable(ReferenceEntry<K, V> next) argument
1224 SoftEntry(ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1252 setNextExpirable(ReferenceEntry<K, V> next) argument
1274 setNextEvictable(ReferenceEntry<K, V> next) argument
1291 final ReferenceEntry<K, V> next; field in class:MapMakerInternalMap.SoftEntry
1319 SoftExpirableEntry( ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1347 setNextExpirable(ReferenceEntry<K, V> next) argument
1367 SoftEvictableEntry( ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1383 setNextEvictable(ReferenceEntry<K, V> next) argument
1403 SoftExpirableEvictableEntry( ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1431 setNextExpirable(ReferenceEntry<K, V> next) argument
1459 setNextEvictable(ReferenceEntry<K, V> next) argument
1481 WeakEntry(ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1510 setNextExpirable(ReferenceEntry<K, V> next) argument
1532 setNextEvictable(ReferenceEntry<K, V> next) argument
1549 final ReferenceEntry<K, V> next; field in class:MapMakerInternalMap.WeakEntry
1577 WeakExpirableEntry( ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1605 setNextExpirable(ReferenceEntry<K, V> next) argument
1625 WeakEvictableEntry( ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1641 setNextEvictable(ReferenceEntry<K, V> next) argument
1661 WeakExpirableEvictableEntry( ReferenceQueue<K> queue, K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1689 setNextExpirable(ReferenceEntry<K, V> next) argument
1717 setNextEvictable(ReferenceEntry<K, V> next) argument
1876 newEntry(K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
1978 connectExpirables(ReferenceEntry<K, V> previous, ReferenceEntry<K, V> next) argument
2010 connectEvictables(ReferenceEntry<K, V> previous, ReferenceEntry<K, V> next) argument
2178 newEntry(K key, int hash, @Nullable ReferenceEntry<K, V> next) argument
3756 public K next() { method in class:MapMakerInternalMap.KeyIterator
3764 public V next() { method in class:MapMakerInternalMap.ValueIterator
3819 public Entry<K, V> next() { method in class:MapMakerInternalMap.EntryIterator
[all...]
/external/guava/guava-tests/test/com/google/common/base/
H A DAbstractIteratorTest.java58 assertEquals(0, (int) iter.next());
64 assertEquals(1, (int) iter.next());
72 iter.next();
153 assertEquals(0, (int) iter.next());
177 // hasNext/next), but we'll cop out for now, knowing that
178 // next() both start by invoking hasNext() anyway.
/external/guava/guava-tests/test/com/google/common/collect/
H A DMinMaxPriorityQueueTest.java309 it.next();
310 it.next();
312 it.next();
324 it.next();
325 it.next();
328 it.next();
350 Integer value = iter.next();
403 assertEquals((Integer) 1, it.next());
404 assertEquals((Integer) 20, it.next());
405 assertEquals((Integer) 100, it.next());
[all...]
/external/icu4c/common/
H A Dustrenum.h50 virtual const char* next(int32_t *resultLength, UErrorCode& status);
53 * Returns the next element a UnicodeString*. If there are no
/external/icu4c/i18n/unicode/
H A Dfpositer.h97 UBool next(FieldPosition& fp);
/external/icu4c/layout/
H A DSubstitutionLookups.cpp21 of the previous sequenceIndex in the loop and doing next()
45 tempIterator.next(sequenceIndex);
/external/iproute2/include/
H A Dxt-internal.h37 struct xtables_rule_match *next; member in struct:xtables_rule_match
/external/iproute2/misc/
H A Dlnstat.h25 struct lnstat_file *next; member in struct:lnstat_file
/external/ipsec-tools/src/racoon/
H A Disakmp_unity.h66 struct unity_netentry *next; member in struct:unity_netentry
/external/javassist/src/main/javassist/convert/
H A DTransformCall.java34 public TransformCall(Transformer next, CtMethod origMethod, argument
37 this(next, origMethod.getName(), substMethod);
41 public TransformCall(Transformer next, String oldMethodName, argument
44 super(next);
/external/libcap-ng/libcap-ng-0.7/utils/
H A Dproc-llist.h40 struct _lnode* next; // Next node pointer member in struct:_lnode
/external/libselinux/src/
H A Davc_sidtab.h14 struct sidtab_node *next; member in struct:sidtab_node
/external/libsepol/src/
H A Dinterfaces.c121 for (c = head; c; c = c->next) {
146 for (c = head; c; c = c->next) {
182 for (c = head; c; c = c->next) {
186 iface->next = c->next;
190 prev->next = iface;
202 iface->next = policydb->ocontexts[OCON_NETIF];
228 for (c = head; c != NULL; c = c->next)
248 for (c = head; c; c = c->next) {

Completed in 6060 milliseconds

<<11121314151617181920>>