Searched defs:insert (Results 1 - 25 of 285) sorted by relevance

1234567891011>>

/external/llvm/include/llvm/ADT/
H A DStringSet.h29 insert(X);
32 std::pair<typename base::iterator, bool> insert(StringRef Key) { function in class:llvm::StringSet
34 return base::insert(std::make_pair(Key, '\0'));
38 void insert(const InputIt &Begin, const InputIt &End) { function in class:llvm::StringSet
40 base::insert(std::make_pair(*It, '\0'));
H A DSmallSet.h68 /// insert - Insert an element into the set if it isn't already there.
75 std::pair<NoneType, bool> insert(const T &V) { function in class:llvm::SmallSet
77 return std::make_pair(None, Set.insert(V).second);
89 Set.insert(Vector.back());
92 Set.insert(V);
97 void insert(IterT I, IterT E) { function in class:llvm::SmallSet
99 insert(*I);
H A DUniqueVector.h40 /// insert - Append entry to the vector if it doesn't already exist. Returns
42 unsigned insert(const T &Entry) { function in class:llvm::UniqueVector
/external/swiftshader/third_party/LLVM/include/llvm/ADT/
H A DStringSet.h22 /// functionality. Only insert() and count() methods are used by my
28 bool insert(StringRef InLang) { function in class:llvm::StringSet
32 return base::insert(llvm::StringMapEntry<char>::
H A DUniqueVector.h34 /// insert - Append entry to the vector if it doesn't already exist. Returns
36 unsigned insert(const T &Entry) { function in class:llvm::UniqueVector
H A DSmallSet.h57 /// insert - Insert an element into the set if it isn't already there.
58 bool insert(const T &V) { function in class:llvm::SmallSet
60 return Set.insert(V).second;
72 Set.insert(Vector.back());
75 Set.insert(V);
80 void insert(IterT I, IterT E) { function in class:llvm::SmallSet
82 insert(*I);
/external/eigen/Eigen/src/StlSupport/
H A DStdDeque.h96 using deque_base::insert;
97 iterator insert(const_iterator position, const value_type& x) function in class:std::deque
98 { return deque_base::insert(position,x); }
99 void insert(const_iterator position, size_type new_size, const value_type& x) function in class:std::deque
100 { deque_base::insert(position, new_size, x); }
108 deque_base::insert(deque_base::end(), new_size - deque_base::size(), x);
118 deque_base::insert(deque_base::end(), new_size - deque_base::size(), x);
H A DStdList.h86 list_base::insert(list_base::end(), new_size - list_base::size(), x);
95 using list_base::insert;
96 iterator insert(const_iterator position, const value_type& x) function in class:std::list
97 { return list_base::insert(position,x); }
98 void insert(const_iterator position, size_type new_size, const value_type& x) function in class:std::list
99 { list_base::insert(position, new_size, x); }
H A DStdVector.h94 using vector_base::insert;
95 iterator insert(const_iterator position, const value_type& x) function in class:std::vector
96 { return vector_base::insert(position,x); }
97 void insert(const_iterator position, size_type new_size, const value_type& x) function in class:std::vector
98 { vector_base::insert(position, new_size, x); }
113 vector_base::insert(vector_base::end(), new_size - vector_base::size(), x);
123 vector_base::insert(vector_base::end(), new_size - vector_base::size(), x);
/external/llvm/include/llvm/MC/
H A DMCObjectStreamer.h64 void insert(MCFragment *F) { function in class:llvm::MCObjectStreamer
67 CurSection->getFragmentList().insert(CurInsertionPoint, F);
/external/python/cpython2/Lib/idlelib/
H A DPercolator.py11 self.bottom.insert = self.redir.register("insert", self.insert)
23 def insert(self, index, chars, tags=None): member in class:Percolator
25 self.top.insert(index, chars, tags)
62 def insert(self, *args): member in class:_percolator.Tracer
63 print self.name, ": insert", args
64 self.delegate.insert(*args)
/external/clang/include/clang/ARCMigrate/
H A DARCMT.h118 virtual void insert(SourceLocation loc, StringRef text) { } function in class:clang::arcmt::MigrationProcess::RewriteListener
/external/sl4a/Common/src/com/googlecode/android_scripting/facade/telephony/
H A DMmsFileProvider.java48 public Uri insert(Uri uri, ContentValues values) { method in class:MmsFileProvider
/external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
H A DSmallSet.h73 /// insert - Insert an element into the set if it isn't already there.
80 std::pair<NoneType, bool> insert(const T &V) { function in class:llvm::SmallSet
82 return std::make_pair(None, Set.insert(V).second);
94 Set.insert(Vector.back());
97 Set.insert(V);
102 void insert(IterT I, IterT E) { function in class:llvm::SmallSet
104 insert(*I);
/external/vogar/src/vogar/
H A DMd5Cache.java145 public void insert(String key, File content) { method in class:Md5Cache
/external/clang/include/clang/Analysis/Analyses/
H A DPostOrderCFGView.h50 std::pair<llvm::NoneType, bool> insert(const CFGBlock *Block) { function in class:clang::PostOrderCFGView::CFGBlockSet
51 // Note that insert() is called by po_iterator, which doesn't check to
/external/clang/lib/Tooling/
H A DFileMatchTrie.cpp44 /// An insert of a path
46 /// - If the node is empty, insert 'p' into its storage and abort.
48 /// 's' of 'p2', put a new child into the map at 's' an insert the rest of
50 /// - Insert a new child for the last segment of 'p' and insert the rest of
53 /// An insert operation is linear in the number of a path's segments.
54 void insert(StringRef NewPath, unsigned ConsumedLength = 0) { function in class:clang::tooling::FileMatchTrieNode
75 Children[Element].insert(NewPath, ConsumedLength + Element.size() + 1);
174 void FileMatchTrie::insert(StringRef NewPath) { function in class:FileMatchTrie
175 Root->insert(NewPath);
/external/deqp/framework/delibs/decpp/
H A DdeSTLUtil.hpp110 bool insert (M& map, const typename M::key_type& key, const typename M::mapped_type& value) function in namespace:de
113 std::pair<typename M::iterator,bool> ret = map.insert(entry);
/external/elfutils/libdwfl/
H A Dsegment.c50 insert (Dwfl *dwfl, size_t i, GElf_Addr start, GElf_Addr end, int segndx) function
170 if (unlikely (insert (dwfl, 0, start, end, -1)))
178 if (unlikely (insert (dwfl, idx + 1, start, end,
188 if (unlikely (insert (dwfl, idx + 1, start, end, -1)))
198 if (unlikely (insert (dwfl, idx + 1,
319 if (unlikely (insert (dwfl, i, start, end, ndx)))
/external/llvm/lib/Transforms/ObjCARC/
H A DBlotMapVector.h51 Map.insert(std::make_pair(Arg, size_t(0)));
61 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &InsertPair) { function in class:llvm::BlotMapVector
63 Map.insert(std::make_pair(InsertPair.first, size_t(0)));
/external/markdown/markdown/
H A Dodict.py90 def insert(self, index, key, value): member in class:OrderedDict
97 self.keyOrder.insert(index, key)
145 self.insert(i, key, value)
156 self.keyOrder.insert(i, key)
161 self.keyOrder.insert(n, key)
/external/nanopb-c/generator/google/protobuf/internal/
H A Dcontainers.py116 def insert(self, key, value): member in class:RepeatedScalarFieldContainer
117 """Inserts the item at the specified position. Similar to list.insert()."""
119 self._values.insert(key, value)
/external/proguard/src/proguard/util/
H A DArrayUtil.java464 public static byte[] insert(byte[] array, int size, int index, byte element) method in class:ArrayUtil
580 public static short[] insert(short[] array, int size, int index, short element) method in class:ArrayUtil
696 public static int[] insert(int[] array, int size, int index, int element) method in class:ArrayUtil
812 public static long[] insert(long[] array, int size, int index, long element) method in class:ArrayUtil
928 public static Object[] insert(Object[] array, int size, int index, Object element) method in class:ArrayUtil
/external/regex-re2/util/
H A Dsparse_set.h140 void insert(int i) { function in class:re2::SparseSet
/external/robolectric/v1/src/main/java/com/xtremelabs/robolectric/shadows/
H A DShadowSpannableStringBuilder.java36 public Editable insert(int where, CharSequence text) { method in class:ShadowSpannableStringBuilder
37 builder.insert(where, text.toString());

Completed in 636 milliseconds

1234567891011>>