Huge News!Announcing our $40M Series B led by Abstract Ventures.Learn More
Socket
Sign inDemoInstall
Socket

rdf-canonize

Package Overview
Dependencies
Maintainers
4
Versions
26
Alerts
File Explorer

Advanced tools

Socket logo

Install Socket

Detect and block malicious and high-risk dependencies

Install

rdf-canonize - npm Package Compare versions

Comparing version 1.0.1 to 1.0.2

10

CHANGELOG.md
# rdf-canonize ChangeLog
## 1.0.2 - 2019-02-21
### Fixed
- Fix triple comparator in n-quads parser.
### Added
- Add eslint support.
## 1.0.1 - 2019-01-23

@@ -74,3 +82,3 @@

### Fixed
- Avoid variable length arrays. Not supported by some C++ compilers.
- Avoid variable length arrays. Not supported by some C++ compilers.

@@ -77,0 +85,0 @@ ## 0.2.2 - 2017-12-04

4

dist/node6/lib/IdentifierIssuer.js

@@ -65,4 +65,4 @@ /*

*
* @return true if the old identifier has been assigned a new identifier, false
* if not.
* @return true if the old identifier has been assigned a new identifier,
* false if not.
*/

@@ -69,0 +69,0 @@

@@ -329,3 +329,3 @@ /*

if (t1.termType !== 'Literal') {
if (t1.object.termType !== 'Literal') {
return true;

@@ -332,0 +332,0 @@ }

@@ -19,5 +19,5 @@ /*

const POSITIONS = {
'subject': 's',
'object': 'o',
'graph': 'g'
subject: 's',
object: 'o',
graph: 'g'
};

@@ -183,3 +183,3 @@ module.exports = class URDNA2015 extends AsyncAlgorithm {

// issuer and existing identifier.
for (let existing in result.issuer.existing) {
for (const existing in result.issuer.existing) {
self.canonicalIssuer.getId(existing);

@@ -458,3 +458,3 @@ }

hash: md.digest(),
issuer: issuer
issuer
});

@@ -528,3 +528,3 @@ });

forEachComponent(quad, op) {
for (let key in quad) {
for (const key in quad) {
// skip `predicate`

@@ -531,0 +531,0 @@ if (key === 'predicate') {

@@ -17,5 +17,5 @@ /*

const POSITIONS = {
'subject': 's',
'object': 'o',
'graph': 'g'
subject: 's',
object: 'o',
graph: 'g'
};

@@ -76,3 +76,3 @@ module.exports = class URDNA2015Sync {

for (let id in nonNormalized) {
for (const id in nonNormalized) {
// 5.3.1) Create a hash, hash, according to the Hash First Degree

@@ -167,3 +167,3 @@ // Quads algorithm.

for (let existing in result.issuer.existing) {
for (const existing in result.issuer.existing) {
self.canonicalIssuer.getId(existing);

@@ -407,3 +407,3 @@ }

hash: md.digest(),
issuer: issuer
issuer
};

@@ -444,3 +444,3 @@ } // helper for modifying component during Hash First Degree Quads

for (let key in quad) {
for (const key in quad) {
const component = quad[key];

@@ -476,3 +476,3 @@

forEachComponent(quad, op) {
for (let key in quad) {
for (const key in quad) {
// skip `predicate`

@@ -479,0 +479,0 @@ if (key === 'predicate') {

@@ -50,3 +50,3 @@ /*

for (let key in value) {
for (const key in value) {
rval[key] = api.clone(value[key]);

@@ -53,0 +53,0 @@ }

@@ -65,4 +65,4 @@ /*

*
* @return true if the old identifier has been assigned a new identifier, false
* if not.
* @return true if the old identifier has been assigned a new identifier,
* false if not.
*/

