topojson-rails 1.4.9 → 1.6.19

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 1a756f816b94e3121b70217ceee339fb68b56a8b
-  data.tar.gz: da60fe15c8aada2034c6f9487f12b8da73468821
+  metadata.gz: 44d60d52b28fb0ae4815e2d6f39daab8b04c7730
+  data.tar.gz: 71589fc54f70d67bbc0d5478f5ab8c1709e4eea0
 SHA512:
-  metadata.gz: 1d9f6a0e1bdfe71e54cf4838a97619e7261c5f71dc9ce7efdd9f6761125d64fff7c5a14a2217d8c9dd74b2a17f47924780f4c3b0a75f8f7458169e35e24839a5
-  data.tar.gz: 71adb53096ac4a3936636eb77c8de2165713cee429111505d75625fab8f0c1a5bd9f1cfde4fe2a79fe7effde2526f99abff511734c59a40b5a036c6fa5e5eeb9
+  metadata.gz: 5d185a217b76fbbb77810e3babb877043a0bb4f05b6bdac9a4fe0fda7059057737adf71c5aaf671148de7b609e555320944f177e069a01cdb3aafeb8c1e7d6fb
+  data.tar.gz: c9f911d89d27f0361f52c9bc420af5da3b7c6413dbcefcb30e37ff4a40fcd7a7f9c9a1f586b8758639bdff66bb22f8b5b0e285ef7567dabf3de2cb3f91b9f55f

data/README.md

@@ -18,17 +18,6 @@ Add the following directive to your JavaScript manifest file (application.js):
 
     //= require topojson
 
-## HighSecurity
-
-To ensure that you're including a gem with original code, you can install this gem using a HighSecurity policy.
-
-    gem cert --add <(curl -Ls https://gist.github.com/bai/5150087/raw/public_cert.pem)
-    bundle install --trust-policy HighSecurity
-
-Or, if you don't use bundler:
-
-    gem install topojson-rails -P HighSecurity
-
 ## Contributing
 
 1. Fork it

data/lib/topojson-rails/version.rb

@@ -1,5 +1,5 @@
 module Topojson
   module Rails
-    VERSION = "1.4.9"
+    VERSION = "1.6.19"
   end
 end

data/topojson-rails.gemspec

@@ -18,8 +18,5 @@ Gem::Specification.new do |gem|
   gem.test_files    = gem.files.grep(%r{^(test|spec|features)/})
   gem.require_paths = ["lib"]
 
-  gem.signing_key   = File.expand_path("~/.gem/private_key.pem") if $0 =~ /gem\z/
-  gem.cert_chain    = ["certs/bai.pem"]
-
   gem.add_dependency "railties", ">= 3.0", "< 5.0"
 end

data/vendor/assets/javascripts/topojson.js

@@ -1,15 +1,29 @@
 !function() {
   var topojson = {
-    version: "1.4.9",
-    mesh: mesh,
+    version: "1.6.19",
+    mesh: function(topology) { return object(topology, meshArcs.apply(this, arguments)); },
+    meshArcs: meshArcs,
+    merge: function(topology) { return object(topology, mergeArcs.apply(this, arguments)); },
+    mergeArcs: mergeArcs,
     feature: featureOrCollection,
     neighbors: neighbors,
     presimplify: presimplify
   };
 
-  function merge(topology, arcs) {
-    var fragmentByStart = {},
-        fragmentByEnd = {};
+  function stitchArcs(topology, arcs) {
+    var stitchedArcs = {},
+        fragmentByStart = {},
+        fragmentByEnd = {},
+        fragments = [],
+        emptyIndex = -1;
+
+    // Stitch empty arcs first, since they may be subsumed by other arcs.
+    arcs.forEach(function(i, j) {
+      var arc = topology.arcs[i < 0 ? ~i : i], t;
+      if (arc.length < 3 && !arc[1][0] && !arc[1][1]) {
+        t = arcs[++emptyIndex], arcs[emptyIndex] = i, arcs[j] = t;
+      }
+    });
 
     arcs.forEach(function(i) {
       var e = ends(i),
@@ -25,11 +39,6 @@
           delete fragmentByStart[g.start];
           var fg = g === f ? f : f.concat(g);
           fragmentByStart[fg.start = f.start] = fragmentByEnd[fg.end = g.end] = fg;
-        } else if (g = fragmentByEnd[end]) {
-          delete fragmentByStart[g.start];
-          delete fragmentByEnd[g.end];
-          var fg = f.concat(g.map(function(i) { return ~i; }).reverse());
-          fragmentByStart[fg.start = f.start] = fragmentByEnd[fg.end = g.start] = fg;
         } else {
           fragmentByStart[f.start] = fragmentByEnd[f.end] = f;
         }
@@ -41,43 +50,6 @@
           delete fragmentByEnd[g.end];
           var gf = g === f ? f : g.concat(f);
           fragmentByStart[gf.start = g.start] = fragmentByEnd[gf.end = f.end] = gf;
-        } else if (g = fragmentByStart[start]) {
-          delete fragmentByStart[g.start];
-          delete fragmentByEnd[g.end];
-          var gf = g.map(function(i) { return ~i; }).reverse().concat(f);
-          fragmentByStart[gf.start = g.end] = fragmentByEnd[gf.end = f.end] = gf;
-        } else {
-          fragmentByStart[f.start] = fragmentByEnd[f.end] = f;
-        }
-      } else if (f = fragmentByStart[start]) {
-        delete fragmentByStart[f.start];
-        f.unshift(~i);
-        f.start = end;
-        if (g = fragmentByEnd[end]) {
-          delete fragmentByEnd[g.end];
-          var gf = g === f ? f : g.concat(f);
-          fragmentByStart[gf.start = g.start] = fragmentByEnd[gf.end = f.end] = gf;
-        } else if (g = fragmentByStart[end]) {
-          delete fragmentByStart[g.start];
-          delete fragmentByEnd[g.end];
-          var gf = g.map(function(i) { return ~i; }).reverse().concat(f);
-          fragmentByStart[gf.start = g.end] = fragmentByEnd[gf.end = f.end] = gf;
-        } else {
-          fragmentByStart[f.start] = fragmentByEnd[f.end] = f;
-        }
-      } else if (f = fragmentByEnd[end]) {
-        delete fragmentByEnd[f.end];
-        f.push(~i);
-        f.end = start;
-        if (g = fragmentByEnd[start]) {
-          delete fragmentByStart[g.start];
-          var fg = g === f ? f : f.concat(g);
-          fragmentByStart[fg.start = f.start] = fragmentByEnd[fg.end = g.end] = fg;
-        } else if (g = fragmentByStart[start]) {
-          delete fragmentByStart[g.start];
-          delete fragmentByEnd[g.end];
-          var fg = f.concat(g.map(function(i) { return ~i; }).reverse());
-          fragmentByStart[fg.start = f.start] = fragmentByEnd[fg.end = g.start] = fg;
         } else {
           fragmentByStart[f.start] = fragmentByEnd[f.end] = f;
         }
@@ -88,17 +60,31 @@
     });
 
     function ends(i) {
-      var arc = topology.arcs[i], p0 = arc[0], p1 = [0, 0];
-      arc.forEach(function(dp) { p1[0] += dp[0], p1[1] += dp[1]; });
-      return [p0, p1];
+      var arc = topology.arcs[i < 0 ? ~i : i], p0 = arc[0], p1;
+      if (topology.transform) p1 = [0, 0], arc.forEach(function(dp) { p1[0] += dp[0], p1[1] += dp[1]; });
+      else p1 = arc[arc.length - 1];
+      return i < 0 ? [p1, p0] : [p0, p1];
     }
 
-    var fragments = [];
-    for (var k in fragmentByEnd) fragments.push(fragmentByEnd[k]);
+    function flush(fragmentByEnd, fragmentByStart) {
+      for (var k in fragmentByEnd) {
+        var f = fragmentByEnd[k];
+        delete fragmentByStart[f.start];
+        delete f.start;
+        delete f.end;
+        f.forEach(function(i) { stitchedArcs[i < 0 ? ~i : i] = 1; });
+        fragments.push(f);
+      }
+    }
+
+    flush(fragmentByEnd, fragmentByStart);
+    flush(fragmentByStart, fragmentByEnd);
+    arcs.forEach(function(i) { if (!stitchedArcs[i < 0 ? ~i : i]) fragments.push([i]); });
+
     return fragments;
   }
 
-  function mesh(topology, o, filter) {
+  function meshArcs(topology, o, filter) {
     var arcs = [];
 
     if (arguments.length > 1) {
@@ -106,8 +92,8 @@
           geom;
 
       function arc(i) {
-        if (i < 0) i = ~i;
-        (geomsByArc[i] || (geomsByArc[i] = [])).push(geom);
+        var j = i < 0 ? ~i : i;
+        (geomsByArc[j] || (geomsByArc[j] = [])).push({i: i, g: geom});
       }
 
       function line(arcs) {
@@ -120,10 +106,7 @@
 
       function geometry(o) {
         if (o.type === "GeometryCollection") o.geometries.forEach(geometry);
-        else if (o.type in geometryType) {
-          geom = o;
-          geometryType[o.type](o.arcs);
-        }
+        else if (o.type in geometryType) geom = o, geometryType[o.type](o.arcs);
       }
 
       var geometryType = {
@@ -136,13 +119,100 @@
       geometry(o);
 
       geomsByArc.forEach(arguments.length < 3
-          ? function(geoms, i) { arcs.push(i); }
-          : function(geoms, i) { if (filter(geoms[0], geoms[geoms.length - 1])) arcs.push(i); });
+          ? function(geoms) { arcs.push(geoms[0].i); }
+          : function(geoms) { if (filter(geoms[0].g, geoms[geoms.length - 1].g)) arcs.push(geoms[0].i); });
     } else {
       for (var i = 0, n = topology.arcs.length; i < n; ++i) arcs.push(i);
     }
 
-    return object(topology, {type: "MultiLineString", arcs: merge(topology, arcs)});
+    return {type: "MultiLineString", arcs: stitchArcs(topology, arcs)};
+  }
+
+  function mergeArcs(topology, objects) {
+    var polygonsByArc = {},
+        polygons = [],
+        components = [];
+
+    objects.forEach(function(o) {
+      if (o.type === "Polygon") register(o.arcs);
+      else if (o.type === "MultiPolygon") o.arcs.forEach(register);
+    });
+
+    function register(polygon) {
+      polygon.forEach(function(ring) {
+        ring.forEach(function(arc) {
+          (polygonsByArc[arc = arc < 0 ? ~arc : arc] || (polygonsByArc[arc] = [])).push(polygon);
+        });
+      });
+      polygons.push(polygon);
+    }
+
+    function exterior(ring) {
+      return cartesianRingArea(object(topology, {type: "Polygon", arcs: [ring]}).coordinates[0]) > 0; // TODO allow spherical?
+    }
+
+    polygons.forEach(function(polygon) {
+      if (!polygon._) {
+        var component = [],
+            neighbors = [polygon];
+        polygon._ = 1;
+        components.push(component);
+        while (polygon = neighbors.pop()) {
+          component.push(polygon);
+          polygon.forEach(function(ring) {
+            ring.forEach(function(arc) {
+              polygonsByArc[arc < 0 ? ~arc : arc].forEach(function(polygon) {
+                if (!polygon._) {
+                  polygon._ = 1;
+                  neighbors.push(polygon);
+                }
+              });
+            });
+          });
+        }
+      }
+    });
+
+    polygons.forEach(function(polygon) {
+      delete polygon._;
+    });
+
+    return {
+      type: "MultiPolygon",
+      arcs: components.map(function(polygons) {
+        var arcs = [];
+
+        // Extract the exterior (unique) arcs.
+        polygons.forEach(function(polygon) {
+          polygon.forEach(function(ring) {
+            ring.forEach(function(arc) {
+              if (polygonsByArc[arc < 0 ? ~arc : arc].length < 2) {
+                arcs.push(arc);
+              }
+            });
+          });
+        });
+
+        // Stitch the arcs into one or more rings.
+        arcs = stitchArcs(topology, arcs);
+
+        // If more than one ring is returned,
+        // at most one of these rings can be the exterior;
+        // this exterior ring has the same winding order
+        // as any exterior ring in the original polygons.
+        if ((n = arcs.length) > 1) {
+          var sgn = exterior(polygons[0][0]);
+          for (var i = 0, t; i < n; ++i) {
+            if (sgn === exterior(arcs[i])) {
+              t = arcs[0], arcs[0] = arcs[i], arcs[i] = t;
+              break;
+            }
+          }
+        }
+
+        return arcs;
+      })
+    };
   }
 
   function featureOrCollection(topology, o) {
@@ -279,16 +349,23 @@
   function presimplify(topology, triangleArea) {
     var absolute = transformAbsolute(topology.transform),
         relative = transformRelative(topology.transform),
-        heap = minHeap(compareArea),
-        maxArea = 0,
-        triangle;
+        heap = minAreaHeap();
 
-    if (!triangleArea) triangleArea = cartesianArea;
+    if (!triangleArea) triangleArea = cartesianTriangleArea;
 
     topology.arcs.forEach(function(arc) {
-      var triangles = [];
-
-      arc.forEach(absolute);
+      var triangles = [],
+          maxArea = 0,
+          triangle;
+
+      // To store each point’s effective area, we create a new array rather than
+      // extending the passed-in point to workaround a Chrome/V8 bug (getting
+      // stuck in smi mode). For midpoints, the initial effective area of
+      // Infinity will be computed in the next step.
+      for (var i = 0, n = arc.length, p; i < n; ++i) {
+        p = arc[i];
+        absolute(arc[i] = [p[0], p[1], Infinity], i);
+      }
 
       for (var i = 1, n = arc.length - 1; i < n; ++i) {
         triangle = arc.slice(i - 1, i + 2);
@@ -297,41 +374,36 @@
         heap.push(triangle);
       }
 
-      // Always keep the arc endpoints!
-      arc[0][2] = arc[n][2] = Infinity;
-
       for (var i = 0, n = triangles.length; i < n; ++i) {
         triangle = triangles[i];
         triangle.previous = triangles[i - 1];
         triangle.next = triangles[i + 1];
       }
-    });
 
-    while (triangle = heap.pop()) {
-      var previous = triangle.previous,
-          next = triangle.next;
-
-      // If the area of the current point is less than that of the previous point
-      // to be eliminated, use the latter's area instead. This ensures that the
-      // current point cannot be eliminated without eliminating previously-
-      // eliminated points.
-      if (triangle[1][2] < maxArea) triangle[1][2] = maxArea;
-      else maxArea = triangle[1][2];
-
-      if (previous) {
-        previous.next = next;
-        previous[2] = triangle[2];
-        update(previous);
-      }
+      while (triangle = heap.pop()) {
+        var previous = triangle.previous,
+            next = triangle.next;
+
+        // If the area of the current point is less than that of the previous point
+        // to be eliminated, use the latter's area instead. This ensures that the
+        // current point cannot be eliminated without eliminating previously-
+        // eliminated points.
+        if (triangle[1][2] < maxArea) triangle[1][2] = maxArea;
+        else maxArea = triangle[1][2];
+
+        if (previous) {
+          previous.next = next;
+          previous[2] = triangle[2];
+          update(previous);
+        }
 
-      if (next) {
-        next.previous = previous;
-        next[0] = triangle[0];
-        update(next);
+        if (next) {
+          next.previous = previous;
+          next[0] = triangle[0];
+          update(next);
+        }
       }
-    }
 
-    topology.arcs.forEach(function(arc) {
       arc.forEach(relative);
     });
 
@@ -344,72 +416,76 @@
     return topology;
   };
 
-  function cartesianArea(triangle) {
-    return Math.abs(
-      (triangle[0][0] - triangle[2][0]) * (triangle[1][1] - triangle[0][1])
-      - (triangle[0][0] - triangle[1][0]) * (triangle[2][1] - triangle[0][1])
-    );
+  function cartesianRingArea(ring) {
+    var i = -1,
+        n = ring.length,
+        a,
+        b = ring[n - 1],
+        area = 0;
+
+    while (++i < n) {
+      a = b;
+      b = ring[i];
+      area += a[0] * b[1] - a[1] * b[0];
+    }
+
+    return area * .5;
+  }
+
+  function cartesianTriangleArea(triangle) {
+    var a = triangle[0], b = triangle[1], c = triangle[2];
+    return Math.abs((a[0] - c[0]) * (b[1] - a[1]) - (a[0] - b[0]) * (c[1] - a[1]));
   }
 
   function compareArea(a, b) {
     return a[1][2] - b[1][2];
   }
 
-  function minHeap(compare) {
+  function minAreaHeap() {
     var heap = {},
-        array = [];
+        array = [],
+        size = 0;
 
-    heap.push = function() {
-      for (var i = 0, n = arguments.length; i < n; ++i) {
-        var object = arguments[i];
-        up(object.index = array.push(object) - 1);
-      }
-      return array.length;
+    heap.push = function(object) {
+      up(array[object._ = size] = object, size++);
+      return size;
     };
 
     heap.pop = function() {
-      var removed = array[0],
-          object = array.pop();
-      if (array.length) {
-        array[object.index = 0] = object;
-        down(0);
-      }
+      if (size <= 0) return;
+      var removed = array[0], object;
+      if (--size > 0) object = array[size], down(array[object._ = 0] = object, 0);
       return removed;
     };
 
     heap.remove = function(removed) {
-      var i = removed.index,
-          object = array.pop();
-      if (i !== array.length) {
-        array[object.index = i] = object;
-        (compare(object, removed) < 0 ? up : down)(i);
-      }
+      var i = removed._, object;
+      if (array[i] !== removed) return; // invalid request
+      if (i !== --size) object = array[size], (compareArea(object, removed) < 0 ? up : down)(array[object._ = i] = object, i);
       return i;
     };
 
-    function up(i) {
-      var object = array[i];
+    function up(object, i) {
       while (i > 0) {
-        var up = ((i + 1) >> 1) - 1,
-            parent = array[up];
-        if (compare(object, parent) >= 0) break;
-        array[parent.index = i] = parent;
-        array[object.index = i = up] = object;
+        var j = ((i + 1) >> 1) - 1,
+            parent = array[j];
+        if (compareArea(object, parent) >= 0) break;
+        array[parent._ = i] = parent;
+        array[object._ = i = j] = object;
       }
     }
 
-    function down(i) {
-      var object = array[i];
+    function down(object, i) {
       while (true) {
-        var right = (i + 1) << 1,
-            left = right - 1,
-            down = i,
-            child = array[down];
-        if (left < array.length && compare(array[left], child) < 0) child = array[down = left];
-        if (right < array.length && compare(array[right], child) < 0) child = array[down = right];
-        if (down === i) break;
-        array[child.index = i] = child;
-        array[object.index = i = down] = object;
+        var r = (i + 1) << 1,
+            l = r - 1,
+            j = i,
+            child = array[j];
+        if (l < size && compareArea(array[l], child) < 0) child = array[j = l];
+        if (r < size && compareArea(array[r], child) < 0) child = array[j = r];
+        if (j === i) break;
+        array[child._ = i] = child;
+        array[object._ = i = j] = object;
       }
     }
 

metadata

@@ -1,35 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: topojson-rails
 version: !ruby/object:Gem::Version
-  version: 1.4.9
+  version: 1.6.19
 platform: ruby
 authors:
 - Vlad Gorodetsky
 autorequire: 
 bindir: bin
-cert_chain:
-- |
-  -----BEGIN CERTIFICATE-----
-  MIIDSDCCAjCgAwIBAgIBATANBgkqhkiG9w0BAQUFADA1MQowCAYDVQQDDAF2MRMw
-  EQYKCZImiZPyLGQBGRYDZ29yMRIwEAYKCZImiZPyLGQBGRYCaW8wHhcNMTMwNTIz
-  MjA0MTI3WhcNMTQwNTIzMjA0MTI3WjA1MQowCAYDVQQDDAF2MRMwEQYKCZImiZPy
-  LGQBGRYDZ29yMRIwEAYKCZImiZPyLGQBGRYCaW8wggEiMA0GCSqGSIb3DQEBAQUA
-  A4IBDwAwggEKAoIBAQCtb8+GfjqcYl6M4IhIGomKsGgWEC4mwTXIq/Yl+jJAdP7s
-  bdV3lWnZybUPKtdHSQIJcxbm8GZspTqSqDgsECI/laTyLj7Srqcbyivf/ov50Tg1
-  CxMtt8STA6wNmY0ljO4SK72Pr8uQwFZIgNHBB9LcvrpmRn/TWDXlcqaq0db6QJKk
-  jGOv74ukiQun+saqthpxwNN6wm0rj1GDulrDuMeeMj/XDgu0piNHhBtsgQ6KrN94
-  cs0XGgwKihL0LdqWiOG9L8tZKeksKk72EcTpvaw1EYUfJ/rAcC8l6SluN2+BDMA0
-  /4LU70O+wTwHcHv2HimtKdlcpS936qOez3lXUD+3AgMBAAGjYzBhMAkGA1UdEwQC
-  MAAwCwYDVR0PBAQDAgSwMB0GA1UdDgQWBBSRvHatldjBIKT5agA2bnkfm4KUxTAT
-  BgNVHREEDDAKgQh2QGdvci5pbzATBgNVHRIEDDAKgQh2QGdvci5pbzANBgkqhkiG
-  9w0BAQUFAAOCAQEAmyGZCL6ISHS6UCkPAie1LZgyc+yS4ckMPtzBJtjODr5kfRTC
-  tLb9W4epJ9Aa2aGkKy/NL8MFS0BwTJmjSfufFDwFZlw0kI9aAvL4Nx9OHWNen9Dm
-  GtEWXXKpB0du12DBjfavJYl0QLcz18M0mtvug634t40H06GussO83uu7wHEvIPBP
-  Z5VMAbKvOmDgaP2I9XxZ2/lDmBKDZkVNqmqYiScw2CWsKxVPx3vhMGprTIz4O8y/
-  JCf887eMZl/8mEIeCLb+gH5sh5yJJpti2HTLnR4Q1QKWR/0T9tASoQPF3kL62n9+
-  m1B90+fEzJsBDQIAsnLPqxjivWbIIfZ7GeGZyA==
-  -----END CERTIFICATE-----
-date: 2014-03-10 00:00:00.000000000 Z
+cert_chain: []
+date: 2015-05-31 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: railties
@@ -63,7 +42,6 @@ files:
 - LICENSE
 - README.md
 - Rakefile
-- certs/bai.pem
 - lib/topojson-rails.rb
 - lib/topojson-rails/version.rb
 - topojson-rails.gemspec
@@ -88,7 +66,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.2.2
+rubygems_version: 2.4.7
 signing_key: 
 specification_version: 4
 summary: Gemified topojson.js asset for Rails

checksums.yaml.gz.sig

@@ -1,3 +0,0 @@
-=Z�D0&�*;6�(�
-�i���H��Z���zǮ���Y|���i���E��<�ɘo�H{�]��釈U�
a`C���^;�){/�vcH[?��@$-���
-r��Im����>`��)�	���6�=ց�`�fj����U���ٴ&�mѱ�J
��8XA�%�1�h.���Q.ܛ� ��
d#\�y

data/certs/bai.pem

@@ -1,20 +0,0 @@
------BEGIN CERTIFICATE-----
-MIIDSDCCAjCgAwIBAgIBATANBgkqhkiG9w0BAQUFADA1MQowCAYDVQQDDAF2MRMw
-EQYKCZImiZPyLGQBGRYDZ29yMRIwEAYKCZImiZPyLGQBGRYCaW8wHhcNMTMwNTIz
-MjA0MTI3WhcNMTQwNTIzMjA0MTI3WjA1MQowCAYDVQQDDAF2MRMwEQYKCZImiZPy
-LGQBGRYDZ29yMRIwEAYKCZImiZPyLGQBGRYCaW8wggEiMA0GCSqGSIb3DQEBAQUA
-A4IBDwAwggEKAoIBAQCtb8+GfjqcYl6M4IhIGomKsGgWEC4mwTXIq/Yl+jJAdP7s
-bdV3lWnZybUPKtdHSQIJcxbm8GZspTqSqDgsECI/laTyLj7Srqcbyivf/ov50Tg1
-CxMtt8STA6wNmY0ljO4SK72Pr8uQwFZIgNHBB9LcvrpmRn/TWDXlcqaq0db6QJKk
-jGOv74ukiQun+saqthpxwNN6wm0rj1GDulrDuMeeMj/XDgu0piNHhBtsgQ6KrN94
-cs0XGgwKihL0LdqWiOG9L8tZKeksKk72EcTpvaw1EYUfJ/rAcC8l6SluN2+BDMA0
-/4LU70O+wTwHcHv2HimtKdlcpS936qOez3lXUD+3AgMBAAGjYzBhMAkGA1UdEwQC
-MAAwCwYDVR0PBAQDAgSwMB0GA1UdDgQWBBSRvHatldjBIKT5agA2bnkfm4KUxTAT
-BgNVHREEDDAKgQh2QGdvci5pbzATBgNVHRIEDDAKgQh2QGdvci5pbzANBgkqhkiG
-9w0BAQUFAAOCAQEAmyGZCL6ISHS6UCkPAie1LZgyc+yS4ckMPtzBJtjODr5kfRTC
-tLb9W4epJ9Aa2aGkKy/NL8MFS0BwTJmjSfufFDwFZlw0kI9aAvL4Nx9OHWNen9Dm
-GtEWXXKpB0du12DBjfavJYl0QLcz18M0mtvug634t40H06GussO83uu7wHEvIPBP
-Z5VMAbKvOmDgaP2I9XxZ2/lDmBKDZkVNqmqYiScw2CWsKxVPx3vhMGprTIz4O8y/
-JCf887eMZl/8mEIeCLb+gH5sh5yJJpti2HTLnR4Q1QKWR/0T9tASoQPF3kL62n9+
-m1B90+fEzJsBDQIAsnLPqxjivWbIIfZ7GeGZyA==
------END CERTIFICATE-----