OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:deepest
(Results
1 - 12
of
12
) sorted by null
/external/e2fsprogs/lib/ext2fs/
rbtree.c
317
* before removing the node, find the
deepest
node on the rebalance path
322
struct rb_node *
deepest
;
local
325
deepest
= ext2fs_rb_parent(node);
327
deepest
= node->rb_left;
329
deepest
= node->rb_right;
331
deepest
= ext2fs_rb_next(node);
332
if (
deepest
->rb_right)
333
deepest
=
deepest
->rb_right;
334
else if (ext2fs_rb_parent(
deepest
) != node
[
all
...]
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/walkers/
abstract_selection_walker.js
74
// Find the
deepest
visible node; written specifically here because we want
75
// to move across siblings if necessary and take the
deepest
node which can
93
// node has no visible children; it's therefore the
deepest
visible node.
/external/chromium_org/tools/telemetry/telemetry/timeline/
thread.py
209
We do the same
deepest
-to-shallowest walk of the subrows trying to fit
/external/chromium_org/ui/views/controls/menu/
menu_controller.cc
120
View*
deepest
= GetFirstFocusableView(view->child_at(i), -1, forward);
local
121
if (
deepest
)
122
return
deepest
;
126
View*
deepest
= GetFirstFocusableView(view->child_at(i), -1, forward);
local
127
if (
deepest
)
128
return
deepest
;
[
all
...]
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/x11/
fakeglx.c
649
/* start with
deepest
*/
680
/* start with
deepest
*/
697
* Find the
deepest
X over/underlay visual of at least min_depth.
717
int
deepest
;
local
736
/* Search for the
deepest
overlay which satisifies all criteria. */
737
deepest
= min_depth;
780
if (deepvis==NULL || vislist->depth >
deepest
) {
785
deepest
= vislist->depth;
[
all
...]
/external/mesa3d/src/mesa/drivers/x11/
fakeglx.c
649
/* start with
deepest
*/
680
/* start with
deepest
*/
697
* Find the
deepest
X over/underlay visual of at least min_depth.
717
int
deepest
;
local
736
/* Search for the
deepest
overlay which satisifies all criteria. */
737
deepest
= min_depth;
780
if (deepvis==NULL || vislist->depth >
deepest
) {
785
deepest
= vislist->depth;
[
all
...]
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/
dom_util.js
[
all
...]
/external/chromium_org/ui/file_manager/file_manager/background/js/
file_operation_manager.js
883
// process the
deepest
entry first. Since move of each entry is
[
all
...]
/prebuilts/eclipse/maven/apache-maven-3.2.1/lib/
jsoup-1.7.2.jar
/external/jarjar/lib/
apache-ant-1.9.4.jar
/external/owasp/sanitizer/tools/findbugs/lib/
ant.jar
/prebuilts/tools/common/m2/repository/org/apache/ant/ant/1.8.2/
ant-1.8.2.jar
Completed in 557 milliseconds