A demo of Dictionary or hash table made with a array bidimensional(Rosetta Code)

[TempodiBasic]

@bplus
Cool! Now you have done a complete basic dictionary data  (associated arrays or arrays of couple of value (a key of order not numeric + a value or sequence values)

and with the AddAppendDictionary you have covered the Achille's ankle of AddModDictionary!.

Good gimme just some time and I'll complete the Dictionary engine using bidimensional array and that other with string .
For now You can publish on RosettaCode website.

[bplus]

I have come to realize that Dictionary allowing multiple values (or no values) for a Key's Value is a way to get an array of arrays functionality, as AStrings (Array-Strings) of course.

So next comes Saving and Loading Dictionary's to/from file and converting them for use in a Type String.

For now You can publish on RosettaCode website.

Perhaps after more critical review from experts. I was excited about posting something for Knapsack problem in JB then learned I missed an important aspect of problem even if I got the sample task correct. And after getting Word Search posted Richard Frost showed way to a stronger code method. The more brains involved the better.

[Aurel]

well
first of all hash table or dictionary or map is not exactly same as associative array
of course hash table can be used as token list with token values ...ordinary as interger types like
key (print) , value(10)
hash or hashed means using prime number as hashing method but not nesesery.
lookup() function can be used here of course...

[TempodiBasic]

Hi
I have followed the definition on the Rosetta Code website but the definition on wikipedia seems very close
https://en.wikipedia.org/wiki/Associative_array#:~:text=In%20computer%20science%2C%20an%20associative,most%20once%20in%20the%20collection.

In computer science, an associative array, map, symbol table, or dictionary is an abstract data type composed of a collection of (key, value) pairs, such that each possible key appears at most once in the collection.

After a complete dictionary engine in QB64 it will be fine to have some demonstrations in different fields of application of associative arrays.

what do you think about?

[bplus]

I'm thinking of doing oh with dictionaries to track variables in actual Subs and / or Functions along with Main module.

[Aurel]

That is good thinking Mark..
i tried to make interpreter using hash table in past ...well  but i don't get any real boost
with that ..only more options

ps ..and please don't use too much ReDim -s that eat execution time .
(ps... ps ...but maybe i am in wrong )

[TempodiBasic]

@bplus
do you think that your engine for dictionary data type is completed and your code is ready to be published on Rosetta Code? Or do you need more time to  think about this task?

[bplus]

@bplus
do you think that your engine for dictionary data type is completed and your code is ready to be published on Rosetta Code? Or do you need more time to  think about this task?

I think I did all I would want from a Dictionary Library. Dang haven't got around to trying with the oh Interpreter yet.
Really it's when you go to apply something you learn what's needed!

If anyone sees something needed for complete set of functions I will be glad to try more.

[TempodiBasic]

Hi Bplus
here I post my version of Associates Arrays  using an array bidimensional of strings  to create a dictionary of couple Key-value
The dictionary engine has its basic functions: PutDict add a couple key-value to the dictionary, GetDict returns the value of a key, ChangeValueDict  changes  the value of key, ChangeKeyValueDict  change a key of dictionary,  EraseKeyDict  cancels a couple key-value from dictionary,  FindDuplicateKey finds if a key is still in dictionary, CompactDict moves all couples key-values to the bottom of dictionary, ShowDict shows the whole or a part of the dictionary.

Code: QB64: [Select]

1. Option _Explicit
2. Const False = 0, True = Not False, sValue = 2, sKey = 1
3.  
4. Dim Mydict(1 To 10, 1 To 2) As String
5.  
6. ' start of demo
7.  
8. If PutDict(Mydict(), "b", "battle") = True Then Print " Inserted couple key value"
9. If PutDict(Mydict(), "c", "cheesebattle") = True Then Print " Inserted couple key value"
10. If PutDict(Mydict(), "a", "ancient") = True Then Print " Inserted couple key value"
11. If PutDict(Mydict(), "d", "domus") = True Then Print " Inserted couple key value"
12. If PutDict(Mydict(), "e", "embarassing") = True Then Print " Inserted couple key value"
13. If PutDict(Mydict(), "e", "entering") = False Then Print " Key already in use"
14. ShowDict Mydict(), 2, 5
15. _Delay 3
16. Print " we search the key a and e"
17. If GetDict(Mydict(), "b") <> "" Then Print GetDict(Mydict(), "b")
18. If GetDict(Mydict(), "e") <> "" Then Print GetDict(Mydict(), "e")
19. _Delay 2
20. Print " we change key b and e"
21. If ChangeValueDict(Mydict(), "b", "BASIC") Then Print "changement done"
22. If ChangeValueDict(Mydict(), "e", "Elephant") Then Print "changement done"
23. If GetDict(Mydict(), "e") <> "" Then Print GetDict(Mydict(), "e")
24. If GetDict(Mydict(), "b") <> "" Then Print GetDict(Mydict(), "b")
25. Print PutDict(Mydict(), "q", "proof tool")
26. Print PutDict(Mydict(), "y", "Yes/No")
27. _Delay 2
28. ShowDict Mydict(), 0, 0
29. Print " we erase key e"
30. If EraseKeyDict(Mydict(), "e") = True Then Print "key passed erased"
31. If GetDict(Mydict(), "e") <> "" Then Print GetDict(Mydict(), "e") Else Print "key passed not foud"
32. _Delay 2
33. ShowDict Mydict(), 0, 0
34. CompactDict Mydict()
35. Print "Dictionary compacted"
36. ShowDict Mydict(), 1, 0
37. ' end of demo
38. End
39.  
40. ' it puts a couple key-value at the first free space in the array
41. Function PutDict (dict() As String, Keys As String, Value As String)
42.     PutDict = False
43.     Dim Count As Integer
44.     If FindDuplicateKey(dict(), Keys) = True Then Exit Function
45.     For Count = 1 To UBound(dict, sKey)
46.         If dict(Count, sKey) = "" Then Exit For
47.     Next
48.     dict(Count, sKey) = Keys
49.     dict(Count, sValue) = Value
50.     PutDict = True
51. End Function
52.  
53. 'it returns the value present at key passed
54. Function GetDict$ (dict() As String, Keys As String)
55.     GetDict$ = ""
56.     Dim Count As Integer
57.     For Count = 1 To UBound(dict, sKey)
58.         If dict(Count, sKey) = Keys Then
59.             GetDict$ = dict(Count, sValue)
60.             Exit For
61.         End If
62.     Next
63. End Function
64.  
65. ' it changes the value related to a key passed
66. Function ChangeValueDict (dict() As String, Keys As String, Value As String)
67.     ChangeValueDict = False
68.     Dim Count As Integer
69.     For Count = 1 To UBound(dict, sKey)
70.         If dict(Count, sKey) = Keys Then
71.             dict(Count, sValue) = Value
72.             Exit For
73.         End If
74.     Next
75.     ChangeValueDict = True
76.     If dict(Count, sValue) <> Value Then ChangeValueDict = False
77. End Function
78.  
79. 'it changes a key to another
80. Function ChangeKeyValueDict (dict() As String, Keys As String, newKey As String)
81.     ChangeKeyValueDict = False
82.     Dim Count As Integer
83.     'if there isn't keys  or if there is yet newKey , it exits
84.     If FindDuplicateKey(dict(), newKey) = True Or FindDuplicateKey(dict(), Keys) = False Then Exit Function
85.     For Count = 1 To UBound(dict, sKey)
86.         If dict(Count, sKey) = Keys Then
87.             dict(Count, sKey) = newKey
88.             Exit For
89.         End If
90.     Next
91.     ChangeKeyValueDict = True
92.     If dict(Count, sKey) <> newKey Then ChangeKeyValueDict = False
93. End Function
94.  
95. 'it erases a couple with key Keys
96. Function EraseKeyDict (dict() As String, Keys As String)
97.     EraseKeyDict = False
98.     Dim Count As Integer
99.     For Count = 1 To UBound(dict, sKey)
100.         If dict(Count, sKey) = Keys Then
101.             dict(Count, sValue) = ""
102.             dict(Count, sKey) = ""
103.             Exit For
104.         End If
105.     Next
106.     EraseKeyDict = True
107.     If (dict(Count, sKey) <> "") Or (dict(Count, sValue) <> "") Then EraseKeyDict = False
108. End Function
109.  
110. 'it shows dict from start to the end or the full dict
111. Sub ShowDict (dict() As String, Start As Integer, Ends As Integer)
112.     Dim Count As Integer
113.     If Start = 0 Or Start > Ends Or Start > UBound(dict, sKey) Then Start = 1
114.     If Ends < Start Or Ends = 0 Or Ends > UBound(dict, sKey) Then Ends = UBound(dict, sKey)
115.     For Count = Start To Ends
116.         Print dict(Count, sKey); " - "; dict(Count, sValue)
117.     Next
118. End Sub
119.  
120. ' it finds a key if it is yet in the dict() array
121. Function FindDuplicateKey (dict() As String, keys As String)
122.     Dim Count As Integer
123.     ' it searches a duplicate if it finds exit function
124.     For Count = 1 To UBound(dict, sKey)
125.         If dict(Count, sKey) = keys Then
126.             FindDuplicateKey = True
127.             Exit Function
128.         End If
129.     Next
130. End Function
131.  
132. 'it shrinks the dict  moving all keys to the bottom of array
133. Sub CompactDict (dict() As String)
134.     Dim count As Integer, count2 As Integer
135.     For count = 1 To UBound(dict, sKey) - 1
136.         If dict(count, sKey) = "" Then
137.             For count2 = count + 1 To UBound(dict, sKey)
138.                 If dict(count2, sKey) <> "" Then Exit For
139.             Next
140.             If count2 <= UBound(dict, sKey) Then Swap dict(count, sKey), dict(count2, sKey): Swap dict(count, sValue), dict(count2, sValue)
141.         End If
142.     Next
143. End Sub

about the UDT version I seem to understand that it is ready to be published.
Good!