HomeSort by relevance Sort by last modified time
    Searched defs:nEnd (Results 1 - 8 of 8) sorted by null

  /frameworks/compile/mclinker/lib/Object/
SectionMap.cpp 54 NamePairList::const_iterator name_hash, nEnd = m_NamePairList.end();
55 for (name_hash = m_NamePairList.begin(); name_hash != nEnd; ++name_hash) {
66 NamePairList::iterator name_hash, nEnd = m_NamePairList.end();
67 for (name_hash = m_NamePairList.begin(); name_hash != nEnd; ++name_hash) {
  /packages/apps/UnifiedEmail/src/com/android/mail/lib/html/parser/
HtmlTree.java 360 // The node n spans [nBegin, nEnd]
362 int nEnd = ends.get(n);
366 if (nBegin >= n && nEnd <= endNode &&
369 n = nEnd + 1;
376 // If the node [nBegin, nEnd) lies completely within
377 // the region then proceed to the (nEnd + 1).
378 if (nBegin >= blockStart && nEnd < endNode) {
379 n = nEnd + 1;
387 debug("Forcing new block: " + n + " (" + nBegin + " " + nEnd +
  /packages/apps/UnifiedEmail/src/com/google/android/mail/common/html/parser/
HtmlTree.java 393 // The node n spans [nBegin, nEnd]
395 int nEnd = ends.get(n);
399 if (nBegin >= n && nEnd <= endNode &&
402 n = nEnd + 1;
409 // If the node [nBegin, nEnd) lies completely within
410 // the region then proceed to the (nEnd + 1).
411 if (nBegin >= blockStart && nEnd < endNode) {
412 n = nEnd + 1;
420 debug("Forcing new block: " + n + " (" + nBegin + " " + nEnd +
  /external/chromium_org/third_party/skia/src/pathops/
SkOpSegment.cpp     [all...]
  /external/skia/src/pathops/
SkOpSegment.cpp     [all...]
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.apache.ant_1.7.1.v20090120-1145/lib/
ant.jar 
  /prebuilts/tools/common/ant/
ant.jar 
  /prebuilts/tools/common/m2/internal/org/apache/ant/ant/1.8.0/
ant-1.8.0.jar 

Completed in 111 milliseconds