| OLD | NEW |
| 1 // Copyright 2006-2009 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2009 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| (...skipping 12 matching lines...) Expand all Loading... |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
| 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | 27 |
| 28 #ifndef V8_LIST_INL_H_ | 28 #ifndef V8_LIST_INL_H_ |
| 29 #define V8_LIST_INL_H_ | 29 #define V8_LIST_INL_H_ |
| 30 | 30 |
| 31 #include "list.h" | 31 #include "list.h" |
| 32 | 32 |
| 33 namespace v8 { namespace internal { | 33 namespace v8 { |
| 34 namespace internal { |
| 34 | 35 |
| 35 | 36 |
| 36 template<typename T, class P> | 37 template<typename T, class P> |
| 37 void List<T, P>::Add(const T& element) { | 38 void List<T, P>::Add(const T& element) { |
| 38 if (length_ < capacity_) { | 39 if (length_ < capacity_) { |
| 39 data_[length_++] = element; | 40 data_[length_++] = element; |
| 40 } else { | 41 } else { |
| 41 List<T, P>::ResizeAdd(element); | 42 List<T, P>::ResizeAdd(element); |
| 42 } | 43 } |
| 43 } | 44 } |
| (...skipping 112 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 156 ASSERT(capacity >= 0); | 157 ASSERT(capacity >= 0); |
| 157 data_ = (capacity > 0) ? NewData(capacity) : NULL; | 158 data_ = (capacity > 0) ? NewData(capacity) : NULL; |
| 158 capacity_ = capacity; | 159 capacity_ = capacity; |
| 159 length_ = 0; | 160 length_ = 0; |
| 160 } | 161 } |
| 161 | 162 |
| 162 | 163 |
| 163 } } // namespace v8::internal | 164 } } // namespace v8::internal |
| 164 | 165 |
| 165 #endif // V8_LIST_INL_H_ | 166 #endif // V8_LIST_INL_H_ |
| OLD | NEW |