| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/ |
| ilist_base.h | 81 template <class T> static void remove(T &N) { removeImpl(N); } function in class:llvm::ilist_base
|
| /prebuilts/clang/host/linux-x86/clang-4691093/include/clang/ARCMigrate/ |
| ARCMT.h | 119 virtual void remove(CharSourceRange range) { } function in class:clang::arcmt::MigrationProcess::RewriteListener
|
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/ |
| ilist_base.h | 81 template <class T> static void remove(T &N) { removeImpl(N); } function in class:llvm::ilist_base
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| sparsemap.go | 73 func (s *sparseMap) remove(k ID) { func
|
| sparseset.go | 55 func (s *sparseSet) remove(x ID) { func
|
| /prebuilts/go/darwin-x86/src/runtime/ |
| mgclarge.go | 23 // remove: removes the span from that treap that best fits the required size
180 // Remove t, now a leaf.
196 // remove searches for, finds, removes from the treap, and returns the smallest
203 func (root *mTreap) remove(npages uintptr) *mspan { func
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| sparsemap.go | 73 func (s *sparseMap) remove(k ID) { func
|
| sparseset.go | 55 func (s *sparseSet) remove(x ID) { func
|
| /prebuilts/go/linux-x86/src/runtime/ |
| mgclarge.go | 23 // remove: removes the span from that treap that best fits the required size
180 // Remove t, now a leaf.
196 // remove searches for, finds, removes from the treap, and returns the smallest
203 func (root *mTreap) remove(npages uintptr) *mspan { func
|
| /prebuilts/jdk/jdk8/darwin-x86/sample/nio/server/ |
| Dispatcher1.java | 77 i.remove();
|
| /prebuilts/jdk/jdk8/linux-x86/sample/nio/server/ |
| Dispatcher1.java | 77 i.remove();
|
| /prebuilts/ndk/ |
| update.py | 38 def remove(path): function
39 logger().debug('remove `%s`', path)
40 os.remove(path)
65 # Need to check again because git won't remove directories if they have
98 remove(file_path)
104 remove(file_path)
|
| /system/chre/util/include/chre/util/ |
| priority_queue_impl.h | 102 void PriorityQueue<ElementType, CompareFunction>::remove(size_t index) { function in class:chre::PriorityQueue
|
| /system/netd/server/ |
| UidRanges.cpp | 100 void UidRanges::remove(const UidRanges& other) { function in class:android::net::UidRanges
|
| /toolchain/binutils/binutils-2.27/gold/ |
| layout.cc | 66 // The total number of calls to Free_list::remove.
68 // The total number of nodes visited during calls to Free_list::remove.
91 // Remove a chunk from the free list. Because we start with a single
92 // node that covers the entire section, and remove chunks from it one
94 // span more than one free node. We expect to remove chunks from the
101 Free_list::remove(off_t start, off_t end) function in class:gold::Free_list
123 // Case 2: remove a chunk from the start of the node.
126 // Case 3: remove a chunk from the end of the node.
129 // Case 4: remove a chunk from the middle, and split
146 "Free_list::remove(%d,%d) not found"
[all...] |
| /external/annotation-tools/scene-lib/src/annotations/util/coll/ |
| LinkedHashKeyedSet.java | 59 public void remove() { method in class:LinkedHashKeyedSet.KeyedSetIterator
60 itr.remove();
94 remove(old);
135 public boolean remove(Object o) { method in class:LinkedHashKeyedSet
136 return theValues.remove(o);
|
| /external/apache-http/src/org/apache/http/impl/conn/ |
| IdleConnectionHandler.java | 72 * {@link #remove} or {@link #closeIdleConnections} is called.
76 * @see #remove
97 public boolean remove(HttpConnection connection) { method in class:IdleConnectionHandler
98 TimeValues times = connectionToTimes.remove(connection);
140 connectionIter.remove();
167 connectionIter.remove();
|
| /external/apache-http/src/org/apache/http/impl/conn/tsccm/ |
| RouteSpecificPool.java | 160 it.remove();
166 BasicPoolEntry entry = freeEntries.remove();
233 final boolean found = freeEntries.remove(entry);
302 this.waitingThreads.remove(wt);
|
| /external/autotest/frontend/client/src/autotest/tko/ |
| HeaderFieldCollection.java | 56 * We perform strict input checking here, and both add() and remove() use this.
100 public void remove() { method
101 baseIterator.remove();
102 fieldsByName.remove(lastElement.getName());
103 fieldsBySqlName.remove(lastElement.getSqlName());
136 public boolean remove(Object o) { method
142 orderedFields.remove(field);
143 fieldsByName.remove(field.getName());
144 fieldsBySqlName.remove(field.getSqlName());
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/ |
| BouncyCastleProviderConfiguration.java | 66 ecThreadSpec.remove();
109 dhThreadSpec.remove();
|
| /external/easymock/src/org/easymock/internal/ |
| LastControl.java | 39 threadToControl.remove();
61 threadToArgumentMatcherStack.remove();
92 threadToArgumentMatcherStack.remove();
|
| /external/guava/guava/src/com/google/common/collect/ |
| ConcurrentHashMultiset.java | 63 * AtomicInteger results in zero, we compareAndSet the value to zero; if that succeeds, we remove
65 * about to be removed, so this operation may remove it (often by replacing it with a new
234 // newValue can't == 0, so no need to check & remove
242 // In the case of a concurrent remove, we might observe a zero value, which means another
243 // thread is about to remove (element, existingCounter) from the map. Rather than wait,
263 * @param occurrences the number of occurrences of the element to remove
268 * TODO(cpovirk): remove and removeExactly currently accept null inputs only
273 * we'll want to remove @Nullable, add an eager checkNotNull, and loosen up
276 @Override public int remove(@Nullable Object element, int occurrences) { method in class:ConcurrentHashMultiset
292 // Just CASed to 0; remove the entry to clean up the map. If the removal fails
465 @Override public boolean remove(Object object) { method in class:ConcurrentHashMultiset
[all...] |
| ForwardingCollection.java | 88 public boolean remove(Object object) { method in class:ForwardingCollection
89 return delegate().remove(object);
156 * A sensible definition of {@link #remove} in terms of {@link #iterator},
157 * using the iterator's {@code remove} method. If you override {@link
158 * #iterator}, you may wish to override {@link #remove} to forward to this
167 iterator.remove();
176 * using the iterator's {@code remove} method. If you override {@link
188 * using the iterator's {@code remove} method. If you override {@link
200 * using the iterator's {@code remove} method. If you override {@link
|
| ForwardingMap.java | 79 public V remove(Object object) { method in class:ForwardingMap
80 return delegate().remove(object);
149 * A sensible, albeit inefficient, definition of {@link #remove} in terms of
151 * #entrySet}, you may wish to override {@link #remove} to forward to this
154 * <p>Alternately, you may wish to override {@link #remove} with {@code
155 * keySet().remove}, assuming that approach would not lead to an infinite
166 entryIterator.remove();
187 * {@link ForwardingMap#isEmpty}, {@link ForwardingMap#remove}, {@link
249 * ForwardingMap#remove}, and {@link ForwardingMap#size}. In many cases, you
|
| /external/guava/guava/src/com/google/common/util/concurrent/ |
| AtomicLongMap.java | 234 public long remove(K key) { method in class:AtomicLongMap
243 // only remove after setting to zero, to avoid concurrent updates
244 map.remove(key, atomic);
245 // succeed even if the remove fails, since the value was already adjusted
261 map.remove(key, atomic);
339 * The problem with these is that remove(K, long) has to be done in two phases by definition ---
350 * remove(K, long). Without any two-phase operations it becomes feasible for all remaining
410 boolean remove(K key, long value) {
422 // only remove after setting to zero, to avoid concurrent updates
423 map.remove(key, atomic)
[all...] |
