HomeSort by relevance Sort by last modified time
    Searched refs:walking (Results 1 - 13 of 13) sorted by null

  /external/chromium_org/third_party/skia/src/svg/
SkSVGParser.cpp 127 SkSVGPaint* walking = fHead; local
132 while (walking != NULL) {
133 if (strokeSet == false && walking->f_stroke.size() > 0) {
134 stroke = walking->f_stroke.equals("none") == false;
135 *strokeState = walking;
138 if (fillSet == false && walking->f_fill.size() > 0) {
139 fill = walking->f_fill.equals("none") == false;
140 *fillState = walking;
143 walking = walking->fNext
    [all...]
SkSVGPaintState.cpp 103 SkSVGPaint* walking = parser.fHead;
105 while (walking != NULL) {
107 SkString* lastAttr = (*walking)[index];
114 walking = walking->fNext;
194 SkSVGPaint* walking = parser.fHead;
198 while (walking != NULL) {
200 SkString* lastAttr = (*walking)[index];
227 walking = walking->fNext
    [all...]
  /external/skia/src/svg/
SkSVGParser.cpp 127 SkSVGPaint* walking = fHead; local
132 while (walking != NULL) {
133 if (strokeSet == false && walking->f_stroke.size() > 0) {
134 stroke = walking->f_stroke.equals("none") == false;
135 *strokeState = walking;
138 if (fillSet == false && walking->f_fill.size() > 0) {
139 fill = walking->f_fill.equals("none") == false;
140 *fillState = walking;
143 walking = walking->fNext
    [all...]
SkSVGPaintState.cpp 103 SkSVGPaint* walking = parser.fHead;
105 while (walking != NULL) {
107 SkString* lastAttr = (*walking)[index];
114 walking = walking->fNext;
194 SkSVGPaint* walking = parser.fHead;
198 while (walking != NULL) {
200 SkString* lastAttr = (*walking)[index];
227 walking = walking->fNext
    [all...]
  /ndk/build/core/
definitions-graph.mk 116 # Many tree walking operations require setting a 'visited' flag on
145 # Many graph walking operations require a work queue and computing
  /external/chromium_org/chrome/browser/resources/net_internals/
main.js 61 // can safely use the globals, rather than depending on walking through
  /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
tree.rb 77 capable of walking through the AST, verifying its structure and performing
    [all...]
  /external/libvorbis/doc/
03-codebook.tex 392 codebook. This process can be though of as logically walking the
396 Walking the tree finishes when the decode process hits a leaf in the
  /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/
Antlr.Runtime.Tree.pas 379 /// The stream is notified because it is walking the tree and might need
478 /// For huge child lists, inserting children can force walking rest of
701 /// but just in bookkeeping, not tree walking etc...
    [all...]
Antlr.Runtime.pas 364 /// When walking ahead with cyclic DFA for syntactic predicates, we
    [all...]
  /dalvik/docs/
prettify.js 466 // ignored. Continue walking the list until we see a matching end
    [all...]
  /build/tools/droiddoc/templates-sac/assets/js/
android_3p-bundle.js 705 // ignored. Continue walking the list until we see a matching end
    [all...]
  /build/tools/droiddoc/templates-sdk/assets/js/
android_3p-bundle.js 705 // ignored. Continue walking the list until we see a matching end
    [all...]

Completed in 841 milliseconds