| [0b990d] | 1 | // | 
|---|
|  | 2 | // find.h | 
|---|
|  | 3 | // | 
|---|
|  | 4 | // Copyright (C) 1996 Limit Point Systems, Inc. | 
|---|
|  | 5 | // | 
|---|
|  | 6 | // Author: Curtis Janssen <cljanss@limitpt.com> | 
|---|
|  | 7 | // Maintainer: LPS | 
|---|
|  | 8 | // | 
|---|
|  | 9 | // This file is part of the SC Toolkit. | 
|---|
|  | 10 | // | 
|---|
|  | 11 | // The SC Toolkit is free software; you can redistribute it and/or modify | 
|---|
|  | 12 | // it under the terms of the GNU Library General Public License as published by | 
|---|
|  | 13 | // the Free Software Foundation; either version 2, or (at your option) | 
|---|
|  | 14 | // any later version. | 
|---|
|  | 15 | // | 
|---|
|  | 16 | // The SC Toolkit is distributed in the hope that it will be useful, | 
|---|
|  | 17 | // but WITHOUT ANY WARRANTY; without even the implied warranty of | 
|---|
|  | 18 | // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the | 
|---|
|  | 19 | // GNU Library General Public License for more details. | 
|---|
|  | 20 | // | 
|---|
|  | 21 | // You should have received a copy of the GNU Library General Public License | 
|---|
|  | 22 | // along with the SC Toolkit; see the file COPYING.LIB.  If not, write to | 
|---|
|  | 23 | // the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. | 
|---|
|  | 24 | // | 
|---|
|  | 25 | // The U.S. Government is granted a limited license as per AL 91-7. | 
|---|
|  | 26 | // | 
|---|
|  | 27 |  | 
|---|
|  | 28 | #ifndef _util_render_find_h | 
|---|
|  | 29 | #define _util_render_find_h | 
|---|
|  | 30 |  | 
|---|
|  | 31 | #include <util/render/stack.h> | 
|---|
|  | 32 | #include <util/render/parameter.h> | 
|---|
|  | 33 |  | 
|---|
|  | 34 | namespace sc { | 
|---|
|  | 35 |  | 
|---|
|  | 36 | // cannot be used with g++ 2.6-94q4 and has other bugs anyway | 
|---|
|  | 37 | #if 0 | 
|---|
|  | 38 | template <class T1, class T2> | 
|---|
|  | 39 | void | 
|---|
|  | 40 | find_parameter_in_stack(Stack<T1>& stack, | 
|---|
|  | 41 | Parameter<T2>& (T1::*access)(), | 
|---|
|  | 42 | T2& result | 
|---|
|  | 43 | ) | 
|---|
|  | 44 | { | 
|---|
|  | 45 | int have_result = 0; | 
|---|
|  | 46 | for (int i=stack.n()-1; i>=0; i--) { | 
|---|
|  | 47 | if ((stack[i]->*access)().is_set()) { | 
|---|
|  | 48 | if (!have_result || (stack[i]->*access)().overrides()) { | 
|---|
|  | 49 | result = (stack[i]->*access)().value(); | 
|---|
|  | 50 | have_result = 1; | 
|---|
|  | 51 | } | 
|---|
|  | 52 | } | 
|---|
|  | 53 | } | 
|---|
|  | 54 | } | 
|---|
|  | 55 | #endif | 
|---|
|  | 56 |  | 
|---|
|  | 57 | inline void | 
|---|
|  | 58 | find_int_parameter_in_appearance_stack(Stack<Ref<Appearance> >& stack, | 
|---|
|  | 59 | Parameter<int>& (Appearance::*access)(), | 
|---|
|  | 60 | int& result | 
|---|
|  | 61 | ) | 
|---|
|  | 62 | { | 
|---|
|  | 63 | int have_result = 0; | 
|---|
|  | 64 | for (int i=stack.n()-1; i>=0; i--) { | 
|---|
|  | 65 | if ((stack[i].pointer()->*access)().is_set()) { | 
|---|
|  | 66 | if (!have_result || (stack[i].pointer()->*access)().overrides()) { | 
|---|
|  | 67 | result = (stack[i].pointer()->*access)().value(); | 
|---|
|  | 68 | have_result = 1; | 
|---|
|  | 69 | } | 
|---|
|  | 70 | } | 
|---|
|  | 71 | } | 
|---|
|  | 72 | } | 
|---|
|  | 73 |  | 
|---|
|  | 74 | } | 
|---|
|  | 75 |  | 
|---|
|  | 76 | #endif | 
|---|
|  | 77 |  | 
|---|
|  | 78 | // Local Variables: | 
|---|
|  | 79 | // mode: c++ | 
|---|
|  | 80 | // c-file-style: "CLJ" | 
|---|
|  | 81 | // End: | 
|---|