circular_linked_list 0.0.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- data/.gitignore +17 -0
- data/Gemfile +4 -0
- data/LICENSE.txt +22 -0
- data/README.md +29 -0
- data/Rakefile +1 -0
- data/circular_linked_list.gemspec +23 -0
- data/lib/circular_linked_list.rb +136 -0
- data/lib/circular_linked_list/version.rb +3 -0
- metadata +86 -0
data/.gitignore
ADDED
data/Gemfile
ADDED
data/LICENSE.txt
ADDED
@@ -0,0 +1,22 @@
|
|
1
|
+
Copyright (c) 2013 amith.prasad
|
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
|
+
# CircularLinkedList
|
2
|
+
|
3
|
+
TODO: Write a gem description
|
4
|
+
|
5
|
+
## Installation
|
6
|
+
|
7
|
+
Add this line to your application's Gemfile:
|
8
|
+
|
9
|
+
gem 'circular_linked_list'
|
10
|
+
|
11
|
+
And then execute:
|
12
|
+
|
13
|
+
$ bundle
|
14
|
+
|
15
|
+
Or install it yourself as:
|
16
|
+
|
17
|
+
$ gem install circular_linked_list
|
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 @@
|
|
1
|
+
require "bundler/gem_tasks"
|
@@ -0,0 +1,23 @@
|
|
1
|
+
# coding: utf-8
|
2
|
+
lib = File.expand_path('../lib', __FILE__)
|
3
|
+
$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
|
4
|
+
require 'circular_linked_list/version'
|
5
|
+
|
6
|
+
Gem::Specification.new do |spec|
|
7
|
+
spec.name = "circular_linked_list"
|
8
|
+
spec.version = CircularLinkedList::VERSION
|
9
|
+
spec.authors = ["amith.prasad"]
|
10
|
+
spec.email = ["send2amith@gmail.com"]
|
11
|
+
spec.description = %q{basic circular linked list }
|
12
|
+
spec.summary = %q{contains add, remove, is_exists and list printing}
|
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
|
+
end
|
@@ -0,0 +1,136 @@
|
|
1
|
+
require "circular_linked_list/version"
|
2
|
+
|
3
|
+
module CircularLinkedList
|
4
|
+
# Your code goes here...
|
5
|
+
class Node
|
6
|
+
attr_accessor :prev_node, :next_node, :node_value
|
7
|
+
|
8
|
+
def initialize node_value
|
9
|
+
@node_value = node_value
|
10
|
+
@prev_node = self
|
11
|
+
@next_node = self
|
12
|
+
end
|
13
|
+
end
|
14
|
+
|
15
|
+
class CircularLinkedList
|
16
|
+
@@list_ref = nil
|
17
|
+
# def initialoze(list_ref=nil)
|
18
|
+
# @@list_ref = list_ref
|
19
|
+
#end
|
20
|
+
|
21
|
+
def self.print_list
|
22
|
+
puts "List contains:"
|
23
|
+
if @@list_ref == nil
|
24
|
+
puts "empty"
|
25
|
+
elsif @@list_ref.next_node == nil
|
26
|
+
puts @@list_ref.node_value
|
27
|
+
else
|
28
|
+
first_node = @@list_ref
|
29
|
+
puts first_node.node_value
|
30
|
+
|
31
|
+
node = @@list_ref.next_node
|
32
|
+
while node != first_node
|
33
|
+
puts node.node_value
|
34
|
+
node = node.next_node
|
35
|
+
end
|
36
|
+
end
|
37
|
+
end
|
38
|
+
|
39
|
+
def self.add(value)
|
40
|
+
new_node = Node.new value
|
41
|
+
|
42
|
+
if @@list_ref == nil
|
43
|
+
@@list_ref = new_node
|
44
|
+
puts "This node is added: #{@@list_ref.node_value}"
|
45
|
+
elsif @@list_ref.next_node == @@list_ref
|
46
|
+
new_node.prev_node = @@list_ref
|
47
|
+
new_node.next_node = @@list_ref
|
48
|
+
|
49
|
+
@@list_ref.next_node = new_node
|
50
|
+
@@list_ref.prev_node = new_node
|
51
|
+
|
52
|
+
@@list_ref = new_node
|
53
|
+
puts "This node is added: #{@@list_ref.node_value}"
|
54
|
+
else
|
55
|
+
last = @@list_ref.next_node
|
56
|
+
|
57
|
+
new_node.prev_node = @@list_ref
|
58
|
+
new_node.next_node = last
|
59
|
+
@@list_ref.next_node = new_node
|
60
|
+
last.prev_node = new_node
|
61
|
+
|
62
|
+
@@list_ref = new_node
|
63
|
+
puts "This node is added: #{@@list_ref.node_value}"
|
64
|
+
end
|
65
|
+
end
|
66
|
+
|
67
|
+
def self.remove()
|
68
|
+
if @@list_ref == nil
|
69
|
+
puts "nothing to remove"
|
70
|
+
elsif @@list_ref.next_node == @@list_ref
|
71
|
+
puts "This node is removed: #{@@list_ref.node_value}"
|
72
|
+
@@list_ref = nil
|
73
|
+
else
|
74
|
+
@@list_ref.prev_node.next_node = @@list_ref.next_node
|
75
|
+
@@list_ref.next_node.prev_node = @@list_ref.prev_node
|
76
|
+
|
77
|
+
puts "This node is removed: #{@@list_ref.node_value}"
|
78
|
+
@@list_ref = @@list_ref.prev_node
|
79
|
+
end
|
80
|
+
end
|
81
|
+
|
82
|
+
def self.is_exists(value)
|
83
|
+
if @@list_ref == nil
|
84
|
+
puts "no"
|
85
|
+
elsif @@list_ref.next_node == nil
|
86
|
+
if @@list_ref.node_value == value
|
87
|
+
puts "yes"
|
88
|
+
else
|
89
|
+
puts "no"
|
90
|
+
end
|
91
|
+
else
|
92
|
+
first_node = @@list_ref
|
93
|
+
flag = 0
|
94
|
+
node = @@list_ref.next_node
|
95
|
+
while node != first_node
|
96
|
+
if node.node_value == value
|
97
|
+
flag = 1
|
98
|
+
puts "yes"
|
99
|
+
break
|
100
|
+
end
|
101
|
+
node = node.next_node
|
102
|
+
end
|
103
|
+
puts "no" if flag == 0
|
104
|
+
end
|
105
|
+
end
|
106
|
+
end
|
107
|
+
|
108
|
+
while 1 do
|
109
|
+
puts "1. add"
|
110
|
+
puts "2. remove"
|
111
|
+
puts "3. is exists"
|
112
|
+
puts "4. print list"
|
113
|
+
puts "5. exit"
|
114
|
+
choice = gets.to_i
|
115
|
+
case(choice)
|
116
|
+
when 1
|
117
|
+
puts "Enter the value:"
|
118
|
+
value = gets
|
119
|
+
#value = value.to_i
|
120
|
+
CircularLinkedList.add(value)
|
121
|
+
when 2
|
122
|
+
CircularLinkedList.remove
|
123
|
+
when 3
|
124
|
+
puts "Enter the value:"
|
125
|
+
value = gets
|
126
|
+
#value = value.to_i
|
127
|
+
CircularLinkedList.is_exists value
|
128
|
+
when 4
|
129
|
+
CircularLinkedList.print_list
|
130
|
+
when 5
|
131
|
+
exit(0)
|
132
|
+
else
|
133
|
+
puts "Wrong choice"
|
134
|
+
end
|
135
|
+
end
|
136
|
+
end
|
metadata
ADDED
@@ -0,0 +1,86 @@
|
|
1
|
+
--- !ruby/object:Gem::Specification
|
2
|
+
name: circular_linked_list
|
3
|
+
version: !ruby/object:Gem::Version
|
4
|
+
version: 0.0.1
|
5
|
+
prerelease:
|
6
|
+
platform: ruby
|
7
|
+
authors:
|
8
|
+
- amith.prasad
|
9
|
+
autorequire:
|
10
|
+
bindir: bin
|
11
|
+
cert_chain: []
|
12
|
+
date: 2013-05-28 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
|
+
description: ! 'basic circular linked list '
|
47
|
+
email:
|
48
|
+
- send2amith@gmail.com
|
49
|
+
executables: []
|
50
|
+
extensions: []
|
51
|
+
extra_rdoc_files: []
|
52
|
+
files:
|
53
|
+
- .gitignore
|
54
|
+
- Gemfile
|
55
|
+
- LICENSE.txt
|
56
|
+
- README.md
|
57
|
+
- Rakefile
|
58
|
+
- circular_linked_list.gemspec
|
59
|
+
- lib/circular_linked_list.rb
|
60
|
+
- lib/circular_linked_list/version.rb
|
61
|
+
homepage: ''
|
62
|
+
licenses:
|
63
|
+
- MIT
|
64
|
+
post_install_message:
|
65
|
+
rdoc_options: []
|
66
|
+
require_paths:
|
67
|
+
- lib
|
68
|
+
required_ruby_version: !ruby/object:Gem::Requirement
|
69
|
+
none: false
|
70
|
+
requirements:
|
71
|
+
- - ! '>='
|
72
|
+
- !ruby/object:Gem::Version
|
73
|
+
version: '0'
|
74
|
+
required_rubygems_version: !ruby/object:Gem::Requirement
|
75
|
+
none: false
|
76
|
+
requirements:
|
77
|
+
- - ! '>='
|
78
|
+
- !ruby/object:Gem::Version
|
79
|
+
version: '0'
|
80
|
+
requirements: []
|
81
|
+
rubyforge_project:
|
82
|
+
rubygems_version: 1.8.24
|
83
|
+
signing_key:
|
84
|
+
specification_version: 3
|
85
|
+
summary: contains add, remove, is_exists and list printing
|
86
|
+
test_files: []
|