Searched refs:side (Results 1 - 25 of 120) sorted by relevance

12345

/external/guava/guava/src/com/google/common/collect/
H A DBstInOrderPath.java39 public BstInOrderPath<N> extension(BstInOrderPath<N> path, BstSide side) {
40 return BstInOrderPath.extension(path, side);
51 BstInOrderPath<N> path, BstSide side) {
54 return new BstInOrderPath<N>(tip.getChild(side), side, path);
68 private Optional<BstInOrderPath<N>> computeNextInOrder(BstSide side) { argument
69 if (getTip().hasChild(side)) {
70 BstInOrderPath<N> path = extension(this, side);
71 BstSide otherSide = side.other();
78 while (current.sideExtension == side) {
50 extension( BstInOrderPath<N> path, BstSide side) argument
86 nextInOrder(BstSide side) argument
103 hasNext(BstSide side) argument
112 next(BstSide side) argument
[all...]
H A DBstRangeOps.java54 // Returns total value strictly to the specified side of the specified range.
56 BstAggregate<? super N> aggregate, GeneralRange<K> range, BstSide side, @Nullable N root) {
59 if (beyond(range, root.getKey(), side)) {
61 accum += aggregate.treeValue(root.childOrNull(side));
62 root = root.childOrNull(side.other());
64 root = root.childOrNull(side);
92 * specified side of the specified range.
96 BstBalancePolicy<N> balancePolicy, BstNodeFactory<N> nodeFactory, BstSide side,
101 if (beyond(range, root.getKey(), side)) {
104 switch (side) {
55 totalBeyondRangeToSide( BstAggregate<? super N> aggregate, GeneralRange<K> range, BstSide side, @Nullable N root) argument
95 subTreeBeyondRangeToSide(GeneralRange<K> range, BstBalancePolicy<N> balancePolicy, BstNodeFactory<N> nodeFactory, BstSide side, @Nullable N root) argument
126 furthestPath( GeneralRange<K> range, BstSide side, BstPathFactory<N, P> pathFactory, @Nullable N root) argument
138 furthestPath( GeneralRange<K> range, BstSide side, BstPathFactory<N, P> pathFactory, P currentPath) argument
162 beyond(GeneralRange<K> range, @Nullable K key, BstSide side) argument
[all...]
H A DBstNode.java78 * Returns the child on the specified side, or {@code null} if there is no such child.
81 public final N childOrNull(BstSide side) { argument
82 switch (side) {
93 * Returns {@code true} if this node has a child on the specified side.
95 public final boolean hasChild(BstSide side) { argument
96 return childOrNull(side) != null;
100 * Returns this node's child on the specified side.
104 public final N getChild(BstSide side) { argument
105 N child = childOrNull(side);
H A DBstPathFactory.java30 * Returns this path extended by one node to the specified {@code side}.
32 P extension(P path, BstSide side); argument
H A DBstMutationResult.java120 * side, returns the {@code BstMutationResult} of applying the mutation to the appropriate child
123 public BstMutationResult<K, N> lift(N liftOriginalRoot, BstSide side, argument
125 assert liftOriginalRoot != null & side != null & nodeFactory != null & balancePolicy != null;
135 switch (side) {
/external/kernel-headers/original/linux/netfilter_ipv4/
H A Dipt_recent.h24 u_int8_t side; member in struct:ipt_recent_info
/external/guava/guava-tests/test/com/google/common/collect/
H A DBstNodeTest.java37 private void testLacksChild(SimpleNode node, BstSide side) { argument
38 assertNull(node.childOrNull(side));
39 assertFalse(node.hasChild(side));
41 node.getChild(side);
46 private void testChildIs(SimpleNode node, BstSide side, SimpleNode expectedChild) { argument
47 assertEquals(expectedChild, node.childOrNull(side));
48 assertTrue(node.hasChild(side));
49 assertEquals(expectedChild, node.getChild(side));
/external/iptables/include/linux/netfilter/
H A Dxt_recent.h32 __u8 side; member in struct:xt_recent_mtinfo
/external/jmonkeyengine/engine/src/tools/jme3tools/optimize/
H A DFastOctnode.java53 public void setSide(int side){ argument
55 offset |= (side << 29);
90 private static void findChildBound(BoundingBox bbox, int side){ argument
92 bbox.getCenter().set(bbox.getCenter().x + extent * Octnode.extentMult[side].x,
93 bbox.getCenter().y + extent * Octnode.extentMult[side].y,
94 bbox.getCenter().z + extent * Octnode.extentMult[side].z);
H A DOctnode.java76 private BoundingBox getChildBound(int side){ argument
78 Vector3f center = new Vector3f(bbox.getCenter().x + extent * extentMult[side].x,
79 bbox.getCenter().y + extent * extentMult[side].y,
80 bbox.getCenter().z + extent * extentMult[side].z);
197 public void generateFastOctnodeLinks(Octnode parent, Octnode nextSibling, int side){ argument
198 fastNode.setSide(side);
/external/quake/quake/src/QW/client/
H A Dpmovetst.c40 int side; local
51 side = i&1;
53 box_clipnodes[i].children[side] = CONTENTS_EMPTY;
55 box_clipnodes[i].children[side^1] = i + 1;
57 box_clipnodes[i].children[side^1] = CONTENTS_SOLID;
184 int side; local
235 // put the crosspoint DIST_EPSILON pixels on the near side
249 side = (t1 < 0);
252 if (!PM_RecursiveHullCheck (hull, node->children[side], p1f, midf, p1, mid, trace) )
256 if (PM_HullPointContents (pm_hullmodel, mid, node->children[side])
[all...]
H A Dr_bsp.c161 int i, side, lastside; local
201 side = 0;
203 side = 1;
205 if (side != lastside)
224 // split into two edges, one on each side, and remember entering
240 ptedge->pnext = psideedges[side];
241 psideedges[side] = ptedge;
247 if (side == 0)
261 // add the edge to the appropriate side
262 pedges->pnext = psideedges[side];
450 int i, c, side, *pindex; local
[all...]
H A Dr_light.c145 int side; local
165 side = front < 0;
167 if ( (back < 0) == side)
168 return RecursiveLightPoint (node->children[side], start, end);
175 // go down front side
176 r = RecursiveLightPoint (node->children[side], start, mid);
180 if ( (back < 0) == side )
234 // go down back side
235 return RecursiveLightPoint (node->children[!side], mid, end);
H A Dgl_rlight.c271 int side; local
291 side = front < 0;
293 if ( (back < 0) == side)
294 return RecursiveLightPoint (node->children[side], start, end);
301 // go down front side
302 r = RecursiveLightPoint (node->children[side], start, mid);
306 if ( (back < 0) == side )
362 // go down back side
363 return RecursiveLightPoint (node->children[!side], mid, end);
H A Dview.c85 float side; local
89 side = DotProduct (velocity, right);
90 sign = side < 0 ? -1 : 1;
91 side = fabs(side);
95 if (side < cl_rollspeed.value)
96 side = side * value / cl_rollspeed.value;
98 side = value;
100 return side*sig
329 float side; local
823 float side; local
[all...]
/external/doclava/res/assets/templates/
H A Dhead_tag.cs35 #side-nav{padding:0;}
36 #side-nav .toggle-list ul {display:block;}
/external/quake/quake/src/WinQuake/
H A Dr_bsp.cpp161 int i, side, lastside; local
201 side = 0;
203 side = 1;
205 if (side != lastside)
224 // split into two edges, one on each side, and remember entering
240 ptedge->pnext = psideedges[side];
241 psideedges[side] = ptedge;
247 if (side == 0)
261 // add the edge to the appropriate side
262 pedges->pnext = psideedges[side];
450 int i, c, side, *pindex; local
[all...]
H A Dr_light.cpp145 int side; local
165 side = front < 0;
167 if ( (back < 0) == side)
168 return RecursiveLightPoint (node->children[side], start, end);
175 // go down front side
176 r = RecursiveLightPoint (node->children[side], start, mid);
180 if ( (back < 0) == side )
234 // go down back side
235 return RecursiveLightPoint (node->children[!side], mid, end);
H A Dgl_rlight.cpp274 int side; local
294 side = front < 0;
296 if ( (back < 0) == side)
297 return RecursiveLightPoint (node->children[side], start, end);
304 // go down front side
305 r = RecursiveLightPoint (node->children[side], start, mid);
309 if ( (back < 0) == side )
365 // go down back side
366 return RecursiveLightPoint (node->children[!side], mid, end);
H A Dview.cpp84 float side; local
88 side = DotProduct (velocity, right);
89 sign = side < 0 ? -1 : 1;
90 side = fabs(side);
96 if (side < cl_rollspeed.value)
97 side = side * value / cl_rollspeed.value;
99 side = value;
101 return side*sig
810 float side; local
[all...]
/external/iptables/extensions/
H A Dlibxt_recent.c82 info->side = XT_RECENT_SOURCE;
115 info->side = XT_RECENT_SOURCE;
118 info->side = XT_RECENT_DEST;
153 if (info->side == XT_RECENT_SOURCE)
154 printf(" side: source");
155 if (info->side == XT_RECENT_DEST)
156 printf(" side: dest");
179 if (info->side == XT_RECENT_SOURCE)
181 if (info->side == XT_RECENT_DEST)
/external/doclava/res/assets/templates/assets/
H A Ddoclava-developer-docs.css29 #side-nav {
35 #side-nav.not-resizable {
59 #side-nav ul {
65 #side-nav ul ul {
70 #side-nav li {
77 #side-nav li h2 {
84 #side-nav li a {
90 #side-nav li a span+span {
94 #side-nav li a:hover {
98 #side
[all...]
/external/clang/test/CXX/expr/expr.ass/
H A Dp9-cxx11.cpp16 a = { 1 } = b; // expected-error {{initializer list cannot be used on the left hand side of operator '='}}
17 a = a + { 4 }; // expected-error {{initializer list cannot be used on the right hand side of operator '+'}}
18 a = { 3 } * { 4 }; // expected-error {{initializer list cannot be used on the left hand side of operator '*'}} \
19 expected-error {{initializer list cannot be used on the right hand side of operator '*'}}
33 int k1 = T() = { 1, 2 } = { 3, 4 }; // expected-error {{initializer list cannot be used on the left hand side of operator '='}}
34 int k2 = T() = { 1, 2 } + 1; // expected-error {{initializer list cannot be used on the left hand side of operator '+'}}
/external/webkit/Source/WebCore/rendering/
H A DRenderBoxModelObject.cpp855 // As a side effect of an optimization to blit on scroll, we do not honor the CSS
1051 static inline BorderEdgeFlag edgeFlagForSide(BoxSide side) argument
1053 return static_cast<BorderEdgeFlag>(1 << side);
1056 static inline bool includesEdge(BorderEdgeFlags flags, BoxSide side) argument
1058 return flags & edgeFlagForSide(side);
1128 static inline bool borderStyleHasUnmatchedColorsAtCorner(EBorderStyle style, BoxSide side, BoxSide adjacentSide) argument
1135 BorderEdgeFlags flags = edgeFlagForSide(side) | edgeFlagForSide(adjacentSide);
1141 static inline bool colorsMatchAtCorner(BoxSide side, BoxSide adjacentSide, const BorderEdge edges[]) argument
1143 if (edges[side].shouldRender() != edges[adjacentSide].shouldRender())
1146 if (!edgesShareColor(edges[side], edge
1153 willBeOverdrawn(BoxSide side, BoxSide adjacentSide, const BorderEdge edges[]) argument
1177 borderStylesRequireMitre(BoxSide side, BoxSide adjacentSide, EBorderStyle style, EBorderStyle adjacentStyle) argument
1191 joinRequiresMitre(BoxSide side, BoxSide adjacentSide, const BorderEdge edges[], bool allowOverdraw) argument
1208 paintOneBorderSide(GraphicsContext* graphicsContext, const RenderStyle* style, const RoundedIntRect& outerBorder, const RoundedIntRect& innerBorder, const IntRect& sideRect, BoxSide side, BoxSide adjacentSide1, BoxSide adjacentSide2, const BorderEdge edges[], const Path* path, bool includeLogicalLeftEdge, bool includeLogicalRightEdge, bool antialias, const Color* overrideColor) argument
1448 drawBoxSideFromPath(GraphicsContext* graphicsContext, const IntRect& borderRect, const Path& borderPath, const BorderEdge edges[], float thickness, float drawThickness, BoxSide side, const RenderStyle* style, Color color, EBorderStyle borderStyle, bool includeLogicalLeftEdge, bool includeLogicalRightEdge) argument
1945 clipBorderSidePolygon(GraphicsContext* graphicsContext, const RoundedIntRect& outerBorder, const RoundedIntRect& innerBorder, BoxSide side, bool firstEdgeMatches, bool secondEdgeMatches) argument
[all...]
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/
H A DRewriteRuleNodeStream.as4 /** Queues up nodes matched on left side of -> in a tree parser. This is

Completed in 1140 milliseconds

12345