Searched defs:it (Results 51 - 75 of 389) sorted by relevance

1234567891011>>

/external/guava/guava/src/com/google/common/io/
H A DMultiReader.java34 private final Iterator<? extends CharSource> it; field in class:MultiReader
38 this.it = readers;
47 if (it.hasNext()) {
48 current = it.next().openStream();
/external/javassist/src/main/javassist/convert/
H A DTransformer.java50 public abstract int transform(CtClass clazz, int pos, CodeIterator it, argument
/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/
H A Dremove.pass.cpp99 C::const_iterator it = c.begin(); local
100 for(int *ip = std::begin(t2); ip != std::end(t2); ++ip, ++it) {
101 assert ( it != c.end());
102 assert ( *ip == it->get());
104 assert ( it == c.end ());
/external/libcxx/test/std/strings/basic.string/
H A Dinput_iterator.h27 explicit input_iterator(It it) : it_(it) {} argument
/external/llvm/lib/Option/
H A DArg.cpp70 it = ASL.begin(), ie = ASL.end(); it != ie; ++it) {
71 if (it != ASL.begin())
73 OS << *it; local
/external/llvm/unittests/ADT/
H A DDeltaAlgorithmTest.cpp21 for (std::set<unsigned>::const_iterator it = S.begin(),
22 ie = S.end(); it != ie; ++it) {
23 if (it != S.begin())
25 OS << *it; local
/external/v8/src/libplatform/
H A Ddefault-platform.cc84 std::map<v8::Isolate*, std::queue<Task*> >::iterator it = local
86 if (it == main_thread_queue_.end() || it->second.empty()) {
89 task = it->second.front();
90 it->second.pop();
/external/vixl/src/vixl/a64/
H A Ddecoder-a64.h146 std::list<DecoderVisitor*>::iterator it; local
147 for (it = visitors_.begin(); it != visitors_.end(); it++) {
148 VIXL_ASSERT((*it)->IsConstVisitor());
/external/wpa_supplicant_8/wpa_supplicant/wpa_gui-qt4/
H A Deventhistory.cpp105 WpaMsgList::iterator it; local
106 for (it = msgs.begin(); it != msgs.end(); it++)
107 addEvent(*it);
/external/boringssl/src/crypto/asn1/
H A Da_d2i_fp.c10 * apply to all code found in this distribution, be it the RC4, RSA,
107 void *ASN1_item_d2i_bio(const ASN1_ITEM *it, BIO *in, void *x) argument
118 ret=ASN1_item_d2i(x,&p,len, it);
125 void *ASN1_item_d2i_fp(const ASN1_ITEM *it, FILE *in, void *x) argument
136 ret=ASN1_item_d2i_bio(it,b,x);
H A Dbio_ndef.c10 * apply to all code found in this distribution, be it the RC4, RSA,
70 * get a BIO from it then any data written through the BIO
90 const ASN1_ITEM *it; member in struct:ndef_aux_st
106 BIO *BIO_new_NDEF(BIO *out, ASN1_VALUE *val, const ASN1_ITEM *it) argument
110 const ASN1_AUX *aux = it->funcs;
139 if (aux->asn1_cb(ASN1_OP_STREAM_PRE, &val, it, &sarg) <= 0)
143 ndef_aux->it = it;
171 derlen = ASN1_item_ndef_i2d(ndef_aux->val, NULL, ndef_aux->it);
178 derlen = ASN1_item_ndef_i2d(ndef_aux->val, &p, ndef_aux->it);
[all...]
H A Dtasn_fre.c10 * apply to all code found in this distribution, be it the RC4, RSA,
63 static void asn1_item_combine_free(ASN1_VALUE **pval, const ASN1_ITEM *it, int combine);
67 void ASN1_item_free(ASN1_VALUE *val, const ASN1_ITEM *it) argument
69 asn1_item_combine_free(&val, it, 0);
72 void ASN1_item_ex_free(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
74 asn1_item_combine_free(pval, it, 0);
77 static void asn1_item_combine_free(ASN1_VALUE **pval, const ASN1_ITEM *it, int combine) argument
82 const ASN1_AUX *aux = it->funcs;
87 if ((it->itype != ASN1_ITYPE_PRIMITIVE) && !*pval)
94 switch(it
202 ASN1_primitive_free(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
[all...]
H A Dtasn_new.c10 * apply to all code found in this distribution, be it the RC4, RSA,
67 static int asn1_item_ex_combine_new(ASN1_VALUE **pval, const ASN1_ITEM *it,
69 static void asn1_item_clear(ASN1_VALUE **pval, const ASN1_ITEM *it);
71 static void asn1_primitive_clear(ASN1_VALUE **pval, const ASN1_ITEM *it);
73 ASN1_VALUE *ASN1_item_new(const ASN1_ITEM *it) argument
76 if (ASN1_item_ex_new(&ret, it) > 0)
83 int ASN1_item_ex_new(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
85 return asn1_item_ex_combine_new(pval, it, 0);
88 static int asn1_item_ex_combine_new(ASN1_VALUE **pval, const ASN1_ITEM *it, argument
94 const ASN1_AUX *aux = it
229 asn1_item_clear(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
267 const ASN1_ITEM *it = ASN1_ITEM_ptr(tt->item); local
324 ASN1_primitive_new(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
379 asn1_primitive_clear(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
[all...]
H A Dx_long.c10 * apply to all code found in this distribution, be it the RC4, RSA,
72 static int long_new(ASN1_VALUE **pval, const ASN1_ITEM *it);
73 static void long_free(ASN1_VALUE **pval, const ASN1_ITEM *it);
75 static int long_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, const ASN1_ITEM *it);
76 static int long_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len, int utype, char *free_cont, const ASN1_ITEM *it);
77 static int long_print(BIO *out, ASN1_VALUE **pval, const ASN1_ITEM *it, int indent, const ASN1_PCTX *pctx);
97 static int long_new(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
99 *(long *)pval = it->size;
103 static void long_free(ASN1_VALUE **pval, const ASN1_ITEM *it) argument
105 *(long *)pval = it
108 long_i2c(ASN1_VALUE **pval, unsigned char *cont, int *putype, const ASN1_ITEM *it) argument
145 long_c2i(ASN1_VALUE **pval, const unsigned char *cont, int len, int utype, char *free_cont, const ASN1_ITEM *it) argument
178 long_print(BIO *out, ASN1_VALUE **pval, const ASN1_ITEM *it, int indent, const ASN1_PCTX *pctx) argument
[all...]
/external/ceres-solver/include/ceres/
H A Dordered_groups.h66 typename map<T, int>::const_iterator it = element_to_group_.find(element); local
67 if (it != element_to_group_.end()) {
68 if (it->second == group) {
73 group_to_elements_[it->second].erase(element);
74 if (group_to_elements_[it->second].size() == 0) {
75 group_to_elements_.erase(it->second);
89 // Remove the element, no matter what group it is in. Return value
100 // If the group is empty, then get rid of it.
124 typename map<int, set<T> >::reverse_iterator it = local
127 new_group_to_elements[it
146 typename map<T, int>::const_iterator it = element_to_group_.find(element); local
154 typename map<T, int>::const_iterator it = element_to_group_.find(element); local
161 typename map<int, set<T> >::const_iterator it = local
[all...]
/external/ceres-solver/internal/ceres/
H A Dblock_random_access_sparse_matrix.cc67 for (set<pair<int, int> >::const_iterator it = block_pairs.begin();
68 it != block_pairs.end();
69 ++it) {
70 const int row_block_size = blocks_[it->first];
71 const int col_block_size = blocks_[it->second];
86 for (set<pair<int, int> >::const_iterator it = block_pairs.begin();
87 it != block_pairs.end();
88 ++it) {
89 const int row_block_size = blocks_[it->first];
90 const int col_block_size = blocks_[it
134 const LayoutType::iterator it = local
[all...]
H A Dcompressed_col_sparse_matrix_utils.cc69 vector<int>::const_iterator it = lower_bound(row_block_starts.begin(), local
72 // Since we are using lower_bound, it will return the row id
81 if (it == row_block_starts.end() || *it != scalar_rows[idx]) {
85 block_rows->push_back(it - row_block_starts.begin());
/external/clang/tools/diagtool/
H A DDiagTool.cpp34 ToolMap::iterator it = getTools(tools)->find(toolCmd); local
35 return (it == getTools(tools)->end()) ? nullptr : it->getValue();
45 for (ToolMap::iterator it = getTools(tools)->begin(),
46 ei = getTools(tools)->end(); it != ei; ++it) {
47 toolNames.push_back(it->getKey());
48 unsigned len = it->getKey().size();
54 for (std::vector<llvm::StringRef>::iterator it = toolNames.begin(),
55 ei = toolNames.end(); it !
[all...]
/external/deqp/framework/delibs/decpp/
H A DdeSTLUtil.hpp44 const typename C::const_iterator it = container.find(item); local
45 return (it != container.end());
51 const I it = std::find(begin, end, item); local
52 return (it != end);
80 typename M::const_iterator it = map.find(key); local
81 if (it == map.end())
83 return &it->second;
/external/eigen/demos/opengl/
H A Dicosphere.cpp82 std::map<Key,int>::iterator it = edgeMap.find(edgeKey); local
83 if (it==edgeMap.end())
90 ids1[k] = it->second;
/external/eigen/test/
H A Dstable_norm.cpp38 int ibeta, it, iemin, iemax; local
41 it = std::numeric_limits<RealScalar>::digits; // number of base-beta digits in mantissa
45 VERIFY( (!(iemin > 1 - 2*it || 1+it>iemax || (it==2 && ibeta<5) || (it<=4 && ibeta <= 3 ) || it<2))
/external/google-breakpad/src/processor/
H A Dsimple_symbol_supplier.cc132 map<string, char *>::iterator it = memory_buffers_.find(module->code_file()); local
133 if (it == memory_buffers_.end()) {
138 delete [] it->second;
139 memory_buffers_.erase(it);
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
H A DCharsetRecog_mbcs.java91 // but is not incompatible with our encoding, so don't give it a zero.
166 * Get the next character (however many bytes it is) from the input data
172 * @param it The iteratedChar "struct" into which the returned char is placed.
177 abstract boolean nextChar(iteratedChar it, CharsetDetector det); argument
199 boolean nextChar(iteratedChar it, CharsetDetector det) { argument
200 it.index = it.nextIndex;
201 it.error = false;
203 firstByte = it.charValue = it
262 nextChar(iteratedChar it, CharsetDetector det) argument
321 nextChar(iteratedChar it, CharsetDetector det) argument
461 nextChar(iteratedChar it, CharsetDetector det) argument
[all...]
/external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/normalizer/
H A DTestCanonicalIterator.java44 CanonicalIterator it = new CanonicalIterator("");
64 characterTest(s, i, it);
66 characterTest(s + "\u0345", i, it);
76 CanonicalIterator it = new CanonicalIterator(s);
102 it.setSource(s);
104 String item = it.next();
141 CanonicalIterator it = new CanonicalIterator(testArray[i][0]);
146 String result = it.next();
156 it.reset();
157 if(!it
191 characterTest(String s, int ch, CanonicalIterator it) argument
[all...]
/external/javassist/src/main/javassist/expr/
H A DHandler.java34 CodeIterator it, CtClass declaring, MethodInfo m) {
35 super(et.handlerPc(nth), it, declaring, m);
33 Handler(ExceptionTable et, int nth, CodeIterator it, CtClass declaring, MethodInfo m) argument

Completed in 640 milliseconds

1234567891011>>