Searched
full:complexity (Results
251 -
275 of
831) sorted by null
<<11121314151617181920>>
/external/mockito/src/org/mockito/ |
Mockito.java | 627 * Object oriented programming is more less tackling complexity by dividing the complexity into separate, specific, SRPy objects.
629 * Partial mock usually means that the complexity has been moved to a different method on the same object.
[all...] |
/external/speex/libspeex/ |
ltp.c | 545 int complexity, 570 N=complexity; 772 int complexity,
|
/frameworks/av/media/libstagefright/codecs/m4v_h263/enc/include/ |
mp4enc_api.h | 218 * larger search range, better motion vector match, but more complexity. 225 * otherwise one motion vector per macroblock is used. When the 8x8 MV is off, the total encoding complexity 226 * is less but the image quality is also worse. Therefore, it can be used in complexity limited environment.*/
|
/external/opencv/ml/src/ |
mltree.cpp | 822 node->complexity = 0; [all...] |
/external/ceres-solver/include/ceres/ |
solver.h | 164 // complexity of using the approximation. Higher the rank, the 175 // space complexity without the corresponding increase in solution 558 // version of Ceres has a higher iteration complexity, but also [all...] |
/external/eigen/Eigen/src/SVD/ |
JacobiSVD.h | 456 * bidiagonalizing SVD algorithms for large square matrices; however its complexity is still \f$ O(n^2p) \f$ where \a n is the smaller dimension and 457 * \a p is the greater dimension, meaning that it is still of the same order of complexity as the faster bidiagonalizing R-SVD algorithms. 458 * In particular, like any R-SVD, it takes advantage of non-squareness in that its complexity is only linear in the greater dimension. [all...] |
/build/tools/droiddoc/templates-pdk/ |
sdkpage.cs | 85 but always increases application complexity. If you have not run into any limitations
|
/development/samples/ToyVpn/src/com/example/android/toyvpn/ |
ToyVpnService.java | 94 // This greatly reduces the complexity of seamless handover, which
|
/external/aac/libFDK/include/ |
FDK_archdef.h | 214 #endif /* End of quality/complexity tradeoff */
|
/external/antlr/antlr-3.4/runtime/Python/ |
pylintrc | 205 # * size, complexity of functions, methods
|
/external/bzip2/ |
README | 123 ensure that this program works correctly. However, the complexity
|
/external/chromium/base/ |
bind_internal.h.pump | 64 // complexity of defintions for the InvokerN<> later. Even though there are
|
/external/chromium/chrome/common/deprecated/ |
event_sys-inl.h | 222 // Contains complexity of inheriting from Listener class and managing lifetimes.
|
/external/chromium/testing/gtest/include/gtest/internal/ |
gtest-death-test-internal.h | 56 // DeathTest is a class that hides much of the complexity of the
|
/external/chromium_org/ash/wm/ |
window_state.cc | 54 // can be put into immersive fullscreen. It is not worth the added complexity
|
/external/chromium_org/testing/gtest/include/gtest/internal/ |
gtest-death-test-internal.h | 56 // DeathTest is a class that hides much of the complexity of the
|
/external/chromium_org/third_party/WebKit/Source/platform/image-decoders/gif/ |
GIFImageReader.h | 309 // FIXME: This extra complexity is not necessary and we should just report m_frames.size().
|
/external/chromium_org/third_party/WebKit/Tools/TestResultServer/static-dashboards/ |
webtreemap.js | 33 // skeptical the extra complexity (and performance hit) is worth it.
|
/external/chromium_org/third_party/bintrees/bintrees/ |
rbtree.py | 16 # counterweight to this added complexity is that both insertion and deletion
|
/external/chromium_org/third_party/leveldatabase/src/doc/ |
impl.html | 172 O(N) complexity in the merging iterator.
|
/external/chromium_org/third_party/mesa/src/src/glsl/ |
link_functions.cpp | 132 * process introduces some complexity here, but it has some advantages.
|
/external/chromium_org/third_party/mesa/src/src/gtest/include/gtest/internal/ |
gtest-death-test-internal.h | 56 // DeathTest is a class that hides much of the complexity of the
|
/external/chromium_org/third_party/opus/src/silk/float/ |
main_FLP.h | 204 const opus_int lowComplexity, /* I Flag for low complexity */
|
/external/chromium_org/tools/gn/ |
input_file_manager.cc | 275 // item in the list, so that's extra overhead and complexity for no gain.
|
/external/gtest/include/gtest/internal/ |
gtest-death-test-internal.h | 56 // DeathTest is a class that hides much of the complexity of the
|
Completed in 977 milliseconds
<<11121314151617181920>>