Searched defs:vector (Results 151 - 175 of 276) sorted by relevance

1234567891011>>

/external/freetype/src/base/
H A Dftoutln.c682 FT_Vector_Transform( FT_Vector* vector, argument
688 if ( !vector || !matrix )
691 xz = FT_MulFix( vector->x, matrix->xx ) +
692 FT_MulFix( vector->y, matrix->xy );
694 yz = FT_MulFix( vector->x, matrix->yx ) +
695 FT_MulFix( vector->y, matrix->yy );
697 vector->x = xz;
698 vector->y = yz;
944 /* compute incoming normalized vector */
961 /* compute outgoing normalized vector */
[all...]
/external/ksoap2/ksoap2-base/src/main/java/org/ksoap2/serialization/
H A DSoapSerializationEnvelope.java711 protected void writeVectorBody(XmlSerializer writer, Vector vector, PropertyInfo elementType) argument
725 int cnt = vector.size();
737 if (vector.elementAt(i) == null) {
745 writeProperty(writer, vector.elementAt(i), elementType);
/external/openfst/src/include/fst/
H A Drelabel.h30 #include <vector>
31 using std::vector;
45 // new labels are specified using a vector of pair<Label,Label>.
50 // \param ipairs vector of input label pairs indicating old to new mapping
51 // \param opairs vector of output label pairs indicating old to new mapping
56 const vector<pair<typename A::Label, typename A::Label> >& ipairs,
57 const vector<pair<typename A::Label, typename A::Label> >& opairs) {
144 vector<pair<Label, Label> > ipairs;
157 vector<pair<Label, Label> > opairs;
170 // call relabel using vector o
212 RelabelFstImpl(const Fst<A>& fst, const vector<pair<Label, Label> >& ipairs, const vector<pair<Label, Label> >& opairs, const RelabelFstOptions &opts) argument
398 RelabelFst(const Fst<A>& fst, const vector<pair<Label, Label> >& ipairs, const vector<pair<Label, Label> >& opairs) argument
403 RelabelFst(const Fst<A>& fst, const vector<pair<Label, Label> >& ipairs, const vector<pair<Label, Label> >& opairs, const RelabelFstOptions &opts) argument
[all...]
H A Dsymbol-table.h29 #include <vector>
30 using std::vector;
51 SymbolTableReadOptions(vector<pair<int64, int64> > string_hash_ranges_,
56 vector<pair<int64, int64> > string_hash_ranges;
193 vector<const char *> symbols_;
503 // Relabels a symbol table as specified by the input vector of pairs
510 const vector<pair<Label, Label> > &pairs) {
509 RelabelSymbolTable(const SymbolTable *table, const vector<pair<Label, Label> > &pairs) argument
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/base/
H A Dftoutln.c680 FT_Vector_Transform( FT_Vector* vector, argument
686 if ( !vector || !matrix )
689 xz = FT_MulFix( vector->x, matrix->xx ) +
690 FT_MulFix( vector->y, matrix->xy );
692 yz = FT_MulFix( vector->x, matrix->yx ) +
693 FT_MulFix( vector->y, matrix->yy );
695 vector->x = xz;
696 vector->y = yz;
941 /* compute incoming normalized vector */
958 /* compute outgoing normalized vector */
[all...]
/external/valgrind/main/include/vki/
H A Dvki-xen-x86.h87 vki_uint8_t vector; /* exception vector */ member in struct:vki_xen_trap_info
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3collections.h203 pANTLR3_VECTOR vector; member in struct:ANTLR3_STACK_struct
218 /* Structure that represents a vector element
228 /* Structure that represents a vector collection. A vector is a simple list
237 /** Array of pointers to vector elements
245 /** Many times, a vector holds just a few nodes in an AST and it
255 * case only the factory can free the memory for the actual vector,
256 * though the vector free function is called and will recurse through its
265 void (ANTLR3_CDECL *free) (struct ANTLR3_VECTOR_struct * vector);
266 void (*del) (struct ANTLR3_VECTOR_struct * vector, ANTLR3_UINT3
[all...]
/external/bison/src/
H A Dtables.c38 We call such an index a `vector'; i.e., a vector is either a state
103 new vector number of VECTOR. We skip `empty' vectors (i.e.,
628 matching_state (vector_number vector) argument
630 vector_number i = order[vector];
651 for (prev = vector - 1; prev >= 0; prev--)
676 pack_vector (vector_number vector) argument
678 vector_number i = order[vector];
705 for (k = 0; ok && k < vector; k++)
/external/chromium_org/chrome/browser/chromeos/
H A Dboot_times_loader.cc7 #include <vector>
259 std::vector<TimeMarker> login_times) {
266 // vector (on the UI thread) in a different order from which they were
454 void BootTimesLoader::AddMarker(std::vector<TimeMarker>* vector, argument
462 vector->push_back(marker);
465 // Note that it's safe to use an unretained pointer to the vector because
470 base::Unretained(vector),
/external/chromium_org/content/renderer/gpu/
H A Dgpu_benchmarking_extension.cc54 std::vector<unsigned char> vector; local
55 if (gfx::PNGCodec::EncodeBGRASkBitmap(bm, false, &vector)) {
56 return SkData::NewWithCopy(&vector.front() , vector.size());
760 const std::vector<unsigned char>& png) {
/external/chromium_org/content/renderer/media/webrtc/
H A Dmock_peer_connection_dependency_factory.cc36 static typename V::iterator FindTrack(V* vector, argument
38 typename V::iterator it = vector->begin();
39 for (; it != vector->end(); ++it) {
231 for (std::vector<ObserverInterface*>::iterator it = observers_.begin();
241 std::vector<ObserverInterface*> observers(observers_);
242 for (std::vector<ObserverInterface*>::iterator it = observers.begin();
/external/chromium_org/net/quic/crypto/
H A Dstrike_register.cc16 using std::vector;
307 vector<pair<unsigned, bool> > bits;
447 const vector<pair<unsigned, bool> >& bits,
498 for (vector<pair<unsigned, bool> >::const_iterator i = bits.begin();
509 vector<pair<unsigned, bool> > new_bits(bits);
444 ValidateTree( uint32 internal_node, int last_bit, const vector<pair<unsigned, bool> >& bits, const set<uint32>& free_internal_nodes, const set<uint32>& free_external_nodes, set<uint32>* used_internal_nodes, set<uint32>* used_external_nodes) argument
/external/chromium_org/third_party/WebKit/Source/core/html/parser/
H A DXSSAuditor.cpp128 bool threadSafeMatch(const Vector<UChar, inlineCapacity>& vector, const QualifiedName& qname) argument
130 return equalIgnoringNullity(vector, qname.localName().impl());
219 // injected vector. Excluding the terminating character covers common cases
222 // Generally, these won't parse as javascript, so the injected vector
225 // closing punctuation. Since the snippet has not been parsed, the vector
/external/chromium_org/third_party/WebKit/Source/core/rendering/svg/
H A DSVGInlineTextBox.cpp53 Vector<SVGTextFragment> vector; member in struct:blink::ExpectedSVGInlineTextBoxSize
/external/chromium_org/third_party/WebKit/Source/wtf/text/
H A DWTFString.h101 // Construct a string by copying the contents of a vector.
104 // NOTE: This is different from String(vector.data(), vector.size())
105 // which will sometimes return a null string when vector.data() is null
485 String::String(const Vector<UChar, inlineCapacity>& vector) argument
486 : m_impl(vector.size() ? StringImpl::create(vector.data(), vector.size()) : StringImpl::empty())
546 inline void append(Vector<UChar, inlineCapacity>& vector, const String& string) argument
553 vector
562 appendNumber(Vector<CharacterType>& vector, unsigned char number) argument
[all...]
/external/chromium_org/third_party/icu/source/common/
H A Drbbitblb.cpp185 // The rule builder has a global vector of status values that are common
825 // The rule builder has a global vector of status values that are common
915 // sortedAdd Add a value to a vector of sorted values (ints).
918 // Lazily create the vector if it does not already exist.
921 void RBBITableBuilder::sortedAdd(UVector **vector, int32_t val) { argument
924 if (*vector == NULL) {
925 *vector = new UVector(*fStatus);
927 if (*vector == NULL || U_FAILURE(*fStatus)) {
930 UVector *vec = *vector;
935 // The value is already in the vector
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_target.h152 unsigned int vector : 1; member in struct:nv50_ir::Target::OpInfo
/external/chromium_org/v8/src/
H A Djson-stringifier.h74 Vector<Char> vector,
306 Vector<Char> vector,
312 final_size += SerializeStringUnchecked_(vector.start(),
314 vector.length());
793 Vector<const Char> vector = GetCharVector<Char>(string); local
796 vector.start(),
801 vector.start(),
807 Vector<const Char> vector(NULL, 0);
809 // If GC moved the string, we need to refresh the vector.
813 vector
305 StringifyString_(Isolate* isolate, Vector<Char> vector, Handle<String> result) argument
[all...]
/external/clang/test/SemaTemplate/
H A Ddependent-names.cpp138 template<typename T> struct vector {}; struct in namespace:std::inner
140 using inner::vector;
237 std::ostream &print(std::ostream &out, std::vector<ns2::Data>); // expected-note {{should be declared prior to the call site or in namespace 'PR10053::my_file2_a::ns2'}}
243 Dump(std::vector<ns2::Data>()); // expected-note {{requested here}}
/external/icu/icu4c/source/common/
H A Drbbitblb.cpp185 // The rule builder has a global vector of status values that are common
825 // The rule builder has a global vector of status values that are common
915 // sortedAdd Add a value to a vector of sorted values (ints).
918 // Lazily create the vector if it does not already exist.
921 void RBBITableBuilder::sortedAdd(UVector **vector, int32_t val) { argument
924 if (*vector == NULL) {
925 *vector = new UVector(*fStatus);
927 if (*vector == NULL || U_FAILURE(*fStatus)) {
930 UVector *vec = *vector;
935 // The value is already in the vector
[all...]
/external/mesa3d/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_target.h152 unsigned int vector : 1; member in struct:nv50_ir::Target::OpInfo
/external/mtpd/
H A Dl2tp.c238 uint8_t *vector = NULL; local
256 vector = p->value;
270 if (!secret || !vector || length < 2) {
281 MD5_Update(&ctx, vector, vector_length);
/external/openfst/src/include/fst/extensions/pdt/
H A Dcompose.h296 const vector<pair<Label, Label> > *parens = 0,
299 parens_(parens ? *parens : vector<pair<Label, Label> >()),
407 vector<pair<Label, Label> > parens_;
433 const vector<pair<Label, Label> > &parens,
463 const vector<pair<Label, Label> > &parens,
496 const vector<pair<typename Arc::Label,
520 const vector<pair<typename Arc::Label,
294 ParenFilter(const FST1 &fst1, const FST2 &fst2, Matcher1 *matcher1 = 0, Matcher2 *matcher2 = 0, const vector<pair<Label, Label> > *parens = 0, bool expand = false, bool keep_parens = true) argument
432 PdtComposeFstOptions(const Fst<Arc> &ifst1, const vector<pair<Label, Label> > &parens, const Fst<Arc> &ifst2, bool expand = false, bool keep_parens = true) argument
461 PdtComposeFstOptions(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2, const vector<pair<Label, Label> > &parens, bool expand = false, bool keep_parens = true) argument
H A Dparen.h144 const vector<pair<Label, Label> > &parens, bool close)
211 vector< set<StateId> > *state_sets) const;
214 const vector<pair<Label, Label> > &parens_; // Paren ID -> Labels
219 vector<char> state_color_; // DFS state
278 vector< set<StateId> > state_sets(parens_.size());
311 vector<StateId> state_set;
332 vector< set<StateId> > *state_sets) const {
414 vector<StateId> close_sources;
427 typename vector<StateId>::iterator unique_end =
143 PdtParenReachable(const Fst<A> &fst, const vector<pair<Label, Label> > &parens, bool close) argument
/external/pixman/pixman/
H A Dpixman-matrix.c207 /* input vector values must have no more than 31 bits (including sign)
313 /* input vector values must have no more than 31 bits (including sign)
345 /* input vector values must have no more than 31 bits (including sign)
383 struct pixman_vector * vector)
386 tmp.v[0] = vector->vector[0];
387 tmp.v[1] = vector->vector[1];
388 tmp.v[2] = vector->vector[
382 pixman_transform_point_3d(const struct pixman_transform *transform, struct pixman_vector * vector) argument
402 pixman_transform_point(const struct pixman_transform *transform, struct pixman_vector * vector) argument
[all...]

Completed in 527 milliseconds

1234567891011>>