Home
last modified time | relevance | path

Searched refs:totalCost (Results 1 – 25 of 438) sorted by relevance

12345678910>>...18

/dports/converters/wkhtmltopdf/qt-5db36ec/tests/auto/qcache/
H A Dtst_qcache.cpp63 void totalCost();
153 QCOMPARE(cache.totalCost(), 2); in setMaxCost()
157 QCOMPARE(cache.totalCost(), 2); in setMaxCost()
161 QCOMPARE(cache.totalCost(), 2); in setMaxCost()
165 QCOMPARE(cache.totalCost(), 2); in setMaxCost()
169 QCOMPARE(cache.totalCost(), 1); in setMaxCost()
173 QCOMPARE(cache.totalCost(), 0); in setMaxCost()
177 QCOMPARE(cache.totalCost(), 0); in setMaxCost()
181 void tst_QCache::totalCost() in totalCost() function in tst_QCache
184 QCOMPARE(cache.totalCost(), 0); in totalCost()
[all …]
/dports/editors/calligraplan/calligraplan-3.3.0/src/libs/kernel/tests/
H A DAccountsTester.cpp118 QCOMPARE(ec.totalCost(), 800.0); in defaultAccount()
123 QCOMPARE(ec.totalCost(), 0.0); in defaultAccount()
128 QCOMPARE(ec.totalCost(), 800.0); in defaultAccount()
133 QCOMPARE(ec.totalCost(), 0.0); in defaultAccount()
141 QCOMPARE(ec.totalCost(), 0.0); in defaultAccount()
219 QCOMPARE(ec.totalCost(), 0.0); in startupDefault()
233 QCOMPARE(ec.totalCost(), 0.0); in startupDefault()
269 QCOMPARE(ec.totalCost(), 0.0); in startupAccount()
274 QCOMPARE(ec.totalCost(), 0.0); in startupAccount()
288 QCOMPARE(ec.totalCost(), 0.0); in startupAccount()
[all …]
/dports/games/spring/spring_98.0/AI/Skirmish/KAIK/
H A DMicroPather.h124 totalCost = _costFromStart; in Init()
151 float totalCost; // could be a function, but save some math. variable
183 assert(totalCost == FLT_BIG); in CheckList()
186 assert(it -> prev == this || it -> totalCost >= it -> prev -> totalCost); in CheckList()
187 assert(it -> totalCost <= it -> next -> totalCost); in CheckList()
237 int Solve(void* startState, void* endState, std::vector<void*>* path, float* totalCost);
H A DMicroPather.cpp79 while((i > 1) && (heapArray[i >> 1]->totalCost > heapArray[i]->totalCost)) { in Push()
104 while (i > 1 && ((heapArray[i >> 1]->totalCost) > (heapArray[i]->totalCost))) { in Update()
146 if (left <= size && ((heapArray[left]->totalCost) < (heapArray[index]->totalCost))) in Pop()
151 if (right <= size && ((heapArray[right]->totalCost) < (heapArray[smalest]->totalCost))) in Pop()
424 tempStartNode->totalCost = estToGoal; in Solve()
494 directNode->totalCost = newCost + LeastCostEstimateLocal(indexEnd); in Solve()
561 tempStartNode->totalCost = estToGoal; in FindBestPathToAnyGivenPoint()
644 directNode->totalCost = newCost + LeastCostEstimateLocal(indexEnd); in FindBestPathToAnyGivenPoint()
707 tempStartNode->totalCost = estToGoal; in FindBestPathToPointOnRadius()
804 directNode->totalCost = newCost + LeastCostEstimateLocal(indexEnd); in FindBestPathToPointOnRadius()
/dports/games/openrct2/OpenRCT2-0.3.5.1/src/openrct2/actions/
H A DClearAction.cpp71 money32 totalCost = 0; in QueryExecute() local
88 totalCost += cost; in QueryExecute()
110 result->Cost = totalCost; in QueryExecute()
118 money32 totalCost = 0; in ClearSceneryFromTile() local
125 return totalCost; in ClearSceneryFromTile()
145 totalCost += res->Cost; in ClearSceneryFromTile()
163 totalCost += res->Cost; in ClearSceneryFromTile()
180 totalCost += res->Cost; in ClearSceneryFromTile()
198 totalCost += res->Cost; in ClearSceneryFromTile()
207 return totalCost; in ClearSceneryFromTile()
/dports/misc/ompl/ompl-1.5.2/src/ompl/base/objectives/src/
H A DStateCostIntegralObjective.cpp55 Cost totalCost = this->identityCost(); in motionCost() local
68 totalCost = Cost(totalCost.value() + in motionCost()
77 totalCost = Cost(totalCost.value() + in motionCost()
82 return totalCost; in motionCost()
/dports/devel/qtcreator/qt-creator-opensource-src-5.0.3/src/plugins/valgrind/callgrind/
H A Dcallgrinddatamodel.cpp258 quint64 totalCost = d->m_data->totalCost(i); in data() local
260 const float relSelfCost = (float)qRound((float)selfCost / totalCost * 10000) / 100; in data()
261 const float relInclCost = (float)qRound((float)inclCost / totalCost * 10000) / 100; in data()
280 const quint64 totalCost = d->m_data->totalCost(d->m_event); in data() local
281 return totalCost; in data()
286 const quint64 totalCost = d->m_data->totalCost(d->m_event); in data() local
288 return totalCost ? (double(func->selfCost(d->m_event)) / totalCost) : 0.0; in data()
290 return totalCost ? (double(func->inclusiveCost(d->m_event)) / totalCost) : 0.0; in data()
H A Dcallgrindcallmodel.cpp176 const quint64 totalCost = d->m_data->totalCost(d->m_event); in data() local
178 return totalCost ? (double(callCost) / totalCost) : 0.0; in data()
H A Dcallgrindproxymodel.cpp149 const quint64 totalCost = data->totalCost(0); in filterAcceptsRow() local
151 const float inclusiveCostRatio = (float)inclusiveCost / totalCost; in filterAcceptsRow()
/dports/lang/smalltalk/smalltalk-3.2.5/packages/profile/
H A DProfiler.st91 | selfCost totalCost totalCalls calleeCounts profiler |
116 totalCost := nil.
150 totalCost [
151 totalCost notNil ifTrue: [ ^totalCost ].
153 "Return 0 while computing totalCost, to handle loops properly."
154 totalCost := 0.
157 totalCost := calleeCounts keys inject: selfCost into: [ :old :callee |
159 ^totalCost
168 ^(calleeProfile totalCost * (calleeCounts at: callee)
229 totalCost [
[all …]
/dports/net-p2p/go-ethereum/go-ethereum-1.10.14/les/flowcontrol/
H A Dmanager_test.go31 index, totalCost uint64
99 var totalCost uint64
101 totalCost += n.totalCost
103 ratio := float64(totalCost) / float64(totalCapacity) / testLength
123 n.totalCost += rcost
/dports/games/openfodder/openfodder-1.6.0/Source/Utils/
H A Dmicropather.h222 float totalCost; // could be a function, but save some math. variable
250 MPASSERT( totalCost == FLT_MAX ); in CheckList()
252 MPASSERT( it->prev == this || it->totalCost >= it->prev->totalCost ); in CheckList()
253 MPASSERT( it->totalCost <= it->next->totalCost ); in CheckList()
260 totalCost = costFromStart + estToGoal; in CalcTotalCost()
262 totalCost = FLT_MAX; in CalcTotalCost()
409 …olve( cPosition* startState, cPosition* endState, MP_VECTOR< cPosition >* path, float* totalCost );
H A Dmicropather.cpp88 printf( " total=%.1f\n", pNode->totalCost ); in Push()
93 if (!(pNode->totalCost < FLT_MAX)) in Push()
96 MPASSERT( pNode->totalCost < FLT_MAX ); in Push()
100 if ( pNode->totalCost < iter->totalCost ) { in Push()
147 if ( pNode->prev != sentinel && pNode->totalCost < pNode->prev->totalCost ) { in Update()
153 if ( pNode->totalCost > pNode->next->totalCost ) { in Update()
157 while ( pNode->totalCost > it->totalCost ) in Update()
833 if ( node->totalCost > maxCost ) in SolveForNearStates()
859 child->totalCost = child->costFromStart; in SolveForNearStates()
872 if ( pNode->totalCost <= maxCost ) { in SolveForNearStates()
[all …]
/dports/devel/datadraw/datadraw3.1.1/dataview/
H A Ddwanneal.c20 int64 totalCost = 0; in findInitialTemperature() local
32 totalCost = totalCost + costs[xRandomSystems]; in findInitialTemperature()
34 averageCost = totalCost/AN_RANDOM_SYSTEMS; in findInitialTemperature()
/dports/math/ogdf/OGDF/src/ogdf/planarity/
H A DPlanarSubgraphBoyerMyrvold.cpp67 int totalCost = 0; in doCall() local
71 totalCost += costs == nullptr ? 1 : (*pCosts)[e]; in doCall()
76 if(i == 0 || totalCost < bestCost) { in doCall()
77 bestCost = totalCost; in doCall()
/dports/devel/kcachegrind/kcachegrind-21.12.3/libviews/
H A Dcallitem.cpp79 ProfileCostArray* totalCost; in updateCost() local
82 totalCost = _active->cycle()->inclusive(); in updateCost()
84 totalCost = _active->inclusive(); in updateCost()
87 totalCost = _active->data(); in updateCost()
91 double total = totalCost->subCost(ct); in updateCost()
116 double total = totalCost->subCost(ct2); in updateCost()
/dports/net-p2p/go-ethereum/go-ethereum-1.10.14/les/vflux/client/
H A Drequestbasket.go157 totalCost uint64
161 totalCost += v.value
164 if totalCost > 0 {
166 scaleValues := totalValue / float64(totalCost)
206 totalCost float64
210 totalCost += float64(costList[i]) * float64(b.amount) // use floats to avoid overflow
213 if totalCost < 1 {
216 return float64(totalValue) * basketFactor / totalCost
/dports/net-p2p/go-ethereum/go-ethereum-1.10.14/les/utils/
H A Dlimiter_test.go52 expCost, totalCost uint member
82 maxStart := int(float64(lt.totalCost-n.lastTotalCost) * n.reqRate)
84 n.lastTotalCost = lt.totalCost
101 lt.totalCost += res.node.cost
161 lt.expCost, lt.totalCost = 0, 0
178 if spamRatio := 1 - float64(lt.expCost)/float64(lt.totalCost); spamRatio > 0.5*(1+ltTolerance) {
/dports/databases/pgrouting/pgrouting-3.2.0/src/trsp/
H A Dpgr_trspHandler.cpp190 double totalCost; in explore() local
202 totalCost = get_tot_cost( in explore()
207 if (totalCost < m_dCost[index].endCost) { in explore()
208 m_dCost[index].endCost = totalCost; in explore()
213 add_to_que(totalCost, edge.idx(), true); in explore()
218 totalCost = get_tot_cost( in explore()
223 if (totalCost < m_dCost[index].startCost) { in explore()
224 m_dCost[index].startCost = totalCost; in explore()
228 add_to_que(totalCost, edge.idx(), false); in explore()
H A DGraphDefinition.cpp160 double totalCost; in explore() local
171 totalCost = m_dCost[cur_edge.m_lEdgeIndex].endCost + in explore()
174 totalCost = m_dCost[cur_edge.m_lEdgeIndex].startCost + in explore()
176 if (totalCost < m_dCost[index].endCost) { in explore()
177 m_dCost[index].endCost = totalCost; in explore()
181 que.push(std::make_pair(totalCost, in explore()
188 totalCost = m_dCost[cur_edge.m_lEdgeIndex].endCost + in explore()
191 totalCost = m_dCost[cur_edge.m_lEdgeIndex].startCost + in explore()
193 if (totalCost < m_dCost[index].startCost) { in explore()
194 m_dCost[index].startCost = totalCost; in explore()
[all …]
/dports/devel/heaptrack/heaptrack-1.3.0/src/analyze/
H A Daccumulatedtracedata.cpp204 const auto lastPeakCost = pass != FirstPass ? totalCost.peak : 0; in read()
207 totalCost = {}; in read()
351 ++totalCost.allocations; in read()
352 totalCost.leaked += info.size; in read()
353 if (totalCost.leaked > totalCost.peak) { in read()
354 totalCost.peak = totalCost.leaked; in read()
392 totalCost.leaked -= info.size; in read()
394 ++totalCost.temporary; in read()
452 totalCost = {}; in read()
642 totalCost -= base.totalCost; in diff()
[all …]
/dports/devel/heaptrack/heaptrack-1.3.0/src/analyze/gui/
H A Dparser.cpp185 maxConsumedSinceLastTimeStamp = max(maxConsumedSinceLastTimeStamp, totalCost.leaked); in handleTimeStamp()
196 auto createRow = [newStamp](int64_t totalCost) { in handleTimeStamp() argument
199 row.cost[0] = totalCost; in handleTimeStamp()
203 auto allocs = createRow(totalCost.allocations); in handleTimeStamp()
204 auto temporary = createRow(totalCost.temporary); in handleTimeStamp()
405 AllocationData totalCost; in buildTopDown() local
430 totalCost += row.cost; in buildTopDown()
432 return totalCost; in buildTopDown()
466 AllocationData totalCost; in buildCallerCallee() local
512 totalCost += row.cost; in buildCallerCallee()
[all …]
/dports/graphics/qgis-ltr/qgis-3.16.16/src/core/
H A Dqgstilecache.h54 … static int totalCost() { QMutexLocker locker( &sTileCacheMutex ); return sTileCache.totalCost(); } in totalCost() function
/dports/net/goreplay/goreplay-1.2.0/vendor/github.com/klauspost/compress/huff0/
H A Dcompress.go547 totalCost := int(0)
552 totalCost += baseCost - (1 << (largestBits - huffNode[n].nbBits))
564 totalCost >>= largestBits - maxNbBits /* note : totalCost is necessarily a multiple of baseCost */
587 for totalCost > 0 {
588 nBitsToDecrease := uint8(highBit32(uint32(totalCost))) + 1
611 totalCost -= 1 << (nBitsToDecrease - 1)
628 for totalCost < 0 { /* Sometimes, cost correction overshoot */
635 totalCost++
640 totalCost++
/dports/net/goreplay/goreplay-1.2.0/vendor/github.com/klauspost/compress/compress-1.10.10/huff0/
H A Dcompress.go547 totalCost := int(0)
552 totalCost += baseCost - (1 << (largestBits - huffNode[n].nbBits))
564 totalCost >>= largestBits - maxNbBits /* note : totalCost is necessarily a multiple of baseCost */
587 for totalCost > 0 {
588 nBitsToDecrease := uint8(highBit32(uint32(totalCost))) + 1
611 totalCost -= 1 << (nBitsToDecrease - 1)
628 for totalCost < 0 { /* Sometimes, cost correction overshoot */
635 totalCost++
640 totalCost++

12345678910>>...18