| /system/core/sh/ |
| output.c | 380 goto number;
395 uns_number: /* an unsigned number */
406 number: /* process a number */
|
| /external/bison/src/ |
| scan-gram.l | 531 complain_at (*loc, _("invalid number after \\-escape: %s"),
541 complain_at (*loc, _("invalid number after \\-escape: %s"),
561 complain_at (*loc, _("invalid number after \\-escape: %s"),
724 number of bytes read. Remove '\r' from input, treating \r\n
772 | Scan NUMBER for a base-BASE integer at location LOC. |
776 scan_integer (char const *number, int base, location loc)
779 unsigned long int num = strtoul (number, NULL, base);
783 complain_at (loc, _("integer out of range: %s"), quote (number));
859 warn_at (loc, _("line number overflow"));
|
| /external/ceres-solver/docs/ |
| faq.tex | 14 Most non-linear solvers we are aware of, define the problem and residuals in terms of scalars and it is possible to do this with Ceres also. However, it is our experience that in most problems small groups of scalars occur together. For example the three components of a translation vector and the four components of the quaternion that define the pose of a camera. Same is true for residuals, where it is common to have small vectors of residuals rather than just scalars. There are a number of advantages of using blocks. It saves on indexing information, which for large problems can be substantial. Blocks translate into contiguous storage in memory which is more cache friendly and last but not the least, it allows us to use SIMD/SSE based BLAS routines to significantly speed up various matrix operations.
30 The flips side is that sometimes, when modeling the problem it is tempting to group a large number of residuals together into a single residual block as it reduces the number of CostFunctions you have to define.
|
| solving.tex | 56 There are a number of different ways of solving this problem, each giving rise to a different concrete trust-region algorithm. Currently Ceres, implements two trust-region algorithms - Levenberg-Marquardt and Dogleg.
77 For all but the smallest problems the solution of~\eqref{eq:simple} in each iteration of the Levenberg-Marquardt algorithm is the dominant computational cost in Ceres. Ceres provides a number of different options for solving~\eqref{eq:simple}. There are two major classes of methods - factorization and iterative.
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$.
184 Setting \texttt{Solver::Options::num\_threads} to the maximum number
228 Ceres provides a number of different options for solving~\eqref{eq:normal}.
299 Thus, the solution of what was an $n\times n$, $n=pc+qs$ linear system is reduced to the inversion of the block diagonal matrix $C$, a few matrix-matrix and matrix-vector multiplies, and the solution of block sparse $pc\times pc$ linear system~\eqref{eq:schur}. For almost all problems, the number of cameras is much smaller than the number of points, $p \ll q$, thus solving~\eqref{eq:schur} is significantly cheaper than solving~\eqref{eq:linear2}. This is the {\em Schur complement trick}~\cite{brown-58}.
345 The convergence rate of Conjugate Gradients for solving~\eqref{eq:normal} depends on the distribution of eigenvalues of $H$~\cite{saad2003iterative}. A useful upper bound is $\sqrt{\kappa(H)}$, where, $\kappa(H)$f is the condition number of the matrix $H$. For most bundle adjustment problems, $\kappa(H)$ is high and a direct application of Conjugate Gradients to~\eqref{eq:normal} results in extremely poor performance.
347 The solution to this problem is to replace~\eqref{eq:normal} with a {\em preconditioned} system. Given a linear system, $Ax =b$ and a preconditioner $M$ the preconditioned system is given by $M^{-1}Ax = M^{-1}b$. The resulting algorithm is known as Preconditioned Conjugate Gradients algorithm (PCG) and its worst case complexity now depends on the condition number of the {\em preconditioned} matrix $\kappa(M^{-1}A)$.
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 pre (…)
[all...] |
| /external/icu4c/i18n/ |
| tmutfmt.cpp | 211 double number; local
214 number = amtNumber.getDouble();
216 number = amtNumber.getLong();
221 UnicodeString count = fPluralRules->select(number);
225 std::cout << "number: " << number << "; format plural count: " << result << "\n";
229 formattable[0].setDouble(number);
288 // pattern with Number as beginning, such as "{0} d".
323 /* After find the longest match, parse the number.
324 * Result number could be null for the pattern without number pattern
[all...] |
| /external/libvorbis/doc/ |
| 04-codec.tex | 211 \item the numbers read in the above two steps are channel numbers representing the channel to treat as magnitude and the channel to treat as angle, respectively. If for any coupling step the angle channel number equals the magnitude channel number, the magnitude channel number is greater than \varname{[audio_channels]}-1, or the angle channel is greater than \varname{[audio_channels]}-1, the stream is undecodable.
232 \item read 8 bits as unsigned integer for the floor number; save in vector \varname{[vorbis_mapping_submap_floor]} element \varname{[j]}
233 \item verify the floor number is not greater than the highest number floor configured for the bitstream. If it is, the bitstream is undecodable
234 \item read 8 bits as unsigned integer for the residue number; save in vector \varname{[vorbis_mapping_submap_residue]} element \varname{[j]}
235 \item verify the residue number is not greater than the highest number residue configured for the bitstream. If it is, the bitstream is undecodable
259 and \varname{[vorbis_mode_transformtype]}. \varname{[vorbis_mode_mapping]} must not be greater than the highest number mapping in use. Any illegal values render the stream undecodable
[all...] |
| /external/oprofile/events/i386/atom/ |
| events | 7 event:0xc0 counters:0,1 um:one minimum:6000 name:INST_RETIRED : number of instructions retired
10 event:0xc4 counters:0,1 um:br_inst_retired minimum:500 name:BR_INST_RETIRED : number of branch instructions retired
11 event:0xc5 counters:0,1 um:zero minimum:500 name:BR_MISS_PRED_RETIRED : number of mispredicted branches retired (precise)
14 event:0x06 counters:0,1 um:segment_reg_loads minimum:6000 name:SEGMENT_REG_LOADS : Number of segment register loads
36 event:0x3A counters:0,1 um:zero minimum:6000 name:EIST_TRANS : Number of Enhanced Intel SpeedStep(R) Technology (EIST) transitions
37 event:0x3B counters:0,1 um:thermal_trip minimum:6000 name:THERMAL_TRIP : Number of thermal trips
40 event:0x61 counters:0,1 um:agent minimum:6000 name:BUS_BNR_DRV : Number of Bus Not Ready signals asserted
|
| /external/v8/test/mjsunit/ |
| debug-handle.js | 165 assertEquals('number', response_length.body[ref].type);
198 assertEquals('number', val.type);
218 'Unexpected number of resolved objects');
|
| div-mod.js | 49 // Strange number test.
52 // Floating point number test.
58 // Integer number test.
122 var min_normal = Number.MIN_VALUE * Math.pow(2, 52);
123 var max_denormal = Number.MIN_VALUE * (Math.pow(2, 52) - 1);
129 Number.MIN_VALUE,
130 3 * Number.MIN_VALUE,
139 Number.MAX_VALUE,
|
| function-bind.js | 53 // Test that length works correctly even if more than the actual number
80 // When only giving the thisArg, any number of binds should have
144 // The wrong number of arguments can be given to bound functions too.
|
| /external/webkit/LayoutTests/fast/js/resources/ |
| js-test-pre.js | 66 if (typeof(_expected) == "number" && isNaN(_expected))
67 return typeof(_actual) == "number" && isNaN(_actual);
160 } else if (typeof expected == "number") {
|
| /external/webkit/Source/WebKit/mac/Plugins/Hosted/ |
| ProxyInstance.mm | 320 for (NSNumber *number in array.get()) {
321 IdentifierRep* identifier = reinterpret_cast<IdentifierRep*>([number longLongValue]);
329 nameArray.add(Identifier::from(exec, identifier->number()));
|
| /hardware/samsung_slsi/exynos5/librotator/ |
| exynos_rotator.c | 178 int number, int N)
180 int result = number;
191 result = (number - (number & (N-1)));
194 result = number - (number % N);
|
| /ndk/sources/host-tools/nawk-20071023/ |
| FIXES | 114 was longer than the number of states triggered a failure to initialize
168 subtle change to split: if source is empty, number of elems
207 number->string conversions, as promised by posix and done by
239 length(arrayname) returns number of elements; thanks to
256 and period was accepted as a valid number if it started with a period.
355 message. also fixed line number error in continuation lines.
408 added -V to print version number and die.
411 subtle silent bug in lex.c: if the program ended with a number
434 now using strtod to test whether a string is a number, instead of
599 changed error() to print line number as %d, not %g
[all...] |
| /external/protobuf/src/google/protobuf/ |
| descriptor_unittest.cc | 93 const string& name, int number,
98 result->set_number(number);
106 const string& name, int number,
111 result->set_number(number);
120 const string& name, int number,
125 result->set_number(number);
141 const string& name, int number) {
144 result->set_number(number);
579 EXPECT_EQ( 1, foo_->number());
580 EXPECT_EQ( 6, bar_->number());
[all...] |
| /external/blktrace/doc/ |
| blktrace.tex | 356 stored into debugfs files. The size and number of buffers can be
378 \emph{-w} option -- then blktrace will run for the specified number
391 -n \emph{num-sub} & --num-sub=\emph{num-sub} & Specifies number of buffers to use \\ \hline
395 -w \emph{seconds} & --stopwatch=\emph{seconds} & Sets run time to the number of seconds specified \\ \hline
563 if a timeout period has passed (see next entry) or if a number of
601 \emph{m} & Minor number of event's device. \\ \hline
602 \emph{M} & Major number of event's device. \\ \hline
603 \emph{n} & Number of blocks \\ \hline
604 \emph{N} & Number of bytes \\ \hline
608 \emph{S} & Sector number \\ \hlin
[all...] |
| /bionic/libc/tzcode/ |
| localtime.c | 92 : /* if time_t is a floating point number */
186 int r_day; /* day number of rule */
187 int r_week; /* week number of rule */
188 int r_mon; /* month number of rule */
218 static int increment_overflow P((int * number, int delta));
220 static int long_increment_overflow P((long * number, int delta));
701 ** Given a pointer into a time zone string, extract a number from that string.
702 ** Check that the number is within a specified range; if it is not, return
704 ** Otherwise, return a pointer to the first character not part of the number.
733 ** Given a pointer into a time zone string, extract a number of seconds
[all...] |
| /external/v8/benchmarks/ |
| splay.js | 157 * @param {number} key Key to insert into the tree.
190 * @param {number} key Key to find and remove from the tree.
221 * @param {number} key Key to find in the tree.
290 * @param {number} key Key to splay the tree on.
358 * @param {number} key Key.
|
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v4/ |
| v8-splay.js | 151 * @param {number} key Key to insert into the tree.
184 * @param {number} key Key to find and remove from the tree.
215 * @param {number} key Key to find in the tree.
269 * @param {number} key Key to splay the tree on.
337 * @param {number} key Key.
|
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v5/ |
| v8-splay.js | 151 * @param {number} key Key to insert into the tree.
184 * @param {number} key Key to find and remove from the tree.
215 * @param {number} key Key to find in the tree.
269 * @param {number} key Key to splay the tree on.
337 * @param {number} key Key.
|
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v6/ |
| v8-splay.js | 152 * @param {number} key Key to insert into the tree.
185 * @param {number} key Key to find and remove from the tree.
216 * @param {number} key Key to find in the tree.
285 * @param {number} key Key to splay the tree on.
353 * @param {number} key Key.
|
| /external/webkit/Source/WebCore/accessibility/mac/ |
| AccessibilityObjectWrapper.mm | 393 static void AXAttributeStringSetNumber(NSMutableAttributedString* attrString, NSString* attribute, NSNumber* number, NSRange range)
395 if (number)
396 [attrString addAttribute:attribute value:number range:range];
[all...] |
| /external/v8/src/ |
| elements.cc | 340 to->set(i + to_start, hole_or_object->Number());
370 to->set(i + to_start, from->ValueAt(entry)->Number());
653 int old_length = FastD2I(array->length()->Number());
1027 uint32_t number = static_cast<uint32_t>(key->Number()); local
1045 uint32_t number = static_cast<uint32_t>(key->Number()); local
[all...] |
| /frameworks/opt/telephony/src/java/com/android/internal/telephony/cdma/ |
| CDMAPhone.java | 124 // string to define how the carrier specifies its own ota sp number
192 // get the string that specifies the carrier OTA Sp number
583 public void setLine1Number(String alphaTag, String number, Message onComplete) {
799 String number = null; local
801 // TODO: The default value of voicemail number should be read from a system property
803 // Read platform settings for dynamic voicemail number
806 number = sp.getString(VM_NUMBER_CDMA, getLine1Number());
808 number = sp.getString(VM_NUMBER_CDMA, "*86");
810 return number;
813 /* Returns Number of Voicemail
[all...] |
| /external/openssl/ssl/ |
| ssltest.c | 308 static const char rnd_seed[] = "string to make the random number generator think it has entropy";
328 fprintf(stderr," -num <val> - number of connections to perform\n");
329 fprintf(stderr," -bytes <val> - number of bytes to swap between client/server\n");
524 int number=1,reuse=0; local
641 BIO_printf(bio_err,"Not a hex number '%s'\n",*argv);
671 number= atoi(*(++argv));
672 if (number == 0) number=1;
799 if (!ssl2 && !ssl3 && !tls1 && number > 1 && !reuse && !force)
829 if (number < 50 && !force
[all...] |
