| OLD | NEW |
| 1 // Copyright (c) 2006-2009 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2012 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 // Remember a subset of a sequence of values, using a modest amount of memory | 5 // Remember a subset of a sequence of values, using a modest amount of memory |
| 6 | 6 |
| 7 #ifndef ENCODINGS_COMPACT_LANG_DET_SUBSETSEQUENCE_H_ | 7 #ifndef ENCODINGS_COMPACT_LANG_DET_SUBSETSEQUENCE_H_ |
| 8 #define ENCODINGS_COMPACT_LANG_DET_SUBSETSEQUENCE_H_ | 8 #define ENCODINGS_COMPACT_LANG_DET_SUBSETSEQUENCE_H_ |
| 9 | 9 |
| 10 #include "encodings/compact_lang_det/win/cld_basictypes.h" | 10 #include "encodings/compact_lang_det/win/cld_basictypes.h" |
| 11 #include "encodings/compact_lang_det/win/cld_google.h" | 11 #include "encodings/compact_lang_det/win/cld_google.h" |
| (...skipping 23 matching lines...) Expand all Loading... |
| 35 uint8 seq_[kMaxSeq_]; | 35 uint8 seq_[kMaxSeq_]; |
| 36 uint8 count_[kMaxLevel_ + 1]; // +1 allows graceful overflow | 36 uint8 count_[kMaxLevel_ + 1]; // +1 allows graceful overflow |
| 37 | 37 |
| 38 DISALLOW_EVIL_CONSTRUCTORS(SubsetSequence); | 38 DISALLOW_EVIL_CONSTRUCTORS(SubsetSequence); |
| 39 | 39 |
| 40 // Require enough room to end up with 40 entries plus carrying space | 40 // Require enough room to end up with 40 entries plus carrying space |
| 41 COMPILE_ASSERT(kMaxSeq_ >= (kMaxLevel_ * 2 + 40), kMaxSeq__is_too_small); | 41 COMPILE_ASSERT(kMaxSeq_ >= (kMaxLevel_ * 2 + 40), kMaxSeq__is_too_small); |
| 42 }; | 42 }; |
| 43 | 43 |
| 44 #endif // ENCODINGS_COMPACT_LANG_DET_SUBSETSEQUENCE_H_ | 44 #endif // ENCODINGS_COMPACT_LANG_DET_SUBSETSEQUENCE_H_ |
| OLD | NEW |