| /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
| db_rob_image_homography.h | 85 \param chunk_size size of cost chunks
|
| db_utilities_constants.h | 90 * before a log of the product is added to the total cost.
|
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/latin/ |
| ContactsContentObserver.java | 111 // to include all of them anyways and the cost of rebuilding the dictionary is too high.
|
| /packages/inputmethods/LatinIME/native/jni/src/dictionary/utils/ |
| multi_bigram_map.cpp | 25 // could improve bigram lookup speed for multi-word suggestions, but at the cost of more memory
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/protocols/ |
| routed.h | 47 int rip_metric; /* cost of route */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/protocols/ |
| routed.h | 47 int rip_metric; /* cost of route */
|
| /prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/compile/internal/gc/ |
| reg.go | 117 // cost.
120 cost int16
128 // There's not a huge cost to having too many regions:
134 // sorting by cost, which uses sort.Sort and is therefore
156 if p1.cost != p2.cost {
157 return int(p2.cost)-int(p1.cost) < 0
678 if i != 0 && r.cost > 0 {
685 if i != 0 && r.cost > 0
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/gc/ |
| reg.go | 114 // cost.
117 cost int16
125 // There's not a huge cost to having too many regions:
131 // sorting by cost, which uses sort.Sort and is therefore
153 if p1.cost != p2.cost {
154 return int(p2.cost)-int(p1.cost) < 0
675 if i != 0 && r.cost > 0 {
682 if i != 0 && r.cost > 0
[all...] |
| /prebuilts/go/darwin-x86/src/go/types/testdata/ |
| decls2a.src | 36 // it's double-declared (it would cost extra in the common case to verify
|
| /prebuilts/go/darwin-x86/src/runtime/ |
| memmove_plan9_386.s | 33 // REP instructions have a high startup cost, so we handle small sizes
|
| memmove_plan9_amd64.s | 35 // REP instructions have a high startup cost, so we handle small sizes
|
| /prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/compile/internal/gc/ |
| reg.go | 117 // cost.
120 cost int16
128 // There's not a huge cost to having too many regions:
134 // sorting by cost, which uses sort.Sort and is therefore
156 if p1.cost != p2.cost {
157 return int(p2.cost)-int(p1.cost) < 0
678 if i != 0 && r.cost > 0 {
685 if i != 0 && r.cost > 0
[all...] |
| /prebuilts/go/linux-x86/src/cmd/compile/internal/gc/ |
| reg.go | 114 // cost.
117 cost int16
125 // There's not a huge cost to having too many regions:
131 // sorting by cost, which uses sort.Sort and is therefore
153 if p1.cost != p2.cost {
154 return int(p2.cost)-int(p1.cost) < 0
675 if i != 0 && r.cost > 0 {
682 if i != 0 && r.cost > 0
[all...] |
| /prebuilts/go/linux-x86/src/go/types/testdata/ |
| decls2a.src | 36 // it's double-declared (it would cost extra in the common case to verify
|
| /prebuilts/go/linux-x86/src/runtime/ |
| memmove_plan9_386.s | 33 // REP instructions have a high startup cost, so we handle small sizes
|
| memmove_plan9_amd64.s | 35 // REP instructions have a high startup cost, so we handle small sizes
|
| /toolchain/binutils/binutils-2.25/gold/ |
| README | 40 C++ code is the same, but we don't pay the execution time cost of
|
| /external/ceres-solver/docs/source/ |
| tutorial.rst | 107 // Set up the only cost function (also known as residual). This uses
136 iter cost cost_change |gradient| |step| tr_ratio tr_radius ls_iter iter_time total_time
140 Ceres Solver Report: Iterations: 2, Initial cost: 4.512500e+01, Final cost: 5.012552e-16, Termination: CONVERGENCE
189 In some cases, its not possible to define a templated cost functor,
296 constructing and computing cost functions.
378 iter cost cost_change |gradient| |step| tr_ratio tr_radius ls_iter iter_time total_time
412 Cost:
508 iter cost cost_change |gradient| |step| tr_ratio tr_radius ls_iter iter_time total_time
523 Ceres Solver Report: Iterations: 13, Initial cost: 1.211734e+02, Final cost: 1.056751e+00, Termination: CONVERGENC
[all...] |
| /external/bison/lib/ |
| xalloc.h | 133 O(N) overall cost rather than O(N**2) cost, but the
|
| /external/caliper/caliper/src/main/java/com/google/caliper/memory/ |
| ObjectGraphMeasurer.java | 146 * values, which should not contribute to the cost of any single object
163 * values, which should not contribute to the cost of any single object
|
| /external/caliper/examples/src/main/java/examples/ |
| BitSetBenchmark.java | 60 * benchmark attempts to measure the raw cost of looping through and reading the
168 * This benchmark attempts to measure the baseline cost of both
|
| /external/ceres-solver/examples/ |
| denoising.cc | 66 // This cost function is used to build the data term.
105 // Create Ceres cost and loss functions for regularization. One is needed for
|
| /external/ceres-solver/include/ceres/ |
| dynamic_numeric_diff_cost_function.h | 34 // numeric_diff_cost_function.h by supporting numericdiff on cost
41 // numeric diff; the expected interface for the cost functors is:
|
| local_parameterization.h | 47 // block itself to remove the null directions of the cost. More
57 // tangent space. For a cost function defined on this sphere, given a
|
| /external/freetype/include/ |
| ftlcdfil.h | 111 * The default filter reduces color fringes considerably, at the cost
116 * cost of slightly more color fringes than the default one. It might
|
