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_LiteralSet_h |
32 #define Task_h | 32 #define WTF_LiteralSet_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, typename Comparer> |
| 41 class LiteralSet { |
40 public: | 42 public: |
41 explicit Task(const Closure& closure) | 43 LiteralSet() |
42 : m_closure(closure) | 44 : m_values(0) |
| 45 , m_size(0) |
43 { | 46 { |
44 } | 47 } |
45 | 48 |
46 virtual void run() OVERRIDE | 49 void init(T values[], size_t size) |
47 { | 50 { |
48 m_closure(); | 51 ASSERT(!isInitialized()); |
| 52 m_values = values; |
| 53 m_size = size; |
| 54 nonCopyingSort(m_values, m_values + m_size, Comparer::lessThan); |
49 } | 55 } |
50 | 56 |
| 57 bool contains(const T& value) |
| 58 { |
| 59 ASSERT(isInitialized()); |
| 60 return std::binary_search(m_values, m_values + m_size, value, Comparer::
lessThan); |
| 61 } |
| 62 |
| 63 bool isInitialized() { return !m_size; } |
| 64 |
51 private: | 65 private: |
52 Closure m_closure; | 66 T* m_values; |
| 67 size_t m_size; |
53 }; | 68 }; |
54 | 69 |
55 } // namespace WebCore | 70 } // namespace WTF |
56 | 71 |
57 #endif // Task_h | 72 using WTF::LiteralSet; |
| 73 |
| 74 #endif |
OLD | NEW |