keyvaluetree 0.0.2
Sign up to get free protection for your applications and to get access to all the features.
- data/.gitignore +17 -0
- data/.idea/encodings.xml +5 -0
- data/.idea/misc.xml +5 -0
- data/.idea/modules.xml +9 -0
- data/.idea/vcs.xml +7 -0
- data/Gemfile +12 -0
- data/LICENSE.txt +22 -0
- data/README.md +29 -0
- data/Rakefile +8 -0
- data/keyvaluetree.gemspec +26 -0
- data/lib/keyvaluetree/hash.rb +76 -0
- data/lib/keyvaluetree/memory_store.rb +32 -0
- data/lib/keyvaluetree/store.rb +23 -0
- data/lib/keyvaluetree/version.rb +3 -0
- data/lib/keyvaluetree.rb +10 -0
- data/test/common.rb +6 -0
- data/test/hash_test.rb +75 -0
- data/test/memory_store_test.rb +38 -0
- metadata +137 -0
data/.gitignore
ADDED
data/.idea/encodings.xml
ADDED
data/.idea/misc.xml
ADDED
data/.idea/modules.xml
ADDED
@@ -0,0 +1,9 @@
|
|
1
|
+
<?xml version="1.0" encoding="UTF-8"?>
|
2
|
+
<project version="4">
|
3
|
+
<component name="ProjectModuleManager">
|
4
|
+
<modules>
|
5
|
+
<module fileurl="file://$PROJECT_DIR$/.idea/KeyValueTree.iml" filepath="$PROJECT_DIR$/.idea/KeyValueTree.iml" />
|
6
|
+
</modules>
|
7
|
+
</component>
|
8
|
+
</project>
|
9
|
+
|
data/.idea/vcs.xml
ADDED
data/Gemfile
ADDED
@@ -0,0 +1,12 @@
|
|
1
|
+
source 'https://rubygems.org'
|
2
|
+
|
3
|
+
# Specify your gem's dependencies in keyvaluetree.gemspec
|
4
|
+
gemspec
|
5
|
+
|
6
|
+
group :test do
|
7
|
+
if RUBY_PLATFORM =~ /(win32|w32)/
|
8
|
+
gem "win32console", '1.3.0'
|
9
|
+
end
|
10
|
+
gem "minitest"
|
11
|
+
gem "minitest-reporters", '>= 0.5.0'
|
12
|
+
end
|
data/LICENSE.txt
ADDED
@@ -0,0 +1,22 @@
|
|
1
|
+
Copyright (c) 2013 Udo Schneider
|
2
|
+
|
3
|
+
MIT License
|
4
|
+
|
5
|
+
Permission is hereby granted, free of charge, to any person obtaining
|
6
|
+
a copy of this software and associated documentation files (the
|
7
|
+
"Software"), to deal in the Software without restriction, including
|
8
|
+
without limitation the rights to use, copy, modify, merge, publish,
|
9
|
+
distribute, sublicense, and/or sell copies of the Software, and to
|
10
|
+
permit persons to whom the Software is furnished to do so, subject to
|
11
|
+
the following conditions:
|
12
|
+
|
13
|
+
The above copyright notice and this permission notice shall be
|
14
|
+
included in all copies or substantial portions of the Software.
|
15
|
+
|
16
|
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
17
|
+
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
18
|
+
MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
19
|
+
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
|
20
|
+
LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
|
21
|
+
OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
|
22
|
+
WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
data/README.md
ADDED
@@ -0,0 +1,29 @@
|
|
1
|
+
# Keyvaluetree
|
2
|
+
|
3
|
+
TODO: Write a gem description
|
4
|
+
|
5
|
+
## Installation
|
6
|
+
|
7
|
+
Add this line to your application's Gemfile:
|
8
|
+
|
9
|
+
gem 'keyvaluetree'
|
10
|
+
|
11
|
+
And then execute:
|
12
|
+
|
13
|
+
$ bundle
|
14
|
+
|
15
|
+
Or install it yourself as:
|
16
|
+
|
17
|
+
$ gem install keyvaluetree
|
18
|
+
|
19
|
+
## Usage
|
20
|
+
|
21
|
+
TODO: Write usage instructions here
|
22
|
+
|
23
|
+
## Contributing
|
24
|
+
|
25
|
+
1. Fork it
|
26
|
+
2. Create your feature branch (`git checkout -b my-new-feature`)
|
27
|
+
3. Commit your changes (`git commit -am 'Add some feature'`)
|
28
|
+
4. Push to the branch (`git push origin my-new-feature`)
|
29
|
+
5. Create new Pull Request
|
data/Rakefile
ADDED
@@ -0,0 +1,26 @@
|
|
1
|
+
# coding: utf-8
|
2
|
+
lib = File.expand_path('../lib', __FILE__)
|
3
|
+
$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
|
4
|
+
require 'keyvaluetree/version'
|
5
|
+
|
6
|
+
Gem::Specification.new do |spec|
|
7
|
+
spec.name = "keyvaluetree"
|
8
|
+
spec.version = KeyValueTree::VERSION
|
9
|
+
spec.authors = ["Udo Schneider"]
|
10
|
+
spec.email = ["Udo.Schneider@homeaddress.de"]
|
11
|
+
spec.description = %q{Storing hierarchical data in plain KeyValueStores}
|
12
|
+
spec.summary = spec.description
|
13
|
+
spec.homepage = ""
|
14
|
+
spec.license = "MIT"
|
15
|
+
|
16
|
+
spec.files = `git ls-files`.split($/)
|
17
|
+
spec.executables = spec.files.grep(%r{^bin/}) { |f| File.basename(f) }
|
18
|
+
spec.test_files = spec.files.grep(%r{^(test|spec|features)/})
|
19
|
+
spec.require_paths = ["lib"]
|
20
|
+
|
21
|
+
spec.add_development_dependency "bundler", "~> 1.3"
|
22
|
+
spec.add_development_dependency "rake"
|
23
|
+
|
24
|
+
spec.add_development_dependency "minitest"
|
25
|
+
spec.add_development_dependency "shoulda-context"
|
26
|
+
end
|
@@ -0,0 +1,76 @@
|
|
1
|
+
module KeyValueTree
|
2
|
+
|
3
|
+
class Hash
|
4
|
+
|
5
|
+
def initialize(key=nil, parent = nil, store = KeyValueTree::MemortyStore.new())
|
6
|
+
@key = key.to_s
|
7
|
+
@parent = parent
|
8
|
+
@store = store
|
9
|
+
end
|
10
|
+
|
11
|
+
def [] (key)
|
12
|
+
value = @store.key(key_path_string(key))
|
13
|
+
return value unless value.nil?
|
14
|
+
return KeyValueTree::Hash.new(key, self, @store)
|
15
|
+
end
|
16
|
+
|
17
|
+
def []= (key, value)
|
18
|
+
if value.is_a?(Hash)
|
19
|
+
value.each do |hash_key, hash_value|
|
20
|
+
self[key_path_string(key)][hash_key] = hash_value
|
21
|
+
end
|
22
|
+
return
|
23
|
+
end
|
24
|
+
#if value.is_a?(Array)
|
25
|
+
# value.each_with_index do |value, index|
|
26
|
+
# self[key][index] = value
|
27
|
+
# end
|
28
|
+
# return
|
29
|
+
#end
|
30
|
+
@store.store(key_path_string(key), value)
|
31
|
+
return value
|
32
|
+
end
|
33
|
+
|
34
|
+
def method_missing(method, *args)
|
35
|
+
property = method.to_s
|
36
|
+
if property =~ /=$/
|
37
|
+
return self[property.chop] = args[0]
|
38
|
+
else
|
39
|
+
return self[property]
|
40
|
+
end
|
41
|
+
end
|
42
|
+
|
43
|
+
def key_path(key = nil)
|
44
|
+
if root?
|
45
|
+
return [] if key.nil?
|
46
|
+
return [key.to_s]
|
47
|
+
else
|
48
|
+
return (@parent.key_path + [@key]).compact if key.nil?
|
49
|
+
return (@parent.key_path + [@key, key.to_s]).compact
|
50
|
+
end
|
51
|
+
end
|
52
|
+
|
53
|
+
def key_path_string(key = nil)
|
54
|
+
result = ''
|
55
|
+
key_path(key).each_with_index do |value, index|
|
56
|
+
# if value.is_a?(Integer)
|
57
|
+
# result = result + "[#{value}]"
|
58
|
+
# else
|
59
|
+
result = result + '.' unless index == 0
|
60
|
+
result = result + value
|
61
|
+
# end
|
62
|
+
end
|
63
|
+
return result
|
64
|
+
end
|
65
|
+
|
66
|
+
def root?
|
67
|
+
@parent.nil?
|
68
|
+
end
|
69
|
+
|
70
|
+
def delete(key)
|
71
|
+
@store.delete(key_path_string(key.to_s))
|
72
|
+
end
|
73
|
+
|
74
|
+
end
|
75
|
+
|
76
|
+
end
|
@@ -0,0 +1,32 @@
|
|
1
|
+
module KeyValueTree
|
2
|
+
|
3
|
+
class MemoryStore < Store
|
4
|
+
|
5
|
+
def initialize(hash={})
|
6
|
+
@hash = hash
|
7
|
+
end
|
8
|
+
|
9
|
+
def key(key)
|
10
|
+
@hash[key.to_s]
|
11
|
+
end
|
12
|
+
|
13
|
+
def store(key, value)
|
14
|
+
@hash[key.to_s] = value
|
15
|
+
end
|
16
|
+
|
17
|
+
def basic_delete(key)
|
18
|
+
@hash.delete(key.to_s)
|
19
|
+
end
|
20
|
+
|
21
|
+
def keys
|
22
|
+
@hash.keys
|
23
|
+
end
|
24
|
+
|
25
|
+
def to_hash
|
26
|
+
@hash
|
27
|
+
end
|
28
|
+
|
29
|
+
|
30
|
+
end
|
31
|
+
|
32
|
+
end
|
@@ -0,0 +1,23 @@
|
|
1
|
+
module KeyValueTree
|
2
|
+
|
3
|
+
class Store
|
4
|
+
|
5
|
+
def delete(key)
|
6
|
+
self.delete_keys_start_with(key.to_s)
|
7
|
+
end
|
8
|
+
|
9
|
+
def delete_keys_start_with(key)
|
10
|
+
keys_start_with(key.to_s).each do |each|
|
11
|
+
self.basic_delete(each)
|
12
|
+
end
|
13
|
+
end
|
14
|
+
|
15
|
+
def keys_start_with(key)
|
16
|
+
self.keys.select do |sub_key|
|
17
|
+
sub_key.start_with?(key.to_s)
|
18
|
+
end
|
19
|
+
end
|
20
|
+
|
21
|
+
end
|
22
|
+
|
23
|
+
end
|
data/lib/keyvaluetree.rb
ADDED
data/test/common.rb
ADDED
data/test/hash_test.rb
ADDED
@@ -0,0 +1,75 @@
|
|
1
|
+
require "common"
|
2
|
+
|
3
|
+
class HashTest < Test::Unit::TestCase
|
4
|
+
|
5
|
+
context "Hash" do
|
6
|
+
|
7
|
+
setup do
|
8
|
+
@hash_object ={:a => :b}
|
9
|
+
@array_object = [:a, :b]
|
10
|
+
@store = KeyValueTree::MemoryStore.new()
|
11
|
+
@root = KeyValueTree::Hash.new(nil, nil, @store)
|
12
|
+
@key1 = 'key1'
|
13
|
+
@value1 = 'value1'
|
14
|
+
@key2 = 'key2'
|
15
|
+
@value2 = 'key2'
|
16
|
+
end
|
17
|
+
|
18
|
+
should "be created from an object" do
|
19
|
+
root = nil
|
20
|
+
assert_nothing_raised(Exception) { root = KeyValueTree::Hash.new(@hash_object, nil, @store) }
|
21
|
+
assert_instance_of(KeyValueTree::Hash, root)
|
22
|
+
end
|
23
|
+
|
24
|
+
should "be created from an object with store" do
|
25
|
+
root = nil
|
26
|
+
assert_nothing_raised(Exception) { root = KeyValueTree::Hash.new(@hash_object, nil, @store) }
|
27
|
+
assert_instance_of(KeyValueTree::Hash, root)
|
28
|
+
end
|
29
|
+
|
30
|
+
should "allow setting keys" do
|
31
|
+
assert_nothing_raised (Exception) { @root[@key1] = @value1 }
|
32
|
+
assert_nothing_raised (Exception) { @root.key2 = @value2 }
|
33
|
+
end
|
34
|
+
|
35
|
+
should "allow getting values" do
|
36
|
+
@root[@key1] = @value1
|
37
|
+
@root.key2 = @value2
|
38
|
+
assert_equal @value1, @root[@key1]
|
39
|
+
assert_equal @value2, @root.key2
|
40
|
+
end
|
41
|
+
|
42
|
+
should "return empty keypath for root" do
|
43
|
+
assert_equal [], @root.key_path()
|
44
|
+
end
|
45
|
+
|
46
|
+
should "know if it it's root" do
|
47
|
+
assert @root.root?
|
48
|
+
assert !@root.key.root?
|
49
|
+
end
|
50
|
+
|
51
|
+
should "create correct keypaths" do
|
52
|
+
assert_equal ['key1', 'key2', 'key3', 'key4'], @root.key1.key2.key3.key4.key_path()
|
53
|
+
assert_equal "key1.key2.key3.key4", @root.key1.key2.key3.key4.key_path_string()
|
54
|
+
@root.key1.key2.key3.key4 = @value1
|
55
|
+
assert_equal 1, @store.keys.size
|
56
|
+
assert_equal 'key1.key2.key3.key4', @store.keys.first
|
57
|
+
end
|
58
|
+
|
59
|
+
should "delete subkey when being deleted" do
|
60
|
+
@root.one.a.A = 'A'
|
61
|
+
@root.one.a.B = 'B'
|
62
|
+
@root.two.b.A = 'AA'
|
63
|
+
@root.two.b.B = 'BB'
|
64
|
+
assert_equal 4, @store.keys.size
|
65
|
+
|
66
|
+
@root.one.a.delete(:A)
|
67
|
+
assert_equal 3, @store.keys.size
|
68
|
+
|
69
|
+
@root.delete(:two)
|
70
|
+
assert_equal 1, @store.keys.size
|
71
|
+
|
72
|
+
end
|
73
|
+
end
|
74
|
+
|
75
|
+
end
|
@@ -0,0 +1,38 @@
|
|
1
|
+
require "common"
|
2
|
+
|
3
|
+
class MemoryStoreTest < Test::Unit::TestCase
|
4
|
+
|
5
|
+
context "a MemoryStore" do
|
6
|
+
setup do
|
7
|
+
@store = KeyValueTree::MemoryStore.new()
|
8
|
+
@key = "key"
|
9
|
+
@nilkey = "nil"
|
10
|
+
@value = 42
|
11
|
+
end
|
12
|
+
|
13
|
+
should "set a value" do
|
14
|
+
assert_equal @value, @store.store(@key, @value)
|
15
|
+
end
|
16
|
+
|
17
|
+
should "get a value" do
|
18
|
+
@store.store(@key, @value)
|
19
|
+
assert_equal(@value, @store.key(@key))
|
20
|
+
assert_equal(nil, @store.key(:@nilkey))
|
21
|
+
end
|
22
|
+
|
23
|
+
should "delete a value" do
|
24
|
+
assert_equal nil, @store.key(@key)
|
25
|
+
@store.store(@key, @value)
|
26
|
+
assert_equal @value, @store.key(@key)
|
27
|
+
@store.delete(@key)
|
28
|
+
assert_equal nil, @store.key(:@nilkey)
|
29
|
+
end
|
30
|
+
|
31
|
+
should "access the hash" do
|
32
|
+
assert_nothing_raised(Exception) { @store.to_hash }
|
33
|
+
@store.store(@key, @value)
|
34
|
+
assert_equal @value, @store.to_hash[@key]
|
35
|
+
end
|
36
|
+
|
37
|
+
end
|
38
|
+
end
|
metadata
ADDED
@@ -0,0 +1,137 @@
|
|
1
|
+
--- !ruby/object:Gem::Specification
|
2
|
+
name: keyvaluetree
|
3
|
+
version: !ruby/object:Gem::Version
|
4
|
+
version: 0.0.2
|
5
|
+
prerelease:
|
6
|
+
platform: ruby
|
7
|
+
authors:
|
8
|
+
- Udo Schneider
|
9
|
+
autorequire:
|
10
|
+
bindir: bin
|
11
|
+
cert_chain: []
|
12
|
+
date: 2013-09-01 00:00:00.000000000 Z
|
13
|
+
dependencies:
|
14
|
+
- !ruby/object:Gem::Dependency
|
15
|
+
name: bundler
|
16
|
+
requirement: !ruby/object:Gem::Requirement
|
17
|
+
none: false
|
18
|
+
requirements:
|
19
|
+
- - ~>
|
20
|
+
- !ruby/object:Gem::Version
|
21
|
+
version: '1.3'
|
22
|
+
type: :development
|
23
|
+
prerelease: false
|
24
|
+
version_requirements: !ruby/object:Gem::Requirement
|
25
|
+
none: false
|
26
|
+
requirements:
|
27
|
+
- - ~>
|
28
|
+
- !ruby/object:Gem::Version
|
29
|
+
version: '1.3'
|
30
|
+
- !ruby/object:Gem::Dependency
|
31
|
+
name: rake
|
32
|
+
requirement: !ruby/object:Gem::Requirement
|
33
|
+
none: false
|
34
|
+
requirements:
|
35
|
+
- - ! '>='
|
36
|
+
- !ruby/object:Gem::Version
|
37
|
+
version: '0'
|
38
|
+
type: :development
|
39
|
+
prerelease: false
|
40
|
+
version_requirements: !ruby/object:Gem::Requirement
|
41
|
+
none: false
|
42
|
+
requirements:
|
43
|
+
- - ! '>='
|
44
|
+
- !ruby/object:Gem::Version
|
45
|
+
version: '0'
|
46
|
+
- !ruby/object:Gem::Dependency
|
47
|
+
name: minitest
|
48
|
+
requirement: !ruby/object:Gem::Requirement
|
49
|
+
none: false
|
50
|
+
requirements:
|
51
|
+
- - ! '>='
|
52
|
+
- !ruby/object:Gem::Version
|
53
|
+
version: '0'
|
54
|
+
type: :development
|
55
|
+
prerelease: false
|
56
|
+
version_requirements: !ruby/object:Gem::Requirement
|
57
|
+
none: false
|
58
|
+
requirements:
|
59
|
+
- - ! '>='
|
60
|
+
- !ruby/object:Gem::Version
|
61
|
+
version: '0'
|
62
|
+
- !ruby/object:Gem::Dependency
|
63
|
+
name: shoulda-context
|
64
|
+
requirement: !ruby/object:Gem::Requirement
|
65
|
+
none: false
|
66
|
+
requirements:
|
67
|
+
- - ! '>='
|
68
|
+
- !ruby/object:Gem::Version
|
69
|
+
version: '0'
|
70
|
+
type: :development
|
71
|
+
prerelease: false
|
72
|
+
version_requirements: !ruby/object:Gem::Requirement
|
73
|
+
none: false
|
74
|
+
requirements:
|
75
|
+
- - ! '>='
|
76
|
+
- !ruby/object:Gem::Version
|
77
|
+
version: '0'
|
78
|
+
description: Storing hierarchical data in plain KeyValueStores
|
79
|
+
email:
|
80
|
+
- Udo.Schneider@homeaddress.de
|
81
|
+
executables: []
|
82
|
+
extensions: []
|
83
|
+
extra_rdoc_files: []
|
84
|
+
files:
|
85
|
+
- .gitignore
|
86
|
+
- .idea/encodings.xml
|
87
|
+
- .idea/misc.xml
|
88
|
+
- .idea/modules.xml
|
89
|
+
- .idea/vcs.xml
|
90
|
+
- Gemfile
|
91
|
+
- LICENSE.txt
|
92
|
+
- README.md
|
93
|
+
- Rakefile
|
94
|
+
- keyvaluetree.gemspec
|
95
|
+
- lib/keyvaluetree.rb
|
96
|
+
- lib/keyvaluetree/hash.rb
|
97
|
+
- lib/keyvaluetree/memory_store.rb
|
98
|
+
- lib/keyvaluetree/store.rb
|
99
|
+
- lib/keyvaluetree/version.rb
|
100
|
+
- test/common.rb
|
101
|
+
- test/hash_test.rb
|
102
|
+
- test/memory_store_test.rb
|
103
|
+
homepage: ''
|
104
|
+
licenses:
|
105
|
+
- MIT
|
106
|
+
post_install_message:
|
107
|
+
rdoc_options: []
|
108
|
+
require_paths:
|
109
|
+
- lib
|
110
|
+
required_ruby_version: !ruby/object:Gem::Requirement
|
111
|
+
none: false
|
112
|
+
requirements:
|
113
|
+
- - ! '>='
|
114
|
+
- !ruby/object:Gem::Version
|
115
|
+
version: '0'
|
116
|
+
segments:
|
117
|
+
- 0
|
118
|
+
hash: -4411598630716912686
|
119
|
+
required_rubygems_version: !ruby/object:Gem::Requirement
|
120
|
+
none: false
|
121
|
+
requirements:
|
122
|
+
- - ! '>='
|
123
|
+
- !ruby/object:Gem::Version
|
124
|
+
version: '0'
|
125
|
+
segments:
|
126
|
+
- 0
|
127
|
+
hash: -4411598630716912686
|
128
|
+
requirements: []
|
129
|
+
rubyforge_project:
|
130
|
+
rubygems_version: 1.8.24
|
131
|
+
signing_key:
|
132
|
+
specification_version: 3
|
133
|
+
summary: Storing hierarchical data in plain KeyValueStores
|
134
|
+
test_files:
|
135
|
+
- test/common.rb
|
136
|
+
- test/hash_test.rb
|
137
|
+
- test/memory_store_test.rb
|