/external/chromium_org/chrome/browser/resources/chromeos/chromevox/walkers/ |
column_walker.js | 6 * @fileoverview A class for walking columns.
|
row_walker.js | 6 * @fileoverview A class for walking rows.
|
sentence_walker.js | 6 * @fileoverview A JavaScript class for walking sentences.
|
word_walker.js | 6 * @fileoverview A class for walking one word at a time.
|
character_walker.js | 6 * @fileoverview A class for walking one character at a time.
|
bare_object_walker.js | 6 * @fileoverview A JavaScript class for walking the leaf nodes of the dom.
|
group_walker.js | 6 * @fileoverview A class for walking "groups". Groups, intuitively, are logical
|
object_walker.js | 6 * @fileoverview A JavaScript class for walking the leaf nodes of the dom.
|
structural_line_walker.js | 6 * @fileoverview A JavaScript class for walking lines.
|
abstract_selection_walker.js | 6 * @fileoverview An abstract class for walking at the sub-element level. 7 * For example, walking at the sentence, word, or character level.
|
math_shifter.js | 6 * @fileoverview A class for walking mathml expressions.
|
layout_line_walker.js | 6 * @fileoverview A JavaScript class for walking lines consisting of one or more
|
table_walker.js | 6 * @fileoverview A class for walking tables.
|
/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...] |
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
aria_util_test.js | 138 // getLiveRegions works walking up the tree as well.
|
/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 | 62 // 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...] |