OLD | NEW |
---|---|
1 /* | 1 /* |
2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * Copyright (C) 2013 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 10 matching lines...) Expand all Loading... | |
21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 21 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 22 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
29 */ | 29 */ |
30 | 30 |
31 #ifndef Task_h | 31 #ifndef WTF_TableSet_h |
32 #define Task_h | 32 #define WTF_TableSet_h |
33 | 33 |
34 #include "wtf/Functional.h" | 34 #include "wtf/NonCopyingSort.h" |
35 #include <public/WebThread.h> | |
36 | 35 |
37 namespace WebCore { | 36 #include <algorithm> |
38 | 37 |
39 class Task : public WebKit::WebThread::Task { | 38 namespace WTF { |
39 | |
40 template<typename T> | |
41 class TableSet { | |
eseidel
2013/05/22 00:40:14
This needs to be more scary. And I would add a he
| |
40 public: | 42 public: |
41 explicit Task(const Closure& closure) | 43 typedef bool (*Predicate)(const T&, const T&); |
42 : m_closure(closure) | 44 |
45 explicit TableSet(Predicate compareLess) | |
46 : m_compareLess(compareLess) | |
47 , m_values(0) | |
48 , m_size(0) | |
43 { | 49 { |
44 } | 50 } |
45 | 51 |
46 virtual void run() OVERRIDE | 52 void init(T values[], size_t size) |
47 { | 53 { |
48 m_closure(); | 54 ASSERT(isEmpty()); |
55 m_values = values; | |
56 m_size = size; | |
57 nonCopyingSort(m_values, m_values + m_size, m_compareLess); | |
49 } | 58 } |
50 | 59 |
60 bool contains(const T& value) | |
61 { | |
62 ASSERT(!isEmpty()); | |
eseidel
2013/05/22 00:40:14
Do you also want to ASSERT That value is never nul
abarth-chromium
2013/05/22 00:58:25
It's a const reference. There's no way for a cons
| |
63 return std::binary_search(m_values, m_values + m_size, value, m_compareL ess); | |
64 } | |
65 | |
66 bool isEmpty() { return !m_size; } | |
eseidel
2013/05/22 00:40:14
This is really isInitialized, no?
abarth-chromium
2013/05/22 00:58:25
Yep.
| |
67 | |
51 private: | 68 private: |
52 Closure m_closure; | 69 Predicate m_compareLess; |
70 T* m_values; | |
71 size_t m_size; | |
53 }; | 72 }; |
54 | 73 |
55 } // namespace WebCore | 74 } // namespace WTF |
56 | 75 |
57 #endif // Task_h | 76 using WTF::TableSet; |
77 | |
78 #endif | |
OLD | NEW |