File: TerminatedArrayBuilder.h

package info (click to toggle)
chromium-browser 57.0.2987.98-1~deb8u1
  • links: PTS, VCS
  • area: main
  • in suites: jessie
  • size: 2,637,852 kB
  • ctags: 2,544,394
  • sloc: cpp: 12,815,961; ansic: 3,676,222; python: 1,147,112; asm: 526,608; java: 523,212; xml: 286,794; perl: 92,654; sh: 86,408; objc: 73,271; makefile: 27,698; cs: 18,487; yacc: 13,031; tcl: 12,957; pascal: 4,875; ml: 4,716; lex: 3,904; sql: 3,862; ruby: 1,982; lisp: 1,508; php: 1,368; exp: 404; awk: 325; csh: 117; jsp: 39; sed: 37
file content (78 lines) | stat: -rw-r--r-- 2,127 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
// Copyright 2014 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#ifndef TerminatedArrayBuilder_h
#define TerminatedArrayBuilder_h

#include "wtf/Allocator.h"

namespace WTF {

template <typename T, template <typename> class ArrayType = TerminatedArray>
class TerminatedArrayBuilder {
  STACK_ALLOCATED();
  WTF_MAKE_NONCOPYABLE(TerminatedArrayBuilder);

 public:
  explicit TerminatedArrayBuilder(
      typename ArrayType<T>::Allocator::PassPtr array)
      : m_array(array), m_count(0), m_capacity(0) {
    if (!m_array)
      return;
    m_capacity = m_count = m_array->size();
    DCHECK(m_array->at(m_count - 1).isLastInArray());
  }

  void grow(size_t count) {
    DCHECK(count);
    if (!m_array) {
      DCHECK(!m_count);
      DCHECK(!m_capacity);
      m_capacity = count;
      m_array = ArrayType<T>::Allocator::create(m_capacity);
    } else {
      DCHECK(m_array->at(m_count - 1).isLastInArray());
      m_capacity += count;
      m_array = ArrayType<T>::Allocator::resize(
          ArrayType<T>::Allocator::release(m_array), m_capacity);
      m_array->at(m_count - 1).setLastInArray(false);
    }
    m_array->at(m_capacity - 1).setLastInArray(true);
  }

  void append(const T& item) {
    RELEASE_ASSERT(m_count < m_capacity);
    DCHECK(!item.isLastInArray());
    m_array->at(m_count++) = item;
    if (m_count == m_capacity)
      m_array->at(m_capacity - 1).setLastInArray(true);
  }

  typename ArrayType<T>::Allocator::PassPtr release() {
    RELEASE_ASSERT(m_count == m_capacity);
    assertValid();
    return ArrayType<T>::Allocator::release(m_array);
  }

 private:
#if DCHECK_IS_ON()
  void assertValid() {
    for (size_t i = 0; i < m_count; ++i) {
      bool isLastInArray = (i + 1 == m_count);
      DCHECK_EQ(m_array->at(i).isLastInArray(), isLastInArray);
    }
  }
#else
  void assertValid() {}
#endif

  typename ArrayType<T>::Allocator::Ptr m_array;
  size_t m_count;
  size_t m_capacity;
};

}  // namespace WTF

using WTF::TerminatedArrayBuilder;

#endif  // TerminatedArrayBuilder_h