| /external/icu4c/common/ |
| ucnv2022.cpp | 382 _ISO2022Reset(UConverter *converter, UConverterResetChoice choice);
661 _ISO2022Reset(UConverter *converter, UConverterResetChoice choice) {
663 if(choice<=UCNV_RESET_TO_UNICODE) {
668 if(choice!=UCNV_RESET_TO_UNICODE) {
673 if(choice<=UCNV_RESET_TO_UNICODE) {
682 if(choice!=UCNV_RESET_TO_UNICODE) {
695 if(choice<=UCNV_RESET_TO_UNICODE) {
698 if(choice!=UCNV_RESET_TO_UNICODE) {
[all...] |
| ucnv_ct.c | 175 _CompoundTextReset(UConverter *converter, UConverterResetChoice choice);
321 _CompoundTextReset(UConverter *converter, UConverterResetChoice choice) {
|
| ucnv_u32.c | [all...] |
| ucnv_u7.c | 180 _UTF7Reset(UConverter *cnv, UConverterResetChoice choice) {
181 if(choice<=UCNV_RESET_TO_UNICODE) {
186 if(choice!=UCNV_RESET_TO_UNICODE) {
[all...] |
| ucnvisci.c | 249 static void _ISCIIReset(UConverter *cnv, UConverterResetChoice choice) {
251 if (choice<=UCNV_RESET_TO_UNICODE) {
259 if (choice!=UCNV_RESET_TO_UNICODE) {
[all...] |
| ucnvscsu.c | 157 _SCSUReset(UConverter *cnv, UConverterResetChoice choice) {
160 if(choice<=UCNV_RESET_TO_UNICODE) {
171 if(choice!=UCNV_RESET_TO_UNICODE) {
[all...] |
| /packages/apps/Settings/src/com/android/settings/ |
| TetherSettings.java | 441 private void startProvisioningIfNecessary(int choice) {
442 mTetherChoice = choice;
|
| /external/icu4c/test/cintltst/ |
| cucdtst.c | 2867 int32_t p, v, choice=0, rev; local
[all...] |
| /packages/apps/Gallery/src/com/android/camera/ |
| GridViewSpecial.java | 185 public void setSizeChoice(int choice) {
187 if (mSizeChoice == choice) return;
188 mSizeChoice = choice;
456 // an image is deleted, or the size choice is changed,
[all...] |
| /packages/apps/Stk/src/com/android/stk/ |
| StkAppService.java | 99 static final String CHOICE = "choice";
588 int choice = args.getInt(CHOICE); local
589 CatLog.d(this, "User Choice=" + choice);
590 switch (choice) {
826 args.putInt(CHOICE, YES);
838 args.putInt(CHOICE, NO);
[all...] |
| /frameworks/base/services/java/com/android/server/pm/ |
| UserManagerService.java | [all...] |
| /prebuilts/devtools/tools/lib/ |
| draw9patch.jar | |
| monkeyrunner.jar | |
| /sdk/hierarchyviewer/src/com/android/hierarchyviewer/ui/ |
| Workspace.java | 1046 int choice = chooser.showSaveDialog(sceneView); local
1087 int choice = chooser.showSaveDialog(sceneView); local
[all...] |
| ScreenViewer.java | 206 int choice = chooser.showOpenDialog(this); local
207 if (choice == JFileChooser.APPROVE_OPTION) {
|
| /external/clang/utils/ABITest/ |
| ABITestGen.py | 236 elements = map(random.choice,fieldValues)
249 elements = [random.choice(values) for i in range(t.numElements)]
355 type='choice', choices=('random','linear'), default='linear')
|
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.apache.ant_1.7.1.v20090120-1145/bin/ |
| ant.bat | 198 if not "%OS%"=="Windows_NT" echo 1 > nul | choice /n /c:1
|
| /external/ceres-solver/docs/ |
| solving.tex | 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$.
115 The key advantage of the Dogleg over Levenberg Marquardt is that if the step computation for a particular choice of $\mu$ does not result in sufficient decrease in the value of the objective function, Levenberg-Marquardt solves the linear approximation from scratch with a smaller value of $\mu$. Dogleg on the other hand, only needs to compute the interpolation between the Gauss-Newton and the Cauchy vectors, as neither of them depend on the value of $\mu$.
231 For small problems (a couple of hundred parameters and a few thousand residuals) with relatively dense Jacobians, \texttt{DENSE\_QR} is the method of choice~\cite{bjorck1996numerical}. Let $J = QR$ be the QR-decomposition of $J$, where $Q$ is an orthonormal matrix and $R$ is an upper triangular matrix~\cite{trefethen1997numerical}. Then it can be shown that the solution to~\eqref{eq:normal} is given by
302 method of choice for solving symmetric positive definite systems
349 The computational cost of using a preconditioner $M$ is the cost of computing $M$ and evaluating the product $M^{-1}y$ for arbitrary vectors $y$. Thus, there are two competing factors to consider: How much of $H$'s structure is captured by $M$ so that the condition number $\kappa(HM^{-1})$ is low, and the computational cost of constructing and using $M$. The ideal preconditioner would be one for which $\kappa(M^{-1}A) =1$. $M=A$ achieves this, but it is not a practical choice, as applying this preconditioner would require solving a linear system equivalent to the unpreconditioned problem. It is usually the case that the more information $M$ has about $H$, the more expensive it is use. For example, Incomplete Cholesky factorization based preconditioners have much better convergence behavior than the Jacobi preconditioner, but are also much more expensive.
424 If the user leaves the choice to Ceres, then the solver uses an
[all...] |
| /external/chromium/net/tools/testserver/ |
| device_management.py | 625 dmtoken_chars.append(random.choice('0123456789abcdef'))
|
| /external/chromium-trace/trace-viewer/third_party/pywebsocket/src/example/ |
| echo_client.py | 684 ch = random.choice(available_chars)
[all...] |
| /external/icu4c/i18n/ |
| ucurr.cpp | 531 int32_t choice = (int32_t) nameStyle; local
532 if (choice < 0 || choice > 1) {
572 s = ures_getStringByIndex(rb, choice, len, &ec2);
[all...] |
| /external/quake/ |
| NOTICE | 243 impose that choice.
588 impose that choice.
[all...] |
| /external/webkit/Tools/Scripts/webkitpy/style/checkers/ |
| cpp_unittest.py | [all...] |
| /external/speex/libspeex/ |
| nb_celp.c | 456 int choice=0; local
471 choice = mode;
476 mode=choice;
[all...] |
| /external/chromium-trace/trace-viewer/third_party/pywebsocket/src/test/ |
| client_for_testing.py | 678 ch = random.choice(available_chars)
[all...] |
