/external/mockito/src/org/mockito/ |
AdditionalMatchers.java | 146 public static <T extends Comparable<T>> T leq(Comparable<T> value) { method in class:AdditionalMatchers 159 public static byte leq(byte value) { method in class:AdditionalMatchers 172 public static double leq(double value) { method in class:AdditionalMatchers 185 public static float leq(float value) { method in class:AdditionalMatchers 198 public static int leq(int value) { method in class:AdditionalMatchers 211 public static long leq(long value) { method in class:AdditionalMatchers 224 public static short leq(short value) { method in class:AdditionalMatchers
|
/external/easymock/src/org/easymock/ |
EasyMock.java | 400 public static <T extends Comparable<T>> T leq(Comparable<T> value) {
method in class:EasyMock 413 public static byte leq(byte value) {
method in class:EasyMock 426 public static double leq(double value) {
method in class:EasyMock 439 public static float leq(float value) {
method in class:EasyMock 452 public static int leq(int value) {
method in class:EasyMock 465 public static long leq(long value) {
method in class:EasyMock 478 public static short leq(short value) {
method in class:EasyMock [all...] |
/external/android-mock/src/com/google/android/testing/mocking/ |
AndroidMock.java | 58 * and {@link #leq(byte)} all have nonsense return values. Each of the expectation methods may only 248 * criteria include {@link #anyObject()}, {@link #leq(int)}, {@link #contains(String)}, 578 * {@code AndroidMock.expect(mock.getString(AndroidMock.leq("hi"))).andReturn("hello");} 584 public static <T extends Comparable<T>> T leq(Comparable<T> expectedValue) { method in class:AndroidMock 585 return EasyMock.leq(expectedValue); 598 * {@code AndroidMock.expect(mock.getString(AndroidMock.leq((byte)42))).andReturn("hello");} 604 public static byte leq(byte expectedValue) { method in class:AndroidMock 605 return EasyMock.leq(expectedValue); 618 * {@code AndroidMock.expect(mock.getString(AndroidMock.leq(42.0))).andReturn("hello");} 624 public static double leq(double expectedValue) method in class:AndroidMock 644 public static float leq(float expectedValue) { method in class:AndroidMock 664 public static int leq(int expectedValue) { method in class:AndroidMock 684 public static long leq(long expectedValue) { method in class:AndroidMock 704 public static short leq(short expectedValue) { method in class:AndroidMock [all...] |
/external/android-mock/tests/com/google/android/testing/mocking/ |
AndroidMockTest.java | 635 AndroidMock.expect(mockMap.get(AndroidMock.leq((byte) 0))).andReturn(null); 636 AndroidMock.expect(mockMap.get(AndroidMock.leq((short) 0))).andReturn(null); 637 AndroidMock.expect(mockMap.get(AndroidMock.leq(0))).andReturn(null); 638 AndroidMock.expect(mockMap.get(AndroidMock.leq(0L))).andReturn(null); 639 AndroidMock.expect(mockMap.get(AndroidMock.leq(0.0))).andReturn(null); 640 AndroidMock.expect(mockMap.get(AndroidMock.leq(0.0f))).andReturn(null); 641 AndroidMock.expect(mockMap.get(AndroidMock.leq("Hi"))).andReturn(null); [all...] |
/prebuilts/tools/common/easymock-tools/ |
easymock-3.1.jar | |
/prebuilts/tools/common/m2/internal/org/easymock/easymock/3.1/ |
easymock-3.1.jar | |
/external/valgrind/main/helgrind/ |
libhb_core.c | 3171 struct { VtsID vi1; VtsID vi2; Bool leq; } member in struct:__anon17083 3223 Bool leq; local 4945 Bool leq; local 4972 Bool leq = VtsID__cmpLEQ(rmini,tviR); local 5035 Bool leq = VtsID__cmpLEQ(wmini,tviW); local 6377 { Bool leq = VtsID__cmpLEQ(thr->viW, thr->viR); local [all...] |
/external/ceres-solver/docs/ |
solving.tex | 83 \|H(x) \Delta x + g(x)\| \leq \eta_k \|g(x)\|. \label{eq:inexact} 85 Here, $k$ indicates the Levenberg-Marquardt iteration number and $0 < \eta_k <1$ is known as the forcing sequence. Wright \& Holt \cite{wright1985inexact} prove that a truncated Levenberg-Marquardt algorithm that uses an inexact Newton step based on~\eqref{eq:inexact} converges for any sequence $\eta_k \leq \eta_0 < 1$ and the rate of convergence depends on the choice of the forcing sequence $\eta_k$. 330 Another option for bundle adjustment problems is to apply PCG to the reduced camera matrix $S$ instead of $H$. One reason to do this is that $S$ is a much smaller matrix than $H$, but more importantly, it can be shown that $\kappa(S)\leq \kappa(H)$. Ceres implements PCG on $S$ as the \texttt{ITERATIVE\_SCHUR} solver. When the user chooses \texttt{ITERATIVE\_SCHUR} as the linear solver, Ceres automatically switches from the exact step algorithm to an inexact step algorithm. [all...] |
/external/robolectric/lib/test/ |
mockito-core-1.8.5.jar | |
/external/dexmaker/lib/ |
mockito-core-1.9.1-SNAPSHOT.jar | |
/external/e2fsprogs/lib/et/ |
texinfo.tex | [all...] |
/external/bison/build-aux/ |
texinfo.tex | [all...] |
/ndk/sources/host-tools/sed-4.2.1/build-aux/ |
texinfo.tex | [all...] |