HomeSort by relevance Sort by last modified time
    Searched defs:IsLeaf (Results 1 - 8 of 8) sorted by null

  /packages/apps/OMA-DM/engine/dmlib/api/native/
dmtEventData.hpp 84 inline BOOLEAN IsLeaf() const { return m_bIsLeaf; }
  /external/clang/lib/Rewrite/Core/
RewriteRope.cpp 87 /// IsLeaf - True if this is an instance of RopePieceBTreeLeaf, false if it
89 bool IsLeaf;
91 RopePieceBTreeNode(bool isLeaf) : Size(0), IsLeaf(isLeaf) {}
95 bool isLeaf() const { return IsLeaf; }
223 return N->isLeaf();
459 return !N->isLeaf();
DeltaTree.cpp 77 /// IsLeaf - This is true if this is a leaf of the btree. If false, this is
79 bool IsLeaf;
85 DeltaTreeNode(bool isLeaf = true)
86 : NumValuesUsed(0), IsLeaf(isLeaf), FullDelta(0) {}
88 bool isLeaf() const { return IsLeaf; }
120 /// DeltaTreeInteriorNode - When isLeaf = false, a node has child pointers.
150 static inline bool classof(const DeltaTreeNode *N) { return !N->isLeaf(); }
157 if (isLeaf())
    [all...]
  /packages/apps/OMA-DM/engine/dmlib/dmengine/dm_ua/src/
dmMetaDataNode.cc 219 BOOLEAN DMMetaDataNode::IsLeaf()
dmMetaDataManager.cc     [all...]
  /packages/apps/OMA-DM/engine/dmlib/dmtapi/native/src/
dmtNode.cc 246 BOOLEAN DmtNodeImpl::IsLeaf() const
  /packages/apps/OMA-DM/engine/dmlib/plugin/src/
dmtPlugin.cc 488 BOOLEAN isleaf)
498 if (isleaf) // derived class needs to override this for special formats (INT, BINARY, etc)
617 BOOLEAN DmtPluginNode::IsLeaf() const
  /cts/suite/cts/deviceTests/browserbench/assets/octane/
box2d.js 79 b.upperBound.x+m;f.aabb.upperBound.y=b.upperBound.y+r;f.userData=e;this.InsertLeaf(f);return f};u.prototype.DestroyProxy=function(b){this.RemoveLeaf(b);this.FreeNode(b)};u.prototype.MoveProxy=function(b,e,f){y.b2Assert(b.IsLeaf());if(b.aabb.Contains(e))return false;this.RemoveLeaf(b);var m=y.b2_aabbExtension+y.b2_aabbMultiplier*(f.x>0?f.x:-f.x);f=y.b2_aabbExtension+y.b2_aabbMultiplier*(f.y>0?f.y:-f.y);b.aabb.lowerBound.x=e.lowerBound.x-m;b.aabb.lowerBound.y=e.lowerBound.y-f;b.aabb.upperBound.x=e.upperBound.x+
80 m;b.aabb.upperBound.y=e.upperBound.y+f;this.InsertLeaf(b);return true};u.prototype.Rebalance=function(b){if(b===undefined)b=0;if(this.m_root!=null)for(var e=0;e<b;e++){for(var f=this.m_root,m=0;f.IsLeaf()==false;){f=this.m_path>>m&1?f.child2:f.child1;m=m+1&31}++this.m_path;this.RemoveLeaf(f);this.InsertLeaf(f)}};u.prototype.GetFatAABB=function(b){return b.aabb};u.prototype.GetUserData=function(b){return b.userData};u.prototype.Query=function(b,e){if(this.m_root!=null){var f=new Vector,m=0;for(f[m++]=
81 this.m_root;m>0;){var r=f[--m];if(r.aabb.TestOverlap(e))if(r.IsLeaf()){if(!b(r))break}else{f[m++]=r.child1;f[m++]=r.child2}}}};u.prototype.RayCast=function(b,e){if(this.m_root!=null){var f=e.p1,m=e.p2,r=w.SubtractVV(f,m);r.Normalize();r=w.CrossFV(1,r);var s=w.AbsV(r),v=e.maxFraction,t=new B,x=0,C=0;x=f.x+v*(m.x-f.x);C=f.y+v*(m.y-f.y);t.lowerBound.x=Math.min(f.x,x);t.lowerBound.y=Math.min(f.y,C);t.upperBound.x=Math.max(f.x,x);t.upperBound.y=Math.max(f.y,C);var J=new Vector,T=0;for(J[T++]=this.m_root;T>
82 0;){v=J[--T];if(v.aabb.TestOverlap(t)!=false){x=v.aabb.GetCenter();C=v.aabb.GetExtents();if(!(Math.abs(r.x*(f.x-x.x)+r.y*(f.y-x.y))-s.x*C.x-s.y*C.y>0))if(v.IsLeaf()){x=new S;x.p1=e.p1;x.p2=e.p2;x.maxFraction=e.maxFraction;v=b(x,v);if(v==0)break;if(v>0){x=f.x+v*(m.x-f.x);C=f.y+v*(m.y-f.y);t.lowerBound.x=Math.min(f.x,x);t.lowerBound.y=Math.min(f.y,C);t.upperBound.x=Math.max(f.x,x);t.upperBound.y=Math.max(f.y,C)}}else{J[T++]=v.child1;J[T++]=v.child2}}}}};u.prototype.AllocateNode=function(){if(this.m_freeList){var b=
83 this.m_freeList;this.m_freeList=b.parent;b.parent=null;b.child1=null;b.child2=null;return b}return new H};u.prototype.FreeNode=function(b){b.parent=this.m_freeList;this.m_freeList=b};u.prototype.InsertLeaf=function(b){++this.m_insertionCount;if(this.m_root==null){this.m_root=b;this.m_root.parent=null}else{var e=b.aabb.GetCenter(),f=this.m_root;if(f.IsLeaf()==false){do{var m=f.child1;f=f.child2;f=Math.abs((m.aabb.lowerBound.x+m.aabb.upperBound.x)/2-e.x)+Math.abs((m.aabb.lowerBound.y+m.aabb.upperBound.y)/
84 2-e.y)<Math.abs((f.aabb.lowerBound.x+f.aabb.upperBound.x)/2-e.x)+Math.abs((f.aabb.lowerBound.y+f.aabb.upperBound.y)/2-e.y)?m:f}while(f.IsLeaf()==false)}e=f.parent;m=this.AllocateNode();m.parent=e;m.userData=null;m.aabb.Combine(b.aabb,f.aabb (…)
    [all...]

Completed in 145 milliseconds