Searched refs:desired (Results 1 - 4 of 4) sorted by relevance
/haiku/src/kits/interface/layouter/ |
H A D | LayoutOptimizer.h | 32 bool Solve(const double* desired, double size, 36 bool _Solve(const double* desired, double* values);
|
H A D | LayoutOptimizer.cpp | 31 Given a set of layout constraints, a feasible solution, and a desired 33 criterion is to minimize the norm of the difference to the desired 648 \sum_{i=0}^{n-1} (x_i - desired[i])^2. 653 LayoutOptimizer::Solve(const double* desired, double size, double* values) argument 655 if (fVariables == NULL || desired == NULL|| values == NULL) 672 bool success = _Solve(desired, values); 685 LayoutOptimizer::_Solve(const double* desired, double* values) argument 710 // ||x - desired|| we actually want to minimize. 713 d[i] = desired[i + 1] - desired[ [all...] |
/haiku/src/system/libroot/os/arch/generic/ |
H A D | generic_atomic.cpp | 28 atomic_test_and_set(int32_t* ptr, int32_t desired, int32_t expected) argument 31 obj.compare_exchange_strong(expected, desired); 85 atomic_test_and_set64(int64_t* ptr, int64_t desired, int64_t expected) argument 88 obj.compare_exchange_strong(expected, desired);
|
/haiku/src/system/libroot/os/arch/arm/ |
H A D | stdatomic.c | 154 uintN_t desired, int success __unused, int failure __unused) \ 160 *mem = desired; \ 256 uintN_t desired, int success __unused, int failure __unused) \ 281 : "r" (expected), "r" (desired), "m" (*mem), \ 492 uintN_t desired) \ 502 put_##N(&desired32, mem, desired); \ 624 uint32_t desired) 639 : "r" (expected), "r" (desired), "m" (*mem)); 707 uintN_t desired) \ 714 *mem = desired; \ 623 __sync_val_compare_and_swap_4_c(uint32_t *mem, uint32_t expected, uint32_t desired) argument [all...] |
Completed in 39 milliseconds