circular FIFO queue
◆ SCIPqueueCreate()creates a (circular) queue, best used if the size will be fixed or will not be increased that much
Definition at line 996 of file misc.c.
References BMSallocMemory, MAX, NULL, queueResize(), SCIP_ALLOC, SCIP_CALL, and SCIP_OKAY.
Referenced by createReopttree(), SCIPexpriterInit(), and SCIPincludeConshdlrNonlinear().
◆ SCIPqueueFree() ◆ SCIPqueueClear() ◆ SCIPqueueInsert()inserts pointer element at the end of the queue
Definition at line 1082 of file misc.c.
References SCIP_Queue::firstfree, SCIP_Queue::firstused, NULL, SCIP_QUEUEELEMENT::ptr, queueCheckMarker(), queueCheckSize(), SCIP_CALL, SCIP_OKAY, SCIP_Queue::size, and SCIP_Queue::slots.
Referenced by doBfsNext(), SCIPexpriterInit(), and SCIPtightenExprIntervalNonlinear().
◆ SCIPqueueInsertUInt()inserts unsigned integer element at the end of the queue
Definition at line 1108 of file misc.c.
References SCIP_Queue::firstfree, SCIP_Queue::firstused, NULL, queueCheckMarker(), queueCheckSize(), SCIP_CALL, SCIP_OKAY, SCIP_Queue::size, SCIP_Queue::slots, and SCIP_QUEUEELEMENT::uinteger.
Referenced by clearReoptnodes(), createReopttree(), deleteChildrenBelow(), dryBranch(), reopttreeCheckMemory(), SCIPreoptDeleteNode(), and shrinkNode().
◆ SCIPqueueRemove() ◆ SCIPqueueRemoveUInt() unsigned int SCIPqueueRemoveUInt ( SCIP_QUEUE * queue ) ◆ SCIPqueueFirst() ◆ SCIPqueueFirstUInt() unsigned int SCIPqueueFirstUInt ( SCIP_QUEUE * queue ) ◆ SCIPqueueIsEmpty() ◆ SCIPqueueNElems()RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4