Home
last modified time | relevance | path

Searched refs:balanced (Results 1 – 25 of 52) sorted by relevance

123

/external/eigen/unsupported/Eigen/src/Polynomials/
DCompanion.h110 bool balanced( Scalar colNorm, Scalar rowNorm,
142 bool companion<_Scalar,_Deg>::balanced( Scalar colNorm, Scalar rowNorm, in balanced() function
231 if( !balanced( colNorm, rowNorm, hasConverged, colB, rowB ) ) in balance()
248 if( !balanced( colNorm, rowNorm, hasConverged, colB, rowB ) ) in balance()
264 if( !balanced( colNorm, rowNorm, hasConverged, colB, rowB ) ) in balance()
/external/python/cpython2/Objects/
Dlistsort.txt195 Discussion: The tests that end up doing (close to) perfectly balanced
197 also ends up doing balanced merges, but systematically benefits a lot from
199 %sort approaches having a balanced merge at the end because the random
241 1. Random data strongly tends then toward perfectly balanced (both runs have
262 here, so that the merges end up perfectly balanced (see next section). We
276 balanced merges (see next section), leaving runs of lengths 2048 and 64 to
283 runs each of length 33, and then all merges are perfectly balanced. Better!
369 trigger 7 perfectly balanced merges.
375 then we get a sequence of perfectly balanced merges (with, perhaps, some
592 ~sort is a good example of when balanced runs could benefit from a better
/external/python/cpython3/Objects/
Dlistsort.txt195 Discussion: The tests that end up doing (close to) perfectly balanced
197 also ends up doing balanced merges, but systematically benefits a lot from
199 %sort approaches having a balanced merge at the end because the random
241 1. Random data strongly tends then toward perfectly balanced (both runs have
262 here, so that the merges end up perfectly balanced (see next section). We
276 balanced merges (see next section), leaving runs of lengths 2048 and 64 to
283 runs each of length 33, and then all merges are perfectly balanced. Better!
369 trigger 7 perfectly balanced merges.
375 then we get a sequence of perfectly balanced merges (with, perhaps, some
592 ~sort is a good example of when balanced runs could benefit from a better
/external/iptables/extensions/
Dlibxt_NFQUEUE.man17 This specifies a range of queues to use. Packets are then balanced across the given queues.
/external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/PowerPC/
Dtail-dup-layout.ll471 br i1 %tagbits.i.eq0, label %ret, label %j8, !prof !2 ; balanced (3 to 3)
477 br i1 %tagbits.b.eq1, label %e9, label %d7, !prof !2 ; balanced (3 to 3)
495 br i1 %tagbits.h.eq1, label %ret, label %j8, !prof !2 ; balanced (5 to 5)
548 br i1 %tagbits.g.eq0, label %ret1, label %ret2, !prof !2 ; balanced
Dmachine-combiner.ll65 ; Verify that we reassociate some of these ops. The optimal balanced tree of adds is not
/external/llvm/test/CodeGen/X86/
Dswitch-bt.ll141 ; The balanced binary switch here would start with a comparison against 39, but
Dmisched-balance.ll232 ; balanced heuristics are interesting here because we have resource,
/external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/X86/
Dswitch-bt.ll141 ; The balanced binary switch here would start with a comparison against 39, but
Dmisched-balance.ll232 ; balanced heuristics are interesting here because we have resource,
/external/grpc-grpc/src/proto/grpc/lb/v1/
Dload_balancer.proto48 // The name of the load balanced service (e.g., service.googleapis.com). Its
/external/grpc-grpc-java/grpclb/src/main/proto/grpc/lb/v1/
Dload_balancer.proto48 // The name of the load balanced service (e.g., service.googleapis.com). Its
/external/llvm/test/CodeGen/PowerPC/
Dmachine-combiner.ll65 ; Verify that we reassociate some of these ops. The optimal balanced tree of adds is not
/external/grpc-grpc/doc/
Dload-balancing.md14 come from a single client, we still want them to be load-balanced across
/external/llvm/test/CodeGen/AArch64/
Dmachine-combiner.ll54 ; Verify that we reassociate some of these ops. The optimal balanced tree of adds is not
/external/swiftshader/third_party/LLVM/test/Transforms/ObjCARC/
Dcfg-hazards.ll363 ; Don't delete anything if they're not balanced.
/external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/AArch64/
Dmachine-combiner.ll59 ; Verify that we reassociate some of these ops. The optimal balanced tree of adds is not
/external/icu/icu4c/source/test/testdata/
Dre_tests.txt487 a(?{)b - c - Sequence (?{...}) not terminated or not {}-balanced
488 a(?{{})b - c - Sequence (?{...}) not terminated or not {}-balanced
490 a(?{"{"})b - c - Sequence (?{...}) not terminated or not {}-balanced
/external/llvm/test/Transforms/ObjCARC/
Dcfg-hazards.ll364 ; Don't delete anything if they're not balanced.
/external/swiftshader/third_party/llvm-7.0/llvm/test/Transforms/ObjCARC/
Dcfg-hazards.ll364 ; Don't delete anything if they're not balanced.
/external/libxml2/
DTODO169 - Parsing of a well balanced chunk xmlParseBalancedChunkMemory()
/external/grpc-grpc-java/services/src/main/proto/grpc/channelz/v1/
Dchannelz.proto60 // A subchannel is load balanced over by it's ancestor
/external/freetype/src/autofit/
Dafblue.dat47 // - Data blocks enclosed in balanced braces, which get copied verbatim and
/external/grpc-grpc/src/proto/grpc/channelz/
Dchannelz.proto60 // A subchannel is load balanced over by it's ancestor
/external/tensorflow/tensorflow/examples/udacity/
D1_notmnist.ipynb492 "Another check: we expect the data to be balanced across classes. Verify that.\n",

123