/haiku/src/libs/linprog/ |
H A D | LinearSpec.cpp | 43 SolverInterface::AddConstraint(Constraint* constraint, bool notifyListener) argument 45 return fLinearSpec->AddConstraint(constraint, notifyListener); 50 SolverInterface::RemoveConstraint(Constraint* constraint, bool deleteConstraint, argument 53 return fLinearSpec->RemoveConstraint(constraint, deleteConstraint, 76 SpecificationListener::ConstraintAdded(Constraint* constraint) argument 82 SpecificationListener::ConstraintRemoved(Constraint* constraint) argument 197 Constraint* constraint = constraints.ItemAt(i); local 199 SummandList* summands = constraint->LeftSide(); 203 markedForInvalidation.AddItem(constraint); 245 LinearSpec::AddConstraint(Constraint* constraint) argument 252 RemoveConstraint(Constraint* constraint, bool deleteConstraint) argument 259 AddConstraint(Constraint* constraint, bool notifyListener) argument 288 RemoveConstraint(Constraint* constraint, bool deleteConstraint, bool notifyListener) argument 333 UpdateLeftSide(Constraint* constraint, const SummandList* oldSummands) argument 358 UpdateRightSide(Constraint* constraint) argument 367 UpdateOperator(Constraint* constraint) argument 376 UpdatePenalties(Constraint* constraint) argument 561 Constraint* constraint = new(std::nothrow) Constraint(this, leftSide, local [all...] |
H A D | ActiveSetSolver.h | 68 bool ConstraintAdded(Constraint* constraint); 69 bool ConstraintRemoved(Constraint* constraint); 70 bool LeftSideChanged(Constraint* constraint); 71 bool RightSideChanged(Constraint* constraint); 72 bool OperatorChanged(Constraint* constraint); 73 bool PenaltiesChanged(Constraint* constraint);
|
H A D | LayoutOptimizer.h | 24 bool is_soft(Constraint* constraint); 41 double _ActualValue(Constraint* constraint, 43 double _RightSide(Constraint* constraint);
|
H A D | ActiveSetSolver.cpp | 393 static bool is_soft_inequality(Constraint* constraint) argument 395 if (constraint->PenaltyNeg() <= 0. && constraint->PenaltyPos() <= 0.) 397 if (constraint->Op() != kEQ) 410 Constraint* constraint = allConstraints.ItemAt(c); local 411 if (!is_soft_inequality(constraint)) 418 kEQ, 0, constraint->PenaltyNeg(), constraint->PenaltyPos()); 422 if (constraint->Op() == kGE) 425 Constraint* modifiedConstraint = new Constraint(constraint); 480 Constraint* constraint = allConstraints.ItemAt(c); local 587 ConstraintAdded(Constraint* constraint) argument 594 ConstraintRemoved(Constraint* constraint) argument 601 LeftSideChanged(Constraint* constraint) argument 608 RightSideChanged(Constraint* constraint) argument 615 OperatorChanged(Constraint* constraint) argument 622 PenaltiesChanged(Constraint* constraint) argument 667 Constraint* constraint = allConstraints.ItemAt(i); local 682 Constraint* constraint = list.ItemAt(i); local [all...] |
H A D | LayoutOptimizer.cpp | 33 bool is_soft(Constraint* constraint) argument 35 if (constraint->Op() != LinearProgramming::kEQ) 37 if (constraint->PenaltyNeg() > 0. || constraint->PenaltyPos() > 0.) 62 constraint that, by keeping it in the active set, prevents us most from 65 constraint from the active set and try again. 69 most-violated constraint to the active set and adjust the new solution such 70 that barely satisfies that constraint. Otherwise, we don't adjust the 510 // set up soft constraint matrix 512 Constraint* constraint local 566 _ActualValue(Constraint* constraint, double* values) const argument 582 _RightSide(Constraint* constraint) argument 685 Constraint* constraint = fConstraints->ItemAt(i); local 730 Constraint* constraint = activeConstraints.ItemAt(i); local 805 Constraint* constraint = activeConstraints.ItemAt(i); local 831 Constraint* constraint = fConstraints->ItemAt(i); local [all...] |
H A D | Constraint.cpp | 40 Constraint::Constraint(Constraint* constraint) argument 44 fOp(constraint->Op()), 45 fRightSide(constraint->RightSide()), 46 fPenaltyNeg(constraint->PenaltyNeg()), 47 fPenaltyPos(constraint->PenaltyPos()), 48 fLabel(constraint->Label()) 50 SummandList* orgSummands = constraint->LeftSide(); 59 * Gets the index of the constraint. 61 * @return the index of the constraint 77 * Gets the left side of the constraint [all...] |
/haiku/src/kits/interface/layouter/ |
H A D | ComplexLayouter.cpp | 189 Constraint* constraint = fConstraints[i]; local 191 while (constraint != NULL) { 192 Constraint* next = constraint->next; 193 delete constraint; 194 constraint = next; 242 // previous constraint exists -- use stricter values 245 // no previous constraint -- create new one 246 Constraint* constraint = new(nothrow) Constraint(element, end, min, local 248 if (!constraint) 250 constraint 374 Constraint* constraint = fConstraints[i]; local 474 Constraint* constraint = fConstraints[i]; local 537 Constraint* constraint = fConstraints[i]; local 605 Constraint* constraint = fConstraints[i]; local 630 Constraint* constraint = fConstraints[i]; local 643 Constraint* constraint = fConstraints[i]; local 804 Constraint* constraint = fConstraints[i]; local 855 Constraint* constraint = fConstraints[i]; local [all...] |
H A D | LayoutOptimizer.cpp | 48 constraint that, by keeping it in the active set, prevents us most from 51 constraint from the active set and try again. 55 most-violated constraint to the active set and adjust the new solution such 56 that barely satisfies that constraint. Otherwise, we don't adjust the 555 Constraint* constraint = (Constraint*)fConstraints.ItemAt(i); 557 delete constraint; 588 /*! Adds a constraint of the form 591 If \a equality is \c true, the constraint is an equality constraint. 597 Constraint* constraint local 620 Constraint* constraint = (Constraint*)other->fConstraints.ItemAt(i); local 637 Constraint* constraint = (Constraint*)fConstraints.ItemAt(i); local 675 Constraint* constraint = (Constraint*)fConstraints.RemoveItem( local 720 Constraint* constraint = (Constraint*)fConstraints.ItemAt(i); local 763 Constraint* constraint = (Constraint*)activeConstraints.ItemAt(i); local 831 Constraint* constraint local 859 Constraint* constraint = (Constraint*)fConstraints.ItemAt(i); local [all...] |
H A D | CollapsingLayouter.cpp | 142 Constraint* constraint = new Constraint(); 143 constraint->length = length; 144 constraint->min = min; 145 constraint->max = max; 146 constraint->preferred = preferred; 160 fElements[element].constraints.AddItem(constraint); 167 _AddConstraints(element, constraint);
|
/haiku/headers/libs/linprog/ |
H A D | LinearSpec.h | 45 virtual bool ConstraintAdded(Constraint* constraint) = 0; 46 virtual bool ConstraintRemoved(Constraint* constraint) = 0; 47 virtual bool LeftSideChanged(Constraint* constraint) = 0; 48 virtual bool RightSideChanged(Constraint* constraint) = 0; 49 virtual bool OperatorChanged(Constraint* constraint) = 0; 50 virtual bool PenaltiesChanged(Constraint* constraint) = 0; 62 bool AddConstraint(Constraint* constraint, 64 bool RemoveConstraint(Constraint* constraint, 77 virtual void ConstraintAdded(Constraint* constraint); 78 virtual void ConstraintRemoved(Constraint* constraint); [all...] |
H A D | Constraint.h | 23 * Hard linear constraint, i.e. one that must be satisfied. 29 /*! Creates a soft copy of the constraint which is not connected 32 Constraint(Constraint* constraint);
|
/haiku/src/libs/alm/ |
H A D | SharedSolver.cpp | 221 for each constraint in the linear spec: 264 Constraint* constraint = constraints.ItemAt(i); local 265 if (autoConstraints.find(constraint) == autoConstraints.end()) 266 err = _AddConstraintToArchive(constraint, archive); 312 SharedSolver::_AddConstraintToArchive(Constraint* constraint, argument 329 SummandList* leftSide = constraint->LeftSide(); 348 int32 op = constraint->Op(); 351 double rightSide = constraint->RightSide(); 353 double penaltyNeg = constraint->PenaltyNeg(); 355 double penaltyPos = constraint [all...] |
H A D | ALMLayout.cpp | 196 void ConstraintRemoved(Constraint* constraint) argument 198 fLayout->fConstraints.RemoveItem(constraint); 496 BALMLayout::AddConstraint(Constraint* constraint) argument 498 fConstraints.AddItem(constraint); 499 return Solver()->AddConstraint(constraint); 504 BALMLayout::RemoveConstraint(Constraint* constraint, argument 507 if (!fConstraints.RemoveItem(constraint)) 509 return Solver()->RemoveConstraint(constraint, deleteConstraint); 517 Constraint* constraint = Solver()->AddConstraint(coeff1, var1, op, local 519 fConstraints.AddItem(constraint); 529 Constraint* constraint = Solver()->AddConstraint(coeff1, var1, coeff2, var2, local 540 Constraint* constraint = Solver()->AddConstraint(coeff1, var1, coeff2, var2, local 553 Constraint* constraint = Solver()->AddConstraint(coeff1, var1, coeff2, var2, local [all...] |
H A D | SharedSolver.h | 74 static status_t _AddConstraintToArchive(Constraint* constraint,
|
/haiku/src/system/libroot/posix/glibc/regex/ |
H A D | regex_internal.h | 306 unsigned int constraint : 10; /* context constraint */ member in struct:__anon5497 482 #define NOT_SATISFY_PREV_CONSTRAINT(constraint,context) \ 483 ((((constraint) & PREV_WORD_CONSTRAINT) && !IS_WORD_CONTEXT (context)) \ 484 || ((constraint & PREV_NOTWORD_CONSTRAINT) && IS_WORD_CONTEXT (context)) \ 485 || ((constraint & PREV_NEWLINE_CONSTRAINT) && !IS_NEWLINE_CONTEXT (context))\ 486 || ((constraint & PREV_BEGBUF_CONSTRAINT) && !IS_BEGBUF_CONTEXT (context))) 488 #define NOT_SATISFY_NEXT_CONSTRAINT(constraint,context) \ 489 ((((constraint) & NEXT_WORD_CONSTRAINT) && !IS_WORD_CONTEXT (context)) \ 490 || (((constraint) [all...] |
H A D | regcomp.c | 50 static int duplicate_node (re_dfa_t *dfa, int org_idx, unsigned int constraint); 52 unsigned int constraint); 1352 dfa->nodes[node->node_idx].constraint = node->token.opr.ctx_type; 1438 Note that duplicated nodes have constraint INIT_CONSTRAINT in addition 1439 to their own constraint. */ 1447 unsigned int constraint = init_constraint; 1454 also have the constraint. Then duplicate the epsilon closure 1459 clone_dest = duplicate_node (dfa, org_dest, constraint); 1490 /* In case of the node has another constraint, add it. */ 1491 constraint | 1440 unsigned int constraint = init_constraint; local 1542 search_duplicated_node(const re_dfa_t *dfa, int org_node, unsigned int constraint) argument 1560 duplicate_node(re_dfa_t *dfa, int org_idx, unsigned int constraint) argument [all...] |
H A D | regex_internal.c | 1432 dfa->nodes[dfa->nodes_len].constraint = 0; 1621 if (type == CHARACTER && !node->constraint) 1632 else if (type == ANCHOR || node->constraint) 1673 unsigned int constraint = node->constraint; 1675 if (type == CHARACTER && !constraint) 1687 if (constraint) 1702 if (NOT_SATISFY_PREV_CONSTRAINT (constraint,context)) 1670 unsigned int constraint = node->constraint; local
|
H A D | regexec.c | 1211 unsigned int constraint = dfa->nodes[node].constraint; 1214 if (!constraint) 1216 if (NOT_SATISFY_NEXT_CONSTRAINT (constraint, context)) 2510 if (dfa->nodes[cur_node_idx].constraint) 2515 if (NOT_SATISFY_NEXT_CONSTRAINT (dfa->nodes[cur_node_idx].constraint, 2582 if (node->constraint) 2586 if (NOT_SATISFY_NEXT_CONSTRAINT (node->constraint, context)) 3408 /* If the new state has context constraint, 3547 unsigned int constraint 1208 unsigned int constraint = dfa->nodes[node].constraint; local 3543 unsigned int constraint = node->constraint; local [all...] |
/haiku/headers/libs/alm/ |
H A D | ALMLayout.h | 70 bool AddConstraint(Constraint* constraint); 71 bool RemoveConstraint(Constraint* constraint,
|