| /external/skia/src/utils/win/ |
| SkDWriteGeometrySink.cpp | 89 } Cubic[4], Quadratic[3];
91 static bool check_quadratic(const Cubic& cubic, Quadratic& reduction) {
123 Quadratic quadratic; local
124 if (check_quadratic(cubic, quadratic)) {
125 fPath->quadTo(quadratic[1].x, quadratic[1].y,
126 quadratic[2].x, quadratic[2].y);
|
| /external/ImageMagick/Magick++/demo/ |
| demos.tap | 25 for filter in bessel blackman box catrom cubic gaussian hamming hanning hermite lanczos mitchell point quadratic sample scale sinc triangle
|
| /external/libgdx/gdx/src/com/badlogic/gdx/math/ |
| Bezier.java | 51 /** Quadratic Bezier curve
59 public static <T extends Vector<T>> T quadratic (final T out, final float t, final T p0, final T p1, final T p2, final T tmp) { method in class:Bezier
65 /** Quadratic Bezier curve derivative
167 quadratic(out, t, points.get(0), points.get(1), points.get(2), tmp); method
|
| /external/webrtc/webrtc/modules/audio_processing/intelligibility/ |
| intelligibility_enhancer.cc | 334 bool quadratic = (kConfigRho < 1.0f); local
348 if (quadratic) {
|
| /prebuilts/go/darwin-x86/test/ |
| maplinear.go | 8 // Test that maps don't go quadratic for NaNs and other values.
|
| /prebuilts/go/linux-x86/test/ |
| maplinear.go | 8 // Test that maps don't go quadratic for NaNs and other values.
|
| /prebuilts/go/darwin-x86/src/go/types/ |
| predicates.go | 234 // This is a quadratic algorithm, but in practice these stacks
|
| typestring.go | 78 // Theoretically, this is a quadratic lookup algorithm, but in
|
| stmt.go | 188 // TODO(gri) use a type hash to avoid quadratic algorithm
|
| /prebuilts/go/linux-x86/src/go/types/ |
| predicates.go | 234 // This is a quadratic algorithm, but in practice these stacks
|
| typestring.go | 78 // Theoretically, this is a quadratic lookup algorithm, but in
|
| stmt.go | 188 // TODO(gri) use a type hash to avoid quadratic algorithm
|
| /prebuilts/go/darwin-x86/src/regexp/ |
| backtrack.go | 342 // This looks like it's quadratic in the size of the text,
|
| /prebuilts/go/linux-x86/src/regexp/ |
| backtrack.go | 342 // This looks like it's quadratic in the size of the text,
|
| /prebuilts/go/darwin-x86/src/cmd/go/ |
| main.go | 709 // duplicates without making a quadratic number of calls
|
| /prebuilts/go/linux-x86/src/cmd/go/ |
| main.go | 709 // duplicates without making a quadratic number of calls
|
| /prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/compile/internal/gc/ |
| reg.go | 576 // For a large struct this could end up being quadratic:
580 // To avoid the quadratic behavior, we only turn on the bits if
[all...] |
| dcl.go | 1123 // quadratic behavior here, but unlikely to matter.
|
| popt.go | 923 // Run prog loop backward from end of program to beginning to avoid quadratic
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/gc/ |
| reg.go | 573 // For a large struct this could end up being quadratic:
577 // To avoid the quadratic behavior, we only turn on the bits if
[all...] |
| dcl.go | 1120 // quadratic behavior here, but unlikely to matter.
|
| popt.go | 920 // Run prog loop backward from end of program to beginning to avoid quadratic
|
| /prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/compile/internal/gc/ |
| reg.go | 576 // For a large struct this could end up being quadratic:
580 // To avoid the quadratic behavior, we only turn on the bits if
[all...] |
| /prebuilts/go/linux-x86/src/cmd/compile/internal/gc/ |
| reg.go | 573 // For a large struct this could end up being quadratic:
577 // To avoid the quadratic behavior, we only turn on the bits if
[all...] |
| /prebuilts/go/darwin-x86/src/go/internal/gcimporter/ |
| gcimporter.go | 901 // TODO(gri) This leads to a quadratic algorithm - ok for now because method counts are small.
|
