1544 lines
164 KiB
HTML
1544 lines
164 KiB
HTML
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
|
|
|
|
<html lang="en">
|
|
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
|
|
<title>LCOV - coverage.info - libtorch/include/c10/util/SmallVector.h</title>
|
|
<link rel="stylesheet" type="text/css" href="../../../../gcov.css">
|
|
</head>
|
|
|
|
<body>
|
|
|
|
<table width="100%" border=0 cellspacing=0 cellpadding=0>
|
|
<tr><td class="title">LCOV - code coverage report</td></tr>
|
|
<tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
|
|
|
|
<tr>
|
|
<td width="100%">
|
|
<table cellpadding=1 border=0 width="100%">
|
|
<tr>
|
|
<td width="10%" class="headerItem">Current view:</td>
|
|
<td width="10%" class="headerValue"><a href="../../../../index.html">top level</a> - <a href="index.html">libtorch/include/c10/util</a> - SmallVector.h<span style="font-size: 80%;"> (source / <a href="SmallVector.h.func-c.html">functions</a>)</span></td>
|
|
<td width="5%"></td>
|
|
<td width="5%"></td>
|
|
<td width="5%" class="headerCovTableHead">Coverage</td>
|
|
<td width="5%" class="headerCovTableHead" title="Covered + Uncovered code">Total</td>
|
|
<td width="5%" class="headerCovTableHead" title="Exercised code only">Hit</td>
|
|
</tr>
|
|
<tr>
|
|
<td class="headerItem">Test:</td>
|
|
<td class="headerValue">coverage.info</td>
|
|
<td></td>
|
|
<td class="headerItem">Lines:</td>
|
|
<td class="headerCovTableEntryLo">0.0 %</td>
|
|
<td class="headerCovTableEntry">55</td>
|
|
<td class="headerCovTableEntry">0</td>
|
|
</tr>
|
|
<tr>
|
|
<td class="headerItem">Test Date:</td>
|
|
<td class="headerValue">2024-04-30 13:17:26</td>
|
|
<td></td>
|
|
<td class="headerItem">Functions:</td>
|
|
<td class="headerCovTableEntryLo">0.0 %</td>
|
|
<td class="headerCovTableEntry">21</td>
|
|
<td class="headerCovTableEntry">0</td>
|
|
</tr>
|
|
<tr><td><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
|
|
</table>
|
|
</td>
|
|
</tr>
|
|
|
|
<tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
|
|
</table>
|
|
|
|
<table cellpadding=0 cellspacing=0 border=0>
|
|
<tr>
|
|
<td><br></td>
|
|
</tr>
|
|
<tr>
|
|
<td>
|
|
<pre class="sourceHeading"> Line data Source code</pre>
|
|
<pre class="source">
|
|
<span id="L1"><span class="lineNum"> 1</span> : //===- llvm/ADT/SmallVector.h - 'Normally small' vectors --------*- C++ -*-===//</span>
|
|
<span id="L2"><span class="lineNum"> 2</span> : //</span>
|
|
<span id="L3"><span class="lineNum"> 3</span> : // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.</span>
|
|
<span id="L4"><span class="lineNum"> 4</span> : // See https://llvm.org/LICENSE.txt for license information.</span>
|
|
<span id="L5"><span class="lineNum"> 5</span> : // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception</span>
|
|
<span id="L6"><span class="lineNum"> 6</span> : //</span>
|
|
<span id="L7"><span class="lineNum"> 7</span> : //===----------------------------------------------------------------------===//</span>
|
|
<span id="L8"><span class="lineNum"> 8</span> : //</span>
|
|
<span id="L9"><span class="lineNum"> 9</span> : // This file defines the SmallVector class.</span>
|
|
<span id="L10"><span class="lineNum"> 10</span> : //</span>
|
|
<span id="L11"><span class="lineNum"> 11</span> : //===----------------------------------------------------------------------===//</span>
|
|
<span id="L12"><span class="lineNum"> 12</span> : </span>
|
|
<span id="L13"><span class="lineNum"> 13</span> : // ATen: modified from llvm::SmallVector.</span>
|
|
<span id="L14"><span class="lineNum"> 14</span> : // used std::is_trivially_{copy,move}_constructible</span>
|
|
<span id="L15"><span class="lineNum"> 15</span> : // replaced iterator_range constructor with inline Container&& constructor</span>
|
|
<span id="L16"><span class="lineNum"> 16</span> : // replaced LLVM_NODISCARD, LLVM_LIKELY, and LLVM_UNLIKELY with c10 equivalents</span>
|
|
<span id="L17"><span class="lineNum"> 17</span> : // removed LLVM_GSL_OWNER</span>
|
|
<span id="L18"><span class="lineNum"> 18</span> : // added SmallVector::at</span>
|
|
<span id="L19"><span class="lineNum"> 19</span> : // added operator<< for std::ostream</span>
|
|
<span id="L20"><span class="lineNum"> 20</span> : // added C10_API to export SmallVectorBase</span>
|
|
<span id="L21"><span class="lineNum"> 21</span> : </span>
|
|
<span id="L22"><span class="lineNum"> 22</span> : #pragma once</span>
|
|
<span id="L23"><span class="lineNum"> 23</span> : </span>
|
|
<span id="L24"><span class="lineNum"> 24</span> : #include <c10/macros/Macros.h></span>
|
|
<span id="L25"><span class="lineNum"> 25</span> : #include <c10/util/AlignOf.h></span>
|
|
<span id="L26"><span class="lineNum"> 26</span> : </span>
|
|
<span id="L27"><span class="lineNum"> 27</span> : #include <algorithm></span>
|
|
<span id="L28"><span class="lineNum"> 28</span> : #include <cassert></span>
|
|
<span id="L29"><span class="lineNum"> 29</span> : #include <cstddef></span>
|
|
<span id="L30"><span class="lineNum"> 30</span> : #include <cstdlib></span>
|
|
<span id="L31"><span class="lineNum"> 31</span> : #include <cstring></span>
|
|
<span id="L32"><span class="lineNum"> 32</span> : #include <functional></span>
|
|
<span id="L33"><span class="lineNum"> 33</span> : #include <initializer_list></span>
|
|
<span id="L34"><span class="lineNum"> 34</span> : #include <iterator></span>
|
|
<span id="L35"><span class="lineNum"> 35</span> : #include <limits></span>
|
|
<span id="L36"><span class="lineNum"> 36</span> : #include <memory></span>
|
|
<span id="L37"><span class="lineNum"> 37</span> : #include <new></span>
|
|
<span id="L38"><span class="lineNum"> 38</span> : #include <ostream></span>
|
|
<span id="L39"><span class="lineNum"> 39</span> : #include <type_traits></span>
|
|
<span id="L40"><span class="lineNum"> 40</span> : #include <utility></span>
|
|
<span id="L41"><span class="lineNum"> 41</span> : </span>
|
|
<span id="L42"><span class="lineNum"> 42</span> : C10_CLANG_DIAGNOSTIC_PUSH()</span>
|
|
<span id="L43"><span class="lineNum"> 43</span> : #if C10_CLANG_HAS_WARNING("-Wshorten-64-to-32")</span>
|
|
<span id="L44"><span class="lineNum"> 44</span> : C10_CLANG_DIAGNOSTIC_IGNORE("-Wshorten-64-to-32")</span>
|
|
<span id="L45"><span class="lineNum"> 45</span> : #endif</span>
|
|
<span id="L46"><span class="lineNum"> 46</span> : </span>
|
|
<span id="L47"><span class="lineNum"> 47</span> : namespace c10 {</span>
|
|
<span id="L48"><span class="lineNum"> 48</span> : </span>
|
|
<span id="L49"><span class="lineNum"> 49</span> : /// This is all the stuff common to all SmallVectors.</span>
|
|
<span id="L50"><span class="lineNum"> 50</span> : ///</span>
|
|
<span id="L51"><span class="lineNum"> 51</span> : /// The template parameter specifies the type which should be used to hold the</span>
|
|
<span id="L52"><span class="lineNum"> 52</span> : /// Size and Capacity of the SmallVector, so it can be adjusted.</span>
|
|
<span id="L53"><span class="lineNum"> 53</span> : /// Using 32 bit size is desirable to shrink the size of the SmallVector.</span>
|
|
<span id="L54"><span class="lineNum"> 54</span> : /// Using 64 bit size is desirable for cases like SmallVector<char>, where a</span>
|
|
<span id="L55"><span class="lineNum"> 55</span> : /// 32 bit size would limit the vector to ~4GB. SmallVectors are used for</span>
|
|
<span id="L56"><span class="lineNum"> 56</span> : /// buffering bitcode output - which can exceed 4GB.</span>
|
|
<span id="L57"><span class="lineNum"> 57</span> : template <class Size_T></span>
|
|
<span id="L58"><span class="lineNum"> 58</span> : class C10_API SmallVectorBase {</span>
|
|
<span id="L59"><span class="lineNum"> 59</span> : protected:</span>
|
|
<span id="L60"><span class="lineNum"> 60</span> : void* BeginX;</span>
|
|
<span id="L61"><span class="lineNum"> 61</span> : Size_T Size = 0, Capacity;</span>
|
|
<span id="L62"><span class="lineNum"> 62</span> : </span>
|
|
<span id="L63"><span class="lineNum"> 63</span> : /// The maximum value of the Size_T used.</span>
|
|
<span id="L64"><span class="lineNum"> 64</span> : static constexpr size_t SizeTypeMax() {</span>
|
|
<span id="L65"><span class="lineNum"> 65</span> : return std::numeric_limits<Size_T>::max();</span>
|
|
<span id="L66"><span class="lineNum"> 66</span> : }</span>
|
|
<span id="L67"><span class="lineNum"> 67</span> : </span>
|
|
<span id="L68"><span class="lineNum"> 68</span> <span class="tlaUNC tlaBgUNC"> 0 : SmallVectorBase(void* FirstEl, size_t TotalCapacity)</span></span>
|
|
<span id="L69"><span class="lineNum"> 69</span> <span class="tlaUNC"> 0 : : BeginX(FirstEl), Capacity(TotalCapacity) {}</span></span>
|
|
<span id="L70"><span class="lineNum"> 70</span> : </span>
|
|
<span id="L71"><span class="lineNum"> 71</span> : /// This is a helper for \a grow() that's out of line to reduce code</span>
|
|
<span id="L72"><span class="lineNum"> 72</span> : /// duplication. This function will report a fatal error if it can't grow at</span>
|
|
<span id="L73"><span class="lineNum"> 73</span> : /// least to \p MinSize.</span>
|
|
<span id="L74"><span class="lineNum"> 74</span> : void* mallocForGrow(size_t MinSize, size_t TSize, size_t& NewCapacity);</span>
|
|
<span id="L75"><span class="lineNum"> 75</span> : </span>
|
|
<span id="L76"><span class="lineNum"> 76</span> : /// This is an implementation of the grow() method which only works</span>
|
|
<span id="L77"><span class="lineNum"> 77</span> : /// on POD-like data types and is out of line to reduce code duplication.</span>
|
|
<span id="L78"><span class="lineNum"> 78</span> : /// This function will report a fatal error if it cannot increase capacity.</span>
|
|
<span id="L79"><span class="lineNum"> 79</span> : void grow_pod(void* FirstEl, size_t MinSize, size_t TSize);</span>
|
|
<span id="L80"><span class="lineNum"> 80</span> : </span>
|
|
<span id="L81"><span class="lineNum"> 81</span> : public:</span>
|
|
<span id="L82"><span class="lineNum"> 82</span> : SmallVectorBase() = delete;</span>
|
|
<span id="L83"><span class="lineNum"> 83</span> <span class="tlaUNC"> 0 : size_t size() const {</span></span>
|
|
<span id="L84"><span class="lineNum"> 84</span> <span class="tlaUNC"> 0 : return Size;</span></span>
|
|
<span id="L85"><span class="lineNum"> 85</span> : }</span>
|
|
<span id="L86"><span class="lineNum"> 86</span> <span class="tlaUNC"> 0 : size_t capacity() const {</span></span>
|
|
<span id="L87"><span class="lineNum"> 87</span> <span class="tlaUNC"> 0 : return Capacity;</span></span>
|
|
<span id="L88"><span class="lineNum"> 88</span> : }</span>
|
|
<span id="L89"><span class="lineNum"> 89</span> : </span>
|
|
<span id="L90"><span class="lineNum"> 90</span> : C10_NODISCARD bool empty() const {</span>
|
|
<span id="L91"><span class="lineNum"> 91</span> : return !Size;</span>
|
|
<span id="L92"><span class="lineNum"> 92</span> : }</span>
|
|
<span id="L93"><span class="lineNum"> 93</span> : </span>
|
|
<span id="L94"><span class="lineNum"> 94</span> : /// Set the array size to \p N, which the current array must have enough</span>
|
|
<span id="L95"><span class="lineNum"> 95</span> : /// capacity for.</span>
|
|
<span id="L96"><span class="lineNum"> 96</span> : ///</span>
|
|
<span id="L97"><span class="lineNum"> 97</span> : /// This does not construct or destroy any elements in the vector.</span>
|
|
<span id="L98"><span class="lineNum"> 98</span> : ///</span>
|
|
<span id="L99"><span class="lineNum"> 99</span> : /// Clients can use this in conjunction with capacity() to write past the end</span>
|
|
<span id="L100"><span class="lineNum"> 100</span> : /// of the buffer when they know that more elements are available, and only</span>
|
|
<span id="L101"><span class="lineNum"> 101</span> : /// update the size later. This avoids the cost of value initializing elements</span>
|
|
<span id="L102"><span class="lineNum"> 102</span> : /// which will only be overwritten.</span>
|
|
<span id="L103"><span class="lineNum"> 103</span> <span class="tlaUNC"> 0 : void set_size(size_t N) {</span></span>
|
|
<span id="L104"><span class="lineNum"> 104</span> <span class="tlaUNC"> 0 : assert(N <= capacity());</span></span>
|
|
<span id="L105"><span class="lineNum"> 105</span> <span class="tlaUNC"> 0 : Size = N;</span></span>
|
|
<span id="L106"><span class="lineNum"> 106</span> <span class="tlaUNC"> 0 : }</span></span>
|
|
<span id="L107"><span class="lineNum"> 107</span> : };</span>
|
|
<span id="L108"><span class="lineNum"> 108</span> : </span>
|
|
<span id="L109"><span class="lineNum"> 109</span> : template <class T></span>
|
|
<span id="L110"><span class="lineNum"> 110</span> : using SmallVectorSizeType = typename std::</span>
|
|
<span id="L111"><span class="lineNum"> 111</span> : conditional<sizeof(T) < 4 && sizeof(void*) >= 8, uint64_t, uint32_t>::type;</span>
|
|
<span id="L112"><span class="lineNum"> 112</span> : </span>
|
|
<span id="L113"><span class="lineNum"> 113</span> : /// Figure out the offset of the first element.</span>
|
|
<span id="L114"><span class="lineNum"> 114</span> : template <class T, typename = void></span>
|
|
<span id="L115"><span class="lineNum"> 115</span> : struct SmallVectorAlignmentAndSize {</span>
|
|
<span id="L116"><span class="lineNum"> 116</span> : alignas(SmallVectorBase<SmallVectorSizeType<T>>) char Base[sizeof(</span>
|
|
<span id="L117"><span class="lineNum"> 117</span> : SmallVectorBase<SmallVectorSizeType<T>>)];</span>
|
|
<span id="L118"><span class="lineNum"> 118</span> : alignas(T) char FirstEl[sizeof(T)];</span>
|
|
<span id="L119"><span class="lineNum"> 119</span> : };</span>
|
|
<span id="L120"><span class="lineNum"> 120</span> : </span>
|
|
<span id="L121"><span class="lineNum"> 121</span> : /// This is the part of SmallVectorTemplateBase which does not depend on whether</span>
|
|
<span id="L122"><span class="lineNum"> 122</span> : /// the type T is a POD. The extra dummy template argument is used by ArrayRef</span>
|
|
<span id="L123"><span class="lineNum"> 123</span> : /// to avoid unnecessarily requiring T to be complete.</span>
|
|
<span id="L124"><span class="lineNum"> 124</span> : template <typename T, typename = void></span>
|
|
<span id="L125"><span class="lineNum"> 125</span> : class SmallVectorTemplateCommon</span>
|
|
<span id="L126"><span class="lineNum"> 126</span> : : public SmallVectorBase<SmallVectorSizeType<T>> {</span>
|
|
<span id="L127"><span class="lineNum"> 127</span> : using Base = SmallVectorBase<SmallVectorSizeType<T>>;</span>
|
|
<span id="L128"><span class="lineNum"> 128</span> : </span>
|
|
<span id="L129"><span class="lineNum"> 129</span> : /// Find the address of the first element. For this pointer math to be valid</span>
|
|
<span id="L130"><span class="lineNum"> 130</span> : /// with small-size of 0 for T with lots of alignment, it's important that</span>
|
|
<span id="L131"><span class="lineNum"> 131</span> : /// SmallVectorStorage is properly-aligned even for small-size of 0.</span>
|
|
<span id="L132"><span class="lineNum"> 132</span> <span class="tlaUNC"> 0 : void* getFirstEl() const {</span></span>
|
|
<span id="L133"><span class="lineNum"> 133</span> : return const_cast<void*>(reinterpret_cast<const void*>(</span>
|
|
<span id="L134"><span class="lineNum"> 134</span> : reinterpret_cast<const char*>(this) +</span>
|
|
<span id="L135"><span class="lineNum"> 135</span> <span class="tlaUNC"> 0 : offsetof(SmallVectorAlignmentAndSize<T>, FirstEl)));</span></span>
|
|
<span id="L136"><span class="lineNum"> 136</span> : }</span>
|
|
<span id="L137"><span class="lineNum"> 137</span> : // Space after 'FirstEl' is clobbered, do not add any instance vars after it.</span>
|
|
<span id="L138"><span class="lineNum"> 138</span> : </span>
|
|
<span id="L139"><span class="lineNum"> 139</span> : protected:</span>
|
|
<span id="L140"><span class="lineNum"> 140</span> <span class="tlaUNC"> 0 : SmallVectorTemplateCommon(size_t Size) : Base(getFirstEl(), Size) {}</span></span>
|
|
<span id="L141"><span class="lineNum"> 141</span> : </span>
|
|
<span id="L142"><span class="lineNum"> 142</span> <span class="tlaUNC"> 0 : void grow_pod(size_t MinSize, size_t TSize) {</span></span>
|
|
<span id="L143"><span class="lineNum"> 143</span> <span class="tlaUNC"> 0 : Base::grow_pod(getFirstEl(), MinSize, TSize);</span></span>
|
|
<span id="L144"><span class="lineNum"> 144</span> <span class="tlaUNC"> 0 : }</span></span>
|
|
<span id="L145"><span class="lineNum"> 145</span> : </span>
|
|
<span id="L146"><span class="lineNum"> 146</span> : /// Return true if this is a smallvector which has not had dynamic</span>
|
|
<span id="L147"><span class="lineNum"> 147</span> : /// memory allocated for it.</span>
|
|
<span id="L148"><span class="lineNum"> 148</span> <span class="tlaUNC"> 0 : bool isSmall() const {</span></span>
|
|
<span id="L149"><span class="lineNum"> 149</span> <span class="tlaUNC"> 0 : return this->BeginX == getFirstEl();</span></span>
|
|
<span id="L150"><span class="lineNum"> 150</span> : }</span>
|
|
<span id="L151"><span class="lineNum"> 151</span> : </span>
|
|
<span id="L152"><span class="lineNum"> 152</span> : /// Put this vector in a state of being small.</span>
|
|
<span id="L153"><span class="lineNum"> 153</span> : void resetToSmall() {</span>
|
|
<span id="L154"><span class="lineNum"> 154</span> : this->BeginX = getFirstEl();</span>
|
|
<span id="L155"><span class="lineNum"> 155</span> : this->Size = this->Capacity = 0; // FIXME: Setting Capacity to 0 is suspect.</span>
|
|
<span id="L156"><span class="lineNum"> 156</span> : }</span>
|
|
<span id="L157"><span class="lineNum"> 157</span> : </span>
|
|
<span id="L158"><span class="lineNum"> 158</span> : /// Return true if V is an internal reference to the given range.</span>
|
|
<span id="L159"><span class="lineNum"> 159</span> : bool isReferenceToRange(const void* V, const void* First, const void* Last)</span>
|
|
<span id="L160"><span class="lineNum"> 160</span> : const {</span>
|
|
<span id="L161"><span class="lineNum"> 161</span> : // Use std::less to avoid UB.</span>
|
|
<span id="L162"><span class="lineNum"> 162</span> : std::less<> LessThan;</span>
|
|
<span id="L163"><span class="lineNum"> 163</span> : return !LessThan(V, First) && LessThan(V, Last);</span>
|
|
<span id="L164"><span class="lineNum"> 164</span> : }</span>
|
|
<span id="L165"><span class="lineNum"> 165</span> : </span>
|
|
<span id="L166"><span class="lineNum"> 166</span> : /// Return true if V is an internal reference to this vector.</span>
|
|
<span id="L167"><span class="lineNum"> 167</span> : bool isReferenceToStorage(const void* V) const {</span>
|
|
<span id="L168"><span class="lineNum"> 168</span> : return isReferenceToRange(V, this->begin(), this->end());</span>
|
|
<span id="L169"><span class="lineNum"> 169</span> : }</span>
|
|
<span id="L170"><span class="lineNum"> 170</span> : </span>
|
|
<span id="L171"><span class="lineNum"> 171</span> : /// Return true if First and Last form a valid (possibly empty) range in this</span>
|
|
<span id="L172"><span class="lineNum"> 172</span> : /// vector's storage.</span>
|
|
<span id="L173"><span class="lineNum"> 173</span> : bool isRangeInStorage(const void* First, const void* Last) const {</span>
|
|
<span id="L174"><span class="lineNum"> 174</span> : // Use std::less to avoid UB.</span>
|
|
<span id="L175"><span class="lineNum"> 175</span> : std::less<> LessThan;</span>
|
|
<span id="L176"><span class="lineNum"> 176</span> : return !LessThan(First, this->begin()) && !LessThan(Last, First) &&</span>
|
|
<span id="L177"><span class="lineNum"> 177</span> : !LessThan(this->end(), Last);</span>
|
|
<span id="L178"><span class="lineNum"> 178</span> : }</span>
|
|
<span id="L179"><span class="lineNum"> 179</span> : </span>
|
|
<span id="L180"><span class="lineNum"> 180</span> : /// Return true unless Elt will be invalidated by resizing the vector to</span>
|
|
<span id="L181"><span class="lineNum"> 181</span> : /// NewSize.</span>
|
|
<span id="L182"><span class="lineNum"> 182</span> : bool isSafeToReferenceAfterResize(const void* Elt, size_t NewSize) {</span>
|
|
<span id="L183"><span class="lineNum"> 183</span> : // Past the end.</span>
|
|
<span id="L184"><span class="lineNum"> 184</span> : if (C10_LIKELY(!isReferenceToStorage(Elt)))</span>
|
|
<span id="L185"><span class="lineNum"> 185</span> : return true;</span>
|
|
<span id="L186"><span class="lineNum"> 186</span> : </span>
|
|
<span id="L187"><span class="lineNum"> 187</span> : // Return false if Elt will be destroyed by shrinking.</span>
|
|
<span id="L188"><span class="lineNum"> 188</span> : if (NewSize <= this->size())</span>
|
|
<span id="L189"><span class="lineNum"> 189</span> : return Elt < this->begin() + NewSize;</span>
|
|
<span id="L190"><span class="lineNum"> 190</span> : </span>
|
|
<span id="L191"><span class="lineNum"> 191</span> : // Return false if we need to grow.</span>
|
|
<span id="L192"><span class="lineNum"> 192</span> : return NewSize <= this->capacity();</span>
|
|
<span id="L193"><span class="lineNum"> 193</span> : }</span>
|
|
<span id="L194"><span class="lineNum"> 194</span> : </span>
|
|
<span id="L195"><span class="lineNum"> 195</span> : /// Check whether Elt will be invalidated by resizing the vector to NewSize.</span>
|
|
<span id="L196"><span class="lineNum"> 196</span> : void assertSafeToReferenceAfterResize(const void* Elt, size_t NewSize) {</span>
|
|
<span id="L197"><span class="lineNum"> 197</span> : (void)Elt; // Suppress unused variable warning</span>
|
|
<span id="L198"><span class="lineNum"> 198</span> : (void)NewSize; // Suppress unused variable warning</span>
|
|
<span id="L199"><span class="lineNum"> 199</span> : assert(</span>
|
|
<span id="L200"><span class="lineNum"> 200</span> : isSafeToReferenceAfterResize(Elt, NewSize) &&</span>
|
|
<span id="L201"><span class="lineNum"> 201</span> : "Attempting to reference an element of the vector in an operation "</span>
|
|
<span id="L202"><span class="lineNum"> 202</span> : "that invalidates it");</span>
|
|
<span id="L203"><span class="lineNum"> 203</span> : }</span>
|
|
<span id="L204"><span class="lineNum"> 204</span> : </span>
|
|
<span id="L205"><span class="lineNum"> 205</span> : /// Check whether Elt will be invalidated by increasing the size of the</span>
|
|
<span id="L206"><span class="lineNum"> 206</span> : /// vector by N.</span>
|
|
<span id="L207"><span class="lineNum"> 207</span> : void assertSafeToAdd(const void* Elt, size_t N = 1) {</span>
|
|
<span id="L208"><span class="lineNum"> 208</span> : this->assertSafeToReferenceAfterResize(Elt, this->size() + N);</span>
|
|
<span id="L209"><span class="lineNum"> 209</span> : }</span>
|
|
<span id="L210"><span class="lineNum"> 210</span> : </span>
|
|
<span id="L211"><span class="lineNum"> 211</span> : /// Check whether any part of the range will be invalidated by clearing.</span>
|
|
<span id="L212"><span class="lineNum"> 212</span> : void assertSafeToReferenceAfterClear(const T* From, const T* To) {</span>
|
|
<span id="L213"><span class="lineNum"> 213</span> : if (From == To)</span>
|
|
<span id="L214"><span class="lineNum"> 214</span> : return;</span>
|
|
<span id="L215"><span class="lineNum"> 215</span> : this->assertSafeToReferenceAfterResize(From, 0);</span>
|
|
<span id="L216"><span class="lineNum"> 216</span> : this->assertSafeToReferenceAfterResize(To - 1, 0);</span>
|
|
<span id="L217"><span class="lineNum"> 217</span> : }</span>
|
|
<span id="L218"><span class="lineNum"> 218</span> : template <</span>
|
|
<span id="L219"><span class="lineNum"> 219</span> : class ItTy,</span>
|
|
<span id="L220"><span class="lineNum"> 220</span> : std::enable_if_t<</span>
|
|
<span id="L221"><span class="lineNum"> 221</span> : !std::is_same<std::remove_const_t<ItTy>, T*>::value,</span>
|
|
<span id="L222"><span class="lineNum"> 222</span> : bool> = false></span>
|
|
<span id="L223"><span class="lineNum"> 223</span> : void assertSafeToReferenceAfterClear(ItTy, ItTy) {}</span>
|
|
<span id="L224"><span class="lineNum"> 224</span> : </span>
|
|
<span id="L225"><span class="lineNum"> 225</span> : /// Check whether any part of the range will be invalidated by growing.</span>
|
|
<span id="L226"><span class="lineNum"> 226</span> : void assertSafeToAddRange(const T* From, const T* To) {</span>
|
|
<span id="L227"><span class="lineNum"> 227</span> : if (From == To)</span>
|
|
<span id="L228"><span class="lineNum"> 228</span> : return;</span>
|
|
<span id="L229"><span class="lineNum"> 229</span> : this->assertSafeToAdd(From, To - From);</span>
|
|
<span id="L230"><span class="lineNum"> 230</span> : this->assertSafeToAdd(To - 1, To - From);</span>
|
|
<span id="L231"><span class="lineNum"> 231</span> : }</span>
|
|
<span id="L232"><span class="lineNum"> 232</span> : template <</span>
|
|
<span id="L233"><span class="lineNum"> 233</span> : class ItTy,</span>
|
|
<span id="L234"><span class="lineNum"> 234</span> : std::enable_if_t<</span>
|
|
<span id="L235"><span class="lineNum"> 235</span> : !std::is_same<std::remove_const_t<ItTy>, T*>::value,</span>
|
|
<span id="L236"><span class="lineNum"> 236</span> : bool> = false></span>
|
|
<span id="L237"><span class="lineNum"> 237</span> : void assertSafeToAddRange(ItTy, ItTy) {}</span>
|
|
<span id="L238"><span class="lineNum"> 238</span> : </span>
|
|
<span id="L239"><span class="lineNum"> 239</span> : /// Reserve enough space to add one element, and return the updated element</span>
|
|
<span id="L240"><span class="lineNum"> 240</span> : /// pointer in case it was a reference to the storage.</span>
|
|
<span id="L241"><span class="lineNum"> 241</span> : template <class U></span>
|
|
<span id="L242"><span class="lineNum"> 242</span> <span class="tlaUNC"> 0 : static const T* reserveForParamAndGetAddressImpl(</span></span>
|
|
<span id="L243"><span class="lineNum"> 243</span> : U* This,</span>
|
|
<span id="L244"><span class="lineNum"> 244</span> : const T& Elt,</span>
|
|
<span id="L245"><span class="lineNum"> 245</span> : size_t N) {</span>
|
|
<span id="L246"><span class="lineNum"> 246</span> <span class="tlaUNC"> 0 : size_t NewSize = This->size() + N;</span></span>
|
|
<span id="L247"><span class="lineNum"> 247</span> <span class="tlaUNC"> 0 : if (C10_LIKELY(NewSize <= This->capacity()))</span></span>
|
|
<span id="L248"><span class="lineNum"> 248</span> <span class="tlaUNC"> 0 : return &Elt;</span></span>
|
|
<span id="L249"><span class="lineNum"> 249</span> : </span>
|
|
<span id="L250"><span class="lineNum"> 250</span> <span class="tlaUNC"> 0 : bool ReferencesStorage = false;</span></span>
|
|
<span id="L251"><span class="lineNum"> 251</span> <span class="tlaUNC"> 0 : int64_t Index = -1;</span></span>
|
|
<span id="L252"><span class="lineNum"> 252</span> : if (!U::TakesParamByValue) {</span>
|
|
<span id="L253"><span class="lineNum"> 253</span> : if (C10_UNLIKELY(This->isReferenceToStorage(&Elt))) {</span>
|
|
<span id="L254"><span class="lineNum"> 254</span> : ReferencesStorage = true;</span>
|
|
<span id="L255"><span class="lineNum"> 255</span> : Index = &Elt - This->begin();</span>
|
|
<span id="L256"><span class="lineNum"> 256</span> : }</span>
|
|
<span id="L257"><span class="lineNum"> 257</span> : }</span>
|
|
<span id="L258"><span class="lineNum"> 258</span> <span class="tlaUNC"> 0 : This->grow(NewSize);</span></span>
|
|
<span id="L259"><span class="lineNum"> 259</span> <span class="tlaUNC"> 0 : return ReferencesStorage ? This->begin() + Index : &Elt;</span></span>
|
|
<span id="L260"><span class="lineNum"> 260</span> : }</span>
|
|
<span id="L261"><span class="lineNum"> 261</span> : </span>
|
|
<span id="L262"><span class="lineNum"> 262</span> : public:</span>
|
|
<span id="L263"><span class="lineNum"> 263</span> : using size_type = size_t;</span>
|
|
<span id="L264"><span class="lineNum"> 264</span> : using difference_type = ptrdiff_t;</span>
|
|
<span id="L265"><span class="lineNum"> 265</span> : using value_type = T;</span>
|
|
<span id="L266"><span class="lineNum"> 266</span> : using iterator = T*;</span>
|
|
<span id="L267"><span class="lineNum"> 267</span> : using const_iterator = const T*;</span>
|
|
<span id="L268"><span class="lineNum"> 268</span> : </span>
|
|
<span id="L269"><span class="lineNum"> 269</span> : using const_reverse_iterator = std::reverse_iterator<const_iterator>;</span>
|
|
<span id="L270"><span class="lineNum"> 270</span> : using reverse_iterator = std::reverse_iterator<iterator>;</span>
|
|
<span id="L271"><span class="lineNum"> 271</span> : </span>
|
|
<span id="L272"><span class="lineNum"> 272</span> : using reference = T&;</span>
|
|
<span id="L273"><span class="lineNum"> 273</span> : using const_reference = const T&;</span>
|
|
<span id="L274"><span class="lineNum"> 274</span> : using pointer = T*;</span>
|
|
<span id="L275"><span class="lineNum"> 275</span> : using const_pointer = const T*;</span>
|
|
<span id="L276"><span class="lineNum"> 276</span> : </span>
|
|
<span id="L277"><span class="lineNum"> 277</span> : using Base::capacity;</span>
|
|
<span id="L278"><span class="lineNum"> 278</span> : using Base::empty;</span>
|
|
<span id="L279"><span class="lineNum"> 279</span> : using Base::size;</span>
|
|
<span id="L280"><span class="lineNum"> 280</span> : </span>
|
|
<span id="L281"><span class="lineNum"> 281</span> : // forward iterator creation methods.</span>
|
|
<span id="L282"><span class="lineNum"> 282</span> <span class="tlaUNC"> 0 : iterator begin() {</span></span>
|
|
<span id="L283"><span class="lineNum"> 283</span> <span class="tlaUNC"> 0 : return (iterator)this->BeginX;</span></span>
|
|
<span id="L284"><span class="lineNum"> 284</span> : }</span>
|
|
<span id="L285"><span class="lineNum"> 285</span> : const_iterator begin() const {</span>
|
|
<span id="L286"><span class="lineNum"> 286</span> : return (const_iterator)this->BeginX;</span>
|
|
<span id="L287"><span class="lineNum"> 287</span> : }</span>
|
|
<span id="L288"><span class="lineNum"> 288</span> <span class="tlaUNC"> 0 : iterator end() {</span></span>
|
|
<span id="L289"><span class="lineNum"> 289</span> <span class="tlaUNC"> 0 : return begin() + size();</span></span>
|
|
<span id="L290"><span class="lineNum"> 290</span> : }</span>
|
|
<span id="L291"><span class="lineNum"> 291</span> : const_iterator end() const {</span>
|
|
<span id="L292"><span class="lineNum"> 292</span> : return begin() + size();</span>
|
|
<span id="L293"><span class="lineNum"> 293</span> : }</span>
|
|
<span id="L294"><span class="lineNum"> 294</span> : </span>
|
|
<span id="L295"><span class="lineNum"> 295</span> : // reverse iterator creation methods.</span>
|
|
<span id="L296"><span class="lineNum"> 296</span> : reverse_iterator rbegin() {</span>
|
|
<span id="L297"><span class="lineNum"> 297</span> : return reverse_iterator(end());</span>
|
|
<span id="L298"><span class="lineNum"> 298</span> : }</span>
|
|
<span id="L299"><span class="lineNum"> 299</span> : const_reverse_iterator rbegin() const {</span>
|
|
<span id="L300"><span class="lineNum"> 300</span> : return const_reverse_iterator(end());</span>
|
|
<span id="L301"><span class="lineNum"> 301</span> : }</span>
|
|
<span id="L302"><span class="lineNum"> 302</span> : reverse_iterator rend() {</span>
|
|
<span id="L303"><span class="lineNum"> 303</span> : return reverse_iterator(begin());</span>
|
|
<span id="L304"><span class="lineNum"> 304</span> : }</span>
|
|
<span id="L305"><span class="lineNum"> 305</span> : const_reverse_iterator rend() const {</span>
|
|
<span id="L306"><span class="lineNum"> 306</span> : return const_reverse_iterator(begin());</span>
|
|
<span id="L307"><span class="lineNum"> 307</span> : }</span>
|
|
<span id="L308"><span class="lineNum"> 308</span> : </span>
|
|
<span id="L309"><span class="lineNum"> 309</span> : size_type size_in_bytes() const {</span>
|
|
<span id="L310"><span class="lineNum"> 310</span> : return size() * sizeof(T);</span>
|
|
<span id="L311"><span class="lineNum"> 311</span> : }</span>
|
|
<span id="L312"><span class="lineNum"> 312</span> : size_type max_size() const {</span>
|
|
<span id="L313"><span class="lineNum"> 313</span> : return std::min(this->SizeTypeMax(), size_type(-1) / sizeof(T));</span>
|
|
<span id="L314"><span class="lineNum"> 314</span> : }</span>
|
|
<span id="L315"><span class="lineNum"> 315</span> : </span>
|
|
<span id="L316"><span class="lineNum"> 316</span> : size_t capacity_in_bytes() const {</span>
|
|
<span id="L317"><span class="lineNum"> 317</span> : return capacity() * sizeof(T);</span>
|
|
<span id="L318"><span class="lineNum"> 318</span> : }</span>
|
|
<span id="L319"><span class="lineNum"> 319</span> : </span>
|
|
<span id="L320"><span class="lineNum"> 320</span> : /// Return a pointer to the vector's buffer, even if empty().</span>
|
|
<span id="L321"><span class="lineNum"> 321</span> : pointer data() {</span>
|
|
<span id="L322"><span class="lineNum"> 322</span> : return pointer(begin());</span>
|
|
<span id="L323"><span class="lineNum"> 323</span> : }</span>
|
|
<span id="L324"><span class="lineNum"> 324</span> : /// Return a pointer to the vector's buffer, even if empty().</span>
|
|
<span id="L325"><span class="lineNum"> 325</span> : const_pointer data() const {</span>
|
|
<span id="L326"><span class="lineNum"> 326</span> : return const_pointer(begin());</span>
|
|
<span id="L327"><span class="lineNum"> 327</span> : }</span>
|
|
<span id="L328"><span class="lineNum"> 328</span> : </span>
|
|
<span id="L329"><span class="lineNum"> 329</span> : // SmallVector::at is NOT from LLVM.</span>
|
|
<span id="L330"><span class="lineNum"> 330</span> : reference at(size_type idx) {</span>
|
|
<span id="L331"><span class="lineNum"> 331</span> : assert(idx < size());</span>
|
|
<span id="L332"><span class="lineNum"> 332</span> : return begin()[idx];</span>
|
|
<span id="L333"><span class="lineNum"> 333</span> : }</span>
|
|
<span id="L334"><span class="lineNum"> 334</span> : const_reference at(size_type idx) const {</span>
|
|
<span id="L335"><span class="lineNum"> 335</span> : assert(idx < size());</span>
|
|
<span id="L336"><span class="lineNum"> 336</span> : return begin()[idx];</span>
|
|
<span id="L337"><span class="lineNum"> 337</span> : }</span>
|
|
<span id="L338"><span class="lineNum"> 338</span> : reference operator[](size_type idx) {</span>
|
|
<span id="L339"><span class="lineNum"> 339</span> : assert(idx < size());</span>
|
|
<span id="L340"><span class="lineNum"> 340</span> : return begin()[idx];</span>
|
|
<span id="L341"><span class="lineNum"> 341</span> : }</span>
|
|
<span id="L342"><span class="lineNum"> 342</span> : const_reference operator[](size_type idx) const {</span>
|
|
<span id="L343"><span class="lineNum"> 343</span> : assert(idx < size());</span>
|
|
<span id="L344"><span class="lineNum"> 344</span> : return begin()[idx];</span>
|
|
<span id="L345"><span class="lineNum"> 345</span> : }</span>
|
|
<span id="L346"><span class="lineNum"> 346</span> : </span>
|
|
<span id="L347"><span class="lineNum"> 347</span> : reference front() {</span>
|
|
<span id="L348"><span class="lineNum"> 348</span> : assert(!empty());</span>
|
|
<span id="L349"><span class="lineNum"> 349</span> : return begin()[0];</span>
|
|
<span id="L350"><span class="lineNum"> 350</span> : }</span>
|
|
<span id="L351"><span class="lineNum"> 351</span> : const_reference front() const {</span>
|
|
<span id="L352"><span class="lineNum"> 352</span> : assert(!empty());</span>
|
|
<span id="L353"><span class="lineNum"> 353</span> : return begin()[0];</span>
|
|
<span id="L354"><span class="lineNum"> 354</span> : }</span>
|
|
<span id="L355"><span class="lineNum"> 355</span> : </span>
|
|
<span id="L356"><span class="lineNum"> 356</span> : reference back() {</span>
|
|
<span id="L357"><span class="lineNum"> 357</span> : assert(!empty());</span>
|
|
<span id="L358"><span class="lineNum"> 358</span> : return end()[-1];</span>
|
|
<span id="L359"><span class="lineNum"> 359</span> : }</span>
|
|
<span id="L360"><span class="lineNum"> 360</span> : const_reference back() const {</span>
|
|
<span id="L361"><span class="lineNum"> 361</span> : assert(!empty());</span>
|
|
<span id="L362"><span class="lineNum"> 362</span> : return end()[-1];</span>
|
|
<span id="L363"><span class="lineNum"> 363</span> : }</span>
|
|
<span id="L364"><span class="lineNum"> 364</span> : };</span>
|
|
<span id="L365"><span class="lineNum"> 365</span> : </span>
|
|
<span id="L366"><span class="lineNum"> 366</span> : /// SmallVectorTemplateBase<TriviallyCopyable = false> - This is where we put</span>
|
|
<span id="L367"><span class="lineNum"> 367</span> : /// method implementations that are designed to work with non-trivial T's.</span>
|
|
<span id="L368"><span class="lineNum"> 368</span> : ///</span>
|
|
<span id="L369"><span class="lineNum"> 369</span> : /// We approximate is_trivially_copyable with trivial move/copy construction and</span>
|
|
<span id="L370"><span class="lineNum"> 370</span> : /// trivial destruction. While the standard doesn't specify that you're allowed</span>
|
|
<span id="L371"><span class="lineNum"> 371</span> : /// copy these types with memcpy, there is no way for the type to observe this.</span>
|
|
<span id="L372"><span class="lineNum"> 372</span> : /// This catches the important case of std::pair<POD, POD>, which is not</span>
|
|
<span id="L373"><span class="lineNum"> 373</span> : /// trivially assignable.</span>
|
|
<span id="L374"><span class="lineNum"> 374</span> : ///</span>
|
|
<span id="L375"><span class="lineNum"> 375</span> : /// XXX: if build fails here fall back to C10_IS_TRIVIALLY_COPYABLE and make a</span>
|
|
<span id="L376"><span class="lineNum"> 376</span> : /// note</span>
|
|
<span id="L377"><span class="lineNum"> 377</span> : template <</span>
|
|
<span id="L378"><span class="lineNum"> 378</span> : typename T,</span>
|
|
<span id="L379"><span class="lineNum"> 379</span> : bool = (std::is_trivially_copy_constructible<T>::value) &&</span>
|
|
<span id="L380"><span class="lineNum"> 380</span> : (std::is_trivially_move_constructible<T>::value) &&</span>
|
|
<span id="L381"><span class="lineNum"> 381</span> : std::is_trivially_destructible<T>::value></span>
|
|
<span id="L382"><span class="lineNum"> 382</span> : class SmallVectorTemplateBase : public SmallVectorTemplateCommon<T> {</span>
|
|
<span id="L383"><span class="lineNum"> 383</span> : friend class SmallVectorTemplateCommon<T>;</span>
|
|
<span id="L384"><span class="lineNum"> 384</span> : </span>
|
|
<span id="L385"><span class="lineNum"> 385</span> : protected:</span>
|
|
<span id="L386"><span class="lineNum"> 386</span> : static constexpr bool TakesParamByValue = false;</span>
|
|
<span id="L387"><span class="lineNum"> 387</span> : using ValueParamT = const T&;</span>
|
|
<span id="L388"><span class="lineNum"> 388</span> : </span>
|
|
<span id="L389"><span class="lineNum"> 389</span> : SmallVectorTemplateBase(size_t Size) : SmallVectorTemplateCommon<T>(Size) {}</span>
|
|
<span id="L390"><span class="lineNum"> 390</span> : </span>
|
|
<span id="L391"><span class="lineNum"> 391</span> : static void destroy_range(T* S, T* E) {</span>
|
|
<span id="L392"><span class="lineNum"> 392</span> : while (S != E) {</span>
|
|
<span id="L393"><span class="lineNum"> 393</span> : --E;</span>
|
|
<span id="L394"><span class="lineNum"> 394</span> : E->~T();</span>
|
|
<span id="L395"><span class="lineNum"> 395</span> : }</span>
|
|
<span id="L396"><span class="lineNum"> 396</span> : }</span>
|
|
<span id="L397"><span class="lineNum"> 397</span> : </span>
|
|
<span id="L398"><span class="lineNum"> 398</span> : /// Move the range [I, E) into the uninitialized memory starting with "Dest",</span>
|
|
<span id="L399"><span class="lineNum"> 399</span> : /// constructing elements as needed.</span>
|
|
<span id="L400"><span class="lineNum"> 400</span> : template <typename It1, typename It2></span>
|
|
<span id="L401"><span class="lineNum"> 401</span> : static void uninitialized_move(It1 I, It1 E, It2 Dest) {</span>
|
|
<span id="L402"><span class="lineNum"> 402</span> : std::uninitialized_copy(</span>
|
|
<span id="L403"><span class="lineNum"> 403</span> : std::make_move_iterator(I), std::make_move_iterator(E), Dest);</span>
|
|
<span id="L404"><span class="lineNum"> 404</span> : }</span>
|
|
<span id="L405"><span class="lineNum"> 405</span> : </span>
|
|
<span id="L406"><span class="lineNum"> 406</span> : /// Copy the range [I, E) onto the uninitialized memory starting with "Dest",</span>
|
|
<span id="L407"><span class="lineNum"> 407</span> : /// constructing elements as needed.</span>
|
|
<span id="L408"><span class="lineNum"> 408</span> : template <typename It1, typename It2></span>
|
|
<span id="L409"><span class="lineNum"> 409</span> : static void uninitialized_copy(It1 I, It1 E, It2 Dest) {</span>
|
|
<span id="L410"><span class="lineNum"> 410</span> : std::uninitialized_copy(I, E, Dest);</span>
|
|
<span id="L411"><span class="lineNum"> 411</span> : }</span>
|
|
<span id="L412"><span class="lineNum"> 412</span> : </span>
|
|
<span id="L413"><span class="lineNum"> 413</span> : /// Grow the allocated memory (without initializing new elements), doubling</span>
|
|
<span id="L414"><span class="lineNum"> 414</span> : /// the size of the allocated memory. Guarantees space for at least one more</span>
|
|
<span id="L415"><span class="lineNum"> 415</span> : /// element, or MinSize more elements if specified.</span>
|
|
<span id="L416"><span class="lineNum"> 416</span> : void grow(size_t MinSize = 0);</span>
|
|
<span id="L417"><span class="lineNum"> 417</span> : </span>
|
|
<span id="L418"><span class="lineNum"> 418</span> : /// Create a new allocation big enough for \p MinSize and pass back its size</span>
|
|
<span id="L419"><span class="lineNum"> 419</span> : /// in \p NewCapacity. This is the first section of \a grow().</span>
|
|
<span id="L420"><span class="lineNum"> 420</span> : T* mallocForGrow(size_t MinSize, size_t& NewCapacity) {</span>
|
|
<span id="L421"><span class="lineNum"> 421</span> : return static_cast<T*>(</span>
|
|
<span id="L422"><span class="lineNum"> 422</span> : SmallVectorBase<SmallVectorSizeType<T>>::mallocForGrow(</span>
|
|
<span id="L423"><span class="lineNum"> 423</span> : MinSize, sizeof(T), NewCapacity));</span>
|
|
<span id="L424"><span class="lineNum"> 424</span> : }</span>
|
|
<span id="L425"><span class="lineNum"> 425</span> : </span>
|
|
<span id="L426"><span class="lineNum"> 426</span> : /// Move existing elements over to the new allocation \p NewElts, the middle</span>
|
|
<span id="L427"><span class="lineNum"> 427</span> : /// section of \a grow().</span>
|
|
<span id="L428"><span class="lineNum"> 428</span> : void moveElementsForGrow(T* NewElts);</span>
|
|
<span id="L429"><span class="lineNum"> 429</span> : </span>
|
|
<span id="L430"><span class="lineNum"> 430</span> : /// Transfer ownership of the allocation, finishing up \a grow().</span>
|
|
<span id="L431"><span class="lineNum"> 431</span> : void takeAllocationForGrow(T* NewElts, size_t NewCapacity);</span>
|
|
<span id="L432"><span class="lineNum"> 432</span> : </span>
|
|
<span id="L433"><span class="lineNum"> 433</span> : /// Reserve enough space to add one element, and return the updated element</span>
|
|
<span id="L434"><span class="lineNum"> 434</span> : /// pointer in case it was a reference to the storage.</span>
|
|
<span id="L435"><span class="lineNum"> 435</span> : const T* reserveForParamAndGetAddress(const T& Elt, size_t N = 1) {</span>
|
|
<span id="L436"><span class="lineNum"> 436</span> : return this->reserveForParamAndGetAddressImpl(this, Elt, N);</span>
|
|
<span id="L437"><span class="lineNum"> 437</span> : }</span>
|
|
<span id="L438"><span class="lineNum"> 438</span> : </span>
|
|
<span id="L439"><span class="lineNum"> 439</span> : /// Reserve enough space to add one element, and return the updated element</span>
|
|
<span id="L440"><span class="lineNum"> 440</span> : /// pointer in case it was a reference to the storage.</span>
|
|
<span id="L441"><span class="lineNum"> 441</span> : T* reserveForParamAndGetAddress(T& Elt, size_t N = 1) {</span>
|
|
<span id="L442"><span class="lineNum"> 442</span> : return const_cast<T*>(this->reserveForParamAndGetAddressImpl(this, Elt, N));</span>
|
|
<span id="L443"><span class="lineNum"> 443</span> : }</span>
|
|
<span id="L444"><span class="lineNum"> 444</span> : </span>
|
|
<span id="L445"><span class="lineNum"> 445</span> : static T&& forward_value_param(T&& V) {</span>
|
|
<span id="L446"><span class="lineNum"> 446</span> : return std::move(V);</span>
|
|
<span id="L447"><span class="lineNum"> 447</span> : }</span>
|
|
<span id="L448"><span class="lineNum"> 448</span> : static const T& forward_value_param(const T& V) {</span>
|
|
<span id="L449"><span class="lineNum"> 449</span> : return V;</span>
|
|
<span id="L450"><span class="lineNum"> 450</span> : }</span>
|
|
<span id="L451"><span class="lineNum"> 451</span> : </span>
|
|
<span id="L452"><span class="lineNum"> 452</span> : void growAndAssign(size_t NumElts, const T& Elt) {</span>
|
|
<span id="L453"><span class="lineNum"> 453</span> : // Grow manually in case Elt is an internal reference.</span>
|
|
<span id="L454"><span class="lineNum"> 454</span> : size_t NewCapacity = 0;</span>
|
|
<span id="L455"><span class="lineNum"> 455</span> : T* NewElts = mallocForGrow(NumElts, NewCapacity);</span>
|
|
<span id="L456"><span class="lineNum"> 456</span> : std::uninitialized_fill_n(NewElts, NumElts, Elt);</span>
|
|
<span id="L457"><span class="lineNum"> 457</span> : this->destroy_range(this->begin(), this->end());</span>
|
|
<span id="L458"><span class="lineNum"> 458</span> : takeAllocationForGrow(NewElts, NewCapacity);</span>
|
|
<span id="L459"><span class="lineNum"> 459</span> : this->set_size(NumElts);</span>
|
|
<span id="L460"><span class="lineNum"> 460</span> : }</span>
|
|
<span id="L461"><span class="lineNum"> 461</span> : </span>
|
|
<span id="L462"><span class="lineNum"> 462</span> : template <typename... ArgTypes></span>
|
|
<span id="L463"><span class="lineNum"> 463</span> : T& growAndEmplaceBack(ArgTypes&&... Args) {</span>
|
|
<span id="L464"><span class="lineNum"> 464</span> : // Grow manually in case one of Args is an internal reference.</span>
|
|
<span id="L465"><span class="lineNum"> 465</span> : size_t NewCapacity = 0;</span>
|
|
<span id="L466"><span class="lineNum"> 466</span> : T* NewElts = mallocForGrow(0, NewCapacity);</span>
|
|
<span id="L467"><span class="lineNum"> 467</span> : ::new ((void*)(NewElts + this->size())) T(std::forward<ArgTypes>(Args)...);</span>
|
|
<span id="L468"><span class="lineNum"> 468</span> : moveElementsForGrow(NewElts);</span>
|
|
<span id="L469"><span class="lineNum"> 469</span> : takeAllocationForGrow(NewElts, NewCapacity);</span>
|
|
<span id="L470"><span class="lineNum"> 470</span> : this->set_size(this->size() + 1);</span>
|
|
<span id="L471"><span class="lineNum"> 471</span> : return this->back();</span>
|
|
<span id="L472"><span class="lineNum"> 472</span> : }</span>
|
|
<span id="L473"><span class="lineNum"> 473</span> : </span>
|
|
<span id="L474"><span class="lineNum"> 474</span> : public:</span>
|
|
<span id="L475"><span class="lineNum"> 475</span> : void push_back(const T& Elt) {</span>
|
|
<span id="L476"><span class="lineNum"> 476</span> : const T* EltPtr = reserveForParamAndGetAddress(Elt);</span>
|
|
<span id="L477"><span class="lineNum"> 477</span> : ::new ((void*)this->end()) T(*EltPtr);</span>
|
|
<span id="L478"><span class="lineNum"> 478</span> : this->set_size(this->size() + 1);</span>
|
|
<span id="L479"><span class="lineNum"> 479</span> : }</span>
|
|
<span id="L480"><span class="lineNum"> 480</span> : </span>
|
|
<span id="L481"><span class="lineNum"> 481</span> : void push_back(T&& Elt) {</span>
|
|
<span id="L482"><span class="lineNum"> 482</span> : T* EltPtr = reserveForParamAndGetAddress(Elt);</span>
|
|
<span id="L483"><span class="lineNum"> 483</span> : ::new ((void*)this->end()) T(::std::move(*EltPtr));</span>
|
|
<span id="L484"><span class="lineNum"> 484</span> : this->set_size(this->size() + 1);</span>
|
|
<span id="L485"><span class="lineNum"> 485</span> : }</span>
|
|
<span id="L486"><span class="lineNum"> 486</span> : </span>
|
|
<span id="L487"><span class="lineNum"> 487</span> : void pop_back() {</span>
|
|
<span id="L488"><span class="lineNum"> 488</span> : this->set_size(this->size() - 1);</span>
|
|
<span id="L489"><span class="lineNum"> 489</span> : this->end()->~T();</span>
|
|
<span id="L490"><span class="lineNum"> 490</span> : }</span>
|
|
<span id="L491"><span class="lineNum"> 491</span> : };</span>
|
|
<span id="L492"><span class="lineNum"> 492</span> : </span>
|
|
<span id="L493"><span class="lineNum"> 493</span> : // Define this out-of-line to dissuade the C++ compiler from inlining it.</span>
|
|
<span id="L494"><span class="lineNum"> 494</span> : template <typename T, bool TriviallyCopyable></span>
|
|
<span id="L495"><span class="lineNum"> 495</span> : void SmallVectorTemplateBase<T, TriviallyCopyable>::grow(size_t MinSize) {</span>
|
|
<span id="L496"><span class="lineNum"> 496</span> : size_t NewCapacity = 0;</span>
|
|
<span id="L497"><span class="lineNum"> 497</span> : T* NewElts = mallocForGrow(MinSize, NewCapacity);</span>
|
|
<span id="L498"><span class="lineNum"> 498</span> : moveElementsForGrow(NewElts);</span>
|
|
<span id="L499"><span class="lineNum"> 499</span> : takeAllocationForGrow(NewElts, NewCapacity);</span>
|
|
<span id="L500"><span class="lineNum"> 500</span> : }</span>
|
|
<span id="L501"><span class="lineNum"> 501</span> : </span>
|
|
<span id="L502"><span class="lineNum"> 502</span> : // Define this out-of-line to dissuade the C++ compiler from inlining it.</span>
|
|
<span id="L503"><span class="lineNum"> 503</span> : template <typename T, bool TriviallyCopyable></span>
|
|
<span id="L504"><span class="lineNum"> 504</span> : void SmallVectorTemplateBase<T, TriviallyCopyable>::moveElementsForGrow(</span>
|
|
<span id="L505"><span class="lineNum"> 505</span> : T* NewElts) {</span>
|
|
<span id="L506"><span class="lineNum"> 506</span> : // Move the elements over.</span>
|
|
<span id="L507"><span class="lineNum"> 507</span> : this->uninitialized_move(this->begin(), this->end(), NewElts);</span>
|
|
<span id="L508"><span class="lineNum"> 508</span> : </span>
|
|
<span id="L509"><span class="lineNum"> 509</span> : // Destroy the original elements.</span>
|
|
<span id="L510"><span class="lineNum"> 510</span> : destroy_range(this->begin(), this->end());</span>
|
|
<span id="L511"><span class="lineNum"> 511</span> : }</span>
|
|
<span id="L512"><span class="lineNum"> 512</span> : </span>
|
|
<span id="L513"><span class="lineNum"> 513</span> : // Define this out-of-line to dissuade the C++ compiler from inlining it.</span>
|
|
<span id="L514"><span class="lineNum"> 514</span> : template <typename T, bool TriviallyCopyable></span>
|
|
<span id="L515"><span class="lineNum"> 515</span> : void SmallVectorTemplateBase<T, TriviallyCopyable>::takeAllocationForGrow(</span>
|
|
<span id="L516"><span class="lineNum"> 516</span> : T* NewElts,</span>
|
|
<span id="L517"><span class="lineNum"> 517</span> : size_t NewCapacity) {</span>
|
|
<span id="L518"><span class="lineNum"> 518</span> : // If this wasn't grown from the inline copy, deallocate the old space.</span>
|
|
<span id="L519"><span class="lineNum"> 519</span> : if (!this->isSmall())</span>
|
|
<span id="L520"><span class="lineNum"> 520</span> : free(this->begin());</span>
|
|
<span id="L521"><span class="lineNum"> 521</span> : </span>
|
|
<span id="L522"><span class="lineNum"> 522</span> : this->BeginX = NewElts;</span>
|
|
<span id="L523"><span class="lineNum"> 523</span> : this->Capacity = NewCapacity;</span>
|
|
<span id="L524"><span class="lineNum"> 524</span> : }</span>
|
|
<span id="L525"><span class="lineNum"> 525</span> : </span>
|
|
<span id="L526"><span class="lineNum"> 526</span> : /// SmallVectorTemplateBase<TriviallyCopyable = true> - This is where we put</span>
|
|
<span id="L527"><span class="lineNum"> 527</span> : /// method implementations that are designed to work with trivially copyable</span>
|
|
<span id="L528"><span class="lineNum"> 528</span> : /// T's. This allows using memcpy in place of copy/move construction and</span>
|
|
<span id="L529"><span class="lineNum"> 529</span> : /// skipping destruction.</span>
|
|
<span id="L530"><span class="lineNum"> 530</span> : template <typename T></span>
|
|
<span id="L531"><span class="lineNum"> 531</span> : class SmallVectorTemplateBase<T, true> : public SmallVectorTemplateCommon<T> {</span>
|
|
<span id="L532"><span class="lineNum"> 532</span> : friend class SmallVectorTemplateCommon<T>;</span>
|
|
<span id="L533"><span class="lineNum"> 533</span> : </span>
|
|
<span id="L534"><span class="lineNum"> 534</span> : protected:</span>
|
|
<span id="L535"><span class="lineNum"> 535</span> : /// True if it's cheap enough to take parameters by value. Doing so avoids</span>
|
|
<span id="L536"><span class="lineNum"> 536</span> : /// overhead related to mitigations for reference invalidation.</span>
|
|
<span id="L537"><span class="lineNum"> 537</span> : static constexpr bool TakesParamByValue = sizeof(T) <= 2 * sizeof(void*);</span>
|
|
<span id="L538"><span class="lineNum"> 538</span> : </span>
|
|
<span id="L539"><span class="lineNum"> 539</span> : /// Either const T& or T, depending on whether it's cheap enough to take</span>
|
|
<span id="L540"><span class="lineNum"> 540</span> : /// parameters by value.</span>
|
|
<span id="L541"><span class="lineNum"> 541</span> : using ValueParamT =</span>
|
|
<span id="L542"><span class="lineNum"> 542</span> : typename std::conditional<TakesParamByValue, T, const T&>::type;</span>
|
|
<span id="L543"><span class="lineNum"> 543</span> : </span>
|
|
<span id="L544"><span class="lineNum"> 544</span> <span class="tlaUNC"> 0 : SmallVectorTemplateBase(size_t Size) : SmallVectorTemplateCommon<T>(Size) {}</span></span>
|
|
<span id="L545"><span class="lineNum"> 545</span> : </span>
|
|
<span id="L546"><span class="lineNum"> 546</span> : // No need to do a destroy loop for POD's.</span>
|
|
<span id="L547"><span class="lineNum"> 547</span> <span class="tlaUNC"> 0 : static void destroy_range(T*, T*) {}</span></span>
|
|
<span id="L548"><span class="lineNum"> 548</span> : </span>
|
|
<span id="L549"><span class="lineNum"> 549</span> : /// Move the range [I, E) onto the uninitialized memory</span>
|
|
<span id="L550"><span class="lineNum"> 550</span> : /// starting with "Dest", constructing elements into it as needed.</span>
|
|
<span id="L551"><span class="lineNum"> 551</span> : template <typename It1, typename It2></span>
|
|
<span id="L552"><span class="lineNum"> 552</span> : static void uninitialized_move(It1 I, It1 E, It2 Dest) {</span>
|
|
<span id="L553"><span class="lineNum"> 553</span> : // Just do a copy.</span>
|
|
<span id="L554"><span class="lineNum"> 554</span> : uninitialized_copy(I, E, Dest);</span>
|
|
<span id="L555"><span class="lineNum"> 555</span> : }</span>
|
|
<span id="L556"><span class="lineNum"> 556</span> : </span>
|
|
<span id="L557"><span class="lineNum"> 557</span> : /// Copy the range [I, E) onto the uninitialized memory</span>
|
|
<span id="L558"><span class="lineNum"> 558</span> : /// starting with "Dest", constructing elements into it as needed.</span>
|
|
<span id="L559"><span class="lineNum"> 559</span> : template <typename It1, typename It2></span>
|
|
<span id="L560"><span class="lineNum"> 560</span> : static void uninitialized_copy(It1 I, It1 E, It2 Dest) {</span>
|
|
<span id="L561"><span class="lineNum"> 561</span> : // Arbitrary iterator types; just use the basic implementation.</span>
|
|
<span id="L562"><span class="lineNum"> 562</span> : std::uninitialized_copy(I, E, Dest);</span>
|
|
<span id="L563"><span class="lineNum"> 563</span> : }</span>
|
|
<span id="L564"><span class="lineNum"> 564</span> : </span>
|
|
<span id="L565"><span class="lineNum"> 565</span> : /// Copy the range [I, E) onto the uninitialized memory</span>
|
|
<span id="L566"><span class="lineNum"> 566</span> : /// starting with "Dest", constructing elements into it as needed.</span>
|
|
<span id="L567"><span class="lineNum"> 567</span> : template <typename T1, typename T2></span>
|
|
<span id="L568"><span class="lineNum"> 568</span> : static void uninitialized_copy(</span>
|
|
<span id="L569"><span class="lineNum"> 569</span> : T1* I,</span>
|
|
<span id="L570"><span class="lineNum"> 570</span> : T1* E,</span>
|
|
<span id="L571"><span class="lineNum"> 571</span> : T2* Dest,</span>
|
|
<span id="L572"><span class="lineNum"> 572</span> : std::enable_if_t<</span>
|
|
<span id="L573"><span class="lineNum"> 573</span> : std::is_same<typename std::remove_const<T1>::type, T2>::value>* =</span>
|
|
<span id="L574"><span class="lineNum"> 574</span> : nullptr) {</span>
|
|
<span id="L575"><span class="lineNum"> 575</span> : // Use memcpy for PODs iterated by pointers (which includes SmallVector</span>
|
|
<span id="L576"><span class="lineNum"> 576</span> : // iterators): std::uninitialized_copy optimizes to memmove, but we can</span>
|
|
<span id="L577"><span class="lineNum"> 577</span> : // use memcpy here. Note that I and E are iterators and thus might be</span>
|
|
<span id="L578"><span class="lineNum"> 578</span> : // invalid for memcpy if they are equal.</span>
|
|
<span id="L579"><span class="lineNum"> 579</span> : if (I != E)</span>
|
|
<span id="L580"><span class="lineNum"> 580</span> : memcpy(reinterpret_cast<void*>(Dest), I, (E - I) * sizeof(T));</span>
|
|
<span id="L581"><span class="lineNum"> 581</span> : }</span>
|
|
<span id="L582"><span class="lineNum"> 582</span> : </span>
|
|
<span id="L583"><span class="lineNum"> 583</span> : /// Double the size of the allocated memory, guaranteeing space for at</span>
|
|
<span id="L584"><span class="lineNum"> 584</span> : /// least one more element or MinSize if specified.</span>
|
|
<span id="L585"><span class="lineNum"> 585</span> <span class="tlaUNC"> 0 : void grow(size_t MinSize = 0) {</span></span>
|
|
<span id="L586"><span class="lineNum"> 586</span> <span class="tlaUNC"> 0 : this->grow_pod(MinSize, sizeof(T));</span></span>
|
|
<span id="L587"><span class="lineNum"> 587</span> <span class="tlaUNC"> 0 : }</span></span>
|
|
<span id="L588"><span class="lineNum"> 588</span> : </span>
|
|
<span id="L589"><span class="lineNum"> 589</span> : /// Reserve enough space to add one element, and return the updated element</span>
|
|
<span id="L590"><span class="lineNum"> 590</span> : /// pointer in case it was a reference to the storage.</span>
|
|
<span id="L591"><span class="lineNum"> 591</span> : const T* reserveForParamAndGetAddress(const T& Elt, size_t N = 1) {</span>
|
|
<span id="L592"><span class="lineNum"> 592</span> : return this->reserveForParamAndGetAddressImpl(this, Elt, N);</span>
|
|
<span id="L593"><span class="lineNum"> 593</span> : }</span>
|
|
<span id="L594"><span class="lineNum"> 594</span> : </span>
|
|
<span id="L595"><span class="lineNum"> 595</span> : /// Reserve enough space to add one element, and return the updated element</span>
|
|
<span id="L596"><span class="lineNum"> 596</span> : /// pointer in case it was a reference to the storage.</span>
|
|
<span id="L597"><span class="lineNum"> 597</span> <span class="tlaUNC"> 0 : T* reserveForParamAndGetAddress(T& Elt, size_t N = 1) {</span></span>
|
|
<span id="L598"><span class="lineNum"> 598</span> <span class="tlaUNC"> 0 : return const_cast<T*>(this->reserveForParamAndGetAddressImpl(this, Elt, N));</span></span>
|
|
<span id="L599"><span class="lineNum"> 599</span> : }</span>
|
|
<span id="L600"><span class="lineNum"> 600</span> : </span>
|
|
<span id="L601"><span class="lineNum"> 601</span> : /// Copy \p V or return a reference, depending on \a ValueParamT.</span>
|
|
<span id="L602"><span class="lineNum"> 602</span> : static ValueParamT forward_value_param(ValueParamT V) {</span>
|
|
<span id="L603"><span class="lineNum"> 603</span> : return V;</span>
|
|
<span id="L604"><span class="lineNum"> 604</span> : }</span>
|
|
<span id="L605"><span class="lineNum"> 605</span> : </span>
|
|
<span id="L606"><span class="lineNum"> 606</span> : void growAndAssign(size_t NumElts, T Elt) {</span>
|
|
<span id="L607"><span class="lineNum"> 607</span> : // Elt has been copied in case it's an internal reference, side-stepping</span>
|
|
<span id="L608"><span class="lineNum"> 608</span> : // reference invalidation problems without losing the realloc optimization.</span>
|
|
<span id="L609"><span class="lineNum"> 609</span> : this->set_size(0);</span>
|
|
<span id="L610"><span class="lineNum"> 610</span> : this->grow(NumElts);</span>
|
|
<span id="L611"><span class="lineNum"> 611</span> : std::uninitialized_fill_n(this->begin(), NumElts, Elt);</span>
|
|
<span id="L612"><span class="lineNum"> 612</span> : this->set_size(NumElts);</span>
|
|
<span id="L613"><span class="lineNum"> 613</span> : }</span>
|
|
<span id="L614"><span class="lineNum"> 614</span> : </span>
|
|
<span id="L615"><span class="lineNum"> 615</span> : template <typename... ArgTypes></span>
|
|
<span id="L616"><span class="lineNum"> 616</span> : T& growAndEmplaceBack(ArgTypes&&... Args) {</span>
|
|
<span id="L617"><span class="lineNum"> 617</span> : // Use push_back with a copy in case Args has an internal reference,</span>
|
|
<span id="L618"><span class="lineNum"> 618</span> : // side-stepping reference invalidation problems without losing the realloc</span>
|
|
<span id="L619"><span class="lineNum"> 619</span> : // optimization.</span>
|
|
<span id="L620"><span class="lineNum"> 620</span> : push_back(T(std::forward<ArgTypes>(Args)...));</span>
|
|
<span id="L621"><span class="lineNum"> 621</span> : return this->back();</span>
|
|
<span id="L622"><span class="lineNum"> 622</span> : }</span>
|
|
<span id="L623"><span class="lineNum"> 623</span> : </span>
|
|
<span id="L624"><span class="lineNum"> 624</span> : public:</span>
|
|
<span id="L625"><span class="lineNum"> 625</span> <span class="tlaUNC"> 0 : void push_back(ValueParamT Elt) {</span></span>
|
|
<span id="L626"><span class="lineNum"> 626</span> <span class="tlaUNC"> 0 : const T* EltPtr = reserveForParamAndGetAddress(Elt);</span></span>
|
|
<span id="L627"><span class="lineNum"> 627</span> <span class="tlaUNC"> 0 : memcpy(reinterpret_cast<void*>(this->end()), EltPtr, sizeof(T));</span></span>
|
|
<span id="L628"><span class="lineNum"> 628</span> <span class="tlaUNC"> 0 : this->set_size(this->size() + 1);</span></span>
|
|
<span id="L629"><span class="lineNum"> 629</span> <span class="tlaUNC"> 0 : }</span></span>
|
|
<span id="L630"><span class="lineNum"> 630</span> : </span>
|
|
<span id="L631"><span class="lineNum"> 631</span> : void pop_back() {</span>
|
|
<span id="L632"><span class="lineNum"> 632</span> : this->set_size(this->size() - 1);</span>
|
|
<span id="L633"><span class="lineNum"> 633</span> : }</span>
|
|
<span id="L634"><span class="lineNum"> 634</span> : };</span>
|
|
<span id="L635"><span class="lineNum"> 635</span> : </span>
|
|
<span id="L636"><span class="lineNum"> 636</span> : /// This class consists of common code factored out of the SmallVector class to</span>
|
|
<span id="L637"><span class="lineNum"> 637</span> : /// reduce code duplication based on the SmallVector 'N' template parameter.</span>
|
|
<span id="L638"><span class="lineNum"> 638</span> : template <typename T></span>
|
|
<span id="L639"><span class="lineNum"> 639</span> : class SmallVectorImpl : public SmallVectorTemplateBase<T> {</span>
|
|
<span id="L640"><span class="lineNum"> 640</span> : using SuperClass = SmallVectorTemplateBase<T>;</span>
|
|
<span id="L641"><span class="lineNum"> 641</span> : </span>
|
|
<span id="L642"><span class="lineNum"> 642</span> : public:</span>
|
|
<span id="L643"><span class="lineNum"> 643</span> : using iterator = typename SuperClass::iterator;</span>
|
|
<span id="L644"><span class="lineNum"> 644</span> : using const_iterator = typename SuperClass::const_iterator;</span>
|
|
<span id="L645"><span class="lineNum"> 645</span> : using reference = typename SuperClass::reference;</span>
|
|
<span id="L646"><span class="lineNum"> 646</span> : using size_type = typename SuperClass::size_type;</span>
|
|
<span id="L647"><span class="lineNum"> 647</span> : </span>
|
|
<span id="L648"><span class="lineNum"> 648</span> : protected:</span>
|
|
<span id="L649"><span class="lineNum"> 649</span> : using SmallVectorTemplateBase<T>::TakesParamByValue;</span>
|
|
<span id="L650"><span class="lineNum"> 650</span> : using ValueParamT = typename SuperClass::ValueParamT;</span>
|
|
<span id="L651"><span class="lineNum"> 651</span> : </span>
|
|
<span id="L652"><span class="lineNum"> 652</span> : // Default ctor - Initialize to empty.</span>
|
|
<span id="L653"><span class="lineNum"> 653</span> <span class="tlaUNC"> 0 : explicit SmallVectorImpl(unsigned N) : SmallVectorTemplateBase<T>(N) {}</span></span>
|
|
<span id="L654"><span class="lineNum"> 654</span> : </span>
|
|
<span id="L655"><span class="lineNum"> 655</span> : public:</span>
|
|
<span id="L656"><span class="lineNum"> 656</span> : SmallVectorImpl(const SmallVectorImpl&) = delete;</span>
|
|
<span id="L657"><span class="lineNum"> 657</span> : </span>
|
|
<span id="L658"><span class="lineNum"> 658</span> <span class="tlaUNC"> 0 : ~SmallVectorImpl() {</span></span>
|
|
<span id="L659"><span class="lineNum"> 659</span> : // Subclass has already destructed this vector's elements.</span>
|
|
<span id="L660"><span class="lineNum"> 660</span> : // If this wasn't grown from the inline copy, deallocate the old space.</span>
|
|
<span id="L661"><span class="lineNum"> 661</span> <span class="tlaUNC"> 0 : if (!this->isSmall())</span></span>
|
|
<span id="L662"><span class="lineNum"> 662</span> <span class="tlaUNC"> 0 : free(this->begin());</span></span>
|
|
<span id="L663"><span class="lineNum"> 663</span> <span class="tlaUNC"> 0 : }</span></span>
|
|
<span id="L664"><span class="lineNum"> 664</span> : </span>
|
|
<span id="L665"><span class="lineNum"> 665</span> : void clear() {</span>
|
|
<span id="L666"><span class="lineNum"> 666</span> : this->destroy_range(this->begin(), this->end());</span>
|
|
<span id="L667"><span class="lineNum"> 667</span> : this->Size = 0;</span>
|
|
<span id="L668"><span class="lineNum"> 668</span> : }</span>
|
|
<span id="L669"><span class="lineNum"> 669</span> : </span>
|
|
<span id="L670"><span class="lineNum"> 670</span> : private:</span>
|
|
<span id="L671"><span class="lineNum"> 671</span> : template <bool ForOverwrite></span>
|
|
<span id="L672"><span class="lineNum"> 672</span> : void resizeImpl(size_type N) {</span>
|
|
<span id="L673"><span class="lineNum"> 673</span> : if (N < this->size()) {</span>
|
|
<span id="L674"><span class="lineNum"> 674</span> : this->pop_back_n(this->size() - N);</span>
|
|
<span id="L675"><span class="lineNum"> 675</span> : } else if (N > this->size()) {</span>
|
|
<span id="L676"><span class="lineNum"> 676</span> : this->reserve(N);</span>
|
|
<span id="L677"><span class="lineNum"> 677</span> : for (auto I = this->end(), E = this->begin() + N; I != E; ++I)</span>
|
|
<span id="L678"><span class="lineNum"> 678</span> : if (ForOverwrite)</span>
|
|
<span id="L679"><span class="lineNum"> 679</span> : new (&*I) T;</span>
|
|
<span id="L680"><span class="lineNum"> 680</span> : else</span>
|
|
<span id="L681"><span class="lineNum"> 681</span> : new (&*I) T();</span>
|
|
<span id="L682"><span class="lineNum"> 682</span> : this->set_size(N);</span>
|
|
<span id="L683"><span class="lineNum"> 683</span> : }</span>
|
|
<span id="L684"><span class="lineNum"> 684</span> : }</span>
|
|
<span id="L685"><span class="lineNum"> 685</span> : </span>
|
|
<span id="L686"><span class="lineNum"> 686</span> : public:</span>
|
|
<span id="L687"><span class="lineNum"> 687</span> : void resize(size_type N) {</span>
|
|
<span id="L688"><span class="lineNum"> 688</span> : resizeImpl<false>(N);</span>
|
|
<span id="L689"><span class="lineNum"> 689</span> : }</span>
|
|
<span id="L690"><span class="lineNum"> 690</span> : </span>
|
|
<span id="L691"><span class="lineNum"> 691</span> : /// Like resize, but \ref T is POD, the new values won't be initialized.</span>
|
|
<span id="L692"><span class="lineNum"> 692</span> : void resize_for_overwrite(size_type N) {</span>
|
|
<span id="L693"><span class="lineNum"> 693</span> : resizeImpl<true>(N);</span>
|
|
<span id="L694"><span class="lineNum"> 694</span> : }</span>
|
|
<span id="L695"><span class="lineNum"> 695</span> : </span>
|
|
<span id="L696"><span class="lineNum"> 696</span> : void resize(size_type N, ValueParamT NV) {</span>
|
|
<span id="L697"><span class="lineNum"> 697</span> : if (N == this->size())</span>
|
|
<span id="L698"><span class="lineNum"> 698</span> : return;</span>
|
|
<span id="L699"><span class="lineNum"> 699</span> : </span>
|
|
<span id="L700"><span class="lineNum"> 700</span> : if (N < this->size()) {</span>
|
|
<span id="L701"><span class="lineNum"> 701</span> : this->pop_back_n(this->size() - N);</span>
|
|
<span id="L702"><span class="lineNum"> 702</span> : return;</span>
|
|
<span id="L703"><span class="lineNum"> 703</span> : }</span>
|
|
<span id="L704"><span class="lineNum"> 704</span> : </span>
|
|
<span id="L705"><span class="lineNum"> 705</span> : // N > this->size(). Defer to append.</span>
|
|
<span id="L706"><span class="lineNum"> 706</span> : this->append(N - this->size(), NV);</span>
|
|
<span id="L707"><span class="lineNum"> 707</span> : }</span>
|
|
<span id="L708"><span class="lineNum"> 708</span> : </span>
|
|
<span id="L709"><span class="lineNum"> 709</span> <span class="tlaUNC"> 0 : void reserve(size_type N) {</span></span>
|
|
<span id="L710"><span class="lineNum"> 710</span> <span class="tlaUNC"> 0 : if (this->capacity() < N)</span></span>
|
|
<span id="L711"><span class="lineNum"> 711</span> <span class="tlaUNC"> 0 : this->grow(N);</span></span>
|
|
<span id="L712"><span class="lineNum"> 712</span> <span class="tlaUNC"> 0 : }</span></span>
|
|
<span id="L713"><span class="lineNum"> 713</span> : </span>
|
|
<span id="L714"><span class="lineNum"> 714</span> : void pop_back_n(size_type NumItems) {</span>
|
|
<span id="L715"><span class="lineNum"> 715</span> : assert(this->size() >= NumItems);</span>
|
|
<span id="L716"><span class="lineNum"> 716</span> : this->destroy_range(this->end() - NumItems, this->end());</span>
|
|
<span id="L717"><span class="lineNum"> 717</span> : this->set_size(this->size() - NumItems);</span>
|
|
<span id="L718"><span class="lineNum"> 718</span> : }</span>
|
|
<span id="L719"><span class="lineNum"> 719</span> : </span>
|
|
<span id="L720"><span class="lineNum"> 720</span> : C10_NODISCARD T pop_back_val() {</span>
|
|
<span id="L721"><span class="lineNum"> 721</span> : T Result = ::std::move(this->back());</span>
|
|
<span id="L722"><span class="lineNum"> 722</span> : this->pop_back();</span>
|
|
<span id="L723"><span class="lineNum"> 723</span> : return Result;</span>
|
|
<span id="L724"><span class="lineNum"> 724</span> : }</span>
|
|
<span id="L725"><span class="lineNum"> 725</span> : </span>
|
|
<span id="L726"><span class="lineNum"> 726</span> : void swap(SmallVectorImpl& RHS);</span>
|
|
<span id="L727"><span class="lineNum"> 727</span> : </span>
|
|
<span id="L728"><span class="lineNum"> 728</span> : /// Add the specified range to the end of the SmallVector.</span>
|
|
<span id="L729"><span class="lineNum"> 729</span> : template <</span>
|
|
<span id="L730"><span class="lineNum"> 730</span> : typename in_iter,</span>
|
|
<span id="L731"><span class="lineNum"> 731</span> : typename = std::enable_if_t<std::is_convertible<</span>
|
|
<span id="L732"><span class="lineNum"> 732</span> : typename std::iterator_traits<in_iter>::iterator_category,</span>
|
|
<span id="L733"><span class="lineNum"> 733</span> : std::input_iterator_tag>::value>></span>
|
|
<span id="L734"><span class="lineNum"> 734</span> : void append(in_iter in_start, in_iter in_end) {</span>
|
|
<span id="L735"><span class="lineNum"> 735</span> : this->assertSafeToAddRange(in_start, in_end);</span>
|
|
<span id="L736"><span class="lineNum"> 736</span> : size_type NumInputs = std::distance(in_start, in_end);</span>
|
|
<span id="L737"><span class="lineNum"> 737</span> : this->reserve(this->size() + NumInputs);</span>
|
|
<span id="L738"><span class="lineNum"> 738</span> : this->uninitialized_copy(in_start, in_end, this->end());</span>
|
|
<span id="L739"><span class="lineNum"> 739</span> : this->set_size(this->size() + NumInputs);</span>
|
|
<span id="L740"><span class="lineNum"> 740</span> : }</span>
|
|
<span id="L741"><span class="lineNum"> 741</span> : </span>
|
|
<span id="L742"><span class="lineNum"> 742</span> : /// Append \p NumInputs copies of \p Elt to the end.</span>
|
|
<span id="L743"><span class="lineNum"> 743</span> : void append(size_type NumInputs, ValueParamT Elt) {</span>
|
|
<span id="L744"><span class="lineNum"> 744</span> : const T* EltPtr = this->reserveForParamAndGetAddress(Elt, NumInputs);</span>
|
|
<span id="L745"><span class="lineNum"> 745</span> : std::uninitialized_fill_n(this->end(), NumInputs, *EltPtr);</span>
|
|
<span id="L746"><span class="lineNum"> 746</span> : this->set_size(this->size() + NumInputs);</span>
|
|
<span id="L747"><span class="lineNum"> 747</span> : }</span>
|
|
<span id="L748"><span class="lineNum"> 748</span> : </span>
|
|
<span id="L749"><span class="lineNum"> 749</span> : void append(std::initializer_list<T> IL) {</span>
|
|
<span id="L750"><span class="lineNum"> 750</span> : append(IL.begin(), IL.end());</span>
|
|
<span id="L751"><span class="lineNum"> 751</span> : }</span>
|
|
<span id="L752"><span class="lineNum"> 752</span> : </span>
|
|
<span id="L753"><span class="lineNum"> 753</span> : void append(const SmallVectorImpl& RHS) {</span>
|
|
<span id="L754"><span class="lineNum"> 754</span> : append(RHS.begin(), RHS.end());</span>
|
|
<span id="L755"><span class="lineNum"> 755</span> : }</span>
|
|
<span id="L756"><span class="lineNum"> 756</span> : </span>
|
|
<span id="L757"><span class="lineNum"> 757</span> : void assign(size_type NumElts, ValueParamT Elt) {</span>
|
|
<span id="L758"><span class="lineNum"> 758</span> : // Note that Elt could be an internal reference.</span>
|
|
<span id="L759"><span class="lineNum"> 759</span> : if (NumElts > this->capacity()) {</span>
|
|
<span id="L760"><span class="lineNum"> 760</span> : this->growAndAssign(NumElts, Elt);</span>
|
|
<span id="L761"><span class="lineNum"> 761</span> : return;</span>
|
|
<span id="L762"><span class="lineNum"> 762</span> : }</span>
|
|
<span id="L763"><span class="lineNum"> 763</span> : </span>
|
|
<span id="L764"><span class="lineNum"> 764</span> : // Assign over existing elements.</span>
|
|
<span id="L765"><span class="lineNum"> 765</span> : std::fill_n(this->begin(), std::min(NumElts, this->size()), Elt);</span>
|
|
<span id="L766"><span class="lineNum"> 766</span> : if (NumElts > this->size())</span>
|
|
<span id="L767"><span class="lineNum"> 767</span> : std::uninitialized_fill_n(this->end(), NumElts - this->size(), Elt);</span>
|
|
<span id="L768"><span class="lineNum"> 768</span> : else if (NumElts < this->size())</span>
|
|
<span id="L769"><span class="lineNum"> 769</span> : this->destroy_range(this->begin() + NumElts, this->end());</span>
|
|
<span id="L770"><span class="lineNum"> 770</span> : this->set_size(NumElts);</span>
|
|
<span id="L771"><span class="lineNum"> 771</span> : }</span>
|
|
<span id="L772"><span class="lineNum"> 772</span> : </span>
|
|
<span id="L773"><span class="lineNum"> 773</span> : // FIXME: Consider assigning over existing elements, rather than clearing &</span>
|
|
<span id="L774"><span class="lineNum"> 774</span> : // re-initializing them - for all assign(...) variants.</span>
|
|
<span id="L775"><span class="lineNum"> 775</span> : </span>
|
|
<span id="L776"><span class="lineNum"> 776</span> : template <</span>
|
|
<span id="L777"><span class="lineNum"> 777</span> : typename in_iter,</span>
|
|
<span id="L778"><span class="lineNum"> 778</span> : typename = std::enable_if_t<std::is_convertible<</span>
|
|
<span id="L779"><span class="lineNum"> 779</span> : typename std::iterator_traits<in_iter>::iterator_category,</span>
|
|
<span id="L780"><span class="lineNum"> 780</span> : std::input_iterator_tag>::value>></span>
|
|
<span id="L781"><span class="lineNum"> 781</span> : void assign(in_iter in_start, in_iter in_end) {</span>
|
|
<span id="L782"><span class="lineNum"> 782</span> : this->assertSafeToReferenceAfterClear(in_start, in_end);</span>
|
|
<span id="L783"><span class="lineNum"> 783</span> : clear();</span>
|
|
<span id="L784"><span class="lineNum"> 784</span> : append(in_start, in_end);</span>
|
|
<span id="L785"><span class="lineNum"> 785</span> : }</span>
|
|
<span id="L786"><span class="lineNum"> 786</span> : </span>
|
|
<span id="L787"><span class="lineNum"> 787</span> : void assign(std::initializer_list<T> IL) {</span>
|
|
<span id="L788"><span class="lineNum"> 788</span> : clear();</span>
|
|
<span id="L789"><span class="lineNum"> 789</span> : append(IL);</span>
|
|
<span id="L790"><span class="lineNum"> 790</span> : }</span>
|
|
<span id="L791"><span class="lineNum"> 791</span> : </span>
|
|
<span id="L792"><span class="lineNum"> 792</span> : void assign(const SmallVectorImpl& RHS) {</span>
|
|
<span id="L793"><span class="lineNum"> 793</span> : assign(RHS.begin(), RHS.end());</span>
|
|
<span id="L794"><span class="lineNum"> 794</span> : }</span>
|
|
<span id="L795"><span class="lineNum"> 795</span> : </span>
|
|
<span id="L796"><span class="lineNum"> 796</span> : iterator erase(const_iterator CI) {</span>
|
|
<span id="L797"><span class="lineNum"> 797</span> : // Just cast away constness because this is a non-const member function.</span>
|
|
<span id="L798"><span class="lineNum"> 798</span> : iterator I = const_cast<iterator>(CI);</span>
|
|
<span id="L799"><span class="lineNum"> 799</span> : </span>
|
|
<span id="L800"><span class="lineNum"> 800</span> : assert(</span>
|
|
<span id="L801"><span class="lineNum"> 801</span> : this->isReferenceToStorage(CI) &&</span>
|
|
<span id="L802"><span class="lineNum"> 802</span> : "Iterator to erase is out of bounds.");</span>
|
|
<span id="L803"><span class="lineNum"> 803</span> : </span>
|
|
<span id="L804"><span class="lineNum"> 804</span> : iterator N = I;</span>
|
|
<span id="L805"><span class="lineNum"> 805</span> : // Shift all elts down one.</span>
|
|
<span id="L806"><span class="lineNum"> 806</span> : std::move(I + 1, this->end(), I);</span>
|
|
<span id="L807"><span class="lineNum"> 807</span> : // Drop the last elt.</span>
|
|
<span id="L808"><span class="lineNum"> 808</span> : this->pop_back();</span>
|
|
<span id="L809"><span class="lineNum"> 809</span> : return (N);</span>
|
|
<span id="L810"><span class="lineNum"> 810</span> : }</span>
|
|
<span id="L811"><span class="lineNum"> 811</span> : </span>
|
|
<span id="L812"><span class="lineNum"> 812</span> : iterator erase(const_iterator CS, const_iterator CE) {</span>
|
|
<span id="L813"><span class="lineNum"> 813</span> : // Just cast away constness because this is a non-const member function.</span>
|
|
<span id="L814"><span class="lineNum"> 814</span> : iterator S = const_cast<iterator>(CS);</span>
|
|
<span id="L815"><span class="lineNum"> 815</span> : iterator E = const_cast<iterator>(CE);</span>
|
|
<span id="L816"><span class="lineNum"> 816</span> : </span>
|
|
<span id="L817"><span class="lineNum"> 817</span> : assert(this->isRangeInStorage(S, E) && "Range to erase is out of bounds.");</span>
|
|
<span id="L818"><span class="lineNum"> 818</span> : </span>
|
|
<span id="L819"><span class="lineNum"> 819</span> : iterator N = S;</span>
|
|
<span id="L820"><span class="lineNum"> 820</span> : // Shift all elts down.</span>
|
|
<span id="L821"><span class="lineNum"> 821</span> : iterator I = std::move(E, this->end(), S);</span>
|
|
<span id="L822"><span class="lineNum"> 822</span> : // Drop the last elts.</span>
|
|
<span id="L823"><span class="lineNum"> 823</span> : this->destroy_range(I, this->end());</span>
|
|
<span id="L824"><span class="lineNum"> 824</span> : this->set_size(I - this->begin());</span>
|
|
<span id="L825"><span class="lineNum"> 825</span> : return (N);</span>
|
|
<span id="L826"><span class="lineNum"> 826</span> : }</span>
|
|
<span id="L827"><span class="lineNum"> 827</span> : </span>
|
|
<span id="L828"><span class="lineNum"> 828</span> : private:</span>
|
|
<span id="L829"><span class="lineNum"> 829</span> : template <class ArgType></span>
|
|
<span id="L830"><span class="lineNum"> 830</span> : iterator insert_one_impl(iterator I, ArgType&& Elt) {</span>
|
|
<span id="L831"><span class="lineNum"> 831</span> : // Callers ensure that ArgType is derived from T.</span>
|
|
<span id="L832"><span class="lineNum"> 832</span> : static_assert(</span>
|
|
<span id="L833"><span class="lineNum"> 833</span> : std::is_same<std::remove_const_t<std::remove_reference_t<ArgType>>, T>::</span>
|
|
<span id="L834"><span class="lineNum"> 834</span> : value,</span>
|
|
<span id="L835"><span class="lineNum"> 835</span> : "ArgType must be derived from T!");</span>
|
|
<span id="L836"><span class="lineNum"> 836</span> : </span>
|
|
<span id="L837"><span class="lineNum"> 837</span> : if (I == this->end()) { // Important special case for empty vector.</span>
|
|
<span id="L838"><span class="lineNum"> 838</span> : this->push_back(::std::forward<ArgType>(Elt));</span>
|
|
<span id="L839"><span class="lineNum"> 839</span> : return this->end() - 1;</span>
|
|
<span id="L840"><span class="lineNum"> 840</span> : }</span>
|
|
<span id="L841"><span class="lineNum"> 841</span> : </span>
|
|
<span id="L842"><span class="lineNum"> 842</span> : assert(</span>
|
|
<span id="L843"><span class="lineNum"> 843</span> : this->isReferenceToStorage(I) &&</span>
|
|
<span id="L844"><span class="lineNum"> 844</span> : "Insertion iterator is out of bounds.");</span>
|
|
<span id="L845"><span class="lineNum"> 845</span> : </span>
|
|
<span id="L846"><span class="lineNum"> 846</span> : // Grow if necessary.</span>
|
|
<span id="L847"><span class="lineNum"> 847</span> : size_t Index = I - this->begin();</span>
|
|
<span id="L848"><span class="lineNum"> 848</span> : std::remove_reference_t<ArgType>* EltPtr =</span>
|
|
<span id="L849"><span class="lineNum"> 849</span> : this->reserveForParamAndGetAddress(Elt);</span>
|
|
<span id="L850"><span class="lineNum"> 850</span> : I = this->begin() + Index;</span>
|
|
<span id="L851"><span class="lineNum"> 851</span> : </span>
|
|
<span id="L852"><span class="lineNum"> 852</span> : ::new ((void*)this->end()) T(::std::move(this->back()));</span>
|
|
<span id="L853"><span class="lineNum"> 853</span> : // Push everything else over.</span>
|
|
<span id="L854"><span class="lineNum"> 854</span> : std::move_backward(I, this->end() - 1, this->end());</span>
|
|
<span id="L855"><span class="lineNum"> 855</span> : this->set_size(this->size() + 1);</span>
|
|
<span id="L856"><span class="lineNum"> 856</span> : </span>
|
|
<span id="L857"><span class="lineNum"> 857</span> : // If we just moved the element we're inserting, be sure to update</span>
|
|
<span id="L858"><span class="lineNum"> 858</span> : // the reference (never happens if TakesParamByValue).</span>
|
|
<span id="L859"><span class="lineNum"> 859</span> : static_assert(</span>
|
|
<span id="L860"><span class="lineNum"> 860</span> : !TakesParamByValue || std::is_same<ArgType, T>::value,</span>
|
|
<span id="L861"><span class="lineNum"> 861</span> : "ArgType must be 'T' when taking by value!");</span>
|
|
<span id="L862"><span class="lineNum"> 862</span> : if (!TakesParamByValue && this->isReferenceToRange(EltPtr, I, this->end()))</span>
|
|
<span id="L863"><span class="lineNum"> 863</span> : ++EltPtr;</span>
|
|
<span id="L864"><span class="lineNum"> 864</span> : </span>
|
|
<span id="L865"><span class="lineNum"> 865</span> : *I = ::std::forward<ArgType>(*EltPtr);</span>
|
|
<span id="L866"><span class="lineNum"> 866</span> : return I;</span>
|
|
<span id="L867"><span class="lineNum"> 867</span> : }</span>
|
|
<span id="L868"><span class="lineNum"> 868</span> : </span>
|
|
<span id="L869"><span class="lineNum"> 869</span> : public:</span>
|
|
<span id="L870"><span class="lineNum"> 870</span> : iterator insert(iterator I, T&& Elt) {</span>
|
|
<span id="L871"><span class="lineNum"> 871</span> : return insert_one_impl(I, this->forward_value_param(std::move(Elt)));</span>
|
|
<span id="L872"><span class="lineNum"> 872</span> : }</span>
|
|
<span id="L873"><span class="lineNum"> 873</span> : </span>
|
|
<span id="L874"><span class="lineNum"> 874</span> : iterator insert(iterator I, const T& Elt) {</span>
|
|
<span id="L875"><span class="lineNum"> 875</span> : return insert_one_impl(I, this->forward_value_param(Elt));</span>
|
|
<span id="L876"><span class="lineNum"> 876</span> : }</span>
|
|
<span id="L877"><span class="lineNum"> 877</span> : </span>
|
|
<span id="L878"><span class="lineNum"> 878</span> : iterator insert(iterator I, size_type NumToInsert, ValueParamT Elt) {</span>
|
|
<span id="L879"><span class="lineNum"> 879</span> : // Convert iterator to elt# to avoid invalidating iterator when we reserve()</span>
|
|
<span id="L880"><span class="lineNum"> 880</span> : size_t InsertElt = I - this->begin();</span>
|
|
<span id="L881"><span class="lineNum"> 881</span> : </span>
|
|
<span id="L882"><span class="lineNum"> 882</span> : if (I == this->end()) { // Important special case for empty vector.</span>
|
|
<span id="L883"><span class="lineNum"> 883</span> : append(NumToInsert, Elt);</span>
|
|
<span id="L884"><span class="lineNum"> 884</span> : return this->begin() + InsertElt;</span>
|
|
<span id="L885"><span class="lineNum"> 885</span> : }</span>
|
|
<span id="L886"><span class="lineNum"> 886</span> : </span>
|
|
<span id="L887"><span class="lineNum"> 887</span> : assert(</span>
|
|
<span id="L888"><span class="lineNum"> 888</span> : this->isReferenceToStorage(I) &&</span>
|
|
<span id="L889"><span class="lineNum"> 889</span> : "Insertion iterator is out of bounds.");</span>
|
|
<span id="L890"><span class="lineNum"> 890</span> : </span>
|
|
<span id="L891"><span class="lineNum"> 891</span> : // Ensure there is enough space, and get the (maybe updated) address of</span>
|
|
<span id="L892"><span class="lineNum"> 892</span> : // Elt.</span>
|
|
<span id="L893"><span class="lineNum"> 893</span> : const T* EltPtr = this->reserveForParamAndGetAddress(Elt, NumToInsert);</span>
|
|
<span id="L894"><span class="lineNum"> 894</span> : </span>
|
|
<span id="L895"><span class="lineNum"> 895</span> : // Uninvalidate the iterator.</span>
|
|
<span id="L896"><span class="lineNum"> 896</span> : I = this->begin() + InsertElt;</span>
|
|
<span id="L897"><span class="lineNum"> 897</span> : </span>
|
|
<span id="L898"><span class="lineNum"> 898</span> : // If there are more elements between the insertion point and the end of the</span>
|
|
<span id="L899"><span class="lineNum"> 899</span> : // range than there are being inserted, we can use a simple approach to</span>
|
|
<span id="L900"><span class="lineNum"> 900</span> : // insertion. Since we already reserved space, we know that this won't</span>
|
|
<span id="L901"><span class="lineNum"> 901</span> : // reallocate the vector.</span>
|
|
<span id="L902"><span class="lineNum"> 902</span> : if (size_t(this->end() - I) >= NumToInsert) {</span>
|
|
<span id="L903"><span class="lineNum"> 903</span> : T* OldEnd = this->end();</span>
|
|
<span id="L904"><span class="lineNum"> 904</span> : append(</span>
|
|
<span id="L905"><span class="lineNum"> 905</span> : std::move_iterator<iterator>(this->end() - NumToInsert),</span>
|
|
<span id="L906"><span class="lineNum"> 906</span> : std::move_iterator<iterator>(this->end()));</span>
|
|
<span id="L907"><span class="lineNum"> 907</span> : </span>
|
|
<span id="L908"><span class="lineNum"> 908</span> : // Copy the existing elements that get replaced.</span>
|
|
<span id="L909"><span class="lineNum"> 909</span> : std::move_backward(I, OldEnd - NumToInsert, OldEnd);</span>
|
|
<span id="L910"><span class="lineNum"> 910</span> : </span>
|
|
<span id="L911"><span class="lineNum"> 911</span> : // If we just moved the element we're inserting, be sure to update</span>
|
|
<span id="L912"><span class="lineNum"> 912</span> : // the reference (never happens if TakesParamByValue).</span>
|
|
<span id="L913"><span class="lineNum"> 913</span> : if (!TakesParamByValue && I <= EltPtr && EltPtr < this->end())</span>
|
|
<span id="L914"><span class="lineNum"> 914</span> : EltPtr += NumToInsert;</span>
|
|
<span id="L915"><span class="lineNum"> 915</span> : </span>
|
|
<span id="L916"><span class="lineNum"> 916</span> : std::fill_n(I, NumToInsert, *EltPtr);</span>
|
|
<span id="L917"><span class="lineNum"> 917</span> : return I;</span>
|
|
<span id="L918"><span class="lineNum"> 918</span> : }</span>
|
|
<span id="L919"><span class="lineNum"> 919</span> : </span>
|
|
<span id="L920"><span class="lineNum"> 920</span> : // Otherwise, we're inserting more elements than exist already, and we're</span>
|
|
<span id="L921"><span class="lineNum"> 921</span> : // not inserting at the end.</span>
|
|
<span id="L922"><span class="lineNum"> 922</span> : </span>
|
|
<span id="L923"><span class="lineNum"> 923</span> : // Move over the elements that we're about to overwrite.</span>
|
|
<span id="L924"><span class="lineNum"> 924</span> : T* OldEnd = this->end();</span>
|
|
<span id="L925"><span class="lineNum"> 925</span> : this->set_size(this->size() + NumToInsert);</span>
|
|
<span id="L926"><span class="lineNum"> 926</span> : size_t NumOverwritten = OldEnd - I;</span>
|
|
<span id="L927"><span class="lineNum"> 927</span> : this->uninitialized_move(I, OldEnd, this->end() - NumOverwritten);</span>
|
|
<span id="L928"><span class="lineNum"> 928</span> : </span>
|
|
<span id="L929"><span class="lineNum"> 929</span> : // If we just moved the element we're inserting, be sure to update</span>
|
|
<span id="L930"><span class="lineNum"> 930</span> : // the reference (never happens if TakesParamByValue).</span>
|
|
<span id="L931"><span class="lineNum"> 931</span> : if (!TakesParamByValue && I <= EltPtr && EltPtr < this->end())</span>
|
|
<span id="L932"><span class="lineNum"> 932</span> : EltPtr += NumToInsert;</span>
|
|
<span id="L933"><span class="lineNum"> 933</span> : </span>
|
|
<span id="L934"><span class="lineNum"> 934</span> : // Replace the overwritten part.</span>
|
|
<span id="L935"><span class="lineNum"> 935</span> : std::fill_n(I, NumOverwritten, *EltPtr);</span>
|
|
<span id="L936"><span class="lineNum"> 936</span> : </span>
|
|
<span id="L937"><span class="lineNum"> 937</span> : // Insert the non-overwritten middle part.</span>
|
|
<span id="L938"><span class="lineNum"> 938</span> : std::uninitialized_fill_n(OldEnd, NumToInsert - NumOverwritten, *EltPtr);</span>
|
|
<span id="L939"><span class="lineNum"> 939</span> : return I;</span>
|
|
<span id="L940"><span class="lineNum"> 940</span> : }</span>
|
|
<span id="L941"><span class="lineNum"> 941</span> : </span>
|
|
<span id="L942"><span class="lineNum"> 942</span> : template <</span>
|
|
<span id="L943"><span class="lineNum"> 943</span> : typename ItTy,</span>
|
|
<span id="L944"><span class="lineNum"> 944</span> : typename = std::enable_if_t<std::is_convertible<</span>
|
|
<span id="L945"><span class="lineNum"> 945</span> : typename std::iterator_traits<ItTy>::iterator_category,</span>
|
|
<span id="L946"><span class="lineNum"> 946</span> : std::input_iterator_tag>::value>></span>
|
|
<span id="L947"><span class="lineNum"> 947</span> : iterator insert(iterator I, ItTy From, ItTy To) {</span>
|
|
<span id="L948"><span class="lineNum"> 948</span> : // Convert iterator to elt# to avoid invalidating iterator when we reserve()</span>
|
|
<span id="L949"><span class="lineNum"> 949</span> : size_t InsertElt = I - this->begin();</span>
|
|
<span id="L950"><span class="lineNum"> 950</span> : </span>
|
|
<span id="L951"><span class="lineNum"> 951</span> : if (I == this->end()) { // Important special case for empty vector.</span>
|
|
<span id="L952"><span class="lineNum"> 952</span> : append(From, To);</span>
|
|
<span id="L953"><span class="lineNum"> 953</span> : return this->begin() + InsertElt;</span>
|
|
<span id="L954"><span class="lineNum"> 954</span> : }</span>
|
|
<span id="L955"><span class="lineNum"> 955</span> : </span>
|
|
<span id="L956"><span class="lineNum"> 956</span> : assert(</span>
|
|
<span id="L957"><span class="lineNum"> 957</span> : this->isReferenceToStorage(I) &&</span>
|
|
<span id="L958"><span class="lineNum"> 958</span> : "Insertion iterator is out of bounds.");</span>
|
|
<span id="L959"><span class="lineNum"> 959</span> : </span>
|
|
<span id="L960"><span class="lineNum"> 960</span> : // Check that the reserve that follows doesn't invalidate the iterators.</span>
|
|
<span id="L961"><span class="lineNum"> 961</span> : this->assertSafeToAddRange(From, To);</span>
|
|
<span id="L962"><span class="lineNum"> 962</span> : </span>
|
|
<span id="L963"><span class="lineNum"> 963</span> : size_t NumToInsert = std::distance(From, To);</span>
|
|
<span id="L964"><span class="lineNum"> 964</span> : </span>
|
|
<span id="L965"><span class="lineNum"> 965</span> : // Ensure there is enough space.</span>
|
|
<span id="L966"><span class="lineNum"> 966</span> : reserve(this->size() + NumToInsert);</span>
|
|
<span id="L967"><span class="lineNum"> 967</span> : </span>
|
|
<span id="L968"><span class="lineNum"> 968</span> : // Uninvalidate the iterator.</span>
|
|
<span id="L969"><span class="lineNum"> 969</span> : I = this->begin() + InsertElt;</span>
|
|
<span id="L970"><span class="lineNum"> 970</span> : </span>
|
|
<span id="L971"><span class="lineNum"> 971</span> : // If there are more elements between the insertion point and the end of the</span>
|
|
<span id="L972"><span class="lineNum"> 972</span> : // range than there are being inserted, we can use a simple approach to</span>
|
|
<span id="L973"><span class="lineNum"> 973</span> : // insertion. Since we already reserved space, we know that this won't</span>
|
|
<span id="L974"><span class="lineNum"> 974</span> : // reallocate the vector.</span>
|
|
<span id="L975"><span class="lineNum"> 975</span> : if (size_t(this->end() - I) >= NumToInsert) {</span>
|
|
<span id="L976"><span class="lineNum"> 976</span> : T* OldEnd = this->end();</span>
|
|
<span id="L977"><span class="lineNum"> 977</span> : append(</span>
|
|
<span id="L978"><span class="lineNum"> 978</span> : std::move_iterator<iterator>(this->end() - NumToInsert),</span>
|
|
<span id="L979"><span class="lineNum"> 979</span> : std::move_iterator<iterator>(this->end()));</span>
|
|
<span id="L980"><span class="lineNum"> 980</span> : </span>
|
|
<span id="L981"><span class="lineNum"> 981</span> : // Copy the existing elements that get replaced.</span>
|
|
<span id="L982"><span class="lineNum"> 982</span> : std::move_backward(I, OldEnd - NumToInsert, OldEnd);</span>
|
|
<span id="L983"><span class="lineNum"> 983</span> : </span>
|
|
<span id="L984"><span class="lineNum"> 984</span> : std::copy(From, To, I);</span>
|
|
<span id="L985"><span class="lineNum"> 985</span> : return I;</span>
|
|
<span id="L986"><span class="lineNum"> 986</span> : }</span>
|
|
<span id="L987"><span class="lineNum"> 987</span> : </span>
|
|
<span id="L988"><span class="lineNum"> 988</span> : // Otherwise, we're inserting more elements than exist already, and we're</span>
|
|
<span id="L989"><span class="lineNum"> 989</span> : // not inserting at the end.</span>
|
|
<span id="L990"><span class="lineNum"> 990</span> : </span>
|
|
<span id="L991"><span class="lineNum"> 991</span> : // Move over the elements that we're about to overwrite.</span>
|
|
<span id="L992"><span class="lineNum"> 992</span> : T* OldEnd = this->end();</span>
|
|
<span id="L993"><span class="lineNum"> 993</span> : this->set_size(this->size() + NumToInsert);</span>
|
|
<span id="L994"><span class="lineNum"> 994</span> : size_t NumOverwritten = OldEnd - I;</span>
|
|
<span id="L995"><span class="lineNum"> 995</span> : this->uninitialized_move(I, OldEnd, this->end() - NumOverwritten);</span>
|
|
<span id="L996"><span class="lineNum"> 996</span> : </span>
|
|
<span id="L997"><span class="lineNum"> 997</span> : // Replace the overwritten part.</span>
|
|
<span id="L998"><span class="lineNum"> 998</span> : for (T* J = I; NumOverwritten > 0; --NumOverwritten) {</span>
|
|
<span id="L999"><span class="lineNum"> 999</span> : *J = *From;</span>
|
|
<span id="L1000"><span class="lineNum"> 1000</span> : ++J;</span>
|
|
<span id="L1001"><span class="lineNum"> 1001</span> : ++From;</span>
|
|
<span id="L1002"><span class="lineNum"> 1002</span> : }</span>
|
|
<span id="L1003"><span class="lineNum"> 1003</span> : </span>
|
|
<span id="L1004"><span class="lineNum"> 1004</span> : // Insert the non-overwritten middle part.</span>
|
|
<span id="L1005"><span class="lineNum"> 1005</span> : this->uninitialized_copy(From, To, OldEnd);</span>
|
|
<span id="L1006"><span class="lineNum"> 1006</span> : return I;</span>
|
|
<span id="L1007"><span class="lineNum"> 1007</span> : }</span>
|
|
<span id="L1008"><span class="lineNum"> 1008</span> : </span>
|
|
<span id="L1009"><span class="lineNum"> 1009</span> : void insert(iterator I, std::initializer_list<T> IL) {</span>
|
|
<span id="L1010"><span class="lineNum"> 1010</span> : insert(I, IL.begin(), IL.end());</span>
|
|
<span id="L1011"><span class="lineNum"> 1011</span> : }</span>
|
|
<span id="L1012"><span class="lineNum"> 1012</span> : </span>
|
|
<span id="L1013"><span class="lineNum"> 1013</span> : template <typename... ArgTypes></span>
|
|
<span id="L1014"><span class="lineNum"> 1014</span> : reference emplace_back(ArgTypes&&... Args) {</span>
|
|
<span id="L1015"><span class="lineNum"> 1015</span> : if (C10_UNLIKELY(this->size() >= this->capacity()))</span>
|
|
<span id="L1016"><span class="lineNum"> 1016</span> : return this->growAndEmplaceBack(std::forward<ArgTypes>(Args)...);</span>
|
|
<span id="L1017"><span class="lineNum"> 1017</span> : </span>
|
|
<span id="L1018"><span class="lineNum"> 1018</span> : ::new ((void*)this->end()) T(std::forward<ArgTypes>(Args)...);</span>
|
|
<span id="L1019"><span class="lineNum"> 1019</span> : this->set_size(this->size() + 1);</span>
|
|
<span id="L1020"><span class="lineNum"> 1020</span> : return this->back();</span>
|
|
<span id="L1021"><span class="lineNum"> 1021</span> : }</span>
|
|
<span id="L1022"><span class="lineNum"> 1022</span> : </span>
|
|
<span id="L1023"><span class="lineNum"> 1023</span> : SmallVectorImpl& operator=(const SmallVectorImpl& RHS);</span>
|
|
<span id="L1024"><span class="lineNum"> 1024</span> : </span>
|
|
<span id="L1025"><span class="lineNum"> 1025</span> : SmallVectorImpl& operator=(SmallVectorImpl&& RHS);</span>
|
|
<span id="L1026"><span class="lineNum"> 1026</span> : </span>
|
|
<span id="L1027"><span class="lineNum"> 1027</span> : bool operator==(const SmallVectorImpl& RHS) const {</span>
|
|
<span id="L1028"><span class="lineNum"> 1028</span> : if (this->size() != RHS.size())</span>
|
|
<span id="L1029"><span class="lineNum"> 1029</span> : return false;</span>
|
|
<span id="L1030"><span class="lineNum"> 1030</span> : return std::equal(this->begin(), this->end(), RHS.begin());</span>
|
|
<span id="L1031"><span class="lineNum"> 1031</span> : }</span>
|
|
<span id="L1032"><span class="lineNum"> 1032</span> : bool operator!=(const SmallVectorImpl& RHS) const {</span>
|
|
<span id="L1033"><span class="lineNum"> 1033</span> : return !(*this == RHS);</span>
|
|
<span id="L1034"><span class="lineNum"> 1034</span> : }</span>
|
|
<span id="L1035"><span class="lineNum"> 1035</span> : </span>
|
|
<span id="L1036"><span class="lineNum"> 1036</span> : bool operator<(const SmallVectorImpl& RHS) const {</span>
|
|
<span id="L1037"><span class="lineNum"> 1037</span> : return std::lexicographical_compare(</span>
|
|
<span id="L1038"><span class="lineNum"> 1038</span> : this->begin(), this->end(), RHS.begin(), RHS.end());</span>
|
|
<span id="L1039"><span class="lineNum"> 1039</span> : }</span>
|
|
<span id="L1040"><span class="lineNum"> 1040</span> : };</span>
|
|
<span id="L1041"><span class="lineNum"> 1041</span> : </span>
|
|
<span id="L1042"><span class="lineNum"> 1042</span> : template <typename T></span>
|
|
<span id="L1043"><span class="lineNum"> 1043</span> : void SmallVectorImpl<T>::swap(SmallVectorImpl<T>& RHS) {</span>
|
|
<span id="L1044"><span class="lineNum"> 1044</span> : if (this == &RHS)</span>
|
|
<span id="L1045"><span class="lineNum"> 1045</span> : return;</span>
|
|
<span id="L1046"><span class="lineNum"> 1046</span> : </span>
|
|
<span id="L1047"><span class="lineNum"> 1047</span> : // We can only avoid copying elements if neither vector is small.</span>
|
|
<span id="L1048"><span class="lineNum"> 1048</span> : if (!this->isSmall() && !RHS.isSmall()) {</span>
|
|
<span id="L1049"><span class="lineNum"> 1049</span> : std::swap(this->BeginX, RHS.BeginX);</span>
|
|
<span id="L1050"><span class="lineNum"> 1050</span> : std::swap(this->Size, RHS.Size);</span>
|
|
<span id="L1051"><span class="lineNum"> 1051</span> : std::swap(this->Capacity, RHS.Capacity);</span>
|
|
<span id="L1052"><span class="lineNum"> 1052</span> : return;</span>
|
|
<span id="L1053"><span class="lineNum"> 1053</span> : }</span>
|
|
<span id="L1054"><span class="lineNum"> 1054</span> : this->reserve(RHS.size());</span>
|
|
<span id="L1055"><span class="lineNum"> 1055</span> : RHS.reserve(this->size());</span>
|
|
<span id="L1056"><span class="lineNum"> 1056</span> : </span>
|
|
<span id="L1057"><span class="lineNum"> 1057</span> : // Swap the shared elements.</span>
|
|
<span id="L1058"><span class="lineNum"> 1058</span> : size_t NumShared = this->size();</span>
|
|
<span id="L1059"><span class="lineNum"> 1059</span> : if (NumShared > RHS.size())</span>
|
|
<span id="L1060"><span class="lineNum"> 1060</span> : NumShared = RHS.size();</span>
|
|
<span id="L1061"><span class="lineNum"> 1061</span> : for (size_type i = 0; i != NumShared; ++i)</span>
|
|
<span id="L1062"><span class="lineNum"> 1062</span> : std::swap((*this)[i], RHS[i]);</span>
|
|
<span id="L1063"><span class="lineNum"> 1063</span> : </span>
|
|
<span id="L1064"><span class="lineNum"> 1064</span> : // Copy over the extra elts.</span>
|
|
<span id="L1065"><span class="lineNum"> 1065</span> : if (this->size() > RHS.size()) {</span>
|
|
<span id="L1066"><span class="lineNum"> 1066</span> : size_t EltDiff = this->size() - RHS.size();</span>
|
|
<span id="L1067"><span class="lineNum"> 1067</span> : this->uninitialized_copy(this->begin() + NumShared, this->end(), RHS.end());</span>
|
|
<span id="L1068"><span class="lineNum"> 1068</span> : RHS.set_size(RHS.size() + EltDiff);</span>
|
|
<span id="L1069"><span class="lineNum"> 1069</span> : this->destroy_range(this->begin() + NumShared, this->end());</span>
|
|
<span id="L1070"><span class="lineNum"> 1070</span> : this->set_size(NumShared);</span>
|
|
<span id="L1071"><span class="lineNum"> 1071</span> : } else if (RHS.size() > this->size()) {</span>
|
|
<span id="L1072"><span class="lineNum"> 1072</span> : size_t EltDiff = RHS.size() - this->size();</span>
|
|
<span id="L1073"><span class="lineNum"> 1073</span> : this->uninitialized_copy(RHS.begin() + NumShared, RHS.end(), this->end());</span>
|
|
<span id="L1074"><span class="lineNum"> 1074</span> : this->set_size(this->size() + EltDiff);</span>
|
|
<span id="L1075"><span class="lineNum"> 1075</span> : this->destroy_range(RHS.begin() + NumShared, RHS.end());</span>
|
|
<span id="L1076"><span class="lineNum"> 1076</span> : RHS.set_size(NumShared);</span>
|
|
<span id="L1077"><span class="lineNum"> 1077</span> : }</span>
|
|
<span id="L1078"><span class="lineNum"> 1078</span> : }</span>
|
|
<span id="L1079"><span class="lineNum"> 1079</span> : </span>
|
|
<span id="L1080"><span class="lineNum"> 1080</span> : template <typename T></span>
|
|
<span id="L1081"><span class="lineNum"> 1081</span> : SmallVectorImpl<T>& SmallVectorImpl<T>::operator=(</span>
|
|
<span id="L1082"><span class="lineNum"> 1082</span> : const SmallVectorImpl<T>& RHS) {</span>
|
|
<span id="L1083"><span class="lineNum"> 1083</span> : // Avoid self-assignment.</span>
|
|
<span id="L1084"><span class="lineNum"> 1084</span> : if (this == &RHS)</span>
|
|
<span id="L1085"><span class="lineNum"> 1085</span> : return *this;</span>
|
|
<span id="L1086"><span class="lineNum"> 1086</span> : </span>
|
|
<span id="L1087"><span class="lineNum"> 1087</span> : // If we already have sufficient space, assign the common elements, then</span>
|
|
<span id="L1088"><span class="lineNum"> 1088</span> : // destroy any excess.</span>
|
|
<span id="L1089"><span class="lineNum"> 1089</span> : size_t RHSSize = RHS.size();</span>
|
|
<span id="L1090"><span class="lineNum"> 1090</span> : size_t CurSize = this->size();</span>
|
|
<span id="L1091"><span class="lineNum"> 1091</span> : if (CurSize >= RHSSize) {</span>
|
|
<span id="L1092"><span class="lineNum"> 1092</span> : // Assign common elements.</span>
|
|
<span id="L1093"><span class="lineNum"> 1093</span> : iterator NewEnd;</span>
|
|
<span id="L1094"><span class="lineNum"> 1094</span> : if (RHSSize)</span>
|
|
<span id="L1095"><span class="lineNum"> 1095</span> : NewEnd = std::copy(RHS.begin(), RHS.begin() + RHSSize, this->begin());</span>
|
|
<span id="L1096"><span class="lineNum"> 1096</span> : else</span>
|
|
<span id="L1097"><span class="lineNum"> 1097</span> : NewEnd = this->begin();</span>
|
|
<span id="L1098"><span class="lineNum"> 1098</span> : </span>
|
|
<span id="L1099"><span class="lineNum"> 1099</span> : // Destroy excess elements.</span>
|
|
<span id="L1100"><span class="lineNum"> 1100</span> : this->destroy_range(NewEnd, this->end());</span>
|
|
<span id="L1101"><span class="lineNum"> 1101</span> : </span>
|
|
<span id="L1102"><span class="lineNum"> 1102</span> : // Trim.</span>
|
|
<span id="L1103"><span class="lineNum"> 1103</span> : this->set_size(RHSSize);</span>
|
|
<span id="L1104"><span class="lineNum"> 1104</span> : return *this;</span>
|
|
<span id="L1105"><span class="lineNum"> 1105</span> : }</span>
|
|
<span id="L1106"><span class="lineNum"> 1106</span> : </span>
|
|
<span id="L1107"><span class="lineNum"> 1107</span> : // If we have to grow to have enough elements, destroy the current elements.</span>
|
|
<span id="L1108"><span class="lineNum"> 1108</span> : // This allows us to avoid copying them during the grow.</span>
|
|
<span id="L1109"><span class="lineNum"> 1109</span> : // FIXME: don't do this if they're efficiently moveable.</span>
|
|
<span id="L1110"><span class="lineNum"> 1110</span> : if (this->capacity() < RHSSize) {</span>
|
|
<span id="L1111"><span class="lineNum"> 1111</span> : // Destroy current elements.</span>
|
|
<span id="L1112"><span class="lineNum"> 1112</span> : this->clear();</span>
|
|
<span id="L1113"><span class="lineNum"> 1113</span> : CurSize = 0;</span>
|
|
<span id="L1114"><span class="lineNum"> 1114</span> : this->grow(RHSSize);</span>
|
|
<span id="L1115"><span class="lineNum"> 1115</span> : } else if (CurSize) {</span>
|
|
<span id="L1116"><span class="lineNum"> 1116</span> : // Otherwise, use assignment for the already-constructed elements.</span>
|
|
<span id="L1117"><span class="lineNum"> 1117</span> : std::copy(RHS.begin(), RHS.begin() + CurSize, this->begin());</span>
|
|
<span id="L1118"><span class="lineNum"> 1118</span> : }</span>
|
|
<span id="L1119"><span class="lineNum"> 1119</span> : </span>
|
|
<span id="L1120"><span class="lineNum"> 1120</span> : // Copy construct the new elements in place.</span>
|
|
<span id="L1121"><span class="lineNum"> 1121</span> : this->uninitialized_copy(</span>
|
|
<span id="L1122"><span class="lineNum"> 1122</span> : RHS.begin() + CurSize, RHS.end(), this->begin() + CurSize);</span>
|
|
<span id="L1123"><span class="lineNum"> 1123</span> : </span>
|
|
<span id="L1124"><span class="lineNum"> 1124</span> : // Set end.</span>
|
|
<span id="L1125"><span class="lineNum"> 1125</span> : this->set_size(RHSSize);</span>
|
|
<span id="L1126"><span class="lineNum"> 1126</span> : return *this;</span>
|
|
<span id="L1127"><span class="lineNum"> 1127</span> : }</span>
|
|
<span id="L1128"><span class="lineNum"> 1128</span> : </span>
|
|
<span id="L1129"><span class="lineNum"> 1129</span> : template <typename T></span>
|
|
<span id="L1130"><span class="lineNum"> 1130</span> : SmallVectorImpl<T>& SmallVectorImpl<T>::operator=(SmallVectorImpl<T>&& RHS) {</span>
|
|
<span id="L1131"><span class="lineNum"> 1131</span> : // Avoid self-assignment.</span>
|
|
<span id="L1132"><span class="lineNum"> 1132</span> : if (this == &RHS)</span>
|
|
<span id="L1133"><span class="lineNum"> 1133</span> : return *this;</span>
|
|
<span id="L1134"><span class="lineNum"> 1134</span> : </span>
|
|
<span id="L1135"><span class="lineNum"> 1135</span> : // If the RHS isn't small, clear this vector and then steal its buffer.</span>
|
|
<span id="L1136"><span class="lineNum"> 1136</span> : if (!RHS.isSmall()) {</span>
|
|
<span id="L1137"><span class="lineNum"> 1137</span> : this->destroy_range(this->begin(), this->end());</span>
|
|
<span id="L1138"><span class="lineNum"> 1138</span> : if (!this->isSmall())</span>
|
|
<span id="L1139"><span class="lineNum"> 1139</span> : free(this->begin());</span>
|
|
<span id="L1140"><span class="lineNum"> 1140</span> : this->BeginX = RHS.BeginX;</span>
|
|
<span id="L1141"><span class="lineNum"> 1141</span> : this->Size = RHS.Size;</span>
|
|
<span id="L1142"><span class="lineNum"> 1142</span> : this->Capacity = RHS.Capacity;</span>
|
|
<span id="L1143"><span class="lineNum"> 1143</span> : RHS.resetToSmall();</span>
|
|
<span id="L1144"><span class="lineNum"> 1144</span> : return *this;</span>
|
|
<span id="L1145"><span class="lineNum"> 1145</span> : }</span>
|
|
<span id="L1146"><span class="lineNum"> 1146</span> : </span>
|
|
<span id="L1147"><span class="lineNum"> 1147</span> : // If we already have sufficient space, assign the common elements, then</span>
|
|
<span id="L1148"><span class="lineNum"> 1148</span> : // destroy any excess.</span>
|
|
<span id="L1149"><span class="lineNum"> 1149</span> : size_t RHSSize = RHS.size();</span>
|
|
<span id="L1150"><span class="lineNum"> 1150</span> : size_t CurSize = this->size();</span>
|
|
<span id="L1151"><span class="lineNum"> 1151</span> : if (CurSize >= RHSSize) {</span>
|
|
<span id="L1152"><span class="lineNum"> 1152</span> : // Assign common elements.</span>
|
|
<span id="L1153"><span class="lineNum"> 1153</span> : iterator NewEnd = this->begin();</span>
|
|
<span id="L1154"><span class="lineNum"> 1154</span> : if (RHSSize)</span>
|
|
<span id="L1155"><span class="lineNum"> 1155</span> : NewEnd = std::move(RHS.begin(), RHS.end(), NewEnd);</span>
|
|
<span id="L1156"><span class="lineNum"> 1156</span> : </span>
|
|
<span id="L1157"><span class="lineNum"> 1157</span> : // Destroy excess elements and trim the bounds.</span>
|
|
<span id="L1158"><span class="lineNum"> 1158</span> : this->destroy_range(NewEnd, this->end());</span>
|
|
<span id="L1159"><span class="lineNum"> 1159</span> : this->set_size(RHSSize);</span>
|
|
<span id="L1160"><span class="lineNum"> 1160</span> : </span>
|
|
<span id="L1161"><span class="lineNum"> 1161</span> : // Clear the RHS.</span>
|
|
<span id="L1162"><span class="lineNum"> 1162</span> : RHS.clear();</span>
|
|
<span id="L1163"><span class="lineNum"> 1163</span> : </span>
|
|
<span id="L1164"><span class="lineNum"> 1164</span> : return *this;</span>
|
|
<span id="L1165"><span class="lineNum"> 1165</span> : }</span>
|
|
<span id="L1166"><span class="lineNum"> 1166</span> : </span>
|
|
<span id="L1167"><span class="lineNum"> 1167</span> : // If we have to grow to have enough elements, destroy the current elements.</span>
|
|
<span id="L1168"><span class="lineNum"> 1168</span> : // This allows us to avoid copying them during the grow.</span>
|
|
<span id="L1169"><span class="lineNum"> 1169</span> : // FIXME: this may not actually make any sense if we can efficiently move</span>
|
|
<span id="L1170"><span class="lineNum"> 1170</span> : // elements.</span>
|
|
<span id="L1171"><span class="lineNum"> 1171</span> : if (this->capacity() < RHSSize) {</span>
|
|
<span id="L1172"><span class="lineNum"> 1172</span> : // Destroy current elements.</span>
|
|
<span id="L1173"><span class="lineNum"> 1173</span> : this->clear();</span>
|
|
<span id="L1174"><span class="lineNum"> 1174</span> : CurSize = 0;</span>
|
|
<span id="L1175"><span class="lineNum"> 1175</span> : this->grow(RHSSize);</span>
|
|
<span id="L1176"><span class="lineNum"> 1176</span> : } else if (CurSize) {</span>
|
|
<span id="L1177"><span class="lineNum"> 1177</span> : // Otherwise, use assignment for the already-constructed elements.</span>
|
|
<span id="L1178"><span class="lineNum"> 1178</span> : std::move(RHS.begin(), RHS.begin() + CurSize, this->begin());</span>
|
|
<span id="L1179"><span class="lineNum"> 1179</span> : }</span>
|
|
<span id="L1180"><span class="lineNum"> 1180</span> : </span>
|
|
<span id="L1181"><span class="lineNum"> 1181</span> : // Move-construct the new elements in place.</span>
|
|
<span id="L1182"><span class="lineNum"> 1182</span> : this->uninitialized_move(</span>
|
|
<span id="L1183"><span class="lineNum"> 1183</span> : RHS.begin() + CurSize, RHS.end(), this->begin() + CurSize);</span>
|
|
<span id="L1184"><span class="lineNum"> 1184</span> : </span>
|
|
<span id="L1185"><span class="lineNum"> 1185</span> : // Set end.</span>
|
|
<span id="L1186"><span class="lineNum"> 1186</span> : this->set_size(RHSSize);</span>
|
|
<span id="L1187"><span class="lineNum"> 1187</span> : </span>
|
|
<span id="L1188"><span class="lineNum"> 1188</span> : RHS.clear();</span>
|
|
<span id="L1189"><span class="lineNum"> 1189</span> : return *this;</span>
|
|
<span id="L1190"><span class="lineNum"> 1190</span> : }</span>
|
|
<span id="L1191"><span class="lineNum"> 1191</span> : </span>
|
|
<span id="L1192"><span class="lineNum"> 1192</span> : /// Storage for the SmallVector elements. This is specialized for the N=0 case</span>
|
|
<span id="L1193"><span class="lineNum"> 1193</span> : /// to avoid allocating unnecessary storage.</span>
|
|
<span id="L1194"><span class="lineNum"> 1194</span> : template <typename T, unsigned N></span>
|
|
<span id="L1195"><span class="lineNum"> 1195</span> : struct SmallVectorStorage {</span>
|
|
<span id="L1196"><span class="lineNum"> 1196</span> : alignas(T) char InlineElts[N * sizeof(T)];</span>
|
|
<span id="L1197"><span class="lineNum"> 1197</span> : };</span>
|
|
<span id="L1198"><span class="lineNum"> 1198</span> : </span>
|
|
<span id="L1199"><span class="lineNum"> 1199</span> : /// We need the storage to be properly aligned even for small-size of 0 so that</span>
|
|
<span id="L1200"><span class="lineNum"> 1200</span> : /// the pointer math in \a SmallVectorTemplateCommon::getFirstEl() is</span>
|
|
<span id="L1201"><span class="lineNum"> 1201</span> : /// well-defined.</span>
|
|
<span id="L1202"><span class="lineNum"> 1202</span> : template <typename T></span>
|
|
<span id="L1203"><span class="lineNum"> 1203</span> : struct alignas(T) SmallVectorStorage<T, 0> {};</span>
|
|
<span id="L1204"><span class="lineNum"> 1204</span> : </span>
|
|
<span id="L1205"><span class="lineNum"> 1205</span> : /// Forward declaration of SmallVector so that</span>
|
|
<span id="L1206"><span class="lineNum"> 1206</span> : /// calculateSmallVectorDefaultInlinedElements can reference</span>
|
|
<span id="L1207"><span class="lineNum"> 1207</span> : /// `sizeof(SmallVector<T, 0>)`.</span>
|
|
<span id="L1208"><span class="lineNum"> 1208</span> : template <typename T, unsigned N></span>
|
|
<span id="L1209"><span class="lineNum"> 1209</span> : class /* LLVM_GSL_OWNER */ SmallVector;</span>
|
|
<span id="L1210"><span class="lineNum"> 1210</span> : </span>
|
|
<span id="L1211"><span class="lineNum"> 1211</span> : /// Helper class for calculating the default number of inline elements for</span>
|
|
<span id="L1212"><span class="lineNum"> 1212</span> : /// `SmallVector<T>`.</span>
|
|
<span id="L1213"><span class="lineNum"> 1213</span> : ///</span>
|
|
<span id="L1214"><span class="lineNum"> 1214</span> : /// This should be migrated to a constexpr function when our minimum</span>
|
|
<span id="L1215"><span class="lineNum"> 1215</span> : /// compiler support is enough for multi-statement constexpr functions.</span>
|
|
<span id="L1216"><span class="lineNum"> 1216</span> : template <typename T></span>
|
|
<span id="L1217"><span class="lineNum"> 1217</span> : struct CalculateSmallVectorDefaultInlinedElements {</span>
|
|
<span id="L1218"><span class="lineNum"> 1218</span> : // Parameter controlling the default number of inlined elements</span>
|
|
<span id="L1219"><span class="lineNum"> 1219</span> : // for `SmallVector<T>`.</span>
|
|
<span id="L1220"><span class="lineNum"> 1220</span> : //</span>
|
|
<span id="L1221"><span class="lineNum"> 1221</span> : // The default number of inlined elements ensures that</span>
|
|
<span id="L1222"><span class="lineNum"> 1222</span> : // 1. There is at least one inlined element.</span>
|
|
<span id="L1223"><span class="lineNum"> 1223</span> : // 2. `sizeof(SmallVector<T>) <= kPreferredSmallVectorSizeof` unless</span>
|
|
<span id="L1224"><span class="lineNum"> 1224</span> : // it contradicts 1.</span>
|
|
<span id="L1225"><span class="lineNum"> 1225</span> : static constexpr size_t kPreferredSmallVectorSizeof = 64;</span>
|
|
<span id="L1226"><span class="lineNum"> 1226</span> : </span>
|
|
<span id="L1227"><span class="lineNum"> 1227</span> : // static_assert that sizeof(T) is not "too big".</span>
|
|
<span id="L1228"><span class="lineNum"> 1228</span> : //</span>
|
|
<span id="L1229"><span class="lineNum"> 1229</span> : // Because our policy guarantees at least one inlined element, it is possible</span>
|
|
<span id="L1230"><span class="lineNum"> 1230</span> : // for an arbitrarily large inlined element to allocate an arbitrarily large</span>
|
|
<span id="L1231"><span class="lineNum"> 1231</span> : // amount of inline storage. We generally consider it an antipattern for a</span>
|
|
<span id="L1232"><span class="lineNum"> 1232</span> : // SmallVector to allocate an excessive amount of inline storage, so we want</span>
|
|
<span id="L1233"><span class="lineNum"> 1233</span> : // to call attention to these cases and make sure that users are making an</span>
|
|
<span id="L1234"><span class="lineNum"> 1234</span> : // intentional decision if they request a lot of inline storage.</span>
|
|
<span id="L1235"><span class="lineNum"> 1235</span> : //</span>
|
|
<span id="L1236"><span class="lineNum"> 1236</span> : // We want this assertion to trigger in pathological cases, but otherwise</span>
|
|
<span id="L1237"><span class="lineNum"> 1237</span> : // not be too easy to hit. To accomplish that, the cutoff is actually somewhat</span>
|
|
<span id="L1238"><span class="lineNum"> 1238</span> : // larger than kPreferredSmallVectorSizeof (otherwise,</span>
|
|
<span id="L1239"><span class="lineNum"> 1239</span> : // `SmallVector<SmallVector<T>>` would be one easy way to trip it, and that</span>
|
|
<span id="L1240"><span class="lineNum"> 1240</span> : // pattern seems useful in practice).</span>
|
|
<span id="L1241"><span class="lineNum"> 1241</span> : //</span>
|
|
<span id="L1242"><span class="lineNum"> 1242</span> : // One wrinkle is that this assertion is in theory non-portable, since</span>
|
|
<span id="L1243"><span class="lineNum"> 1243</span> : // sizeof(T) is in general platform-dependent. However, we don't expect this</span>
|
|
<span id="L1244"><span class="lineNum"> 1244</span> : // to be much of an issue, because most LLVM development happens on 64-bit</span>
|
|
<span id="L1245"><span class="lineNum"> 1245</span> : // hosts, and therefore sizeof(T) is expected to *decrease* when compiled for</span>
|
|
<span id="L1246"><span class="lineNum"> 1246</span> : // 32-bit hosts, dodging the issue. The reverse situation, where development</span>
|
|
<span id="L1247"><span class="lineNum"> 1247</span> : // happens on a 32-bit host and then fails due to sizeof(T) *increasing* on a</span>
|
|
<span id="L1248"><span class="lineNum"> 1248</span> : // 64-bit host, is expected to be very rare.</span>
|
|
<span id="L1249"><span class="lineNum"> 1249</span> : static_assert(</span>
|
|
<span id="L1250"><span class="lineNum"> 1250</span> : sizeof(T) <= 256,</span>
|
|
<span id="L1251"><span class="lineNum"> 1251</span> : "You are trying to use a default number of inlined elements for "</span>
|
|
<span id="L1252"><span class="lineNum"> 1252</span> : "`SmallVector<T>` but `sizeof(T)` is really big! Please use an "</span>
|
|
<span id="L1253"><span class="lineNum"> 1253</span> : "explicit number of inlined elements with `SmallVector<T, N>` to make "</span>
|
|
<span id="L1254"><span class="lineNum"> 1254</span> : "sure you really want that much inline storage.");</span>
|
|
<span id="L1255"><span class="lineNum"> 1255</span> : </span>
|
|
<span id="L1256"><span class="lineNum"> 1256</span> : // Discount the size of the header itself when calculating the maximum inline</span>
|
|
<span id="L1257"><span class="lineNum"> 1257</span> : // bytes.</span>
|
|
<span id="L1258"><span class="lineNum"> 1258</span> : static constexpr size_t PreferredInlineBytes =</span>
|
|
<span id="L1259"><span class="lineNum"> 1259</span> : kPreferredSmallVectorSizeof - sizeof(SmallVector<T, 0>);</span>
|
|
<span id="L1260"><span class="lineNum"> 1260</span> : static constexpr size_t NumElementsThatFit = PreferredInlineBytes / sizeof(T);</span>
|
|
<span id="L1261"><span class="lineNum"> 1261</span> : static constexpr size_t value =</span>
|
|
<span id="L1262"><span class="lineNum"> 1262</span> : NumElementsThatFit == 0 ? 1 : NumElementsThatFit;</span>
|
|
<span id="L1263"><span class="lineNum"> 1263</span> : };</span>
|
|
<span id="L1264"><span class="lineNum"> 1264</span> : </span>
|
|
<span id="L1265"><span class="lineNum"> 1265</span> : /// This is a 'vector' (really, a variable-sized array), optimized</span>
|
|
<span id="L1266"><span class="lineNum"> 1266</span> : /// for the case when the array is small. It contains some number of elements</span>
|
|
<span id="L1267"><span class="lineNum"> 1267</span> : /// in-place, which allows it to avoid heap allocation when the actual number of</span>
|
|
<span id="L1268"><span class="lineNum"> 1268</span> : /// elements is below that threshold. This allows normal "small" cases to be</span>
|
|
<span id="L1269"><span class="lineNum"> 1269</span> : /// fast without losing generality for large inputs.</span>
|
|
<span id="L1270"><span class="lineNum"> 1270</span> : ///</span>
|
|
<span id="L1271"><span class="lineNum"> 1271</span> : /// \note</span>
|
|
<span id="L1272"><span class="lineNum"> 1272</span> : /// In the absence of a well-motivated choice for the number of inlined</span>
|
|
<span id="L1273"><span class="lineNum"> 1273</span> : /// elements \p N, it is recommended to use \c SmallVector<T> (that is,</span>
|
|
<span id="L1274"><span class="lineNum"> 1274</span> : /// omitting the \p N). This will choose a default number of inlined elements</span>
|
|
<span id="L1275"><span class="lineNum"> 1275</span> : /// reasonable for allocation on the stack (for example, trying to keep \c</span>
|
|
<span id="L1276"><span class="lineNum"> 1276</span> : /// sizeof(SmallVector<T>) around 64 bytes).</span>
|
|
<span id="L1277"><span class="lineNum"> 1277</span> : ///</span>
|
|
<span id="L1278"><span class="lineNum"> 1278</span> : /// \warning This does not attempt to be exception safe.</span>
|
|
<span id="L1279"><span class="lineNum"> 1279</span> : ///</span>
|
|
<span id="L1280"><span class="lineNum"> 1280</span> : /// \see https://llvm.org/docs/ProgrammersManual.html#llvm-adt-smallvector-h</span>
|
|
<span id="L1281"><span class="lineNum"> 1281</span> : template <</span>
|
|
<span id="L1282"><span class="lineNum"> 1282</span> : typename T,</span>
|
|
<span id="L1283"><span class="lineNum"> 1283</span> : unsigned N = CalculateSmallVectorDefaultInlinedElements<T>::value></span>
|
|
<span id="L1284"><span class="lineNum"> 1284</span> : class /* LLVM_GSL_OWNER */ SmallVector : public SmallVectorImpl<T>,</span>
|
|
<span id="L1285"><span class="lineNum"> 1285</span> : SmallVectorStorage<T, N> {</span>
|
|
<span id="L1286"><span class="lineNum"> 1286</span> : public:</span>
|
|
<span id="L1287"><span class="lineNum"> 1287</span> <span class="tlaUNC"> 0 : SmallVector() : SmallVectorImpl<T>(N) {}</span></span>
|
|
<span id="L1288"><span class="lineNum"> 1288</span> : </span>
|
|
<span id="L1289"><span class="lineNum"> 1289</span> <span class="tlaUNC"> 0 : ~SmallVector() {</span></span>
|
|
<span id="L1290"><span class="lineNum"> 1290</span> : // Destroy the constructed elements in the vector.</span>
|
|
<span id="L1291"><span class="lineNum"> 1291</span> <span class="tlaUNC"> 0 : this->destroy_range(this->begin(), this->end());</span></span>
|
|
<span id="L1292"><span class="lineNum"> 1292</span> <span class="tlaUNC"> 0 : }</span></span>
|
|
<span id="L1293"><span class="lineNum"> 1293</span> : </span>
|
|
<span id="L1294"><span class="lineNum"> 1294</span> : explicit SmallVector(size_t Size, const T& Value = T())</span>
|
|
<span id="L1295"><span class="lineNum"> 1295</span> : : SmallVectorImpl<T>(N) {</span>
|
|
<span id="L1296"><span class="lineNum"> 1296</span> : this->assign(Size, Value);</span>
|
|
<span id="L1297"><span class="lineNum"> 1297</span> : }</span>
|
|
<span id="L1298"><span class="lineNum"> 1298</span> : </span>
|
|
<span id="L1299"><span class="lineNum"> 1299</span> : template <</span>
|
|
<span id="L1300"><span class="lineNum"> 1300</span> : typename ItTy,</span>
|
|
<span id="L1301"><span class="lineNum"> 1301</span> : typename = std::enable_if_t<std::is_convertible<</span>
|
|
<span id="L1302"><span class="lineNum"> 1302</span> : typename std::iterator_traits<ItTy>::iterator_category,</span>
|
|
<span id="L1303"><span class="lineNum"> 1303</span> : std::input_iterator_tag>::value>></span>
|
|
<span id="L1304"><span class="lineNum"> 1304</span> : SmallVector(ItTy S, ItTy E) : SmallVectorImpl<T>(N) {</span>
|
|
<span id="L1305"><span class="lineNum"> 1305</span> : this->append(S, E);</span>
|
|
<span id="L1306"><span class="lineNum"> 1306</span> : }</span>
|
|
<span id="L1307"><span class="lineNum"> 1307</span> : </span>
|
|
<span id="L1308"><span class="lineNum"> 1308</span> : // note: The enable_if restricts Container to types that have a .begin() and</span>
|
|
<span id="L1309"><span class="lineNum"> 1309</span> : // .end() that return valid input iterators.</span>
|
|
<span id="L1310"><span class="lineNum"> 1310</span> : template <</span>
|
|
<span id="L1311"><span class="lineNum"> 1311</span> : typename Container,</span>
|
|
<span id="L1312"><span class="lineNum"> 1312</span> : std::enable_if_t<</span>
|
|
<span id="L1313"><span class="lineNum"> 1313</span> : std::is_convertible<</span>
|
|
<span id="L1314"><span class="lineNum"> 1314</span> : typename std::iterator_traits<</span>
|
|
<span id="L1315"><span class="lineNum"> 1315</span> : decltype(std::declval<Container>()</span>
|
|
<span id="L1316"><span class="lineNum"> 1316</span> : .begin())>::iterator_category,</span>
|
|
<span id="L1317"><span class="lineNum"> 1317</span> : std::input_iterator_tag>::value &&</span>
|
|
<span id="L1318"><span class="lineNum"> 1318</span> : std::is_convertible<</span>
|
|
<span id="L1319"><span class="lineNum"> 1319</span> : typename std::iterator_traits<</span>
|
|
<span id="L1320"><span class="lineNum"> 1320</span> : decltype(std::declval<Container>()</span>
|
|
<span id="L1321"><span class="lineNum"> 1321</span> : .end())>::iterator_category,</span>
|
|
<span id="L1322"><span class="lineNum"> 1322</span> : std::input_iterator_tag>::value,</span>
|
|
<span id="L1323"><span class="lineNum"> 1323</span> : int> = 0></span>
|
|
<span id="L1324"><span class="lineNum"> 1324</span> : explicit SmallVector(Container&& c) : SmallVectorImpl<T>(N) {</span>
|
|
<span id="L1325"><span class="lineNum"> 1325</span> : this->append(c.begin(), c.end());</span>
|
|
<span id="L1326"><span class="lineNum"> 1326</span> : }</span>
|
|
<span id="L1327"><span class="lineNum"> 1327</span> : </span>
|
|
<span id="L1328"><span class="lineNum"> 1328</span> : SmallVector(std::initializer_list<T> IL) : SmallVectorImpl<T>(N) {</span>
|
|
<span id="L1329"><span class="lineNum"> 1329</span> : this->assign(IL);</span>
|
|
<span id="L1330"><span class="lineNum"> 1330</span> : }</span>
|
|
<span id="L1331"><span class="lineNum"> 1331</span> : </span>
|
|
<span id="L1332"><span class="lineNum"> 1332</span> : SmallVector(const SmallVector& RHS) : SmallVectorImpl<T>(N) {</span>
|
|
<span id="L1333"><span class="lineNum"> 1333</span> : if (!RHS.empty())</span>
|
|
<span id="L1334"><span class="lineNum"> 1334</span> : SmallVectorImpl<T>::operator=(RHS);</span>
|
|
<span id="L1335"><span class="lineNum"> 1335</span> : }</span>
|
|
<span id="L1336"><span class="lineNum"> 1336</span> : </span>
|
|
<span id="L1337"><span class="lineNum"> 1337</span> : SmallVector& operator=(const SmallVector& RHS) {</span>
|
|
<span id="L1338"><span class="lineNum"> 1338</span> : SmallVectorImpl<T>::operator=(RHS);</span>
|
|
<span id="L1339"><span class="lineNum"> 1339</span> : return *this;</span>
|
|
<span id="L1340"><span class="lineNum"> 1340</span> : }</span>
|
|
<span id="L1341"><span class="lineNum"> 1341</span> : </span>
|
|
<span id="L1342"><span class="lineNum"> 1342</span> : SmallVector(SmallVector&& RHS) : SmallVectorImpl<T>(N) {</span>
|
|
<span id="L1343"><span class="lineNum"> 1343</span> : if (!RHS.empty())</span>
|
|
<span id="L1344"><span class="lineNum"> 1344</span> : SmallVectorImpl<T>::operator=(::std::move(RHS));</span>
|
|
<span id="L1345"><span class="lineNum"> 1345</span> : }</span>
|
|
<span id="L1346"><span class="lineNum"> 1346</span> : </span>
|
|
<span id="L1347"><span class="lineNum"> 1347</span> : // note: The enable_if restricts Container to types that have a .begin() and</span>
|
|
<span id="L1348"><span class="lineNum"> 1348</span> : // .end() that return valid input iterators.</span>
|
|
<span id="L1349"><span class="lineNum"> 1349</span> : template <</span>
|
|
<span id="L1350"><span class="lineNum"> 1350</span> : typename Container,</span>
|
|
<span id="L1351"><span class="lineNum"> 1351</span> : std::enable_if_t<</span>
|
|
<span id="L1352"><span class="lineNum"> 1352</span> : std::is_convertible<</span>
|
|
<span id="L1353"><span class="lineNum"> 1353</span> : typename std::iterator_traits<</span>
|
|
<span id="L1354"><span class="lineNum"> 1354</span> : decltype(std::declval<Container>()</span>
|
|
<span id="L1355"><span class="lineNum"> 1355</span> : .begin())>::iterator_category,</span>
|
|
<span id="L1356"><span class="lineNum"> 1356</span> : std::input_iterator_tag>::value &&</span>
|
|
<span id="L1357"><span class="lineNum"> 1357</span> : std::is_convertible<</span>
|
|
<span id="L1358"><span class="lineNum"> 1358</span> : typename std::iterator_traits<</span>
|
|
<span id="L1359"><span class="lineNum"> 1359</span> : decltype(std::declval<Container>()</span>
|
|
<span id="L1360"><span class="lineNum"> 1360</span> : .end())>::iterator_category,</span>
|
|
<span id="L1361"><span class="lineNum"> 1361</span> : std::input_iterator_tag>::value,</span>
|
|
<span id="L1362"><span class="lineNum"> 1362</span> : int> = 0></span>
|
|
<span id="L1363"><span class="lineNum"> 1363</span> : const SmallVector& operator=(const Container& RHS) {</span>
|
|
<span id="L1364"><span class="lineNum"> 1364</span> : this->assign(RHS.begin(), RHS.end());</span>
|
|
<span id="L1365"><span class="lineNum"> 1365</span> : return *this;</span>
|
|
<span id="L1366"><span class="lineNum"> 1366</span> : }</span>
|
|
<span id="L1367"><span class="lineNum"> 1367</span> : </span>
|
|
<span id="L1368"><span class="lineNum"> 1368</span> : SmallVector(SmallVectorImpl<T>&& RHS) : SmallVectorImpl<T>(N) {</span>
|
|
<span id="L1369"><span class="lineNum"> 1369</span> : if (!RHS.empty())</span>
|
|
<span id="L1370"><span class="lineNum"> 1370</span> : SmallVectorImpl<T>::operator=(::std::move(RHS));</span>
|
|
<span id="L1371"><span class="lineNum"> 1371</span> : }</span>
|
|
<span id="L1372"><span class="lineNum"> 1372</span> : </span>
|
|
<span id="L1373"><span class="lineNum"> 1373</span> : SmallVector& operator=(SmallVector&& RHS) {</span>
|
|
<span id="L1374"><span class="lineNum"> 1374</span> : SmallVectorImpl<T>::operator=(::std::move(RHS));</span>
|
|
<span id="L1375"><span class="lineNum"> 1375</span> : return *this;</span>
|
|
<span id="L1376"><span class="lineNum"> 1376</span> : }</span>
|
|
<span id="L1377"><span class="lineNum"> 1377</span> : </span>
|
|
<span id="L1378"><span class="lineNum"> 1378</span> : SmallVector& operator=(SmallVectorImpl<T>&& RHS) {</span>
|
|
<span id="L1379"><span class="lineNum"> 1379</span> : SmallVectorImpl<T>::operator=(::std::move(RHS));</span>
|
|
<span id="L1380"><span class="lineNum"> 1380</span> : return *this;</span>
|
|
<span id="L1381"><span class="lineNum"> 1381</span> : }</span>
|
|
<span id="L1382"><span class="lineNum"> 1382</span> : </span>
|
|
<span id="L1383"><span class="lineNum"> 1383</span> : // note: The enable_if restricts Container to types that have a .begin() and</span>
|
|
<span id="L1384"><span class="lineNum"> 1384</span> : // .end() that return valid input iterators.</span>
|
|
<span id="L1385"><span class="lineNum"> 1385</span> : template <</span>
|
|
<span id="L1386"><span class="lineNum"> 1386</span> : typename Container,</span>
|
|
<span id="L1387"><span class="lineNum"> 1387</span> : std::enable_if_t<</span>
|
|
<span id="L1388"><span class="lineNum"> 1388</span> : std::is_convertible<</span>
|
|
<span id="L1389"><span class="lineNum"> 1389</span> : typename std::iterator_traits<</span>
|
|
<span id="L1390"><span class="lineNum"> 1390</span> : decltype(std::declval<Container>()</span>
|
|
<span id="L1391"><span class="lineNum"> 1391</span> : .begin())>::iterator_category,</span>
|
|
<span id="L1392"><span class="lineNum"> 1392</span> : std::input_iterator_tag>::value &&</span>
|
|
<span id="L1393"><span class="lineNum"> 1393</span> : std::is_convertible<</span>
|
|
<span id="L1394"><span class="lineNum"> 1394</span> : typename std::iterator_traits<</span>
|
|
<span id="L1395"><span class="lineNum"> 1395</span> : decltype(std::declval<Container>()</span>
|
|
<span id="L1396"><span class="lineNum"> 1396</span> : .end())>::iterator_category,</span>
|
|
<span id="L1397"><span class="lineNum"> 1397</span> : std::input_iterator_tag>::value,</span>
|
|
<span id="L1398"><span class="lineNum"> 1398</span> : int> = 0></span>
|
|
<span id="L1399"><span class="lineNum"> 1399</span> : const SmallVector& operator=(Container&& C) {</span>
|
|
<span id="L1400"><span class="lineNum"> 1400</span> : this->assign(C.begin(), C.end());</span>
|
|
<span id="L1401"><span class="lineNum"> 1401</span> : return *this;</span>
|
|
<span id="L1402"><span class="lineNum"> 1402</span> : }</span>
|
|
<span id="L1403"><span class="lineNum"> 1403</span> : </span>
|
|
<span id="L1404"><span class="lineNum"> 1404</span> : SmallVector& operator=(std::initializer_list<T> IL) {</span>
|
|
<span id="L1405"><span class="lineNum"> 1405</span> : this->assign(IL);</span>
|
|
<span id="L1406"><span class="lineNum"> 1406</span> : return *this;</span>
|
|
<span id="L1407"><span class="lineNum"> 1407</span> : }</span>
|
|
<span id="L1408"><span class="lineNum"> 1408</span> : };</span>
|
|
<span id="L1409"><span class="lineNum"> 1409</span> : </span>
|
|
<span id="L1410"><span class="lineNum"> 1410</span> : template <typename T, unsigned N></span>
|
|
<span id="L1411"><span class="lineNum"> 1411</span> : inline size_t capacity_in_bytes(const SmallVector<T, N>& X) {</span>
|
|
<span id="L1412"><span class="lineNum"> 1412</span> : return X.capacity_in_bytes();</span>
|
|
<span id="L1413"><span class="lineNum"> 1413</span> : }</span>
|
|
<span id="L1414"><span class="lineNum"> 1414</span> : </span>
|
|
<span id="L1415"><span class="lineNum"> 1415</span> : template <typename T, unsigned N></span>
|
|
<span id="L1416"><span class="lineNum"> 1416</span> : std::ostream& operator<<(std::ostream& out, const SmallVector<T, N>& list) {</span>
|
|
<span id="L1417"><span class="lineNum"> 1417</span> : int i = 0;</span>
|
|
<span id="L1418"><span class="lineNum"> 1418</span> : out << "[";</span>
|
|
<span id="L1419"><span class="lineNum"> 1419</span> : for (auto e : list) {</span>
|
|
<span id="L1420"><span class="lineNum"> 1420</span> : if (i++ > 0)</span>
|
|
<span id="L1421"><span class="lineNum"> 1421</span> : out << ", ";</span>
|
|
<span id="L1422"><span class="lineNum"> 1422</span> : out << e;</span>
|
|
<span id="L1423"><span class="lineNum"> 1423</span> : }</span>
|
|
<span id="L1424"><span class="lineNum"> 1424</span> : out << "]";</span>
|
|
<span id="L1425"><span class="lineNum"> 1425</span> : return out;</span>
|
|
<span id="L1426"><span class="lineNum"> 1426</span> : }</span>
|
|
<span id="L1427"><span class="lineNum"> 1427</span> : </span>
|
|
<span id="L1428"><span class="lineNum"> 1428</span> : template <typename RangeType></span>
|
|
<span id="L1429"><span class="lineNum"> 1429</span> : using ValueTypeFromRangeType =</span>
|
|
<span id="L1430"><span class="lineNum"> 1430</span> : typename std::remove_const<typename std::remove_reference<</span>
|
|
<span id="L1431"><span class="lineNum"> 1431</span> : decltype(*std::begin(std::declval<RangeType&>()))>::type>::type;</span>
|
|
<span id="L1432"><span class="lineNum"> 1432</span> : </span>
|
|
<span id="L1433"><span class="lineNum"> 1433</span> : /// Given a range of type R, iterate the entire range and return a</span>
|
|
<span id="L1434"><span class="lineNum"> 1434</span> : /// SmallVector with elements of the vector. This is useful, for example,</span>
|
|
<span id="L1435"><span class="lineNum"> 1435</span> : /// when you want to iterate a range and then sort the results.</span>
|
|
<span id="L1436"><span class="lineNum"> 1436</span> : template <unsigned Size, typename R></span>
|
|
<span id="L1437"><span class="lineNum"> 1437</span> : SmallVector<ValueTypeFromRangeType<R>, Size> to_vector(R&& Range) {</span>
|
|
<span id="L1438"><span class="lineNum"> 1438</span> : return {std::begin(Range), std::end(Range)};</span>
|
|
<span id="L1439"><span class="lineNum"> 1439</span> : }</span>
|
|
<span id="L1440"><span class="lineNum"> 1440</span> : template <typename R></span>
|
|
<span id="L1441"><span class="lineNum"> 1441</span> : SmallVector<</span>
|
|
<span id="L1442"><span class="lineNum"> 1442</span> : ValueTypeFromRangeType<R>,</span>
|
|
<span id="L1443"><span class="lineNum"> 1443</span> : CalculateSmallVectorDefaultInlinedElements<</span>
|
|
<span id="L1444"><span class="lineNum"> 1444</span> : ValueTypeFromRangeType<R>>::value></span>
|
|
<span id="L1445"><span class="lineNum"> 1445</span> : to_vector(R&& Range) {</span>
|
|
<span id="L1446"><span class="lineNum"> 1446</span> : return {std::begin(Range), std::end(Range)};</span>
|
|
<span id="L1447"><span class="lineNum"> 1447</span> : }</span>
|
|
<span id="L1448"><span class="lineNum"> 1448</span> : </span>
|
|
<span id="L1449"><span class="lineNum"> 1449</span> : } // end namespace c10</span>
|
|
<span id="L1450"><span class="lineNum"> 1450</span> : </span>
|
|
<span id="L1451"><span class="lineNum"> 1451</span> : namespace std {</span>
|
|
<span id="L1452"><span class="lineNum"> 1452</span> : </span>
|
|
<span id="L1453"><span class="lineNum"> 1453</span> : /// Implement std::swap in terms of SmallVector swap.</span>
|
|
<span id="L1454"><span class="lineNum"> 1454</span> : template <typename T></span>
|
|
<span id="L1455"><span class="lineNum"> 1455</span> : inline void swap(c10::SmallVectorImpl<T>& LHS, c10::SmallVectorImpl<T>& RHS) {</span>
|
|
<span id="L1456"><span class="lineNum"> 1456</span> : LHS.swap(RHS);</span>
|
|
<span id="L1457"><span class="lineNum"> 1457</span> : }</span>
|
|
<span id="L1458"><span class="lineNum"> 1458</span> : </span>
|
|
<span id="L1459"><span class="lineNum"> 1459</span> : /// Implement std::swap in terms of SmallVector swap.</span>
|
|
<span id="L1460"><span class="lineNum"> 1460</span> : template <typename T, unsigned N></span>
|
|
<span id="L1461"><span class="lineNum"> 1461</span> : inline void swap(c10::SmallVector<T, N>& LHS, c10::SmallVector<T, N>& RHS) {</span>
|
|
<span id="L1462"><span class="lineNum"> 1462</span> : LHS.swap(RHS);</span>
|
|
<span id="L1463"><span class="lineNum"> 1463</span> : }</span>
|
|
<span id="L1464"><span class="lineNum"> 1464</span> : </span>
|
|
<span id="L1465"><span class="lineNum"> 1465</span> : } // end namespace std</span>
|
|
<span id="L1466"><span class="lineNum"> 1466</span> : </span>
|
|
<span id="L1467"><span class="lineNum"> 1467</span> : C10_CLANG_DIAGNOSTIC_POP()</span>
|
|
</pre>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
<br>
|
|
|
|
<table width="100%" border=0 cellspacing=0 cellpadding=0>
|
|
<tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
|
|
<tr><td class="versionInfo">Generated by: <a href="https://github.com//linux-test-project/lcov" target="_parent">LCOV version 2.0-1</a></td></tr>
|
|
</table>
|
|
<br>
|
|
|
|
</body>
|
|
</html>
|