diff options
author | graehl <graehl@ec762483-ff6d-05da-a07a-a48fb63a330f> | 2010-07-06 22:06:30 +0000 |
---|---|---|
committer | graehl <graehl@ec762483-ff6d-05da-a07a-a48fb63a330f> | 2010-07-06 22:06:30 +0000 |
commit | dcf1b87a63cb9e38cd4f64f8148793ec7fd96cd8 (patch) | |
tree | ed46bed7670e04e15610048017c79fa77a77d734 /decoder | |
parent | 37070233d8768919bc70fa9bd8a33e04fbe661d3 (diff) |
warnings
git-svn-id: https://ws10smt.googlecode.com/svn/trunk@168 ec762483-ff6d-05da-a07a-a48fb63a330f
Diffstat (limited to 'decoder')
-rw-r--r-- | decoder/ff.cc | 2 | ||||
-rw-r--r-- | decoder/ff_ruleshape.cc | 12 |
2 files changed, 7 insertions, 7 deletions
diff --git a/decoder/ff.cc b/decoder/ff.cc index 95bd9665..7186d776 100644 --- a/decoder/ff.cc +++ b/decoder/ff.cc @@ -59,7 +59,7 @@ void SourceWordPenalty::TraversalFeaturesImpl(const SentenceMetadata& smeta, features->set_value(fid_, edge.rule_->FWords() * value_); } -ArityPenalty::ArityPenalty(const std::string& param) : +ArityPenalty::ArityPenalty(const std::string& /* param */) : value_(-1.0 / log(10)) { string fname = "Arity_X"; for (int i = 0; i < 10; ++i) { diff --git a/decoder/ff_ruleshape.cc b/decoder/ff_ruleshape.cc index d473704a..f56ccfa9 100644 --- a/decoder/ff_ruleshape.cc +++ b/decoder/ff_ruleshape.cc @@ -14,7 +14,7 @@ inline char BitAsChar(bool bit) { return (bit ? '1' : '0'); } -RuleShapeFeatures::RuleShapeFeatures(const string& param) { +RuleShapeFeatures::RuleShapeFeatures(const string& /* param */) { bool first = true; for (int i = 0; i < 32; ++i) { for (int j = 0; j < 32; ++j) { @@ -26,7 +26,7 @@ RuleShapeFeatures::RuleShapeFeatures(const string& param) { cur = &cur->next_[bit]; os << BitAsChar(bit); } - os << "_T"; + os << "_T"; for (int k = 0; k < 5; ++k) { bool bit = IsBitSet(j,k); cur = &cur->next_[bit]; @@ -38,12 +38,12 @@ RuleShapeFeatures::RuleShapeFeatures(const string& param) { } } -void RuleShapeFeatures::TraversalFeaturesImpl(const SentenceMetadata& smeta, +void RuleShapeFeatures::TraversalFeaturesImpl(const SentenceMetadata& /* smeta */, const Hypergraph::Edge& edge, - const vector<const void*>& ant_contexts, + const vector<const void*>& /* ant_contexts */, SparseVector<double>* features, - SparseVector<double>* estimated_features, - void* context) const { + SparseVector<double>* /* estimated_features */, + void* /* context */) const { const Node* cur = &fidtree_; TRule& rule = *edge.rule_; int pos = 0; // feature position |