http://git-wip-us.apache.org/repos/asf/mesos-site/blob/09fd0301/content/api/latest/c++/src_2master_2allocator_2sorter_2random_2utils_8hpp_source.html
----------------------------------------------------------------------
diff --git
a/content/api/latest/c++/src_2master_2allocator_2sorter_2random_2utils_8hpp_source.html
b/content/api/latest/c++/src_2master_2allocator_2sorter_2random_2utils_8hpp_source.html
index c0e19d5..74a3615 100644
---
a/content/api/latest/c++/src_2master_2allocator_2sorter_2random_2utils_8hpp_source.html
+++
b/content/api/latest/c++/src_2master_2allocator_2sorter_2random_2utils_8hpp_source.html
@@ -55,7 +55,7 @@
<a href="src_2master_2allocator_2sorter_2random_2utils_8hpp.html">Go to the
documentation of this file.</a><div class="fragment"><div class="line"><a
name="l00001"></a><span class="lineno"> 1</span> <span
class="comment">// Licensed to the Apache Software Foundation (ASF) under
one</span></div><div class="line"><a name="l00002"></a><span class="lineno">
2</span> <span class="comment">// or more contributor license agreements.
See the NOTICE file</span></div><div class="line"><a name="l00003"></a><span
class="lineno"> 3</span> <span class="comment">// distributed with this
work for additional information</span></div><div class="line"><a
name="l00004"></a><span class="lineno"> 4</span> <span
class="comment">// regarding copyright ownership. The ASF licenses this
file</span></div><div class="line"><a name="l00005"></a><span class="lineno">
5</span> <span class="comment">// to you under the Apache License,
Version 2.0 (the</span></div><div class
="line"><a name="l00006"></a><span class="lineno"> 6</span> <span
class="comment">// "License"); you may not use this file except in
compliance</span></div><div class="line"><a name="l00007"></a><span
class="lineno"> 7</span> <span class="comment">// with the License.
You may obtain a copy of the License at</span></div><div class="line"><a
name="l00008"></a><span class="lineno"> 8</span> <span
class="comment">//</span></div><div class="line"><a name="l00009"></a><span
class="lineno"> 9</span> <span class="comment">//
http://www.apache.org/licenses/LICENSE-2.0</span></div><div class="line"><a
name="l00010"></a><span class="lineno"> 10</span> <span
class="comment">//</span></div><div class="line"><a name="l00011"></a><span
class="lineno"> 11</span> <span class="comment">// Unless required by
applicable law or agreed to in writing, software</span></div><div
class="line"><a name="l00012"></a><span class="lineno"> 12</span>&#
160;<span class="comment">// distributed under the License is distributed on
an "AS IS" BASIS,</span></div><div class="line"><a
name="l00013"></a><span class="lineno"> 13</span> <span
class="comment">// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express
or implied.</span></div><div class="line"><a name="l00014"></a><span
class="lineno"> 14</span> <span class="comment">// See the License for
the specific language governing permissions and</span></div><div
class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span
class="comment">// limitations under the License.</span></div><div
class="line"><a name="l00016"></a><span class="lineno">
16</span> </div><div class="line"><a name="l00017"></a><span
class="lineno"> 17</span> <span class="preprocessor">#ifndef
__MASTER_ALLOCATOR_SORTER_RANDOM_UTILS_HPP__</span></div><div class="line"><a
name="l00018"></a><span class="lineno"> 18</span> <span
class="preprocessor">#def
ine __MASTER_ALLOCATOR_SORTER_RANDOM_UTILS_HPP__</span></div><div
class="line"><a name="l00019"></a><span class="lineno">
19</span> </div><div class="line"><a name="l00020"></a><span
class="lineno"> 20</span> <span class="preprocessor">#include
<algorithm></span></div><div class="line"><a name="l00021"></a><span
class="lineno"> 21</span> <span class="preprocessor">#include
<cmath></span></div><div class="line"><a name="l00022"></a><span
class="lineno"> 22</span> <span class="preprocessor">#include
<numeric></span></div><div class="line"><a name="l00023"></a><span
class="lineno"> 23</span> <span class="preprocessor">#include
<random></span></div><div class="line"><a name="l00024"></a><span
class="lineno"> 24</span> <span class="preprocessor">#include
<vector></span></div><div class="line"><a name="l00025"></a><span
class="lineno"> 25</span> </div><div class="line"><a
name="l00026"></a><span class="lineno">
26</span> <span class="preprocessor">#include <<a class="code"
href="stout_2include_2stout_2check_8hpp.html">stout/check.hpp</a>></span></div><div
class="line"><a name="l00027"></a><span class="lineno">
27</span> </div><div class="line"><a name="l00028"></a><span
class="lineno"> 28</span> <span class="keyword">namespace </span><a
class="code" href="namespacemesos.html">mesos</a> {</div><div class="line"><a
name="l00029"></a><span class="lineno"> 29</span> <span
class="keyword">namespace </span><a class="code"
href="namespaceinternal.html">internal</a> {</div><div class="line"><a
name="l00030"></a><span class="lineno"> 30</span> <span
class="keyword">namespace </span><a class="code"
href="namespacemesos_1_1v1_1_1master.html">master</a> {</div><div
class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span
class="keyword">namespace </span>allocator {</div><div class="line"><a
name="l00032"></a><span class="lineno"> 32</sp
an> </div><div class="line"><a name="l00033"></a><span class="lineno">
33</span> <span class="comment">// A weighted variant of std::shuffle.
Items with higher weight</span></div><div class="line"><a
name="l00034"></a><span class="lineno"> 34</span> <span
class="comment">// have a higher chance of being towards the front of the
list,</span></div><div class="line"><a name="l00035"></a><span class="lineno">
35</span> <span class="comment">// equivalent to weighted random sampling
without replacement.</span></div><div class="line"><a name="l00036"></a><span
class="lineno"> 36</span> <span class="comment">// Code adapted from the
following paper:</span></div><div class="line"><a name="l00037"></a><span
class="lineno"> 37</span> <span class="comment">//</span></div><div
class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span
class="comment">//
http://utopia.duth.gr/~pefraimi/research/data/2007EncOfAlg.pdf</span></div><div
cla
ss="line"><a name="l00039"></a><span class="lineno"> 39</span> <span
class="comment">// Found from:
https://softwareengineering.stackexchange.com/a/344274</span></div><div
class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span
class="comment">//</span></div><div class="line"><a name="l00041"></a><span
class="lineno"> 41</span> <span class="comment">// This has O(n log n)
runtime complexity.</span></div><div class="line"><a name="l00042"></a><span
class="lineno"> 42</span> <span class="keyword">template</span>
<<span class="keyword">class</span> RandomAccessIterator, <span
class="keyword">class</span> URBG></div><div class="line"><a
name="l00043"></a><span class="lineno"><a class="line"
href="namespacemesos_1_1internal_1_1master_1_1allocator.html#affc489370541ae3ab4bdd809b990eba4">
43</a></span> <span class="keywordtype">void</span> <a class="code"
href="namespacemesos_1_1internal_1_1master_1_1allocator.html#affc489370541ae3ab
4bdd809b990eba4">weightedShuffle</a>(</div><div class="line"><a
name="l00044"></a><span class="lineno"> 44</span> 
RandomAccessIterator begin,</div><div class="line"><a name="l00045"></a><span
class="lineno"> 45</span>  RandomAccessIterator end,</div><div
class="line"><a name="l00046"></a><span class="lineno"> 46</span> 
<span class="keyword">const</span> std::vector<double>&
weights,</div><div class="line"><a name="l00047"></a><span class="lineno">
47</span>  URBG&& urbg)</div><div class="line"><a
name="l00048"></a><span class="lineno"> 48</span> {</div><div
class="line"><a name="l00049"></a><span class="lineno"> 49</span> 
CHECK_EQ(end - begin, (<span class="keywordtype">int</span>)
weights.size());</div><div class="line"><a name="l00050"></a><span
class="lineno"> 50</span> </div><div class="line"><a
name="l00051"></a><span class="lineno"> 51</span> 
std::vector<double> keys(weights.size(
));</div><div class="line"><a name="l00052"></a><span class="lineno">
52</span> </div><div class="line"><a name="l00053"></a><span
class="lineno"> 53</span>  <span class="keywordflow">for</span> (<span
class="keywordtype">size_t</span> i = 0; i < weights.size(); ++i)
{</div><div class="line"><a name="l00054"></a><span class="lineno">
54</span>  CHECK_GT(weights[i], 0.0);</div><div class="line"><a
name="l00055"></a><span class="lineno"> 55</span> </div><div
class="line"><a name="l00056"></a><span class="lineno"> 56</span> 
<span class="comment">// Make the key negative so that we don't have to
reverse sort.</span></div><div class="line"><a name="l00057"></a><span
class="lineno"> 57</span>  <span class="keywordtype">double</span> <a
class="code"
href="namespaceos.html#aede9f61dcb4b7d1f276302a7bce37446">random</a> =
std::uniform_real_distribution<>(0.0, 1.0)(urbg);</div><div
class="line"><a name="l00058"></a><span class="
lineno"> 58</span>  keys[i] = 0.0 - std::pow(random, (1.0 /
weights[i]));</div><div class="line"><a name="l00059"></a><span class="lineno">
59</span>  }</div><div class="line"><a name="l00060"></a><span
class="lineno"> 60</span> </div><div class="line"><a
name="l00061"></a><span class="lineno"> 61</span>  <span
class="comment">// Sort from smallest to largest keys. We store the sort
permutation</span></div><div class="line"><a name="l00062"></a><span
class="lineno"> 62</span>  <span class="comment">// so that we can
apply it to `items`.</span></div><div class="line"><a name="l00063"></a><span
class="lineno"> 63</span>  std::vector<size_t>
permutation(keys.size());</div><div class="line"><a name="l00064"></a><span
class="lineno"> 64</span>  std::iota(permutation.begin(),
permutation.end(), 0);</div><div class="line"><a name="l00065"></a><span
class="lineno"> 65</span> </div><div class="line"><a name="l00066"></a><s
pan class="lineno"> 66</span>  std::sort(permutation.begin(),
permutation.end(),</div><div class="line"><a name="l00067"></a><span
class="lineno"> 67</span>  [&](<span
class="keywordtype">size_t</span> i, <span class="keywordtype">size_t</span>
j){ <span class="keywordflow">return</span> keys[i] < keys[j]; });</div><div
class="line"><a name="l00068"></a><span class="lineno">
68</span> </div><div class="line"><a name="l00069"></a><span
class="lineno"> 69</span>  <span class="comment">// Now apply the
permutation to `items`.</span></div><div class="line"><a
name="l00070"></a><span class="lineno"> 70</span>  <span
class="comment">//</span></div><div class="line"><a name="l00071"></a><span
class="lineno"> 71</span>  <span class="comment">// TODO(bmahler):
Consider avoiding the copy of entries in `items`</span></div><div
class="line"><a name="l00072"></a><span class="lineno"> 72</span> 
<span class="comment">// via an in-p
lace application of the permutation:</span></div><div class="line"><a
name="l00073"></a><span class="lineno"> 73</span>  <span
class="comment">//
https://blog.merovius.de/2014/08/12/applying-permutation-in-constant.html</span></div><div
class="line"><a name="l00074"></a><span class="lineno"> 74</span> 
std::vector<typename
std::iterator_traits<RandomAccessIterator>::value_type></div><div
class="line"><a name="l00075"></a><span class="lineno"> 75</span> 
shuffled(end - begin);</div><div class="line"><a name="l00076"></a><span
class="lineno"> 76</span> </div><div class="line"><a
name="l00077"></a><span class="lineno"> 77</span>  <a class="code"
href="namespacemesos_1_1internal_1_1recordio.html#a5fcab68176c462aaeed909f304c91bdf">std::transform</a>(</div><div
class="line"><a name="l00078"></a><span class="lineno"> 78</span> 
permutation.begin(),</div><div class="line"><a name="l00079"></a><span
class="lineno"> 79</span
>  permutation.end(),</div><div class="line"><a
>name="l00080"></a><span class="lineno"> 80</span> 
>shuffled.begin(),</div><div class="line"><a name="l00081"></a><span
>class="lineno"> 81</span>  [&](<span
>class="keywordtype">size_t</span> i){ <span class="keywordflow">return</span>
>begin[i]; });</div><div class="line"><a name="l00082"></a><span
>class="lineno"> 82</span> </div><div class="line"><a
>name="l00083"></a><span class="lineno"> 83</span>  <span
>class="comment">// Move the shuffled copy back into the
>`items`.</span></div><div class="line"><a name="l00084"></a><span
>class="lineno"> 84</span>  std::move(shuffled.begin(),
>shuffled.end(), begin);</div><div class="line"><a name="l00085"></a><span
>class="lineno"> 85</span> }</div><div class="line"><a
>name="l00086"></a><span class="lineno"> 86</span> </div><div
>class="line"><a name="l00087"></a><span class="lineno"> 87</span> }
><span class="comment">//
namespace allocator {</span></div><div class="line"><a name="l00088"></a><span
class="lineno"> 88</span> } <span class="comment">// namespace master
{</span></div><div class="line"><a name="l00089"></a><span class="lineno">
89</span> } <span class="comment">// namespace internal {</span></div><div
class="line"><a name="l00090"></a><span class="lineno"> 90</span> }
<span class="comment">// namespace mesos {</span></div><div class="line"><a
name="l00091"></a><span class="lineno"> 91</span> </div><div
class="line"><a name="l00092"></a><span class="lineno"> 92</span> <span
class="preprocessor">#endif //
__MASTER_ALLOCATOR_SORTER_RANDOM_UTILS_HPP__</span></div><div class="ttc"
id="namespacemesos_1_1v1_1_1master_html"><div class="ttname"><a
href="namespacemesos_1_1v1_1_1master.html">mesos::v1::master</a></div><div
class="ttdef"><b>Definition:</b> master.hpp:27</div></div>
<div class="ttc" id="stout_2include_2stout_2check_8hpp_html"><div
class="ttname"><a
href="stout_2include_2stout_2check_8hpp.html">check.hpp</a></div></div>
<div class="ttc" id="namespacemesos_html"><div class="ttname"><a
href="namespacemesos.html">mesos</a></div><div class="ttdef"><b>Definition:</b>
spec.hpp:30</div></div>
-<div class="ttc" id="namespaceos_html_aede9f61dcb4b7d1f276302a7bce37446"><div
class="ttname"><a
href="namespaceos.html#aede9f61dcb4b7d1f276302a7bce37446">os::random</a></div><div
class="ttdeci">int random()</div><div class="ttdef"><b>Definition:</b>
os.hpp:550</div></div>
+<div class="ttc" id="namespaceos_html_aede9f61dcb4b7d1f276302a7bce37446"><div
class="ttname"><a
href="namespaceos.html#aede9f61dcb4b7d1f276302a7bce37446">os::random</a></div><div
class="ttdeci">int random()</div><div class="ttdef"><b>Definition:</b>
os.hpp:580</div></div>
<div class="ttc"
id="namespacemesos_1_1internal_1_1master_1_1allocator_html_affc489370541ae3ab4bdd809b990eba4"><div
class="ttname"><a
href="namespacemesos_1_1internal_1_1master_1_1allocator.html#affc489370541ae3ab4bdd809b990eba4">mesos::internal::master::allocator::weightedShuffle</a></div><div
class="ttdeci">void weightedShuffle(RandomAccessIterator begin,
RandomAccessIterator end, const std::vector< double > &weights, URBG
&&urbg)</div><div class="ttdef"><b>Definition:</b>
utils.hpp:43</div></div>
<div class="ttc"
id="namespacemesos_1_1internal_1_1recordio_html_a5fcab68176c462aaeed909f304c91bdf"><div
class="ttname"><a
href="namespacemesos_1_1internal_1_1recordio.html#a5fcab68176c462aaeed909f304c91bdf">mesos::internal::recordio::transform</a></div><div
class="ttdeci">process::Future< Nothing > transform(process::Owned<
Reader< T >> &&reader, const std::function<
std::string(const T &)> &func, process::http::Pipe::Writer
writer)</div><div class="ttdoc">This is a helper function that reads records
from a Reader, applies a transformation to the records a...</div><div
class="ttdef"><b>Definition:</b> recordio.hpp:112</div></div>
<div class="ttc" id="namespaceinternal_html"><div class="ttname"><a
href="namespaceinternal.html">internal</a></div><div
class="ttdef"><b>Definition:</b> attributes.hpp:24</div></div>
