| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/binomial_heap_base_/ |
| binomial_heap_base_.hpp | 38 * Contains an implementation class for a base of binomial heaps.
45 * Binomial heap base.
75 /// Base class for binomial heap.
|
| constructors_destructor_fn_imps.hpp | 38 * Contains an implementation class for a base of binomial heaps.
|
| find_fn_imps.hpp | 38 * Contains an implementation class for a base of binomial heaps.
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/binomial_heap_base_/ |
| binomial_heap_base_.hpp | 38 * Contains an implementation class for a base of binomial heaps.
45 * Binomial heap base.
75 /// Base class for binomial heap.
|
| constructors_destructor_fn_imps.hpp | 38 * Contains an implementation class for a base of binomial heaps.
|
| find_fn_imps.hpp | 38 * Contains an implementation class for a base of binomial heaps.
|
| /prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/compile/internal/big/ |
| hilbert_test.go | 78 x2 := new(Rat).SetInt(new(Int).Binomial(int64(n+i), int64(n-j-1)))
79 x3 := new(Rat).SetInt(new(Int).Binomial(int64(n+j), int64(n-i-1)))
80 x4 := new(Rat).SetInt(new(Int).Binomial(int64(i+j), int64(i)))
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/big/ |
| hilbert_test.go | 75 x2 := new(Rat).SetInt(new(Int).Binomial(int64(n+i), int64(n-j-1)))
76 x3 := new(Rat).SetInt(new(Int).Binomial(int64(n+j), int64(n-i-1)))
77 x4 := new(Rat).SetInt(new(Int).Binomial(int64(i+j), int64(i)))
|
| /prebuilts/go/darwin-x86/src/math/big/ |
| hilbert_test.go | 75 x2 := new(Rat).SetInt(new(Int).Binomial(int64(n+i), int64(n-j-1)))
76 x3 := new(Rat).SetInt(new(Int).Binomial(int64(n+j), int64(n-i-1)))
77 x4 := new(Rat).SetInt(new(Int).Binomial(int64(i+j), int64(i)))
|
| /prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/compile/internal/big/ |
| hilbert_test.go | 78 x2 := new(Rat).SetInt(new(Int).Binomial(int64(n+i), int64(n-j-1)))
79 x3 := new(Rat).SetInt(new(Int).Binomial(int64(n+j), int64(n-i-1)))
80 x4 := new(Rat).SetInt(new(Int).Binomial(int64(i+j), int64(i)))
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/big/ |
| hilbert_test.go | 75 x2 := new(Rat).SetInt(new(Int).Binomial(int64(n+i), int64(n-j-1)))
76 x3 := new(Rat).SetInt(new(Int).Binomial(int64(n+j), int64(n-i-1)))
77 x4 := new(Rat).SetInt(new(Int).Binomial(int64(i+j), int64(i)))
|
| /prebuilts/go/linux-x86/src/math/big/ |
| hilbert_test.go | 75 x2 := new(Rat).SetInt(new(Int).Binomial(int64(n+i), int64(n-j-1)))
76 x3 := new(Rat).SetInt(new(Int).Binomial(int64(n+j), int64(n-i-1)))
77 x4 := new(Rat).SetInt(new(Int).Binomial(int64(i+j), int64(i)))
|
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/binomial_heap_base_/ |
| binomial_heap_base_.hpp | 38 * Contains an implementation class for a base of binomial heaps.
45 * Binomial heap base.
75 /// Base class for binomial heap.
|
| constructors_destructor_fn_imps.hpp | 38 * Contains an implementation class for a base of binomial heaps.
|
| find_fn_imps.hpp | 38 * Contains an implementation class for a base of binomial heaps.
|
| /external/guava/guava-gwt/src-super/com/google/common/math/super/com/google/common/math/ |
| LongMath.java | 198 * Returns {@code n} choose {@code k}, also known as the binomial coefficient of {@code n} and
203 public static long binomial(int n, int k) { method in class:LongMath
279 * binomial(biggestBinomials[k], k) fits in a long, but not
280 * binomial(biggestBinomials[k] + 1, k).
288 * binomial(biggestSimpleBinomials[k], k) doesn't need to use the slower GCD-based impl,
289 * but binomial(biggestSimpleBinomials[k] + 1, k) does.
|
| BigIntegerMath.java | 210 * Returns {@code n} choose {@code k}, also known as the binomial coefficient of {@code n} and
217 public static BigInteger binomial(int n, int k) { method in class:BigIntegerMath
225 return BigInteger.valueOf(LongMath.binomial(n, k));
|
| /external/llvm/test/CodeGen/X86/ |
| pr2659.ll | 7 define i32 @binomial(i32 %n, i32 %k) nounwind {
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/binomial_heap_base_/ |
| constructors_destructor_fn_imps.hpp | 38 * Contains an implementation class for a base of binomial heaps.
|
| find_fn_imps.hpp | 38 * Contains an implementation class for a base of binomial heaps.
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/ |
| tag_and_trait.hpp | 176 /// Binomial-heap.
179 /// Redundant-counter binomial-heap.
366 /// Specialization, binomial heap.
382 /// Specialization, rc binomial heap.
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/ |
| tag_and_trait.hpp | 176 /// Binomial-heap.
179 /// Redundant-counter binomial-heap.
366 /// Specialization, binomial heap.
382 /// Specialization, rc binomial heap.
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/ |
| tag_and_trait.hpp | 176 /// Binomial-heap.
179 /// Redundant-counter binomial-heap.
366 /// Specialization, binomial heap.
382 /// Specialization, rc binomial heap.
|
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/ |
| tag_and_trait.hpp | 176 /// Binomial-heap.
179 /// Redundant-counter binomial-heap.
366 /// Specialization, binomial heap.
382 /// Specialization, rc binomial heap.
|
| /external/mesa3d/src/mesa/math/ |
| m_eval.h | 51 * where s=1-t and the binomial coefficients [i]. These can
|
