/dports/lang/mono/mono-5.10.1.57/external/corefx/src/System.Collections.Immutable/src/System/Collections/Immutable/ |
H A D | ImmutableList_1.Node.cs | 291 Node newRight = _right.Add(key); in Add() 292 Node result = this.MutateRight(newRight); in Add() 319 Node newRight = _right.Insert(index - _left._count - 1, key); in Insert() 320 Node result = this.MutateRight(newRight); in Insert() 339 Node newRight = _right.AddRange(keys); in AddRange() 340 Node result = this.MutateRight(newRight); in AddRange() 369 result = this.MutateRight(newRight); in InsertRange() 412 var newRight = _right.RemoveAt(0); in RemoveAt() 423 var newRight = _right.RemoveAt(index - _left._count - 1); in RemoveAt() 424 result = this.MutateRight(newRight); in RemoveAt() [all …]
|
H A D | SortedInt32KeyNode.cs | 411 …var newRight = _right.SetOrAdd(key, value, valueComparer, overwriteExistingValue, out replacedExis… in SetOrAdd() 414 result = this.Mutate(right: newRight); in SetOrAdd() 495 var newRight = _right.Remove(successor._key, out dummyMutated); in RemoveRecursive() 496 result = successor.Mutate(left: _left, right: newRight); in RemoveRecursive() 509 var newRight = _right.Remove(key, out mutated); in RemoveRecursive() 512 result = this.Mutate(right: newRight); in RemoveRecursive()
|
H A D | ImmutableSortedSet_1.Node.cs | 382 var newRight = _right.Add(key, comparer, out mutated); in Add() 385 result = this.Mutate(right: newRight); in Add() 457 … var newRight = _right.Remove(successor._key, comparer, out dummyMutated); in Remove() 458 result = successor.Mutate(left: _left, right: newRight); in Remove() 471 var newRight = _right.Remove(key, comparer, out mutated); in Remove() 474 result = this.Mutate(right: newRight); in Remove()
|
H A D | ImmutableSortedDictionary_2.Node.cs | 702 …var newRight = _right.SetOrAdd(key, value, keyComparer, valueComparer, overwriteExistingValue, out… in SetOrAdd() 705 result = this.Mutate(right: newRight); in SetOrAdd() 789 … var newRight = _right.Remove(successor._key, keyComparer, out dummyMutated); in RemoveRecursive() 790 result = successor.Mutate(left: _left, right: newRight); in RemoveRecursive() 803 var newRight = _right.Remove(key, keyComparer, out mutated); in RemoveRecursive() 806 result = this.Mutate(right: newRight); in RemoveRecursive()
|
/dports/www/sogo2/SOGo-2.4.1/UI/Common/ |
H A D | UIxUserRightsEditor.h | 45 - (void) appendRight: (NSString *) newRight; 46 - (void) appendExclusiveRight: (NSString *) newRight
|
H A D | UIxUserRightsEditor.m | 220 - (void) appendRight: (NSString *) newRight 222 if (![userRights containsObject: newRight]) 223 [userRights addObject: newRight]; 232 - (void) appendExclusiveRight: (NSString *) newRight 236 [self appendRight: newRight];
|
/dports/www/sogo/SOGo-5.4.0/UI/Common/ |
H A D | UIxUserRightsEditor.h | 43 - (void) appendRight: (NSString *) newRight; 44 - (void) appendExclusiveRight: (NSString *) newRight
|
H A D | UIxUserRightsEditor.m | 293 - (void) appendRight: (NSString *) newRight 295 if (![userRights containsObject: newRight]) 296 [userRights addObject: newRight]; 305 - (void) appendExclusiveRight: (NSString *) newRight 309 [self appendRight: newRight];
|
/dports/www/sogo-activesync/SOGo-5.4.0/UI/Common/ |
H A D | UIxUserRightsEditor.h | 43 - (void) appendRight: (NSString *) newRight; 44 - (void) appendExclusiveRight: (NSString *) newRight
|
H A D | UIxUserRightsEditor.m | 293 - (void) appendRight: (NSString *) newRight 295 if (![userRights containsObject: newRight]) 296 [userRights addObject: newRight]; 305 - (void) appendExclusiveRight: (NSString *) newRight 309 [self appendRight: newRight];
|
/dports/math/vampire/vampire-4.5.1/Kernel/ |
H A D | FormulaTransformer.cpp | 208 Formula* newRight = apply(f->right()); in applyBinary() local 209 if(newLeft==f->left() && newRight==f->right()) { in applyBinary() 212 return new BinaryFormula(f->connective(), newLeft, newRight); in applyBinary() 310 Formula* newRight = apply(f->right()); in applyImp() local 311 if(newLeft==f->left() && newRight==f->right()) { in applyImp() 314 return new BinaryFormula(f->connective(), newLeft, newRight); in applyImp()
|
/dports/www/orangehrm/orangehrm-4.9/symfony/lib/vendor/lexpress/doctrine1/lib/Doctrine/Node/ |
H A D | NestedSet.php | 365 $newRight = $dest->getNode()->getRightValue() + 2; 384 … $q->where("$componentName.lft >= ? AND $componentName.rgt <= ?", array($newLeft, $newRight)); 389 $this->insertNode($newLeft, $newRight, $newRoot); 423 $newRight = $dest->getNode()->getLeftValue() + 1; 432 $this->insertNode($newLeft, $newRight, $newRoot); 469 $newRight = $dest->getNode()->getRightValue() + 2; 478 $this->insertNode($newLeft, $newRight, $newRoot); 514 $newRight = $dest->getNode()->getLeftValue() + 2; 523 $this->insertNode($newLeft, $newRight, $newRoot); 560 $newRight = $dest->getNode()->getRightValue() + 1; [all …]
|
/dports/devel/spark/spark-2.1.1/sql/catalyst/src/main/scala/org/apache/spark/sql/catalyst/optimizer/ |
H A D | Optimizer.scala | 211 createAttributeMapping(right, newRight)) 215 Join(newLeft, newRight, joinType, newCondition) 948 val newRight = rightFilterConditions. constant 963 val newRight = rightFilterConditions. constant 974 val newRight = right constant 995 val newRight = rightJoinConditions. constant 999 Join(newLeft, newRight, joinType, newJoinCond) 1004 val newRight = right constant 1007 Join(newLeft, newRight, RightOuter, newJoinCond) 1011 val newRight = rightJoinConditions. constant [all …]
|
/dports/multimedia/kodi/xbmc-19.3-Matrix/xbmc/windowing/ |
H A D | GraphicContext.cpp | 191 int newRight = (int)(maxX + 0.5f); in SetViewPort() local 201 if (newLeft >= oldRight || newTop >= oldBottom || newRight <= oldLeft || newBottom <= oldTop) in SetViewPort() 208 if (newRight > oldRight) newRight = oldRight; in SetViewPort() 212 if (newRight <= 0 || newBottom <= 0 || in SetViewPort() 214 newLeft >= newRight || newTop >= newBottom) in SetViewPort() 221 if (newRight > m_iScreenWidth) newRight = m_iScreenWidth; in SetViewPort() 224 assert(newLeft < newRight); in SetViewPort() 227 CRect newviewport((float)newLeft, (float)newTop, (float)newRight, (float)newBottom); in SetViewPort()
|
/dports/graphics/hugin/hugin-2020.0.0/src/hugin1/hugin/ |
H A D | MaskImageCtrl.cpp | 296 int newLeft, newRight, newTop, newBottom; in UpdateCrop() local 308 newRight=hugin_utils::roundi(m_cropCenter.x+newHalfWidth); in UpdateCrop() 313 newRight=m_cropRect.right(); in UpdateCrop() 329 newRight=m_cropRect.right()+delta.x; in UpdateCrop() 348 newRight=m_cropRect.right(); in UpdateCrop() 364 newRight=m_cropRect.right(); in UpdateCrop() 371 newRight=m_dragStartPos.x+radius; in UpdateCrop() 385 if(newLeft>newRight) in UpdateCrop() 388 newLeft=newRight; in UpdateCrop() 389 newRight=temp; in UpdateCrop() [all …]
|
/dports/games/scummvm/scummvm-2.5.1/engines/gob/ |
H A D | mult_v2.cpp | 857 animObj.newRight = 0; in animate() 871 animObj.newRight = _vm->_scenery->_toRedrawRight; in animate() 878 animObj.newRight = in animate() 886 (animObj.newRight == animObj.lastRight) && in animate() 904 animObj.newRight = _vm->_scenery->_toRedrawRight; in animate() 909 animObj.newRight = animObj.lastRight; in animate() 917 animObj.newRight = animObj.lastRight; in animate() 941 int right = animObj.newRight - maxleft + 1; in animate() 1007 if ((animObj1.newRight >= animObj2.newLeft) && in animate() 1008 (animObj2.newRight >= animObj1.newLeft) && in animate() [all …]
|
/dports/games/libretro-scummvm/scummvm-7b1e929/engines/gob/ |
H A D | mult_v2.cpp | 854 animObj.newRight = 0; in animate() 868 animObj.newRight = _vm->_scenery->_toRedrawRight; in animate() 875 animObj.newRight = in animate() 883 (animObj.newRight == animObj.lastRight) && in animate() 901 animObj.newRight = _vm->_scenery->_toRedrawRight; in animate() 906 animObj.newRight = animObj.lastRight; in animate() 914 animObj.newRight = animObj.lastRight; in animate() 938 int right = animObj.newRight - maxleft + 1; in animate() 1004 if ((animObj1.newRight >= animObj2.newLeft) && in animate() 1005 (animObj2.newRight >= animObj1.newLeft) && in animate() [all …]
|
/dports/games/libretro-scummvm/scummvm-7b1e929/engines/wintermute/math/ |
H A D | rect32.h | 108 void setRect(int32 newLeft, int32 newTop, int32 newRight, int32 newBottom) { in setRect() 111 this->right = newRight; in setRect()
|
/dports/games/scummvm/scummvm-2.5.1/engines/wintermute/math/ |
H A D | rect32.h | 108 void setRect(int32 newLeft, int32 newTop, int32 newRight, int32 newBottom) { in setRect() 111 this->right = newRight; in setRect()
|
/dports/lang/mono/mono-5.10.1.57/mcs/class/referencesource/System.Data.Entity/System/Data/Common/CommandTrees/ |
H A D | DefaultExpressionVisitor.cs | 284 DbExpression newRight = this.VisitExpression(expression.Right); in VisitBinary() 286 !object.ReferenceEquals(expression.Right, newRight)) in VisitBinary() 288 result = callback(newLeft, newRight); in VisitBinary() 898 DbExpressionBinding newRight = this.VisitExpressionBinding(expression.Right); in Visit() 900 this.EnterScope(newLeft.Variable, newRight.Variable); in Visit() 905 !object.ReferenceEquals(expression.Right, newRight) || in Visit() 910 result = CqtBuilder.InnerJoin(newLeft, newRight, newCondition); in Visit() 914 result = CqtBuilder.LeftOuterJoin(newLeft, newRight, newCondition); in Visit() 919 result = CqtBuilder.FullOuterJoin(newLeft, newRight, newCondition); in Visit()
|
/dports/games/doomsday/doomsday-2.3.1/doomsday/apps/client/include/world/bsp/ |
H A D | linesegment.h | 277 inline void setRight(Side *newRight) { setNeighbor(Right, newRight); } in setRight() argument
|
/dports/math/cvc4/CVC4-1.7/src/theory/bv/ |
H A D | theory_bv_rewrite_rules_normalization.h | 758 Node newLeft, newRight; in apply() local 803 newRight = utils::mkConst(size, (unsigned)0); in apply() 807 newRight = utils::mkNaryNode(kind::BITVECTOR_PLUS, childrenRight); in apply() 813 if (newLeft == newRight) in apply() 819 if (newLeft < newRight) in apply() 821 Assert((newRight == left && newLeft == right) in apply() 822 || Rewriter::rewrite(newRight) != left in apply() 824 return newRight.eqNode(newLeft); in apply() 827 Assert((newLeft == left && newRight == right) in apply() 829 || Rewriter::rewrite(newRight) != right); in apply() [all …]
|
/dports/math/cvc4/CVC4-1.7/src/theory/arith/ |
H A D | normal_form.cpp | 1124 Polynomial newRight = (p - minimalVList) * coeffInv; in mkRatEquality() local 1127 return toNode(kind::EQUAL, newLeft, newRight); in mkRatEquality() 1144 Constant newRight = right * (coeffInv); in mkRatInequality() local 1146 return toNode(k, newLeft, newRight); in mkRatInequality() 1192 Constant newRight = Constant::mkConstant(rightMult); in mkIntInequality() local 1193 result = toNode(kind::GEQ, newLeft, newRight); in mkIntInequality() 1234 Polynomial newRight = mIsPositive ? -noM : noM; in mkIntEquality() local 1237 Assert(newRight.isIntegral()); in mkIntEquality() 1238 return toNode(kind::EQUAL, newLeft, newRight); in mkIntEquality()
|
/dports/editors/lazarus/lazarus/components/tachart/ |
H A D | tasources.pas | 1035 i, oldLeft, oldRight, newLeft, newRight: Integer; 1042 RangeAround(AIndex, newLeft, newRight); 1045 (Abs(oldRight - newRight) > 1) 1048 for i := newLeft to newRight do 1059 for i := oldRight downto newRight + 1 do 1062 for i := oldRight downto newRight + 1 do 1066 for i := oldRight + 1 to newRight do 1075 FItem.MultiplyY(1 / (newRight - newLeft + 1));
|
/dports/editors/lazarus-qt5/lazarus/components/tachart/ |
H A D | tasources.pas | 1035 i, oldLeft, oldRight, newLeft, newRight: Integer; 1042 RangeAround(AIndex, newLeft, newRight); 1045 (Abs(oldRight - newRight) > 1) 1048 for i := newLeft to newRight do 1059 for i := oldRight downto newRight + 1 do 1062 for i := oldRight downto newRight + 1 do 1066 for i := oldRight + 1 to newRight do 1075 FItem.MultiplyY(1 / (newRight - newLeft + 1));
|