diff options
author | Jacek Antonelli | 2008-08-15 23:44:46 -0500 |
---|---|---|
committer | Jacek Antonelli | 2008-08-15 23:44:46 -0500 |
commit | 38d6d37f2d982fa959e9e8a4a3f7e1ccfad7b5d4 (patch) | |
tree | adca584755d22ca041a2dbfc35d4eca01f70b32c /linden/indra/llui/llviewquery.h | |
parent | README.txt (diff) | |
download | meta-impy-38d6d37f2d982fa959e9e8a4a3f7e1ccfad7b5d4.zip meta-impy-38d6d37f2d982fa959e9e8a4a3f7e1ccfad7b5d4.tar.gz meta-impy-38d6d37f2d982fa959e9e8a4a3f7e1ccfad7b5d4.tar.bz2 meta-impy-38d6d37f2d982fa959e9e8a4a3f7e1ccfad7b5d4.tar.xz |
Second Life viewer sources 1.13.2.12
Diffstat (limited to '')
-rw-r--r-- | linden/indra/llui/llviewquery.h | 108 |
1 files changed, 108 insertions, 0 deletions
diff --git a/linden/indra/llui/llviewquery.h b/linden/indra/llui/llviewquery.h new file mode 100644 index 0000000..3dc2861 --- /dev/null +++ b/linden/indra/llui/llviewquery.h | |||
@@ -0,0 +1,108 @@ | |||
1 | /** | ||
2 | * @file llviewquery.h | ||
3 | * @brief Query algorithm for flattening and filtering the view hierarchy. | ||
4 | * | ||
5 | * Copyright (c) 2001-2007, Linden Research, Inc. | ||
6 | * | ||
7 | * The source code in this file ("Source Code") is provided by Linden Lab | ||
8 | * to you under the terms of the GNU General Public License, version 2.0 | ||
9 | * ("GPL"), unless you have obtained a separate licensing agreement | ||
10 | * ("Other License"), formally executed by you and Linden Lab. Terms of | ||
11 | * the GPL can be found in doc/GPL-license.txt in this distribution, or | ||
12 | * online at http://secondlife.com/developers/opensource/gplv2 | ||
13 | * | ||
14 | * There are special exceptions to the terms and conditions of the GPL as | ||
15 | * it is applied to this Source Code. View the full text of the exception | ||
16 | * in the file doc/FLOSS-exception.txt in this software distribution, or | ||
17 | * online at http://secondlife.com/developers/opensource/flossexception | ||
18 | * | ||
19 | * By copying, modifying or distributing this software, you acknowledge | ||
20 | * that you have read and understood your obligations described above, | ||
21 | * and agree to abide by those obligations. | ||
22 | * | ||
23 | * ALL LINDEN LAB SOURCE CODE IS PROVIDED "AS IS." LINDEN LAB MAKES NO | ||
24 | * WARRANTIES, EXPRESS, IMPLIED OR OTHERWISE, REGARDING ITS ACCURACY, | ||
25 | * COMPLETENESS OR PERFORMANCE. | ||
26 | */ | ||
27 | |||
28 | #ifndef LL_LLVIEWQUERY_H | ||
29 | #define LL_LLVIEWQUERY_H | ||
30 | |||
31 | #include <list> | ||
32 | |||
33 | #include "llmemory.h" | ||
34 | |||
35 | class LLView; | ||
36 | |||
37 | typedef std::list<LLView *> viewList_t; | ||
38 | typedef std::pair<BOOL, BOOL> filterResult_t; | ||
39 | |||
40 | // Abstract base class for all filters. | ||
41 | class LLQueryFilter : public LLRefCount | ||
42 | { | ||
43 | public: | ||
44 | virtual filterResult_t operator() (const LLView* const view, const viewList_t & children) const =0; | ||
45 | }; | ||
46 | |||
47 | class LLQuerySorter : public LLRefCount | ||
48 | { | ||
49 | public: | ||
50 | virtual void operator() (LLView * parent, viewList_t &children) const; | ||
51 | }; | ||
52 | |||
53 | class LLNoLeavesFilter : public LLQueryFilter, public LLSingleton<LLNoLeavesFilter> | ||
54 | { | ||
55 | /*virtual*/ filterResult_t operator() (const LLView* const view, const viewList_t & children) const; | ||
56 | }; | ||
57 | class LLVisibleFilter : public LLQueryFilter, public LLSingleton<LLVisibleFilter> | ||
58 | { | ||
59 | /*virtual*/ filterResult_t operator() (const LLView* const view, const viewList_t & children) const; | ||
60 | }; | ||
61 | class LLEnabledFilter : public LLQueryFilter, public LLSingleton<LLEnabledFilter> | ||
62 | { | ||
63 | /*virtual*/ filterResult_t operator() (const LLView* const view, const viewList_t & children) const; | ||
64 | }; | ||
65 | class LLTabStopFilter : public LLQueryFilter, public LLSingleton<LLTabStopFilter> | ||
66 | { | ||
67 | /*virtual*/ filterResult_t operator() (const LLView* const view, const viewList_t & children) const; | ||
68 | }; | ||
69 | |||
70 | // Algorithm for flattening | ||
71 | class LLViewQuery | ||
72 | { | ||
73 | public: | ||
74 | typedef std::list<const LLQueryFilter*> filterList_t; | ||
75 | typedef filterList_t::iterator filterList_iter_t; | ||
76 | typedef filterList_t::const_iterator filterList_const_iter_t; | ||
77 | |||
78 | LLViewQuery(); | ||
79 | virtual ~LLViewQuery() {} | ||
80 | |||
81 | void addPreFilter(const LLQueryFilter* prefilter); | ||
82 | void addPostFilter(const LLQueryFilter* postfilter); | ||
83 | const filterList_t & getPreFilters() const; | ||
84 | const filterList_t & getPostFilters() const; | ||
85 | |||
86 | void setSorter(const LLQuerySorter* sorter); | ||
87 | const LLQuerySorter* getSorter() const; | ||
88 | |||
89 | viewList_t run(LLView * view) const; | ||
90 | // syntactic sugar | ||
91 | viewList_t operator () (LLView * view) const { return run(view); } | ||
92 | protected: | ||
93 | // override this method to provide iteration over other types of children | ||
94 | virtual void filterChildren(LLView * view, viewList_t & filtered_children) const; | ||
95 | filterResult_t runFilters(LLView * view, const viewList_t children, const filterList_t filters) const; | ||
96 | protected: | ||
97 | filterList_t mPreFilters; | ||
98 | filterList_t mPostFilters; | ||
99 | const LLQuerySorter* mSorterp; | ||
100 | }; | ||
101 | |||
102 | class LLCtrlQuery : public LLViewQuery | ||
103 | { | ||
104 | public: | ||
105 | LLCtrlQuery(); | ||
106 | }; | ||
107 | |||
108 | #endif | ||