1/*
2 * Copyright (C) 2013 Google Inc. All rights reserved.
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are
6 * met:
7 *
8 *     * Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 *     * Redistributions in binary form must reproduce the above
11 * copyright notice, this list of conditions and the following disclaimer
12 * in the documentation and/or other materials provided with the
13 * distribution.
14 *     * Neither the name of Google Inc. nor the names of its
15 * contributors may be used to endorse or promote products derived from
16 * this software without specific prior written permission.
17 *
18 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
19 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
20 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 */
30
31#ifndef ContentDistribution_h
32#define ContentDistribution_h
33
34#include "core/dom/Node.h"
35#include "wtf/HashMap.h"
36#include "wtf/Vector.h"
37
38namespace blink {
39
40class ContentDistribution FINAL {
41    DISALLOW_ALLOCATION();
42public:
43    ContentDistribution() { m_nodes.reserveInitialCapacity(32); }
44
45    PassRefPtrWillBeRawPtr<Node> first() const { return m_nodes.first(); }
46    PassRefPtrWillBeRawPtr<Node> last() const { return m_nodes.last(); }
47    PassRefPtrWillBeRawPtr<Node> at(size_t index) const { return m_nodes.at(index); }
48
49    size_t size() const { return m_nodes.size(); }
50    bool isEmpty() const { return m_nodes.isEmpty(); }
51
52    void append(PassRefPtrWillBeRawPtr<Node>);
53    void clear() { m_nodes.clear(); m_indices.clear(); }
54    void shrinkToFit() { m_nodes.shrinkToFit(); }
55
56    bool contains(const Node* node) const { return m_indices.contains(node); }
57    size_t find(const Node*) const;
58    Node* nextTo(const Node*) const;
59    Node* previousTo(const Node*) const;
60
61    void swap(ContentDistribution& other);
62
63    const WillBeHeapVector<RefPtrWillBeMember<Node> >& nodes() const { return m_nodes; }
64
65    void trace(Visitor*);
66
67private:
68    WillBeHeapVector<RefPtrWillBeMember<Node> > m_nodes;
69    WillBeHeapHashMap<RawPtrWillBeMember<const Node>, size_t> m_indices;
70};
71
72}
73
74#endif
75