| /external/chromium_org/chrome/browser/resources/media/ |
| webrtc_logs.js | 45 'URL (if applicable) where the problem occurred:',
47 'Can you reproduce this problem?',
49 'What steps will reproduce this problem? (or if it\'s not ' +
50 'reproducible, what were you doing just before the problem)?',
|
| /external/oauth/core/src/main/java/net/oauth/signature/ |
| OAuthSignatureMethod.java | 69 OAuthProblemException problem = new OAuthProblemException( local
71 problem.setParameter("oauth_signature", signature);
72 problem.setParameter("oauth_signature_base_string", baseString);
73 problem.setParameter("oauth_signature_method", message
75 throw problem;
226 OAuthProblemException problem = new OAuthProblemException( local
230 problem.setParameter("oauth_acceptable_signature_methods",
233 throw problem;
|
| /external/ceres-solver/examples/ |
| data_fitting.cc | 36 using ceres::Problem;
145 Problem problem; local
147 problem.AddResidualBlock(
160 Solve(options, &problem, &summary);
|
| robust_curve_fitting.cc | 119 using ceres::Problem;
145 Problem problem; local
150 problem.AddResidualBlock(cost_function, NULL, &m, &c);
158 Solve(options, &problem, &summary);
|
| simple_bundle_adjuster.cc | 190 // Create residuals for each observation in the bundle adjustment problem. The
192 ceres::Problem problem; local
201 problem.AddResidualBlock(cost_function,
215 ceres::Solve(options, &problem, &summary);
|
| /external/ceres-solver/internal/ceres/ |
| covariance_impl.cc | 104 ProblemImpl* problem) {
105 problem_ = problem;
108 is_valid_ = (ComputeCovarianceSparsity(covariance_blocks, problem) &&
256 ProblemImpl* problem) {
262 problem->GetParameterBlocks(&all_parameter_blocks);
263 const ProblemImpl::ParameterMap& parameter_map = problem->parameter_map();
288 problem->ParameterBlockLocalSize(parameter_block);
308 const int size1 = problem->ParameterBlockLocalSize(block_pair.first);
309 const int size2 = problem->ParameterBlockLocalSize(block_pair.second);
357 const int row_block_size = problem->ParameterBlockLocalSize(row_block)
[all...] |
| dense_sparse_matrix_test.cc | 72 scoped_ptr<LinearLeastSquaresProblem> problem(
75 CHECK_NOTNULL(problem.get());
77 tsm.reset(down_cast<TripletSparseMatrix*>(problem->A.release()));
|
| partitioned_matrix_view_test.cc | 52 scoped_ptr<LinearLeastSquaresProblem> problem(
54 CHECK_NOTNULL(problem.get());
55 A_.reset(problem->A.release());
59 num_eliminate_blocks_ = problem->num_eliminate_blocks;
|
| solver.cc | 35 #include "ceres/problem.h"
67 Problem* problem,
71 CHECK_NOTNULL(problem)->problem_impl_.get();
78 Problem* problem,
81 solver.Solve(options, problem, summary);
|
| /external/chromium_org/chrome/renderer/resources/extensions/ |
| image_util.js | 14 callbacks.onerror({ problem: 'could_not_load', path: path });
21 callbacks.onerror({ problem: 'image_size_invalid', path: path});
50 callbacks.onerror({ problem: 'data_url_unavailable', path: path });
|
| /external/chromium/chrome/common/ |
| metrics_helpers.cc | 494 void MetricsServiceBase::InconsistencyDetected(int problem) {
496 problem, Histogram::NEVER_EXCEEDED_VALUE);
499 void MetricsServiceBase::UniqueInconsistencyDetected(int problem) {
501 problem, Histogram::NEVER_EXCEEDED_VALUE);
575 int problem = static_cast<int>(discrepancy); local
576 if (problem != discrepancy)
577 problem = INT_MAX;
578 SnapshotProblemResolved(problem);
|
| /external/clang/test/Analysis/inlining/ |
| path-notes.cpp | 173 int problem = 1 / getZero(); // expected-warning {{Division by zero}} local
180 int problem = 1 / getZeroByRef(); // expected-warning {{Division by zero}} local
[all...] |
| /external/llvm/lib/CodeGen/ |
| RegAllocPBQP.cpp | 12 // problem representing the register allocation problem under consideration,
85 /// PBQP based allocators solve the register allocation problem by mapping
146 /// \brief Given a solved PBQP problem maps this solution back to a register
148 bool mapPBQPToRegAlloc(const PBQPRAProblem &problem,
253 // Record the mapping and allowed set in the problem.
469 bool RegAllocPBQP::mapPBQPToRegAlloc(const PBQPRAProblem &problem,
477 const PBQP::Graph &g = problem.getGraph();
483 unsigned vreg = problem.getVRegForNode(node);
486 if (problem.isPRegOption(vreg, alloc))
[all...] |
| /external/dnsmasq/src/ |
| option.c | 671 char *comma = NULL, *problem = NULL; local
735 problem = _("bad dhcp-option");
792 problem = _("bad IP address");
891 problem = _("bad domain in dhcp-option");
950 problem = _("dhcp-option too long");
952 if (!problem)
959 problem = _("illegal dhcp-match");
973 return problem;
981 char *comma, *problem = NULL;; local
[all...] |
| /external/e2fsprogs/e2fsck/ |
| Makefile.in | 66 dx_dirinfo.o ehandler.o problem.o message.o recovery.o region.o \
74 profiled/message.o profiled/problem.o \
99 $(srcdir)/problem.c \
138 tst_problem: $(srcdir)/problem.c $(srcdir)/problem.h $(LIBEXT2FS) \
141 $(srcdir)/problem.c -DUNITTEST $(LIBEXT2FS) $(LIBCOM_ERR)
277 $(srcdir)/profile.h prof_err.h $(srcdir)/problem.h
293 $(srcdir)/profile.h prof_err.h $(srcdir)/problem.h
300 $(srcdir)/profile.h prof_err.h $(srcdir)/problem.h
307 $(srcdir)/profile.h prof_err.h $(srcdir)/problem.h $(srcdir)/dict.
[all...] |
| pass1.c | 50 #include "problem.h"
151 * for devices. (And that's when the problem is caused, since
277 int problem = 0; local
301 problem = PR_1_ATTR_NAME_LEN;
311 problem = PR_1_ATTR_VALUE_SIZE;
318 problem = PR_1_ATTR_VALUE_BLOCK;
328 problem = PR_1_ATTR_HASH;
341 if (problem == 0 || !fix_problem(ctx, problem, pctx))
888 int problem = 0 local
1683 errcode_t problem; local
2129 int problem = 0; local
[all...] |
| /external/bison/lib/ |
| argmatch.h | 57 ptrdiff_t problem);
61 # define invalid_arg(Context, Value, Problem) \
62 argmatch_invalid (Context, Value, Problem)
|
| argmatch.c | 128 PROBLEM is the return value from argmatch. */
131 argmatch_invalid (const char *context, const char *value, ptrdiff_t problem)
133 char const *format = (problem == -1
|
| /external/chromium_org/third_party/WebKit/Tools/GardeningServer/styles/ |
| notifications.css | 73 ol.notifications ul.causes>li, ol.notifications div.problem {
77 ol.notifications ul.causes div.description, ol.notifications div.problem ul.effects {
81 ol.notifications>li div.problem {
85 ol.notifications>li div.problem>ul.actions {
89 ol.notifications>li:hover div.problem>ul.actions {
|
| /external/ceres-solver/include/ceres/ |
| solver.h | 46 class Problem;
59 // Default constructor that sets up a generic sparse problem.
148 // is contracted and the model optimization problem is solved
177 // maximum rank. The best choice usually requires some problem
196 // performance for certain classes of problem, which is why it is disabled
198 // sensitivity of the problem to different parameters varies significantly,
222 // Solving the line search problem exactly is computationally
508 // e.g., consider the following regression problem
519 // eliminate the variables a_1 and a_2 from the problem all
521 // squares problem and the most famous algorithm for solving the
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/scsi/ |
| sg.h | 123 char problem; /* 0 -> no problem detected, 1 -> error to report */ member in struct:sg_req_info
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/scsi/ |
| sg.h | 123 char problem; /* 0 -> no problem detected, 1 -> error to report */ member in struct:sg_req_info
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/scsi/ |
| sg.h | 123 char problem; /* 0 -> no problem detected, 1 -> error to report */ member in struct:sg_req_info
|
| /external/bouncycastle/ |
| import_bouncycastle.sh | 246 problem=0
250 problem=1
253 if [ $problem = 1 ]; then
|
| /dalvik/dexgen/src/com/android/dexgen/dex/file/ |
| DebugInfoDecoder.java | 522 boolean problem = false;
556 problem = true;
563 problem = true;
577 problem = true;
584 if (problem) {
589 throw new RuntimeException("local table problem");
|
