Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
U
uva
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Taddeüs Kroes
uva
Commits
d4f3ab1f
Commit
d4f3ab1f
authored
Nov 27, 2011
by
Taddeus Kroes
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
funclang series4: Implemented insert function for ass9.
parent
3143e5aa
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
17 additions
and
10 deletions
+17
-10
funclang-taddeus/series4/ass9.ml
funclang-taddeus/series4/ass9.ml
+17
-10
No files found.
funclang-taddeus/series4/ass9.ml
View file @
d4f3ab1f
...
@@ -9,24 +9,30 @@ let rec starts_with l s =
...
@@ -9,24 +9,30 @@ let rec starts_with l s =
|
h
::
t
->
h
=
(
hd
l
)
&&
starts_with
(
tl
l
)
t
|
h
::
t
->
h
=
(
hd
l
)
&&
starts_with
(
tl
l
)
t
;;
;;
(* Insert a new (key, value) pair into a trie *)
let
rec
insert
trie
key
value
=
let
rec
insert
trie
key
value
=
match
trie
with
match
trie
with
|
Empty
->
Node
(
key
,
value
,
[]
)
(* Root *)
|
Empty
->
Node
(
key
,
value
,
[]
)
(* Root *)
|
Node
(
k
,
v
,
children
)
->
|
Node
(
k
,
v
,
children
)
->
if
starts_with
key
k
then
if
k
=
key
then
(* Check all children for a longer prefix *)
raise
(
Failure
"Inserted key already exists in trie"
)
if
(
length
k
)
=
(
length
key
)
-
1
then
else
if
starts_with
key
k
then
(* Direct child *)
(* Inserted key should be in this node because it starts with
Node
(
k
,
v
,
children
@
[
Node
(
key
,
value
,
[]
)])
* the node's key *)
else
let
matches_key
=
function
(* Add another nde between the matched node and the child,
|
Empty
->
false
* with the length of the matched node plus one *)
|
Node
(
k
,
_
,
c
)
->
starts_with
key
k
Empty
in
(* 'move' are the children that are moved to be the children of the
* inserted node, 'siblings' are the children that remain in the
* current matched node *)
let
move
,
siblings
=
partition
matches_key
children
in
Node
(
k
,
v
,
siblings
@
[
Node
(
key
,
value
,
move
)])
else
else
raise
(
Failure
"Inserted key does not start with node key"
)
raise
(
Failure
"Inserted key does not start with node key"
)
;;
;;
(**)
(*
Look up a value associated with a key
*)
let
rec
lookup
trie
key
=
let
rec
lookup
trie
key
=
match
trie
with
match
trie
with
|
Empty
->
None
(* Trie is empty, so no result *)
|
Empty
->
None
(* Trie is empty, so no result *)
...
@@ -49,6 +55,7 @@ let rec lookup trie key =
...
@@ -49,6 +55,7 @@ let rec lookup trie key =
None
None
;;
;;
(* Find all (key, value) pairs whose key start with a given prefix *)
let
rec
matches
trie
key
=
let
rec
matches
trie
key
=
match
trie
with
match
trie
with
|
Empty
->
[]
|
Empty
->
[]
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment