tangle 0.1.0
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +7 -0
- data/.gitignore +13 -0
- data/.rspec +3 -0
- data/.rubocop.yml +3 -0
- data/.travis.yml +5 -0
- data/CODE_OF_CONDUCT.md +74 -0
- data/Gemfile +6 -0
- data/LICENSE.txt +21 -0
- data/README.md +43 -0
- data/Rakefile +14 -0
- data/bin/console +14 -0
- data/bin/setup +8 -0
- data/lib/tangle.rb +8 -0
- data/lib/tangle/edge.rb +67 -0
- data/lib/tangle/graph.rb +175 -0
- data/lib/tangle/version.rb +3 -0
- data/lib/tangle/vertex.rb +81 -0
- data/tangle.gemspec +27 -0
- metadata +117 -0
checksums.yaml
ADDED
@@ -0,0 +1,7 @@
|
|
1
|
+
---
|
2
|
+
SHA256:
|
3
|
+
metadata.gz: eb6c6e2247f126a8309178790612215cd099aaecaf909de00f114a1fb04e5caf
|
4
|
+
data.tar.gz: 42386680537801bfb1be9d1f14f684f6a82fe857246fdfe492d9ae31a602d980
|
5
|
+
SHA512:
|
6
|
+
metadata.gz: f231571ede13d8261d03c3a9c6410cf184ec79deb5a612aa9f655533410f296846e417aebde6a81c04bc7706253737689560b0fb0fabb52a9388314cc7514187
|
7
|
+
data.tar.gz: 0a52fa6c13da5c282167690c7f1fa73a70b5c9175f7e34f9d68bfcdd0036f305dfe177fb2ad2153c7722bdf4fef989b694cc68cfb56edefb52ee424c28ff98aa
|
data/.gitignore
ADDED
data/.rspec
ADDED
data/.rubocop.yml
ADDED
data/.travis.yml
ADDED
data/CODE_OF_CONDUCT.md
ADDED
@@ -0,0 +1,74 @@
|
|
1
|
+
# Contributor Covenant Code of Conduct
|
2
|
+
|
3
|
+
## Our Pledge
|
4
|
+
|
5
|
+
In the interest of fostering an open and welcoming environment, we as
|
6
|
+
contributors and maintainers pledge to making participation in our project and
|
7
|
+
our community a harassment-free experience for everyone, regardless of age, body
|
8
|
+
size, disability, ethnicity, gender identity and expression, level of experience,
|
9
|
+
nationality, personal appearance, race, religion, or sexual identity and
|
10
|
+
orientation.
|
11
|
+
|
12
|
+
## Our Standards
|
13
|
+
|
14
|
+
Examples of behavior that contributes to creating a positive environment
|
15
|
+
include:
|
16
|
+
|
17
|
+
* Using welcoming and inclusive language
|
18
|
+
* Being respectful of differing viewpoints and experiences
|
19
|
+
* Gracefully accepting constructive criticism
|
20
|
+
* Focusing on what is best for the community
|
21
|
+
* Showing empathy towards other community members
|
22
|
+
|
23
|
+
Examples of unacceptable behavior by participants include:
|
24
|
+
|
25
|
+
* The use of sexualized language or imagery and unwelcome sexual attention or
|
26
|
+
advances
|
27
|
+
* Trolling, insulting/derogatory comments, and personal or political attacks
|
28
|
+
* Public or private harassment
|
29
|
+
* Publishing others' private information, such as a physical or electronic
|
30
|
+
address, without explicit permission
|
31
|
+
* Other conduct which could reasonably be considered inappropriate in a
|
32
|
+
professional setting
|
33
|
+
|
34
|
+
## Our Responsibilities
|
35
|
+
|
36
|
+
Project maintainers are responsible for clarifying the standards of acceptable
|
37
|
+
behavior and are expected to take appropriate and fair corrective action in
|
38
|
+
response to any instances of unacceptable behavior.
|
39
|
+
|
40
|
+
Project maintainers have the right and responsibility to remove, edit, or
|
41
|
+
reject comments, commits, code, wiki edits, issues, and other contributions
|
42
|
+
that are not aligned to this Code of Conduct, or to ban temporarily or
|
43
|
+
permanently any contributor for other behaviors that they deem inappropriate,
|
44
|
+
threatening, offensive, or harmful.
|
45
|
+
|
46
|
+
## Scope
|
47
|
+
|
48
|
+
This Code of Conduct applies both within project spaces and in public spaces
|
49
|
+
when an individual is representing the project or its community. Examples of
|
50
|
+
representing a project or community include using an official project e-mail
|
51
|
+
address, posting via an official social media account, or acting as an appointed
|
52
|
+
representative at an online or offline event. Representation of a project may be
|
53
|
+
further defined and clarified by project maintainers.
|
54
|
+
|
55
|
+
## Enforcement
|
56
|
+
|
57
|
+
Instances of abusive, harassing, or otherwise unacceptable behavior may be
|
58
|
+
reported by contacting the project team at calle@discord.bofh.se. All
|
59
|
+
complaints will be reviewed and investigated and will result in a response that
|
60
|
+
is deemed necessary and appropriate to the circumstances. The project team is
|
61
|
+
obligated to maintain confidentiality with regard to the reporter of an incident.
|
62
|
+
Further details of specific enforcement policies may be posted separately.
|
63
|
+
|
64
|
+
Project maintainers who do not follow or enforce the Code of Conduct in good
|
65
|
+
faith may face temporary or permanent repercussions as determined by other
|
66
|
+
members of the project's leadership.
|
67
|
+
|
68
|
+
## Attribution
|
69
|
+
|
70
|
+
This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4,
|
71
|
+
available at [http://contributor-covenant.org/version/1/4][version]
|
72
|
+
|
73
|
+
[homepage]: http://contributor-covenant.org
|
74
|
+
[version]: http://contributor-covenant.org/version/1/4/
|
data/Gemfile
ADDED
data/LICENSE.txt
ADDED
@@ -0,0 +1,21 @@
|
|
1
|
+
The MIT License (MIT)
|
2
|
+
|
3
|
+
Copyright (c) 2018 Calle Englund
|
4
|
+
|
5
|
+
Permission is hereby granted, free of charge, to any person obtaining a copy
|
6
|
+
of this software and associated documentation files (the "Software"), to deal
|
7
|
+
in the Software without restriction, including without limitation the rights
|
8
|
+
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
9
|
+
copies of the Software, and to permit persons to whom the Software is
|
10
|
+
furnished to do so, subject to the following conditions:
|
11
|
+
|
12
|
+
The above copyright notice and this permission notice shall be included in
|
13
|
+
all copies or substantial portions of the Software.
|
14
|
+
|
15
|
+
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
16
|
+
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
17
|
+
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
18
|
+
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
19
|
+
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
20
|
+
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
21
|
+
THE SOFTWARE.
|
data/README.md
ADDED
@@ -0,0 +1,43 @@
|
|
1
|
+
# Tangle
|
2
|
+
|
3
|
+
Welcome to your new gem! In this directory, you'll find the files you need to be able to package up your Ruby library into a gem. Put your Ruby code in the file `lib/tangle`. To experiment with that code, run `bin/console` for an interactive prompt.
|
4
|
+
|
5
|
+
TODO: Delete this and the text above, and describe your gem
|
6
|
+
|
7
|
+
## Installation
|
8
|
+
|
9
|
+
Add this line to your application's Gemfile:
|
10
|
+
|
11
|
+
```ruby
|
12
|
+
gem 'tangle'
|
13
|
+
```
|
14
|
+
|
15
|
+
And then execute:
|
16
|
+
|
17
|
+
$ bundle
|
18
|
+
|
19
|
+
Or install it yourself as:
|
20
|
+
|
21
|
+
$ gem install tangle
|
22
|
+
|
23
|
+
## Usage
|
24
|
+
|
25
|
+
TODO: Write usage instructions here
|
26
|
+
|
27
|
+
## Development
|
28
|
+
|
29
|
+
After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake spec` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
|
30
|
+
|
31
|
+
To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).
|
32
|
+
|
33
|
+
## Contributing
|
34
|
+
|
35
|
+
Bug reports and pull requests are welcome on GitHub at https://github.com/[USERNAME]/tangle. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [Contributor Covenant](http://contributor-covenant.org) code of conduct.
|
36
|
+
|
37
|
+
## License
|
38
|
+
|
39
|
+
The gem is available as open source under the terms of the [MIT License](https://opensource.org/licenses/MIT).
|
40
|
+
|
41
|
+
## Code of Conduct
|
42
|
+
|
43
|
+
Everyone interacting in the Tangle project’s codebases, issue trackers, chat rooms and mailing lists is expected to follow the [code of conduct](https://github.com/[USERNAME]/tangle/blob/master/CODE_OF_CONDUCT.md).
|
data/Rakefile
ADDED
@@ -0,0 +1,14 @@
|
|
1
|
+
require 'bundler/setup'
|
2
|
+
require 'bundler/gem_tasks'
|
3
|
+
|
4
|
+
desc 'Run RuboCop'
|
5
|
+
require 'rubocop/rake_task'
|
6
|
+
RuboCop::RakeTask.new(:rubocop) do |task|
|
7
|
+
task.options << '--display-cop-names'
|
8
|
+
end
|
9
|
+
|
10
|
+
desc 'Run RSpec'
|
11
|
+
require 'rspec/core/rake_task'
|
12
|
+
RSpec::Core::RakeTask.new(:spec)
|
13
|
+
|
14
|
+
task default: %i[rubocop spec]
|
data/bin/console
ADDED
@@ -0,0 +1,14 @@
|
|
1
|
+
#!/usr/bin/env ruby
|
2
|
+
|
3
|
+
require 'bundler/setup'
|
4
|
+
require 'tangle'
|
5
|
+
|
6
|
+
# You can add fixtures and/or initialization code here to make experimenting
|
7
|
+
# with your gem easier. You can also use a different console, if you like.
|
8
|
+
|
9
|
+
# (If you use this, don't forget to add pry to your Gemfile!)
|
10
|
+
# require 'pry'
|
11
|
+
# Pry.start
|
12
|
+
|
13
|
+
require 'irb'
|
14
|
+
IRB.start(__FILE__)
|
data/bin/setup
ADDED
data/lib/tangle.rb
ADDED
data/lib/tangle/edge.rb
ADDED
@@ -0,0 +1,67 @@
|
|
1
|
+
module Tangle
|
2
|
+
#
|
3
|
+
# An edge in a graph, connecting two vertices
|
4
|
+
#
|
5
|
+
class Edge
|
6
|
+
extend Forwardable
|
7
|
+
|
8
|
+
# Create a new edge between vertices
|
9
|
+
#
|
10
|
+
# Edge.new(vtx1) => Edge (loop)
|
11
|
+
# Edge.new(vtx1, vtx2) => Edge
|
12
|
+
#
|
13
|
+
# End users should probably use Graph#add_edge instead.
|
14
|
+
#
|
15
|
+
def initialize(vertex1, vertex2 = vertex1, graph: nil)
|
16
|
+
@vertices = Set[vertex1, vertex2]
|
17
|
+
@graph = graph
|
18
|
+
|
19
|
+
raise ArgumentError unless valid_edge?
|
20
|
+
end
|
21
|
+
|
22
|
+
# Follow the edge from a vertex to the other end
|
23
|
+
#
|
24
|
+
# walk(vertex) => Vertex
|
25
|
+
#
|
26
|
+
def walk(from_vertex)
|
27
|
+
raise RuntimeError unless @vertices.include?(from_vertex)
|
28
|
+
@vertices.find { |other| other != from_vertex } || from_vertex
|
29
|
+
end
|
30
|
+
|
31
|
+
# Duplicate an edge into another graph, replacing original vertices with
|
32
|
+
# their already prepared duplicates in the other graph. Returns nil if any
|
33
|
+
# of the vertices does not exist in the other graph.
|
34
|
+
# End users should probably use Graph#subgraph instead.
|
35
|
+
#
|
36
|
+
# dup_into(graph) => Edge or nil
|
37
|
+
#
|
38
|
+
# Raises an ArgumentError if graph would remain the same.
|
39
|
+
#
|
40
|
+
def dup_into(graph)
|
41
|
+
raise ArgumentError if graph == @graph
|
42
|
+
|
43
|
+
vertices = @vertices.map do |vertex|
|
44
|
+
graph.get_vertex(vertex.vertex_id)
|
45
|
+
end
|
46
|
+
Edge.new(*vertices, graph: graph)
|
47
|
+
rescue KeyError
|
48
|
+
nil
|
49
|
+
end
|
50
|
+
|
51
|
+
def inspect
|
52
|
+
"#<#{self.class}: #{@vertices}>"
|
53
|
+
end
|
54
|
+
|
55
|
+
attr_reader :name
|
56
|
+
attr_reader :graph
|
57
|
+
attr_reader :vertices
|
58
|
+
|
59
|
+
def_delegators :@vertices, :include?
|
60
|
+
|
61
|
+
private
|
62
|
+
|
63
|
+
def valid_edge?
|
64
|
+
@vertices.all? { |vertex| vertex.graph == @graph }
|
65
|
+
end
|
66
|
+
end
|
67
|
+
end
|
data/lib/tangle/graph.rb
ADDED
@@ -0,0 +1,175 @@
|
|
1
|
+
require 'tangle/vertex'
|
2
|
+
require 'tangle/edge'
|
3
|
+
|
4
|
+
module Tangle
|
5
|
+
#
|
6
|
+
# Base class for all kinds of graphs
|
7
|
+
#
|
8
|
+
class Graph
|
9
|
+
# Initialize a new graph, optionally preloading it with vertices and edges
|
10
|
+
#
|
11
|
+
# Graph.new() => Graph
|
12
|
+
# Graph.new(vertices: +array_or_hash+) => Graph
|
13
|
+
# Graph.new(vertices: +array_or_hash+, edges: +array_or_hash+) => Graph
|
14
|
+
#
|
15
|
+
# When +array_or_hash+ is a hash, it contains the objects as values and
|
16
|
+
# their names as keys. When +array_or_hash+ is an array the objects will
|
17
|
+
# get assigned unique names (within the graph).
|
18
|
+
#
|
19
|
+
# +vertices+ can contain anything, and the Vertex object that is created
|
20
|
+
# will delegate all missing methods to its content.
|
21
|
+
#
|
22
|
+
# +edges+ can contain an array of exactly two, either names of vertices
|
23
|
+
# or vertices.
|
24
|
+
#
|
25
|
+
# Any subclass of Graph should also subclass Edge to manage its unique
|
26
|
+
# constraints.
|
27
|
+
#
|
28
|
+
def initialize(vertices: nil, edges: nil)
|
29
|
+
@vertices_by_id = {}
|
30
|
+
@vertices_by_name = {}
|
31
|
+
@edges = []
|
32
|
+
|
33
|
+
initialize_vertices(vertices)
|
34
|
+
initialize_edges(edges)
|
35
|
+
end
|
36
|
+
|
37
|
+
# Get all edges.
|
38
|
+
#
|
39
|
+
# edges => Array
|
40
|
+
#
|
41
|
+
def edges(&selector)
|
42
|
+
if block_given?
|
43
|
+
@edges.select(&selector)
|
44
|
+
else
|
45
|
+
@edges
|
46
|
+
end
|
47
|
+
end
|
48
|
+
|
49
|
+
# Add a new edge to the graph
|
50
|
+
#
|
51
|
+
# add_edge(vtx1, vtx2, ...) => Edge
|
52
|
+
#
|
53
|
+
def add_edge(*vertices, **kvargs)
|
54
|
+
vertices = vertices.map { |v| get_vertex(v) }
|
55
|
+
insert_edge(Edge.new(*vertices, graph: self, **kvargs))
|
56
|
+
end
|
57
|
+
|
58
|
+
# Get all vertices.
|
59
|
+
#
|
60
|
+
# vertices => Array
|
61
|
+
#
|
62
|
+
def vertices
|
63
|
+
if block_given?
|
64
|
+
@vertices_by_id.select { |_, vertex| yield(vertex) }
|
65
|
+
else
|
66
|
+
@vertices_by_id
|
67
|
+
end.values
|
68
|
+
end
|
69
|
+
|
70
|
+
# Add a new vertex to the graph
|
71
|
+
#
|
72
|
+
# add_vertex(...) => Vertex
|
73
|
+
#
|
74
|
+
# Optional named arguments:
|
75
|
+
# name: unique name or label for vertex
|
76
|
+
# contents: delegate object for missing methods
|
77
|
+
#
|
78
|
+
def add_vertex(**kvargs)
|
79
|
+
insert_vertex(Vertex.new(graph: self, **kvargs))
|
80
|
+
end
|
81
|
+
|
82
|
+
def get_vertex(name_or_vertex)
|
83
|
+
case name_or_vertex
|
84
|
+
when Vertex
|
85
|
+
name_or_vertex
|
86
|
+
else
|
87
|
+
@vertices_by_name[name_or_vertex] ||
|
88
|
+
@vertices_by_id.fetch(name_or_vertex)
|
89
|
+
end
|
90
|
+
end
|
91
|
+
|
92
|
+
# Return a subgraph, optionally filtered by a vertex selector block
|
93
|
+
#
|
94
|
+
# subgraph => Graph
|
95
|
+
# subgraph { |vertex| ... } => Graph
|
96
|
+
#
|
97
|
+
# Unless a selector is provided, the subgraph contains the entire graph.
|
98
|
+
#
|
99
|
+
def subgraph(&selector)
|
100
|
+
graph = Graph.new
|
101
|
+
|
102
|
+
dup_vertices_into(graph, &selector)
|
103
|
+
dup_edges_into(graph)
|
104
|
+
|
105
|
+
graph
|
106
|
+
end
|
107
|
+
alias dup subgraph
|
108
|
+
|
109
|
+
protected
|
110
|
+
|
111
|
+
# Insert a prepared vertex into the graph
|
112
|
+
#
|
113
|
+
def insert_vertex(vertex)
|
114
|
+
raise ArgumentError unless vertex.graph.eql?(self)
|
115
|
+
|
116
|
+
@vertices_by_name[vertex.name] = vertex unless vertex.name.nil?
|
117
|
+
@vertices_by_id[vertex.vertex_id] = vertex
|
118
|
+
end
|
119
|
+
|
120
|
+
# Insert a prepared edge into the graph
|
121
|
+
#
|
122
|
+
def insert_edge(edge)
|
123
|
+
raise ArgumentError unless edge.graph.eql?(self)
|
124
|
+
|
125
|
+
@edges << edge
|
126
|
+
edge
|
127
|
+
end
|
128
|
+
|
129
|
+
private
|
130
|
+
|
131
|
+
def initialize_vertices(vertices)
|
132
|
+
return if vertices.nil?
|
133
|
+
|
134
|
+
case vertices
|
135
|
+
when Hash
|
136
|
+
initialize_named_vertices(vertices)
|
137
|
+
else
|
138
|
+
initialize_anonymous_vertices(vertices)
|
139
|
+
end
|
140
|
+
end
|
141
|
+
|
142
|
+
def initialize_named_vertices(vertices)
|
143
|
+
vertices.each do |name, delegate|
|
144
|
+
add_vertex(name: name, delegate: delegate)
|
145
|
+
end
|
146
|
+
end
|
147
|
+
|
148
|
+
def initialize_anonymous_vertices(vertices)
|
149
|
+
vertices.each do |delegate|
|
150
|
+
add_vertex(delegate: delegate)
|
151
|
+
end
|
152
|
+
end
|
153
|
+
|
154
|
+
def initialize_edges(edges)
|
155
|
+
return if edges.nil?
|
156
|
+
|
157
|
+
edges.each do |vertices|
|
158
|
+
add_edge(*vertices)
|
159
|
+
end
|
160
|
+
end
|
161
|
+
|
162
|
+
def dup_vertices_into(graph, &selector)
|
163
|
+
vertices(&selector).each do |vertex|
|
164
|
+
graph.insert_vertex(vertex.dup_into(graph))
|
165
|
+
end
|
166
|
+
end
|
167
|
+
|
168
|
+
def dup_edges_into(graph)
|
169
|
+
edges.each do |edge|
|
170
|
+
new_edge = edge.dup_into(graph)
|
171
|
+
graph.insert_edge(new_edge) unless new_edge.nil?
|
172
|
+
end
|
173
|
+
end
|
174
|
+
end
|
175
|
+
end
|
@@ -0,0 +1,81 @@
|
|
1
|
+
require 'delegate'
|
2
|
+
require 'pp'
|
3
|
+
|
4
|
+
module Tangle
|
5
|
+
#
|
6
|
+
# A named vertex in a graph
|
7
|
+
#
|
8
|
+
class Vertex < SimpleDelegator
|
9
|
+
include PP::ObjectMixin
|
10
|
+
|
11
|
+
# Create a new vertex
|
12
|
+
#
|
13
|
+
# Vertex.new(...) => Vertex
|
14
|
+
#
|
15
|
+
# Named arguments:
|
16
|
+
# graph: a Graph or nil for an orphaned vertex
|
17
|
+
# name: anything that's hashable and unique within the graph
|
18
|
+
# delegate: delegate object for missing methods
|
19
|
+
#
|
20
|
+
def initialize(graph: nil,
|
21
|
+
name: nil,
|
22
|
+
delegate: nil,
|
23
|
+
vertex_id: object_id)
|
24
|
+
super(delegate) unless delegate.nil?
|
25
|
+
|
26
|
+
@graph = graph
|
27
|
+
@name = name
|
28
|
+
@delegate = delegate
|
29
|
+
@vertex_id = vertex_id
|
30
|
+
end
|
31
|
+
|
32
|
+
# Duplicate a vertex in a new graph, keeping all other contained attributes
|
33
|
+
# End users should probably use Graph#subgrap instead.
|
34
|
+
#
|
35
|
+
# dup_into(new_graph) => Vertex
|
36
|
+
#
|
37
|
+
# Raises an ArgumentError if graph would remain the same.
|
38
|
+
#
|
39
|
+
def dup_into(graph)
|
40
|
+
raise ArgumentError if graph == @graph
|
41
|
+
|
42
|
+
Vertex.new(
|
43
|
+
graph: graph,
|
44
|
+
name: @name,
|
45
|
+
delegate: @delegate,
|
46
|
+
vertex_id: @vertex_id
|
47
|
+
)
|
48
|
+
end
|
49
|
+
|
50
|
+
# Return all edges that touch this vertex
|
51
|
+
#
|
52
|
+
def edges
|
53
|
+
return [] if @graph.nil?
|
54
|
+
|
55
|
+
@graph.edges { |edge| edge.include? self }
|
56
|
+
end
|
57
|
+
|
58
|
+
# If two vertices have the same vertex_id, they have the same value
|
59
|
+
#
|
60
|
+
def ==(other)
|
61
|
+
@vertex_id == other.vertex_id
|
62
|
+
end
|
63
|
+
|
64
|
+
# If two vertices have the same vertex_id, they have the same value
|
65
|
+
#
|
66
|
+
def !=(other)
|
67
|
+
@vertex_id != other.vertex_id
|
68
|
+
end
|
69
|
+
|
70
|
+
# If two vertices have the same object_id, they are identical
|
71
|
+
#
|
72
|
+
def eql?(other)
|
73
|
+
@object_id == other.object_id
|
74
|
+
end
|
75
|
+
|
76
|
+
attr_reader :graph
|
77
|
+
attr_reader :name
|
78
|
+
attr_reader :delegate
|
79
|
+
attr_reader :vertex_id
|
80
|
+
end
|
81
|
+
end
|
data/tangle.gemspec
ADDED
@@ -0,0 +1,27 @@
|
|
1
|
+
|
2
|
+
lib = File.expand_path('../lib', __FILE__)
|
3
|
+
$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
|
4
|
+
require 'tangle/version'
|
5
|
+
|
6
|
+
Gem::Specification.new do |spec|
|
7
|
+
spec.name = 'tangle'
|
8
|
+
spec.version = Tangle::VERSION
|
9
|
+
spec.authors = ['Calle Englund']
|
10
|
+
spec.email = ['calle@discord.bofh.se']
|
11
|
+
|
12
|
+
spec.summary = 'Tangle implements graphs of things'
|
13
|
+
spec.homepage = 'https://github.com/notcalle/ruby-tangle'
|
14
|
+
spec.license = 'MIT'
|
15
|
+
|
16
|
+
spec.files = `git ls-files -z`.split("\x0").reject do |f|
|
17
|
+
f.match(%r{^(test|spec|features)/})
|
18
|
+
end
|
19
|
+
spec.bindir = 'exe'
|
20
|
+
spec.executables = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
|
21
|
+
spec.require_paths = ['lib']
|
22
|
+
|
23
|
+
spec.add_development_dependency 'bundler', '~> 1.16'
|
24
|
+
spec.add_development_dependency 'rake', '~> 10.0'
|
25
|
+
spec.add_development_dependency 'rspec', '~> 3.0'
|
26
|
+
spec.add_development_dependency 'rubocop', '~> 0.52'
|
27
|
+
end
|
metadata
ADDED
@@ -0,0 +1,117 @@
|
|
1
|
+
--- !ruby/object:Gem::Specification
|
2
|
+
name: tangle
|
3
|
+
version: !ruby/object:Gem::Version
|
4
|
+
version: 0.1.0
|
5
|
+
platform: ruby
|
6
|
+
authors:
|
7
|
+
- Calle Englund
|
8
|
+
autorequire:
|
9
|
+
bindir: exe
|
10
|
+
cert_chain: []
|
11
|
+
date: 2018-02-03 00:00:00.000000000 Z
|
12
|
+
dependencies:
|
13
|
+
- !ruby/object:Gem::Dependency
|
14
|
+
name: bundler
|
15
|
+
requirement: !ruby/object:Gem::Requirement
|
16
|
+
requirements:
|
17
|
+
- - "~>"
|
18
|
+
- !ruby/object:Gem::Version
|
19
|
+
version: '1.16'
|
20
|
+
type: :development
|
21
|
+
prerelease: false
|
22
|
+
version_requirements: !ruby/object:Gem::Requirement
|
23
|
+
requirements:
|
24
|
+
- - "~>"
|
25
|
+
- !ruby/object:Gem::Version
|
26
|
+
version: '1.16'
|
27
|
+
- !ruby/object:Gem::Dependency
|
28
|
+
name: rake
|
29
|
+
requirement: !ruby/object:Gem::Requirement
|
30
|
+
requirements:
|
31
|
+
- - "~>"
|
32
|
+
- !ruby/object:Gem::Version
|
33
|
+
version: '10.0'
|
34
|
+
type: :development
|
35
|
+
prerelease: false
|
36
|
+
version_requirements: !ruby/object:Gem::Requirement
|
37
|
+
requirements:
|
38
|
+
- - "~>"
|
39
|
+
- !ruby/object:Gem::Version
|
40
|
+
version: '10.0'
|
41
|
+
- !ruby/object:Gem::Dependency
|
42
|
+
name: rspec
|
43
|
+
requirement: !ruby/object:Gem::Requirement
|
44
|
+
requirements:
|
45
|
+
- - "~>"
|
46
|
+
- !ruby/object:Gem::Version
|
47
|
+
version: '3.0'
|
48
|
+
type: :development
|
49
|
+
prerelease: false
|
50
|
+
version_requirements: !ruby/object:Gem::Requirement
|
51
|
+
requirements:
|
52
|
+
- - "~>"
|
53
|
+
- !ruby/object:Gem::Version
|
54
|
+
version: '3.0'
|
55
|
+
- !ruby/object:Gem::Dependency
|
56
|
+
name: rubocop
|
57
|
+
requirement: !ruby/object:Gem::Requirement
|
58
|
+
requirements:
|
59
|
+
- - "~>"
|
60
|
+
- !ruby/object:Gem::Version
|
61
|
+
version: '0.52'
|
62
|
+
type: :development
|
63
|
+
prerelease: false
|
64
|
+
version_requirements: !ruby/object:Gem::Requirement
|
65
|
+
requirements:
|
66
|
+
- - "~>"
|
67
|
+
- !ruby/object:Gem::Version
|
68
|
+
version: '0.52'
|
69
|
+
description:
|
70
|
+
email:
|
71
|
+
- calle@discord.bofh.se
|
72
|
+
executables: []
|
73
|
+
extensions: []
|
74
|
+
extra_rdoc_files: []
|
75
|
+
files:
|
76
|
+
- ".gitignore"
|
77
|
+
- ".rspec"
|
78
|
+
- ".rubocop.yml"
|
79
|
+
- ".travis.yml"
|
80
|
+
- CODE_OF_CONDUCT.md
|
81
|
+
- Gemfile
|
82
|
+
- LICENSE.txt
|
83
|
+
- README.md
|
84
|
+
- Rakefile
|
85
|
+
- bin/console
|
86
|
+
- bin/setup
|
87
|
+
- lib/tangle.rb
|
88
|
+
- lib/tangle/edge.rb
|
89
|
+
- lib/tangle/graph.rb
|
90
|
+
- lib/tangle/version.rb
|
91
|
+
- lib/tangle/vertex.rb
|
92
|
+
- tangle.gemspec
|
93
|
+
homepage: https://github.com/notcalle/ruby-tangle
|
94
|
+
licenses:
|
95
|
+
- MIT
|
96
|
+
metadata: {}
|
97
|
+
post_install_message:
|
98
|
+
rdoc_options: []
|
99
|
+
require_paths:
|
100
|
+
- lib
|
101
|
+
required_ruby_version: !ruby/object:Gem::Requirement
|
102
|
+
requirements:
|
103
|
+
- - ">="
|
104
|
+
- !ruby/object:Gem::Version
|
105
|
+
version: '0'
|
106
|
+
required_rubygems_version: !ruby/object:Gem::Requirement
|
107
|
+
requirements:
|
108
|
+
- - ">="
|
109
|
+
- !ruby/object:Gem::Version
|
110
|
+
version: '0'
|
111
|
+
requirements: []
|
112
|
+
rubyforge_project:
|
113
|
+
rubygems_version: 2.7.4
|
114
|
+
signing_key:
|
115
|
+
specification_version: 4
|
116
|
+
summary: Tangle implements graphs of things
|
117
|
+
test_files: []
|