@@ -69,0 +69,0 @@ hasId(old) {

@@ -68,3 +68,3 @@ /**

return rdfCanonizeNative;
}
};

@@ -71,0 +71,0 @@ /**

@@ -327,3 +327,3 @@ /*

}
if(t1.termType !== 'Literal') {
if(t1.object.termType !== 'Literal') {
return true;

@@ -330,0 +330,0 @@ }

@@ -13,3 +13,3 @@ /*

const POSITIONS = {'subject': 's', 'object': 'o', 'graph': 'g'};
const POSITIONS = {subject: 's', object: 'o', graph: 'g'};

@@ -190,3 +190,3 @@ module.exports = class URDNA2015 extends AsyncAlgorithm {

// issuer and existing identifier.
for(let existing in result.issuer.existing) {
for(const existing in result.issuer.existing) {
self.canonicalIssuer.getId(existing);

@@ -488,3 +488,3 @@ }

// through the hash algorithm.
callback(err, {hash: md.digest(), issuer: issuer});
callback(err, {hash: md.digest(), issuer});
});

@@ -558,3 +558,3 @@ }

forEachComponent(quad, op) {
for(let key in quad) {
for(const key in quad) {
// skip `predicate`

@@ -561,0 +561,0 @@ if(key === 'predicate') {

@@ -12,3 +12,3 @@ /*

const POSITIONS = {'subject': 's', 'object': 'o', 'graph': 'g'};
const POSITIONS = {subject: 's', object: 'o', graph: 'g'};

@@ -72,3 +72,3 @@ module.exports = class URDNA2015Sync {

// identifiers:
for(let id in nonNormalized) {
for(const id in nonNormalized) {
// 5.3.1) Create a hash, hash, according to the Hash First Degree

@@ -164,3 +164,3 @@ // Quads algorithm.

const result = hashPathList[j];
for(let existing in result.issuer.existing) {
for(const existing in result.issuer.existing) {
self.canonicalIssuer.getId(existing);

@@ -418,3 +418,3 @@ }

// through the hash algorithm.
return {hash: md.digest(), issuer: issuer};
return {hash: md.digest(), issuer};
}

@@ -455,3 +455,3 @@

const quad = quads[i];
for(let key in quad) {
for(const key in quad) {
const component = quad[key];

@@ -487,3 +487,3 @@ if(key === 'predicate' ||

forEachComponent(quad, op) {
for(let key in quad) {
for(const key in quad) {
// skip `predicate`

@@ -490,0 +490,0 @@ if(key === 'predicate') {

@@ -46,3 +46,3 @@ /*

rval = {};
for(let key in value) {
for(const key in value) {
rval[key] = api.clone(value[key]);

@@ -49,0 +49,0 @@ }

{
"name": "rdf-canonize",
"version": "1.0.1",
"version": "1.0.2",
"description": "An implementation of the RDF Dataset Normalization Algorithm in JavaScript",

@@ -47,2 +47,4 @@ "homepage": "https://github.com/digitalbazaar/rdf-canonize",

"core-js": "^2.6.3",
"eslint": "^5.14.1",
"eslint-config-digitalbazaar": "^1.6.0",
"mocha": "^5.2.0",

@@ -74,3 +76,4 @@ "nyc": "^13.1.0",

"coverage": "rm -rf coverage && nyc --reporter=lcov --reporter=text-summary npm test",
"coverage-report": "nyc report"
"coverage-report": "nyc report",
"lint": "eslint '*.js' 'lib/*.js' 'test/*.js' 'benchmark/*.js'"
},

@@ -77,0 +80,0 @@ "browser": {

Sorry, the diff of this file is too big to display

Sorry, the diff of this file is too big to display

SocketSocket SOC 2 Logo

Product

  • Package Alerts
  • Integrations
  • Docs
  • Pricing
  • FAQ
  • Roadmap
  • Changelog

Packages

npm

Stay in touch

Get open source security insights delivered straight into your inbox.


  • Terms
  • Privacy
  • Security

Made with ⚡️ by Socket Inc