Natools

Check-in [4aa72a0c16]
Login
Overview
Comment:smaz_tools: add a Dummy_Hash function for dictionary-specific tools
Timelines: family | ancestors | descendants | both | trunk
Files: files | file ages | folders
SHA1: 4aa72a0c16247eb04de5e602477289c4fadb3eff
User & Date: nat on 2016-11-24 21:01:05
Other Links: manifest | tags
Context
2016-11-25
22:59
smaz_generic-tools: new package for dictionary-dependent tools check-in: f85a938c62 user: nat tags: trunk
2016-11-24
21:01
smaz_tools: add a Dummy_Hash function for dictionary-specific tools check-in: 4aa72a0c16 user: nat tags: trunk
2016-11-23
21:10
smaz_tools: add a dictionary-independent version of the dynamic hashes check-in: 24c6ae742e user: nat tags: trunk
Changes

Modified src/natools-smaz_tools.adb from [efadc5244f] to [681b96d15c].

103
104
105
106
107
108
109








110
111
112
113
114
115
116
            end if;
         end if;
      end loop;

      return Result;
   end Build_Node;










   procedure Set_Map
     (Map : in out Dictionary_Maps.Map;
      List : in String_Lists.List)
   is
      I : Natural := 0;
   begin







>
>
>
>
>
>
>
>







103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
            end if;
         end if;
      end loop;

      return Result;
   end Build_Node;


   function Dummy_Hash (Value : String) return Natural is
      pragma Unreferenced (Value);
   begin
      raise Program_Error with "Dummy_Hash called";
      return 0;
   end Dummy_Hash;


   procedure Set_Map
     (Map : in out Dictionary_Maps.Map;
      List : in String_Lists.List)
   is
      I : Natural := 0;
   begin

Modified src/natools-smaz_tools.ads from [a9993adcc9] to [1553a02b12].

57
58
59
60
61
62
63



64
65
66
67
68
69
70
      --  speed-vs-memory is even more skewed towards speed.

   procedure Set_Dictionary_For_Trie_Search (List : in String_Lists.List);
   function Trie_Search (Value : String) return Natural;
      --  Function and data source for trie-based search that can be
      --  used with Dictionary.Hash.





   type String_Count is range 0 .. 2 ** 31 - 1;
      --  Type for a number of substring occurrences

   package Methods is
      type Enum is (Encoded, Frequency, Gain);
   end Methods;







>
>
>







57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
      --  speed-vs-memory is even more skewed towards speed.

   procedure Set_Dictionary_For_Trie_Search (List : in String_Lists.List);
   function Trie_Search (Value : String) return Natural;
      --  Function and data source for trie-based search that can be
      --  used with Dictionary.Hash.

   function Dummy_Hash (Value : String) return Natural;
      --  Placeholder for Hash dictionary member, always raises Program_Error


   type String_Count is range 0 .. 2 ** 31 - 1;
      --  Type for a number of substring occurrences

   package Methods is
      type Enum is (Encoded, Frequency, Gain);
   end Methods;