| /external/icu4c/layout/ |
| GlyphPositionAdjustments.h | 26 class Adjustment : public UMemory {
29 inline Adjustment();
30 inline Adjustment(float xPlace, float yPlace, float xAdv, float yAdv, le_int32 baseOff = -1);
31 inline ~Adjustment();
97 Adjustment *fAdjustments;
140 inline GlyphPositionAdjustments::Adjustment::Adjustment()
146 inline GlyphPositionAdjustments::Adjustment::Adjustment(float xPlace, float yPlace, float xAdv, float yAdv, le_int32 baseOff)
152 inline GlyphPositionAdjustments::Adjustment::~Adjustment(
[all...] |
| GlyphPositionAdjustments.cpp | 22 fAdjustments = (Adjustment *) new Adjustment[glyphCount];
|
| /external/clang/lib/StaticAnalyzer/Core/ |
| SimpleConstraintManager.h | 58 const llvm::APSInt& Adjustment) = 0;
62 const llvm::APSInt& Adjustment) = 0;
66 const llvm::APSInt& Adjustment) = 0;
70 const llvm::APSInt& Adjustment) = 0;
74 const llvm::APSInt& Adjustment) = 0;
78 const llvm::APSInt& Adjustment) = 0;
|
| SimpleConstraintManager.cpp | 217 static void computeAdjustment(SymbolRef &Sym, llvm::APSInt &Adjustment) {
223 Adjustment = APSIntType(Adjustment).convert(SE->getRHS());
225 // Don't forget to negate the adjustment if it's being subtracted.
229 Adjustment = -Adjustment;
247 // The adjustment is "constant1" in the above expression. It's used to
251 // the subclasses of SimpleConstraintManager to handle the adjustment.
253 llvm::APSInt Adjustment = WraparoundType.getZeroValue();
254 computeAdjustment(Sym, Adjustment);
[all...] |
| RangeConstraintManager.cpp | 293 const llvm::APSInt& Adjustment);
297 const llvm::APSInt& Adjustment);
301 const llvm::APSInt& Adjustment);
305 const llvm::APSInt& Adjustment);
309 const llvm::APSInt& Adjustment);
313 const llvm::APSInt& Adjustment);
419 const llvm::APSInt &Adjustment) {
421 APSIntType AdjustmentType(Adjustment);
425 llvm::APSInt Lower = AdjustmentType.convert(Int) - Adjustment;
430 // [Int-Adjustment+1, Int-Adjustment-1
[all...] |
| /external/chromium/base/ |
| utf_offset_string_conversions.h | 72 // Adjustment function called by std::transform which will adjust any offset
76 // AdjustOffset(adjustments). Each Adjustment gives the original |location|
82 struct Adjustment {
83 Adjustment(size_t location, size_t old_length, size_t new_length);
90 typedef std::vector<Adjustment> Adjustments;
|
| utf_offset_string_conversions_unittest.cc | 123 adjustments.push_back(AdjustOffset::Adjustment(3, 3, 1));
135 adjustments.push_back(AdjustOffset::Adjustment(0, 3, 1));
136 adjustments.push_back(AdjustOffset::Adjustment(4, 4, 2));
137 adjustments.push_back(AdjustOffset::Adjustment(10, 7, 4));
138 adjustments.push_back(AdjustOffset::Adjustment(20, 3, 1));
152 adjustments.push_back(AdjustOffset::Adjustment(0, 3, 0));
153 adjustments.push_back(AdjustOffset::Adjustment(4, 4, 4));
154 adjustments.push_back(AdjustOffset::Adjustment(11, 3, 3));
155 adjustments.push_back(AdjustOffset::Adjustment(15, 2, 0));
|
| utf_offset_string_conversions.cc | 53 adjustments.push_back(AdjustOffset::Adjustment(
58 // Make offset adjustment.
214 AdjustOffset::Adjustment::Adjustment(size_t location,
227 size_t adjustment = 0;
241 adjustment += (i->old_length - i->new_length);
243 offset -= adjustment;
|
| /external/libvpx/libvpx/vp8/encoder/ |
| ratectrl.c | 177 /* % adjustment to target kf size based on seperation from previous frame */
398 /* adjustment up based on q: this factor ranges from ~1.2 to 2.2. */
401 /* frame separation adjustment ( down) */
617 int Adjustment;
661 /* Make rate adjustment to recover bits spent in key frame
667 Adjustment = (cpi->kf_bitrate_adjustment <= cpi->kf_overspend_bits) ? cpi->kf_bitrate_adjustment : cpi->kf_overspend_bits;
669 if (Adjustment > (cpi->per_frame_bandwidth - min_frame_target))
670 Adjustment = (cpi->per_frame_bandwidth - min_frame_target);
672 cpi->kf_overspend_bits -= Adjustment;
678 cpi->this_frame_target = cpi->per_frame_bandwidth - Adjustment;
[all...] |
| onyx_if.c | [all...] |
| /external/llvm/include/llvm/MC/ |
| MCDwarf.h | 354 createAdjustCfaOffset(MCSymbol *L, int Adjustment) {
355 return MCCFIInstruction(OpAdjustCfaOffset, L, 0, Adjustment, "");
|
| MCStreamer.h | 565 virtual void EmitCFIAdjustCfaOffset(int64_t Adjustment);
|
| /external/clang/lib/AST/ |
| VTableBuilder.cpp | 285 // No adjustment needed.
308 // No adjustment needed.
834 /// (Used for computing 'this' pointer adjustment thunks.
[all...] |
| ExprConstant.cpp | [all...] |
| /external/llvm/lib/MC/ |
| MCStreamer.cpp | 279 void MCStreamer::EmitCFIAdjustCfaOffset(int64_t Adjustment) {
282 MCCFIInstruction::createAdjustCfaOffset(Label, Adjustment);
|
| MCAsmStreamer.cpp | 235 virtual void EmitCFIAdjustCfaOffset(int64_t Adjustment);
[all...] |
| /external/clang/lib/CodeGen/ |
| CGExpr.cpp | 334 SubobjectAdjustment &Adjustment = Adjustments[I-1];
335 switch (Adjustment.Kind) {
339 Adjustment.DerivedToBase.DerivedClass,
340 Adjustment.DerivedToBase.BasePath->path_begin(),
341 Adjustment.DerivedToBase.BasePath->path_end(),
347 LV = CGF.EmitLValueForField(LV, Adjustment.Field);
355 QualType T = Adjustment.Field->getType().getNonReferenceType()
359 Adjustment.Field->getType());
365 llvm::Value *Ptr = CGF.EmitScalarExpr(Adjustment.Ptr.RHS);
367 CGF, Object, Ptr, Adjustment.Ptr.MPT)
[all...] |
| /external/ceres-solver/docs/ |
| bundleadjustment.tex | 2 \chapter{Bundle Adjustment}
4 One of the main reasons for writing Ceres was our need to solve large scale bundle adjustment problems~\cite{hartley-zisserman-book-2004,triggs-etal-1999}.
6 Given a set of measured image feature locations and correspondences, the goal of bundle adjustment is to find 3D point positions and camera parameters that minimize the reprojection error. This optimization problem is usually formulated as a non-linear least squares problem, where the error is the squared $L_2$ norm of the difference between the observed feature location and the projection of the corresponding 3D point on the image plane of the camera. Ceres has extensive support for solving bundle adjustment problems.
69 Given this functor, the bundle adjustment problem can be constructed as follows:
71 // Create residuals for each observation in the bundle adjustment problem. The
89 Again note that that the problem construction for bundle adjustment is very similar to the curve fitting example.
91 One way to solve this problem is to set \texttt{Solver::Options::linear\_solver\_type} to \texttt{SPARSE\_NORMAL\_CHOLESKY} and call \texttt{Solve}. And while this is a reasonable thing to do, bundle adjustment problems have a special sparsity structure that can be exploited to solve them much more efficiently. Ceres provides three specialized solvers (collectively known as Schur based solvers) for this task. The example code uses the simplest of them \texttt{DENSE\_SCHUR}.
101 For a more sophisticated bundle adjustment example which demonstrates the use of Ceres' more advanced features including its various linear solvers, robust loss functions and local parameterizations see \texttt{examples/bundle\_adjuster.cc}.
|
| /external/chromium/net/base/ |
| net_util.cc | [all...] |
| /external/llvm/lib/MC/MCParser/ |
| AsmParser.cpp | [all...] |
