| /external/guava/guava/src/com/google/common/collect/ |
| D | BstInOrderPath.java | 39 public BstInOrderPath<N> extension(BstInOrderPath<N> path, BstSide side) { in inOrderFactory()
40 return BstInOrderPath.extension(path, side); in inOrderFactory()
51 BstInOrderPath<N> path, BstSide side) {
54 return new BstInOrderPath<N>(tip.getChild(side), side, path);
68 private Optional<BstInOrderPath<N>> computeNextInOrder(BstSide side) {
69 if (getTip().hasChild(side)) {
70 BstInOrderPath<N> path = extension(this, side);
71 BstSide otherSide = side.other();
78 while (current.sideExtension == side) {
86 private Optional<BstInOrderPath<N>> nextInOrder(BstSide side) {
[all …]
|
| D | BstRangeOps.java | 56 BstAggregate<? super N> aggregate, GeneralRange<K> range, BstSide side, @Nullable N root) { in totalBeyondRangeToSide() argument
59 if (beyond(range, root.getKey(), side)) { in totalBeyondRangeToSide()
61 accum += aggregate.treeValue(root.childOrNull(side)); in totalBeyondRangeToSide()
62 root = root.childOrNull(side.other()); in totalBeyondRangeToSide()
64 root = root.childOrNull(side); in totalBeyondRangeToSide()
96 BstBalancePolicy<N> balancePolicy, BstNodeFactory<N> nodeFactory, BstSide side, in subTreeBeyondRangeToSide() argument
101 if (beyond(range, root.getKey(), side)) { in subTreeBeyondRangeToSide()
104 switch (side) { in subTreeBeyondRangeToSide()
117 range, balancePolicy, nodeFactory, side, root.childOrNull(side)); in subTreeBeyondRangeToSide()
127 GeneralRange<K> range, BstSide side, BstPathFactory<N, P> pathFactory, @Nullable N root) { in furthestPath() argument
[all …]
|
| D | BstNode.java | 81 public final N childOrNull(BstSide side) { in childOrNull() argument
82 switch (side) { in childOrNull()
95 public final boolean hasChild(BstSide side) { in hasChild() argument
96 return childOrNull(side) != null; in hasChild()
104 public final N getChild(BstSide side) { in getChild() argument
105 N child = childOrNull(side); in getChild()
|
| /external/quake/quake/src/QW/progs/ |
| D | models.qc | 13 $flags 8 // client side rotate
21 $flags 8 // client side rotate
30 $flags 8 // client side rotate
39 $flags 8 // client side rotate
48 $flags 8 // client side rotate
56 $flags 8 // client side rotate
143 $flags 8 // client side rotate
150 $flags 8 // client side rotate
157 $flags 8 // client side rotate
164 $flags 8 // client side rotate
[all …]
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| D | BstNodeTest.java | 37 private void testLacksChild(SimpleNode node, BstSide side) { in testLacksChild() argument
38 assertNull(node.childOrNull(side)); in testLacksChild()
39 assertFalse(node.hasChild(side)); in testLacksChild()
41 node.getChild(side); in testLacksChild()
46 private void testChildIs(SimpleNode node, BstSide side, SimpleNode expectedChild) { in testChildIs() argument
47 assertEquals(expectedChild, node.childOrNull(side)); in testChildIs()
48 assertTrue(node.hasChild(side)); in testChildIs()
49 assertEquals(expectedChild, node.getChild(side)); in testChildIs()
|
| /external/quake/quake/src/QW/client/ |
| D | pmovetst.c | 40 int side; in PM_InitBoxHull() local
51 side = i&1; in PM_InitBoxHull()
53 box_clipnodes[i].children[side] = CONTENTS_EMPTY; in PM_InitBoxHull()
55 box_clipnodes[i].children[side^1] = i + 1; in PM_InitBoxHull()
57 box_clipnodes[i].children[side^1] = CONTENTS_SOLID; in PM_InitBoxHull()
184 int side; in PM_RecursiveHullCheck() local
249 side = (t1 < 0); in PM_RecursiveHullCheck()
252 if (!PM_RecursiveHullCheck (hull, node->children[side], p1f, midf, p1, mid, trace) ) in PM_RecursiveHullCheck()
256 if (PM_HullPointContents (pm_hullmodel, mid, node->children[side]) in PM_RecursiveHullCheck()
264 if (PM_HullPointContents (hull, node->children[side^1], mid) in PM_RecursiveHullCheck()
[all …]
|
| D | r_bsp.c | 161 int i, side, lastside; in R_RecursiveClipBPoly() local
201 side = 0; in R_RecursiveClipBPoly()
203 side = 1; in R_RecursiveClipBPoly()
205 if (side != lastside) in R_RecursiveClipBPoly()
240 ptedge->pnext = psideedges[side]; in R_RecursiveClipBPoly()
241 psideedges[side] = ptedge; in R_RecursiveClipBPoly()
247 if (side == 0) in R_RecursiveClipBPoly()
262 pedges->pnext = psideedges[side]; in R_RecursiveClipBPoly()
263 psideedges[side] = pedges; in R_RecursiveClipBPoly()
450 int i, c, side, *pindex; in R_RecursiveWorldNode() local
[all …]
|
| D | r_light.c | 145 int side; in RecursiveLightPoint() local
165 side = front < 0; in RecursiveLightPoint()
167 if ( (back < 0) == side) in RecursiveLightPoint()
168 return RecursiveLightPoint (node->children[side], start, end); in RecursiveLightPoint()
176 r = RecursiveLightPoint (node->children[side], start, mid); in RecursiveLightPoint()
180 if ( (back < 0) == side ) in RecursiveLightPoint()
235 return RecursiveLightPoint (node->children[!side], mid, end); in RecursiveLightPoint()
|
| D | view.c | 85 float side; in V_CalcRoll() local
89 side = DotProduct (velocity, right); in V_CalcRoll()
90 sign = side < 0 ? -1 : 1; in V_CalcRoll()
91 side = fabs(side); in V_CalcRoll()
95 if (side < cl_rollspeed.value) in V_CalcRoll()
96 side = side * value / cl_rollspeed.value; in V_CalcRoll()
98 side = value; in V_CalcRoll()
100 return side*sign; in V_CalcRoll()
329 float side; in V_ParseDamage() local
376 side = DotProduct (from, right); in V_ParseDamage()
[all …]
|
| D | gl_rlight.c | 271 int side; in RecursiveLightPoint() local
291 side = front < 0; in RecursiveLightPoint()
293 if ( (back < 0) == side) in RecursiveLightPoint()
294 return RecursiveLightPoint (node->children[side], start, end); in RecursiveLightPoint()
302 r = RecursiveLightPoint (node->children[side], start, mid); in RecursiveLightPoint()
306 if ( (back < 0) == side ) in RecursiveLightPoint()
363 return RecursiveLightPoint (node->children[!side], mid, end); in RecursiveLightPoint()
|
| /external/quake/quake/src/WinQuake/ |
| D | r_bsp.cpp | 161 int i, side, lastside; in R_RecursiveClipBPoly() local
201 side = 0; in R_RecursiveClipBPoly()
203 side = 1; in R_RecursiveClipBPoly()
205 if (side != lastside) in R_RecursiveClipBPoly()
240 ptedge->pnext = psideedges[side]; in R_RecursiveClipBPoly()
241 psideedges[side] = ptedge; in R_RecursiveClipBPoly()
247 if (side == 0) in R_RecursiveClipBPoly()
262 pedges->pnext = psideedges[side]; in R_RecursiveClipBPoly()
263 psideedges[side] = pedges; in R_RecursiveClipBPoly()
450 int i, c, side, *pindex; in R_RecursiveWorldNode() local
[all …]
|
| D | r_light.cpp | 145 int side; in RecursiveLightPoint() local
165 side = front < 0; in RecursiveLightPoint()
167 if ( (back < 0) == side) in RecursiveLightPoint()
168 return RecursiveLightPoint (node->children[side], start, end); in RecursiveLightPoint()
176 r = RecursiveLightPoint (node->children[side], start, mid); in RecursiveLightPoint()
180 if ( (back < 0) == side ) in RecursiveLightPoint()
235 return RecursiveLightPoint (node->children[!side], mid, end); in RecursiveLightPoint()
|
| D | view.cpp | 84 float side; in V_CalcRoll() local
88 side = DotProduct (velocity, right); in V_CalcRoll()
89 sign = side < 0 ? -1 : 1; in V_CalcRoll()
90 side = fabs(side); in V_CalcRoll()
96 if (side < cl_rollspeed.value) in V_CalcRoll()
97 side = side * value / cl_rollspeed.value; in V_CalcRoll()
99 side = value; in V_CalcRoll()
101 return side*sign; in V_CalcRoll()
323 float side; in V_ParseDamage() local
372 side = DotProduct (from, right); in V_ParseDamage()
[all …]
|
| D | gl_rlight.cpp | 274 int side; in RecursiveLightPoint() local
294 side = front < 0; in RecursiveLightPoint()
296 if ( (back < 0) == side) in RecursiveLightPoint()
297 return RecursiveLightPoint (node->children[side], start, end); in RecursiveLightPoint()
305 r = RecursiveLightPoint (node->children[side], start, mid); in RecursiveLightPoint()
309 if ( (back < 0) == side ) in RecursiveLightPoint()
366 return RecursiveLightPoint (node->children[!side], mid, end); in RecursiveLightPoint()
|
| /external/doclava/res/assets/templates/assets/ |
| D | doclava-developer-docs.css | 29 #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-nav li a+a {
[all …]
|
| /external/iptables/extensions/ |
| D | libxt_recent.c | 82 info->side = XT_RECENT_SOURCE; in recent_init()
115 info->side = XT_RECENT_SOURCE; in recent_parse()
118 info->side = XT_RECENT_DEST; in recent_parse()
153 if (info->side == XT_RECENT_SOURCE) in recent_print()
155 if (info->side == XT_RECENT_DEST) in recent_print()
179 if (info->side == XT_RECENT_SOURCE) in recent_save()
181 if (info->side == XT_RECENT_DEST) in recent_save()
|
| /external/jmonkeyengine/engine/src/tools/jme3tools/optimize/ |
| D | FastOctnode.java | 53 public void setSide(int side){ in setSide() argument
55 offset |= (side << 29); in setSide()
90 private static void findChildBound(BoundingBox bbox, int side){ in findChildBound() argument
92 bbox.getCenter().set(bbox.getCenter().x + extent * Octnode.extentMult[side].x, in findChildBound()
93 bbox.getCenter().y + extent * Octnode.extentMult[side].y, in findChildBound()
94 bbox.getCenter().z + extent * Octnode.extentMult[side].z); in findChildBound()
|
| D | Octnode.java | 76 private BoundingBox getChildBound(int side){ in getChildBound() argument
78 Vector3f center = new Vector3f(bbox.getCenter().x + extent * extentMult[side].x, in getChildBound()
79 bbox.getCenter().y + extent * extentMult[side].y, in getChildBound()
80 bbox.getCenter().z + extent * extentMult[side].z); in getChildBound()
197 public void generateFastOctnodeLinks(Octnode parent, Octnode nextSibling, int side){ in generateFastOctnodeLinks() argument
198 fastNode.setSide(side); in generateFastOctnodeLinks()
|
| /external/webkit/Source/WebCore/rendering/ |
| D | RenderBoxModelObject.cpp | 1051 static inline BorderEdgeFlag edgeFlagForSide(BoxSide side) in edgeFlagForSide() argument
1053 return static_cast<BorderEdgeFlag>(1 << side); in edgeFlagForSide()
1056 static inline bool includesEdge(BorderEdgeFlags flags, BoxSide side) in includesEdge() argument
1058 return flags & edgeFlagForSide(side); in includesEdge()
1128 static inline bool borderStyleHasUnmatchedColorsAtCorner(EBorderStyle style, BoxSide side, BoxSide … in borderStyleHasUnmatchedColorsAtCorner() argument
1135 BorderEdgeFlags flags = edgeFlagForSide(side) | edgeFlagForSide(adjacentSide); in borderStyleHasUnmatchedColorsAtCorner()
1141 static inline bool colorsMatchAtCorner(BoxSide side, BoxSide adjacentSide, const BorderEdge edges[]) in colorsMatchAtCorner() argument
1143 if (edges[side].shouldRender() != edges[adjacentSide].shouldRender()) in colorsMatchAtCorner()
1146 if (!edgesShareColor(edges[side], edges[adjacentSide])) in colorsMatchAtCorner()
1149 return !borderStyleHasUnmatchedColorsAtCorner(edges[side].style, side, adjacentSide); in colorsMatchAtCorner()
[all …]
|
| /external/eigen/Eigen/src/Core/products/ |
| D | SelfadjointMatrixMatrix_MKL.h | 57 char side='L', uplo='L'; \
89 …MKLPREFIX##symm(&side, &uplo, &m, &n, &alpha_, (const MKLTYPE*)a, &lda, (const MKLTYPE*)b, &ldb, &…
108 char side='L', uplo='L'; \
157 …MKLPREFIX##hemm(&side, &uplo, &m, &n, &alpha_, (const MKLTYPE*)a, &lda, (const MKLTYPE*)b, &ldb, &…
184 char side='R', uplo='L'; \
215 …MKLPREFIX##symm(&side, &uplo, &m, &n, &alpha_, (const MKLTYPE*)a, &lda, (const MKLTYPE*)b, &ldb, &…
234 char side='R', uplo='L'; \
282 …MKLPREFIX##hemm(&side, &uplo, &m, &n, &alpha_, (const MKLTYPE*)a, &lda, (const MKLTYPE*)b, &ldb, &…
|
| D | TriangularSolverMatrix_MKL.h | 57 char side = 'L', uplo, diag='N', transa; \
85 …MKLPREFIX##trsm(&side, &uplo, &transa, &diag, &m, &n, &alpha, (const MKLTYPE*)a, &lda, (MKLTYPE*)_…
112 char side = 'R', uplo, diag='N', transa; \
140 …MKLPREFIX##trsm(&side, &uplo, &transa, &diag, &m, &n, &alpha, (const MKLTYPE*)a, &lda, (MKLTYPE*)_…
|
| /external/freetype/src/base/ |
| D | ftstroke.c | 877 FT_Int side ) in ft_stroker_arcto() argument
882 FT_StrokeBorder border = stroker->borders + side; in ft_stroker_arcto()
885 rotate = FT_SIDE_TO_ROTATE( side ); in ft_stroker_arcto()
905 FT_Int side ) in ft_stroker_cap() argument
916 error = ft_stroker_arcto( stroker, side ); in ft_stroker_cap()
922 FT_Angle rotate = FT_SIDE_TO_ROTATE( side ); in ft_stroker_cap()
924 FT_StrokeBorder border = stroker->borders + side; in ft_stroker_cap()
949 FT_Angle rotate = FT_SIDE_TO_ROTATE( side ); in ft_stroker_cap()
951 FT_StrokeBorder border = stroker->borders + side; in ft_stroker_cap()
979 FT_Int side, in ft_stroker_inside() argument
[all …]
|
| /external/eigen/blas/ |
| D | level3_impl.h | 66 int EIGEN_BLAS_FUNC(trsm)(char *side, char *uplo, char *opa, char *diag, int *m, int *n, RealScalar… in EIGEN_BLAS_FUNC()
119 if(SIDE(*side)==INVALID) info = 1; in EIGEN_BLAS_FUNC()
125 else if(*lda<std::max(1,(SIDE(*side)==LEFT)?*m:*n)) info = 9; in EIGEN_BLAS_FUNC()
130 int code = OP(*opa) | (SIDE(*side) << 2) | (UPLO(*uplo) << 3) | (DIAG(*diag) << 4); in EIGEN_BLAS_FUNC()
132 if(SIDE(*side)==LEFT) in EIGEN_BLAS_FUNC()
152 int EIGEN_BLAS_FUNC(trmm)(char *side, char *uplo, char *opa, char *diag, int *m, int *n, RealScalar… in EIGEN_BLAS_FUNC()
203 if(SIDE(*side)==INVALID) info = 1; in EIGEN_BLAS_FUNC()
209 else if(*lda<std::max(1,(SIDE(*side)==LEFT)?*m:*n)) info = 9; in EIGEN_BLAS_FUNC()
214 int code = OP(*opa) | (SIDE(*side) << 2) | (UPLO(*uplo) << 3) | (DIAG(*diag) << 4); in EIGEN_BLAS_FUNC()
223 if(SIDE(*side)==LEFT) in EIGEN_BLAS_FUNC()
[all …]
|
| /external/quake/quake/src/QW/server/ |
| D | world.c | 71 int side; in SV_InitBoxHull() local
82 side = i&1; in SV_InitBoxHull()
84 box_clipnodes[i].children[side] = CONTENTS_EMPTY; in SV_InitBoxHull()
86 box_clipnodes[i].children[side^1] = i + 1; in SV_InitBoxHull()
88 box_clipnodes[i].children[side^1] = CONTENTS_SOLID; in SV_InitBoxHull()
541 int side; in SV_RecursiveHullCheck() local
606 side = (t1 < 0); in SV_RecursiveHullCheck()
609 if (!SV_RecursiveHullCheck (hull, node->children[side], p1f, midf, p1, mid, trace) ) in SV_RecursiveHullCheck()
613 if (SV_HullPointContents (sv_hullmodel, mid, node->children[side]) in SV_RecursiveHullCheck()
621 if (SV_HullPointContents (hull, node->children[side^1], mid) in SV_RecursiveHullCheck()
[all …]
|
| /external/eigen/doc/ |
| D | I11_Aliasing.dox | 37 <tt>mat.bottomRightCorner(2,2)</tt> on the left-hand side of the assignment and the block
38 <tt>mat.topLeftCorner(2,2)</tt> on the right-hand side. After the assignment, the (2,2) entry in th…
83 to evaluate the right-hand side fully into a temporary matrix/array and then assign it to the left-…
84 side. The function \link DenseBase::eval() eval() \endlink does precisely that.
131 …ed above, it may be dangerous if the same matrix or array occurs on both the left-hand side and the
132 right-hand side of an assignment operator, and it is then often necessary to evaluate the right-han…
148 In general, an assignment is safe if the (i,j) entry of the expression on the right-hand side depen…
149 the (i,j) entry of the matrix or array on the left-hand side and not on any other entries. In that …
150 not necessary to evaluate the right-hand side explicitly.
203 …curs when the same matrix or array coefficients appear both on the left- and the right-hand side of
|