OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org> | 2 * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org> |
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 | 5 * modification, are permitted provided that the following conditions |
6 * are met: | 6 * are met: |
7 * 1. Redistributions of source code must retain the above copyright | 7 * 1. Redistributions of source code must retain the above copyright |
8 * notice, this list of conditions and the following disclaimer. | 8 * notice, this list of conditions and the following disclaimer. |
9 * 2. Redistributions in binary form must reproduce the above copyright | 9 * 2. Redistributions in binary form must reproduce the above copyright |
10 * notice, this list of conditions and the following disclaimer in the | 10 * notice, this list of conditions and the following disclaimer in the |
(...skipping 63 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
74 | 74 |
75 private: | 75 private: |
76 NodeSet() : m_isSorted(true), m_subtreesAreDisjoint(false) { } | 76 NodeSet() : m_isSorted(true), m_subtreesAreDisjoint(false) { } |
77 void traversalSort() const; | 77 void traversalSort() const; |
78 | 78 |
79 bool m_isSorted; | 79 bool m_isSorted; |
80 bool m_subtreesAreDisjoint; | 80 bool m_subtreesAreDisjoint; |
81 WillBeHeapVector<RefPtrWillBeMember<Node>> m_nodes; | 81 WillBeHeapVector<RefPtrWillBeMember<Node>> m_nodes; |
82 }; | 82 }; |
83 | 83 |
84 } | 84 } // namespace XPath |
85 | 85 |
86 } | 86 } // namespace blink |
87 #endif // XPathNodeSet_h | 87 #endif // XPathNodeSet_h |
OLD | NEW |