/frameworks/ml/bordeaux/learning/multiclass_pa/native/ |
H A D | multiclass_pa.h | 24 #include <vector> 47 // Computes the score of a given input vector for a given parameter 48 // vector, by computing the dot product between the two. 49 float Score(const std::vector<float>& inputs, 50 const std::vector<float>& parameters) const; 51 float SparseScore(const std::vector<std::pair<int, float> >& inputs, 52 const std::vector<float>& parameters) const; 55 float L2NormSquare(const std::vector<float>& inputs) const; 56 float SparseL2NormSquare(const std::vector<std::pair<int, float> >& inputs) const; 61 virtual float TrainOneExample(const std::vector<floa [all...] |
H A D | multiclass_pa.cpp | 24 using std::vector; 68 float MulticlassPA::Score(const vector<float>& inputs, 69 const vector<float>& parameters) const { 78 float MulticlassPA::SparseScore(const vector<pair<int, float> >& inputs, argument 79 const vector<float>& parameters) const { 89 float MulticlassPA::L2NormSquare(const vector<float>& inputs) const { 98 const vector<pair<int, float> >& inputs) const { 106 float MulticlassPA::TrainOneExample(const vector<float>& inputs, int target) { 139 const vector<pair<int, float> >& inputs, int target) { 171 float MulticlassPA::Train(const vector<pai argument 97 SparseL2NormSquare( const vector<pair<int, float> >& inputs) const argument 138 SparseTrainOneExample( const vector<pair<int, float> >& inputs, int target) argument 183 SparseTrain( const vector<pair<vector<pair<int, float> >, int> >& data, int num_iterations) argument 210 SparseGetClass(const vector<pair<int, float> >& inputs) argument 224 Test(const vector<pair<vector<float>, int> >& data) argument 236 SparseTest( const vector<pair<vector<pair<int, float> >, int> >& data) argument [all...] |
/frameworks/native/libs/utils/tests/ |
H A D | Vector_test.cpp | 40 Vector<int> vector; local 42 vector.setCapacity(8); 44 vector.add(1); 45 vector.add(2); 46 vector.add(3); 48 EXPECT_EQ(vector.size(), 3); 50 // copy the vector 51 other = vector; 55 // add an element to the first vector 56 vector [all...] |
/frameworks/base/tools/aidl/ |
H A D | search_path.h | 7 #include <vector> 19 void set_import_paths(const vector<string>& importPaths);
|
H A D | options.h | 6 #include <vector> 20 vector<string> importPaths; 21 vector<string> preprocessedFiles; 28 vector<string> filesToPreprocess;
|
H A D | search_path.cpp | 10 static vector<string> g_importPaths; 13 set_import_paths(const vector<string>& importPaths) 32 vector<string>& paths = g_importPaths; 33 for (vector<string>::iterator it=paths.begin(); it!=paths.end(); it++) {
|
/frameworks/compile/libbcc/lib/Core/ |
H A D | BCCContextImpl.cpp | 19 #include <vector> 31 std::vector<Source *> Sources(mOwnSources.begin(), mOwnSources.end());
|
/frameworks/base/libs/hwui/utils/ |
H A D | SortedListImpl.cpp | 84 ssize_t SortedListImpl::merge(const VectorImpl& vector) { argument 86 if (!vector.isEmpty()) { 87 const void* buffer = vector.arrayImpl(); 89 size_t s = vector.size(); 100 ssize_t SortedListImpl::merge(const SortedListImpl& vector) { argument 101 // we've merging a sorted vector... nice! 103 if (!vector.isEmpty()) { 105 if (do_compare(vector.itemLocation(vector.size() - 1), arrayImpl()) <= 0) { 106 err = VectorImpl::insertVectorAt(static_cast<const VectorImpl&> (vector), [all...] |
H A D | SortedListImpl.h | 36 ssize_t merge(const VectorImpl& vector); 37 ssize_t merge(const SortedListImpl& vector); 52 ssize_t insertVectorAt(const VectorImpl& vector, size_t index); 53 ssize_t appendVector(const VectorImpl& vector);
|
/frameworks/compile/linkloader/include/ |
H A D | ELFSectionStrTab.h | 23 #include <vector> 32 std::vector<char> buf;
|
H A D | ELFSectionRelTable.h | 24 #include <vector> 32 std::vector<ELFRelocTy *> table;
|
H A D | ELFSectionHeaderTable.h | 25 #include <vector> 34 std::vector<ELFSectionHeaderTy *> table;
|
/frameworks/base/core/java/android/gesture/ |
H A D | InstanceLearner.java | 44 ArrayList<Prediction> classify(int sequenceType, int orientationType, float[] vector) { argument 51 if (sample.vector.length != vector.length) { 56 distance = GestureUtils.minimumCosineDistance(sample.vector, vector, orientationType); 58 distance = GestureUtils.squaredEuclideanDistance(sample.vector, vector);
|
/frameworks/compile/libbcc/lib/Support/ |
H A D | TargetCompilerConfigs.cpp | 26 void ARMCompilerConfig::GetFeatureVector(std::vector<std::string> &pAttributes, 57 std::vector<std::string> attributes; 67 std::vector<std::string> attributes;
|
/frameworks/compile/mclinker/include/mcld/Support/ |
H A D | PositionDependentOption.h | 15 #include <vector> 65 typedef std::vector<PositionDependentOption*> PositionDependentOptions;
|
/frameworks/compile/libbcc/include/bcinfo/Wrap/ |
H A D | bitcode_wrapperer.h | 25 #include <vector> 180 std::vector<uint8_t> buffer_; 212 std::vector<BCHeaderField> header_fields_; 215 std::vector<uint8_t*> variable_field_data_;
|
/frameworks/ex/variablespeed/jni/ |
H A D | decode_buffer.h | 23 #include <vector> 49 // This vector isn't ideal because we perform a number of queue-like 52 // vector, and therefore it's not good enough to use a std::queue. 54 std::vector<int16*> data_;
|
H A D | ring_buffer.h | 20 #include <vector> 102 std::vector<int64> readers_;
|
/frameworks/compile/mclinker/include/mcld/LD/ |
H A D | EhFrame.h | 14 #include <vector> 39 typedef std::vector<CIE*> CIEListType; 40 typedef std::vector<FDE*> FDEListType; 107 typedef std::vector<Fragment*> FragListType;
|
H A D | LDContext.h | 15 #include <vector> 37 typedef std::vector<LDSection*> SectionTable; 41 typedef std::vector<LDSymbol*> SymbolTable;
|
/frameworks/compile/slang/ |
H A D | slang_rs.h | 25 #include <vector> 53 std::vector<std::string> mGeneratedFileNames; 140 const std::vector<std::string> &IncludePaths, 141 const std::vector<std::string> &AdditionalDepTargets,
|
H A D | slang_rs_reflection_base.h | 25 #include <vector> 56 std::vector< std::string > mText; 68 static bool writeFile(const std::string &filename, const std::vector< std::string > &txt);
|
/frameworks/compile/libbcc/bcinfo/BitReader_2_7/ |
H A D | BitcodeReader.h | 25 #include <vector> 41 std::vector<WeakVH> ValuePtrs; 44 /// information about them to this vector. This allows us to resolve them in 48 /// The key of this vector is the placeholder constant, the value is the slot 50 typedef std::vector<std::pair<Constant*, unsigned> > ResolveConstantsTy; 59 // vector compatibility methods 100 std::vector<WeakVH> MDValuePtrs; 106 // vector compatibility methods 139 std::vector<Type*> TypeList; 144 std::vector<st [all...] |
/frameworks/compile/libbcc/bcinfo/BitReader_3_0/ |
H A D | BitcodeReader.h | 25 #include <vector> 41 std::vector<WeakVH> ValuePtrs; 44 /// information about them to this vector. This allows us to resolve them in 48 /// The key of this vector is the placeholder constant, the value is the slot 50 typedef std::vector<std::pair<Constant*, unsigned> > ResolveConstantsTy; 59 // vector compatibility methods 100 std::vector<WeakVH> MDValuePtrs; 106 // vector compatibility methods 139 std::vector<Type*> TypeList; 144 std::vector<st [all...] |
/frameworks/base/media/mca/filterfw/native/core/ |
H A D | geometry.h | 20 #include <vector> 64 const std::vector<Point>& points() const { return points_; } 68 std::vector<Point> points_;
|