Difference between revisions of "Sorted Dictionary Assignment"

From CSE425S Wiki
Jump to navigation Jump to search
 
(29 intermediate revisions by the same user not shown)
Line 1: Line 1:
−
=Background=
 
−
{{:Dictionary_Assignment}}
 
 
=Code To Use=
 
=Code To Use=
−
[[Binary_Tree_Assignment|Binary Tree Studio]]
+
==Binary Search Tree==
 +
You will undoubtedly want to use the tree you implemented in the [[Binary_Tree_Assignment|Binary Search Tree]] assignment.
 +
==DictionaryFn==
 +
The structure SortedDictionary has been setup to re-use [[Chained_Dictionary_Assignment#functor_DictionaryFn|functor DictionaryFn]] from the [[Chained_Dictionary_Assignment|Chained Dictionary]] exercise.
  
−
You will undoubtedly want to use the tree you implemented in the [[Binary_Tree_Assignment|Binary Search Tree Studio]].
+
=Code To Implement=
 +
==structure SortedDictionary==
 +
SortedDictionary must:
  
−
We recall that BinarySearchTree.tree has two generic types <code>'a</code> and <code>'k</code>.
+
* have O(lg N) expected performance for <code>get</code>, <code>put</code>, and <code>remove</code>.
 +
* produce <code>entries</code> and <code>keys</code> in sorted order based on the provided <code>compare_function</code>.
 +
* produce <code>values</code> in the sorted order of each value's key based on the provided <code>compare_function</code>.
  
−
<nowiki>type ('a,'k) tree</nowiki>
+
<syntaxhighlight lang="sml">
 +
structure SortedDictionary = DictionaryFn(struct
 +
    type ''k compare_function = (''k*''k) -> order
  
−
<code>'a</code> represents the type of the contents of each node.  <code>'k</code> represents the type of the key for each node.
+
   
 +
    (* TODO: replace unit with the type you decide upon *)
 +
    type (''k,'v) dictionary = unit
 +
   
  
−
To implement a <nowiki>(''k,'v) SortedDictionary.dictionary</nowiki> with a BinarySearchTree.tree, what is the type of the contents at each node?
+
    type ''k create_parameter_type = ''k compare_function
  
−
What is the type of the key for your BinarySearchTree.tree?
+
    fun create(cmp : ''k compare_function) : (''k,'v) dictionary =
 +
        raise Fail "NotYetImplemented"
  
−
The answers to these questions will be instrumental in defining your type in the SortedDictionary structure:
+
    fun get(dict : (''k,'v) dictionary, key:''k) : 'v option =
 +
        raise Fail "NotYetImplemented"
  
−
<nowiki>(* TODO: replace unit with the type you decide upon *)
+
    fun put(dict : (''k,'v) dictionary, key:''k, value:'v) : (''k,'v) dictionary * 'v option =
−
type (''k,'v) dictionary = unit</nowiki>
+
        raise Fail "NotYetImplemented"
  
−
=Code To Implement=
+
    fun remove(dict : (''k,'v) dictionary, key : ''k) : (''k,'v) dictionary * 'v option =
−
==Sorted Implementation==
+
        raise Fail "NotYetImplemented"
−
You will undoubtedly want to use your [[Binary_Search_Tree_Assignment|BinarySearchTree]] for your SortedDictionary.
+
 
 +
    fun entries(dict : (''k,'v) dictionary) : (''k*'v) list =
 +
        raise Fail "NotYetImplemented"
 +
 
 +
end)
 +
</syntaxhighlight>
 +
 
 +
[[File:Sorted dictionary.svg]]
 +
 
 +
===type dictionary===
 +
Change the definition of <nowiki>type (''k,'v) dictionary</nowiki> to support SortedDictionary.
 +
 
 +
<syntaxhighlight lang="sml">
 +
(* TODO: replace unit with the type you decide upon *)
 +
type (''k,'v) dictionary = unit
 +
</syntaxhighlight>
 +
 
 +
===type create_parameter_type===
 +
Leave create_parameter_type unchanged.  SortedDictionary's create method accepts a single compare_function parameter, so <nowiki>''k compare_function</nowiki> is the correct type.
 +
 
 +
<syntaxhighlight lang="sml">
 +
type ''k create_parameter_type = ''k compare_function
 +
</syntaxhighlight>
 +
 
 +
=== create ===
 +
<syntaxhighlight lang="sml">
 +
fun create(cmp : ''k compare_function) : (''k,'v) dictionary =
 +
raise Fail "NotYetImplemented"
 +
</syntaxhighlight>
 +
 
 +
=== get ===
 +
<syntaxhighlight lang="sml">
 +
fun get(dict : (''k,'v) dictionary, key : ''k) : 'v option =
 +
raise Fail "NotYetImplemented"
 +
</syntaxhighlight>
 +
 
 +
A function from [[Binary_Search_Tree_Assignment#Code_to_Implement|BinarySearchTree]] should be useful here.
 +
 
 +
=== put ===
 +
<syntaxhighlight lang="sml">
 +
fun put(dict : (''k,'v) dictionary, key : ''k , value : 'v) : (''k,'v) dictionary * 'v option =
 +
raise Fail "NotYetImplemented"
 +
</syntaxhighlight>
 +
 
 +
A function from [[Binary_Search_Tree_Assignment#Code_to_Implement|BinarySearchTree]] should be useful here.
 +
 
 +
=== remove ===
 +
<syntaxhighlight lang="sml">
 +
fun remove(dict : (''k,'v) dictionary, key : ''k) : (''k,'v) dictionary * 'v option =
 +
        raise Fail "NotYetImplemented"
 +
</syntaxhighlight>
 +
 
 +
A function from [[Binary_Search_Tree_Assignment#Code_to_Implement|BinarySearchTree]] should be useful here.
 +
 
 +
=== entries ===
 +
<syntaxhighlight lang="sml">
 +
fun entries(dict : (''k,'v) dictionary) : (''k*'v) list =
 +
raise Fail "NotYetImplemented"
 +
</syntaxhighlight>
  
−
<nowiki>signature SORTED_DICTIONARY = sig include DICTIONARY
+
A function from [[Binary_Search_Tree_Assignment#Code_to_Implement|BinarySearchTree]] should be useful here.
−
  type ''k compare_function = (''k*''k) -> order
 
−
  val create_sorted : ''k compare_function -> (''k,'v) dictionary
 
−
end</nowiki>
 
  
 
=Testing=
 
=Testing=
−
<!--{{SMLUnitTest|sorted_dictionary|dictionary}}-->
+
==Complete==
−
file: <code>sml run_unit_test_sorted_dictionary.sml</code>
+
{{SMLUnitTesting|run_sorted_testing|dictionary/sorted}}
 +
==Without Remove==
 +
sml -Ccm.verbose=false run_sorted_testing.sml --remove=false
  
−
in folder: <code>src/test/sml/dictionary/sorted</code>
+
sml run_sorted_testing.sml --remove=false
  
 
=Pledge, Acknowledgments, Citations=
 
=Pledge, Acknowledgments, Citations=
 
{{Pledge|studio-sorted-dictionary}}
 
{{Pledge|studio-sorted-dictionary}}

Latest revision as of 19:39, 14 July 2023

Code To Use

Binary Search Tree

You will undoubtedly want to use the tree you implemented in the Binary Search Tree assignment.

DictionaryFn

The structure SortedDictionary has been setup to re-use functor DictionaryFn from the Chained Dictionary exercise.

Code To Implement

structure SortedDictionary

SortedDictionary must:

  • have O(lg N) expected performance for get, put, and remove.
  • produce entries and keys in sorted order based on the provided compare_function.
  • produce values in the sorted order of each value's key based on the provided compare_function.
structure SortedDictionary = DictionaryFn(struct
    type ''k compare_function = (''k*''k) -> order

    
    (* TODO: replace unit with the type you decide upon *)
    type (''k,'v) dictionary = unit
    

    type ''k create_parameter_type = ''k compare_function

    fun create(cmp : ''k compare_function) : (''k,'v) dictionary = 
        raise Fail "NotYetImplemented"

    fun get(dict : (''k,'v) dictionary, key:''k) : 'v option =
        raise Fail "NotYetImplemented"

    fun put(dict : (''k,'v) dictionary, key:''k, value:'v) : (''k,'v) dictionary * 'v option =
        raise Fail "NotYetImplemented"

    fun remove(dict : (''k,'v) dictionary, key : ''k) : (''k,'v) dictionary * 'v option =
        raise Fail "NotYetImplemented"

    fun entries(dict : (''k,'v) dictionary) : (''k*'v) list =
        raise Fail "NotYetImplemented"

end)

Sorted dictionary.svg

type dictionary

Change the definition of type (''k,'v) dictionary to support SortedDictionary. 

(* TODO: replace unit with the type you decide upon *)
type (''k,'v) dictionary = unit

type create_parameter_type

Leave create_parameter_type unchanged. SortedDictionary's create method accepts a single compare_function parameter, so ''k compare_function is the correct type. 

type ''k create_parameter_type = ''k compare_function

create

fun create(cmp : ''k compare_function) : (''k,'v) dictionary = 
	raise Fail "NotYetImplemented"

get

fun get(dict : (''k,'v) dictionary, key : ''k) : 'v option = 
	raise Fail "NotYetImplemented"

A function from BinarySearchTree should be useful here.

put

fun put(dict : (''k,'v) dictionary, key : ''k , value : 'v) : (''k,'v) dictionary * 'v option =
	raise Fail "NotYetImplemented"

A function from BinarySearchTree should be useful here.

remove

fun remove(dict : (''k,'v) dictionary, key : ''k) : (''k,'v) dictionary * 'v option =
        raise Fail "NotYetImplemented"

A function from BinarySearchTree should be useful here.

entries

fun entries(dict : (''k,'v) dictionary) : (''k*'v) list =
	raise Fail "NotYetImplemented"

A function from BinarySearchTree should be useful here.

Testing

Complete

source folder: src/test/sml/dictionary/sorted
how to run with CM.make verbosity off: sml -Ccm.verbose=false run_sorted_testing.sml
how to run with CM.make verbosity on: sml run_sorted_testing.sml

note: ensure that you have removed all printing to receive credit for any assignment.

SML Error Messages

Without Remove

sml -Ccm.verbose=false run_sorted_testing.sml --remove=false

sml run_sorted_testing.sml --remove=false

Pledge, Acknowledgments, Citations

file: studio-sorted-dictionary-pledge-acknowledgments-citations.txt

More info about the Honor Pledge

Retrieved from "http://classes.engineering.wustl.edu/cse425s/index.php?title=Sorted_Dictionary_Assignment&oldid=2219"