| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
| Rule.java | 426 // reuse any label or list label if it exists
448 * it's start/stop (predefined attributes), then there is no need to
491 /** Given @scope::name {action} define it for this grammar. Later,
523 /** Save the option key/value pair and process it; return the key
556 for (Iterator it = keys.iterator(); it.hasNext();) {
557 String optionName = (String) it.next();
561 it.remove();
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/ |
| AbstractRealVector.java | 97 Iterator<Entry> it = sparseIterator(); local
99 while (it.hasNext() && (e = it.next()) != null) {
112 Iterator<Entry> it = sparseIterator(); local
114 while (it.hasNext() && (e = it.next()) != null) {
124 Iterator<Entry> it = sparseIterator(); local
126 while (it.hasNext() && (e = it.next()) != null) {
140 Iterator<Entry> it = sparseIterator() local
178 Iterator<Entry> it = sparseIterator(); local
200 Iterator<Entry> it = iterator(); local
212 Iterator<Entry> it = sparseIterator(); local
224 Iterator<Entry> it = sparseIterator(); local
235 Iterator<Entry> it = sparseIterator(); local
252 Iterator<Entry> it = iterator(); local
264 Iterator<Entry> it = iterator(); local
276 Iterator<Entry> it = iterator(); local
288 Iterator<Entry> it = iterator(); local
757 Iterator<Entry> it = iterator(); local
832 Iterator<Entry> it = (function.value(0) == 0) ? sparseIterator() : iterator(); local
[all...] |
| /external/chromium-trace/trace-viewer/third_party/six/ |
| test_six.py | 223 it = zip_longest(range(2), range(1))
225 assert six.advance_iterator(it) == (0, 0)
226 assert six.advance_iterator(it) == (1, None)
378 it = meth(d) variable in class:test_dictionary_iterators.MyDict
379 assert not isinstance(it, list)
380 assert list(it) == list(getattr(d, name)())
381 py.test.raises(StopIteration, six.advance_iterator, it)
414 it = iter(l)
415 assert six.next(it) == 1
416 assert six.next(it) ==
[all...] |
| /external/clang/lib/AST/ |
| DeclObjC.cpp | 98 /// It also returns 'true' if one of its categories has declared a 'readwrite'
184 /// in 'PropertyId' and returns it. It returns 0, if not found.
315 // This is O(n*m). But it is extremely rare and number of protocols in
511 /// class whose name is passed as argument. If it is not one of the super classes
512 /// the it returns NULL.
725 /// Otherwise it will return itself.
826 // it has to return an object.
867 ObjCMethodDecl::param_type_iterator it = param_type_begin(); local
868 QualType ArgT = (*it);
[all...] |
| /external/clang/lib/CodeGen/ |
| CGCleanup.cpp | 73 /// necessary to restore it to usability at the current insertion
245 EHScopeStack::iterator it = find(InnermostNormalCleanup); local
246 unsigned MinSize = cast<EHCleanupScope>(*it).getFixupDepth();
259 // Initialize it to false at a site that's guaranteed to be run
263 // Initialize it to true at the current location.
291 // still pointing directly to its destination; forward it to the
320 // If it's a branch, turn it into a switch whose default
356 // If it doesn't have an optimistic branch block, LatestBranch is
435 /// Returns the new block, whatever it is
[all...] |
| /external/clang/lib/Driver/ |
| Driver.cpp | 143 for (arg_iterator it = Args->filtered_begin(options::OPT_UNKNOWN),
144 ie = Args->filtered_end(); it != ie; ++it) {
145 Diags.Report(diag::err_drv_unknown_argument) << (*it) ->getAsString(*Args);
327 // FIXME: We need to figure out where this behavior should live. Most of it
350 for (arg_iterator it = Args->filtered_begin(options::OPT_B),
351 ie = Args->filtered_end(); it != ie; ++it) {
352 const Arg *A = *it;
446 for (InputList::iterator it = Inputs.begin(), ie = Inputs.end(); it != ie;)
1015 arg_iterator it = Args.filtered_begin(options::OPT__SLASH_TC, local
[all...] |
| /external/google-breakpad/src/common/linux/ |
| dump_symbols.cc | 33 // Find all the debugging info in a file and dump it as a Breakpad symbol file.
398 // Get the endianness of ELF_HEADER. If it's invalid, return false.
450 std::vector<string>::const_iterator it; local
451 for (it = debug_dirs.begin(); it < debug_dirs.end(); ++it) {
452 const string& debug_dir = *it;
502 for (it = searched_paths.begin(); it < searched_paths.end(); ++it) {
[all...] |
| /external/google-breakpad/src/common/windows/ |
| pdb_source_line_writer.cc | 137 // Setting a different code file path is an error. It is success only if the
272 // calculate it.
331 // this is a new file name, cache it and output a FILE line.
407 std::set<DWORD>::iterator it; local
410 for (it = rvas.begin(); it != rvas.end(); ++it) {
416 if (public_only_rvas.count(*it) == 0) {
417 if (SUCCEEDED(session_->findSymbolByRVA(*it, SymTagFunction, &symbol))) {
428 } else if (SUCCEEDED(session_->findSymbolByRVA(*it,
[all...] |
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/util/ |
| StringTokenizerTest.java | 300 com.ibm.icu.util.StringTokenizer it = new com.ibm.icu.util.StringTokenizer(str, delims, true); local
302 while (jt.hasMoreTokens() && it.hasMoreTokens()) {
303 assertEquals("[" + String.valueOf(n++) + "]", jt.nextToken(), it.nextToken());
306 assertFalse("icu tokenizer has no more tokens", it.hasMoreTokens());
309 it = new com.ibm.icu.util.StringTokenizer(sur, delims, true); // no coalesce
310 assertEquals("sur1", it.nextToken(), "Even");
311 assertEquals("sur2", it.nextToken(), "\ud800\udc00");
312 assertEquals("sur3", it.nextToken(), " ");
313 assertEquals("sur4", it.nextToken(), "works.");
314 assertEquals("sur5", it.nextToken(), "\n")
[all...] |
| /external/iputils/ |
| ping_common.c | 52 * prepared it was stoned.
417 struct itimerval it; local
432 it.it_interval.tv_sec = 0;
433 it.it_interval.tv_usec = 0;
434 it.it_value.tv_sec = waittime/1000000;
435 it.it_value.tv_usec = waittime%1000000;
436 setitimer(ITIMER_REAL, &it, NULL);
533 /* Apparently, it is some fatal bug. */
551 /* Fall to hard error. It is to avoid complete deadlock
666 * of one second, or "interval", if it is less
707 struct itimerval it; local
[all...] |
| /external/jmonkeyengine/engine/src/bullet/com/jme3/bullet/ |
| PhysicsSpace.java | 198 for (Iterator<PhysicsTickListener> it = tickListeners.iterator(); it.hasNext();) {
199 PhysicsTickListener physicsTickCallback = it.next();
205 for (Iterator<PhysicsTickListener> it = tickListeners.iterator(); it.hasNext();) {
206 PhysicsTickListener physicsTickCallback = it.next();
272 // for (Iterator<PhysicsTickListener> it = tickListeners.iterator(); it.hasNext();) {
273 // PhysicsTickListener physicsTickCallback = it.next();
283 // for (Iterator<PhysicsTickListener> it = tickListeners.iterator(); it.hasNext();)
[all...] |
| /external/jmonkeyengine/engine/src/jbullet/com/jme3/bullet/ |
| PhysicsSpace.java | 251 for (Iterator<PhysicsTickListener> it = tickListeners.iterator(); it.hasNext();) {
252 PhysicsTickListener physicsTickCallback = it.next();
262 for (Iterator<PhysicsTickListener> it = tickListeners.iterator(); it.hasNext();) {
263 PhysicsTickListener physicsTickCallback = it.next();
330 for (Iterator<PhysicsCollisionEvent> it = collisionEvents.iterator(); it.hasNext();) {
331 PhysicsCollisionEvent physicsCollisionEvent = it.next();
337 it.remove()
[all...] |
| /external/jmonkeyengine/engine/src/terrain/com/jme3/terrain/geomipmap/ |
| LODGeomap.java | 56 * mesh, minus one outer edge around it. Then it builds the edges in counter-clockwise order,
59 * It needs to know what its neighbour's LOD's are so it can stitch the edges.
60 * It creates degenerate polygons in order to keep the winding order of the polygons and to move
145 * This is a scary method!!! It will break your mind.
403 int it = (getWidth() - 1) / rightLod; // iterations
local
405 for (int i = it; i > 0; i--) { // for each lod level of the neighbour
451 int it = (getWidth() - 1) / topLod; // iterations
local
453 for (int i = it; i > 0; i--) { // for each lod level of the neighbour
492 int it = (getWidth() - 1) \/ leftLod; \/\/ iterations local
541 int it = (getWidth() - 1) \/ bottomLod; \/\/ iterations local
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/data/ |
| NewHdfParser.java | 51 * Object used to hold the name and attributes of an HDF node before we are ready to commit it to
81 Iterator<String> it = attrs.iterator(); local
82 while (it.hasNext()) {
83 String key = it.next();
84 String value = it.next();
326 * HdfNameAttrs object. It returns a {@code boolean} with whether it succeeded to parse.
403 * in C clearsilver. Returns NO_MATCH if it fails to parse an attribute.
469 // Parse the next 1 to 3 characters if they are digits. Treat it as an octal code.
662 * @param seq the sequence that we want to see if it contains the string match
[all...] |
| /external/llvm/lib/MC/ |
| MCAssembler.cpp | 62 // object file, which may truncate it. We should detect that truncation where
71 for (MCAssembler::iterator it = Asm.begin(), ie = Asm.end(); it != ie; ++it)
72 if (!it->getSection().isVirtualSection())
73 SectionOrder.push_back(&*it);
74 for (MCAssembler::iterator it = Asm.begin(), ie = Asm.end(); it != ie; ++it)
75 if (it->getSection().isVirtualSection()
1211 OS << *it; local
[all...] |
| /external/llvm/utils/FileCheck/ |
| FileCheck.cpp | 10 // FileCheck does a line-by line check of a file that validates whether it
14 // the file matched the expected contents, and exit status of 1 if it did not
167 /// \return offset of the closing sequence within Str, or npos if it was not
193 // Check to see if this is a fixed string, or if it has regex pieces.
235 // (or some other regex) and assigns it to the FileCheck variable 'foo'. The
238 // it. This is to catch some common errors.
380 // If this is the EOF pattern, match it immediately.
386 // If this is a fixed string pattern, just match it now.
409 StringMap<StringRef>::iterator it = local
412 if (it == VariableTable.end()
488 StringMap<StringRef>::const_iterator it = VariableTable.find(Var); local
[all...] |
| /external/ltrace/sysdeps/linux-gnu/ |
| trace.c | 8 * This program is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU General Public License as
13 * This program is distributed in the hope that it will be useful, but
68 /* -1 is returned for errors, 0 if it has no effect, 1 if
90 * forks when we can't trace it yet. Here we wait for kernel to
112 * reasons that the PID can't be attached: like it may have
222 /* If the task is already stopped, don't worry about it.
223 * Likewise if it managed to become a zombie or terminate in
240 /* Task is blocked if it's stopped, or if it's a vfork parent. *
424 struct opt_p_t *it; local
1173 struct opt_p_t *it; local
[all...] |
| /external/mesa3d/src/glsl/ |
| ir_reader.cpp | 167 foreach_iter(exec_list_iterator, it, list->subexpressions) {
168 s_list *sub = SX_AS_LIST(it.get());
170 continue; // not a (function ...); ignore it.
174 continue; // not a (function ...); ignore it.
202 exec_list_iterator it = ((s_list *) expr)->subexpressions.iterator(); local
203 it.next(); // skip "function" tag
204 it.next(); // skip function name
205 for (/* nothing */; it.has_next(); it.next()) {
206 s_expression *s_sig = (s_expression *) it.get()
240 exec_list_iterator it = paramlist->subexpressions.iterator(); local
[all...] |
| /external/nist-sip/java/gov/nist/javax/sip/ |
| SipProviderImpl.java | 138 for (Iterator it = listeningPoints.values().iterator(); it.hasNext();) {
139 ListeningPointImpl listeningPoint = (ListeningPointImpl) it.next();
304 * User decided to give us his own via header branch. Lets see if it
375 // branch id starts with a valid prefix, then take it.
650 for (Iterator<SipProviderImpl> it = sipStack.getSipProviders(); it.hasNext();) {
651 SipProviderImpl nextProvider = (SipProviderImpl) it.next();
693 * JvB: Via branch should already be OK, dont touch it here? Some
694 * apps forward statelessly, and then it's not set. So set only whe
[all...] |
| /external/opencv/cxcore/src/ |
| cxmathfuncs.cpp | 536 int it = cvRound(t); local
537 t -= it;
538 int sin_idx = it & (N - 1);
[all...] |
| /external/openfst/src/include/fst/ |
| compact-fst.h | 100 // needs to be specify for this code to compile, but one can have it
311 Iterator it = begin; local
312 for(; it != end; ++it, ++i){
313 compacts_[i] = *it;
314 if (compactor.Expand(i, *it).ilabel != kNoLabel)
324 Iterator it = begin;
325 for(size_t i = 0; it != end; ++it, ++i) {
326 Arc arc = compactor.Expand(i, *it);
[all...] |
| /external/openfst/src/include/fst/extensions/pdt/ |
| shortest-path.h | 248 typename SearchMap::iterator it = search_map_.find(s); local
249 if (it == search_map_.end())
252 return state_data_ = &(it->second);
270 typename ParenMap::iterator it = paren_map_.find(paren); local
271 if (it == paren_map_.end())
274 return state_data_ = &(it->second);
363 // as an FST). It is a generalization of the classic SSSP graph
374 // it with entering open parentheses, then this algorithm is quite
593 // if previously unvisited. Otherwise it finds any previously encountered
|
| /external/v8/src/ |
| full-codegen.h | 150 // Notify the statement that we are exiting it via break, continue, or
151 // return and give it a chance to generate cleanup code. Return the
318 // fall-through label if it is set up.
345 // Assign to a known (PARAMETER, LOCAL, or CONTEXT) variable. If it's in
411 // the operands allow it. Returns true if the compare operations
677 // implementation will bind both labels unless it's a TestContext, which
704 // it. Only used for asserts.
861 Iterator it = find(literal, true, ZoneAllocationPolicy(zone_)); local
862 if (it->second == NULL) it->second = new(zone_) ObjectLiteral::Accessors()
[all...] |
| /external/webp/src/enc/ |
| frame.c | 229 // should be prob[VP8EncBands[n]], but it's equivalent for n=0 or 1
299 static void CodeResiduals(VP8BitWriter* const bw, VP8EncIterator* const it,
304 const int i16 = (it->mb_->type_ == 1);
305 const int segment = it->mb_->segment_;
306 VP8Encoder* const enc = it->enc_;
308 VP8IteratorNzToBytes(it);
314 it->top_nz_[8] = it->left_nz_[8] =
315 PutCoeffs(bw, it->top_nz_[8] + it->left_nz_[8], &res)
543 VP8EncIterator it; local
702 VP8EncIterator it; local
745 VP8EncIterator it; local
[all...] |
| /frameworks/av/media/libmediaplayerservice/nuplayer/ |
| NuPlayerRenderer.cpp | 50 #Use deep buffer for PCM data with video (it is generally enabled for audio-only)
211 // get playback settings used by audiosink, as it may be
452 // Let's give it more data after about half that time
774 List<QueueEntry>::iterator it = mAudioQueue.begin(), itEOS = it; local
776 while (it != mAudioQueue.end()) {
778 QueueEntry *entry = &*it++;
781 itEOS = it;
788 for (it = mAudioQueue.begin(); it != itEOS; it++)
[all...] |
