| OLD | NEW |
| 1 // Copyright 2006-2008 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2008 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 10 matching lines...) Expand all Loading... |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 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_STRING_STREAM_H_ | 28 #ifndef V8_STRING_STREAM_H_ |
| 29 #define V8_STRING_STREAM_H_ | 29 #define V8_STRING_STREAM_H_ |
| 30 | 30 |
| 31 namespace v8 { namespace internal { | 31 namespace v8 { |
| 32 namespace internal { |
| 32 | 33 |
| 33 | 34 |
| 34 class StringAllocator { | 35 class StringAllocator { |
| 35 public: | 36 public: |
| 36 virtual ~StringAllocator() {} | 37 virtual ~StringAllocator() {} |
| 37 // Allocate a number of bytes. | 38 // Allocate a number of bytes. |
| 38 virtual char* allocate(unsigned bytes) = 0; | 39 virtual char* allocate(unsigned bytes) = 0; |
| 39 // Allocate a larger number of bytes and copy the old buffer to the new one. | 40 // Allocate a larger number of bytes and copy the old buffer to the new one. |
| 40 // bytes is an input and output parameter passing the old size of the buffer | 41 // bytes is an input and output parameter passing the old size of the buffer |
| 41 // and returning the new size. If allocation fails then we return the old | 42 // and returning the new size. If allocation fails then we return the old |
| (...skipping 146 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 188 bool full() const { return (capacity_ - length_) == 1; } | 189 bool full() const { return (capacity_ - length_) == 1; } |
| 189 int space() const { return capacity_ - length_; } | 190 int space() const { return capacity_ - length_; } |
| 190 | 191 |
| 191 DISALLOW_IMPLICIT_CONSTRUCTORS(StringStream); | 192 DISALLOW_IMPLICIT_CONSTRUCTORS(StringStream); |
| 192 }; | 193 }; |
| 193 | 194 |
| 194 | 195 |
| 195 } } // namespace v8::internal | 196 } } // namespace v8::internal |
| 196 | 197 |
| 197 #endif // V8_STRING_STREAM_H_ | 198 #endif // V8_STRING_STREAM_H_ |
| OLD | NEW |