app/willard/smap.h

   1 ///////////////////////////////////////////////////////////////////////////////
   2 //  This file is generated automatically using Prop (version 2.3.5),
   3 //  last updated on Jun 18, 1997.
   4 //  The original source file is "smap.ph".
   5 ///////////////////////////////////////////////////////////////////////////////
   6
   7 #define PROP_TUPLE2_USED
   8 #include <propdefs.h>
   9 #line 1 "smap.ph"
  10 #ifndef smap_h
  11 #define smap_h
  12
  13 #include <AD/hash/lhash.h>
  14
  15 //
  16 //  Single valued map
  17 //
  18 template <class K, class V>
  19 class SMap : public LHashTable<K, V>
  20 {
  21 };
  22
  23 template <class A, class B>
  24    inline int hash (const
  25 #line 15 "smap.ph"
  26 Tuple2<A, B>
  27 #line 15 "smap.ph"
  28 & x) { return hash(x._1) + hash(x._2); }
  29
  30 template <class A, class B>
  31    inline int equal (const Tuple2<A, B>
  32 #line 18 "smap.ph"
  33 & x, const Tuple2<A, B>
  34 #line 18 "smap.ph"
  35 & y)
  36       { return equal(x._1,y._1) && equal(x._2,y._2); }
  37
  38 #endif
  39 /*
  40 ------------------------------- Statistics -------------------------------
  41 Merge matching rules         = yes
  42 Number of DFA nodes merged   = 0
  43 Number of ifs generated      = 0
  44 Number of switches generated = 0
  45 Number of labels             = 0
  46 Number of gotos              = 0
  47 Adaptive matching            = disabled
  48 Fast string matching         = disabled
  49 Inline downcasts             = disabled
  50 --------------------------------------------------------------------------
  51 */