| /external/chromium_org/third_party/freetype/src/sfnt/ |
| sfobjs.c | 147 FT_Memory memory = face->root.memory;
452 FT_Library library = face->root.driver->root.library;
499 face->root.num_faces = face->ttc_header.count;
500 face->root.face_index = face_index;
602 has_outline = FT_BOOL( face->root.internal->incremental_interface != 0 ||
666 if ( face->root.internal->incremental_interface &&
667 face->root.internal->incremental_interface->funcs->
693 if ( face->root.internal->incremental_interface &&
694 face->root.internal->incremental_interface->funcs-
798 FT_Face root = &face->root; local
[all...] |
| /external/freetype/src/sfnt/ |
| sfobjs.c | 147 FT_Memory memory = face->root.memory;
452 FT_Library library = face->root.driver->root.library;
499 face->root.num_faces = face->ttc_header.count;
500 face->root.face_index = face_index;
602 has_outline = FT_BOOL( face->root.internal->incremental_interface != 0 ||
666 if ( face->root.internal->incremental_interface &&
667 face->root.internal->incremental_interface->funcs->
693 if ( face->root.internal->incremental_interface &&
694 face->root.internal->incremental_interface->funcs-
798 FT_Face root = &face->root; local
[all...] |
| /development/samples/ApiDemos/src/com/example/android/apis/graphics/ |
| DensityActivity.java | 52 LinearLayout root = new LinearLayout(this); local
53 root.setOrientation(LinearLayout.VERTICAL);
59 addLabelToRoot(root, "Prescaled bitmap in drawable");
60 addChildToRoot(root, layout);
66 addLabelToRoot(root, "Autoscaled bitmap in drawable");
67 addChildToRoot(root, layout);
73 addLabelToRoot(root, "Prescaled resource drawable");
74 addChildToRoot(root, layout);
77 addLabelToRoot(root, "Inflated layout");
78 addChildToRoot(root, layout)
[all...] |
| /external/chromium_org/third_party/skia/src/core/ |
| SkRTree.cpp | 131 SkRTree::Branch* SkRTree::insert(Node* root, Branch* branch, uint16_t level) {
133 if (root->fLevel != level) {
134 int childIndex = this->chooseSubtree(root, branch);
135 toInsert = this->insert(root->child(childIndex)->fChild.subtree, branch, level);
136 root->child(childIndex)->fBounds = this->computeBounds(
137 root->child(childIndex)->fChild.subtree);
140 if (root->fNumChildren == fMaxChildren) {
144 Node* newSibling = this->allocateNode(root->fLevel);
147 toDivide[i] = *root->child(i);
153 root->fNumChildren = splitIndex
[all...] |
| SkTSort.h | 28 /* Sifts a broken heap. The input array is a heap from root to bottom
29 * except that the root entry may be out of place.
31 * Sinks a hole from array[root] to leaf and then sifts the original array[root] element
37 * the potentially out of place root entry value is expected to be small.
39 * @param root the one based index into array of the out-of-place root of the heap.
43 void SkTHeapSort_SiftUp(T array[], size_t root, size_t bottom, C lessThan) {
44 T x = array[root-1];
45 size_t start = root;
[all...] |
| /external/chromium_org/tools/ |
| licenses.py | 22 # Paths from the root of the tree to directories to skip.
140 # Absolute path here is resolved as relative to the source root.
191 # Absolute path here is resolved as relative to the source root.
221 # Absolute path here is resolved as relative to the source root.
236 def AbsolutePath(path, filename, root):
238 root."""
240 # Absolute-looking paths are relative to the source root
242 absolute_path = os.path.join(root, filename[1:])
244 absolute_path = os.path.join(root, path, filename)
249 def ParseDir(path, root, require_license_file=True)
[all...] |
| /external/skia/src/core/ |
| SkRTree.cpp | 131 SkRTree::Branch* SkRTree::insert(Node* root, Branch* branch, uint16_t level) {
133 if (root->fLevel != level) {
134 int childIndex = this->chooseSubtree(root, branch);
135 toInsert = this->insert(root->child(childIndex)->fChild.subtree, branch, level);
136 root->child(childIndex)->fBounds = this->computeBounds(
137 root->child(childIndex)->fChild.subtree);
140 if (root->fNumChildren == fMaxChildren) {
144 Node* newSibling = this->allocateNode(root->fLevel);
147 toDivide[i] = *root->child(i);
153 root->fNumChildren = splitIndex
[all...] |
| SkTSort.h | 28 /* Sifts a broken heap. The input array is a heap from root to bottom
29 * except that the root entry may be out of place.
31 * Sinks a hole from array[root] to leaf and then sifts the original array[root] element
37 * the potentially out of place root entry value is expected to be small.
39 * @param root the one based index into array of the out-of-place root of the heap.
43 void SkTHeapSort_SiftUp(T array[], size_t root, size_t bottom, C lessThan) {
44 T x = array[root-1];
45 size_t start = root;
[all...] |
| /frameworks/base/tests/DpiTest/src/com/google/android/test/dpi/ |
| DpiTestActivity.java | 82 LinearLayout root = new LinearLayout(this); local
83 root.setOrientation(LinearLayout.VERTICAL);
89 addLabelToRoot(root, "Prescaled bitmap in drawable");
90 addChildToRoot(root, layout);
96 addLabelToRoot(root, "Autoscaled bitmap in drawable");
97 addChildToRoot(root, layout);
103 addLabelToRoot(root, "Prescaled resource drawable");
104 addChildToRoot(root, layout);
107 addLabelToRoot(root, "Inflated layout");
108 addChildToRoot(root, layout)
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib-tk/ |
| Tkdnd.py | 44 root widget. If none of the target widgets can produce a target
110 if h.root:
120 root = None variable in class:DndHandler
125 root = event.widget._root()
127 root.__dnd
130 root.__dnd = self
131 self.root = root
143 root = self.root
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib-tk/ |
| Tkdnd.py | 44 root widget. If none of the target widgets can produce a target
110 if h.root:
120 root = None variable in class:DndHandler
125 root = event.widget._root()
127 root.__dnd
130 root.__dnd = self
131 self.root = root
143 root = self.root
[all...] |
| /external/chromium_org/cc/trees/ |
| layer_tree_host_unittest_scroll.cc | 42 Layer* root = layer_tree_host()->root_layer(); variable
44 EXPECT_VECTOR_EQ(initial_scroll_, root->scroll_offset());
46 EXPECT_VECTOR_EQ(initial_scroll_ + scroll_amount_, root->scroll_offset());
49 root->SetScrollOffset(second_scroll_);
54 LayerImpl* root = impl->active_tree()->root_layer(); variable
55 EXPECT_VECTOR_EQ(gfx::Vector2d(), root->ScrollDelta());
57 root->SetScrollable(true);
58 root->SetMaxScrollOffset(gfx::Vector2d(100, 100));
59 root->ScrollBy(scroll_amount_);
63 EXPECT_VECTOR_EQ(initial_scroll_, root->scroll_offset())
107 Layer* root = layer_tree_host()->root_layer(); variable
123 LayerImpl* root = impl->active_tree()->root_layer(); variable
355 LayerImpl* root = impl->active_tree()->root_layer(); variable
736 Layer* root = layer_tree_host()->root_layer(); variable
760 LayerImpl* root = impl->active_tree()->root_layer(); variable
844 Layer* root = layer_tree_host()->root_layer(); variable
906 LayerImpl* root = impl->active_tree()->root_layer(); variable
941 LayerImpl* root = impl->active_tree()->root_layer(); variable
1054 LayerImpl* root = impl->active_tree()->root_layer(); variable
[all...] |
| /external/chromium_org/ash/shell/ |
| context_menu.cc | 17 ContextMenu::ContextMenu(aura::Window* root)
19 root_window_(root),
20 alignment_menu_(root) {
|
| /external/chromium_org/base/json/ |
| json_file_value_serializer.h | 35 virtual bool Serialize(const base::Value& root) OVERRIDE;
37 // Equivalent to Serialize(root) except binary values are omitted from the
39 bool SerializeAndOmitBinaryValues(const base::Value& root);
75 bool SerializeInternal(const base::Value& root, bool omit_binary_values);
|
| json_string_value_serializer.h | 41 virtual bool Serialize(const base::Value& root) OVERRIDE;
43 // Equivalent to Serialize(root) except binary values are omitted from the
45 bool SerializeAndOmitBinaryValues(const base::Value& root);
65 bool SerializeInternal(const base::Value& root, bool omit_binary_values);
|
| /external/chromium_org/chrome_frame/cfinstall/ |
| build.sh | 45 --root=$CLOSURE_LIBRARY_DIR --root=src/common/ \
46 --root=src/implementation/ \
55 --root=src/miniclosure/ --root=src/common/ \
56 --root=src/stub/ \
|
| /external/chromium_org/content/browser/frame_host/ |
| frame_tree_unittest.cc | 27 AppendTreeNodeState(frame_tree->root(), &result);
50 // The root node never changes during navigation even though its
52 // - Swapping main frame doesn't change root node.
59 FrameTreeNode* root = frame_tree.root(); local
60 ASSERT_TRUE(root);
66 EXPECT_EQ(root, frame_tree.root());
71 EXPECT_EQ(root, frame_tree.root());
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| HTMLCollection.cpp | 305 inline Element* firstMatchingElement(const NodeListType* nodeList, ContainerNode& root)
307 Element* element = ElementTraversal::firstWithin(root);
309 element = ElementTraversal::next(*element, &root);
314 inline Element* nextMatchingElement(const NodeListType* nodeList, Element& current, ContainerNode* root)
318 next = ElementTraversal::next(*next, root);
324 inline Element* traverseMatchingElementsForwardToOffset(const NodeListType* nodeList, unsigned offset, Element& currentElement, unsigned& currentOffset, ContainerNode* root)
328 while ((next = nextMatchingElement(nodeList, *next, root))) {
348 inline Element* LiveNodeListBase::traverseLiveNodeListFirstElement(ContainerNode& root) const
353 return firstMatchingElement(static_cast<const HTMLTagNodeList*>(this), root);
355 return firstMatchingElement(static_cast<const ClassNodeList*>(this), root);
[all...] |
| /external/chromium_org/third_party/angle/src/third_party/compiler/ |
| ArrayBoundsClamper.cpp | 83 void ArrayBoundsClamper::MarkIndirectArrayBoundsForClamping(TIntermNode* root)
85 ASSERT(root);
88 root->traverse(&clamper);
|
| /external/chromium_org/ui/views/focus/ |
| focus_search.h | 29 // - |root| is the root of the view hierarchy to traverse. Focus will be
32 // to the first view within this root when the traversal reaches
39 FocusSearch(View* root, bool cycle, bool accessibility_mode);
72 // Get the parent, but stay within the root. Returns NULL if asked for
77 // Returns true if |v| is contained within the hierarchy rooted at |root|.
79 virtual bool Contains(View* root, const View* v);
81 View* root() const { return root_; } function in class:views::FocusSearch
|
| /external/chromium_org/webkit/data/test_shell/sort/ |
| sort-heap.js | 26 function sift_down(sort, start, end, root) {
27 var child = root * 2 + 1;
32 if (sort.compare(root, child) < 0) {
33 sort.swap(root, child);
34 root = child;
35 sort.add_work(function() { sift_down(sort, start, end, root); },
|
| /external/icu4c/test/cintltst/ |
| cgendtst.c | 25 void addGendInfoForTest(TestNode** root);
28 #define TESTCASE(x) addTest(root, &x, "tsformat/cgendtst/" #x)
30 void addGendInfoForTest(TestNode** root)
|
| /external/zlib/src/ |
| inftrees.c | 28 requested root table index bits, and on return it is the actual root
43 unsigned root; /* number of index bits for root table */ local
51 unsigned low; /* low bits for current root entry */
52 unsigned mask; /* mask for low root bits */
112 /* bound code lengths, force root to be within code lengths */
113 root = *bits;
116 if (root > max) root = max
[all...] |
| /libcore/dom/src/test/java/org/w3c/domts/level1/core/ |
| documentgetrootnode.java | 32 * to the child node that is the root element of the document.
64 Element root; local
67 root = doc.getDocumentElement();
68 rootName = root.getNodeName();
|
| elementgettagname.java | 35 * root node. The value returned should be "staff".
64 Element root; local
67 root = doc.getDocumentElement();
68 tagname = root.getTagName();
|
