HomeSort by relevance Sort by last modified time
    Searched full:tree (Results 201 - 225 of 8445) sorted by null

1 2 3 4 5 6 7 891011>>

  /external/antlr/antlr-3.4/runtime/JavaScript/tests/functional/
t053heteroTP.g 9 function VX(ttype, tree) {
12 org.antlr.lang.extend(VX, org.antlr.runtime.tree.CommonTree, {
  /external/chromium/chrome/browser/resources/sync_internals/
sync_node_browser.html 1 <!-- TODO(akalin): Move to a three-pane view; node tree on the left
2 (minus leaf nodes), tree contents list on the upper right, selected
8 behavior when tree is too tall (currently it makes you scroll the
10 <div id="sync-node-tree-container">
11 <tree id="sync-node-tree"></tree>
65 chrome.sync.decorateSyncNodeBrowser('sync-node-tree');
  /external/chromium_org/content/test/data/accessibility/
modal-dialog-stack-expected-android.txt 5 android.view.View clickable name='This is the now active dialog. Of course it should be in the tree.'
6 android.widget.Button clickable focusable name='This is in the active dialog and should be in the tree.'
  /external/chromium_org/third_party/libwebp/utils/
huffman_encode.h 5 // tree. An additional intellectual property rights grant can be found
7 // be found in the AUTHORS file in the root of the source tree.
23 // Struct for holding the tree header in coded form.
29 // Struct to represent the tree codes (depth and bits array).
36 // Turn the Huffman tree into a token sequence.
38 int VP8LCreateCompressedHuffmanTree(const HuffmanTreeCode* const tree,
41 // Create an optimized tree, and tokenize it.
43 HuffmanTreeCode* const tree);
  /external/chromium_org/ui/views/controls/tree/
tree_view_controller.cc 5 #include "ui/views/controls/tree/tree_view_controller.h"
8 #include "ui/views/controls/tree/tree_view.h"
  /external/libvpx/libvpx/vp8/encoder/
modecosts.h 6 * tree. An additional intellectual property rights grant can be found
8 * be found in the AUTHORS file in the root of the source tree.
  /external/libvpx/libvpx/vpx_ports/
config.h 6 * tree. An additional intellectual property rights grant can be found
8 * be found in the AUTHORS file in the root of the source tree.
  /external/webp/src/utils/
huffman_encode.h 5 // tree. An additional intellectual property rights grant can be found
7 // be found in the AUTHORS file in the root of the source tree.
23 // Struct for holding the tree header in coded form.
29 // Struct to represent the tree codes (depth and bits array).
36 // Turn the Huffman tree into a token sequence.
38 int VP8LCreateCompressedHuffmanTree(const HuffmanTreeCode* const tree,
41 // Create an optimized tree, and tokenize it.
43 HuffmanTreeCode* const tree);
  /external/chromium_org/cc/trees/
tree_synchronizer.h 20 // Accepts a Layer tree and returns a reference to a LayerImpl tree that
21 // duplicates the structure of the Layer tree, reusing the LayerImpls in the
22 // tree provided by old_layer_impl_root if possible.
32 // Pushes properties from a Layer or LayerImpl tree to a structurally
33 // equivalent LayerImpl tree.
  /external/chromium_org/tools/deep_memory_profiler/visualizer/static/third_party/jqTree/
jqtree.css 1 ul.jqtree-tree {
5 ul.jqtree-tree,
6 ul.jqtree-tree ul.jqtree_common {
12 ul.jqtree-tree ul.jqtree_common {
17 ul.jqtree-tree li.jqtree-closed > ul.jqtree_common {
21 ul.jqtree-tree li.jqtree_common {
25 ul.jqtree-tree .jqtree-toggler {
38 ul.jqtree-tree .jqtree-toggler:hover {
42 ul.jqtree-tree .jqtree-element {
46 ul.jqtree-tree .jqtree-title
    [all...]
  /external/valgrind/main/memcheck/tests/
leak-tree.stderr.exp 7 by 0x........: mk (leak-tree.c:28)
8 by 0x........: f (leak-tree.c:44)
9 by 0x........: main (leak-tree.c:63)
13 by 0x........: mk (leak-tree.c:28)
14 by 0x........: f (leak-tree.c:43)
15 by 0x........: main (leak-tree.c:63)
  /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/tree/
debug.rb 45 def copy_tree( tree )
51 def simulate_tree_construction( tree )
52 @debug_listener.create_node( tree )
53 child_count( tree ).times do |i|
54 child = self.child_of( tree, i )
56 @debug_listener.add_child( tree, child )
72 def add_child( tree, child )
76 add_child( tree, node )
78 tree.nil? || child.nil? and return
79 super( tree, child
    [all...]
  /external/chromium_org/chrome/browser/resources/file_manager/foreground/css/
file_types.css 14 tree:focus .tree-item[selected] > .tree-row > [file-type-icon],
28 tree:focus .tree-item[selected] > .tree-row > [file-type-icon='archive'],
42 tree:focus .tree-item[selected] > .tree-row > [file-type-icon='audio'],
56 tree:focus .tree-item[selected] > .tree-row > [file-type-icon='excel']
    [all...]
  /external/svox/pico/lib/
picokdt.h 48 - Part of speech prediction decision tree: ...kdt_PosP
49 - Part of speech disambiguation decision tree: ...kdt_PosD
50 - Grapheme-to-phoneme decision tree: ...kdt_G2P
51 - Phrasing decision tree: ...kdt_PHR
52 - Accentuation decision tree: ...kdt_ACC
53 these 5 tree types may be unified in the future to a single type
82 /* decision tree types (opaque) and get Tree functions */
85 /* decision tree types */
93 /* return kb decision tree for usage in PU *
    [all...]
  /external/antlr/antlr-3.4/runtime/Python/antlr3/
__init__.py 25 - tree.TreeParser: Base class for %tree parser.
50 And tree.TreeParser finally fetches its input from a tree.TreeNodeStream:
52 - tree.CommonTreeNodeStream: A basic and most commonly used tree.TreeNodeStream
59 Parser can build a Tree, if the output=AST option has been set in the grammar.
64 - ClassicToken: A Token object as used in ANTLR 2.x, used to %tree
67 Tree objects are wrapper for Token objects.
69 - tree.CommonTree: A basic and most commonly used Tree implementation
    [all...]
  /external/guava/guava-tests/test/com/google/common/collect/
TreeMultimapExplicitTest.java 84 multimap.put("tree", 0);
85 multimap.put("tree", null);
93 TreeMultimap<String, Integer> tree = TreeMultimap.create( local
95 tree.put("google", 2);
96 tree.put("google", 6);
97 tree.put("tree", 0);
98 tree.put("tree", 3);
99 ASSERT.that(tree.keySet()).hasContentsInOrder("tree", "google")
    [all...]
  /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
DOTTreeGenerator.java 28 package org.antlr.runtime.tree;
36 * can pass in any kind of tree or use Tree interface method.
38 * ST just to use the org.antlr.runtime.tree.* package.
47 * Tree t = (Tree)r.tree;
79 public StringTemplate toDOT(Object tree,
86 toDOTDefineNodes(tree, adaptor, treeST);
88 toDOTDefineEdges(tree, adaptor, treeST)
    [all...]
  /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/
BaseTreeAdaptor.as 1 package org.antlr.runtime.tree {
9 /** A TreeAdaptor that works with any Tree implementation. */
13 * expensive: we have to create a hashtable with all tree nodes in it.
22 /** create tree node that holds the start and stop tokens associated
25 * If you specify your own kind of tree nodes, you will likely have to
31 * subclass your own tree node class to avoid class cast exception.
40 public function isNil(tree:Object):Boolean {
41 return Tree(tree).isNil;
44 public function dupTree(tree:Object):Object
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp2/
API CHANGES.TXT 11 Antlr.Runtime.Tree.Tree renamed to Antlr.Runtime.Tree.TreeConstants
36 Antlr.Runtime.Tree.RewriteRuleElementStream is no longer generic (this causes appropriate changes to the derived classes). Usually T and SpecializingType have been replaced with "object".
37 Antlr.Runtime.Tree.RewriteRuleElementStream.HasNext has been turned into a property
38 Antlr.Runtime.Tree.RewriteRuleElementStream._Next() has been merged with NextTree()
39 Antlr.Runtime.Tree.RewriteRuleElementStream.Dup() has been added
41 Antlr.Runtime.Tree.RewriteRuleTokenStream.Dup() has been added
43 Antlr.Runtime.Tree.RewriteRuleTokenStream.Dup() has been added
47 Antlr.Runtime.Tree.ITreeAdaptor.GetNilNode has been turned into property Nil (implementing classes followed
    [all...]
  /external/chromium/chrome/browser/resources/bookmark_manager/js/
bmm_test.html 20 var tree = {
50 // getSubtree gets the root tree when id is ''.
52 if (id == tree.id)
67 assertEquals(tree, node);
72 chrome.experimental.bookmarkManager.getSubtree.load(tree);
83 assertEquals(tree, node);
87 assertEquals(tree, node);
95 chrome.experimental.bookmarkManager.getSubtree.load(tree);
106 assertEquals(tree.children[0], node);
111 chrome.experimental.bookmarkManager.getSubtree.load(tree.children[0])
    [all...]
  /external/chromium/chrome/browser/ui/webui/
cookies_tree_model_adapter.h 15 // CookiesTreeModelAdapter binds a CookiesTreeModel with a JS tree. It observes
16 // tree model changes and forwards them to JS tree. It also provides a
17 // a callback for JS tree to load children of a specific node.
26 // Sets up the bindings between js tree and |model|.
44 // JS callback that gets the tree node using the tree path info in |args| and
56 // Hosting WebUI of the js tree.
59 // Id of JS tree that is managed by this handler.
62 // The Cookies Tree model. Note that we are not owning the model
    [all...]
  /external/chromium_org/chrome/browser/extensions/api/bookmarks/
bookmark_api_helpers_unittest.cc 42 scoped_ptr<BookmarkTreeNode> tree(
46 ASSERT_EQ(3U, tree->children->size());
50 scoped_ptr<BookmarkTreeNode> tree(
54 ASSERT_EQ(1U, tree->children->size());
58 scoped_ptr<BookmarkTreeNode> tree(
62 ASSERT_EQ(4U, tree->children->size());
63 linked_ptr<BookmarkTreeNode> digg = tree->children->at(1);
69 scoped_ptr<BookmarkTreeNode> tree(
73 ASSERT_EQ(2U, tree->children->size());
74 linked_ptr<BookmarkTreeNode> inner_folder = tree->children->at(1)
    [all...]
  /external/chromium_org/chrome/browser/resources/bookmark_manager/js/
bmm_test.html 20 var tree = {
48 // getSubtree gets the root tree when id is ''.
50 if (id == tree.id)
65 assertEquals(tree, node);
70 chrome.bookmarkManagerPrivate.getSubtree.load(tree);
81 assertEquals(tree, node);
85 assertEquals(tree, node);
93 chrome.bookmarkManagerPrivate.getSubtree.load(tree);
104 assertEquals(tree.children[0], node);
109 chrome.bookmarkManagerPrivate.getSubtree.load(tree.children[0])
    [all...]
  /external/chromium_org/chrome/browser/resources/enhanced_bookmark_manager/js/
bmm_test.html 20 var tree = {
48 // getSubtree gets the root tree when id is ''.
50 if (id == tree.id)
65 assertEquals(tree, node);
70 chrome.bookmarkManagerPrivate.getSubtree.load(tree);
81 assertEquals(tree, node);
85 assertEquals(tree, node);
93 chrome.bookmarkManagerPrivate.getSubtree.load(tree);
104 assertEquals(tree.children[0], node);
109 chrome.bookmarkManagerPrivate.getSubtree.load(tree.children[0])
    [all...]
  /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
toplev.h 30 extern void rest_of_decl_compilation (tree, int, int);
31 extern void rest_of_type_compilation (tree, int);
32 extern void tree_rest_of_compilation (tree);
42 extern void announce_function (tree);
44 extern void wrapup_global_declaration_1 (tree);
45 extern bool wrapup_global_declaration_2 (tree);
46 extern bool wrapup_global_declarations (tree *, int);
47 extern void check_global_declaration_1 (tree);
48 extern void check_global_declarations (tree *, int);
49 extern void emit_debug_global_declarations (tree *, int)
    [all...]

Completed in 1497 milliseconds

1 2 3 4 5 6 7 891011>>