OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * Copyright (C) 2013 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 1677 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1688 { | 1688 { |
1689 } | 1689 } |
1690 | 1690 |
1691 template<size_t otherCapacity> | 1691 template<size_t otherCapacity> |
1692 HeapVector(const HeapVector<T, otherCapacity>& other) | 1692 HeapVector(const HeapVector<T, otherCapacity>& other) |
1693 : Vector<T, inlineCapacity, HeapAllocator>(other) | 1693 : Vector<T, inlineCapacity, HeapAllocator>(other) |
1694 { | 1694 { |
1695 } | 1695 } |
1696 | 1696 |
1697 template<typename U> | 1697 template<typename U> |
| 1698 void append(const U* data, size_t dataSize) |
| 1699 { |
| 1700 Vector<T, inlineCapacity, HeapAllocator>::append(data, dataSize); |
| 1701 } |
| 1702 |
| 1703 template<typename U> |
1698 void append(const U& other) | 1704 void append(const U& other) |
1699 { | 1705 { |
1700 Vector<T, inlineCapacity, HeapAllocator>::append(other); | 1706 Vector<T, inlineCapacity, HeapAllocator>::append(other); |
1701 } | 1707 } |
1702 | 1708 |
1703 template<typename U, size_t otherCapacity> | 1709 template<typename U, size_t otherCapacity> |
1704 void appendVector(const HeapVector<U, otherCapacity>& other) | 1710 void appendVector(const HeapVector<U, otherCapacity>& other) |
1705 { | 1711 { |
1706 const Vector<U, otherCapacity, HeapAllocator>& otherVector = other; | 1712 const Vector<U, otherCapacity, HeapAllocator>& otherVector = other; |
1707 Vector<T, inlineCapacity, HeapAllocator>::appendVector(otherVector); | 1713 Vector<T, inlineCapacity, HeapAllocator>::appendVector(otherVector); |
(...skipping 720 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2428 template<typename T, size_t inlineCapacity> | 2434 template<typename T, size_t inlineCapacity> |
2429 struct GCInfoTrait<HeapVector<T, inlineCapacity>> : public GCInfoTrait<Vector<T,
inlineCapacity, HeapAllocator>> { }; | 2435 struct GCInfoTrait<HeapVector<T, inlineCapacity>> : public GCInfoTrait<Vector<T,
inlineCapacity, HeapAllocator>> { }; |
2430 template<typename T, size_t inlineCapacity> | 2436 template<typename T, size_t inlineCapacity> |
2431 struct GCInfoTrait<HeapDeque<T, inlineCapacity>> : public GCInfoTrait<Deque<T, i
nlineCapacity, HeapAllocator>> { }; | 2437 struct GCInfoTrait<HeapDeque<T, inlineCapacity>> : public GCInfoTrait<Deque<T, i
nlineCapacity, HeapAllocator>> { }; |
2432 template<typename T, typename U, typename V> | 2438 template<typename T, typename U, typename V> |
2433 struct GCInfoTrait<HeapHashCountedSet<T, U, V>> : public GCInfoTrait<HashCounted
Set<T, U, V, HeapAllocator>> { }; | 2439 struct GCInfoTrait<HeapHashCountedSet<T, U, V>> : public GCInfoTrait<HashCounted
Set<T, U, V, HeapAllocator>> { }; |
2434 | 2440 |
2435 } // namespace blink | 2441 } // namespace blink |
2436 | 2442 |
2437 #endif // Heap_h | 2443 #endif // Heap_h |
OLD | NEW |