cmap 0.5.0 → 0.6.0

Sign up to get free protection for your applications and to get access to all the features.
checksums.yaml CHANGED
@@ -1,7 +1,7 @@
1
1
  ---
2
2
  SHA1:
3
- metadata.gz: 260c10743062b043941c9cb50d306107fe4a7d0a
4
- data.tar.gz: e51eb88311d3af6e68564dd1e99c01fe941fb80b
3
+ metadata.gz: b97c0001cc30dced67bb07ddbbf4f582bfd8ec55
4
+ data.tar.gz: 1c4fab2a08df36492456fb29a872cf48a58391ef
5
5
  SHA512:
6
- metadata.gz: 1da1e5e4b8f95d7c64dcb9cec10c2e054a851027074a197d6fedaec33f41e05b2bf4cf5d03a34d2ca1de6050c4031b6e1a7a95e969dbb095010a33e2aa0259e1
7
- data.tar.gz: a697dcc4d94b53ee96ee893c266316c3cf6f695e8fd173f7e02066584fed26519b6e53024897eb4a4edfee19d1893744f14fddffcc68108089bbe03025584c9c
6
+ metadata.gz: b3865947b50c8ee10037695f2b09e60f0035ac0365c2bf6b0b37817a08bee9eec727cb340d26ca6bf60bbfcad7edb4a9f30dfd23585ad43c1043a982b48311b4
7
+ data.tar.gz: 3b534334f3eb152c84df5380635015d04c9137a64156ac798661af18b0493e4b6a916cf6288dbb7889eb9cdeff5a8a1679e915b1cc7853c0a29248b7b1cfe17b
@@ -35,7 +35,9 @@ module Cmap; class EdgesToQueries
35
35
  end
36
36
 
37
37
  def updates
38
- u = (grouped_edges[false] || []).map {|e| "#{e.destination_vertex.data[:sanitized_name]}=(#{e.data[:sanitized_value]})::int"}.join(", ")
38
+ u = (grouped_edges[false] || []).map do |e|
39
+ "#{e.destination_vertex.data[:sanitized_name]}=(#{e.data[:sanitized_value]})::int"
40
+ end.join(", ")
39
41
  return [] if u.empty?
40
42
  ["update #{schema_name}.#{table_name} set #{u};"]
41
43
  end
@@ -6,6 +6,7 @@ module Cmap; class SanitizeGraph
6
6
 
7
7
  def sanitize
8
8
  sanitize_vertices
9
+ set_sanitized_value_in_edges
9
10
  sanitize_edges
10
11
  @graph
11
12
  end
@@ -16,6 +17,12 @@ module Cmap; class SanitizeGraph
16
17
  @graph.vertices.each { |v| v.data[:sanitized_name] = sanitize_string(v.data[:name]) }
17
18
  end
18
19
 
20
+ def set_sanitized_value_in_edges
21
+ @graph.edges.each do |edge|
22
+ edge.data[:sanitized_value] = edge.data[:value]
23
+ end
24
+ end
25
+
19
26
  def ordered_vertices
20
27
  # HACK: this sorting makes the assumption vertices lower in the graph have longer ids
21
28
  @ordered_vertices ||= @graph.vertices.sort do |a, b|
@@ -29,7 +36,7 @@ module Cmap; class SanitizeGraph
29
36
 
30
37
  def sanitize_edge(edge)
31
38
  ordered_vertices.each do |v|
32
- edge.data[:sanitized_value] = edge.data[:value].gsub(v.data[:name], v.data[:sanitized_name])
39
+ edge.data[:sanitized_value] = edge.data[:sanitized_value].gsub(v.data[:name], v.data[:sanitized_name])
33
40
  end
34
41
  end
35
42
 
@@ -39,4 +46,4 @@ module Cmap; class SanitizeGraph
39
46
  string.gsub(/[^0-9a-zA-Z]+/, '_').downcase
40
47
  end
41
48
 
42
- end; end
49
+ end; end
data/lib/cmap/version.rb CHANGED
@@ -1,3 +1,3 @@
1
1
  module Cmap
2
- VERSION = "0.5.0"
2
+ VERSION = "0.6.0"
3
3
  end
metadata CHANGED
@@ -1,14 +1,14 @@
1
1
  --- !ruby/object:Gem::Specification
2
2
  name: cmap
3
3
  version: !ruby/object:Gem::Version
4
- version: 0.5.0
4
+ version: 0.6.0
5
5
  platform: ruby
6
6
  authors:
7
7
  - MrPowers
8
8
  autorequire:
9
9
  bindir: exe
10
10
  cert_chain: []
11
- date: 2016-01-05 00:00:00.000000000 Z
11
+ date: 2016-01-06 00:00:00.000000000 Z
12
12
  dependencies:
13
13
  - !ruby/object:Gem::Dependency
14
14
  name: bundler