initial
[prop.git] / include / AD / rete / betamem.h
blob7da7a92452f213354df23868604c2642c581934a
1 //////////////////////////////////////////////////////////////////////////////
2 // NOTICE:
3 //
4 // ADLib, Prop and their related set of tools and documentation are in the
5 // public domain. The author(s) of this software reserve no copyrights on
6 // the source code and any code generated using the tools. You are encouraged
7 // to use ADLib and Prop to develop software, in both academic and commercial
8 // settings, and are welcomed to incorporate any part of ADLib and Prop into
9 // your programs.
11 // Although you are under no obligation to do so, we strongly recommend that
12 // you give away all software developed using our tools.
14 // We also ask that credit be given to us when ADLib and/or Prop are used in
15 // your programs, and that this notice be preserved intact in all the source
16 // code.
18 // This software is still under development and we welcome(read crave for)
19 // any suggestions and help from the users.
21 // Allen Leung
22 // 1994
23 //////////////////////////////////////////////////////////////////////////////
25 #ifndef beta_memory_h
26 #define beta_memory_h
28 #include <AD/rete/token.h> // network tokens
30 class BetaMem {
32 int count; // number of tokens in the list.
33 int capacity; // number of tokens that we can hold.
34 Fact *** tokens; // list of tokens.
35 int * matches; // negated matches.
37 public:
39 ///////////////////////////////////////////////////////////////////////////
40 // Conversion.
41 ///////////////////////////////////////////////////////////////////////////
43 ///////////////////////////////////////////////////////////////////////////
44 // Selectors
45 ///////////////////////////////////////////////////////////////////////////
46 inline int size() const { return count; }
47 inline Fact ** operator [] (int i) const { return tokens[i]; }
48 inline Bool inc_neg(int i) const { return matches[i]++ == 0; }
49 inline Bool dec_neg(int i) const { return --matches[i] == 0; }
53 #endif