Searched refs:Hash (Results 1 - 7 of 7) sorted by relevance

/frameworks/ml/bordeaux/learning/stochastic_linear_ranker/native/
H A Dsparse_weight_vector.cpp34 template<class Key, class Hash>
35 bool SparseWeightVector<Key, Hash>::IsValid() const {
47 template<class Key, class Hash>
48 void SparseWeightVector<Key, Hash>::AdditiveWeightUpdate(
50 const SparseWeightVector<Key, Hash> &w1,
61 template<class Key, class Hash>
62 void SparseWeightVector<Key, Hash>::AdditiveSquaredWeightUpdate(
64 const SparseWeightVector<Key, Hash> &w1,
76 template<class Key, class Hash>
77 void SparseWeightVector<Key, Hash>
[all...]
H A Dstochastic_linear_ranker.cpp24 template<class Key, class Hash>
25 void StochasticLinearRanker<Key, Hash>::UpdateSubGradient(
26 const SparseWeightVector<Key, Hash> &positive,
27 const SparseWeightVector<Key, Hash> &negative,
32 SparseWeightVector<Key, Hash> gradient;
61 template<class Key, class Hash>
62 int StochasticLinearRanker<Key, Hash>::UpdateClassifier(
63 const SparseWeightVector<Key, Hash> &positive,
64 const SparseWeightVector<Key, Hash> &negative) {
67 SparseWeightVector<Key, Hash> weight_backu
[all...]
H A Dsparse_weight_vector.h36 template<class Key = std::string, class Hash = std::unordered_map<Key, double> >
39 typedef Hash Wmap;
46 explicit SparseWeightVector(const SparseWeightVector<Key, Hash> &other) {
49 void operator=(const SparseWeightVector<Key, Hash> &other) {
52 void CopyFrom(const SparseWeightVector<Key, Hash> &other) {
116 void LoadWeightVector(const SparseWeightVector<Key, Hash> &vec) {
133 const SparseWeightVector<Key, Hash> &w1,
136 const SparseWeightVector<Key, Hash> &w1,
139 const SparseWeightVector<Key, Hash> &w1,
141 void MultWeightUpdate(const SparseWeightVector<Key, Hash>
[all...]
H A Dstochastic_linear_ranker.h41 template<class Key = std::string, class Hash = std::unordered_map<std::string, double> >
169 void LoadWeights(const SparseWeightVector<Key, Hash> &model) {
173 void SaveWeights(SparseWeightVector<Key, Hash> *model) {
177 double ScoreSample(const SparseWeightVector<Key, Hash> &sample) {
201 int UpdateClassifier(const SparseWeightVector<Key, Hash> &positive,
202 const SparseWeightVector<Key, Hash> &negative);
205 SparseWeightVector<Key, Hash> weight_;
221 SparseWeightVector<Key, Hash> current_negative_;
235 void UpdateSubGradient(const SparseWeightVector<Key, Hash> &positive,
236 const SparseWeightVector<Key, Hash>
[all...]
/frameworks/av/media/libstagefright/foundation/
H A DAAtomizer.cpp41 size_t index = AAtomizer::Hash(name) % n;
57 uint32_t AAtomizer::Hash(const char *s) { function in class:android::AAtomizer
/frameworks/av/include/media/stagefright/foundation/
H A DAAtomizer.h44 static uint32_t Hash(const char *s);
/frameworks/compile/mclinker/include/mcld/LD/
H A DBranchIsland.h119 struct Hash { struct in class:mcld::BranchIsland::Key
159 typedef HashTable<StubEntryType, Key::Hash, EntryFactory<StubEntryType> >

Completed in 342 milliseconds